No abstract uploaded!

A two species interacting system motivated by the density functional theory for triblock copolymers contains long range interaction that affects the two species differently. In a two species periodic assembly of discs, the two species appear alternately on a lattice. The minimal two species periodic assembly is the one with the least energy per lattice cell area. There is a parameter $b$ in $[0,1]$ and the type of the lattice associated with the minimal assembly varies depending on $b$. There are several threshold defined by a number $B=0.1867...$ If $b \in [0, B)$, the minimal assembly is associated with a rectangular lattice whose ratio of the longer side and the shorter side is in $[\sqrt{3}, 1)$; if $b \in [B, 1-B]$, the minimal assembly is associated with a square lattice; if $b \in (1-B, 1]$, the minimal assembly is associated with a rhombic lattice with an acute angle in $[\frac{\pi}{3}, \frac{\pi}{2})$. Only when $b=1$, this rhombic lattice is the hexagonal lattice. None of the other values of $b$ yields the hexagonal lattice, a sharp contrast to the situation for one species interacting systems, where the hexagonal lattice is ubiquitously observed.

We propose an inverse iterative method for computing the Perron pair of an irreducible nonnegative third order tensor. The method involves the selection of a parameter $\theta_k$ in the $k$th iteration. For every positive starting vector, the method converges quadratically and is positivity preserving in the sense that the vectors approximating the Perron vector are strictly positive in each iteration. It is also shown that $\theta_k=1$ near convergence. The computational work for each iteration of the proposed method is less than four times (three times if the tensor is symmetric in modes two and three, and twice if we also take the parameter to be $1$ directly) that for each iteration of the Ng--Qi--Zhou algorithm, which is linearly convergent for essentially positive tensors.

The entropy is one of the fundamental states of a fluid and, in the viscous case, the equation that it satisfies is highly singular in the region close to the vacuum. In spite of its importance in the gas dynamics, the mathematical analyses on the behavior of the entropy near the vacuum region, were rarely carried out; in particular, in the presence of vacuum, either at the far field or at some isolated interior points, it was unknown whether the entropy remains its boundedness. The results obtained in this paper indicate that the ideal gases retain their uniform boundedness of the entropy, locally or globally in time, if the vacuum occurs at the far field only and the density decays slowly enough at the far field. Precisely, we consider the Cauchy problem to the one-dimensional full compressible Navier-Stokes equations without heat conduction, and establish the local and global existence and uniqueness of entropy-bounded solutions, in the presence of vacuum at the far field only. It is also shown that, different from the case that with compactly supported initial density, the compressible Navier-Stokes equations, with slowly decaying initial density, can propagate the regularities in inhomogeneous Sobolev spaces.

Laser scanning is an effective tool for acquiring geometric attributes of trees and vegetation, which lays a solid foundation for 3-dimensional tree modelling. Existing studies on tree modelling from laser scanning data are vast. However, some works cannot guarantee sufficient modelling accuracy, while some other works are mainly rule-based and therefore highly depend on user inputs. In this paper, we propose a novel method to accurately and automatically reconstruct detailed 3D tree models from laser scans. We first extract an initial tree skeleton from the input point cloud by establishing a minimum spanning tree using the Dijkstra shortest-path algorithm. Then, the initial tree skeleton is pruned by iteratively removing redundant components. After that, an optimization-based approach is performed to fit a sequence of cylinders to approximate the geometry of the tree branches. Experiments on various types of trees from different data sources demonstrate the effectiveness and robustness of our method. The overall fitting error (i.e., the distance between the input points and the output model) is less than 10 cm. The reconstructed tree models can be further applied in the precise estimation of tree attributes, urban landscape visualization, etc. The source code of this work is freely available at https://github.com/tudelft3d/adtree