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

COMPUTATIONAL-COMPLEXITY OF MANIPULATING BINARY DECISION DIAGRAMS

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1994年第6期E77D卷 642-647页

作者： TAKENAGA, Y YAJIMA, S Kyoto Univ Kyoto-shi Japan

An Ordered Binary Decision Diagram (BDD) is a graph representation of a Boolean function. According to its good properties, BDD's are widely used in various applications. In this paper, we investigate the computational complexity of basic operations on BDD's. We consider two important operations: reduction of a BDD and binary Boolean operations based on BDD's. This paper shows that both the reduction of a BDD and the binary Boolean operations based on BDD's are NC1-reducible to REACHABILITY. That is, both of the problems belong to NC2. In order to extend the results to the BDD's with output inverters, we also considered the transformations between BDD's and BDD's with output inverters. We show that both of the transformations are also NC1-reducible to REACHABILITY.

关键词： BINARY DECISION DIAGRAM COMPUTATIONAL COMPLEXITY BOOLEAN FUNCTION parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A 3D frequency-domain electromagnetic solver employing a high order compact finite-difference scheme

引用

COMPUTERS & GEOSCIENCES 2023年第1期178卷

作者： Vilanakis, N. D. Economou, N. Mathioudakis, E. Vafidis, A. Tech Univ Crete Appl Math & Comp Lab Univ Campus Khania 73100 Greece Tech Univ Crete Sch Mineral Resources Engn Appl Geophys Lab Univ Campus Khania 73100 Greece Sultan Qaboos Univ Coll Sci Earth Sci Dept Al Khoud 123 Oman

Three-dimensional (3D) electromagnetic (EM) modeling is an important tool for geophysical applications. In EM induction methods the modified Helmholtz equation is often used to describe scattered or residual electric fields in three dimensions. Throughout this paper, a high order compact finite difference scheme for the solution of that equation for vertical magnetic dipole source (VMD) is presented. The approximation of the residual electric field intensity using a fourth order compact finite difference (FD) discretizer is achieved with the solution of a block linear system, the coefficient matrices are large and sparse with a particular structure, implying the application of a matrix-free Krylov subspace method for an efficient numerical solution. The proposed solver is being examined using a number of test problems in uniform and non-uniform grid spacing where numerical and analytical solutions for the homogeneous half-space cases are being compared.

关键词： EM induction Method FDFD Solver High -order scheme parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL SORTING algorithmS ON BUS-CONNECTED PROCESSOR ARRAYS

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1993年第11期E76A卷 2008-2015页

作者： NAKANO, K Hitachi Ltd Saitama Japan

This paper presents a parallel sorting algorithm which sorts n elements in O(n/w + n log n/p) time using p(less-than-or-equal-to n) processors arranged in a 1-dimensional grid with w (less-than-or-equal-to n1-epsilon) buses for every fixed epsilon > 0. Furthermore, it is shown that n X p elements can be sorted in O(n/w + n log n/p) time on p x p (p less-than-or-equal-to n) processors arranged in a 2-dimensional grid with w(less-than-or-equal-to n1-epsilon) buses in each column and in each row. These algorithms are optimal because their time complexities are equal to the lower bounds.

关键词： SORTING parallel algorithm PROCESSOR ARRAY BUS

来源：评论

学校读者我要写书评

暂无评论

Použití OpenCl v AVG na platformě Windows

Použití OpenCl v AVG na platformě Windows

引用

作者： Bajcar, Martin Brno University of Technology

Tato práce se zabývá praktickým využitím technologie OpenCL ve společnosti AVG. AVG vidí OpenCL jako jednu z možností, jak ulehčit zátěž procesoru a případně urychlit v&#... 详细信息

Tato práce se zabývá praktickým využitím technologie OpenCL ve společnosti AVG. AVG vidí OpenCL jako jednu z možností, jak ulehčit zátěž procesoru a případně urychlit výpočet některých algoritmů. Velká část práce se zabývá optimalizacemi pro grafické karty AMD a NVIDIA, jakožto současné nejrozšířenější karty. Praktická část popisuje paralelizaci dvou algoritmů dodaných AVG, jejich analýzu z pohledu OpenCL a implementaci. Následně jsou popsány a odůvodněny dosažené výsledky a jsou popsány podmínky, pro které má smysl testované paralelní algoritmy použít v reálném produktu. Jako součást implementace je vytvořena knihovna, která usnadňuje práci při vývoji aplikací pracující s OpenCL.

