C语言源程序汉字处理

本文在找出汉字区位码地址码转换关系的基础上，阐述了用Ｃ语言开发的，在西方图形方式下能显示一、二级汉字库中所有汉字的处理软件的设计考虑，并给出有关程序。     

悬空树状刚体系统动力学方程应用

本文简述了R.E.Roberson, J.Wittenburg推出的关于用球铰连接的刚体系统动力学方程.作者根据该方程编写了计算程序.该程序功能是:给定系统初瞬时的姿态和各刚体之间的相对运动,计算出系统质心和主块质心的位置及速度的变化规律,各刚休的相对角速度、绝对角速度、布里恩角和布里恩角对时间的一阶导数的规律等.将该程序应用于人体运动分析时,可帮助教练员论证设计动作的可行性.作者用该程序计算了一实例.对运算结果所作的扼要分析,表明该程序是行之有效的.     

框式约束凸二次规划的预估校正光滑算法

研究了框式约束凸二次规划的一种光滑算法，算法中应用了牛顿法及其变形形式，证明了算法的全局收敛性．     

QPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints

We describe a technique for generating a special class, called QPEC, of mathematical programs with equilibrium constraints, MPEC. A QPEC is a quadratic MPEC, that is an optimization problem whose objective function is quadratic, first-level constraints are linear, and second-level (equilibrium) constraints are given by a parametric affine variational inequality or one of its specialisations. The generator, written in MATLAB, allows the user to control different properties of the QPEC and its solution. Options include the proportion of degenerate constraints in both the first and second level, ill-conditioning, convexity of the objective, monotonicity and symmetry of the second-level problem, and so on. We believe these properties may substantially effect efficiency of existing methods for MPEC, and illustrate this numerically by applying several methods to generator test problems. Documentation and relevant codes can be found by visiting http://www.ms.unimelb.edu.au/danny/qpecgendoc.html.     

Correctness proof of an in-place permutation

The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements belonging to a permutation cycle. A suitable assertion is constructed from which the correctness can be deduced after completion of the algorithm.An in-place rectangular matrix transposition algorithm is given as an example.     

Approximating disjoint-path problems using packing integer programs

In a packing integer program, we are given a matrix $A$ and column vectors $b,c$ with nonnegative entries. We seek a vector $x$ of nonnegative integers, which maximizes $c^{T}x,$ subject to $Ax \leq b.$ The edge and vertex-disjoint path problems together with their unsplittable flow generalization are NP-hard problems with a multitude of applications in areas such as routing, scheduling and bin packing. These two categories of problems are known to be conceptually related, but this connection has largely been ignored in terms of approximation algorithms. We explore the topic of approximating disjoint-path problems using polynomial-size packing integer programs. Motivated by the disjoint paths applications, we introduce the study of a class of packing integer programs, called column-restricted. We develop improved approximation algorithms for column-restricted programs, a result that we believe is of independent interest. Additional approximation algorithms for disjoint-paths are presented that are simple to implement and achieve good performance when the input has a special structure.Work partially supported by NSERC OG 227809-00 and a CFI New Opportunities Award. Part of this work was done while at the Department of Computer Science, Dartmouth College and partially by NSF Award CCR-9308701 and NSF Career Award CCR-9624828.This work was done while at the Department of Computer Science, Dartmouth College and partially supported by NSF Award CCR-9308701 and NSF Career Award CCR-9624828.     

Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications

We consider a class of optimization problems that is called a mathematical program with vanishing constraints (MPVC for short). This class has some similarities to mathematical programs with equilibrium constraints (MPECs for short), and typically violates standard constraint qualifications, hence the well-known Karush-Kuhn-Tucker conditions do not provide necessary optimality criteria. In order to obtain reasonable first order conditions under very weak assumptions, we introduce several MPVC-tailored constraint qualifications, discuss their relation, and prove an optimality condition which may be viewed as the counterpart of what is called M-stationarity in the MPEC-field.     

DK——2A型单体液压支柱低压密封质量检测仪

单体液压支柱低压密封质量,直接影响到工作面安全生产。为使密封质量检测过程自动化、定量化,研制了DK—2A型单体液压支柱低压密封质量检测仪。该检测仪采用单片机控制,以PC—1500计算机进行数据处理,一次可检测15根支柱,提高检测效率四至八倍。本文论述检测仪的工作原理、硬件及软件设计,并给出程序流程图。此外,对单片机测周期误差进行了分析。     

Existence Theorems of Quasivariational Inclusion Problems with Applications to Bilevel Problems and Mathematical Programs with Equilibrium Constraint

In this paper, we establish existence theorems of quasivariational inclusion problems; from them, we establish existence theorems of mathematical programs with quasivariational inclusion constraint, bilevel problems, mathematical programs with equilibrium constraint and semi-infinite problems. This research was supported by the National Science Council of the Republic of China. The authors express their gradtitude to the referees for valuable suggestions.     

GENERAL INFORMATION

In this note, we obtain a sufficient and necessary condition for a point to be a local minimizer of a continuous optimization problem with maximin constraints via the local minimizers of its transformed standard nonlinear optimization problem.