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

Static structural signatures of nearly jammed disordered and ordered hard-sphere packings: Direct correlation function

学校读者我要写书评

暂无评论

Physical Review E 2016年第3期94卷 032902-032902页

作者： Steven Atkinson Frank H. Stillinger Salvatore Torquato Department of Chemistry Department of Physics Princeton Center for Theoretical Science Program of Applied and Computational Mathematics Princeton Institute for the Science and Technology of Materials Princeton University Princeton New Jersey 08544 USA

The nonequilibrium process by which hard-particle systems may be compressed into disordered, jammed states has received much attention because of its wide utility in describing a broad class of amorphous materials. While dynamical signatures are known to precede jamming, the task of identifying static structural signatures indicating the onset of jamming have proven more elusive. The observation that compressing hard-particle packings towards jamming is accompanied by an anomalous suppression of density fluctuations (termed “hyperuniformity”) has paved the way for the analysis of jamming as an “inverted critical point” in which the direct correlation function c(r), rather than the total correlation function h(r), diverges. We expand on the notion that c(r) provides both universal and protocol-specific information as packings approach jamming. By considering the degree and position of singularities (discontinuities in the nth derivative) as well as how they are changed by the convolutions found in the Ornstein-Zernike equation, we establish quantitative statements about the structure of c(r) with regards to singularities it inherits from h(r). These relations provide a concrete means of identifying features that must be expressed in c(r) if one hopes to reproduce various details in the pair correlation function accurately and provide stringent tests on the associated numerics. We also analyze the evolution of systems of three-dimensional monodisperse hard spheres of diameter D as they approach ordered and disordered jammed configurations. For the latter, we use the Lubachevsky-Stillinger (LS) molecular dynamics and Torquato-Jiao (TJ) sequential linear programming algorithms, which both generate disordered packings, but can show perceptible structural differences. We identify a short-ranged scaling c(r)∝−1/r as r→0 that accompanies the formation of the delta function at c(D) that indicates the formation of contacts in all cases, and show that this scaling behavior is,

关键词： Jamming

Deuteration removes quantum dipolar defects from KDP crystals

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Bingjia Xie, Pinchen Car, Roberto Department of Chemistry Princeton University PrincetonNJ08544 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Department of Chemistry Department of Physics Program in Applied and Computational Mathematics Princeton Materials Institute Princeton University PrincetonNJ08544 United States

The structural, dielectric, and thermodynamic properties of the hydrogen-bonded ferroelectric crystal potassium dihydrogen phosphate (KH2PO4), KDP for short, differ significantly from those of DKDP (KD2PO4) [1, 2]. It is well established that deuteration affects the interplay of hydrogen-bond switches and heavy ion displacements that underlie the emergence of macroscopic polarization, but a detailed microscopic model is missing [3, 4]. Here we show that all-atom path integral molecular dynamics simulations can predict the isotope effects, revealing the microscopic mechanism that differentiates KDP and DKDP. Proton tunneling in the hydrogen bonds generates phosphate configurations that do not contribute to the polarization. These dipolar defects are always present in KDP, but disappear at low temperatures in DKDP, which behaves more classically. Quantum disorder confers residual entropy to ferroelectric KDP, explaining its lower spontaneous polarization and transition entropy relative to DKDP. Tunneling should also contribute to the anomalous heat capacity observed in KDP near absolute zero [5, 6]. The prominent role of quantum fluctuations in KDP is related to the unusual strength of the hydrogen bonds in this system and should be equally important in the other crystals of the KDP family, which exhibit similar isotope effects [7]. © 2024, CC BY.

关键词： Hydrogen bonds

Efficient sampling of high-dimensional free energy landscapes using adaptive reinforced dynamics

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Dongdong Zhang, Linfeng Wang, Yanze Chang, Junhan Wang, Han Weinan, E. Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States DP Technology Beijing China College of Chemistry and Molecular Engineering Peking University Beijing100871 China Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Fenghao East Road 2 Beijing100094 China School of Mathematical Sciences Peking University Beijing China Department of Mathematics Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Beijing Institute of Big Data Research Beijing100871 China

