GPU-based real-time approximation of the ablation zone for radiofrequency ablation

Percutaneous radiofrequency ablation (RFA) is becoming a standard minimally invasive clinical procedure for the treatment of liver tumors. However, planning the applicator placement such that the malignant tissue is completely destroyed, is a demanding task that requires considerable experience. In this work, we present a fast GPU-based real-time approximation of the ablation zone incorporating the cooling effect of liver vessels. Weighted distance fields of varying RF applicator types are derived from complex numerical simulations to allow a fast estimation of the ablation zone. Furthermore, the heat-sink effect of the cooling blood flow close to the applicator's electrode is estimated by means of a preprocessed thermal equilibrium representation of the liver parenchyma and blood vessels. Utilizing the graphics card, the weighted distance field incorporating the cooling blood flow is calculated using a modular shader framework, which facilitates the real-time visualization of the ablation zone in projected slice views and in volume rendering. The proposed methods are integrated in our software assistant prototype for planning RFA therapy. The software allows the physician to interactively place virtual RF applicator models. The real-time visualization of the corresponding approximated ablation zone facilitates interactive evaluation of the tumor coverage in order to optimize the applicator's placement such that all cancer cells are destroyed by the ablation.     

A type-centric framework for specifying heterogeneous, large-scale, component-oriented, architectures

Maintaining integrity and consistency, and effecting conformance in architectures of large-scale systems require specification and enforcement of many different forms of structural constraints. While type systems have proved effective for enforcing structural constraints in programs and data structures, most architectural modeling frameworks include only weak notions of typing or rely on first order logic constraint languages that have steep learning curves associated with them and that become unwieldy when scaling to large systems.We present the Cadena Architecture Language with Meta-modeling (CALM) — that uses multi-level type systems to specify and enforce a variety of architectural constraints relevant to the development of large-scale component-based systems. Cadena is a robust and extensible tool that has been used to specify a number of industrial strength component models and applied in multiple industrial research projects on model-driven development and software product lines.     

Verification and falsification of programs with loops using predicate abstraction

Predicate abstraction is a major abstraction technique for the verification of software. Data is abstracted by means of Boolean variables, which keep track of predicates over the data. In many cases, predicate abstraction suffers from the need for at least one predicate for each iteration of a loop construct in the program. We propose to extract looping counterexamples from the abstract model, and to parametrise the simulation instance in the number of loop iterations. We present a novel technique that speeds up the detection of long counterexamples as well as the verification of programs with loops.     

Characterization of terrestrial water dynamics in the Congo Basin using GRACE and satellite radar altimetry

The Congo Basin is the world's third largest in size (~ 3.7 million km²), and second only to the Amazon River in discharge (~ 40,200 m³ s^− 1 annual average). However, the hydrological dynamics of seasonally flooded wetlands and floodplains remains poorly quantified. Here, we separate the Congo wetland into four 3° × 3° regions, and use remote sensing measurements (i.e., GRACE, satellite radar altimeter, GPCP, JERS-1, SRTM, and MODIS) to estimate the amounts of water filling and draining from the Congo wetland, and to determine the source of the water. We find that the amount of water annually filling and draining the Congo wetlands is 111 km³, which is about one-third the size of the water volumes found on the mainstem Amazon floodplain. Based on amplitude comparisons among the water volume changes and timing comparisons among their fluxes, we conclude that the local upland runoff is the main source of the Congo wetland water, not the fluvial process of river-floodplain water exchange as in the Amazon. Our hydraulic analysis using altimeter measurements also supports our conclusion by demonstrating that water surface elevations in the wetlands are consistently higher than the adjacent river water levels. Our research highlights differences in the hydrology and hydrodynamics between the Congo wetland and the mainstem Amazon floodplain.     

Interactive volume exploration for feature detection and quantification in industrial CT data

This paper presents a novel method for interactive exploration of industrial CT volumes such as cast metal parts, with the goal of interactively detecting, classifying, and quantifying features using a visualization-driven approach. The standard approach for defect detection builds on region growing, which requires manually tuning parameters such as target ranges for density and size, variance, as well as the specification of seed points. If the results are not satisfactory, region growing must be performed again with different parameters. In contrast, our method allows interactive exploration of the parameter space, completely separated from region growing in an unattended pre-processing stage. The pre-computed feature volume tracks a feature size curve for each voxel over time, which is identified with the main region growing parameter such as variance. A novel 3D transfer function domain over (density, feature size, time) allows for interactive exploration of feature classes. Features and feature size curves can also be explored individually, which helps with transfer function specification and allows coloring individual features and disabling features resulting from CT artifacts. Based on the classification obtained through exploration, the classified features can be quantified immediately.     

On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata

The study of the computational power of randomized computations is one of the central tasks of complexity theory. The main goal of this paper is the comparison of the power of Las Vegas computation and deterministic respectively nondeterministic computation. We investigate the power of Las Vegas computation for the complexity measures of one-way communication, ordered binary decision diagrams, and finite automata.(i) For the one-way communication complexity of two-party protocols we show that Las Vegas communication can save at most one half of the deterministic one-way communication complexity. We also present a language for which this gap is tight.(ii) The result (i) is applied to show an at most polynomial gap between determinism and Las Vegas for ordered binary decision diagrams.(iii) For the size (i.e., the number of states) of finite automata we show that the size of Las Vegas finite automata recognizing a language L is at least the square root of the size of the minimal deterministic finite automaton recognizing L. Using a specific language we verify the optimality of this lower bound.     

Bücherschau

Ohne Zusammenfassung     

Electrical reflection coefficient and velocity shift for groove gratings

The electrical reflection coefficient r(e) and velocity shift (Deltanu/nu)(e) for grooves has never been formulated. All previous calculations for r(e) and (Deltanu/nu)(e) have used formulas valid for the reflection of a surface acoustic wave (SAW) from an array of conducting strips. However, the discontinuity in electrical boundary conditions leading to these formulas does not exist in groove gratings. A new expression for the electrical reflection coefficient and velocity shift for some material overlays is derived from both the variational principle and perturbation theory. The results for various substrates are compared to show the agreement between the two approaches. The implications of this new formulation for the design of grooved arrays on various materials are discussed, effectively resolving the discrepancy between theory and experiment.     

Ontological query answering under expressive Entity-Relationship schemata

The Entity-Relationship (ER) model is a fundamental tool for database design, recently extended and employed in knowledge representation and reasoning due to its expressiveness and comprehensibility. We address the problem of answering conjunctive queries under constraints representing schemata expressed in an extended version of the Entity-Relationship model. This extended model, called ER⁺, comprises is-a constraints among entities and relationships, plus functional and mandatory participation constraints. In particular, it allows for arbitrary permutations of the roles in is-a among relationships. A key notion that ensures high tractability in ER⁺ schemata is separability, i.e., the absence of interaction between the functional participation constraints and the other constructs of ER⁺. We provide a precise syntactic characterization of separable ER⁺ schemata by means of a necessary and sufficient condition. We present a complete complexity analysis of the conjunctive query answering problem under separable ER⁺ schemata, and also under several sublanguages of ER⁺. We show that the addition of so-called negative constraints does not increase the complexity of query answering. With such constraints, our model properly generalizes the most widely adopted tractable ontology languages, including those in the DL-Lite family.