实体造型中的几何约束

实体造型是一个基于约束的过程，完成从功能约束到几何约束、再到代数约束的转化而得到实体模型。本文讨论了几何约束的层次性及其表示，并且对几何约束同设计意图的关系进行了研究，提出了基于ＣＳＧ／ＧＣＧ／Ｂ－ｒｅｐ的模型表示。     

Optimal H∞ general distance problem with degree constraint

In this paper the optimal H_∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration.     

几何设计约束的表示与满足问题研究

对于智能ＣＡＤ系统来说，具有解决几何设计约束的功能是重要的。本文提出了一种面向对象的几何设计约束表示方法，它可以通过两种方式来表达。文中给出了一个约束传播算法，用于解决约束满足问题。     

解线性及二次型规划问题增广的神经网络

本文提出了一个解线性及二次型规划问题的神经网络模型，证明了该网络是全局稳定于平衡点，而平衡点就是线性及二次型规划问题的解，该网络的优点是能够实时获得问题的精确解，且可以同时获得带等式不式约束的对偶问题解，该网络易于电路实现。     

后桥壳的可靠性优化设计

该文讨论了后桥壳的可靠性优化设计问题.在基本随机变量的概率特性已知的情况下,应用随机摄动法和约束随机方向法对后桥壳进行可靠性优化设计,并编制了实用的计算机程序,可以迅速准确地得到后桥壳的可靠性设计参数.     

Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts

This paper proposes a performance index to measure the quality level of a stochastic-flow network in which each node has a designated capacity, which will have different lower levels due to various partial and complete failures. The performance index is the probability that the maximum flow of the network equals the demand d without exceeding the budget b. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, b), and then the probability that the maximum flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, b) is a maximal vector representing the capacity of each arc such that the maximum flow of the network under the budget b is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary point for (d−1, b). A benchmark example is shown to illustrate the solution procedure.     

Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy

This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times.     

非数值化产品形位描述模型

传统的形状及位置表示模型通常是建立在低层次的无应用意义的几何拓扑元素之上，因而无法很好地支持计算机辅助设计（ＣＡＤ）向实用化和智能化方向发展。本文提出了一种非数值化的基于约束的产品形位描述模型，并对该模型中存在的一些问题进行了深入的讨论。该模型符合设计人员实际设计思维与过程，同时也支持高层次产品设计信息以及产品的设计过程信息，因而为传统ＣＡＤ系统向新一代实用化智能化ＣＡＤ系统过渡提供了一个良好的产品形位表示模型。     

A region-based selective optical flow back-projection for genuine motion vector estimation

Motion vector plays one significant feature in moving object segmentation. However, the motion vector in this application is required to represent the actual motion displacement, rather than regions of visually significant similarity. In this paper, region-based selective optical flow back-projection (RSOFB) which back-projects optical flows in a region to restore the region's motion vector from gradient-based optical flows, is proposed to obtain genuine motion displacement. The back-projection is performed based on minimizing the projection mean square errors of the motion vector on gradient directions. As optical flows of various magnitudes and directions provide various degrees of reliability in the genuine motion restoration, the optical flows to be used in the RSOFB are optimally selected based on their sensitivity to noises and their tendency in causing motion estimation errors. In this paper a deterministic solution is also derived for performing the minimization and obtaining the genuine motion magnitude and motion direction.