On the All-Speed Roe-type Scheme for Large Eddy Simulation of Homogeneous Decaying Turbulence

As the representative of the shock-capturing scheme, the Roe scheme fails to LES because important turbulent characteristics cannot be reproduced such as the famous k-5/3 spectral law owing to large numerical dissipation. In this paper, the Roe scheme is divided into five parts: , , , , and , which means basic upwind dissipation, pressure-difference-driven and velocity-difference-driven modification of the interface fluxes and pressure, respectively. Then, the role of each part on LES is investigated by homogeneous decaying turbulence. The results show that the parts , , and have little effect on LES. It is important especially for because it is necessary for computation stability. The large numerical dissipation is due to and , and each of them has much larger dissipation than SGS dissipation. According to these understanding, an improved all-speed LES-Roe scheme is proposed, which can give enough good LES results for even coarse grid resolution with usually adopted reconstruction

Criterion of quantum synchronization and controllable quantum synchronization based on an optomechanical system

We propose a quantitative criterion to determine whether the coupled quantum systems can achieve complete synchronization or phase synchronization in the process of analyzing quantum synchronization. Adopting the criterion, we discuss the quantum synchronization effects between optomechanical systems and find that the error between the systems and the fluctuation of error are sensitive to coupling intensity by calculating the largest Lyapunov exponent of the model and quantum fluctuation, respectively. Through taking the appropriate coupling intensity, we can control quantum synchronization even under different logical relationship between switches. Finally, we simulate the dynamical evolution of the system to verify the quantum synchronization criterion and to show the ability of synchronization control

Detecting Low Rating Android Apps Before They Have Reached the Market

Driven by the popularity of the Android system, Android app markets enjoy a booming prosperity in recent years. One critical problem for modern Android app markets is how to prevent apps that are going to receive low ratings from reaching end users. For this purpose, traditional approaches have to publish an app first and then collect enough user ratings and reviews so as to determine whether the app is favored by end users or not. In this way, however, the reputation of the app market has already been damaged. To address this problem, we propose a novel technique, i.e., Sextant , to detect low rating Android apps based on the .apk files.With our proposed technique, an Android app market can prevent from risking its reputation on exposing low rating apps to users. Sextant is developed based on novel static analysis techniques as well as machine learning techniques. In our study, our proposed approach can achieve on average 90.50% precision and 94.31% recall.Comment: 12 page

The asymptotic value of graph energy for random graphs with degree-based weights

In this paper, we investigate the energy of a weighted random graph $G_p(f)$ in $G_{n,p}(f)$, in which each edge $ij$ takes the weight $f(d_i,d_j)$, where $d_v$ is a random variable, the degree of vertex $v$ in the random graph $G_p$ of the Erd\"{o}s--R\'{e}nyi random graph model $G_{n,p}$, and $f$ is a symmetric real function on two variables. Suppose $|f(d_i,d_j)|\leq C n^m$ for some constants $C, m>0$, and $f((1+o(1))np,(1+o(1))np)=(1+o(1))f(np,np)$. Then, for almost all graphs $G_p(f)$ in $G_{n,p}(f)$, the energy of $G_p(f)$ is $(1+o(1))f(np,np)\frac{8}{3\pi}\sqrt{p(1-p)}\cdot n^{3/2},$ where $p\in(0,1)$ is any fixed and independent of $n$. Consequently, with this one basket we can get the asymptotic values of various kinds of graph energies of chemical use, such as Randi\'c energy, ABC energy, and energies of random matrices obtained from various kinds of degree-based chemical indices.Comment: 13 page

On the immersed submanifolds in the unit sphere with parallel Blaschke tensor

As is known, the Blaschke tensor $A$ (a symmetric covariant $2$-tensor) is one of the fundamental M\"obius invariants in the M\"obius differential geometry of submanifolds in the unit sphere $\mathbb S^n$, and the eigenvalues of $A$ are referred to as the Blaschke eigenvalues. In this paper, we shall prove a classification theorem for immersed umbilic-free submanifolds in $\mathbb S^n$ with a parallel Blaschke tensor. For proving this classification, some new kinds of examples are first defined.Comment: Submitte

