Stone代数的Cayley表示定理

首先通过集代数得到了Stone代数的表示定理,然后证明了每一个Stone代数均嵌入到某个集合X上的一个Stone映射类S中.     

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.     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

一类幂等半环的性质和结构

研究了加法半群为半格的半环类S+l中的乘法带半环和矩形带半环类BR中的乘法带半环;给出了ID半环中乘法带半环的结构定理,即ID∩.■°D=.■z∨.■z∨D.     

浑水中非均匀光场探测图像方法

分析了传统的水下观测和激光观测技术在能见度约为0.5~1.5 m的浑浊水域和0.2 m的特浑水域观测遇到的理论和技术上的局限性.叙述了一种非均匀光场集束光水下目标图像探测方法和系统,并在各种浑浊水质中进行其特性的试验.试验结果表明该系统基本上解决了浑浊水中的观测问题.     

半环上的粗糙集

利用同余关系把粗糙集理论引入到半环里,给出了半环中的一个子集的上,下近似的概念,并研究了其一系列性质;另外我们还讨论了半环中的粗糙理想及性质.     

非负交换整半环上矩阵的正/负行列式保持问题

设R为非负交换整半环,用M_n(R)表示R上所有n×n矩阵构成的矩阵半环.令T是M_n(R)到其自身的线性变换,若T满足|T(X)|~+=|X|~+,■X∈M_n(R)(或|T(X)|~-=|X|~-,(?)X∈Mn(R)),称T为M_n(R)上保持正行列式(负行列式)的线性变换.刻画了n≥4时,M_n(R)上保持正行列式/负行列式的线性满射形式.