检索结果-内蒙古大学图书馆

Constraining f(R) models with cosmic chronometers and the HII galaxy Hubble diagram

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Sultana, Joseph Yennapureddy, Manoj K. Melia, Fulvio Kazanas, Demosthenes Department of Mathematics Faculty of Science University of Malta MSD Msida2080 Malta Department of Physics The University of Arizona TucsonAZ85721 United States Department of Physics The Applied Math Program Department of Astronomy The University of Arizona TucsonAZ85721 United States Astrophysics Science Division NASA/Goddard Space Flight Center GreenbeltMD20771 United States

We consider several well-known f(R) cosmological models and constrain their parameters, namely the deviation parameter b and the cosmological parameters Ωm and h. We first obtain analytical approximations for the Hubble rate H(z) and the luminosity distance dL(z) in terms of these parameters, and then test these against the observational expansion rate derived from cosmic chronometers and the distance modulus in the HII galaxy Hubble diagram, obtained in a model-independent way using Gaussian Processes (GP). We first optimize the models based solely on the cosmic chronometers and then repeat this process with a joint analysis using both the cosmic chronometers and HII galaxies. Copyright © 2022, The Authors. All rights reserved.

关键词： Chronometers

Computational Design of Anisotropic Stealthy Hyperuniform Composites with Engineered Directional Scattering Properties

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shi, Wenlong Keeney, David Chen, Duyu Jiao, Yang Torquato, Salvatore Materials Science and Engineering Arizona State University TempeAZ85287 United States Materials Research Laboratory University of California Santa BarbaraCA93106 United States Department of Physics Arizona State University TempeAZ85287 United States Department of Chemistry Princeton University PrincetonNJ08544 United States Department of Physics Princeton University PrincetonNJ08544 United States Princeton Institute of Materials Princeton University PrincetonNJ08544 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

Disordered hyperuniform materials are an emerging class of exotic amorphous states of matter that endow them with singular physical properties, including large isotropic photonic band gaps, superior resistance to fracture, and nearly optimal electrical and thermal transport properties, to name but a few. Here, we generalize the Fourier-space based numerical construction procedure for designing and generating digital realizations of isotropic disordered hyperuniform two-phase heterogeneous materials (i.e., composites) developed by Chen and Torquato [Acta Mater. 142, 152 (2018)] to anisotropic microstructures with targeted spectral densities. Our generalized construction procedure explicitly incorporates the vector-dependent spectral density function χ˜V (k) of arbitrary form that is realizable. We demonstrate the utility of the procedure by generating a wide spectrum of anisotropic stealthy hyperuniform (SHU) microstructures with χ˜V (k) = 0 for k ∈ Ω, i.e., complete suppression of scattering in an "exclusion" region Ω around the origin in the Fourier space. We show how different exclusion-region shapes with various discrete symmetries, including circular-disk, elliptical-disk, square, rectangular, butterfly-shaped and lemniscate-shaped regions of varying size, affect the resulting statistically anisotropic microstructures as a function of the and phase volume fraction. The latter two cases of Ω lead to directionally hyperuniform composites, which are stealthy hyperuniform only along certain directions, and are non-hyperuniform along others. We find that, while the circular-disk exclusion regions give rise to isotropic hyperuniform composite microstructures, the directional hyperuniform behaviors imposed by the shape asymmetry (or anisotropy) of certain exclusion regions give rise to distinct anisotropic structures and degree of uniformity in the distribution of the phases on intermediate and large length scales along different directions. Moreover, while the anisotr

关键词： Volume fraction

