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

A comparative study on dynamic and static sparsity patterns in parallel sparse approximate inverse preconditioning

Journal of Mathematical Modelling and Algorithms 2003年第3期2卷 203-215页

作者： Wang, Kai Kim, Sangbae Zhang, Jun Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Science University of Kentucky Lexington KY 40506-0046 United States

Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. © 2004 Kluwer Academic Publishers. Printed in the Netherlands.

关键词： Dynamic and static sparsity pattern Parallel preconditioning Sparse approximate inverse Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Solving traveling salesman problems by genetic algorithms

引用

自然科学进展（英文版） 2003年第2期13卷 135-141页

作者： LIANG Yanchun GE Hongwei Zhou Chunguang LEE Heow Pueh LIN Wuzhong LIM Siak Piang LEE Kwok Hong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Institute of High Performance Computing Singapore 117528 Singapore College of Mathematics Science Jilin University Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Department of Mechanical Engineering National University of Singapore Singapore 119260 Singapore

The gene section ordering on solving traveling salesman problems is analyzed by numerical experiments. Some improved crossover operations are presented. Several combinations of genetic operations are examined and the functions of these operations are analyzed. The essentiality of the ordering of the gene section and the significance of the evolutionary inversion operation are discussed. Some results and conclusions are obtained and given, which provide useful information for the implementation of the genetic operations for solving the traveling salesman problem.

关键词： genetic algorithms traveling salesman problem gene section evolutionary inversion genetic operations

来源：评论

学校读者我要写书评

暂无评论

A computational-intelligence-based optimization of agents' initial positions in land combat simulation

引用

自然科学进展(英文版) 2003年第8期13卷 620-625页

作者： WU Chunguo LIANG Yanchun GE Hongwei CAO Lijuan LEE Heow Pueh College of Computer Science and Technology Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore College of Mathematics Science Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore Department of Mechanical Engineering National University of Singapore Singapore 119260 Singapore

The optimization of agents' initial properties enables agents to perform their assigned tasks more perfectly. This paper presents an optimizing method using the combination of radial basis function (RBF) neural network and genetic algorithm (GA). In the land combat simulation, the method can ensure that the agents optimized defeat the agents not optimized absolutely. Compared with the optimization based on support vector machines (SVM), the proposed method improves the efficiency more than twenty times, so it suits the cases where the speed as well as performance is required.

关键词： multi-agent system RBF neural network support vector machine land combat simulation genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallel multilevel sparse approximate inverse preconditioners in large sparse matrix computations 03

Parallel multilevel sparse approximate inverse preconditione...

引用

2003 ACM/IEEE Conference on Supercomputing, SC 2003

作者： Wang, Kai Zhang, Jun Shen, Chi Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Science University of Kentucky Lexington KY 40506-0046 United States

ISBN: (纸本)1581136951

We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. We do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for solving difficult problems. Forward and backward preconditioning iteration and two Schur complement preconditioning strategies are proposed to improve the performance and to reduce the storage cost of the multilevel preconditioners. One version of the parallel multilevel SAI preconditioner based on the MSP strategy is implemented. Numerical experiments for solving a few sparse matrices on a distributed memory parallel computer are reported. © 2003 ACM.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Parallel multilevel block ILU preconditioning techniques for large sparse linear systems

Parallel multilevel block ILU preconditioning techniques for...

引用

International Parallel and Distributed Processing Symposium, IPDPS 2003

作者： Shen, Chi Zhang, Jun Wang, Kai Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Science University of Kentucky 773 Anderson Hall LexingtonKY40506-0046 United States

ISBN: (纸本)0769519261

We present a class of parallel preconditioning strategies built on a multilevel block incomplete LU (ILU)factorization technique to solve large sparse linear systems on distributed memory parallel computers. The preconditioners are constructed by using the concept of block independent sets. Two algorithms for constructing block independent sets of a distributed sparse matrix are proposed. We compare a few implementations of the parallel multilevel ILU preconditioners with different block independent set algorithms and different coarse level solution strategies. We also use some diagonal thresholding and perturbation strategies to enhance factorization stability. Numerical experiments indicate that our parallel multilevel block ILU preconditioners are robust and efficient. © 2003 IEEE.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

AutoMate: Enabling autonomic applications on the grid 5

AutoMate: Enabling autonomic applications on the grid

引用

5th Annual International Workshop on Active Middleware Services, AMS 2003

作者： Agarwal, M. Bhat, V. Liu, H. Matossian, V. Putty, V. Schmidt, C. Zhang, G. Zhen, L. Parashar, M. Khargharia, B. Hariri, S. Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers the State University of New Jersey United States High Performance Distributed Computing Laboratory Department of Electrical and Computer Engineering University of Arizona United States

ISBN: (纸本)0769519830

The increasing complexity, heterogeneity and dynamism of networks, systems, services applications have made our computational/information infrastructure brittle, unmanageable and insecure. This has necessitated the investigation of a new paradigm for design, development and deployment based on strategies used by biological systems to deal with complexity, heterogeneity, and uncertainty, i.e. autonomic computing. This paper introduces the AutoMate project and describes its key components. The overall objective of AutoMate is to investigate key technologies to enable the development of autonomic grid applications that are context aware and are capable of self-configuring, self-composing, self-optimizing and self-adapting. Specifically, it will investigate the definition of autonomic components, the development of autonomic applications as dynamic composition of autonomic components, and the design of key enhancements to existing grid middleware and runtime services to support these applications. © 2003 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Characteristics modeling of photonic crystal by using numerical techniques

