@book{64643,
  editor       = {{Glöckner, Helge and Escassut, Alain and Shamseddine, Khodr}},
  isbn         = {{978-1-4704-1988-2; 978-1-4704-3204-1}},
  issn         = {{0271-4132}},
  location     = {{Paderborn}},
  title        = {{{Advances in non-Archimedean Analysis. 13th international conference on p-adic functional analysis, University of Paderborn, Paderborn, Germany, August 12--16, 2014}}},
  doi          = {{10.1090/conm/665}},
  year         = {{2016}},
}

@phdthesis{64757,
  author       = {{Eyni, Jan Milan}},
  title        = {{{New examples and constructions in infinite-dimensional Lie theory}}},
  year         = {{2016}},
}

@unpublished{64767,
  author       = {{Nikitin, Natalie}},
  title        = {{{Exponential laws for spaces of differentiable functions on topological groups}}},
  year         = {{2016}},
}

@article{64641,
  author       = {{Glöckner, Helge}},
  issn         = {{0092-7872}},
  journal      = {{Communications in Algebra}},
  keywords     = {{22E50, 20D35, 20E06}},
  number       = {{7}},
  pages        = {{2981–2988}},
  title        = {{{The kernel of the adjoint representation of a p-adic Lie group need not have an abelian open normal subgroup}}},
  doi          = {{10.1080/00927872.2015.1065859}},
  volume       = {{44}},
  year         = {{2016}},
}

@article{11989,
  author       = {{Campolo, Claudia and Cheng, Lin and Sommer, Christoph and Tsai, Hsin-Mu}},
  issn         = {{0140-3664}},
  journal      = {{Computer Communications}},
  pages        = {{1--2}},
  title        = {{{Special Issue on Multi-radio, Multi-technology, Multi-system Vehicular Communications}}},
  doi          = {{10.1016/j.comcom.2016.09.003}},
  year         = {{2016}},
}

@article{29613,
  author       = {{Wallscheid, Oliver and Huber, Tobias and Peters, Wilhelm and Böcker, Joachim}},
  journal      = {{EPE Journal}},
  number       = {{25}},
  pages        = {{1–10}},
  publisher    = {{Taylor & Francis}},
  title        = {{{A Critical Review of Techniques to Determine the Magnet Temperature of Permanent Magnet Synchronous Motors under Real-time Conditions}}},
  doi          = {{10.1080/09398368.2016.1209877}},
  year         = {{2016}},
}

@article{1454,
  author       = {{Grynko, Yevgen and Zentgraf, Thomas and Meier, Torsten and Förstner, Jens}},
  issn         = {{0946-2171}},
  journal      = {{Applied Physics B}},
  keywords     = {{tet_topic_meta, tet_topic_shg}},
  number       = {{9}},
  pages        = {{242}},
  publisher    = {{Springer Nature}},
  title        = {{{Simulations of high harmonic generation from plasmonic nanoparticles in the terahertz region}}},
  doi          = {{10.1007/s00340-016-6510-0}},
  volume       = {{122}},
  year         = {{2016}},
}

@inproceedings{58665,
  author       = {{Hennig, Markus and Mertsching, Bärbel}},
  booktitle    = {{Proceedings of the 5th Interdisciplinary Workshop on Cognitive Systems (KogSys 2016)}},
  title        = {{{Contour Analysis in Biological and Artificial Cognitive Systems}}},
  year         = {{2016}},
}

@article{60437,
  abstract     = {{<jats:p>Parametrization based methods have recently become very popular for the generation of high quality quad meshes. In contrast to previous approaches, they allow for intuitive user control in order to accommodate all kinds of application driven constraints and design intentions. A major obstacle in practice, however, are the relatively long computations that lead to response times of several minutes already for input models of moderate complexity. In this paper we introduce a novel strategy to handle highly complex input meshes with up to several millions of triangles such that quad meshes can still be created and edited within an interactive workflow. Our method is based on representing the input model on different levels of resolution with a mechanism to propagate parametrizations from coarser to finer levels. The major challenge is to guarantee consistent parametrizations even in the presence of charts, transition functions, and singularities. Moreover, the remaining degrees of freedom on coarser levels of resolution have to be chosen carefully in order to still achieve low distortion parametrizations. We demonstrate a prototypic system where the user can interactively edit quad meshes with powerful high-level operations such as guiding constraints, singularity repositioning, and singularity connections.</jats:p>}},
  author       = {{Ebke, Hans-Christian and Schmidt, Patrick and Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{6}},
  pages        = {{1--13}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Interactively controlled quad remeshing of high resolution 3D models}}},
  doi          = {{10.1145/2980179.2982413}},
  volume       = {{35}},
  year         = {{2016}},
}

@article{60435,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Various applications of global surface parametrization benefit from the alignment of parametrization isolines with principal curvature directions. This is particularly true for recent parametrization‐based meshing approaches, where this directly translates into a shape‐aware edge flow, better approximation quality, and reduced meshing artifacts. Existing methods to influence a parametrization based on principal curvature directions suffer from scale‐dependence, which implies the necessity of parameter variation, or try to capture complex directional shape features using simple 1D curves. Especially for non‐sharp features, such as chamfers, fillets, blends, and even more for organic variants thereof, these abstractions can be unfit. We present a novel approach which respects and exploits the 2D nature of such directional feature regions, detects them based on coherence and homogeneity properties, and controls the parametrization process accordingly. This approach enables us to provide an intuitive, scale‐invariant control parameter to the user. It also allows us to consider non‐local aspects like the topology of a feature, enabling further improvements. We demonstrate that, compared to previous approaches, global parametrizations of higher quality can be generated without user intervention.</jats:p>}},
  author       = {{Campen, Marcel and Ibing, Moritz and Ebke, Hans‐Christian and Zorin, Denis and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{5}},
  pages        = {{1--10}},
  publisher    = {{Wiley}},
  title        = {{{Scale‐Invariant Directional Alignment of Surface Parametrizations}}},
  doi          = {{10.1111/cgf.12958}},
  volume       = {{35}},
  year         = {{2016}},
}

@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}},
}