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

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

来源：评论

学校读者我要写书评

暂无评论

An Efficient Threshold key-Insulated Signature Scheme

引用

Journal of shanghai Jiaotong university(science) 2011年第6期16卷 658-662页

作者：陈剑洪龙宇陈克非王永涛李祥学 Department of Computer Science and Engineering Shanghai Jiaotong University School of Computer Engineering Huaiyin Institute of Technology Shanghai Key Laboratory of Scalable Computing and System Shanghai Jiaotong University Department of Computer Science and Technology East China Normal University

To tackle the key-exposure problem in signature settings,this paper introduces a new cryptographic primitive named threshold key-insulated signature(TKIS) and proposes a concrete TKIS *** a TKIS system,at least k out of n helpers are needed to update a user's temporary private *** the one hand,even if up to k 1 helpers are compromised in addition to the exposure of any of temporary private keys,security of the non-exposed periods is still *** the other hand,even if all the n helpers are compromised,we can still ensure the security of all periods as long as none of temporary private keys is *** with traditional key-insulated signature(KIS) schemes,the proposed TKIS scheme not only greatly enhances the security of the system,but also provides flexibility and efficiency.

关键词： threshold key-insulation signature random oracle model

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Yuehua Wang Zhong Zhou Ling Liu Liang Cheng Wei Wu State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University China Georgia Institute of Technology College of Computing Georgia Institute of Technology USA Department of Computer Science and Engineering Lehigh University USA

Group communication is essential for multi-user applications. However, due to unpredictable node departures and non-deterministic network partitions, providing reliable and scalable group communication services is challenging when the applications are utilized by the users with heterogeneous capacities on a large scale. To address this challenge, we propose a novel replication scheme to achieve high reliability and low-cost scalability in group communication with following three features. First, it introduces a new concept of replication based on topological similarity, which empowers each node with an ability of measuring similarity between the nodes in topology. By eliminating the topological similarity between the replicas, it intelligently mitigates service interruptions caused by node failures and network partitions. Second, instead of specifying the number of replicas, it provides a technique for nodes to dynamically adapt the replication placement schemes by exploiting functionality importance of the nodes in the group- communication session. It eliminates the bottleneck problem and improves the network resource utilization. Third, the scheme is self-converging and it can stabilize within a few adaptations even facing a high churn rate. Extensive simulations show that it yields significant improvements in reduction of replication overhead and service interruption when comparing to existing approaches.

关键词： Random access memory Topology Maintenance engineering Reliability theory computer network reliability

来源：评论

学校读者我要写书评

暂无评论

ONETA: Prior-free and Truthful Auctions with Adaptive Reserve Price for High Revenue in Dynamic Spectrum Access Networks

引用

电子学报(英文版) 2012年第2期21卷

作者： WU Xiaobing CHEN Guihai State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China

来源：评论

学校读者我要写书评

暂无评论

Social relations model for collaborative filtering 25

Social relations model for collaborative filtering

引用

25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11

作者： Li, Wu-Jun Yeung, Dit-Yan Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9781577355083

We propose a novel probabilistic model for collaborative filtering (CF), called SRMCoFi, which seamlessly integrates both linear and bilinear random effects into a principled framework. The formulation of SRMCoFi is supported by both social psychological experiments and statistical theories. Not only can many existing CF methods be seen as special cases of SRMCoFi, but it also integrates their advantages while simultaneously overcoming their disadvantages. The solid theoretical foundation of SRMCoFi is further supported by promising empirical results obtained in extensive experiments using real CF data sets on movie ratings. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Generalized latent factor models for social network analysis

Generalized latent factor models for social network analysis

引用

22nd International Joint Conference on Artificial Intelligence, IJCAI 2011

作者： Li, Wu-Jun Yeung, Dit-Yan Zhang, Zhihua Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong College of Computer Science and Technology Zhejiang University China

ISBN: (纸本)9781577355120

