Motion Planning with Pulley, Rope, and Baskets

We study a motion planning problem where items have to be transported from the top room of a tower to the bottom of the tower, while simultaneously other items have to be transported in the opposite direction. Item sets are moved in two baskets hanging on a rope and pulley. To guarantee stability of the system, the weight difference between the contents of the two baskets must always stay below a given threshold. We prove that it is $\varPi_{2}^{p}$ -complete to decide whether some given initial situation of the underlying discrete system can lead to a given goal situation. Furthermore we identify several polynomially solvable special cases of this reachability problem, and we also settle the computational complexity of a number of related questions.     

A parallel,load-balanced MHD code on locally-adapted,unstructured grids in 3d

An efficient parallel code for the approximate solution of initial boundary value problems for hyperbolic balance laws is introduced. The method combines three modern numerical techniques: locally-adaptive upwind finite-volume methods on unstructured grids, parallelization based on non-overlapping domain decomposition, and dynamic load balancing. Key ingredient is a hierarchical mesh in three space dimensions.The proposed method is applied to the equations of compressible magnetohydrodynamics (MHD). Results for several testproblems with computable exact solution and for a realistic astrophysical simulation are shown.     

Dynamic subset selection based on a fitness case topology

A large training set of fitness cases can critically slow down genetic programming, if no appropriate subset selection method is applied. Such a method allows an individual to be evaluated on a smaller subset of fitness cases. In this paper we suggest a new subset selection method that takes the problem structure into account, while being problem independent at the same time. In order to achieve this, information about the problem structure is acquired during evolutionary search by creating a topology (relationship) on the set of fitness cases. The topology is induced by individuals of the evolving population. This is done by increasing the strength of the relation between two fitness cases, if an individual of the population is able to solve both of them. Our new topology-based subset selection method chooses a subset, such that fitness cases in this subset are as distantly related as is possible with respect to the induced topology. We compare topology-based selection of fitness cases with dynamic subset selection and stochastic subset sampling on four different problems. On average, runs with topology-based selection show faster progress than the others.     

Reconstruction of volume data with quadratic super splines

We propose a new approach to reconstruct nondiscrete models from gridded volume samples. As a model, we use quadratic trivariate super splines on a uniform tetrahedral partition. We discuss the smoothness and approximation properties of our model and compare to alternative piecewise polynomial constructions. We observe, as a nonstandard phenomenon, that the derivatives of our splines yield optimal approximation order for smooth data, while the theoretical error of the values is nearly optimal due to the averaging rules. Our approach enables efficient reconstruction and visualization of the data. As the piecewise polynomials are of the lowest possible total degree two, we can efficiently determine exact ray intersections with an isosurface for ray-casting. Moreover, the optimal approximation properties of the derivatives allow us to simply sample the necessary gradients directly from the polynomial pieces of the splines. Our results confirm the efficiency of the quasi-interpolating method and demonstrate high visual quality for rendered isosurfaces.     

Visualization of vector fields using seed LIC and volume rendering

Line integral convolution (LIC) is a powerful texture-based technique for visualizing vector fields. Due to the high computational expense of generating 3D textures and the difficulties of effectively displaying the result, LIC has most commonly been used to depict vector fields in 2D or over a surface in 3D. We propose new methods for more effective volume visualization of three-dimensional vector fields using LIC: 1) we present a fast method for computing volume LIC textures that exploits the sparsity of the input texture. 2) We propose the use of a shading technique, called limb darkening, to reveal the depth relations among the field lines. The shading effect is obtained simply by using appropriate transfer functions and, therefore, avoids using expensive shading techniques. 3) We demonstrate how two-field visualization techniques can be used to enhance the visual information describing a vector field. The volume LIC textures are rendered using texture-based rendering techniques, which allows interactive exploration of a vector field.     

View-based propagator derivation

When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear constraints both with unit and non-unit coefficients? Constraint variants are ubiquitous: implementing them requires considerable (if not prohibitive) effort and decreases maintainability, but will deliver better performance than resorting to constraint decomposition. This paper shows how to use views to derive propagator variants, combining the efficiency of dedicated propagator implementations with the simplicity and effortlessness of decomposition. A model for views and derived propagators is introduced. Derived propagators are proved to be perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators such as transformation, generalization, specialization, and type conversion are developed. The paper introduces an implementation architecture for views that is independent of the underlying constraint programming system. A detailed evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained.     

Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field

We present a new method for blind document bleed-through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate priors are derived from the full graph. The segmentation algorithm is based on Bayesian Maximum a Posteriori (MAP) estimation. The advantages of this separate approach are the adaptation of the prior to the contents creation process (e.g., superimposing two handwritten pages), and the improvement of the estimation of the recto pixels through an estimation of the verso pixels covered by recto pixels; moreover, the formulation as a binary labeling problem with two hidden labels per pixels naturally leads to an efficient optimization method based on the minimum cut/maximum flow in a graph. The proposed method is evaluated on scanned document images from the 18th century, showing an improvement of character recognition results compared to other restoration methods.     

A novel control solution for improved trajectory tracking and LVRT performance in DFIG-based wind turbines

This paper presents a new control strategy for the rotor side converter of Doubly-Fed Induction Generator based Wind Turbine systems, under severe voltage dips. The main goal is to fulfill the Low Voltage Ride Through performance, required by modern grid codes. In this respect, the key point is to limit oscillations (particularly on rotor currents) triggered by line faults, so that the system keeps operating with graceful behavior. To this aim, a suitable feedforward-feedback control solution is proposed for the DFIG rotor side. The feedforward part exploits oscillation-free reference trajectories, analytically derived for the system internal dynamics. State feedback, designed accounting for control voltage limits, endows the system with robustness and further tame oscillations during faults. Moreover, improved torque and stator reactive power tracking during faults is achieved, proposing an exact mapping between such quantities and rotor-side currents, which are conventionally used as controlled outputs. Numerical simulations are provided to validate the capability of the proposed approach to effectively cope with harsh faults.     

Evolution of Business Documents Based on UN/CEFACT's Core Components

Standardized business documents are a prerequisite for successful information exchange in electronic business transactions. The United Nations Centre for Trade Facilitation and eBusiness (UN/CEFACT) provides a conceptual modeling approach, called Core Components, used by Business Partners (BPs) for defining business document models (BDMs). BDMs are essential for defining service interfaces in service-oriented systems. However, in such a highly dynamic environment with ever-changing market demands, BPs are confronted with the need to revise their BDMs resulting in a multitude of different versions. BPs may dictate the use of new versions of BDMs, but small- and medium-sized enterprises (SMEs) may not always adopt new BDM versions due to the cost and effort involved, inhibiting automated electronic information exchange. In this article, we propose a framework including (i) a classification of the impact of changes in BDMs, (ii) evolution templates for the automated transformation of business documents between different BDM versions, and (iii) mitigation strategies for evolutions where fully-automated and semantic-preserving transformations are not feasible. Having such a framework at hand provides SMEs with a low-cost and light-weight approach for dealing with evolving market requirements and hence evolving business documents. Finally, we analyze the evolution of UN/CEFACT''s Cross Industry Invoice which has been mandated to be used for electronic invoicing within the European Union as well as present a critical discussion of the evolution templates defined.