[{"title":"Integrating Management Science into the HPC Research Ecosystem","department":[{"_id":"277"}],"date_updated":"2022-01-06T06:52:25Z","oa":"1","language":[{"iso":"eng"}],"user_id":"61579","ddc":["000"],"file":[{"content_type":"application/pdf","date_updated":"2020-03-05T10:36:48Z","relation":"main_file","file_size":186658,"creator":"hsiemes","file_id":"15415","access_level":"open_access","date_created":"2019-12-28T14:30:03Z","file_name":"Bringing HPC to management science - Web version.pdf"}],"author":[{"full_name":"Schryen, Guido","first_name":"Guido","id":"72850","last_name":"Schryen"}],"publication":"Communications of the ACM","file_date_updated":"2020-03-05T10:36:48Z","has_accepted_license":"1","status":"public","date_created":"2019-12-28T14:27:44Z","volume":63,"_id":"15414","intvolume":" 63","issue":"9","citation":{"short":"G. Schryen, Communications of the ACM 63 (2020) 35–37.","ieee":"G. Schryen, “Integrating Management Science into the HPC Research Ecosystem,” Communications of the ACM, vol. 63, no. 9, pp. 35–37, 2020.","chicago":"Schryen, Guido. “Integrating Management Science into the HPC Research Ecosystem.” Communications of the ACM 63, no. 9 (2020): 35–37.","apa":"Schryen, G. (2020). Integrating Management Science into the HPC Research Ecosystem. Communications of the ACM, 63(9), 35–37.","ama":"Schryen G. Integrating Management Science into the HPC Research Ecosystem. Communications of the ACM. 2020;63(9):35-37.","bibtex":"@article{Schryen_2020, title={Integrating Management Science into the HPC Research Ecosystem}, volume={63}, number={9}, journal={Communications of the ACM}, author={Schryen, Guido}, year={2020}, pages={35–37} }","mla":"Schryen, Guido. “Integrating Management Science into the HPC Research Ecosystem.” Communications of the ACM, vol. 63, no. 9, 2020, pp. 35–37."},"year":"2020","type":"journal_article","page":"35 - 37"},{"file_date_updated":"2021-08-12T11:41:55Z","publication":"Business & Information Systems Engineering","author":[{"id":"72850","last_name":"Schryen","full_name":"Schryen, Guido","first_name":"Guido"},{"full_name":"Kliewer, Natalia","first_name":"Natalia","last_name":"Kliewer"},{"first_name":"Andreas","full_name":"Fink, Andreas","last_name":"Fink"}],"file":[{"access_level":"closed","file_name":"Interview Utz-Uwe Haus (Cray) - BISE SI HPBC - Prepublication version.pdf","date_created":"2020-01-13T13:22:27Z","content_type":"application/pdf","date_updated":"2021-08-12T11:41:55Z","relation":"main_file","file_size":82469,"file_id":"15516","creator":"hsiemes"},{"date_updated":"2021-08-12T11:41:21Z","content_type":"application/pdf","relation":"main_file","file_size":226595,"file_id":"23386","creator":"hsiemes","access_level":"open_access","date_created":"2021-08-12T11:41:21Z","file_name":"Schryen2020_Article_InterviewWithUtz-UweHausOnHigh.pdf"}],"volume":62,"date_created":"2020-01-13T13:23:51Z","has_accepted_license":"1","status":"public","abstract":[{"text":"This interview is part of the special issue (01/2020) on “High Performance Business Computing” to be published in the journal Business & Information Systems Engineering. The interviewee Utz-Uwe Haus is Senior Research Engineer @ CRAY European Research Lab (CERL)). A bio of him is included at the end of the interview.","lang":"eng"}],"ddc":["000"],"user_id":"61579","page":"21 - 23","citation":{"short":"G. Schryen, N. Kliewer, A. Fink, Business & Information Systems Engineering 62 (2020) 21–23.","ieee":"G. Schryen, N. Kliewer, and A. Fink, “Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges\",” Business & Information Systems Engineering, vol. 62, no. 01/2020, pp. 21–23, 2020.","chicago":"Schryen, Guido, Natalia Kliewer, and Andreas Fink. “Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges\".” Business & Information Systems Engineering 62, no. 01/2020 (2020): 21–23.","apa":"Schryen, G., Kliewer, N., & Fink, A. (2020). Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges\". Business & Information Systems Engineering, 62(01/2020), 21–23.","ama":"Schryen G, Kliewer N, Fink A. Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges\". Business & Information Systems Engineering. 2020;62(01/2020):21-23.","bibtex":"@article{Schryen_Kliewer_Fink_2020, title={Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges\"}, volume={62}, number={01/2020}, journal={Business & Information Systems Engineering}, author={Schryen, Guido and Kliewer, Natalia and Fink, Andreas}, year={2020}, pages={21–23} }","mla":"Schryen, Guido, et al. “Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges\".” Business & Information Systems Engineering, vol. 62, no. 01/2020, 2020, pp. 21–23."},"type":"journal_article","year":"2020","intvolume":" 62","_id":"15513","issue":"01/2020","department":[{"_id":"277"}],"title":"Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments: Opportunities and Challenges\"","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:28Z","oa":"1"},{"issue":"1","intvolume":" 287","_id":"15022","page":"1 - 18","type":"journal_article","year":"2020","citation":{"short":"G. Schryen, European Journal of Operational Research 287 (2020) 1–18.","ieee":"G. Schryen, “Parallel computational optimization in operations research: A new integrative framework, literature review and research directions,” European Journal of Operational Research, vol. 287, no. 1, pp. 1–18, 2020.","ama":"Schryen G. Parallel computational optimization in operations research: A new integrative framework, literature review and research directions. European Journal of Operational Research. 2020;287(1):1-18.","apa":"Schryen, G. (2020). Parallel computational optimization in operations research: A new integrative framework, literature review and research directions. European Journal of Operational Research, 287(1), 1–18.","chicago":"Schryen, Guido. “Parallel Computational Optimization in Operations Research: A New Integrative Framework, Literature Review and Research Directions.” European Journal of Operational Research 287, no. 1 (2020): 1–18.","mla":"Schryen, Guido. “Parallel Computational Optimization in Operations Research: A New Integrative Framework, Literature Review and Research Directions.” European Journal of Operational Research, vol. 287, no. 1, Elsevier, 2020, pp. 1–18.","bibtex":"@article{Schryen_2020, title={Parallel computational optimization in operations research: A new integrative framework, literature review and research directions}, volume={287}, number={1}, journal={European Journal of Operational Research}, publisher={Elsevier}, author={Schryen, Guido}, year={2020}, pages={1–18} }"},"ddc":["000"],"user_id":"61579","volume":287,"date_created":"2019-11-18T11:11:00Z","has_accepted_license":"1","status":"public","publication":"European Journal of Operational Research","file_date_updated":"2020-03-05T10:37:02Z","publisher":"Elsevier","author":[{"id":"72850","last_name":"Schryen","full_name":"Schryen, Guido","first_name":"Guido"}],"file":[{"date_updated":"2020-03-05T10:37:02Z","content_type":"application/pdf","relation":"main_file","file_size":832170,"creator":"hsiemes","file_id":"15023","access_level":"open_access","file_name":"LR - OR and parallelization.pdf","date_created":"2019-11-18T11:11:56Z"}],"oa":"1","date_updated":"2022-01-06T06:52:15Z","language":[{"iso":"eng"}],"title":"Parallel computational optimization in operations research: A new integrative framework, literature review and research directions","department":[{"_id":"277"}]},{"_id":"16249","intvolume":" 16","issue":"1","page":"3 - 31","year":"2020","type":"journal_article","citation":{"short":"E. Szubartowicz, G. Schryen, Journal of Information System Security 16 (2020) 3–31.","ieee":"E. Szubartowicz and G. Schryen, “Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements,” Journal of Information System Security, vol. 16, no. 1, pp. 3–31, 2020.","chicago":"Szubartowicz, Eva, and Guido Schryen. “Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements.” Journal of Information System Security 16, no. 1 (2020): 3–31.","apa":"Szubartowicz, E., & Schryen, G. (2020). Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements. Journal of Information System Security, 16(1), 3–31.","ama":"Szubartowicz E, Schryen G. Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements. Journal of Information System Security. 2020;16(1):3-31.","mla":"Szubartowicz, Eva, and Guido Schryen. “Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements.” Journal of Information System Security, vol. 16, no. 1, Information Institute Publishing, Washington DC, USA, 2020, pp. 3–31.","bibtex":"@article{Szubartowicz_Schryen_2020, title={Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements}, volume={16}, number={1}, journal={Journal of Information System Security}, publisher={Information Institute Publishing, Washington DC, USA}, author={Szubartowicz, Eva and Schryen, Guido}, year={2020}, pages={3–31} }"},"abstract":[{"lang":"eng","text":"Timing plays a crucial role in the context of information security investments. We regard timing in two dimensions, namely the time of announcement in relation to the time of investment and the time of announcement in relation to the time of a fundamental security incident. The financial value of information security investments is assessed by examining the relationship between the investment announcements and their stock market reaction focusing on the two time dimensions. Using an event study methodology, we found that both dimensions influence the stock market return of the investing organization. Our results indicate that (1) after fundamental security incidents in a given industry, the stock price will react more positively to a firm’s announcement of actual information security investments than to announcements of the intention to invest; (2) the stock price will react more positively to a firm’s announcements of the intention to invest after the fundamental security incident compared to before; and (3) the stock price will react more positively to a firm’s announcements of actual information security investments after the fundamental security incident compared to before. Overall, the lowest abnormal return can be expected when the intention to invest is announced before a fundamental information security incident and the highest return when actual investing after a fundamental information security incident in the respective industry."}],"user_id":"61579","ddc":["000"],"file":[{"file_name":"Timing in Information Security - JISSEC format PREPUBLICATION.pdf","date_created":"2020-03-05T10:26:11Z","access_level":"open_access","creator":"hsiemes","file_id":"16250","file_size":478056,"relation":"main_file","date_updated":"2020-03-05T10:35:49Z","content_type":"application/pdf"}],"publication":"Journal of Information System Security","keyword":["Event Study","Information Security","Investment Announcements","Stock Price Reaction","Value of Information Security Investments"],"file_date_updated":"2020-03-05T10:35:49Z","publisher":"Information Institute Publishing, Washington DC, USA","author":[{"first_name":"Eva","full_name":"Szubartowicz, Eva","last_name":"Szubartowicz"},{"full_name":"Schryen, Guido","first_name":"Guido","id":"72850","last_name":"Schryen"}],"date_created":"2020-03-05T10:29:00Z","status":"public","has_accepted_license":"1","volume":16,"date_updated":"2022-01-06T06:52:47Z","oa":"1","language":[{"iso":"eng"}],"title":"Timing in Information Security: An Event Study on the Impact of Information Security Investment Announcements","department":[{"_id":"277"}]},{"department":[{"_id":"277"}],"publication_identifier":{"issn":[" 1529-3181"]},"title":"A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field","language":[{"iso":"eng"}],"date_updated":"2022-06-10T06:38:58Z","oa":"1","doi":"10.17705/1CAIS.04607","file":[{"access_level":"open_access","date_created":"2020-02-26T18:12:29Z","file_name":"RA-18-198.pdf","date_updated":"2020-03-05T10:36:15Z","content_type":"application/pdf","relation":"main_file","file_size":1146830,"file_id":"16115","creator":"schryen"}],"author":[{"first_name":"Guido","full_name":"Schryen, Guido","last_name":"Schryen","id":"72850"},{"first_name":"Gerit","full_name":"Wagner, Gerit","last_name":"Wagner"},{"last_name":"Benlian","first_name":"Alexander","full_name":"Benlian, Alexander"},{"full_name":"Paré, Guy","first_name":"Guy","last_name":"Paré"}],"publication":"Communications of the AIS","file_date_updated":"2020-03-05T10:36:15Z","keyword":["Literature review","knowledge development","knowledge building activities","knowledge-based typology","information systems research"],"status":"public","has_accepted_license":"1","date_created":"2019-07-12T12:01:02Z","volume":46,"abstract":[{"text":"Literature reviews (LRs) play an important role in the development of domain knowledge in all fields. Yet, we observe a\r\nlack of insights into the activities with which LRs actually develop knowledge. To address this important gap, we (1)\r\nderive knowledge building activities from the extant literature on LRs, (2) suggest a knowledge-based typology of LRs\r\nthat complements existing typologies, and (3) apply the suggested typology in an empirical study that explores how LRs\r\nwith different goals and methodologies have contributed to knowledge development. The analysis of 240 LRs published\r\nin 40 renowned IS journals between 2000 and 2014 allows us to draw a detailed picture of knowledge development\r\nachieved by one of the most important genres in the IS field. An overarching contribution of our work is to unify extant\r\nconceptualizations of LRs by clarifying and illustrating how LRs apply different methodologies in a range of knowledge\r\nbuilding activities to achieve their goals with respect to theory.","lang":"eng"}],"user_id":"72850","ddc":["000"],"type":"journal_article","citation":{"chicago":"Schryen, Guido, Gerit Wagner, Alexander Benlian, and Guy Paré. “A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field.” Communications of the AIS 46 (2020): 134–86. https://doi.org/10.17705/1CAIS.04607.","short":"G. Schryen, G. Wagner, A. Benlian, G. Paré, Communications of the AIS 46 (2020) 134–186.","apa":"Schryen, G., Wagner, G., Benlian, A., & Paré, G. (2020). A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field. Communications of the AIS, 46, 134–186. https://doi.org/10.17705/1CAIS.04607","ama":"Schryen G, Wagner G, Benlian A, Paré G. A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field. Communications of the AIS. 2020;46:134-186. doi:10.17705/1CAIS.04607","bibtex":"@article{Schryen_Wagner_Benlian_Paré_2020, title={A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field}, volume={46}, DOI={10.17705/1CAIS.04607}, journal={Communications of the AIS}, author={Schryen, Guido and Wagner, Gerit and Benlian, Alexander and Paré, Guy}, year={2020}, pages={134–186} }","mla":"Schryen, Guido, et al. “A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field.” Communications of the AIS, vol. 46, 2020, pp. 134–86, doi:10.17705/1CAIS.04607.","ieee":"G. Schryen, G. Wagner, A. Benlian, and G. Paré, “A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field,” Communications of the AIS, vol. 46, pp. 134–186, 2020, doi: 10.17705/1CAIS.04607."},"year":"2020","page":"134-186","intvolume":" 46","_id":"11946"},{"department":[{"_id":"277"}],"title":"High Performance Business Computing","language":[{"iso":"eng"}],"date_updated":"2022-06-10T06:15:40Z","doi":"10.1007/s12599-019-00622-2","oa":"1","publication":"Business & Information Systems Engineering","file_date_updated":"2020-03-05T10:37:36Z","author":[{"id":"72850","last_name":"Schryen","full_name":"Schryen, Guido","first_name":"Guido"},{"last_name":"Kliewer","first_name":"Natalia","full_name":"Kliewer, Natalia"},{"last_name":"Fink","first_name":"Andreas","full_name":"Fink, Andreas"}],"file":[{"file_size":161538,"file_id":"14986","creator":"hsiemes","date_updated":"2020-03-05T10:37:36Z","content_type":"application/pdf","relation":"main_file","date_created":"2019-11-14T10:52:41Z","file_name":"Schryen2019_Article_HighPerformanceBusinessComputi.pdf","access_level":"open_access"}],"volume":62,"date_created":"2019-11-14T10:49:39Z","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"72850","page":"1-3","year":"2020","type":"journal_article","citation":{"mla":"Schryen, Guido, et al. “High Performance Business Computing.” Business & Information Systems Engineering, vol. 62, no. 1, 2020, pp. 1–3, doi:10.1007/s12599-019-00622-2.","bibtex":"@article{Schryen_Kliewer_Fink_2020, title={High Performance Business Computing}, volume={62}, DOI={10.1007/s12599-019-00622-2}, number={1}, journal={Business & Information Systems Engineering}, author={Schryen, Guido and Kliewer, Natalia and Fink, Andreas}, year={2020}, pages={1–3} }","chicago":"Schryen, Guido, Natalia Kliewer, and Andreas Fink. “High Performance Business Computing.” Business & Information Systems Engineering 62, no. 1 (2020): 1–3. https://doi.org/10.1007/s12599-019-00622-2.","ama":"Schryen G, Kliewer N, Fink A. High Performance Business Computing. Business & Information Systems Engineering. 2020;62(1):1-3. doi:10.1007/s12599-019-00622-2","apa":"Schryen, G., Kliewer, N., & Fink, A. (2020). High Performance Business Computing. Business & Information Systems Engineering, 62(1), 1–3. https://doi.org/10.1007/s12599-019-00622-2","ieee":"G. Schryen, N. Kliewer, and A. Fink, “High Performance Business Computing,” Business & Information Systems Engineering, vol. 62, no. 1, pp. 1–3, 2020, doi: 10.1007/s12599-019-00622-2.","short":"G. Schryen, N. Kliewer, A. Fink, Business & Information Systems Engineering 62 (2020) 1–3."},"_id":"14985","intvolume":" 62","issue":"1"},{"article_type":"original","abstract":[{"lang":"eng","text":"Today, organizations must deal with a plethora of IT security threats and to ensure smooth and\r\nuninterrupted business operations, firms are challenged to predict the volume of IT security vulnerabilities\r\nand allocate resources for fixing them. This challenge requires decision makers to assess\r\nwhich system or software packages are prone to vulnerabilities, how many post-release vulnerabilities\r\ncan be expected to occur during a certain period of time, and what impact exploits might have.\r\nSubstantial research has been dedicated to techniques that analyze source code and detect security\r\nvulnerabilities. However, only limited research has focused on forecasting security vulnerabilities\r\nthat are detected and reported after the release of software. To address this shortcoming, we apply\r\nestablished methodologies which are capable of forecasting events exhibiting specific time series\r\ncharacteristics of security vulnerabilities, i.e., rareness of occurrence, volatility, non-stationarity,\r\nand seasonality. Based on a dataset taken from the National Vulnerability Database (NVD), we use\r\nthe Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) to measure the forecasting\r\naccuracy of single, double, and triple exponential smoothing methodologies, Croston's methodology,\r\nARIMA, and a neural network-based approach. We analyze the impact of the applied forecasting\r\nmethodology on the prediction accuracy with regard to its robustness along the dimensions of the\r\nexamined system and software package \"operating systems\", \"browsers\" and \"office solutions\" and\r\nthe applied metrics. To the best of our knowledge, this study is the first to analyze the effect\r\nof forecasting methodologies and to apply metrics that are suitable in this context. Our results\r\nshow that the optimal forecasting methodology depends on the software or system package, as some\r\nmethodologies perform poorly in the context of IT security vulnerabilities, that absolute metrics\r\ncan cover the actual prediction error precisely, and that the prediction accuracy is robust within the\r\ntwo applied forecasting-error metrics."}],"user_id":"72850","ddc":["000"],"file":[{"file_name":"Forecasting_IT_Security_Vulnerabilities.pdf","date_created":"2019-09-09T18:24:35Z","access_level":"open_access","file_id":"13176","creator":"schryen","file_size":894663,"relation":"main_file","date_updated":"2019-09-09T18:24:35Z","content_type":"application/pdf"}],"author":[{"first_name":"Emrah","full_name":"Yasasin, Emrah","last_name":"Yasasin"},{"first_name":"Julian","full_name":"Prester, Julian","last_name":"Prester"},{"last_name":"Wagner","full_name":"Wagner, Gerit","first_name":"Gerit"},{"first_name":"Guido","full_name":"Schryen, Guido","last_name":"Schryen","id":"72850"}],"file_date_updated":"2019-09-09T18:24:35Z","publication":"Computers & Security","status":"public","has_accepted_license":"1","date_created":"2019-09-09T18:24:45Z","volume":88,"_id":"13175","intvolume":" 88","issue":"January","year":"2020","citation":{"short":"E. Yasasin, J. Prester, G. Wagner, G. Schryen, Computers & Security 88 (2020).","ieee":"E. Yasasin, J. Prester, G. Wagner, and G. Schryen, “Forecasting IT Security Vulnerabilities - An Empirical Analysis,” Computers & Security, vol. 88, no. January, 2020.","ama":"Yasasin E, Prester J, Wagner G, Schryen G. Forecasting IT Security Vulnerabilities - An Empirical Analysis. Computers & Security. 2020;88(January).","apa":"Yasasin, E., Prester, J., Wagner, G., & Schryen, G. (2020). Forecasting IT Security Vulnerabilities - An Empirical Analysis. Computers & Security, 88(January).","chicago":"Yasasin, Emrah, Julian Prester, Gerit Wagner, and Guido Schryen. “Forecasting IT Security Vulnerabilities - An Empirical Analysis.” Computers & Security 88, no. January (2020).","bibtex":"@article{Yasasin_Prester_Wagner_Schryen_2020, title={Forecasting IT Security Vulnerabilities - An Empirical Analysis}, volume={88}, number={January}, journal={Computers & Security}, author={Yasasin, Emrah and Prester, Julian and Wagner, Gerit and Schryen, Guido}, year={2020} }","mla":"Yasasin, Emrah, et al. “Forecasting IT Security Vulnerabilities - An Empirical Analysis.” Computers & Security, vol. 88, no. January, 2020."},"type":"journal_article","title":"Forecasting IT Security Vulnerabilities - An Empirical Analysis","department":[{"_id":"195"},{"_id":"277"}],"publication_identifier":{"issn":["0167-4048"]},"publication_status":"published","date_updated":"2022-10-19T15:27:51Z","oa":"1","language":[{"iso":"eng"}]},{"issue":"1","intvolume":" 272","_id":"5674","citation":{"ieee":"G. Rauchecker and G. Schryen, “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response,” European Journal of Operational Research, vol. 272, no. 1, pp. 352–363, 2019.","short":"G. Rauchecker, G. Schryen, European Journal of Operational Research 272 (2019) 352–363.","mla":"Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response.” European Journal of Operational Research, vol. 272, no. 1, Elsevier, 2019, pp. 352–63.","bibtex":"@article{Rauchecker_Schryen_2019, title={An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response}, volume={272}, number={1}, journal={European Journal of Operational Research}, publisher={Elsevier}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2019}, pages={352–363} }","apa":"Rauchecker, G., & Schryen, G. (2019). An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response. European Journal of Operational Research, 272(1), 352–363.","ama":"Rauchecker G, Schryen G. An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response. European Journal of Operational Research. 2019;272(1):352-363.","chicago":"Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response.” European Journal of Operational Research 272, no. 1 (2019): 352–63."},"type":"journal_article","year":"2019","page":"352 - 363","ddc":["000"],"user_id":"61579","abstract":[{"text":"In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments - including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature - for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.","lang":"eng"}],"volume":272,"status":"public","has_accepted_license":"1","date_created":"2018-11-14T15:35:27Z","author":[{"last_name":"Rauchecker","first_name":"Gerhard","full_name":"Rauchecker, Gerhard"},{"full_name":"Schryen, Guido","first_name":"Guido","id":"72850","last_name":"Schryen"}],"publisher":"Elsevier","publication":"European Journal of Operational Research","file_date_updated":"2018-12-13T15:16:37Z","keyword":["OR in disaster relief","disaster operations management","scheduling","branch-and-price"],"file":[{"date_updated":"2018-12-13T15:16:37Z","content_type":"application/pdf","relation":"main_file","file_size":1470310,"file_id":"6019","creator":"hsiemes","access_level":"open_access","date_created":"2018-12-07T11:13:12Z","file_name":"JOURNAL VERSION.pdf"}],"oa":"1","date_updated":"2022-01-06T07:02:28Z","language":[{"iso":"eng"}],"title":"An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response","department":[{"_id":"277"}]},{"date_updated":"2022-01-06T07:03:08Z","oa":"1","language":[{"iso":"eng"}],"title":"Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm","department":[{"_id":"277"}],"_id":"6512","issue":"104","type":"journal_article","year":"2019","citation":{"ieee":"G. Rauchecker and G. Schryen, “Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm,” Computers & Operations Research, no. 104, pp. 338–357, 2019.","short":"G. Rauchecker, G. Schryen, Computers & Operations Research (2019) 338–357.","bibtex":"@article{Rauchecker_Schryen_2019, title={Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm}, number={104}, journal={Computers & Operations Research}, publisher={Elsevier}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2019}, pages={338–357} }","mla":"Rauchecker, Gerhard, and Guido Schryen. “Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm.” Computers & Operations Research, no. 104, Elsevier, 2019, pp. 338–57.","chicago":"Rauchecker, Gerhard, and Guido Schryen. “Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm.” Computers & Operations Research, no. 104 (2019): 338–57.","ama":"Rauchecker G, Schryen G. Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm. Computers & Operations Research. 2019;(104):338-357.","apa":"Rauchecker, G., & Schryen, G. (2019). Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm. Computers & Operations Research, (104), 338–357."},"page":"338-357","abstract":[{"lang":"eng","text":"Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. Since many scheduling problems are NP-hard in the strong sense, there is only limited research on exact algorithms and how their efficiency scales when implemented on parallel computing architectures. We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, (2) parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern high performance computing cluster. With our experiments, we show that the efficiency of our parallelization approach can lead to superlinear speedup but can vary substantially between instances. We further show that the wall time of serial execution can be substantially reduced through our parallelization, in some cases from 94 hours to less than six minutes when our algorithm is executed on 960 processes."}],"user_id":"61579","ddc":["000"],"file":[{"access_level":"open_access","date_created":"2019-01-08T14:03:53Z","file_name":"cor-parallel-bp-for-upmsp.pdf","date_updated":"2019-01-08T14:03:53Z","content_type":"application/pdf","relation":"main_file","file_size":4153528,"creator":"hsiemes","file_id":"6513"}],"author":[{"last_name":"Rauchecker","first_name":"Gerhard","full_name":"Rauchecker, Gerhard"},{"last_name":"Schryen","id":"72850","first_name":"Guido","full_name":"Schryen, Guido"}],"publisher":"Elsevier","keyword":["parallel machine scheduling with setup times","parallel branch-and-price algorithm","high performance computing","master/worker parallelization"],"publication":"Computers & Operations Research","file_date_updated":"2019-01-08T14:03:53Z","status":"public","has_accepted_license":"1","date_created":"2019-01-08T13:50:44Z"},{"_id":"6514","conference":{"location":"Siegen, Germany","start_date":"2019-02-24","name":"14th International Conference on Wirtschaftsinformatik","end_date":"2019-02-27"},"citation":{"ieee":"V. Schuhbeck, N. Siegfried, V. Dorner, A. Benlian, M. Scholz, and G. Schryen, “Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents,” in Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik, Siegen, Germany, 2019, pp. 55–64.","short":"V. Schuhbeck, N. Siegfried, V. Dorner, A. Benlian, M. Scholz, G. Schryen, in: Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik, Siegen, Germany, 2019, pp. 55–64.","mla":"Schuhbeck, Veronika, et al. “Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents.” Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik, 2019, pp. 55–64.","bibtex":"@inproceedings{Schuhbeck_Siegfried_Dorner_Benlian_Scholz_Schryen_2019, place={Siegen, Germany}, title={Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents}, booktitle={Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik}, author={Schuhbeck, Veronika and Siegfried, Nils and Dorner, Verena and Benlian, Alexander and Scholz, Michael and Schryen, Guido}, year={2019}, pages={55–64} }","apa":"Schuhbeck, V., Siegfried, N., Dorner, V., Benlian, A., Scholz, M., & Schryen, G. (2019). Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents. In Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik (pp. 55–64). Siegen, Germany.","ama":"Schuhbeck V, Siegfried N, Dorner V, Benlian A, Scholz M, Schryen G. Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents. In: Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik. Siegen, Germany; 2019:55-64.","chicago":"Schuhbeck, Veronika, Nils Siegfried, Verena Dorner, Alexander Benlian, Michael Scholz, and Guido Schryen. “Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents.” In Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik, 55–64. Siegen, Germany, 2019."},"year":"2019","type":"conference","page":"55-64","user_id":"61579","ddc":["000"],"abstract":[{"text":"Recommender Agents (RAs) facilitate consumers’ online purchase decisions for complex, multi-attribute products. As not all combinations of attribute levels can be obtained, users are forced into trade-offs. The exposure of trade-offs in a RA has been found to affect consumers’ perceptions. However, little is known about how different preference elicitation methods in RAs affect consumers by varying degrees of trade-off exposure. We propose a research model that investigates how different levels of trade-off exposure cognitively and affectively influence consumers’ satisfaction with RAs. We operationalize these levels in three different RA types and test our hypotheses in a laboratory experiment with 116 participants. Our results indicate that with increasing tradeoff exposure, perceived enjoyment and perceived control follow an inverted Ushaped relationship. Hence, RAs using preference elicitation methods with medium trade-off exposure yield highest consumer satisfaction. This contributes to the understanding of trade-offs in RAs and provides valuable implications to e-commerce practitioners.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2019-01-08T14:06:32Z","file":[{"relation":"main_file","date_updated":"2021-08-13T13:26:11Z","content_type":"application/pdf","file_id":"6515","creator":"hsiemes","file_size":371490,"access_level":"closed","date_created":"2019-01-08T14:07:17Z","file_name":"WALKING THE MIDDLE PATH.pdf"},{"file_name":"Walking the Middle Path_ How Medium Trade-Off Exposure Leads to H.pdf","date_created":"2021-08-13T13:25:53Z","access_level":"open_access","file_id":"23393","creator":"hsiemes","file_size":331001,"relation":"main_file","date_updated":"2021-08-13T13:25:53Z","content_type":"application/pdf"}],"author":[{"full_name":"Schuhbeck, Veronika","first_name":"Veronika","last_name":"Schuhbeck"},{"last_name":"Siegfried","first_name":"Nils","full_name":"Siegfried, Nils"},{"last_name":"Dorner","full_name":"Dorner, Verena","first_name":"Verena"},{"last_name":"Benlian","full_name":"Benlian, Alexander","first_name":"Alexander"},{"full_name":"Scholz, Michael","first_name":"Michael","last_name":"Scholz"},{"first_name":"Guido","full_name":"Schryen, Guido","last_name":"Schryen","id":"72850"}],"file_date_updated":"2021-08-13T13:26:11Z","keyword":["Recommender Agents","Preference Elicitation Method","Trade-off Exposure","Customer Satisfaction"],"publication":"Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik","oa":"1","date_updated":"2022-01-06T07:03:09Z","language":[{"iso":"eng"}],"title":"Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents","place":"Siegen, Germany","department":[{"_id":"277"}]},{"year":"2019","type":"book_chapter","citation":{"apa":"Kuhlemann, S., Sellmann, M., & Tierney, K. (2019). Exploiting Counterfactuals for Scalable Stochastic Optimization. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-30048-7_40","ama":"Kuhlemann S, Sellmann M, Tierney K. Exploiting Counterfactuals for Scalable Stochastic Optimization. In: Lecture Notes in Computer Science. Cham; 2019. doi:10.1007/978-3-030-30048-7_40","chicago":"Kuhlemann, Stefan, Meinolf Sellmann, and Kevin Tierney. “Exploiting Counterfactuals for Scalable Stochastic Optimization.” In Lecture Notes in Computer Science. Cham, 2019. https://doi.org/10.1007/978-3-030-30048-7_40.","bibtex":"@inbook{Kuhlemann_Sellmann_Tierney_2019, place={Cham}, title={Exploiting Counterfactuals for Scalable Stochastic Optimization}, DOI={10.1007/978-3-030-30048-7_40}, booktitle={Lecture Notes in Computer Science}, author={Kuhlemann, Stefan and Sellmann, Meinolf and Tierney, Kevin}, year={2019} }","mla":"Kuhlemann, Stefan, et al. “Exploiting Counterfactuals for Scalable Stochastic Optimization.” Lecture Notes in Computer Science, 2019, doi:10.1007/978-3-030-30048-7_40.","short":"S. Kuhlemann, M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science, Cham, 2019.","ieee":"S. Kuhlemann, M. Sellmann, and K. Tierney, “Exploiting Counterfactuals for Scalable Stochastic Optimization,” in Lecture Notes in Computer Science, Cham, 2019."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-30048-7_40","_id":"14890","date_updated":"2022-01-06T06:52:09Z","publication_status":"published","publication_identifier":{"isbn":["9783030300470","9783030300487"],"issn":["0302-9743","1611-3349"]},"date_created":"2019-11-12T07:45:53Z","status":"public","department":[{"_id":"277"}],"publication":"Lecture Notes in Computer Science","author":[{"last_name":"Kuhlemann","id":"38910","first_name":"Stefan","full_name":"Kuhlemann, Stefan"},{"last_name":"Sellmann","full_name":"Sellmann, Meinolf","first_name":"Meinolf"},{"first_name":"Kevin","full_name":"Tierney, Kevin","last_name":"Tierney"}],"title":"Exploiting Counterfactuals for Scalable Stochastic Optimization","user_id":"38910","place":"Cham"},{"language":[{"iso":"eng"}],"year":"2019","type":"journal_article","citation":{"ieee":"G. Schryen, N. Kliewer, R. Borndörfer, and T. Koch, “High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis,” OR News, vol. 65, pp. 34–35, 2019.","short":"G. Schryen, N. Kliewer, R. Borndörfer, T. Koch, OR News 65 (2019) 34–35.","mla":"Schryen, Guido, et al. “High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis.” OR News, vol. 65, 2019, pp. 34–35.","bibtex":"@article{Schryen_Kliewer_Borndörfer_Koch_2019, title={High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis}, volume={65}, journal={OR News}, author={Schryen, Guido and Kliewer, Natalia and Borndörfer, Ralf and Koch, Thorsten}, year={2019}, pages={34–35} }","chicago":"Schryen, Guido, Natalia Kliewer, Ralf Borndörfer, and Thorsten Koch. “High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis.” OR News 65 (2019): 34–35.","ama":"Schryen G, Kliewer N, Borndörfer R, Koch T. High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis. OR News. 2019;65:34-35.","apa":"Schryen, G., Kliewer, N., Borndörfer, R., & Koch, T. (2019). High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis. OR News, 65, 34–35."},"page":"34-35","_id":"14540","intvolume":" 65","date_updated":"2022-01-06T06:52:02Z","status":"public","has_accepted_license":"1","date_created":"2019-11-04T17:00:30Z","volume":65,"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2019-11-05T10:09:05Z","creator":"hsiemes","file_id":"14542","file_size":4631697,"access_level":"closed","date_created":"2019-11-05T10:09:05Z","file_name":"1st International Workshop on HPBC.pdf"}],"author":[{"full_name":"Schryen, Guido","first_name":"Guido","id":"72850","last_name":"Schryen"},{"last_name":"Kliewer","first_name":"Natalia","full_name":"Kliewer, Natalia"},{"last_name":"Borndörfer","first_name":"Ralf","full_name":"Borndörfer, Ralf"},{"first_name":"Thorsten","full_name":"Koch, Thorsten","last_name":"Koch"}],"publication":"OR News","file_date_updated":"2019-11-05T10:09:05Z","department":[{"_id":"277"}],"user_id":"61579","title":"High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis","ddc":["000"]},{"publication":"Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management","keyword":["Coordination of spontaneous volunteers","volunteer coordination system","decision support","scheduling optimization model","linear programming"],"file_date_updated":"2018-12-13T15:05:44Z","author":[{"first_name":"Gerhard","full_name":"Rauchecker, Gerhard","last_name":"Rauchecker"},{"first_name":"Guido","full_name":"Schryen, Guido","last_name":"Schryen","id":"72850"}],"file":[{"creator":"hsiemes","file_id":"6020","file_size":488472,"relation":"main_file","date_updated":"2018-12-13T15:05:44Z","content_type":"application/pdf","file_name":"2018_ISCRAM_Conference_Proceedings - Publication Version.pdf","date_created":"2018-12-07T11:25:06Z","access_level":"open_access"}],"date_created":"2018-11-14T15:35:54Z","has_accepted_license":"1","status":"public","extern":"1","abstract":[{"lang":"eng","text":"When responding to natural disasters, professional relief units are often supported by many volunteers which are not affiliated to humanitarian organizations. The effective coordination of these volunteers is crucial to leverage their capabilities and to avoid conflicts with professional relief units. In this paper, we empirically identify key requirements that professional relief units pose on this coordination. Based on these requirements, we suggest a decision model. We computationally solve a real-world instance of the model and empirically validate the computed solution in interviews with practitioners. Our results show that the suggested model allows for solving volunteer coordination tasks of realistic size near-optimally within short time, with the determined solution being well accepted by practitioners. We also describe in this article how the suggested decision support model is integrated in the volunteer coordination system which we develop in joint cooperation with a disaster management authority and a software development company."}],"ddc":["000"],"user_id":"61579","type":"conference","citation":{"chicago":"Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief.” In Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, 2018.","ama":"Rauchecker G, Schryen G. Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief. In: Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management. ; 2018.","apa":"Rauchecker, G., & Schryen, G. (2018). Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief. In Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management. Rochester, NY, USA.","bibtex":"@inproceedings{Rauchecker_Schryen_2018, title={Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief}, booktitle={Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2018} }","mla":"Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief.” Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, 2018.","short":"G. Rauchecker, G. Schryen, in: Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, 2018.","ieee":"G. Rauchecker and G. Schryen, “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief,” in Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, Rochester, NY, USA, 2018."},"year":"2018","conference":{"location":"Rochester, NY, USA","name":"15th International Conference on Information Systems for Crisis Response and Management"},"_id":"5675","department":[{"_id":"277"}],"title":"Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:28Z","oa":"1"},{"title":"Classifying the Ideational Impact of IS Review Articles: A Natural Language Processing Based Approach","place":"San Francisco, CA, USA","department":[{"_id":"277"}],"oa":"1","date_updated":"2022-01-06T07:02:31Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"61579","extern":"1","date_created":"2018-11-14T15:41:39Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-12-13T15:05:57Z","publication":"Proceedings of the 2018 International Conference on Information Systems (ICIS 2018)","author":[{"full_name":"Prester, Julian","first_name":"Julian","last_name":"Prester"},{"first_name":"Gerit","full_name":"Wagner, Gerit","last_name":"Wagner"},{"full_name":"Schryen, Guido","first_name":"Guido","id":"72850","last_name":"Schryen"}],"file":[{"date_created":"2018-12-07T11:25:55Z","file_name":"ICIS - 2018 - Classifying the Ideational Impact of IS Review Articles.pdf","access_level":"open_access","creator":"hsiemes","file_id":"6021","file_size":336667,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-12-13T15:05:57Z"}],"conference":{"location":"San Francisco, CA, USA","name":"Thirty Ninth International Conference on Information Systems"},"_id":"5681","citation":{"apa":"Prester, J., Wagner, G., & Schryen, G. (2018). Classifying the Ideational Impact of IS Review Articles: A Natural Language Processing Based Approach. In Proceedings of the 2018 International Conference on Information Systems (ICIS 2018). San Francisco, CA, USA.","ama":"Prester J, Wagner G, Schryen G. Classifying the Ideational Impact of IS Review Articles: A Natural Language Processing Based Approach. In: Proceedings of the 2018 International Conference on Information Systems (ICIS 2018). San Francisco, CA, USA; 2018.","chicago":"Prester, Julian, Gerit Wagner, and Guido Schryen. “Classifying the Ideational Impact of IS Review Articles: A Natural Language Processing Based Approach.” In Proceedings of the 2018 International Conference on Information Systems (ICIS 2018). San Francisco, CA, USA, 2018.","bibtex":"@inproceedings{Prester_Wagner_Schryen_2018, place={San Francisco, CA, USA}, title={Classifying the Ideational Impact of IS Review Articles: A Natural Language Processing Based Approach}, booktitle={Proceedings of the 2018 International Conference on Information Systems (ICIS 2018)}, author={Prester, Julian and Wagner, Gerit and Schryen, Guido}, year={2018} }","mla":"Prester, Julian, et al. “Classifying the Ideational Impact of IS Review Articles: A Natural Language Processing Based Approach.” Proceedings of the 2018 International Conference on Information Systems (ICIS 2018), 2018.","short":"J. Prester, G. Wagner, G. Schryen, in: Proceedings of the 2018 International Conference on Information Systems (ICIS 2018), San Francisco, CA, USA, 2018.","ieee":"J. Prester, G. Wagner, and G. Schryen, “Classifying the Ideational Impact of IS Review Articles: A Natural Language Processing Based Approach,” in Proceedings of the 2018 International Conference on Information Systems (ICIS 2018), San Francisco, CA, USA, 2018."},"type":"conference","year":"2018"},{"title":"Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC","publication_identifier":{"isbn":["978-3-88246-374-3"]},"department":[{"_id":"277"}],"oa":"1","doi":"10.5283/epub.36264","date_updated":"2022-01-06T07:02:54Z","language":[{"iso":"eng"}],"user_id":"61579","ddc":["000"],"extern":"1","date_created":"2018-12-11T13:39:45Z","has_accepted_license":"1","status":"public","file":[{"file_size":1913774,"file_id":"6165","creator":"hsiemes","date_updated":"2018-12-13T15:21:02Z","content_type":"application/pdf","relation":"main_file","file_name":"PUBLISHED BOOK - Security in Highly Connected IT Systems.pdf","date_created":"2018-12-11T13:42:43Z","access_level":"open_access"}],"file_date_updated":"2018-12-13T15:21:02Z","publisher":"University of Regensburg","author":[{"last_name":"Schillinger","full_name":"Schillinger, Rolf","first_name":"Rolf"},{"full_name":"Schryen, Guido","first_name":"Guido","id":"72850","last_name":"Schryen"}],"_id":"6164","type":"book","year":"2018","citation":{"mla":"Schillinger, Rolf, and Guido Schryen. Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC. University of Regensburg, 2018, doi:10.5283/epub.36264.","bibtex":"@book{Schillinger_Schryen_2018, title={Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC}, DOI={10.5283/epub.36264}, publisher={University of Regensburg}, author={Schillinger, Rolf and Schryen, Guido}, year={2018} }","ama":"Schillinger R, Schryen G. Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC. University of Regensburg; 2018. doi:10.5283/epub.36264","apa":"Schillinger, R., & Schryen, G. (2018). Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC. University of Regensburg. https://doi.org/10.5283/epub.36264","chicago":"Schillinger, Rolf, and Guido Schryen. Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC. University of Regensburg, 2018. https://doi.org/10.5283/epub.36264.","ieee":"R. Schillinger and G. Schryen, Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC. University of Regensburg, 2018.","short":"R. Schillinger, G. Schryen, Security in Highly Connected IT Systems – Results of the Bavarian Research Alliance FORSEC, University of Regensburg, 2018."}},{"title":"Information Security Investments: An Exploratory Multiple Case Study on Decision-Making, Evaluation and Learning","department":[{"_id":"277"}],"oa":"1","date_updated":"2022-01-06T07:02:03Z","language":[{"iso":"eng"}],"user_id":"61579","ddc":["000"],"abstract":[{"lang":"eng","text":"The need to protect resources against attackers is reflected by huge information security investments of firms worldwide. In the presence of budget constraints and a diverse set of assets to protect, organizations have to decide in which IT security measures to invest, how to evaluate those investment decisions, and how to learn from past decisions to optimize future security investment actions. While the academic literature has provided valuable insights into these issues, there is a lack of empirical contributions. To address this lack, we conduct a theory-based exploratory multiple case study. Our case study reveals that (1) firms? investments in information security are largely driven by external environmental and industry-related factors, (2) firms do not implement standardized decision processes, (3) the security process is perceived to impact the business process in a disturbing way, (4) both the implementation of evaluation processes and the application of metrics are hardly existent and (5) learning activities mainly occur at an ad-hoc basis."}],"extern":"1","date_created":"2018-11-14T11:24:37Z","status":"public","has_accepted_license":"1","volume":77,"file":[{"access_level":"open_access","date_created":"2018-12-07T11:26:53Z","file_name":"JOURNAL VERSION.pdf","relation":"main_file","date_updated":"2018-12-13T15:06:10Z","content_type":"application/pdf","creator":"hsiemes","file_id":"6022","file_size":809490}],"keyword":["Information Security Investments","Multiple Case Study","Organizations","Single Loop Learning","Double Loop Learning"],"file_date_updated":"2018-12-13T15:06:10Z","publication":"Computers & Security","author":[{"last_name":"Weishäupl","full_name":"Weishäupl, Eva","first_name":"Eva"},{"first_name":"Emrah","full_name":"Yasasin, Emrah","last_name":"Yasasin"},{"full_name":"Schryen, Guido","first_name":"Guido","id":"72850","last_name":"Schryen"}],"publisher":"Elsevier","_id":"5586","intvolume":" 77","page":"807 - 823","type":"journal_article","year":"2018","citation":{"chicago":"Weishäupl, Eva, Emrah Yasasin, and Guido Schryen. “Information Security Investments: An Exploratory Multiple Case Study on Decision-Making, Evaluation and Learning.” Computers & Security 77 (2018): 807–23.","apa":"Weishäupl, E., Yasasin, E., & Schryen, G. (2018). Information Security Investments: An Exploratory Multiple Case Study on Decision-Making, Evaluation and Learning. Computers & Security, 77, 807–823.","ama":"Weishäupl E, Yasasin E, Schryen G. Information Security Investments: An Exploratory Multiple Case Study on Decision-Making, Evaluation and Learning. Computers & Security. 2018;77:807-823.","mla":"Weishäupl, Eva, et al. “Information Security Investments: An Exploratory Multiple Case Study on Decision-Making, Evaluation and Learning.” Computers & Security, vol. 77, Elsevier, 2018, pp. 807–23.","bibtex":"@article{Weishäupl_Yasasin_Schryen_2018, title={Information Security Investments: An Exploratory Multiple Case Study on Decision-Making, Evaluation and Learning}, volume={77}, journal={Computers & Security}, publisher={Elsevier}, author={Weishäupl, Eva and Yasasin, Emrah and Schryen, Guido}, year={2018}, pages={807–823} }","short":"E. Weishäupl, E. Yasasin, G. Schryen, Computers & Security 77 (2018) 807–823.","ieee":"E. Weishäupl, E. Yasasin, and G. Schryen, “Information Security Investments: An Exploratory Multiple Case Study on Decision-Making, Evaluation and Learning,” Computers & Security, vol. 77, pp. 807–823, 2018."}},{"date_created":"2018-11-14T11:51:38Z","status":"public","has_accepted_license":"1","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-12-13T15:06:21Z","creator":"hsiemes","file_id":"6023","file_size":1080982,"access_level":"open_access","date_created":"2018-12-07T11:28:03Z","file_name":"paper345.pdf"}],"file_date_updated":"2018-12-13T15:06:21Z","publication":"Proceedings of the 2018 International Conference on Information Systems (ICIS 2018)","author":[{"first_name":"Richard","full_name":"Schuster, Richard","last_name":"Schuster"},{"first_name":"Gerit","full_name":"Wagner, Gerit","last_name":"Wagner"},{"first_name":"Guido","full_name":"Schryen, Guido","last_name":"Schryen","id":"72850"}],"user_id":"61579","ddc":["000"],"extern":"1","citation":{"ieee":"R. Schuster, G. Wagner, and G. Schryen, “Information Systems Design Science Research and Cumulative Knowledge Development: An Exploratory Study,” in Proceedings of the 2018 International Conference on Information Systems (ICIS 2018), San Francisco, CA, USA, 2018.","short":"R. Schuster, G. Wagner, G. Schryen, in: Proceedings of the 2018 International Conference on Information Systems (ICIS 2018), San Francisco, CA, USA, 2018.","mla":"Schuster, Richard, et al. “Information Systems Design Science Research and Cumulative Knowledge Development: An Exploratory Study.” Proceedings of the 2018 International Conference on Information Systems (ICIS 2018), 2018.","bibtex":"@inproceedings{Schuster_Wagner_Schryen_2018, place={San Francisco, CA, USA}, title={Information Systems Design Science Research and Cumulative Knowledge Development: An Exploratory Study}, booktitle={Proceedings of the 2018 International Conference on Information Systems (ICIS 2018)}, author={Schuster, Richard and Wagner, Gerit and Schryen, Guido}, year={2018} }","chicago":"Schuster, Richard, Gerit Wagner, and Guido Schryen. “Information Systems Design Science Research and Cumulative Knowledge Development: An Exploratory Study.” In Proceedings of the 2018 International Conference on Information Systems (ICIS 2018). San Francisco, CA, USA, 2018.","apa":"Schuster, R., Wagner, G., & Schryen, G. (2018). Information Systems Design Science Research and Cumulative Knowledge Development: An Exploratory Study. In Proceedings of the 2018 International Conference on Information Systems (ICIS 2018). San Francisco, CA, USA.","ama":"Schuster R, Wagner G, Schryen G. Information Systems Design Science Research and Cumulative Knowledge Development: An Exploratory Study. In: Proceedings of the 2018 International Conference on Information Systems (ICIS 2018). San Francisco, CA, USA; 2018."},"year":"2018","type":"conference","conference":{"location":"San Francisco, CA, USA","name":"Thirty Ninth International Conference on Information Systems"},"_id":"5600","department":[{"_id":"277"}],"title":"Information Systems Design Science Research and Cumulative Knowledge Development: An Exploratory Study","place":"San Francisco, CA, USA","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T07:02:07Z"},{"status":"public","date_created":"2019-11-08T08:10:10Z","publication_identifier":{"isbn":["9783319962702","9783319962719"],"issn":["1865-0929","1865-0937"]},"publication_status":"published","author":[{"last_name":"Hallmann","full_name":"Hallmann, Corinna","first_name":"Corinna"},{"first_name":"Sascha Christian","full_name":"Burmeister, Sascha Christian","last_name":"Burmeister","id":"32685"},{"last_name":"Wissing","id":"32439","first_name":"Michaela","full_name":"Wissing, Michaela"},{"first_name":"Leena","full_name":"Suhl, Leena","last_name":"Suhl"}],"publication":"Communications in Computer and Information Science","department":[{"_id":"277"}],"user_id":"32439","title":"Heuristics and Simulation for Water Tank Optimization","place":"Cham","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"ieee":"C. Hallmann, S. C. Burmeister, M. Wissing, and L. Suhl, “Heuristics and Simulation for Water Tank Optimization,” in Communications in Computer and Information Science, Cham, 2018.","short":"C. Hallmann, S.C. Burmeister, M. Wissing, L. Suhl, in: Communications in Computer and Information Science, Cham, 2018.","bibtex":"@inbook{Hallmann_Burmeister_Wissing_Suhl_2018, place={Cham}, title={Heuristics and Simulation for Water Tank Optimization}, DOI={10.1007/978-3-319-96271-9_5}, booktitle={Communications in Computer and Information Science}, author={Hallmann, Corinna and Burmeister, Sascha Christian and Wissing, Michaela and Suhl, Leena}, year={2018} }","mla":"Hallmann, Corinna, et al. “Heuristics and Simulation for Water Tank Optimization.” Communications in Computer and Information Science, 2018, doi:10.1007/978-3-319-96271-9_5.","ama":"Hallmann C, Burmeister SC, Wissing M, Suhl L. Heuristics and Simulation for Water Tank Optimization. In: Communications in Computer and Information Science. Cham; 2018. doi:10.1007/978-3-319-96271-9_5","apa":"Hallmann, C., Burmeister, S. C., Wissing, M., & Suhl, L. (2018). Heuristics and Simulation for Water Tank Optimization. In Communications in Computer and Information Science. Cham. https://doi.org/10.1007/978-3-319-96271-9_5","chicago":"Hallmann, Corinna, Sascha Christian Burmeister, Michaela Wissing, and Leena Suhl. “Heuristics and Simulation for Water Tank Optimization.” In Communications in Computer and Information Science. Cham, 2018. https://doi.org/10.1007/978-3-319-96271-9_5."},"year":"2018","doi":"10.1007/978-3-319-96271-9_5","_id":"14856","date_updated":"2022-01-06T06:52:08Z"},{"place":"Cham","title":"Model Generator for Water Distribution Systems","user_id":"38910","author":[{"last_name":"Hallmann","full_name":"Hallmann, Corinna","first_name":"Corinna"},{"id":"38910","last_name":"Kuhlemann","full_name":"Kuhlemann, Stefan","first_name":"Stefan"}],"publication":"Operations Research Proceedings","department":[{"_id":"277"}],"publication_status":"published","publication_identifier":{"isbn":["9783319899190","9783319899206"],"issn":["0721-5924","2197-9294"]},"status":"public","date_created":"2019-11-08T08:27:37Z","date_updated":"2022-01-06T06:52:08Z","_id":"14861","doi":"10.1007/978-3-319-89920-6_34","type":"book_chapter","citation":{"ieee":"C. Hallmann and S. Kuhlemann, “Model Generator for Water Distribution Systems,” in Operations Research Proceedings, Cham, 2018.","short":"C. Hallmann, S. Kuhlemann, in: Operations Research Proceedings, Cham, 2018.","bibtex":"@inbook{Hallmann_Kuhlemann_2018, place={Cham}, title={Model Generator for Water Distribution Systems}, DOI={10.1007/978-3-319-89920-6_34}, booktitle={Operations Research Proceedings}, author={Hallmann, Corinna and Kuhlemann, Stefan}, year={2018} }","mla":"Hallmann, Corinna, and Stefan Kuhlemann. “Model Generator for Water Distribution Systems.” Operations Research Proceedings, 2018, doi:10.1007/978-3-319-89920-6_34.","apa":"Hallmann, C., & Kuhlemann, S. (2018). Model Generator for Water Distribution Systems. In Operations Research Proceedings. Cham. https://doi.org/10.1007/978-3-319-89920-6_34","ama":"Hallmann C, Kuhlemann S. Model Generator for Water Distribution Systems. In: Operations Research Proceedings. Cham; 2018. doi:10.1007/978-3-319-89920-6_34","chicago":"Hallmann, Corinna, and Stefan Kuhlemann. “Model Generator for Water Distribution Systems.” In Operations Research Proceedings. Cham, 2018. https://doi.org/10.1007/978-3-319-89920-6_34."},"year":"2018","language":[{"iso":"eng"}]},{"title":"Algorithms for Max-Min Share Fair Allocation of Indivisible Chores","department":[{"_id":"277"}],"date_updated":"2022-01-06T07:02:35Z","oa":"1","language":[{"iso":"eng"}],"extern":"1","abstract":[{"text":"We consider Max-min Share (MmS) fair allocations of indivisible chores (items with negative utilities). We show that allocation of chores and classical allocation of goods (items with positive utilities) have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa. We prove that an MmS allocation does not need to exist for chores and computing an MmS allocation - if it exists - is strongly NP-hard. In view of these non-existence and complexity results, we present a polynomial-time 2-approximation algorithm for MmS fairness for chores. We then introduce a new fairness concept called optimal MmS that represents the best possible allocation in terms of MmS that is guaranteed to exist. We use connections to parallel machine scheduling to give (1) a polynomial-time approximation scheme for computing an optimal MmS allocation when the number of agents is fixed and (2) an effective and efficient heuristic with an ex-post worst-case analysis.","lang":"eng"}],"ddc":["000"],"user_id":"61579","author":[{"first_name":"Haris","full_name":"Aziz, Haris","last_name":"Aziz"},{"last_name":"Rauchecker","first_name":"Gerhard","full_name":"Rauchecker, Gerhard"},{"first_name":"Guido","full_name":"Schryen, Guido","last_name":"Schryen","id":"72850"},{"last_name":"Walsh","full_name":"Walsh, Toby","first_name":"Toby"}],"publication":"Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)","file_date_updated":"2021-08-13T13:55:29Z","file":[{"file_name":"aziz_rauchecker_schryen_walsh.pdf","date_created":"2018-12-07T11:30:25Z","access_level":"closed","creator":"hsiemes","file_id":"6024","file_size":732005,"relation":"main_file","content_type":"application/pdf","date_updated":"2021-08-13T13:55:29Z"},{"relation":"main_file","content_type":"application/pdf","date_updated":"2021-08-13T13:55:14Z","creator":"hsiemes","file_id":"23394","file_size":738751,"access_level":"open_access","file_name":"10582-Article Text-14110-1-2-20201228.pdf","date_created":"2021-08-13T13:55:14Z"}],"volume":31,"has_accepted_license":"1","status":"public","date_created":"2018-11-14T15:49:54Z","intvolume":" 31","_id":"5692","conference":{"name":"Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)","location":"San Francisco, CA, USA"},"issue":"1","citation":{"bibtex":"@inproceedings{Aziz_Rauchecker_Schryen_Walsh_2017, title={Algorithms for Max-Min Share Fair Allocation of Indivisible Chores}, volume={31}, number={1}, booktitle={Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)}, author={Aziz, Haris and Rauchecker, Gerhard and Schryen, Guido and Walsh, Toby}, year={2017}, pages={1–7} }","mla":"Aziz, Haris, et al. “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.” Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), vol. 31, no. 1, 2017, pp. 1–7.","ama":"Aziz H, Rauchecker G, Schryen G, Walsh T. Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In: Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17). Vol 31. ; 2017:1-7.","apa":"Aziz, H., Rauchecker, G., Schryen, G., & Walsh, T. (2017). Algorithms for Max-Min Share Fair Allocation of Indivisible Chores. In Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17) (Vol. 31, pp. 1–7). San Francisco, CA, USA.","chicago":"Aziz, Haris, Gerhard Rauchecker, Guido Schryen, and Toby Walsh. “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.” In Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), 31:1–7, 2017.","ieee":"H. Aziz, G. Rauchecker, G. Schryen, and T. Walsh, “Algorithms for Max-Min Share Fair Allocation of Indivisible Chores,” in Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), San Francisco, CA, USA, 2017, vol. 31, no. 1, pp. 1–7.","short":"H. Aziz, G. Rauchecker, G. Schryen, T. Walsh, in: Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), 2017, pp. 1–7."},"type":"conference","year":"2017","page":"1-7"}]