Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for efficient implementations of DFS-based graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speed-ups by a factor of two to three compared to the implementations provided by LEDA and BOOST. We have obtained similar ...

EEciency, exibility, and ease of use are desirable goals in library design. However, these goals seem to contradict each other. The Library of Ecient Algorithms and Data Structures (LEDA) focuses on eeciency and ease of use. On the other hand, we have developed concepts for the implementation of algorithms which focus on eeciency and exibility. In this paper, we present a possible combination o...

Wireless Body Area Networks (WBANs) can provide real-time and reliable health monitoring, attributing to the human-centered and sensor interoperability properties. WBANs have become a key component of the ubiquitous eHealth (electronic health) revolution that prospers on the basis of information and communication technologies. The prime consideration in WBAN is how to maximize the network lifet...

The LEDA RFQ is a 350-MHz continuous-wave (CW) radio-frequency quadrupole linac. LEDA is the low energy demonstration accelerator, a full power front-end prototype for the accelerator production of tritium (APT) linac. This machine has accelerated a 100-mA CW proton beam from 75 keV to 6.7 MeV. The 8-m-long RFQ accepts a dc, 75–keV, ~110-mA H beam from the LEDA injector, bunches the beam, and a...

Beam diagnostic instrumentation is being developed for the LEDA, a 6.7-MeV, 100-mA-cw proton accelerator, presently being commissioned at the Los Alamos National Laboratory (LANL). This instrumentation will be the basis for much of the Accelerator Production of Tritium and the Spallation Neutron Source linac. Located in the LEDA injector and the high energy beam transport (HEBT) this initial in...

We introduce a new and simple filtering technique that can be used in the implementation of geometric algorithms called “structural filtering”. Using this filtering technique we gain about 20% when compared to predicatefiltered implementations. Of theoretical interest are some results regarding the robustness of sorting algorithms against erroneous comparisons. There is software support for the...