LARS—MAS模型中的通信及合作

文章在为搜索服务的多智能Agent系统(IARS—MAS)模型的基础^[1]上，进一步探讨了如何在各子Agent之间分配子任务以便高效地完成某项检索任务，以及如何通过学习让系统能在各Agent之间协调以最大化系统的效率。为此，在描述了总体构思的基础上，形式化了协调能力学习的方法。     

多Agent的协调组合设计模型研究

多 Agent协调机制研究是近年来受到广泛关注的研究方向 .在这个问题的研究中 ,人们普遍关注的问题是如何组织协调 Agent之间的关系 ,让各 Agent充分发挥作用 ,使系统处于最佳状态 .本文抓住多 Agent之间的这个关键问题 ,提出了多 Agent的协调组合设计模型 ,从而为这个动态系统的各 Agent有机组合找到了有效的处理方法 ,进一步丰富和完善了多 Agent协调机制的研究内容     

基于多Agent的传感器管理系统研究与设计

本文提出了一种传感器管理系统框架,给出了基于多Agent的解决方案。该结构通过多个Agent间的相互协商来实现传感器任务的分配,较好地克服了在融合中心存在的缺陷。并在此基础上着重探讨各Agent之间的协调合作问题,实现了基于KQML语言的各Agent之间的协调机制。     

基于元组空间的Agent协作模型的分析与实现

一、引言在基于Agent的分布式处理系统中,由于单个Agent不能充分利用系统中的资源,所以一个复杂的任务常常分解为多个简单的任务,每个简单的任务由一个Agent完成,通过多个Agent的协调合作共同解决问题,故Agent之间如何很好地协作是多Agent系统设计中一个很重要的方面。在层出不穷的Agent系统中,Agent之间的合作方式不外乎两种:直接合作和间接合作,直接合作建立在Agent之间直接通信的基础上,而间接合作则通过第三方作为媒介。目前,大多数Agent系统都采用基于消息传递的直接合作方式,消息传递要求通信前必须事先知道对方的地址、名字,当Agent移动时,其地址会经常发生变化,所以为支持直接通     

AgletBlackboard：Aglets系统协同机制的扩充

随着Internet的不断发展，移动Agent技术的应用越来越广泛。实际的应用通常需要由多个移动Agent共同来完成任务，如何组织与协调移动Agent之间的行动带来了对分布式环境中移动Agent之间协同的研究。本文介绍了移动Agent的四种协同模式，并针对Aglets系统中Aglet之间通过直接协同存在的不足．设计实现了基于黑板协同模式的AgletBlackboard，进一步提高了Aglets系统的功能。     

基于可能回答集程序的多Agent信念协调

多Agent系统(Multi-Agent System,MAS)是人工智能领域的一个非常活跃的研究方向。在多Agent系统中,由于Agent之间信念的差异,会不可避免地造成行动冲突。Sakama等提出的严格协调方法只适用于各Agent之间有共同信念的情境,当不存在共同信念时,此协调方法无解。针对该问题,文中提出了一种基于可能回答集程序(Possibilistic Answer Set Programming,PASP)的信念协调方法。首先,针对各Agent的不同信念集,基于加权定量的方法计算PASP的回答集相对Agent信念的满足度,以此来弱化某些信念,并且引入缺省决策理论推理得到Agent信念协调的一致解。然后,根据一致解建立一致的协调程序,将其作为Agent共同认同的背景知识库。最后,以dlv求解器为基础实现了多Agent信念协调算法,使Agent之间可以自主完成信念协调。文中以旅游推荐系统为例,说明该算法能够打破严格协调方法的局限,有效解决各Agent之间无共同信念时的协调问题。     

分布式DWMS中移动Agent间的协同工作

分布式工作流管理系统中工作流引擎的分布特性使管理者难以从整体上协调各节点间的工作。对此,文章将移动Agent技术应用于分布式工作流管理系统中。移动Agent作为一种移动工作流引擎存储整个工作流过程模型并在各节点间自主移动,通过与系统管理者的动态交互可使管理者实时监控整个流程的运行状态。为解决系统中单一移动Agent任务过于繁重的问题,将移动Agent分为协同移动Agent和任务移动Agent两类,通过他们之间的协同工作提升工作流过程的运行效率。     

基于Agent联盟的协作学习系统研究

