@article{60434,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Direction fields and vector fields play an increasingly important role in computer graphics and geometry processing. The synthesis of directional fields on surfaces, or other spatial domains, is a fundamental step in numerous applications, such as mesh generation, deformation, texture mapping, and many more. The wide range of applications resulted in definitions for many types of directional fields: from vector and tensor fields, over line and cross fields, to frame and vector‐set fields. Depending on the application at hand, researchers have used various notions of objectives and constraints to synthesize such fields. These notions are defined in terms of fairness, feature alignment, symmetry, or field topology, to mention just a few. To facilitate these objectives, various representations, discretizations, and optimization strategies have been developed. These choices come with varying strengths and weaknesses. This report provides a systematic overview of directional field synthesis for graphics applications, the challenges it poses, and the methods developed in recent years to address these challenges.</jats:p>}},
  author       = {{Vaxman, Amir and Campen, Marcel and Diamanti, Olga and Panozzo, Daniele and Bommes, David and Hildebrandt, Klaus and Ben‐Chen, Mirela}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{2}},
  pages        = {{545--572}},
  publisher    = {{Wiley}},
  title        = {{{Directional Field Synthesis, Design, and Processing}}},
  doi          = {{10.1111/cgf.12864}},
  volume       = {{35}},
  year         = {{2016}},
}

@article{60436,
  abstract     = {{<jats:p>This paper presents a method for bijective parametrization of 2D and 3D objects over canonical domains. While a range of solutions for the two-dimensional case are well-known, our method guarantees bijectivity of mappings also for a large, combinatorially-defined class of tetrahedral meshes (shellable meshes). The key concept in our method is the piecewise-linear (PL) foliation, decomposing the mesh into one-dimensional submanifolds and reducing the mapping problem to parametrization of a lower-dimensional manifold (a foliation section). The maps resulting from these foliations are proved to be bijective and continuous, and shown to have provably bijective PL approximations. We describe exact, numerically robust evaluation methods and demonstrate our implementation's capabilities on a large variety of meshes.</jats:p>}},
  author       = {{Campen, Marcel and Silva, Cláudio T. and Zorin, Denis}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{4}},
  pages        = {{1--15}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Bijective maps from simplicial foliations}}},
  doi          = {{10.1145/2897824.2925890}},
  volume       = {{35}},
  year         = {{2016}},
}

@article{52870,
  author       = {{Raket, Lars Lau and Grimme, Britta and Schöner, Gregor and Igel, Christian and Markussen, Bo}},
  journal      = {{PLoS Computational Biology}},
  number       = {{9}},
  pages        = {{e1005092}},
  publisher    = {{Public Library of Science San Francisco, CA USA}},
  title        = {{{Separating timing, movement conditions and individual differences in the analysis of human movement}}},
  volume       = {{12}},
  year         = {{2016}},
}

@inproceedings{250,
  abstract     = {{Before execution, users should formally validate the correctness of software received from untrusted providers. To accelerate this validation, in the proof carrying code (PCC) paradigm the provider delivers the software together with a certificate, a formal proof of the software’s correctness. Thus, the user only checks if the attached certificate shows correctness of the delivered software.Recently, we introduced configurable program certification, a generic, PCC based framework supporting various software analyses and safety properties. Evaluation of our framework revealed that validation suffers from certificate reading. In this paper, we present two orthogonal approaches which improve certificate validation, both reducing the impact of certificate reading. The first approach reduces the certificate size, storing information only if it cannot easily be recomputed. The second approach partitions the certificate into independently checkable parts. The trick is to read parts of the certificate while already checking read parts. Our experiments show that validation highly benefits from our improvements.}},
  author       = {{Jakobs, Marie-Christine}},
  booktitle    = {{Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)}},
  pages        = {{159----174}},
  title        = {{{Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning}}},
  doi          = {{10.1007/978-3-319-22969-0_12}},
  year         = {{2015}},
}

@inproceedings{25073,
  abstract     = {{In this paper, we introduce an approach for combining embedded systems with Service-oriented Computing techniques based on a concrete application scenario from the robotics domain. Our proposed Service-oriented Architecture allows for incorporating computational expensive functionality as services into a distributed computing environment. Furthermore, our framework facilitates a seamless integration of embedded systems such as robots as service providers into the computing environment. The entire communication is based on so-called recipes, which can be interpreted as autonomous messages that contain all necessary information for executing compositions of services.}},
  author       = {{Jungmann, Alexander and Jatzkowski, Jan and Kleinjohann, Bernd}},
  booktitle    = {{Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS)}},
  publisher    = {{Springer-Verlag}},
  title        = {{{Combining Service-oriented Computing with Embedded Systems - A Robotics Case Study}}},
  year         = {{2015}},
}

