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

A distributed routing algorithm for data aggregationin wireless sensor networks

Frontiers of Electrical and Electronic engineering 2008年第1期3卷 34-39页

作者： LUO Hong YANG Fangchun LIU Yonghe Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Department of Computer Science and Engineering University of Texas at Arlington

Considering the impact of aggregation cost on the performance of aggregation routes in wireless sensor networks, an aggregation-decision-based distributed routing algorithm for data aggregation is proposed. When source nodes arrive or leave, the algorithm can calculate the aggregation benefit according to data correlation, aggregation cost and transmission cost. Then the algorithm will adaptively make aggregation and routing decisions based on aggregation benefit. Therefore, it can jointly optimize the aggregation and transmission costs and reduce the energy consumption for data gathering. This distributed algorithm makes all the decisions only relying on the local information. Hence, the routing maintenance cost is limited. Simulation results show that the energy consumption difference between this distributed online algorithm and the previous offline one is within 17% under any network conditions.

关键词： wireless sensor networks data gathering data aggregation routing

来源：评论

学校读者我要写书评

暂无评论

Solving Sum and Product Riddle via BDD-based model checking

Solving Sum and Product Riddle via BDD-based model checking

引用

2008 IEEE/WIC/ACM International Conference on Web Intelligence and intelligent agent Technology - Workshops, WI-IAT Workshops 2008

作者： Luo, Xiangyu Su, Kaile Sattar, Abdul Chen, Yan Tsinghua National Laboratory for Information Science and Technology School of Software Tsinghua University Beijing 100084 China Department of Computer Science Guilin University of Electronic Technology Guilin 541004 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD 4111 Australia

ISBN: (纸本)9780769534961

We model the Sum and Product Riddle inpublic announcement logic, which is interpreted on an epistemic Kripke model. The model is symbolically represented as a finite state program with n agents. A model checking method to the riddle is developed by using the BDD-based symbolic model checking algorithm for logic of knowledge we developed in [7]. The method is implemented by extending the model checker MCTK [7] and then the solution of the riddle is verified successfully. © 2008 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Solving Sum and Product Riddle via BDD-Based Model Checking

Solving Sum and Product Riddle via BDD-Based Model Checking

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Xiangyu Luo Kaile Su Abdul Sattar Yan Chen Tsinghua National Laboratory for Information Science and Technology Key Laboratory of Security for Information System of Ministry of Education School of Software Tsinghua University Beijing China Department of Computer Science Guilin University of Electronic and Technology Guilin China School of Electronics Engineering and Computer Science Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD Australia

We model the sum and product riddle in public announcement logic, which is interpreted on an epistemic Kripke model. The model is symbolically represented as a finite state program with n agents. A model checking method to the riddle is developed by using the BDD-based symbolic model checking algorithm for logic of knowledge we developed in [7]. The method is implemented by extending the model checker MCTK [7] and then the solution of the riddle is verified successfully.

关键词： Data structures Boolean functions IEEE news intelligent agent Educational technology Automatic logic units Laboratories computer science Information science computer security

来源：评论

学校读者我要写书评

暂无评论

Pointwise Logic on Completely Distributive Lattices and Approximate Reasoning

Pointwise Logic on Completely Distributive Lattices and Appr...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Yalin Zheng Guang Yang Jing Zheng Jinsheng Xing State Key Laboratory for Intelligent Technology and Systems Department of Automation Faculty of Information Science and Technology Tsinghua University Beijing China Research Center of Intelligent Information Technology Department of Computer Science and Technology Faculty of Software Dongguan University of Science and Technology Dongguan China Research Center of Dongguan Economy Department of Economy and Commerce Dongguan University of Science and Technology Dongguan China Faculty of Mathematics and Computer Science Shanxi Normal University Linfen China Research Center of System Engineering Faculty of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China

In this paper, we propose the basic framework of point- wise topological logic on completely distributive lattices and explore approximate reasoning in it. The logic of this paper is based on pointwise characterization, therefore the pointwise conception is pervasive. We explore approximate reasoning in abstract logical framework Fl on completely distributive lattice L. We propose the structure of point- wise topological logic F TL , the structure of matching function sigma. and the structure of matching neighborhood group. We investigate approximate reasoning in pointwise topological logic F TL with matching function sigma, develop pointwise topological algorithm of simple approximate reasoning, introduce the essential characteristics of this scheme.

