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

An optimal parallel algorithm to color an interval graph

Parallel Processing Letters 1996年第4期6.0卷 439-449页

作者： Pal, Madhumangal Department of Mathematics Indian Institute of Technology Kharagpur - 721 302 India

An optimal parallel algorithm is presented for coloring an interval graph using minimum number of colors. The proposed parallel algorithm takes O(Jp + log n) time with P processors on an EREW PRAM. © World Scient... 详细信息

关键词： Coloring Coloring partition EREW PRAM Interval graph Parallel algorithm sequential algorithm

来源：评论

学校读者我要写书评

暂无评论

Power Flow of Multi-Terminal HVDC: Case Study NER Agra UHVDC System 800kV 6000MW 22

Power Flow of Multi-Terminal HVDC: Case Study NER Agra UHVDC...

引用

22nd National Power Systems Conference (NPSC)

作者： Singh, Nivedita Singh, Chandransh Sood, Yog Raj NIT Hamirpur Hamirpur India

ISBN: (纸本)9781665462020

This paper presents a sequential algorithm for solving ac/dc load flow problem in a MT-HVDC System. The basic advantages of the algorithm used are its simplicity and flexibility when integrated into an already existing power flow package. The computation is very fast and the error accumulated is very low. The dc power flow problem is solved using both Gauss- Seidel and Newton- Raphson methods and comparative results are presented. The test cases that are used are WSCC 3-machine, 9-bus system with a 3-terminal MT-HVDC network being integrated with the already existing ac system. The validity of this algorithm is justified by verifying the results in Dig SILENT Power Factory. The work is furthermore extended by modelling and evaluating power flow of a practical system in form of a case study i.e., NER-Agra HVDC link. It is world's third multi-terminal and first UHVDC project which is designed for +/- 800 kV, 6000 MW. A detailed modelling of this MT-HVDC System is done in order to analyze its power flow.

关键词： sequential algorithm Multi-terminal HVDC Power Flow

来源：评论

学校读者我要写书评

暂无评论

Efficient Computation of Spherical Harmonic Transform using Parallel Architecture of CUDA

Efficient Computation of Spherical Harmonic Transform using ...

引用

5th International Conference on Signal Processing and Communication Systems (ICSPCS)

作者： Huang, Weiyu Khalid, Zubair Kennedy, Rodney A. Australian Natl Univ Coll Engn & Comp Sci Res Sch Engn Canberra ACT Australia

ISBN: (纸本)9781457711800

Spherical harmonics serve as basis functions on the unit sphere and spherical harmonic transform is required in analysis and processing of signals in the spectral domain. We investigate the possibility of parallel computation of spherical harmonic transform using Compute Unified Device Architecture (CUDA) with no communication between parallel kernels. We identify the parallel components in the widely used spherical harmonic transform method proposed by Driscoll and Healy. We provide the implementation details and compare the computational complexity with the sequential algorithm. For a given bandlimited signal with maximum spherical harmonics degree L, using the O(L) number of parallel processing kernels, we present that the spherical harmonic coefficients can be calculated in O(Llog(2) L) time as compared to O(L-2 log(2) L). For corroboration, we provide the simulation results using CUDA which indicate the reduction in computational complexity

关键词： Parallel architectures spherical harmonic analysis Sphericity complexity classes Transform PARALLEL PROCESSING (COMPUTERS) sequential algorithm Spectral domain Simulation results

来源：评论

学校读者我要写书评

暂无评论

Less is More: Video Trimming for Action Recognition

Less is More: Video Trimming for Action Recognition

引用

IEEE International Conference on Computer Vision (ICCV)

作者： Antic, Borislav Milbich, Timo Ommer, Bjoern Heidelberg Univ Heidelberg Collaboratory Image Proc D-69115 Heidelberg Germany

ISBN: (纸本)9781479930227

