[{"title":"Key Properties of Sustainable Business Ecosystem Relationships","conference":{"name":"Symplatform (Third Edition)"},"date_updated":"2022-11-17T14:23:02Z","author":[{"last_name":"Vorbohle","id":"29951","full_name":"Vorbohle, Christian","first_name":"Christian"},{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"}],"date_created":"2022-03-08T09:55:06Z","year":"2022","citation":{"ieee":"C. Vorbohle and D. Kundisch, “Key Properties of Sustainable Business Ecosystem Relationships,” presented at the Symplatform (Third Edition), 2022.","chicago":"Vorbohle, Christian, and Dennis Kundisch. “Key Properties of Sustainable Business Ecosystem Relationships,” 2022.","ama":"Vorbohle C, Kundisch D. Key Properties of Sustainable Business Ecosystem Relationships. In: ; 2022.","apa":"Vorbohle, C., &#38; Kundisch, D. (2022). <i>Key Properties of Sustainable Business Ecosystem Relationships</i>. Symplatform (Third Edition).","bibtex":"@inproceedings{Vorbohle_Kundisch_2022, title={Key Properties of Sustainable Business Ecosystem Relationships}, author={Vorbohle, Christian and Kundisch, Dennis}, year={2022} }","short":"C. Vorbohle, D. Kundisch, in: 2022.","mla":"Vorbohle, Christian, and Dennis Kundisch. <i>Key Properties of Sustainable Business Ecosystem Relationships</i>. 2022."},"language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"_id":"30212","user_id":"477","department":[{"_id":"276"}],"status":"public","type":"conference_abstract"},{"type":"conference","publication":"Proceedings of the 58th Allerton Conference on Communication, Control, and Computing","abstract":[{"lang":"eng","text":"The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\\Delta(n)$ is reset to one; otherwise, $\\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\\Delta(n)$ is itself $\\alpha$-mixing from which we conclude a strong law of large numbers for $\\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times."}],"status":"public","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"32811","user_id":"477","department":[{"_id":"75"}],"ddc":["000"],"language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2022","citation":{"bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}, booktitle={Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference on Communication, Control, and Computing, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. 58th Allerton Conference on Communication, Control, and Computing.","ama":"Redder A, Ramaswamy A, Karl H. Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. In: <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. ; 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law,” presented at the 58th Allerton Conference on Communication, Control, and Computing, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” In <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022."},"date_updated":"2022-11-18T09:31:19Z","author":[{"full_name":"Redder, Adrian","id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","first_name":"Adrian"},{"first_name":"Arunselvan","id":"66937","full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2022-08-15T09:59:17Z","title":"Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law","conference":{"name":"58th Allerton Conference on Communication, Control, and Computing"}},{"language":[{"iso":"eng"}],"ddc":["006"],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":298926,"file_id":"33237","access_level":"closed","file_name":"ICCART2022.pdf","date_updated":"2022-08-31T07:10:13Z","creator":"aredder","date_created":"2022-08-31T07:10:13Z"}],"publication":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","title":"Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication","date_created":"2022-04-06T07:18:36Z","publisher":"SCITEPRESS - Science and Technology Publications","year":"2022","file_date_updated":"2022-08-31T07:10:13Z","department":[{"_id":"75"}],"user_id":"477","_id":"30793","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"24","name":"NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"status":"public","type":"conference","doi":"10.5220/0010845400003116","author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688"},{"first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","id":"66937"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-11-18T09:32:14Z","citation":{"mla":"Redder, Adrian, et al. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>, SCITEPRESS - Science and Technology Publications, 2022, doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}, DOI={<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>}, booktitle={Proceedings of the 14th International Conference on Agents and Artificial Intelligence}, publisher={SCITEPRESS - Science and Technology Publications}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology Publications, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>","ama":"Redder A, Ramaswamy A, Karl H. Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. In: <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications; 2022. doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” In <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications, 2022. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication,” 2022, doi: <a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>."},"has_accepted_license":"1","publication_status":"published"},{"status":"public","abstract":[{"lang":"eng","text":"Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate with each other, over time, in order to minimize/maximize a global\r\nobjective. In the presence of unreliable communication networks, the\r\nAge-of-Information (AoI), which measures the freshness of data received, may be\r\nlarge and hence hinder algorithmic convergence. In this paper, we study the\r\nconvergence of general distributed gradient-based optimization algorithms in\r\nthe presence of communication that neither happens periodically nor at\r\nstochastically independent points in time. We show that convergence is\r\nguaranteed provided the random variables associated with the AoI processes are\r\nstochastically dominated by a random variable with finite first moment. This\r\nimproves on previous requirements of boundedness of more than the first moment.\r\nWe then introduce stochastically strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically dominated by a\r\nrandom variable with finite $p$-th moment. In combination with our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges in the presence of AoI, if $\\alpha(n)$ is summable."}],"type":"preprint","publication":"arXiv:2201.11343","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"75"}],"project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"30790","external_id":{"arxiv":["2201.11343"]},"citation":{"ama":"Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the presence of dependent  aperiodic communication. <i>arXiv:220111343</i>. Published online 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization in the presence of dependent  aperiodic communication,” <i>arXiv:2201.11343</i>. 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Distributed gradient-based optimization in the presence of dependent  aperiodic communication. In <i>arXiv:2201.11343</i>.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based optimization in the presence of dependent  aperiodic communication}, journal={arXiv:2201.11343}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).","mla":"Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022."},"year":"2022","title":"Distributed gradient-based optimization in the presence of dependent  aperiodic communication","author":[{"first_name":"Adrian","id":"52265","full_name":"Redder, Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder"},{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","id":"66937","full_name":"Ramaswamy, Arunselvan"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2022-04-06T06:53:38Z","date_updated":"2022-11-18T09:33:01Z"},{"_id":"30791","external_id":{"arxiv":["2201.00570"]},"project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"75"}],"user_id":"477","language":[{"iso":"eng"}],"publication":"arXiv:2201.00570","type":"preprint","abstract":[{"text":"We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous action spaces: the actor-critic paradigm. In the setting considered\r\nherein, each agent observes a part of the global state space in order to take\r\nlocal actions, for which it receives local rewards. For every agent, DDPG\r\ntrains a local actor (policy) and a local critic (Q-function). The analysis\r\nshows that multi-agent DDPG using neural networks to approximate the local\r\npolicies and critics converge to limits with the following properties: The\r\ncritic limits minimize the average squared Bellman loss; the actor limits\r\nparameterize a policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a\r\nprobability distribution over the global state-action space. It captures the\r\nasymptotics of all local training processes. Finally, we extend the analysis to\r\na fully decentralized setting where agents communicate over a wireless network\r\nprone to delays and losses; a typical scenario in, e.g., robotic applications.","lang":"eng"}],"status":"public","date_updated":"2022-11-18T09:33:42Z","author":[{"first_name":"Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","full_name":"Redder, Adrian","id":"52265"},{"first_name":"Arunselvan","full_name":"Ramaswamy, Arunselvan","id":"66937","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_created":"2022-04-06T06:53:52Z","title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","year":"2022","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. <i>arXiv:220100570</i>. Published online 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms,” <i>arXiv:2201.00570</i>. 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. In <i>arXiv:2201.00570</i>.","mla":"Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }"}},{"date_updated":"2022-11-18T09:38:04Z","date_created":"2022-07-20T09:36:39Z","author":[{"last_name":"Siek","full_name":"Siek, Hanna","first_name":"Hanna"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","year":"2022","citation":{"apa":"Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.","bibtex":"@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek, Hanna}, year={2022} }","mla":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","ieee":"H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","chicago":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.","ama":"Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.; 2022."},"_id":"32398","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"}],"department":[{"_id":"64"},{"_id":"7"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"title":"On Transforming Lattice-Based Cryptography to the Ring Setting","date_updated":"2022-11-18T09:40:28Z","author":[{"full_name":"Kramer, Paul","id":"64594","last_name":"Kramer","first_name":"Paul"}],"date_created":"2022-05-28T08:07:40Z","year":"2022","citation":{"apa":"Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.","bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","mla":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","ama":"Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.; 2022.","ieee":"P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","chicago":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>, 2022."},"extern":"1","language":[{"iso":"eng"}],"_id":"31485","project":[{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"name":"SFB 901: SFB 901","_id":"1"}],"department":[{"_id":"7"},{"_id":"64"}],"user_id":"477","status":"public","type":"mastersthesis"},{"conference":{"name":"IFAC Conference on Networked Systems"},"volume":55,"author":[{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian","first_name":"Adrian"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_updated":"2022-11-18T10:05:14Z","intvolume":"        55","page":"133–138","citation":{"mla":"Redder, Adrian, et al. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, Elsevier, 2022, pp. 133–138.","short":"A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine}, publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}, pages={133–138} }","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>, <i>55</i>(13), 133–138.","ama":"Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>. 2022;55(13):133–138.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i> 55, no. 13 (2022): 133–138.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the Convergence of Distributed Optimization,” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, pp. 133–138, 2022."},"has_accepted_license":"1","file_date_updated":"2022-08-31T07:06:30Z","department":[{"_id":"75"}],"user_id":"477","_id":"32854","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"status":"public","type":"journal_article","title":"Practical Network Conditions for the Convergence of Distributed Optimization","date_created":"2022-08-16T09:12:55Z","publisher":"Elsevier","year":"2022","issue":"13","language":[{"iso":"eng"}],"ddc":["006"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"33236","file_name":"NecSys2022____Practical_Conditions_for_Conv.pdf","access_level":"closed","file_size":298395,"creator":"aredder","date_created":"2022-08-31T07:06:30Z","date_updated":"2022-08-31T07:06:30Z"}],"publication":"IFAC-PapersOnLine"},{"page":"2071-2079","citation":{"mla":"Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2022, pp. 2071–79, doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","bibtex":"@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}, DOI={<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>}, booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079} }","short":"T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2022, pp. 2071–2079.","apa":"Hansmeier, T., Brede, M., &#38; Platzner, M. (2022). XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–2079. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>","chicago":"Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–79. New York, NY, United States: Association for Computing Machinery (ACM), 2022. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>.","ieee":"T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion,” in <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Boston, MA, USA, 2022, pp. 2071–2079, doi: <a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","ama":"Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. In: <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. Association for Computing Machinery (ACM); 2022:2071-2079. doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>"},"year":"2022","place":"New York, NY, United States","publication_status":"published","conference":{"end_date":"2022-07-13","location":"Boston, MA, USA","name":"International Workshop on Learning Classifier Systems (IWLCS 2022)","start_date":"2022-07-09"},"doi":"10.1145/3520304.3533977","title":"XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion","author":[{"first_name":"Tim","id":"49992","full_name":"Hansmeier, Tim","last_name":"Hansmeier","orcid":"0000-0003-1377-3339"},{"last_name":"Brede","full_name":"Brede, Mathis","first_name":"Mathis"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_created":"2022-09-02T11:47:17Z","publisher":"Association for Computing Machinery (ACM)","date_updated":"2022-11-18T10:13:22Z","status":"public","publication":"GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"477","_id":"33253","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}]},{"volume":244,"author":[{"last_name":"Maack","id":"88252","full_name":"Maack, Marten","first_name":"Marten"},{"id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"},{"full_name":"Rasmussen, Anna Rodriguez","last_name":"Rasmussen","first_name":"Anna Rodriguez"}],"date_created":"2022-09-27T13:06:05Z","date_updated":"2022-11-18T10:14:14Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.ESA.2022.77","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","intvolume":"       244","page":"77:1–77:13","citation":{"short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>.","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>"},"year":"2022","department":[{"_id":"63"}],"user_id":"477","series_title":"LIPIcs","_id":"33491","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"language":[{"iso":"eng"}],"publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","type":"conference","status":"public","editor":[{"first_name":"Shiri","full_name":"Chechik, Shiri","last_name":"Chechik"},{"last_name":"Navarro","full_name":"Navarro, Gonzalo","first_name":"Gonzalo"},{"first_name":"Eva","last_name":"Rotenberg","full_name":"Rotenberg, Eva"},{"last_name":"Herman","full_name":"Herman, Grzegorz","first_name":"Grzegorz"}]},{"abstract":[{"lang":"eng","text":"Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen den Trojaner ``Heimtückische LUT'' stellen wir die allererste erfolgreiche Gegenmaßnahme vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden."},{"lang":"eng","text":"The battle of developing hardware Trojans and corresponding countermeasures has taken adversaries towards ingenious ways of compromising hardware designs by circumventing even advanced testing and verification methods. Besides conventional methods of inserting Trojans into a design by a malicious entity, the design flow for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised to assist the attacker to perform a successful malfunctioning or information leakage attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable systems, the defenders perspective which corresponds to the bitstream-level Trojan detection technique, and the attackers perspective which corresponds to a novel FPGA Trojan attack. From the defender's perspective, we introduce a first-ever successful pre-configuration countermeasure against the ``Malicious LUT''-hardware Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers perspective, we present a novel attack that leverages malicious routing of the inserted Trojan circuit to acquire a dormant state even in the generated and transmitted bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected in the bitstream, the presented attack can currently neither be prevented by conventional testing and verification methods nor by bitstream-level verification techniques."}],"language":[{"iso":"eng"}],"ddc":["004"],"keyword":["FPGA Security","Hardware Trojans","Bitstream-level Trojans","Bitstream Verification"],"year":"2022","title":"Hardware Trojans in Reconfigurable Computing","date_created":"2022-02-07T14:02:36Z","publisher":" Paderborn University, Paderborn, Germany","status":"public","type":"dissertation","user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"}],"_id":"29769","citation":{"short":"Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing,  Paderborn University, Paderborn, Germany, Paderborn, 2022.","mla":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany, 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>.","bibtex":"@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable Computing}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>}, publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab}, year={2022} }","apa":"Ahmed, Q. A. (2022). <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>","ama":"Ahmed QA. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>","ieee":"Q. A. Ahmed, <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022.","chicago":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>."},"place":"Paderborn","publication_status":"published","has_accepted_license":"1","main_file_link":[{"url":"\turn:nbn:de:hbz:466:2-40303","open_access":"1"}],"doi":"10.17619/UNIPB/1-1271","supervisor":[{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"author":[{"full_name":"Ahmed, Qazi Arbab","id":"72764","orcid":"0000-0002-1837-2254","last_name":"Ahmed","first_name":"Qazi Arbab"}],"oa":"1","date_updated":"2022-11-30T13:39:01Z"},{"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Communications of the Association for Information Systems","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"Modeling Business Models_ A cross-disciplinary Analysis of Busine.pdf","access_level":"closed","file_id":"34788","file_size":3579895,"creator":"dsz","date_created":"2022-12-21T19:08:31Z","date_updated":"2022-12-21T19:08:31Z"}],"date_created":"2022-09-02T10:05:24Z","title":"Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research","year":"2022","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"_id":"33250","user_id":"36372","department":[{"_id":"276"}],"file_date_updated":"2022-12-21T19:08:31Z","type":"journal_article","status":"public","date_updated":"2022-12-21T19:08:47Z","author":[{"first_name":"Daniel","last_name":"Szopinski","id":"36372","full_name":"Szopinski, Daniel"},{"full_name":"Massa, Lorenzo","last_name":"Massa","first_name":"Lorenzo"},{"first_name":"Thomas","last_name":"John","full_name":"John, Thomas"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"},{"first_name":"Christopher","full_name":"Tucci, Christopher","last_name":"Tucci"}],"volume":51,"publication_status":"published","has_accepted_license":"1","citation":{"ieee":"D. Szopinski, L. Massa, T. John, D. Kundisch, and C. Tucci, “Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research,” <i>Communications of the Association for Information Systems</i>, vol. 51, pp. 774–841, 2022.","chicago":"Szopinski, Daniel, Lorenzo Massa, Thomas John, Dennis Kundisch, and Christopher Tucci. “Modeling Business Models: A Cross-Disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research.” <i>Communications of the Association for Information Systems</i> 51 (2022): 774–841.","ama":"Szopinski D, Massa L, John T, Kundisch D, Tucci C. Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research. <i>Communications of the Association for Information Systems</i>. 2022;51:774-841.","apa":"Szopinski, D., Massa, L., John, T., Kundisch, D., &#38; Tucci, C. (2022). Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research. <i>Communications of the Association for Information Systems</i>, <i>51</i>, 774–841.","mla":"Szopinski, Daniel, et al. “Modeling Business Models: A Cross-Disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research.” <i>Communications of the Association for Information Systems</i>, vol. 51, 2022, pp. 774–841.","short":"D. Szopinski, L. Massa, T. John, D. Kundisch, C. Tucci, Communications of the Association for Information Systems 51 (2022) 774–841.","bibtex":"@article{Szopinski_Massa_John_Kundisch_Tucci_2022, title={Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research}, volume={51}, journal={Communications of the Association for Information Systems}, author={Szopinski, Daniel and Massa, Lorenzo and John, Thomas and Kundisch, Dennis and Tucci, Christopher}, year={2022}, pages={774–841} }"},"page":"774-841","intvolume":"        51"},{"department":[{"_id":"75"}],"user_id":"35343","_id":"29220","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2022-01-11T08:39:57Z","type":"conference","status":"public","author":[{"first_name":"Stefan","full_name":"Werner, Stefan","last_name":"Werner"},{"last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-11T08:44:04Z","oa":"1","conference":{"start_date":"2022-04-25","name":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","location":"Budapest","end_date":"2022-04-29"},"has_accepted_license":"1","citation":{"apa":"Werner, S., Schneider, S. B., &#38; Karl, H. (2022). Use What You Know: Network and Service Coordination Beyond Certainty. <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest.","bibtex":"@inproceedings{Werner_Schneider_Karl_2022, title={Use What You Know: Network and Service Coordination Beyond Certainty}, booktitle={IEEE/IFIP Network Operations and Management Symposium (NOMS)}, publisher={IEEE}, author={Werner, Stefan and Schneider, Stefan Balthasar and Karl, Holger}, year={2022} }","short":"S. Werner, S.B. Schneider, H. Karl, in: IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2022.","mla":"Werner, Stefan, et al. “Use What You Know: Network and Service Coordination Beyond Certainty.” <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>, IEEE, 2022.","ama":"Werner S, Schneider SB, Karl H. Use What You Know: Network and Service Coordination Beyond Certainty. In: <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE; 2022.","chicago":"Werner, Stefan, Stefan Balthasar Schneider, and Holger Karl. “Use What You Know: Network and Service Coordination Beyond Certainty.” In <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE, 2022.","ieee":"S. Werner, S. B. Schneider, and H. Karl, “Use What You Know: Network and Service Coordination Beyond Certainty,” presented at the IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest, 2022."},"language":[{"iso":"eng"}],"keyword":["network management","service management","AI","Monte Carlo Tree Search","model-based","QoS"],"ddc":["004"],"publication":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","file":[{"relation":"main_file","content_type":"application/pdf","file_size":528653,"access_level":"open_access","file_id":"29222","file_name":"author_version.pdf","date_updated":"2022-01-11T08:39:57Z","creator":"stschn","date_created":"2022-01-11T08:39:57Z"}],"abstract":[{"text":"Modern services often comprise several components, such as chained virtual network functions, microservices, or\r\nmachine learning functions. Providing such services requires to decide how often to instantiate each component, where to place these instances in the network, how to chain them and route traffic through them. \r\nTo overcome limitations of conventional, hardwired heuristics, deep reinforcement learning (DRL) approaches for self-learning network and service management have emerged recently. These model-free DRL approaches are more flexible but typically learn tabula rasa, i.e., disregard existing understanding of networks, services, and their coordination. \r\n\r\nInstead, we propose FutureCoord, a novel model-based AI approach that leverages existing understanding of networks and services for more efficient and effective coordination without time-intensive training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic model. This allows FutureCoord to estimate the impact of future incoming traffic and effectively optimize long-term effects, taking fluctuating demand and Quality of Service (QoS) requirements into account. Our extensive evaluation based on real-world network topologies, services, and traffic traces indicates that FutureCoord clearly outperforms state-of-the-art model-free and model-based approaches with up to 51% higher flow success ratios.","lang":"eng"}],"date_created":"2022-01-11T08:43:26Z","publisher":"IEEE","title":"Use What You Know: Network and Service Coordination Beyond Certainty","quality_controlled":"1","year":"2022"},{"type":"dissertation","status":"public","_id":"29763","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"558"}],"user_id":"36113","file_date_updated":"2022-02-07T13:26:05Z","has_accepted_license":"1","publication_status":"published","citation":{"mla":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022, doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>.","short":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography, 2022.","bibtex":"@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure Cryptography}, DOI={<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>}, author={Niehues, David}, year={2022} }","apa":"Niehues, D. (2022). <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>","ama":"Niehues D. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>.; 2022. doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>","ieee":"D. Niehues, <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022.","chicago":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>, 2022. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>."},"oa":"1","date_updated":"2022-02-07T13:32:28Z","supervisor":[{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"},{"full_name":"Lehmann, Anja","last_name":"Lehmann","first_name":"Anja"}],"author":[{"first_name":"David","last_name":"Niehues","full_name":"Niehues, David","id":"36113"}],"doi":"10.25926/rdtq-jw45","main_file_link":[{"url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf","open_access":"1"}],"abstract":[{"lang":"eng","text":"Modern-day communication has become more and more digital. While this comes with many advantages such as a more efficient economy, it has also created more and more opportunities for various adversaries to manipulate communication or eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness of these threats. To protect the communication of people, companies, and states from such threats, we require cryptography with strong security guarantees.\r\nDifferent applications may require different security properties from cryptographic schemes. For most applications, however, so-called adaptive security is considered a reasonable minimal requirement of security. Cryptographic schemes with adaptive security remain secure in the presence of an adversary that can corrupt communication partners to respond to messages of the adversaries choice, while the adversary may choose the messages based on previously observed interactions.\r\nWhile cryptography is associated the most with encryption, this is only one of many primitives that are essential for the security of digital interactions. This thesis presents novel identity-based encryption (IBE) schemes and verifiable random functions (VRFs) that achieve adaptive security as outlined above. Moreover, the cryptographic schemes presented in this thesis are proven secure in the standard model. That is without making use of idealized models like the random oracle model."}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2022-02-07T13:26:05Z","date_created":"2022-02-07T13:26:05Z","creator":"davnie","file_size":1542089,"file_name":"de2107.pdf","file_id":"29764","access_level":"closed"}],"keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2022","date_created":"2022-02-07T13:29:07Z","title":"More Efficient Techniques for Adaptively-Secure Cryptography"},{"language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"33240","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"status":"public","editor":[{"first_name":"Kunal","last_name":"Agrawal","full_name":"Agrawal, Kunal"},{"full_name":"Lee, I-Ting Angelina","last_name":"Lee","first_name":"I-Ting Angelina"}],"publication":"SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022","type":"conference","doi":"10.1145/3490148.3538556","title":"Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion","date_created":"2022-09-01T07:55:00Z","author":[{"id":"34727","full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-09-01T07:57:53Z","publisher":"ACM","page":"99–101","citation":{"short":"T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.","mla":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","bibtex":"@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>}, booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina}, year={2022}, pages={99–101} }","apa":"Götte, T., &#38; Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal &#38; I.-T. A. Lee (Eds.), <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i> (pp. 99–101). ACM. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>","chicago":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” In <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>.","ieee":"T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” in <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, 2022, pp. 99–101, doi: <a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","ama":"Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>. ACM; 2022:99–101. doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>"},"year":"2022"},{"author":[{"last_name":"Maack","full_name":"Maack, Marten","id":"88252","first_name":"Marten"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Simon","id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop"}],"date_created":"2022-02-18T09:31:54Z","publisher":"Springer International Publishing","date_updated":"2022-09-27T15:03:13Z","doi":"10.1007/978-3-030-92702-8_10","title":"Server Cloud Scheduling","publication_status":"published","publication_identifier":{"isbn":["9783030927011","9783030927028"],"issn":["0302-9743","1611-3349"]},"citation":{"ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: <i>Approximation and Online Algorithms</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2022). Server Cloud Scheduling. In <i>Approximation and Online Algorithms</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>","bibtex":"@inbook{Maack_Meyer auf der Heide_Pukrop_2022, place={Cham}, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>}, booktitle={Approximation and Online Algorithms}, publisher={Springer International Publishing}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2022} }","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Approximation and Online Algorithms</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” in <i>Approximation and Online Algorithms</i>, Cham: Springer International Publishing, 2022.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” In <i>Approximation and Online Algorithms</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>."},"year":"2022","place":"Cham","user_id":"44428","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"_id":"29872","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Approximation and Online Algorithms","status":"public"},{"type":"journal_article","status":"public","_id":"23566","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"276"}],"user_id":"16205","file_date_updated":"2021-11-08T12:24:31Z","has_accepted_license":"1","publication_status":"published","page":"421-439","intvolume":"        64","citation":{"apa":"Kundisch, D., Muntermann, J., Oberländer, A. M., Rau, D., Röglinger, M., Schoormann, T., &#38; Szopinski, D. (2022). An update for taxonomy designers: Methodological guidance from information systems research. <i>Business &#38; Information Systems Engineering</i>, <i>64</i>(4), 421–439.","bibtex":"@article{Kundisch_Muntermann_Oberländer_Rau_Röglinger_Schoormann_Szopinski_2022, title={An update for taxonomy designers: Methodological guidance from information systems research}, volume={64}, number={4}, journal={Business &#38; Information Systems Engineering}, author={Kundisch, Dennis and Muntermann, J. and Oberländer, A. M. and Rau, D. and Röglinger, M. and Schoormann, T. and Szopinski, Daniel}, year={2022}, pages={421–439} }","short":"D. Kundisch, J. Muntermann, A.M. Oberländer, D. Rau, M. Röglinger, T. Schoormann, D. Szopinski, Business &#38; Information Systems Engineering 64 (2022) 421–439.","mla":"Kundisch, Dennis, et al. “An Update for Taxonomy Designers: Methodological Guidance from Information Systems Research.” <i>Business &#38; Information Systems Engineering</i>, vol. 64, no. 4, 2022, pp. 421–39.","chicago":"Kundisch, Dennis, J. Muntermann, A. M. Oberländer, D. Rau, M. Röglinger, T. Schoormann, and Daniel Szopinski. “An Update for Taxonomy Designers: Methodological Guidance from Information Systems Research.” <i>Business &#38; Information Systems Engineering</i> 64, no. 4 (2022): 421–39.","ieee":"D. Kundisch <i>et al.</i>, “An update for taxonomy designers: Methodological guidance from information systems research,” <i>Business &#38; Information Systems Engineering</i>, vol. 64, no. 4, pp. 421–439, 2022.","ama":"Kundisch D, Muntermann J, Oberländer AM, et al. An update for taxonomy designers: Methodological guidance from information systems research. <i>Business &#38; Information Systems Engineering</i>. 2022;64(4):421-439."},"date_updated":"2022-10-21T12:57:05Z","volume":64,"author":[{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"},{"last_name":"Muntermann","full_name":"Muntermann, J.","first_name":"J."},{"full_name":"Oberländer, A. M.","last_name":"Oberländer","first_name":"A. M."},{"first_name":"D.","last_name":"Rau","full_name":"Rau, D."},{"last_name":"Röglinger","full_name":"Röglinger, M.","first_name":"M."},{"full_name":"Schoormann, T.","last_name":"Schoormann","first_name":"T."},{"first_name":"Daniel","full_name":"Szopinski, Daniel","id":"36372","last_name":"Szopinski"}],"publication":"Business & Information Systems Engineering","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2021-11-08T12:24:31Z","creator":"abursig","date_created":"2021-11-08T12:24:31Z","file_size":511483,"file_name":"Kundisch2021_Article_AnUpdateForTaxonomyDesigners.pdf","file_id":"27282","access_level":"closed"}],"ddc":["000"],"language":[{"iso":"eng"}],"issue":"4","year":"2022","date_created":"2021-08-30T10:00:24Z","title":"An update for taxonomy designers: Methodological guidance from information systems research"},{"language":[{"iso":"eng"}],"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)","title":"Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-05-03T00:13:06Z","year":"2022","_id":"30987","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"79"}],"user_id":"15504","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","editor":[{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"first_name":"Othon","full_name":"Michail, Othon","last_name":"Michail"}],"status":"public","type":"conference","doi":"10.4230/LIPIcs.SAND.2022.23","date_updated":"2022-10-27T08:45:52Z","volume":221,"author":[{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"id":"3902","full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"}],"place":"Dagstuhl, Germany","intvolume":"       221","page":"23:1–23:3","citation":{"bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}, volume={221}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={23:1–23:3}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.","mla":"Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i> (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>","ama":"Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>. Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, 2022, vol. 221, p. 23:1–23:3, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, edited by James Aspnes and Othon Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>."},"publication_identifier":{"isbn":["978-3-95977-224-2"],"issn":["1868-8969"]}},{"place":"Paderborn","year":"2022","citation":{"ieee":"S. Gottschalk, <i>Situation-specific Development of Business Models within Software Ecosystems</i>. Paderborn: Paderborn University, 2022.","chicago":"Gottschalk, Sebastian. <i>Situation-Specific Development of Business Models within Software Ecosystems</i>. Paderborn: Paderborn University, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1644\">https://doi.org/10.17619/UNIPB/1-1644</a>.","ama":"Gottschalk S. <i>Situation-Specific Development of Business Models within Software Ecosystems</i>. Paderborn University; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1644\">10.17619/UNIPB/1-1644</a>","short":"S. Gottschalk, Situation-Specific Development of Business Models within Software Ecosystems, Paderborn University, Paderborn, 2022.","bibtex":"@book{Gottschalk_2022, place={Paderborn}, title={Situation-specific Development of Business Models within Software Ecosystems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1644\">10.17619/UNIPB/1-1644</a>}, publisher={Paderborn University}, author={Gottschalk, Sebastian}, year={2022} }","mla":"Gottschalk, Sebastian. <i>Situation-Specific Development of Business Models within Software Ecosystems</i>. Paderborn University, 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1644\">10.17619/UNIPB/1-1644</a>.","apa":"Gottschalk, S. (2022). <i>Situation-specific Development of Business Models within Software Ecosystems</i>. Paderborn University. <a href=\"https://doi.org/10.17619/UNIPB/1-1644\">https://doi.org/10.17619/UNIPB/1-1644</a>"},"title":"Situation-specific Development of Business Models within Software Ecosystems","doi":"10.17619/UNIPB/1-1644","publisher":"Paderborn University","date_updated":"2023-01-09T12:37:15Z","supervisor":[{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"date_created":"2023-01-04T09:05:58Z","author":[{"full_name":"Gottschalk, Sebastian","id":"47208","last_name":"Gottschalk","first_name":"Sebastian"}],"abstract":[{"lang":"eng","text":"The development of new business models is essential for startups to become successful, as well as for established companies to explore new business opportunities. However, developing such business models is a challenging activity. On the one hand, various tasks of business model development methods (BMDMs) need to be performed. On the other hand, different decisions for the business models (BMs) need to be made. Both have to fit the changeable situation of the organization in which the business model is developed to reduce the risk of developing ineffective business models with low market penetration. Therefore, the BMDMs and the BMs must be developed situation-specific. In this thesis, we conduct a design science research study to design a novel approach for the situation-specific development of business models with three stages. In the first stage, we create a method repository with method fragments for the BMDMs and a canvas model repository with modeling fragments for the BMs. Both repositories are filled by the knowledge of domain experts. Out of these repositories, in the second stage, situation-specific BMDMs for developing situation-specific BMs are composed by a method engineer based on the changeable situation of the organization and enacted by a business developer. The business developer collaborates with other stakeholders during the enaction to create artifacts. Moreover, in the third stage, he receives IT support, provided by development support engineers, in different development steps."}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"35189","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"66"},{"_id":"534"}],"user_id":"47208"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"41047","department":[{"_id":"34"},{"_id":"64"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"34962","citation":{"ama":"Anonymous A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>.; 2022.","chicago":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>, 2022.","ieee":"A. Anonymous, <i>Evaluating database systems relying on secure multiparty computation</i>. 2022.","bibtex":"@book{Anonymous_2022, title={Evaluating database systems relying on secure multiparty computation}, author={Anonymous, A}, year={2022} }","short":"A. Anonymous, Evaluating Database Systems Relying on Secure Multiparty Computation, 2022.","mla":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>. 2022.","apa":"Anonymous, A. (2022). <i>Evaluating database systems relying on secure multiparty computation</i>."},"year":"2022","title":"Evaluating database systems relying on secure multiparty computation","author":[{"first_name":"A","last_name":"Anonymous","full_name":"Anonymous, A"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"date_created":"2022-12-24T00:14:34Z","date_updated":"2023-01-10T10:31:35Z"}]