The James constant, the Jordan-von Neumann constant, weak orthogonality, and fixed points for multivalued mappings

We give some sufficient conditions for the Domínguez-Lorenzo condition in terms of the James constant, the Jordan-von Neumann constant, and the coefficient of weak orthogonality. As a consequence, we obtain fixed point theorems for multivalued nonexpansive mappings.     

Fixed-point theorems for families of weakly non-expansive maps

In this paper, we present some fixed-point theorems for families of weakly non-expansive maps under some relatively weaker and more general conditions. Our results generalize and improve several results due to Jungck [G. Jungck, Fixed points via a generalized local commutativity, Int. J. Math. Math. Sci. 25 (8) (2001) 497-507], Jachymski [J. Jachymski, A generalization of the theorem by Rhoades and Watson for contractive type mappings, Math. Japon. 38 (6) (1993) 1095-1102], Guo [C. Guo, An extension of fixed point theorem of Krasnoselski, Chinese J. Math. (P.O.C.) 21 (1) (1993) 13-20], Rhoades [B.E. Rhoades, A comparison of various definitions of contractive mappings, Trans. Amer. Math. Soc. 226 (1977) 257-290], and others.     

变换中含有孤立稳定点的第二积分换元定理

在不定积分第二积分换元定理的条件中,要求变换x=φ(t)不含有稳定点,即:φ′(t)≠0.当变换x=φ(t)中含有孤立稳定点时,给出了变换中含有孤立稳定点的第二积分换元定理.拓宽了第二积分换元定理的应用范围.     

Nondensely defined evolution impulsive differential inclusions with nonlocal conditions

In this paper, we shall establish sufficient conditions for the existence of integral solutions for some nondensely defined evolution impulsive differential inclusions in Banach spaces with nonlocal conditions.     

Deformations of functionals and bifurcations of extremals

We study homology characteristics of critical values and extremals of Lipschitz functionals defined on bounded closed convex subsets of a reflexive space that are invariant under deformations. Sufficient conditions for the existence of a bifurcation point of a multivalued potential operator (the switch principle for the typical number of an extremal) are established.     

一类具有转向点问题的n阶近似解

用Langer变换和Olver变换求得一类具有转向点问题的n阶近似解:y(x)=v(x)ψ(x),其中ψ=λ12-14×(x2-1)14,2332=-λx∫11-τ2dτ,v(z)=A(z,λ)ξ(λ23z)+B(z,λ)'ζ(λ23z).并探讨了其特征值问题,得到λn=4n+1112,n=0,1,2….由此给出了该类问题的解的一般性结论.     

四阶微分方程奇异边值问题的正解

本文利用锥上的不动点指数理论,在更一般的边界条件下讨论了一类四阶奇异边值问题正解的存在性并给出了应用．     

横向放大率法测定光具组的基点

介绍了用横向放大率法确定两薄透镜组成的光具组基点的原理和方法,该方法采用线阵光电耦合器件(CCD)测量物经光学系统成像的横向放大率,进一步提高了测量精度.     

动力系统的稳定化问题

In this paper, we are concerned with the problem of stabilization for autonomous dynamical systems. We use theories in Liapunov stability and Lasalle stability theory and show that system (H) is stabilizable.     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.