This paper concerns the physical behaviors of any solutions to the one dimensional compressible Navier-Stokes equations for viscous and heat conductive gases with constant viscosities and heat conductivity for fast decaying density at far fields only. First, it is shown that the specific entropy becomes not uniformly bounded immediately after the initial time, as long as the initial density decays to vacuum at the far field at the rate not slower than $O\left(\frac1{|x|^{\ell_\rho}}\right)$ with $\ell_\rho>2$. Furthermore, for faster decaying initial density, i.e., $\ell_\rho\geq4$, a sharper result is discovered that the absolute temperature becomes uniformly positive at each positive time, no matter whether it is uniformly positive or not initially, and consequently the corresponding entropy behaves as $O(-\log(\varrho_0(x)))$ at each positive time, independent of the boundedness of the initial entropy. Such phenomena are in sharp contrast to the case with slowly decaying initial density of the rate no faster than $O(\frac1{x^2})$, for which our previous works \cite{LIXINADV,LIXINCPAM,LIXIN3DK} show that the uniform boundedness of the entropy can be propagated for all positive time and thus the temperature decays to zero at the far field. These give a complete answer to the problem concerning the propagation of uniform boundedness of the entropy for the heat conductive ideal gases and, in particular, show that the algebraic decay rate $2$ of the initial density at the far field is sharp for the uniform boundedness of the entropy. The tools to prove our main results are based on some scaling transforms, including the Kelvin transform, and a Hopf type lemma for a class of degenerate equations with possible unbounded coefficients.

In this paper, we design a new class of central compact schemes based on the cell-centered compact schemes of Lele {[}S.K. Lele, Compact finite difference schemes with spectral-like resolution, J. Comput. Phys. 103 (1992) 16-42{]}. These schemes equate a weighted sum of the nodal derivatives of a smooth function to a weighted sum of the function on both the grid points (cell boundaries) and the cell-centers. In our approach, instead of using a compact interpolation to compute the values on cell-centers, the physical values on these half grid points are stored as independent variables and updated using the same scheme as the physical values on the grid points. This approach increases the memory requirement but not the computational costs. Through systematic Fourier analysis and numerical tests, we observe that the schemes have excellent properties of high order, high resolution and low dissipation. It is an ideal class of schemes for the simulation of multi-scale problems such as aeroacoustics and turbulence.

This work presents Sketch2Scene, a framework that automatically turns a freehand sketch drawing inferring multiple scene objects to semantically valid, well arranged scenes of 3D models. Unlike the existing works on sketch-based search and composition of 3D models, which typically process individual sketched objects one by one, our technique performs co-retrieval and co-placement of 3D relevant models by jointly processing the sketched objects. This is enabled by summarizing functional and spatial relationships among models in a large collection of 3D scenes as structural groups. Our technique greatly reduces the amount of user intervention needed for sketch-based modeling of 3D scenes and fits well into the traditional production pipeline involving concept design followed by 3D modeling. A pilot study indicates that the 3D scenes automatically synthesized by our technique in seconds are comparable to those manually created by an artist in hours in terms of visual aesthetics.

No abstract uploaded!

Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat and folded. An important problem in knot theory is to study the minimal ratio of length to width of a flat knotted ribbon. This minimal ratio is called the ribbonlength of the knot. It has been conjectured that the ribbonlength has an upper bound and a lower bound which are both linear in the crossing number of the knot. In the first part of the paper, we use grid diagrams to construct flat knotted ribbons and prove an explicit quadratic upper bound on the ribbonlength for all non-trivial knots. We then improve the quadratic upper bound to a linear upper bound for all non-trivial torus knots and twist knots. Our approach of using grid diagrams to study flat knotted ribbons is novel and can likely be used to obtain a linear upper bound for more general families of knots. In the second part of the paper, we obtain a sharper linear upper bound on the ribbonlength for nontrivial twist knots by constructing a flat knotted ribbon via folding the ribbon over itself multiple times to shorten the length.