关键词： OpenCL CUDA AVG paralelní algoritmus optimalizace GPGPU OpenCL CUDA AVG parallel algorithm optimalization GPGPU Text

来源：评论

学校读者我要写书评

暂无评论

Perspective on unstructured grid flow solvers

引用

AIAA JOURNAL 1996年第3期34卷 533-547页

作者： Venkatakrishnan, V Institute for Computer Applications in Science and Engineering NASA Langley Research Center Hampton Virginia 23681-0001

Unstructured grid flow solvers for the compressible Navier-Stokes equations are surveyed. Significant progress are made in the areas of spatial and temporal discretization and adaptative and parallel algorithms. Newly developed field equation turbulence models seem to mesh nicely with the unstructured grid framework. Based on these developments, it is safe to say that unstructured grid technology is almost on par with structured grid technology, although encumbered with additional memory andcomputational costs.

关键词： Unstructured Grid Compressible Fluid parallel Computing NASA Langley Research Center Total Variation Diminishing Roe Approximate Riemann Solver Galerkin Finite Element Approach Velocity Profiles parallel algorithm Navier Stokes Equations

来源：评论

学校读者我要写书评

暂无评论

Integrated Simulation and Analysis of Super Large Slotted Waveguide Array

引用

APPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY JOURNAL 2020年第7期35卷 813-820页

作者： Zhai, Chang Liu, Yingyu Jiang, Shugang Lin, Zhongchao Zhao, Xunwang Xidian Univ Shaanxi Key Lab Large Scale Electromagnet Comp Xian 710071 Shaanxi Peoples R China

Aiming at the simulation problem of the super large slotted waveguide array antenna, the parallel higher-order method of moment is used and the coupling effect between each slot element is taken into account to perform the integrated and accurate simulation. In order to ensure that the algorithm is efficient and stable in the parallel process, the BDPLU strategy is introduced to reduce the communication pressure and eliminates the redundant communication of the equation solving when pivoting, which speeds up the process of matrix equation solving. According to different types of waveguide port forms, the computation of rectangular wave port and coaxial wave port is studied, and a new parallel matrix filling technique of wave port is used to accelerate the matrix filling process. Numerical examples calculated at "Tianhe-2" supercomputer show that the algorithm can efficiently and accurately handle the simulation analysis of most types of complex slotted waveguide array.

关键词： BDPLU algorithm higher-order MoM parallel algorithm slotted waveguide array antenna wave port

来源：评论

学校读者我要写书评

暂无评论

Cluster-Distribute-Align-Merge: A General algorithm to Speed Up Multiple Sequence Alignment on Multi-Core Computers

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2014年第4期11卷 1000-1006页

作者： Zhu, Xiangyuan Li, Kenli Salah, Ahmad Li, Keqin Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China Zhaoqing Univ Educ Technol & Comp Ctr Zhaoqing 516061 Guangdong Peoples R China Zagazig Univ Dept Comp Sci Zagazig 44519 Sharkia Egypt SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA

We present a general algorithm to speed up multiple sequence alignment on modern multi-core computers. This algorithm is implemented in a software called CDAM. By clustering, CDAM partitions a large-scale alignment problem into smaller and more tractable sub-problems, which can be solved by existing alignment algorithms in parallel. The aligned clusters are then merged to form a solution to the original alignment problem. By performance evaluation on an 8-core computer using the classical benchmarks, BAliBASE, PREFAB, IRMBASE, and OXBench, and twenty-eight artificially generated datasets, it is shown that CDAM provides significant performance improvement with reasonable loss of accuracy. In some cases, a gain in accuracy is observed. The CDAM program, source code, and test data are freely available for academic users at http://***/CDAM/.

