混合式几何约束满足的研究

几何约束系统可以分为陈述式和构造式两类。为了使基于约束的设计更加符合使用要求,参数化CAD系统需要综合满足两类约束。文中研究了三维情况下和构造统一的约束满足策略,通过引入形状自由度的概念,将形状变化和集团变化统一处理。约束系统采用约束图来表示,各个子系统之间的层次结构利用约束层次树来表示。采用剪枝和凝聚相结合的策略实现了欠约束和完备约束系统的分解,使用解析法和数值法对约束进行求解。该策略已经在参数化CAD系统GEMS5．0的二维和三维上实现。     

基于实例图形的几何约束满足策略

以实例图形概念，应用稀疏矩阵三角块分技术及非线性数值迭代技术，提出了有效的包括几何约束表达、有效性检验、约束分解及求解的约束满足策略。该策略还支持不完备几何约束的约束满足。     

几何约束满足问题的图重构策略

通过对图缩并算法的介绍和分析 ,以约束网络图的形式对几何约束系统中的约束关系进行映射表达 ,提出了一种基于自由度分析的图重构推理策略 ,实现了问题的最大分解 ,大大降低了问题的复杂程度和系统求解的规模 ,使得相当一部分具有高耦合性的问题最终可以用解析方法求解。     

几何约束满足的统一模型

几何约束满足是参数化设计中的中心问题,研究了陈述和构造统一的约束满足策略,通过将冗余约束转化为形状自由度的方法解决了构造序列的约束闭环问题,采用剪枝和凝聚相结合的策略实现了欠约束和完备约束系统的分解,并在参数化设计与绘图系统ＭＤＳ４．０上实现。     

传统图系统的几何约束驱动关键技术研究及实践

文中针艰如何在传统绘图系统中拓展约束驱动功能，以实现面向设计师的灵活的参数化设计地几休数据的转换，几何约束识别，表达，筛选及求解进行了较系统的探讨。     

三维几何约束闭环的动态识别与满足

针对三维几何约束闭环的满足问题,提出了“充分推理＋最小数值”的约束求解策略及其具体的实施方法。自由传播法可在动态求解约束的过程中识别出约束闭环;几何归约法将约束闭环子图归约简化为层次分明的归约树,并进一步明确了闭环的组成和结构;矢量闭环法建立了约束闭环的矢量模型,据此模型可以建立最小规模的方程组来求解约束闭环,方程组的变量具有明确的几何意义,便于初值的确定和多解的处理,并能求解欠约束的闭环。     

动态识别三维几何约束冲突的方法研究

基于装配几何特征的广义几何约束图,避免了传统几何约束图的超图性质和模糊性,为几何约束满足问题提供了一个清晰的分析模型。文中以此模型来分析产生约束冲突的原因。空间分析法定义和推导了约束满足空间约束满足条件,提出了自由空间和自由度的计算方法,并据此在动态满足三维几何约束的过程中识别约束冲突,明确指出产生约束冲突的原因。     

基于实例图形的几何约束满足策略

以实例图形概念，应用稀疏矩阵三角块分技术及非线性数值迭代技术，提出了有效的包括几何约束表达、有效性检验、约束分解及求解的约束满足策略。该策略还支持不完备几何约束的约束满足。     

传统绘图系统的几何约束驱动关键技术研究及实践

文中针对如何在传统绘图系统中拓展几何约束驱动功能，以实现面向设计师的灵活的参数化设计问题，对几何数据的转换，几何约束识别、表达、筛选及求解进行了较系统的探讨，提出了经实际检验行之有效的技术实现方法，特别地对具有独创性的约束识别的实施进行了阐述     

基于约束的几何设计系统原理及实现

本文提出了一种基于约束的几何设计系统的基本原理和方法。通过对几何约束系统的最大分解，使整个系统的求解可以通过一系列子系统的求解实现。实践表明，该方法大大缩小了问题求解的规模，提高了求解精度和速度，为参数化设计提供了强有力的手段。     

布局问题约束的分类及表达

对布局问题中的各种约束进行了深入系统的研究和归类,并分析了它们在布局求解中所起作用,特别是将求解策略,规则与方法也看成是一种特殊的约束－导向约束;为基于约束求解算法的柔适性提供了可靠的保证。最后,利用面对对象思想给出了布局约束的表达形式。     

约束满足问题并行弧相容算法

本文给出了约束满足问题网络弧相容的两个并行算法ＰＡＣ－１和ＰＡＣ－２。     

