基于Agent的工作流模型与应用

ＣＩＭＳ应用集成平台是企业实施ＣＩＭＳ有效支持工具,而ＭＩＳ系统则是整个ＣＩＭＳ集成平台的重要组成部分,主要研究了基于Ａｇｅｎｔ的工作流模型及其在ＭＩＳ系统中的应用,在ＷＦＭＳ参考模型的基础上,提出了一个基于Ａｇｎｅｔ的,易于扩展和移植的,以浏览器作为用户界面的工作流管理系统;ＡＢｓ－ＷＦＭＳ,并介绍了系统的运作方式。基于Ａｇｅｎｔ的工作流管理系统在浙江好来西ＣＩＭＳ系统的开发中作了有益的浓试。     

基于软件重用的MIS应用系统自动生成

本文通过对ＭＩＳ的共性分析，采用软件重用技术，以与数据分离了的程序即本文所称的ＭＩＳ工具做为底层基础，用二次生成技术，较好地解决了ＭＩＳ应用系统自动生成的问题，并较好地利用了以往ＭＩＳ开发中的大量宝贵软件资源，程序实现名为ＩＤＥＭＩＳ和ＭＩＳ应用系统集成开发环境，用Ｃ语言实现。     

用Visual Foxpro实现多媒体GIS的方法与实践

以ＭＩＳ系统中的地理信息系统（ＧＩＳ）应用出发点,以一个开发成功的实用系统ＱＲＤＭＩＳ为背景,讨论了用目前最大众化的ＭＩＳ环境Ｆｏｘｐｒｏｇ来开发ＧＩＳ的必要性,优点,主要实现技术等重要问题,注为ＧＩＳ的开发与应用打开一扇新的窗口。     

GIS构件及其在城镇公安综合管理信息系统中的应用

本文提出了传统ＧＩＳ应用系统开发中所存在的问题,以此介绍了ＧＩＳ构件在应用系统开发中的特点,并以ＭａｐＩｎｆｏ公司的构件产品 ＭａｐＸ为例,详细阐述 ＴＧＩＳ构件在城镇公安综合管理信息系统（ＰＳＧＩＳ）中的应用。     

信息管理系统安全策略

本文介绍了ＭＩＳ系统安全策略,它主要包括ＭＩＳ系统胡数据库、计算机网络等各层次上,尤其是在ＭＩＳ系统应用级上数据和系统安全的规划与实施方法。     

MIS结构控制设计法

本文介绍了应用ＭＩＳ结构控制器开发ＭＩＳ的设计思想与方法。利用结构控制器控制ＭＩＳ的系统结构，可以缩短ＭＩＳ开发周期，提高系统的自动生成程度，增强系统的可扩充性和可读性。该方法对各个领域的ＭＩＳ开发都适用，具有一定的实用和推广价值。     

软件构件化技术在MIS系统开发中的应用

介绍了软构件技术在实践中的应用。通过对ＭＩＳ系统开发方法的分析,提出了组合ＭＩＳ构件的一种新的开发方法─—积木法,将ＭＩＳ系统划分为若干功能构件,设计并实现了一个较通用的ＭＩＳ集成一体化开发环境。使得用户可以利用此环境中软构件库里的软构件,高效率地开发出高质量的ＭＩＳ系统。     

CIMS环境下信息集成平台：系统使能器技术的研究与应用

本文阐述了ＣＩＭＳ环境下信息集成平台中基于开放式客房／服务器结构的系统使能器技术的地位、功能及其在ＣＩＭＳ环境下的实现结构，并结合ＣＩＭＳ的具体应用工厂ＳＢＣＩＭＳ讨论了ＣＩＭＳ环境下基于系统使能器技术的信息集成结构。     

BOIF-CIMS实施中的关键技术及解决

该文介绍了ＢＯＩＦ－ＣＩＭＳ工程开展的背景和情况,给出了基于ＰＤＭ构架的ＣＩＭＳ集成体系结构。对ＢＯＩＦ－ＣＩＭＳ开发和实施中的一些关键技术及解决办法进行了讨论,并着重对ＢＯＩＦ－ＣＩＭＳ系统中多应用系统情况下的信息集成技术及数据流进行了阐述。     

管理信息系统自动生成集成环境autoMIS

本文在分析现有ＭＩＳ软件开发工具和开发环境的基础上，介绍了一个面向ＭＩＳ的应用系统自动生成集成开发－ａｕｔｏＭＩＳ的设计思想、总体框图、功能概述以及部分实现技术。ａｕｔｏＭＩＳ从数据库管理本身的特点和ＭＩＳ的共同点及动态性出发，进行了抽象和总结。使ａｕｔｏＭＩＳ与具体的ＭＩＳ无关，具有普遍的通用性。     

ON THE STABILITY AND STABILIZATION OF TIME‐VARYING NONLINEAR CONTROL SYSTEMS