关键词： Lattices Fuzzy logic computer science Knowledge engineering Fuzzy systems Information technology Laboratories intelligent systems Automation Information science

来源：评论

学校读者我要写书评

暂无评论

Research on rough set theory and applications in China

引用

Lecture Notes in computer science

作者： Wang, Guoyin Zhang, Qinghua Huang, Houkuan Ye, Dongyi Hu, Qinghua Hu, Xuegang Shi, Zhongzhi Li, Yongli Shang, Lin An, Liping Sai, Ying Chen, Shanben Liang, Jiye Qin, Keyun Zeng, Huanglin Xie, Keming Miao, Duoqian Min, Fan Wu, Zhaocong Wu, Weizhi Dai, Jianhua Institute of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing 400065 China School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China School of Computer and Information Technology Beijing Jiaotong University Beijing 100044 China College of Math. and Computer Fuzhou University Fuzhou 350002 China Harbin Institute of Technology PO Box 458 Harbin 150006 China School of Computer and Information Hefei University of Technology Hefei 230009 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Lanzhou University No.222 Tianshui South Rd. Lanzhou 730000 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Management Science and Engineering Department Business School Nankai University Tianjin 300071 China Shandong University of Finance No.40 Shun-geng Road Jinan 250014 China Welding Engineering Institute Shanghai Jiaotong University Shanghai 200030 China School of Computer and Information Technology Shanxi University Taiyuan 030006 China Intelligent Control Development Center Southwest Jiaotong University Chengdu 610031 China Artificial Intelligence of Key Laboratory Sichuan University of Science and Engineering Zigong 643000 China Department of Automation College of Information Engineering Taiyuan University of Technology Taiyuan 030024 China 4800 CaoAn Highway Shanghai 201804 China School of Computer Science and Technology University of Electronic Science and Technology of China Chengdu 610054 China School of Remote Sensing Information Engineering Wuhan University Wuhan 430079 China Institute for Information and System Sciences Faculty of Science Xi'an Jiaotong University Xi'an 710049 China Information College Zhejiang Ocean University Zhejiang 316004 China Institute of Artificial Intelligence Zhejiang University Hangzhou 310027 China

ISBN: (纸本)3540850635

This article gives a capsule view of research on rough set theory and applications ongoing at universities and laboratories in China. Included in this capsule view of rough set research is a brief description of the following things: Chinese research groups on rough set with their URLs for web pages, names of principal researchers (supervisors), numbers of graduate students, and topics being investigated. Statistical summaries showing the growth in the research on rough set theory and application in China are included. In addition, an introduction summarizing the research interests of Chinese researchers is included in this article. The contribution of this article is a complete overview of the principal research directions in rough set theory and its applications in China. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

An improved Bayesian network structure learning algorithm and its application in an intelligent B2C portal

引用

Web Intelligence and agent Systems 2007年第2期5卷 127-138页

作者： Ji, Junzhong Liu, Chunnian Yan, Jing Zhong, Ning College of Computer Science and Technology Beijing University of Technology Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology Beijing 100022 China Department of Information Engineering Maebashi Institute of Technology 460-1 Kamisadori-Cho Maebashi-City 371-0816 Japan

Web Intelligence (WI) is a new and active research field in current AI and IT. intelligent B2C Portals are an important research topic in WI. In this paper, we first investigate and analyze the architecture of a B2C portal for personalized recommendation from the viewpoint of conceptual levels of WI. Aiming at knowledge-level data mining in a B2C portal, we present a new improved learning algorithm of Bayesian Networks, which consists of two major contributions, namely, reducing Conditional Independence (CI) test costs by few lower order CI tests and accelerating search process by means of sort order for candidate parent nodes. Experimental results on benchmark ALARM data sets show that the improved algorithm has high accuracy, and is more efficient in the time performance than other algorithms. Finally, we apply this algorithm to learning Customer Shopping Model (CSM) in an intelligent recommendation system. By a number of experiments on real world data, we find that the recommendation method based on the learned CSM outperforms some traditional ones in rates of coverage and precision. © 2007 - IOS Press and the authors. All rights reserved.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

A modal logic for beliefs and pro attitudes

A modal logic for beliefs and pro attitudes

引用

AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference

作者： Su, Kaile Sattar, Abdul Lin, Han Reynolds, Mark Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Department of Computer Science Sun Yat-Sen University Guangzhou China School of Computer Science and Software Engineering University of Western Australia Perth Australia

