Interconnection networks arranged as k-ary n-trees or spines are widely used to build highperformance computing clusters. Current blade-based technology allows the integration of the first level of the network together with the compute elements. The remaining network stages require dedicated rack space. In most systems one or several racks house the upper network stages, separated from the comp...

28 Several Planktothrix strains, each producing a distinct oligopeptide profile, have been 29 shown to coexist within Lake Steinsfjorden (Norway). Using nonribosomal peptide 30 synthetase genes (NRPS) as markers, it has been shown that the Planktothrix community 31 comprises distinct genetic variants displaying differences in bloom dynamics, suggesting a 32 Planktothrix subpopulation structure....

The Arrow protocol is a simple and elegant protocol to coordinate exclusive access to a shared object in a network. The protocol solves the underlying distributed queueing problem by using path reversal on a pre-computed spanning tree (or any other tree topology simulated on top of the given network). It is known that the Arrow protocol solves the problem with a competitive ratio of O(logD) on ...

Several Planktothrix strains, each producing a distinct oligopeptide profile, have been shown to coexist within Lake Steinsfjorden (Norway). Using nonribosomal peptide synthetase (NRPS) genes as markers, it has been shown that the Planktothrix community comprises distinct genetic variants displaying differences in bloom dynamics, suggesting a Planktothrix subpopulation structure. Here, we inves...

W e present an optimal parallel algorithm t o construct the well-separated pair decomposition of a point set P in Zd. W e show how this leads to a deterministic opt imal O(1ogn) t ime parallel algorithm for finding the k nearest neighbors of each point in P, where k is a constant. W e discuss several additional applications of the well-separated pair decomposition for which we can derive fas t ...

Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs can be computed in polynomial time.

Zusammenfassung. Eine wichtige Frage in der mobilen Robotik ist die sichere Navigation in unbekannten Umgebungen unter der Anwendung preiswerter Sensorik. Solch eine Navigation kann ein künstliches Neuronales Netz (kNN) übernehmen, welches die Kopplung der Sensoren des Roboters mit dessen Antriebssystem herstellt. ” Neuro Evolution of Augmenting Topologies“ (NEAT) von Stanley und Miikkulainen [...

In this paper we present a novel method, called Evolutionary Acquisition of Neural Topologies (EANT), of evolving the structure and weights of neural networks. The method introduces an efficient and compact genetic encoding of a neural network onto a linear genome that enables one to evaluate the network without decoding it. The method explores new structures whenever it is not possible to furt...