On cyclic Higgs bundles

In this paper, we derive a maximum principle for a type of elliptic systems and apply it to analyze the Hitchin equation for cyclic Higgs bundles. We show several domination results on the pullback metric of the (possibly branched) minimal immersion $f$ associated to cyclic Higgs bundles. Also, we obtain a lower and upper bound of the extrinsic curvature of the image of $f$. As an application, we give a complete picture for maximal $Sp(4,\mathbb{R})$-representations in the $2g-3$ Gothen components and the Hitchin components.Comment: 27 pages, comments are welcom

Finite-temperature quantum criticality in a complex-parameter plane

A conventional quantum phase transition (QPT) occurs not only at zero temperature, but also exhibits finite-temperature quantum criticality. Motivated by the discovery of the pseudo-Hermiticity of non-Hermitian systems, we explore the finite-temperature quantum criticality in a non-Hermitian PT -symmetric Ising model. We present the complete set of exact eigenstates of the non-Hermitian Hamiltonian, based on which the mixed-state fidelity in the context of biorthogonal bases is calculated. Analytical and numerical results show that the fidelity approach to finite-temperature QPT can be extended to the non-Hermitian Ising model. This paves the way for experimental detection of quantum criticality in a complex-parameter plane.Comment: 6 pages, 10 figure

Restricted qq-Isometry Properties Adapted to Frames for Nonconvex lql_q-Analysis

This paper discusses reconstruction of signals from few measurements in the situation that signals are sparse or approximately sparse in terms of a general frame via the $l_q$-analysis optimization with $0<q\leq 1$. We first introduce a notion of restricted $q$-isometry property ($q$-RIP) adapted to a dictionary, which is a natural extension of the standard $q$-RIP, and establish a generalized $q$-RIP condition for approximate reconstruction of signals via the $l_q$-analysis optimization. We then determine how many random, Gaussian measurements are needed for the condition to hold with high probability. The resulting sufficient condition is met by fewer measurements for smaller $q$ than when $q=1$. The introduced generalized $q$-RIP is also useful in compressed data separation. In compressed data separation, one considers the problem of reconstruction of signals' distinct subcomponents, which are (approximately) sparse in morphologically different dictionaries, from few measurements. With the notion of generalized $q$-RIP, we show that under an usual assumption that the dictionaries satisfy a mutual coherence condition, the $l_q$ split analysis with $0<q\leq1$ can approximately reconstruct the distinct components from fewer random Gaussian measurements with small $q$ than when $q=1$Comment: 40 pages, 1 figure, under revision for a journa

On the immersed submanifolds in the unit sphere with parallel Blaschke tensor II

As is known, the Blaschke tensor $A$ (a symmetric covariant $2$-tensor) is one of the fundamental M\"obius invariants in the M\"obius differential geometry of submanifolds in the unit sphere $\mathbb S^n$, and the eigenvalues of $A$ are referred to as the Blaschke eigenvalues. In this paper, we continue our job for the study on the submanifolds in \bbs^n with parallel Blaschke tensors which we simply call {\em Blaschke parallel submanifolds} to find more examples and seek a complete classification finally. The main theorem of this paper is the classification of Blaschke parallel submanifolds in $\mathbb S^n$ with exactly three distinct Blaschke eigenvalues. Before proving this classification we define, as usual, a new class of examples.Comment: submitte

Secret sharing with a class of minimal linear codes

There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access structures of the schemes based on linear codes is very hard. This paper proposed the concept of minimal linear code, which makes the determination of the access structures of the schemes based on the duals of minimal linear codes easier. It is proved that the shortening codes of minimal linear codes are also minimal ones. Then the conditions whether several types of irreducible cyclic codes are minimal linear codes are presented. Furthermore, the access structures of secret sharing schemes based on the duals of minimal linear codes are studied, and these access structures in specific examples are obtained through programming.Comment: This paper has been withdrawn by the author due to the wrong proof of Theorem 3.3 and unclear expression of Algorith