基于ARX模型的压电智能结构振动预测控制

采用预测控制法对压电智能结构的振动主动控制进行了实验研究，通过实验方法建立了系统的ARX模型，并在此基础上设计了预测控制器对结构进行振动主动控制。实验结果验证了该方法在压电智能结构振动主动控制中的可行性和有效性。     

基于Agent的分布式查询优化研究

Internet上异构的软硬件环境以及多种并行机制对分布式查询优化技术提出了新的挑战，文章将分布式人工智能与数据库管理系统两个研究领域相结合，给出了基于Agent的分布式查询优化系统模型，在该系统中，Agent采用了典型的慎思型体系结构，即BDI模.Agent具有信念库，目标库并在此基础上进行学习和推理，多个Agent之间通过协调，协作以及协商以支持分布式数据库系统的动态查询优化和规划的执行，提高系统的查询效率。     

基于图像数据库的动态场景生成系统

实现各类目标和背景下动态场景的计算机编辑和生成，首先应对组成动态场景的要素进行分析，即目标，目标运动规律和特殊事件四个要素，然后通过编程由四个模块完成相应功能。目标，背景编辑模块可对目标，背景图像进行各种处理，并对重要特征量进行计算，运动路径模块可指定目标的运行规律，包括路线，大小和角度变化等。特殊事件模块可加入独立目标的各类典型事件，如运动的干扰物等。最后通过动态场景合成由计算机自动生成所需的动态场景图像。所需的原始目标，背景图像来源于图像数据库管理系统，通过索引项可便携地找到。     

轴快流CO2激光器气体压力控制

激光切割对激光功率模式、功率密度和功率稳定性要求很高,采用轴快流CO2激光器时,控制工作气体压力工作在最佳状态并保持其恒定是激光器输出连续、稳定功率的必要条件和关键技术之一。在深入研究激光器工作原理和影响激光输出功率因素的基础上,采用带积分分离的智能PID控制算法对工作气体压力进行调节。该过程控制算法简单实用,可以有效地提高气体压力控制精度,改善功率控制精度和稳定性,并用实验加以验证。     

新一代智能城域光网络

本提出了一种标准化的光控制平面。阐明了开了用于光传输网的控制平面所遇到的选择与挑战。光控制平面被分解成邻居发现、服务发现、连接控制和拓扑、资源发现等几个基本的过程。不同的网络组织和分割导致了几个不同的自动配置模型：软性持久链路模型、用户接口模型和对等模型。这是构成以IP为中心的光传输网的控制和管理基础。同时也介绍了基于SDH光交换的新一代CIENA公司智能光网络，它具有大容量光交换能力和网络拓扑结构自动发现、端对端电路配置、带宽动态分配等功能及特点，将大大提高数据、电路业务的服务质量，新一代智能光网络是干线和城域网络交换传输最佳的选择。     

Spray forming technology for military applications

Over the past five years, the Annapolis Detachment, Carderock Division, Naval Surface Warfare Center (formerly David Taylor Research Center) has established a state- of- the- art spray forming facility for the study and exploitation of this near net shape manufacturing process. Spray forming is a single step gas atomization/deposition process which yields ferrous and nonferrous, near final shape, near fully dense preforms that has proven to be a viable and cost effective alternative to conventional metalworking technology for the production of material preforms with properties surpassing those of their cast and wrought counterparts. Current programs at Carderock Divison Naval Surface Warfare Center are aimed at optimization of the process, certification of the spray formed products and industrialization of the technology.     

Learning and Revising User Profiles: The Identification of Interesting Web Sites

We discuss algorithms for learning and revising user profiles that can determine which World Wide Web sites on a given topic would be interesting to a user. We describe the use of a naive Bayesian classifier for this task, and demonstrate that it can incrementally learn profiles from user feedback on the interestingness of Web sites. Furthermore, the Bayesian classifier may easily be extended to revise user provided profiles. In an experimental evaluation we compare the Bayesian classifier to computationally more intensive alternatives, and show that it performs at least as well as these approaches throughout a range of different domains. In addition, we empirically analyze the effects of providing the classifier with background knowledge in form of user defined profiles and examine the use of lexical knowledge for feature selection. We find that both approaches can substantially increase the prediction accuracy.     

高职教育网上成绩考核系统的总体设计

本文对网上成绩考核系统进行了总体设计.其中,设计了校园网的网络结构模型、网上成绩考核系统的模块结构及其数据库和数据表.     

多功能智能流量计研制

本文详细论述了利用单片微计算机构成的多功能、多用途流量计量与自动控制系统的研制设计，给出了系统硬件原理框图与软件结构框图。该仪器适用范围较广，具有广阔的应用前景。     

On the monotonicity of (LDL) logic programs with set

LDL is one of the recently proposed logical query languages, which incorporate set, for data and knowledge base systems. Since LDL programs can simulate negation, they are not monotonic in general. On the other hand, there are monotonic LDL programs. This paper addresses the natural question of “When are the generally nonmonotonic LDL programs monotonic?” and investigates related topics such as useful applications for monotonicity. We discuss four kinds of monotonicity, and examine two of them in depth. The first of the two, called “ω-monotonicity”, is shown to be undecidable even when limited to single-stratum programs. The second, called “uniform monotonicity”, is shown to implyω-monotonicity. We characterize the uniform monotonicity of a program (i) by a relationship between its Bancilhon-Khoshafian semantics and its LDL semantics, and (ii) with a useful property called subset completion independence. Characterization (ii) implies that uniformly monotonie programs can be evaluated more efficiently by discarding dominated facts. Finally, we provide some necessary and/or sufficient, syntactic conditions for uniform monotonicity. The conditions pinpoint (a) enumerated set terms, (b) negations of membership and inclusion, and (c) sharing of set terms as the main source for nonuniform monotonicity.