Provided n points in an (n − 1)-dimensional affine space, and one ordering of the points for each coordinate, we address the problem of testing whether these orderings determine if the points are the vertices of a simplex (i.e. are affinely independent), regardless of the real values of the coordinates. We also attempt to determine the orientation of this simplex. In other words, given a matrix...

Building on Kahn and Plotkin's theory of concrete data structures and sequential functions, Berry and Curien de ned an intensional model of sequential algorithms between concrete data structures. In this paper we report on an attempt to develop a similar intensional model of concurrent computation. We present a notion of parallel algorithm between concrete data structures, together with suitabl...

The |{ algorithm is an eecient technique for searching game trees. As parallel computers become more available, it is important to have good parallel game tree search algorithms. Until now it is an open problem whether a linear speedup can be achieved with respect to sequential alpha{ beta. This note presents a sample of game trees with distinct leaf values, which are easy for sequential alpha{...

Visualization of multidimensional dataset is a challenging task due to non-uniformity of the data. It requires new ways to display data for better analysis and interpretation. Parallel coordinate is one of the popular techniques for visualization of multi dimensional dataset. Parallel coordinate technique emphasis various types of patterns present in the dataset. Here, pattern is shown by a pol...

The double row layout problem (DRLP) seeks to determine optimal machine locations on either side of an aisle, where the objective has been defined as the minimization of material flow cost among machines while meeting machine clearance constraints. In this paper, we extend existing DRLP formulations in two respects. First, we consider the minimization of layout area besides the usual material f...

A suite of parallel algorithms for ordering DNA sequences (termed PARODS) is presented. The algorithms in PARODS are based on an earlier serial algorithm, ODS, which is a physical mapping algorithm based on simulated annealing. Parallel algorithms for simulated annealing based on Markov chain decomposition are proposed and applied to the problem of physical mapping. Perturbation methods and pro...

In this paper, we propose a partially-parallel LDPC decoder which achieves a high-efficiency message-passing schedule. The proposed LDPC decoder is characterized as follows: (i) The column operations follow the row operations in a pipelined architecture to ensure that the row and column operations are performed concurrently. (ii) The proposed parallel pipelined bit functional unit enables the c...