@inbook{57424,
  author       = {{Biehler, Rolf and Schaper, N. and Kortemeyer, Jörg}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2013, Band 1}},
  editor       = {{Greefrath, G. and Käpnick, F. and Stein, M.}},
  pages        = {{544--547}},
  publisher    = {{WTM-Verlag}},
  title        = {{{Konzeptionalisierung von Lösungsprozessen bei mathematikhaltigen Elektrotechnik-Aufgaben}}},
  doi          = {{10.1007/978-3-658-03065-0_18}},
  year         = {{2013}},
}

@inbook{57426,
  author       = {{Becher, Silvia and Biehler, Rolf and Hochmuth, Reinhard and Püschl, Juliane and Schreiber, Stephan}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2013, Band 1}},
  editor       = {{Greefrath, G. and Käpnick, F. and Stein, M.}},
  pages        = {{112--115}},
  publisher    = {{WTM-Verlag}},
  title        = {{{Von Zahlenmustern zur vollständigen Induktion: Analysen zur Argumentationsqualität von Studierenden im ersten Semester}}},
  year         = {{2013}},
}

@inbook{57428,
  author       = {{Biehler, Rolf and Kuzle, Ana and Oesterhaus, Janina and Wassong, Thomas}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2013, Band 1}},
  editor       = {{Greefrath, G. and Käpnick, F. and Stein, M.}},
  pages        = {{148--151}},
  publisher    = {{WTM-Verlag}},
  title        = {{{Stochastikfortbildner fortbilden: ein projektorientiertes Konzept zur Multiplikatorenqualifikation}}},
  year         = {{2013}},
}

@inbook{57427,
  author       = {{Biehler, Rolf and Podworny, Susanne}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2013, Band 1}},
  editor       = {{Greefrath, G. and Käpnick, F. and Stein, M.}},
  pages        = {{144--147}},
  publisher    = {{WTM-Verlag}},
  title        = {{{TinkerPlots 2.0: von realen Handlungen über Computersimulationen zum stochastischen Denken}}},
  year         = {{2013}},
}

@book{57431,
  author       = {{Biehler, Rolf and Hänze, M. and Hochmuth, Reinhard and Becher, Silvia and Fischer, E. and Püschl, Juliane and Schreiber, S.}},
  publisher    = {{Technische Bibliothek (TIB)}},
  title        = {{{Lehrinnovation in der Studieneingangsphase „Mathematik im Lehramtsstudium“ Hochschuldidakti-sche Grundlagen, Implementierung und Evaluation. Gesamtabschlussbericht des BMBF-Projekts LIMA.}}},
  year         = {{2013}},
}

@inbook{57434,
  author       = {{Kortemeyer, Jörg and Biehler, Rolf and Schaper, Niclas}},
  booktitle    = {{Mathematik im Übergang Schule/Hochschule und im ersten Studienjahr. Extended Abstracts zur 2. khdm-Arbeitstagung 20.02. - 23.02.2013}},
  editor       = {{Hoppenbrock, Axel and Schreiber, S. and Göller, Robin and Biehler, Rolf and Büchler, Bernd and Hochmuth, Reinhard and Rück, H.-G.}},
  pages        = {{95--96}},
  publisher    = {{Universität Kassel}},
  title        = {{{Mathematikbezogene Kompetenzmodellierung in der Studieneingangsphase elektrotechnischer Studiengänge im Projekt KoM@ ING}}},
  year         = {{2013}},
}

@article{57432,
  author       = {{Biehler, Rolf and Frischemeier, Daniel}},
  journal      = {{Stochastik in der Schule}},
  number       = {{3}},
  pages        = {{2–9}},
  title        = {{{Spielerisches Erlernen von Datenanalyse–Von Datenkarten und lebendiger Statistik zur Software TinkerPlots–Ein Workshop im Rahmen einer Lehrerfortbildung für die Primarstufe}}},
  volume       = {{33}},
  year         = {{2013}},
}

