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

38th International Conference on Parallel Processing, ICPP-2009

作者： Zhu, Jinqi Liu, Ming Cao, Jiannong Chen, Guihai Gong, Haigang Xu, Fulong Dept. of Computer Science and Engineering University of Electronic Science and Technology of China Cheng du China Internet and Mobile Computing Lab. Department of Computing Hong Kong Polytechnic University Hong Kong State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9780769538020

The basic operation of Delay Tolerant Sensor Network (DTSN) is to finish pervasive data gathering in networks with intermittent connectivity, while the publish/subscribe (Pub/Sub for short) paradigm is used to deliver events from a source to interested clients in an asynchronous way. Recently, to extend a Pub/Sub system in DTSN has become a promising topic. However, due to the unique characteristic of frequent partitioning in DTSN, to extend a Pub/Sub system in DTSN is a considerably difficult and challenging problem, and there is no good solution to it in existing works. To adapt Pub/Sub systems to DTSN, we propose CED, a community-based event delivery protocol. In our design, event delivery is based on several unchanged communities, which are formed by sensor nodes in the network according to their connectivity. CED consists of two components: Event delivery and queue management. In event delivery, events in a community are delivered to mobile subscribers once a subscriber comes into the community, for improving the data delivery ratio. The queue management employs both the event successful delivery time and the event survival time to decide whether an event should be delivered or dropped for minimizing the transmission overhead. The effectiveness of CED is demonstrated through comprehensive simulation studies. © 2009 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Exposure-path prevention in directional sensor networks using sector model based percolation

Exposure-path prevention in directional sensor networks usin...

引用

2009 IEEE International Conference on Communications, ICC 2009

作者： Liang, Liu Xi, Zhang Huadong, Ma Networking and Information Systems Laboratory Department of Electrical and Computer Engineering Texas A and M University College Station TX 77843 United States Beijing Key Lab. of Intelligent Telecomm. Software and Multimedia Beijing University of Posts and Telecomm. Beijing 100876 China

ISBN: (纸本)9781424434350

In wireless sensor networks, most existing works on region coverage mainly concentrate on the omnidirectional sensor based full coverage, which ensures that all points in the sensor-deployed region are covered. In contrast, this paper studies the problem of exposure-path prevention for the region coverage in directional sensor networks. Because the exposure paths are prevented as long as no moving objects or phenomena can go through a sensor-deployed region without being detected, exposure-path prevention does not require full coverage, and instead it only needs the partial coverage. Towards this end, we apply the percolation theory to solve the exposure path problem for directional sensor networks. In particular, we map the exposure path problem into a sector based percolation model, and then derive the bounds of critical density where directional sensors are deployed according to a 2-dimensional Poisson process. Also conducted is a set of extensive simulations to validate and evaluate our developed models and schemes. ©2009 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Minimal exposure path algorithms for directional sensor networks

Minimal exposure path algorithms for directional sensor netw...

引用

2009 IEEE Global Telecommunications Conference, GLOBECOM 2009

作者： Liu, Liang Zhang, Xi Ma, Huadong Networking and Information Systems Laboratory Department of Electrical and Computer Engineering Texas A and M University College Station TX 77843 United States Beijing Key Lab. of Intelligent Telecomm. Software and Multimedia Beijing University of Posts and Telecomm. Beijing 100876 China

ISBN: (纸本)9781424441488

As a fundamental problem of wireless sensor networks, the minimal exposure path problem corresponding to the sensor network's worst-case coverage plays an important role in the applications for detecting intrusions. However, most existing works about minimal exposure path are based on omnidirectional sensors. In contrast, this paper studies the minimal exposure path problem for directional sensor networks. We first develop a directional sensing model: directional sensitivity model. Then, we formulate the minimal exposure path problem by using two sensing intensity functions: all-sensor intensity function and maximum-sensor intensity function, and generate two weighted grids to convert the minimal exposure path problem into two discrete geometric problems. Based on the above weighted grids, we also develop two approximation algorithms to find the minimal exposure path for the directional sensitive model. We conduct extensive simulations to validate and evaluate our proposed models and algorithms.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A compression algorithm for multi-streams based on GEP

A compression algorithm for multi-streams based on GEP

引用

3rd International Conference on Genetic and Evolutionary computing, WGEC 2009

作者： Ding, Chao Yuan, Chang-An Qin, Xiao Peng, Yu-Zhong Computer and Information Engineering College Guangxi Teachers Education University Nanning 530001 China First Middle School of Mengcheng Anhui Mengcheng233500 China Key Lab. of Scientific Computing and Intelligent Information Processing in Universities of Guangxi Guangxi Teachers Education University Nanning China