Many stability and stabilization problems of nonlinear time‐varying systems lead to asymptotic behavior of (–K + L)‐type systems, which consist of a K‐function and an L‐function. The stability of these systems is of fundamental importance for a series of stabilization problems of time‐varying nonlinear control systems. Even though the asymptotical stability of such systems has been used widely and (in most cases) implicitly, we do not find a rigorous proof, in the literature, and the existing proof for a particular case is questionable. Under quite general conditions, we prove that the solution of these systems tends to 0 as t →. Some generalizations are also obtained. As an immediate consequence, a general theorem is obtained for the stabilization of time‐varying systems. Using the new framework, we examine several stability and stabilization problems. First of all, for cascade systems, two sets of sufficient conditions are obtained for uniformly asymptotical stability and globally asymptotical stability, respectively. Then we consider the stability of ISS and IISS systems. A new concept, namely, strong IISS, is proposed. Several stability properties for autonomous systems are extended to time‐varying systems. Finally, we consider stabilization via detection. A rigorous proof is given for a smooth state feedback time‐varying system with weak detectability to be stabilizable by means of an observer.     

浅议《操作系统》课程教学

《操作系统》是计算机及相关专业的核心课程,在整个理论体系中占有重要地位。阐述《操作系统》课程目前教学过程中存在的一些问题,并针对这些问题在教学方法和教学手段上进行一些探讨和试验,以求达到更好的教学效果。     

浅议《操作系统》课程教学

《操作系统》是计算机及相关专业的核心课程,在整个理论体系中占有重要地位。阐述《操作系统》课程目前教学过程中存在的一些问题,并针对这些问题在教学方法和教学手段上进行一些探讨和试验．以求达到更好的教学效果。     

DSS中的数据库管理子系统分析与应用

文章比较了DSS与MIS在数据管理上的差异,列出了DSS中常用的几种数据管理方法,重点分析了DSS数据库管理子系统的组成和结构,并结合开发实例,说明了建立DSS数据库管理子系统时应考虑的主要问题。     

基于消息通信的多智能体系统的应用

在基于多智能体的分布式实时仿真系统中,如何实现各Agent之间的通信与协调是一个核心问题。采用触发器消息传送方式为多智能体系统中的Agent建立了高效的通信机制,并通过分析机场地面交通中面临的问题构建了多智能体系统模型。实现了基于触发器消息通信机制的多智能体系统在机场地面交通仿真中的应用。     

求解度约束最小生成树的改进ACS算法

针对蚂蚁系统算法求解度约束最小生成树时收敛速度慢和早熟问题,提出一种改进的蚁群系统算法UDA-ACS。该算法在保留蚁群系统算法优点的基础上,通过增大能见度的影响力、采用动态负反馈机制和赋予不同初始信息素的方法解决上述问题。理论分析和实验结果证明,该算法的求解质量和速度比蚂蚁系统算法更优越。     

多Agent系统的研究

多Agent系统(MAS)是当前分布式人工智能(DAI)的主要研究方向之一。介绍了多Agent系统的背景和概念,着重分析了MAS的关键问题和构造MAS的组织模型,最后给出了多Agent系统的应用。     

Countering the negative search bias of ant colony optimization in subset selection problems

In their quest to find a good solution to a given optimization problem, metaheuristic search algorithms intend to explore the search space in a useful and efficient manner. Starting from an initial state or solution(s), they are supposed to evolve towards high-quality solutions. For some types of genetic algorithms (GAs), it has been shown that the population of chromosomes can converge to very bad solutions, even for trivial problems. These so-called deceptive effects have been studied intensively in the field of GAs and several solutions to these problems have been proposed. Recently, similar problems have been noticed for ant colony optimization (ACO) as well. As for GAs, ACO's search can get biased towards low-quality regions in the search space, probably resulting in bad solutions. Some methods have been proposed to investigate the presence and strength of this negative bias in ACO. We present a framework that is capable of eliminating the negative bias in subset selection problems. The basic Ant System algorithm is modified to make it more robust to the presence of negative bias. A profound simulation study indicates that the modified Ant System outperforms the original version in problems that are susceptible to bias. Additionally, the proposed methodology is incorporated in the Max–Min AS and applied to a real-life subset selection problem.     

– Ant System

Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to existing algorithms for hard combinatorial optimization problems, recent research in this area has mainly focused on the development of algorithmic variants which achieve better performance than Ant System.In this paper, we present – Ant System ( ), an Ant Colony Optimization algorithm derived from Ant System. differs from Ant System in several important aspects, whose usefulness we demonstrate by means of an experimental study. Additionally, we relate one of the characteristics specific to — that of using a greedier search than Ant System — to results from the search space analysis of the combinatorial optimization problems attacked in this paper. Our computational results on the Traveling Salesman Problem and the Quadratic Assignment Problem show that is currently among the best performing algorithms for these problems.     

XForm在工作流管理系统中的应用研究

传统的基于HTML/XML表单的工作流管理系统(WFMS)在用户友好性、对分布部署的支撑能力和安全性方面存在较大的缺陷,将XForm表单技术与WFMS集成以解决这些问题。探讨了基于XForm表单的WFMS的体系结构和实现原理,并在此指导下,结合开源工作流引擎Shark和XForm表单解析器Chiba给出了具体的实现方案和主要算法。该技术在实际系统的开发中得到了应用,并取得了良好的效果。