大型吹塑机制造技术探讨

本文系统介绍了采用德国巴登菲尔德·菲歇尔公司许可证技术转让方式生产的ＳＣＪ系列大型吹塑机的最新技术特点。     

基于窗口的面向对象的GUI设计

文中讨论了一种基于窗口的对象用户界面设计思想及方法，详细描述了各种类的定义。在ＤＯＳ环境下运用ＷａｔｃｏｍＣ＋＋语言在微机上开发运行。它可以使用户方便地进行再开发工作，界面运用事件处理方式由窗口、弹出菜单、图标、按钮等组成。效果良好。     

无限维的不可微凸规划

本文在局部凸Ｈａｕｓｄｏｒｆｆ线性拓扑空间中讨论了一类不可微的凸规划，得到了Ｋｕｈｎ－Ｔｕｃｋｅｒ最优性条件和对偶定理。     

MetateM: An introduction

In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics.     

3D model retrieval using principal plane analysis and dynamic programming

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.     

LabVIEW编程实时控制KEITHLEY 6517A静电计

基于GPIB接口总线，采用6517A中最简单的按钮命令，在LabVIEW5．1平台上实现了对6517A面板操作的实时控制和信息的同步显示。     

Branching and pruning: An optimal temporal POCL planner based on constraint programming

A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners provide an alternative branching scheme but lacking comparable pruning mechanisms do not perform as well. In this paper, a domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules. The key novelty in the formulation is the ability to reason about supports, precedences, and causal links involving actions that are not in the plan. Experiments over a wide range of benchmarks show that the resulting optimal temporal planner is much faster than current ones and is competitive with the best parallel planners in the special case in which actions have all the same duration.¹     

CXFTV2: A Fortran subroutine for the discrete least squares convex approximation

A Fortan subroutine calculates the least squares approximation to n data values containing random errors subject to non-negative second divided differences (convexity). The method employs a dual active set quadratic programming technique that allows several concavities of an iterate to be corrected simultaneously, which is a distinctive feature of this calculation. A B-spline representation of the iterates reduces each active set calculation to an unconstrained minimization with fewer variables that requires only O(n) computer operations. Details in these techniques including the data structure that establishes the implementation of the method are specified. Numerical testing on a variety of data sets indicates that the subroutine is particularly efficient, terminating after a small number of active set changes, the subroutine being suitable for large numbers of data. A numerical example and its output is provided to help the use of the software.     

空间环型区域上的关联函数

本文利用锥函数方法，给出空间环型区域上关联函数的一种计算方法。     

ε－拟可微规划的Fritz John型条件和Knhn－Tucker型条件

讨论了不等式约束下的ε－拟可微规划的局部最优解问题，给出了这一问题的ＦｒｉｔｚＪｏｈｎ型条件和Ｋｕｈｎ－Ｔｕｃｋｅｒ型条件，本文也是对Ｇｏｒｏｋｈｏｖｉｋ结果的推广