Steiner tree packing number and tree connectivity

Let $S$ be a set of at least two vertices in a graph $G$. A subtree $T$ of $G$ is a $S$-Steiner tree if $S?V\left(T\right)$. Two $S$-Steiner trees $T_1$ and $T_2$ are edge-disjoint (resp. internally vertex-disjoint) if $E\left(T_1\right)\cap E\left(T_2\right)=?$ (resp. $E\left(T_1\right)\cap E\left(T_2\right)=?$ and $V\left(T_1\right)\cap V\left(T_2\right)=S$). Let ${\lambda }_G\left(S\right)$ (resp. ${\kappa }_G\left(S\right)$) be the maximum number of edge-disjoint (resp. internally vertex-disjoint) $S$-Steiner trees in $G$, and let ${\lambda }_k\left(G\right)$ (resp. ${\kappa }_k\left(G\right)$) be the minimum ${\lambda }_G\left(S\right)$ (resp. ${\kappa }_G\left(S\right)$) for $S$ ranges over all $k$-subset of $V\left(G\right)$. Kriesell conjectured that if ${\lambda }_G\left(\{x,y\}\right)\ge 2k$ for any $x,y\in S$, then ${\lambda }_G\left(S\right)\ge k$. He proved that the conjecture holds for $\left|S\right|=3,4$. In this paper, we give a short proof of Kriesell’s Conjecture for $\left|S\right|=3,4$, and also show that ${\lambda }_k\left(G\right)\ge ?\frac{1}{k?1}?\frac{k?}{2}??$ (resp. ${\kappa }_k\left(G\right)\ge ?\frac{1}{k?1}?\frac{k?}{2}??$ ) if $\lambda \left(G\right)\ge ?$ (resp. $\kappa \left(G\right)\ge ?$) in $G$, where $k=3,4$. Moreover, we also study the relation between ${\kappa }_k\left(L\left(G\right)\right)$ and ${\lambda }_k\left(G\right)$, where $L\left(G\right)$ is the line graph of $G$.     

New algebraic structures from Hermitian one-matrix model

Virasoro constraint is the operator algebra version of one-loop equation for a Hermitian one-matrix model, and it plays an important role in solving the model. We construct the realization of the Virasoro constraint from the Conformal Field Theory (CFT) method. From multi-loop equations of the one-matrix model, we get a more general constraint. It can be expressed in terms of the operator algebras, which is the Virasoro subalgebra with extra parameters. In this sense, we named as generalized Virasoro constraint. We enlarge this algebra with central extension, this is a new kind of algebra, and the usual Virasoro algebra is its subalgebra. And we give a bosonic realization of its subalgebra.     

Almost Automorphic Dynamics of Generalized Li\'enard Equation

In this study, we focus on the solutions of the Li\''enard equation being bounded in the future and characterize the almost automorphic, asymptotically almost automorphic, and weighted pseudo almost automorphic dynamics. An example is presented to illustrate the main findings.     

Explicit exact periodic wave solutions and their limit forms for a long waves-short waves model

A long waves-short waves model is studied by using the approach of dynamical systems. The sufficient conditions to guarantee the existence of solitary wave, kink and anti-kink waves, and periodic wave in different regions of the parametric space are given. All possible explicit exact parametric representations of above traveling waves are presented. When the energy of Hamiltonian system corresponding to this model varies, we also show the convergence of the periodic wave solutions, such as the periodic wave solutions converge to the solitary wave solutions, kink and anti-kink wave solutions, and periodic wave solutions, respectively.     

Algorithm of Barrier Objective Penalty Function

In this paper, an algorithm of barrier objective penalty function for inequality constrained optimization is studied and a conception–the stability of barrier objective penalty function is presented. It is proved that an approximate optimal solution may be obtained by solving a barrier objective penalty function for inequality constrained optimization problem when the barrier objective penalty function is stable. Under some conditions, the stability of barrier objective penalty function is proved for convex programming. Specially, the logarithmic barrier function of convex programming is stable. Based on the barrier objective penalty function, an algorithm is developed for finding an approximate optimal solution to an inequality constrained optimization problem and its convergence is also proved under some conditions. Finally, numerical experiments show that the barrier objective penalty function algorithm has better convergence than the classical barrier function algorithm.     

基于多尺度自适应阶ARMA的混沌序列多步预测

混沌时间序列在自然界以及人们的生产生活中很常见,混沌序列看似杂乱无章但相较于纯随机序列其中蕴含着一些非线性的运动特征,提出一种基于多尺度自适应阶ARMA的混沌时间序列多步预测方法.首先利用自适应噪声的完备经验模态分解(CEEMDAN)对原始混沌序列进行分解,获得不同尺度的固有模态分量(IMF)和残余分量.然后采用经粒子...     

The rate of convergence on fractional power dissipative operator on some sobolev type spaces

In [3], Chen, Deng, Ding and Fan proved that the fractional power dissipative operator is bounded on Lebesgue spaces L~p(R~n), Hardy spaces H~p(R~n) and general mixed norm spaces, which implies almost everywhere convergence of such operator. In this paper, we study the rate of convergence on fractional power dissipative operator on some sobolev type spaces.     

Modified Lagrangian vortex method with improved boundary conditions for water waves past a thin bottom‐standing barrier

Herein, the modified Lagrangian vortex method (LVM), a hybrid analytical‐numerical algorithm per se, is devised to simulate the process of vortex formation and shedding from the sharp edge of a zero‐thickness vertical plate under linear water‐wave attack. Application of the Helmholtz decomposition facilitates a convenient switch between the inviscid‐ and viscous‐flow models, thereby enabling easy incorporation of vorticity effects into the potential‐flow calculations for the viscous‐dominated region. In evaluating the potential‐flow component, making good use of the quickly convergent technique with singular basis functions, correctly capturing the singular behavior in velocity fields near the tip of the plate, leads to a considerable reduction of computational burdens and to 12‐decimal‐place accuracy. The viscous correction is carried out via the meshless LVM with improved boundary conditions. Comparisons with previously published results show good agreement. Simulations of vortex generation and evolution illuminate the ability of the present method, and provide a supplement to pertinent experimental works. The hybrid scheme proposed herein allows flexibility for the former LVM and convenience in the code development. Such a compromise fits particularly well for the high‐resolution modeling of sharp‐edged vortex shedding without heavy numerical developments. Copyright © 2014 John Wiley & Sons, Ltd.