Sharp condition of global existence for second-order derivative nonlinear Schrödinger equations in two space dimensions

This paper discusses a class of second-order derivative nonlinear Schrödinger equations which are used to describe the upper-hybrid oscillation propagation. By establishing a variational problem, applying the potential well argument and the concavity method, we prove that there exists a sharp condition for global existence and blow-up of the solutions to the nonlinear Schrödinger equation. In addition, we also answer the question: how small are the initial data, the global solutions exist?     

Revisiting Gouy phase

The aim of this paper is to highlight the added value of the generalized Gouy phase shift introduced by Siegman. Although suited for optical systems study, including those more complex than free space, we note that it did not meet the use that it deserves so far. The analysis of the whole of the ideas and analytical approaches associated to the important concept of the Gouy phase proves its effectiveness.

Usually, the resonance condition is systematically built on the basis of the equivalent empty cavity. Unfortunately, this approach does not cover some of the useful parameters of the real resonator. By means of the generalized Gouy phase and the self-consistent complex parameter q, we derive here a new approach for the calculation of the resonance condition for the real cavity. Moreover, the use of the generalized Gouy phase clearly simplifies the study of resonators, while making it possible to avoid the use of the Huygens’ Fresnel integral.     

Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

We prove the Kuhn-Tucker sufficient optimality condition, the Wolfe duality, and a modified Mond-Weir duality for vector optimization problems involving various types of invex-convexlike functions. The class of such functins contains many known generalized convex functions. As applications, we demonstrate that, under invex-convexlikeness assumptions, the Pontryagin maximum principle is a sufficient optimality condition for cooperative differential games. The Wolfe duality is established for these games.The author is indebted to the referees and Professor W. Stadler for valuable remarks and comments, which have been used to revise considerably the paper.     

Probabilistic Analysis of Condition Numbers for Linear Programming

In this paper, we provide bounds for the expected value of the log of the condition number C(A) of a linear feasibility problem given by a n × m matrix A (Ref. 1). We show that this expected value is O(min{n, m log n}) if n > m and is O(log n) otherwise. A similar bound applies for the log of the condition number C _R(A) introduced by Renegar (Ref. 2).     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

抽样调查中最佳测量次数的确定

现场抽样调查中，由于测量误差的存在，使得所测变量实测值的方差增大，通过增加每个体的测量次数可以控制测量误差，但这样每个体调查费用增大。本文对测量信度Ｒ，每个体测量次数ｍ与相应所需的样本含量ｎｍ、调查费用Ｔｎ的关系进行了探讨，并介绍了如何根据Ｒ，及每个体测量费用占其总费用构成比Ｃ，确定最佳测量次数ｍ值，以达到最佳控制调查费用的目的，这对我们在大型现场调查中进行经济效益分析具有重大的理论指导意义。     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

A note on inverses in arithmetic with fuzzy numbers

Algorithms for systematical search of inverse in arithmetic operations with fuzzy numbers are discussed. The fuzzy number derived is considered either in a discrete representation of its support or described by the parameters of the corresponding membership function formula. Both algorithms are easy to be programmed for desk calculators.     

广义复合隐迭代格式逼近非扩张映像公共不动点

提出并使用如下广义复合隐迭代格式逼近非扩张映像族{Ti}Ni=1公共不动点:{xn=αnxn-1 (1-αn)Tnyn,yn=rnxn snxn-1 tnTnxn wnTnxn-1,rn sn tn wn=1,{αn},{rn},{sn},{tn},{wn}∈[0,1],这里Tn=TnmodN.该文提出的广义复合隐迭代格式包含了目前多种迭代格式,因此,所得强弱收敛定理推广及发展了Mann,Ishikawa,XuandOri,等许多作者的结果.     

HIGH ACCURACY NUMERICAL METHOD OF THIN-FILM PROBLEMS IN MICROMAGNETICS

In this paper, a new high accuracy numerical method for the thin-film problems of micron and submicron size ferromagnetic elements is proposed. For the computation of stray field, we use the finite element method(FEM) by introducing a semi-discrete artificial boundary condition [1, 2]. In our numerical experiments about the domain patterns and their movement, we can see that the results are accordant to that of experiments and other numerical methods. Our method are very convenient to deal with arbitrary shape of thin films such as a polygon with high accuracy.