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

10th IEEE International Conference on computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Li, Yusen Cai, Wentong Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9780769541082

In distributed virtual environments (DVEs), maintaining a consistent view of the virtual world among all users is a primary task. Due to the resource limitations such as network capacity and computational power, the consistency of the virtual world cannot be guaranteed sometimes. In this paper, we try to address this problem in client-server-based DVEs by considering server side network capacity limitation. We look at the position update packets from client to server and show the impact of packet loss due to server side network capacity limitation on the consistency of the virtual world. We assume clients use Dead Reckoning (DR) models to control position updates. In order to adapt client updates with the server side network capacity to avoid update packet loss, two server assistant DR threshold tuning policies for different updating schemas are proposed in this paper. The proposed tuning polices are validated to have good performance by simulation results. © 2010 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

Evolving agent-based simulations in the clouds

Evolving agent-based simulations in the clouds

引用

3rd International Workshop on Advanced Computational Intelligence, IWACI 2010

作者： Decraene, James Cheng, Yong Yong Hean Low, Malcolm Yoke Zhou, Suiping Cai, Wentong Choo, Chwee Seng Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore Singapore DSO National Laboratories 20 Science Park Drive Singapore Singapore

ISBN: (纸本)9781424463343

Evolving agent-based simulations enables one to automate the difficult iterative process of modeling complex adaptive systems to exhibit pre-specified/desired behaviors. Nevertheless this emerging technology, combining research advances in agent-based modeling/simulation and evolutionary computation, requires significant computing resources (i.e., high performance computing facilities) to evaluate simulation models across a large search space. Moreover, such experiments are typically conducted in an infrequent fashion and may occur when the computing facilities are not fully available. The user may thus be confronted with a computing budget limiting the use of these "evolvable simulation" techniques. We propose the use of the cloud computing paradigm to address these budget and flexibility issues. To assist this research, we utilize a modular evolutionary framework coined CASE (for complex adaptive system evolver) which is capable of evolving agent-based models using nature-inspired search algorithms. In this paper, we present an adaptation of this framework which supports the cloud computing paradigm. An example evolutionary experiment, which examines a simplified military scenario modeled with the agent-based simulation platform MANA, is presented. This experiment refers to Automated Red Teaming: a vulnerability assessment tool employed by defense analysts to study combat operations (which are regarded here as complex adaptive systems). The experimental results suggest promising research potential in exploiting the cloud computing paradigm to support computing intensive evolvable simulation experiments. Finally, we discuss an additional extension to our cloud computing compliant CASE in which we propose to incorporate a distributed evolutionary approach, e.g., the island-based model to further optimize the evolutionary search.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

2010 IEEE 18th International Workshop on Quality of Service, IWQoS 2010

作者： Chen, Fajun Liu, Jiangchuan Li, Zongpeng Wang, Yijie Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer National University of Defense Technology China School of Computing Science Simon Fraser University Canada Department of Computer Science University of Caglary Canada

ISBN: (纸本)9781424459889

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP) [1]. Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51:15∼73:02%) and improvement on packet delivery ratio (99:76%) are observed.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Automated modeling and analysis of agent-based simulations using the CASE framework

Automated modeling and analysis of agent-based simulations u...

引用

International Conference on Control, Automation, Robotics and Vision (ICARCV)

作者： James Decraene Malcolm Yoke Hean Low Fanchao Zeng Suiping Zhou Wentong Cai Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore

We present a modular evolutionary framework, coined CASE for "complex adaptive system evolver", to automate the modeling and analysis of agent-based simulations (ABSs). The field of agent-based modeling is rapidly growing due to its capabilities to expose the emerging complex phenomena occurring in a wide range of natural and artificial systems such as biological cells, societies, battlefields, stock markets, etc. Nevertheless, studying agent-based simulations is a complicated, interdisciplinary and time-consuming process. Indeed, a large number of simulation parameters has to be considered to identify and fully understand the conditions leading to the emerging phenomena of interest. To tackle this difficulty, the study of ABSs is thus typically conducted in an iterative manner, where each iteration includes the successive and manual modeling of ABSs and analysis of simulation outcomes. To automate this iterative and time-consuming process, we propose CASE, a platform-independent framework capable of evolving ABSs to exhibit the desired emerging behaviors. Through this evolutionary approach, the examination, i.e., the modeling, execution and analysis, of ABSs is automated. This process automation significantly facilitates the examination of complex systems using ABSs. In this paper, we present in detail this modular evolutionary framework which is illustrated with an example experiment. In this experiment, CASE is utilized for Automated Red Teaming, a simulation-based vulnerability assessment technique commonly employed by defense analysts. The aim of this paper is to introduce this flexible computational framework which may potentially benefit related fields involving agent-based simulations such as the gaming or financial industries.