Nuclear Neural Networks: Emulating Late Burning Stages in Core Collapse Supernova Progenitors

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Grichener, Aldana Renzo, Mathieu Kerzendorf, Wolfgang E. Farmer, Rob de Mink, Selma E. Bellinger, Earl Patrick Chan, Chi-Kwan Chen, Nutan Farag, Ebraheem Justham, Stephen Steward Steward Observatory Department of Astronomy University of Arizona 933 North Cherry Avenue TucsonAZ85721 United States Max Planck Institute for Astrophysics Karl-Schwarzschild-Str. 1 Garching85748 Germany Department of Physics Technion Haifa3200003 Israel Department of Computational Mathematics Science and Engineering Michigan State University East LansingMI48824 United States Department of Physics and Astronomy Michigan State University East LansingMI48824 United States Ludwig-Maximilians-Universitat Munchen Geschwister-Scholl-Platz 1 Munchen80539 Germany Department of Astronomy Yale University New HavenCT06511 United States Steward Observatory Department of Astronomy University of Arizona 933 North Cherry Avenue TucsonAZ85721 United States Data Science Institute University of Arizona 1230 N. Cherry Avenue TucsonAZ85721 United States Program in Applied Mathematics University of Arizona 617 North Santa Rita TucsonAZ85721 United States Machine Learning Research Lab Volkswagen AG Munich38440 Germany

One of the main challenges in modeling massive stars to the onset of core collapse is the computational bottleneck of nucleosynthesis during advanced burning stages. The number of isotopes formed requires solving a large set of fully-coupled stiff ordinary differential equations (ODEs), making the simulations computationally intensive and prone to numerical instability. To overcome this barrier, we design a nuclear neural network (NNN) framework with multiple hidden layers to emulate nucleosynthesis calculations and conduct a proof-of-concept to evaluate its performance. The NNN takes the temperature, density and composition of a burning region as input and predicts the resulting isotopic abundances along with the energy generation and loss rates. We generate training sets for initial conditions corresponding to oxygen core depletion and beyond using large nuclear reaction networks, and compare the predictions of the NNNs to results from a commonly used small net. We find that the NNNs improve the accuracy of the electron fraction by 280 − 660 % and the nuclear energy generation by 250 − 750 %, consistently outperforming the small network across all timesteps. They also achieve significantly better predictions of neutrino losses on relatively short timescales, with improvements ranging from 100 − 106 %. While further work is needed to enhance their accuracy and applicability to different stellar conditions, integrating NNN trained models into stellar evolution codes is promising for facilitating large-scale generation of core-collapse supernova (CCSN) progenitors with higher physical fidelity. © 2025, CC BY.

关键词： Nucleosynthesis

C2-GaMe: Classification of Cluster Galaxy Membership with Machine Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Farid, Daniel Aung, Han Nagai, Daisuke Farahi, Arya Rozo, Eduardo Program in Applied Mathematics Yale University New HavenCT06511 United States Department of Physics Yale University New HavenCT06520 United States Department of Statistics and Data Science The University of Texas AustinTX78712 United States Department of Physics University of Arizona TucsonAZ85721 United States

We present Classification of Cluster Galaxy Members (C2-GaMe), a classification algorithm based on a suite of machine learning models that differentiates galaxies into orbiting, infalling, and background (interloper) populations, using phase space information as input. We train and test C2-GaMe with the galaxies from UniverseMachine mock catalog based on Multi-Dark Planck 2 N-body simulations. We show that probabilistic classification is superior to deterministic classification in estimating the physical properties of clusters, including density profiles and velocity dispersion. We propose a set of estimators to get an unbiased estimation of cluster properties. We demonstrate that C2-GaMe can recover the distribution of orbiting and infalling galaxies' position and velocity distribution with Copyright © 2022, The Authors. All rights reserved.

关键词： Galaxies

Physics-informed machine learning of the Lagrangian dynamics of velocity gradient tensor

学校读者我要写书评

暂无评论

Physical Review Fluids 2021年第9期6卷 094607-094607页

作者： Yifeng Tian Daniel Livescu Michael Chertkov Computational Physics and Methods Group Computer Computational and Statistical Sciences Division (CCS-2) Los Alamos National Laboratory Los Alamos 87545 NM United States Program in Applied Mathematics University of Arizona Tucson 85721 AZ United States

