[{"type":"dissertation","file":[{"date_created":"2018-03-20T07:03:37Z","creator":"florida","date_updated":"2018-03-20T07:03:37Z","access_level":"closed","file_name":"385-arbeit1.pdf","file_id":"1390","file_size":2962042,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"385","user_id":"477","ddc":["040"],"file_date_updated":"2018-03-20T07:03:37Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2014","citation":{"apa":"Petrlic, R. (2014). <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn.","short":"R. Petrlic, Privacy-Preserving Multiparty Digital Rights Management, Universität Paderborn, 2014.","mla":"Petrlic, Ronald. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014.","bibtex":"@book{Petrlic_2014, title={Privacy-Preserving Multiparty Digital Rights Management}, publisher={Universität Paderborn}, author={Petrlic, Ronald}, year={2014} }","ama":"Petrlic R. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn; 2014.","chicago":"Petrlic, Ronald. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014.","ieee":"R. Petrlic, <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:45Z","author":[{"first_name":"Ronald","last_name":"Petrlic","full_name":"Petrlic, Ronald"}],"date_created":"2017-10-17T12:42:07Z","title":"Privacy-Preserving Multiparty Digital Rights Management"},{"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1389","file_name":"386-NTMS14.pdf","access_level":"closed","file_size":216843,"date_created":"2018-03-20T07:03:02Z","creator":"florida","date_updated":"2018-03-20T07:03:02Z"}],"abstract":[{"text":"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.","lang":"eng"}],"publication":"Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)","type":"conference","file_date_updated":"2018-03-20T07:03:02Z","ddc":["040"],"user_id":"15504","_id":"386","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"page":"1-5","citation":{"chicago":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management Based on Attribute-Based Encryption.” In <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 1–5, 2014. <a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">https://doi.org/10.1109/NTMS.2014.6814044</a>.","ieee":"R. Petrlic and C. Sorge, “Privacy-Preserving Digital Rights Management based on Attribute-based Encryption,” in <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 2014, pp. 1–5.","ama":"Petrlic R, Sorge C. Privacy-Preserving Digital Rights Management based on Attribute-based Encryption. In: <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>. ; 2014:1-5. doi:<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>","apa":"Petrlic, R., &#38; Sorge, C. (2014). Privacy-Preserving Digital Rights Management based on Attribute-based Encryption. In <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i> (pp. 1–5). <a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">https://doi.org/10.1109/NTMS.2014.6814044</a>","short":"R. Petrlic, C. Sorge, in: Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5.","mla":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management Based on Attribute-Based Encryption.” <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 2014, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>.","bibtex":"@inproceedings{Petrlic_Sorge_2014, title={Privacy-Preserving Digital Rights Management based on Attribute-based Encryption}, DOI={<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>}, booktitle={Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)}, author={Petrlic, Ronald and Sorge, Christoph}, year={2014}, pages={1–5} }"},"year":"2014","has_accepted_license":"1","doi":"10.1109/NTMS.2014.6814044","title":"Privacy-Preserving Digital Rights Management based on Attribute-based Encryption","author":[{"first_name":"Ronald","full_name":"Petrlic, Ronald","last_name":"Petrlic"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"date_created":"2017-10-17T12:42:07Z","date_updated":"2022-01-06T06:59:46Z"},{"has_accepted_license":"1","issue":"4","year":"2014","citation":{"ama":"Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>. 2014;(4). doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>","ieee":"B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles of Robust Medium Access and an Application to Leader Election,” <i>Transactions on Algorithms</i>, no. 4, 2014.","chicago":"Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4 (2014). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>.","apa":"Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>, (4). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>","bibtex":"@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles of Robust Medium Access and an Application to Leader Election}, DOI={<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>}, number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014} }","short":"B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014).","mla":"Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>."},"publisher":"ACM","date_updated":"2022-01-06T06:59:47Z","date_created":"2017-10-17T12:42:07Z","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"full_name":"Richa, Andrea W.","last_name":"Richa","first_name":"Andrea W."},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jin","last_name":"Zhang","full_name":"Zhang, Jin"}],"title":"Principles of Robust Medium Access and an Application to Leader Election","doi":"10.1145/2635818","type":"journal_article","publication":"Transactions on Algorithms","abstract":[{"text":"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.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-20T07:02:33Z","date_updated":"2018-03-20T07:02:33Z","access_level":"closed","file_id":"1388","file_name":"387-a24-awerbuch_2_.pdf","file_size":521454}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"387","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:02:33Z"},{"language":[{"iso":"eng"}],"_id":"3877","department":[{"_id":"600"}],"user_id":"82920","status":"public","publication":"Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers","type":"conference","title":"Modeling Review Argumentation for Robust Sentiment Analysis","main_file_link":[{"url":"https://www.aclweb.org/anthology/C14-1053.pdf"}],"date_updated":"2022-01-06T06:59:47Z","date_created":"2018-08-11T16:13:24Z","author":[{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"last_name":"Trenkmann","full_name":"Trenkmann, Martin","first_name":"Martin"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"year":"2014","page":"553-564","citation":{"apa":"Wachsmuth, H., Trenkmann, M., Stein, B., &#38; Engels, G. (2014). Modeling Review Argumentation for Robust Sentiment Analysis. In <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i> (pp. 553–564).","short":"H. Wachsmuth, M. Trenkmann, B. Stein, G. Engels, in: Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers, 2014, pp. 553–564.","mla":"Wachsmuth, Henning, et al. “Modeling Review Argumentation for Robust Sentiment Analysis.” <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 2014, pp. 553–64.","bibtex":"@inproceedings{Wachsmuth_Trenkmann_Stein_Engels_2014, title={Modeling Review Argumentation for Robust Sentiment Analysis}, booktitle={Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers}, author={Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and Engels, Gregor}, year={2014}, pages={553–564} }","ama":"Wachsmuth H, Trenkmann M, Stein B, Engels G. Modeling Review Argumentation for Robust Sentiment Analysis. In: <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>. ; 2014:553-564.","chicago":"Wachsmuth, Henning, Martin Trenkmann, Benno Stein, and Gregor Engels. “Modeling Review Argumentation for Robust Sentiment Analysis.” In <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 553–64, 2014.","ieee":"H. Wachsmuth, M. Trenkmann, B. Stein, and G. Engels, “Modeling Review Argumentation for Robust Sentiment Analysis,” in <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 2014, pp. 553–564."}},{"type":"report","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"389-201x_-_Stapel__Suhl_-_Ontology-based_Representation_of_Optimization_Models.pdf","file_id":"1386","file_size":595852,"date_created":"2018-03-20T07:01:29Z","creator":"florida","date_updated":"2018-03-20T07:01:29Z"}],"status":"public","abstract":[{"lang":"eng","text":"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."}],"user_id":"15504","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"389","file_date_updated":"2018-03-20T07:01:29Z","ddc":["040"],"has_accepted_license":"1","citation":{"chicago":"Stapel, Florian, and Lena Suhl. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn, 2014.","ieee":"F. Stapel and L. Suhl, <i>Ontology-based Representation of Optimization Models</i>. Universität Paderborn, 2014.","ama":"Stapel F, Suhl L. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn; 2014.","mla":"Stapel, Florian, and Lena Suhl. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn, 2014.","short":"F. Stapel, L. Suhl, Ontology-Based Representation of Optimization Models, Universität Paderborn, 2014.","bibtex":"@book{Stapel_Suhl_2014, title={Ontology-based Representation of Optimization Models}, publisher={Universität Paderborn}, author={Stapel, Florian and Suhl, Lena}, year={2014} }","apa":"Stapel, F., &#38; Suhl, L. (2014). <i>Ontology-based Representation of Optimization Models</i>. Universität Paderborn."},"year":"2014","date_created":"2017-10-17T12:42:07Z","author":[{"full_name":"Stapel, Florian","last_name":"Stapel","first_name":"Florian"},{"first_name":"Lena","full_name":"Suhl, Lena","last_name":"Suhl"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:49Z","title":"Ontology-based Representation of Optimization Models"},{"keyword":["tet_topic_waveguide","tet_topic_numerics"],"ddc":["530"],"language":[{"iso":"eng"}],"publication":"Optics Communications","abstract":[{"lang":"eng","text":"The incidenceofthin-film-guided, in-planeunguidedwavesatobliqueanglesonstraightdiscontinuities of dielectricslabwaveguides,anearlyproblemofintegratedoptics,isbeingre-considered.The3-D frequencydomainMaxwellequationsreducetoaparametrizedinhomogeneousvectorialproblemona\r\n2-D computationaldomain,withtransparent-influx boundaryconditions.Weproposearigorousvec-\r\ntorial solverbasedonsimultaneousexpansionsintopolarizedlocalslabeigenmodesalongthetwo\r\northogonal crosssectioncoordinates(quadridirectionaleigenmodepropagationQUEP).Thequasi-ana-\r\nlytical schemeisapplicabletoconfigurations with — in principle — arbitrary crosssectiongeometries.\r\nExamples forahigh-contrastfacetofanasymmetricslabwaveguide,forthelateralexcitationofa\r\nchannel waveguide,andforastepdiscontinuitybetweenslabwaveguidesofdifferentthicknessesare\r\ndiscussed."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"hclaudia","date_created":"2018-08-13T09:29:14Z","date_updated":"2018-08-13T09:29:14Z","file_id":"3891","access_level":"closed","file_name":"2015 Hammer_Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities_A vectorial QUEP solver_Optics communications.pdf","file_size":1872449}],"publisher":"Elsevier BV","date_created":"2018-08-13T09:28:01Z","title":"Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver","year":"2014","_id":"3890","department":[{"_id":"61"}],"user_id":"55706","article_type":"original","file_date_updated":"2018-08-13T09:29:14Z","type":"journal_article","status":"public","date_updated":"2022-01-06T06:59:50Z","volume":338,"author":[{"orcid":"0000-0002-6331-9348","last_name":"Hammer","id":"48077","full_name":"Hammer, Manfred","first_name":"Manfred"}],"doi":"10.1016/j.optcom.2014.09.087","has_accepted_license":"1","publication_identifier":{"issn":["0030-4018"]},"publication_status":"published","page":"447-456","intvolume":"       338","citation":{"apa":"Hammer, M. (2014). Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver. <i>Optics Communications</i>, <i>338</i>, 447–456. <a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">https://doi.org/10.1016/j.optcom.2014.09.087</a>","short":"M. Hammer, Optics Communications 338 (2014) 447–456.","bibtex":"@article{Hammer_2014, title={Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver}, volume={338}, DOI={<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>}, journal={Optics Communications}, publisher={Elsevier BV}, author={Hammer, Manfred}, year={2014}, pages={447–456} }","mla":"Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular Slab Waveguide Discontinuities: A Vectorial QUEP Solver.” <i>Optics Communications</i>, vol. 338, Elsevier BV, 2014, pp. 447–56, doi:<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>.","ama":"Hammer M. Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver. <i>Optics Communications</i>. 2014;338:447-456. doi:<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>","chicago":"Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular Slab Waveguide Discontinuities: A Vectorial QUEP Solver.” <i>Optics Communications</i> 338 (2014): 447–56. <a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">https://doi.org/10.1016/j.optcom.2014.09.087</a>.","ieee":"M. Hammer, “Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver,” <i>Optics Communications</i>, vol. 338, pp. 447–456, 2014."}},{"publisher":"Springer","date_created":"2017-10-17T12:42:08Z","title":"On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains","issue":"3-4","year":"2014","ddc":["040"],"language":[{"iso":"eng"}],"publication":"Computer Science - Research and Development","abstract":[{"text":"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. ","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":4644980,"access_level":"closed","file_name":"390-HGE14.pdf","file_id":"1385","date_updated":"2018-03-20T07:00:58Z","creator":"florida","date_created":"2018-03-20T07:00:58Z"}],"date_updated":"2022-01-06T06:59:52Z","author":[{"first_name":"Zille","last_name":"Huma","full_name":"Huma, Zille"},{"last_name":"Gerth","full_name":"Gerth, Christian","first_name":"Christian"},{"full_name":"Engels, Gregor","id":"107","last_name":"Engels","first_name":"Gregor"}],"doi":"10.1007/s00450-014-0254-z","has_accepted_license":"1","page":"333-361","citation":{"chicago":"Huma, Zille, Christian Gerth, and Gregor Engels. “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains.” <i>Computer Science - Research and Development</i>, no. 3–4 (2014): 333–61. <a href=\"https://doi.org/10.1007/s00450-014-0254-z\">https://doi.org/10.1007/s00450-014-0254-z</a>.","ieee":"Z. Huma, C. Gerth, and G. Engels, “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains,” <i>Computer Science - Research and Development</i>, no. 3–4, pp. 333–361, 2014.","ama":"Huma Z, Gerth C, Engels G. On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains. <i>Computer Science - Research and Development</i>. 2014;(3-4):333-361. doi:<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>","apa":"Huma, Z., Gerth, C., &#38; Engels, G. (2014). On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains. <i>Computer Science - Research and Development</i>, (3–4), 333–361. <a href=\"https://doi.org/10.1007/s00450-014-0254-z\">https://doi.org/10.1007/s00450-014-0254-z</a>","mla":"Huma, Zille, et al. “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains.” <i>Computer Science - Research and Development</i>, no. 3–4, Springer, 2014, pp. 333–61, doi:<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>.","short":"Z. Huma, C. Gerth, G. Engels, Computer Science - Research and Development (2014) 333–361.","bibtex":"@article{Huma_Gerth_Engels_2014, title={On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains}, DOI={<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>}, number={3–4}, journal={Computer Science - Research and Development}, publisher={Springer}, author={Huma, Zille and Gerth, Christian and Engels, Gregor}, year={2014}, pages={333–361} }"},"_id":"390","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"66"}],"user_id":"477","file_date_updated":"2018-03-20T07:00:58Z","type":"journal_article","status":"public"},{"year":"2014","citation":{"apa":"Abu Quba Rana, C., Hassas, S., Usama, F., Alshomary, M., &#38; Gertosio, C. (2014). iSoNTRE: The Social Network Transformer into Recommendation Engine. <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 169–175.","short":"C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, C. Gertosio, 2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA) (2014) 169–175.","mla":"Abu Quba Rana, Chamsi, et al. “ISoNTRE: The Social Network Transformer into Recommendation Engine.” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 2014, pp. 169–75.","bibtex":"@article{Abu Quba Rana_Hassas_Usama_Alshomary_Gertosio_2014, title={iSoNTRE: The Social Network Transformer into Recommendation Engine}, journal={2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)}, author={Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary, Milad and Gertosio, Christine}, year={2014}, pages={169–175} }","ama":"Abu Quba Rana C, Hassas S, Usama F, Alshomary M, Gertosio C. iSoNTRE: The Social Network Transformer into Recommendation Engine. <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>. 2014:169-175.","chicago":"Abu Quba Rana, Chamsi, Salima Hassas, Fayyad Usama, Milad Alshomary, and Christine Gertosio. “ISoNTRE: The Social Network Transformer into Recommendation Engine.” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 2014, 169–75.","ieee":"C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, and C. Gertosio, “iSoNTRE: The Social Network Transformer into Recommendation Engine,” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, pp. 169–175, 2014."},"page":"169-175","date_updated":"2022-01-06T06:59:54Z","author":[{"first_name":"Chamsi","full_name":"Abu Quba Rana, Chamsi","last_name":"Abu Quba Rana"},{"first_name":"Salima","full_name":"Hassas, Salima","last_name":"Hassas"},{"first_name":"Fayyad","last_name":"Usama","full_name":"Usama, Fayyad"},{"last_name":"Alshomary","full_name":"Alshomary, Milad","id":"73059","first_name":"Milad"},{"first_name":"Christine","last_name":"Gertosio","full_name":"Gertosio, Christine"}],"date_created":"2018-08-14T13:35:39Z","title":"iSoNTRE: The Social Network Transformer into Recommendation Engine","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/7073195"}],"type":"journal_article","publication":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","status":"public","_id":"3905","user_id":"73059","department":[{"_id":"600"}],"language":[{"iso":"eng"}]},{"year":"2014","status":"public","citation":{"chicago":"Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014.","ieee":"B. Feldkord, <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014.","ama":"Feldkord B. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn; 2014.","apa":"Feldkord, B. (2014). <i>On Variants of the Page Migration Problem</i>. Universität Paderborn.","bibtex":"@book{Feldkord_2014, title={On Variants of the Page Migration Problem}, publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2014} }","short":"B. Feldkord, On Variants of the Page Migration Problem, Universität Paderborn, 2014.","mla":"Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014."},"type":"mastersthesis","title":"On Variants of the Page Migration Problem","_id":"391","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T06:59:54Z","publisher":"Universität Paderborn","author":[{"last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn","first_name":"Björn"}],"date_created":"2017-10-17T12:42:08Z","user_id":"477"},{"citation":{"chicago":"Davis, Niki, and Birgit Eickelmann. “The Restructuring of Schooling with Digital Technologies and Implications for Policy Makers and Practitioners.” In <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. Philadelphia, PA, 2014.","ieee":"N. Davis and B. Eickelmann, “The restructuring of schooling with digital technologies and implications for policy makers and practitioners,” 2014.","ama":"Davis N, Eickelmann B. The restructuring of schooling with digital technologies and implications for policy makers and practitioners. In: <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. ; 2014.","apa":"Davis, N., &#38; Eickelmann, B. (2014). The restructuring of schooling with digital technologies and implications for policy makers and practitioners. <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>.","mla":"Davis, Niki, and Birgit Eickelmann. “The Restructuring of Schooling with Digital Technologies and Implications for Policy Makers and Practitioners.” <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>, 2014.","short":"N. Davis, B. Eickelmann, in: Proceedings of the American Educational Research Association Annual Meeting (AERA), Philadelphia, PA, 2014.","bibtex":"@inproceedings{Davis_Eickelmann_2014, place={Philadelphia, PA}, title={The restructuring of schooling with digital technologies and implications for policy makers and practitioners}, booktitle={Proceedings of the American Educational Research Association annual meeting (AERA)}, author={Davis, Niki and Eickelmann, Birgit}, year={2014} }"},"place":"Philadelphia, PA","year":"2014","title":"The restructuring of schooling with digital technologies and implications for policy makers and practitioners","author":[{"first_name":"Niki","last_name":"Davis","full_name":"Davis, Niki"},{"id":"40387","full_name":"Eickelmann, Birgit","last_name":"Eickelmann","first_name":"Birgit"}],"date_created":"2021-12-15T10:20:04Z","date_updated":"2022-01-06T06:58:41Z","status":"public","publication":"Proceedings of the American Educational Research Association annual meeting (AERA)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"462"}],"user_id":"50923","_id":"28936"},{"status":"public","type":"conference","publication":"Proceedings of the American Educational Research Association annual meeting (AERA)","extern":"1","language":[{"iso":"eng"}],"_id":"28937","user_id":"50923","department":[{"_id":"462"}],"place":"Philadelphia, PA","year":"2014","citation":{"ieee":"B. Eickelmann, M. Vennemann, J. Gerick, and R. Lorenz, “Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011,” 2014.","chicago":"Eickelmann, Birgit, Mario Vennemann, Julia Gerick, and Ramona Lorenz. “Computer and Internet in Primary Mathematics and Science Education and Its Relationship with Student Achievement– International Findings from TIMSS 2011.” In <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. Philadelphia, PA, 2014.","ama":"Eickelmann B, Vennemann M, Gerick J, Lorenz R. Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011. In: <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. ; 2014.","apa":"Eickelmann, B., Vennemann, M., Gerick, J., &#38; Lorenz, R. (2014). Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011. <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>.","mla":"Eickelmann, Birgit, et al. “Computer and Internet in Primary Mathematics and Science Education and Its Relationship with Student Achievement– International Findings from TIMSS 2011.” <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>, 2014.","bibtex":"@inproceedings{Eickelmann_Vennemann_Gerick_Lorenz_2014, place={Philadelphia, PA}, title={Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011}, booktitle={Proceedings of the American Educational Research Association annual meeting (AERA)}, author={Eickelmann, Birgit and Vennemann, Mario and Gerick, Julia and Lorenz, Ramona}, year={2014} }","short":"B. Eickelmann, M. Vennemann, J. Gerick, R. Lorenz, in: Proceedings of the American Educational Research Association Annual Meeting (AERA), Philadelphia, PA, 2014."},"title":"Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011","date_updated":"2022-01-06T06:58:41Z","author":[{"full_name":"Eickelmann, Birgit","id":"40387","last_name":"Eickelmann","first_name":"Birgit"},{"full_name":"Vennemann, Mario","last_name":"Vennemann","first_name":"Mario"},{"last_name":"Gerick","full_name":"Gerick, Julia","first_name":"Julia"},{"full_name":"Lorenz, Ramona","last_name":"Lorenz","first_name":"Ramona"}],"date_created":"2021-12-15T10:22:25Z"},{"status":"public","type":"conference","publication":"Proceedings of the American Educational Research Association annual meeting (AERA)","language":[{"iso":"eng"}],"_id":"28938","user_id":"50923","department":[{"_id":"462"}],"year":"2014","place":"Philadelphia, PA","citation":{"apa":"Vennemann, M., &#38; Eickelmann, B. (2014). Can we predict usage out of possession? – A home digital resources (HDR) scale to describe students’ digital learning resources in primary schools. <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>.","mla":"Vennemann, Mario, and Birgit Eickelmann. “Can We Predict Usage out of Possession? – A Home Digital Resources (HDR) Scale to Describe Students’ Digital Learning Resources in Primary Schools.” <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>, 2014.","bibtex":"@inproceedings{Vennemann_Eickelmann_2014, place={Philadelphia, PA}, title={Can we predict usage out of possession? – A home digital resources (HDR) scale to describe students’ digital learning resources in primary schools}, booktitle={Proceedings of the American Educational Research Association annual meeting (AERA)}, author={Vennemann, Mario and Eickelmann, Birgit}, year={2014} }","short":"M. Vennemann, B. Eickelmann, in: Proceedings of the American Educational Research Association Annual Meeting (AERA), Philadelphia, PA, 2014.","ama":"Vennemann M, Eickelmann B. Can we predict usage out of possession? – A home digital resources (HDR) scale to describe students’ digital learning resources in primary schools. In: <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. ; 2014.","ieee":"M. Vennemann and B. Eickelmann, “Can we predict usage out of possession? – A home digital resources (HDR) scale to describe students’ digital learning resources in primary schools,” 2014.","chicago":"Vennemann, Mario, and Birgit Eickelmann. “Can We Predict Usage out of Possession? – A Home Digital Resources (HDR) Scale to Describe Students’ Digital Learning Resources in Primary Schools.” In <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. Philadelphia, PA, 2014."},"title":"Can we predict usage out of possession? – A home digital resources (HDR) scale to describe students’ digital learning resources in primary schools","date_updated":"2022-01-06T06:58:41Z","date_created":"2021-12-15T10:24:08Z","author":[{"first_name":"Mario","full_name":"Vennemann, Mario","last_name":"Vennemann"},{"first_name":"Birgit","full_name":"Eickelmann, Birgit","id":"40387","last_name":"Eickelmann"}]},{"type":"conference","publication":"Proceedings of KeyCIT Conference 2014","status":"public","_id":"28939","user_id":"50923","department":[{"_id":"462"}],"language":[{"iso":"eng"}],"year":"2014","citation":{"apa":"Lai, K.-W., Eickelmann, B., Fisser, P., Khaddage, F., Knezek, G., Webb, M., Davis, N., Erstad, O., &#38; Gibson, D. C. (2014). Tackling Educational Challenges in a Digitally Networked World: Strategies developed from the EDUsummIT 2013. <i>Proceedings of KeyCIT Conference 2014</i>.","mla":"Lai, Kwok-Wing, et al. “Tackling Educational Challenges in a Digitally Networked World: Strategies Developed from the EDUsummIT 2013.” <i>Proceedings of KeyCIT Conference 2014</i>, 2014.","bibtex":"@inproceedings{Lai_Eickelmann_Fisser_Khaddage_Knezek_Webb_Davis_Erstad_Gibson_2014, title={Tackling Educational Challenges in a Digitally Networked World: Strategies developed from the EDUsummIT 2013}, booktitle={Proceedings of KeyCIT Conference 2014}, 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.}, year={2014} }","short":"K.-W. Lai, B. Eickelmann, P. Fisser, F. Khaddage, G. Knezek, M. Webb, N. Davis, O. Erstad, D.C. Gibson, in: Proceedings of KeyCIT Conference 2014, 2014.","ama":"Lai K-W, Eickelmann B, Fisser P, et al. Tackling Educational Challenges in a Digitally Networked World: Strategies developed from the EDUsummIT 2013. In: <i>Proceedings of KeyCIT Conference 2014</i>. ; 2014.","chicago":"Lai, Kwok-Wing, Birgit Eickelmann, Petra Fisser, Ferial Khaddage, Gerald Knezek, Mary Webb, Niki Davis, Ola Erstad, and David C. Gibson. “Tackling Educational Challenges in a Digitally Networked World: Strategies Developed from the EDUsummIT 2013.” In <i>Proceedings of KeyCIT Conference 2014</i>, 2014.","ieee":"K.-W. Lai <i>et al.</i>, “Tackling Educational Challenges in a Digitally Networked World: Strategies developed from the EDUsummIT 2013,” 2014."},"date_updated":"2022-01-06T06:58:41Z","author":[{"last_name":"Lai","full_name":"Lai, Kwok-Wing","first_name":"Kwok-Wing"},{"full_name":"Eickelmann, Birgit","id":"40387","last_name":"Eickelmann","first_name":"Birgit"},{"full_name":"Fisser, Petra","last_name":"Fisser","first_name":"Petra"},{"first_name":"Ferial","last_name":"Khaddage","full_name":"Khaddage, Ferial"},{"last_name":"Knezek","full_name":"Knezek, Gerald","first_name":"Gerald"},{"first_name":"Mary","last_name":"Webb","full_name":"Webb, Mary"},{"first_name":"Niki","last_name":"Davis","full_name":"Davis, Niki"},{"full_name":"Erstad, Ola","last_name":"Erstad","first_name":"Ola"},{"full_name":"Gibson, David C.","last_name":"Gibson","first_name":"David C."}],"date_created":"2021-12-15T10:26:49Z","title":"Tackling Educational Challenges in a Digitally Networked World: Strategies developed from the EDUsummIT 2013"},{"citation":{"ama":"Drossel K, Bos W, Zieger L. <i>Kinder- Und Jugendarbeit in Dortmund. Studie Zur Situation Freiwillig Mitarbeitender in Der Dortmunder Kinder- Und Jugendarbeit</i>. Jugendring Dortmund; 2014.","chicago":"Drossel, Kerstin, Wilfried Bos, and Laura Zieger. <i>Kinder- Und Jugendarbeit in Dortmund. Studie Zur Situation Freiwillig Mitarbeitender in Der Dortmunder Kinder- Und Jugendarbeit</i>. Jugendring Dortmund, 2014.","ieee":"K. Drossel, W. Bos, and L. Zieger, <i>Kinder- und Jugendarbeit in Dortmund. Studie zur Situation freiwillig Mitarbeitender in der Dortmunder Kinder- und Jugendarbeit</i>. Jugendring Dortmund, 2014.","apa":"Drossel, K., Bos, W., &#38; Zieger, L. (2014). <i>Kinder- und Jugendarbeit in Dortmund. Studie zur Situation freiwillig Mitarbeitender in der Dortmunder Kinder- und Jugendarbeit</i>. Jugendring Dortmund.","bibtex":"@book{Drossel_Bos_Zieger_2014, title={Kinder- und Jugendarbeit in Dortmund. Studie zur Situation freiwillig Mitarbeitender in der Dortmunder Kinder- und Jugendarbeit}, publisher={Jugendring Dortmund}, author={Drossel, Kerstin and Bos, Wilfried and Zieger, Laura}, year={2014} }","short":"K. Drossel, W. Bos, L. Zieger, Kinder- Und Jugendarbeit in Dortmund. Studie Zur Situation Freiwillig Mitarbeitender in Der Dortmunder Kinder- Und Jugendarbeit, Jugendring Dortmund, 2014.","mla":"Drossel, Kerstin, et al. <i>Kinder- Und Jugendarbeit in Dortmund. Studie Zur Situation Freiwillig Mitarbeitender in Der Dortmunder Kinder- Und Jugendarbeit</i>. Jugendring Dortmund, 2014."},"year":"2014","title":"Kinder- und Jugendarbeit in Dortmund. Studie zur Situation freiwillig Mitarbeitender in der Dortmunder Kinder- und Jugendarbeit","author":[{"first_name":"Kerstin","id":"48921","full_name":"Drossel, Kerstin","last_name":"Drossel"},{"last_name":"Bos","full_name":"Bos, Wilfried","first_name":"Wilfried"},{"full_name":"Zieger, Laura","last_name":"Zieger","first_name":"Laura"}],"date_created":"2021-12-15T17:19:00Z","date_updated":"2022-01-06T06:58:43Z","publisher":"Jugendring Dortmund","status":"public","type":"research_data","department":[{"_id":"462"}],"user_id":"50923","_id":"28993"},{"title":"A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures","date_updated":"2022-01-06T06:58:44Z","date_created":"2018-05-25T09:45:38Z","author":[{"first_name":"Sascha","last_name":"Brauer","full_name":"Brauer, Sascha","id":"13291"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"year":"2014","citation":{"ama":"Brauer S. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.; 2014.","chicago":"Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>, 2014.","ieee":"S. Brauer, <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>. 2014.","apa":"Brauer, S. (2014). <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.","short":"S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures, 2014.","mla":"Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>. 2014.","bibtex":"@book{Brauer_2014, title={A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures}, author={Brauer, Sascha}, year={2014} }"},"has_accepted_license":"1","ddc":["000"],"file_date_updated":"2018-05-25T09:45:33Z","_id":"2900","department":[{"_id":"64"}],"user_id":"25078","status":"public","file":[{"creator":"feidens","date_created":"2018-05-25T09:45:33Z","date_updated":"2018-05-25T09:45:33Z","file_id":"2901","file_name":"2014_Brauer_AProbabilisticExpectationMaximizationAlgorithmForMultivariateLaplacianMixtures.pdf","access_level":"closed","file_size":971935,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"mastersthesis"},{"citation":{"ieee":"M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative Clustering,” <i>Algorithmica</i>, vol. 69, 2014.","chicago":"Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.” <i>Algorithmica</i> 69 (2014). <a href=\"https://doi.org/10.1007/s00453-012-9717-4\">https://doi.org/10.1007/s00453-012-9717-4</a>.","ama":"Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering. <i>Algorithmica</i>. 2014;69. doi:<a href=\"https://doi.org/10.1007/s00453-012-9717-4\">10.1007/s00453-012-9717-4</a>","apa":"Ackermann, M. R., Blömer, J., Kuntze, D., &#38; Sohler, C. (2014). Analysis of Agglomerative Clustering. <i>Algorithmica</i>, <i>69</i>. <a href=\"https://doi.org/10.1007/s00453-012-9717-4\">https://doi.org/10.1007/s00453-012-9717-4</a>","short":"M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).","bibtex":"@article{Ackermann_Blömer_Kuntze_Sohler_2014, title={Analysis of Agglomerative Clustering}, volume={69}, DOI={<a href=\"https://doi.org/10.1007/s00453-012-9717-4\">10.1007/s00453-012-9717-4</a>}, journal={Algorithmica}, publisher={Springer US}, author={Ackermann, Marcel Rudolf and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}, year={2014} }","mla":"Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.” <i>Algorithmica</i>, vol. 69, Springer US, 2014, doi:<a href=\"https://doi.org/10.1007/s00453-012-9717-4\">10.1007/s00453-012-9717-4</a>."},"intvolume":"        69","year":"2014","publication_status":"published","publication_identifier":{"eissn":["0178-4617"]},"doi":"10.1007/s00453-012-9717-4","title":"Analysis of Agglomerative Clustering","date_created":"2018-06-05T07:28:52Z","author":[{"first_name":"Marcel Rudolf","full_name":"Ackermann, Marcel Rudolf","last_name":"Ackermann"},{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Daniel","full_name":"Kuntze, Daniel","last_name":"Kuntze"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"volume":69,"publisher":"Springer US","date_updated":"2022-01-06T06:58:49Z","status":"public","type":"journal_article","publication":"Algorithmica","user_id":"25078","department":[{"_id":"64"}],"_id":"2976"},{"publication_status":"published","publication_identifier":{"isbn":["9781479952090"]},"year":"2014","citation":{"ama":"Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In: <i>2014 22nd International Conference on Pattern Recognition</i>. IEEE; 2014. doi:<a href=\"https://doi.org/10.1109/icpr.2014.253\">10.1109/icpr.2014.253</a>","ieee":"J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison of the EM and SEM Algorithm,” in <i>2014 22nd International Conference on Pattern Recognition</i>, 2014.","chicago":"Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” In <i>2014 22nd International Conference on Pattern Recognition</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/icpr.2014.253\">https://doi.org/10.1109/icpr.2014.253</a>.","bibtex":"@inproceedings{Blömer_Bujna_Kuntze_2014, title={A Theoretical and Experimental Comparison of the EM and SEM Algorithm}, DOI={<a href=\"https://doi.org/10.1109/icpr.2014.253\">10.1109/icpr.2014.253</a>}, booktitle={2014 22nd International Conference on Pattern Recognition}, publisher={IEEE}, author={Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}, year={2014} }","short":"J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on Pattern Recognition, IEEE, 2014.","mla":"Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” <i>2014 22nd International Conference on Pattern Recognition</i>, IEEE, 2014, doi:<a href=\"https://doi.org/10.1109/icpr.2014.253\">10.1109/icpr.2014.253</a>.","apa":"Blömer, J., Bujna, K., &#38; Kuntze, D. (2014). A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In <i>2014 22nd International Conference on Pattern Recognition</i>. IEEE. <a href=\"https://doi.org/10.1109/icpr.2014.253\">https://doi.org/10.1109/icpr.2014.253</a>"},"publisher":"IEEE","date_updated":"2022-01-06T06:58:49Z","date_created":"2018-06-05T07:29:15Z","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"},{"first_name":"Daniel","last_name":"Kuntze","full_name":"Kuntze, Daniel"}],"title":"A Theoretical and Experimental Comparison of the EM and SEM Algorithm","doi":"10.1109/icpr.2014.253","type":"conference","publication":"2014 22nd International Conference on Pattern Recognition","status":"public","_id":"2977","user_id":"25078","department":[{"_id":"64"}]},{"issue":"7","year":"2014","citation":{"chicago":"Jager, Tibor. “Die Zukunft Der Kryptographie.” <i>Datenschutz Und Datensicherheit</i>, no. 7 (2014): 445--451. <a href=\"https://doi.org/10.1007/s11623-014-0204-8\">https://doi.org/10.1007/s11623-014-0204-8</a>.","ieee":"T. Jager, “Die Zukunft der Kryptographie,” <i>Datenschutz und Datensicherheit</i>, no. 7, pp. 445--451, 2014.","ama":"Jager T. Die Zukunft der Kryptographie. <i>Datenschutz und Datensicherheit</i>. 2014;(7):445--451. doi:<a href=\"https://doi.org/10.1007/s11623-014-0204-8\">10.1007/s11623-014-0204-8</a>","mla":"Jager, Tibor. “Die Zukunft Der Kryptographie.” <i>Datenschutz Und Datensicherheit</i>, no. 7, 2014, pp. 445--451, doi:<a href=\"https://doi.org/10.1007/s11623-014-0204-8\">10.1007/s11623-014-0204-8</a>.","bibtex":"@article{Jager_2014, title={Die Zukunft der Kryptographie}, DOI={<a href=\"https://doi.org/10.1007/s11623-014-0204-8\">10.1007/s11623-014-0204-8</a>}, number={7}, journal={Datenschutz und Datensicherheit}, author={Jager, Tibor}, year={2014}, pages={445--451} }","short":"T. Jager, Datenschutz Und Datensicherheit (2014) 445--451.","apa":"Jager, T. (2014). Die Zukunft der Kryptographie. <i>Datenschutz Und Datensicherheit</i>, (7), 445--451. <a href=\"https://doi.org/10.1007/s11623-014-0204-8\">https://doi.org/10.1007/s11623-014-0204-8</a>"},"page":"445--451","date_updated":"2022-01-06T06:58:57Z","author":[{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"}],"date_created":"2018-06-07T09:21:18Z","title":"Die Zukunft der Kryptographie","doi":"10.1007/s11623-014-0204-8","type":"journal_article","publication":"Datenschutz und Datensicherheit","status":"public","_id":"3127","user_id":"38235","department":[{"_id":"558"}],"extern":"1"},{"date_created":"2018-06-07T09:21:46Z","author":[{"first_name":"Nils","full_name":"Fleischhacker, Nils","last_name":"Fleischhacker"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"last_name":"Schröder","full_name":"Schröder, Dominique","first_name":"Dominique"}],"date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-45611-8_27","title":"On Tight Security Proofs for Schnorr Signatures","page":"512--531","citation":{"chicago":"Fleischhacker, Nils, Tibor Jager, and Dominique Schröder. “On Tight Security Proofs for Schnorr Signatures.” In <i>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</i>, 512--531, 2014. <a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">https://doi.org/10.1007/978-3-662-45611-8_27</a>.","ieee":"N. Fleischhacker, T. Jager, and D. Schröder, “On Tight Security Proofs for Schnorr Signatures,” in <i>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</i>, 2014, pp. 512--531.","ama":"Fleischhacker N, Jager T, Schröder D. On Tight Security Proofs for Schnorr Signatures. In: <i>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</i>. ; 2014:512--531. doi:<a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">10.1007/978-3-662-45611-8_27</a>","short":"N. Fleischhacker, T. Jager, D. Schröder, in: 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, 2014, pp. 512--531.","bibtex":"@inproceedings{Fleischhacker_Jager_Schröder_2014, title={On Tight Security Proofs for Schnorr Signatures}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">10.1007/978-3-662-45611-8_27</a>}, 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}, author={Fleischhacker, Nils and Jager, Tibor and Schröder, Dominique}, year={2014}, pages={512--531} }","mla":"Fleischhacker, Nils, et al. “On Tight Security Proofs for Schnorr Signatures.” <i>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</i>, 2014, pp. 512--531, doi:<a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">10.1007/978-3-662-45611-8_27</a>.","apa":"Fleischhacker, N., Jager, T., &#38; Schröder, D. (2014). On Tight Security Proofs for Schnorr Signatures. In <i>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</i> (pp. 512--531). <a href=\"https://doi.org/10.1007/978-3-662-45611-8_27\">https://doi.org/10.1007/978-3-662-45611-8_27</a>"},"year":"2014","department":[{"_id":"558"}],"user_id":"38235","_id":"3128","extern":"1","publication":"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","type":"conference","status":"public"},{"status":"public","publication":"Formal Asp. Comput.","type":"journal_article","_id":"3167","department":[{"_id":"77"}],"user_id":"29719","year":"2014","page":"251--280","citation":{"bibtex":"@article{Schneider_Treharne_Wehrheim_2014, title={The behavioural semantics of Event-B refinement}, DOI={<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>}, number={2}, journal={Formal Asp. Comput.}, author={Schneider, Steve and Treharne, Helen and Wehrheim, Heike}, year={2014}, pages={251--280} }","mla":"Schneider, Steve, et al. “The Behavioural Semantics of Event-B Refinement.” <i>Formal Asp. Comput.</i>, no. 2, 2014, pp. 251--280, doi:<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>.","short":"S. Schneider, H. Treharne, H. Wehrheim, Formal Asp. Comput. (2014) 251--280.","apa":"Schneider, S., Treharne, H., &#38; Wehrheim, H. (2014). The behavioural semantics of Event-B refinement. <i>Formal Asp. Comput.</i>, (2), 251--280. <a href=\"https://doi.org/10.1007/s00165-012-0265-0\">https://doi.org/10.1007/s00165-012-0265-0</a>","ieee":"S. Schneider, H. Treharne, and H. Wehrheim, “The behavioural semantics of Event-B refinement,” <i>Formal Asp. Comput.</i>, no. 2, pp. 251--280, 2014.","chicago":"Schneider, Steve, Helen Treharne, and Heike Wehrheim. “The Behavioural Semantics of Event-B Refinement.” <i>Formal Asp. Comput.</i>, no. 2 (2014): 251--280. <a href=\"https://doi.org/10.1007/s00165-012-0265-0\">https://doi.org/10.1007/s00165-012-0265-0</a>.","ama":"Schneider S, Treharne H, Wehrheim H. The behavioural semantics of Event-B refinement. <i>Formal Asp Comput</i>. 2014;(2):251--280. doi:<a href=\"https://doi.org/10.1007/s00165-012-0265-0\">10.1007/s00165-012-0265-0</a>"},"issue":"2","title":"The behavioural semantics of Event-B refinement","doi":"10.1007/s00165-012-0265-0","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:55:10Z","author":[{"last_name":"Schneider","full_name":"Schneider, Steve","first_name":"Steve"},{"first_name":"Helen","full_name":"Treharne, Helen","last_name":"Treharne"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}]}]