ISBN: (纸本)9780769538990

This paper applied the Methods which based on GEP in compress multi-streams. The contributions of this paper include: 1) giving an introduction to data function finding based on GEP(DFF-GEP), defining the main conception of Multi-Streams, and revealing the map relation in it;2) putting forward the Compression Algorithm for Multi-Streams according to map relation lied in data between data streams;and 3)providing an experience with the real data and find that (3.1) the compression ratio of the new methods is 120-150 times as the traditional wavelets method, and 35-70 times as the wavelets and coincidence method;(3.2) the relative error of the new method is about 3??,yet maximum relative error is 0.01 by using the traditional relative error standard, the precision is improved from 7% to 15% as compared with the traditional method. © 2009 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Model analysis of talents' abilities and qualities for information-based entrepreneurship

Model analysis of talents' abilities and qualities for infor...

引用

1st International Conference on Information Science and engineering, ICISE2009

作者： Sun, Delin Xue, Jinyun Tan, Xin Liu, Peipei Sun, Zhiyuan Yao, Juying Provincial Key Lab. for High-Performance Computing Jiangxi Normal University Nanchang 330022 China School of Business Jiangxi Normal University Nanchang 330022 China Software Engineering Institute East China Normal University Shanghai 200062 China JiangXi Institute of Education Nanchang 330029 China

ISBN: (纸本)9780769538877

In such an age of information, the talents competent for information-based entrepreneurship not only constitute the core competitiveness of newly-established enterprises, but also are of crucial importance to the success in entrepreneurship. In a bid to form a scientific and quantitative system for the selection, cultivation, use and keeping of talents for information-based entrepreneurship, this paper summarizes the abilities and qualities essential for such talents, makes a comprehensive analysis over the talents' roles in work, and eventually proposes a model concerning the talents' abilities and qualities for information-based entrepreneurship on the basis of the previous researches. ©2009 IEEE.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2010 conference workshops

Reports of the AAAI 2010 conference workshops

引用

作者： Aha, David W. Boddy, Mark Bulitko, Vadim D'Avila Garcez, Artur S. Doshi, Prashant Edelkamp, Stefan Geib, Christopher Gmytrasiewicz, Piotr Goldman, Robert P. Halevy, Alon Hitzler, Pascal Isbell, Charles Josyula, Darsana Kaelbling, Leslie Pack Kersting, Kristian Kunda, Maithilee Lamb, Luis C. Marthi, Bhaskara McGreggor, Keith Mihalkova, Lilyana Nastase, Vivi Natarajan, Sriraam Provan, Gregory Raja, Anita Ram, Ashwin Riedl, Mark Russell, Stuart Sabharwal, Ashish Smaus, Jan-Georg Sukthankar, Gita Tuyls, Karl Van Der Meyden, Ron Adaptive Systems Section Naval Research Laboratory Washington DC United States Adventium Labs. Minneapolis MN United States Department of Computer Science University of Alberta Canada City University London United Kingdom University of Georgia United States University of Bremen Germany School of Informatics University of Edinburgh United Kingdom University of Illinois Chicago United States Smart Information Flow Technologies LLC Minneapolis MN United States Structured Data Group Google Research United States Department of Computer Science Wright State University Dayton OH United States School of Interactive Computing Georgia Institute of Technology Atlanta GA United States Department of Computer Science Bowie State University United States Department of Computer Science and Engineering Massachusetts Institute of Technology United States Statistical Relational Mining Group Fraunhofer IAIS Germany Department of Computer Science Federal University of Rio Grande Do sul Brazil Willow Garage Inc. CA United States Computer Science Department University of Maryland College Park United States Heidelberg Institute for Theoretical Studies Heidelberg Germany Department of Computer Science University of Wisconsin Madison United States University College Cork Ireland Cork Complex Systems Lab. Ireland Department of Software and Information Systems University of North Carolina Charlotte United States Department of Computer Science and Engineering University of California Berkeley United States Department of Computer Science Cornell University United States Institute for Computational Sustainability United States University of Freiburg Germany School of Electrical Engineering and Computer Science University of Central Florida United States Maastricht University Netherlands University of New South Wales NICTA Australia

The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. There were several presentations on particular formalisms for combining the levels of planning from the perspectives of classical planning, motion planning, POMDPs, search-based planning, and temporal logic-based constraints. Henry Lieberman from Massachusetts Institute of Technology Media lab.ratory presented work developing a platform for knowledge acquisition and usage from expert users, built upon experience with eliciting information from nonexperts in a collab.rative manner. The objective of the AAAI Workshop on Goal-Directed Autonomy (GDA) was to encourage discussion and novel contributions on intelligent agents that can self-select their goals. Jeremy Baxter from QinetiQ focused on user interaction, while Nick Hawes described a goal-directed reasoning framework for controlling a mobile robot.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Asymmetric group key agreement