ISBN: (纸本)1577353234

agents' pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural and satisfying formalization of these attitudes is a longstanding problem in the community of agent theory. Most of existing modal logic approaches are based on Kripke structures and have to face the so-called side-effect problem. This paper presents a new modal logic formalizing agents' pro attitudes, based on neighborhood models. There are three distinguishing features of this logic. Firstly, this logic naturally satisfies Bratman's requirements for agents' beliefs and pro attitudes, as well as some interesting properties that have not been discussed before. Secondly, we give a sound and complete axiom system for characterizing all the valid properties of beliefs and pro attitudes. We introduce for the first time the notion of linear neighborhood frame for obtaining the semantic model, and this brings a new member to the family of non-normal modal logics. Finally, we argue that the present logic satisfies an important requirement proposed from the viewpoint of computation, that is, computational grounding, which means that properties in this logic can be given an interpretation in terms of some concrete computational model. Indeed, the presented neighborhood frame can be naturally derived from probabilistic programming with utilities. Copyright © 2007, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Distributed routing algorithm for data aggregation in wireless sensor networks

引用

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 2007年第1期30卷 9-13页

作者： Luo, Hong Yang, Fang-Chun Liu, Yong-He Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China Department of Computer Science and Engineering University of Texas at Arlington Arlington TX 76019 United States

Considering the impact of aggregation cost on the performance of aggregation routes in wireless sensor networks, an aggregation-decision-based distributed routing algorithm for data aggregation is proposed. When source nodes arrive or leave, the algorithm can calculate the aggregation benefit according to data correlation, aggregation cost and transmission cost. Then the algorithm will adaptively make aggregation and routing decisions based on aggregation benefit. Therefore, it can jointly optimize the aggregation and transmission costs and reduce the energy consumption for data gathering. This distributed algorithm makes all decisions only relying on the local information;hence, the routing maintenance cost is limited. Simulation results show that the energy consumption difference between this distributed online algorithm and the previous offline one is within 17% under any network conditions.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Real-Time Component Composition Using Hierarchical Timed Automata

Real-Time Component Composition Using Hierarchical Timed Aut...

引用

International Conference on Quality software

作者： Xianli Jin Huadong Ma Zonghua Gu Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China

In component-based software development, it is important to use formal models to describe component composition. However, the existing component composition models generally ignore real-time issues. We present a formal integration model based on Hierarchical Timed Automata (HTA) for real-time software system. We present formal definition of components and different component composition techniques. We then introduce the notions of composable and compatible composition, and use Multiset Labeled Transition Systems to represent the interface actions of HTA to perform compositional verification. This hierarchical and unified framework establishes the foundation for formal analysis of real-time properties of the system.

关键词： Automata Clocks Real time systems Synchronization Programming Arithmetic computer science software systems Tree data structures Operating systems

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony Optimization Algorithm for Solving the Multidimensional Knapsack Problems 07

An Ant Colony Optimization Algorithm for Solving the Multidi...

引用

IEEE/WIC/ACM International Conference on intelligent agent Technology (IAT)

作者： Junzhong Ji Zhen Huang Chunnian Liu Xuejing Liu Ning Zhong College of Computer Science and Technology Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology Beijing University of Technology Beijing China School of Information Engineering Shijiazhuang University of Economics Shijiazhuang China Department of Information Engineering Maebashi Institute of Technology Maebashi Japan

ISBN: (纸本)9780769530277

Ant colony optimization (ACO) algorithm is a metaheuristic and stochastic search technology, which has been one of the effective tools for solving discrete optimization problems. However, there are two bottlenecks for large-scaled optimization problems: the ACO algorithm needs too much time to convergent and the solutions may not be really optimal. This paper proposes a novel ACO algorithm for the multidimensional knapsack problems (MKP), which employs a new pheromone diffusion model and a mutation scheme. First, in light of the preference to better solutions, the association distances among objects are mined in each iteration with top-k strategy. Then, a pheromone diffusion model based on info fountain of an object is established, which strengthens the collaborations among ants. Finally, an unique mutation scheme is applied to optimizing the evolution results of each step. The experimental results for the benchmark testing set of MKPs show that the proposed algorithm can not only get much more optimal solutions but also greatly enhance convergence speed.

关键词： Ant colony optimization Multidimensional systems Genetic mutations intelligent agent software algorithms Benchmark testing Educational institutions computer science Laboratories software tools

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：