We present an efficient algorithm for calculating the minimum energy path(MEP)and energy barriers between local minima on a multidimensional potential energy surface(PES).Such paths play a central role in the understa...
详细信息
We present an efficient algorithm for calculating the minimum energy path(MEP)and energy barriers between local minima on a multidimensional potential energy surface(PES).Such paths play a central role in the understanding of transition pathways between metastable *** method relies on the original formulation of the string method[***.B,66,052301(2002)],*** evolve a smooth curve along a direction normal to the *** algorithm works by performing minimization steps on hyperplanes normal to the *** the problem of finding MEP on the PES is remodeled as a set of constrained minimization *** provides the flexibility of using minimization algorithms faster than the steepest descent method used in the simplified string method[***.,126(16),164103(2007)].At the same time,it provides a more direct analog of the finite temperature string *** applicability of the algorithm is demonstrated using various examples.
Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also...
详细信息
Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks—including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.
This paper introduces two new hybrid models for clustering problems in which the input features and parameters of a spiking neural network (SNN) are optimized using evolutionary algorithms. We used two novel evolution...
详细信息
ISBN:
(纸本)9781479914821
This paper introduces two new hybrid models for clustering problems in which the input features and parameters of a spiking neural network (SNN) are optimized using evolutionary algorithms. We used two novel evolutionary approaches, the quantum-inspired evolutionary algorithm (QIEA) and the optimization by genetic programming (OGP) methods, to develop the quantum binary-real evolving SNN (QbrSNN) and the SNN optimized by genetic programming (SNN-OGP) neuro-evolutionary models, respectively. The proposed models are applied to 8 benchmark datasets, and a significantly higher clustering accuracy compared to a standard SNN without feature and parameter optimization is achieved with fewer iterations. When comparing QbrSNN and SNN-OGP, the former performed slightly better but at the expense of increased computational effort.
A simple new lower bound is provided for the Rényi entropy of the convolution of probability distributions on the integers in terms of certain (discrete) rearrangements of these distributions. This inequality may...
详细信息
A simple new lower bound is provided for the Rényi entropy of the convolution of probability distributions on the integers in terms of certain (discrete) rearrangements of these distributions. This inequality may be thought of as an entropy power inequality for integer-valued random variables.
This paper provides a mathematically rigorous foundation for self-consistent mean field theory of the polymeric physics. We study a new model for dynamics of mono-polymer systems. Every polymer is regarded as a string...
详细信息
This paper provides a mathematically rigorous foundation for self-consistent mean field theory of the polymeric physics. We study a new model for dynamics of mono-polymer systems. Every polymer is regarded as a string of points which are moving randomly as Brownian motions and under elastic forces. Every two points on the same string or on two different strings also interact under a pairwise potential V. The dynamics of the system is described by a system of N coupled stochastic partial differential equations (SPDEs). We show that the mean field limit as N -+ c~ of the system is a self-consistent McKean-Vlasov type equation, under suitable assumptions on the initial and boundary conditions and regularity of V. We also prove that both the SPDE system of the polymers and the mean field limit equation are well-posed.
Maximally random jammed (MRJ) sphere packing is a prototypical example of a system naturally poised at the margin between underconstraint and overconstraint. This marginal stability has traditionally been understood i...
详细信息
Maximally random jammed (MRJ) sphere packing is a prototypical example of a system naturally poised at the margin between underconstraint and overconstraint. This marginal stability has traditionally been understood in terms of isostaticity, the equality of the number of mechanical contacts and the number of degrees of freedom. Quasicontacts, pairs of spheres on the verge of coming in contact, are irrelevant for static stability, but they come into play when considering dynamic stability, as does the distribution of contact forces. We show that the effects of marginal dynamic stability, as manifested in the distributions of quasicontacts and weak contacts, are consequential and nontrivial. We study these ideas first in the context of MRJ packing of d-dimensional spheres, where we show that the abundance of quasicontacts grows at a faster rate than that of contacts. We reexamine a calculation of Jin et al. [Phys. Rev. E 82, 051126 (2010)], where quasicontacts were originally neglected, and we explore the effect of their inclusion in the calculation. This analysis yields an estimate of the asymptotic behavior of the packing density in high dimensions. We argue that this estimate should be reinterpreted as a lower bound. The latter part of the paper is devoted to Bravais lattice packings that possess the minimum number of contacts to maintain mechanical stability. We show that quasicontacts play an even more important role in these packings. We also show that jammed lattices are a useful setting for studying the Edwards ensemble, which weights each mechanically stable configuration equally and does not account for dynamics. This ansatz fails to predict the power-law distribution of near-zero contact forces, P(f)∼fθ.
We perform a set of detailed numerical simulations of single-phase, fully saturated flow in stochastically generated, three-dimensional pore structures with diverse porosities (ϕ) and degrees of connectivity, and anal...
详细信息
We perform a set of detailed numerical simulations of single-phase, fully saturated flow in stochastically generated, three-dimensional pore structures with diverse porosities (ϕ) and degrees of connectivity, and analyze the probability density functions (PDFs) of the pore sizes, S, and vertical velocity components, w, which are aligned with the mean flow direction. Both of the PDFs are markedly skewed with pronounced positive tails. This feature of the velocity PDF is dictated by the pore structure and determines the shortest travel times, one of the key transport attributes that underpins the success or the failure of environmental remediation techniques. Using a maximum likelihood approach, we determine that the PDFs of S and w decay according to an exponential and a stretched exponential model, respectively. A strong correlation between the key parameters governing the decay of the upper tails of the two PDFs is found, which provides a quantitative result for this analogy that so far has been stated only qualitatively. The parameter governing the concavity of the tail of the velocity PDF varies linearly with porosity over the entire range of tested values (0.2≤ϕ≤0.6). The parameters controlling the spread of the upper tails of the PDFs of S and w appear to be linked by a power-law relationship.
In this paper, we present the application of the ZEM/ZEV guidance algorithm to the planar restricted three-body problem (PR3BP). The ZEM/ZEV guidance law as a feedback guidance strategy is presented and applied to the...
详细信息
ISBN:
(纸本)9780877036111
In this paper, we present the application of the ZEM/ZEV guidance algorithm to the planar restricted three-body problem (PR3BP). The ZEM/ZEV guidance law as a feedback guidance strategy is presented and applied to the PR3BP. The fuel optimal solution to the PR3BP for a transfer from GTO to L1 in the Earth-Moon system is presented as a point for comparison, showing the near optimality of the closed-loop guidance approach. Challenges of the approach and strategies for implementation in spacecraft mission design are discussed.
Studies with ensemble systems have gained attention recently and, most of them, propose new methods for the design (generation) of different components in these systems. In parallel, new contributions of meta-learning...
详细信息
Studies with ensemble systems have gained attention recently and, most of them, propose new methods for the design (generation) of different components in these systems. In parallel, new contributions of meta-learning have been presented as an efficient alternative to automatic recommendation of algorithms. In this paper, we apply meta-learning in the process of recommendation of important parameters of ensemble systems, which are: architecture and individual classifiers. The main goal is to provide an efficient way to design ensemble systems. In order to validate the proposed approach, an empirical investigation is conducted, recommending three possible types of ensemble architectures (Bagging, Boosting and Multi-Boosting) and five possible types of learning algorithms to compose the ensemble systems (individual classifiers or components). An initial analysis of the results confirms that meta-learning can be a promising tool to be used in the automatic choice of important parameters in ensemble systems.
暂无评论