关键词： Computational modeling Adaptation model computer aided software engineering Analytical models Evolutionary computation Biological system modeling Object oriented modeling

来源：评论

学校读者我要写书评

暂无评论

Consistency Aware Dead Reckoning Threshold Tuning with Server Assistance in Client-Server-Based DVEs

Consistency Aware Dead Reckoning Threshold Tuning with Serve...

引用

International Conference on computer and Information Technology (CIT)

作者： Yusen Li Wentong Cai Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore

关键词： Servers Avatars Tuning Predictive models Measurement Dead reckoning Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A hybrid Interest Management mechanism for peer-to-peer Networked Virtual Environments

A hybrid Interest Management mechanism for peer-to-peer Netw...

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： Ke Pan Wentong Cai Xueyan Tang Suiping Zhou Stephen John Turner Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore

An Interest Management (IM) mechanism eliminates irrelevant status updates transmitted in Networked Virtual Environments (NVE). However, IM itself involves both computation and communication overhead, of which the latter is the focus of this paper. Traditionally, there are area-based and cell-based IM mechanisms. This paper proposes a hybrid IM mechanism for peer-to-peer NVEs, that utilizes the cell-based mechanism to reduce Area-Of-Interest (AOI) updates in the area-based mechanism so as to reduce its communication overhead. To compare the new mechanism with the two traditional approaches, a multiplayer game scenario is simulated. The performance results show that, compared to the traditional mechanisms, the hybrid mechanism reduces the upload bandwidth consumption by more than 25.28 percent, reduces the overhead ratio from more than 67.54 percent to only 25.17 percent, and allows more than 5000 players in the Internet to join the same game with today's network upload bandwidth.

关键词： Environmental management Peer to peer computing Virtual environment Delay computer architecture Bandwidth Costs computer network management Technology management Engineering management

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6844 LNCS卷

作者： Dehne, Frank Iacono, John Sack, Jörg-Rüdiger Carleton University School of Computer Science Parallel Computing and Bioinformatics Laboratory VISM Building 1125 Colonel By Drive OttawaONK1S 5B6 Canada Polytechnic Institute of NewYork University Department of Computer Science and Engineering 5 MetroTech Center NewYorkNY11201 United States Carleton University School of Computer Science Herzberg Laboratories Herzberg Building 1125 Colonel By Drive OttawaONK1S 5B6 Canada

来源：评论

学校读者我要写书评

暂无评论

News filtering and summarization on the Web

News filtering and summarization on the Web

引用

作者： Wu, Xindong Wu, Gong-Qing Xie, Fei Zhu, Zhu Hu, Xue-Gang Lu, Hao Li, Huiqian School of Computer Science and Information Engineering Hefei University of Technology China Zhejiang Taobao Network China Key Laboratory of Complex Systems and Intelligence Science Institute of Automation Chinese Academy of Sciences China Center for Social Computing and Parallel Systems Institute of Automation Chinese Academy of Sciences China

The news filtering and summarization (NFAS) system can automatically recognize Web news pages, retrieve each news page's title and news content, and extract key phrases. This extraction method substantially outper...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

International Workshop on Quality of Service

作者： Fajun Chen Jiangchuan Liu Zongpeng Li Yijie Wang Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense Technology China School of Computing Science Simon Fraser University Department of Computer Science University of Caglary

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP). Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51.15~73.02%) and improvement on packet delivery ratio (99.76%) are observed.

关键词： Uncertainty Wireless mesh networks Delay Routing protocols Physical layer Statistics Stochastic processes Relays computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the timestamps of concurrent events in traces of hybrid MPI/OpenMP applications

Synchronizing the timestamps of concurrent events in traces ...

引用

作者： Becker, Daniel Geimer, Markus Rabenseifner, Rolf Wolf, Felix German Research School for Simulation Sciences Laboratory for Parallel Programming 52062 Aachen Germany RWTH Aachen University Department of Computer Science 52056 Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre 52428 Jülich Germany University of Stuttgart High Performance Computing-Center 70550 Stuttgart Germany

ISBN: (纸本)9780769542201

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the indepth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：