Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

A simple algorithm for checking compatibility among discrete conditional distributions

A distribution is said to be conditionally specified when only its conditional distributions are known or available. The very first issue is always compatibility: does there exist a joint distribution capable of reproducing all of the conditional distributions? We review five methods-mostly for two or three variables-published since 2002, and we conclude that these methods are either mathematically too involved and/or are too difficult (and in many cases impossible) to generalize to a high dimension. The purpose of this paper is to propose a general algorithm that can efficiently verify compatibility in a straightforward fashion. Our method is intuitively simple and general enough to deal with any full-conditional specifications. Furthermore, we illustrate the phenomenon that two theoretically equivalent conditional models can be different in terms of compatibilities, or can result in different joint distributions. The implications of this phenomenon are also discussed.     

基于ZigBee的生产线监控系统的设计与实现

根据生产线的实际需要,设计并实现了用于生产线的无线信息传输网络节点,研究了系统结构,完成了系统的软硬件设计,详细分析了ZigBee组网通信、应答机制建立等关键技术。测试结果表明,系统传输距离远、可靠性高,能够满足实际应用需要。     

基于几何推理的装配序列自动规划研究

文章以问题规约的求解策略,以分解法规划产生的装配序列,提出与或图表达装配体拆卸序列解空间。通过求解拆卸序列与或图的解空间得到装配体的拆卸序列,将拆卸序列反向得到装配序列。为降低装配体拓扑联接图的复杂度,对作业组件做出识别。另外提出了判断零件拆卸性的三个条件,大部分零件无需进行干涉检验,而白逻辑推理即可判断是否满足拆卸条件,避免了多次试凑,具有更高的求解效率,可更广泛地用于装配序列求解。     

对规划理论研究现状的分析

1 引言现在不少人工智能(AI)研究者认为定义人工智能的一种方法就是将它看作是以构建具有智能行为的agent为目标的研究领域。从这种观点看,“agent”实际上就是人工智能的核心。自从80年代后期以来,关于agent理论及应用的研究取得了很大发展,目前agent是主流计算机科学,包括数据通讯、并行系统、机器人、用户接口设计等等的研究人员所讨论的一个主题。构建agent的经典方法是将它们看作特殊类型的基于知识的系统,这就是通常的符号方法,而相应的a-gent则被称为慎思的agent。一个慎思的agent包含对环境的确切描述的符号模型,并且其决策(例如应采取什么行动)都是基于模式识别或符号处理,通过逻辑推     

基于虚拟多任务机制的OSPF-2的设计与实现

OSPF（Open Shortest Path First Protocol）协议是目前Internet上广泛使用的自治系统内部交换路由信息的动态路由协议。文章介绍了在清华大学研制的国产高性能路由器中分布式路由协议OSPF－2的具体实现。为了实现这一复杂的动态协议,文章提出了基于事件驱动的虚拟多任务机制的设计和实现方法。这种机制能够有效支持复杂系统的分解,在实时性要求不高的前提下提供一种简便有效的并行机制,方便基于状态机的软件实现,提高了软件的可移植性。该方法对于其它的Internet高层协议的设计和实现也有一定的参考价值。     

Path-planning and navigation of a mobile robot as discrete optimization problems

There is huge diversity among navigation and path-planning problems in the real world because of the enormous number and great variety of assumptions about the environments, constraints, and tasks imposed on a robot. To deal with this diversity, we propose a new solution to the path-planning and navigation of a mobile robot. In our approach, we formulated the following two problems at each time-step as discrete optimization problems: (1) estimation of a robot's location, and (2) action decision. For the first problem, we minimize an objective function that includes a data term, a constraint term, and a prediction term. This approach is an approximation of Markov localization. For the second problem, we define and minimize another objective function that includes a goal term, a smoothness term, and a collision term. Simulation results show the effectiveness of our approach. This work was presented in part at the Fifth International Symposium on Artificial Life and Robotics, Oita, Japan, January 26–28, 2000     

Distributed planning and control systems for the virtual enterprise: organizational requirements and development life-cycle

This paper describes the requirements analysis and system specification of an Order Promise module to be used as part of a broader Decision Support System for production and operations planning of a Virtual Enterprise. This work is part of a broader project with a particular focus on the microelectronics industry which is a good example of Virtual Enterprise, and where a quick response to the customers needs and to unpredictable changes in production conditions is considered a major factor for success. First, the analysis and specification are presented within a development framework that involves the study of organizational issues of semiconductor enterprises. The use of ontological engineering for supporting the communication and shared understanding of the system concepts is explained and a virtual enterprise ontology is outlined. Following the clarification of the concept of virtual enterprise, the generic techno-organizational requirements for the information system are derived. Finally, a specification of the global planning module and a more detailed one regarding the order promise module is presented.     

客户关系管理

客房关系管理（CRM）是世界各地主要企业正在讨论的一个热点问题。随着现代企业信息化管理的不断发展,实行有效的CRM策略对企业的生存和发展显得越来越重要。本文介绍了客户关系管理的系统组成、功能、作用、技术支持等方面的内容,讨论了它的数据处理过程及未来的发展。     

Robot Motion Planning: A Game-Theoretic Foundation

Analysis techniques and algorithms for basic path planning have become quite valuable in a variety of applications such as robotics, virtual prototyping, computer graphics, and computational biology. Yet, basic path planning represents a very restricted version of general motion planning problems often encountered in robotics. Many problems can involve complications such as sensing and model uncertainties, nonholonomy, dynamics, multiple robots and goals, optimality criteria, unpredictability, and nonstationarity, in addition to standard geometric workspace constraints. This paper proposes a unified, game-theoretic mathematical foundation upon which analysis and algorithms can be developed for this broader class of problems, and is inspired by the similar benefits that were obtained by using unified configuration-space concepts for basic path planning. By taking this approach, a general algorithm has been obtained for computing approximate optimal solutions to a broad class of motion planning problems, including those involving uncertainty in sensing and control, environment uncertainties, and the coordination of multiple robots. Received November 11, 1996; revised March 13, 1998.