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

6th International Conference on Simulation Tools and Techniques, SIMUTools 2013

作者： Othman, Nasri Bin Luo, Linbo Cai, Wentong Lees, Michael Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9781936968763

Crowd modeling and simulation has become a critical tool for understanding crowds and predicting their behaviours. This is accomplished by modelling the characteristics and behaviours of large groups of people, as well as their interactions. Agent-based crowd simulation may involve thousands of complex agents interacting in sophisticated ways, in close spatial proximity, with each other. A key challenge to the development of agent-based crowd simulation is the inherent complexity that is required to model all its necessary elements. A necessary feature of such a simulation is spatial indexing. This refers to the use of data structures to organize collections of simulation entities (e.g., agents and obstacles) in a manner which allows for efficient spatial querying. This is especially pertinent for large-scale crowd simulation with agents that sense their surrounding environment periodically, as the cost of spatial querying becomes computationally expensive if done naively. In this paper, we will describe our experience in improving the existing grid-based spatial indexing approach in our agent-based crowd simulation. Also, we will explore the integration of the adaptive spatial indices (e.g., R-tree and quad-tree) into our system. The performances of various spatial indexing techniques are examined in terms of efficiency and scalability. Copyright © 2013 ICST.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a bandwidth requirements reduction technique based on timely state update

Performance evaluation of a bandwidth requirements reduction...

引用

38th Annual Simulation Symposium, ANSS-38 2005

作者： Cai, Wentong Turner, Stephen John Zhou, Suiping Wei, Junhu Zong, Wenbo Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)0769523226

An important issue in distributed real-time simulation is to reduce the amount of data transmitted amongst distributed simulation nodes so that the state updates of simulation entities can be sent to other simulation nodes in a timely manner. To address this issue, we have previously proposed a consistency model to determine the update interval of entities based on their relative importance, a utility model to compute the relative importance of entities, and a flexible state update mechanism to ensure updating within these intervals and to balance the number of updates in each simulation frame. In this paper, we focus on the performance evaluation of these timely state update mechanisms. Using a battlefield benchmark, the performance is evaluated in terms of the total amount of data exchanged, the number of simulation frames skipped, and the number of Go-Through-Accidents occurring during the simulation. The performance results indicate that the mechanisms can significantly reduce the bandwidth requirements while maintaining or even improving the consistency of the simulation. © 2005 IEEE.

关键词： Data reduction

来源：评论

学校读者我要写书评

暂无评论

Agent communication in distributed simulations 1

引用

Joint Workshop MABS 2004

作者： Wang, Fang Turner, Stephen John Wang, Lihua Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University 639798 Singapore Singapore

ISBN: (数字)9783540322436

ISBN: (纸本)3540252622

Multi-Agent Systems (MASs) provide a valuable tool for handling increasing software complexity and supporting rapid and accurate decision making. Various environments for testing, analyzing and developing MASs have been developed. This paper describes an approach to integrating agents into distributed simulations. Using the JADE toolkit and the HLA (High Level Architecture), a general architecture is obtained, where both the high level agent specific services and the underlying middleware comply with international standards. In this paper, we show how an MAS may be used to represent entities in a simulation, focusing on the issue of agent to agent communication, as this is one of the key characteristics of MASs. The causality problem in agent communication is described, and conditions for ensuring consistency are identified. A prototype system has been implemented to demonstrate the feasibility of our solution and some experimental results are presented. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Multi-agent interactions in distributed virtual worlds

Multi-agent interactions in distributed virtual worlds

引用

IEEE TENCON 2004 - 2004 IEEE Region 10 Conference: Analog and Digital Techniques in Electrical Engineering

作者： Wang, Fang Turner, Stephen John Wang, Lihua Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University 639798 Singapore Singapore

Multi-agent systems provide a valuable tool for handling increasing software complexity and supporting rapid and accurate problem solving. This paper presents a general architecture in which autonomous agents are embedded in a distributed virtual environment and are enabled to communicate with each other. We focus on the interaction issues, using cooperation and coordination patterns. Different cases of the agents' teamwork to improve their efficiency are investigated and compared. A prototype system has been implemented, with message templates and algorithms identified. Finally, some experimental results are given. © 2004 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Shared variable management in SOAr-DSGrid

Shared variable management in SOAr-DSGrid

引用

2nd Asia International Conference on Modelling and Simulation, AMS 2008

作者： Chen, Xinjun Cai, Wentong Turner, Stephen J. Wang, Yong Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9780769531366

Simulation is a low cost alternative to experimentation on real-world physical systems. In light of the prevalence of web services, issues relating to distributed simulation using web services have come to the fore in recent years. We have proposed a service-oriented architecture for distributed simulations on the Grid (SOAr-DSGrid). SOAr-DSGrid facilitates the development and execution of distributed simulations in different views (i.e., a component-based view for development and a service-oriented view for execution). At run time, one component may require information from another component for execution or decision-making. In SOAr-DSGrid, this shared information from one component to another component is implemented through shared variables. Since two components may execute out of phase, without proper shared variable management, the value provided by one component may be invalid for another component due to the time difference. Since SOAr-DSGrid provides a service-oriented view for component execution, the development of shared variable support also follows the service-oriented methodology. Three different approaches, namely Pull without FutureList, Pull with FutureList, and Push, have been implemented as the internal mechanism to solve the shared variable issue. Experimental results of the performance of these three approaches are also presented in this paper. © 2008 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Detailed and clock-driven simulation for HPC interconnection network

