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

介绍了用横向放大率法确定两薄透镜组成的光具组基点的原理和方法,该方法采用线阵光电耦合器件(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.     

A result on sets,with applications to vector optimization

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.     

基于单纯形方法的双层线性规划全局优化算法

通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程.     

钢丝的切变模量与扭转角度关系

研究了钢丝的切变模量随其扭转角度变化而变化的情况,观察到扭转角大于某一角度时,切变模量趋于定值的规律,得出扭摆实验准确测量的方法.     

边值问题的某些存在定理(英)

本文给出关于边值问题解的某存在唯一性定理及其应用．     

气体放电击穿过程的物理和数值研究

本文对低气压（１０＾－２Ｐａ）热阴极气体放电的击穿过程给出了物理描述和相应的双流体数学型，并发展了一种选择和调整未知初始条件的有效算法，可以通过伴随试射法得到对初始条件十分敏感的非线性两点边值常微分方程组的数值解，从而给出这类气体放电中击穿过程的定量描述。     

Space–Time Chaos,Critical Phenomena,and Bifurcations of Solutions of Infinite-Dimensional Systems of Ordinary Differential Equations

We study infinite-dimensional systems of ordinary differential equations having applications in some popular and important physical problems. The appearance of infinite-dimensional space–time chaos is considered, namely, the bifurcations and critical phenomena that occur in the phase space of the systems and explain some physical problems are described.     

Numerical treatment of an asset price model with non-stochastic uncertainty

In contrast to stochastic differential equation models used for the calculation of the term structure of interest rates, we develop an approach based on linear dynamical systems under non-stochastic uncertainty with perturbations. The uncertainty is described in terms of known feasible sets of varying parameters. Observations are used in order to estimate these parameters by minimizing the maximum of the absolute value of measurement errors, which leads to a linear or nonlinear semi-infinite programming problem. A regularized logarithmic barrier method for solving (ill-posed) convex semi-infinite programming problems is suggested. In this method a multi-step proximal regularization is coupled with an adaptive discretization strategy in the framework of an interior point approach. A special deleting rule permits one to use only a part of the constraints of the discretized problems. Convergence of the method and its stability with respect to data perturbations in the cone of convexC ¹-functions are studied. On the basis of the solutions of the semi-infinite programming problems a technical trading system for future contracts of the German DAX is suggested and developed. Supported by the Stiftung Rheinland/Pfalz für Innovation, No. 8312-386261/307.