@article{35602, abstract = {{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. CSS 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. This 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. Recently, 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. It 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. In this contribution, we further investigate the Graph-PIT training scheme. We show in extended experiments that models trained with Graph-PIT also work in challenging reverberant conditions. Models 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. We simplify the training schedule for Graph-PIT with the recently proposed Source Aggregated Signal-to-Distortion Ratio (SA-SDR) loss. It eliminates unfavorable properties of the previously used A-SDR loss and thus enables training with Graph-PIT from scratch. Graph-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. Furthermore, 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.}}, author = {{von Neumann, Thilo and Kinoshita, Keisuke and Boeddeker, Christoph and Delcroix, Marc and Haeb-Umbach, Reinhold}}, issn = {{2329-9290}}, journal = {{IEEE/ACM Transactions on Audio, Speech, and Language Processing}}, keywords = {{Continuous Speech Separation, Source Separation, Graph-PIT, Dynamic Programming, Permutation Invariant Training}}, pages = {{576--589}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria}}}, doi = {{10.1109/taslp.2022.3228629}}, volume = {{31}}, year = {{2023}}, } @inproceedings{36522, abstract = {{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. The 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.}}, author = {{Shivarpatna Venkatesh, Ashwin Prasad and Wang, Jiawei and Li, Li and Bodden, Eric}}, keywords = {{static analysis, python, code comprehension, annotation, literate programming, jupyter notebook}}, publisher = {{IEEE SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering)}}, title = {{{Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis}}}, doi = {{10.48550/ARXIV.2301.04419}}, year = {{2023}}, } @inproceedings{48855, abstract = {{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.}}, author = {{Bossek, Jakob and Neumann, Aneta and Neumann, Frank}}, booktitle = {{Learning and Intelligent Optimization}}, isbn = {{978-3-030-92120-0}}, keywords = {{Dynamic programming, Exact counting, Sampling, Zero-one knapsack problem}}, pages = {{40–54}}, publisher = {{Springer-Verlag}}, title = {{{Exact Counting and~Sampling of Optima for the Knapsack Problem}}}, doi = {{10.1007/978-3-030-92121-7_4}}, year = {{2021}}, } @inproceedings{24159, abstract = {{The online fitting of a microscopic traffic simulation model to reconstruct the current state of a real traffic area can be challenging depending on the provided data. This paper presents a novel method based on limited data from sensors positioned at specific locations and guarantees a general accordance of reality and simulation in terms of multimodal road traffic counts and vehicle speeds. In these considerations, the actual purpose of research is of particular importance. Here, the research aims at improving the traffic flow by controlling the Traffic Light Systems (TLS) of the examined area which is why the current traffic state and the route choices of individual road users are the matter of interest. An integer optimization problem is derived to fit the current simulation to the latest field measurements. The concept can be transferred to any road traffic network and results in an observation of the current multimodal traffic state matching at the given sensor position. First case studies show promosing results in terms of deviations between reality and simulation.}}, author = {{Malena, Kevin and Link, Christopher and Mertin, Sven and Gausemeier, Sandra and Trächtler, Ansgar}}, booktitle = {{VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology and Intelligent Transport Systems}}, isbn = {{978-989-758-513-5}}, keywords = {{Microscopic Traffic Simulation, Online State Estimation, Mixed Road Users, Sensor Fusion, Integer Programming, Route Choice, Vehicle2Infrastructure}}, location = {{Online Streaming}}, pages = {{386--395}}, publisher = {{SCITEPRESS}}, title = {{{Online State Estimation for Microscopic Traffic Simulations using Multiple Data Sources*}}}, volume = {{7}}, year = {{2021}}, } @inproceedings{17651, abstract = {{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.}}, author = {{Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}}, booktitle = {{Combinatorial Optimization and Applications}}, editor = {{Kim, Donghyun and Uma, R. N. and Zelikovsky, Alexander}}, isbn = {{978-3-030-04651-4}}, keywords = {{flow, Red-Blue Set Cover, Positive-Negative Partial Set Cover, approximation, tree, MAX SNP-hard, root, leaf, dynamic programming, FPT}}, pages = {{217--232}}, publisher = {{Springer International Publishing}}, title = {{{Removing Undesirable Flows by Edge Deletion}}}, year = {{2018}}, } @inproceedings{5675, abstract = {{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.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, booktitle = {{Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management}}, keywords = {{Coordination of spontaneous volunteers, volunteer coordination system, decision support, scheduling optimization model, linear programming}}, location = {{Rochester, NY, USA}}, title = {{{Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief}}}, year = {{2018}}, } @inproceedings{8161, abstract = {{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.}}, author = {{Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}}, editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}}, keywords = {{Complexity Theory, Quantum Computing, Polynomial Hierarchy, Semidefinite Programming, QMA(2), Quantum Complexity}}, location = {{Liverpool, UK}}, pages = {{58:1--58:16}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}}}, doi = {{10.4230/LIPIcs.MFCS.2018.58}}, volume = {{117}}, year = {{2018}}, } @inproceedings{37011, abstract = {{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.}}, author = {{Klobedanz, Kay and Kuznik, Christoph and Thuy, Andre and Müller, Wolfgang}}, booktitle = {{Proceedings of DATE’10, Dresden}}, keywords = {{Timing, Programming, Automotive engineering, Application software, Hardware, Computer architecture, Communication system software, Software architecture, Delay, Software standards}}, location = {{Dresden}}, publisher = {{IEEE}}, title = {{{Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study}}}, doi = {{10.1109/DATE.2010.5457125}}, year = {{2010}}, } @inproceedings{37046, abstract = {{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.}}, author = {{Becker, Markus and Zabel, Henning and Müller, Wolfgang}}, editor = {{Kleinjohann, L. and Kleinjohann, B.}}, isbn = {{978-3-642-15233-7}}, keywords = {{Application Programming Interface User Mode Kernel Space System Level Design Mixed Level}}, publisher = {{Springer Verlag}}, title = {{{A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement}}}, doi = {{10.1007/978-3-642-15234-4_15}}, year = {{2010}}, } @inproceedings{6508, abstract = {{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.}}, author = {{Kaufmann, Paul and Platzner, Marco}}, booktitle = {{Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)}}, isbn = {{076952866X}}, keywords = {{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}}, location = {{Edinburgh, UK}}, pages = {{447--454}}, publisher = {{IEEE}}, title = {{{MOVES: A Modular Framework for Hardware Evolution}}}, doi = {{10.1109/ahs.2007.73}}, year = {{2007}}, } @inproceedings{39032, abstract = {{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.}}, author = {{Schattkowsky, Tim and Müller, Wolfgang}}, booktitle = {{Proceedings of VL/HCC 05}}, isbn = {{0-7695-2443-5}}, keywords = {{Unified modeling language, Software design, Virtual machining, Embedded system, Programming, Documentation, Hardware, Computer languages, Operating systems, Runtime}}, title = {{{Transformation of UML State Machines for Direct Execution}}}, doi = {{10.1109/VLHCC.2005.64}}, year = {{2005}}, } @inproceedings{39403, abstract = {{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).}}, author = {{Flake, Stephan and Müller, Wolfgang}}, booktitle = {{Proceedings of HICSS-35}}, isbn = {{0-7695-1435-9}}, keywords = {{Unified modeling language, Logic, Formal verification, Real time systems, Programming profession, Vehicle dynamics, Software standards, Flexible manufacturing systems, Electronics industry, Protocols}}, location = {{Big Island, HI, USA }}, title = {{{Specification of Real-Time Properties for UML Models}}}, doi = {{10.1109/HICSS.2002.994469}}, year = {{2002}}, } @inproceedings{39432, abstract = {{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.}}, author = {{Müller, Wolfgang and Meyer, A. and Zabel, Henning}}, booktitle = {{Proceedings of the 34th Annual Hawaii International Conference on System Sciences}}, isbn = {{0-7695-0981-9}}, keywords = {{software prototyping, distributed programming, authoring languages, software agents, program visualisation, parallel languages}}, title = {{{A Language for the Rapid Prototyping of Mobile Evolving Agents}}}, doi = {{10.1109/HICSS.2001.926319}}, year = {{2001}}, } @inproceedings{39493, abstract = {{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.}}, author = {{Geiger, Christian and Müller, Wolfgang and Rosenbach, W.}}, booktitle = {{Proceedings of the IEEE Symposium on Visual Languages}}, isbn = {{0-8186-8712-6}}, keywords = {{Animation, Computer languages, Solids, Concrete, Application software, Virtual reality, Programming profession, Switches, Visualization, Debugging}}, location = {{Halifax, Canada}}, title = {{{SAM - An Animated 3D Programming Language}}}, doi = {{10.1109/VL.1998.706167}}, year = {{1998}}, } @inproceedings{39502, abstract = {{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.}}, author = {{Dücker, M. and Lehrenfeld, Georg and Müller, Wolfgang and Tahedl, C.}}, booktitle = {{ Proceedings International Conference and Workshop on Engineering of Computer-Based Systems}}, isbn = {{0-8186-7889-5}}, keywords = {{Real time systems, Animation, Debugging, Automation, Computer languages, Timing, Environmental management, Programming environments, Visualization, Multimedia systems}}, location = {{Monterey, CA, USA }}, title = {{{A Generic System for Interactive Real--Time Animation}}}, doi = {{10.1109/ECBS.1997.581876}}, year = {{1997}}, }