Model checking temporal knowledge and commitments in multi-agent systems using reduction

Though modeling and verifying Multi-Agent Systems (MASs) have long been under study, there are still challenges when many different aspects need to be considered simultaneously. In fact, various frameworks have been carried out for modeling and verifying MASs with respect to knowledge and social commitments independently. However, considering them under the same framework still needs further investigation, particularly from the verification perspective. In this article, we present a new technique for model checking the logic of knowledge and commitments (CTLKC⁺). The proposed technique is fully-automatic and reduction-based in which we transform the problem of model checking CTLKC⁺ into the problem of model checking an existing logic of action called ARCTL. Concretely, we construct a set of transformation rules to formally reduce the CTLKC⁺ model into an ARCTL model and CTLKC⁺ formulae into ARCTL formulae to get benefit from the extended version of NuSMV symbolic model checker of ARCTL. Compared to a recent approach that reduces the problem of model checking CTLKC⁺ to another logic of action called GCTL¹, our technique has better scalability and efficiency. We also analyze the complexity of the proposed model checking technique. The results of this analysis reveal that the complexity of our reduction-based procedure is PSPACE-complete for local concurrent programs with respect to the size of these programs and the length of the formula being checked. From the time perspective, we prove that the complexity of the proposed approach is P-complete with regard to the size of the model and length of the formula, which makes it efficient. Finally, we implement our model checking approach on top of extended NuSMV and report verification results for the verification of the NetBill protocol, taken from business domain, against some desirable properties. The obtained results show the effectiveness of our model checking approach when the system scales up.     

Field Static Load Test on Kao-Ping-Hsi Cable-Stayed Bridge

Field load testing is an effective method for understanding the behavior and fundamental characteristics of a cable-stayed bridge. This paper presents the results of field static load tests on the Kao-Ping-Hsi cable-stayed bridge, the longest cable-stayed bridge in Taiwan, before it was open to traffic. A total of 40 loading cases, including the unit and distributed bending and torsion loading effects, were conducted to investigate the bridge behavior. The atmospheric temperature effect on the variations of the main girder deflections was also monitored. The results of static load testing include the main girder deflections, the flexural strains of the prestressed concrete girder, and the variations of the cable forces. A three-dimensional finite-element model was developed. The results show that the bridge under the planned load test conditions has linear superposition characteristics and the analytical model shows a very good agreement with the bridge responses. Further discussion of deflection and cable forces of the design specifications for a cable-stayed bridge is also presented.     

应用数字PWM器件SA4828的大功率直流电源

本文介绍一种智能型、高精度PWR控制器SA4828，其控制实行全数字化产生三相脉宽调制波形．本文采用此器件设计大功率直流电源应用于22KW直流电机测试，对感性负载表现出具有纹波小，响应迅速、硬件电路简洁、控制简单易于编写的优点。     

Quality of Service in VoIP Communication

The focus of this paper lies in the practical aspects of voice over IP communication. VoIP configurations in the H.323 standard will be presented briefly. Following that, the fundamental protocol procedure of H.323 communication will be briefly explained. A further part of the paper will address the subject QoS (quality of service), and present the common measurement methods used in QoS. Results gained from experiments conducted in a VoIP environment will then follow. The investigations concentrate primarily on the load behavior of voice packets in relation to important parameters of this service. The results obtained are presented and evaluated in diagrams. The paper concludes with a summary.     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

基于流媒体技术的网上直播系统的原理和实现

概述了流媒体技术的概念和流式传输的工作原理，从硬件组成和软件系统方面介绍了一个具有较高性价比的基于流媒体技术的网上直播系统的实现。     

轻型钢骨结构低层住宅设计荷载分析

本文讨论了北美低层钢骨结构住宅结构设计的荷载问题，包括各类荷载的取值和计算方法，以及荷载组合模式，并提出了在我国相关规范没有出台前，在国内进行设计时应该注意的一些问题。     

Real-time measurement of pointing action by using DSP

This paper presents an approach of measuring in real-time the vector of finger that is pointing to an object. DSP is used in the operation processing unit in order to do the real-time processing. The steps include the extraction of flesh-colored regions from an image, the labeling of the flesh-colored regions, and the detection of two characteristic positions on the finger so that the direction that the finger is pointing at will be calculated. The entire process takes about 29 msec, which makes it possible to have the frame rate of 34 fps. With this frame rate, this measurement approach is considered real-time and promising to be merged into other application systems. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

关于变压器二次额定电压的计算

推导了变压器二次负载电压的计算公式,建议由此公式代替以往原理书中惯用的近似公式。利用此公式绘制和分析了不同功率因数额定负载时的相量轨迹图。     

车辆位置实时监测网的研制

ＲＴ－ＡＧＶＳ是物流管理中十分重要的课题，车辆位置监测网是其重要的组成部分。本文详细介绍了一个基于单片机系统的车辆位置实时监测网，本监测网设计先进，性能价格比高，它的设计方法和技术对其他许多领域有借鉴作用。