An inequality connecting entropy distance,Fisher Information and large deviations

In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.     

一阶最优性条件研究

本对由Botsko的关于多变量函数取极值的一阶导数检验条件定理^[1]进行了分析研究，给出了更实用而简捷的差别条件。最后，举出若干例子予以说明。     

C^n中子空间之间极端主角的一些应用

本文给出了Ｃ＾ｎ中子空间之间最大和最小主角在矩阵逼近，投影算子的扰动分析，群逆以及Ｏｒａｘｉｎ逆的扰动估计，条件数理论，Ｂｏｔｔ－Ｄｕｆｆｉｎ系统扰动分析中一些应用。     

一类小缺陷码的链条件

利用射影几何方法在小缺陷码中,NMDS码是链条件码;给出k维NμMDS(0μk-2)码满足链条件的一个充要条件与一些易判断的充分条件.     

非完整系统Chetaev动力学和vakonomic动力学的等价条件

就一般非完整约束系统，从约束方程满足的变分恒等式出发，利用增广位形流形上的向量场定义三类非自由变分，即非完整变分：vakonomic变分、Hlder变分、Suslov变分，并讨论它们之间的关系以及它们成为自由变分的充要条件.利用非完整变分以及相应的积分变分原理建立两类动力学方程：vakonomic方程和Routh方程或Chaplygin方程.通过vakonomic方程分别与Routh方程和Chaplygin方程比较，得到它们具有共同解的两类充分必要条件.这些条件并不是约束的可积性条件. 关键词： 非完整约束 非完整变分 Chetaev条件 vakonomic动力学     

图有分数因子的度条件

本文研究了图有分数因子的度条件,得到了下面的结果：令k(?)1是一个整数,G是一个连通的n阶图,n(?)4k-3且最小度δ(G)(?)k,若对于每一对不相邻的顶点u,v∈V(G)都有max{d_G(u),d_G(v)}(?)n/2,则G有分数k-因子．并指出该结果在一定意义上是最好可能的。     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

Coupled intervals in the discrete calculus of variations: necessity and sufficiency

In this work we study nonnegativity and positivity of a discrete quadratic functional with separately varying endpoints. We introduce a notion of an interval coupled with 0, and hence, extend the notion of conjugate interval to 0 from the case of fixed to variable endpoint(s). We show that the nonnegativity of the discrete quadratic functional is equivalent to each of the following conditions: The nonexistence of intervals coupled with 0, the existence of a solution to Riccati matrix equation and its boundary conditions. Natural strengthening of each of these conditions yields a characterization of the positivity of the discrete quadratic functional. Since the quadratic functional under consideration could be a second variation of a discrete calculus of variations problem with varying endpoints, we apply our results to obtain necessary and sufficient optimality conditions for such problems. This paper generalizes our recent work in [R. Hilscher, V. Zeidan, Comput. Math. Appl., to appear], where the right endpoint is fixed.     

Metastability in the Potts model on the Cayley tree

Metastability in the ferromagneticp-state Potts model defined on the Cayley tree is discussed. It is shown that the sign of the boundary fieldH _s determines the order of the transition as well as the stability of the low-temperature phase. Lowering the temperature withH _s >0, a system withp<2 (p>2) will display a second (first)-order transition to a metastable (stable) phase. ForH _s >0 a second (first)-order transition to a metastable (stable) phase occurs ifp>2 (p<2). In this case the system also has a residual entropy which is negative forp<2.     

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian

This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 9–11, 2004