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

A parallel algorithm for Solving a Kind of Special Structured Linear Systems

A Parallel Algorithm for Solving a Kind of Special Structure...

9th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES 2010)

作者： Zhong, Yan Luo, Zhi-Gang Wu, Feng Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China Beijing Special Engn Design & Res Inst Beijing Peoples R China

ISBN: (纸本)9780769541105

For special structured linear systems, WZ factorizations of matrices are basic mathematical theories to design a class of parallel solving algorithms. So, firstly, new WZ factorizations for the p-tridiagonal matrix are proposed and proved. Next, an effective parallel algorithm is designed. Solving both the subsystem in each processor and the reduced subsystem makes use of the WZ factorization so that a two-level method is formed. The experiment results confirm the validity of our method.

关键词： WZ factorization p-tridiagonal linear system symmetric positive definite matrix parallel algorithm two-level method

来源：评论

学校读者我要写书评

暂无评论

Poisson-Markov Mixture Model and parallel algorithm for Binning Massive and Heterogenous DNA Sequencing Reads 12th

Poisson-Markov Mixture Model and Parallel Algorithm for Binn...

引用

12th International Symposium on Bioinformatics Research and Applications (ISBRA)

作者： Wang, Lu Zhu, Dongxiao Li, Yan Dong, Ming Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

ISBN: (纸本)9783319387826;9783319387819

A major computational challenge in analyzing metagenomics sequencing reads is to identify unknown sources of massive and heterogeneous short DNA reads. A promising approach is to efficiently and sufficiently extract and exploit sequence features, i.e., k-mers, to bin the reads according to their sources. Shorter k-mers may capture base composition information while longer k-mers may represent reads abundance information. We present a novel Poisson-Markov mixture Model (PMM) to systematically integrate the information in both long and short k-mers and develop a parallel algorithm for improving both reads binning performance and running time. We compare the performance and running time of our PMM approach with selected competing approaches using simulated data sets, and we also demonstrate the utility of our PMM approach using a time course metagenomics data set. The proba-bilistic modeling framework is sufficiently flexible and general to solve a wide range of supervised and unsupervised learning problems in metagenomics.

关键词： Probabilistic clustering Expectation-Maximization algorithm Metagenomics Next-generation sequencing (NGS) parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A neural network parallel algorithm for one-dimensional gate assignment problems

引用

ELECTRICAL ENGINEERING IN JAPAN 1999年第2期129卷 71-77页

作者： Tsuchiya, K Takefuji, Y Kurotani, KI Keio Univ Tokyo 108 Japan

A near-optimum parallel algorithm for solving the one-dimensional gate assignment problem is presented in this paper, where the problem is NP-hard and one of the most fundamental layout problems in VLSI design. The proposed system is composed of n x n processing elements based on the artificial two-dimensional maximum neural network for (n + 2)-gate assignment problems. Our algorithm has discovered improved solutions in the benchmark problems compared with the best existing algorithms. The proposed approach is applicable to Other VLSI layout problems such as th PLA (Programmable Logic Array) folding problem. (C) 1999 Scripta Technica, Electr Eng Jpn, 129(2): 71-77, 1999.

关键词： neural network one-dimensional gate assignment problem parallel algorithm Weinberger array PLA folding problem

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection

引用

Numerical Mathematics(Theory,Methods and Applications) 2009年第1期2卷 65-89页

作者： Lin-Bo Zhang State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100080 China.

Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.

关键词： Adaptive refinement bisection tetrahedral mesh parallel algorithm MPI.

来源：评论

学校读者我要写书评

暂无评论

An Accelerated parallel algorithm for Constructing the Nonredundant Matrix of Implications during the Construction of Fault-Tolerant Nonredundant Diagnostic Tests

引用

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS 2016年第6期50卷 223-236页

作者： Yankovskaya, A. E. Yamshanov, A. V. Tomsk State Univ Architecture & Bldg Tomsk 634003 Tomsk Oblast Russia Tomsk State Univ Control Syst & Radioelect Tomsk 634050 Tomsk Oblast Russia Tomsk Natl Res Polytech Univ Tomsk 634050 Tomsk Oblast Russia Tomsk Natl Res State Univ Tomsk 634050 Tomsk Oblast Russia

In this article the relevance of using test methods of pattern recognition while developing intelligent systems for decision making support for various problem areas is discussed. The advantage of fault-tolerant diagnostic tests used in intelligent systems is shown, namely, a tool for registering and processing different kinds of errors in databases and knowledge bases. The results of testing two algorithms for constructing the nonredundant matrix of implications are compared;the technical particulars of program implementation are discussed such as synchronization means, test environment, test-program structure, and bottlenecks of program implementation;methods of their elimination, and further development of parallel algorithms.

关键词： parallel algorithm fault-tolerant nonredundant unconditional diagnostic tests decision-making intelligent systems matrix representation of data and knowledge data and knowledge regularities matrix of implications data structures multi-thread programs program performance estimation

来源：评论

学校读者我要写书评

暂无评论

The Research on parallel algorithm of A-order in Binary Tree Based on PRAM Model

The Research on Parallel Algorithm of A-order in Binary Tree...

引用

1st International Workshop on Education Technology and Computer Science

作者： Sun Yuqiang Gu Yuwan Su Bing Wang Xiaolong Jiangsu Polytech Univ Sch Informat Sci & Engn Changzhou Peoples R China

ISBN: (纸本)9780769535579