Reduced models describing the Lagrangian dynamics of the velocity gradient tensor (VGT) in homogeneous isotropic turbulence (HIT) are developed under the physics-informed machine learning (PIML) framework. We consider the VGT at both Kolmogorov scale and coarse-grained scale within the inertial range of HIT. Building reduced models requires resolving the pressure Hessian and subfilter contributions, which is accomplished by constructing them using the integrity bases and invariants of the VGT. The developed models can be expressed using the extended tensor basis neural network (TBNN) introduced by Ling et al. [J. Fluid Mech. 807, 155 (2016)]. Physical constraints, such as Galilean invariance, rotational invariance, and incompressibility condition, are thus embedded in the models explicitly. Our PIML models are trained on the Lagrangian data from a high-Reynolds number direct numerical simulation (DNS). To validate the results, we perform a comprehensive out-of-sample test. We observe that the PIML model provides an improved representation for the magnitude and orientation of the small-scale pressure Hessian contributions. Statistics of the flow, as indicated by the joint PDF of second and third invariants of the VGT, show good agreement with the “ground-truth” DNS data. A number of other important features describing the structure of HIT are reproduced by the model successfully. We have also identified challenges in modeling inertial range dynamics, which indicates that a richer modeling strategy is required. This helps us identify important directions for future research, in particular towards including inertial range geometry into the TBNN.

关键词： Turbulence Artificial neural networks Navier-Stokes equation

Prediction and Prevention of Pandemics via Graphical Model Inference and Convex programming

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Krechetov, Mikhail Sikaroudi, Amir Mohammad Esmaieeli Efrat, Alon Polishchuk, Valentin Chertkov, Michael Skolkovo Institute of Science and Technology Moscow121205 Russia University of Arizona Department of Computer Science TucsonAZ85721 United States University of Arizona Program in Applied Mathematics TucsonAZ85721 United States Linköping Univeristy Communications and Transport Systems Norrkoping60174 Sweden University of Arizona Department of Mathematics TucsonAZ85721 United States

Hard-to-predict bursts of COVID-19 pandemic revealed significance of statistical modeling which would resolve spatio-temporal correlations over geographical areas, for example spread of the infection over a city with census tract granularity. In this manuscript, we provide algorithmic answers to the following two inter-related public health challenges of immense social impact which have not been adequately addressed (1) Inference Challenge: assuming that there are N census blocks (nodes) in the city, and given an initial infection at any set of nodes, e.g. any N of possible single node infections, any N(N-1)=2 of possible two node infections, etc, what is the probability for a subset of census blocks to become infected by the time the spread of the infection burst is stabilized? (2) Prevention Challenge: What is the minimal control action one can take to minimize the infected part of the stabilized state footprint? To answer the challenges, we build a Graphical Model of pandemic of the attractive Ising (pair-wise, binary) type, where each node represents a census tract and each edge factor represents the strength of the pairwise interaction between a pair of nodes, e.g. representing the inter-node travel, road closure and related, and each local bias/field represents the community level of immunization, acceptance of the social distance and mask wearing practice, etc. Resolving the Inference Challenge requires finding the Maximum-A-Posteriory (MAP), i.e. most probable, state of the Ising Model constrained to the set of initially infected nodes. (An infected node is in the +1 state and a node which remained safe is in the-1 state.) We show that almost all attractive Ising Models on dense graphs result in either of the two possibilities (modes) for the MAP state: either all nodes which were not infected initially became infected, or all the initially uninfected nodes remain uninfected (susceptible). This bi-modal solution of the Inference Challenge allows us to re-sta

关键词： Ising model

Aedes-AI: Neural network models of mosquito abundance

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Kinney, Adrienne C. Current, Sean Lega, Joceline Interdisciplinary Program in Applied Mathematics The University of Arizona TucsonAZ85721 United States Department of Mathematics The University of Arizona TucsonAZ85721 United States Department of Epidemiology and Biostatistics The University of Arizona TucsonAZ85721 United States BIO5 Institute The University of Arizona TucsonAZ85721 United States Department of Computer Science and Engineering The Ohio State University ColumbusOH43202 United States

We present artificial neural networks as a feasible replacement for a mechanistic model of mosquito abundance. We develop a feed-forward neural network, a long short-term memory recurrent neural network, and a gated recurrent unit network. We evaluate the networks in their ability to replicate the spatiotemporal features of mosquito populations predicted by the mechanistic model, and discuss how augmenting the training data with time series that emphasize specific dynamical behaviors affects model performance. We conclude with an outlook on how such equation-free models may facilitate vector control or the estimation of disease risk at arbitrary spatial scales. © 2021, CC BY-NC-ND.

