Efficient reconstruction from non-uniform point sets

We propose a method for non-uniform reconstruction of 3D scalar data. Typically, radial basis functions, trigonometric polynomials or shift-invariant functions are used in the functional approximation of 3D data. We adopt a variational approach for the reconstruction and rendering of 3D data. The principle idea is based on data fitting via thin-plate splines. An approximation by B-splines offers more compact support for fast reconstruction. We adopt this method for large datasets by introducing a block-based reconstruction approach. This makes the method practical for large datasets. Our reconstruction will be smooth across blocks. We give reconstruction measurements as error estimations based on different parameter settings and also an insight on the computational effort. We show that the block size used in reconstruction has a negligible effect on the reconstruction error. Finally we show rendering results to emphasize the quality of this 3D reconstruction technique.     

Simulating Ramsey-Type Fringes in a Pulsed Microwave-Driven Classical Josephson Junction

We present evidence for a close analogy between the nonlinear behaviour of a pulsed microwave-driven Josephson junction at low temperature and the experimentally observed behaviour of Josephson systems operated below the quantum transition temperature under similar conditions. We specifically address observations of Ramsey-type fringe oscillations, which can be understood in classical nonlinear dynamics as results of slow transient oscillations in a pulsed microwave environment. Simulations are conducted to mimic experimental measurements by recording the statistics of microwave-induced escape events from the anharmonic potential well of a zero-voltage state. Observations consistent with experimentally obtained Ramsey-type oscillations are found in the classical model. An erratum to this article can be found at     

A questionnaire study among 171 medical candidates enrolled in a PhD program. Three elements in the PhD education: supervision, research courses and international relations

One hundred and seventy-one medical doctors (median age 34 years) registered as Ph.D.-students at the Medical Faculty, University of Aarhus, were given a questionnaire concerning the Ph.D-program (91% reply rate). The Ph.D.-students had typically graduated four years before enrollment and had gained basic clinical experience. Eighty-four percent had been involved in research projects prior to their formal research education. In general, the Ph.D.-students found the supervision offered by senior researchers adequate, although, more Ph.D.-students in clinical than in preclinical departments would have liked their main supervisor to be more enthusiastic and have more specific expertise. By tradition, the Medical Faculty in Aarhus offers a broad introductory course on research methodology, this was appreciated by the Ph.D.-students. However, they found that too much time was allocated for this purpose. The Ministry of Education recommends that Ph.D.-students gain experience from international collaboration, preferably from a stay abroad. However, only 24% of Ph.D.-students had stayed at an international collaborating institution. Although the overall evaluation of the medical Ph.d.-program was positive, the Ph.D.-students pointed out weaknesses and conflicts requiring adjustment.     

The Dübendorf Study: a population-based investigation on normal values of blood pressure self-measurement

In a retrospective study of 50 consecutive children with posterior fossa tumors treated at Texas Children's Hospital, Houston, Tex., in 1989-1992, we evaluated perioperative factors which might influence the development of postoperative cerebrospinal fluid leaks. Factors analyzed included the presence of preoperative hydrocephalus, the institution of cerebrospinal fluid diversion, and the method of dural closure. No statistically significant impact on subsequent cerebrospinal fluid leakage was demonstrated.     

Provably correct and complete transaction rules for updating 3D city models

The shapes of our cities change very frequently. These changes have to be reflected in data sets representing urban objects. However, it must be assured that frequent updates do not affect geometric-topological consistency. This important aspect of spatial data quality guarantees essential assumptions on which users and applications of 3D city models rely: viz. that objects do not intersect, overlap or penetrate mutually, or completely cover one another. This raises the question how to guarantee that geometric-topological consistency is preserved when data sets are updated. Hence, there is a certain risk that plans and decisions which are based on these data sets are erroneous and that the tremendous efforts spent for data acquisition and updates become vain. In this paper, we solve this problem by presenting efficient transaction rules for updating 3D city models. These rules guarantee that geometric-topological consistency is preserved (Safety) and allow for the generation of arbitrary consistent 3D city models (Completeness). Safety as well as completeness is proven with mathematical rigor, guaranteeing the reliability of our method. Our method is applicable to 3D city models, which define—besides the terrain surface—complex spatial objects like buildings with rooms and storeys as interior structures, as well as bridges and tunnels. Those objects are represented as aggregations of solids, and their surfaces are complex from a topology point of view. 3D GIS models like CityGML, which are widely used to represent cities, provide the means to define semantics, geometry and topology, but do not address the problem of maintaining consistency. Hence, our approach complements CityGML.     

Boosting MUC extraction in unsatisfiable constraint networks

One very fertile domain of applied Artificial Intelligence is constraint solving technologies. Especially, constraint networks that concern problems that can be represented using discrete variables, together with constraints on allowed instantiation values for these variables. Every solution to a constraint network must satisfy every constraint. When no solution exists, the user might want to know the actual reasons leading to the absence of global solution. In this respect, extracting mucs (Minimal Unsatisfiable Cores) from an unsatisfiable constraint network is a useful process when causes of unsatisfiability must be understood so that the network can be re-engineered and relaxed to become satisfiable. Despite bad worst-case computational complexity results, various muc-finding approaches that appear tractable for many real-life instances have been proposed. Many of them are based on the successive identification of so-called transition constraints. In this respect, we show how local search can be used to possibly extract additional transition constraints at each main iteration step. In the general constraint networks setting, the approach is shown to outperform a technique based on a form of model rotation imported from the sat-related technology and that also exhibits additional transition constraints. Our extensive computational experimentations show that this enhancement also boosts the performance of state-of-the-art DC(WCORE)-like MUC extractors.     

Towards an Unbiased Comparison of CC,BCC, and FCC Lattices in Terms of Prealiasing

In the literature on optimal regular volume sampling, the Body‐Centered Cubic (BCC) lattice has been proven to be optimal for sampling spherically band‐limited signals above the Nyquist limit. On the other hand, if the sampling frequency is below the Nyquist limit, the Face‐Centered Cubic (FCC) lattice was demonstrated to be optimal in reducing the prealiasing effect. In this paper, we confirm that the FCC lattice is indeed optimal in this sense in a certain interval of the sampling frequency. By theoretically estimating the prealiasing error in a realistic range of the sampling frequency, we show that in other frequency intervals, the BCC lattice and even the traditional Cartesian Cubic (CC) lattice are expected to minimize the prealiasing. The BCC lattice is superior over the FCC lattice if the sampling frequency is not significantly below the Nyquist limit. Interestingly, if the original signal is drastically undersampled, the CC lattice is expected to provide the lowest prealiasing error. Additionally, we give a comprehensible clarification that the sampling efficiency of the FCC lattice is lower than that of the BCC lattice. Although this is a well‐known fact, the exact percentage has been erroneously reported in the literature. Furthermore, for the sake of an unbiased comparison, we propose to rotate the Marschner‐Lobb test signal such that an undue advantage is not given to either lattice.