Related papers: Reducing the number of redundant pair-wise interac…
Alignment algorithms usually rely on simplified models of gaps for computational efficiency. Based on an isomorphism between alignments and physical helix-coil models, we show in statistical mechanics that alignments with realistic laws for…
The magnetohydrodynamics (MHD) equations are generally known to be difficult to solve numerically, due to their highly nonlinear structure and the strong coupling between the electromagnetic and hydrodynamic variables, especially for high…
The exchange of electroweak gauginos in the $t-$ or $u-$channel allows squark pair production at hadron colliders without color exchange between the squarks. This can give rise to events where little or no energy is deposited in the…
Discovering interaction effects on a response of interest is a fundamental problem faced in biology, medicine, economics, and many other scientific disciplines. In theory, Bayesian methods for discovering pairwise interactions enjoy many…
This survey summarizes and illustrates the main qualitative properties of hydrodynamics models for collective behavior. These models include a velocity consensus term together with attractive-repulsive potentials leading to non-trivial…
Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…
This paper proposes two approaches for inferencing binary codes in two-step (supervised, unsupervised) hashing. We first introduce an unified formulation for both supervised and unsupervised hashing. Then, we cast the learning of one bit as…
Lattice Monte Carlo calculations of interacting systems on non-bipartite lattices exhibit an oscillatory imaginary phase known as the phase or sign problem, even at zero chemical potential. One method to alleviate the sign problem is to…
The Smoothed Particles Hydrodynamics (SPH) is a particle-based, meshfree, Lagrangian method used to simulate multidimensional fluids with arbitrary geometries, most commonly employed in astrophysics, cosmology, and computational…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
Hourglass modes, characterized by zigzag particle and stress distributions, are a common numerical instability encountered when simulating solid materials with updated Lagrangian smoother particle hydrodynamics (ULSPH). While recent…
Magnetohydrodynamics (MHD) describes the interaction between electrically conducting fluids and electromagnetic fields. We propose and analyze a symplectic, second-order algorithm for the evolutionary MHD system in Els\"asser variables. We…
In modern digital filter chip design, efficient resource utilization is a hot topic. Due to the linear phase characteristics of FIR filters, a pulsed fully parallel structure can be applied to address the problem. To further reduce hardware…
In the first part of a series of two papers, we present in considerable detail a collision-driven molecular dynamics algorithm for a system of nonspherical particles, within a parallelepiped simulation domain, under both periodic or…
Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical…
Hydraulic systems are widely utilized in industrial applications due to their high force generation, precise control, and ability to function in harsh environments. Hydraulic cylinders, as actuators in these systems, apply force and…
Available algorithms for the initialization of volume fractions typically utilize exact functions to model fluid interfaces, or they rely on computationally costly intersections between volume meshes. Here, a new algorithm is proposed that…
Most real optimization problems are defined over a mixed search space where the variables are both discrete and continuous. In engineering applications, the objective function is typically calculated with a numerically costly black-box…
We discuss the hard-hexagon and hard-square problems, as well as the corresponding problem on the honeycomb lattice. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with…
We present new algorithms for the parallelization of Eulerian-Lagrangian interaction operations in the immersed boundary method. Our algorithms rely on two well-studied parallel primitives: key-value sort and segmented reduce. The use of…