Related papers: Probing potential energy surface exploration strat…
The k-sat problem is a prototypical constraint satisfaction problem. There are many algorithms to study k-sat problem, BP algorithm is famous one of them. But BP algorithm does not converge when $\alpha$(constraint density)is bigger than…
We continue our earlier work [Ana Maria Rey, B. L. Hu, Esteban Calzetta, Albert Roura and Charles W. Clark, Phys. Rev. A 69, 033610 (2004)] on the nonequilibrium dynamics of a Bose Einstein condensate (BEC) selectively loaded into every…
Autonomous exploration of obstacle-rich spaces requires strategies that ensure efficiency while guaranteeing safety against collisions with obstacles. This paper investigates a novel platform-agnostic reinforcement learning framework that…
A class of novel STAP algorithms based on sparse recovery technique were presented. Intrinsic sparsity of distribution of clutter and target energy on spatial-frequency plane was exploited from the viewpoint of compressed sensing. The…
In this paper, a non-linear p-robust hub location problem is extended to a risky environment where augmented chance constraint with a min-max regret form is employed to consider network risk as one of the objectives. The model considers…
The Hamiltonian Mean Field (HMF) model has a low-energy phase where $N$ particles are trapped inside a cluster. Here, we investigate some properties of the trapping/untrapping mechanism of a single particle into/outside the cluster. Since…
Increasing global energy demand and renewable integration complexity have placed buildings at the center of sustainable energy management. We present a three-step reinforcement learning(RL)-based Building Energy Management System (BEMS)…
We apply the computational methodology of phase retrieval to the problem of folding heteropolymers. The ground state fold of the polymer is defined by the intersection of two sets in the configuration space of its constituent monomers: a…
We study relaxation-based approaches for conserving mass and energy in the numerical solution of Schr\"odinger-Poisson (SP) type systems. Relaxation-based methods offer a general approach that can be applied as post-time step processing to…
Computationally intractable tasks are often encountered in physics and optimization. Such tasks often comprise a cost function to be optimized over a so-called feasible set, which is specified by a set of constraints. This may yield, in…
Computing reactive trajectories and free energy (FE) landscapes associated to rare event kinetics is key to understanding the dynamics of complex systems. The analysis of the FE surface on which the underlying dynamics takes place has…
In this paper we present a procedure to integrate, up to quadratures, the matching conditions of the energy shaping method. We do that in the context of underactuated Hamiltonian systems defined by simple Hamiltonian functions. For such…
The low-temperature driven or thermally activated motion of several condensed matter systems is often modeled by the dynamics of interfaces (co-dimension-1 elastic manifolds) subject to a random potential. Two characteristic quantitative…
The folding pathway and rate coefficients of the folding of a knotted protein are calculated for a potential energy function with minimal energetic frustration. A kinetic transition network is constructed using the discrete path sampling…
The complex physics of glass forming systems is controlled by the structure of the low energy portions of their potential energy landscapes. Here, we report that a modified metadynamics algorithm efficiently explores and samples low energy…
Multi-access Edge Computings (MECs) enables low-latency services by executing applications at the network edge. To fulfill low-latency requirements of mobile users, providers have to keep multiple edge servers running at multiple locations,…
We introduce a method of exploring potential energy contours in complex dynamical systems based on potentiostatic kinematics wherein the systems are evolved with minimal changes to their potential energy. We construct a simple iterative…
We present a novel method, which we call dual minima hopping method (DMHM), that allows us to find the global minimum of the potential energy surface (PES) within density functional theory for systems where a fast but less accurate…
Convex relaxation methods are powerful tools for studying the lowest energy of many-body problems. By relaxing the representability conditions for marginals to a set of local constraints, along with a global semidefinite constraint, a…
To integrate large systems of nonlinear differential equations in time, we consider a variant of nonlinear waveform relaxation (also known as dynamic iteration or Picard-Lindel\"of iteration), where at each iteration a linear inhomogeneous…