Industrial part surface defect detection aims to precisely locate defects in images, which is crucial for quality control in manufacturing. The traditional method needs to be designed in advance, but it has shortcomin...
详细信息
This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes are configured as a one-dimensional array. We conduct experiments for implement...
详细信息
This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes are configured as a one-dimensional array. We conduct experiments for implementing (i) spanning tree algorithm (SPT-list) with unordered list of edges as input, (ii) SPT algorithm with adjacency matrix, (iii) minimum spanning tree algorithm (MST) with weight matrix as input, and (iv) SPT algorithm derived from MST algorithm by assigning each edge-weight equal to 1. The empirical study is performed with a wide range of random graphs, generated for various (uniformly distributed) edge-densities (d) for a given number (n) of vertices. We plot curves for resulting speedups as functions of n, d, and p. The edge-density d is varied between 0.1 and 0.9;maximum number of vertices (or edges) considered are 300 (or 40 000) and 500 (or 110 000) for transputer and Unix systems, respectively;and the number of processors p varies from 1 through 8 in the transputer system while 1 through 4 in the Unix system. A maximum speedup of 2.98 is obtained on transputers, and that for the Unix system is 3.0. We observe that the speedups of all algorithms vary with increasing number of vertices or edge-density. However, employing more processing units in an algorithm does not necessarily enhance its speedup because of additional communication overhead.
Finitely inductive (F1) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pat...
详细信息
It is shown that the loading pioblem foi a 6 node neural netwoik with node function set AC^ (that is, the conjunction or disjunction of a subset of the inputs or their complements) is AiV complete. It can be deduced f...
We design efficient parallel algorithms for solving several problems on interval graphs. The problems include finding a BFS-tree and DFS-tree, articulation points and bridges, and minimum coloring. Each of our algorit...
详细信息
We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. This is an improvement in space and time over the one recen...
详细信息
Finitely inductive (FI) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pat...
详细信息
We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read exclusive-write (EREW), parallel random access machine (PRAM) model. We also analyze the time and space complexities of our algorith...
详细信息
This paper presents empirical performance of parallel algorithms for computing a spanning tree (SPT) and a minimum spanning tree (MST) of connected graphs on the Transputer and Unix systems, where processors are confi...
详细信息
We present a cost-optimal parallel algorithm for the parentheses matching problem on the EREW PRAM model For n parentheses, the algorithm requires O(n/p + log n) time and O(n + p log p) space, employing p processors. ...
详细信息
暂无评论