[{"user_id":"76599","title":"Asymptotic confidence sets for the jump curve in bivariate regression problems","publication":"Journal of Multivariate Analysis","department":[{"_id":"34"},{"_id":"355"}],"author":[{"id":"76599","last_name":"Bengs","full_name":"Bengs, Viktor","first_name":"Viktor"},{"last_name":"Eulert","full_name":"Eulert, Matthias","first_name":"Matthias"},{"last_name":"Holzmann","first_name":"Hajo","full_name":"Holzmann, Hajo"}],"date_created":"2019-10-30T14:22:57Z","status":"public","publication_identifier":{"issn":["0047-259X"]},"publication_status":"published","date_updated":"2022-01-06T06:51:52Z","_id":"14027","doi":"10.1016/j.jmva.2019.02.017","language":[{"iso":"eng"}],"page":"291-312","citation":{"bibtex":"@article{Bengs_Eulert_Holzmann_2019, title={Asymptotic confidence sets for the jump curve in bivariate regression problems}, DOI={10.1016/j.jmva.2019.02.017}, journal={Journal of Multivariate Analysis}, author={Bengs, Viktor and Eulert, Matthias and Holzmann, Hajo}, year={2019}, pages={291–312} }","mla":"Bengs, Viktor, et al. “Asymptotic Confidence Sets for the Jump Curve in Bivariate Regression Problems.” Journal of Multivariate Analysis, 2019, pp. 291–312, doi:10.1016/j.jmva.2019.02.017.","ama":"Bengs V, Eulert M, Holzmann H. Asymptotic confidence sets for the jump curve in bivariate regression problems. Journal of Multivariate Analysis. 2019:291-312. doi:10.1016/j.jmva.2019.02.017","apa":"Bengs, V., Eulert, M., & Holzmann, H. (2019). Asymptotic confidence sets for the jump curve in bivariate regression problems. Journal of Multivariate Analysis, 291–312. https://doi.org/10.1016/j.jmva.2019.02.017","chicago":"Bengs, Viktor, Matthias Eulert, and Hajo Holzmann. “Asymptotic Confidence Sets for the Jump Curve in Bivariate Regression Problems.” Journal of Multivariate Analysis, 2019, 291–312. https://doi.org/10.1016/j.jmva.2019.02.017.","ieee":"V. Bengs, M. Eulert, and H. Holzmann, “Asymptotic confidence sets for the jump curve in bivariate regression problems,” Journal of Multivariate Analysis, pp. 291–312, 2019.","short":"V. Bengs, M. Eulert, H. Holzmann, Journal of Multivariate Analysis (2019) 291–312."},"year":"2019","type":"journal_article"},{"department":[{"_id":"34"},{"_id":"355"}],"publication":"Electronic Journal of Statistics","author":[{"id":"76599","last_name":"Bengs","full_name":"Bengs, Viktor","first_name":"Viktor"},{"last_name":"Holzmann","full_name":"Holzmann, Hajo","first_name":"Hajo"}],"publication_identifier":{"issn":["1935-7524"]},"publication_status":"published","date_created":"2019-10-30T14:25:16Z","status":"public","title":"Adaptive confidence sets for kink estimation","user_id":"76599","page":"1523-1579","citation":{"ieee":"V. Bengs and H. Holzmann, “Adaptive confidence sets for kink estimation,” Electronic Journal of Statistics, pp. 1523–1579, 2019.","short":"V. Bengs, H. Holzmann, Electronic Journal of Statistics (2019) 1523–1579.","bibtex":"@article{Bengs_Holzmann_2019, title={Adaptive confidence sets for kink estimation}, DOI={10.1214/19-ejs1555}, journal={Electronic Journal of Statistics}, author={Bengs, Viktor and Holzmann, Hajo}, year={2019}, pages={1523–1579} }","mla":"Bengs, Viktor, and Hajo Holzmann. “Adaptive Confidence Sets for Kink Estimation.” Electronic Journal of Statistics, 2019, pp. 1523–79, doi:10.1214/19-ejs1555.","chicago":"Bengs, Viktor, and Hajo Holzmann. “Adaptive Confidence Sets for Kink Estimation.” Electronic Journal of Statistics, 2019, 1523–79. https://doi.org/10.1214/19-ejs1555.","apa":"Bengs, V., & Holzmann, H. (2019). Adaptive confidence sets for kink estimation. Electronic Journal of Statistics, 1523–1579. https://doi.org/10.1214/19-ejs1555","ama":"Bengs V, Holzmann H. Adaptive confidence sets for kink estimation. Electronic Journal of Statistics. 2019:1523-1579. doi:10.1214/19-ejs1555"},"year":"2019","type":"journal_article","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:52Z","_id":"14028","doi":"10.1214/19-ejs1555"},{"applicant":["LocalOfferCompass UG (haftungsbeschränkt)"],"date_created":"2019-10-31T07:57:58Z","ipc":"H04L 29/02","status":"public","department":[{"_id":"66"}],"author":[{"last_name":"Göllner","full_name":"Göllner, Thomas","first_name":"Thomas"},{"last_name":"Schwarz","first_name":"Jan-Hendrik","full_name":"Schwarz, Jan-Hendrik"},{"id":"47208","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","first_name":"Sebastian"},{"first_name":"Stefan","full_name":"Sauer, Stefan","last_name":"Sauer","id":"447"}],"title":"Verteiltes Warenwirtschaftssystem [Distributed Warehouse System]","user_id":"47208","application_date":"2018-04-25","ipn":"DE 10 2018 206 390","abstract":[{"lang":"ger","text":" Beschrieben ist ein verteiltes Warenwirtschaftssystem, bei dem der Kunde, Händler, und der Hersteller vernetzt sind. Dies wird bewerkstelligt durch einen Cloud-Speicher (105), der Cloud-Speicher (105) aufweisend ein Mittel zum Speichern (105a) von Daten, ein Mittel zum Empfangen von ersten Daten von einem ersten Netzwerkteilnehmer (110), wobei die ersten Daten zugehörig sind zu einem physischen Objekt, ein Mittel zum Empfangen von Anfragedaten von einem zweiten Netzwerkteilnehmer (120), ein Mittel zum Empfangen von zweiten Daten von einem dritten Netzwerkteilnehmer (130), wobei die zweiten Daten zugehörig sind zu den ersten Daten und zumindest ein Datum aufweisen, welches angepasst ist, die ersten Daten zu ändern in Abhängigkeit der empfangenen Anfragedaten, ein Mittel zum Ändern der ersten Daten basierend zumindest im Teil auf den zweiten Daten und den Anfragedaten und ein Mittel zum Senden eines geänderten Teils der ersten Daten von dem Cloud-Speicher (105) an den ersten Netzwerkteilnehmer (110)."}],"page":"25","year":"2019","citation":{"mla":"Göllner, Thomas, et al. Verteiltes Warenwirtschaftssystem [Distributed Warehouse System]. 2019.","bibtex":"@article{Göllner_Schwarz_Gottschalk_Sauer_2019, title={Verteiltes Warenwirtschaftssystem [Distributed Warehouse System]}, author={Göllner, Thomas and Schwarz, Jan-Hendrik and Gottschalk, Sebastian and Sauer, Stefan}, year={2019} }","apa":"Göllner, T., Schwarz, J.-H., Gottschalk, S., & Sauer, S. (2019). Verteiltes Warenwirtschaftssystem [Distributed Warehouse System].","ama":"Göllner T, Schwarz J-H, Gottschalk S, Sauer S. Verteiltes Warenwirtschaftssystem [Distributed Warehouse System]. 2019.","chicago":"Göllner, Thomas, Jan-Hendrik Schwarz, Sebastian Gottschalk, and Stefan Sauer. “Verteiltes Warenwirtschaftssystem [Distributed Warehouse System],” 2019.","ieee":"T. Göllner, J.-H. Schwarz, S. Gottschalk, and S. Sauer, “Verteiltes Warenwirtschaftssystem [Distributed Warehouse System].” 2019.","short":"T. Göllner, J.-H. Schwarz, S. Gottschalk, S. Sauer, (2019)."},"type":"patent","main_file_link":[{"url":"https://register.dpma.de/DPMAregister/pat/register?AKZ=1020182063907"}],"application_number":"10 2018 206 390.7","publication_date":"2019-10-31","date_updated":"2022-01-06T06:51:52Z","_id":"14032"},{"_id":"14033","intvolume":" 100","date_updated":"2022-01-06T06:51:52Z","doi":"10.1103/physrevb.100.140201","page":"140201","citation":{"ieee":"A. Klümper, W. Nuding, and A. Sedrakyan, “Random network models with variable disorder of geometry,” Physical Review B, vol. 100, p. 140201, 2019.","short":"A. Klümper, W. Nuding, A. Sedrakyan, Physical Review B 100 (2019) 140201.","mla":"Klümper, A., et al. “Random Network Models with Variable Disorder of Geometry.” Physical Review B, vol. 100, 2019, p. 140201, doi:10.1103/physrevb.100.140201.","bibtex":"@article{Klümper_Nuding_Sedrakyan_2019, title={Random network models with variable disorder of geometry}, volume={100}, DOI={10.1103/physrevb.100.140201}, journal={Physical Review B}, author={Klümper, A. and Nuding, W. and Sedrakyan, A.}, year={2019}, pages={140201} }","ama":"Klümper A, Nuding W, Sedrakyan A. Random network models with variable disorder of geometry. Physical Review B. 2019;100:140201. doi:10.1103/physrevb.100.140201","apa":"Klümper, A., Nuding, W., & Sedrakyan, A. (2019). Random network models with variable disorder of geometry. Physical Review B, 100, 140201. https://doi.org/10.1103/physrevb.100.140201","chicago":"Klümper, A., W. Nuding, and A. Sedrakyan. “Random Network Models with Variable Disorder of Geometry.” Physical Review B 100 (2019): 140201. https://doi.org/10.1103/physrevb.100.140201."},"year":"2019","type":"journal_article","language":[{"iso":"eng"}],"title":"Random network models with variable disorder of geometry","user_id":"40778","publication":"Physical Review B","author":[{"last_name":"Klümper","full_name":"Klümper, A.","first_name":"A."},{"full_name":"Nuding, W.","first_name":"W.","last_name":"Nuding"},{"first_name":"A.","full_name":"Sedrakyan, A.","last_name":"Sedrakyan"}],"publication_status":"published","volume":100,"publication_identifier":{"issn":["2469-9950","2469-9969"]},"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"date_created":"2019-10-31T07:44:17Z","status":"public"},{"language":[{"iso":"eng"}],"page":"345-348","type":"conference","year":"2019","citation":{"ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9\\_26.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\\_26}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\\_26","apa":"Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\\_26","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\\_26."},"doi":"10.1007/978-3-030-24922-9\\_26","conference":{"location":"L'Aquila, Italy","name":"SIROCCO 2019","start_date":"2019-07-01","end_date":"2019-07-04"},"date_updated":"2022-01-06T06:52:00Z","_id":"14539","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2019-11-04T10:09:35Z","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","last_name":"Castenow","id":"38705"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"477","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks"},{"user_id":"61579","ddc":["000"],"title":"High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis","status":"public","has_accepted_license":"1","date_created":"2019-11-04T17:00:30Z","volume":65,"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-11-05T10:09:05Z","file_id":"14542","creator":"hsiemes","file_size":4631697,"access_level":"closed","date_created":"2019-11-05T10:09:05Z","file_name":"1st International Workshop on HPBC.pdf"}],"author":[{"last_name":"Schryen","id":"72850","first_name":"Guido","full_name":"Schryen, Guido"},{"first_name":"Natalia","full_name":"Kliewer, Natalia","last_name":"Kliewer"},{"full_name":"Borndörfer, Ralf","first_name":"Ralf","last_name":"Borndörfer"},{"full_name":"Koch, Thorsten","first_name":"Thorsten","last_name":"Koch"}],"publication":"OR News","department":[{"_id":"277"}],"file_date_updated":"2019-11-05T10:09:05Z","intvolume":" 65","_id":"14540","date_updated":"2022-01-06T06:52:02Z","language":[{"iso":"eng"}],"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.","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} }","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.","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."},"year":"2019","type":"journal_article","page":"34-35"},{"user_id":"36372","title":"Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback","ddc":["000"],"file":[{"file_size":139199,"file_id":"15312","creator":"dsz","content_type":"application/pdf","date_updated":"2019-12-12T16:51:08Z","success":1,"relation":"main_file","date_created":"2019-12-12T16:51:08Z","file_name":"WITS2019_MEDG_Coverpage.pdf","access_level":"closed"}],"author":[{"full_name":"Szopinski, Daniel","first_name":"Daniel","id":"36372","last_name":"Szopinski"},{"last_name":"John","id":"3952","first_name":"Thomas","full_name":"John, Thomas"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","last_name":"Kundisch","id":"21117"}],"file_date_updated":"2019-12-12T16:51:08Z","department":[{"_id":"276"}],"has_accepted_license":"1","status":"public","date_created":"2019-11-05T13:05:09Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"14543","date_updated":"2022-01-06T06:52:02Z","conference":{"name":"Workshop on Information Technology and Systems (WITS)","location":"Munich, Germany"},"language":[{"iso":"eng"}],"type":"conference_abstract","year":"2019","citation":{"ama":"Szopinski D, John T, Kundisch D. Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback. In: ; 2019.","apa":"Szopinski, D., John, T., & Kundisch, D. (2019). Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback. Presented at the Workshop on Information Technology and Systems (WITS), Munich, Germany.","chicago":"Szopinski, Daniel, Thomas John, and Dennis Kundisch. “Digital Tools for Teaching Business Model Innovation in Information Systems: A Newly Developed Didactic Approach Comprising Video-Based Peer Feedback,” 2019.","bibtex":"@inproceedings{Szopinski_John_Kundisch_2019, title={Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback}, author={Szopinski, Daniel and John, Thomas and Kundisch, Dennis}, year={2019} }","mla":"Szopinski, Daniel, et al. Digital Tools for Teaching Business Model Innovation in Information Systems: A Newly Developed Didactic Approach Comprising Video-Based Peer Feedback. 2019.","short":"D. Szopinski, T. John, D. Kundisch, in: 2019.","ieee":"D. Szopinski, T. John, and D. Kundisch, “Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback,” presented at the Workshop on Information Technology and Systems (WITS), Munich, Germany, 2019."}},{"user_id":"477","title":"Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers","project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"}],"date_created":"2019-11-05T14:32:46Z","status":"public","department":[{"_id":"78"},{"_id":"34"},{"_id":"7"}],"publisher":"Universität Paderborn","author":[{"first_name":"Tim","orcid":"0000-0003-1377-3339","full_name":"Hansmeier, Tim","last_name":"Hansmeier","id":"49992"}],"date_updated":"2022-01-06T06:52:02Z","_id":"14546","supervisor":[{"id":"398","last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"}],"language":[{"iso":"eng"}],"year":"2019","citation":{"mla":"Hansmeier, Tim. Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers. Universität Paderborn, 2019.","bibtex":"@book{Hansmeier_2019, title={Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers}, publisher={Universität Paderborn}, author={Hansmeier, Tim}, year={2019} }","chicago":"Hansmeier, Tim. Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers. Universität Paderborn, 2019.","apa":"Hansmeier, T. (2019). Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers. Universität Paderborn.","ama":"Hansmeier T. Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers. Universität Paderborn; 2019.","ieee":"T. Hansmeier, Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers. Universität Paderborn, 2019.","short":"T. Hansmeier, Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers, Universität Paderborn, 2019."},"type":"mastersthesis"},{"citation":{"short":"M. Kampmann, M. A. Kochte, C. Liu, E. Schneider, S. Hellebrand, H.-J. Wunderlich, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD) 38 (2019) 1956–1968.","ieee":"M. Kampmann, M. A. Kochte, C. Liu, E. Schneider, S. Hellebrand, and H.-J. Wunderlich, “Built-in Test for Hidden Delay Faults,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), vol. 38, no. 10, pp. 1956–1968, 2019.","apa":"Kampmann, M., A. Kochte, M., Liu, C., Schneider, E., Hellebrand, S., & Wunderlich, H.-J. (2019). Built-in Test for Hidden Delay Faults. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 38(10), 1956–1968.","ama":"Kampmann M, A. Kochte M, Liu C, Schneider E, Hellebrand S, Wunderlich H-J. Built-in Test for Hidden Delay Faults. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD). 2019;38(10):1956-1968.","chicago":"Kampmann, Matthias, Michael A. Kochte, Chang Liu, Eric Schneider, Sybille Hellebrand, and Hans-Joachim Wunderlich. “Built-in Test for Hidden Delay Faults.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD) 38, no. 10 (2019): 1956–68.","bibtex":"@article{Kampmann_A. Kochte_Liu_Schneider_Hellebrand_Wunderlich_2019, title={Built-in Test for Hidden Delay Faults}, volume={38}, number={10}, journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD)}, publisher={IEEE}, author={Kampmann, Matthias and A. Kochte, Michael and Liu, Chang and Schneider, Eric and Hellebrand, Sybille and Wunderlich, Hans-Joachim}, year={2019}, pages={1956–1968} }","mla":"Kampmann, Matthias, et al. “Built-in Test for Hidden Delay Faults.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), vol. 38, no. 10, IEEE, 2019, pp. 1956–68."},"year":"2019","type":"journal_article","page":"1956 - 1968","issue":"10","_id":"13048","intvolume":" 38","status":"public","date_created":"2019-08-28T11:44:25Z","volume":38,"publisher":"IEEE","author":[{"last_name":"Kampmann","id":"10935","first_name":"Matthias","full_name":"Kampmann, Matthias"},{"last_name":"A. Kochte","full_name":"A. Kochte, Michael","first_name":"Michael"},{"last_name":"Liu","first_name":"Chang","full_name":"Liu, Chang"},{"first_name":"Eric","full_name":"Schneider, Eric","last_name":"Schneider"},{"id":"209","last_name":"Hellebrand","orcid":"0000-0002-3717-3939","full_name":"Hellebrand, Sybille","first_name":"Sybille"},{"full_name":"Wunderlich, Hans-Joachim","first_name":"Hans-Joachim","last_name":"Wunderlich"}],"publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD)","user_id":"209","abstract":[{"text":"Marginal hardware introduces severe reliability threats throughout the life cycle of a system. Although marginalities may not affect the functionality of a circuit immediately after manufacturing, they can degrade into hard failures and must be screened out during manufacturing test to prevent early life failures. Furthermore, their evolution in the field must be proactively monitored by periodic tests before actual failures occur. In recent years small delay faults have gained increasing attention as possible indicators of marginal hardware. However, small delay faults on short paths may be undetectable even with advanced timing aware ATPG. Faster-than-at-speed test (FAST) can detect such hidden delay faults, but so far FAST has mainly been restricted to manufacturing test.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:27Z","publication_status":"published","publication_identifier":{"eissn":["1937-4151"]},"department":[{"_id":"48"}],"title":"Built-in Test for Hidden Delay Faults"},{"_id":"13106","date_updated":"2022-01-06T06:51:28Z","conference":{"name":"53. Jahrestagung der Gesellschaft für Didaktik der Mathematik","location":"Regensburg"},"language":[{"iso":"ger"}],"year":"2019","type":"conference","citation":{"bibtex":"@inproceedings{Schumacher, title={Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen}, booktitle={Beiträge zum Mathematikunterricht 2019}, author={Schumacher, Jan} }","mla":"Schumacher, Jan. “Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen.” Beiträge zum Mathematikunterricht 2019.","apa":"Schumacher, J. (n.d.). Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen. In Beiträge zum Mathematikunterricht 2019. Regensburg.","ama":"Schumacher J. Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen. In: Beiträge zum Mathematikunterricht 2019.","chicago":"Schumacher, Jan. “Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen.” In Beiträge zum Mathematikunterricht 2019, n.d.","ieee":"J. Schumacher, “Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen,” in Beiträge zum Mathematikunterricht 2019, Regensburg.","short":"J. Schumacher, in: Beiträge zum Mathematikunterricht 2019, n.d."},"user_id":"26809","title":"Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen","author":[{"first_name":"Jan","full_name":"Schumacher, Jan","orcid":"0000-0002-6676-9774","last_name":"Schumacher","id":"26809"}],"department":[{"_id":"360"},{"_id":"98"}],"publication":"Beiträge zum Mathematikunterricht 2019","status":"public","date_created":"2019-08-30T11:58:37Z","publication_status":"inpress"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:28Z","editor":[{"last_name":"Jankvist","first_name":"Uffe Thomas","full_name":"Jankvist, Uffe Thomas"},{"last_name":"Van den Heuvel-Panhuizen","first_name":"Marja","full_name":"Van den Heuvel-Panhuizen, Marja"},{"last_name":"Veldhuis","full_name":"Veldhuis, Michiel","first_name":"Michiel"}],"publication_status":"accepted","department":[{"_id":"360"},{"_id":"98"}],"title":"A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers","place":"Utrecht, the Netherlands","citation":{"chicago":"Schumacher, Jan, and Sebastian Rezat. “A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers.” In Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019), edited by Uffe Thomas Jankvist, Marja Van den Heuvel-Panhuizen, and Michiel Veldhuis. Utrecht, the Netherlands: Freudenthal Group & Freudenthal Institute, Utrecht University and ERME, n.d.","apa":"Schumacher, J., & Rezat, S. (n.d.). A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers. In U. T. Jankvist, M. Van den Heuvel-Panhuizen, & M. Veldhuis (Eds.), Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019). Utrecht, the Netherlands: Freudenthal Group & Freudenthal Institute, Utrecht University and ERME.","ama":"Schumacher J, Rezat S. A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers. In: Jankvist UT, Van den Heuvel-Panhuizen M, Veldhuis M, eds. Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019). Utrecht, the Netherlands: Freudenthal Group & Freudenthal Institute, Utrecht University and ERME.","mla":"Schumacher, Jan, and Sebastian Rezat. “A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers.” Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019), edited by Uffe Thomas Jankvist et al., Freudenthal Group & Freudenthal Institute, Utrecht University and ERME.","bibtex":"@inproceedings{Schumacher_Rezat, place={Utrecht, the Netherlands}, title={A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers}, booktitle={Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019)}, publisher={Freudenthal Group & Freudenthal Institute, Utrecht University and ERME}, author={Schumacher, Jan and Rezat, Sebastian}, editor={Jankvist, Uffe Thomas and Van den Heuvel-Panhuizen, Marja and Veldhuis, MichielEditors} }","short":"J. Schumacher, S. Rezat, in: U.T. Jankvist, M. Van den Heuvel-Panhuizen, M. Veldhuis (Eds.), Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019), Freudenthal Group & Freudenthal Institute, Utrecht University and ERME, Utrecht, the Netherlands, n.d.","ieee":"J. Schumacher and S. Rezat, “A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers,” in Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019), Utrecht."},"year":"2019","type":"conference","_id":"13107","conference":{"end_date":"2019-02-10","start_date":"2019-02-06","name":"CERME 11","location":"Utrecht"},"status":"public","date_created":"2019-08-30T12:00:50Z","publisher":"Freudenthal Group & Freudenthal Institute, Utrecht University and ERME","author":[{"first_name":"Jan","full_name":"Schumacher, Jan","orcid":"0000-0002-6676-9774","last_name":"Schumacher","id":"26809"},{"first_name":"Sebastian","full_name":"Rezat, Sebastian","last_name":"Rezat"}],"quality_controlled":"1","keyword":["diagrammatic reasoning","hypothetical learning trajectory","induction extrapolatory method","integers","negative numbers","permanence principle","semiotics"],"publication":"Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019)","user_id":"26809","abstract":[{"lang":"eng","text":"In this paper, we first outline a Hypothetical Learning Trajectory (HLT), which aims at a formal understanding of the rules for manipulating integers. The HLT is based on task formats, which promote algebraic thinking in terms of generalizing rules from the analysis of patterns and should be familiar to students from their mathematics education experiences in elementary school. Second, we analyze two students' actual learning process based on Peircean semiotics. The analysis shows that the actual learning process diverges from the hypothesized learning process in that the students do not relate the different levels of the diagrams in a way that allows them to extrapolate the rule for the subtraction of negative numbers. Based on this finding, we point out consequences for the design of the tasks."}]},{"title":"Culture and the disposition effect","user_id":"67265","author":[{"full_name":"Breitmayer, Bastian","first_name":"Bastian","last_name":"Breitmayer"},{"last_name":"Hasso","first_name":"Tim","full_name":"Hasso, Tim"},{"first_name":"Matthias","orcid":" https://orcid.org/0000-0001-5740-2420","full_name":"Pelster, Matthias","last_name":"Pelster","id":"67265"}],"quality_controlled":"1","publication":"Economics Letters","department":[{"_id":"186"},{"_id":"578"}],"volume":184,"publication_status":"published","publication_identifier":{"issn":["0165-1765"]},"status":"public","date_created":"2019-08-31T08:36:59Z","date_updated":"2022-01-06T06:51:28Z","_id":"13121","intvolume":" 184","article_number":"108653","doi":"10.1016/j.econlet.2019.108653","type":"journal_article","year":"2019","citation":{"chicago":"Breitmayer, Bastian, Tim Hasso, and Matthias Pelster. “Culture and the Disposition Effect.” Economics Letters 184 (2019). https://doi.org/10.1016/j.econlet.2019.108653.","ama":"Breitmayer B, Hasso T, Pelster M. Culture and the disposition effect. Economics Letters. 2019;184. doi:10.1016/j.econlet.2019.108653","apa":"Breitmayer, B., Hasso, T., & Pelster, M. (2019). Culture and the disposition effect. Economics Letters, 184. https://doi.org/10.1016/j.econlet.2019.108653","mla":"Breitmayer, Bastian, et al. “Culture and the Disposition Effect.” Economics Letters, vol. 184, 108653, 2019, doi:10.1016/j.econlet.2019.108653.","bibtex":"@article{Breitmayer_Hasso_Pelster_2019, title={Culture and the disposition effect}, volume={184}, DOI={10.1016/j.econlet.2019.108653}, number={108653}, journal={Economics Letters}, author={Breitmayer, Bastian and Hasso, Tim and Pelster, Matthias}, year={2019} }","short":"B. Breitmayer, T. Hasso, M. Pelster, Economics Letters 184 (2019).","ieee":"B. Breitmayer, T. Hasso, and M. Pelster, “Culture and the disposition effect,” Economics Letters, vol. 184, 2019."},"language":[{"iso":"eng"}]},{"date_created":"2019-09-01T06:49:42Z","status":"public","publication_identifier":{"issn":["1059-0560"]},"publication_status":"published","volume":64,"publication":"International Review of Economics & Finance","department":[{"_id":"186"},{"_id":"578"}],"quality_controlled":"1","author":[{"first_name":"Bastian","full_name":"Breitmayer, Bastian","last_name":"Breitmayer"},{"first_name":"Filippo","full_name":"Massari, Filippo","last_name":"Massari"},{"first_name":"Matthias","full_name":"Pelster, Matthias","orcid":" https://orcid.org/0000-0001-5740-2420","last_name":"Pelster","id":"67265"}],"user_id":"67265","title":"Swarm intelligence? Stock opinions of the crowd and stock returns","language":[{"iso":"eng"}],"page":"443-464","citation":{"mla":"Breitmayer, Bastian, et al. “Swarm Intelligence? Stock Opinions of the Crowd and Stock Returns.” International Review of Economics & Finance, vol. 64, 2019, pp. 443–64, doi:10.1016/j.iref.2019.08.006.","bibtex":"@article{Breitmayer_Massari_Pelster_2019, title={Swarm intelligence? Stock opinions of the crowd and stock returns}, volume={64}, DOI={10.1016/j.iref.2019.08.006}, journal={International Review of Economics & Finance}, author={Breitmayer, Bastian and Massari, Filippo and Pelster, Matthias}, year={2019}, pages={443–464} }","apa":"Breitmayer, B., Massari, F., & Pelster, M. (2019). Swarm intelligence? Stock opinions of the crowd and stock returns. International Review of Economics & Finance, 64, 443–464. https://doi.org/10.1016/j.iref.2019.08.006","ama":"Breitmayer B, Massari F, Pelster M. Swarm intelligence? Stock opinions of the crowd and stock returns. International Review of Economics & Finance. 2019;64:443-464. doi:10.1016/j.iref.2019.08.006","chicago":"Breitmayer, Bastian, Filippo Massari, and Matthias Pelster. “Swarm Intelligence? Stock Opinions of the Crowd and Stock Returns.” International Review of Economics & Finance 64 (2019): 443–64. https://doi.org/10.1016/j.iref.2019.08.006.","ieee":"B. Breitmayer, F. Massari, and M. Pelster, “Swarm intelligence? Stock opinions of the crowd and stock returns,” International Review of Economics & Finance, vol. 64, pp. 443–464, 2019.","short":"B. Breitmayer, F. Massari, M. Pelster, International Review of Economics & Finance 64 (2019) 443–464."},"type":"journal_article","year":"2019","doi":"10.1016/j.iref.2019.08.006","_id":"13122","date_updated":"2022-01-06T06:51:28Z","intvolume":" 64"},{"_id":"13123","date_updated":"2022-01-06T06:51:28Z","citation":{"chicago":"Afifi, Haitham, Konrad Horbach, and Holger Karl. “A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding.” In 2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019). Barcelona, Spain, 2019.","ama":"Afifi H, Horbach K, Karl H. A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding. In: 2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019). Barcelona, Spain; 2019.","apa":"Afifi, H., Horbach, K., & Karl, H. (2019). A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding. In 2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019). Barcelona, Spain.","mla":"Afifi, Haitham, et al. “A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding.” 2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019), 2019.","bibtex":"@inproceedings{Afifi_Horbach_Karl_2019, place={Barcelona, Spain}, title={A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding}, booktitle={2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019)}, author={Afifi, Haitham and Horbach, Konrad and Karl, Holger}, year={2019} }","short":"H. Afifi, K. Horbach, H. Karl, in: 2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019), Barcelona, Spain, 2019.","ieee":"H. Afifi, K. Horbach, and H. Karl, “A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding,” in 2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019), 2019."},"type":"conference","year":"2019","language":[{"iso":"eng"}],"title":"A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding","user_id":"65718","place":"Barcelona, Spain","abstract":[{"lang":"eng","text":"Given the recent development in embedded devices, wireless senor nodes are no longer limited to data collection but they can also do processing (e.g., smartphones). Accordingly, new types of applications take an advantage of the processing and flexibility provided by the wireless network. A common property between these applications is that the processing is not running on only one single node, but it is broken-down into smaller tasks that can run over multiple nodes, i.e., exploiting the in-network processing. We study a special variant of in-network processing, where the application is given by a graph; the processing tasks have predefined connections to be executed in a predefined sequence. The problem of embedding an application graph into a network is commonly known as Virtual Network Embedding (VNE). In this paper, we present a Genetic Algorithm (GA) solution to solve this wireless VNE problem, where we take into account the interference and multi-cast properties. We show that the GA has a good performance and fast execution compared to the optimization problem."}],"status":"public","date_created":"2019-09-03T11:54:17Z","project":[{"_id":"27","name":"Akustische Sensornetzwerke - Teilprojekt \"Verteilte akustische Signalverarbeitung über funkbasierte Sensornetzwerke"}],"author":[{"first_name":"Haitham","full_name":"Afifi, Haitham","last_name":"Afifi","id":"65718"},{"full_name":"Horbach, Konrad","first_name":"Konrad","last_name":"Horbach"},{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"}],"department":[{"_id":"75"}],"publication":"2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019)"},{"user_id":"477","title":"Scaling, placement, and routing for pliable virtualized composed services","department":[{"_id":"75"}],"author":[{"last_name":"Dräxler","id":"31764","first_name":"Sevil","full_name":"Dräxler, Sevil"}],"publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"date_created":"2019-09-03T12:16:32Z","status":"public","date_updated":"2022-01-06T06:51:28Z","_id":"13124","supervisor":[{"first_name":"Holger","full_name":"Karl, Holger","last_name":"Karl","id":"126"}],"language":[{"iso":"eng"}],"type":"dissertation","citation":{"short":"S. Dräxler, Scaling, Placement, and Routing for Pliable Virtualized Composed Services, Universität Paderborn, 2019.","ieee":"S. Dräxler, Scaling, placement, and routing for pliable virtualized composed services. Universität Paderborn, 2019.","ama":"Dräxler S. Scaling, Placement, and Routing for Pliable Virtualized Composed Services. Universität Paderborn; 2019.","apa":"Dräxler, S. (2019). Scaling, placement, and routing for pliable virtualized composed services. Universität Paderborn.","chicago":"Dräxler, Sevil. Scaling, Placement, and Routing for Pliable Virtualized Composed Services. Universität Paderborn, 2019.","bibtex":"@book{Dräxler_2019, title={Scaling, placement, and routing for pliable virtualized composed services}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2019} }","mla":"Dräxler, Sevil. Scaling, Placement, and Routing for Pliable Virtualized Composed Services. Universität Paderborn, 2019."},"year":"2019"},{"supervisor":[{"full_name":"Kundisch, Dennis","first_name":"Dennis","id":"21117","last_name":"Kundisch"}],"language":[{"iso":"eng"}],"type":"dissertation","citation":{"ieee":"T. Görzen, Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd. Universität Paderborn, 2019.","short":"T. Görzen, Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd, Universität Paderborn, 2019.","bibtex":"@book{Görzen_2019, title={Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd}, publisher={Universität Paderborn}, author={Görzen, Thomas}, year={2019} }","mla":"Görzen, Thomas. Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd. Universität Paderborn, 2019.","chicago":"Görzen, Thomas. Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd. Universität Paderborn, 2019.","ama":"Görzen T. Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd. Universität Paderborn; 2019.","apa":"Görzen, T. (2019). Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd. Universität Paderborn."},"year":"2019","date_updated":"2022-01-06T06:51:28Z","_id":"13125","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"date_created":"2019-09-03T12:20:11Z","status":"public","department":[{"_id":"7"},{"_id":"276"}],"author":[{"id":"47700","last_name":"Görzen","full_name":"Görzen, Thomas","first_name":"Thomas"}],"publisher":"Universität Paderborn","user_id":"477","title":"Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"date_created":"2019-09-03T12:23:44Z","status":"public","department":[{"_id":"7"},{"_id":"70"}],"publisher":"Universität Paderborn","author":[{"full_name":"Khaluf, Lial","first_name":"Lial","last_name":"Khaluf"}],"user_id":"477","title":"Organic Programming of Dynamic Real-Time Applications","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Franz","full_name":"Rammig, Franz","last_name":"Rammig"}],"year":"2019","type":"dissertation","citation":{"short":"L. Khaluf, Organic Programming of Dynamic Real-Time Applications, Universität Paderborn, 2019.","ieee":"L. Khaluf, Organic Programming of Dynamic Real-Time Applications. Universität Paderborn, 2019.","ama":"Khaluf L. Organic Programming of Dynamic Real-Time Applications. Universität Paderborn; 2019.","apa":"Khaluf, L. (2019). Organic Programming of Dynamic Real-Time Applications. Universität Paderborn.","chicago":"Khaluf, Lial. Organic Programming of Dynamic Real-Time Applications. Universität Paderborn, 2019.","bibtex":"@book{Khaluf_2019, title={Organic Programming of Dynamic Real-Time Applications}, publisher={Universität Paderborn}, author={Khaluf, Lial}, year={2019} }","mla":"Khaluf, Lial. Organic Programming of Dynamic Real-Time Applications. Universität Paderborn, 2019."},"_id":"13126","date_updated":"2022-01-06T06:51:28Z"},{"oa":"1","date_updated":"2022-01-06T06:51:28Z","language":[{"iso":"eng"}],"title":"Rational Secure Multiparty Computation","project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"_id":"13128","supervisor":[{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"}],"citation":{"ama":"Bröcher H. Rational Secure Multiparty Computation. Universität Paderborn; 2019.","apa":"Bröcher, H. (2019). Rational Secure Multiparty Computation. Universität Paderborn.","chicago":"Bröcher, Henrik. Rational Secure Multiparty Computation. Universität Paderborn, 2019.","mla":"Bröcher, Henrik. Rational Secure Multiparty Computation. Universität Paderborn, 2019.","bibtex":"@book{Bröcher_2019, title={Rational Secure Multiparty Computation}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2019} }","short":"H. Bröcher, Rational Secure Multiparty Computation, Universität Paderborn, 2019.","ieee":"H. Bröcher, Rational Secure Multiparty Computation. Universität Paderborn, 2019."},"type":"mastersthesis","year":"2019","user_id":"25078","ddc":["000"],"extern":"1","has_accepted_license":"1","status":"public","date_created":"2019-09-04T08:04:12Z","file":[{"creator":"bhenrik","file_id":"13129","file_size":746819,"relation":"main_file","date_updated":"2020-10-30T15:59:34Z","content_type":"application/pdf","date_created":"2019-09-04T07:59:31Z","file_name":"thesis_broecher.pdf","access_level":"open_access"}],"publisher":"Universität Paderborn","author":[{"first_name":"Henrik","full_name":"Bröcher, Henrik","last_name":"Bröcher","id":"41047"}],"file_date_updated":"2020-10-30T15:59:34Z"},{"user_id":"38209","title":"From Automated to On-The-Fly Machine Learning","place":"Bonn","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"date_created":"2019-09-04T08:44:46Z","author":[{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"},{"first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176"},{"full_name":"Tornede, Alexander","first_name":"Alexander","id":"38209","last_name":"Tornede"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"publisher":"Gesellschaft für Informatik e.V.","publication":"INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft","department":[{"_id":"355"}],"_id":"13132","date_updated":"2022-01-06T06:51:28Z","conference":{"end_date":"2019-09-26","name":"Informatik 2019","start_date":"2019-09-23","location":"Kassel"},"language":[{"iso":"eng"}],"year":"2019","type":"conference_abstract","citation":{"mla":"Mohr, Felix, et al. “From Automated to On-The-Fly Machine Learning.” INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, Gesellschaft für Informatik e.V., 2019, pp. 273–74.","bibtex":"@inproceedings{Mohr_Wever_Tornede_Hüllermeier_2019, place={Bonn}, series={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik}, title={From Automated to On-The-Fly Machine Learning}, booktitle={INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft}, publisher={Gesellschaft für Informatik e.V.}, author={Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke}, year={2019}, pages={273–274}, collection={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik} }","chicago":"Mohr, Felix, Marcel Dominik Wever, Alexander Tornede, and Eyke Hüllermeier. “From Automated to On-The-Fly Machine Learning.” In INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, 273–74. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft Für Informatik. Bonn: Gesellschaft für Informatik e.V., 2019.","ama":"Mohr F, Wever MD, Tornede A, Hüllermeier E. From Automated to On-The-Fly Machine Learning. In: INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik. Bonn: Gesellschaft für Informatik e.V.; 2019:273-274.","apa":"Mohr, F., Wever, M. D., Tornede, A., & Hüllermeier, E. (2019). From Automated to On-The-Fly Machine Learning. In INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft (pp. 273–274). Bonn: Gesellschaft für Informatik e.V.","ieee":"F. Mohr, M. D. Wever, A. Tornede, and E. Hüllermeier, “From Automated to On-The-Fly Machine Learning,” in INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft, Kassel, 2019, pp. 273–274.","short":"F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, in: INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, Gesellschaft für Informatik e.V., Bonn, 2019, pp. 273–274."},"page":" 273-274 ","series_title":"INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik"},{"abstract":[{"text":"Non-GAAP reporting is under debate as managers may opportunistically inflate non-GAAP earnings. By separating firms into groups based on exclusions of recurring expenses before material restatements occur this paper investigates whether market participants are misled based on ex-ante non-GAAP reporting. The results show a decline in cumulative abnormal returns (–11.8% aggressive non-GAAP Reporting vs. –2.7% non-aggressive non-GAAP reporting), reduction in overvaluation (–22.18% vs. no decline) and losses in the earnings response coefficient (–51.8% vs. no significant decline) for firms with prior aggressive non-GAAP reporting. Further, we document that investors are less responsive to aggressively reported non-GAAP earnings ex-post, indicating that increased attention enhances investor’s ability to see through the quality of non-GAAP exclusions. ","lang":"eng"}],"user_id":"46447","title":"Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements?","department":[{"_id":"186"},{"_id":"189"}],"keyword":["Keywords: non-GAAP reporting","restatements","information content of earnings","firm value","overvaluation"],"author":[{"full_name":"Müller, Jens","first_name":"Jens","id":"1245","last_name":"Müller"},{"last_name":"Sievers","id":"46447","first_name":"Sönke","full_name":"Sievers, Sönke"},{"id":"36373","last_name":"Mehring","full_name":"Mehring, Oliver","first_name":"Oliver"},{"first_name":"Christian","full_name":"Sofilkanitsch, Christian","last_name":"Sofilkanitsch"}],"date_created":"2019-09-04T09:48:44Z","status":"public","publication_status":"published","jel":["H2","M41"],"_id":"13137","date_updated":"2022-01-06T06:51:28Z","main_file_link":[{"url":"https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3415109"}],"language":[{"iso":"eng"}],"page":"65","year":"2019","citation":{"ieee":"J. Müller, S. Sievers, O. Mehring, and C. Sofilkanitsch, Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements? 2019.","short":"J. Müller, S. Sievers, O. Mehring, C. Sofilkanitsch, Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements?, 2019.","mla":"Müller, Jens, et al. Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements? 2019.","bibtex":"@book{Müller_Sievers_Mehring_Sofilkanitsch_2019, title={Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements?}, author={Müller, Jens and Sievers, Sönke and Mehring, Oliver and Sofilkanitsch, Christian}, year={2019} }","apa":"Müller, J., Sievers, S., Mehring, O., & Sofilkanitsch, C. (2019). Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements?","ama":"Müller J, Sievers S, Mehring O, Sofilkanitsch C. Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements?; 2019.","chicago":"Müller, Jens, Sönke Sievers, Oliver Mehring, and Christian Sofilkanitsch. Non-GAAP Reporting and Investor Attention: Are Investors Misled by Exclusions of Recurring Expenses from Non-GAAP Earnings before Restatement Announcements?, 2019."},"type":"working_paper"}]