---
_id: '35602'
abstract:
- lang: eng
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."
article_type: original
author:
- first_name: Thilo
full_name: von Neumann, Thilo
id: '49870'
last_name: von Neumann
orcid: https://orcid.org/0000-0002-7717-8670
- first_name: Keisuke
full_name: Kinoshita, Keisuke
last_name: Kinoshita
- first_name: Christoph
full_name: Boeddeker, Christoph
id: '40767'
last_name: Boeddeker
- first_name: Marc
full_name: Delcroix, Marc
last_name: Delcroix
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
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. IEEE/ACM
Transactions on Audio, Speech, and Language Processing. 2023;31:576-589. doi:10.1109/taslp.2022.3228629'
apa: 'von Neumann, T., Kinoshita, K., Boeddeker, C., Delcroix, M., & Haeb-Umbach,
R. (2023). Segment-Less Continuous Speech Separation of Meetings: Training and
Evaluation Criteria. IEEE/ACM Transactions on Audio, Speech, and Language Processing,
31, 576–589. https://doi.org/10.1109/taslp.2022.3228629'
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={10.1109/taslp.2022.3228629},
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} }'
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.” IEEE/ACM Transactions on Audio, Speech,
and Language Processing 31 (2023): 576–89. https://doi.org/10.1109/taslp.2022.3228629.'
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,” IEEE/ACM Transactions on Audio, Speech, and Language Processing,
vol. 31, pp. 576–589, 2023, doi: 10.1109/taslp.2022.3228629.'
mla: 'von Neumann, Thilo, et al. “Segment-Less Continuous Speech Separation of Meetings:
Training and Evaluation Criteria.” IEEE/ACM Transactions on Audio, Speech,
and Language Processing, vol. 31, Institute of Electrical and Electronics
Engineers (IEEE), 2023, pp. 576–89, doi:10.1109/taslp.2022.3228629.'
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.
date_created: 2023-01-09T17:24:17Z
date_updated: 2023-11-15T12:16:11Z
ddc:
- '000'
department:
- _id: '54'
doi: 10.1109/taslp.2022.3228629
file:
- access_level: open_access
content_type: application/pdf
creator: haebumb
date_created: 2023-01-09T17:46:05Z
date_updated: 2023-01-11T08:50:19Z
file_id: '35607'
file_name: main.pdf
file_size: 7185077
relation: main_file
file_date_updated: 2023-01-11T08:50:19Z
has_accepted_license: '1'
intvolume: ' 31'
keyword:
- Continuous Speech Separation
- Source Separation
- Graph-PIT
- Dynamic Programming
- Permutation Invariant Training
language:
- iso: eng
oa: '1'
page: 576-589
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: IEEE/ACM Transactions on Audio, Speech, and Language Processing
publication_identifier:
issn:
- 2329-9290
- 2329-9304
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
quality_controlled: '1'
status: public
title: 'Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation
Criteria'
type: journal_article
user_id: '49870'
volume: 31
year: '2023'
...
---
_id: '36522'
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."
author:
- first_name: Ashwin Prasad
full_name: Shivarpatna Venkatesh, Ashwin Prasad
id: '66637'
last_name: Shivarpatna Venkatesh
- first_name: Jiawei
full_name: Wang, Jiawei
last_name: Wang
- first_name: Li
full_name: Li, Li
last_name: Li
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
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:10.48550/ARXIV.2301.04419'
apa: Shivarpatna Venkatesh, A. P., Wang, J., Li, L., & Bodden, E. (2023). Enhancing
Comprehension and Navigation in Jupyter Notebooks with Static Analysis. IEEE
SANER 2023 (International Conference on Software Analysis, Evolution and Reengineering).
https://doi.org/10.48550/ARXIV.2301.04419
bibtex: '@inproceedings{Shivarpatna Venkatesh_Wang_Li_Bodden_2023, title={Enhancing
Comprehension and Navigation in Jupyter Notebooks with Static Analysis}, DOI={10.48550/ARXIV.2301.04419},
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} }'
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. https://doi.org/10.48550/ARXIV.2301.04419.
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: 10.48550/ARXIV.2301.04419.'
mla: Shivarpatna Venkatesh, Ashwin Prasad, et al. Enhancing Comprehension and
Navigation in Jupyter Notebooks with Static Analysis. IEEE SANER 2023 (International
Conference on Software Analysis, Evolution and Reengineering), 2023, doi:10.48550/ARXIV.2301.04419.
short: 'A.P. Shivarpatna Venkatesh, J. Wang, L. Li, E. Bodden, in: IEEE SANER 2023
(International Conference on Software Analysis, Evolution and Reengineering),
2023.'
conference:
name: IEEE SANER 2023 (International Conference on Software Analysis, Evolution
and Reengineering)
date_created: 2023-01-13T08:03:26Z
date_updated: 2025-04-07T10:18:03Z
ddc:
- '000'
doi: 10.48550/ARXIV.2301.04419
file:
- access_level: open_access
content_type: application/pdf
creator: ashwin
date_created: 2023-01-26T10:48:40Z
date_updated: 2023-01-26T10:48:40Z
file_id: '40304'
file_name: 2301.04419.pdf
file_size: 1862440
relation: main_file
file_date_updated: 2023-01-26T10:48:40Z
has_accepted_license: '1'
keyword:
- static analysis
- python
- code comprehension
- annotation
- literate programming
- jupyter notebook
language:
- iso: eng
oa: '1'
publisher: IEEE SANER 2023 (International Conference on Software Analysis, Evolution
and Reengineering)
status: public
title: Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis
type: conference
user_id: '15249'
year: '2023'
...
---
_id: '48855'
abstract:
- lang: eng
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.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann A, Neumann F. Exact Counting and~Sampling of Optima for
the Knapsack Problem. In: Learning and Intelligent Optimization. Springer-Verlag;
2021:40–54. doi:10.1007/978-3-030-92121-7_4'
apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Exact Counting and~Sampling
of Optima for the Knapsack Problem. Learning and Intelligent Optimization,
40–54. https://doi.org/10.1007/978-3-030-92121-7_4
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={Berlin, Heidelberg},
title={Exact Counting and~Sampling of Optima for the Knapsack Problem}, DOI={10.1007/978-3-030-92121-7_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer-Verlag},
author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={40–54}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Exact Counting And~Sampling
of Optima for the Knapsack Problem.” In Learning and Intelligent Optimization,
40–54. Berlin, Heidelberg: Springer-Verlag, 2021. https://doi.org/10.1007/978-3-030-92121-7_4.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Exact Counting and~Sampling of Optima
for the Knapsack Problem,” in Learning and Intelligent Optimization, 2021,
pp. 40–54, doi: 10.1007/978-3-030-92121-7_4.'
mla: Bossek, Jakob, et al. “Exact Counting And~Sampling of Optima for the Knapsack
Problem.” Learning and Intelligent Optimization, Springer-Verlag, 2021,
pp. 40–54, doi:10.1007/978-3-030-92121-7_4.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Learning and Intelligent Optimization,
Springer-Verlag, Berlin, Heidelberg, 2021, pp. 40–54.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:14Z
department:
- _id: '819'
doi: 10.1007/978-3-030-92121-7_4
extern: '1'
keyword:
- Dynamic programming
- Exact counting
- Sampling
- Zero-one knapsack problem
language:
- iso: eng
page: 40–54
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-92120-0
publication_status: published
publisher: Springer-Verlag
status: public
title: Exact Counting and~Sampling of Optima for the Knapsack Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '24159'
abstract:
- lang: eng
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."
author:
- first_name: Kevin
full_name: Malena, Kevin
id: '36303'
last_name: Malena
orcid: 0000-0003-1183-4679
- first_name: Christopher
full_name: Link, Christopher
id: '38249'
last_name: Link
- first_name: Sven
full_name: Mertin, Sven
id: '13195'
last_name: Mertin
- first_name: Sandra
full_name: Gausemeier, Sandra
id: '17793'
last_name: Gausemeier
- first_name: Ansgar
full_name: Trächtler, Ansgar
id: '552'
last_name: Trächtler
citation:
ama: 'Malena K, Link C, Mertin S, Gausemeier S, Trächtler A. Online State Estimation
for Microscopic Traffic Simulations using Multiple Data Sources*. In: VEHITS
2021 Proceedings of the 7th International Conference on Vehicle Technology and
Intelligent Transport Systems. Vol 7. VEHITS 2021 Proceedings of the 7th International
Conference on Vehicle Technology and Intelligent Transport Systems. SCITEPRESS;
2021:386-395.'
apa: Malena, K., Link, C., Mertin, S., Gausemeier, S., & Trächtler, A. (2021).
Online State Estimation for Microscopic Traffic Simulations using Multiple Data
Sources*. VEHITS 2021 Proceedings of the 7th International Conference on Vehicle
Technology and Intelligent Transport Systems, 7, 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 VEHITS 2021 Proceedings of the 7th International
Conference on Vehicle Technology and Intelligent Transport Systems, 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 VEHITS 2021 Proceedings of the 7th International Conference on Vehicle Technology
and Intelligent Transport Systems, Online Streaming, 2021, vol. 7, pp. 386–395.
mla: Malena, Kevin, et al. “Online State Estimation for Microscopic Traffic Simulations
Using Multiple Data Sources*.” VEHITS 2021 Proceedings of the 7th International
Conference on Vehicle Technology and Intelligent Transport Systems, 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.'
conference:
end_date: 2021-04-30
location: Online Streaming
name: 7th International Conference on Vehicle Technology and Intelligent Transport
Systems
start_date: 2021-04-28
date_created: 2021-09-10T12:19:14Z
date_updated: 2026-01-26T08:49:53Z
department:
- _id: '153'
intvolume: ' 7'
keyword:
- Microscopic Traffic Simulation
- Online State Estimation
- Mixed Road Users
- Sensor Fusion
- Integer Programming
- Route Choice
- Vehicle2Infrastructure
language:
- iso: eng
main_file_link:
- url: https://www.scitepress.org/PublicationsDetail.aspx?ID=3xZWfOSENWk=&t=1
page: 386-395
place: Portugal
project:
- _id: '688'
name: Pilotprojekt "Schlosskreuzung"
publication: VEHITS 2021 Proceedings of the 7th International Conference on Vehicle
Technology and Intelligent Transport Systems
publication_identifier:
isbn:
- 978-989-758-513-5
publication_status: published
publisher: SCITEPRESS
quality_controlled: '1'
related_material:
link:
- relation: confirmation
url: https://www.scitepress.org/PublicationsDetail.aspx?ID=3xZWfOSENWk=&t=1
record:
- id: '33849'
relation: is_continued_by
status: public
series_title: VEHITS 2021 Proceedings of the 7th International Conference on Vehicle
Technology and Intelligent Transport Systems
status: public
title: Online State Estimation for Microscopic Traffic Simulations using Multiple
Data Sources*
type: conference
user_id: '36303'
volume: 7
year: '2021'
...
---
_id: '17651'
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.'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
citation:
ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows
by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization
and Applications. Cham: Springer International Publishing; 2018:217-232.'
apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing
Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky
(Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham:
Springer International Publishing.'
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}
}'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing
Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications,
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 Combinatorial Optimization and Applications,
2018, pp. 217–232.
mla: Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial
Optimization and Applications, 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.'
date_created: 2020-08-06T15:19:36Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Donghyun
full_name: Kim, Donghyun
last_name: Kim
- first_name: R. N.
full_name: Uma, R. N.
last_name: Uma
- first_name: Alexander
full_name: Zelikovsky, Alexander
last_name: Zelikovsky
extern: '1'
keyword:
- flow
- Red-Blue Set Cover
- Positive-Negative Partial Set Cover
- approximation
- tree
- MAX SNP-hard
- root
- leaf
- dynamic programming
- FPT
language:
- iso: eng
page: 217-232
place: Cham
publication: Combinatorial Optimization and Applications
publication_identifier:
isbn:
- 978-3-030-04651-4
publisher: Springer International Publishing
status: public
title: Removing Undesirable Flows by Edge Deletion
type: conference
user_id: '83983'
year: '2018'
...
---
_id: '5675'
abstract:
- lang: eng
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.
author:
- first_name: Gerhard
full_name: Rauchecker, Gerhard
last_name: Rauchecker
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: 'Rauchecker G, Schryen G. Decision Support for the Optimal Coordination of
Spontaneous Volunteers in Disaster Relief. In: Proceedings of the 15th International
Conference on Information Systems for Crisis Response and Management. ; 2018.'
apa: Rauchecker, G., & Schryen, G. (2018). Decision Support for the Optimal
Coordination of Spontaneous Volunteers in Disaster Relief. In Proceedings of
the 15th International Conference on Information Systems for Crisis Response and
Management. Rochester, NY, USA.
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}
}'
chicago: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal
Coordination of Spontaneous Volunteers in Disaster Relief.” In Proceedings
of the 15th International Conference on Information Systems for Crisis Response
and Management, 2018.
ieee: G. Rauchecker and G. Schryen, “Decision Support for the Optimal Coordination
of Spontaneous Volunteers in Disaster Relief,” in Proceedings of the 15th International
Conference on Information Systems for Crisis Response and Management, Rochester,
NY, USA, 2018.
mla: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination
of Spontaneous Volunteers in Disaster Relief.” Proceedings of the 15th International
Conference on Information Systems for Crisis Response and Management, 2018.
short: 'G. Rauchecker, G. Schryen, in: Proceedings of the 15th International Conference
on Information Systems for Crisis Response and Management, 2018.'
conference:
location: Rochester, NY, USA
name: 15th International Conference on Information Systems for Crisis Response and
Management
date_created: 2018-11-14T15:35:54Z
date_updated: 2022-01-06T07:02:28Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-07T11:25:06Z
date_updated: 2018-12-13T15:05:44Z
file_id: '6020'
file_name: 2018_ISCRAM_Conference_Proceedings - Publication Version.pdf
file_size: 488472
relation: main_file
file_date_updated: 2018-12-13T15:05:44Z
has_accepted_license: '1'
keyword:
- Coordination of spontaneous volunteers
- volunteer coordination system
- decision support
- scheduling optimization model
- linear programming
language:
- iso: eng
oa: '1'
publication: Proceedings of the 15th International Conference on Information Systems
for Crisis Response and Management
status: public
title: Decision Support for the Optimal Coordination of Spontaneous Volunteers in
Disaster Relief
type: conference
user_id: '61579'
year: '2018'
...
---
_id: '8161'
abstract:
- lang: eng
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.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- 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
- first_name: Justin
full_name: Yirka, Justin
last_name: Yirka
citation:
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. 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018). Vol 117. Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16.
doi:10.4230/LIPIcs.MFCS.2018.58'
apa: Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018).
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).
In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium
on Mathematical Foundations of Computer Science (MFCS 2018) (Vol. 117, p.
58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58
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={10.4230/LIPIcs.MFCS.2018.58},
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)} }'
chicago: 'Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin
Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications
to QMA(2).” In 43rd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2018), 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. https://doi.org/10.4230/LIPIcs.MFCS.2018.58.'
ieee: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations
of the Polynomial Hierarchy with Applications to QMA(2),” in 43rd International
Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool,
UK, 2018, vol. 117, p. 58:1-58:16, doi: 10.4230/LIPIcs.MFCS.2018.58.'
mla: Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy
with Applications to QMA(2).” 43rd International Symposium on Mathematical
Foundations of Computer Science (MFCS 2018), edited by Igor Potapov et al.,
vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16,
doi:10.4230/LIPIcs.MFCS.2018.58.
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.'
conference:
location: Liverpool, UK
name: 43rd International Symposium on Mathematical Foundations of Computer Science
(MFCS 2018)
date_created: 2019-03-01T11:29:44Z
date_updated: 2023-02-28T11:01:03Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.MFCS.2018.58
editor:
- first_name: Igor
full_name: Potapov, Igor
last_name: Potapov
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
- first_name: James
full_name: Worrell, James
last_name: Worrell
external_id:
arxiv:
- '1805.11139'
intvolume: ' 117'
keyword:
- Complexity Theory
- Quantum Computing
- Polynomial Hierarchy
- Semidefinite Programming
- QMA(2)
- Quantum Complexity
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640
oa: '1'
page: 58:1-58:16
place: Dagstuhl, Germany
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)
publication_identifier:
unknown:
- 978-3-95977-086-6
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)
type: conference
user_id: '71541'
volume: 117
year: '2018'
...
---
_id: '37011'
abstract:
- lang: eng
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.
author:
- first_name: Kay
full_name: Klobedanz, Kay
last_name: Klobedanz
- first_name: Christoph
full_name: Kuznik, Christoph
last_name: Kuznik
- first_name: Andre
full_name: Thuy, Andre
last_name: Thuy
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Klobedanz K, Kuznik C, Thuy A, Müller W. Timing Modeling and Analysis for
AUTOSAR-Based Software Development - A Case Study. In: Proceedings of DATE’10,
Dresden. IEEE; 2010. doi:10.1109/DATE.2010.5457125'
apa: Klobedanz, K., Kuznik, C., Thuy, A., & Müller, W. (2010). Timing Modeling
and Analysis for AUTOSAR-Based Software Development - A Case Study. Proceedings
of DATE’10, Dresden. 2010 Design, Automation & Test in Europe Conference
& Exhibition (DATE 2010), Dresden. https://doi.org/10.1109/DATE.2010.5457125
bibtex: '@inproceedings{Klobedanz_Kuznik_Thuy_Müller_2010, place={Dresden}, title={Timing
Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study},
DOI={10.1109/DATE.2010.5457125},
booktitle={Proceedings of DATE’10, Dresden}, publisher={IEEE}, author={Klobedanz,
Kay and Kuznik, Christoph and Thuy, Andre and Müller, Wolfgang}, year={2010} }'
chicago: 'Klobedanz, Kay, Christoph Kuznik, Andre Thuy, and Wolfgang Müller. “Timing
Modeling and Analysis for AUTOSAR-Based Software Development - A Case Study.”
In Proceedings of DATE’10, Dresden. Dresden: IEEE, 2010. https://doi.org/10.1109/DATE.2010.5457125.'
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 & Test in Europe Conference & Exhibition (DATE 2010),
Dresden, 2010, doi: 10.1109/DATE.2010.5457125.'
mla: Klobedanz, Kay, et al. “Timing Modeling and Analysis for AUTOSAR-Based Software
Development - A Case Study.” Proceedings of DATE’10, Dresden, IEEE, 2010,
doi:10.1109/DATE.2010.5457125.
short: 'K. Klobedanz, C. Kuznik, A. Thuy, W. Müller, in: Proceedings of DATE’10,
Dresden, IEEE, Dresden, 2010.'
conference:
location: Dresden
name: 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)
date_created: 2023-01-17T09:19:36Z
date_updated: 2023-01-17T09:19:46Z
department:
- _id: '672'
doi: 10.1109/DATE.2010.5457125
keyword:
- Timing
- Programming
- Automotive engineering
- Application software
- Hardware
- Computer architecture
- Communication system software
- Software architecture
- Delay
- Software standards
language:
- iso: eng
place: Dresden
publication: Proceedings of DATE’10, Dresden
publisher: IEEE
status: public
title: Timing Modeling and Analysis for AUTOSAR-Based Software Development - A Case
Study
type: conference
user_id: '5786'
year: '2010'
...
---
_id: '37046'
abstract:
- lang: eng
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.
author:
- first_name: Markus
full_name: Becker, Markus
last_name: Becker
- first_name: Henning
full_name: Zabel, Henning
last_name: Zabel
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
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:10.1007/978-3-642-15234-4_15'
apa: Becker, M., Zabel, H., & Müller, W. (2010). A Mixed Level Simulation
Environment for Stepwise RTOS Software Refinement (L. Kleinjohann & B.
Kleinjohann, Eds.). Springer Verlag. https://doi.org/10.1007/978-3-642-15234-4_15
bibtex: '@inproceedings{Becker_Zabel_Müller_2010, place={Dordrecht}, title={A Mixed
Level Simulation Environment for Stepwise RTOS Software Refinement}, DOI={10.1007/978-3-642-15234-4_15},
publisher={Springer Verlag}, author={Becker, Markus and Zabel, Henning and Müller,
Wolfgang}, editor={Kleinjohann, L. and Kleinjohann, B.}, year={2010} }'
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. https://doi.org/10.1007/978-3-642-15234-4_15.'
ieee: 'M. Becker, H. Zabel, and W. Müller, “A Mixed Level Simulation Environment
for Stepwise RTOS Software Refinement,” 2010, doi: 10.1007/978-3-642-15234-4_15.'
mla: Becker, Markus, et al. A Mixed Level Simulation Environment for Stepwise
RTOS Software Refinement. Edited by L. Kleinjohann and B. Kleinjohann, Springer
Verlag, 2010, doi:10.1007/978-3-642-15234-4_15.
short: 'M. Becker, H. Zabel, W. Müller, in: L. Kleinjohann, B. Kleinjohann (Eds.),
Springer Verlag, Dordrecht, 2010.'
conference:
name: IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES
2010)
date_created: 2023-01-17T11:01:30Z
date_updated: 2023-01-17T11:03:00Z
department:
- _id: '672'
doi: 10.1007/978-3-642-15234-4_15
editor:
- first_name: L.
full_name: Kleinjohann, L.
last_name: Kleinjohann
- first_name: B.
full_name: Kleinjohann, B.
last_name: Kleinjohann
keyword:
- Application Programming Interface User Mode Kernel Space System Level
Design Mixed Level
language:
- iso: eng
place: Dordrecht
publication_identifier:
isbn:
- 978-3-642-15233-7
publisher: Springer Verlag
status: public
title: A Mixed Level Simulation Environment for Stepwise RTOS Software Refinement
type: conference
user_id: '5786'
year: '2010'
...
---
_id: '6508'
abstract:
- lang: eng
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.'
author:
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Kaufmann P, Platzner M. MOVES: A Modular Framework for Hardware Evolution.
In: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007).
IEEE; 2007:447-454. doi:10.1109/ahs.2007.73'
apa: 'Kaufmann, P., & Platzner, M. (2007). MOVES: A Modular Framework for Hardware
Evolution. In Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS
2007) (pp. 447–454). Edinburgh, UK: IEEE. https://doi.org/10.1109/ahs.2007.73'
bibtex: '@inproceedings{Kaufmann_Platzner_2007, title={MOVES: A Modular Framework
for Hardware Evolution}, DOI={10.1109/ahs.2007.73},
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}
}'
chicago: 'Kaufmann, Paul, and Marco Platzner. “MOVES: A Modular Framework for Hardware
Evolution.” In Second NASA/ESA Conference on Adaptive Hardware and Systems
(AHS 2007), 447–54. IEEE, 2007. https://doi.org/10.1109/ahs.2007.73.'
ieee: 'P. Kaufmann and M. Platzner, “MOVES: A Modular Framework for Hardware Evolution,”
in Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007),
Edinburgh, UK, 2007, pp. 447–454.'
mla: 'Kaufmann, Paul, and Marco Platzner. “MOVES: A Modular Framework for Hardware
Evolution.” Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS
2007), IEEE, 2007, pp. 447–54, doi:10.1109/ahs.2007.73.'
short: 'P. Kaufmann, M. Platzner, in: Second NASA/ESA Conference on Adaptive Hardware
and Systems (AHS 2007), IEEE, 2007, pp. 447–454.'
conference:
end_date: 2007-08-08
location: Edinburgh, UK
name: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)
start_date: 2007-08-05
date_created: 2019-01-08T09:52:43Z
date_updated: 2022-01-06T07:03:08Z
department:
- _id: '78'
doi: 10.1109/ahs.2007.73
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
page: 447-454
publication: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)
publication_identifier:
isbn:
- 076952866X
- '9780769528663'
publication_status: published
publisher: IEEE
status: public
title: 'MOVES: A Modular Framework for Hardware Evolution'
type: conference
user_id: '3118'
year: '2007'
...
---
_id: '39032'
abstract:
- lang: eng
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.
author:
- first_name: Tim
full_name: Schattkowsky, Tim
last_name: Schattkowsky
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Schattkowsky T, Müller W. Transformation of UML State Machines for Direct
Execution. In: Proceedings of VL/HCC 05. ; 2005. doi:10.1109/VLHCC.2005.64'
apa: Schattkowsky, T., & Müller, W. (2005). Transformation of UML State Machines
for Direct Execution. Proceedings of VL/HCC 05. https://doi.org/10.1109/VLHCC.2005.64
bibtex: '@inproceedings{Schattkowsky_Müller_2005, place={Dallas, TX, USA}, title={Transformation
of UML State Machines for Direct Execution}, DOI={10.1109/VLHCC.2005.64},
booktitle={Proceedings of VL/HCC 05}, author={Schattkowsky, Tim and Müller, Wolfgang},
year={2005} }'
chicago: Schattkowsky, Tim, and Wolfgang Müller. “Transformation of UML State Machines
for Direct Execution.” In Proceedings of VL/HCC 05. Dallas, TX, USA, 2005.
https://doi.org/10.1109/VLHCC.2005.64.
ieee: 'T. Schattkowsky and W. Müller, “Transformation of UML State Machines for
Direct Execution,” 2005, doi: 10.1109/VLHCC.2005.64.'
mla: Schattkowsky, Tim, and Wolfgang Müller. “Transformation of UML State Machines
for Direct Execution.” Proceedings of VL/HCC 05, 2005, doi:10.1109/VLHCC.2005.64.
short: 'T. Schattkowsky, W. Müller, in: Proceedings of VL/HCC 05, Dallas, TX, USA,
2005.'
date_created: 2023-01-24T08:18:10Z
date_updated: 2023-01-24T08:18:27Z
department:
- _id: '672'
doi: 10.1109/VLHCC.2005.64
keyword:
- Unified modeling language
- Software design
- Virtual machining
- Embedded system
- Programming
- Documentation
- Hardware
- Computer languages
- Operating systems
- Runtime
language:
- iso: eng
place: Dallas, TX, USA
publication: Proceedings of VL/HCC 05
publication_identifier:
isbn:
- 0-7695-2443-5
status: public
title: Transformation of UML State Machines for Direct Execution
type: conference
user_id: '5786'
year: '2005'
...
---
_id: '39403'
abstract:
- lang: eng
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).
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Flake S, Müller W. Specification of Real-Time Properties for UML Models. In:
Proceedings of HICSS-35. ; 2002. doi:10.1109/HICSS.2002.994469'
apa: Flake, S., & Müller, W. (2002). Specification of Real-Time Properties for
UML Models. Proceedings of HICSS-35. Proceedings of the 35th Annual Hawaii
International Conference on System Sciences, Big Island, HI, USA . https://doi.org/10.1109/HICSS.2002.994469
bibtex: '@inproceedings{Flake_Müller_2002, place={Big Island, HI, USA }, title={Specification
of Real-Time Properties for UML Models}, DOI={10.1109/HICSS.2002.994469},
booktitle={Proceedings of HICSS-35}, author={Flake, Stephan and Müller, Wolfgang},
year={2002} }'
chicago: Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties
for UML Models.” In Proceedings of HICSS-35. Big Island, HI, USA , 2002.
https://doi.org/10.1109/HICSS.2002.994469.
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: 10.1109/HICSS.2002.994469.'
mla: Flake, Stephan, and Wolfgang Müller. “Specification of Real-Time Properties
for UML Models.” Proceedings of HICSS-35, 2002, doi:10.1109/HICSS.2002.994469.
short: 'S. Flake, W. Müller, in: Proceedings of HICSS-35, Big Island, HI, USA ,
2002.'
conference:
location: 'Big Island, HI, USA '
name: Proceedings of the 35th Annual Hawaii International Conference on System Sciences
date_created: 2023-01-24T10:22:12Z
date_updated: 2023-01-24T10:22:16Z
department:
- _id: '672'
doi: 10.1109/HICSS.2002.994469
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
place: 'Big Island, HI, USA '
publication: Proceedings of HICSS-35
publication_identifier:
isbn:
- 0-7695-1435-9
status: public
title: Specification of Real-Time Properties for UML Models
type: conference
user_id: '5786'
year: '2002'
...
---
_id: '39432'
abstract:
- lang: eng
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.
author:
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: A.
full_name: Meyer, A.
last_name: Meyer
- first_name: Henning
full_name: Zabel, Henning
last_name: Zabel
citation:
ama: 'Müller W, Meyer A, Zabel H. A Language for the Rapid Prototyping of Mobile
Evolving Agents. In: Proceedings of the 34th Annual Hawaii International Conference
on System Sciences. ; 2001. doi:10.1109/HICSS.2001.926319'
apa: Müller, W., Meyer, A., & Zabel, H. (2001). A Language for the Rapid Prototyping
of Mobile Evolving Agents. Proceedings of the 34th Annual Hawaii International
Conference on System Sciences. https://doi.org/10.1109/HICSS.2001.926319
bibtex: '@inproceedings{Müller_Meyer_Zabel_2001, place={Maui, HI, USA }, title={A
Language for the Rapid Prototyping of Mobile Evolving Agents}, DOI={10.1109/HICSS.2001.926319},
booktitle={Proceedings of the 34th Annual Hawaii International Conference on System
Sciences}, author={Müller, Wolfgang and Meyer, A. and Zabel, Henning}, year={2001}
}'
chicago: Müller, Wolfgang, A. Meyer, and Henning Zabel. “A Language for the Rapid
Prototyping of Mobile Evolving Agents.” In Proceedings of the 34th Annual Hawaii
International Conference on System Sciences. Maui, HI, USA , 2001. https://doi.org/10.1109/HICSS.2001.926319.
ieee: 'W. Müller, A. Meyer, and H. Zabel, “A Language for the Rapid Prototyping
of Mobile Evolving Agents,” 2001, doi: 10.1109/HICSS.2001.926319.'
mla: Müller, Wolfgang, et al. “A Language for the Rapid Prototyping of Mobile Evolving
Agents.” Proceedings of the 34th Annual Hawaii International Conference on
System Sciences, 2001, doi:10.1109/HICSS.2001.926319.
short: 'W. Müller, A. Meyer, H. Zabel, in: Proceedings of the 34th Annual Hawaii
International Conference on System Sciences, Maui, HI, USA , 2001.'
date_created: 2023-01-24T10:48:09Z
date_updated: 2023-01-24T10:48:14Z
department:
- _id: '672'
doi: 10.1109/HICSS.2001.926319
keyword:
- software prototyping
- distributed programming
- authoring languages
- software agents
- program visualisation
- parallel languages
language:
- iso: eng
place: 'Maui, HI, USA '
publication: Proceedings of the 34th Annual Hawaii International Conference on System
Sciences
publication_identifier:
isbn:
- 0-7695-0981-9
status: public
title: A Language for the Rapid Prototyping of Mobile Evolving Agents
type: conference
user_id: '5786'
year: '2001'
...
---
_id: '39493'
abstract:
- lang: eng
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.
author:
- first_name: Christian
full_name: Geiger, Christian
last_name: Geiger
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: W.
full_name: Rosenbach, W.
last_name: Rosenbach
citation:
ama: 'Geiger C, Müller W, Rosenbach W. SAM - An Animated 3D Programming Language.
In: Proceedings of the IEEE Symposium on Visual Languages. ; 1998. doi:10.1109/VL.1998.706167'
apa: Geiger, C., Müller, W., & Rosenbach, W. (1998). SAM - An Animated 3D Programming
Language. Proceedings of the IEEE Symposium on Visual Languages. 1998 IEEE
Symposium on Visual Languages, Halifax, Canada. https://doi.org/10.1109/VL.1998.706167
bibtex: '@inproceedings{Geiger_Müller_Rosenbach_1998, place={Halifax, Canada}, title={SAM
- An Animated 3D Programming Language}, DOI={10.1109/VL.1998.706167},
booktitle={Proceedings of the IEEE Symposium on Visual Languages}, author={Geiger,
Christian and Müller, Wolfgang and Rosenbach, W.}, year={1998} }'
chicago: Geiger, Christian, Wolfgang Müller, and W. Rosenbach. “SAM - An Animated
3D Programming Language.” In Proceedings of the IEEE Symposium on Visual Languages.
Halifax, Canada, 1998. https://doi.org/10.1109/VL.1998.706167.
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: 10.1109/VL.1998.706167.'
mla: Geiger, Christian, et al. “SAM - An Animated 3D Programming Language.” Proceedings
of the IEEE Symposium on Visual Languages, 1998, doi:10.1109/VL.1998.706167.
short: 'C. Geiger, W. Müller, W. Rosenbach, in: Proceedings of the IEEE Symposium
on Visual Languages, Halifax, Canada, 1998.'
conference:
location: Halifax, Canada
name: 1998 IEEE Symposium on Visual Languages
date_created: 2023-01-24T11:39:30Z
date_updated: 2023-01-24T11:39:35Z
department:
- _id: '672'
doi: 10.1109/VL.1998.706167
keyword:
- Animation
- Computer languages
- Solids
- Concrete
- Application software
- Virtual reality
- Programming profession
- Switches
- Visualization
- Debugging
language:
- iso: eng
place: Halifax, Canada
publication: Proceedings of the IEEE Symposium on Visual Languages
publication_identifier:
isbn:
- 0-8186-8712-6
status: public
title: SAM - An Animated 3D Programming Language
type: conference
user_id: '5786'
year: '1998'
...
---
_id: '39502'
abstract:
- lang: eng
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.
author:
- first_name: M.
full_name: Dücker, M.
last_name: Dücker
- first_name: Georg
full_name: Lehrenfeld, Georg
last_name: Lehrenfeld
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: C.
full_name: Tahedl, C.
last_name: Tahedl
citation:
ama: 'Dücker M, Lehrenfeld G, Müller W, Tahedl C. A Generic System for Interactive
Real--Time Animation. In: Proceedings International Conference and Workshop
on Engineering of Computer-Based Systems. ; 1997. doi:10.1109/ECBS.1997.581876'
apa: Dücker, M., Lehrenfeld, G., Müller, W., & Tahedl, C. (1997). A Generic
System for Interactive Real--Time Animation. Proceedings International Conference
and Workshop on Engineering of Computer-Based Systems. https://doi.org/10.1109/ECBS.1997.581876
bibtex: '@inproceedings{Dücker_Lehrenfeld_Müller_Tahedl_1997, place={Monterey, CA,
USA }, title={A Generic System for Interactive Real--Time Animation}, DOI={10.1109/ECBS.1997.581876},
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} }'
chicago: Dücker, M., Georg Lehrenfeld, Wolfgang Müller, and C. Tahedl. “A Generic
System for Interactive Real--Time Animation.” In Proceedings International
Conference and Workshop on Engineering of Computer-Based Systems. Monterey,
CA, USA , 1997. https://doi.org/10.1109/ECBS.1997.581876.
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: 10.1109/ECBS.1997.581876.'
mla: Dücker, M., et al. “A Generic System for Interactive Real--Time Animation.”
Proceedings International Conference and Workshop on Engineering of Computer-Based
Systems, 1997, doi:10.1109/ECBS.1997.581876.
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.'
conference:
location: 'Monterey, CA, USA '
date_created: 2023-01-24T11:46:23Z
date_updated: 2023-01-24T11:46:28Z
department:
- _id: '672'
doi: 10.1109/ECBS.1997.581876
keyword:
- Real time systems
- Animation
- Debugging
- Automation
- Computer languages
- Timing
- Environmental management
- Programming environments
- Visualization
- Multimedia systems
language:
- iso: eng
place: 'Monterey, CA, USA '
publication: ' Proceedings International Conference and Workshop on Engineering of
Computer-Based Systems'
publication_identifier:
isbn:
- 0-8186-7889-5
status: public
title: A Generic System for Interactive Real--Time Animation
type: conference
user_id: '5786'
year: '1997'
...