检索结果-内蒙古大学图书馆

Model checking cooperative multi-agent systems in BDI logic

Journal of Information and Computational Science 2012年第5期9卷 1185-1194页

作者： Chen, Qingliang Su, Kaile Wu, Lijun Xu, Zhaocheng School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

Traditional temporal logics such as LTL (Linear Temporal Logic) and CTL (Computation Tree Logic) have shown tremendous success in specifying and verifying hardware and software systems. However, this kind of logic can only model the dynamic behaviors for a single system, and fall short in capturing the joint and concurrent aspects in the composition of systems, such as the interactions and coordinations of agents in Multi-agent systems. Although ATL (Alternating-time Temporal Logic) can solve the problem to a certain extent, by preceding the temporal operators with a selective path quantifier, to specify that the interactions between entities inside the system can make sure that there is a strategy to reach a certain state, it can not formalize the rational mental attitudes of the agents such as the Belief, Desire and Intention (BDI) which plays an essential role in decision making during cooperation with other agents. This paper will investigate this problem by proposing a logic of ATLBDI (Alternating-time Temporal Logic of Belief Desire and Intention) and discuss the algorithmic issues such as model checking algorithms and the computational complexity, along with examples to show its effectiveness. We conclude that model checking for ATLBDI is completely tractable and is in PTIME-Complete, which is quite an optimistic and promising result for further applications. © 2012 by Binary Information Press.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic Walking of AIBO with Hopf Oscillators

引用

Chinese Journal of Mechanical Engineering 2011年第4期24卷 612-617页

作者： ZHANG Jiaqi TOMIZUKA Masayoshi CHEN Qijun LIU Chengju College of Electronic Information and Engineering Tongji University Shanghai 201804 China College of Electronic Information andEngineering Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

More and more biological evidences have been found that neural networks in the spinal cord, referred to as ＂central pattern generators＂（CPGs）, govern locomotion. CPGs are capable of producing rhythmic movements, such as swimming, flying, and walking, even when isolated from the brain and sensory inputs. If we could build up any models that have similar functions as CPGs, it will be much easier to design better locomotion for robots. In this paper, a self-training environment is designed and through genetic algorithm （GA）, walking trajectories for every foot of AIBO are generated at first. With this acquired walking pattern, AIBO gets its fastest locomotion speed. Then, this walking pattern is taken as a reference to build CPGs with Hopf oscillators. By changing corresponding parameters, the frequencies and the amplitudes of CPGs＇ outputs can be adjusted online. The limit cycle behavior of Hopf oscillators ensures the online adjustment and the walking stability against perturbation as well. This property suggests a strong adaptive capacity to real environments for robots. At last, simulations are carried on in Webots and verify the proposed method.

关键词： central pattern generators（CPGs） Hopf Oscillators walking control AIBO Webots

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The preference relation and its application in the information system

The preference relation and its application in the informati...

引用

2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011

作者： Mingqing, Zhao Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China College of Information Science and Engineering SUST Qingdao China

ISBN: (纸本)9781424487257

In order to strengthen the traditional information system's capacity of describing practical problems, preference relation is introduced into information system and the concepts of preference information system, preference decision table, and information utility function are offered in this paper. In addition, the existence theorem of information utility function and several applications of information utility function in knowledge acquisition are provided. © 2011 IEEE.

关键词： Knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

Asymptotic signal bandwidth of impulse radio UWB communication networks

Asymptotic signal bandwidth of impulse radio UWB communicati...

引用

54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011

作者： Xu, Juan College of Electronics and Information Engineering Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781424492688

The asymptotic signal bandwidth of various kinds of large-scale asynchronous Time Hopping Impulse Radio Ultra-Wide Band (TH-IR UWB) communication networks such that multiple access interference can be negligible with respect to output noise with high probability is derived. The asynchronous TH-IR UWB communication networks consist of n nodes distributed in a cube (three-dimension) or on a square (two-dimension) according to a Poisson point process. The theoretic results indicate that the obtained asymptotic bandwidth of IR-UWB signal is in proportion to the number of nodes, and that the asymptotic bandwidth of IR-UWB signal of dense network is much more than that of extended network. The results also reveal that the asymptotic bandwidth of three-dimensional network is less than that of two-dimensional network assuming that the number of nodes in the networks and the distance loss exponent are the same. As the bandwidth of IR-UWB signal satisfies the obtained theoretic bandwidth, the expression of probability of error of multi-node network is simplified to that of single node network. © 2011 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Fast adaptive interpolation filter algorithm for bi-predicted frame in video coding

Fast adaptive interpolation filter algorithm for bi-predicte...

引用

2nd International Conference on Multimedia Technology, ICMT 2011

作者： Gao, Huichao Cen, Feng Xu, Weisheng Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 20092 China College of Electronics and Information Engineering Tongji University Shanghai 20092 China

