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

A FAST ITERATIVE METHOD FOR EIKONAL EQUATIONS

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2008年第5期30卷 2512-2534页

作者： Jeong, Won-Ki Whitaker, Ross T. Univ Utah Sci Comp & Image Inst Sch Comp Salt Lake City UT 84112 USA

In this paper we propose a novel computational technique to solve the Eikonal equation efficiently on parallel architectures. The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes until they converge. Nodes are added to or removed from the list based on a convergence measure, but the management of this list does not entail an extra burden of expensive ordered data structures or special updating sequences. The proposed method has suboptimal worst-case performance but, in practice, on real and synthetic datasets, runs faster than guaranteed-optimal alternatives. Furthermore, the proposed method uses only local, synchronous updates and therefore has better cache coherency, is simple to implement, and scales efficiently on parallel architectures. This paper describes the method, proves its consistency, gives a performance analysis that compares the proposed method against the state-of-the-art Eikonal solvers, and describes the implementation on a single instruction multiple datastream (SIMD) parallel architecture.

关键词： Hamilton-Jacobi equation Eikonal equation viscosity solution label-correcting method parallel algorithm graphics processing unit (GPU)

来源：评论

学校读者我要写书评

暂无评论

Ant colony optimization parallel algorithm and based on coarse-grained model

引用

Jisuanji Gongcheng/Computer Engineering 2005年第1期31卷 157-159页

作者： Zhu, Qingbao Dept. of Computer Science Nanjing Normal Univ. Nanjing 210097 China

In order to improve the speed of convergence of ant colony optimization, a parallel algorithm based on coarse-grained model is proposed in the paper, search tasks are assigned to q ant subgroups, and parallel searching are finished by q subgroups. Results of experiment show that the algorithm described in this paper makes the searching speed hundreds of times faster than the latest improved algorithm.

关键词： Ant colony optimization algorithm Ant colony system Coarse-grained model parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Programming of Agents in the PRALU Language

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2008年第4期42卷 175-183页

作者： Cheremisinov, D. I. Cheremisinova, L. D. Natl Acad Sci Belarus United Inst Informat Problems Ul Surganov 6 Minsk 6220012 BELARUS

A method of specifying agent interaction protocols in multiagent systems in the PRALU language (parallel logic control algorithms) is considered. A methodology for programming agents in the PRALU language based on a two-block architecture, a synchronization block and a functional block, is proposed. It is shown that through use of a description of the behavior of agents in the PRALU language it becomes possible to simulate the behavior of a multiagent system as a whole.

关键词： interaction protocol BDI agent ontology parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A Note on Sequence Generation Power of Two-States Cellular Automata

A Note on Sequence Generation Power of Two-States Cellular A...

引用

Annual Conference of the SICE

作者： Kamikawa, Naoki Umeo, Hiroshi Univ Electrocommun Grad Sch Engn Osaka Japan

ISBN: (纸本)9784907764302

Cellular automaton (CA) are considered to be a non-linear model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. It is studied in many fields such as complex systems. We study a sequence generation problem on the CA. Arisawa, Fischer and Korec studied generation of a class of natural numbers on CA. In this paper, we study the sequence generation power of CA with 2 internal states.

关键词： cellular automata real-time sequence generation problem parallel algorithm computational complexity

来源：评论

学校读者我要写书评

暂无评论

Cooperative Ant Colonies for Vehicle Routing Problem with Time Windows. A Case Study in the Distribution of Dietary Products

Cooperative Ant Colonies for Vehicle Routing Problem with Ti...

引用

12th World Multi-Conference on Systemics, Cybernetics and Informatics/14th International Conference on Information Systems Analysis and Synthesis

作者： Nechita, Elena Crisan, Gloria Cerasela Talmaciu, Mihai Univ Bacau Dept Math & Informat Bacau 600114 Romania

ISBN: (纸本)9781934272350

This extended abstract presents a synthesis of our work concerning a parallel algorithm for Vehicle Routing Problem with Time Windows (VRPTW). Two colonies work in parallel and cooperate to solve the problem, each one being charged with an objective of the optimization. In addition, the importance of these objectives can vary, depending on some environmental changes. This approach introduces a dinamicity level, modeled by managing some new parameters. Experiments on various aspects of the algorithm and computational results are developed on benchmark problems, but also on the distribution net of Maryland Trading Company in Bacau, Romania, distributor of gluten-free dietary products.

关键词： Ant Colony System parallel algorithm Vehicle Routing Problem with Time Windows

来源：评论

学校读者我要写书评

暂无评论

3D block-based medial axis transform and chessboard distance transform on the CREW PRAM

3D block-based medial axis transform and chessboard distance...

引用

8th International Conference on algorithms and Architectures for parallel Processing

作者： Lin, Shih-Ying Horng, Shi-Jinn Kao, Tzong-Wann Fahn, Chin-Shyurng Fan, Pingzhi Lee, Cheng-Ling Bourgeois, Anu Southwest Jiaotong Univ Inst Mobile Commun Chengdu 610031 Peoples R China Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei Taiwan Natl Taiwan Univ Sci & Technol Dept Comp Sci & Informat Engn Taipei Taiwan Natl United Univ Dept Elect Engn Miaoli Taiwan Technol & Sci Inst Northern Taiwan Dept Elect Engn Taipei Taiwan Natl United Univ Dept Electroopt Engn Miaoli Taiwan Georgia State Univ Dept Comp Sci Atlanta GA 30302 USA

