可拓知识空间和可拓知识网格模型(Ⅱ):可拓知识网格

第1部分中已介绍了可拓知识空间定义和相关操作，以及可拓知识空间关联函数计算方法。这一部分进一步建立可拓知识空间语义网、可拓知识网格和可拓知识网格服务，并给出实例和相关的分析讨论。     

实体造型中的几何约束

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

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.     

基于图形约束的工程图纸扫描图象表面粗糙度的自动识别

本文通过分析现有工程图纸扫描图象的识别与理解系统，提出了表面粗造度的自动识别算法，从而弥补了以往系统的不足，基于图形约束的表面粗造度整体识别算法符合技术人员的读图规律，处理速度快，可靠性高，该算法已在微机上调试成功。     

可拓检测的方案生成

以可拓学理论为基础，论述了可拓检测的有关定义和概念，提出了可拓检测的方案生成方法及过程，同时探讨了检测方法的优化和评价方法。     

缺省理论的简化

缺省理论△=(D,W)中的缺省规则集D,是该理论的不确定因素.如果能去掉一些缺省规则而又不影响该理论的延伸,则就在一定程度上简化了该理论.本文证明了关于规范缺省理论的延伸的若干性质,利用这些性质,我们可以把某些规范缺省理论在一定条件下得以化简,有的甚至可以把它们化为一阶逻辑理论.     

基于多随机变量风险约束的水电站长期优化调度

针对市场环境下水电站如何综合考虑电价和来水等不确定性因素下的优化调度是当前研究的热点和难点,建立了考虑电价和来水等不确定性因素的风险约束水电站长期优化调度模型。根据此模型发电商可方便地在预期的目标收益和风险之间进行权衡,达到以较小的风险获得较大的收益的目的。以二滩电厂实算为例,表明了该模型的有效性。     

DCOP FOR SMART HOMES: A CASE STUDY

The aim of this article is to bring forth the issue of integrating the services provided by intelligent artifacts in Ambient Intelligence applications. Specifically, we propose a Distributed Constraint Optimization procedure for achieving a functional integration of intelligent artifacts in a smart home. To this end, we employ Adopt-N , a state-of-the-art algorithm for solving Distributed Constraint Optimization Problems (DCOP). This article attempts to state the smart home coordination problem in general terms, and provides the details of a DCOP-based approach by describing a case study taken from the RoboCare project. More specifically, we show how (1) DCOP is a convenient metaphor for casting smart home coordination problems, and (2) the specific features which distinguish Adopt-N from other algorithms for DCOP represent a strong asset in the smart home domain.     

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.