ISBN: (纸本)9781612847740

This paper proposes a novel adaptive interpolation filter (AIF) to reduce computational complexity and bit-rate of video coding. In the proposed AIF, the filter coefficients of B frames, which are predicted from those of adjacent P frames with a novel parabolic model, are unnecessary to transmit. Experimental results show that the coding complexity is reduced by 40.22% with no penalty on coding efficiency and 1.59% bitrate reduction is achieved at low bit-rate against conventional AIF. © 2011 IEEE.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Quantized robust H-two filtering for Markovian jump linear systems over networks with nonaccessible mode information

引用

控制理论与应用（英文版） 2011年第4期9卷 505-512页

作者： Tao LIU Qijun CHEN Hao ZHANG Iko MIYAZAWA Department of Electronics and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai 201804 China Department of Machine Control Technology Kanagawa Industrial Technology Center Kanagawa 243-0435 Japan

This paper is concerned with the problems of H-two filtering for discrete-time Markovian jump linear systems subject to logarithmic quantization. We assume that only the output of the system is available, and therefore the mode information is nonaccessible. In this paper, a mode-independent quantized H-two filter is designed such that filter error system is stochastically stable. To this end, sufficient conditions for the existence of an upper bound of H-two norm are presented in terms of linear matrix inequalities. Considering uncertainty of system matrices, a robust H-two filter is designed. The proposed method is also applicable to cover the case where the transition probability matrix is not exactly known but belongs to a given polytope. Finally, numerical examples are provided to demonstrate the effectiveness of the proposed approach.

关键词： Markovian jump linear systems Quantized robust H-two filter Mode independent Sector bound approach Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

A remote debugging system for OpenMP parallel program

A remote debugging system for OpenMP parallel program

引用

2011 International Conference on Transportation, Mechanical, and Electrical Engineering, TMEE 2011

作者： Chai, Hua Shi, Qinqin Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai 201418 China

ISBN: (纸本)9781457717017

A remote debugging system for OpenMP parallel program is presented in this paper. The system consists of two parts, namely, an integrated debugging environment running on the clent-side and a background daemon running on the server-side. Information exchange between the two sides is accomplished through the socket-based network communication technology. The remote debugging function is realized by the automatic instrumentation technology at code level based on syntax tree. Instance tests show that the system can provide remote users with correctness checking, performance analysis and other debugging functions for OpenMP parallel programs. The user interface is simple and very easy to use. © 2011 IEEE.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Reliable web services selection based on finite state machine model

引用

Information Technology Journal 2011年第9期10卷 1662-1672页

作者： Shen, Hongjie Ding, Zhijun Chen, Hongzhong Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai 200092 China

Dynamically selecting suitable Web services (WSs) is crucial to users in Web services Composition (WSC). Generally, most works regard a Web service (WS) as the basic unit and compose the composite WS (CWS) end to end. However, a WS may comprise multiple operations that are invoked in sequence and the selection of WSs according to the model still is a NP problem. In this study, the WSs consist of some operations and then WSs selection problem is formalized as a Finite State Machine (FSM) process. This study proposed an algorithm to create the WSC Tree (WSCT), in which each path from root to leaf node is a feasible WSC execution path. Then, a heuristic algorithm is proposed to realize the selection of WSs based on the WSCT. The advantage of heuristic algorithm is that it can address the selection problem without traversing the whole WSCT but it still spends much time in the construction of the WSCT. So, in order to further decrease the time of selection, a backtracking algorithm is presented to select a feasible execution path without generating WSCT. At last, experiments show that heuristic algorithm is more effective than exhaustive method and the backtracking algorithm spend the less time than heuristic algorithm, the reliability of WSC execution path selected by backtracking algorithm can satisfy the requirement of users. So, this study proposed an algorithm to select a feasible WSC execution path within a reasonable time. © 2011 Asian Network for Scientific Information.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Web service composition techniques in a health care service platform

Web service composition techniques in a health care service ...

引用

2011 IEEE 9th International Conference on Web services, ICWS 2011

作者： Wang, Pengwei Ding, Zhijun Jiang, Changjun Zhou, Mengchu Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

ISBN: (纸本)9780769544632

The information technology has been recognized as one of the most important means to improve health care and curb its ever-increasing cost. However, existing efforts mainly focus on informatization of hospitals or medical institutions within organizations, and few are directly oriented to individuals. The strong demand for various health services from customers calls for the creation of powerful individual-oriented personalized health care service systems. Web service composition (WSC) and related technologies can greatly help one build such systems. This paper aims to present a newly developed platform called a Public-oriented Health care Information service Platform (PHISP) and several novel WSC techniques that are used to build it. Among them include WSC techniques that can well support branch and parallel structures. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：