@article{57433,
  author       = {{Biehler, Rolf and Prömmel, Andreas}},
  journal      = {{Stochastik in der Schule}},
  number       = {{2}},
  pages        = {{14–25}},
  title        = {{{Von ersten stochastischen Erfahrungen mit großen Zahlen bis zum 1/√ n–Gesetz–ein didaktisch orientiertes Stufenkonzept}}},
  volume       = {{33}},
  year         = {{2013}},
}

@inproceedings{58669,
  author       = {{Hennig, Markus and Gaspers, Daniel and Mertsching, Barbel}},
  booktitle    = {{12th International Conference on Information Technology Based Higher Education and Training (ITHET)}},
  publisher    = {{IEEE}},
  title        = {{{Interactive WebGL-based 3D Visualizations for Situated Mathematics Teaching}}},
  doi          = {{10.1109/ithet.2013.6671038}},
  year         = {{2013}},
}

@inproceedings{58664,
  abstract     = {{Artificial visual attention systems aim to support technical systems in visual tasks by applying the concepts of selective attention observed in humans and other animals. Such systems are typically evaluated against ground truth obtained from human gaze-data or manually annotated test images. When applied to robotics, the systems are required to be adaptable to the target system. Here, we describe a flexible environment based on a robotic middleware layer allowing the development and testing of attention-guided vision systems. In such a framework, the systems can be tested with input from various sources, different attention algorithms at the core, and diverse subsequent tasks.}},
  author       = {{Tünnermann, Jan and Hennig, Markus and Silbernagel, Michael and Mertsching, Bärbel}},
  booktitle    = {{6th International Symposium on Attention in Cognitive Systems}},
  title        = {{{A Prototyping Environment for Integrated Artificial Attention Systems}}},
  year         = {{2013}},
}

@article{60453,
  abstract     = {{<jats:p>
            The most popular and actively researched class of quad remeshing techniques is the family of
            <jats:italic>parametrization based quad meshing methods</jats:italic>
            . They all strive to generate an
            <jats:italic>integer-grid map</jats:italic>
            , i.e. a parametrization of the input surface into R
            <jats:sup>2</jats:sup>
            such that the canonical grid of integer iso-lines forms a quad mesh when mapped back onto the surface in R
            <jats:sup>3</jats:sup>
            . An essential, albeit broadly neglected aspect of these methods is the
            <jats:italic>quad extraction</jats:italic>
            step, i.e. the materialization of an actual quad mesh from the mere "quad texture". Quad (mesh) extraction is often believed to be a trivial matter but quite the opposite is true: numerous special cases, ambiguities induced by numerical inaccuracies and limited solver precision, as well as imperfections in the maps produced by most methods (unless costly countermeasures are taken) pose significant challenges to the quad extractor. We present a method to sanitize a provided parametrization such that it becomes numerically consistent even in a limited precision floating point representation. Based on this we are able to provide a comprehensive and sound description of how to perform quad extraction robustly and without the need for any complex tolerance thresholds or disambiguation rules. On top of that we develop a novel strategy to cope with common local fold-overs in the parametrization. This allows our method, dubbed
            <jats:italic>QEx</jats:italic>
            , to generate all-quadrilateral meshes where otherwise holes, non-quad polygons or no output at all would have been produced. We thus enable the practical use of an entire class of maps that was previously considered defective. Since state of the art quad meshing methods spend a significant share of their run time solely to prevent local fold-overs, using our method it is now possible to obtain quad meshes significantly quicker than before. We also provide libQEx, an open source C++ reference implementation of our method and thus significantly lower the bar to enter the field of quad meshing.
          </jats:p>}},
  author       = {{Ebke, Hans-Christian and Bommes, David and Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{6}},
  pages        = {{1--10}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{QEx}}},
  doi          = {{10.1145/2508363.2508372}},
  volume       = {{32}},
  year         = {{2013}},
}