Enhanced sampling methods such as metadynamics and umbrella sampling have become essential tools for exploring the configuration space of molecules and materials. At the same time, they have long faced a number of issues such as the inefficiency when dealing with a large number of collective variables (CVs) or systems with high free energy barriers. In this work, we show that with the clustering and adaptive tuning techniques, the reinforced dynamics (RiD) scheme can be used to efficiently explore the configuration space and free energy landscapes with a large number of CVs or systems with high free energy barriers. We illustrate this by studying various representative and challenging examples. Firstly we demonstrate the efficiency of adaptive RiD compared with other methods, and construct the 9-dimensional free energy landscape of peptoid trimer which has energy barriers of more than 8 kcal/mol. We then study the folding of the protein chignolin using 18 CVs. In this case, both the folding and unfolding rates are observed to be equal to 4.30 µs−1. Finally, we propose a protein structure refinement protocol based on RiD. This protocol allows us to efficiently employ more than 100 CVs for exploring the landscape of protein structures and it gives rise to an overall improvement of 14.6 units over the initial Global Distance Test-High Accuracy (GDT-HA) score. © 2021, CC BY.

关键词： Wave functions

Pseudo prolate spheroidal functions

学校读者我要写书评

暂无评论

Pseudo prolate spheroidal functions

International Conference on Sampling Theory and Applications (SampTA)

作者： Luís Daniel Abreu João M. Pereira Austrian Academy of Sciences Acoustics Research Institute Vienna Austria Program in Applied and Computational Mathematics Princeton University Princeton NJ USA

Let Dt and B Ω denote the operators which cut the time content outside T and the frequency content outside Ω, respectively. The prolate spheroidal functions are the eigen-functions of the operator Pτ, Ω = D t B Ω D t . With the aim of formulating in precise mathematical terms the notion of Nyquist rate, Landau and Pollack have shown that, asymptotically, the number of such functions with eigenvalue close to one is ≈ |T||Ω|/2π. We have recently revisited this problem with a new approach: instead of counting the number of eigenfunctions with eigenvalue close to one, we count the maximum number of orthogonal ε-pseudoeigenfunctions with ε-pseudoeigenvalue one. Precisely, we count how many orthogonal functions have a maximum of energy e outside the domain T x Ω, in the sense that ||P T, Ω f - f|| 2 ≤ ε. We have recently discovered that the sharp asymptotic number is ≈ (1 - ε) -1 |T||Ω|/2π. The proof involves an explicit construction of the pseudoeigenfunctions of P T, Ω . When T and Ω are intervals we call them pseudo prolate spheroidal functions. In this paper we explain how they are constructed.

关键词： Eigenvalues and eigenfunctions Time-frequency analysis Fourier transforms Linear approximation

Offering Supplementary Wireless Technologies: Adoption Behavior and Offloading Benefits

学校读者我要写书评

暂无评论

Offering Supplementary Wireless Technologies: Adoption Behav...

IEEE INFOCOM

作者： Carlee Joe-Wong Soumya Sen Sangtae Ha Program in Applied and Computational Mathematics Princeton University Princeton NJ USA Department of Electrical Engineering Princeton University Princeton NJ USA

ISBN: (纸本)9781467359443

To alleviate the congestion caused by rapid growth in demand for mobile data, ISPs have begun encouraging users to offload some of their traffic onto a supplementary, better quality network technology, e.g., offloading from 3G or 4G to WiFi and femtocells. With the growing popularity of such offerings, a deeper understanding of the underlying economic principles and their impact on technology adoption is necessary. To this end, we develop a model for user adoption of a base wireless technology and a bundle of the base plus a supplementary technology. In our model, individual users make their adoption decisions based on several factors, including the technologies' intrinsic qualities, throughput degradation due to congestion externalities from other subscribers, and the flat access rates that an ISP charges. We study the adoption dynamics and show that they converge to a unique equilibrium for a given set of exogenously determined system parameters. In particular, we characterize the occurrence of interesting adoption behaviors, including a possible decrease in the adoption of the supplementary technology as its coverage increases. Similar behaviors occur at an ISP's profit-maximizing prices and the optimal coverage area for the supplementary technology. To account for the potential benefits from offloading in practice, we collect 3G and WiFi usage and location data from twenty mobile users. We then use this data to numerically investigate the profit-maximizing adoption levels when an ISP accounts for its cost of deploying the supplemental technology and savings from offloading traffic onto this technology.

关键词： UNLOADING internet service providers third generation Adoption Wireless Technology Wi-Fi Femtocells 4G mobile communication

Convergence acceleration of ensemble Kalman inversion in nonlinear settings

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Chada, Neil K. Tong, Xin T. Applied Mathematics and Computational Science Program King Abdullah University of Science and Technology Thuwal23955 Saudi Arabia Department of Mathematics National University of Singapore 119077 Singapore

