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

A hierarchical particle swarm optimizer for dynamic optimization problems

European Workshop on Applications of Evolutionary Computation, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC

作者： Janson, Stefan Middendorf, Martin Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Augustusplatz 10/11 LeipzigD-04109 Germany

ISBN: (纸本)9783540213789

Particle Swarm Optimization (PSO) methods for dynamic function optimization are studied in this paper. We compare dynamic variants of standard PSO and Hierarchical PSO (H-PSO) on different dynamic benchmark functions. Moreover, a new type of hierarchical PSO, called Partitioned H-PSO (PH-PSO), is proposed. In this algorithm the hierarchy is partitioned into several sub-swarms for a limited number of generations after a change occurred. Different methods for determining the time when to rejoin the hierarchy and how to handle the topmost sub-swarm are discussed. The test results show that H-PSO performs significantly better than PSO on all test functions and that the PH-PSO algorithms often perform best on multimodal functions where changes are not too severe. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Panel on future challenges in modeling methodology 04

Panel on future challenges in modeling methodology

引用

Simulation Winter Conference

作者： S.J.E. Taylor P. Lendermann R.J. Paul S.W. Reichenthal S. Strassburger S.J. Turner Centre for Applied Simulation Modeling Department of Information Systems and Computing Brunei University Uxbridge Middlesex UK Production and Logistics Planning Group Singapore Institute of Manufacturing Technology Singapore Boeing Anaheim CA USA Department Virtual Development Fraunhofer Institute of Factory Operation and Automation Magdeburg Germany Parallel & Distributed Computin Centre School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9780780387867

This panel paper presents the views of six researchers and practitioners of simulation modeling. Collectively we attempt to address a range of key future challenges to modeling methodology. It is hoped that the views of this paper, and the presentations made by the panelists at the 2004 Winter Simulation Conference will raise awareness and stimulate further discussion on the future of modeling methodology in areas such as modeling problems in business applications, human factors and geographically dispersed networks; rapid model development and maintenance; legacy modeling approaches; markup languages; virtual interactive process design and simulation; standards; and Grid computing.

关键词： Computational modeling Virtual manufacturing Logistics Human factors Computer aided manufacturing Markup languages Process design Standards development Grid computing Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Panel on future challenges in modeling methodology

Panel on future challenges in modeling methodology

引用

Proceedings of the 2004 Winter Simulation Conference

作者： Taylor, Simon J. E. Paul, Ray J. Straßburger, Steffen Lendermann, Peter Reichenthal, Steven W. Turner, Stephen J. Ctr. for Applied Simulation Modeling Dept. of Info. Systems and Computing Brunel University Uxbridge Middx UB8 3PH United Kingdom Fraunhofer Inst. Fact. Oper. A. Department Virtual Development Sandtorstraße 22 39106 Magdeburg Germany Prod. and Logistics Planning Group Singapore Inst. of Mfg. Technology 71 Nanyang Drive Singapore 638075 Singapore Boeing 3370 Miraloma Ave. Anaheim CA 92803 United States Parallel and Distributed Comp. Ctr. School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

This panel paper presents the views of six researchers and practitioners of simulation modeling, Collectively we attempt to address a range of key future challenges to modeling methodology. It is hoped that the views of this paper, and the presentations made by the panelists at the 2004 Winter Simulation Conference will raise awareness and stimulate further discussion on the future of modeling methodology in areas such as modeling problems in business applications, human factors and geographically dispersed networks;rapid model development and maintenance;legacy modeling approaches;markup languages;virtual interactive process design and simulation;standards;and Grid computing.

关键词： Information analysis

来源：评论

学校读者我要写书评

暂无评论

A hierarchical particle swarm optimizer

A hierarchical particle swarm optimizer

引用

Congress on Evolutionary Computation

作者： S. Janson M. Middendorf Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Leipzig Germany

A hierarchical version of the particle swarm optimization method called H-PSO is introduced. In H-PSO the particles are arranged in a dynamic hierarchy that is used to define a neighborhood structure. Depending on the quality of their so far best found solution the particles move up or down the hierarchy so that good particles have a higher influence on the swarm. Moreover, the hierarchy is used to define different search properties for the particles. Several variants of H-PSO are compared experimentally with variants of the standard PSO.

关键词： Particle swarm optimization Iterative algorithms parallel processing Computer science Optimization methods Tree data structures Iterative methods Multidimensional systems Velocity control

来源：评论

学校读者我要写书评

暂无评论

Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays

引用

Genetic Programming and Evolvable Machines 2002年第4期3卷 345-361页

作者： Merkle, Daniel Middendorf, Martin Parallel Computing and Complex Systems Group Faculty of Mathematics and Computer Science University of Leipzig Leipzig Germany

Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often show good optimization behavior but are slow when compared to classical heuristics. Hence, there is a need to find fast implementations for ACO algorithms. In order to allow a fast parallel implementation, we propose several changes to a standard form of ACO algorithms. The main new features are the non-generational approach and the use of a threshold based decision function for the ants. We show that the new algorithm has a good optimization behavior and also allows a fast implementation on reconfigurable processor arrays. This is the first implementation of the ACO approach on a reconfigurable architecture. The running time of the algorithm is quasi-linear in the problem size n and the number of ants on a reconfigurable mesh with n 2 processors, each provided with only a constant number of memory words.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A reconfigurable WSI massively data-parallel processing device for cost-effective 3D sensor data processing

A reconfigurable WSI massively data-parallel processing devi...

引用

IEEE International Symposium on Defect and Fault Tolerance in VLSI systems

