Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class of commonly encountered computations whose \natural" speciica-tion is essentially sequential, and show how algebraic properties of the operators involved can be used to transform them into divide-and-conquer programs th...

Optimism is a powerful technique for increasing concurrency. A program can gain concurrency by making an optimistic assumption about its future state, and verifying the assumption in parallel with computations based on the optimistic assumption. To date, use of optimism has been restricted to specialized systems due to the diiculty of writing optimistic programs. In this paper, we deene and jus...

Galilean invariance is one of the key requirements of many physical models adopted in theoretical and computational mechanics. Spurred by recent research developments in shock hydrodynamics computations [13], a detailed analysis on the principle of Galilean invariance in the context of SUPG operators is presented. It was observed in [13] that lack of Galilean invariance can yield catastrophic i...

We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The theory admits deterministic and nondeterministic polynomial time recognizable problems. We prove that P is not NP in this theory if and only if P is not NP in th...

We study how the underlying graph of dependencies of one dimensional cellular automaton may be used in order to move and compose areas of computations. This allows us to deene complex cellular automata, relaxing in some way the inherent synchronism of such networks. and asynchronous computations. R esum e Nous etudions comment le graphe sous-jacent de d ependances d'un automate cellulaire de di...

1: Ampyra (fampridine SR) Lancet. 2009 Feb 28;373(9665):732-8. Sustained-release oral fampridine in multiple sclerosis: a randomised, double-blind, controlled trial. Goodman AD, Brown TR, Krupp LB, Schapiro RT, Schwid SR, Cohen R, Marinucci LN, Blight AR; Fampridine MS-F203 Investigators. Collaborators: Agius M, Arnason BG, Bethoux FA, Bever CT Jr, Bowen JD, Brown TR, Dietrich DW, Edwards K, Fr...

In this paper we present the design of a full encryptor/decryptor core for AES algorithm which fits in single-chip FPGA. Our design performs encryption, decryption and key scheduling. To increase performance, a pipelined architecture is being proposed. In addition, several modifications to standard AES algorithm’s formulations have introduced that allow us to obtain a significant reduction in t...