Spread-space spread-spectrum technique for secure multiplexing.

A novel technique for multiplexing complex images is proposed in which each image may be demultiplexed only if a set of random encryption keys is known. The technique utilizes the ability of the double random phase encoding method to spread a signals' energy in both the space and the spatial frequency domains in a controlled manner. To multiplex, images are independently encrypted with different phase keys and then superimposed by recording sequentially on the same material. Each image is extracted by using the particular key associated with it. During decryption the energy from the other images is further spread, making it possible to minimize its effects by using suitable filters. Wigner analysis is applied to the technique, and numerical results are presented.

DSEARCH: sensitive database searching using distributed computing.

UNLABELLED: We present a distributed and fully cross-platform database search program that allows the user to utilize the idle clock cycles of machines to perform large searches using the most sensitive algorithms. For those in an academic or corporate environment with hundreds of idle desktop machines, DSEARCH can deliver a 'free' database search supercomputer. AVAILABILITY: The software is publicly available under the GNU general public licence from http://www.cs.may.ie/distributed CONTACT: tom.naughton@may.ie SUPPLEMENTARY INFORMATION: Full documentation and a user manual is available from http://www.cs.may.ie/distributed.

DPRml: distributed phylogeny reconstruction by maximum likelihood.

MOTIVATION: In recent years there has been increased interest in producing large and accurate phylogenetic trees using statistical approaches. However for a large number of taxa, it is not feasible to construct large and accurate trees using only a single processor. A number of specialized parallel programs have been produced in an attempt to address the huge computational requirements of maximum likelihood. We express a number of concerns about the current set of parallel phylogenetic programs which are currently severely limiting the widespread availability and use of parallel computing in maximum likelihood-based phylogenetic analysis. RESULTS: We have identified the suitability of phylogenetic analysis to large-scale heterogeneous distributed computing. We have completed a distributed and fully cross-platform phylogenetic tree building program called distributed phylogeny reconstruction by maximum likelihood. It uses an already proven maximum likelihood-based tree building algorithm and a popular phylogenetic analysis library for all its likelihood calculations. It offers one of the most extensive sets of DNA substitution models currently available. We are the first, to our knowledge, to report the completion of a distributed phylogenetic tree building program that can achieve near-linear speedup while only using the idle clock cycles of machines. For those in an academic or corporate environment with hundreds of idle desktop machines, we have shown how distributed computing can deliver a 'free' ML supercomputer.