Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOne Law To Rule Them All: The Radial Acceleration Relation of Galaxies
99
0
0.0
(
0
)
Authors
Federico Lelli
Ask ChatGPT about the research
No Arabic abstract
We study the link between baryons and dark matter in 240 galaxies with spatially resolved kinematic data. Our sample spans 9 dex in stellar mass and includes all morphological types. We consider (i) 153 late-type galaxies (LTGs; spirals and irregulars) with gas rotation curves from the SPARC database; (ii) 25 early-type galaxies (ETGs; ellipticals and lenticulars) with stellar and HI data from ATLAS^3D or X-ray data from Chandra; and (iii) 62 dwarf spheroidals (dSphs) with individual-star spectroscopy. We find that LTGs, ETGs, and classical dSphs follow the same radial acceleration relation: the observed acceleration (gobs) correlates with that expected from the distribution of baryons (gbar) over 4 dex. The relation coincides with the 1:1 line (no dark matter) at high accelerations but systematically deviates from unity below a critical scale of ~10^-10 m/s^2. The observed scatter is remarkably small (<0.13 dex) and largely driven by observational uncertainties. The residuals do not correlate with any global or local galaxy property (baryonic mass, gas fraction, radius, etc.). The radial acceleration relation is tantamount to a Natural Law: when the baryonic contribution is measured, the rotation curve follows, and vice versa. Including ultrafaint dSphs, the relation may extend by another 2 dex and possibly flatten at gbar<10^-12 m/s^2, but these data are significantly more uncertain. The radial acceleration relation subsumes and generalizes several well-known dynamical properties of galaxies, like the Tully-Fisher and Faber-Jackson relations, the baryon-halo conspiracies, and Renzos rule.
rate research
Read More
Speech-to-text alignment is a critical component of neural textto-speech (TTS) models. Autoregressive TTS models typically use an attention mechanism to learn these alignments on-line. However, these alignments tend to be brittle and often fail to generalize to long utterances and out-of-domain text, leading to missing or repeating words. Most non-autoregressive endto-end TTS models rely on durations extracted from external sources. In this paper we leverage the alignment mechanism proposed in RAD-TTS as a generic alignment learning framework, easily applicable to a variety of neural TTS models. The framework combines forward-sum algorithm, the Viterbi algorithm, and a simple and efficient static prior. In our experiments, the alignment learning framework improves all tested TTS architectures, both autoregressive (Flowtron, Tacotron 2) and non-autoregressive (FastPitch, FastSpeech 2, RAD-TTS). Specifically, it improves alignment convergence speed of existing attention-based mechanisms, simplifies the training pipeline, and makes the models more robust to errors on long utterances. Most importantly, the framework improves the perceived speech synthesis quality, as judged by human evaluators.
Neural network quantization methods often involve simulating the quantization process during training, making the trained model highly dependent on the target bit-width and precise way quantization is performed. Robust quantization offers an alternative approach with improved tolerance to different classes of data-types and quantization policies. It opens up new exciting applications where the quantization process is not static and can vary to meet different circumstances and implementations. To address this issue, we propose a method that provides intrinsic robustness to the model against a broad range of quantization processes. Our method is motivated by theoretical arguments and enables us to store a single generic model capable of operating at various bit-widths and quantization policies. We validate our methods effectiveness on different ImageNet models.
Galaxies follow a tight radial acceleration relation (RAR): the acceleration observed at every radius correlates with that expected from the distribution of baryons. We use the Markov Chain Monte Carlo method to fit the mean RAR to 175 individual galaxies in the SPARC database, marginalizing over stellar mass-to-light ratio ($Upsilon_{star}$), galaxy distance, and disk inclination. Acceptable fits with astrophysically reasonable parameters are found for the vast majority of galaxies. The residuals around these fits have an rms scatter of only 0.057 dex ($sim$13$%$). This is in agreement with the predictions of modified Newtonian dynamics (MOND). We further consider a generalized version of the RAR that, unlike MOND, permits galaxy-to-galaxy variation in the critical acceleration scale. The fits are not improved with this additional freedom: there is no credible indication of variation in the critical acceleration scale. The data are consistent with the action of a single effective force law. The apparent universality of the acceleration scale and the small residual scatter are key to understanding galaxies.
Li-ion batteries gradually lose their capacity with time and use; therefore, ageing forecasts are key to designs of battery powered systems. So far, cell-type-specific studies without standardised testing practices have lead to a variety of ageing models in which generality, simplicity, and accuracy seem exclusive. Previous studies hint to an interplay of multiple mechanisms leading to capacity loss, which depend on cell chemistry and are affected by temperature, state of charge, and cycling rate. Here we show that, despite this complexity, the time dependence of the actual capacity follows a unique master curve, for several cell types aged under various different conditions. We discuss the statistical origin of this common behaviour, and the testing practice required for the characterisation of a model. The master curve is a stretched exponential that describes many other phenomena in nature and is theoretically justified within a diffusion-to-traps depletion model. These findings provide a simple and broadly applicable framework for accurate life-time predictions.
This work focuses on the reconstruction of sparse signals from their 1-bit measurements. The context is the one of 1-bit compressive sensing where the measurements amount to quantizing (dithered) random projections. Our main contribution shows that, in addition to the measurement process, we can additionally reconstruct the signal with a binarization of the sensing matrix. This binary representation of both the measurements and sensing matrix can dramatically simplify the hardware architecture on embedded systems, enabling cheaper and more power efficient alternatives. Within this framework, given a sensing matrix respecting the restricted isometry property (RIP), we prove that for any sparse signal the quantized projected back-projection (QPBP) algorithm achieves a reconstruction error decaying like O(m-1/2)when the number of measurements m increases. Simulations highlight the practicality of the developed scheme for different sensing scenarios, including random partial Fourier sensing.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
