A very rapid and efficient method for sorting and ordering large numbers of clones is presented. This top-down mapping approach divides the entire ordering problem into many smaller tasks and analyzes in parallel a gridded membrane array of clones by hybridization with probe pools. The strategy was tested on a 15-fold-coverage Schizosaccharomyces pombe cosmid library. About 1600 clones were ass...

this paper is a research on the ordering planning of a supply chain with one supplier, multi buyer and multi deteriorating items. items have fixed life time and expire dates. the ordering period is taken as variable and must be computed the proposed models. the problem is studied via two different approaches the first is the joint replenishment, based on the hwang and chew's model [3] and ...

The recent interest in heterogeneous parallel computing and improving network speeds have given rise to a new parallel architecture, the parallel network. This parallel processing paradigm, however, poses speciic challenges caused by the latency of the communications network and the workload imbalance that arises from the heterogeneity of the participating nodes. Data partitioning is of critica...

This paper presents a parallel algorithm for matrix inversion on a torus interconnected MIMD-MC multi-processor. This method is faster than the parallel implementations of other widely used methods namely Gauss-Jordan, Gauss-Seidal or LU decomposition based inversion. This new algorithm also introduces a novel technique, called adaptive pivoting, for solving the zero pivot problem at no cost. O...

The 2-D resistive sensor array in the row-column fashion suffered from the crosstalk problem for parasitic parallel paths. Firstly, we proposed an Improved Isolated Drive Feedback Circuit with Compensation (IIDFCC) based on the voltage feedback method to suppress the crosstalk. In this method, a compensated resistor was specially used to reduce the crosstalk caused by the column multiplexer res...

Many pattern discovery methods provide fast tools for finding the frequently occurring patterns in large data sets. Such pattern collections can also be used to approximate the underlying joint distribution, and they summarize the data set well. However, a large set of patterns is unintuitive and not necessarily easy to use. In this paper we consider the problem of ordering a collection of patt...

For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by earlier intervals in the ordering). This problem is motivated by an application in molecular biology that concerns the determination of the structure of the back...

A new row ordering strategy for frontal solvers. Abstract The frontal method is a variant of Gaussian elimination that has been widely used since the mid 1970s. In the innermost loop of the computation the method exploits dense linear algebra kernels, which are straightforward to vectorize and parallelize. This makes the method attractive for modern computer architectures. However, unless the m...

In this paper, we investigate a method to decompose the search space explored by a Constraint Programming algorithm to allow a parallel solution of a Constraint Satisfaction or Optimization Problem (CSP or COP). The static tree decomposition used is based on domain partitioning according to a value ordering heuristic and a discrepancybased search strategy. This work is a parallel adaptation of ...

In this article we present a fast recursive orthogonalization scheme for two important subspaces of the Macaulay matrix: its row space and null space. It requires a graded monomial ordering and exploits the resulting structure of the Macaulay matrix induced by this graded ordering. The resulting orthogonal basis for the row space will retain a similar structure as the Macaulay matrix and is as ...