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

parallel algorithm for computing fixpoints of Galois connections

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2010年第2期59卷 257-272页

作者： Krajca, Petr Outrata, Jan Vychodil, Vilem Palacky Univ Dept Comp Sci CR-77147 Olomouc Czech Republic

This paper presents a parallel algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. The algorithm results as a parallelization of CbO (Kuznetsov 1999) in which we process disjoint sets of fixpoints simultaneously. One of the distinctive features of the algorithm compared to other parallel algorithms is that it avoids synchronization which has positive impacts on its speed and implementation. We describe the parallel algorithm, prove its correctness, and analyze its asymptotic complexity. Furthermore, we focus on implementation issues, scalability of the algorithm, and provide an evaluation of its efficiency on various data sets.

关键词： Galois connection Fixpoint Formal concept parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm FOR GENERATING PERMUTATIONS ON LINEAR-ARRAY

引用

INFORMATION PROCESSING LETTERS 1990年第4期35卷 167-170页

作者： LIN, CJ Dep. Appl. Math. Natl. Chiao Tung Univ. Hsinchu Taiwan

A parallel algorithm is presented for generating n! permutations of n given items. The algorithm requires 0(n!) time steps and runs on a linear array in which each processing element (PE) contains only constant storage size and the elapsed time of a time step is independent of n. The basic idea for designing the algorithm is the use of iterative method and adding modulo operation. The essential part in the algorithm is that, during the execution of current cycle-n-permutations with a header, the next header for the next cycle-n-permutations must be prepared in time. In the linear array, since each PE is identical and executes the same program, it is suitable for very large-scale integration implementation.

关键词： parallel algorithm linear array permutations ranking function

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm of multiobjective optimization harmony search based on cloud computing

引用

JOURNAL OF algorithmS & COMPUTATIONAL TECHNOLOGY 2017年第3期11卷 301-313页

作者： Li, Wenjing Du, Wenhong Tang, Weifeng Pan, Ying Zhou, Jie Lin, Zhongming Guangxi Teachers Educ Univ Guangxi Higher Educ Key Lab Sci Comp & Intelligen Nanning Peoples R China Guangxi Teachers Educ Univ Sch Logist Management & Engn Nanning Peoples R China Guangxi Zhuang Autonomous Reg Sci & Technol Dept Nanning Peoples R China Guangxi Teachers Educ Univ Coll Comp & Informat Engn Nanning Peoples R China

In order to solve the problems of traditional harmony search in complex function multiobjective optimization, such as low precision, slow convergence, and easy to fall into local optimum, this article proposes a multiobjective optimization harmony search parallel algorithm based on cloud computing. First, according to the characteristics that the traditional harmony search algorithm uses a single harmony library for storing and processing the memory harmony, and it is divided into multiple harmony sublibraries according to different harmony. At the same time, the roulette selection and dynamic trade-off factor strategies are used for the dynamic setting of harmony memory library value-taking probability, pitch fine-tuning probability, pitch fine-tuning bandwidth, and other parameters which the traditional harmony search algorithm mainly relies on. Then, MapReduce programming model is used to establish Map and Reduce core parallel computing functions, to construct the parallel algorithm of dynamic parameter harmony search based on cloud computing. Finally, the algorithm optimization comparison test is conducted on Hadoop platform and compared with several existing optimal harmony search algorithms, the searching precision of this algorithm is improved by eight orders of magnitude, and the iteration number on the convergence speed is reduced by 6500 times, and the parallel achieves the linear acceleration ratio. Experimental results show that the optimization efficiency of this algorithm is higher than several existing optimal harmony search algorithms.

关键词： Multiobjective optimization harmony search dynamic parameter map and reduce function parallel algorithm Hadoop platform

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm Research on Several Important Open Problems in Bioinformatics

引用

INTERDISCIPLINARY SCIENCES-COMPUTATIONAL LIFE SCIENCES 2009年第3期1卷 187-195页

