--- _id: '9850' abstract: - lang: eng text: A business model describes the mechanisms whereby a firm creates, delivers, and captures value. Following the steadily growing interest in business model innovation, software tools have shown great potential in supporting business model development and innovation. Yet, understanding the cognitive processes involved in the generation of business model ideas is an aspect of software design-knowledge that has so far been neglected. To investigate whether providing stimuli – in this case, brainstorming questions – can enhance individual creativity in this context, we conduct an exploratory experiment with over 100 participants. Our study is the first to systematically investigate the process of idea generation using a software-based business model development tool with stimuli. Our preliminary findings have the potential to support the future development of business model development tools and to refine the research design used to evaluate such tools. accept: '1' author: - first_name: Daniel full_name: Szopinski, Daniel id: '36372' last_name: Szopinski citation: ama: 'Szopinski D. Can stimuli improve business model idea generation? Developing software-based tools for business model innovation. In: Proceedings of the ACM Creativity & Cognition. ; 2019.' apa: Szopinski, D. (2019). Can stimuli improve business model idea generation? Developing software-based tools for business model innovation. In Proceedings of the ACM Creativity & Cognition. San Diego, USA. bibtex: '@inproceedings{Szopinski_2019, title={Can stimuli improve business model idea generation? Developing software-based tools for business model innovation}, booktitle={Proceedings of the ACM Creativity & Cognition}, author={Szopinski, Daniel}, year={2019} }' chicago: Szopinski, Daniel. “Can Stimuli Improve Business Model Idea Generation? Developing Software-Based Tools for Business Model Innovation.” In Proceedings of the ACM Creativity & Cognition, 2019. ieee: D. Szopinski, “Can stimuli improve business model idea generation? Developing software-based tools for business model innovation,” in Proceedings of the ACM Creativity & Cognition, San Diego, USA, 2019. mla: Szopinski, Daniel. “Can Stimuli Improve Business Model Idea Generation? Developing Software-Based Tools for Business Model Innovation.” Proceedings of the ACM Creativity & Cognition, 2019. short: 'D. Szopinski, in: Proceedings of the ACM Creativity & Cognition, 2019.' conference: location: San Diego, USA name: ACM Creativity & Cognition 2019 date_created: 2019-05-20T09:59:01Z date_updated: 2019-10-17T06:58:46Z ddc: - '330' department: - _id: '276' file: - access_level: closed content_type: application/pdf creator: dsz date_created: 2019-10-17T06:58:40Z date_updated: 2019-10-17T06:58:40Z file_id: '13899' file_name: p547-szopinski(1).pdf file_size: 1005738 relation: main_file success: 1 file_date_updated: 2019-10-17T06:58:40Z keyword: - Business model innovation - idea generation - cognitive stimuli - business model development tools - experiment - creativity support system language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 publication: Proceedings of the ACM Creativity & Cognition status: public title: Can stimuli improve business model idea generation? Developing software-based tools for business model innovation type: conference user_id: '36372' year: '2019' ... --- _id: '9853' abstract: - lang: eng text: Business model innovation is typically taught in small seminars at universities. Teaching this intrinsically task-oriented subject to a large number of students is a challenge. In this paper we address this challenge by proposing an experiential and interactive approach to teaching business models in a large classroom setting. accept: '1' author: - first_name: Daniel full_name: Szopinski, Daniel id: '36372' last_name: Szopinski citation: ama: 'Szopinski D. Squaring the circle: Business model teaching in large classroom settings. Journal of Business Models. 2019;7(3):90-100.' apa: 'Szopinski, D. (2019). Squaring the circle: Business model teaching in large classroom settings. Journal of Business Models, 7(3), 90–100.' bibtex: '@article{Szopinski_2019, title={Squaring the circle: Business model teaching in large classroom settings}, volume={7}, number={3}, journal={Journal of Business Models}, author={Szopinski, Daniel}, year={2019}, pages={90–100} }' chicago: 'Szopinski, Daniel. “Squaring the Circle: Business Model Teaching in Large Classroom Settings.” Journal of Business Models 7, no. 3 (2019): 90–100.' ieee: 'D. Szopinski, “Squaring the circle: Business model teaching in large classroom settings,” Journal of Business Models, vol. 7, no. 3, pp. 90–100, 2019.' mla: 'Szopinski, Daniel. “Squaring the Circle: Business Model Teaching in Large Classroom Settings.” Journal of Business Models, vol. 7, no. 3, 2019, pp. 90–100.' short: D. Szopinski, Journal of Business Models 7 (2019) 90–100. date_created: 2019-05-20T10:17:54Z date_updated: 2019-10-28T10:29:25Z ddc: - '000' department: - _id: '276' file: - access_level: closed content_type: application/pdf creator: dsz date_created: 2019-10-17T06:51:18Z date_updated: 2019-10-17T06:51:18Z file_id: '13898' file_name: JoBM_SE_Teaching_2018_Squaring the circle_RevisedManuscript.pdf file_size: 1068694 relation: main_file success: 1 file_date_updated: 2019-10-17T06:51:18Z intvolume: ' 7' issue: '3' keyword: - Business model teaching - peer assessment - experiential learning language: - iso: eng page: 90-100 project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 publication: Journal of Business Models publication_status: epub_ahead status: public title: 'Squaring the circle: Business model teaching in large classroom settings' type: journal_article user_id: '16205' volume: 7 year: '2019' ... --- _id: '9897' article_number: '193104' author: - first_name: Maximilian full_name: Protte, Maximilian last_name: Protte - first_name: Nils full_name: Weber, Nils last_name: Weber - first_name: Christian full_name: Golla, Christian last_name: Golla - first_name: Thomas full_name: Zentgraf, Thomas id: '30525' last_name: Zentgraf orcid: 0000-0002-8662-1101 - first_name: Cedrik full_name: Meier, Cedrik id: '20798' last_name: Meier orcid: https://orcid.org/0000-0002-3787-3572 citation: ama: Protte M, Weber N, Golla C, Zentgraf T, Meier C. Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas. Journal of Applied Physics. 2019;125. doi:10.1063/1.5093257 apa: Protte, M., Weber, N., Golla, C., Zentgraf, T., & Meier, C. (2019). Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas. Journal of Applied Physics, 125. https://doi.org/10.1063/1.5093257 bibtex: '@article{Protte_Weber_Golla_Zentgraf_Meier_2019, title={Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas}, volume={125}, DOI={10.1063/1.5093257}, number={193104}, journal={Journal of Applied Physics}, author={Protte, Maximilian and Weber, Nils and Golla, Christian and Zentgraf, Thomas and Meier, Cedrik}, year={2019} }' chicago: Protte, Maximilian, Nils Weber, Christian Golla, Thomas Zentgraf, and Cedrik Meier. “Strong Nonlinear Optical Response from ZnO by Coupled and Lattice-Matched Nanoantennas.” Journal of Applied Physics 125 (2019). https://doi.org/10.1063/1.5093257. ieee: M. Protte, N. Weber, C. Golla, T. Zentgraf, and C. Meier, “Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas,” Journal of Applied Physics, vol. 125, 2019. mla: Protte, Maximilian, et al. “Strong Nonlinear Optical Response from ZnO by Coupled and Lattice-Matched Nanoantennas.” Journal of Applied Physics, vol. 125, 193104, 2019, doi:10.1063/1.5093257. short: M. Protte, N. Weber, C. Golla, T. Zentgraf, C. Meier, Journal of Applied Physics 125 (2019). date_created: 2019-05-21T08:35:49Z date_updated: 2020-08-21T13:52:51Z department: - _id: '15' - _id: '287' - _id: '35' - _id: '230' - _id: '289' doi: 10.1063/1.5093257 intvolume: ' 125' language: - iso: eng project: - _id: '53' name: TRR 142 - _id: '55' name: TRR 142 - Project Area B - _id: '66' name: TRR 142 - Subproject B1 - _id: '56' name: TRR 142 - Project Area C - _id: '75' name: TRR 142 - Subproject C5 publication: Journal of Applied Physics publication_identifier: issn: - 0021-8979 - 1089-7550 publication_status: published status: public title: Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas type: journal_article user_id: '30525' volume: 125 year: '2019' ... --- _id: '9920' author: - first_name: Marlon full_name: Fritz, Marlon last_name: Fritz - first_name: Thomas full_name: Gries, Thomas id: '186' last_name: Gries - first_name: Yuanhua full_name: Feng, Yuanhua last_name: Feng citation: ama: Fritz M, Gries T, Feng Y. Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth? Economics Letters. 2019;181:47-50. doi:10.1016/j.econlet.2019.04.021 apa: Fritz, M., Gries, T., & Feng, Y. (2019). Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth? Economics Letters, 181, 47–50. https://doi.org/10.1016/j.econlet.2019.04.021 bibtex: '@article{Fritz_Gries_Feng_2019, title={Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth?}, volume={181}, DOI={10.1016/j.econlet.2019.04.021}, journal={Economics Letters}, author={Fritz, Marlon and Gries, Thomas and Feng, Yuanhua}, year={2019}, pages={47–50} }' chicago: 'Fritz, Marlon, Thomas Gries, and Yuanhua Feng. “Secular Stagnation? Is There Statistical Evidence of an Unprecedented, Systematic Decline in Growth?” Economics Letters 181 (2019): 47–50. https://doi.org/10.1016/j.econlet.2019.04.021.' ieee: M. Fritz, T. Gries, and Y. Feng, “Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth?,” Economics Letters, vol. 181, pp. 47–50, 2019. mla: Fritz, Marlon, et al. “Secular Stagnation? Is There Statistical Evidence of an Unprecedented, Systematic Decline in Growth?” Economics Letters, vol. 181, 2019, pp. 47–50, doi:10.1016/j.econlet.2019.04.021. short: M. Fritz, T. Gries, Y. Feng, Economics Letters 181 (2019) 47–50. date_created: 2019-05-23T07:55:48Z date_updated: 2019-05-31T08:18:38Z department: - _id: '19' - _id: '200' - _id: '475' - _id: '202' doi: 10.1016/j.econlet.2019.04.021 intvolume: ' 181' language: - iso: eng page: 47-50 publication: Economics Letters publication_identifier: issn: - 0165-1765 publication_status: published status: public title: Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth? type: journal_article user_id: '186' volume: 181 year: '2019' ... --- _id: '9939' author: - first_name: Enes full_name: Yigitbas, Enes id: '8447' last_name: Yigitbas orcid: 0000-0002-5967-833X - first_name: Ivan full_name: Jovanovikj, Ivan id: '39187' last_name: Jovanovikj orcid: https://orcid.org/0000-0002-1838-794X - first_name: Klementina full_name: Josifovska, Klementina id: '46265' last_name: Josifovska - first_name: Stefan full_name: Sauer, Stefan id: '447' last_name: Sauer - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Yigitbas E, Jovanovikj I, Josifovska K, Sauer S, Engels G. On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback . In: Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019). Springer, LNCS; 2019:563-567.' apa: Yigitbas, E., Jovanovikj, I., Josifovska, K., Sauer, S., & Engels, G. (2019). On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback . In Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019) (pp. 563–567). Springer, LNCS. bibtex: '@inproceedings{Yigitbas_Jovanovikj_Josifovska_Sauer_Engels_2019, title={On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback }, booktitle={Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019)}, publisher={Springer, LNCS}, author={Yigitbas, Enes and Jovanovikj, Ivan and Josifovska, Klementina and Sauer, Stefan and Engels, Gregor}, year={2019}, pages={563–567} }' chicago: Yigitbas, Enes, Ivan Jovanovikj, Klementina Josifovska, Stefan Sauer, and Gregor Engels. “On-the-Fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback .” In Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019), 563–67. Springer, LNCS, 2019. ieee: E. Yigitbas, I. Jovanovikj, K. Josifovska, S. Sauer, and G. Engels, “On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback ,” in Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019), 2019, pp. 563–567. mla: Yigitbas, Enes, et al. “On-the-Fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback .” Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019), Springer, LNCS, 2019, pp. 563–67. short: 'E. Yigitbas, I. Jovanovikj, K. Josifovska, S. Sauer, G. Engels, in: Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019), Springer, LNCS, 2019, pp. 563–567.' date_created: 2019-05-24T13:00:14Z date_updated: 2020-05-07T05:33:50Z department: - _id: '66' - _id: '534' language: - iso: eng page: 563-567 publication: Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019) publisher: Springer, LNCS status: public title: 'On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback ' type: conference user_id: '8447' year: '2019' ... --- _id: '3936' author: - first_name: Dominik full_name: Gutt, Dominik id: '14368' last_name: Gutt - first_name: Philipp full_name: Herrmann, Philipp last_name: Herrmann - first_name: Mohammad full_name: Rahman, Mohammad last_name: Rahman citation: ama: 'Gutt D, Herrmann P, Rahman M. Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions. Information Systems Research. 2019;30(3):980-994.' apa: 'Gutt, D., Herrmann, P., & Rahman, M. (2019). Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions. Information Systems Research, 30(3), 980–994.' bibtex: '@article{Gutt_Herrmann_Rahman_2019, title={Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions}, volume={30}, number={3}, journal={Information Systems Research}, author={Gutt, Dominik and Herrmann, Philipp and Rahman, Mohammad}, year={2019}, pages={980–994} }' chicago: 'Gutt, Dominik, Philipp Herrmann, and Mohammad Rahman. “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions.” Information Systems Research 30, no. 3 (2019): 980–94.' ieee: 'D. Gutt, P. Herrmann, and M. Rahman, “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions,” Information Systems Research, vol. 30, no. 3, pp. 980–994, 2019.' mla: 'Gutt, Dominik, et al. “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions.” Information Systems Research, vol. 30, no. 3, 2019, pp. 980–94.' short: D. Gutt, P. Herrmann, M. Rahman, Information Systems Research 30 (2019) 980–994. date_created: 2018-08-20T09:45:31Z date_updated: 2022-01-06T06:59:57Z ddc: - '330' department: - _id: '276' file: - access_level: closed content_type: application/pdf creator: d0mi date_created: 2018-11-12T09:55:20Z date_updated: 2018-11-12T09:55:20Z file_id: '5473' file_name: Crowd-Driven_Competitive_Intelligence_accept.pdf file_size: 640218 relation: main_file success: 1 file_date_updated: 2018-11-12T09:55:20Z has_accepted_license: '1' intvolume: ' 30' issue: '3' language: - iso: eng page: 980-994 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Information Systems Research publication_status: epub_ahead status: public title: 'Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions' type: journal_article user_id: '16205' volume: 30 year: '2019' ... --- _id: '4400' author: - first_name: Thomas full_name: Görzen, Thomas id: '47700' last_name: Görzen citation: ama: 'Görzen T. Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms. In: Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS). ; 2019.' apa: Görzen, T. (2019). Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms. In Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS). Maui, Hawaii, USA. bibtex: '@inproceedings{Görzen_2019, title={Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms}, booktitle={Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS)}, author={Görzen, Thomas}, year={2019} }' chicago: Görzen, Thomas. “Can Experience Be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms.” In Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS), 2019. ieee: T. Görzen, “Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms,” in Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS), Maui, Hawaii, USA, 2019. mla: Görzen, Thomas. “Can Experience Be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms.” Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS), 2019. short: 'T. Görzen, in: Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS), 2019.' conference: location: Maui, Hawaii, USA name: 52nd Hawaii International Conference on System Sciences (HICSS) date_created: 2018-09-14T12:24:57Z date_updated: 2022-01-06T07:01:01Z department: - _id: '276' language: - iso: eng publication: Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS) status: public title: Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms type: conference user_id: '16205' year: '2019' ... --- _id: '5411' abstract: - lang: ger text: 'Öffentlich gelistete Firmen, die die Mehrheit an anderen börsennotierten Unternehmen er-werben und den Kapitalmarkt an den Synergieerwartungen teilhaben lassen, werden mit höheren kumulativen abnormalen Renditen im Ankündigungszeitpunkt belohnt verglichen mit solchen Unternehmen, die diese geheim halten. Des Weiteren ist die empirische Evi-denz konsistent mit der Idee, dass diese Käuferunternehmen ihre Transaktionen besser in-tegrieren, weil auch die industrieadjustierten Ein- und Zweijahresrenditen der ankündigen-den Unternehmen ökonomisch und statistisch signifikant höher sind als die der zurückhal-tenden Käuferfirmen. ' author: - first_name: Oliver full_name: Mehring, Oliver id: '36373' last_name: Mehring - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Georg full_name: Keienburg, Georg last_name: Keienburg - first_name: Jens full_name: Kengelbach, Jens last_name: Kengelbach citation: ama: Mehring O, Sievers S, Keienburg G, Kengelbach J. Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien? Vol 3-4. Corporate Finance; 2019:76-84. apa: Mehring, O., Sievers, S., Keienburg, G., & Kengelbach, J. (2019). Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien? (Vol. 3–4, pp. 76–84). Corporate Finance. bibtex: '@book{Mehring_Sievers_Keienburg_Kengelbach_2019, title={Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien?}, volume={3–4}, publisher={Corporate Finance}, author={Mehring, Oliver and Sievers, Sönke and Keienburg, Georg and Kengelbach, Jens}, year={2019}, pages={76–84} }' chicago: Mehring, Oliver, Sönke Sievers, Georg Keienburg, and Jens Kengelbach. Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien? Vol. 3–4. Corporate Finance, 2019. ieee: O. Mehring, S. Sievers, G. Keienburg, and J. Kengelbach, Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien?, vol. 3–4. Corporate Finance, 2019, pp. 76–84. mla: Mehring, Oliver, et al. Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien? Vol. 3–4, Corporate Finance, 2019, pp. 76–84. short: O. Mehring, S. Sievers, G. Keienburg, J. Kengelbach, Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien?, Corporate Finance, 2019. date_created: 2018-11-07T12:06:20Z date_updated: 2022-01-06T07:01:52Z department: - _id: '275' language: - iso: ger main_file_link: - url: https://research.owlit.de/document/22b8e6a6-5e6c-3760-8595-2f639bd001d8 page: 76-84 publication_status: published publisher: Corporate Finance status: public title: Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien? type: working_paper user_id: '46447' volume: 3-4 year: '2019' ... --- _id: '5471' abstract: - lang: eng text: "We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. \r\nFurthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting." author: - first_name: Philip full_name: Lazos, Philip last_name: Lazos - first_name: Paul full_name: Goldberg, Paul last_name: Goldberg - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik - first_name: Matthias full_name: Gerstgrasser, Matthias last_name: Gerstgrasser - first_name: Bart full_name: de Keijzer, Bart last_name: de Keijzer citation: ama: 'Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B. Multi-unit Bilateral Trade. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). ; 2019. doi:10.1609/aaai.v33i01.33011973' apa: Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., & de Keijzer, B. (2019). Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. https://doi.org/10.1609/aaai.v33i01.33011973 bibtex: '@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={ Multi-unit Bilateral Trade}, DOI={10.1609/aaai.v33i01.33011973}, booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }' chicago: Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019. https://doi.org/10.1609/aaai.v33i01.33011973. ieee: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “ Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: 10.1609/aaai.v33i01.33011973.' mla: Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973. short: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.' conference: end_date: 2019-02-01 location: Honolulu, Hawaii, USA name: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI) start_date: 2019-01-27 date_created: 2018-11-12T09:38:16Z date_updated: 2022-01-06T07:01:55Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.1609/aaai.v33i01.33011973 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-12-06T13:57:51Z date_updated: 2018-12-06T13:57:51Z file_id: '6018' file_name: 1811.05130.pdf file_size: 315877 relation: main_file success: 1 file_date_updated: 2018-12-06T13:57:51Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI) publication_status: published status: public title: ' Multi-unit Bilateral Trade' type: conference user_id: '15415' year: '2019' ... --- _id: '6512' 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. author: - first_name: Gerhard full_name: Rauchecker, Gerhard last_name: Rauchecker - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen citation: 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.' 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} }' 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.' 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.' 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.' short: G. Rauchecker, G. Schryen, Computers & Operations Research (2019) 338–357. date_created: 2019-01-08T13:50:44Z date_updated: 2022-01-06T07:03:08Z ddc: - '000' department: - _id: '277' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2019-01-08T14:03:53Z date_updated: 2019-01-08T14:03:53Z file_id: '6513' file_name: cor-parallel-bp-for-upmsp.pdf file_size: 4153528 relation: main_file file_date_updated: 2019-01-08T14:03:53Z has_accepted_license: '1' issue: '104' keyword: - parallel machine scheduling with setup times - parallel branch-and-price algorithm - high performance computing - master/worker parallelization language: - iso: eng oa: '1' page: 338-357 publication: Computers & Operations Research publisher: Elsevier status: public 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' type: journal_article user_id: '61579' year: '2019' ... --- _id: '6514' abstract: - lang: eng 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. author: - first_name: Veronika full_name: Schuhbeck, Veronika last_name: Schuhbeck - first_name: Nils full_name: Siegfried, Nils last_name: Siegfried - first_name: Verena full_name: Dorner, Verena last_name: Dorner - first_name: Alexander full_name: Benlian, Alexander last_name: Benlian - first_name: Michael full_name: Scholz, Michael last_name: Scholz - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen citation: 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.' 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.' 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} }' 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.' 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.' 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.' 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.' conference: end_date: 2019-02-27 location: Siegen, Germany name: 14th International Conference on Wirtschaftsinformatik start_date: 2019-02-24 date_created: 2019-01-08T14:06:32Z date_updated: 2022-01-06T07:03:09Z ddc: - '000' department: - _id: '277' file: - access_level: closed content_type: application/pdf creator: hsiemes date_created: 2019-01-08T14:07:17Z date_updated: 2021-08-13T13:26:11Z file_id: '6515' file_name: WALKING THE MIDDLE PATH.pdf file_size: 371490 relation: main_file - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2021-08-13T13:25:53Z date_updated: 2021-08-13T13:25:53Z file_id: '23393' file_name: Walking the Middle Path_ How Medium Trade-Off Exposure Leads to H.pdf file_size: 331001 relation: main_file file_date_updated: 2021-08-13T13:26:11Z has_accepted_license: '1' keyword: - Recommender Agents - Preference Elicitation Method - Trade-off Exposure - Customer Satisfaction language: - iso: eng oa: '1' page: 55-64 place: Siegen, Germany publication: Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik status: public title: 'Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents' type: conference user_id: '61579' year: '2019' ... --- _id: '6628' author: - first_name: Janina full_name: Seutter, Janina last_name: Seutter citation: ama: 'Seutter J. Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung. Universität Paderborn; 2019.' apa: 'Seutter, J. (2019). Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung. Universität Paderborn.' bibtex: '@book{Seutter_2019, place={Universität Paderborn}, title={Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung}, author={Seutter, Janina}, year={2019} }' chicago: 'Seutter, Janina. Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung. Universität Paderborn, 2019.' ieee: 'J. Seutter, Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung. Universität Paderborn, 2019.' mla: 'Seutter, Janina. Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung. 2019.' short: 'J. Seutter, Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung, Universität Paderborn, 2019.' date_created: 2019-01-11T13:10:16Z date_updated: 2022-01-06T07:03:13Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: 'Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung' type: mastersthesis user_id: '477' year: '2019' ... --- _id: '6734' author: - first_name: Thomas full_name: Gries, Thomas id: '186' last_name: Gries - first_name: Marlon full_name: Fritz, Marlon last_name: Fritz - first_name: Feng full_name: Yuanhua, Feng last_name: Yuanhua citation: ama: Gries T, Fritz M, Yuanhua F. Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics. Oxford Bulletin of Economics and Statistics. 2019;81(1):62-78. doi:10.1111/obes.12267 apa: Gries, T., Fritz, M., & Yuanhua, F. (2019). Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics. Oxford Bulletin of Economics and Statistics, 81(1), 62–78. https://doi.org/10.1111/obes.12267 bibtex: '@article{Gries_Fritz_Yuanhua_2019, title={Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics}, volume={81}, DOI={10.1111/obes.12267}, number={1}, journal={Oxford Bulletin of Economics and Statistics}, author={Gries, Thomas and Fritz, Marlon and Yuanhua, Feng}, year={2019}, pages={62–78} }' chicago: 'Gries, Thomas, Marlon Fritz, and Feng Yuanhua. “Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics.” Oxford Bulletin of Economics and Statistics 81, no. 1 (2019): 62–78. https://doi.org/10.1111/obes.12267.' ieee: T. Gries, M. Fritz, and F. Yuanhua, “Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics,” Oxford Bulletin of Economics and Statistics, vol. 81, no. 1, pp. 62–78, 2019. mla: Gries, Thomas, et al. “Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics.” Oxford Bulletin of Economics and Statistics, vol. 81, no. 1, 2019, pp. 62–78, doi:10.1111/obes.12267. short: T. Gries, M. Fritz, F. Yuanhua, Oxford Bulletin of Economics and Statistics 81 (2019) 62–78. date_created: 2019-01-15T11:16:38Z date_updated: 2022-01-06T07:03:17Z department: - _id: '19' - _id: '200' - _id: '475' - _id: '202' doi: 10.1111/obes.12267 intvolume: ' 81' issue: '1' language: - iso: eng page: 62-78 publication: Oxford Bulletin of Economics and Statistics status: public title: Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics type: journal_article user_id: '186' volume: 81 year: '2019' ... --- _id: '6856' author: - first_name: Michelle full_name: Müller, Michelle last_name: Müller - first_name: Dominik full_name: Gutt, Dominik id: '14368' last_name: Gutt citation: ama: 'Müller M, Gutt D. Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods. In: Wirtschaftsinformatik Proceedings 2019. ; 2019.' apa: Müller, M., & Gutt, D. (2019). Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods. In Wirtschaftsinformatik Proceedings 2019. Siegen, Germany. bibtex: '@inproceedings{Müller_Gutt_2019, title={Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods}, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Müller, Michelle and Gutt, Dominik}, year={2019} }' chicago: Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods.” In Wirtschaftsinformatik Proceedings 2019, 2019. ieee: M. Müller and D. Gutt, “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods,” in Wirtschaftsinformatik Proceedings 2019, Siegen, Germany, 2019. mla: Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods.” Wirtschaftsinformatik Proceedings 2019, 2019. short: 'M. Müller, D. Gutt, in: Wirtschaftsinformatik Proceedings 2019, 2019.' conference: location: Siegen, Germany name: Wirtschaftsinformatik date_created: 2019-01-17T14:39:49Z date_updated: 2022-01-06T07:03:22Z department: - _id: '276' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Wirtschaftsinformatik Proceedings 2019 status: public title: Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods type: conference user_id: '16205' year: '2019' ... --- _id: '6857' author: - first_name: Martin full_name: Poniatowski, Martin id: '32441' last_name: Poniatowski - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann - first_name: Thomas full_name: Görzen, Thomas id: '47700' last_name: Görzen - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: 'Poniatowski M, Neumann J, Görzen T, Kundisch D. A Semi-Automated Approach for Generating Online Review Templates, . In: Wirtschaftsinformatik Proceedings 2019. ; 2019.' apa: Poniatowski, M., Neumann, J., Görzen, T., & Kundisch, D. (2019). A Semi-Automated Approach for Generating Online Review Templates, . In Wirtschaftsinformatik Proceedings 2019. Siegen, Germany. bibtex: '@inproceedings{Poniatowski_Neumann_Görzen_Kundisch_2019, title={A Semi-Automated Approach for Generating Online Review Templates, }, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Poniatowski, Martin and Neumann, Jürgen and Görzen, Thomas and Kundisch, Dennis}, year={2019} }' chicago: Poniatowski, Martin, Jürgen Neumann, Thomas Görzen, and Dennis Kundisch. “A Semi-Automated Approach for Generating Online Review Templates, .” In Wirtschaftsinformatik Proceedings 2019, 2019. ieee: M. Poniatowski, J. Neumann, T. Görzen, and D. Kundisch, “A Semi-Automated Approach for Generating Online Review Templates, ,” in Wirtschaftsinformatik Proceedings 2019, Siegen, Germany, 2019. mla: Poniatowski, Martin, et al. “A Semi-Automated Approach for Generating Online Review Templates, .” Wirtschaftsinformatik Proceedings 2019, 2019. short: 'M. Poniatowski, J. Neumann, T. Görzen, D. Kundisch, in: Wirtschaftsinformatik Proceedings 2019, 2019.' conference: location: Siegen, Germany name: Wirtschaftsinformatik date_created: 2019-01-17T14:46:50Z date_updated: 2022-01-06T07:03:22Z department: - _id: '276' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Wirtschaftsinformatik Proceedings 2019 status: public title: 'A Semi-Automated Approach for Generating Online Review Templates, ' type: conference user_id: '477' year: '2019' ... --- _id: '6860' author: - first_name: Haitham full_name: Afifi, Haitham id: '65718' last_name: Afifi - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Afifi H, Karl H. Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding. In: 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019). Las Vegas: IEEE.' apa: 'Afifi, H., & Karl, H. (n.d.). Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding. In 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019). Las Vegas: IEEE.' bibtex: '@inproceedings{Afifi_Karl, place={Las Vegas}, title={Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding}, booktitle={2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019)}, publisher={IEEE}, author={Afifi, Haitham and Karl, Holger} }' chicago: 'Afifi, Haitham, and Holger Karl. “Power Allocation with a Wireless Multi-Cast Aware Routing for Virtual Network Embedding.” In 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019). Las Vegas: IEEE, n.d.' ieee: H. Afifi and H. Karl, “Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding,” in 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019). mla: Afifi, Haitham, and Holger Karl. “Power Allocation with a Wireless Multi-Cast Aware Routing for Virtual Network Embedding.” 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019), IEEE. short: 'H. Afifi, H. Karl, in: 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019), IEEE, Las Vegas, n.d.' date_created: 2019-01-17T15:51:34Z date_updated: 2022-01-06T07:03:22Z ddc: - '000' department: - _id: '75' file: - access_level: open_access content_type: application/pdf creator: hafifi date_created: 2019-01-17T15:49:37Z date_updated: 2019-01-17T15:49:37Z file_id: '6861' file_name: globecom.pdf file_size: 320283 relation: main_file file_date_updated: 2019-01-17T15:49:37Z has_accepted_license: '1' language: - iso: eng oa: '1' place: Las Vegas project: - _id: '27' name: 'Akustische Sensornetzwerke - Teilprojekt ' - _id: '27' name: Akustische Sensornetzwerke - Teilprojekt "Verteilte akustische Signalverarbeitung über funkbasierte Sensornetzwerke publication: 2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019) publication_status: accepted publisher: IEEE status: public title: Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding type: conference user_id: '65718' year: '2019' ... --- _id: '6976' abstract: - lang: eng text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes joining and leaving the network. We assume an adversary that may churn a\r\nconstant fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds. In particular, the adversary has an almost up-to-date information of\r\nthe network topology as it can observe an only slightly outdated topology that\r\nis at least $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction that new nodes can only join the network via nodes that have taken\r\npart in the network for at least one round.\r\n Our contributions are as follows: First, we show that it is impossible to\r\nmaintain a connected topology if adversary has up-to-date information about the\r\nnodes' connections. Further, we show that our restriction concerning the join\r\nis also necessary. As our main result present an algorithm that constructs a\r\nnew overlay- completely independent of all previous overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which will be maintained by the\r\nalgorithm. However, our approaches can be transferred to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval." author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Vipin Ravindran full_name: Vijayalakshmi, Vipin Ravindran last_name: Vijayalakshmi - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). IEEE.' apa: 'Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil: IEEE.' bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE}, author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian} }' chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). IEEE, n.d. ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil. mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE. short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d.' conference: end_date: 24.05.19 location: Rio de Janeiro, Brazil name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) start_date: 20.05.19 date_created: 2019-01-24T18:53:11Z date_updated: 2022-01-06T07:03:25Z ddc: - '000' department: - _id: '79' file: - access_level: closed content_type: application/pdf creator: thgoette date_created: 2019-01-26T16:09:08Z date_updated: 2019-01-26T16:09:08Z file_id: '7007' file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf file_size: 638020 relation: main_file success: 1 file_date_updated: 2019-01-26T16:09:08Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) publication_status: accepted publisher: IEEE status: public title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary type: conference user_id: '34727' year: '2019' ... --- _id: '16411' abstract: - lang: eng text: FPGA devices have been proving to be good candidates to accelerate applications from different research topics. For instance, machine learning applications such as K-Means clustering usually relies on large amount of data to be processed, and, despite the performance offered by other architectures, FPGAs can offer better energy efficiency. With that in mind, Intel has launched a platform that integrates a multicore and an FPGA in the same package, enabling low latency and coherent fine-grained data offload. In this paper, we present a parallel implementation of the K-Means clustering algorithm, for this novel platform, using OpenCL language, and compared it against other platforms. We found that the CPU+FPGA platform was more energy efficient than the CPU-only approach from 70.71% to 85.92%, with Standard and Tiny input sizes respectively, and up to 68.21% of performance improvement was obtained with Tiny input size. Furthermore, it was up to 7.2×more energy efficient than an Intel® Xeon Phi ™, 21.5×than a cluster of Raspberry Pi boards, and 3.8×than the low-power MPPA-256 architecture, when the Standard input size was used. author: - first_name: Matheus A. full_name: Souza, Matheus A. last_name: Souza - first_name: Lucas A. full_name: Maciel, Lucas A. last_name: Maciel - first_name: Pedro Henrique full_name: Penna, Pedro Henrique last_name: Penna - first_name: Henrique C. full_name: Freitas, Henrique C. last_name: Freitas citation: ama: 'Souza MA, Maciel LA, Penna PH, Freitas HC. Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package. In: 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). ; 2019. doi:10.1109/cahpc.2018.8645850' apa: Souza, M. A., Maciel, L. A., Penna, P. H., & Freitas, H. C. (2019). Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package. In 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). https://doi.org/10.1109/cahpc.2018.8645850 bibtex: '@inproceedings{Souza_Maciel_Penna_Freitas_2019, title={Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package}, DOI={10.1109/cahpc.2018.8645850}, booktitle={2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)}, author={Souza, Matheus A. and Maciel, Lucas A. and Penna, Pedro Henrique and Freitas, Henrique C.}, year={2019} }' chicago: Souza, Matheus A., Lucas A. Maciel, Pedro Henrique Penna, and Henrique C. Freitas. “Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package.” In 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2019. https://doi.org/10.1109/cahpc.2018.8645850. ieee: M. A. Souza, L. A. Maciel, P. H. Penna, and H. C. Freitas, “Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package,” in 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2019. mla: Souza, Matheus A., et al. “Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package.” 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2019, doi:10.1109/cahpc.2018.8645850. short: 'M.A. Souza, L.A. Maciel, P.H. Penna, H.C. Freitas, in: 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2019.' date_created: 2020-04-06T09:41:41Z date_updated: 2022-01-06T06:52:50Z doi: 10.1109/cahpc.2018.8645850 keyword: - pc2-harp-ressources language: - iso: eng publication: 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD) publication_identifier: isbn: - '9781538677698' publication_status: published status: public title: Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package type: conference user_id: '61189' year: '2019' ... --- _id: '16413' abstract: - lang: eng text: In recent years, FPGAs have been successfully employed for the implementation of efficient, application-specific accelerators for a wide range of machine learning tasks. In this work, we consider probabilistic models, namely, (Mixed) Sum-Product Networks (SPN), a deep architecture that can provide tractable inference for multivariate distributions over mixed data-sources. We develop a fully pipelined FPGA accelerator architecture, including a pipelined interface to external memory, for the inference in (mixed) SPNs. To meet the precision constraints of SPNs, all computations are conducted using double-precision floating point arithmetic. Starting from an input description, the custom FPGA-accelerator is synthesized fully automatically by our tool flow. To the best of our knowledge, this work is the first approach to offload the SPN inference problem to FPGA-based accelerators. Our evaluation shows that the SPN inference problem benefits from offloading to our pipelined FPGA accelerator architecture. author: - first_name: Lukas full_name: Sommer, Lukas last_name: Sommer - first_name: Julian full_name: Oppermann, Julian last_name: Oppermann - first_name: Alejandro full_name: Molina, Alejandro last_name: Molina - first_name: Carsten full_name: Binnig, Carsten last_name: Binnig - first_name: Kristian full_name: Kersting, Kristian last_name: Kersting - first_name: Andreas full_name: Koch, Andreas last_name: Koch citation: ama: 'Sommer L, Oppermann J, Molina A, Binnig C, Kersting K, Koch A. Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators. In: 2018 IEEE 36th International Conference on Computer Design (ICCD). ; 2019. doi:10.1109/iccd.2018.00060' apa: Sommer, L., Oppermann, J., Molina, A., Binnig, C., Kersting, K., & Koch, A. (2019). Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators. In 2018 IEEE 36th International Conference on Computer Design (ICCD). https://doi.org/10.1109/iccd.2018.00060 bibtex: '@inproceedings{Sommer_Oppermann_Molina_Binnig_Kersting_Koch_2019, title={Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators}, DOI={10.1109/iccd.2018.00060}, booktitle={2018 IEEE 36th International Conference on Computer Design (ICCD)}, author={Sommer, Lukas and Oppermann, Julian and Molina, Alejandro and Binnig, Carsten and Kersting, Kristian and Koch, Andreas}, year={2019} }' chicago: Sommer, Lukas, Julian Oppermann, Alejandro Molina, Carsten Binnig, Kristian Kersting, and Andreas Koch. “Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators.” In 2018 IEEE 36th International Conference on Computer Design (ICCD), 2019. https://doi.org/10.1109/iccd.2018.00060. ieee: L. Sommer, J. Oppermann, A. Molina, C. Binnig, K. Kersting, and A. Koch, “Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators,” in 2018 IEEE 36th International Conference on Computer Design (ICCD), 2019. mla: Sommer, Lukas, et al. “Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators.” 2018 IEEE 36th International Conference on Computer Design (ICCD), 2019, doi:10.1109/iccd.2018.00060. short: 'L. Sommer, J. Oppermann, A. Molina, C. Binnig, K. Kersting, A. Koch, in: 2018 IEEE 36th International Conference on Computer Design (ICCD), 2019.' date_created: 2020-04-06T10:33:58Z date_updated: 2022-01-06T06:52:50Z doi: 10.1109/iccd.2018.00060 keyword: - pc2-harp-ressources language: - iso: eng publication: 2018 IEEE 36th International Conference on Computer Design (ICCD) publication_identifier: isbn: - '9781538684771' publication_status: published status: public title: Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators type: conference user_id: '61189' year: '2019' ... --- _id: '16415' author: - first_name: Julian full_name: Lienen, Julian id: '44040' last_name: Lienen citation: ama: Lienen J. Automated Feature Engineering on Time Series Data.; 2019. apa: Lienen, J. (2019). Automated Feature Engineering on Time Series Data. bibtex: '@book{Lienen_2019, title={Automated Feature Engineering on Time Series Data}, author={Lienen, Julian}, year={2019} }' chicago: Lienen, Julian. Automated Feature Engineering on Time Series Data, 2019. ieee: J. Lienen, Automated Feature Engineering on Time Series Data. 2019. mla: Lienen, Julian. Automated Feature Engineering on Time Series Data. 2019. short: J. Lienen, Automated Feature Engineering on Time Series Data, 2019. date_created: 2020-04-06T11:44:17Z date_updated: 2022-01-06T06:52:50Z language: - iso: eng status: public title: Automated Feature Engineering on Time Series Data type: mastersthesis user_id: '44040' year: '2019' ...