作者：
Li, KQDept. of Math. & Comput. Sci.
State Univ. of New York New Paltz NY USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
A parallel program can be modeled as an acyclic directed graph. where a node represents a task, which is the smallest grain of comput.tion to be assigned to a processor, and arcs stand for precedence (synchronization)...
详细信息
A parallel program can be modeled as an acyclic directed graph. where a node represents a task, which is the smallest grain of comput.tion to be assigned to a processor, and arcs stand for precedence (synchronization) constraints among the tasks. Due to different input data and unpredictable dynamic run time environments, the execution times of tasks as well as the entire program can be treated as random variables. In this paper, we develop some stochastic lower and upper bounds for parallel program execution times when there are limited processors. Such analysis can provide important information for job scheduling and resource allocation. For several typical classes of parallel programs, we derive very accurate closed form approximations for the bounds. Examples are also given to demonstrate the quality of the bounds derived.
Most projections for high-performance, massively parallel processors (MPPs) include deep and complex memory hierarchies. Making efficient use of these systems will require making efficient use of these memory hierarch...
详细信息
A linear [n,k,d] code over GF(4) is said to be optimal if the minimum distance d is as large as possible for given length n and dimension k. We show that some previously discovered optimal codes have natural geometric...
详细信息
A new class of linear codes over GF(q) for byte organized systems from algebraic curves is proposed. Here, an element in GF(q) is called a symbol and "byte" denotes a q-ary sequence of length b≥2. A codewor...
详细信息
Previously we proposed a fast parallel decoding algorithm for general one-point algebraic geometric (AG) codes with a systolic array architecture. But, designing the detailed structure of the systolic array and schedu...
详细信息
The problem of construction of a code sequence with good auto- and cross-correlation properties for multiple access communications has received a lot of attention. M-sequences and sequences derived from them solve the...
详细信息
A method is presented for the factorization of 2D second order polynomials, based on the application of artificial neural networks trained by constrained learning techniques. The approach achieves minimization of the ...
详细信息
A method is presented for the factorization of 2D second order polynomials, based on the application of artificial neural networks trained by constrained learning techniques. The approach achieves minimization of the usual mean square error criterion along with simultaneous satisfaction of constraints between the polynomial coefficients. Using this method, we are able to obtain the exact solution for factorable polynomials and good approximate solutions for nonfactorable polynomials. By incorporating additional constraints for stability into the formalism our method can be successfully used for the realization of stable IIR filters in cascade form.
In this paper, an adaptive split-and-merge segmentation method is proposed. The splitting phase of the algorithm employs the incremental Delaunay triangulation competent of forming grid edges of arbitrary orientation,...
详细信息
In this paper, an adaptive split-and-merge segmentation method is proposed. The splitting phase of the algorithm employs the incremental Delaunay triangulation competent of forming grid edges of arbitrary orientation, and position. The tessellation grid, defined by the Delaunay triangulation, is adjusted to the semantics of the image data by combining similarity and difference information among pixels. Experimental results on synthetic images show that the method is robust to different object edge orientations, partially weak object edges and very noisy homogeneous regions. Experiments on a real image indicate that the method yields good segmentation results even when there is a quadratic sloping of intensities particularly suited for segmenting natural scenes of man-made objects.
We present an erasure- and error decoding algorithm of one-point algebraic geometry codes up to the Feng-Rao designed distance using Sakata's (see Proceedings of the 1995 IEEE-ISIT, Whistler, Canada) multidimensio...
详细信息
暂无评论