This preliminary report presents recent experience with the Senning operation for transposition of the great arteries. Reasons are given why the traditional Mustard procedure was abandoned in favour of the Senning operation. Technical details are presented and the advantages and disadvantages of the procedure are discussed.

The connection between architecture and science and sound based on mathematical relations has continued to develop[ since the rise of the Western classical civilization that originated in Ancient Greece. The mysterious Pythagorean cosmology pursued as secret esoteric knowledge was related to the search of rhythm, proportionality and harmony. Even somewhat earlier, Greek mysteries were based on ...

The CM-2 is an example of a connection machine. The strengths and problems of this implementation are considered. Then important issues in the architecture and programming environment of connection machines in general are considered. These are contrasted with the same issues in MD multiprocessors and multicomputers.

At this conference many interesting talks were presented on the plausible existence of Quark Stars. Other talks dealt with the exotic new phases of quark matter at very high density. Here, I show how combining these two elements might offer a new way of tackling the Gamma Ray Burst puzzle.

Computations in geographic space are necessarily based on discrete versions of space, but much of the existing work on the foundations of GIS assumes a continuous infinitely divisible space. This is true both of quantitative approaches, using R, and qualitative approaches using systems such as the Region-Connection Calculus (RCC). This paper shows how the RCC can be modified so as to permit dis...

An arc-colored digraph D is properly (properly-walk) connected if, for any ordered pair of vertices (u,v), the contains a directed path (a walk) from u to v such that arcs adjacent on (on have distinct colors. The proper connection number pc→(D) (the proper-walk wc→(D)) minimum colours make (properly-walk connected). We prove pc→(Cn(S))≤2 every circulant Cn(S) with S⊆{1,…,n−1},|S|≥2 and 1∈S. Fu...