ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP which is based on BSP and is introduced here. ParLeda uses two main libr...

Measurement of high-power proton beam-halo formation is the ongoing scientific experiment for the Low Energy Demonstration Accelerator (LEDA) facility. To attain this measurement goal, a 52-magnet beam line containing several types of beam diagnostic instrumentation is being installed. The Experimental Physics and Industrial Control System (EPICS) and commercial software applications are presen...

The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It consists of C++ classes and is built on top of the library of efficient data types and algorithms LEDA; an optional add-on to AGD requires ABACUS, a framework for the implementation of branch-and-c...

We report on a software library of dynamic graph algorithms. It was written in C++ as an extension of LEDA, the library of eecient data types and algorithms. It contains implementations of simple data structures as well as of sophisticated data structures for dynamic connectivity, dynamic minimum spanning trees, dynamic single source shortest paths, and dynamic transitive closure. All data stru...

I discuss two types of evidential problems with the most widely touted experiments in evolutionary psychology, those performed by Leda Cosmides and interpreted by Cosmides and John Tooby. First, and despite Cosmides and Tooby’s claims to the contrary, these experiments don’t fulfil the standards of evidence of evolutionary biology. Second Cosmides and Tooby claim to have performed a crucial exp...

We formally prove the correctness of the time super-e cient result checker for priority queues, which is implemented in LEDA [17]. A priority queue is a data structure that supports insertion, deletion and retrieval of the minimal element, relative to some order. A result checker for priority queues is a data structure that monitors the input and output of the priority queue. Whenever the user ...

We present a new approach to the distributed visualization of geometric algorithms that emphasizes the position of the end user. Concepts are introduced that enable a more ex-ible usage of visualized geometric algorithms, while keeping the task of adapting existing algorithms to the new scheme as simple as possible. A main proposition is that interactivity should not be built into the visualize...

Measurement of high-power proton beam-halo formation is the ongoing scientific experiment for the Low Energy Demonstration Accelerator (LEDA) facility. To attain this measurement goal, a 52-magnet beam line containing several types of beam diagnostic instrumentation is being installed. The Experimental Physics and Industrial Control System (EPICS) and commercial software applications are presen...