@phdthesis{385, author = {{Petrlic, Ronald}}, publisher = {{Universität Paderborn}}, title = {{{Privacy-Preserving Multiparty Digital Rights Management}}}, year = {{2014}}, } @inproceedings{386, abstract = {{We present a privacy-preserving multiparty DRM scheme that does not need a trusted third party. Users anonymously buy content from content providers and anonymously execute it at content execution centers. The executions are unlinkable to each other. The license check is performed as part of the used ciphertext-policy attribute-based encryption (CP-ABE) and, thus, access control is cryptographically enforced. The problem of authorization proof towards the key center in an ABE scheme is solved by a combination with anonymous payments.}}, author = {{Petrlic, Ronald and Sorge, Christoph}}, booktitle = {{Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)}}, pages = {{1--5}}, title = {{{Privacy-Preserving Digital Rights Management based on Attribute-based Encryption}}}, doi = {{10.1109/NTMS.2014.6814044}}, year = {{2014}}, } @article{387, abstract = {{This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.}}, author = {{Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, journal = {{Transactions on Algorithms}}, number = {{4}}, publisher = {{ACM}}, title = {{{Principles of Robust Medium Access and an Application to Leader Election}}}, doi = {{10.1145/2635818}}, year = {{2014}}, } @inproceedings{3877, author = {{Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and Engels, Gregor}}, booktitle = {{Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers}}, pages = {{553--564}}, title = {{{Modeling Review Argumentation for Robust Sentiment Analysis}}}, year = {{2014}}, } @techreport{389, abstract = {{This article presents a new approach for representing and processing abstract optimization models. Confronted with model and data integration tasks for distributed Decision Support Systems which are especially composed out of software services, we describe model constituents such as constraints both structurally and semantically. Within our approach, typed model constituents can be integrated into complete models and the instantiation of model constituents itself with data and data models can be wrapped into semantic software services. Besides others, this supports the automated generation of adaptors and the search for and composition of services. The basic idea of our approach is to represent the optimization models as instance knowledge of different ontologies for both optimization and application domains. By separating the model expression structure from the goal and constraint conceptualizations predefined modeling constructs can be reused, where we do not only separate the model structure from data, but can also abstract the structure from a specific data model. We present an XML and ontology-query based approach for this separation and demonstrate the resulting flexible model integration procedure out of reusable goal and constraint types on a network flow problem.}}, author = {{Stapel, Florian and Suhl, Lena}}, publisher = {{Universität Paderborn}}, title = {{{Ontology-based Representation of Optimization Models}}}, year = {{2014}}, } @article{3890, abstract = {{The incidenceofthin-film-guided, in-planeunguidedwavesatobliqueanglesonstraightdiscontinuities of dielectricslabwaveguides,anearlyproblemofintegratedoptics,isbeingre-considered.The3-D frequencydomainMaxwellequationsreducetoaparametrizedinhomogeneousvectorialproblemona 2-D computationaldomain,withtransparent-influx boundaryconditions.Weproposearigorousvec- torial solverbasedonsimultaneousexpansionsintopolarizedlocalslabeigenmodesalongthetwo orthogonal crosssectioncoordinates(quadridirectionaleigenmodepropagationQUEP).Thequasi-ana- lytical schemeisapplicabletoconfigurations with — in principle — arbitrary crosssectiongeometries. Examples forahigh-contrastfacetofanasymmetricslabwaveguide,forthelateralexcitationofa channel waveguide,andforastepdiscontinuitybetweenslabwaveguidesofdifferentthicknessesare discussed.}}, author = {{Hammer, Manfred}}, issn = {{0030-4018}}, journal = {{Optics Communications}}, keywords = {{tet_topic_waveguide, tet_topic_numerics}}, pages = {{447--456}}, publisher = {{Elsevier BV}}, title = {{{Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver}}}, doi = {{10.1016/j.optcom.2014.09.087}}, volume = {{338}}, year = {{2014}}, } @article{390, abstract = {{In software markets of the future, customer-specific software will be developed on demand based on distributed software and hardware services. Based on a customer-specific request, available service offers have to be discovered and composed into sophisticated IT services that fulfill the customer's request.A prerequisite of this vision are rich service descriptions, which comprise structural as well as behavioral aspects of the services, otherwise an accurate service discovery and composition is not possible. However, automatic matching of service requests and offers specified in rich service descriptions for the purpose of service discovery is a complex task, due to the multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different specification languages, different underlying ontologies, or different levels of granularity in the specification itself.In this article, we present a comprehensive approach for service discovery and composition, which overcomes the underlying heterogeneity of the service partners. Based on a realistic case study of our industrial partner from the e-tourism domain, we first introduce an automatic matching mechanism for service requests and offers specified in a rich service description language. In addition, we propose an automatic service composition approach, which determines possible service compositions by composing the service protocols through a composition strategy based on labeled transition systems. }}, author = {{Huma, Zille and Gerth, Christian and Engels, Gregor}}, journal = {{Computer Science - Research and Development}}, number = {{3-4}}, pages = {{333--361}}, publisher = {{Springer}}, title = {{{On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains}}}, doi = {{10.1007/s00450-014-0254-z}}, year = {{2014}}, } @article{3905, author = {{Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary, Milad and Gertosio, Christine}}, journal = {{2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)}}, pages = {{169--175}}, title = {{{iSoNTRE: The Social Network Transformer into Recommendation Engine}}}, year = {{2014}}, } @misc{391, author = {{Feldkord, Björn}}, publisher = {{Universität Paderborn}}, title = {{{On Variants of the Page Migration Problem}}}, year = {{2014}}, } @inproceedings{28936, author = {{Davis, Niki and Eickelmann, Birgit}}, booktitle = {{Proceedings of the American Educational Research Association annual meeting (AERA)}}, title = {{{The restructuring of schooling with digital technologies and implications for policy makers and practitioners}}}, year = {{2014}}, } @inproceedings{28937, author = {{Eickelmann, Birgit and Vennemann, Mario and Gerick, Julia and Lorenz, Ramona}}, booktitle = {{Proceedings of the American Educational Research Association annual meeting (AERA)}}, title = {{{Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011}}}, year = {{2014}}, } @inproceedings{28938, author = {{Vennemann, Mario and Eickelmann, Birgit}}, booktitle = {{Proceedings of the American Educational Research Association annual meeting (AERA)}}, title = {{{Can we predict usage out of possession? – A home digital resources (HDR) scale to describe students’ digital learning resources in primary schools}}}, year = {{2014}}, } @inproceedings{28939, author = {{Lai, Kwok-Wing and Eickelmann, Birgit and Fisser, Petra and Khaddage, Ferial and Knezek, Gerald and Webb, Mary and Davis, Niki and Erstad, Ola and Gibson, David C.}}, booktitle = {{Proceedings of KeyCIT Conference 2014}}, title = {{{Tackling Educational Challenges in a Digitally Networked World: Strategies developed from the EDUsummIT 2013}}}, year = {{2014}}, } @misc{28993, author = {{Drossel, Kerstin and Bos, Wilfried and Zieger, Laura}}, publisher = {{Jugendring Dortmund}}, title = {{{Kinder- und Jugendarbeit in Dortmund. Studie zur Situation freiwillig Mitarbeitender in der Dortmunder Kinder- und Jugendarbeit}}}, year = {{2014}}, } @misc{2900, author = {{Brauer, Sascha}}, title = {{{A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures}}}, year = {{2014}}, } @article{2976, author = {{Ackermann, Marcel Rudolf and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, publisher = {{Springer US}}, title = {{{Analysis of Agglomerative Clustering}}}, doi = {{10.1007/s00453-012-9717-4}}, volume = {{69}}, year = {{2014}}, } @inproceedings{2977, author = {{Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}}, booktitle = {{2014 22nd International Conference on Pattern Recognition}}, isbn = {{9781479952090}}, publisher = {{IEEE}}, title = {{{A Theoretical and Experimental Comparison of the EM and SEM Algorithm}}}, doi = {{10.1109/icpr.2014.253}}, year = {{2014}}, } @article{3127, author = {{Jager, Tibor}}, journal = {{Datenschutz und Datensicherheit}}, number = {{7}}, pages = {{445----451}}, title = {{{Die Zukunft der Kryptographie}}}, doi = {{10.1007/s11623-014-0204-8}}, year = {{2014}}, } @inproceedings{3128, author = {{Fleischhacker, Nils and Jager, Tibor and Schröder, Dominique}}, booktitle = {{Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I}}, pages = {{512----531}}, title = {{{On Tight Security Proofs for Schnorr Signatures}}}, doi = {{10.1007/978-3-662-45611-8_27}}, year = {{2014}}, } @article{3167, author = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}}, journal = {{Formal Asp. Comput.}}, number = {{2}}, pages = {{251----280}}, title = {{{The behavioural semantics of Event-B refinement}}}, doi = {{10.1007/s00165-012-0265-0}}, year = {{2014}}, }