作者： Niu, Bei-Fang Lang, Xian-Yu Lu, Zhong-Hua Chi, Xue-Bin Chinese Acad Sci Super Comp Ctr Comp Network Informat Ctr Beijing 100190 Peoples R China Chinese Acad Sci Grad Univ Beijing 100039 Peoples R China

High performance computing has opened the door to using bioinformatics and systems biology to explore complex relationships among data, and created the opportunity to tackle very large and involved simulations of biological systems. Many supercomputing centers have jumped on the bandwagon because the opportunities for significant impact in this field is infinite. Development of new algorithms, especially parallel algorithms and software to mine new biological information and to assess different relationships among the members of a large biological data set, is becoming very important. This article presents our work on the design and development of parallel algorithms and software to solve some important open problems arising from bioinformatics, such as structure alignment of RNA sequences, finding new genes, alternative splicing, gene expression clustering and so on. In order to make these parallel software available to a wide audience, the grid computing service interfaces to these software have been deployed in China National Grid (CNGrid). Finally, conclusions and some future research directions are presented.

关键词： parallel algorithm SiClone alternative splicing gene expression grid

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm FOR SECOND-ORDER RESTRICTED WEAK INTEGER COMPOSITION GENERATION FOR SHARED MEMORY MACHINES

引用

parallel PROCESSING LETTERS 2013年第3期23卷

作者： Page, Daniel R. Univ Manitoba Dept Comp Sci Winnipeg MB R3T 2N2 Canada

In 2012, Page presented a sequential combinatorial generation algorithm for generalized types of restricted weak integer compositions called second order restricted weak integer compositions. Second order restricted weak integer compositions cover various types of restricted weak integer compositions of n parts such as integer compositions, bounded compositions, and part wise integer compositions. In this paper, we present a parallel algorithm that derives from our parallelization of Page's sequential algorithm with a focus on load balancing for shared memory machines.

关键词： parallel algorithm combinatorial algorithm generation algorithm computational number theory weak integer compositions restricted weak integer compositions

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm development and testing using Petri-object simulation

引用

INTERNATIONAL JOURNAL OF parallel EMERGENT AND DISTRIBUTED SYSTEMS 2021年第6期36卷 549-564页

作者： Stetsenko, Inna V. Pavlov, Alexander A. Dyfuchyna, Oleksandra Igor Sikorsky Kyiv Polytech Inst Dept Informat & Software Engn Kiev Ukraine

parallel algorithms are problematic to develop because of the negative influence of synchronisation, complicated behaviour of threads' capturing computing resources. Experimental results show performance time's strong dependence on algorithm parameters, such as the number of subtasks and the complexity of each task. The optimal value of subtask complexity is revealed for the particular algorithm. It is the same for different complexity of the parallelised task (with the same computing resource). To guarantee algorithm speed-up it is important to have a method for investigating the efficiency of parallel algorithm before its implementation on specified computing resources. Stochastic Petri net potentially could be a high accuracy tool for investigating the efficiency of a parallel algorithm. However, a huge number of elements are needed to compose a model of non-trivial algorithm that limits the application of this tool in practice. Petri-object simulation method allows replication of Petri nets with specified parameters and model creation of a list of linked Petri-objects. Basic templates for the model creation of a multithreaded algorithm are developed. Applying these templates, the model of the parallel discrete event simulation algorithm is developed and investigated. By the model results, the algorithm parameters providing the least performance time can be determined.

关键词： Multithreaded programming parallel algorithm parallel simulation discrete event simulation stochastic Petri net Java

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm in Surface Wave Waveform Inversion

引用

Wuhan University Journal of Natural Sciences 2001年第Z1期6卷 574-578页

作者： Cao Xiao lin, Song Jun qiang School of Computer Science, National University of Defense Technology, Changsha 410073, China School of Computer Science National University of Defense Technology Changsha China

In Surface wave waveform inversion, we want to reconstruct 3D shear wave velocity structure, which calculation beyond the capability of the powerful present day personal computer or even workstation. So we designed a high paralleled algorithm and carried out the inversion on parallel computer based on the partitioned waveform inversion (PWI). It partitions the large scale optimization problem into a number of independent small scale problems and reduces the computational effort by several orders of magnitude. We adopted surface waveform inversion with a equal block(2 o×2 o) discretization.

