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

IEEE Symposium on Swarm Intelligence

作者： Yan, Xinan Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781612840529

Aggregation is a basic collective behavior in biology, and is a prerequisite for many applications of swarm robotics. This paper proposes a new distributed algorithm for aggregation of swarm robotics under the constraints of no central control, no information about positions, and only local interaction among robots. Our control strategy contains two states, Search and Wait, for individual robot, as in the model of probabilistic finite state automata (PFSA). The main difference from PFSA is the way of how individual robot decides to leave from an aggregate. In our approach, each robot in an aggregate has a timer as its lifetime in the aggregate instead of having a leaving probability in PFSA. Further, to make all robots aggregate together, the key idea of our algorithm is that robots in small aggregate have shorter lifetime than those in large aggregate. The lifetime of individual robot in an aggregate is approximated as the lifetime of the aggregate, by making all the timers of the robots in the same aggregate have the same time settings, where the time is proportional to aggregate size and is updated only with the increase of aggregate size. By choosing linear function as the time setting of the timer, experiments based on simulator have been done. The results show that our algorithm is successful and scalable for large scale of robots, and indicate that the performance of the aggregation of all robots is improved by decreasing the lifetime of uncompleted aggregate in high robot density or increasing it in low robot density. © 2011 IEEE.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Inertial estimator learning automata

引用

IEICE Transactions on Fundamentals of Electronics, Communications and computer sciences 2012年第6期E95-A卷 1041-1048页

作者： Zhang, Junqi Ni, Lina Xie, Chen Gao, Shangce Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

This paper presents an inertial estimator learning automata scheme by which both the short-term and long-term perspectives of the environment can be incorporated in the stochastic estimator-the long term information crystallized in terms of the running reward-probability estimates, and the short term information used by considering whether the most recent response was a reward or a penalty. Thus, when the shortterm perspective is considered, the stochastic estimator becomes pertinent in the context of the estimator algorithms. The proposed automata employ an inertial weight estimator as the short-term perspective to achieve a rapid and accurate convergence when operating in stationary random environments. According to the proposed inertial estimator scheme, the estimates of the reward probabilities of actions are affected by the last response from environment. In this way, actions that have gotten the positive response from environment in the short time, have the opportunity to be estimated as "optimal", to increase their choice probability and consequently, to be selected. The estimates become more reliable and consequently, the automaton rapidly and accurately converges to the optimal action. The asymptotic behavior of the proposed scheme is analyzed and it is proved to be Ε-optimal in every stationary random environment. Extensive simulation results indicate that the proposed algorithm converges faster than the traditional stochastic-estimator-based SERI scheme, and the deterministicestimator- based DGPA and DPRI schemes when operating in stationary random environments. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Performance of a multi-channel MAC protocol implemented in multi-robot system

Performance of a multi-channel MAC protocol implemented in m...

引用

2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011

作者： Zhang, Feng Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546100

In the wireless network, the throughput decreases rapidly with increasing the number of nodes while using single-channel communication simultaneously. Using multi-channel schemes is a solution of boosting throughput. In this paper, we present a protocol implementation, utilizing multiple channels in an autonomous multi-robot system which consists of several simple physical robots, in order to improve throughput. Each robot equipped with a single 802.15.4 radio transceiver which provides 16 channels for use. Our schemes employ a common control-channel and data channels. A simple approach based on RTS / CTS message at control-channel is used to dynamically allocate channels for robots in such distributed network. Some practical experiments were done to check whether control channel congestion can occur when the proposed protocols implemented in our robot systems. As a result, the proposed multi-channel protocol can provide a relatively stable and higher throughput than that obtained by using the CSMA with a single-channel, with increasing the number of simultaneous sending robots. © 2011 IEEE.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Private cloud system based on BOINC with support for parallel and distributed simulation

Private cloud system based on BOINC with support for paralle...

引用

9th IEEE Int. Conf. on Dependable, Autonomic and Secure Comput., DASC 2011, incl. 9th Int. Conf. on Pervasive Intelligence and computing, PICom 2011, 9th Int. Symp. on Embedded computing, EmbeddedCom 2011, 1st Int. Conf. on Cloud and Green Comput.CGC

作者： Wu, Yihua Cao, Jian Li, Minglu Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546124

Cloud computing provides an efficient way to expose computing capabilities as sophisticated services that can be accessed remotely. It eliminates the need for organizations to maintain extensive infrastructures. Parallel and distributed simulation over cloud will bring us not only the increased productivity and efficiency but also the lower barrier for usage. This paper introduces a private cloud system based on BOINC which supports parallel and distributed simulation. The design idea and implementation method of each component for our system is discussed in detail. © 2011 IEEE.

关键词： BOINC parallel and distributed simulation private cloud Parallel Lines design concept Distribute simulating Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A distributed application component placement approach for cloud computing environment

A distributed application component placement approach for c...

引用

作者： Jin, Zhicheng Cao, Jian Li, Minglu Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546124

In cloud computing environment, it is common for a multi-component application to be deployed into the IT infrastructure on demand. Although the Application Component Placement Problem or ACP has been studied both in the academy and industry for some years, so far these approaches all rely on a centralized node to collect the information about the network topology and hosts of the targeting environment so that it can make the optimized decision. In cloud environment, computing resources are shared by many applications and the IT infrastructure is dynamically changing, which makes collecting the dynamic information of the environment a more difficult task. In addition, when two or more clouds are involved in the deployment, there may exist privacy concern between different clouds so that a centralized approach cannot be applied. In this paper, we propose a distributed approach to solve the ACP problem. In our approach, we transform the ACP into a Distributed Constraint Optimization Problem or DCOP and solving the ACP becomes solving the DCOP. The detail of the algorithm and experiments are given. © 2011 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Frontier-based multi-robot map exploration using particle swarm optimization

