An axiomatic formulation is presented for point processes which may be interpreted as ordered sequences of points randomly located on the real line. Such concepts as forward recurrence times and number of points in intervals are defined and related in set-theoretic Note that for α∈$A$,$G$^{α}may not cover$G$_{α}as a convex subgroup and so we cannot use Theorem 1.1 to prove this result. Moreover, all that we know about the$G$^{α}/G_{α}is that each is an extension of a trivially ordered subgroup by a subgroup of$R$. It$B$is a plenary subset of$A$, then there exists a$v$-isomorphism μ of$G$into$V(B, G$^{β}/G_{β}), but whether or not μ is an$o$-isomorphism is not known.

Automatic hexahedral mesh generation plays a fundamental role in CAD/CAE fields, especially for IGA (isogeometric analysis). Recently, an automatic hex-mesh generation method has been proposed, which is based on the equivalence among three key concepts: colorable quadrilateral meshes, finite measured foliations and Strebel differentials. This work focuses on the computational aspect of Strebel differentials on high genus surfaces, which is based on graph-valued harmonic mapping. The algorithmic pipeline is as follows: first, the user inputs an admissible curve system, which induces a cylindric-decomposition graph; then the user specifies the lengths of the edges of the graph; third, the algorithm finds the unique harmonic map from the surface to the metric graph by a non-linear heat flow; finally, the harmonic map induces a Strebel differential, which can be further utilized to generate the hex-mesh. The method has solid theoretic foundation, which guarantees the existence and the uniqueness of the graph-valued harmonic map. The algorithm is capable of handling surfaces with complicated topologies, and producing all possible Strebel differentials on the surface. The user has full control of the combinatorial type and the geometry of the Strebel differential. The computational pipeline is automatic. The experimental results show the efficiency and efficacy of the algorithm, and demonstrate the great potential for automating the structured hexahedral mesh generation.

We give a solution to the inverse problem (given a prescribed function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and Lp-compression functions of finitely generated groups. For smaller classes, we give solutions among solvable groups of exponential volume growth. As corollaries, we prove a recent conjecture of Amir on joint evaluation of speed and entropy exponents and we obtain a new proof of the existence of uncountably many pairwise non-quasi-isometric solvable groups, originally due to Cornulier and Tessera. We also obtain a formula relating the Lp-compression exponent of a group and its wreath product with the cyclic group forp in [1,2].

3D scene modeling has long been a fundamental problem in computer graphics and computer vision. With the popularity of consumer-level RGB-D cameras, there is a growing interest in digitizing real-world indoor 3D scenes. However, modeling indoor 3D scenes remains a challenging problem because of the complex structure of interior objects and poor quality of RGB-D data acquired by consumer-level sensors. Various methods have been proposed to tackle these challenges. In this survey, we provide an overview of recent advances in indoor scene modeling techniques, as well as public datasets and code libraries which can facilitate experiments and evaluation.

AbstractWe introduce a sub-cell shock capturing method for scalar conservation laws built upon the Jin-Xin relaxation framework. Here, sub-cell shock capturing is achieved thanks to an original defect measure correction technique. The proposed correction exactly restores entropy shock solutions of the exact Riemann problem and moreover, it produces monotone and entropy satisfying approximate self-similar solutions. These solutions are then sampled using Glimm's random choice method to advance in time. The resulting scheme combines the simplicity of the Jin-Xin relaxation method with the resolution of the Glimm's scheme in the sharp capture of discontinuities. The strong benefit of using defect measure corrections over usual sub-cell shock capturing methods is that the scheme can be easily made entropy satisfying with respect to infinitely many entropy pairs. Consequently, under a classical CFL condition, the method is proved to converge to the unique entropy weak solution of the Cauchy problem for general non-linear flux functions.