Homophily and stochastic equivalence are two primary features of interest in social networks. Recently, the multiplicative latent factor model (MLFM) is proposed to model social networks with directed links. Although MLFM can capture stochastic equivalence, it cannot model well homophily in networks. However, many real-world networks exhibit homophily or both homophily and stochastic equivalence, and hence the network structure of these networks cannot be modeled well by MLFM. In this paper, we propose a novel model, called generalized latent factor model (GLFM), for social network analysis by enhancing homophily modeling in MLFM. We devise a minorization-maximization (MM) algorithm with linear-time complexity and convergence guarantee to learn the model parameters. Extensive experiments on some real-world networks show that GLFM can effectively model homophily to dramatically outperform state-of-the-art methods.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Construction of Lyapunov Function for Dissipative Gyroscopic System

引用

Chinese Physics Letters 2011年第5期28卷 1-3页

作者： XU Wei YUAN Bo AO Ping Shanghai Center for Systems Biomedicine Key Laboratory of Systems Biomedicine of Ministry of EducationShanghai Jiao Tong UniversityShanghai 200240 Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240 Department of Physics Shanghai Jiao Tong UniversityShanghai 200240

We introduce a force decomposition to construct a potential function in deterministic dynamics described by ordinary differential equations in the context of dissipative gyroscopic *** a potential function serves as the corresponding Lyapunov function for the dynamics,hence it gives both quantitative and qualitative descriptions for stability of *** an example we apply our force decomposition to a four-dimensional dissipative gyroscopic *** explicitly obtain the potential function for all parameter regimes in the linear limit,including those regimes where the Lyapunov function was previously believed not to exist.

关键词： motion function dissipative

来源：评论

学校读者我要写书评

暂无评论

Reconstructing dynamic gene regulatory network for the development process of hepatocellular carcinoma

Reconstructing dynamic gene regulatory network for the devel...

引用

IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)

作者： Hailong Zhu R. Shyama Prasad Rao Luonan Chen Department of Computer Science Hong Kong Baptist University Hong Kong China Key Laboratory of Systems Biology SIBS-Novo Nordisk Translational Research Centre for PreDiabetes Shanghai Institutes of Biological Sciences Chinese Academy of Sciences China

ISBN: (纸本)9781467327466

A crucial work of investigating the mechanisms of cancer development is to unraveling the dynamic nature of gene regulation during the disease process. However, reconstruction of dynamic gene regulatory network requires time-sequence samples of a biological process, which are not available for many bio-medical problems. In this paper, we propose a dynamic cascaded method to reconstruct dynamic gene networks from sample-based transcriptional data. Our method is based on two biologically plausible assumptions, which can characterise the dynamic and continuous nature of gene transcription. Our approach was successfully applied to reconstruct the dynamic gene networks of hepatocellular carcinoma (HCC) progression. The derived HCC networks were verified by functional analysis and network enrichment analysis.

关键词： Market research Mathematical model Proteins Diseases Gene expression Equations Cancer

来源：评论

学校读者我要写书评

暂无评论

A PSO-inspired multi-robot search algorithm independent of global information

A PSO-inspired multi-robot search algorithm independent of g...

引用

IEEE Swarm Intelligence Symposium, SIS

作者： Qian Zhu Alei Liang Haibing Guan School of Software and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computer Science and Shanghai Key Laboratory of Scalable Computing and Systems Scalable Computing and Systems Shanghai China

This paper presents an algorithm that coordinates mobile robots to find the desired targets without depending on precise global information. We compare the abstract solution space in PSO and physical environment that robots will explore. According to similarities and differences between them, we introduce a PSO-inspired search algorithm to guide robots to complete the search mission. Moreover, a novel method based on Cartesian geometry for unifying relative coordinate systems will be adopted to improve system's robustness and efficiency.

关键词： Robot kinematics Robot sensing systems Particle swarm optimization Force Manganese

来源：评论

学校读者我要写书评

暂无评论

Software services protection security protocol based on software watermarking in cloud environment

引用

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 176-181页

作者： Xu, Jin-Chao Zeng, Guo-Sun Wang, Wei Department of Computer Science and Technology Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Aimed to resist the infringement of software services in cloud environment, a software services protection security protocol based on software watermarking in cloud environment was presented. On the consideration of actual needs in cloud computing, the protocol introduced the software watermarking as a service cloud which was responsible for software watermark embedding and extraction. The protocol not only met the basic requirements of software copyright protection, but also gived the detailed strategy to solve the infringement, and hardened the ability of the software watermarking to resist various attacks. The analysis shows that the proposed protocol has higher security.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：