Response level crossing rate of a linear system excited by a partially specified Gaussian load process

The problem of determining the maximum mean response level crossing rate of a linear system driven by a partially specified Gaussian load process has been considered. The partial specification of the load is given only in terms of its total average energy. The critical input power spectral (PSD) function, which maximizes the mean response level crossing rate, is obtained. The critical input PSD turns out to be highly narrow-banded which fails to capture the erratic nature of the excitation. Consequently, the trade-off curve between the maximum mean response level crossing rate and the maximum disorder in the input process, quantified in terms of its entropy rate, has been generated. The method of Pareto optimization is used to tackle the conflicting objectives of the simultaneous maximization of the mean response level crossing rate and the input entropy rate. The non-linear multi-objective optimization has been carried out using a recently developed multi-criteria genetic algorithm scheme. Illustrative example of determining the critical input of an axially vibrating rod, excited by a partially specified stationary Gaussian load process, has been considered.     

基于遗传算法的门限自回归模型在浅层地下水位预测中的应用

提出了建立门限自回归模型的一种简便通用的方法，用遗传算法可同时优化门限值和自回归系数．实例计算的结果说明了其可行性和有效性．该方法在各种工程时序预测中具有广泛的应用价值     

Affine Dependence Classification for Communications Minimization

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.     

三聚甲醛萃取—精馏新工艺及过程优化

本文对采用Ｓ１和Ｓ２的混合物作为萃取剂的三聚甲醛萃取－精馏新工艺进行了模拟计算，得到了使总费用最低的三聚甲醛精制工艺的联合操作参数。模拟计算结果成功地指导了小试操作，并可为大型工程设计提供可靠的基础数据。     

ADS expert

ADS Expert is an integrated system that (a) provides suggestions about suitable optimization algorithms for a particular structural optimization problem, (b) it offers explanations and guide lines, in the form of hypertext, that refer to the optimization strategy, optimizer and one dimensional search method, (c) it produces the required gradients for the objective function and the constraints using symbolic differentiation, (d) establishes a direct linking with ADS routines and (e) it monitors the evolution of the optimization process. The system can be used as an educational tool for structural optimization and as an efficient integrated system for small to medium size optimization problems for which the objective function and the constraints are given in the form of explicit functions of the design variables. The system is a Windows application and runs quite satisfactorily on PCs.     

变结构变参数设计方法及其在机械CAD中的应用

提出了一种新颖的机械结构设计思想－变结构变参数设计方法，并结合实例，阐述了变结构变参数设计的概念、原则、实施措施和意义。由此对Ｉ－ｄｅａｓ软件包进行了二次开发，编制了发动机曲轴专用ＣＡＤ软件程序，并用某型号发动机曲轴进行了验证。     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

Software for dynamic reconfigurable order picking systems

This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families.     

矩形件排样的一种优化算法

排样问题是一种总体资源分配问题，这里根据矩形件排样的工艺要求，提出了矩形件排样的一种近似算法，将一块板材分成三部分，每部分排一种零件，使得减料方便，提高了劳动生产率。