Tight analysis of the (1+1)-EA for the single source shortest path problem

We conduct a rigorous analysis of the (1+1) evolutionary algorithm for the single source shortest path problem proposed by Scharnow, Tinnefeld, and Wegener (The analyses of evolutionary algorithms on sorting and shortest paths problems, 2004, Journal of Mathematical Modelling and Algorithms, 3(4):349-366). We prove that with high probability, the optimization time is O(n2 max{?, log(n)}), where ? is the smallest integer such that any vertex can be reached from the source via a shortest path having at most ? edges. This bound is tight. For all values of n and ? we provide a graph with edge weights such that, with high probability, the optimization time is of order Ω(n2 max{?, log(n)}). To obtain such sharp bounds, we develop a new technique that overcomes the coupon collector behavior of previously used arguments. Also, we exhibit a simple Chernoff type inequality for sums of independent geometrically distributed random variables, and one for sequences of random variables that are not independent, but show a desired behavior independent of the outcomes of the previous random variables. We are optimistic that these tools find further applications in the analysis of evolutionary algorithms.     

More on graph theoretic software watermarks: Implementation,analysis, and attacks

This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, Pittsburgh, PA, 2001]. An executable program is marked by the addition of code for which the topology of the control-flow graph encodes a watermark. We discuss issues that were identified during construction of an actual implementation that operates on Java bytecode. We present two algorithms for splitting a watermark number into a redundant set of pieces and an algorithm for turning a watermark number into a control-flow graph. We measure the size and time overhead of watermarking, and evaluate the algorithm against a variety of attacks.     

Deformation models for image recognition

We present the application of different nonlinear image deformation models to the task of image recognition. The deformation models are especially suited for local changes as they often occur in the presence of image object variability. We show that, among the discussed models, there is one approach that combines simplicity of implementation, low-computational complexity, and highly competitive performance across various real-world image recognition tasks. We show experimentally that the model performs very well for four different handwritten digit recognition tasks and for the classification of medical images, thus showing high generalization capacity. In particular, an error rate of 0.54 percent on the MNIST benchmark is achieved, as well as the lowest reported error rate, specifically 12.6 percent, in the 2005 international ImageCLEF evaluation of medical image specifically categorization.     

Coordination components for collaborative virtual environments

This paper deals with the behavior of virtual environments from the collaboration point-of-view, in which actors (human or virtual beings) interact and collaborate by means of interdependent tasks. In this sense, actors may realize tasks that are dependent on tasks performed by other actors, while the interdependencies between tasks (through resource management and temporal relations) delineate the overall behavior of a virtual environment. Our main goal is to propose an approach for the coordination of those behaviors. Initially a generic study of possible interdependencies between collaborative tasks is presented, followed by the formal modeling (using Petri Nets) of coordination mechanisms for those dependencies. In order to implement such mechanisms, an architecture of reusable and pluggable coordination components is also introduced. These components are used in an implementation of a multi-user videogame. The presented approach is a concrete step to create virtual societies of actors that collaborate to reach common goals without the risk of getting involved in conflicting or repetitive tasks.     

Einleitung und Abbruch der künstlichen Ernährung beim einwilligungsunfähigen Patienten

Definition of the problem: In Austria the legal discussion on initiating and withdrawing artificial nutrition in incompetent patients has just begun. Arguments and conclusion: Legal regulations are lacking, but there appears to be agreement on accepting advance directives under specific criteria. This would mean that a presumed will and documented refusal of treatment and nutrition has to be respected by physicians. However, there is no consensus with regard to the “supposed will” of an incompetent patient to refuse treatment and nutrition. At present, surrogate decision making with regard to refusing life-sustaining treatment or nutrition is only accepted according to a declared and documented directive of the patient himself. When the patient’s will has to be “surmised” the protection of life has priority. In Austria this concept is based on the national constitution and its duty to protect life.     

Metal‐containing Polymers via Electropolymerization

Electropolymerization represents a suitable and well‐established approach for the assembly of polymer structures, in particular with regard to the formation of thin, insoluble films. Utilization of monomers that are functionalized with metal complex units allows the combination of structural and functional benefits of polymers and metal moieties. Since a broad range of both electropolymerizable monomers and metal complexes are available, various structures and, thus, applications are possible. Recent developments in the field of synthesis and potential applications of metal‐functionalized polymers obtained via electropolymerization are presented, highlighting the significant advances in this field of research.