ISBN: (纸本)9783540695004

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. We achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N-3, our parallel algorithm can be run in O(logN) time using N-3 processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. In addition, we have implemented a message passing interface (MPI) program on an AMD Opteron Model 270 cluster system to verify the proposed parallel algorithm, since the PRAM model is not available in the real world. The experimental results show that the speedup is saturated when the number of processors used is more than four, regardless of the problem size.

关键词： parallel algorithm image processing CREW PRAM model block-based medial axis transform chessboard distance transform Euclidean distance transform

来源：评论

学校读者我要写书评

暂无评论

parallelizing Dynamic Information Flow Tracking 08

Parallelizing Dynamic Information Flow Tracking

引用

20th ACM Symposium on parallelism in algorithms and Architectures

作者： Ruwase, Olatunji Gibbons, Phillip B. Mowry, Todd C. Ramachandran, Vijaya Chen, Shimin Kozuch, Michael Ryan, Michael Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781595939739

Dynamic information flow tracking (DIFT) is an important tool for detecting common security attacks and memory bugs. A DIFT tool tracks the flow of information through a monitored program's registers and memory locations as the program executes, detecting and containing/fixing problems on-the-fly. Unfortunately, sequential DIFT tools are quite slow, and DIFT is quite challenging to parallelize. In this paper, we present a new approach to parallelizing DIFT-like functionality. Extending our recent work on accelerating sequential DIFT, we consider a variant of DIFT that tracks the information flow only through unary operations (relaxed DIFT), and yet makes sense for detecting security attacks and memory bugs. We present a parallel algorithm for relaxed DIFT, based on symbolic inheritance tracking, which achieves linear speed-up asymptotically. Moreover, we describe techniques for reducing the constant factors, so that speed-ups can be obtained even with just a few processors. We implemented the algorithm in the context of a Log-Based Architectures (LBA) system, which provides hardware support for logging a program trace and delivering it to other (monitoring) processors. Our simulation results on SPEC benchmarks and a video player show that our parallel relaxed DIFT reduces the overhead to as low as 1.2X using 9 monitoring cores on a 16-core chip multiprocessor.

关键词： dynamic information flow tracking (DIFT) program monitoring log-based monitoring parallel algorithm taint analysis

来源：评论

学校读者我要写书评

暂无评论

A New parallel algorithm for Eigenstructure Assignment

A New Parallel Algorithm for Eigenstructure Assignment

引用

第二十四届中国控制会议

作者： Li Shiguang, Chen Dayue, Cai Liangbin(Department of Instrument Engineering,Shanghai Jiaotong University. 200030)

For conventional eigenstructure assignment technique. the strict constraint of complete difference between open-loop poles and closed-loop ones is required and the high cost of the resulting Sylvester matrix equations computation under the condition of higher dimensions is encountered. One parallel algorithm of eigenstructure assignment is presented in this paper. The combination of orthogonal transformation with partition block technique is employed to transform one high order matrix equations into two lower order ones. parallel computing is used to solve two reduced-order matrix equations in order to decrease computing cost. Moreover. partial pole assignment is implemented due to the fact that the sufficient condition in which there exists solution to transformed matrix equations is relaxed in comparison with the sufficient condition of initiative matrix equations solution existence. Parameterized eigenvector is determined through the error 2-norm between desired eigenvector and objective one is minimized while the exactly assigned eigenvalues are guaranteed. Two numerical examples indicate that the presented algorithm for eigenstructure assignment is effective.

关键词： eigenstructure assignment parallel algorithm Parameterized eigenvector orthogonal transformation 2-norm

来源：评论

学校读者我要写书评

暂无评论

A SYNCRO-parallel NONSMOOTH PGD algorithm FOR NONSMOOTH OPTIMIZATION

引用

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2007年第1-2期24卷 333-342页

作者： Shan Feng Pang Li-Ping Shenyang Inst Aeronaut Engn Dept Basic Sci Courses Shenyang 110034 Peoples R China Dalian Univ Technol Dept Appl Math CORA Dalian 116024 Peoples R China

A nonsmooth PGD scheme for minimizing a nonsmooth convex function is presented. In the parallelization step of the algorithm, a method due to Pang, Han and Pangaraj (1991), [7], is employed to solve a subproblem for c... 详细信息

关键词： Nonsmooth optimization parallel algorithm unconstrained minimization nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A FCM algorithm for remote-sensing image classification considering spatial relationship and its parallel implementation

A FCM algorithm for remote-sensing image classification cons...

引用

5th International Conference on Wavelet Analysis and Pattern Recognition

作者： Gong, Xue-Jing Ci, Lin-Lin Yao, Kang-Ze Beijing Inst Technol Beijing 100083 Peoples R China Equipment Inst PLA Second Artilery Beijing 100085 Peoples R China Acad Equipment Command & Technol Beijing 101416 Peoples R China

ISBN: (纸本)9781424410651

Fuzzy C-Means clustering is one of the most perfective and widely, used algorithms based on objective function for unsupervised classification. Considering the spatial relationship of pixels when it is used in remote sensing imagery, Neighbor-based FCM algorithm is put forward with the method of modifying the value of fuzzy membership degrees with the neighbor information during the clustering iterations. We use dominant class, if it can be determined in a fixed neighbor region, or the weighted parameters based 017 the distance of neighbours to perfect the membership degrees of central pixel. Then parallel implement for the algorithim is also proposed by, taking account into the communication complexity and the spatial relationship for image partition. 117 the end, the experimental data indicate the efficiency of the algorithim in decreasing the amount of clustering iterations and increasing the classfied precision;the parallel algorithm also achieves the satisfied linear speedup.

关键词： fuzzy C-Means clustering neighbor region fuzzy membership degree parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：