Anisotropy Effects and Observational Data on the Constraints of Evolution Dark Energy Models

We investigate cosmological dark energy models where the accelerated expansion of the universe is driven by a field with an anisotropic universe. The constraints on the parameters are obtained by maximum likelihood analysis using observational of 194 Type Ia supernovae(SNIa) and the most recent joint light-curve analysis(JLA) sample. In particular we reconstruct the dark energy equation of state parameter w(z) and the deceleration parameter q(z). We find that the best fit dynamical w(z) obtained from the 194 SNIa dataset does not cross the phantom divide line w(z) =-1 and remains above and close to w(z)≈-0.92 line for the whole redshift range 0 ≤ z ≤ 1.75 showing no evidence for phantom behavior. By applying the anisotropy effect on the ΛCDM model, the joint analysis indicates that ?_(σ0)= 0.0163 ± 0.03,with 194 SNIa, ?_(σ0)=-0.0032 ± 0.032 with 238 the SiFTO sample of JLA and ?_(σ0)= 0.011 ± 0.0117 with 1048 the SALT2 sample of Pantheon at 1σ′confidence interval. The analysis shows that by considering the anisotropy, it leads to more best fit parameters in all models with JLA SNe datasets. Furthermore, we use two statistical tests such as the usual χ_(min)~2/dof and p-test to compare two dark energy models with ΛCDM model. Finally we show that the presence of anisotropy is confirmed in mentioned models via SNIa dataset.     

Strong cliques in vertex-transitive graphs

A clique (resp, independent set) in a graph is strong if it intersects every maximal independent set (resp, every maximal clique). A graph is clique intersect stable set (CIS) if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques. In this paper we prove that a clique $C$ in a vertex-transitive graph $\mathrm{\Gamma }$ is strong if and only if $\text{◂=▸}\text{◂⋅▸}\mid C\mid \mid I\mid =\mid V\left(\mathrm{\Gamma }\right)\mid$ for every maximal independent set $I$ of $\mathrm{\Gamma }$. On the basis of this result we prove that a vertex-transitive graph is CIS if and only if it admits a strong clique and a strong independent set. We classify all vertex-transitive graphs of valency at most 4 admitting a strong clique, and give a partial characterization of 5-valent vertex-transitive graphs admitting a strong clique. Our results imply that every vertex-transitive graph of valency at most 5 that admits a strong clique is localizable. We answer an open question by providing an example of a vertex-transitive CIS graph which is not localizable.     

A review of mobility metrics for next generation vehicle mobility models

In the United States, the NATO Reference Mobility Model (NRMM) has been used for evaluating military ground vehicle mobility and the Vehicle Cone Index (VCI) has been selected as a mobility metric. VCI represents the minimum soil strength required for a vehicle to consistently make a specific number of passes, usually one or fifty passes. In the United Kingdom, the Mean Maximum Pressure (MMP) has been adopted as a metric for assessing military vehicle cross-country mobility. MMP is the mean value of the maxima occurring under all the wheel stations of a vehicle. Both VCI and MMP are empirically based. This paper presents a review of the basis upon which VCI and MMP were developed, as well as their applications to evaluating vehicle mobility in practice. With the progress in terramechanics and in modelling and simulation techniques in recent years, there is a growing desire to develop physics-based mobility metrics for next generation vehicle mobility models. Based on the review, criteria for selecting physics-based mobility metrics are proposed. Following these criteria, metrics for characterizing military vehicle traction limits and traversability on a given operating area are recommended.     

Monomer relative affinity in a copolymer

This paper analyzes data from experiments on simple polymer chains. It measures the extent to which a particular monomer prefers to link with another of the same type. To analyze the data, it derives the likelihood function for a two‐state Markov model in which only the number in each state, but not the order, is observed. This technology is applied to a data set on which experimenters mixed lactic‐glycolic monomers with a known proportion of a contaminant consisting of an extra lactic acid. The resulting copolymers were subjected to matrix‐assisted laser desorption ionization mass spectrometry. This records the number of copolymers at each atomic weight, which can be associated with a given length of copolymer and number of contaminant monomers. Analysis of the data shows that the proportion of contaminant monomers exceeded the proportion of experimentally induced contaminant. Maximum likelihood estimates using the data show that lactic‐glycolic monomers show a positive affinity for the contaminant. Copyright © 2015 John Wiley & Sons, Ltd.     

The mean of the running maximum of an integrated Gauss–Markov process and the connection with its first-passage time

We find explicit formulae for the mean of the running maximum of conditional and unconditional Brownian motion; they are used to obtain the mean, a(t), of the running maximum of an integrated Gauss–Markov process. Then, we deal with the connection between the moments of its first-passage-time and a(t). As explicit examples, we consider integrated Brownian motion and integrated Ornstein–Uhlenbeck process.     

一类非线性椭圆方程的刘维尔型定理

设（Mⁿ,g）是一个n维非紧的完备黎曼流行.本文考虑有正解的非线性椭圆方程△_fu+au log u=0的刘维尔型定理,其中a是一个非零常数.利用Bochner公式和极大值原理,获得了以上方程在Bakry-Emery里奇曲率有下界时正解的Li-Yau型梯度估计和某些有关的刘维尔理论,推广了文献[7]的结果.     

An alternative proof of lower bounds for the first eigenvalue on manifolds

Recently, Andrews and Clutterbuck [1] gave a new proof of the optimal lower eigenvalue bound on manifolds via modulus of continuity for solutions of the heat equation. In this short note, we give an alternative proof of Theorem 2 in [1]. More precisely, following Ni's method (Section 6 of [5]), we give an elliptic proof of this theorem.