In this paper, the problem of A-order of binary tree is studied with the PRAM (parallel Random Access Machine) model of parallel computation and a parallel algorithm for A-order of binary tree is proposed. The process of the parallel algorithm is proceed with detailed description and verified analysis with an application instance. The parallel algorithm of A-order of binary tree provides using and reference for applying it to binary tree traverse sequence and solving the parallelism problem of application program.

关键词： A-order Sequence Binary Tree parallel algorithm PRAM Model

来源：评论

学校读者我要写书评

暂无评论

High-Speed Realization of parallel algorithm for Hash Computation On Multi-Core Cryptographic Processor

High-Speed Realization of Parallel Algorithm for Hash Comput...

引用

IEEE International Conference on Integrated Circuits and Microsystems (ICICM)

作者： Dai, Qiang Dai, Zibin Wang, Zhouchuang Li, Wei Inst Informat Sci & Technol Dept Microelect Zhengzhou Peoples R China Fudan Univ State Key Lab ASIC & Syst Shanghai Peoples R China

ISBN: (纸本)9781509028146

Hashing algorithms are used widely in information security area. Having studied the characteristics of traditional cryptographic hashing function and considered the features of multi-core cryptographic processor, this paper proposes a parallel algorithm for hash computation well-suited to multi core cryptographic processor. The algorithm breaks the chain dependencies of the standard hash function by implementing recursive hash to get faster hash implementation. We discuss the theoretical foundation for our mapping framework including security measure and performance measure. The experiments are performed on a PC with a PCIE card including multi-core cryptographic processor as the cipher processing engine. The results show a performance gain by an approximate factor of 7.8 when running on the 8-core cryptographic processor.

关键词： HASH parallel algorithm multi-core cryptographic processor SM3

来源：评论

学校读者我要写书评

暂无评论

A Novel parallel algorithm for Frequent Itemsets Mining in Large Transactional Databases 18th

A Novel Parallel Algorithm for Frequent Itemsets Mining in L...

引用

18th Industrial Conference on Data Mining (ICDM)

作者： Huan Phan Bac Le Univ Social Sci & Humanities Div IT VNU HCM Ho Chi Minh City Vietnam Univ Sci Fac Math & Comp Sci VNU HCM Ho Chi Minh City Vietnam Univ Sci Fac IT VNU HCM Ho Chi Minh City Vietnam

ISBN: (纸本)9783319957869;9783319957852

Since the era of data explosion, data mining in large transactional databases has become more and more important. There are many data mining techniques like association rule mining, the most important and well-researched one. Furthermore, frequent itemset mining is one of the fundamental but time-consuming steps in association rule mining. Most of the algorithms used in literature find frequent itemsets on search space items having at least a minsup and are not reused for subsequent mining. Therefore, in order to decrease the execution time, some parallel algorithms have been proposed for mining frequent itemsets. Nonetheless, these algorithms merely implement the parallelization of Apriori and FP-Growth algorithms. To deal with this problem, several parallel NPA-FI algorithms are proposed as a new approach in order to quickly detect frequent itemsets from large transactional databases using an array of co-occurrences and occurrences of kernel item in at least one transaction. parallel NPA-FI algorithms are easily used in many distributed file system, namely Hadoop and Spark. Finally, the experimental results show that the proposed algorithms perform better than other existing algorithms.

关键词： Association rules Co-occurrence items Frequent itemsets parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal parallel algorithm for finding the smallest enclosing triangle on a mesh-connected computer

引用

parallel algorithms and Applications 1993年第2期1卷 115-126页

作者： Choi, Jung-Ju Jeong, Hcang-Sung Kim, Mwng-Soo Department of Computer Science Pohang Institute of Science and Technology Pohang Kyungbuk 790-600 PO. Box 125 South Korea Department of Electronics Korea University Sungbuk-ku Seoul 136-75 I 5-Ka Anam-Dong South Korea Department of Computer Science Pohang Insticute of Science and Technology Pohang Kyungbuk 790-600 PO. Box 125 South Korea

A mapping procedure for synthesizing uniform recurrence equations from the dynamic programming formulation of the knapsack problem is proposed. Two new systolic arrays are synthesized from the systems of recurrence equations produced. One of these arrays is optimal with respect to both speedup and efficiency and requires O(nb/q + n – n/q) time and O(q[w_max/2]) processors, where b is the knapsack capacity, n is the number of items, w_maxis the maximum weight taken over all items, and q > 0 is an arbitrary chosen design parameter. ©1993 Gordon and Breach Science Publishers S.A. All right reserved. © 1993, Taylor & Francis Group, LLC. All rights reserved.

关键词： meshconnected computer parallel algorithm smallest enclosing triangle

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel algorithm for the knapsack problem without memory conflicts

Optimal parallel algorithm for the knapsack problem without ...

引用

4th International Conference on parallel and Distributed Computing, Applications and Technologies (PDCAT 2003)

作者： Li, KL Li, QH Wang-Hui Jiang, SY Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)0780378407

The knapsack problem is very important in cryptosystem and in number theory. This paper proposes a new parallel algorithm for the knapsack problem where the method of divide and conquer is adopted. Basing on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2(n/4))(1-epsilon) processors, 0less than or equal to epsilon less than or equal to 1, and O(2(n)) memory to find a solution for the n-element knapsack problem in time O(2(n/4) (2(n/4))epsilon). Thus the cost of the proposed parallel algorithm is O(2(n)), which is optimal, and an improved result over the past researches. Keywords: Knapsack problem, parallel algorithm, optimal algorithm, memory conflicts.

关键词： knapsack problem parallel algorithm optimal algorithm memory conflicts

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：