关键词： Biological Sequence Clustering Multi-Core Computer Multiple Sequence Alignment parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

NEW APPROACH TO REAL-TIME HEURISTIC-SEARCH BASED ON WAVE CONCURRENT PROPAGATIONS AND NEURAL NETWORKS

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1994年第11期E77A卷 1831-1839页

作者： SHUAI, DX WATANABE, Y Doshisha Univ Kyoto-fu Japan

This paper proposes new real-time heuristic distributed parallel algorithms for search, which are based on the concepts of propagations and competitions of concurrent waves. These algorithms are characterized by simplicity and clearness of control strategies for search, and distinguished abilities in many aspects, such as real-time performance, wide suitability for searching AND/OR implicit graphs, and ease in hardware implementation.

关键词： HEURISTIC SEARCH parallel algorithm NEURAL NETWORKS WAVE PROPAGATION

来源：评论

学校读者我要写书评

暂无评论

Analysis of nonlinear soil-structure interaction using partitioned method

引用

SOIL DYNAMICS AND EARTHQUAKE ENGINEERING 2022年 162卷

作者： Lv, Hao Chen, ShaoLin Nanjing Univ Aeronaut & Astronaut Coll Aerosp Engn Nanjing 210016 Peoples R China Nanjing Univ Aeronaut & Astronaut Dept Civil & Airport Engn Nanjing 211106 Peoples R China

For the current state-of-practice in soil-structure interaction (SSI) of nuclear facilities, the strain-dependent characteristics of soil are considered indirectly via equivalent linear methods in the frequency domain, typically represented by the SASSI program. SSI analysis in the time-domain, although directly involving material nonlinearity of the soil, is inefficient in practice up to now. Based on Partitioned Analysis of SSI (PASSI), a method for nonlinear soil-structure interaction analysis is developed in this paper, by applying implicit time-step integration and explicit one with different time steps to nuclear island and to soil, respectively. The incremental equilibrium equation and explicit decoupling method are used to analyze the soil nonlinearity described by the Davidenkov model with simplified loading-reloading rules, which avoids solving algebraic equations and iteration processes. An asynchronous parallel algorithm for nonlinear SSI analysis is given. A simple example is given to verify the partitioned approach with explicit-implicit co-computation against the full-explicit approach. Seismic response characteristics of nuclear power plants are investigated by comparing responses of nonlinear analysis with linear analysis. Different results address the importance of nonlinear SSI analysis for the seismic performance of nuclear structures.

关键词： Partitioned analysis for SSI parallel algorithm Explicit-implicit integration scheme Davidenkov model Incremental algorithm for nonlinear analysis

来源：评论

学校读者我要写书评

暂无评论

Put Three and Three Together: Triangle-Driven Community Detection

引用

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA 2016年第3期10卷 22-22页

作者： Prat-Perez, Arnau Dominguez-Sal, David Brunat, Josep-M. Larriba-Pey, Josep-Lluis Univ Politecn Cataluna DAMA UPC ES-08034 Barcelona Spain Spars Technol Lucknow Uttar Pradesh India Univ Politecn Cataluna Dept Matemat Aplicada 2 ES-08034 Barcelona Spain

Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks, or network traffic analysis. Although the existing metrics used to quantify the quality of a community work well in general, under some circumstances, they fail at correctly capturing such notion. The main reason is that these metrics consider the internal community edges as a set, but ignore how these actually connect the vertices of the community. We propose the Weighted Community Clustering (WCC), which is a new community metric that takes the triangle instead of the edge as the minimal structural motif indicating the presence of a strong relation in a graph. We theoretically analyse WCC in depth and formally prove, by means of a set of properties, that the maximization of WCC guarantees communities with cohesion and structure. In addition, we propose Scalable Community Detection (SCD), a community detection algorithm based on WCC, which is designed to be fast and scalable on SMP machines, showing experimentally that WCC correctly captures the concept of community in social networks using real datasets. Finally, using ground-truth data, we show that SCD provides better quality than the best disjoint community detection algorithms of the state of the art while performing faster.

关键词： Community detection social networks parallel algorithm scalable algorithm triangles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：