Action recognition is an important precursor for understanding human activities in videos. The current paradigm of action recognition is to classify a video sequence as a whole. However, actions usually occur only in part of a video sequence, rendering the rest of the video irrelevant for action recognition. In this paper, we propose a method for learning a subsequence classifier which can detect and classify part of a video that corresponds to the action. The subsequence classifier is trained from weakly labeled training videos whose subsequence labels are not provided, but need to be inferred during learning. We use the framework of multiple instance learning to solve two problems jointly: i) find the action subsequences in training videos, ii) train the subsequence classifier using the inferred action subsequences. To obtain a robust solution to the MIL problem, we propose a sequential algorithm that consecutively decreases the number of inferred action subsequences per video and trims their length until only one short subsequence is used as the action representative in each video. We evaluate the combination of the automatically trained subsequence classifier and the full sequence classifier on the very challenging Hollywood2 benchmark set and observe a significant gain in the performance over the baseline full sequence classifier. Moreover, a favorable performance of the subsequence classifier for temporal localization of actions in videos is evidenced on two categories of the Hollywood2 dataset.

关键词： action recognition multiple instance learning video analysis Videotapes Classifiers Video sequences Action trimmings VIDEO ANALYSIS Training Videos Recognition (Psychology) sequential algorithm Robust solution

来源：评论

学校读者我要写书评

暂无评论

GPU-based Computing of Repeated Range Queries over Moving Objects

GPU-based Computing of Repeated Range Queries over Moving Ob...

引用

22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Silvestri, Claudio Lettich, Francesco Orlando, Salvatore Jensen, Christian S. Univ Ca Foscari Venice Italy Aarhus Univ DK-8000 Aarhus C Denmark

ISBN: (纸本)9781479927289

In this paper we investigate the use of GPUs to solve a data-intensive problem that involves huge amounts of moving objects. The scenario which we focus on regards objects that continuously move in a 2D space, where a large percentage of them also issues range queries. The processing of these queries entails a large quantity of objects falling into the range queries to be returned. In order to solve this problem by maintaining a suitable throughput, we partition the time into ticks, and defer the parallel processing of all the objects events (location updates and range queries) occurring in a given tick to the next tick, thus slightly delaying the overall computation. We process in parallel all the events of each tick by adopting an hybrid approach, based on the combined use of CPU and GPU, and show the suitability of the method by discussing performance results. The exploitation of a GPU allow us to achieve a speedup of more than 20x on several datasets with respect to the best sequential algorithm solving the same problem. More importantly, we show that the adoption of new bitmap-based intermediate data structure we propose to avoid memory access contention entails a 10x speedup with respect to naive GPU based solutions.

关键词： data structures graphics processing units parallel processing query processing 2D space GPU-based computing bitmap-based intermediate data structure data-intensive problem hybrid approach location updates moving objects objects events parallel processing query processing repeated range queries sequential algorithm Computer architecture Graphics processing units Indexes Instruction sets Microprocessors Pipelines Synchronization bitmap gpgpu gpu workload distribution lock-free data structures moving objects repeated range queries uniform grids

来源：评论

学校读者我要写书评

暂无评论

Technique for the algorithms formulae investigation

Technique for the algorithms formulae investigation

引用

International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET 2004)

作者： Dragan, Y Ovsyak, V Sikora, L Lviv Politech Natl Univ UA-79013 Lvov Ukraine

A technique of algorithms formulae investigation which has been developed on the ground off mathematical induction is described.

ISBN: (纸本)9665533800

A technique of algorithms formulae investigation which has been developed on the ground off mathematical induction is described.

关键词： algorithm formula of algorithm sequential algorithm investigation of algorithm mathematical induction

来源：评论

学校读者我要写书评

暂无评论

Geodetic Iterative Methods for Nonlinear Acoustic Sources Localization: Application to Cracks Effects Detected with Acoustic Emission 6

Geodetic Iterative Methods for Nonlinear Acoustic Sources Lo...

引用

6th International Workshop of NDT Experts on NDT in Progress

作者： Zavesky, Michal Kus, Vaclav Czech Tech Univ Fac Nucl Sci & Phys Engn Dept Math Trojanova 13 Prague 12000 EU Czech Republic

ISBN: (纸本)9788021443396

This paper is related to Acoustic Emission (AE) principle, which is a Nondestructive Testing method (NDT) for structural health monitoring and many other applications. We deal with the geodetic curve based localization of the defects on surfaces of solid bodies mathematically described as a conjunction of several simpler parametrized shapes like cylinders, toroids, spheres, cones,... with intersections. We demonstrate a numerical solution of geodesic equations by the algorithm NewtonRaphson method. For faster computations we propose a few improvements using sequential algorithm applied to bisected points of the intersections, which is compared with trivial Fundamental method. The whole algorithm for finding geodesics on combined surfaces is applied to virtual testing body which was designed according to the solid watering can.

