An inert dynamically passive scalar in a constant density fluid forced by a statistically homogeneous field of turbulence has been investigated using the results of a 256(3) grid direct numerical simulation. Mixing characteristics are characterized in terms of either principal curvatures or mean and Gauss curvatures. The most probable small-scale scalar geometries are flat and tilelike isosurfa...

Karshon constructed the first counterexample to the log-concavity conjecture for the Duistermaat-Heckman measure: a Hamiltonian six manifold whose fixed points set is the disjoint union of two copies of T. In this article, for any closed symplectic four manifold N with b > 1, we show that there is a Hamiltonian circle manifold M fibred over N such that its DuistermaatHeckman function is not log...

In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...

Diierent universal (also called automatic or black-box) methods have been suggested to sample from univariate log-concave distributions. The description of a universal generator for bivariate distributions has not been published up to now. The new algorithm for bivariate log-concave distributions is based on the method of transformed density rejection. In order to construct a hat function for a...

the effective factors of forward speed, cylinder rotation, and clearance between a combine’s cylinder and concave on wheat kernel breakage and seed germination were studied in karaj area using a 955 model john dear combine. this study was conducted on three levels of adjustment for each of the variables, 1.2, 1.8 and 2.5 km/hr for forward speed, 800, 900, 1000 rpm for cylinder rotation as well ...

In this paper, we present a novel parallel algorithm for computing the convex hull of a set of points in 3D using the CUDA programming model. It is based on the QuickHull approach and starts by constructing an initial tetrahedron using four extreme points, discards the internal points, and distributes the external points to the four faces. It then proceeds iteratively. In each iteration, it ref...

A meshless method for parameterizing point clouds using convex combination mapping and mean value coordinates has been introduced by Floater et al. The advantage of the method is that only a sparse linear system has to be solved and the resulting parameterization is usually injective. However, in the presence of concave boundaries the convex combination mapping is not always well defined and of...

We consider embedded hypersurfaces evolving by fully nonlinear flows in which the normal speed of motion is a homogeneous degree one, concave or convex function of the principal curvatures, and prove a noncollapsing estimate: Precisely, the function which gives the curvature of the largest interior sphere touching the hypersurface at each point is a subsolution of the linearized flow equation i...