Related papers: Explicit Analytical Solution for Random Close Pack…
We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond…
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
We calculate the mean end-to-end distance ($R$) of a self-avoiding polymer encapsulated in an infinitely long cylinder with radius $D$. A self-consistent perturbation theory is used to calculate $R$ as a function of $D$ for impenetrable…
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. However, the…
We study ROUND-UFP and ROUND-SAP, two generalizations of the classical BIN PACKING problem that correspond to the unsplittable flow problem on a path (UFP) and the storage allocation problem (SAP), respectively. We are given a path with…
For a finite set of points $P$ in $R^d$, the function $d_P: R^d \to R^+$ measures Euclidean distance to the set $P$. We study the number of critical points of $d_P$ when $P$ is a Poisson process. In particular, we study the limit behavior…
The Percus-Yevick theory for monodisperse hard spheres gives very good results for the pressure and structure factor of the system in a whole range of densities that lie within the liquid phase. However, the equation seems to lead to a very…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
We perform extensive molecular dynamics simulations of dense liquids composed of bidisperse dimer- and ellipse-shaped particles in 2D that interact via repulsive contact forces. We measure the structural relaxation times obtained from the…
The densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper…
This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Covering). The approximation ratio D is the maximum number of…
The study on the relationship between the spheres and voids in packing system suggests that the edge effect at the interface between the container and the particles is an important factor lowering the packing ratio. To pack spheres in a…
This paper proposes a novel robust model predictive control (RMPC) method for the stabilization of constrained systems subject to additive disturbance (AD) and multiplicative disturbance (MD). Concentric containers are introduced to…
We introduce a 2-dimensional lattice model of granular matter. We use a combination of proof and simulation to demonstrate an order/disorder phase transition in the model, to which we associate the granular phenomenon of random close…
We present a numerical model for a two dimensional (2D) granular assembly, falling in a rectangular container when the bottom is removed. We observe the occurrence of cracks splitting the initial pile into pieces, like in experiments. We…
We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…
We formulate pure characteristics demand models under uncertainties of probability distributions as distributionally robust mathematical programs with stochastic complementarity constraints (DRMP-SCC). For any fixed first-stage variable and…
Conformal prediction (CP) is a framework to quantify uncertainty of machine learning classifiers including deep neural networks. Given a testing example and a trained classifier, CP produces a prediction set of candidate labels with a…
Computer simulation was used to study the random sequential adsorption of identical discorectangles onto a continuous plane . The problem was analyzed for a wide range of discorectangle aspect ratios ($\varepsilon \in [1;100]$). We studied…
We study the responses of fluid-immersed soft hydrogel spheres that are sheared under controlled volume fractions. Slippery, deformable particles along with the density-matched interstitial fluid are sandwiched between two opposing rough…