关键词： Acoustic emission geodetic curve geodesic equations Newton-Raphson method sequential algorithm

来源：评论

学校读者我要写书评

暂无评论

A Highly Parallel Reuse Distance Analysis algorithm on GPUs

A Highly Parallel Reuse Distance Analysis Algorithm on GPUs

引用

26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Cui, Huimin Yi, Qing Xue, Jingling Wang, Lei Yang, Yang Feng, Xiaobing Chinese Acad Sci SKL Comp Architecture Inst Comp Technol Beijing Peoples R China Univ Texas CAS Dept Comp Sci San Antonio TX USA Univ New South Wales Sch Comp Sci & Engn Sydney NSW Australia

ISBN: (纸本)9780769546759

Reuse distance analysis is a runtime approach that has been widely used to accurately model the memory system behavior of applications. However, traditional reuse distance analysis algorithms use tree-based data structures and are hard to parallelize, missing the tremendous computing power of modern architectures such as the emerging GPUs. This paper presents a highly-parallel reuse distance analysis algorithm (HP-RDA) to speedup the process using the SPMD execution model of GPUs. In particular, we propose a hybrid data structure of hash table and local arrays to flatten the traditional tree representation of memory access traces. Further, we use a probabilistic model to correct any loss of precision from a straightforward parallelization of the original sequential algorithm. Our experimental results show that using an NVIDIA GPU, our algorithm achieves a factor of 20 speedup over the traditional sequential algorithm with less than 1% loss in precision.

关键词： Reuse reuse modern architectures Data structures sequential algorithm Hash table Precision Probabilistic Model Runtime Speeding algorithms

来源：评论

学校读者我要写书评

暂无评论

A GPU Implementation of Parallel Constraint-based Local Search

A GPU Implementation of Parallel Constraint-based Local Sear...

引用

22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Arbelaez, Alejandro Codognet, Philippe Natl Univ Ireland Univ Coll Cork INSIGHT Ctr Data Analyt Corcaigh Ireland Univ Tokyo Dept Comp Sci UPMC JFLICNRS Tokyo 1138654 Japan

ISBN: (纸本)9781479927289

In this paper we study the performance of constraint-based local search solvers on a GPU. The massively parallel architecture of the GPU makes it possible to explore parallelism at two different levels inside the local search algorithm. First, by executing multiple copies of the algorithm in a multiwalk manner and, second, by evaluating large neighborhoods in parallel in a single-walk manner. Experiments on three well-known problem benchmarks indicate that the current GPU implementation is up to 17 times faster than a well-tuned sequential algorithm implemented on a desktop computer.

关键词： graphics processing units parallel architectures search problems GPU massively parallel architecture parallel constraint-based local search sequential algorithm Benchmark testing Graphics processing units Instruction sets Memory management Optimized production technology Random access memory Search problems CSP GPU Local Search

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient control algorithms for switching fabrics 16

An energy-efficient control algorithms for switching fabrics

引用

16th International Telecommunications Network Strategy and Planning Symposium (Networks)

作者： Zal, Mariusz Wojtysiak, Przemyslaw Poznan Univ Tech Chair Commun & Comp Networks PL-64980 Poznan Poland

ISBN: (纸本)9781479965151

In this paper we present the way of saving electrical energy in high-tech telecommunication and computer networks. To achieve this aim, the work focuses on the description of the current state and the future trends of changes, as well as it analyses the possibility of energy-saving solutions based on the Clos switching network architectures used in switching networks. A simulation program has been implemented to estimate multi-stage switching system energy consumption. This program enabled to check the operating quality (how much energy was saved by the structure during packet forwarding or rejecting), routing algorithms (sequential algorithm, quasi-random algorithm and Benes algorithm) and their modifications that optimize the achieved results.

关键词： energy conservation energy consumption environmental factors multistage interconnection networks telecommunication network routing Benes? algorithm Clos switching network architecture computer network electrical energy energy-efficient control algorithm energy-saving solution high-tech telecommunication network multistage switching system quasirandom algorithm routing algorithm sequential algorithm switching fabrics Energy consumption Power demand Switches Telecommunications Turning energy consumption computer network sequential algorithm electrical energy multistage interconnection networks Routing algorithms Telecommunications Power demand telecommunication network routing Switches Turning Energy conservation Computer algorithms Textile fabrics fabric

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：