Solving multiple objective quasi-convex goal programming problems by linear programming

This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi-convex linear penalty functions. The proposed method initially expresses a quasi-convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi-objective quasi-convex GP problem into large sub-problems as in conventional methods. Some illustrative examples are provided.     

ArcVieW应用开发中动态连接库方法研究

Ａｖｅｎｕｅ是地理信息系统软件平台ＡｒｅＶｉｅｗ的二次开发工具,该文重点介绍了在Ａｖｅｎｕｅ开发蝇使用动态连接库的实现方法。     

Robot Motion Planning: A Game-Theoretic Foundation

Analysis techniques and algorithms for basic path planning have become quite valuable in a variety of applications such as robotics, virtual prototyping, computer graphics, and computational biology. Yet, basic path planning represents a very restricted version of general motion planning problems often encountered in robotics. Many problems can involve complications such as sensing and model uncertainties, nonholonomy, dynamics, multiple robots and goals, optimality criteria, unpredictability, and nonstationarity, in addition to standard geometric workspace constraints. This paper proposes a unified, game-theoretic mathematical foundation upon which analysis and algorithms can be developed for this broader class of problems, and is inspired by the similar benefits that were obtained by using unified configuration-space concepts for basic path planning. By taking this approach, a general algorithm has been obtained for computing approximate optimal solutions to a broad class of motion planning problems, including those involving uncertainty in sensing and control, environment uncertainties, and the coordination of multiple robots. Received November 11, 1996; revised March 13, 1998.     

案例教学法在网络程序设计ASP课程中的应用

分析研究了网络程序设计ASP课程教学的特点,结合留言板系统的具体教学实践,讨论了如何有效地把案例教学法运用于网络程序设计教学中的方法、步骤。实践证明,案例教学法有利于培养学生分析问题和解决问题的实践能力。     

利用SHELL编程实现UNIX系统下气象资料传输与处理

本文对UNIX环境下SHELL脚本语言进行了简要介绍,并举例说明了如何利用SHELL脚本语言实现UNIX/Linux系统下气象资料传输与处理。     

支票挂失查询语音服务系统的设计与实现

自动声讯服务日益成为信息查询或传递的一条重要途径,文中介绍了支票挂失查询语音服务系统的功能,结构以及系统设计中 音卡编程的状态轮询方法和数据库的操作方法。     

A base62 transformation format of ISO 10646 for multilingual identifiers

ISO 10646 Universal Character Set (UCS) is a 31‐bit coding architecture that covers symbols in most of the world's written languages. Identifiers in programming languages are usually defined by using alphanumeric characters of ASCII, which represent mainly English words. An approach for working around this deficiency is to encode multilingual identifiers into the alphanumeric range of ASCII. For case‐sensitive languages, an encoding that utilizes [0–9][A–Z][a–z] can be more space‐efficient for multilingual identifiers. This paper proposes a base62 transformation format of ISO 10646 called UTF‐62. The resulting string of UTF‐62 is within a [0–9][A–Z][a–z] range, a total of 62 base characters. UTF‐62 also preserves the lexicographic sorting order of UCS‐4. Copyright © 2001 John Wiley & Sons, Ltd.     

Dynamics of Flexible Multibody Systems Using Virtual Work and Linear Graph Theory

By combining linear graph theory with the principle of virtualwork, a dynamic formulation is obtained that extends graph-theoreticmodelling methods to the analysis of flexible multibody systems. Thesystem is represented by a linear graph, in which nodes representreference frames on rigid and flexible bodies, and edges representcomponents that connect these frames. By selecting a spanning tree forthe graph, the analyst can choose the set of coordinates appearing inthe final system of equations. This set can include absolute, joint, orelastic coordinates, or some combination thereof. If desired, allnon-working constraint forces and torques can be automaticallyeliminated from the dynamic equations by exploiting the properties ofvirtual work. The formulation has been implemented in a computerprogram, DynaFlex, that generates the equations of motion in symbolicform. Three examples are presented to demonstrate the application of theformulation, and to validate the symbolic computer implementation.     

Christopher Strachey: Recollections of His Influence

My early research was inspired by the mathematical semantics of Scott and Strachey. Two such topics, recounted in this paper, were the fixed-point analysis of pointer loops and the expressibility of a style of functional programming introduced by Barron and Strachey.     

Complexity and computability of solutions to linear programming systems

Through key examples and constructs, exact and approximate, complexity, computability, and solution of linear programming systems are reexamined in the light of Khachian's new notion of (approximate) solution. Algorithms, basic theorems, and alternate representations are reviewed. It is shown that the Klee-Minty example hasnever been exponential for (exact) adjacent extreme point algorithms and that the Balinski-Gomory (exact) algorithm continues to be polynomial in cases where (approximate) ellipsoidal centered-cutoff algorithms (Levin, Shor, Khachian, Gacs-Lovasz) are exponential. By model approximation, both the Klee-Minty and the new J. Clausen examples are shown to be trivial (explicitly solvable) interval programming problems. A new notion of computable (approximate) solution is proposed together with ana priori regularization for linear programming systems. New polyhedral constraint contraction algorithms are proposed for approximate solution and the relevance of interval programming for good starts or exact solution is brought forth. It is concluded from all this that the imposed problem ignorance of past complexity research is deleterious to research progress on computability or efficiency of computation.This research was partly supported by Project NR047-071, ONR Contract N00014-80-C-0242, and Project NR047-021, ONR Contract N00014-75-C-0569, with the Center for Cybernetic Studies, The University of Texas at Austin.