[{"page":"248--262","_id":"155","ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-21T12:51:24Z","citation":{"mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>.","bibtex":"@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>}, booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS} }","ama":"Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>","ieee":"R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262.","apa":"Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>","chicago":"Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>.","short":"R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"series_title":"LNCS","doi":"10.1007/978-3-319-49259-9_20","title":"Self-stabilizing Metric Graphs","year":"2016","author":[{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"full_name":"Lefèvre, Jonas","last_name":"Lefèvre","first_name":"Jonas"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:52:28Z","file":[{"file_size":389136,"access_level":"closed","file_name":"155-SSS16-GLS.pdf","date_updated":"2018-03-21T12:51:24Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1550","creator":"florida","date_created":"2018-03-21T12:51:24Z"}],"date_created":"2017-10-17T12:41:22Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"text":"We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.","lang":"eng"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-21T12:50:29Z","citation":{"mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:563--577. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>","bibtex":"@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 563--577). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577.","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 563--577. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>.","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577."},"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15504","page":"563--577","_id":"157","abstract":[{"lang":"eng","text":"Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees."}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","type":"conference","department":[{"_id":"63"}],"file":[{"success":1,"content_type":"application/pdf","file_id":"1549","file_size":753147,"access_level":"closed","file_name":"157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf","date_updated":"2018-03-21T12:50:29Z","relation":"main_file","date_created":"2018-03-21T12:50:29Z","creator":"florida"}],"date_created":"2017-10-17T12:41:22Z","date_updated":"2022-01-06T06:52:32Z","year":"2016","title":"Scheduling with Interjob Communication on Parallel Processors","author":[{"full_name":"König, Jürgen","first_name":"Jürgen","last_name":"König"},{"id":"13536","last_name":"Mäcker","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"doi":"10.1007/978-3-319-48749-6_41","series_title":"LNCS"},{"conference":{"location":"Mexiko City, Mexiko","name":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)"},"publication_identifier":{"isbn":["9781467394062"]},"author":[{"last_name":"Boschmann","first_name":"Alexander","full_name":"Boschmann, Alexander"},{"last_name":"Agne","first_name":"Andreas","full_name":"Agne, Andreas"},{"id":"49051","first_name":"Linus Matthias","last_name":"Witschen","full_name":"Witschen, Linus Matthias"},{"full_name":"Thombansen, Georg","last_name":"Thombansen","first_name":"Georg"},{"full_name":"Kraus, Florian","last_name":"Kraus","first_name":"Florian"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"year":"2016","title":"FPGA-based acceleration of high density myoelectric signal processing","status":"public","date_updated":"2022-01-06T06:52:38Z","publication_status":"published","publisher":"IEEE","_id":"15873","language":[{"iso":"eng"}],"doi":"10.1109/reconfig.2015.7393312","user_id":"49051","citation":{"chicago":"Boschmann, Alexander, Andreas Agne, Linus Matthias Witschen, Georg Thombansen, Florian Kraus, and Marco Platzner. “FPGA-Based Acceleration of High Density Myoelectric Signal Processing.” In <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">https://doi.org/10.1109/reconfig.2015.7393312</a>.","short":"A. Boschmann, A. Agne, L.M. Witschen, G. Thombansen, F. Kraus, M. Platzner, in: 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2016.","ieee":"A. Boschmann, A. Agne, L. M. Witschen, G. Thombansen, F. Kraus, and M. Platzner, “FPGA-based acceleration of high density myoelectric signal processing,” in <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, Mexiko City, Mexiko, 2016.","apa":"Boschmann, A., Agne, A., Witschen, L. M., Thombansen, G., Kraus, F., &#38; Platzner, M. (2016). FPGA-based acceleration of high density myoelectric signal processing. In <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. Mexiko City, Mexiko: IEEE. <a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">https://doi.org/10.1109/reconfig.2015.7393312</a>","bibtex":"@inproceedings{Boschmann_Agne_Witschen_Thombansen_Kraus_Platzner_2016, title={FPGA-based acceleration of high density myoelectric signal processing}, DOI={<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>}, booktitle={2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Boschmann, Alexander and Agne, Andreas and Witschen, Linus Matthias and Thombansen, Georg and Kraus, Florian and Platzner, Marco}, year={2016} }","ama":"Boschmann A, Agne A, Witschen LM, Thombansen G, Kraus F, Platzner M. FPGA-based acceleration of high density myoelectric signal processing. In: <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>","mla":"Boschmann, Alexander, et al. “FPGA-Based Acceleration of High Density Myoelectric Signal Processing.” <i>2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/reconfig.2015.7393312\">10.1109/reconfig.2015.7393312</a>."},"publication":"2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)","date_created":"2020-02-11T07:48:56Z","department":[{"_id":"78"}],"keyword":["Electromyography","Feature extraction","Delays","Hardware  Pattern recognition","Prosthetics","High definition video"],"type":"conference"},{"year":"2016","title":"Routing Games With Progressive Filling","author":[{"first_name":"Tobias","last_name":"Harks","full_name":"Harks, Tobias"},{"last_name":"Höfer","first_name":"Martin","full_name":"Höfer, Martin"},{"last_name":"Schewior","first_name":"Kevin","full_name":"Schewior, Kevin"},{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"date_updated":"2022-01-06T06:52:40Z","language":[{"iso":"eng"}],"doi":"10.1109/TNET.2015.2468571","issue":"4","publication":"IEEE/ACM Transactions on Networking","abstract":[{"lang":"eng","text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived."}],"file":[{"success":1,"content_type":"application/pdf","file_id":"1547","file_size":1655309,"access_level":"closed","file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf","date_updated":"2018-03-21T12:48:02Z","relation":"main_file","date_created":"2018-03-21T12:48:02Z","creator":"florida"}],"date_created":"2017-10-17T12:41:23Z","type":"journal_article","department":[{"_id":"63"},{"_id":"541"}],"status":"public","has_accepted_license":"1","page":"2553 - 2562","publisher":"IEEE","_id":"159","ddc":["040"],"user_id":"477","file_date_updated":"2018-03-21T12:48:02Z","citation":{"chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4 (2016): 2553–62. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2016). Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>, (4), 2553–2562. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” <i>IEEE/ACM Transactions on Networking</i>, no. 4, pp. 2553–2562, 2016.","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>. 2016;(4):2553-2562. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>","bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4, IEEE, 2016, pp. 2553–62, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"user_id":"477","_id":"146","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:03Z","status":"public","title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes","year":"2016","author":[{"last_name":"Hamm","first_name":"Julian","full_name":"Hamm, Julian"}],"type":"mastersthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:20Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"mla":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ama":"Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn; 2016.","bibtex":"@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm, Julian}, year={2016} }","apa":"Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn.","ieee":"J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","chicago":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","short":"J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on Attributes, Universität Paderborn, 2016."}},{"citation":{"ama":"Chen W-F, Ku L-W. UTCNN: a Deep Learning Model of Stance Classification on Social Media Text. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>. ; 2016:1635-1645.","bibtex":"@inproceedings{Chen_Ku_2016, title={UTCNN: a Deep Learning Model of Stance Classification on Social Media Text}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics}, author={Chen, Wei-Fan and Ku, Lun-Wei}, year={2016}, pages={1635–1645} }","mla":"Chen, Wei-Fan, and Lun-Wei Ku. “UTCNN: A Deep Learning Model of Stance Classification on Social Media Text.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>, 2016, pp. 1635–45.","chicago":"Chen, Wei-Fan, and Lun-Wei Ku. “UTCNN: A Deep Learning Model of Stance Classification on Social Media Text.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>, 1635–45, 2016.","short":"W.-F. Chen, L.-W. Ku, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics, 2016, pp. 1635–1645.","apa":"Chen, W.-F., &#38; Ku, L.-W. (2016). UTCNN: a Deep Learning Model of Stance Classification on Social Media Text. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i> (pp. 1635–1645).","ieee":"W.-F. Chen and L.-W. Ku, “UTCNN: a Deep Learning Model of Stance Classification on Social Media Text,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics</i>, 2016, pp. 1635–1645."},"publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics","extern":"1","date_created":"2019-11-11T12:28:24Z","department":[{"_id":"600"}],"type":"conference","author":[{"last_name":"Chen","first_name":"Wei-Fan","full_name":"Chen, Wei-Fan","id":"82920"},{"full_name":"Ku, Lun-Wei","first_name":"Lun-Wei","last_name":"Ku"}],"title":"UTCNN: a Deep Learning Model of Stance Classification on Social Media Text","year":"2016","status":"public","date_updated":"2022-01-06T06:52:09Z","_id":"14881","language":[{"iso":"eng"}],"page":"1635-1645","main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-1154.pdf"}],"user_id":"82920"},{"extern":"1","citation":{"apa":"Chen, W.-F., Lin, F.-Y., &#38; Ku, L.-W. (2016). WordForce: Visualizing Controversial Words in Debates. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i> (pp. 273–277).","ieee":"W.-F. Chen, F.-Y. Lin, and L.-W. Ku, “WordForce: Visualizing Controversial Words in Debates,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>, 2016, pp. 273–277.","short":"W.-F. Chen, F.-Y. Lin, L.-W. Ku, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations, 2016, pp. 273–277.","chicago":"Chen, Wei-Fan, Fang-Yu Lin, and Lun-Wei Ku. “WordForce: Visualizing Controversial Words in Debates.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>, 273–77, 2016.","mla":"Chen, Wei-Fan, et al. “WordForce: Visualizing Controversial Words in Debates.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>, 2016, pp. 273–77.","ama":"Chen W-F, Lin F-Y, Ku L-W. WordForce: Visualizing Controversial Words in Debates. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations</i>. ; 2016:273-277.","bibtex":"@inproceedings{Chen_Lin_Ku_2016, title={WordForce: Visualizing Controversial Words in Debates}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations}, author={Chen, Wei-Fan and Lin, Fang-Yu and Ku, Lun-Wei}, year={2016}, pages={273–277} }"},"publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: System Demonstrations","department":[{"_id":"600"}],"type":"conference","date_created":"2019-11-11T12:29:14Z","date_updated":"2022-01-06T06:52:09Z","author":[{"id":"82920","full_name":"Chen, Wei-Fan","last_name":"Chen","first_name":"Wei-Fan"},{"first_name":"Fang-Yu","last_name":"Lin","full_name":"Lin, Fang-Yu"},{"full_name":"Ku, Lun-Wei","first_name":"Lun-Wei","last_name":"Ku"}],"status":"public","title":"WordForce: Visualizing Controversial Words in Debates","year":"2016","user_id":"82920","_id":"14882","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-2057.pdf"}],"page":"273-277"},{"author":[{"last_name":"Ku","first_name":"Lun-Wei","full_name":"Ku, Lun-Wei"},{"id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","last_name":"Chen"}],"year":"2016","status":"public","title":"Chinese Textual Sentiment Analysis: Datasets, Resources and Tools","date_updated":"2022-01-06T06:52:09Z","_id":"14883","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-3002.pdf"}],"page":"5-8","user_id":"82920","citation":{"chicago":"Ku, Lun-Wei, and Wei-Fan Chen. “Chinese Textual Sentiment Analysis: Datasets, Resources and Tools.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>, 5–8, 2016.","short":"L.-W. Ku, W.-F. Chen, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts, 2016, pp. 5–8.","apa":"Ku, L.-W., &#38; Chen, W.-F. (2016). Chinese Textual Sentiment Analysis: Datasets, Resources and Tools. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i> (pp. 5–8).","ieee":"L.-W. Ku and W.-F. Chen, “Chinese Textual Sentiment Analysis: Datasets, Resources and Tools,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>, 2016, pp. 5–8.","ama":"Ku L-W, Chen W-F. Chinese Textual Sentiment Analysis: Datasets, Resources and Tools. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>. ; 2016:5-8.","bibtex":"@inproceedings{Ku_Chen_2016, title={Chinese Textual Sentiment Analysis: Datasets, Resources and Tools}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts}, author={Ku, Lun-Wei and Chen, Wei-Fan}, year={2016}, pages={5–8} }","mla":"Ku, Lun-Wei, and Wei-Fan Chen. “Chinese Textual Sentiment Analysis: Datasets, Resources and Tools.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts</i>, 2016, pp. 5–8."},"publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts","extern":"1","date_created":"2019-11-11T12:30:04Z","department":[{"_id":"600"}],"type":"conference_abstract"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"mla":"Drees, Maximilian, et al. “Strategic Online Facility Location.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>.","ama":"Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:593--607. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>","bibtex":"@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }","apa":"Drees, M., Feldkord, B., &#38; Skopalik, A. (2016). Strategic Online Facility Location. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 593--607). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>","ieee":"M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607.","chicago":"Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 593--607. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>.","short":"M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607."},"file_date_updated":"2018-03-21T12:55:43Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"477","_id":"149","page":"593--607","abstract":[{"text":"In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).","lang":"eng"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","date_created":"2017-10-17T12:41:21Z","file":[{"creator":"florida","date_created":"2018-03-21T12:55:43Z","file_name":"149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf","file_size":236253,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T12:55:43Z","file_id":"1553","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T06:52:10Z","author":[{"last_name":"Drees","first_name":"Maximilian","full_name":"Drees, Maximilian"},{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"title":"Strategic Online Facility Location","year":"2016","doi":"10.1007/978-3-319-48749-6_43","series_title":"LNCS","language":[{"iso":"eng"}]},{"type":"dissertation","department":[{"_id":"66"}],"file":[{"date_updated":"2018-03-21T12:54:05Z","relation":"main_file","access_level":"closed","file_size":6340482,"file_name":"150-Dissertation_Svetlana_Arifulina.pdf","success":1,"content_type":"application/pdf","file_id":"1552","creator":"florida","date_created":"2018-03-21T12:54:05Z"}],"date_created":"2017-10-17T12:41:21Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-21T12:54:05Z","citation":{"bibtex":"@book{Arifulina_2016, title={Solving Heterogeneity for a Successful Service Market}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>}, publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2016} }","ama":"Arifulina S. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn; 2016. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>","mla":"Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>.","chicago":"Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016. <a href=\"https://doi.org/10.17619/UNIPB/1-13\">https://doi.org/10.17619/UNIPB/1-13</a>.","short":"S. Arifulina, Solving Heterogeneity for a Successful Service Market, Universität Paderborn, 2016.","ieee":"S. Arifulina, <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016.","apa":"Arifulina, S. (2016). <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-13\">https://doi.org/10.17619/UNIPB/1-13</a>"},"supervisor":[{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"}],"user_id":"477","ddc":["040"],"doi":"10.17619/UNIPB/1-13","publisher":"Universität Paderborn","_id":"150","date_updated":"2022-01-06T06:52:13Z","has_accepted_license":"1","status":"public","title":"Solving Heterogeneity for a Successful Service Market","year":"2016","author":[{"full_name":"Arifulina, Svetlana","last_name":"Arifulina","first_name":"Svetlana"}]},{"date_created":"2019-11-21T14:49:46Z","type":"conference","department":[{"_id":"69"}],"publication":"Digital Humanities 2016, DH 2016, Conference Abstracts","citation":{"chicago":"Dunst, Alexander, Rita Hartel, Sven Hohenstein, and Jochen Laubrock. “Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels.” In <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>, 178–80, 2016.","short":"A. Dunst, R. Hartel, S. Hohenstein, J. Laubrock, in: Digital Humanities 2016, DH 2016, Conference Abstracts, 2016, pp. 178–180.","apa":"Dunst, A., Hartel, R., Hohenstein, S., &#38; Laubrock, J. (2016). Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels. In <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i> (pp. 178–180).","ieee":"A. Dunst, R. Hartel, S. Hohenstein, and J. Laubrock, “Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels,” in <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>, 2016, pp. 178–180.","ama":"Dunst A, Hartel R, Hohenstein S, Laubrock J. Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels. In: <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>. ; 2016:178-180.","bibtex":"@inproceedings{Dunst_Hartel_Hohenstein_Laubrock_2016, title={Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels}, booktitle={Digital Humanities 2016, DH 2016, Conference Abstracts}, author={Dunst, Alexander and Hartel, Rita and Hohenstein, Sven and Laubrock, Jochen}, year={2016}, pages={178–180} }","mla":"Dunst, Alexander, et al. “Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels.” <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>, 2016, pp. 178–80."},"page":"178-180","language":[{"iso":"eng"}],"_id":"15085","user_id":"14961","title":"Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels","status":"public","year":"2016","author":[{"full_name":"Dunst, Alexander","first_name":"Alexander","last_name":"Dunst"},{"id":"14961","full_name":"Hartel, Rita","last_name":"Hartel","first_name":"Rita"},{"full_name":"Hohenstein, Sven","last_name":"Hohenstein","first_name":"Sven"},{"full_name":"Laubrock, Jochen","first_name":"Jochen","last_name":"Laubrock"}],"date_updated":"2022-01-06T06:52:15Z"},{"type":"conference","department":[{"_id":"69"}],"date_created":"2019-11-21T14:52:52Z","publication":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","citation":{"ama":"Böttcher S, Hartel R, Jacobs T, Maneth S. Incremental updates on compressed XML. In: <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>. IEEE; 2016:1026-1037. doi:<a href=\"https://doi.org/10.1109/icde.2016.7498310\">10.1109/icde.2016.7498310</a>","bibtex":"@inproceedings{Böttcher_Hartel_Jacobs_Maneth_2016, title={Incremental updates on compressed XML}, DOI={<a href=\"https://doi.org/10.1109/icde.2016.7498310\">10.1109/icde.2016.7498310</a>}, booktitle={2016 IEEE 32nd International Conference on Data Engineering (ICDE)}, publisher={IEEE}, author={Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas and Maneth, Sebastian}, year={2016}, pages={1026–1037} }","mla":"Böttcher, Stefan, et al. “Incremental Updates on Compressed XML.” <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>, IEEE, 2016, pp. 1026–37, doi:<a href=\"https://doi.org/10.1109/icde.2016.7498310\">10.1109/icde.2016.7498310</a>.","short":"S. Böttcher, R. Hartel, T. Jacobs, S. Maneth, in: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), IEEE, 2016, pp. 1026–1037.","chicago":"Böttcher, Stefan, Rita Hartel, Thomas Jacobs, and Sebastian Maneth. “Incremental Updates on Compressed XML.” In <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>, 1026–37. IEEE, 2016. <a href=\"https://doi.org/10.1109/icde.2016.7498310\">https://doi.org/10.1109/icde.2016.7498310</a>.","apa":"Böttcher, S., Hartel, R., Jacobs, T., &#38; Maneth, S. (2016). Incremental updates on compressed XML. In <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i> (pp. 1026–1037). IEEE. <a href=\"https://doi.org/10.1109/icde.2016.7498310\">https://doi.org/10.1109/icde.2016.7498310</a>","ieee":"S. Böttcher, R. Hartel, T. Jacobs, and S. Maneth, “Incremental updates on compressed XML,” in <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>, 2016, pp. 1026–1037."},"user_id":"14961","doi":"10.1109/icde.2016.7498310","page":"1026-1037","publisher":"IEEE","_id":"15086","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:15Z","year":"2016","status":"public","title":"Incremental updates on compressed XML","author":[{"last_name":"Böttcher","first_name":"Stefan","full_name":"Böttcher, Stefan","id":"624"},{"id":"14961","first_name":"Rita","last_name":"Hartel","full_name":"Hartel, Rita"},{"full_name":"Jacobs, Thomas","first_name":"Thomas","last_name":"Jacobs"},{"first_name":"Sebastian","last_name":"Maneth","full_name":"Maneth, Sebastian"}],"publication_identifier":{"isbn":["9781509020201"]}},{"user_id":"49109","page":"450-461","language":[{"iso":"eng"}],"_id":"15111","publisher":"Springer","date_updated":"2022-01-06T06:52:15Z","title":"Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts","year":"2016","status":"public","author":[{"id":"13472","last_name":"Pfannschmidt","orcid":"0000-0001-9407-7903","first_name":"Karlson","full_name":"Pfannschmidt, Karlson"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"},{"full_name":"Held, S.","first_name":"S.","last_name":"Held"},{"first_name":"R.","last_name":"Neiger","full_name":"Neiger, R."}],"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"date_created":"2019-11-21T16:42:47Z","publication":"In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands","citation":{"mla":"Pfannschmidt, Karlson, et al. “Evaluating Tests in Medical  Diagnosis-Combining Machine Learning with Game-Theoretical Concepts.” <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>, Springer, 2016, pp. 450–61.","ama":"Pfannschmidt K, Hüllermeier E, Held S, Neiger R. Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts. In: <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>. Springer; 2016:450-461.","bibtex":"@inproceedings{Pfannschmidt_Hüllermeier_Held_Neiger_2016, title={Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts}, booktitle={In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands}, publisher={Springer}, author={Pfannschmidt, Karlson and Hüllermeier, Eyke and Held, S. and Neiger, R.}, year={2016}, pages={450–461} }","apa":"Pfannschmidt, K., Hüllermeier, E., Held, S., &#38; Neiger, R. (2016). Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts. In <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i> (pp. 450–461). Springer.","ieee":"K. Pfannschmidt, E. Hüllermeier, S. Held, and R. Neiger, “Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical concepts,” in <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>, 2016, pp. 450–461.","chicago":"Pfannschmidt, Karlson, Eyke Hüllermeier, S. Held, and R. Neiger. “Evaluating Tests in Medical  Diagnosis-Combining Machine Learning with Game-Theoretical Concepts.” In <i>In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>, 450–61. Springer, 2016.","short":"K. Pfannschmidt, E. Hüllermeier, S. Held, R. Neiger, in: In Proceedings IPMU 16th International Conference on Information Processing and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands, Springer, 2016, pp. 450–461."}},{"_id":"15176","language":[{"iso":"ger"}],"user_id":"23082","author":[{"first_name":"Nadine","last_name":"Feldmann","full_name":"Feldmann, Nadine","id":"23082"},{"last_name":"Bause","first_name":"Fabian","full_name":"Bause, Fabian"},{"id":"213","last_name":"Henning","first_name":"Bernd","full_name":"Henning, Bernd"}],"title":"GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen","status":"public","year":"2016","date_updated":"2022-01-06T06:52:16Z","date_created":"2019-11-25T13:26:07Z","department":[{"_id":"49"}],"type":"misc","citation":{"short":"N. Feldmann, F. Bause, B. Henning, GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen, 2016.","chicago":"Feldmann, Nadine, Fabian Bause, and Bernd Henning. <i>GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen</i>, 2016.","apa":"Feldmann, N., Bause, F., &#38; Henning, B. (2016). <i>GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen</i>.","ieee":"N. Feldmann, F. Bause, and B. Henning, <i>GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen</i>. 2016.","ama":"Feldmann N, Bause F, Henning B. <i>GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen</i>.; 2016.","bibtex":"@book{Feldmann_Bause_Henning_2016, title={GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen}, author={Feldmann, Nadine and Bause, Fabian and Henning, Bernd}, year={2016} }","mla":"Feldmann, Nadine, et al. <i>GUM-konforme Unsicherheitsabschätzung bei inversen Problemen am Beispiel akustischer Transmissionsmessungen</i>. 2016."},"project":[{"grant_number":"222271124","_id":"87","name":"Bestimmung komplexer akustischer Materialkenngrößen"}]},{"date_created":"2019-11-26T09:27:07Z","type":"conference_abstract","department":[{"_id":"69"}],"publication":"DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma","citation":{"apa":"Dunst, A., &#38; Hartel, R. (2016). Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane. In <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma</i>.","ieee":"A. Dunst and R. Hartel, “Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane,” in <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma</i>, 2016.","chicago":"Dunst, Alexander, and Rita Hartel. “Die Corpusanalyse Multimodaler Erzählungen Am Beispiel Graphischer Romane.” In <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>, 2016.","short":"A. Dunst, R. Hartel, in: DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma, 2016.","mla":"Dunst, Alexander, and Rita Hartel. “Die Corpusanalyse Multimodaler Erzählungen Am Beispiel Graphischer Romane.” <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>, 2016.","ama":"Dunst A, Hartel R. Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane. In: <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>. ; 2016.","bibtex":"@inproceedings{Dunst_Hartel_2016, title={Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane}, booktitle={DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma}, author={Dunst, Alexander and Hartel, Rita}, year={2016} }"},"language":[{"iso":"eng"}],"_id":"15184","user_id":"14961","title":"Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane","status":"public","year":"2016","author":[{"first_name":"Alexander","last_name":"Dunst","full_name":"Dunst, Alexander"},{"id":"14961","first_name":"Rita","last_name":"Hartel","full_name":"Hartel, Rita"}],"date_updated":"2022-01-06T06:52:16Z"},{"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"citation":{"ama":"Dallmeier F. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn; 2016.","bibtex":"@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier, Fynn}, year={2016} }","mla":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","short":"F. Dallmeier, Short Randomizable Aggregatable Signatures: Constructions and Security Analysis, Universität Paderborn, 2016.","chicago":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","apa":"Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn.","ieee":"F. Dallmeier, <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:41:21Z","department":[{"_id":"64"}],"type":"bachelorsthesis","author":[{"full_name":"Dallmeier, Fynn","last_name":"Dallmeier","first_name":"Fynn"}],"title":"Short Randomizable Aggregatable Signatures: Constructions and Security Analysis","status":"public","year":"2016","date_updated":"2022-01-06T06:52:16Z","_id":"152","publisher":"Universität Paderborn","user_id":"477"},{"language":[{"iso":"eng"}],"doi":"10.1109/REW.2016.015","author":[{"id":"58843","last_name":"van Rooijen","first_name":"Lorijn","full_name":"van Rooijen, Lorijn"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"}],"year":"2016","title":"Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm","date_updated":"2022-01-06T06:52:42Z","date_created":"2017-10-17T12:41:23Z","file":[{"file_id":"1546","success":1,"content_type":"application/pdf","file_name":"160-07815598.pdf","access_level":"closed","file_size":419026,"relation":"main_file","date_updated":"2018-03-21T12:47:21Z","date_created":"2018-03-21T12:47:21Z","creator":"florida"}],"department":[{"_id":"66"}],"type":"conference","publication":"Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)","abstract":[{"text":"A task at the beginning of the software development process is the creation of a requirements specification. The requirements specification is usually created by a software engineering expert. We try to substitute this expert by a domain expert (the user) and formulate the problem of creating requirements specifications as a search-based software engineering problem. The domain expert provides only examples of event sequences that describe the behavior of the required software program. These examples are represented by simple sequence diagrams and are divided into two subsets: positive examples of required program behavior and negative examples of prohibited program behavior. The task is then to synthesize a generalized requirements specification that usefully describes the required software. We approach this problem by applying a genetic algorithm and evolve deterministic finite automata (DFAs). These DFAs take the sequence diagrams as input that should be either accepted (positive example) or rejected (negative example). The problem is neither to find the minimal nor the most general automaton. Instead, the user should be provided with several appropriate automata from which the user can select, or which help the user to refine the examples given initially. We present the context of our research (\"On-The-Fly Computing\"), present our approach, report results indicating its feasibility, and conclude with a discussion.","lang":"eng"}],"_id":"160","page":"3--9","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","citation":{"chicago":"Rooijen, Lorijn van, and Heiko Hamann. “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm.” In <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>, 3--9, 2016. <a href=\"https://doi.org/10.1109/REW.2016.015\">https://doi.org/10.1109/REW.2016.015</a>.","short":"L. van Rooijen, H. Hamann, in: Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016), 2016, pp. 3--9.","apa":"van Rooijen, L., &#38; Hamann, H. (2016). Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm. In <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i> (pp. 3--9). <a href=\"https://doi.org/10.1109/REW.2016.015\">https://doi.org/10.1109/REW.2016.015</a>","ieee":"L. van Rooijen and H. Hamann, “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm,” in <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>, 2016, pp. 3--9.","ama":"van Rooijen L, Hamann H. Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm. In: <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>. ; 2016:3--9. doi:<a href=\"https://doi.org/10.1109/REW.2016.015\">10.1109/REW.2016.015</a>","bibtex":"@inproceedings{van Rooijen_Hamann_2016, title={Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm}, DOI={<a href=\"https://doi.org/10.1109/REW.2016.015\">10.1109/REW.2016.015</a>}, booktitle={Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)}, author={van Rooijen, Lorijn and Hamann, Heiko}, year={2016}, pages={3--9} }","mla":"van Rooijen, Lorijn, and Heiko Hamann. “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm.” <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>, 2016, pp. 3--9, doi:<a href=\"https://doi.org/10.1109/REW.2016.015\">10.1109/REW.2016.015</a>."},"file_date_updated":"2018-03-21T12:47:21Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"author":[{"full_name":"Leinweber, M.","first_name":"M.","last_name":"Leinweber"},{"full_name":"Fober, T.","first_name":"T.","last_name":"Fober"},{"last_name":"Strickert","first_name":"M.","full_name":"Strickert, M."},{"full_name":"Baumgärtner, L.","last_name":"Baumgärtner","first_name":"L."},{"full_name":"Klebe, G.","first_name":"G.","last_name":"Klebe"},{"last_name":"Freisleben","first_name":"B.","full_name":"Freisleben, B."},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"year":"2016","title":"CavSimBase: A database for large scale comparison of protein binding sites","status":"public","intvolume":"        28","date_updated":"2022-01-06T06:52:42Z","_id":"16041","language":[{"iso":"eng"}],"page":"1423-1434","volume":28,"user_id":"49109","citation":{"ama":"Leinweber M, Fober T, Strickert M, et al. CavSimBase: A database for large scale comparison of protein binding sites. <i>IEEE Transactions on Knowledge and Data Engineering</i>. 2016;28(6):1423-1434.","bibtex":"@article{Leinweber_Fober_Strickert_Baumgärtner_Klebe_Freisleben_Hüllermeier_2016, title={CavSimBase: A database for large scale comparison of protein binding sites}, volume={28}, number={6}, journal={IEEE Transactions on Knowledge and Data Engineering}, author={Leinweber, M. and Fober, T. and Strickert, M. and Baumgärtner, L. and Klebe, G. and Freisleben, B. and Hüllermeier, Eyke}, year={2016}, pages={1423–1434} }","mla":"Leinweber, M., et al. “CavSimBase: A Database for Large Scale Comparison of Protein Binding Sites.” <i>IEEE Transactions on Knowledge and Data Engineering</i>, vol. 28, no. 6, 2016, pp. 1423–34.","short":"M. Leinweber, T. Fober, M. Strickert, L. Baumgärtner, G. Klebe, B. Freisleben, E. Hüllermeier, IEEE Transactions on Knowledge and Data Engineering 28 (2016) 1423–1434.","chicago":"Leinweber, M., T. Fober, M. Strickert, L. Baumgärtner, G. Klebe, B. Freisleben, and Eyke Hüllermeier. “CavSimBase: A Database for Large Scale Comparison of Protein Binding Sites.” <i>IEEE Transactions on Knowledge and Data Engineering</i> 28, no. 6 (2016): 1423–34.","apa":"Leinweber, M., Fober, T., Strickert, M., Baumgärtner, L., Klebe, G., Freisleben, B., &#38; Hüllermeier, E. (2016). CavSimBase: A database for large scale comparison of protein binding sites. <i>IEEE Transactions on Knowledge and Data Engineering</i>, <i>28</i>(6), 1423–1434.","ieee":"M. Leinweber <i>et al.</i>, “CavSimBase: A database for large scale comparison of protein binding sites,” <i>IEEE Transactions on Knowledge and Data Engineering</i>, vol. 28, no. 6, pp. 1423–1434, 2016."},"publication":"IEEE Transactions on Knowledge and Data Engineering","issue":"6","date_created":"2020-02-24T16:04:59Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"type":"journal_article"},{"supervisor":[{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"citation":{"apa":"Kenter, T. (2016). <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn.","ieee":"T. Kenter, <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn, 2016.","short":"T. Kenter, Reconfigurable Accelerators in the World of General-Purpose Computing, Universität Paderborn, 2016.","chicago":"Kenter, Tobias. <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn, 2016.","mla":"Kenter, Tobias. <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn, 2016.","ama":"Kenter T. <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn; 2016.","bibtex":"@book{Kenter_2016, title={Reconfigurable Accelerators in the World of General-Purpose Computing}, publisher={Universität Paderborn}, author={Kenter, Tobias}, year={2016} }"},"file_date_updated":"2018-03-21T12:46:48Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:41:23Z","file":[{"date_created":"2018-03-21T12:46:48Z","creator":"florida","file_id":"1545","success":1,"content_type":"application/pdf","file_name":"161kenter16_diss_submission_print_16-08-26.pdf","file_size":5039555,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T12:46:48Z"}],"department":[{"_id":"27"},{"_id":"518"}],"type":"dissertation","author":[{"id":"3145","last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias"}],"title":"Reconfigurable Accelerators in the World of General-Purpose Computing","status":"public","year":"2016","has_accepted_license":"1","date_updated":"2022-01-06T06:52:43Z","publisher":"Universität Paderborn","_id":"161","ddc":["040"],"user_id":"3145"},{"date_created":"2017-10-17T12:41:23Z","type":"mastersthesis","department":[{"_id":"77"}],"supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"citation":{"bibtex":"@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang, Guangli}, year={2016} }","short":"G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions, Universität Paderborn, 2016.","ama":"Zhang G. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn; 2016.","chicago":"Zhang, Guangli. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016.","ieee":"G. Zhang, <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016.","apa":"Zhang, G. (2016). <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn.","mla":"Zhang, Guangli. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"publisher":"Universität Paderborn","_id":"162","language":[{"iso":"eng"}],"user_id":"15504","status":"public","year":"2016","title":"Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions","author":[{"full_name":"Zhang, Guangli","last_name":"Zhang","first_name":"Guangli"}],"date_updated":"2022-01-06T06:52:45Z"}]