作者： R. M. Lea P. T. Tetnowski M. Covic Multimedia Systems and Parallel Computing Technology research group Bmnel University Uxbridge UK

ISBN: (纸本)0769507190

A performance-scalable ISDP (Interactive Sensor Data Processing) workstation, accelerated with commercial PCI multiprocessor cards, is described and a WSI Massively data-parallel Processor (MdPP) device is proposed for the replacement of its VLSI processors. Delivering 60 GOPS for 16-bit integer multiply-accumulate operations, a WSI-FPGA implementation of the reconfigurable device is shown to be better suited to ISDP applications and at least two orders-of-magnitude more cost-effective.

关键词： Sensor Data Workstations Wafer level packaging data parallel configurability metasomatism GOPS PROCESSOR

来源：评论

学校读者我要写书评

暂无评论

Design issues for high performance simulation

Design issues for high performance simulation

引用

作者： Sloot, P.M.A. Pimentel, A.D. Hertzberger, L.O. Parallel Scientific Computing and Simulation Group Department of Computer Science University of Amsterdam Kruislaan 403 1098 SJ Amsterdam Netherlands Computer Architecture and Parallel Systems Group Department of Computer Science University of Amsterdam Kruislaan 403 1098 SJ Amsterdam Netherlands

One of the key issues in designing new simulation models for parallel execution, or in the migration of existing models to parallel platforms, is the mapping of the application architecture to the parallel system architecture. In this mapping process, we can easily loose track of the inherent locality present in the different architecture layers. In this paper, we present an overview of these issues and examine, by means of several case-studies, the consequences of the design and implementation choices for the various mapping processes. We will show that the potential for high performance simulation comes from a holistic approach, taking into account all aspects from the application to the underlying hardware. © 1998 Elsevier Science B. V. All rights reserved.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Native and generic parallel programming environments on a transputer and a PowerPC platform

引用

Concurrency and Computation: Practice and Experience 1996年第1期8卷

作者： A.G. Hoekstra P.M.A. Sloot F. van der Linden M. van Muiswinkel J.J.J. Vesseur L.O. Hertzberger Parallel Scientific Computing & Simulation Group Computer Systems Department Faculty of Mathematics and Computer Science University of Amsterdam Kruislaan 409 1098 SJ Amsterdam The Netherlands

Genericity of parallel programming environments, enabling development of portable parallel programs, is expected to result in performance penalties. Furthermore, programmability and tool support of programming environments are important issues if a choice between programming environments has to be made. In this paper we propose a methodology to compare native and generic parallel programming environments, taking into account such competing issues as portability and performance. As a case study, this paper compares the Iserver-Occam, Parix, Express and PVM parallel programming environments on a 512-node Parasytec GCel. Furthermore, we apply our methodology to compare Parix and PVM on a new architecture, a 32-node Parsytec PowerXplorer, which is based on the PowerPC chip. In our approach we start with a representative application and isolate the basic (environment)-dependent building blocks. These basic building blocks, which depend on floating-point performance and communication capabilities of the environments, are analysed independently. We have measured point-to-point communication times, global communication times and floating-point performance. All information is combined into a time complexity analysis, allowing comparison of the environments on different degrees of functionality. Together with demands for portability of the code and development time (i.e. programmability), an overall judgement of the environments is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A comparison of the Iserver-Occam, Parix, Express, and PVM programming environments on a parsytec GCel

A comparison of the Iserver-Occam, Parix, Express, and PVM p...

引用

International Conference and Exhibition on High-Performance computing and Networking, HPCN 1994

作者： Sloot, P.M.A. Hoekstra, A.G. Hertzberger, L.O. Parallel Scientific Computing & Simulation Group Department of Computer Systems Faculty of Mathematics and Computer Science University of Amsterdam Kruislaan 403 Amsterdam1098 SJ Netherlands

ISBN: (纸本)9783540579816

We compare the Iserver-Occam, Parix, PVM, and Express parallel programming environments on a Parsytec GCel with 512 T805 transputers. The comparison will be made by a detailed analysis of the performance of one particular application. In our approach we start with this application and isolate the basic (environment dependent) building blocks. These basic building blocks, which depend on floating point performance and communication capabilities of the environments, are analysed independently. We have measured point to point communication times, global communication times and floating point performance. All information will be combined into a time complexity analysis, allowing us to compare the environments on all relevant degrees of functionality. Together with demands for portability of the code, and development time (i.e. programmability), an overall judgement of the environments can be made. © 1994, Springer Verlag. All rights reserved.

关键词： Transputers

来源：评论

学校读者我要写书评

暂无评论

DIPOLAR UNIT SIZE IN COUPLED-DIPOLE CALCULATIONS OF THE SCATTERING MATRIX-ELEMENTS

引用

OPTICS LETTERS 1993年第15期18卷 1211-1213页

作者： HOEKSTRA, AG SLOOT, PMA Parallel Scientific Computing Group department of Computer Systems Faculty of Mathematics and Computer Science University of Amsterdam

The coupled-dipole method is widely used to calculate the light-scattering matrix S from arbitrary particles. An important parameter in the model is the size of the dipolar subunits. Usually a size of approximately 1/10 to approximately 1/20 of the wavelength of the incident light is sufficient for accurate calculations. However, it was noted that accurate S-34 calculations require much smaller dipolar subunits. We show that this conclusion is too pessimistic, by examining the sensitivity of the S-34 elements on surface roughness of spherical particles. Furthermore we give an example of an accurate S-34 calculation with dipolar subunits as large as 1/10 of the wavelength.

关键词： .dipoles surface roughness CD method Coupled Dipole Scattering Matrix dipolar subunits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：