Representation and Reasoning with Multi-Point Events

Allen's Interval Algebra (IA) and Vilain & Kautz's Point Algebra (PA) consider an interval and a point as basic temporal entities (i.e., events) respectively. However, in many situations we need to deal with recurring events that include multiple points, multiple intervals or combinations of points and intervals. In this paper, we present a framework to model recurring events as multi-point events (MPEs) by extending point algebra. The reasoning tasks are formulated as binary constraint satisfaction problems. We propose a polynomial time algorithm (based on van Beek's algorithm) for finding all feasible relations. For the problem of finding a consistent scenario, we propose a backtracking method with a local search heuristic. We also describe an implementation and a detail empirical evaluation of the proposed algorithms. Our empirical results indicate that the MPE-based approach performs better than the existing approaches.     

A Glimpse of Constraint Satisfaction

Constraint satisfaction has become an important field in computer science. This technology is embedded in millions of pounds of software used by major companies. Many researchers or software engineers in the industry could have benefited from using constraint technology without realizing it. The aim of this paper is to promote constraint technology by providing readers with a fairly quick introduction to this field. The approach here is to use the well known 8-queens problem to illustrate the basic techniques in constraint satisfaction (without going into great details), and leave interested readers with pointers to further study this field.     

Constraint Reasoning about Repeating Events: Satisfaction and Optimization

Effective manipulation of temporal information about periodic events is required for solving complex problems such as long‐range scheduling or querying temporal information. Furthermore, many problems involving repeating events involve the optimization of temporal aspects of these events (e.g., minimizing make‐span in job‐shop scheduling). In this paper, a constraint‐based formulation of reasoning problems with repeating events is presented, and its complexity is analyzed for a range of problems. Optimization constraints are interpreted formally using the Semiring CSPs (SCSP) representation of optimization in constraint reasoning. This allows for familiar algorithms such as branch‐and‐bound to be applied to solving them.     

协同模板中几何约束关系的表示与解释

模板设计标记语言TDML是协同模板中描述设计信息的标记语言，主要用于表示设计对象的部件信息、部件属性信息、部件位置装配关系信息、操作和连接信息等。设计对象是由一系列部件按照一定的约束关系装配而成的，所以约束信息是设计对象重要的结构信息。文章分析并总结了设计对象之间的几何约束及装配位置关系，采用TDML语言加以描述和解释，并用三维建模器ACIS实现了设计部件间位置关系的可视化。     

设计型专家系统的知识表示

本文从工程设计的实际过程出发，探讨了便于实现设计推理的知识表示。框架结构用于设计方案的描述和工程实例的存储，关联表示用于提出和修改方案。     

RNA Secondary Structure Determination and Representation Based on Constraints Satisfaction

A characteristic common to several problems of molecular biology consists in the satisfaction of a set of constraints coming from different sources of biological knowledge. In this paper, we present two problems that take advantage of a constraint satisfaction formulation. The first problem deals with the representation and visualization of RNA secondary structures. The program RNASEARCH implements an original backtracking based algorithm that evaluates at each node the satisfaction of spatial constraints with the aim at drawing a representation without overlap between secondary structural elements. The second problem addresses the determination of RNA secondary structure in accordance with data. With the program SAPSSARN, the application of classic filtering algorithm is used and we discuss a new search algorithm which computes only so called saturated secondary structures. The main result certainly is the possibility to relax the constraint of the absence of secondary structural elements forbidden in secondary structures computed with dynamic programming based approaches: pseudoknots. Finally, we show how each program takes advantage from the other through a protocol driven by constraints.     

基于柔性约束满足的企业集成协调方法

冲突是企业中常见的现象,对于企业集成这样一个几乎涉及企业所有方面的活动,更是会出现各种各样的冲突。论文提出采用约束满足的方式作为解决企业集成过程中冲突的消解方式。同时引入决策者对约束满足的偏好信息,对传统的约束满足问题进行扩展,利用柔性约束满足求解的思路,分层解决冲突问题,并将该方法应用于实际研究中,取得了较好的效果。     

稀疏表示技术与应用综述

近年来稀疏表示技术在信号处理、图像处理、目标识别、盲源分离等领域都有着突出的贡献. 为了全面的了解和分析现有稀疏表示优化算法, 首先回顾了稀疏表示技术的历史进程, 简单描述了稀疏表示技术的原理, 然后将稀疏表示优化算法分为贪心算法和约束算法以及其他算法三大类, 具体分析了前两种类别算法的原理和特征, 介绍了两类算法的代...