[{"publication_identifier":{"issn":["2329-9290","2329-9304"]},"has_accepted_license":"1","publication_status":"published","page":"576-589","intvolume":"        31","citation":{"ama":"von Neumann T, Kinoshita K, Boeddeker C, Delcroix M, Haeb-Umbach R. Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria. <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>. 2023;31:576-589. doi:<a href=\"https://doi.org/10.1109/taslp.2022.3228629\">10.1109/taslp.2022.3228629</a>","ieee":"T. von Neumann, K. Kinoshita, C. Boeddeker, M. Delcroix, and R. Haeb-Umbach, “Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria,” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, vol. 31, pp. 576–589, 2023, doi: <a href=\"https://doi.org/10.1109/taslp.2022.3228629\">10.1109/taslp.2022.3228629</a>.","chicago":"Neumann, Thilo von, Keisuke Kinoshita, Christoph Boeddeker, Marc Delcroix, and Reinhold Haeb-Umbach. “Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria.” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i> 31 (2023): 576–89. <a href=\"https://doi.org/10.1109/taslp.2022.3228629\">https://doi.org/10.1109/taslp.2022.3228629</a>.","short":"T. von Neumann, K. Kinoshita, C. Boeddeker, M. Delcroix, R. Haeb-Umbach, IEEE/ACM Transactions on Audio, Speech, and Language Processing 31 (2023) 576–589.","bibtex":"@article{von Neumann_Kinoshita_Boeddeker_Delcroix_Haeb-Umbach_2023, title={Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria}, volume={31}, DOI={<a href=\"https://doi.org/10.1109/taslp.2022.3228629\">10.1109/taslp.2022.3228629</a>}, journal={IEEE/ACM Transactions on Audio, Speech, and Language Processing}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={von Neumann, Thilo and Kinoshita, Keisuke and Boeddeker, Christoph and Delcroix, Marc and Haeb-Umbach, Reinhold}, year={2023}, pages={576–589} }","mla":"von Neumann, Thilo, et al. “Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria.” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, vol. 31, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 576–89, doi:<a href=\"https://doi.org/10.1109/taslp.2022.3228629\">10.1109/taslp.2022.3228629</a>.","apa":"von Neumann, T., Kinoshita, K., Boeddeker, C., Delcroix, M., &#38; Haeb-Umbach, R. (2023). Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria. <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, <i>31</i>, 576–589. <a href=\"https://doi.org/10.1109/taslp.2022.3228629\">https://doi.org/10.1109/taslp.2022.3228629</a>"},"oa":"1","date_updated":"2023-11-15T12:16:11Z","volume":31,"author":[{"first_name":"Thilo","id":"49870","full_name":"von Neumann, Thilo","orcid":"https://orcid.org/0000-0002-7717-8670","last_name":"von Neumann"},{"full_name":"Kinoshita, Keisuke","last_name":"Kinoshita","first_name":"Keisuke"},{"id":"40767","full_name":"Boeddeker, Christoph","last_name":"Boeddeker","first_name":"Christoph"},{"first_name":"Marc","last_name":"Delcroix","full_name":"Delcroix, Marc"},{"last_name":"Haeb-Umbach","id":"242","full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold"}],"doi":"10.1109/taslp.2022.3228629","type":"journal_article","status":"public","_id":"35602","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"54"}],"user_id":"49870","article_type":"original","file_date_updated":"2023-01-11T08:50:19Z","quality_controlled":"1","year":"2023","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2023-01-09T17:24:17Z","title":"Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria","publication":"IEEE/ACM Transactions on Audio, Speech, and Language Processing","abstract":[{"text":"Continuous Speech Separation (CSS) has been proposed to address speech overlaps during the analysis of realistic meeting-like conversations by eliminating any overlaps before further processing.\r\nCSS separates a recording of arbitrarily many speakers into a small number of overlap-free output channels, where each output channel may contain speech of multiple speakers.\r\nThis is often done by applying a conventional separation model trained with Utterance-level Permutation Invariant Training (uPIT), which exclusively maps a speaker to an output channel, in sliding window approach called stitching.\r\nRecently, we introduced an alternative training scheme called Graph-PIT that teaches the separation network to directly produce output streams in the required format without stitching.\r\nIt can handle an arbitrary number of speakers as long as never more of them overlap at the same time than the separator has output channels.\r\nIn this contribution, we further investigate the Graph-PIT training scheme.\r\nWe show in extended experiments that models trained with Graph-PIT also work in challenging reverberant conditions.\r\nModels trained in this way are able to perform segment-less CSS, i.e., without stitching, and achieve comparable and often better separation quality than the conventional CSS with uPIT and stitching.\r\nWe simplify the training schedule for Graph-PIT with the recently proposed Source Aggregated Signal-to-Distortion Ratio (SA-SDR) loss.\r\nIt eliminates unfavorable properties of the previously used A-SDR loss and thus enables training with Graph-PIT from scratch.\r\nGraph-PIT training relaxes the constraints w.r.t. the allowed numbers of speakers and speaking patterns which allows using a larger variety of training data.\r\nFurthermore, we introduce novel signal-level evaluation metrics for meeting scenarios, namely the source-aggregated scale- and convolution-invariant Signal-to-Distortion Ratio (SA-SI-SDR and SA-CI-SDR), which are generalizations of the commonly used SDR-based metrics for the CSS case.","lang":"eng"}],"file":[{"date_updated":"2023-01-11T08:50:19Z","date_created":"2023-01-09T17:46:05Z","creator":"haebumb","file_size":7185077,"file_id":"35607","access_level":"open_access","file_name":"main.pdf","content_type":"application/pdf","relation":"main_file"}],"keyword":["Continuous Speech Separation","Source Separation","Graph-PIT","Dynamic Programming","Permutation Invariant Training"],"ddc":["000"],"language":[{"iso":"eng"}]},{"type":"conference","status":"public","file":[{"file_size":1862440,"file_name":"2301.04419.pdf","file_id":"40304","access_level":"open_access","date_updated":"2023-01-26T10:48:40Z","date_created":"2023-01-26T10:48:40Z","creator":"ashwin","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Jupyter notebooks enable developers to interleave code snippets with rich-text and in-line visualizations. Data scientists use Jupyter notebook as the de-facto standard for creating and sharing machine-learning based solutions, primarily written in Python. Recent studies have demonstrated, however, that a large portion of Jupyter notebooks available on public platforms are undocumented and lacks a narrative structure. This reduces the readability of these notebooks. To address this shortcoming, this paper presents HeaderGen, a novel tool-based approach that automatically annotates code cells with categorical markdown headers based on a taxonomy of machine-learning operations, and classifies and displays function calls according to this taxonomy. For this functionality to be realized, HeaderGen enhances an existing call graph analysis in PyCG. To improve precision, HeaderGen extends PyCG's analysis with support for handling external library code and flow-sensitivity. The former is realized by facilitating the resolution of function return-types. Furthermore, HeaderGen uses type information to perform pattern matching on code syntax to annotate code cells.\r\nThe evaluation on 15 real-world Jupyter notebooks from Kaggle shows that HeaderGen's underlying call graph analysis yields high accuracy (96.4% precision and 95.9% recall). This is because HeaderGen can resolve return-types of external libraries where existing type inference tools such as pytype (by Google), pyright (by Microsoft), and Jedi fall short. The header generation has a precision of 82.2% and a recall rate of 96.8% with regard to headers created manually by experts. In a user study, HeaderGen helps participants finish comprehension and navigation tasks faster. All participants clearly perceive HeaderGen as useful to their task."}],"user_id":"15249","_id":"36522","language":[{"iso":"eng"}],"file_date_updated":"2023-01-26T10:48:40Z","keyword":["static analysis","python","code comprehension","annotation","literate programming","jupyter notebook"],"ddc":["000"],"has_accepted_license":"1","citation":{"mla":"Shivarpatna Venkatesh, Ashwin Prasad, et al. <i>Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis</i>. IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023, doi:<a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>.","bibtex":"@inproceedings{Shivarpatna Venkatesh_Wang_Li_Bodden_2023, title={Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>}, publisher={IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering)}, author={Shivarpatna Venkatesh, Ashwin Prasad and Wang, Jiawei and Li, Li and Bodden, Eric}, year={2023} }","short":"A.P. Shivarpatna Venkatesh, J. Wang, L. Li, E. Bodden, in: IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023.","apa":"Shivarpatna Venkatesh, A. P., Wang, J., Li, L., &#38; Bodden, E. (2023). <i>Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis</i>. IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering). <a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">https://doi.org/10.48550/ARXIV.2301.04419</a>","ieee":"A. P. Shivarpatna Venkatesh, J. Wang, L. Li, and E. Bodden, “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis,” presented at the IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023, doi: <a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>.","chicago":"Shivarpatna Venkatesh, Ashwin Prasad, Jiawei Wang, Li Li, and Eric Bodden. “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis.” IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering), 2023. <a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">https://doi.org/10.48550/ARXIV.2301.04419</a>.","ama":"Shivarpatna Venkatesh AP, Wang J, Li L, Bodden E. Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis. In: IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering); 2023. doi:<a href=\"https://doi.org/10.48550/ARXIV.2301.04419\">10.48550/ARXIV.2301.04419</a>"},"year":"2023","date_created":"2023-01-13T08:03:26Z","author":[{"first_name":"Ashwin Prasad","full_name":"Shivarpatna Venkatesh, Ashwin Prasad","id":"66637","last_name":"Shivarpatna Venkatesh"},{"full_name":"Wang, Jiawei","last_name":"Wang","first_name":"Jiawei"},{"full_name":"Li, Li","last_name":"Li","first_name":"Li"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"}],"publisher":"IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering)","date_updated":"2025-04-07T10:18:03Z","oa":"1","doi":"10.48550/ARXIV.2301.04419","conference":{"name":"IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering)"},"title":"Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis"},{"keyword":["Dynamic programming","Exact counting","Sampling","Zero-one knapsack problem"],"language":[{"iso":"eng"}],"publication":"Learning and Intelligent Optimization","abstract":[{"text":"Computing sets of high quality solutions has gained increasing interest in recent years. In this paper, we investigate how to obtain sets of optimal solutions for the classical knapsack problem. We present an algorithm to count exactly the number of optima to a zero-one knapsack problem instance. In addition, we show how to efficiently sample uniformly at random from the set of all global optima. In our experimental study, we investigate how the number of optima develops for classical random benchmark instances dependent on their generator parameters. We find that the number of global optima can increase exponentially for practically relevant classes of instances with correlated weights and profits which poses a justification for the considered exact counting problem.","lang":"eng"}],"publisher":"Springer-Verlag","date_created":"2023-11-14T15:58:54Z","title":"Exact Counting and~Sampling of Optima for the Knapsack Problem","year":"2021","_id":"48855","user_id":"102979","department":[{"_id":"819"}],"extern":"1","type":"conference","status":"public","date_updated":"2023-12-13T10:45:14Z","author":[{"first_name":"Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob"},{"last_name":"Neumann","full_name":"Neumann, Aneta","first_name":"Aneta"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"doi":"10.1007/978-3-030-92121-7_4","publication_status":"published","publication_identifier":{"isbn":["978-3-030-92120-0"]},"place":"Berlin, Heidelberg","citation":{"ama":"Bossek J, Neumann A, Neumann F. Exact Counting and~Sampling of Optima for the Knapsack Problem. In: <i>Learning and Intelligent Optimization</i>. Springer-Verlag; 2021:40–54. doi:<a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>","chicago":"Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Exact Counting And~Sampling of Optima for the Knapsack Problem.” In <i>Learning and Intelligent Optimization</i>, 40–54. Berlin, Heidelberg: Springer-Verlag, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">https://doi.org/10.1007/978-3-030-92121-7_4</a>.","ieee":"J. Bossek, A. Neumann, and F. Neumann, “Exact Counting and~Sampling of Optima for the Knapsack Problem,” in <i>Learning and Intelligent Optimization</i>, 2021, pp. 40–54, doi: <a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>.","mla":"Bossek, Jakob, et al. “Exact Counting And~Sampling of Optima for the Knapsack Problem.” <i>Learning and Intelligent Optimization</i>, Springer-Verlag, 2021, pp. 40–54, doi:<a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>.","short":"J. Bossek, A. Neumann, F. Neumann, in: Learning and Intelligent Optimization, Springer-Verlag, Berlin, Heidelberg, 2021, pp. 40–54.","bibtex":"@inproceedings{Bossek_Neumann_Neumann_2021, place={Berlin, Heidelberg}, title={Exact Counting and~Sampling of Optima for the Knapsack Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">10.1007/978-3-030-92121-7_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer-Verlag}, author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={40–54} }","apa":"Bossek, J., Neumann, A., &#38; Neumann, F. (2021). Exact Counting and~Sampling of Optima for the Knapsack Problem. <i>Learning and Intelligent Optimization</i>, 40–54. <a href=\"https://doi.org/10.1007/978-3-030-92121-7_4\">https://doi.org/10.1007/978-3-030-92121-7_4</a>"},"page":"40–54"},{"status":"public","type":"conference","department":[{"_id":"153"}],"user_id":"36303","series_title":"VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems","_id":"24159","project":[{"_id":"688","name":"Pilotprojekt \"Schlosskreuzung\""}],"intvolume":"         7","page":"386-395","citation":{"apa":"Malena, K., Link, C., Mertin, S., Gausemeier, S., &#38; Trächtler, A. (2021). Online State Estimation for Microscopic Traffic Simulations using Multiple Data Sources*. <i>VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems</i>, <i>7</i>, 386–395.","mla":"Malena, Kevin, et al. “Online State Estimation for Microscopic Traffic Simulations Using Multiple Data Sources*.” <i>VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems</i>, vol. 7, SCITEPRESS, 2021, pp. 386–95.","short":"K. Malena, C. Link, S. Mertin, S. Gausemeier, A. Trächtler, in: VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems, SCITEPRESS, Portugal, 2021, pp. 386–395.","bibtex":"@inproceedings{Malena_Link_Mertin_Gausemeier_Trächtler_2021, place={Portugal}, series={VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems}, title={Online State Estimation for Microscopic Traffic Simulations using Multiple Data Sources*}, volume={7}, booktitle={VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems}, publisher={SCITEPRESS}, author={Malena, Kevin and Link, Christopher and Mertin, Sven and Gausemeier, Sandra and Trächtler, Ansgar}, year={2021}, pages={386–395}, collection={VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems} }","chicago":"Malena, Kevin, Christopher Link, Sven Mertin, Sandra Gausemeier, and Ansgar Trächtler. “Online State Estimation for Microscopic Traffic Simulations Using Multiple Data Sources*.” In <i>VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems</i>, 7:386–95. VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems. Portugal: SCITEPRESS, 2021.","ieee":"K. Malena, C. Link, S. Mertin, S. Gausemeier, and A. Trächtler, “Online State Estimation for Microscopic Traffic Simulations using Multiple Data Sources*,” in <i>VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems</i>, Online Streaming, 2021, vol. 7, pp. 386–395.","ama":"Malena K, Link C, Mertin S, Gausemeier S, Trächtler A. Online State Estimation for Microscopic Traffic Simulations using Multiple Data Sources*. In: <i>VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems</i>. Vol 7. VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems. SCITEPRESS; 2021:386-395."},"place":"Portugal","related_material":{"record":[{"status":"public","id":"33849","relation":"is_continued_by"}],"link":[{"relation":"confirmation","url":"https://www.scitepress.org/PublicationsDetail.aspx?ID=3xZWfOSENWk=&t=1"}]},"publication_identifier":{"isbn":["978-989-758-513-5"]},"publication_status":"published","conference":{"name":"7th International Conference on Vehicle Technology and Intelligent Transport Systems","start_date":"2021-04-28","end_date":"2021-04-30","location":"Online Streaming"},"main_file_link":[{"url":"https://www.scitepress.org/PublicationsDetail.aspx?ID=3xZWfOSENWk=&t=1"}],"volume":7,"author":[{"first_name":"Kevin","id":"36303","full_name":"Malena, Kevin","last_name":"Malena","orcid":"0000-0003-1183-4679"},{"first_name":"Christopher","last_name":"Link","full_name":"Link, Christopher","id":"38249"},{"first_name":"Sven","id":"13195","full_name":"Mertin, Sven","last_name":"Mertin"},{"id":"17793","full_name":"Gausemeier, Sandra","last_name":"Gausemeier","first_name":"Sandra"},{"last_name":"Trächtler","full_name":"Trächtler, Ansgar","id":"552","first_name":"Ansgar"}],"date_updated":"2026-01-26T08:49:53Z","abstract":[{"text":"The online fitting of a microscopic traffic simulation model to reconstruct the current state of a real traffic\r\narea can be challenging depending on the provided data. This paper presents a novel method based on limited\r\ndata from sensors positioned at specific locations and guarantees a general accordance of reality and\r\nsimulation in terms of multimodal road traffic counts and vehicle speeds. In these considerations, the actual\r\npurpose of research is of particular importance. Here, the research aims at improving the traffic flow by\r\ncontrolling the Traffic Light Systems (TLS) of the examined area which is why the current traffic state and\r\nthe route choices of individual road users are the matter of interest. An integer optimization problem is derived\r\nto fit the current simulation to the latest field measurements. The concept can be transferred to any road traffic\r\nnetwork and results in an observation of the current multimodal traffic state matching at the given sensor\r\nposition. First case studies show promosing results in terms of deviations between reality and simulation.","lang":"eng"}],"publication":"VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems","language":[{"iso":"eng"}],"keyword":["Microscopic Traffic Simulation","Online State Estimation","Mixed Road Users","Sensor Fusion","Integer Programming","Route Choice","Vehicle2Infrastructure"],"year":"2021","quality_controlled":"1","title":"Online State Estimation for Microscopic Traffic Simulations using Multiple Data Sources*","date_created":"2021-09-10T12:19:14Z","publisher":"SCITEPRESS"},{"type":"conference","publication":"Combinatorial Optimization and Applications","status":"public","editor":[{"first_name":"Donghyun","last_name":"Kim","full_name":"Kim, Donghyun"},{"last_name":"Uma","full_name":"Uma, R. N.","first_name":"R. N."},{"full_name":"Zelikovsky, Alexander","last_name":"Zelikovsky","first_name":"Alexander"}],"abstract":[{"lang":"eng","text":"Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\\$}{\\$}2 {\\backslash}sqrt{\\{} 2{\\backslash}left| E {\\backslash}right| {\\}}{\\$}{\\$}and {\\$}{\\$}2 {\\backslash}sqrt{\\{}2 ({\\backslash}left| E {\\backslash}right| + {\\backslash}left| {\\backslash}text {\\{}undesirable flows{\\}} {\\backslash}right| ){\\}}{\\$}{\\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming."}],"user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17651","language":[{"iso":"eng"}],"extern":"1","keyword":["flow","Red-Blue Set Cover","Positive-Negative Partial Set Cover","approximation","tree","MAX SNP-hard","root","leaf","dynamic programming","FPT"],"publication_identifier":{"isbn":["978-3-030-04651-4"]},"citation":{"chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in <i>Combinatorial Optimization and Applications</i>, 2018, pp. 217–232.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. <i>Combinatorial Optimization and Applications</i>. Cham: Springer International Publishing; 2018:217-232.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, &#38; A. Zelikovsky (Eds.), <i>Combinatorial Optimization and Applications</i> (pp. 217–232). Cham: Springer International Publishing.","mla":"Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }"},"page":"217-232","year":"2018","place":"Cham","date_created":"2020-08-06T15:19:36Z","author":[{"first_name":"Gleb","last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb"},{"full_name":"Trajanovski, Stojan","last_name":"Trajanovski","first_name":"Stojan"},{"last_name":"Grosso","full_name":"Grosso, Paola","first_name":"Paola"},{"last_name":"de Laat","full_name":"de Laat, Cees","first_name":"Cees"}],"date_updated":"2022-01-06T06:53:16Z","publisher":"Springer International Publishing","title":"Removing Undesirable Flows by Edge Deletion"},{"user_id":"61579","department":[{"_id":"277"}],"_id":"5675","language":[{"iso":"eng"}],"file_date_updated":"2018-12-13T15:05:44Z","extern":"1","ddc":["000"],"keyword":["Coordination of spontaneous volunteers","volunteer coordination system","decision support","scheduling optimization model","linear programming"],"type":"conference","publication":"Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management","file":[{"file_size":488472,"file_name":"2018_ISCRAM_Conference_Proceedings - Publication Version.pdf","access_level":"open_access","file_id":"6020","date_updated":"2018-12-13T15:05:44Z","date_created":"2018-12-07T11:25:06Z","creator":"hsiemes","relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"text":"When responding to natural disasters, professional relief units are often supported by many volunteers which are not affiliated to humanitarian organizations. The effective coordination of these volunteers is crucial to leverage their capabilities and to avoid conflicts with professional relief units. In this paper, we empirically identify key requirements that professional relief units pose on this coordination. Based on these requirements, we suggest a decision model. We computationally solve a real-world instance of the model and empirically validate the computed solution in interviews with practitioners. Our results show that the suggested model allows for solving volunteer coordination tasks of realistic size near-optimally within short time, with the determined solution being well accepted by practitioners. We also describe in this article how the suggested decision support model is integrated in the volunteer coordination system which we develop in joint cooperation with a disaster management authority and a software development company.","lang":"eng"}],"author":[{"last_name":"Rauchecker","full_name":"Rauchecker, Gerhard","first_name":"Gerhard"},{"first_name":"Guido","last_name":"Schryen","full_name":"Schryen, Guido","id":"72850"}],"date_created":"2018-11-14T15:35:54Z","oa":"1","date_updated":"2022-01-06T07:02:28Z","conference":{"location":"Rochester, NY, USA","name":"15th International Conference on Information Systems for Crisis Response and Management"},"title":"Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief","has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Rauchecker_Schryen_2018, title={Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief}, booktitle={Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2018} }","mla":"Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief.” <i>Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management</i>, 2018.","short":"G. Rauchecker, G. Schryen, in: Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, 2018.","apa":"Rauchecker, G., &#38; Schryen, G. (2018). Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief. In <i>Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management</i>. Rochester, NY, USA.","ama":"Rauchecker G, Schryen G. Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief. In: <i>Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management</i>. ; 2018.","chicago":"Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief.” In <i>Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management</i>, 2018.","ieee":"G. Rauchecker and G. Schryen, “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief,” in <i>Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management</i>, Rochester, NY, USA, 2018."},"year":"2018"},{"publication_identifier":{"unknown":["978-3-95977-086-6"]},"publication_status":"published","page":"58:1-58:16","intvolume":"       117","citation":{"apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>","bibtex":"@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 58:1-58:16.","mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>.","ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>"},"place":"Dagstuhl, Germany","volume":117,"author":[{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","id":"71541","full_name":"Gharibian, Sevag","first_name":"Sevag"},{"first_name":"Miklos","full_name":"Santha, Miklos","last_name":"Santha"},{"first_name":"Jamie","full_name":"Sikora, Jamie","last_name":"Sikora"},{"first_name":"Aarthi","full_name":"Sundaram, Aarthi","last_name":"Sundaram"},{"full_name":"Yirka, Justin","last_name":"Yirka","first_name":"Justin"}],"oa":"1","date_updated":"2023-02-28T11:01:03Z","doi":"10.4230/LIPIcs.MFCS.2018.58","conference":{"name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","location":"Liverpool, UK"},"main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640"}],"type":"conference","status":"public","editor":[{"full_name":"Potapov, Igor","last_name":"Potapov","first_name":"Igor"},{"full_name":"Spirakis, Paul","last_name":"Spirakis","first_name":"Paul"},{"first_name":"James","full_name":"Worrell, James","last_name":"Worrell"}],"department":[{"_id":"623"},{"_id":"7"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"71541","_id":"8161","year":"2018","date_created":"2019-03-01T11:29:44Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","title":"Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)","publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","abstract":[{"text":"The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs \"equivalent\"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of \"unentanglement\"), QMA(2) is strictly contained in NEXP.","lang":"eng"}],"external_id":{"arxiv":["1805.11139"]},"language":[{"iso":"eng"}],"keyword":["Complexity Theory","Quantum Computing","Polynomial Hierarchy","Semidefinite Programming","QMA(2)","Quantum Complexity"]},{"status":"public","abstract":[{"text":"Safety-critical automotive systems must fulfill hard real-time constraints for reliability and safety. This paper presents a case study for the application of an AUTOSAR-based language for timing modeling and analysis. We present and apply the Timing Augmented Description Language (TADL) and demonstrate a methodology for the development of a speed-adaptive steer-by-wire system. We examine the impact of TADL and the methodology on the development process and the suitability and interoperability of the applied tools with respect to the AUTOSAR-based tool chain in the context of our case study.","lang":"eng"}],"type":"conference","publication":"Proceedings of DATE’10, Dresden","language":[{"iso":"eng"}],"keyword":["Timing","Programming","Automotive engineering","Application software","Hardware","Computer architecture","Communication system software","Software architecture","Delay","Software standards"],"user_id":"5786","department":[{"_id":"672"}],"_id":"37011","citation":{"chicago":"Klobedanz, Kay, Christoph Kuznik, Andre Thuy, and Wolfgang Müller. “Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study.” In <i>Proceedings of DATE’10, Dresden</i>. Dresden: IEEE, 2010. <a href=\"https://doi.org/10.1109/DATE.2010.5457125\">https://doi.org/10.1109/DATE.2010.5457125</a>.","ieee":"K. Klobedanz, C. Kuznik, A. Thuy, and W. Müller, “Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study,” presented at the 2010 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE 2010), Dresden, 2010, doi: <a href=\"https://doi.org/10.1109/DATE.2010.5457125\">10.1109/DATE.2010.5457125</a>.","ama":"Klobedanz K, Kuznik C, Thuy A, Müller W. Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study. In: <i>Proceedings of DATE’10, Dresden</i>. IEEE; 2010. doi:<a href=\"https://doi.org/10.1109/DATE.2010.5457125\">10.1109/DATE.2010.5457125</a>","apa":"Klobedanz, K., Kuznik, C., Thuy, A., &#38; Müller, W. (2010). Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study. <i>Proceedings of DATE’10, Dresden</i>. 2010 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE 2010), Dresden. <a href=\"https://doi.org/10.1109/DATE.2010.5457125\">https://doi.org/10.1109/DATE.2010.5457125</a>","mla":"Klobedanz, Kay, et al. “Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study.” <i>Proceedings of DATE’10, Dresden</i>, IEEE, 2010, doi:<a href=\"https://doi.org/10.1109/DATE.2010.5457125\">10.1109/DATE.2010.5457125</a>.","short":"K. Klobedanz, C. Kuznik, A. Thuy, W. Müller, in: Proceedings of DATE’10, Dresden, IEEE, Dresden, 2010.","bibtex":"@inproceedings{Klobedanz_Kuznik_Thuy_Müller_2010, place={Dresden}, title={Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study}, DOI={<a href=\"https://doi.org/10.1109/DATE.2010.5457125\">10.1109/DATE.2010.5457125</a>}, booktitle={Proceedings of DATE’10, Dresden}, publisher={IEEE}, author={Klobedanz, Kay and Kuznik, Christoph and Thuy, Andre and Müller, Wolfgang}, year={2010} }"},"place":"Dresden","year":"2010","conference":{"name":"2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)","location":"Dresden"},"doi":"10.1109/DATE.2010.5457125","title":"Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study","author":[{"full_name":"Klobedanz, Kay","last_name":"Klobedanz","first_name":"Kay"},{"full_name":"Kuznik, Christoph","last_name":"Kuznik","first_name":"Christoph"},{"last_name":"Thuy","full_name":"Thuy, Andre","first_name":"Andre"},{"last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang"}],"date_created":"2023-01-17T09:19:36Z","publisher":"IEEE","date_updated":"2023-01-17T09:19:46Z"},{"title":"A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement","doi":"10.1007/978-3-642-15234-4_15","conference":{"name":"IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES 2010)"},"publisher":"Springer Verlag","date_updated":"2023-01-17T11:03:00Z","author":[{"last_name":"Becker","full_name":"Becker, Markus","first_name":"Markus"},{"first_name":"Henning","last_name":"Zabel","full_name":"Zabel, Henning"},{"last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang"}],"date_created":"2023-01-17T11:01:30Z","place":"Dordrecht","year":"2010","citation":{"ama":"Becker M, Zabel H, Müller W. A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement. In: Kleinjohann L, Kleinjohann B, eds. Springer Verlag; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-15234-4_15\">10.1007/978-3-642-15234-4_15</a>","chicago":"Becker, Markus, Henning Zabel, and Wolfgang Müller. “A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement.” edited by L. Kleinjohann and B. Kleinjohann. Dordrecht: Springer Verlag, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15234-4_15\">https://doi.org/10.1007/978-3-642-15234-4_15</a>.","ieee":"M. Becker, H. Zabel, and W. Müller, “A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement,” 2010, doi: <a href=\"https://doi.org/10.1007/978-3-642-15234-4_15\">10.1007/978-3-642-15234-4_15</a>.","apa":"Becker, M., Zabel, H., &#38; Müller, W. (2010). <i>A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement</i> (L. Kleinjohann &#38; B. Kleinjohann, Eds.). Springer Verlag. <a href=\"https://doi.org/10.1007/978-3-642-15234-4_15\">https://doi.org/10.1007/978-3-642-15234-4_15</a>","bibtex":"@inproceedings{Becker_Zabel_Müller_2010, place={Dordrecht}, title={A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15234-4_15\">10.1007/978-3-642-15234-4_15</a>}, publisher={Springer Verlag}, author={Becker, Markus and Zabel, Henning and Müller, Wolfgang}, editor={Kleinjohann, L. and Kleinjohann, B.}, year={2010} }","short":"M. Becker, H. Zabel, W. Müller, in: L. Kleinjohann, B. Kleinjohann (Eds.), Springer Verlag, Dordrecht, 2010.","mla":"Becker, Markus, et al. <i>A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement</i>. Edited by L. Kleinjohann and B. Kleinjohann, Springer Verlag, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-15234-4_15\">10.1007/978-3-642-15234-4_15</a>."},"publication_identifier":{"isbn":["978-3-642-15233-7"]},"keyword":["Application Programming Interface     User Mode     Kernel Space     System Level Design     Mixed Level"],"language":[{"iso":"eng"}],"_id":"37046","department":[{"_id":"672"}],"user_id":"5786","editor":[{"first_name":"L.","full_name":"Kleinjohann, L.","last_name":"Kleinjohann"},{"first_name":"B.","full_name":"Kleinjohann, B.","last_name":"Kleinjohann"}],"abstract":[{"text":"In this article, we present a flexible simulation environment for embedded real-time software refinement by a mixed level cosimulation. For this, we combine the native speed of an abstract real-time operating system (RTOS) model in SystemC with dynamic binary translation for fast Instruction Set Simulation (ISS) by QEMU. In order to support stepwise RTOS software refinement from system level to the target software, each task can be separately migrated between the native execution and the ISS. By adapting the dynamic binary translation approach to an efficient but yet very accurate synchronization scheme the overhead of QEMU user mode execution is only factor two compared to native SystemC. Furthermore, the simulation speed increases almost linearly according to the utilization of the task set abstracted by the native execution. Hereby, the simulation time can be considerably reduced by cosimulating just a subset of tasks on QEMU.","lang":"eng"}],"status":"public","type":"conference"},{"title":"MOVES: A Modular Framework for Hardware Evolution","doi":"10.1109/ahs.2007.73","conference":{"name":"Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)","start_date":"2007-08-05","end_date":"2007-08-08","location":"Edinburgh, UK"},"publisher":"IEEE","date_updated":"2022-01-06T07:03:08Z","author":[{"full_name":"Kaufmann, Paul","last_name":"Kaufmann","first_name":"Paul"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_created":"2019-01-08T09:52:43Z","year":"2007","page":"447-454","citation":{"ama":"Kaufmann P, Platzner M. MOVES: A Modular Framework for Hardware Evolution. In: <i>Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)</i>. IEEE; 2007:447-454. doi:<a href=\"https://doi.org/10.1109/ahs.2007.73\">10.1109/ahs.2007.73</a>","ieee":"P. Kaufmann and M. Platzner, “MOVES: A Modular Framework for Hardware Evolution,” in <i>Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)</i>, Edinburgh, UK, 2007, pp. 447–454.","chicago":"Kaufmann, Paul, and Marco Platzner. “MOVES: A Modular Framework for Hardware Evolution.” In <i>Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)</i>, 447–54. IEEE, 2007. <a href=\"https://doi.org/10.1109/ahs.2007.73\">https://doi.org/10.1109/ahs.2007.73</a>.","apa":"Kaufmann, P., &#38; Platzner, M. (2007). MOVES: A Modular Framework for Hardware Evolution. In <i>Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)</i> (pp. 447–454). Edinburgh, UK: IEEE. <a href=\"https://doi.org/10.1109/ahs.2007.73\">https://doi.org/10.1109/ahs.2007.73</a>","mla":"Kaufmann, Paul, and Marco Platzner. “MOVES: A Modular Framework for Hardware Evolution.” <i>Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)</i>, IEEE, 2007, pp. 447–54, doi:<a href=\"https://doi.org/10.1109/ahs.2007.73\">10.1109/ahs.2007.73</a>.","short":"P. Kaufmann, M. Platzner, in: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007), IEEE, 2007, pp. 447–454.","bibtex":"@inproceedings{Kaufmann_Platzner_2007, title={MOVES: A Modular Framework for Hardware Evolution}, DOI={<a href=\"https://doi.org/10.1109/ahs.2007.73\">10.1109/ahs.2007.73</a>}, booktitle={Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)}, publisher={IEEE}, author={Kaufmann, Paul and Platzner, Marco}, year={2007}, pages={447–454} }"},"publication_identifier":{"isbn":["076952866X","9780769528663"]},"publication_status":"published","keyword":["integrated circuit design","hardware evolution","evolutionary hardware design","evolutionary optimizers","hash functions","preengineered circuits","Hardware","Circuits","Design optimization","Visualization","Genetic programming","Genetic mutations","Clustering algorithms","Biological cells","Field programmable gate arrays","Routing"],"language":[{"iso":"eng"}],"_id":"6508","department":[{"_id":"78"}],"user_id":"3118","abstract":[{"text":"In this paper, we present a framework that supports experimenting with evolutionary hardware design. We describe the framework's modules for composing evolutionary optimizers and for setting up, controlling, and analyzing experiments. Two case studies demonstrate the usefulness of the framework: evolution of hash functions and evolution based on pre-engineered circuits.","lang":"eng"}],"status":"public","publication":"Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)","type":"conference"},{"publication":"Proceedings of VL/HCC 05","type":"conference","status":"public","abstract":[{"text":"Executable UML models are nowadays gaining interest in embedded systems design. This domain is strongly devoted to the modeling of reactive behavior using StateChart variants. In this context, the direct execution of UML state machines is an interesting alternative to native code generation approaches since it significantly increases portability. However, fully featured UML 2.0 State Machines may contain a broad set of features with complex execution semantics that differ significantly from other StateChart variants. This makes their direct execution complex and inefficient. In this paper, we demonstrate how such state machines can be represented using a small subset of the UML state machine features that enables efficient execution. We describe the necessary model transformations in terms of graph transformations and discuss the underlying semantics and implications for execution.","lang":"eng"}],"department":[{"_id":"672"}],"user_id":"5786","_id":"39032","language":[{"iso":"eng"}],"keyword":["Unified modeling language","Software design","Virtual machining","Embedded system","Programming","Documentation","Hardware","Computer languages","Operating systems","Runtime"],"publication_identifier":{"isbn":["0-7695-2443-5"]},"citation":{"bibtex":"@inproceedings{Schattkowsky_Müller_2005, place={Dallas, TX, USA}, title={Transformation of UML State Machines for Direct Execution}, DOI={<a href=\"https://doi.org/10.1109/VLHCC.2005.64\">10.1109/VLHCC.2005.64</a>}, booktitle={Proceedings of VL/HCC 05}, author={Schattkowsky, Tim and Müller, Wolfgang}, year={2005} }","mla":"Schattkowsky, Tim, and Wolfgang Müller. “Transformation of UML State Machines for Direct Execution.” <i>Proceedings of VL/HCC 05</i>, 2005, doi:<a href=\"https://doi.org/10.1109/VLHCC.2005.64\">10.1109/VLHCC.2005.64</a>.","short":"T. Schattkowsky, W. Müller, in: Proceedings of VL/HCC 05, Dallas, TX, USA, 2005.","apa":"Schattkowsky, T., &#38; Müller, W. (2005). Transformation of UML State Machines for Direct Execution. <i>Proceedings of VL/HCC 05</i>. <a href=\"https://doi.org/10.1109/VLHCC.2005.64\">https://doi.org/10.1109/VLHCC.2005.64</a>","ama":"Schattkowsky T, Müller W. Transformation of UML State Machines for Direct Execution. In: <i>Proceedings of VL/HCC 05</i>. ; 2005. doi:<a href=\"https://doi.org/10.1109/VLHCC.2005.64\">10.1109/VLHCC.2005.64</a>","ieee":"T. Schattkowsky and W. Müller, “Transformation of UML State Machines for Direct Execution,” 2005, doi: <a href=\"https://doi.org/10.1109/VLHCC.2005.64\">10.1109/VLHCC.2005.64</a>.","chicago":"Schattkowsky, Tim, and Wolfgang Müller. “Transformation of UML State Machines for Direct Execution.” In <i>Proceedings of VL/HCC 05</i>. Dallas, TX, USA, 2005. <a href=\"https://doi.org/10.1109/VLHCC.2005.64\">https://doi.org/10.1109/VLHCC.2005.64</a>."},"year":"2005","place":"Dallas, TX, USA","author":[{"last_name":"Schattkowsky","full_name":"Schattkowsky, Tim","first_name":"Tim"},{"first_name":"Wolfgang","id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller"}],"date_created":"2023-01-24T08:18:10Z","date_updated":"2023-01-24T08:18:27Z","doi":"10.1109/VLHCC.2005.64","title":"Transformation of UML State Machines for Direct Execution"},{"title":"Specification of Real-Time Properties for UML Models","conference":{"name":"Proceedings of the 35th Annual Hawaii International Conference on System Sciences","location":"Big Island, HI, USA "},"doi":"10.1109/HICSS.2002.994469","date_updated":"2023-01-24T10:22:16Z","author":[{"first_name":"Stephan","last_name":"Flake","full_name":"Flake, Stephan"},{"first_name":"Wolfgang","id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller"}],"date_created":"2023-01-24T10:22:12Z","place":"Big Island, HI, USA ","year":"2002","citation":{"ieee":"S. Flake and W. Müller, “Specification of Real-Time Properties for UML Models,” presented at the Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Big Island, HI, USA , 2002, doi: <a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>.","chicago":"Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties for UML Models.” In <i>Proceedings of HICSS-35</i>. Big Island, HI, USA , 2002. <a href=\"https://doi.org/10.1109/HICSS.2002.994469\">https://doi.org/10.1109/HICSS.2002.994469</a>.","ama":"Flake S, Müller W. Specification of Real-Time Properties for UML Models. In: <i>Proceedings of HICSS-35</i>. ; 2002. doi:<a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>","apa":"Flake, S., &#38; Müller, W. (2002). Specification of Real-Time Properties for UML Models. <i>Proceedings of HICSS-35</i>. Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Big Island, HI, USA . <a href=\"https://doi.org/10.1109/HICSS.2002.994469\">https://doi.org/10.1109/HICSS.2002.994469</a>","mla":"Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties for UML Models.” <i>Proceedings of HICSS-35</i>, 2002, doi:<a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>.","bibtex":"@inproceedings{Flake_Müller_2002, place={Big Island, HI, USA }, title={Specification of Real-Time Properties for UML Models}, DOI={<a href=\"https://doi.org/10.1109/HICSS.2002.994469\">10.1109/HICSS.2002.994469</a>}, booktitle={Proceedings of HICSS-35}, author={Flake, Stephan and Müller, Wolfgang}, year={2002} }","short":"S. Flake, W. Müller, in: Proceedings of HICSS-35, Big Island, HI, USA , 2002."},"publication_identifier":{"isbn":["0-7695-1435-9"]},"keyword":["Unified modeling language","Logic","Formal verification","Real time systems","Programming profession","Vehicle dynamics","Software standards","Flexible manufacturing systems","Electronics industry","Protocols"],"language":[{"iso":"eng"}],"_id":"39403","department":[{"_id":"672"}],"user_id":"5786","abstract":[{"text":"The Unified Modeling Language (UML) has received wide acceptance as a standard language in the field of software specification by means of different diagram types. In a recent version of UML, the textual Object Constraint Language (OCL) was introduced to support specification of constraints for UML models. But OCL currently does not provide sufficient means to specify constraints over the dynamic behavior of a model. This article presents an OCL extension that is consistent with current OCL and enables modelers to specify state-related time-bounded constraints. We consider the case study of a flexible manufacturing system and identify typical real-time constraints. The constraints are presented in our temporal OCL extension as well as in temporal logic formulae. For general application, we define a semantics of our OCL extension by means of a time-bounded temporal logic based on Computational Tree Logic (CTL).","lang":"eng"}],"status":"public","publication":"Proceedings of HICSS-35","type":"conference"},{"title":"A Language for the Rapid Prototyping of Mobile Evolving Agents","doi":"10.1109/HICSS.2001.926319","date_updated":"2023-01-24T10:48:14Z","author":[{"first_name":"Wolfgang","last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang"},{"last_name":"Meyer","full_name":"Meyer, A.","first_name":"A."},{"first_name":"Henning","last_name":"Zabel","full_name":"Zabel, Henning"}],"date_created":"2023-01-24T10:48:09Z","year":"2001","place":"Maui, HI, USA ","citation":{"ama":"Müller W, Meyer A, Zabel H. A Language for the Rapid Prototyping of Mobile Evolving Agents. In: <i>Proceedings of the 34th Annual Hawaii International Conference on System Sciences</i>. ; 2001. doi:<a href=\"https://doi.org/10.1109/HICSS.2001.926319\">10.1109/HICSS.2001.926319</a>","ieee":"W. Müller, A. Meyer, and H. Zabel, “A Language for the Rapid Prototyping of Mobile Evolving Agents,” 2001, doi: <a href=\"https://doi.org/10.1109/HICSS.2001.926319\">10.1109/HICSS.2001.926319</a>.","chicago":"Müller, Wolfgang, A. Meyer, and Henning Zabel. “A Language for the Rapid Prototyping of Mobile Evolving Agents.” In <i>Proceedings of the 34th Annual Hawaii International Conference on System Sciences</i>. Maui, HI, USA , 2001. <a href=\"https://doi.org/10.1109/HICSS.2001.926319\">https://doi.org/10.1109/HICSS.2001.926319</a>.","mla":"Müller, Wolfgang, et al. “A Language for the Rapid Prototyping of Mobile Evolving Agents.” <i>Proceedings of the 34th Annual Hawaii International Conference on System Sciences</i>, 2001, doi:<a href=\"https://doi.org/10.1109/HICSS.2001.926319\">10.1109/HICSS.2001.926319</a>.","short":"W. Müller, A. Meyer, H. Zabel, in: Proceedings of the 34th Annual Hawaii International Conference on System Sciences, Maui, HI, USA , 2001.","bibtex":"@inproceedings{Müller_Meyer_Zabel_2001, place={Maui, HI, USA }, title={A Language for the Rapid Prototyping of Mobile Evolving Agents}, DOI={<a href=\"https://doi.org/10.1109/HICSS.2001.926319\">10.1109/HICSS.2001.926319</a>}, booktitle={Proceedings of the 34th Annual Hawaii International Conference on System Sciences}, author={Müller, Wolfgang and Meyer, A. and Zabel, Henning}, year={2001} }","apa":"Müller, W., Meyer, A., &#38; Zabel, H. (2001). A Language for the Rapid Prototyping of Mobile Evolving Agents. <i>Proceedings of the 34th Annual Hawaii International Conference on System Sciences</i>. <a href=\"https://doi.org/10.1109/HICSS.2001.926319\">https://doi.org/10.1109/HICSS.2001.926319</a>"},"publication_identifier":{"isbn":["0-7695-0981-9"]},"keyword":["software prototyping","distributed programming","authoring languages","software agents","program visualisation","parallel languages"],"language":[{"iso":"eng"}],"_id":"39432","department":[{"_id":"672"}],"user_id":"5786","abstract":[{"text":"This article presents SAL, a general purpose scripting language for the rapid development of distributed software agents seamlessly embedded in a visual environment. Integrated facilities for dynamic visualization provide sample but powerful means for debugging and domain-oriented animation. SAL agents are arranged on a set of 2D worksheets which can be distributed over different machines. An agent's program is defined by the means of a table specifying a set of state transition rules with a condition and a sequence of actions each. Beyond basic computation and communication, actions can dynamically modify the agent's depiction, its program, and spawn arbitrary processes. A couple of examples demonstrate SAL's applicability in various domains like electronic systems design and process management.","lang":"eng"}],"status":"public","publication":"Proceedings of the 34th Annual Hawaii International Conference on System Sciences","type":"conference"},{"publication":"Proceedings of the IEEE Symposium on Visual Languages","type":"conference","abstract":[{"text":"This article presents the animated visual 3D programming language SAM (Solid Agents in Motion) for parallel systems specification and animation. A SAM program is a set of interacting agents synchronously exchanging messages. The agent's behaviour is specified by means of production rules with a condition and a sequence of actions each. Actions are linearly ordered and execute when matching a rule. In SAM, main syntactic objects like agents, rules, and messages are 3D. These objects can have an abstract and a concrete, solid 3D presentation. While the abstract representation is for programming and debugging, the concrete representation is for animated 3D end-user presentations. After outlining the concepts of SAM this article gives two programming examples of 3D micro worlds and an overview of the programming environment.","lang":"eng"}],"status":"public","_id":"39493","department":[{"_id":"672"}],"user_id":"5786","keyword":["Animation","Computer languages","Solids","Concrete","Application software","Virtual reality","Programming profession","Switches","Visualization","Debugging"],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0-8186-8712-6"]},"year":"1998","place":"Halifax, Canada","citation":{"bibtex":"@inproceedings{Geiger_Müller_Rosenbach_1998, place={Halifax, Canada}, title={SAM - An Animated 3D Programming Language}, DOI={<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>}, booktitle={Proceedings of the IEEE Symposium on Visual Languages}, author={Geiger, Christian and Müller, Wolfgang and Rosenbach, W.}, year={1998} }","short":"C. Geiger, W. Müller, W. Rosenbach, in: Proceedings of the IEEE Symposium on Visual Languages, Halifax, Canada, 1998.","mla":"Geiger, Christian, et al. “SAM - An Animated 3D Programming Language.” <i>Proceedings of the IEEE Symposium on Visual Languages</i>, 1998, doi:<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>.","apa":"Geiger, C., Müller, W., &#38; Rosenbach, W. (1998). SAM - An Animated 3D Programming Language. <i>Proceedings of the IEEE Symposium on Visual Languages</i>. 1998 IEEE Symposium on Visual Languages, Halifax, Canada. <a href=\"https://doi.org/10.1109/VL.1998.706167\">https://doi.org/10.1109/VL.1998.706167</a>","ama":"Geiger C, Müller W, Rosenbach W. SAM - An Animated 3D Programming Language. In: <i>Proceedings of the IEEE Symposium on Visual Languages</i>. ; 1998. doi:<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>","ieee":"C. Geiger, W. Müller, and W. Rosenbach, “SAM - An Animated 3D Programming Language,” presented at the 1998 IEEE Symposium on Visual Languages, Halifax, Canada, 1998, doi: <a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>.","chicago":"Geiger, Christian, Wolfgang Müller, and W. Rosenbach. “SAM - An Animated 3D Programming Language.” In <i>Proceedings of the IEEE Symposium on Visual Languages</i>. Halifax, Canada, 1998. <a href=\"https://doi.org/10.1109/VL.1998.706167\">https://doi.org/10.1109/VL.1998.706167</a>."},"date_updated":"2023-01-24T11:39:35Z","date_created":"2023-01-24T11:39:30Z","author":[{"full_name":"Geiger, Christian","last_name":"Geiger","first_name":"Christian"},{"last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243","first_name":"Wolfgang"},{"first_name":"W.","last_name":"Rosenbach","full_name":"Rosenbach, W."}],"title":"SAM - An Animated 3D Programming Language","doi":"10.1109/VL.1998.706167","conference":{"location":"Halifax, Canada","name":"1998 IEEE Symposium on Visual Languages"}},{"title":"A Generic System for Interactive Real--Time Animation","conference":{"location":"Monterey, CA, USA "},"doi":"10.1109/ECBS.1997.581876","date_updated":"2023-01-24T11:46:28Z","author":[{"last_name":"Dücker","full_name":"Dücker, M.","first_name":"M."},{"first_name":"Georg","full_name":"Lehrenfeld, Georg","last_name":"Lehrenfeld"},{"last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang"},{"first_name":"C.","last_name":"Tahedl","full_name":"Tahedl, C."}],"date_created":"2023-01-24T11:46:23Z","place":"Monterey, CA, USA ","year":"1997","citation":{"ieee":"M. Dücker, G. Lehrenfeld, W. Müller, and C. Tahedl, “A Generic System for Interactive Real--Time Animation,” Monterey, CA, USA , 1997, doi: <a href=\"https://doi.org/10.1109/ECBS.1997.581876\">10.1109/ECBS.1997.581876</a>.","chicago":"Dücker, M., Georg Lehrenfeld, Wolfgang Müller, and C. Tahedl. “A Generic System for Interactive Real--Time Animation.” In <i> Proceedings International Conference and Workshop on Engineering of Computer-Based Systems</i>. Monterey, CA, USA , 1997. <a href=\"https://doi.org/10.1109/ECBS.1997.581876\">https://doi.org/10.1109/ECBS.1997.581876</a>.","ama":"Dücker M, Lehrenfeld G, Müller W, Tahedl C. A Generic System for Interactive Real--Time Animation. In: <i> Proceedings International Conference and Workshop on Engineering of Computer-Based Systems</i>. ; 1997. doi:<a href=\"https://doi.org/10.1109/ECBS.1997.581876\">10.1109/ECBS.1997.581876</a>","apa":"Dücker, M., Lehrenfeld, G., Müller, W., &#38; Tahedl, C. (1997). A Generic System for Interactive Real--Time Animation. <i> Proceedings International Conference and Workshop on Engineering of Computer-Based Systems</i>. <a href=\"https://doi.org/10.1109/ECBS.1997.581876\">https://doi.org/10.1109/ECBS.1997.581876</a>","short":"M. Dücker, G. Lehrenfeld, W. Müller, C. Tahedl, in:  Proceedings International Conference and Workshop on Engineering of Computer-Based Systems, Monterey, CA, USA , 1997.","bibtex":"@inproceedings{Dücker_Lehrenfeld_Müller_Tahedl_1997, place={Monterey, CA, USA }, title={A Generic System for Interactive Real--Time Animation}, DOI={<a href=\"https://doi.org/10.1109/ECBS.1997.581876\">10.1109/ECBS.1997.581876</a>}, booktitle={ Proceedings International Conference and Workshop on Engineering of Computer-Based Systems}, author={Dücker, M. and Lehrenfeld, Georg and Müller, Wolfgang and Tahedl, C.}, year={1997} }","mla":"Dücker, M., et al. “A Generic System for Interactive Real--Time Animation.” <i> Proceedings International Conference and Workshop on Engineering of Computer-Based Systems</i>, 1997, doi:<a href=\"https://doi.org/10.1109/ECBS.1997.581876\">10.1109/ECBS.1997.581876</a>."},"publication_identifier":{"isbn":["0-8186-7889-5"]},"keyword":["Real time systems","Animation","Debugging","Automation","Computer languages","Timing","Environmental management","Programming environments","Visualization","Multimedia systems"],"language":[{"iso":"eng"}],"_id":"39502","user_id":"5786","department":[{"_id":"672"}],"abstract":[{"text":"The authors present a new approach to an interactive design and analysis environment for visual languages. The main components, i.e., editor animator and interpreter are introduced. Their interactions are being investigated emphasizing the interpreter-animator interaction and defining an interface supporting different levels of automation. The interpreter performs the executions on a logical level and triggers the animator. The interactive animation provides a very high degree of liveness since it is based on the tight integration of the animator and editor. The proposed architecture permits the distributed implementation of a system for real-time animation. Their concepts are validated by the implementation of a debugging environment for the complete visual programming language Pictorial Janus.","lang":"eng"}],"status":"public","type":"conference","publication":" Proceedings International Conference and Workshop on Engineering of Computer-Based Systems"}]