Moderate Deviations for Longest Increasing Subsequences: The Lower Tail

We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity.     

拟线性椭圆变分不等式的障碍最优控制问题

对拟线性椭圆变分不等式的障碍最优控制问题(即以障碍为控制变量)进行了研究．指标泛函为Lagrange型,其中含有控制变量二阶导数的p次幂,这使得最优性条件的推导颇为不易．对所考虑的问题给出了最优控制的存在性定理以及必要条件．     

Fourth-order problems with fully nonlinear boundary conditions

Differential inequality method, bounding function method and topological degree are applied to obtain the existence criterions of at least one solution for the general fourth-order differential equations under nonlinear boundary conditions, and many existing results are complemented.     

条形装箱问题的优化模型和增广Lagrange算法

This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches.     

Ekeland’s principle for vector equilibrium problems

In this paper, the authors deal with bifunctions defined on complete metric spaces and with values in locally convex spaces ordered by closed convex cones. The aim is to provide a vector version of Ekeland’s theorem related to equilibrium problems. To prove this principle, a weak notion of continuity of a vector-valued function is considered, and some of its properties are presented. Via the vector Ekeland’s principle, existence results for vector equilibria are proved in both compact and noncompact domains.     

FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Simplest optimal cutting patterns for equal rectangles

This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.     

Axisymmetric Collision Problem for Two Identical Elastic Solids of Revolution

A direct central collision of two identical bodies of revolution is studied. A nonstationary mixed boundary-value problem with an unknown moving boundary is formulated. Its solution is represented by a series in term of Bessel functions. An infinite system of Volterra equations of the second kind for the unknown expansion coefficients is derived by satisfying the boundary conditions. The basic characteristics of the collision process are determined depending on the curvature of the frontal surface of the bodies     

Banach空间二阶周期边值问题解的存在性

利用一些比较结果，讨论了Banach空间中二阶周期边值问题解的存在性，获得了若干解的存在性与唯一性结果。