Characteristics modeling of photonic crystal by using numeri...

引用

2003 Asia-Pacific Conference on Applied Electromagnetics, APACE 2003

作者： Yan, Sun Yuan, W.L. Zhang, Y.J. Li, E.P. Leong, M.S. Institute of High Performance Computing 1 Science park Road Singapore117528 Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore

ISBN: (纸本)0780381297

Photonic band-gap (PBG) materials are periodic dielectric crystals that exhibit a photonic band-gap analogous to the electronic band-gap present in semiconductors. Their fabrication, however, requires extremely high resolution and is very costly. Due to the high expense in experimental fabrication, accurate modeling and prediction of a novel PBG structure characteristics are highly desirable. This paper presents an investigation on the effects of dielectric material properties and structures on the photonic band characteristics by using numerical simulation approaches. © 2003 IEEE.

关键词： Photonic band gap

来源：评论

学校读者我要写书评

暂无评论

Experimental Analysis of a Gossip-Based Service for Scalable, Distributed Failure Detection and Consensus

引用

Cluster computing 2003年第3期6卷 237-251页

作者： Sistla, Krishnakanth George, Alan D. Todd, Robert W. High-performance Computing and Simulation (HCS) Research Laboratory Department of Electrical and Computer Engineering University of Florida Gainesville USA

Gossip protocols and services provide a means by which failures can be detected in large, distributed systems in an asynchronous manner without the limits associated with reliable multicasting for group communications. Extending the gossip protocol such that a system reaches consensus on detected faults can be performed via a flat structure, or it can be hierarchically distributed across cooperating layers of nodes. In this paper, the performance of gossip services employing flat and hierarchical schemes is analyzed on an experimental testbed in terms of consensus time, resource utilization and scalability. performance associated with a hierarchically arranged gossip scheme is analyzed with varying group sizes and is shown to scale well. Resource utilization of the gossip-style failure detection and consensus service is measured in terms of network bandwidth utilization and CPU utilization. Analytical models are developed for resource utilization and performance projections are made for large system sizes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

high-performance embedded computing for Conventional Matched-Field Processing

High-performance embedded computing for Conventional Matched...

引用

IEEE International Conference on performance, computing and Communications (IPCCC)

作者： K. Kim A. George High-performance Computing and Simulation (HCS) Research Laboratory Department of Electrical and Computer Engineering FAMU and FSU College of Engineering USA High-performance Computing and Simulation (HCS) Research Laboratory Department of Electrical and Computer Engineering University of Florida USA

Advanced sonar algorithms with complex-wave propagation processing are of critical importance in the field of acoustic signal processing, as they possess the ability to localize signal sources more precisely in a cluttered environment. Conventional Matched-Field Processing (CMFP) is such an algorithm that provides range and depth results by employing environmental parameters. However, the enhancement of features is limited by the extensive computational and memory requirements of the algorithm even for a small problem size. high-performance computing, when applied to matched-field processing on a microprocessor-based distributed system, can provide solutions for this challenging problem in performance, scalability, and cost. Based on domain decomposition techniques, two parallel algorithms for matched-field processing are introduced in this paper for in-situ signal processing. performance results collected on low-power distributed embedded systems are presented in terms of execution times and parallel efficiencies. The results of these analyses demonstrate that parallel in-situ processing holds the potential to meet the needs of matched-field processing in a scalable fashion.

关键词： Embedded computing Signal processing algorithms Sonar Acoustic propagation Acoustic signal processing Signal processing Distributed computing high performance computing Scalability Costs

来源：评论

学校读者我要写书评

暂无评论

Hybrid FDTD-MPIE method for the simulation of locally inhomogeneous multilayer LTCC structure 5

Hybrid FDTD-MPIE method for the simulation of locally inhomo...

引用

5th Electronics Packaging Technology Conference, EPTC 2003

作者： Liu, En-Xiao Li, Er-Ping Li, Le-Wei Institute of High Performance Computing 1 Science Park Road #01-01 The Capricorn Singapore117528 Singapore National University of Singapore Department of Electrical and Computer Engineering 10 Kent Ridge Cresent Singapore119260 Singapore

ISBN: (纸本)0780382056

A new hybrid finite-difference time-domain-mixed potential integral equation method (FDTD-MPIE) is proposed for modeling and simulating multilayer planar problems with possible locally inhomogeneous geometries. By using equivalent principle, the original problem can be divided into different regions. The fields in the inhomogeneous regions are modeled by using FDTD method, which is a time domain method providing broad band fields information. The resultant interaction matrix from FDTD can be used as a look-up table for subsequent model coupling procedure. The fields in the layered structure with possible perfect electric conductors are described in terms of the equivalent electric and magnetic surface current densities by a mixed potential electric-field integral representation with less singular kernals. The interactions between the FDTD model and MPIE model are coupled together by enforcing the continuity of the tangential electric and magnetic fields at the equivalent surface using a Galerkin testing procedure. Numerical results of a canonical test problem are presented to validate the hybrid FDTD-MPIE method. © 2003 IEEE.

关键词： Electric fields

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：