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

International Conference on Document Analysis and Recognition

作者： Fu Chang Chun-Jen Chen Institute of Information Science Academia Sinica Taipei Taiwan

ISBN: (纸本)0769519601

A new method for finding connected components from binary images is presented in this article. The main step of this method is to use a contour tracing technique to detect component contours and also to fill in interior areas. All the component points are traced by this algorithm in a single pass and are assigned either a new label or the same label as their neighboring pixels. Experimenting on various types of document images (characters, pictures, newspapers, etc.), we find that our method outperforms the other sequential methods using the equivalence technique. Our algorithm, moreover, is a method that not only labels components but also extracts component contours at the same time, which proves to be more useful than those algorithms that only label components.

关键词： Labeling Algorithm design and analysis Image storage Information science Text analysis Image analysis Object detection Pixel parallel algorithms Process design

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing algorithms for sequence mining

Dynamic load balancing algorithms for sequence mining

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Chuan-Xiang Ma Qing-Hua Li Zhong Jian Hui Wang National High Performance Computing Center School of Computer Science Huazhong University of Science and Technology China School of Mathematics and Computer Science HuBei University China

ISBN: (纸本)0780378652

Mining sequential patterns in large database is an important problem in data mining research. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient and scalable algorithms. In this paper, we present a new dynamic load algorithm based HPSPM (hash-based parallel algorithm for mining sequential patterns) on shared-nothing environment. Experiments on Dawning 300 cluster system show that this algorithm achieves good speedup and is substantially improved compared to HPSPM.

关键词： Load management Heuristic algorithms Data mining Clustering algorithms parallel algorithms Databases Partitioning algorithms Itemsets High performance computing Computer science

来源：评论

学校读者我要写书评

暂无评论

parallelization of the three-dimensional transport equation for Boron Neutron Capture Therapy

Parallelization of the three-dimensional transport equation ...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： E.E. Aubanel F. El Khettabi Faculty of Computer Science University of New Brunswick Fredericton NB Canada Laboratory for Threat Material Detection University of New Brunswick Fredericton NB Canada

We propose an asynchronous parallel algorithm for the linear Boltzmann transport equation in three dimensions, for Boron Neutron Capture Therapy (BNCT) radiation therapy planning, which can be implemented efficiently on shared memory parallel computers. The three-dimensional multigroup discrete ordinates transport equation is cast into a set of coupled two-dimensional equations, and discretization is accomplished on a grid of arbitrarily-shaped prismatic cells. This allows the 3D multigroup discrete ordinates transport equation to be solved using spatial parallel techniques originally developed in a recent work for the 2D discrete ordinates transport equation by using domain decomposition techniques on an unstructured triangular mesh. We use the single program multiple data approach to formulate a shared memory parallel numerical implementation with OpenMP. Our results demonstrate that the parallel version of the 3D deterministic algorithm yields good parallel efficiency.

关键词： Neutron capture therapy Boltzmann equation Neoplasms Medical treatment parallel algorithms Biomedical applications of radiation Concurrent computing Finite element methods Computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

The feelfem system: a repository system for the finite element method

The feelfem system: a repository system for the finite eleme...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： H. Fujio Internet Systems Research Laboratories NEC Corporation Limited Kawasaki Japan

We have developed a finite element method (FEM) software repository tool named feelfem that serves as a code generator. One important feature of feelfem is that it is designed to generate various program models of FEM analysis, including users' own newly developed numerical schemes. Another feature is that interfaces to newly developed parallel programming paradigms and parallel solvers can easily be added to it. Software reuse is an important target of the feelfem system. To achieve flexibility and expandability for the system, we adopt an object-oriented technique and implementation-oriented pseudo-code representation of numerical algorithms. In its latest released version, feelfem has strong interaction with the personal pre/post processor GiD. By using a combination of feelfem and GiD, users can generate prototype parallel FEM applications with newly developed solvers very easily and quickly.

关键词： Finite element methods Software tools parallel algorithms National electric code Internet Laboratories Object oriented modeling parallel programming Software prototyping Prototypes

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel algorithms in global optimization of potential energy functions for peptides, proteins, and crystals

引用

COMPUTER PHYSICS COMMUNICATIONS 2000年第1-2期128卷 399-411页

作者： Lee, JY Pillardy, J Czaplewski, C Arnautova, Y Ripoll, DR Liwo, A Gibson, KD Wawak, RJ Scheraga, HA Cornell Univ Baker Lab Chem & Chem Biol Ithaca NY 14853 USA Cornell Theory Ctr Ithaca NY 14853 USA Univ Gdansk Fac Chem PL-80952 Gdansk Poland

Global optimization is playing an increasing role in physics, chemistry, and biophysical chemistry. One of the most important applications of global optimization is to find the global minima of the potential energy of molecules or molecular assemblies, such as crystals. The solution of this problem typically requires huge computational effort. Even the fastest processor available is not fast enough to carry out this kind of computation in real time for the problems of real interest, e.g., protein and crystal structure prediction. One way to circumvent this problem is to take advantage of massively parallel computing. In this paper, we provide several examples of parallel implementations of global optimization algorithms developed in our laboratory. All of these examples follow the master/worker approach. Most of the methods are parallelized on the algorithmic (coarse-grain) level and one example of fine-grain parallelism is given, in which the function evaluation itself is computationally expensive. All parallel algorithms were initially implemented on an IBM/SP2 (distributed-memory) machine. In all cases, however, message passing is handled through the standard Message Passing Interface (MPI);consequently the algorithms can also be implemented on any distributed- or shared-memory system that runs MPI. The efficiency of these implementations is discussed. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： crystal structure prediction genetic algorithms global optimization Monte Carlo methods parallel algorithms protein structure prediction