Frontier-based multi-robot map exploration using particle sw...

引用

IEEE Symposium on Swarm Intelligence

作者： Wang, Yiheng Liang, Alei Guan, Haibing School of Software Shanghai Jiao Tong University Shanghai Key Laboratory of Scalable Computing and Systems Shanghai 200240 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Key Laboratory of Scalable Computing and Systems Shanghai 200240 China

ISBN: (纸本)9781612840529

Exploring an unknown environment using team of autonomous mobile robots is an important task in many real-world applications. Many existing map exploration algorithms are based on frontier, which is the boundary between unexplored space and known open space. In the context of multiple robots, the main problem of frontier-based algorithm is to choose appropriate target points for the individual robots so that they can efficiently explore the different part of the common area. This paper proposed a novel distributed frontier-based map exploration algorithm using Particle Swarm Optimization model for robot coordination. In this algorithm, the robot keeps moving to the nearby frontier to reduce the size of the unknown region, and is navigated towards frontier far away based on the PSO model after exploring the local area. The exploration is completed when there are no frontier cells on the map. Our algorithm has been implemented and tested both in simulation runs and real world experiment. The result shows that our method has a good scalability and efficiency. © 2011 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Modeling and Verifying the Ariadne Protocol Using CSP

Modeling and Verifying the Ariadne Protocol Using CSP

引用

International Conference and Workshop on Engineering of computer-Based systems

作者： Xi Wu Si Liu Huibiao Zhu Yongxin Zhao Lei Chen Shanghai Key Laboratory of Trustworthy Computing East China Jiao Tong University China Department of Computer Science and Technology East China Jiao Tong University China

Mobile Ad Hoc Networks (MANETs) are formed dynamically by mobile nodes without the support of prior stationary infrastructures. In such networks, routing protocols, particularly secure ones are always an essential part. Ariadne, an efficient and well-known on-demand secure protocol of MANETs, mainly concerns about how to prevent a malicious node from compromising the route. In this paper, we apply the method of process algebra Communicating Sequential Processes (CSP) to model and reason about the Ariadne protocol, focusing on the process of its route discovery. In our framework, we consider the communication entities as processes, including the initiator, the intermediate nodes and the target. Moreover, we use PAT, a model checker for CSP, to verify whether the model caters for the specification and the non-trivial secure properties, e.g. existence of fake path. Our verification result naturally demonstrates that the fake routing attacks may be present in the Ariadne protocol.

关键词： Routing protocols Routing Ad hoc networks Synchronization Authentication

来源：评论

学校读者我要写书评

暂无评论

Scaling Laws of Multicast Capacity for Power-Constrained Wireless Networks under Gaussian Channel Model

引用

IEEE Transactions on computers 2012年第5期61卷 713-725页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Yuan He Xufei Mao Yunhao Liu Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Building of Electronics and Information Engineering University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology (TNLIST) Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Tsinghua National Laboratory for Information Science and Technology (TNLIST) School of Software Tsinghua University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).

关键词： Lattices Throughput Upper bound Road transportation Receivers Interference Routing

来源：评论

学校读者我要写书评

暂无评论

A generic approach for providing revocation support in secret handshake

A generic approach for providing revocation support in secre...

引用

14th International Conference on Information and Communications Security, ICICS 2012

作者： Yang, Yanjiang Lu, Haibing Weng, Jian Ding, Xuhua Zhou, Jianying Institute for Infocomm Research Singapore Singapore Dept. of Operations Management and Information Systems Leavey School of Business Santa Clara University United States Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Shanghai China School of Information Systems Singapore Management University Singapore Singapore

ISBN: (纸本)9783642341281

Privacy protection and user revocation are essentially conflicting requirements in many cryptographic protocols. It is a particularly challenging problem to harmonize them in a secret handshake protocol that is geared to offering strong privacy protection on the participants' group membership in the protocol execution. In this paper, we study this problem and propose a generic approach to provide revocation support in secret handshake protocols, without sacrificing the notion of privacy preserving. The main building block of our approach is CGC (Confidential Group Communication), a primitive formulated in this paper, and we present a concrete instantiation so as to realize our generic approach. © 2012 Springer-Verlag.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

A partially reconfigurable architecture supporting hardware threads

A partially reconfigurable architecture supporting hardware ...

引用

IEEE International Conference on Field-Programmable Technology (FPT)

作者： Ying Wang Jian Yan Xuegong Zhou Lingli Wang Wayne Luk Chenglian Peng Jiarong Tong State Key Laboratory of ASIC and System Fudan University Shanghai China Department of Computing Imperial College London London United Kingdom School of Computer Science and Technology Fudan University Shanghai China

As a promising computing platform for stream processing, partially reconfigurable systems have shown their hardware efficiency and reconfiguration flexibility. This paper presents a partially reconfigurable architecture supporting hardware threads. It gives a unified software/hardware thread interface and high throughput point-to-point streaming structure. Dynamic computing resource allocation and streaming-based multi-threaded management are also provided at operating system level. It is easy for programmers to exploit the inherent thread, data and pipeline parallelism in a unified view of threads, enhancing hardware efficiency while improving productivity. The experimental results on a cryptography application demonstrate the feasibility and superior performance. Moreover, the parallelized AES, DES and 3DES hardware threads on field-programmable gate arrays show 1.61-4.59 times higher power efficiency than their implementations on state-of-the-art graphics processing units.

关键词： Hardware Instruction sets computer architecture Runtime Kernel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：