A multi-agent intelligent system for efficient ERP maintenance

The Enterprise Resource Planning (ERP) system is an enterprise-wide integrated software package designed to uphold the highest quality standards of business process. However, for the time being, when the business condition has been changed, the system may not guarantee that the process embedded in ERP is still best. Moreover, since the ERP system is very complex, maintaining the system by trial and error is very costly. Hence, this paper aims to construct a support system that adjusts ERP system to environmental changes. To do so, we adopt multi-agent intelligent technology that enables autonomous cooperation with one another to monitor ERP databases and to find any exceptional changes and then analyze how the changes will affect ERP performance. Moreover, Petri net is applied to manage the complexity and dynamics of agents’ behavior. To show the feasibility of the idea, a prototype agent system, ERP/PN, is proposed and an experiment is conducted.     

基于多媒体多智能Agents系统的群体决策支持系统集成化设计研究

分析了Ｄeｓａｎｅｔｉｓ＆Ｇａｌｌｕｐｅ群体决策支持系统（Ｇｒｏｕｐ Ｄｅｃｉｓｉｏｎ Ｓｕｐｐｏｒｔ,简称ＧＤＳＳ）初步设计的通用模式,提出了将多媒体技术、智能Ａｇeｎｔs技术、数据仓库技术Ｉｎｔｅｒｎｅｔ／Ｉｎｔｒａｎｅｔ技术等有机地集成于ＧＤＳＳ的集成化设计方案,并就其关键技术功能结构方案设计进行了研究．     

实时信息系统的虚拟分层设计方案

本文借助软件系统分层设计的思想,提出了虚拟层的概念,并给出了一个实时信息系统虚拟分层设计方案,这为实际应用中各种规模的系列系统提供了一个组态灵活的开发方法。实践证明,这个方案取得了很好的效果,并具有很强的灵活性。     

Optimal Control of Two-Stage Discrete Event Systems with Real-Time Constraints

We consider discrete event systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task meeting its own constraint. When tasks are processed over a single stage, it has been shown that there are structural properties of the optimal sample path that lead to very efficient solutions of such problems. When tasks are processed over multiple stages and are subject to end-to-end real-time constraints, these properties no longer hold and no obvious extensions are known. We consider a two-stage problem with homogeneous cost functions over all tasks at each stage and derive several new optimality properties. These properties lead to the idea of introducing “virtual” deadlines at the first stage, thus partially decoupling the stages so that the known efficient solutions for single-stage problems can be used. We prove that the solution obtained by an iterative virtual deadline algorithm (VDA) converges to the global optimal solution of the two-stage problem and illustrate the efficiency of the VDA through numerical examples.

QDENSITY—A Mathematica Quantum Computer simulation

This Mathematica 5.2 package¹ is a simulation of a Quantum Computer. The program provides a modular, instructive approach for generating the basic elements that make up a quantum circuit. The main emphasis is on using the density matrix, although an approach using state vectors is also implemented in the package. The package commands are defined in Qdensity.m which contains the tools needed in quantum circuits, e.g., multiqubit kets, projectors, gates, etc. Selected examples of the basic commands are presented here and a tutorial notebook, Tutorial.nb is provided with the package (available on our website) that serves as a full guide to the package. Finally, application is made to a variety of relevant cases, including Teleportation, Quantum Fourier transform, Grover's search and Shor's algorithm, in separate notebooks: QFT.nb, Teleportation.nb, Grover.nb and Shor.nb where each algorithm is explained in detail. Finally, two examples of the construction and manipulation of cluster states, which are part of “one way computing” ideas, are included as an additional tool in the notebook Cluster.nb. A Mathematica palette containing most commands in QDENSITY is also included: QDENSpalette.nb.

Program summary

Title of program: QDENSITYCatalogue identifier: ADXH_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXH_v1_0Program available from: CPC Program Library, Queen's University of Belfast, N. IrelandOperating systems: Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux FC4Programming language used: Mathematica 5.2No. of bytes in distributed program, including test data, etc.: 180 581No. of lines in distributed program, including test data, etc.: 19 382Distribution format: tar.gzMethod of solution: A Mathematica package is provided which contains commands to create and analyze quantum circuits. Several Mathematica notebooks containing relevant examples: Teleportation, Shor's Algorithm and Grover's search are explained in detail. A tutorial, Tutorial.nb is also enclosed.     

PROFIBUS和AS-I总线在汽车生产线中的应用

本文简单介绍了PROFIBUS和AS-I现场总线的原理并详细说明了它们在汽车生线的应用.     

分布式对象管理的几种常用技术

以丰富的分布式系统开发经验为基础,详细分析了传统和新兴的分布式对象技术,比较它们的优缺点,探索分布式对象管理的未来走向。     

扩展时间事件图的能达性与能控序列

利用图论方法在双子结构中研究扩展时间事件图的某些问题,获得了能达性的一个充分必要条件和基于能达性的标准结构。在此基础上,把监控理论中的能控序列的分量分为本质不同的３类,进而得到能控序列的简化求解方法。     

面向企业的运输销售管理信息系统设计

以石油企业运输销售经营管理为背景,对运输销售管理信息系统进行了研究.以软件工程为指导,运用先进的设计方法与结构分析,并结合数据库的特点给出了运输销售管理信息系统具体的设计方案.