@inproceedings{355, abstract = {{In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area.}}, author = {{Blömer, Johannes and Günther, Peter and Liske, Gennadij}}, booktitle = {{Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}}, pages = {{1----7}}, title = {{{Tampering attacks in pairing-based cryptography}}}, doi = {{10.1109/FDTC.2014.10}}, year = {{2014}}, } @article{356, abstract = {{Decentralized algorithms are often used in the cooperative robotics field, especially by large swarm systems. We present a distributed algorithm for a problem in which a group of autonomous mobile robots must surround a given target. These robots are oblivious, i.e., they have no memory of the past. They use only local sensing and need no dedicated communication among themselves. We introduce, then solve the problem in which the group of autonomous mobile robots must surround a given target – we call it the “discrete multiorbit target surrounding problem” (DMTSP). We evaluate our solution using simulation and prove that our solution invariably ensures that robots enclose the target in finite time. }}, author = {{Blazovics, Laszlo and Lukovszki, Tamas and Forstner, Bertalan }}, journal = {{Journal of Advanced Computational Intelligence and Intelligent Informatics}}, number = {{3}}, pages = {{315----319}}, publisher = {{Fuji Technology Press Ltd.}}, title = {{{Surrounding robots -- A discrete localized solution for the intruder problem}}}, doi = {{10.20965/jaciii.2014.p0315}}, year = {{2014}}, } @misc{357, author = {{Ebel, Olga}}, publisher = {{Universität Paderborn}}, title = {{{Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten}}}, year = {{2014}}, } @phdthesis{358, author = {{Röhl, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Strategic and Cooperative Games in Network Economics}}}, year = {{2014}}, } @misc{359, author = {{Töws, Manuel}}, publisher = {{Universität Paderborn}}, title = {{{Statistisches Testen von unbeweisbaren Anforderungen an Programmspezifikationen in SMT-LIB}}}, year = {{2014}}, } @inbook{3591, author = {{Fischer, Christoph and O’Connor, Bridget N.}}, booktitle = {{Professional and Practice-based Learning}}, isbn = {{9789400770119}}, issn = {{2210-5549}}, pages = {{11--24}}, publisher = {{Springer Netherlands}}, title = {{{Informal Learning in Workplaces: Understanding Learning Culture as a Challenge for Organizational and Individual Development}}}, doi = {{10.1007/978-94-007-7012-6_2}}, year = {{2014}}, } @inproceedings{360, abstract = {{Network appliances perform different functions on network flows and constitute an important part of an operator’s network. Normally, a set of chained network functions process network flows. Following the trend of virtualization of networks, virtualization of the network functions has also become a topic of interest. We define a model for formalizing the chaining of network functions using a context-free language. We process deployment requests and construct virtual network function graphs that can be mapped to the network. We describe the mapping as a Mixed Integer Quadratically Constrained Program (MIQCP) for finding the placement of the network functions and chaining them together considering the limited network resources and requirements of the functions. We have performed a Pareto set analysis to investigate the possible trade-offs between different optimization objectives. }}, author = {{Dräxler, Sevil and Keller, Matthias and Karl, Holger}}, booktitle = {{Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)}}, pages = {{7--13}}, title = {{{Specifying and Placing Chains of Virtual Network Functions}}}, doi = {{10.1109/CloudNet.2014.6968961}}, year = {{2014}}, } @misc{361, author = {{Roeske, Daniel}}, publisher = {{Universität Paderborn}}, title = {{{Simulating load-dependent operation of picocells}}}, year = {{2014}}, } @misc{362, author = {{Kaiser, Sarah}}, publisher = {{Universität Paderborn}}, title = {{{Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts & Holt und Kübler et. al}}}, year = {{2014}}, } @inproceedings{364, abstract = {{Today, software components are traded on markets in form of services. These services can also be service compositions consisting of several services. If a software architect wants to provide such a service composition in the market for trade, she needs to perform several tasks: she needs to model the composition, to discover existing services to be part of that composition, and to analyze the composition's functional correctness as well as its quality, e.g., performance. Up to now, the architect needed to find and use different tools for these tasks. Typically, these tools are not interoperable with each other. We provide the tool SeSAME that supports a software architect in all of these tasks. SeSAME is an integrated Eclipse-based tool-suite providing a comprehensive service specification language to model service compositions and existing services. Furthermore, it includes modules for service matching, functional analysis, and non-functional analysis. SeSAME is the first tool that integrates all these tasks into one tool-suite and, thereby, provides holistic support for trading software services. Thus, it contributes to a software provider's market success.}}, author = {{Arifulina, Svetlana and Becker, Matthias and Platenius, Marie Christin and Walther, Sven}}, booktitle = {{Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)}}, pages = {{839--842}}, title = {{{SeSAME: Modeling and Analyzing High-Quality Service Compositions}}}, doi = {{10.1145/2642937.2648621}}, year = {{2014}}, } @inproceedings{366, abstract = {{On-The-Fly (OTF) Computing constitutes an approach towards highly dynamic and individualized software markets. Based on service-oriented computing, OTF Computing is about realizing global markets of services that can be flexibly combined. We report on our current research activities, the security and privacy implications thereof, and our approaches to tackle the challenges. Furthermore, we discuss how the security and privacy challenges are addressed in research projects similar to OTF Computing.}}, author = {{Petrlic, Ronald and Jungmann, Alexander and Platenius, Marie Christin and Schäfer, Wilhelm and Sorge, Christoph}}, booktitle = {{Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)}}, pages = {{131--142}}, title = {{{Security and Privacy Challenges in On-The-Fly Computing}}}, year = {{2014}}, } @article{3663, author = {{Rausch, Andreas and Seifried, Jürgen and Harteis, Christian}}, journal = {{Zeitschrift für Erziehungswissenschaft}}, number = {{Sonderheft}}, pages = {{127----147}}, title = {{{Ausbleibende Effekte pädagogischer Professionalisierung des betrieblichen Ausbildungspersonals: Ergebnisse einer Längsschnittstudie}}}, volume = {{17}}, year = {{2014}}, } @inbook{3664, author = {{Gijbels, David and Harteis, Christian and Donche, Vincent and Van den Bossche, Piet and Maes, Steffi and Temmen, Katrin}}, booktitle = {{Discourses on Professional Learning}}, editor = {{Harteis, Christian and Seifried, Jürgen and Rausch, Andreas}}, pages = {{177----188}}, publisher = {{Springer}}, title = {{{Grasping learning during internships: the case of engineering education}}}, year = {{2014}}, } @inbook{3665, author = {{Harteis, Christian and Rausch, Andreas and Seifried, Jürgen}}, booktitle = {{Discourses on Professional Learning}}, editor = {{Harteis, Christian and Seifried, Jürgen and Rausch, Andreas}}, pages = {{1----7}}, publisher = {{Springer}}, title = {{{Discourses on professional learning: On the boundary between learning and working}}}, year = {{2014}}, } @book{3666, editor = {{Harteis, Christian and Rausch, Andreas and Seifried, Jürgen}}, publisher = {{Springer}}, title = {{{Discourses on professional learning}}}, year = {{2014}}, } @inbook{3667, author = {{Harteis, Christian and Bauer, Johannes}}, booktitle = {{International handbook of research in professional and practice-based learning}}, editor = {{Billett, Stephen and Harteis, Christian and Gruber, Hans}}, pages = {{699----732}}, title = {{{Learning from errors at work}}}, year = {{2014}}, } @book{3668, editor = {{Billett, Stephen and Harteis, Christian and Gruber, Hans}}, publisher = {{Springer}}, title = {{{International handbook of research in professional and practice-based learning}}}, year = {{2014}}, } @inproceedings{367, abstract = {{Online social networks are attracting billions of nowadays, both on a global scale as well as in social enterprise networks. Using distributed hash tables and peer-to-peer technology allows online social networks to be operated securely and efficiently only by using the resources of the user devices, thus alleviating censorship or data misuse by a single network operator. In this paper, we address the challenges that arise in implementing reliably and conveniently to use distributed data structures, such as lists or sets, in such a distributed hash-tablebased online social network. We present a secure, distributed list data structure that manages the list entries in several buckets in the distributed hash table. The list entries are authenticated, integrity is maintained and access control for single users and also groups is integrated. The approach for secure distributed lists is also applied for prefix trees and sets, and implemented and evaluated in a peer-to-peer framework for social networks. Evaluation shows that the distributed data structure is convenient and efficient to use and that the requirements on security hold.}}, author = {{Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman}}, booktitle = {{Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)}}, pages = {{396--405}}, title = {{{Secure Distributed Data Structures for Peer-to-Peer-based Social Networks}}}, doi = {{10.1109/CTS.2014.6867595}}, year = {{2014}}, } @inbook{3678, author = {{Daunert, Anna Liza and Harteis, Christian}}, booktitle = {{E-Learning 2.0 Technologies and Web Applications in Higher Education}}, editor = {{Pelet, J.-E.}}, pages = {{254----272}}, publisher = {{IGI Global}}, title = {{{Pre-service teachers’ perspectives and practices in utilizing ubiquitous technologies for academic-oriented learning and knowledge management}}}, year = {{2014}}, } @inproceedings{368, abstract = {{We consider the problem of scheduling a number of jobs on $m$ identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement r_j \in {0,1}. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their \emph{processing speeds}, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature.In this paper, we suggest and analyze a slightly simplified model. It focuses on the assignment of shared continuous resources to the processors. The job assignment to processors and the ordering of the jobs have already been fixed. It is shown that, even for unit size jobs, finding an optimal solution is NP-hard if the number of processors is part of the input. Positive results for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover, we prove that balanced schedules yield a 2-1/m-approximation for a fixed number of processors. Such schedules are computed by our GreedyBalance algorithm, for which the bound is tight.}}, author = {{Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim }}, booktitle = {{Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{128--137}}, title = {{{Scheduling Shared Continuous Resources on Many-Cores}}}, doi = {{10.1145/2612669.2612698}}, year = {{2014}}, }