关键词： surface wave waveform inversion parallel algorithm partitioned waveform inversion

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm to Detect Structural Changes in Time Series

引用

Computational Mathematics and Modeling 2016年第2期27卷 247-253页

作者： Nikol’skii, I.M. Furmanov, K.K. Faculty of Computational Mathematics and Cybernetics Moscow State University Moscow Russian Federation

Analysis of long time series is relevant in many current applications. These investigations are usually carried out on multiprocessor computers (supercomputers). However, supercomputer calculations are efficient only if the time-series processing algorithms are sufficiently parallelized. In this article, we propose a parallel algorithm that detects shift points of the time-series mean — a highly important task in many applications. The algorithm breaks the time series into segments and looks for shift points on each segment using a statistical test. The critical values have been calculated for this test. An additional test reduces the number of false detections. © 2016, Springer Science+Business Media New York.

关键词： detection parallel algorithm structural changepoint time series

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm Study of Petri net Based on Multi-core Clusters 14

Parallel Algorithm Study of Petri net Based on Multi-core Cl...

引用

International Symposium Distributed Computing and Applications Business Engineering and Science

作者： Li, Wenjing Lin, Zhong-ming Pan, Ying Tang, Ze-yu Guangxi Teachers Educ Univ Sch Logist Management & Engn Nanning Peoples R China Guangxi Teachers Educ Univ Coll Comp & Informat Engn Nanning Peoples R China

ISBN: (纸本)9781467365932

The parallel algorithm of Petri net based on multicore clusters is put forward in order to make the Petri net system with concurrent synchronous function realize parallel control and running. First, select different Petri net structures and conduct transformation, and give the partitioning method of the subnets of place invariant-based Petri net system. Then, put forward the parallel algorithm of Petri net based on multicore clusters according to the MPI+ OpenMP+ STM (STM, Software Transactional Memory and transactional memory) three-level parallel programming model and combining with the parallelized analysis of the changes of internal subnets and among the subnets. The experiment results show that the algorithm can better reflect the actual running process of Petri net system, and it is a feasible and effective method of realizing the parallel control and running of Petri net system.

关键词： Multicore clusters Petri net Petri net structure and transformation Subnet partitioning MPI plus OpenMP plus STM parallel model parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm of real-time infrared image restoration based on total variation theory 5

Parallel algorithm of real-time infrared image restoration b...

引用

Conference on High-Performance Computing in Remote Sensing V

作者： Zhu, Ran Li, Miao Long, Yunli Zeng, Yaoyuan An, Wei Natl Univ Def Technol Coll Elect Sci & Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781628418569

Image restoration is a necessary preprocessing step for infrared remote sensing applications. Traditional methods allow us to remove the noise but penalize too much the gradients corresponding to edges. Image restoration techniques based on variational approaches can solve this over-smoothing problem for the merits of their well-defined mathematical modeling of the restore procedure. The total variation (TV) of infrared image is introduced as a L-1 regularization term added to the objective energy functional. It converts the restoration process to an optimization problem of functional involving a fidelity term to the image data plus a regularization term. Infrared image restoration technology with TV-L-1 model exploits the remote sensing data obtained sufficiently and preserves information at edges caused by clouds. Numerical implementation algorithm is presented in detail. Analysis indicates that the structure of this algorithm can be easily implemented in parallelization. Therefore a parallel implementation of the TV-L-1 filter based on multicore architecture with shared memory is proposed for infrared real-time remote sensing systems. Massive computation of image data is performed in parallel by cooperating threads running simultaneously on multiple cores. Several groups of synthetic infrared image data are used to validate the feasibility and effectiveness of the proposed parallel algorithm. Quantitative analysis of measuring the restored image quality compared to input image is presented. Experiment results show that the TV-L-1 filter can restore the varying background image reasonably, and that its performance can achieve the requirement of real-time image processing.

关键词： image restoration total variation parallel algorithm multicore architecture OpenMP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：