We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state, thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.

A Beowulf cluster is a network of commodity computers designed to perform parallel computations with the goal of achieving high performance. We have created two clusters to serve our college community: a testing cluster for developing parallel software and exploring new system configurations, and a stable production cluster. The cluster project has two main goals: to support interdisciplinary r...

Parallel computers are ideally suited to the Monte Carlo simulation of spin models using the standard Metropolis algorithm, since it is regular and local. However local algorithms have the major drawback that near a phase transition the number of sweeps needed to generate a statistically independent configuration increases as the square of the lattice size. New algorithms have recently been dev...

The hybrid cluster computing is the computing based on the platform of hybrid clusters, which is the computer cluster consisting of both the stationary and mobile computers, interconnected by wireless and wired networks. The study presented in this paper contributes to the research of hybrid cluster computing in two aspects: one is that a prototype for the hybrid cluster computing is implemente...

Machine learning techniques have facilitated image retrieval by automatically classifying and annotating images with keywords. Among them Support Vector Machines (SVMs) are used extensively due to their generalization properties. However, SVM training is notably a computationally intensive process especially when the training dataset is large. In this thesis distributed computing paradigms have...

Sequence similarity, as a special case of data intensive applications, is one of the neediest applications for parallelization. Clustered commodity computers as a cost-effective platform for distributed and parallel processing, can be leveraged to parallelize sequence similarity. However, manually designing and developing parallel programs on commodity computers is a time-consuming, complex and...

The utility of cluster computers (Beowulfs) for efficient parallel image processing of large-scale mosaics and stereo image correlations is presented. The parallelization of existing serial software using the message passing interface (MPI) is described. Almost perfect reduction of the required wall-clock time with increasing number of CPUs is reported. This true parallelization approach differ...

Cluster algorithms are non-local Monte Carlo update schemes which can greatly increase the efficiency of computer simulations of spin models of magnets. The major computational task in these algorithms is connected component labeling, to identify clusters of connected sites on a lattice. We have devised some new SIMD component labeling algorithms, and implemented them on the Connection Machine....

INTRODUCTION The NASA/JPL goal to reduce payload in future space missions while increasing mission capability demands miniaturization and integration of active and passive sensors, analytical instruments and communication systems among others. Currently, typical system requirements include the detection of particular spectral lines, associated data processing, and communication of the acquired ...