一个含有和、积、幂结构的新不等式

本利用一个凸函数的凸性，并结合Jensen加权不等式，导出一个含和、积、幂结构的新不等式，它包含了一些名不等式。     

多维OU型Markov过程常返性判别的一个充分条件

本文给出了多维ＯＵ型Ｍａｒｋｏｖ过程常返性判别的一个充分条件，并由此讨论了几类多维ＯＵ型Ｍａｒｋｏｖ过程的常返性，同时以一个实例说明了此条件不是多维ＯＵ型Ｍａｒｋｏｖ过程常返的必要条件。     

线性互补问题的阻尼牛顿法的有限终止性

在（２）中，Ｈａｒｋｅｒ和Ｐａｎｇ提出了如下一个公开问题，对于线性互补问题的阻尼牛顿算法，当它收敛时，算法是否能在有限步内终止？本文对此问题给出一个肯定回答，而且进一步给出一个新的求解一般线性互补问题的有限终止算法，这个算法避免了阻尼牛顿算法可能不收敛的情形。     

论四元数矩阵的正定性

本文给出了正定四元数矩阵的定义，同时给出了正定四元数矩阵的一个充要条件，一个必要条件，一个充分条件。     

一类高阶非线性差分方程的振动性和稳定性

建立了非线性差分方程所有正解关于其正平衡点振动的充要条件，部分地解决了文[1]中的一个公开问题，同时还获得了方程的正平衡点渐近稳定的一个充分性判据．     

中立型时滞差分方程的振性与正解存在性

本文研究了一类中立型时滞差分方程的振动性和正解存在性，获得了该方程所有解振动的“Sharp”条件及存在正解的一个充分条件．     

素环的对称双导与交换性

本文讨论当一个素环容许一个非零对称双导时，其迹函数与此环的交换性的关系，得到了与［４，５］类似的结果．     

可化为一个“积分小”系数的二阶非线性微分方程解的渐近性和振动性

本文讨论可化为一个“积分小”系数的二阶非线性微分方程的渐近性和振动性，得到若干充分性定理，推广和改进了文［１－４］的有关结果。     

关于Katai的一个猜想的证明

本文证明了：如果实值加性函数ｆ（ｎ）满足条件‖ｆ（ｎ＋１）－ｆ（ｎ）‖＝ｏ（１），（ｎ→∞）这里‖‖表示一实数与最近的整数的距离，则一定有某常数ｃ使ｆ（ｎ）一ｃｌｏｇｎ为整数值加性函数．这证实了ＫａｔａｉⅠ的一个猜想．     

高耦合边值问题正解的存在性

本文通过研究非线性项f(t,x1,x2…，xn-1）和g(t,y1,y2…yn-1)的性质，给出了高阶耦合边值问题至少存在一个正解的条件，同时，运用该结论建立了两个正解的存在性定理。     

管状曲面在曲线论中的应用

研究了围绕曲线的管状曲面上的曲率线,渐近线与测地线,给出它们的方程,揭示了这些曲线与Bertrand曲线或Mannheim曲线之间的关系,采用新的方法给出一条曲线是Bertrand曲线或Mannheim曲线的充要条件的另一种证明以及Mannheim侣线的曲率与挠率之间的关系．     

DC programming techniques for solving a class of nonlinear bilevel programs

We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

A Dynamic Frictional Contact Problem with Normal Damped Response

We consider a mathematical model which describes the frictional contact between a viscoelastic body and a reactive foundation. The process is assumed to be dynamic and the contact is modeled with a general normal damped response condition and a local friction law. We present a variational formulation of the problem and prove the existence and uniqueness of the weak solution, using results on evolution equations with monotone operators and a fixed point argument. We then introduce and study a fully discrete numerical approximation scheme of the variational problem, in terms of the velocity variable. The numerical scheme has a unique solution. We derive error estimates under additional regularity assumptions on the data and the solution.     

Weakly convex sets and modulus of nonconvexity

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach spaces with the modulus of convexity of the second order. Using the new definition of the weakly convex set with the given modulus of nonconvexity we prove a new retraction theorem and we obtain new results about continuity of the intersection of two continuous set-valued mappings (one of which has nonconvex images) and new affirmative solutions of the splitting problem for selections. We also investigate relationship between the new definition and the definition of a proximally smooth set and a smooth set.     

A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge

This paper considers a two-stage distribution problem of a supply chain that is associated with a fixed charge. Two kinds of cost are involved in this problem: a continuous cost that linearly increases with the amount transported between a source and a destination, and secondly, a fixed charge, that incurs whenever there exists a transportation of a non-zero quantity between a source and a destination. The objective criterion is the minimisation of the total cost of distribution. A genetic algorithm (GA) that belongs to evolutionary search heuristics is proposed and illustrated. The proposed methodology is evaluated for its solution quality by comparing it with the approximate and lower bound solutions. Thus, the comparison reveals that the GA generates better solution than the approximation method and is capable of providing solution either equal or closer to the lower bound solution of the problem.     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Noncommutative spectral decomposition with quasideterminant

We develop a noncommutative analogue of the spectral decomposition with the quasideterminant defined by I. Gelfand and V. Retakh. In this theory, by introducing a noncommutative Lagrange interpolating polynomial and combining a noncommutative Cayley-Hamilton's theorem and an identity given by a Vandermonde-like quasideterminant, we can systematically calculate a function of a matrix even if it has noncommutative entries. As examples, the noncommutative spectral decomposition and the exponential matrices of a quaternionic matrix and of a matrix with entries being harmonic oscillators are given.     

Kripke submodels and universal sentences

We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theorem. If a Kripke model is viewed as a functor from a small category to the category of all classical models with (homo)morphisms between them, then we define a submodel of a Kripke model to be a restriction of the original Kripke model to a subcategory of its domain, where every node in the subcategory is mapped to a classical submodel of the corresponding classical model in the range of the original Kripke model. We call a sentence universal if it is built inductively from atoms (including ? and ⊥) using ∧, ∨, ?, and →, with the restriction that antecedents of → must be atomic. We prove that an intuitionistic theory is axiomatized by universal sentences if and only if it is preserved under Kripke submodels. We also prove the following analogue of a classical model‐consistency theorem: The universal fragment of a theory Γ is contained in the universal fragment of a theory Δ if and only if every rooted Kripke model of Δ is strongly equivalent to a submodel of a rooted Kripke model of Γ. Our notions of Kripke submodel and universal sentence are natural in the sense that in the presence of the rule of excluded middle, they collapse to the classical notions of submodel and universal sentence. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)