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

International Conference on parallel computing in Electrical Engineering (PARLEC)

作者： J.H. Abawajy S.P. Dandamudi Centre for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

When a set of geographically distributed autonomous clusters of workstations are combined into a single large-scale virtual distributed system, a control mechanism for coordinating the activities of the combined system for effective utilisation of the resources is indispensable. This paper presents a co-ordination mechanism suitable for scheduling and distributing services across the host of such large-scale virtual distributed systems. The proposed scheme is scalable and reliable. Also, it combines both centralised and decentralised co-ordination mechanisms while eliminating/minimising their drawbacks.

关键词： Workstations Scheduling Resource management Large-scale systems distributed control Control systems Local area networks Wide area networks distributed computing computer science

来源：评论

学校读者我要写书评

暂无评论

Grid computing in China

引用

Journal of Grid computing 2004年第2期2卷 193-206页

作者： Yang, Guangwen Jin, Hai Li, Minglu Xiao, Nong Li, Wei Wu, Zhaohui Wu, Yongwei Tang, Feilong Department of Computer Science and Technology Tsinghua University Beijing China School of Computer Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China College of Computer Science Zhejiang University Hangzhou 310027 China

Grid computing presents a new trend to distributed computation and Internet applications, which can construct a virtual single image of heterogeneous resources, provide uniform application interface and integrate widespread computational resources into super, ubiquitous and transparent aggregation. In the adoption of Grid computing, China, who is facing more resource heterogeneity and other specific demands, has put much effort on both research and practical utilization. In this paper, we introduce the major China Grid research projects and their perspective applications. First we give the overview of the four government-sponsored programs in Grid, namely the China National Grid, ChinaGrid, NSFC Grid, and ShanghaiGrid. Then we present six representative ongoing Grid systems in details, which are categorized into Grid middleware and Grid application. This paper provides the general picture of Grid computing in China, and shows the great efforts, devotion and confidence in China to use Grid technology to boost the society, economics and scientific research. © Springer 2004.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Modeling Human-Like Decision Making for Virtual Agents in Time-Critical Situations

Modeling Human-Like Decision Making for Virtual Agents in Ti...

引用

International Conference on Cyberworlds

作者： Linbo Luo Suiping Zhou Wentong Cai Michael Lees Malcolm Yoke Hean Low Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore

Generating human-like behaviors for virtual agents has become increasingly important in many applications, such as crowd simulation, virtual training, digital entertainment, and safety planning. One of challenging issues in behavior modeling is how virtual agents make decisions given some time-critical and uncertain situations. In this paper, we present HumDPM, a decision process model for virtual agents, which incorporates two important factors of human decision making in time-critical situations: experience and emotion. In HumDPM, rather than relying on deliberate rational analysis, an agent makes its decisions by matching past experience cases to the current situation. We propose the detailed representation of experience case and investigate the mechanisms of situation assessment, experience matching and experience execution. To incorporate emotion into HumDPM, we introduce an emotion appraisal process in situation assessment for emotion elicitation. In HumDPM, the decision making process of an agent may be affected by its emotional states when: 1) deciding whether it is necessary to do a re-match of experience cases, 2) determining the situational context, and 3) selecting experience cases. We illustrate the effectiveness of HumDPM in crowd simulation. A case study for emergency evacuation in a subway station scenario is conducted, which shows how a varied crowd composition leads to different evacuation behaviors, due to the retrieval of different experiences and the variation of agents' emotional states.

关键词： Appraisal Decision making Humans Computational modeling Context Time factors Context modeling

来源：评论

学校读者我要写书评

暂无评论

Direct method-green's theory: From PDE to BIE in the geometric transformation

Direct method-green's theory: From PDE to BIE in the geometr...

引用

2016 International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR 2016

作者： Yang, Li-Na Li, Tao-Shen Tang, Yuan Yan Xu, Jia Pan, Jian-Jia Luo, Hui-Wu Zheng, Xian-Wei School of Computer Electronics and Information Guangxi University Nanning530004 China Department of Computer and Information Science Faculty of Science and Technology University of Macau China Guangxi Colleges Universities Key Laboratory of Parallel and Distributed Computing Nanning530004 China

ISBN: (纸本)9781509035885

In this research, we apply the Green's theory for converting the partial differential equation to the boundary integral equation for geometric transformation. Green's theory is designed specifically for integral equation. It is efficient in detecting the singularity point to the geometric transformation that has been verified. Experimental results show that the Green's theory has good performance. © 2016 IEEE.

关键词： Partial differential equations

来源：评论

学校读者我要写书评

暂无评论

ES-Mask: Evolutionary Strip Mask for Explaining Time Series Prediction 37

