相关证据的融合及其在机器人多感觉信息融合中的应用

Ｄ－Ｓ证据理论在多信息融合中的应用要求各证据间相互独立,这在很多实际场合中却很难实现。本文简要地阐述了基于Ｄ－Ｓ证据理论的多传感器信息融合算法,提供了一种基于Ｄ－Ｓ理论的推广方法以理解决融合信息的相关性问题,并用机器人的力学和热学传感器作实验,对该方法有效性进行了研究。     

高校文化景观

任何文化都是积淀的产物,校园文化景观也不例外。大学校园文化景观,不仅在塑造大学的良好形象方面,还在形成大学生完美人格,促进大学生身心健康、和谐发展等方面发挥着重要作用。     

协调决策形式背景下概念格的属性约简

概念格是知识处理与分析中的一个有力工具,对它进行约简可以提高效率简化问题。该文在协调决策形式背景下给出了协调集及属性特征的判定定理,并在此基础上得到了一种求属性约简的方法。     

Delay‐dependent robust stability for stochastic time‐delay systems with polytopic uncertainties

This paper considers a delay‐dependent and parameter‐dependent robust stability criterion for stochastic time‐delay systems with polytopic uncertainties. The delay‐dependent robust stability criterion, as expressed in terms of linear matrix inequalities (LMIs), is obtained by using parameter‐dependent Lyapunov functions. It is shown that the result derived by a parameter‐dependent Lyapunov functional is less conservative. Numerical examples are provided to illustrate the effectiveness of the proposed method. Copyright © 2008 John Wiley & Sons, Ltd.     

Robust H∞ controller design for continuous‐time piecewise time‐delay systems

This paper investigates the robust H_∞ control problem for continuous‐time piecewise time‐delay systems by using piecewise continuous Lyapunov function. The uncertainties of the systems under consideration are expressed in a linear fractional form. A strict linear matrix inequality approach is developed to obtain delay‐dependent asymptotic stability conditions and H_∞ performance. The H_∞ controller design problem is solved by exploiting the cone complementarity linearization (CCL) method. Finally an example is given to illustrate the application of the proposed approach. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

论建筑设计中传统与现代元素的和谐共生

本文基于现代认知理论,从注重历史与文脉传承的角度,通过对涉及建筑设计各要素的深入分析,进一步揭示建筑设计中传统元素与现代元素和谐共生的相互关系和必要性,并为该领域相关问题的解决提供较为可行的理论依据。     

支持移动计算的反射式中间件

传统中间件基于黑盒的设计思想,缺乏必要的灵活性,无法适应复杂动态多变的移动计算环境。反射技术可以使应用程序在运行时检查中间件所提供的服务类型,动态的构造调用请求,适应变化的环境。文章研究了反射的相关概念,中间件技术,分析了移动计算的实际需求,提出了一个支持移动计算的反射中间件架构,支持环境感知、异步通信、动态重配置等。     

Contextualization of Geospatial Database Semantics for Human–GIS Interaction

Human interactions with geographical information are contextualized by problem-solving activities which endow meaning to geospatial data and processing. However, existing spatial data models have not taken this aspect of semantics into account. This paper extends spatial data semantics to include not only the contents and schemas, but also the contexts of their use. We specify such a semantic model in terms of three related components: activity-centric context representation, contextualized ontology space, and context mediated semantic exchange. Contextualization of spatial data semantics allows the same underlying data to take multiple semantic forms, and disambiguate spatial concepts based on localized contexts. We demonstrate how such a semantic model supports contextualized interpretation of vague spatial concepts during human–GIS interactions. We employ conversational dialogue as the mechanism to perform collaborative diagnosis of context and to coordinate sharing of meaning across agents and data sources.

线性时滞系统依赖于时滞的H~∞状态反馈控制

对具有纯滞后输入的线性时滞系统 ,在系统的状态时滞与控制输入时滞不同时 ,研究了依赖时滞的 H∞ 状态反馈控制器设计问题 ,其控制器存在的充分条件由一个线性矩阵不等式 (L MI)的形式给出 ,并给出了相应的 H∞ 控制器的综合设计方法     

A tabu search algorithm for order acceptance and scheduling

We consider a make-to-order production system, where limited production capacity and order delivery requirements necessitate selective acceptance of the orders. Since tardiness penalties cause loss of revenue, scheduling and order acceptance decisions must be taken jointly to maximize total revenue. We present a tabu search algorithm that solves the order acceptance and scheduling problem on a single machine with release dates and sequence dependent setup times. We analyze the performance of the tabu search algorithm on an extensive set of test instances with up to 100 orders and compare it with two heuristics from the literature. In the comparison, we report optimality gaps which are calculated with respect to bounds generated from a mixed integer programming formulation. The results show that the tabu search algorithm gives near optimal solutions that are significantly better compared to the solutions given by the two heuristics. Furthermore, the run time of the tabu search algorithm is very small, even for 100 orders. The success of the proposed heuristic largely depends on its capability to incorporate in its search acceptance and scheduling decisions simultaneously.