Many data-science problems can be formulated as an inverse problem, where the parameters are estimated by minimizing a proper loss function. When complicated black-box models are involved, derivative-free optimization tools are often needed. The ensemble Kalman filter (EnKF) is a particle-based derivative-free Bayesian algorithm originally designed for data assimilation. Recently, it has been applied to inverse problems for computational efficiency. The resulting algorithm, known as ensemble Kalman inversion (EKI), involves running an ensemble of particles with EnKF update rules so they can converge to a minimizer. In this article, we investigate EKI convergence in general nonlinear settings. To improve convergence speed and stability, we consider applying EKI with non-constant step-sizes and covariance inflation. We prove that EKI can hit critical points with finite steps in non-convex settings. We further prove that EKI converges to the global minimizer polynomially fast if the loss function is strongly convex. We verify the analysis presented with numerical experiments on two inverse problems. Copyright © 2019, The Authors. All rights reserved.

关键词： Inverse problems

A Mathematical Model for Linguistic Universals

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Weinan, E. Zhou, Yajun Department of Mathematics & Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Beijing Institute of Big Data Research Beijing100871 China

Inspired by chemical kinetics and neurobiology, we propose a mathematical theory for pattern recurrence in text documents, applicable to a wide variety of languages. We present a Markov model at the discourse level for Steven Pinker’s "mentalese", or chains of mental states that transcend the spoken/written forms. Such (potentially) universal temporal structures of textual patterns lead us to a language-independent semantic representation, or a translationally-invariant word embedding, thereby forming the common ground for both comprehensibility within a given language and translatability between different languages. Applying our model to documents of moderate lengths, without relying on external knowledge bases, we reconcile Noam Chomsky’s "poverty of stimulus" paradox with statistical learning of natural languages. Copyright © 2019, The Authors. All rights reserved.

关键词： Markov processes

NOMAD: nonlinear manifold decoders for operator learning 22

学校读者我要写书评

暂无评论

NOMAD: nonlinear manifold decoders for operator learning

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Jacob H. Seidman Georgios Kissas Paris Perdikaris George J. Pappas Graduate Program in Applied Mathematics and Computational Science University of Pennsylvania Department of Mechanical Engineering and Applied Mechanics University of Pennsylvania Department of Electrical and Systems Engineering University of Pennsylvania

ISBN: (纸本)9781713871088

Supervised learning in function spaces is an emerging area of machine learning research with applications to the prediction of complex physical systems such as fluid flows, solid mechanics, and climate modeling. By directly learning maps (operators) between infinite dimensional function spaces, these models are able to learn discretization invariant representations of target functions. A common approach is to represent such target functions as linear combinations of basis elements learned from data. However, there are simple scenarios where, even though the target functions form a low dimensional submanifold, a very large number of basis elements is needed for an accurate linear representation. Here we present NOMAD, a novel operator learning framework with a nonlinear decoder map capable of learning finite dimensional representations of nonlinear submanifolds in function spaces. We show this method is able to accurately learn low dimensional representations of solution manifolds to partial differential equations while outperforming linear models of larger size. Additionally, we compare to state-of-the-art operator learning methods on a complex fluid dynamics benchmark and achieve competitive performance with a significantly smaller model size and training cost.

关键词：

Reed-Muller Codes Polarize

学校读者我要写书评

暂无评论

Reed-Muller Codes Polarize

Annual IEEE Symposium on Foundations of Computer Science

作者： Emmanuel Abbe Min Ye Mathematics Institute and the School of Computer and Communication Sciences at EPFL Switzerland Program in Applied and Computational Mathematics in Princeton University USA Department of Electrical Engineering Princeton University USA

Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are generated by the same matrix G_m= [1/1 0/1] ^⊗m but using different subset of rows. RM codes select simply rows having largest weights. Polar codes select instead rows having the largest conditional mutual information proceeding top to down in G_m; while this is a more elaborate and channel-dependent rule, the top-to-down ordering allows Arikan to show that the conditional mutual information polarizes, and this gives directly a capacity-achieving code on any symmetric channel. RM codes are yet to be proved to have such a property, despite the recent success for the erasure channel. In this paper, we connect RM codes to polarization theory. We show that proceeding in the RM code ordering, i.e., not top-to-down but from the lightest to the heaviest rows in G_m, the conditional mutual information again polarizes. We further demonstrate that it does so faster than for polar codes. This implies that G_m contains another code, different than the polar code and called here the twin-RM code, that is provably capacity-achieving on any symmetric channel. This gives in particular a necessary condition for RM codes to achieve capacity on symmetric channels. It further gives a sufficient condition if the rows with largest conditional mutual information correspond to the heaviest rows, i.e., if the twin-RM code is the RM code. We demonstrate here that the two codes are at least similar and give further evidence that they are indeed the same.

关键词： Polar codes Mutual information Channel capacity Decoding Entropy Boolean functions