多主体系统的建模技术研究

为了有利于多主体系统的开发,目前急需一种系统建模技术来对系统复杂性进行行之有效的管理。由于面向对象的建模技术已经趋向成熟,该文在面向对象的建模方法的基础上阐述了一种面向主体的建模方法。该方法针对基于一种特定BDI结构的主体,它包括从内部观点建构信念、目标、计划模型（ 即所谓的BDI模型 ）和从外部观点建构单个主体模型和交互模型。而且,该方法也能容易地进行扩展并应用于其他结构的主体建模。文章对各个模型的建造作出了详细介绍。     

一种适合窄带网络多媒体教学的文件传输协议──NFTP的研究与实现

目前在网络环境下进行多媒体教学,网络速度是一个严重的瓶颈问题。在分析瓶颈产生的基础上,作者提出了一个新的文件传输协议──ＮＦＴＰ（Ｎａｒｒｏｗｂａｎｄ　Ｆｉｌｅ　Ｔｒａｎｓｆｅｒ　Ｐｒｏｔｏｃｏｌ窄带文件传输协议）,利用广播数据包方法解决多媒体教学中的速度问题,并设计了一组协议原语,用于协议的描述。     

不用艏侧推时船舶定点控位方法研究

本文提出了不用艏侧推的船舶定点控位控制方式。其特点是仿效人类航海技巧,充分利用海洋环境作用在船舶上的力来实现船舶的定点控位。仿真结果表明,在高海情下,此控制系统可以实现无艏侧推船舶定点控位,并且在设定点变化时,船舶具有较快的运动响应速度。     

会计事后监督系统

针对中国工商银行江西省分行会计事后监督系统的异种机网络构成,应用程序的实现和环境的配制进行了全面的阐述。     

Current manufacturing technologies for TFT‐LCDs

Abstract— TFT‐LCD panels for notebook‐PC applications requires a thin and light form factor, low power consumption, and good display quality, whereas the desktop monitor has different requirements such as large panel size, wide viewing angle, high resolution, brightness, etc. However, for the fifth‐generation of mass production, current panel technologies have to improve in order to cope with these requirements. In this article, various approaches to the manufacturing technologies of next‐generation TFT‐LCDs are discussed.     

Attributed concept maps: fuzzy integration and fuzzy matching

A concept map, typically depicted as a connected graph, is composed of a collection of propositions. Each proposition forming a semantic unit consists of a small set of concept nodes interconnected to one another with relation links. Concept maps possess a number of appealing features which make them a promising tool for teaching, learning, evaluation, and curriculum planning. We extend concept maps by associating their concept nodes and relation links with attribute values which indicate the relative significance of concepts and relationships in knowledge representation. The resulting maps are called attributed concept maps (ACM). Assessing students will be conducted by matching their ACMs with those prebuilt by experts. The associated techniques are referred to as map matching techniques. The building of an expert ACM has in the past been done by only one specialist. We integrate a number of maps developed by separate experts into a single map, called the master map (MM), which will serve as a prototypical map in map matching. Both map integration and map matching are conceptualized in terms of fuzzy set discipline. Experimental results have shown that the proposed ideas of ACM, MM, fuzzy map integration, and fuzzy map matching are well suited for students with high performances and difficult subject materials.     

Bias‐dependent small‐signal monolithic PIN diode modeling

This paper details a new bias‐dependant small‐signal modeling methodology for monolithic PIN diodes. The frequency‐dependent responses of intrinsic p‐i‐n structures are de‐embedded from monolithic microwave integrated circuit PIN diodes of varying size and layout configuration and fit from 6 to 45 GHz to a classical linear model at each of 15 different bias levels. This methodology results in a bias‐dependent intrinsic diode data set that shows excellent agreement with large samples of small‐signal measurements. The models are useful for comparing trade‐offs in electrical performance among PIN diodes of varying size and layout style. © 2001 John Wiley & Sons, Inc. Int J RF and Microwave CAE 11: 396–403, 2001.     

A performance criterion for the depth estimation with application to robot visual servo control

This article deals with the depth observability problem of a robot visual system with a moving camera. In the visual system, the unknown depth of a feature point is estimated from the input of the camera velocity and the output of the image of the feature point. Although it is well known that the linear velocity of the camera must satisfy some constraints for successful depth estimation, this proposes a criterion to measure the performance of the depth estimation, which is a heuristic extension from an estimation result of a linear system. This performance criterion depends on both the image position and the linear velocity of the camera. Some simulation and experiment examples demonstrate and verify the proposed performance criterion. Furthermore, this criterion is used to develop a new visual servo control scheme that has good performance in both the depth estimation and the visual control. This control scheme is also verified by a simulation example. © 2001 John Wiley & Sons, Inc.     

Time-bound negotiation framework for electronic commerce agents

For efficient and informative coordination of agents especially in electronic commerce environment, a time-bound agent negotiation framework is proposed utilizing a time-based commitment scheme. By attaching commitment duration to agent messages, the traditional contract net protocol is extended to a time-bound negotiation framework (TBNF). The proposed negotiation framework has a new message type which allows for parties to agree upon the extension of a commitment duration, and a novel commitment concept in the form of negative commitment. The semantics of the messages with the commitment duration are interpreted, and then the three typical negotiation protocols are formally defined and compared — nothing-guaranteed protocol, acceptance-guaranteed protocol, and finite-time guarantee protocol — which can be incorporated into TBNF. The TBNF should provide a background for efficient and effective electronic commerce negotiation while accommodating each agent's adaptive negotiation strategy.     

A Simultaneous Search Problem

We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x,y ∈ [0,1] with as little uncertainty as possible, using some given number k of probes. Each probe is specified by a real number r∈ [0,1] . After a probe at r , we are told whether x≤ r or x \geq r , and whether y≤ r or y\geq r . We derive the optimal strategy and prove that the asymptotic behavior of the total uncertainty after k probes is 13/7 2 ^-(k+1)/2 for odd k and 13/10 2 ^-k/2 for even k . Received November 11, 1996; revised October 2, 1997, and July 13, 1998.