相关论文: Multiple-Layer Parking with Screening

We consider a large family of branching-selection particle systems. The branching rate of each particle depends on its rank and is given by a function $b$ defined on the unit interval. There is also a killing measure $D$ supported on the…

Density profiles are the most common measure of inhomogeneous structure in confined fluids, but their connection to transport coefficients is poorly understood. We explore via simulation how tuning particle-wall interactions to flatten or…

Let $f$ be a multivariate density and $f\_n$ be a kernel estimate of $f$ drawn from the $n$-sample $X\_1,...,X\_n$ of i.i.d. random variables with density $f$. We compute the asymptotic rate of convergence towards 0 of the volume of the…

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…

We determine the density expansion of the radius of gyration, of the hydrodynamic radius, and of the end-to-end distance for a monodisperse polymer solution in good-solvent conditions. We consider the scaling limit (large degree of…

The Earth's atmosphere is an aerosol, it contains suspended particles. When air flows over an obstacle such as an aircraft wing or tree branch, these particles may not follow the same paths as the air flowing around the obstacle. Instead…

We improve the best known upper bound on the density of a planar measurable set A containing no two points at unit distance to 0.25442. We use a combination of Fourier analytic and linear programming methods to obtain the result. The…

We show how a fixed point based boundary-layer analysis technique can be used to obtain the steady-state particle density profiles of driven exclusion processes on two-lane systems with open boundaries. We have considered two distinct…

A multilayered particle is illuminated by plane acoustic or electromagnetic waves of one or several frequencies. We consider the inverse scattering problem for the identification of the layers and of the refraction coefficients of the…

A standard approach to approximate inference in state-space models isto apply a particle filter, e.g., the Condensation Algorithm.However, the performance of particle filters often varies significantlydue to their stochastic nature.We…

One way of recovering information about the initial conditions of the Universe is by measuring features of the cosmological density field which are preserved during gravitational evolution and galaxy formation. In this paper we study the…

The random sequential adsorption (RSA) of identical elongated particles (discorectangles) on a line ("Paris car parking problem") was studied numerically. An off-lattice model with continuous positional and orientational degrees of freedom…

The density bound for schedulability for general pinwheel instances is $\frac{5}{6}$, but density bounds better than $\frac{5}{6}$ can be shown for cases in which the minimum element $m$ of the instance is large. Several recent works have…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…

Low-dimensional, complex systems are often characterized by logarithmically slow dynamics. We study the generic motion of a labeled particle in an ensemble of identical diffusing particles with hardcore interactions in a strongly…

The pinwheel problem is a real-time scheduling problem that asks, given $n$ tasks with periods $a_i \in \mathbb{N}$, whether it is possible to infinitely schedule the tasks, one per time unit, such that every task $i$ is scheduled in every…

We study an interacting particle system in $\mathbf{R}^d$ motivated by Stein variational gradient descent [Q. Liu and D. Wang, NIPS 2016], a deterministic algorithm for sampling from a given probability density with unknown normalization.…

Making use of a Rice-like series expansion, for a class of stationary Gaussian processes the asymptotic behavior of the first passage time probability density function through certain time-varying boundaries, including periodic boundaries,…

Current navigation systems conflate time-to-drive with the true time-to-arrive by ignoring parking search duration and the final walking leg. Such underestimation can significantly affect user experience, mode choice, congestion, and…