引用

Frontiers of computer science 2016年第5期10卷 797-811页

作者： Wenhao ZHOU Juan CHEN Chen CUI Qian WANG Dezun DONG Yuhua TANG State Key Laboratory of High Performance Computing School of Computer National University of Defense Technology Changsha 410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China

Performance and energy consumption of high performance computing （HPC） interconnection networks have a great significance in the whole supercomputer, and building up HPC interconnection network simulation plat- form is very important for the research on HPC software and hardware technologies. To effectively evaluate the per- formance and energy consumption of HPC interconnection networks, this article designs and implements a detailed and clock-driven HPC interconnection network simulation plat- form, called HPC-NetSim. HPC-NetSim uses application- driven workloads and inherits the characteristics of the de- tailed and flexible cycle-accurate network simulator. Besides, it offers a large set of configurable network parameters in terms of topology and routing, and supports router＇s on/off states. We compare the simulated execution time with the real execution time of Tianhe-2 subsystem and the mean error is only 2.7%. In addition, we simulate the network behaviors with different network structures and low-power modes. The results are also consistent with the theoretical analyses.

关键词： high performance computing clock-driven sim-ulation interconnection network BookSim

来源：评论

学校读者我要写书评

暂无评论

Interactive scenario generation for mission-based virtual training

Interactive scenario generation for mission-based virtual tr...

引用

作者： Luo, Linbo Yin, Haiyan Cai, Wentong Lees, Michael Zhou, Suiping Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore Singapore School of Computing Teesside University Middlesbrough United Kingdom

For a virtual training system, how to effectively and quickly generate training scenarios has become a challenging issue. A scenario generation system is needed to produce scenarios that can meet different objectives and at the same time be customized for individuals. In this paper, we introduce a scenario generation framework for mission-based virtual training, which aims to generate scenarios from both trainer and trainee's perspective. The framework allows a trainer to direct the scenario generation process, so that the generated scenarios reflect the trainer's preferences over different mission objectives. It also considers how the scenarios could adapt to different trainees' skill levels. The representation of scenario beat is proposed, and the scenario generation process adopts a combinatorial optimization approach generating the sequence of scenario beats. The efficacy of the proposed framework is demonstrated through an empirical study of human players in a simple food distribution mission game. The results show that a trainee can achieve better performance improvement when playing the customized scenarios tailored to the trainee's skill level as compared with the uncustomized scenarios. Copyright © 2013 John Wiley & Sons, Ltd.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Diversity-driven self-adaptation in evolutionary algorithms

Diversity-driven self-adaptation in evolutionary algorithms

引用

International Conference on Advances in Intelligent Control and computer Engineering

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

ISBN: (纸本)9789400702851

Pareto-based multi-objective optimization problems (MOPs) are currently best solved using evolutionary algorithms. Nevertheless, the performance of these nature-inspired stochastic search algorithms still depends on the suitability of their parameter settings with respect to specific optimization problems. The tuning of the parameters is a crucial task which concerns resolving the contrary goals of convergence and diversity. To address this issue, we propose a diversity-driven self-adaptive mechanism (SAM) for the simulated binary crossover. This novel technique exploits and optimizes the balance between exploration and exploitation during the evolutionary process. This "explore first and exploit later" approach is addressed through the automated and dynamic adjustment of the distribution index of the simulated binary crossover (SBX) operator. We conducted a series of experiments where SAM is applied to the Non-dominated Sorting Genetic Algorithm to solve the Sphere, Rastrigin, and ZDT optimization problems. Our experimental results have shown that our proposed self adaptation mechanism can produce promising results for both single and multi-objective problem sets. © 2011 Springer science+Business Media B.V.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Buffer management in wormhole-routed torus multicomputer networks 7th

Buffer management in wormhole-routed torus multicomputer net...

引用

7th International Conference on High-Performance computing and Networking, HPCN Europe 1999

作者： Kotapati, Kamala Dandamudi, Sivarama P. Newbridge Networks Kanata Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540658211

This paper focuses on buffer management issues in wormhole-routed torus multicomputer networks. The commonly used buffer organizations are the centralized and dedicated buffer organizations. The results presented in this paper indicate that the dedicated buffer organization provides better performance than the centralized organization under uniform traffic. Under high hot-spot traffic, the centralized organization outperforms the dedicated. The hybrid buffer organization proposed in this paper inherits the merits of the centralized and distributed organizations. The results presented suggest that the hybrid buffer organization can be designed to configure dynamically from the dedicated to centralized depending on the traffic conditions. © Springer-Verlag Berlin Heidelberg 1999.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

An adaptive space-sharing policy for heterogeneous parallel systems 9th

引用

9th International Conference on High-Performance computing and Networking, HPCN Europe 2001

作者： Zhou, Zhengao Dandamudi, Sivarama P. Manugistics Canada Ottawa Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540422935

As the distributed-memory parallel systems become heterogeneous in nature, it is important to devise scheduling policies that take node heterogeneity into account. Previous studies on this topic have focused on homogeneous systems. In this paper, we propose a new two-level space-sharing policy for heterogeneous systems. The proposed policy is an adaptive space-sharing policy that takes system load and user requirements into account. We compare the performance of the new policy with a previous policy. The results presented here show that the proposed policy provides substantial performance improvements. © Springer-Verlag Berlin Heidelberg 2001.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：