关于建立城市智能交通实验研究中心的设想

基于联系国内外智能交通系统研究的具体实际，提出了建立城市智能交通实验研究中心的设想，并结合一个集成了视频和线圈信息采集方式的实验研究中心简单设计方案，对其所具有的基本功能作了初步研究和探讨。该系统兼具促进交流和有关培训等社会职能，可以作为国家智能交通事业发展过程中一种特殊的示范工程。     

ATMS在计算机辅助中医诊断中的应用*

计算机辅助诊断是当前人工智能和信息技术研究的热点之一。针对计算机辅助中医诊断的特殊性,结合ATMS这一人工智能推理系统,以脾虚证的计算机辅助诊断研究为契机,讨论了运用ATMS进行中医辅助诊断规则的表示、挖掘、查询和更新的问题。     

面向人为差错的多通道约束匹配模型

为减少用户使用产品时出现人为差错的概率,提高产品的使用效率,建立了面向人为差错的多通道约束匹配模型。分别从认知层面与执行层面对造成人为差错的因素进行探讨,应用基于假设的真值维护系统理论得到3种差错类型,分别为认知错误、认知失效和操作失误。从视觉、听觉和触觉3个通道为产品加载设计约束,构造问题求解器,建立差错类型环境与通道类型集合的映射关系,从而得到多通道约束匹配模型,实现非单调推理。以某品牌车载导航仪为例,提取人为差错因子,基于多通道约束匹配模型架构建立导航任务过程中的面向人为差错的多通道约束子模型,并通过该子模型找到导航出错的有效约束,从而减少车载导航仪在使用过程中产生的人为差错,提升车载导航仪使用绩效。建立面向人为差错的多通道约束匹配模型,为减少用户使用产品出现人为差错提供了基础研究架构。     

蒙特卡罗法在局域网交通信息估计中的应用

为解决理论计算需要事先已知车辆行驶路径的问题,提出采用蒙特卡罗法设计局域路网交通信息估计集成仿真模型,可利用有限交通采集设备,实现全面掌握城市路网交通运行状况、快速有效制定管理措施的目的。在实际路网上的研究结果表明,其具有良好的可靠性,可为先进交通管理系统（ATMS）相关交通模型的建立和交通采集设备的布设提供依据。     

THE LazyRMS: AVOIDING WORK IN THE ATMS

The basic algorithms involved in reason maintenance in the standard ATMS is known to have a computational complexity that is exponential in the worst case. Yet, also in average-case problem solving, the ATMS often lays claim to a major part of the computational effort spent by a problem solver/ATMS system. In this paper, we argue that within the limits of the worst-case computational complexity, it is possible to improve on the average-case complexity of reason maintenance and query processing by eliminating computation that is of no relevance to the problem solver's performance. To this purpose, we present a set of algorithms designed to control the effort spent by the ATMS on label updating. The basic idea underlying these algorithms is that of lazy evaluation: labels are not automatically maintained on all datums but are computed only when needed (either directly or indirectly) by the problem solver. The algorithms have been implemented in the LazyRMS with which we have experimented in the context of model-based diagnosis; our experiments show a substantial saving in the computational effort spent on reason maintenance.     

1,3-双(3-羟丙基)-1,1,3,3-四甲基二硅氧烷(BHTS)的合成及表征

采用三甲基硅氧烷及六甲基二硅氮烷与丙烯醇反应制得烯丙氧基三甲基硅烷(ATMS),对比二种方法得知用六甲基二硅氮烷制备时操作更加方便,产率可达到100%;再从ATMS出发,经硅氢加成,醇解生成1,3-双(3-羟丙基)-1,1,3,3-四甲基二硅氧烷(BHTS),反应简单,安全,产率为90%。通过红外和核磁对各段产物进行表征,基本符合设想。     

Operations research and semantic control: application to advanced traffic management

Operations Research (OR) is well known for the plethora of tools and techniques it offers to address complex and sometimes non-intuitive problems. In this paper we propose the use of the semantic control paradigm as a framework for the development of advanced traffic management systems (ATMS), and show how the tools afforded to us by OR can be applied within this framework to solve problems in traffic management. A brief overview is given of the scope of problems addressed by OR, and of the structure of a semantic control system. This is followed with an example showing the application of artificial neural networks and shortest path algorithms to the problem of estimating highway traffic volume and the subsequent allocation of traffic to maintain road capacity.     

An Efficient Algorithm to Generate Prime Implicants

In this paper, an efficient recursive algorithm is presented to compute the set of prime implicants of a propositional formula in conjunctive normal form (CNF). The propositional formula is represented as a (0,1)-matrix, and a set of 1's across its columns are termed as paths. The algorithm finds the prime implicants as the prime paths in the matrix using the divide-and-conquer technique. The algorithm is based on the principle that the prime implicant of a formula is the concatenation of the prime implicants of two of its subformulae. The set of prime paths containing a specific literal and devoid of a literal are characterized. Based on this characterization, the formula is recursively divided into subformulae to employ the divide-and-conquer paradigm. The prime paths of the subformulae are then concatenated to obtain the prime paths of the formula. In this process, the number of subsumption operations is reduced. It is also shown that the earlier algorithm based on prime paths has some avoidable computations that the proposed algorithm avoids. Besides being more efficient, the proposed algorithm has the additional advantage of being suitable for the incremental method, without recomputing prime paths for the updated formula. The subsumption operation is one of the crucial operations for any such algorithms, and it is shown that the number of subsumption operation is reduced in the proposed algorithm. Experimental results are presented to substantiate that the proposed algorithm is more efficient than the existing algorithms.     

A New Method for Reasoning about Action

Reasoning about action is an important aspect of common sense reasoning and planning.It gives rise to three classical problems:the frame problem,the qualification problem and the ramification problem.Existing approaches cannot deal with these problems efficiently.This paper presents a new method which uses the stratified ATMS for reasoning about action to overcome the limitations of these approaches.     

利用XML和JDOM实现ATMS

利用XML结构与语义自描述的特性,结合JDOM对XML文件操作的清晰性和简便性,实现了基于假设的真值维护系统(ATMS)的基本结构的表示和标记更新算法,并提供了问题求解器的接口以便将其扩充成一个完整的推理系统。