来源：评论

学校读者我要写书评

暂无评论

Natural block data decomposition for heterogeneous clusters

Natural block data decomposition for heterogeneous clusters

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： E. Dovolnov A. Kalinov S. Klimov Institute for System Programming Russian Academy of Science Moscow Russia

We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional grid. This heuristics is an extension of the intuitively clear heterogeneous data distribution for one-dimensional case. It is compared to advanced heuristics for heterogeneous data decomposition proposed for solving linear algebra problems on two-dimensional process grid. We experimentally show that for typical local network (12 Windows 2000 PCs interconnected via Fast Ethernet switch) and for typical linear algebra problems these two heuristics have almost the same efficiency. We demonstrate efficiency of the proposed natural decomposition for case of three-dimensional process grid on the example of 3D modeling of supernova explosion.

关键词： Multidimensional systems Linear algebra Explosions Load management Switches parallel algorithms Clustering algorithms parallel programming Personal communication networks Ethernet networks

来源：评论

学校读者我要写书评

暂无评论

A recurrent neural network for nonlinear convex programming

A recurrent neural network for nonlinear convex programming

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Youshen Xia Jun Wang Department of Automation and Computer-Aided Engineering Chinese University of Hong Kong New Territories Hong Kong China

ISBN: (纸本)0780377613

This paper presents a novel recurrent neural network for nonlinear convex programming. Under the condition that the objective function is convex and the constraint set is strictly convex or that the objective function is strictly convex and the constraint set is convex, the proposed neural network is proved to be stable in the sense of Lyapunov and globally convergent to an exact solution. Compared with the existing neural networks for solving such nonlinear optimization problems, the proposed neural network does not require an additional condition on the objective function and has a simple structure for implementation. Simulation results are given to illustrate further the global convergence and performance of the proposed neural network for constrained nonlinear optimization.

关键词： Recurrent neural networks Neural networks Linear programming Constraint optimization Circuits Design engineering Signal processing algorithms Robots parallel algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

On extensibilities of interconnection networks

On extensibilities of interconnection networks

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

作者： Jywe-Fei Fang Yu-Chin Liu Chao-Chin Wu Hsun-Wen Chang Department of Computer Science and Information Engineering Saint John''s and Saint Mary''s Institute of Technology Taiwan Department of Information Management Tung Nan Institute of Technology Taiwan Department of Computer Science and Information Engineering National Changhua University of Education Taiwan Department of Applied Mathematics Tatung University Taipei Taiwan

ISBN: (纸本)0780379780

Researchers have used number of nodes to measure the extensibility of a topology. However, this metric is not very evident. In this paper, we introduce a specific metric called extensible density to measure the extensibilities of interconnection networks. Some topologies have high degree of extensibilities, but efficient parallel algorithms can apply only on a special subclass of these topologies. Furthermore, we extend the concept of density to measure the applicable extent of parallel algorithms.

关键词： Multiprocessor interconnection networks Network topology Density measurement parallel algorithms Tree graphs Computer science Educational technology Hardware Costs Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network

引用

JOURNAL OF algorithms 2000年第1期34卷 90-108页

作者： Wang, BF Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30043 Taiwan

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum eccentricity and minimum distancesum. Let n be the number of vertices in the tree network. Our algorithm for finding a minimum eccentricity location of a path-shaped facility takes O(log n) time using O(n) work. Our algorithm far finding a minimum distancesum location of a path-shaped facility takes O(log n) time using O(n(2)) work. Both of our algorithms for finding the minimum eccentricity location and a minimum distancesum location of a tree-shaped facility take O(log n log log n) time using O(n) work. In the sequential case, all the proposed algorithms are faster than those previously proposed by Minieka. Recently, Peng and Lo have proposed parallel algorithms for all the four problems considered in this paper. They assumed that each edge in the tree network is of length 1. Thus, as compared with their algorithms ours are more general. Besides, our algorithms for the problems of finding a minimum eccentricity location of a path-shaped facility, the minimum eccentricity location of a tree-shaped facility, and a minimum distancesum location of a tree-shaped facility are more efficient from the aspect of work. Their algorithms far these three problems use O(n log n) work. Ours use O(n) work. (C) 2000 Academic Press.

关键词： trees paths parallel algorithms tree contraction the Euler-tour technique location theory

来源：评论

学校读者我要写书评

暂无评论

Linear-scaling parallel algorithms for the first principles treatment of metals

引用

COMPUTER PHYSICS COMMUNICATIONS 2000年第1-2期128卷 67-92页

作者： Watson, SC Carter, EA Univ Calif Los Angeles Dept Chem & Biochem Los Angeles CA 90095 USA

Orbital-free kinetic energy density functionals provide the means to accurately simulate the behavior of simple sp-band metals, on a length scale currently unparalleled by other ab initio methods. We present some technical aspects of the efficient parallel implementation of kinetic energy functionals, including a functional with a recently developed density-dependent response kernel that provides a good description of metal surfaces. We further illustrate the ability of this new functional to treat finite metallic systems by examining the metal-insulator transition in a 2-dimensional array of metal quantum dots. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：