@inproceedings{25074,
  author       = {{Jatzkowski, Jan and Kreutz, Marcio Eduardo and Rettberg, Achim}},
  booktitle    = {{Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS)}},
  publisher    = {{Springer}},
  title        = {{{Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems}}},
  year         = {{2015}},
}

@inproceedings{25075,
  author       = {{Stahl, Katharina and Stöcklein, Jörg and Li, Silja}},
  booktitle    = {{Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015}},
  editor       = {{Shumaker, Randall and Lackey, Stephanie}},
  location     = {{Los Angeles, CA, USA, 2. - 7. Aug. 2015}},
  pages        = {{499--512}},
  publisher    = {{Springer International Publishing Switzerland}},
  title        = {{{Evaluation of Autonomous Approaches using Virtual Environments}}},
  volume       = {{ 9179}},
  year         = {{2015}},
}

@inproceedings{25076,
  abstract     = {{Automated service composition aims at automatically generating software solutions based on services to provide more complex functionality. In this paper, we give an initial overview about why adaptivity becomes increasingly important when aiming for automated composition of service functionality in dynamic and freely accessible environments such as service markets. We systematically derive dependencies among crucial processes such as service composition and service execution in a holistic view. Furthermore, we briefly discuss the influences and effects of changes in the environment according to the derived dependencies, and discuss possible future research directions.}},
  author       = {{Jungmann, Alexander}},
  booktitle    = {{Proceedings of the IEEE 11th World Congress on Services (SERVICES)}},
  pages        = {{329--332}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{On Adaptivity for Automated Composition of Service Functionality}}},
  year         = {{2015}},
}

@inproceedings{25080,
  abstract     = {{ervices are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches.}},
  author       = {{Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans}},
  booktitle    = {{Proceedings of the 12th IEEE International Conference on Services Computing (SCC)}},
  pages        = {{57--64}},
  publisher    = {{ IEEE Computer Society}},
  title        = {{{Automated Online Service Composition}}},
  year         = {{2015}},
}

@inproceedings{25082,
  author       = {{Jatzkowski, Jan and Kreutz, Marcio Eduardo and Rettberg, Achim}},
  booktitle    = {{Proceedings of Electronic System Level Synthesis Conference (ESLsyn)}},
  title        = {{{Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-based Virtualization}}},
  year         = {{2015}},
}

@inproceedings{25083,
  author       = {{Jatzkowski, Jan and Kleinjohann, Bernd}},
  booktitle    = {{Mechatronics}},
  location     = {{Mai 2015}},
  publisher    = {{Elsevier}},
  title        = {{{Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems}}},
  year         = {{2015}},
}

@misc{251,
  author       = {{Pfannschmidt, Karlson}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Solving the aggregated bandits problem}}},
  year         = {{2015}},
}

@article{25107,
  abstract     = {{On-the-fly composition of service-based software solutions is still a challenging task. Even more challenges emerge when facing automatic service composition in markets of composed services for end users. In this paper, we focus on the functional discrepancy between “what a user wants” specified in terms of a request and “what a user gets” when executing a composed service. To meet the challenge of functional discrepancy, we propose the combination of existing symbolic composition approaches with machine learning techniques. We developed a learning recommendation system that expands the capabilities of existing composition algorithms to facilitate adaptivity and consequently reduces functional discrepancy. As a representative of symbolic techniques, an Artificial Intelligence planning based approach produces solutions that are correct with respect to formal specifications. Our learning recommendation system supports the symbolic approach in decision-making. Reinforcement Learning techniques enable the recommendation system to adjust its recommendation strategy over time based on user ratings. We implemented the proposed functionality in terms of a prototypical composition framework. Preliminary results from experiments conducted in the image processing domain illustrate the benefit of combining both complementary techniques.}},
  author       = {{Jungmann, Alexander and Mohr, Felix}},
  journal      = {{Journal of Internet Services and Applications 6(1)}},
  pages        = {{1--18}},
  title        = {{{An approach towards adaptive service composition in markets of composed services}}},
  year         = {{2015}},
}

