A sorter-based architecture for a parallel implementation of communication intensive algorithms

This paper deals with the parallel execution of algorithms with global and/or irregular data dependencies on a regularly and locally connected processor array. The associated communication problems are solved by the use of a two-dimensional sorting algorithm. The proposed architecture, which is based on a two-dimensional sorting network, offers a high degree of flexibility and allows an efficient mapping of many irregularly structured algorithms. In this architecture a one-dimensional processor array performs all required control and arithmetic operations, whereas the sorter solves complex data transfer problems. The storage capability of the sorting network is also used as memory for data elements. The algorithms for sparse matrix computations, fast Fourier transformation and for the convex hull problem, which are mapped onto this architecture, as well as the simulation of a shared-memory computer show that the utilization of the most complex components, the processors, is O(1).     

Fluorescence of poly(di-n-alkylsilane)s in room-temperature solution

A comprehensive study of the electronic absorption and emission spectra and the fluorescence quantum yield and lifetime of seven poly(di-n-alkylsilane)s and of three isotopically labelled poly(di-n-hexylsilane)s in hydrocarbon solution at room temperature is reported. Also reported are fluorescence polarization and carbon tetrachloride quenching of fluorescence of poly(di-n-hexylsilane). The observed fluorescence spectra, quantum yield, and polarization depend on the selected excitation energy in a very characteristic fashion, whereas the fluorescence lifetime does not; however, it depends on the selected emission energy. These characteristic dependencies are qualitatively accounted for by the previously proposed segment distribution model if one assumes that the photophysical behavior at higher excitation energies is strongly affected by the presence of a low-lying weakly allowed state in short-segment chromophores and the behavior at lower excitation energies is dictated by the selective excitation of emitting long-segment chromophores.     

Coding of watershed and river hierarchy to support GIS-based hydrological analyses at different scales

A procedure is presented to automatically assign a modified Pfafstetter code to a stream network and its associated watersheds. The first step is to build a topological network according to the object-oriented Arc Hydro framework definition in ArcGIS. These network relations are then mapped into a code that fully represents the stream hierarchy of a basin in a single attribute. Its use does not depend on ArcGIS object orientation and facilitates simple hierarchical aggregation and querying using only the attribute tables of shapefile versions of the stream network and watershed datasets. The code was implemented for the whole of Austria to support the flexible presentation and user-defined aggregation of water balance results in the digital version of the Hydrological Atlas of Austria.     

Constructive Membership Predicates as Index Types

In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of type T) in structure S, (x_TS) can not, in general, index all parts of a structure S and we generalize to a form ρS where ρ is a predicate over S. Under this scheme, (λx.True)S is the set of all indexes into S, but we show that not all subsets of indexes are expressible by strictly local predicates. Accordingly, we extend our membership predicates to predicates that retain state “from above” as well as allow “looking below”. Predicates of this form are complete in the sense that they can express every subset of indexes in S. These ideas are motivated by experience programming in Nuprl's constructive type theory and examining the constructive content of mechanically checked formal proofs involving membership predicates.