为了在协作学习系统中实现学习者Agent之间的有效合作,通过引入一种新的合作机制--同学关系网模型(Schoolmate Relation Web Model),来构建学习系统中学习者Agent之间的同学联盟,并且基于学习者Agent之间的同学联盟来实现多个学习者Agent之间的协作学习.在每个同学联盟中,任意两个Agent之间都具有同学关系,并且联盟中的所有Agent相互协作,共同完成学习任务.另外,联盟中的学习者Agent之间的通信不是直接进行的,而是通过一个黑板来进行,这可以显著地提高Agent之间的通信效率.由于同学关系网模型可以避免Agent联盟形成的盲目性,并且可以提高学习者Agent之间的交互效率,从而使得我们基于Agent同学联盟的协作学习系统可以实现学习者Agent之间的有效合作,弥补了现有协作学习系统的不足.     

基于MAS智能分布实时监测系统任务协调与调度

在现代分布实时监测系统工作环境下,要清晰地表示分布的任务结构和任务之间的交互关系是非常困难的。为了解决这个问题,给出了一种Agent体系结构,它通过一般部分全局计划方法表示Agent任务结构,实现具有一定适应能力的协调机制,获得Agent本地调度方案。     

基于Multi-agent技术的露天矿山生产调度系统的优化实现

针对动态变化、复杂非线性的露天矿山生产调度系统引入多智能体技术进行建模优化,将系统分为任务Agent、生产调度Agent、爆破Agent、运输Agent以及破碎Agent五个单智能体。在任务Agent中给出矿山的矿石需求量,运用自适应神经模糊推理系统（ANFIS）和遗传算法（GA）对爆破Agent进行建模优化;破碎Agent根据破碎能力以及破碎需求量对运输Agent进行约束,引入自适应变异程序改进粒子群算法(PSO)对运输Agent进行优化;生产调度Agent协调处理矿石需求量与各生产工艺Agent生产能力之间的矛盾,运用MATLAB软件对模型进行模拟实现。以某露天矿山为例构建露天矿山生产调度系统,建模优化结果表明该方法可行。     

集合代数是经典命题演算形式系统的语义解释

经典命题演算形式系统(CPC)中的公式只是一些形式符号,其意义是由具体的解释给出的.逻辑代数和集合代数都是布尔代数,都是CPC的解释.集合代数是CPC的集合语义,其中对联结词的解释就是集合运算;对形式公式的解释就是集合函数;对逻辑蕴涵.逻辑等价的解释就是集合包含和集合相等=.标准概率逻辑是在标准概率空间上建立的逻辑体系,命题表示随机事件,随机事件是集合,概率空间中的事件域是集合代数,概率逻辑就是CPC集合语义的实际应用.CPC完全适用于概率命题演算.     

Compact disc standards: an introductory overview

The success of the compact disc (CD) as a storage medium for digital audio has, over the last ten years, resulted in a number of initiatives to use the CD for other applications as well, e.g., as read-only memory for computers, as a storage medium for audio-visual material for multimedia applications, and as a storage medium for photographs. Each of these applications poses additional requirements on how the corresponding information is stored and retrieved, resulting in a range of different CD standards. The functional specifications of these standards are each given a specific color for ease of reference: the Red Book for CD-DA, the Yellow Book for CD-ROM, the Green Book for CD-I, etc. This paper aims at giving an overview of the various CD standards by explaining what is specified in each of the colored books and by indicating how they relate to one another.     

Local path planning using a new artificial potential function composition and its analytical design guidelines

This paper presents a new framework for path planning based on artificial potential functions (APFs). In this scheme, the APFs for path planning have a multiplicative and additive composition between APFs for goal destination and APFs for obstacle avoidance, unlike conventional composition where the APF for obstacle avoidance is added to the APF for goal destination. In particular, this paper presents a set of analytical guidelines for designing potential functions to avoid local minima for a number of representative scenarios based on the proposed framework for path planning. Specifically the following cases are addressed: (i) a non-reachable goal problem (a case in which the potential of the goal is overwhelmed by the potential of an obstacle), (ii) an obstacle collision problem (a case in which the potential of the obstacle is overwhelmed by the potential of the goal) and (iii) a narrow passage problem (a case in which the potential of the goal is overwhelmed by the potential of two obstacles). The example results for each case show that the proposed scheme can effectively construct a path-planning system with the capability of reaching a goal and avoiding obstacles despite possible local minima.     

Database design with user-definable modelling concepts

