scispace - formally typeset
Search or ask a question
Institution

École Polytechnique Fédérale de Lausanne

FacilityLausanne, Switzerland
About: École Polytechnique Fédérale de Lausanne is a facility organization based out in Lausanne, Switzerland. It is known for research contribution in the topics: Population & Catalysis. The organization has 44041 authors who have published 98296 publications receiving 4372092 citations. The organization is also known as: EPFL & ETHL.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, the self-consistency of inflation in the Standard Model was analyzed and the authors determined the domain of energies in which this model represents a valid effective field theory as a function of the background Higgs field.
Abstract: We analyse the self-consistency of inflation in the Standard Model, where the Higgs field has a large non-minimal coupling to gravity. We determine the domain of energies in which this model represents a valid effective field theory as a function of the background Higgs field. This domain is bounded above by the cutoff scale which is found to be higher than the relevant dynamical scales throughout the whole history of the Universe, including the inflationary epoch and reheating. We present a systematic scheme to take into account quantum loop corrections to the inflationary calculations within the framework of effective field theory. We discuss the additional assumptions that must be satisfied by the ultra-violet completion of the theory to allow connection between the parameters of the inflationary effective theory and those describing the low-energy physics relevant for the collider experiments. A class of generalisations of inflationary theories with similar properties is constructed.

588 citations

Journal ArticleDOI
TL;DR: It is shown that in order to achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched in a probabilistic sense, which leads to a result on optimal single-source broadcast communication.
Abstract: What makes a source-channel communication system optimal? It is shown that in order to achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distribution, the distortion measure, the channel conditional distribution, and the channel input cost function. Closed-form necessary and sufficient expressions relating the above entities are given. This generalizes both the separation-based approach as well as the two well-known examples of optimal uncoded communication. The condition of probabilistic matching is extended to certain nonergodic and multiuser scenarios. This leads to a result on optimal single-source broadcast communication.

588 citations

Journal ArticleDOI
TL;DR: A machine-learning model, based on a local description of chemical environments and Bayesian statistical learning, provides a unified framework to predict atomic-scale properties and captures the quantum mechanical effects governing the complex surface reconstructions of silicon.
Abstract: Determining the stability of molecules and condensed phases is the cornerstone of atomistic modeling, underpinning our understanding of chemical and materials properties and transformations We show that a machine-learning model, based on a local description of chemical environments and Bayesian statistical learning, provides a unified framework to predict atomic-scale properties It captures the quantum mechanical effects governing the complex surface reconstructions of silicon, predicts the stability of different classes of molecules with chemical accuracy, and distinguishes active and inactive protein ligands with more than 99% reliability The universality and the systematic nature of our framework provide new insight into the potential energy surface of materials and molecules

587 citations

Journal ArticleDOI
TL;DR: In this paper, a 2D cellular automata (CA) technique is proposed for the simulation of dendritic grain formation during solidification, which takes into account the heterogeneous nucleation, the growth kinetics and the preferential growth directions of the dendrites.
Abstract: A new algorithm based upon a 2-dimensional Cellular Automaton (CA) technique is proposed for the simulation of dendritic grain formation during solidification. The CA model takes into account the heterogeneous nucleation, the growth kinetics and the preferential growth directions of the dendrites. This new CA algorithm, which applies to non-uniform temperature situations, is fully coupled to an enthalpybased Finite Element (FE) heat flow calculation. At each time-step, the temperature at the cell locations is interpolated from those at the FE nodal points in order to calculate the nucleation-growth of grains. The latent heat released by the cells and calculated using a Scheil-type approximation is fed back into the FE nodal points. The coupled CA-FE model is applied to two solidification experiments, the Bridgman growth of an organic alloy and the one-dimensional solidification of an Al-7wt% Si alloy. In the first case, the predicted boundaries between grains are in good agreement with experiment, providing the CA cell size is of the order of the dendrite spacing. For the second experiment, the quality of the coupled CA-FE model is assessed based upon grain structures and cooling curves. The columnar-to-equiaxed transition and the occurrence of a recalescence are shown to be in good agreement with the model.

587 citations

Journal ArticleDOI
TL;DR: Given sufficient data sparsity and base signal‐to‐noise ratio (SNR), CS is demonstrated to result in improved temporal fidelity compared to k‐t BLAST reconstructions for the example data sets used in this work.
Abstract: Recent theoretical advances in the field of compressive sampling-also referred to as compressed sensing (CS)-hold considerable promise for practical applications in MRI, but the fundamental condition of sparsity required in the CS framework is usually not fulfilled in MR images. However, in dynamic imaging, data sparsity can readily be introduced by applying the Fourier transformation along the temporal dimension assuming that only parts of the field-of-view (FOV) change at a high temporal rate while other parts remain stationary or change slowly. The second condition for CS, random sampling, can easily be realized by randomly skipping phase-encoding lines in each dynamic frame. In this work, the feasibility of the CS framework for accelerated dynamic MRI is assessed. Simulated datasets are used to compare the reconstruction results for different reduction factors, noise, and sparsity levels. In vivo cardiac cine data and Fourier-encoded velocity data of the carotid artery are used to test the reconstruction performance relative to k-t broad-use linear acquisition speed-up technique (k-t BLAST) reconstructions. Given sufficient data sparsity and base signal-to-noise ratio (SNR), CS is demonstrated to result in improved temporal fidelity compared to k-t BLAST reconstructions for the example data sets used in this work.

587 citations


Authors

Showing all 44420 results

NameH-indexPapersCitations
Michael Grätzel2481423303599
Ruedi Aebersold182879141881
Eliezer Masliah170982127818
Richard H. Friend1691182140032
G. A. Cowan1592353172594
Ian A. Wilson15897198221
Johan Auwerx15865395779
Menachem Elimelech15754795285
A. Artamonov1501858119791
Melody A. Swartz1481304103753
Henry J. Snaith146511123155
Kurt Wüthrich143739103253
Richard S. J. Frackowiak142309100726
Jean-Paul Kneib13880589287
Kevin J. Tracey13856182791
Network Information
Related Institutions (5)
ETH Zurich
122.4K papers, 5.1M citations

98% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

96% related

Georgia Institute of Technology
119K papers, 4.6M citations

96% related

Centre national de la recherche scientifique
382.4K papers, 13.6M citations

96% related

University of Illinois at Urbana–Champaign
225.1K papers, 10.1M citations

94% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023234
2022704
20215,247
20205,644
20195,432
20185,094