@article{60452,
  abstract     = {{<jats:p>Quadrilateral remeshing approaches based on global parametrization enable many desirable mesh properties. Two of the most important ones are (1) high regularity due to explicit control over irregular vertices and (2) smooth distribution of distortion achieved by convex variational formulations. Apart from these strengths, state-of-the-art techniques suffer from limited reliability on real-world input data, i.e. the determined map might have degeneracies like (local) non-injectivities and consequently often cannot be used directly to generate a quadrilateral mesh. In this paper we propose a novel convex Mixed-Integer Quadratic Programming (MIQP) formulation which ensures by construction that the resulting map is within the class of so called Integer-Grid Maps that are guaranteed to imply a quad mesh. In order to overcome the NP-hardness of MIQP and to be able to remesh typical input geometries in acceptable time we propose two additional problem specific optimizations: a complexity reduction algorithm and singularity separating conditions. While the former decouples the dimension of the MIQP search space from the input complexity of the triangle mesh and thus is able to dramatically speed up the computation without inducing inaccuracies, the latter improves the continuous relaxation, which is crucial for the success of modern MIQP optimizers. Our experiments show that the reliability of the resulting algorithm does not only annihilate the main drawback of parametrization based quad-remeshing but moreover enables the global search for high-quality coarse quad layouts - a difficult task solely tackled by greedy methodologies before.</jats:p>}},
  author       = {{Bommes, David and Campen, Marcel and Ebke, Hans-Christian and Alliez, Pierre and Kobbelt, Leif}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{4}},
  pages        = {{1--12}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Integer-grid maps for reliable quad meshing}}},
  doi          = {{10.1145/2461912.2462014}},
  volume       = {{32}},
  year         = {{2013}},
}

@article{60451,
  abstract     = {{<jats:p>Nowadays, digital 3D models are in widespread and ubiquitous use, and each specific application dealing with 3D geometry has its own quality requirements that restrict the class of acceptable and supported models. This article analyzes typical defects that make a 3D model unsuitable for key application contexts, and surveys existing algorithms that process, repair, and improve its structure, geometry, and topology to make it appropriate to case-by-case requirements.</jats:p>
          <jats:p>The analysis is focused on polygon meshes, which constitute by far the most common 3D object representation. In particular, this article provides a structured overview of mesh repairing techniques from the point of view of the application context. Different types of mesh defects are classified according to the upstream application that produced the mesh, whereas mesh quality requirements are grouped by representative sets of downstream applications where the mesh is to be used. The numerous mesh repair methods that have been proposed during the last two decades are analyzed and classified in terms of their capabilities, properties, and guarantees. Based on these classifications, guidelines can be derived to support the identification of repairing algorithms best-suited to bridge the compatibility gap between the quality provided by the upstream process and the quality required by the downstream applications in a given geometry processing scenario.</jats:p>}},
  author       = {{Attene, Marco and Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0360-0300}},
  journal      = {{ACM Computing Surveys}},
  number       = {{2}},
  pages        = {{1--33}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Polygon mesh repairing}}},
  doi          = {{10.1145/2431211.2431214}},
  volume       = {{45}},
  year         = {{2013}},
}