Asymmetric group key agreement

引用

28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2009

作者： Qianhong, Wu Yi, Mu Susilo, Willy Bo, Qin Domingo-Ferrer, Josep Universitat Rovira i Virgili Dept. of Comp. Eng. and Maths UNESCO Department of Data Privacy Tarragona Catalonia Spain Key Lab. of Aerospace Information Security and Trusted Computing School of Computer Wuhan University China Centre for Computer and Information Security Research School of Computer Science and Software Engineering University of Wollongong Australia Dept. of Maths School of Science Xi'an University of Technology China

ISBN: (纸本)3642010008

A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish a confiDential channel among group members, we revisit the group key agreement definition and distinguish the conventional (symmetric) group key agreement from asymmetric group key agreement (ASGKA) protocols. Instead of a common secret key, only a shared encryption key is negotiated in an ASGKA protocol. This encryption key is accessible to attackers and corresponds to different decryption keys, each of which is only computable by one group member. We propose a generic construction of one-round ASGKAs based on a new primitive referred to as aggregatable signaturebased broadcast (ASBB), in which the public key can be simultaneously used to verify signatures and encrypt messages while any signature can be used to decrypt ciphertexts under this public key. Using bilinear pairings, we realize an efficient ASBB scheme equippe d with useful properties. Following the generic construction, we instantiate a one-round ASGKA protocol tightly reduced to the decision Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. © International Association for Cryptologic Research 2009.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Building domain independent ontology for web 2.0

Building domain independent ontology for web 2.0

引用

8th IEEE International Conference on Computer and Information Technology Workshops, CIT Workshops 2008

作者： Enkhbold, Nyamsuren Choi, Ho-Jin Intelligent Software Engineering and Robotics Lab. Information and Communications University Daejeon Korea Republic of

ISBN: (纸本)9780769533391

In this paper we are proposing an information integration approach based on minimalist-upper ontology that can be applied among Web 2.0 applications. Instead of following conventional ontology engineering principles we are proposing to facilitate the use of collective intelligence, one of the major locomotives of Web 2.0, for the development of minimalist-upper ontology that can be shared among more specific domain ontologies thereby facilitating information exchange and integration. © 2008 IEEE. DOI 10.1109/CIT.2008. Workshops.103.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Context-aware computing approach with uncertainty for active application

引用

Journal of Information and Computational Science 2008年第1期5卷 179-186页

作者： Zhang, Degan Zhang, Hua Wang, Fayu Xue, Yabing School of Computer Science and Technology Tianjin University of Technology Tianjin 300191 China Tianjin Key Lab. of Intelligent Computing and Novel Software Technology Tianjin 300191 China Key Lab. of Industrial Controlling Technology Zhejiang University Hangzhou 310027 China

For active application of many cases, context-aware computing with uncertainty includes forming model, fusing of aware context, managing context information and so on. Approach research on computing of aware context with uncertainty for making dynamic decision is focused in this paper. We compare dynamic context-aware computing with improved Random Set Theory (RST) and extended D-S Evidence Theory (EDS). We give new modeling mode based on RST for aware context and our computing approach of modeled aware context, extend classic D-S Evidence Theory after considering context's feature. Then compare relative computing methods, enumerate experimental examples and give the evaluation. By comparisons, the more validity of new context-aware computing approach based on RST than EDS with uncertainty information has been tested successfully.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

A kind of new decision fusion method based on sensor evidence for active application

引用

Journal of Information and Computational Science 2008年第1期5卷 171-178页

作者： Zhang, Degan Zhang, Hua Ning, Hongyun Li, Wenjie School of Computer Science and Technology Tianjin University of Technology Tianjin 300191 China Tianjin Key Lab. of Intelligent Computing and Novel Software Technology Tianjin 300191 China Key Lab. of Industrial Controlling Technology Zhejiang University Hangzhou 310027 China

During decision making procedure of active application, the primary signals with noise, which got from each sensor, were sent to a decision making center, the fusion center, through the distributed or centralized computer network. The fusion center then formed a final decision based on the primary decisions received from low-level sensors. But multi-sensor heterogeneous information fusion is an extremely challenging problem because of the complex and highly irregular nature of environment. We have designed a kind of new decision fusion method based on sensor evidence for active application in this paper. A fusion model, approach and relative lemma for multi-sensor heterogeneous information has been presented. For decision fusion, we have utilized the approaching relative efficiency performance measure. This method has been tested successfully by our active application projects.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：