[{"oa":"1","date_updated":"2023-02-15T20:58:33Z","_id":"42160","type":"preprint","year":"2023","citation":{"apa":"Werner, S., & Peitz, S. (2023). Learning a model is paramount for sample efficiency in reinforcement learning control of PDEs. In arXiv:2302.07160.","ama":"Werner S, Peitz S. Learning a model is paramount for sample efficiency in reinforcement learning control of PDEs. arXiv:230207160. Published online 2023.","chicago":"Werner, Stefan, and Sebastian Peitz. “Learning a Model Is Paramount for Sample Efficiency in Reinforcement Learning Control of PDEs.” ArXiv:2302.07160, 2023.","bibtex":"@article{Werner_Peitz_2023, title={Learning a model is paramount for sample efficiency in reinforcement learning control of PDEs}, journal={arXiv:2302.07160}, author={Werner, Stefan and Peitz, Sebastian}, year={2023} }","mla":"Werner, Stefan, and Sebastian Peitz. “Learning a Model Is Paramount for Sample Efficiency in Reinforcement Learning Control of PDEs.” ArXiv:2302.07160, 2023.","short":"S. Werner, S. Peitz, ArXiv:2302.07160 (2023).","ieee":"S. Werner and S. Peitz, “Learning a model is paramount for sample efficiency in reinforcement learning control of PDEs,” arXiv:2302.07160. 2023."},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/2302.07160","open_access":"1"}],"title":"Learning a model is paramount for sample efficiency in reinforcement learning control of PDEs","user_id":"47427","abstract":[{"text":"The goal of this paper is to make a strong point for the usage of dynamical models when using reinforcement learning (RL) for feedback control of dynamical systems governed by partial differential equations (PDEs). To breach the gap between the immense promises we see in RL and the applicability in complex engineering systems, the main challenges are the massive requirements in terms of the training data, as well as the lack of performance guarantees. We present a solution for the first issue using a data-driven surrogate model in the form of a convolutional LSTM with actuation. We demonstrate that learning an actuated model in parallel to training the RL agent significantly reduces the total amount of required data sampled from the real system. Furthermore, we show that iteratively updating the model is of major importance to avoid biases in the RL training. Detailed ablation studies reveal the most important ingredients of the modeling process. We use the chaotic Kuramoto-Sivashinsky equation do demonstarte our findings.","lang":"eng"}],"external_id":{"arxiv":["2302.07160"]},"status":"public","date_created":"2023-02-15T20:57:20Z","author":[{"first_name":"Stefan","full_name":"Werner, Stefan","last_name":"Werner"},{"id":"47427","last_name":"Peitz","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian","first_name":"Sebastian"}],"department":[{"_id":"655"}],"publication":"arXiv:2302.07160"},{"publication":"14th Innovations in Theoretical Computer Science (ITCS)","author":[{"full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","first_name":"Sevag","id":"71541","last_name":"Gharibian"},{"first_name":"Dorian","full_name":"Rudolph, Dorian","last_name":"Rudolph"}],"volume":251,"date_created":"2022-06-13T14:40:46Z","status":"public","abstract":[{"text":"Savitch's theorem states that NPSPACE computations can be simulated in\r\nPSPACE. We initiate the study of a quantum analogue of NPSPACE, denoted\r\nStreaming-QCMASPACE (SQCMASPACE), where an exponentially long classical proof\r\nis streamed to a poly-space quantum verifier. Besides two main results, we also\r\nshow that a quantum analogue of Savitch's theorem is unlikely to hold, as\r\nSQCMASPACE=NEXP. For completeness, we introduce Streaming-QMASPACE (SQMASPACE)\r\nwith an exponentially long streamed quantum proof, and show SQMASPACE=QMA_EXP\r\n(quantum analogue of NEXP). Our first main result shows, in contrast to the\r\nclassical setting, the solution space of a quantum constraint satisfaction\r\nproblem (i.e. a local Hamiltonian) is always connected when exponentially long\r\nproofs are permitted. For this, we show how to simulate any Lipschitz\r\ncontinuous path on the unit hypersphere via a sequence of local unitary gates,\r\nat the expense of blowing up the circuit size. This shows quantum\r\nerror-correcting codes can be unable to detect one codeword erroneously\r\nevolving to another if the evolution happens sufficiently slowly, and answers\r\nan open question of [Gharibian, Sikora, ICALP 2015] regarding the Ground State\r\nConnectivity problem. Our second main result is that any SQCMASPACE computation\r\ncan be embedded into \"unentanglement\", i.e. into a quantum constraint\r\nsatisfaction problem with unentangled provers. Formally, we show how to embed\r\nSQCMASPACE into the Sparse Separable Hamiltonian problem of [Chailloux,\r\nSattath, CCC 2012] (QMA(2)-complete for 1/poly promise gap), at the expense of\r\nscaling the promise gap with the streamed proof size. As a corollary, we obtain\r\nthe first systematic construction for obtaining QMA(2)-type upper bounds on\r\narbitrary multi-prover interactive proof systems, where the QMA(2) promise gap\r\nscales exponentially with the number of bits of communication in the\r\ninteractive proof.","lang":"eng"}],"user_id":"71541","page":"53:1-53:23","citation":{"ieee":"S. Gharibian and D. Rudolph, “Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement,” in 14th Innovations in Theoretical Computer Science (ITCS), 2023, vol. 251, p. 53:1-53:23, doi: 10.4230/LIPIcs.ITCS.2023.53.","short":"S. Gharibian, D. Rudolph, in: 14th Innovations in Theoretical Computer Science (ITCS), 2023, p. 53:1-53:23.","bibtex":"@inproceedings{Gharibian_Rudolph_2023, title={Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement}, volume={251}, DOI={10.4230/LIPIcs.ITCS.2023.53}, booktitle={14th Innovations in Theoretical Computer Science (ITCS)}, author={Gharibian, Sevag and Rudolph, Dorian}, year={2023}, pages={53:1-53:23} }","mla":"Gharibian, Sevag, and Dorian Rudolph. “Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement.” 14th Innovations in Theoretical Computer Science (ITCS), vol. 251, 2023, p. 53:1-53:23, doi:10.4230/LIPIcs.ITCS.2023.53.","chicago":"Gharibian, Sevag, and Dorian Rudolph. “Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement.” In 14th Innovations in Theoretical Computer Science (ITCS), 251:53:1-53:23, 2023. https://doi.org/10.4230/LIPIcs.ITCS.2023.53.","ama":"Gharibian S, Rudolph D. Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement. In: 14th Innovations in Theoretical Computer Science (ITCS). Vol 251. ; 2023:53:1-53:23. doi:10.4230/LIPIcs.ITCS.2023.53","apa":"Gharibian, S., & Rudolph, D. (2023). Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement. 14th Innovations in Theoretical Computer Science (ITCS), 251, 53:1-53:23. https://doi.org/10.4230/LIPIcs.ITCS.2023.53"},"year":"2023","type":"conference","intvolume":" 251","_id":"31872","department":[{"_id":"623"},{"_id":"7"}],"publication_status":"published","external_id":{"arxiv":["2206.05243"]},"title":"Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement","language":[{"iso":"eng"}],"date_updated":"2023-02-28T11:06:55Z","doi":"10.4230/LIPIcs.ITCS.2023.53"},{"_id":"27426","intvolume":" 85","issue":"3","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10898-022-01223-2.pdf","open_access":"1"}],"page":"709-741","type":"journal_article","citation":{"ieee":"B. Gebken, K. Bieker, and S. Peitz, “On the structure of regularization paths for piecewise differentiable regularization terms,” Journal of Global Optimization, vol. 85, no. 3, pp. 709–741, 2023, doi: 10.1007/s10898-022-01223-2.","short":"B. Gebken, K. Bieker, S. Peitz, Journal of Global Optimization 85 (2023) 709–741.","bibtex":"@article{Gebken_Bieker_Peitz_2023, title={On the structure of regularization paths for piecewise differentiable regularization terms}, volume={85}, DOI={10.1007/s10898-022-01223-2}, number={3}, journal={Journal of Global Optimization}, author={Gebken, Bennet and Bieker, Katharina and Peitz, Sebastian}, year={2023}, pages={709–741} }","mla":"Gebken, Bennet, et al. “On the Structure of Regularization Paths for Piecewise Differentiable Regularization Terms.” Journal of Global Optimization, vol. 85, no. 3, 2023, pp. 709–41, doi:10.1007/s10898-022-01223-2.","chicago":"Gebken, Bennet, Katharina Bieker, and Sebastian Peitz. “On the Structure of Regularization Paths for Piecewise Differentiable Regularization Terms.” Journal of Global Optimization 85, no. 3 (2023): 709–41. https://doi.org/10.1007/s10898-022-01223-2.","ama":"Gebken B, Bieker K, Peitz S. On the structure of regularization paths for piecewise differentiable regularization terms. Journal of Global Optimization. 2023;85(3):709-741. doi:10.1007/s10898-022-01223-2","apa":"Gebken, B., Bieker, K., & Peitz, S. (2023). On the structure of regularization paths for piecewise differentiable regularization terms. Journal of Global Optimization, 85(3), 709–741. https://doi.org/10.1007/s10898-022-01223-2"},"year":"2023","abstract":[{"text":"Regularization is used in many different areas of optimization when solutions\r\nare sought which not only minimize a given function, but also possess a certain\r\ndegree of regularity. Popular applications are image denoising, sparse\r\nregression and machine learning. Since the choice of the regularization\r\nparameter is crucial but often difficult, path-following methods are used to\r\napproximate the entire regularization path, i.e., the set of all possible\r\nsolutions for all regularization parameters. Due to their nature, the\r\ndevelopment of these methods requires structural results about the\r\nregularization path. The goal of this article is to derive these results for\r\nthe case of a smooth objective function which is penalized by a piecewise\r\ndifferentiable regularization term. We do this by treating regularization as a\r\nmultiobjective optimization problem. Our results suggest that even in this\r\ngeneral case, the regularization path is piecewise smooth. Moreover, our theory\r\nallows for a classification of the nonsmooth features that occur in between\r\nsmooth parts. This is demonstrated in two applications, namely support-vector\r\nmachines and exact penalty methods.","lang":"eng"}],"user_id":"47427","publication":"Journal of Global Optimization","author":[{"first_name":"Bennet","full_name":"Gebken, Bennet","last_name":"Gebken","id":"32643"},{"full_name":"Bieker, Katharina","first_name":"Katharina","id":"32829","last_name":"Bieker"},{"first_name":"Sebastian","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian","last_name":"Peitz","id":"47427"}],"date_created":"2021-11-15T09:24:59Z","status":"public","volume":85,"date_updated":"2023-03-11T17:16:33Z","oa":"1","doi":"10.1007/s10898-022-01223-2","language":[{"iso":"eng"}],"title":"On the structure of regularization paths for piecewise differentiable regularization terms","department":[{"_id":"101"},{"_id":"655"}]},{"department":[{"_id":"78"}],"author":[{"first_name":"Christian","full_name":"Lienen, Christian","last_name":"Lienen","id":"60323"},{"full_name":"Middeke, Sorel Horst","first_name":"Sorel Horst","last_name":"Middeke"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"}],"date_created":"2023-03-20T07:41:47Z","status":"public","title":"fpgaDDS: An Intra-FPGA Data Distribution Service for ROS 2 Robotics Applications","user_id":"60323","main_file_link":[{"url":"https://arxiv.org/pdf/2303.00532.pdf"}],"year":"2023","type":"preprint","citation":{"bibtex":"@article{Lienen_Middeke_Platzner_2023, title={fpgaDDS: An Intra-FPGA Data Distribution Service for ROS 2 Robotics Applications}, author={Lienen, Christian and Middeke, Sorel Horst and Platzner, Marco}, year={2023} }","mla":"Lienen, Christian, et al. FpgaDDS: An Intra-FPGA Data Distribution Service for ROS 2 Robotics Applications. 2023.","chicago":"Lienen, Christian, Sorel Horst Middeke, and Marco Platzner. “FpgaDDS: An Intra-FPGA Data Distribution Service for ROS 2 Robotics Applications,” 2023.","ama":"Lienen C, Middeke SH, Platzner M. fpgaDDS: An Intra-FPGA Data Distribution Service for ROS 2 Robotics Applications. Published online 2023.","apa":"Lienen, C., Middeke, S. H., & Platzner, M. (2023). fpgaDDS: An Intra-FPGA Data Distribution Service for ROS 2 Robotics Applications.","ieee":"C. Lienen, S. H. Middeke, and M. Platzner, “fpgaDDS: An Intra-FPGA Data Distribution Service for ROS 2 Robotics Applications.” 2023.","short":"C. Lienen, S.H. Middeke, M. Platzner, (2023)."},"language":[{"iso":"eng"}],"date_updated":"2023-03-20T07:42:34Z","_id":"43048"},{"page":"113756","type":"journal_article","year":"2023","citation":{"mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.","bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={10.1016/j.tcs.2023.113756}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","apa":"Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950, 113756. https://doi.org/10.1016/j.tcs.2023.113756","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor Comput Sci. 2023;950:113756. doi:10.1016/j.tcs.2023.113756","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci. 950 (2023): 113756. https://doi.org/10.1016/j.tcs.2023.113756.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi: 10.1016/j.tcs.2023.113756.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756."},"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2023.113756","date_updated":"2023-03-27T09:55:04Z","_id":"43109","intvolume":" 950","volume":950,"date_created":"2023-03-27T07:45:44Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"status":"public","department":[{"_id":"79"}],"publication":"Theor. Comput. Sci.","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"id":"50024","last_name":"Werthmann","full_name":"Werthmann, Julian","first_name":"Julian"}],"title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","user_id":"15504"},{"department":[{"_id":"66"},{"_id":"534"}],"publication":"Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)","author":[{"orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes","first_name":"Enes","id":"8447","last_name":"Yigitbas"},{"last_name":"Nowosad","full_name":"Nowosad, Alexander","first_name":"Alexander"},{"last_name":"Engels","id":"107","first_name":"Gregor","full_name":"Engels, Gregor"}],"publisher":"Springer","date_created":"2023-04-06T07:26:07Z","status":"public","user_id":"8447","title":"Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review","language":[{"iso":"eng"}],"citation":{"short":"E. Yigitbas, A. Nowosad, G. Engels, in: Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023), Springer, 2023.","ieee":"E. Yigitbas, A. Nowosad, and G. Engels, “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review,” 2023.","apa":"Yigitbas, E., Nowosad, A., & Engels, G. (2023). Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review. Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023).","ama":"Yigitbas E, Nowosad A, Engels G. Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review. In: Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023). Springer; 2023.","chicago":"Yigitbas, Enes, Alexander Nowosad, and Gregor Engels. “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review.” In Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023). Springer, 2023.","mla":"Yigitbas, Enes, et al. “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review.” Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023), Springer, 2023.","bibtex":"@inproceedings{Yigitbas_Nowosad_Engels_2023, title={Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review}, booktitle={Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)}, publisher={Springer}, author={Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2023} }"},"year":"2023","type":"conference","date_updated":"2023-04-06T07:26:55Z","_id":"43424"},{"title":"Towards reliable data-based optimal and predictive control using extended DMD","external_id":{"arxiv":["2202.09084"]},"publication_status":"published","department":[{"_id":"655"}],"doi":"10.1016/j.ifacol.2023.02.029","oa":"1","date_updated":"2023-03-17T15:55:33Z","language":[{"iso":"eng"}],"user_id":"47427","abstract":[{"text":"We present an approach for guaranteed constraint satisfaction by means of data-based optimal control, where the model is unknown and has to be obtained from measurement data. To this end, we utilize the Koopman framework and an eDMD-based bilinear surrogate modeling approach for control systems to show an error bound on predicted observables, i.e., functions of the state. This result is then applied to the constraints of the optimal control problem to show that satisfaction of tightened constraints in the purely data-based surrogate model implies constraint satisfaction for the original system.","lang":"eng"}],"volume":56,"status":"public","date_created":"2022-02-25T17:14:58Z","author":[{"last_name":"Schaller","full_name":"Schaller, Manuel","first_name":"Manuel"},{"full_name":"Worthmann, Karl","first_name":"Karl","last_name":"Worthmann"},{"last_name":"Philipp","first_name":"Friedrich","full_name":"Philipp, Friedrich"},{"first_name":"Sebastian","full_name":"Peitz, Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","id":"47427"},{"first_name":"Feliks","orcid":"0000-0003-2444-7889","full_name":"Nüske, Feliks","last_name":"Nüske","id":"81513"}],"publication":"IFAC-PapersOnLine","issue":"1","_id":"30125","intvolume":" 56","conference":{"name":"12th IFAC Symposium on Nonlinear Control Systems (NOLCOS)"},"type":"conference","year":"2023","citation":{"ama":"Schaller M, Worthmann K, Philipp F, Peitz S, Nüske F. Towards reliable data-based optimal and predictive control using extended DMD. In: IFAC-PapersOnLine. Vol 56. ; 2023:169-174. doi:10.1016/j.ifacol.2023.02.029","apa":"Schaller, M., Worthmann, K., Philipp, F., Peitz, S., & Nüske, F. (2023). Towards reliable data-based optimal and predictive control using extended DMD. IFAC-PapersOnLine, 56(1), 169–174. https://doi.org/10.1016/j.ifacol.2023.02.029","chicago":"Schaller, Manuel, Karl Worthmann, Friedrich Philipp, Sebastian Peitz, and Feliks Nüske. “Towards Reliable Data-Based Optimal and Predictive Control Using Extended DMD.” In IFAC-PapersOnLine, 56:169–74, 2023. https://doi.org/10.1016/j.ifacol.2023.02.029.","mla":"Schaller, Manuel, et al. “Towards Reliable Data-Based Optimal and Predictive Control Using Extended DMD.” IFAC-PapersOnLine, vol. 56, no. 1, 2023, pp. 169–74, doi:10.1016/j.ifacol.2023.02.029.","bibtex":"@inproceedings{Schaller_Worthmann_Philipp_Peitz_Nüske_2023, title={Towards reliable data-based optimal and predictive control using extended DMD}, volume={56}, DOI={10.1016/j.ifacol.2023.02.029}, number={1}, booktitle={IFAC-PapersOnLine}, author={Schaller, Manuel and Worthmann, Karl and Philipp, Friedrich and Peitz, Sebastian and Nüske, Feliks}, year={2023}, pages={169–174} }","short":"M. Schaller, K. Worthmann, F. Philipp, S. Peitz, F. Nüske, in: IFAC-PapersOnLine, 2023, pp. 169–174.","ieee":"M. Schaller, K. Worthmann, F. Philipp, S. Peitz, and F. Nüske, “Towards reliable data-based optimal and predictive control using extended DMD,” in IFAC-PapersOnLine, 2023, vol. 56, no. 1, pp. 169–174, doi: 10.1016/j.ifacol.2023.02.029."},"page":"169-174","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S2405896323002173/pdf?md5=164ee9a0343a1bd0e0b9ac4187e44b77&pid=1-s2.0-S2405896323002173-main.pdf"}]},{"doi":"10.1016/j.orl.2023.02.013","date_updated":"2023-04-21T07:53:42Z","language":[{"iso":"eng"}],"title":"Online load balancing on uniform machines with limited migration","publication_identifier":{"issn":["0167-6377"]},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"department":[{"_id":"63"}],"issue":"3","intvolume":" 51","_id":"44077","page":"220-225","year":"2023","type":"journal_article","citation":{"ieee":"M. Maack, “Online load balancing on uniform machines with limited migration,” Operations Research Letters, vol. 51, no. 3, pp. 220–225, 2023, doi: 10.1016/j.orl.2023.02.013.","short":"M. Maack, Operations Research Letters 51 (2023) 220–225.","mla":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” Operations Research Letters, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25, doi:10.1016/j.orl.2023.02.013.","bibtex":"@article{Maack_2023, title={Online load balancing on uniform machines with limited migration}, volume={51}, DOI={10.1016/j.orl.2023.02.013}, number={3}, journal={Operations Research Letters}, publisher={Elsevier BV}, author={Maack, Marten}, year={2023}, pages={220–225} }","chicago":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” Operations Research Letters 51, no. 3 (2023): 220–25. https://doi.org/10.1016/j.orl.2023.02.013.","ama":"Maack M. Online load balancing on uniform machines with limited migration. Operations Research Letters. 2023;51(3):220-225. doi:10.1016/j.orl.2023.02.013","apa":"Maack, M. (2023). Online load balancing on uniform machines with limited migration. Operations Research Letters, 51(3), 220–225. https://doi.org/10.1016/j.orl.2023.02.013"},"user_id":"88252","volume":51,"date_created":"2023-04-20T08:59:14Z","status":"public","keyword":["Applied Mathematics","Industrial and Manufacturing Engineering","Management Science and Operations Research","Software"],"publication":"Operations Research Letters","publisher":"Elsevier BV","author":[{"last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten"}]},{"date_created":"2023-04-03T14:07:32Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"status":"public","has_accepted_license":"1","file":[{"date_created":"2023-04-25T10:49:36Z","file_name":"masters_thesis_schuermann.pdf","access_level":"open_access","file_size":1367369,"title":" A Formal Comparison of Advanced Digital Signature Primitives","file_id":"44177","creator":"bhenrik","date_updated":"2023-04-25T10:49:36Z","content_type":"application/pdf","relation":"main_file"}],"department":[{"_id":"64"}],"file_date_updated":"2023-04-25T10:49:36Z","author":[{"first_name":"Patrick","full_name":"Schürmann, Patrick","last_name":"Schürmann"}],"user_id":"41047","ddc":["000"],"title":" A Formal Comparison of Advanced Digital Signature Primitives","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"language":[{"iso":"eng"}],"year":"2023","type":"mastersthesis","citation":{"bibtex":"@book{Schürmann_2023, title={ A Formal Comparison of Advanced Digital Signature Primitives}, author={Schürmann, Patrick}, year={2023} }","mla":"Schürmann, Patrick. A Formal Comparison of Advanced Digital Signature Primitives. 2023.","ama":"Schürmann P. A Formal Comparison of Advanced Digital Signature Primitives.; 2023.","apa":"Schürmann, P. (2023). A Formal Comparison of Advanced Digital Signature Primitives.","chicago":"Schürmann, Patrick. A Formal Comparison of Advanced Digital Signature Primitives, 2023.","ieee":"P. Schürmann, A Formal Comparison of Advanced Digital Signature Primitives. 2023.","short":"P. Schürmann, A Formal Comparison of Advanced Digital Signature Primitives, 2023."},"oa":"1","date_updated":"2023-04-25T22:43:21Z","_id":"43374"},{"volume":254,"date_created":"2020-12-24T14:15:09Z","status":"public","publication":"Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)","author":[{"first_name":"Sevag","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541"},{"last_name":"Watson","full_name":"Watson, James","first_name":"James"},{"full_name":"Bausch, Johannes","first_name":"Johannes","last_name":"Bausch"}],"user_id":"71541","page":"54:1-54:21","citation":{"short":"S. Gharibian, J. Watson, J. Bausch, in: Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 2023, p. 54:1-54:21.","ieee":"S. Gharibian, J. Watson, and J. Bausch, “The Complexity of Translationally Invariant Problems beyond Ground State Energies,” in Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 2023, vol. 254, p. 54:1-54:21, doi: https://doi.org/10.4230/LIPIcs.STACS.2023.54.","ama":"Gharibian S, Watson J, Bausch J. The Complexity of Translationally Invariant Problems beyond Ground State Energies. In: Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS). Vol 254. ; 2023:54:1-54:21. doi:https://doi.org/10.4230/LIPIcs.STACS.2023.54","apa":"Gharibian, S., Watson, J., & Bausch, J. (2023). The Complexity of Translationally Invariant Problems beyond Ground State Energies. Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 254, 54:1-54:21. https://doi.org/10.4230/LIPIcs.STACS.2023.54","chicago":"Gharibian, Sevag, James Watson, and Johannes Bausch. “The Complexity of Translationally Invariant Problems beyond Ground State Energies.” In Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 254:54:1-54:21, 2023. https://doi.org/10.4230/LIPIcs.STACS.2023.54.","bibtex":"@inproceedings{Gharibian_Watson_Bausch_2023, title={The Complexity of Translationally Invariant Problems beyond Ground State Energies}, volume={254}, DOI={https://doi.org/10.4230/LIPIcs.STACS.2023.54}, booktitle={Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Gharibian, Sevag and Watson, James and Bausch, Johannes}, year={2023}, pages={54:1-54:21} }","mla":"Gharibian, Sevag, et al. “The Complexity of Translationally Invariant Problems beyond Ground State Energies.” Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 254, 2023, p. 54:1-54:21, doi:https://doi.org/10.4230/LIPIcs.STACS.2023.54."},"type":"conference","year":"2023","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.12717"}],"_id":"20841","intvolume":" 254","publication_status":"published","department":[{"_id":"623"},{"_id":"7"}],"title":"The Complexity of Translationally Invariant Problems beyond Ground State Energies","external_id":{"arxiv":["2012.12717"]},"language":[{"iso":"eng"}],"doi":"https://doi.org/10.4230/LIPIcs.STACS.2023.54","oa":"1","date_updated":"2023-05-04T17:51:23Z"},{"user_id":"72764","ddc":["620"],"date_created":"2023-04-26T13:04:56Z","has_accepted_license":"1","status":"public","file":[{"file_name":"s4Bp4-041.pdf","date_created":"2023-04-26T13:03:54Z","access_level":"open_access","file_size":614626,"creator":"qazi","file_id":"44196","content_type":"application/pdf","date_updated":"2023-05-10T13:52:14Z","relation":"main_file"}],"file_date_updated":"2023-05-10T13:52:14Z","publication":"The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA","author":[{"first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","full_name":"Ahmed, Qazi Arbab","last_name":"Ahmed","id":"72764"},{"first_name":"Muhammad","full_name":"Awais, Muhammad","last_name":"Awais"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"}],"conference":{"location":"San Fransico CA 94023-0607, USA","name":"The 24th International Symposium on Quality Electronic Design (ISQED'23)","start_date":"2023-04-05","end_date":"2023-04-07"},"_id":"44194","type":"conference","year":"2023","citation":{"ieee":"Q. A. Ahmed, M. Awais, and M. Platzner, “MAAS: Hiding Trojans in Approximate Circuits,” presented at the The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA, 2023.","short":"Q.A. Ahmed, M. Awais, M. Platzner, in: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","mla":"Ahmed, Qazi Arbab, et al. “MAAS: Hiding Trojans in Approximate Circuits.” The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","bibtex":"@inproceedings{Ahmed_Awais_Platzner_2023, title={MAAS: Hiding Trojans in Approximate Circuits}, booktitle={The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA}, author={Ahmed, Qazi Arbab and Awais, Muhammad and Platzner, Marco}, year={2023} }","apa":"Ahmed, Q. A., Awais, M., & Platzner, M. (2023). MAAS: Hiding Trojans in Approximate Circuits. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA.","ama":"Ahmed QA, Awais M, Platzner M. MAAS: Hiding Trojans in Approximate Circuits. In: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA. ; 2023.","chicago":"Ahmed, Qazi Arbab, Muhammad Awais, and Marco Platzner. “MAAS: Hiding Trojans in Approximate Circuits.” In The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023."},"title":"MAAS: Hiding Trojans in Approximate Circuits","project":[{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"}],"department":[{"_id":"78"}],"oa":"1","date_updated":"2023-05-10T13:52:14Z","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"type":"mastersthesis","citation":{"short":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.","ieee":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks. 2023.","ama":"Schweichhart J. Minimum Edge Cuts in Overlay Networks.; 2023.","apa":"Schweichhart, J. (2023). Minimum Edge Cuts in Overlay Networks.","chicago":"Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks, 2023.","bibtex":"@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks}, author={Schweichhart, Jonas}, year={2023} }","mla":"Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks. 2023."},"year":"2023","_id":"44735","date_updated":"2023-05-11T05:51:15Z","department":[{"_id":"79"}],"author":[{"first_name":"Jonas","full_name":"Schweichhart, Jonas","last_name":"Schweichhart"}],"date_created":"2023-05-11T05:50:41Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"status":"public","user_id":"15504","title":"Minimum Edge Cuts in Overlay Networks"},{"date_updated":"2023-05-11T13:14:43Z","_id":"44769","doi":"10.1007/978-3-031-30448-4_1","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"chicago":"Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2023. https://doi.org/10.1007/978-3-031-30448-4_1.","apa":"Castenow, J., Harbig, J., & Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-031-30448-4_1","ama":"Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols for Swarms of Mobile Robots. In: Lecture Notes in Computer Science. Springer International Publishing; 2023. doi:10.1007/978-3-031-30448-4_1","mla":"Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile Robots.” Lecture Notes in Computer Science, Springer International Publishing, 2023, doi:10.1007/978-3-031-30448-4_1.","bibtex":"@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying Gathering Protocols for Swarms of Mobile Robots}, DOI={10.1007/978-3-031-30448-4_1}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide, Friedhelm}, year={2023} }","short":"J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.","ieee":"J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols for Swarms of Mobile Robots,” in Lecture Notes in Computer Science, Cham: Springer International Publishing, 2023."},"year":"2023","place":"Cham","user_id":"38705","title":"Unifying Gathering Protocols for Swarms of Mobile Robots","publisher":"Springer International Publishing","author":[{"last_name":"Castenow","id":"38705","first_name":"Jannik","full_name":"Castenow, Jannik"},{"full_name":"Harbig, Jonas","first_name":"Jonas","id":"47213","last_name":"Harbig"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","status":"public","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"date_created":"2023-05-11T13:13:45Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031304477","9783031304484"]},"publication_status":"published"},{"author":[{"id":"11308","last_name":"Wolters","full_name":"Wolters, Dennis","first_name":"Dennis"},{"first_name":"Gregor","full_name":"Engels, Gregor","last_name":"Engels","id":"107"}],"publisher":"SCITEPRESS","department":[{"_id":"66"}],"publication":"MODELSWARD'23","publication_identifier":{"issn":["2184-4348"],"isbn":["978-989-758-633-0"]},"publication_status":"accepted","status":"public","date_created":"2022-12-08T19:32:25Z","title":"Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards","user_id":"11308","year":"2023","citation":{"ieee":"D. Wolters and G. Engels, “Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards,” in MODELSWARD’23, pp. 133–142, doi: 10.5220/0011675700003402.","short":"D. Wolters, G. Engels, in: MODELSWARD’23, SCITEPRESS, n.d., pp. 133–142.","mla":"Wolters, Dennis, and Gregor Engels. “Model-Driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards.” MODELSWARD’23, SCITEPRESS, pp. 133–42, doi:10.5220/0011675700003402.","bibtex":"@inproceedings{Wolters_Engels, title={Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards}, DOI={10.5220/0011675700003402}, booktitle={MODELSWARD’23}, publisher={SCITEPRESS}, author={Wolters, Dennis and Engels, Gregor}, pages={133–142} }","apa":"Wolters, D., & Engels, G. (n.d.). Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards. MODELSWARD’23, 133–142. https://doi.org/10.5220/0011675700003402","ama":"Wolters D, Engels G. Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards. In: MODELSWARD’23. SCITEPRESS; :133-142. doi:10.5220/0011675700003402","chicago":"Wolters, Dennis, and Gregor Engels. “Model-Driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards.” In MODELSWARD’23, 133–42. SCITEPRESS, n.d. https://doi.org/10.5220/0011675700003402."},"type":"conference","page":"133-142","language":[{"iso":"eng"}],"date_updated":"2023-05-16T12:19:26Z","_id":"34294","doi":"10.5220/0011675700003402"},{"date_updated":"2023-05-22T04:57:42Z","_id":"43108","doi":"10.17619/UNIPB/1-1698","supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"language":[{"iso":"eng"}],"citation":{"ieee":"F. Pauck, Cooperative Android App Analysis. Paderborn University, 2023.","short":"F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023.","bibtex":"@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={10.17619/UNIPB/1-1698}, publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }","mla":"Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023, doi:10.17619/UNIPB/1-1698.","chicago":"Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023. https://doi.org/10.17619/UNIPB/1-1698.","apa":"Pauck, F. (2023). Cooperative Android App Analysis. Paderborn University. https://doi.org/10.17619/UNIPB/1-1698","ama":"Pauck F. Cooperative Android App Analysis. Paderborn University; 2023. doi:10.17619/UNIPB/1-1698"},"type":"dissertation","year":"2023","user_id":"22398","title":"Cooperative Android App Analysis","author":[{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"}],"publisher":"Paderborn University","department":[{"_id":"77"}],"status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"date_created":"2023-03-27T07:39:35Z"},{"department":[{"_id":"79"}],"author":[{"id":"50024","last_name":"Werthmann","full_name":"Werthmann, Julian","first_name":"Julian"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Coy","first_name":"Sam","full_name":"Coy, Sam"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"last_name":"Schneider","full_name":"Schneider, Philipp","first_name":"Philipp"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"date_created":"2023-05-22T09:17:50Z","status":"public","title":"Routing Schemes for Hybrid Communication Networks","user_id":"50024","year":"2023","type":"conference","citation":{"chicago":"Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. https://doi.org/10.48550/ARXIV.2210.05333.","apa":"Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., & Schneider, P. (2023). Routing Schemes for Hybrid Communication Networks. https://doi.org/10.48550/ARXIV.2210.05333","ama":"Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:10.48550/ARXIV.2210.05333","mla":"Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.","bibtex":"@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={10.48550/ARXIV.2210.05333}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.","ieee":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: 10.48550/ARXIV.2210.05333."},"language":[{"iso":"eng"}],"_id":"45188","date_updated":"2023-05-22T09:37:25Z","doi":"10.48550/ARXIV.2210.05333"},{"language":[{"iso":"eng"}],"date_updated":"2023-05-23T10:12:32Z","department":[{"_id":"7"},{"_id":"64"},{"_id":"19"},{"_id":"526"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"title":"Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2023_rp/344"}],"year":"2023","citation":{"ieee":"S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023.","short":"S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023.","mla":"Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research Papers, 2023.","bibtex":"@inproceedings{Hemmrich_Bobolz_Beverungen_Blömer_2023, title={Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain}, booktitle={ECIS 2023 Research Papers}, author={Hemmrich, Simon and Bobolz, Jan and Beverungen, Daniel and Blömer, Johannes}, year={2023} }","apa":"Hemmrich, S., Bobolz, J., Beverungen, D., & Blömer, J. (2023). Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. ECIS 2023 Research Papers. ECIS 2023.","ama":"Hemmrich S, Bobolz J, Beverungen D, Blömer J. Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. In: ECIS 2023 Research Papers. ; 2023.","chicago":"Hemmrich, Simon, Jan Bobolz, Daniel Beverungen, and Johannes Blömer. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” In ECIS 2023 Research Papers, 2023."},"type":"conference","_id":"44855","conference":{"name":"ECIS 2023"},"author":[{"id":"83557","last_name":"Hemmrich","full_name":"Hemmrich, Simon","first_name":"Simon"},{"first_name":"Jan","full_name":"Bobolz, Jan","last_name":"Bobolz","id":"27207"},{"last_name":"Beverungen","id":"59677","first_name":"Daniel","full_name":"Beverungen, Daniel"},{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"file_date_updated":"2023-05-23T10:11:03Z","publication":"ECIS 2023 Research Papers","file":[{"access_level":"closed","file_name":"A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf","date_created":"2023-05-23T10:11:03Z","content_type":"application/pdf","date_updated":"2023-05-23T10:11:03Z","relation":"main_file","success":1,"file_size":958740,"file_id":"45209","creator":"jbobolz"}],"status":"public","has_accepted_license":"1","date_created":"2023-05-16T08:31:27Z","extern":"1","abstract":[{"lang":"eng","text":"Market transactions are subject to information asymmetry about the delivered value proposition, causing transaction costs and adverse market effects among buyers and sellers. Information systems research has investigated how review systems can reduce information asymmetry in business-to-consumer markets. However, these systems cannot be readily applied to business-to-business markets, are vulnerable to manipulation, and suffer from conceptual weak spots since they use textual data or star ratings. Building on design science research, we conceptualize a new class of reputation systems based on monetary-based payments as quantitative ratings for each transaction stored on a blockchain. Using cryptography, we show that our system assures content confidentiality so that buyers can share and sell their ratings selectively, establishing a reputation ecosystem. Our prescriptive insights advance the design of reputation systems and offer new paths to understanding the antecedents, dynamics, and consequences to reduce information asymmetry in B2B transactions."}],"ddc":["330"],"user_id":"27207"},{"department":[{"_id":"66"}],"author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"date_created":"2023-05-23T13:22:49Z","status":"public","user_id":"47208","title":"Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach","supervisor":[{"last_name":"Yigitbas","id":"8447","first_name":"Enes","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X"},{"id":"47208","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","first_name":"Sebastian"}],"language":[{"iso":"eng"}],"citation":{"ieee":"N. N., Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach. 2023.","short":"N. N., Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach, 2023.","bibtex":"@book{N._2023, title={Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach}, author={N., N.}, year={2023} }","mla":"N., N. Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach. 2023.","apa":"N., N. (2023). Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach.","ama":"N. N. Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach.; 2023.","chicago":"N., N. Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach, 2023."},"year":"2023","type":"mastersthesis","date_updated":"2023-05-23T13:22:54Z","_id":"45243"},{"user_id":"70410","title":"Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis","publisher":"IEEE","author":[{"last_name":"Karakaya","full_name":"Karakaya, Kadiray","first_name":"Kadiray"},{"last_name":"Bodden","first_name":"Eric","full_name":"Bodden, Eric"}],"publication":"2023 IEEE Conference on Software Testing, Verification and Validation (ICST)","department":[{"_id":"76"}],"status":"public","date_created":"2023-05-29T12:09:43Z","publication_status":"published","date_updated":"2023-05-29T12:12:17Z","_id":"45312","doi":"10.1109/icst57152.2023.00036","year":"2023","type":"conference","citation":{"mla":"Karakaya, Kadiray, and Eric Bodden. “Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis.” 2023 IEEE Conference on Software Testing, Verification and Validation (ICST), IEEE, 2023, doi:10.1109/icst57152.2023.00036.","bibtex":"@inproceedings{Karakaya_Bodden_2023, title={Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis}, DOI={10.1109/icst57152.2023.00036}, booktitle={2023 IEEE Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE}, author={Karakaya, Kadiray and Bodden, Eric}, year={2023} }","apa":"Karakaya, K., & Bodden, E. (2023). Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis. 2023 IEEE Conference on Software Testing, Verification and Validation (ICST). https://doi.org/10.1109/icst57152.2023.00036","ama":"Karakaya K, Bodden E. Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis. In: 2023 IEEE Conference on Software Testing, Verification and Validation (ICST). IEEE; 2023. doi:10.1109/icst57152.2023.00036","chicago":"Karakaya, Kadiray, and Eric Bodden. “Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis.” In 2023 IEEE Conference on Software Testing, Verification and Validation (ICST). IEEE, 2023. https://doi.org/10.1109/icst57152.2023.00036.","ieee":"K. Karakaya and E. Bodden, “Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis,” 2023, doi: 10.1109/icst57152.2023.00036.","short":"K. Karakaya, E. Bodden, in: 2023 IEEE Conference on Software Testing, Verification and Validation (ICST), IEEE, 2023."}},{"ddc":["000"],"title":"Privacy-Preserving Collection and Evaluation of Log Files","user_id":"25078","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_created":"2023-04-03T14:09:14Z","has_accepted_license":"1","status":"public","file_date_updated":"2023-05-30T11:43:18Z","department":[{"_id":"64"}],"author":[{"last_name":"Koch","full_name":"Koch, Angelina","first_name":"Angelina"}],"file":[{"creator":"feidens","file_id":"45303","file_size":2275949,"relation":"main_file","content_type":"application/pdf","date_updated":"2023-05-30T11:43:18Z","date_created":"2023-05-26T07:07:39Z","file_name":"thesis_koch.pdf","access_level":"open_access"}],"oa":"1","date_updated":"2023-05-30T11:43:18Z","_id":"43375","citation":{"bibtex":"@book{Koch_2023, title={Privacy-Preserving Collection and Evaluation of Log Files}, author={Koch, Angelina}, year={2023} }","mla":"Koch, Angelina. Privacy-Preserving Collection and Evaluation of Log Files. 2023.","ama":"Koch A. Privacy-Preserving Collection and Evaluation of Log Files.; 2023.","apa":"Koch, A. (2023). Privacy-Preserving Collection and Evaluation of Log Files.","chicago":"Koch, Angelina. Privacy-Preserving Collection and Evaluation of Log Files, 2023.","ieee":"A. Koch, Privacy-Preserving Collection and Evaluation of Log Files. 2023.","short":"A. Koch, Privacy-Preserving Collection and Evaluation of Log Files, 2023."},"year":"2023","type":"bachelorsthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}]}]