Singular Trajectories in Multi-Input Time-Optimal Problems: Application to Controlled Mechanical Systems

This paper deals with the time-optimal control problem for a class of control systems which includes controlled mechanical systems with possible dissipation terms. The Lie algebras associated with such mechanical systems have certain special properties. These properties are explored and used in conjunction with the Pontryagin maximum principle to determine the structure of singular extremals and, in particular, time-optimal trajectories. The theory is illustrated by an application to a time-optimal problem for a class of underwater vehicles.     

催化裂化汽油脱硫助剂TS-01的工业试验

中国石油化工股份有限公司九江分公司在I套催化裂化装置进行了TS—0l催化裂化汽油脱硫双功能助剂的工业应用。结果表明：TS—0l剂对催化裂化汽油有较好的脱硫效果。当TS—0l剂注入原料中的量为70μg／g时，对催化裂化汽油的硫脱除率约为20％；注入量为120μg／g时，硫脱除率可达到25％-30％。汽油中脱除的硫主要以硫化氢形态转移至于气、液化气中。TS—01剂对产品分布及产品其它质量无明显影响，该剂亦有良好的金属钝化效果。     

Frequency domain solution to delay-type Nehari problem

This paper generalizes the frequency-domain results on the delay-type Nehari problem in the stable case to the unstable case. The solvability condition of the delay-type Nehari problem is formulated in terms of the nonsingularity of three matrices. The optimal value γ_opt is the maximal γ∈(0,∞) such that one of the three matrices becomes singular. All sub-optimal compensators are parameterized in a transparent structure incorporating a modified Smith predictor.     

Maximally efficient dialogue mode algorithm

Collaboration is more efficient when the most capable participant for each goal has initiative in directing the problem-solving for that goal. The paper describes a method for using a probabilistic analysis to create a mode-switching mechanism that selects which participant should control the collaborative problem solving so that efficiency is maximized.     

小型水电站联网改造应注意的几个问题

针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析，井提出了改进途径，指出小水电站的联网改造应立足安全，争取效益。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

晶须取向对SiCw／Al复合材料切削表面质量的影响

切削与晶须取向方向间的夹角对ＳｉＣｗ／Ａｌ复合材料切削表面质量有很大影响。当切削角为４５°时，晶须拔出和转动现象均较少，复合材料切削表面粗糙度最低。当切削角为１３５度时，晶段转动造成的撕裂破坏程度很大，复合材料切削表面粗糙度最大。     

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.     

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

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