. In this paper, we propose an implementation of the QRP algorithm using a distribution of the matrix columns in a round-robin fashion for better data locality and parallel memory bus utilization on multicore architectures. Our performance results show a 60 % improvement over the routine DGEQP3 of Intel MKL

text documents, and presents a visualization paradigm, called TileBars, that demonstrates the usefulness of explicit term distribution information in Boolean-type queries. TileBars simultaneously and compactly indicate relative document length, query term frequency, and query term distribution

in the entire atmospheric column. Here, 8 yr of worldwide distributed data from the AERONET network of ground-based radiometers were used to remotely sense the aerosol absorption and other optical properties in several key locations. Established procedures for maintaining and calibrating the global network

and the corresponding c rows of G. An important aspect of the algorithm is the probability distribution used to randomly sample the columns; we will use a judiciously-chosen and data-dependent nonuniform probability distribution. Let F denote the spectral norm and the Frobenius norm, respectively, of a matrix

complementary to Fourier preparation by linear field gradients. Thus, by using multiple receiver coils in parallel scan time in Fourier imaging can be considerably reduced. The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil

This paper measures the growth in open market stock repurchases and the manner in which stock repurchases and dividends are used by U.S. corporations. Stock repurchases and dividends are used at different times from one another, by different kinds of firms. Stock repurchases are very pro-cyclical

that use block-cyclic distributions. These techniques can be applied to programs with symbolic loop bounds, symbolic array dimensions, and loops with non-unit strides. We present algorithms for computing the data elements that need to be communicated among processors both for loops with unit and non

This article introduces a search algorithm for constructing quasi-cyclic LDPC codes of column-weight two. To obtain a submatrix structure, rows are divided into groups of equal sizes. Rows in a group are connected in their numerical order to obtain a cyclic structure. Two rows forming a column must

± 1, ..., i 0 ) with 0j<d (if they exist). In this work we will consider two dimensional meshes of size p×q. In what follows, we will call the processor located in row r and column s of the mesh PE[r,s]. Using simple indexing, PE[t] represents the t-th PE, 0t<p×q. In designing parallel sparse

A highly sensitive adenylate cyclase assay method has been developed which employs sequential chromatography on columns of Dowex cation ex-change resin and aluminum oxide. With the use of [a-“‘PIATP as substrate, this method permits the nearly complete separation of cyclic [“‘PIAMP formed from