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.     

一种基于功率谱对数变换的联合变换相关器

联合功率谱的高频成份对相关峰识别具有重要作用,实验中记录的联合功率谱随着频率的增加其强度迅速降低。为增强联合功率谱的高频成分,改善其调制程度,可对功率谱进行对数变换,从而有效保留更多的高频成份,压低零级衍射光斑,提高联合变换相关器的识别能力。     

改进形态学相关算法以识别高相似度灰度图像

从形态学角度定义了灰度联合图像相似度，提出两种基于位表示法形态学相关算法的改进算法，通过提取位表示法的图像片边缘特征或二元化位表示法的图像片功率谱，以提高位表示法形态学相关算法对高相似度灰度图像的识别能力。     

Strength of cylinder joint adhesively bonded by coupling

Summary A method of joining two metal cylindrical shafts with adhesive coupling is proposed. Two cylindrical shafts with the same diameter are connected by bonding through a cylindrical coupling with epoxy resin. The strength of the shaft joint under tensile loading and torsional loading is investigated analytically and experimentally. The stress and strain distributions of the shaft joint is analyzed by the finite element method. The analyzed strain distributions in the joint are compared with experimental values. The joint strength is predicted by applying the strength laws of shafts, coupling, adhesive layer and adhesive interface between shaft and adhesive coupling. The effects of the coupling dimension on the joint strength are examined. It is shown that the adhesive shaft joint can transfer the load by which the cylindrical shafts are plastically deformed.This paper was refined by the author, K. Ikegami, during statying at Technische Universität München under the support of Deutscher Akademischer Austauschdients. The author is grateful to Professor Lippmann of Technische Universität München who is the host professor of the support.     

ON THE INADEQUACY OF THE RELATIONAL SEMANTIC FOR THE “UNTIL” OPERATOR

Modal logics with the binary operator Until are considered. It is shown that there exists a continuum of consistent U-logics without Kripke frames, and that each U-logic whose class of order does not have the finite frame property.     

同输入M/M/∞排队群的联合队长过程

本提出一个偏微分方程方法，用这一方法研究同输入M/M／∞排队群中的联合队长分布。在任意初始条件下，给出了瞬时联合队长分布的多元母函数，也讨论了稳态队长的联合分布及各排队系统之间的相关性。     

On tolerance lattices of algebras in congruence modular varieties

We prove that the tolerance lattice TolA of an algebra A from a congruence modular variety V is 0-1 modular and satisfies the general disjointness property. If V is congruence distributive, then the lattice Tol A is pseudocomplemented. If V admits a majority term, then Tol A is 0-modular. This revised version was published online in June 2006 with corrections to the Cover Date.     

平台框架部件刚度的简化计算

利用卡氏定理,对惯性平台框架部件的刚度进行简化计算。通过微机编程获得数据,为结构设计初期合理选取结构参数提供参考。     

Bessel框架及其摄动

本文进一步研究了Bessel框架的性质,给出其稳定性和摄动的几个有意义的结果。