@article{25108,
  abstract     = {{Autonomous adaptation in self-adapting embedded real-time systems introduces novel risks as it may lead to unforeseen system behavior. An anomaly detection framework integrated in a real-time operating system can ease the identification of such suspicious novel behavior and, thereby, offers the potential to enhance the reliability of the considered self-x system. However, anomaly detection is based on knowledge about normal behavior. When dealing with self-reconfiguring applications, normal behavior changes. Hence, knowledge base requires adaptation or even re-construction at runtime. The stringent restrictions of real-time systems considering runtime and memory consumption make this task to a really challenging problem. We present our idea for online construction of application behavior knowledge that does not rely on training phase. The applications' behavior is defined by the application's system call invocations. For the knowledge base, we exploit suffix trees as they offer potentials to represent application behavior patterns and associated information in a compact manner. The online algorithm provided by suffix trees is a basis to construct the knowledge base with low computational effort. Anomaly detection and classification is integrated into the online construction method. New behavioral patterns do not unconditionally update the behavior knowledge base. They are evaluated in a context-related manner inspired by Danger Theory, a special discipline of artificial immune systems. Copyright © 2015 John Wiley & Sons, Ltd.}},
  author       = {{Rammig, Franz-Josef and Stahl, Katharina}},
  journal      = {{Concurrency and Computation: Practice and Experience }},
  title        = {{{Online behavior classification for anomaly detection in self-x real-time systems}}},
  year         = {{2015}},
}

@article{25109,
  author       = {{Sudhakar, Krishna and Zhao, Yuhong and Rammig, Franz-Josef}},
  journal      = {{Concurrency and Computation: Practice and Experience }},
  title        = {{{Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System}}},
  year         = {{2015}},
}

@article{25110,
  author       = {{Joy, M. tech. Mabel Mary and Rammig, Franz-Josef}},
  journal      = {{Int. J. of Embedded Systems}},
  title        = {{{A hybrid methodology to detect memory leaks in soft real time embedded systems software}}},
  year         = {{2015}},
}

@article{25111,
  author       = {{Khaluf, Yara and Birattari, Mauro and Rammig, Franz-Josef}},
  journal      = {{Springer Jounal Soft Computing }},
  title        = {{{Analysis of long-term swarm performance based on short-term experiments}}},
  year         = {{2015}},
}

@inproceedings{252,
  abstract     = {{Video streaming is in high demand by mobile users. In cellular networks, however, the unreliable wireless channel leads to two major problems. Poor channel states degrade video quality and interrupt the playback when a user cannot sufficiently fill its local playout buffer: buffer underruns occur. In contrast, good channel conditions cause common greedy buffering schemes to buffer too much data. Such over-buffering wastes expensive wireless channel capacity. Assuming that we can anticipate future data rates, we plan the quality and download time of video segments ahead. This anticipatory download scheduling avoids buffer underruns by downloading a large number of segments before a drop in available data rate occurs, without wasting wireless capacity by excessive buffering.We developed a practical anticipatory scheduling algorithm for segmented video streaming protocols (e.g., HLS or MPEG DASH). Simulation results and testbed measurements show that our solution essentially eliminates playback interruptions without significantly decreasing video quality.}},
  author       = {{Dräxler, Martin and Blobel, Johannes and Dreimann, Philipp and Valentin, Stefan and Karl, Holger}},
  booktitle    = {{Proceedings of the 2nd International Conference on Networked Systems (NetSys)}},
  pages        = {{1----8}},
  title        = {{{SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming}}},
  doi          = {{10.1109/NetSys.2015.7089073}},
  year         = {{2015}},
}

@inproceedings{253,
  abstract     = {{Group signatures, introduced by Chaum and van Heyst [15], are an important primitive in cryptography. In group signature schemes every group member can anonymously sign messages on behalf of the group. In case of disputes a dedicated opening manager is able to trace signatures - he can extract the identity of the producer of a given signature. A formal model for static group signatures schemes and their security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic groups is considered by Bellare, Shi, and Zhang [5]. Both models define group signature schemes with a single opening manager. The main difference between these models is that the number of group members in static schemes is fixed, while in dynamic schemes group members can join the group over time.}},
  author       = {{Blömer, Johannes and Juhnke, Jakob and Löken, Nils}},
  booktitle    = {{Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}},
  pages        = {{166--180}},
  title        = {{{Short Group Signatures with Distributed Traceability}}},
  doi          = {{10.1007/978-3-319-32859-1_14}},
  year         = {{2015}},
}

@inproceedings{19959,
  author       = {{Wahby, Mostafa and Hamann, Heiko}},
  booktitle    = {{Applications of Evolutionary Computation (EvoApplications 2015)}},
  title        = {{{On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking}}},
  doi          = {{10.1007/978-3-319-16549-3_61}},
  year         = {{2015}},
}