关键词： Feedforward neural networks

Surrogate approximation of the grad-shafranov free boundary problem via stochastic collocation on sparse grids

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Elman, Howard C. Liang, Jiaxing Sánchez-Vizuet, Tonatiuh Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park United States Applied Mathematics & Statistics and Scientific Computing Program University of Maryland College Park United States Courant Institute of Mathematical Sciences New York University Department of Mathematics The University of Arizona

In magnetic confinement fusion devices, the equilibrium configuration of a plasma is determined by the balance between the hydrostatic pressure in the fluid and the magnetic forces generated by an array of external coils and the plasma itself. The location of the plasma is not known a priori and must be obtained as the solution to a free boundary problem. The partial differential equation that determines the behavior of the combined magnetic field depends on a set of physical parameters (location of the coils, intensity of the electric currents going through them, magnetic permeability, etc.) that are subject to uncertainty and variability. The confinement region is in turn a function of these stochastic parameters as well. In this work, we consider variations on the current intensities running through the external coils as the dominant source of uncertainty. This leads to a parameter space of dimension equal to the number of coils in the reactor. With the aid of a surrogate function built on a sparse grid in parameter space, a Monte Carlo strategy is used to explore the effect that stochasticity in the parameters has on important features of the plasma boundary such as the location of the x-point, the strike points, and shaping attributes such as triangularity and elongation. The use of the surrogate function reduces the time required for the Monte Carlo simulations by factors that range between 7 and over *** Codes 65C30, 65C05, 65N35, 65N99, 65Z05 Copyright © 2021, The Authors. All rights reserved.

关键词： Monte Carlo methods

Prediction and Prevention of Pandemics via Graphical Model Inference and Convexprogramming

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Krechetov, Mikhail Sikaroudi, Amir Mohammad Esmaieeli Efrat, Alon Polishchuk, Valentin Chertkov, Michael Skolkovo Institute of Science and Technology Center for Energy Science and Technology Moscow121205 Russia University of Arizona Department of Computer Science TucsonAZ85721 United States University of Arizona Program in Applied Mathematics TucsonAZ85721 United States Linkoping Univeristy Communications and Transport Systems Norrkoping60174 Sweden University of Arizona Department of Mathematics TucsonAZ85721 United States

Hard-to-predict bursts of COVID-19 pandemic revealed significance of statistical modeling which would resolve spatio-temporal correlations over geographical areas, for example spread of the infection over a city with census tract granularity. In this manuscript, we provide algorithmic answers to the following two inter-related public health challenges of immense social impact which have not been adequately addressed (1) Inference Challenge: assuming that there are N census blocks (nodes) in the city, and given an initial infection at any set of nodes, e.g. any N of possible single node infections, any N(N−1)/2 of possible two node infections, etc, what is the probability for a subset of census blocks to become infected by the time the spread of the infection burst is stabilized? (2) Prevention Challenge: What is the minimal control action one can take to minimize the infected part of the stabilized state footprint? To answer the challenges, we build a Graphical Model of pandemic of the attractive Ising (pair-wise, binary) type, where each node represents a census track and each edge factor represents the strength of the pairwise interaction between a pair of nodes, e.g. representing the inter-node travel, road closure and related, and each local bias/field represents the community level of immunization, acceptance of the social distance and mask wearing practice, etc. Resolving the Inference Challenge requires finding the Maximum-A-Posteriory (MAP), i.e. most probable, state of the Ising Model constrained to the set of initially infected nodes. (An infected node is in the +1 state and a node which remained safe is in the −1 state.) We show that almost all attractive Ising Models on dense graphs result in either of the two possibilities (modes) for the MAP state: either all nodes which were not infected initially became infected, or all the initially uninfected nodes remain uninfected (susceptible). This bi-modal solution of the Inference Challenge allows us to re-st

关键词： Ising model