Modelling is an integral part of engineering processes. Consequently, database design for engineering applications should take into account the modelling concepts used by engineers. On the other hand, these applications exhibit a wide diversity of modelling concepts. Rather than consolidating these into one single semantic data model one should aim for correspondingly specialized semantic models. This paper takes a constructive approach to developing such specialized models by proposing an Extensible Semantic Model (ESM) as the basis for declaring specialized semantic data models. The paper introduces a computerized environment for database design based on an ESM, and discusses the consequences of the ESM for a number of design tools: the need for a formal definition of the notion of modelling concept in order to have reliable and precise foundation for the extensions, declarative techniques for quickly introducing graphical representations for new concepts and for using them during schema design, conceptual-level test data generation for a designer-oriented evaluation of designs, and optimization techniques to control the wide latitude in mapping a conceptual schema to a logical schema. First experiences seem to point to considerable productivity gains during database design.     

Polycube Shape Space

There are many methods proposed for generating polycube polyhedrons, but it lacks the study about the possibility of generating polycube polyhedrons. In this paper, we prove a theorem for characterizing the necessary condition for the skeleton graph of a polycube polyhedron, by which Steinitz's theorem for convex polyhedra and Eppstein's theorem for simple orthogonal polyhedra are generalized to polycube polyhedra of any genus and with non‐simply connected faces. Based on our theorem, we present a faster linear algorithm to determine the dimensions of the polycube shape space for a valid graph, for all its possible polycube polyhedrons. We also propose a quadratic optimization method to generate embedding polycube polyhedrons with interactive assistance. Finally, we provide a graph‐based framework for polycube mesh generation, quadrangulation, and all‐hex meshing to demonstrate the utility and applicability of our approach.     

Measuring texture classification algorithms

The texture analysis literature lacks a widely accepted method for comparing algorithms. This paper proposes a framework for comparing texture classification algorithms. The framework consists of several suites of texture classification problems, a standard functionality for algorithms, and a method for computing a score for each algorithm. We use the framework to demonstrate the peaking phenomenon in texture classification algorithms. The framework is publicly available on the Internet.     

Automating Test Case Selection in Model-Based Software Product Line Development

We address the problem of how to select test cases for products in a controlled model-based software product line development process. CVL, the common variability language, gives a framework for materialisation of product models from a given base model, variability model and resolution model. From such product models, software products can be derived. In practise, test case development for the product line often is independent from the product development. Therefore, the problem arises which test cases can be applied to which products. In particular, the question is whether a test case for one speci c product can be also used for a "similar" product. In this paper, we show how the expected outcome of a test case to a product in a model-based software product line development can be determined. That is, we give a procedure for assigning the outcome of a given test case on an arbitrary member of a software product line. We recall the relevant de nitions for software product line engineering, describe our approach, and demonstrate it with the example of a product line of super-automatic espresso machines.     

Programming with behavior-processes

The so-called CubeOS is a special software environment for behavior-oriented robotics. It ranges from a dedicated nanokernel and hardware drivers for a broad set of sensors and actuators over operating system support for concurrent and real-time programming to a special high-level language suited for novices in the field. As most special feature, the CubeOS framework includes a novel scheduler, designed for the particular needs of behavior-oriented robotics.     

Binorm—a fortran subroutine to calculate the percentiles of a standardized binormal distribution

BINORM is a FORTRAN subroutine for calculating the percentiles of a standardized binormal distribution. By using a linear transformation, the percentiles of a binormal distribution can be obtained. The percentiles of a binormal distribution are useful for plotting purposes, for establishing confidence intervals, and for sampling from a mixed population that consists of two normal distributions.     

LIY: learn-it-yourself software interfaces

An increasing number of people are becoming users of unfamiliar software. They can be genuinely "new" computer users or part of a growing group who are transferring skills and knowledge from a familiar product such as a word processor to a functionally similar, but different, unfamiliar one. The problem for users in this position is that they do not have access to training courses to teach them how to use such software and are usually forced to rely on text-based documentation. LIY is a method for producing computer-based tutorials to teach the user ofasoftware product.This paper describes how LIY is, in turn, (1) a method for application system design which recognizes the need for tutorial design (a task analysis and user interface specification provide information structures that are passed to the tutorial designer); (2) a support environment for the tutorial designer (in addition to prompting for courseware for nodes in the task analysis, LIY provides a ready-made rule base for constraining the degree of learner control available while the tutorial is in use. The designer is able to tailor this rule base for a specific tutorial); and (3) a tutorial delivery environment (the tutorial adapts to individual learners and offers a degree of learner control).