A method to simulate bodies suspended in a Lattice Boltzmann solvent is proposed. It is based on a generalized reaction force that enforces no-slip boundary conditions at the fluid–body interface as the limiting case of an iterative procedure. A smooth version of the Heaviside function allows to treat spherical particles of arbitrary size and produces smooth hydrodynamic forces as particles mov...

Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover decision tables that are overall less complex than the initial one, potentially easier to interpret, and introduce new and meaningful intermediate concepts. Since an exhaustive search for an optimal hierarchy of decisio...

In shape analysis, finding an optimal 1-1 correspondence between surfaces within a large class of admissible bijective mappings is of great importance. Such process is called surface registration. The difficulty lies in the fact that the space of all surface diffeomorphisms is a complicated functional space, making exhaustive search for the best mapping challenging. To tackle this problem, we p...

Typically in SAR imaging, there is insufficient data to form well-resolved three-dimensional (3D) images using traditional Fourier image reconstruction; furthermore, scattering centers do not persist over wide-angles. In this work, we examine 3D non-coherent wide-angle imaging on the GOTCHA Air Force Research Laboratory (AFRL) data set; this data set consists of multipass complete circular aper...

Much analysis of microscope image formation is based upon the so-called weak scaucring approximation in which an image is linearly related to an object by a convenient convolution property which greatly simplifies reconstruction. This approximation is often invalid in tmnsmission microscopy. A better model of transmission must account for multiple scauered components in the light distribution. ...

It is of interest in various contexts to find approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization, it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feas...

We introduce a powerful iterative algorithm to compute protein folding pathways, with realistic all-atom force fields. Using the path integral formalism, we explicitly derive a modified Langevin equation which samples directly the ensemble of reactive pathways, exponentially reducing the cost of simulating thermally activated transitions. The algorithm also yields a rigorous stochastic estimate...