ES-Mask: Evolutionary Strip Mask for Explaining Time Series ...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Sun, Yifei Song, Cheng Lu, Feng Li, Wei Jin, Hai Zomaya, Albert Y. National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Centre for Distributed and High Performance Computing School of Computer Science University of Sydney Australia

ISBN: (纸本)9781577358800

Machine learning models are increasingly used in time series prediction with promising results. The model explanation of time series prediction falls behind the model development and makes less sense to users in understanding model decisions. This paper proposes ES-Mask, a post-hoc and model-agnostic evolutionary strip mask-based saliency approach for time series applications. ES-Mask designs the mask consisting of strips with the same salient value in consecutive time steps to produce binary and sustained feature importance scores over time for easy understanding and interpretation of time series. ES-Mask uses an evolutionary algorithm to search for the optimal mask by manipulating strips in rounds, thus is agnostic to models by involving no internal model states in the search. The initial experiments on MIMIC-III data set show that ES-Mask outperforms state-of-the-art methods. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

parallel fractional cascading on hypercube multiprocessors

引用

Computational Geometry: Theory and Applications 1992年第3期2卷 141-141页

作者： Dehne, F. Ferreira, A. Rau-Chaplin, A. Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6 CNRS-Laboratoire de l'Informatique du Parallelisme Ecole Normale Superieure de Lyon 69364 Lyon cedex 07 France

Dehne, F., A. Ferreira and A. Rau-Chaplin, parallel fractional cascading on hypercube multiprocessors, Computational Geometry: Theory and Applications 2 (1992) 141–167. In this paper we present a new data-structuring technique for parallel computational geometry on a hypercube multiprocessor. This technique, called hypercube cascading, is an efficient parallel implementation of fractional cascading for the hypercube multiprocessor. That is, it allows complex data structures with catalogs to be traversed efficiently in parallel by a large number of simultaneous queries. We show that for monotone graphs with n nodes, m multiple look-up queries with path length at most p (including catalog look-ups) can be executed independently, in parallel, in time O( p log N + t s ( N )) on a hypercube multiprocessor of size N = max n, itm . The term t s ( N ) denotes the time for sorting N elements on a hypercube of size N ; currently t s ( N ) = O(log N log log N ). Note that, the best known sequential time complexity for one multiple look-up query, as presented by Chazelle and Guibas, is O( p + log N ). Our solution allows an arbitrary number of search queries to access the same node and its catalog at the same time. We present two parallel computational geometry applications of this technique: multiple stabbing of a simple polygonal path and multiple slanted range search.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cluster based partitioning for agent-based crowd simulations 09

Cluster based partitioning for agent-based crowd simulations

引用

Simulation Winter Conference

作者： Yongwei Wang Michael Lees Wentong Cai Suiping Zhou Malcolm Yoke Hean Low Parallel and Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9781424457717

Simulating crowds is a challenging but important problem. There are various methodologies in the literature ranging from macroscopic numerical flow simulations to detailed, microscopic agent simulations. One key issue for all crowd simulations is scalability. Some methods address this issue through abstraction, describing global properties of homogeneous crowds. However, ideally a modeler should be able to simulate large heterogeneous crowds at fine levels of detail. We are attempting to achieve scalability through the application of distributed simulation techniques to agent-based crowd simulation. distributed simulation, however, introduces its own challenges, in particular how to efficiently partition the load between a number of machines. In this paper we introduce a method of partitioning agents onto machines using an adapted k-means clustering algorithm. We present, validate and use an analysis tool to compare the proposed clustered partitioning approach with a series of existing methods.

关键词： Computational modeling Clustering algorithms Partitioning algorithms Scalability computer simulation distributed computing Concurrent computing Numerical simulation Microscopy Humans

来源：评论

学校读者我要写书评

暂无评论

Shared Variable Management in SOAr-DSGrid

Shared Variable Management in SOAr-DSGrid

引用

Asia International Conference on Modeling & Simulation

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

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.

关键词： Computational modeling computer simulation distributed computing Costs Web services Service oriented architecture computer networks Runtime Asia Conference management

来源：评论

学校读者我要写书评

暂无评论

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

Performance evaluation of a bandwidth requirements reduction...

引用

Annual Symposium on Simulation

作者： Wentong Cai S.J. Turner Suiping Zhou Junhu Wei Wenbo Zong Parallel & Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore

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.

关键词： Bandwidth Computational modeling computer simulation distributed computing Large-scale systems Frequency Engines Concurrent computing Data engineering Military computing

来源：评论

学校读者我要写书评

暂无评论

Multiagent interactions in distributed virtual worlds

Multiagent interactions in distributed virtual worlds

引用

IEEE Region 10 International Conference TENCON

作者： F. Wang S.J. Turner L. Wang Parallel & Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore

Multiagent 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.

关键词： Problem-solving Computational modeling distributed computing Multiagent systems Software tools Autonomous agents Virtual environment Prototypes Application software Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：