@article{60450,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The computation of intrinsic, geodesic distances and geodesic paths on surfaces is a fundamental low‐level building block in countless Computer Graphics and Geometry Processing applications. This demand led to the development of numerous algorithms – some for the exact, others for the approximative computation, some focussing on speed, others providing strict guarantees. Most of these methods are designed for computing distances according to the standard Riemannian metric induced by the surface's embedding in Euclidean space. Generalization to other, especially anisotropic, metrics – which more recently gained interest in several application areas – is not rarely hampered by fundamental problems. We explore and discuss possibilities for the generalization and extension of well‐known methods to the anisotropic case, evaluate their relative performance in terms of accuracy and speed, and propose a novel algorithm, the <jats:italic>Short‐Term Vector Dijkstra</jats:italic>. This algorithm is strikingly simple to implement and proves to provide practical accuracy at a higher speed than generalized previous methods.</jats:p>}},
  author       = {{Campen, Marcel and Heistermann, Martin and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{5}},
  pages        = {{63--71}},
  publisher    = {{Wiley}},
  title        = {{{Practical Anisotropic Geodesy}}},
  doi          = {{10.1111/cgf.12173}},
  volume       = {{32}},
  year         = {{2013}},
}

@inproceedings{60454,
  author       = {{Zimmer, Henrik and Campen, Marcel and Kobbelt, Leif}},
  booktitle    = {{2013 IEEE Conference on Computer Vision and Pattern Recognition}},
  publisher    = {{IEEE}},
  title        = {{{Efficient Computation of Shortest Path-Concavity for 3D Meshes}}},
  doi          = {{10.1109/cvpr.2013.280}},
  year         = {{2013}},
}

@inbook{57435,
  author       = {{Biehler, Rolf and Hochmuth, Reinhard and Rück, H.-G.}},
  booktitle    = {{Mathematik im Übergang Schule/Hochschule und im ersten Studienjahr. Extended Abstracts zur 2. khdm-Arbeitstagung 20.02. - 23.02.2013}},
  editor       = {{Hoppenbrock, Axel and Schreiber, S. and Göller, Robin and Biehler, Rolf and Büchler, Bernd and Hochmuth, Reinhard and Rück, H.-G.}},
  pages        = {{23--24}},
  publisher    = {{Universität Kassel}},
  title        = {{{Gedanken zur Struktur und Entwicklung der Hochschuldidaktik Mathematik}}},
  year         = {{2013}},
}

@techreport{2504,
  author       = {{Khan, Rana Azeem M. and Karl, Holger}},
  title        = {{{Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor Networks}}},
  year         = {{2012}},
}

@techreport{2505,
  author       = {{Dannewitz, Christian and Karl, Holger and Yadav, Aditya}},
  title        = {{{Report on Locality in DNS Requests – Evaluation and Impact on Future Internet Architectures}}},
  year         = {{2012}},
}

@inproceedings{20173,
  abstract     = {{This paper investigates the properties required to evolve Artificial Neural Networks for distributed control in modular robotics, which typically involves non-linear dynamics and complex interactions in the sensori-motor space. We investigate the relation between macro-scale properties (such as modularity and regularity) and micro-scale properties in Neural Network controllers. We show how neurons capable of multiplicative-like arithmetic operations may increase the performance of controllers in several ways whenever challenging control problems with non-linear dynamics are involved. This paper provides evidence that performance and robustness of evolved controllers can be improved by a combination of carefully chosen micro- and macro-scale neural network properties.}},
  author       = {{Hamann, Heiko and Stradner, Jürgen and Bredeche, Nicolas and Cazenille, Leo}},
  booktitle    = {{14th Annual Genetic and Evolutionary Computation Conference, GECCO 2012}},
  pages        = {{89--96}},
  publisher    = {{ACM}},
  title        = {{{Impact of Neuron Models and Network Structure on Evolving Modular Robot Neural Network Controllers}}},
  doi          = {{10.1145/2330163.2330177}},
  year         = {{2012}},
}

@inproceedings{20174,
  abstract     = {{As a contribution to the efforts towards robotic systems of higher flexibility we present our concept of morphologically dynamic robots. Within the projects SYMBRION and REPLICATOR, that focus on modular robotics, we have developed bio-inspired control techniques to achieve new concepts of dynamic, autonomous morphological structures. We propose three modes of coupling between robot modules: swarm, team, and organism mode. We demonstrate our concepts along with simple robot experiments.}},
  author       = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen}},
  booktitle    = {{Austrian Robotics Workshop (Operational Programme Slovenia-Austria)}},
  title        = {{{Towards Morphological Flexibility: Modular Robotics and Bio-inspired Control}}},
  year         = {{2012}},
}