Accelerating filtering techniques for numeric CSPs

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper¹ we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis.     

New Tractable Classes From Old

The constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. This paper introduces two simple methods of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious.     

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

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

Constraint Databases: Promising Technology or Just Intellectual Exercise?

This paper describes the state of Constraint Databases (CDBs), a young discipline at the intersection of Database Management, Constraint Programming, Computational Geometry and Operations Research. As in Constraint Logic Programming, constraints in CDBs are a first class data type, and can play many modeling roles including spatial and temporal behavior, complex design requirements, and partial and incomplete information, for which existing databases have proven inadequate. We motivate the importance of CDBs, outline the work in the area that has been done, the current trends, and future directions and challenges. We briefly discuss (1) constraint modeling, canonical forms and algebras, (2) data models and query languages, (3) indexing and approximation-based filtering, (4) constraint algebra algorithms and global optimization, and (5) systems and case studies. We argue that CDBs are a promising technology that will impact many important application realms, and furthermore have the potential to be integrated into future database systems, and operations research and constraint programming tools.     

Effects of crack size and weld metal mismatch on the has cleavage toughness of wide plates

The heat affect zone (HAZ) is in many cases considered to be the most critical part of a weldment. In this paper, the effect of crack size and weld metal mismatch on the HAZ cleavage toughness of wide plate specimens with X-groove has been investigated by the J-Q-M theories and a simple micromechanism for cleavage fracture. Two crack sizes have been studied (a/w = 0.1 and 0.3). In the analyses, the HAZ yield strength is assumed to be higher than the base metal. For each crack size, weld metal local overmatch and local evenmatch with respect to the HAZ are considered. For a given global strain, the results indicate that weld metal overmatch and evenmatch yield the same crack tip loading in terms of J-integral for a/w = 0.3. For a/w = 0.1, overmatch gives lower crack tip loading than evenmatch. For a given crack tip loading, weld metal local evenmatch in general results in less effective crack tip loading than the overmatch. Overmatch is detrimental to HAZ toughness, but this detrimental effect becomes less significant when the crack size decreases.     

后桥壳的可靠性优化设计

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

一族Liouville可积系及其双约束流的Hamilton系统

构造了Loop代数 A2的一个子代数,由此建立了一个3×3等谱问题,由屠规彰格式得到了一族Liouville意义下的可积Hamilton方程族。通过建立双对称约束,得到了该方程族的两组约束流,并将其化为广义Hamilton系统。     

基于概念网络的文本信息监控技术

由于网上信息的迅速增长,文本信息监控已经成为网上信息管理中的热点研究课题。本文在模糊集和语义网络的理论基础上,构建了模糊值动态约束性概念网络,介绍了该概念网络的基本构建方法,并提出了基于概念网络的文本分析算法。     

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.