[{"abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Engineering projects for complex technical systems such as automobiles demand extensive requirement specifications and corresponding hierarchy levels in system architectures. Especially when considering emergent phenomena, such as total weight or aerodynamics, a closely networked collaboration of discipline‐specific and cross‐disciplinary roles is required. Further, in large organizations with a group structure, resulting functional and non‐functional contents need to be managed by distinct Systems Engineering roles. For example, the role “property manager” takes care of achieving overarching product properties, such as weight or aerodynamics, which cannot be directly fixed, but result from many specifications. This paper proposes new Systems Engineering roles and their application in a German Original Equipment Manufacturer (OEM). For validation, the roles have already been applied in everyday engineering projects at the OEM. The concept proved to be indispensable and transferable to other Systems Engineering projects.</jats:p>"}],"publication":"INCOSE International Symposium","language":[{"iso":"eng"}],"keyword":["Systems Engineering roles","properties","features","emergent phenomena","automotive"],"year":"2024","issue":"1","quality_controlled":"1","title":"Systems Engineering roles to handle emergent properties and behaviors in complex technical systems","date_created":"2024-09-11T08:07:26Z","publisher":"Wiley","status":"public","type":"conference","department":[{"_id":"152"}],"user_id":"62841","_id":"56108","page":"584-598","intvolume":"        34","citation":{"mla":"Gräßler, Iris, et al. “Systems Engineering Roles to Handle Emergent Properties and Behaviors in Complex Technical Systems.” <i>INCOSE International Symposium</i>, vol. 34, no. 1, Wiley, 2024, pp. 584–98, doi:<a href=\"https://doi.org/10.1002/iis2.13164\">10.1002/iis2.13164</a>.","bibtex":"@inproceedings{Gräßler_Pfeifer_Hintz_Meyrl_2024, title={Systems Engineering roles to handle emergent properties and behaviors in complex technical systems}, volume={34}, DOI={<a href=\"https://doi.org/10.1002/iis2.13164\">10.1002/iis2.13164</a>}, number={1}, booktitle={INCOSE International Symposium}, publisher={Wiley}, author={Gräßler, Iris and Pfeifer, Jan Niklas and Hintz, Florian and Meyrl, Nicolas}, year={2024}, pages={584–598} }","short":"I. Gräßler, J.N. Pfeifer, F. Hintz, N. Meyrl, in: INCOSE International Symposium, Wiley, 2024, pp. 584–598.","apa":"Gräßler, I., Pfeifer, J. N., Hintz, F., &#38; Meyrl, N. (2024). Systems Engineering roles to handle emergent properties and behaviors in complex technical systems. <i>INCOSE International Symposium</i>, <i>34</i>(1), 584–598. <a href=\"https://doi.org/10.1002/iis2.13164\">https://doi.org/10.1002/iis2.13164</a>","ieee":"I. Gräßler, J. N. Pfeifer, F. Hintz, and N. Meyrl, “Systems Engineering roles to handle emergent properties and behaviors in complex technical systems,” in <i>INCOSE International Symposium</i>, Dublin, Ireland, 2024, vol. 34, no. 1, pp. 584–598, doi: <a href=\"https://doi.org/10.1002/iis2.13164\">10.1002/iis2.13164</a>.","chicago":"Gräßler, Iris, Jan Niklas Pfeifer, Florian Hintz, and Nicolas Meyrl. “Systems Engineering Roles to Handle Emergent Properties and Behaviors in Complex Technical Systems.” In <i>INCOSE International Symposium</i>, 34:584–98. Wiley, 2024. <a href=\"https://doi.org/10.1002/iis2.13164\">https://doi.org/10.1002/iis2.13164</a>.","ama":"Gräßler I, Pfeifer JN, Hintz F, Meyrl N. Systems Engineering roles to handle emergent properties and behaviors in complex technical systems. In: <i>INCOSE International Symposium</i>. Vol 34. Wiley; 2024:584-598. doi:<a href=\"https://doi.org/10.1002/iis2.13164\">10.1002/iis2.13164</a>"},"publication_identifier":{"issn":["2334-5837","2334-5837"]},"publication_status":"published","conference":{"start_date":"2024-07-02","name":"34th Annual INCOSE International Symposium","location":"Dublin, Ireland","end_date":"2024-07-06"},"doi":"10.1002/iis2.13164","volume":34,"author":[{"last_name":"Gräßler","orcid":"0000-0001-5765-971X","id":"47565","full_name":"Gräßler, Iris","first_name":"Iris"},{"first_name":"Jan Niklas","id":"62841","full_name":"Pfeifer, Jan Niklas","last_name":"Pfeifer"},{"first_name":"Florian","last_name":"Hintz","full_name":"Hintz, Florian"},{"first_name":"Nicolas","full_name":"Meyrl, Nicolas","last_name":"Meyrl"}],"date_updated":"2024-09-11T08:22:55Z"},{"publication_identifier":{"isbn":["978-1-4503-9237-2"]},"publication_status":"published","page":"186–194","citation":{"mla":"Bossek, Jakob, and Frank Neumann. “Exploring the Feature Space of TSP Instances Using Quality Diversity.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2022, pp. 186–194, doi:<a href=\"https://doi.org/10.1145/3512290.3528851\">10.1145/3512290.3528851</a>.","short":"J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2022, pp. 186–194.","bibtex":"@inproceedings{Bossek_Neumann_2022, place={New York, NY, USA}, series={GECCO ’22}, title={Exploring the Feature Space of TSP Instances Using Quality Diversity}, DOI={<a href=\"https://doi.org/10.1145/3512290.3528851\">10.1145/3512290.3528851</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank}, year={2022}, pages={186–194}, collection={GECCO ’22} }","apa":"Bossek, J., &#38; Neumann, F. (2022). Exploring the Feature Space of TSP Instances Using Quality Diversity. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 186–194. <a href=\"https://doi.org/10.1145/3512290.3528851\">https://doi.org/10.1145/3512290.3528851</a>","chicago":"Bossek, Jakob, and Frank Neumann. “Exploring the Feature Space of TSP Instances Using Quality Diversity.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 186–194. GECCO ’22. New York, NY, USA: Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3512290.3528851\">https://doi.org/10.1145/3512290.3528851</a>.","ieee":"J. Bossek and F. Neumann, “Exploring the Feature Space of TSP Instances Using Quality Diversity,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2022, pp. 186–194, doi: <a href=\"https://doi.org/10.1145/3512290.3528851\">10.1145/3512290.3528851</a>.","ama":"Bossek J, Neumann F. Exploring the Feature Space of TSP Instances Using Quality Diversity. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’22. Association for Computing Machinery; 2022:186–194. doi:<a href=\"https://doi.org/10.1145/3512290.3528851\">10.1145/3512290.3528851</a>"},"place":"New York, NY, USA","author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"date_updated":"2023-12-13T10:45:56Z","doi":"10.1145/3512290.3528851","type":"conference","status":"public","department":[{"_id":"819"}],"series_title":"GECCO ’22","user_id":"102979","_id":"48861","extern":"1","year":"2022","date_created":"2023-11-14T15:58:55Z","publisher":"Association for Computing Machinery","title":"Exploring the Feature Space of TSP Instances Using Quality Diversity","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"text":"Generating instances of different properties is key to algorithm selection methods that differentiate between the performance of different solvers for a given combinatorial optimization problem. A wide range of methods using evolutionary computation techniques has been introduced in recent years. With this paper, we contribute to this area of research by providing a new approach based on quality diversity (QD) that is able to explore the whole feature space. QD algorithms allow to create solutions of high quality within a given feature space by splitting it up into boxes and improving solution quality within each box. We use our QD approach for the generation of TSP instances to visualize and analyze the variety of instances differentiating various TSP solvers and compare it to instances generated by established approaches from the literature.","lang":"eng"}],"language":[{"iso":"eng"}],"keyword":["instance features","instance generation","quality diversity","TSP"]},{"extern":"1","language":[{"iso":"eng"}],"keyword":["automated algorithm selection","graph theory","instance features","normalization","traveling salesperson problem (TSP)"],"department":[{"_id":"819"}],"user_id":"102979","_id":"48881","status":"public","abstract":[{"lang":"eng","text":"Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plethora of features have been suggested. Most of these features are, if at all, only normalized imprecisely raising the issue of feature values being strongly affected by the instance size. Such artifacts may have detrimental effects on algorithm selection models. We propose a normalization for two feature groups which stood out in multiple AS studies on the TSP: (a) features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph (NNG) transformation of the input instance. To this end we theoretically derive minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs. We analyze the differences in feature space between normalized versions of these features and their unnormalized counterparts. Our empirical investigations on various TSP benchmark sets point out that the feature scaling succeeds in eliminating the effect of the instance size. Eventually, a proof-of-concept AS-study shows promising results: models trained with normalized features tend to outperform those trained with the respective vanilla features."}],"publication":"Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","type":"book_chapter","title":"On the Potential of Normalized TSP Features for Automated Algorithm Selection","author":[{"full_name":"Heins, Jonathan","last_name":"Heins","first_name":"Jonathan"},{"last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"first_name":"Janina","last_name":"Pohl","full_name":"Pohl, Janina"},{"first_name":"Moritz","full_name":"Seiler, Moritz","last_name":"Seiler"},{"first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"}],"date_created":"2023-11-14T15:58:58Z","publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:47:23Z","page":"1–15","citation":{"ama":"Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential of Normalized TSP Features for Automated Algorithm Selection. In: <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. Association for Computing Machinery; 2021:1–15.","chicago":"Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 1–15. New York, NY, USA: Association for Computing Machinery, 2021.","ieee":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On the Potential of Normalized TSP Features for Automated Algorithm Selection,” in <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–15.","apa":"Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2021). On the Potential of Normalized TSP Features for Automated Algorithm Selection. In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i> (pp. 1–15). Association for Computing Machinery.","short":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, in: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–15.","mla":"Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2021, pp. 1–15.","bibtex":"@inbook{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2021, place={New York, NY, USA}, title={On the Potential of Normalized TSP Features for Automated Algorithm Selection}, booktitle={Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, year={2021}, pages={1–15} }"},"year":"2021","place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-8352-3"]}},{"has_accepted_license":"1","intvolume":"       391","page":"276-286","citation":{"ama":"Gottschalk S, Yigitbas E, Engels G. Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs. In: Shishkov B, ed. <i>Business Modeling and Software Design</i>. Vol 391. Lecture Notes in Business Information Processing. Springer International Publishing; 2020:276-286. doi:<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>","chicago":"Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs.” In <i>Business Modeling and Software Design</i>, edited by Boris Shishkov, 391:276–86. Lecture Notes in Business Information Processing. Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">https://doi.org/10.1007/978-3-030-52306-0_18</a>.","ieee":"S. Gottschalk, E. Yigitbas, and G. Engels, “Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs,” in <i>Business Modeling and Software Design</i>, Potsdam, 2020, vol. 391, pp. 276–286.","mla":"Gottschalk, Sebastian, et al. “Model-Based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs.” <i>Business Modeling and Software Design</i>, edited by Boris Shishkov, vol. 391, Springer International Publishing, 2020, pp. 276–86, doi:<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>.","bibtex":"@inproceedings{Gottschalk_Yigitbas_Engels_2020, series={Lecture Notes in Business Information Processing}, title={Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs}, volume={391}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>}, booktitle={Business Modeling and Software Design}, publisher={Springer International Publishing}, author={Gottschalk, Sebastian and Yigitbas, Enes and Engels, Gregor}, editor={Shishkov, BorisEditor}, year={2020}, pages={276–286}, collection={Lecture Notes in Business Information Processing} }","short":"S. Gottschalk, E. Yigitbas, G. Engels, in: B. Shishkov (Ed.), Business Modeling and Software Design, Springer International Publishing, 2020, pp. 276–286.","apa":"Gottschalk, S., Yigitbas, E., &#38; Engels, G. (2020). Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs. In B. Shishkov (Ed.), <i>Business Modeling and Software Design</i> (Vol. 391, pp. 276–286). Potsdam: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">https://doi.org/10.1007/978-3-030-52306-0_18</a>"},"date_updated":"2022-01-06T06:52:59Z","oa":"1","volume":391,"author":[{"first_name":"Sebastian","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208"},{"first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"doi":"10.1007/978-3-030-52306-0_18","conference":{"start_date":"2020-07-06","name":"10th International Symposium on Business Modeling and Software Design ","location":"Potsdam","end_date":"2020-07-08"},"type":"conference","editor":[{"last_name":"Shishkov","full_name":"Shishkov, Boris","first_name":"Boris"}],"status":"public","_id":"16934","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"66"}],"user_id":"47208","series_title":"Lecture Notes in Business Information Processing","file_date_updated":"2020-07-14T09:28:33Z","year":"2020","publisher":"Springer International Publishing","date_created":"2020-05-04T12:27:38Z","title":"Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs","publication":"Business Modeling and Software Design","abstract":[{"text":"To build successful products, the developers have to adapt their product features and business models to uncertain customer needs. This adaptation is part of the research discipline of Hypotheses Engineering (HE) where customer needs can be seen as hypotheses that need to be tested iteratively by conducting experiments together with the customer. So far, modeling support and associated traceability of this iterative process are missing. Both, in turn, are important to document the adaptation to the customer needs and identify experiments that provide most evidence to the customer needs. To target this issue, we introduce a model-based HE approach with a twofold contribution: First, we develop a modeling language that models hypotheses and experiments as interrelated hierarchies together with a mapping between them. While the hypotheses are labeled with a score level of their current evidence, the experiments are labeled with a score level of maximum evidence that can be achieved during conduction. Second, we provide an iterative process to determine experiments that offer the most evidence improvement to the modeled hypotheses. We illustrate the usefulness of the approach with an example of testing the business model of a mobile application.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","creator":"sego","date_created":"2020-07-14T09:25:30Z","date_updated":"2020-07-14T09:28:33Z","access_level":"open_access","file_name":"BMSD20.pdf","file_id":"17380","file_size":267658}],"keyword":["Hypothesis Engineering","Model-based","Customer Need Adaptation","Business Model","Product Features"],"ddc":["006"],"language":[{"iso":"eng"}]},{"publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:52Z","title":"Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators","year":"2019","keyword":["benchmarking","instance features","optimization","problem generation","traveling salesperson problem"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","abstract":[{"lang":"eng","text":"Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation."}],"date_updated":"2023-12-13T10:42:57Z","author":[{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"last_name":"Neumann","full_name":"Neumann, Aneta","first_name":"Aneta"},{"last_name":"Wagner","full_name":"Wagner, Markus","first_name":"Markus"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"},{"first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann"}],"doi":"10.1145/3299904.3340307","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-6254-2"]},"place":"New York, NY, USA","citation":{"apa":"Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., &#38; Trautmann, H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 58–71. <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>","mla":"Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2019, pp. 58–71, doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>.","bibtex":"@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}, DOI={<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>}, booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19} }","short":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann, in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.","chicago":"Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” In <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 58–71. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>.","ieee":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann, “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,” in <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 2019, pp. 58–71, doi: <a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>.","ama":"Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. FOGA ’19. Association for Computing Machinery; 2019:58–71. doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>"},"page":"58–71","_id":"48842","series_title":"FOGA ’19","user_id":"102979","department":[{"_id":"819"}],"extern":"1","type":"conference","status":"public"},{"status":"public","abstract":[{"text":"Previous work by [1] studied gesture-speech interaction in adults. [1] focussed on temporal and semantic coordination of gesture and speech and found that while adult speech is mostly coordinated (or redundant) with gestures, semantic coordination increases the temporal synchrony. These observations do not necessarily hold for children (in particular with respect to iconic gestures, see [2]), where the speech and gesture systems are still under development. We studied the semantic and temporal coordination of speech and gesture in 4-year old children using a corpus of 40 children producing action descriptions in task oriented dialogues. In particular, we examined what kinds of information are transmitted verbally vs. non-verbally and how they are related. To account for this, we extended the semantic features (SFs) developed in [3] for object descriptions in order to include the semantics of actions. We coded the SFs on the children’s speech and gestures separately using video data. In our presentation, we will focus on the quantitative distribution of SFs across gesture and speech. Our results indicate that speech and gestures of 4-year olds are less integrated than those of the adults, although there is a large variability among the children. We will discuss the results with respect to the cognitive processes (e.g., visual memory, language) underlying children’s abilities at this stage of development. Our work paves the way for the cognitive architecture of speech-gesture interaction in preschoolers which to our knowledge is missing so far. ","lang":"eng"}],"publication":"KOGWIS2018: Computational Approaches to Cognitive Science","type":"conference","language":[{"iso":"eng"}],"keyword":["Speech-gesture integration","semantic features"],"department":[{"_id":"749"}],"user_id":"14931","_id":"17557","citation":{"ieee":"O. Abramov, S. Kopp, A. Nemeth, F. Kern, U. Mertens, and K. Rohlfing, “Towards a Computational Model of Child Gesture-Speech Production,” 2018.","chicago":"Abramov, Olga, Stefan Kopp, Anne Nemeth, Friederike Kern, Ulrich Mertens, and Katharina Rohlfing. “Towards a Computational Model of Child Gesture-Speech Production.” In <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>, 2018.","ama":"Abramov O, Kopp S, Nemeth A, Kern F, Mertens U, Rohlfing K. Towards a Computational Model of Child Gesture-Speech Production. In: <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>. ; 2018.","apa":"Abramov, O., Kopp, S., Nemeth, A., Kern, F., Mertens, U., &#38; Rohlfing, K. (2018). Towards a Computational Model of Child Gesture-Speech Production. <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>.","mla":"Abramov, Olga, et al. “Towards a Computational Model of Child Gesture-Speech Production.” <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>, 2018.","bibtex":"@inproceedings{Abramov_Kopp_Nemeth_Kern_Mertens_Rohlfing_2018, title={Towards a Computational Model of Child Gesture-Speech Production}, booktitle={KOGWIS2018: Computational Approaches to Cognitive Science}, author={Abramov, Olga and Kopp, Stefan and Nemeth, Anne and Kern, Friederike and Mertens, Ulrich and Rohlfing, Katharina}, year={2018} }","short":"O. Abramov, S. Kopp, A. Nemeth, F. Kern, U. Mertens, K. Rohlfing, in: KOGWIS2018: Computational Approaches to Cognitive Science, 2018."},"year":"2018","title":"Towards a Computational Model of Child Gesture-Speech Production","author":[{"last_name":"Abramov","full_name":"Abramov, Olga","first_name":"Olga"},{"last_name":"Kopp","full_name":"Kopp, Stefan","first_name":"Stefan"},{"full_name":"Nemeth, Anne","last_name":"Nemeth","first_name":"Anne"},{"full_name":"Kern, Friederike","last_name":"Kern","first_name":"Friederike"},{"last_name":"Mertens","full_name":"Mertens, Ulrich","first_name":"Ulrich"},{"first_name":"Katharina","last_name":"Rohlfing","full_name":"Rohlfing, Katharina","id":"50352"}],"date_created":"2020-08-03T11:00:54Z","date_updated":"2023-02-01T12:50:21Z"},{"date_updated":"2023-02-01T16:24:45Z","date_created":"2020-06-24T13:00:54Z","author":[{"first_name":"Olga","last_name":"Abramov","full_name":"Abramov, Olga"},{"full_name":"Kopp, Stefan","last_name":"Kopp","first_name":"Stefan"},{"last_name":"Nemeth","full_name":"Nemeth, Anne","first_name":"Anne"},{"last_name":"Kern","full_name":"Kern, Friederike","first_name":"Friederike"},{"first_name":"Ulrich","last_name":"Mertens","full_name":"Mertens, Ulrich"},{"first_name":"Katharina","last_name":"Rohlfing","full_name":"Rohlfing, Katharina","id":"50352"}],"title":"Towards a Computational Model of Child Gesture-Speech Production","year":"2018","citation":{"chicago":"Abramov, Olga, Stefan Kopp, Anne Nemeth, Friederike Kern, Ulrich Mertens, and Katharina Rohlfing. “Towards a Computational Model of Child Gesture-Speech Production.” In <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>, 2018.","ieee":"O. Abramov, S. Kopp, A. Nemeth, F. Kern, U. Mertens, and K. Rohlfing, “Towards a Computational Model of Child Gesture-Speech Production,” 2018.","ama":"Abramov O, Kopp S, Nemeth A, Kern F, Mertens U, Rohlfing K. Towards a Computational Model of Child Gesture-Speech Production. In: <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>. ; 2018.","apa":"Abramov, O., Kopp, S., Nemeth, A., Kern, F., Mertens, U., &#38; Rohlfing, K. (2018). Towards a Computational Model of Child Gesture-Speech Production. <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>.","bibtex":"@inproceedings{Abramov_Kopp_Nemeth_Kern_Mertens_Rohlfing_2018, title={Towards a Computational Model of Child Gesture-Speech Production}, booktitle={KOGWIS2018: Computational Approaches to Cognitive Science}, author={Abramov, Olga and Kopp, Stefan and Nemeth, Anne and Kern, Friederike and Mertens, Ulrich and Rohlfing, Katharina}, year={2018} }","short":"O. Abramov, S. Kopp, A. Nemeth, F. Kern, U. Mertens, K. Rohlfing, in: KOGWIS2018: Computational Approaches to Cognitive Science, 2018.","mla":"Abramov, Olga, et al. “Towards a Computational Model of Child Gesture-Speech Production.” <i>KOGWIS2018: Computational Approaches to Cognitive Science</i>, 2018."},"_id":"17179","department":[{"_id":"749"}],"user_id":"14931","keyword":["Speech-gesture integration","semantic features"],"language":[{"iso":"eng"}],"publication":"KOGWIS2018: Computational Approaches to Cognitive Science","type":"conference","abstract":[{"lang":"eng","text":"Previous work by [1] studied gesture-speech interaction in adults. [1] focussed on temporal and semantic coordination of gesture and speech and found that while adult speech is mostly coordinated (or redundant) with gestures, semantic coordination increases the temporal synchrony. These observations do not necessarily hold for children (in particular with respect to iconic gestures, see [2]), where the speech and gesture systems are still under development. We studied the semantic and temporal coordination of speech and gesture in 4-year old children using a corpus of 40 children producing action descriptions in task oriented dialogues. In particular, we examined what kinds of information are transmitted verbally vs. non-verbally and how they are related. To account for this, we extended the semantic features (SFs) developed in [3] for object descriptions in order to include the semantics of actions. We coded the SFs on the children’s speech and gestures separately using video data. In our presentation, we will focus on the quantitative distribution of SFs across gesture and speech. Our results indicate that speech and gestures of 4-year olds are less integrated than those of the adults, although there is a large variability among the children. We will discuss the results with respect to the cognitive processes (e.g., visual memory, language) underlying children’s abilities at this stage of development. Our work paves the way for the cognitive architecture of speech-gesture interaction in preschoolers which to our knowledge is missing so far. "}],"status":"public"},{"volume":60,"author":[{"last_name":"Schryen","full_name":"Schryen, Guido","id":"72850","first_name":"Guido"},{"full_name":"Wagner, Gerit","last_name":"Wagner","first_name":"Gerit"},{"last_name":"Schlegel","full_name":"Schlegel, Alexander","first_name":"Alexander"}],"oa":"1","date_updated":"2022-01-06T07:02:10Z","intvolume":"        60","page":"95-116","citation":{"chicago":"Schryen, Guido, Gerit Wagner, and Alexander Schlegel. “Development of Two Novel Face-Recognition CAPTCHAs: A Security and Usability Study.” <i>Computers &#38; Security</i> 60, no. July (2016): 95–116.","ieee":"G. Schryen, G. Wagner, and A. Schlegel, “Development of two novel face-recognition CAPTCHAs: a security and usability study,” <i>Computers &#38; Security</i>, vol. 60, no. July, pp. 95–116, 2016.","ama":"Schryen G, Wagner G, Schlegel A. Development of two novel face-recognition CAPTCHAs: a security and usability study. <i>Computers &#38; Security</i>. 2016;60(July):95-116.","bibtex":"@article{Schryen_Wagner_Schlegel_2016, title={Development of two novel face-recognition CAPTCHAs: a security and usability study}, volume={60}, number={July}, journal={Computers &#38; Security}, publisher={Elsevier}, author={Schryen, Guido and Wagner, Gerit and Schlegel, Alexander}, year={2016}, pages={95–116} }","mla":"Schryen, Guido, et al. “Development of Two Novel Face-Recognition CAPTCHAs: A Security and Usability Study.” <i>Computers &#38; Security</i>, vol. 60, no. July, Elsevier, 2016, pp. 95–116.","short":"G. Schryen, G. Wagner, A. Schlegel, Computers &#38; Security 60 (2016) 95–116.","apa":"Schryen, G., Wagner, G., &#38; Schlegel, A. (2016). Development of two novel face-recognition CAPTCHAs: a security and usability study. <i>Computers &#38; Security</i>, <i>60</i>(July), 95–116."},"has_accepted_license":"1","extern":"1","file_date_updated":"2018-12-13T15:07:36Z","department":[{"_id":"277"}],"user_id":"61579","_id":"5617","status":"public","type":"journal_article","title":"Development of two novel face-recognition CAPTCHAs: a security and usability study","date_created":"2018-11-14T14:00:47Z","publisher":"Elsevier","year":"2016","issue":"July","language":[{"iso":"eng"}],"keyword":["CAPTCHA","Usability","Facial features","Gender classiffcation","Age classification","Face recognition reverse Turing test"],"ddc":["000"],"file":[{"file_id":"6029","access_level":"open_access","file_name":"cose_991_final.pdf","file_size":2983143,"date_created":"2018-12-07T11:38:19Z","creator":"hsiemes","date_updated":"2018-12-13T15:07:36Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"CAPTCHAs are challenge-response tests that aim at preventing unwanted machines, including bots, from accessing web services while providing easy access for humans. Recent advances in artificial-intelligence based attacks show that the level of security provided by many state-of-the-art text-based CAPTCHAs is declining. At the same time, techniques for distorting and obscuring the text, which are used to maintain the level of security, make text-based CAPTCHAs diffcult to solve for humans, and thereby further degrade usability. The need for developing alternative types of CAPTCHAs which improve both, the current security and usability levels, has been emphasized by several researchers. With this study, we contribute to research through (1) the development of two new face recognition CAPTCHAs (Farett-Gender and Farett-Gender&Age), (2) the security analysis of both procedures, and (3) the provision of empirical evidence that one of the suggested CAPTCHAs (Farett-Gender) is similar to Google's reCAPTCHA and better than KCAPTCHA concerning effectiveness (error rates), superior to both regarding learnability and satisfaction but not effciency.","lang":"eng"}],"publication":"Computers & Security"},{"publication_identifier":{"issn":["2329-9290"]},"issue":"1","year":"2014","citation":{"apa":"Leutnant, V., Krueger, A., &#38; Haeb-Umbach, R. (2014). A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech. <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, <i>22</i>(1), 95–109. <a href=\"https://doi.org/10.1109/TASLP.2013.2285480\">https://doi.org/10.1109/TASLP.2013.2285480</a>","bibtex":"@article{Leutnant_Krueger_Haeb-Umbach_2014, title={A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech}, volume={22}, DOI={<a href=\"https://doi.org/10.1109/TASLP.2013.2285480\">10.1109/TASLP.2013.2285480</a>}, number={1}, journal={IEEE/ACM Transactions on Audio, Speech, and Language Processing}, author={Leutnant, Volker and Krueger, Alexander and Haeb-Umbach, Reinhold}, year={2014}, pages={95–109} }","mla":"Leutnant, Volker, et al. “A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech.” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, vol. 22, no. 1, 2014, pp. 95–109, doi:<a href=\"https://doi.org/10.1109/TASLP.2013.2285480\">10.1109/TASLP.2013.2285480</a>.","short":"V. Leutnant, A. Krueger, R. Haeb-Umbach, IEEE/ACM Transactions on Audio, Speech, and Language Processing 22 (2014) 95–109.","ieee":"V. Leutnant, A. Krueger, and R. Haeb-Umbach, “A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech,” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>, vol. 22, no. 1, pp. 95–109, 2014.","chicago":"Leutnant, Volker, Alexander Krueger, and Reinhold Haeb-Umbach. “A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech.” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i> 22, no. 1 (2014): 95–109. <a href=\"https://doi.org/10.1109/TASLP.2013.2285480\">https://doi.org/10.1109/TASLP.2013.2285480</a>.","ama":"Leutnant V, Krueger A, Haeb-Umbach R. A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech. <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>. 2014;22(1):95-109. doi:<a href=\"https://doi.org/10.1109/TASLP.2013.2285480\">10.1109/TASLP.2013.2285480</a>"},"intvolume":"        22","page":"95-109","date_updated":"2022-01-06T06:51:11Z","author":[{"first_name":"Volker","last_name":"Leutnant","full_name":"Leutnant, Volker"},{"first_name":"Alexander","last_name":"Krueger","full_name":"Krueger, Alexander"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"date_created":"2019-07-12T05:29:41Z","volume":22,"title":"A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech","doi":"10.1109/TASLP.2013.2285480","type":"journal_article","publication":"IEEE/ACM Transactions on Audio, Speech, and Language Processing","abstract":[{"text":"In this contribution we present a theoretical and experimental investigation into the effects of reverberation and noise on features in the logarithmic mel power spectral domain, an intermediate stage in the computation of the mel frequency cepstral coefficients, prevalent in automatic speech recognition (ASR). Gaining insight into the complex interaction between clean speech, noise, and noisy reverberant speech features is essential for any ASR system to be robust against noise and reverberation present in distant microphone input signals. The findings are gathered in a probabilistic formulation of an observation model which may be used in model-based feature compensation schemes. The proposed observation model extends previous models in three major directions: First, the contribution of additive background noise to the observation error is explicitly taken into account. Second, an energy compensation constant is introduced which ensures an unbiased estimate of the reverberant speech features, and, third, a recursive variant of the observation model is developed resulting in reduced computational complexity when used in model-based feature compensation. The experimental section is used to evaluate the accuracy of the model and to describe how its parameters can be determined from test data.","lang":"eng"}],"status":"public","_id":"11861","user_id":"44006","department":[{"_id":"54"}],"keyword":["computational complexity","reverberation","speech recognition","automatic speech recognition","background noise","clean speech","computational complexity","energy compensation","logarithmic mel power spectral domain","mel frequency cepstral coefficients","microphone input signals","model-based feature compensation schemes","noisy reverberant speech automatic recognition","noisy reverberant speech features","reverberation","Atmospheric modeling","Computational modeling","Noise","Noise measurement","Reverberation","Speech","Vectors","Model-based feature compensation","observation model for reverberant and noisy speech","recursive observation model","robust automatic speech recognition"],"language":[{"iso":"eng"}]},{"publication":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)","type":"conference","status":"public","abstract":[{"text":"Soft-feature based speech recognition, which is an example of uncertainty decoding, has been proven to be a robust error mitigation method for distributed speech recognition over wireless channels exhibiting bit errors. In this paper we extend this concept to packet-oriented transmissions. The a posteriori probability density function of the lost feature vector, given the closest received neighbours, is computed. In the experiments, the nearest frame repetition, which is shown to be equivalent to the MAP estimate, outperforms the MMSE estimate for long bursts. Taking the variance into account at the speech recognition stage results in superior performance compared to classical schemes using point estimates. A computationally and memory efficient implementation of the proposed packet loss compensation scheme based on table lookup is presented","lang":"eng"}],"department":[{"_id":"54"}],"user_id":"44006","_id":"11824","language":[{"iso":"eng"}],"keyword":["distributed speech recognition","least mean squares methods","MAP estimate","maximum likelihood estimation","MMSE estimate","packet loss compensation scheme","packet switched communication","posteriori probability density function","robust error mitigation method","soft-features","speech recognition","table lookup","voice communication","wireless channels"],"intvolume":"         1","page":"I","citation":{"ama":"Ion V, Haeb-Umbach R. An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features. In: <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)</i>. Vol 1. ; 2006:I. doi:<a href=\"https://doi.org/10.1109/ICASSP.2006.1659984\">10.1109/ICASSP.2006.1659984</a>","ieee":"V. Ion and R. Haeb-Umbach, “An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features,” in <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)</i>, 2006, vol. 1, p. I.","chicago":"Ion, Valentin, and Reinhold Haeb-Umbach. “An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features.” In <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)</i>, 1:I, 2006. <a href=\"https://doi.org/10.1109/ICASSP.2006.1659984\">https://doi.org/10.1109/ICASSP.2006.1659984</a>.","bibtex":"@inproceedings{Ion_Haeb-Umbach_2006, title={An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features}, volume={1}, DOI={<a href=\"https://doi.org/10.1109/ICASSP.2006.1659984\">10.1109/ICASSP.2006.1659984</a>}, booktitle={IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)}, author={Ion, Valentin and Haeb-Umbach, Reinhold}, year={2006}, pages={I} }","mla":"Ion, Valentin, and Reinhold Haeb-Umbach. “An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features.” <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)</i>, vol. 1, 2006, p. I, doi:<a href=\"https://doi.org/10.1109/ICASSP.2006.1659984\">10.1109/ICASSP.2006.1659984</a>.","short":"V. Ion, R. Haeb-Umbach, in: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006), 2006, p. I.","apa":"Ion, V., &#38; Haeb-Umbach, R. (2006). An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features. In <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006)</i> (Vol. 1, p. I). <a href=\"https://doi.org/10.1109/ICASSP.2006.1659984\">https://doi.org/10.1109/ICASSP.2006.1659984</a>"},"year":"2006","volume":1,"author":[{"first_name":"Valentin","full_name":"Ion, Valentin","last_name":"Ion"},{"full_name":"Haeb-Umbach, Reinhold","id":"242","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"date_created":"2019-07-12T05:28:58Z","oa":"1","date_updated":"2022-01-06T06:51:10Z","doi":"10.1109/ICASSP.2006.1659984","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2006/IoHa06-2.pdf"}],"title":"An Inexpensive Packet Loss Compensation Scheme for Distributed Speech Recognition Based on Soft-Features"},{"intvolume":"        48","page":"1435-1446","citation":{"ama":"Ion V, Haeb-Umbach R. Uncertainty decoding for distributed speech recognition over error-prone networks. <i>Speech Communication</i>. 2006;48(11):1435-1446. doi:<a href=\"https://doi.org/10.1016/j.specom.2006.03.007\">10.1016/j.specom.2006.03.007</a>","ieee":"V. Ion and R. Haeb-Umbach, “Uncertainty decoding for distributed speech recognition over error-prone networks,” <i>Speech Communication</i>, vol. 48, no. 11, pp. 1435–1446, 2006.","chicago":"Ion, Valentin, and Reinhold Haeb-Umbach. “Uncertainty Decoding for Distributed Speech Recognition over Error-Prone Networks.” <i>Speech Communication</i> 48, no. 11 (2006): 1435–46. <a href=\"https://doi.org/10.1016/j.specom.2006.03.007\">https://doi.org/10.1016/j.specom.2006.03.007</a>.","apa":"Ion, V., &#38; Haeb-Umbach, R. (2006). Uncertainty decoding for distributed speech recognition over error-prone networks. <i>Speech Communication</i>, <i>48</i>(11), 1435–1446. <a href=\"https://doi.org/10.1016/j.specom.2006.03.007\">https://doi.org/10.1016/j.specom.2006.03.007</a>","short":"V. Ion, R. Haeb-Umbach, Speech Communication 48 (2006) 1435–1446.","bibtex":"@article{Ion_Haeb-Umbach_2006, title={Uncertainty decoding for distributed speech recognition over error-prone networks}, volume={48}, DOI={<a href=\"https://doi.org/10.1016/j.specom.2006.03.007\">10.1016/j.specom.2006.03.007</a>}, number={11}, journal={Speech Communication}, author={Ion, Valentin and Haeb-Umbach, Reinhold}, year={2006}, pages={1435–1446} }","mla":"Ion, Valentin, and Reinhold Haeb-Umbach. “Uncertainty Decoding for Distributed Speech Recognition over Error-Prone Networks.” <i>Speech Communication</i>, vol. 48, no. 11, 2006, pp. 1435–46, doi:<a href=\"https://doi.org/10.1016/j.specom.2006.03.007\">10.1016/j.specom.2006.03.007</a>."},"doi":"10.1016/j.specom.2006.03.007","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2006/IoHa06-3.pdf"}],"volume":48,"author":[{"first_name":"Valentin","full_name":"Ion, Valentin","last_name":"Ion"},{"last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242","first_name":"Reinhold"}],"oa":"1","date_updated":"2022-01-06T06:51:10Z","status":"public","type":"journal_article","department":[{"_id":"54"}],"user_id":"44006","_id":"11825","year":"2006","issue":"11","title":"Uncertainty decoding for distributed speech recognition over error-prone networks","date_created":"2019-07-12T05:28:59Z","abstract":[{"lang":"eng","text":"In this paper, we propose an enhanced error concealment strategy at the server side of a distributed speech recognition (DSR) system, which is fully compatible with the existing DSR standard. It is based on a Bayesian approach, where the a posteriori probability density of the error-free feature vector is computed, given all received feature vectors which are possibly corrupted by transmission errors. Rather than computing a point estimate, such as the MMSE estimate, and plugging it into the Bayesian decision rule, we employ uncertainty decoding, which results in an integration over the uncertainty in the feature domain. In a typical scenario the communication between the thin client, often a mobile device, and the recognition server spreads across heterogeneous networks. Both bit errors on circuit-switched links and lost data packets on IP connections are mitigated by our approach in a unified manner. The experiments reveal improved robustness both for small- and large-vocabulary recognition tasks."}],"publication":"Speech Communication","language":[{"iso":"eng"}],"keyword":["Channel error robustness","Distributed speech recognition","Soft features","Uncertainty decoding"]},{"date_created":"2019-07-12T05:29:02Z","author":[{"full_name":"Ion, Valentin","last_name":"Ion","first_name":"Valentin"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","id":"242","full_name":"Haeb-Umbach, Reinhold"}],"volume":1,"oa":"1","date_updated":"2022-01-06T06:51:10Z","main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2005/IoHa05-2.pdf","open_access":"1"}],"doi":"10.1109/ICASSP.2005.1415118","title":"A Comparison of Soft-Feature Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services","citation":{"apa":"Ion, V., &#38; Haeb-Umbach, R. (2005). A Comparison of Soft-Feature Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services. In <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)</i> (Vol. 1, pp. 333–336). <a href=\"https://doi.org/10.1109/ICASSP.2005.1415118\">https://doi.org/10.1109/ICASSP.2005.1415118</a>","bibtex":"@inproceedings{Ion_Haeb-Umbach_2005, title={A Comparison of Soft-Feature Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services}, volume={1}, DOI={<a href=\"https://doi.org/10.1109/ICASSP.2005.1415118\">10.1109/ICASSP.2005.1415118</a>}, booktitle={IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)}, author={Ion, Valentin and Haeb-Umbach, Reinhold}, year={2005}, pages={333–336} }","mla":"Ion, Valentin, and Reinhold Haeb-Umbach. “A Comparison of Soft-Feature Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services.” <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)</i>, vol. 1, 2005, pp. 333–36, doi:<a href=\"https://doi.org/10.1109/ICASSP.2005.1415118\">10.1109/ICASSP.2005.1415118</a>.","short":"V. Ion, R. Haeb-Umbach, in: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005), 2005, pp. 333–336.","ama":"Ion V, Haeb-Umbach R. A Comparison of Soft-Feature Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services. In: <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)</i>. Vol 1. ; 2005:333-336. doi:<a href=\"https://doi.org/10.1109/ICASSP.2005.1415118\">10.1109/ICASSP.2005.1415118</a>","ieee":"V. Ion and R. Haeb-Umbach, “A Comparison of Soft-Feature Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services,” in <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)</i>, 2005, vol. 1, pp. 333–336.","chicago":"Ion, Valentin, and Reinhold Haeb-Umbach. “A Comparison of Soft-Feature Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services.” In <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)</i>, 1:333–36, 2005. <a href=\"https://doi.org/10.1109/ICASSP.2005.1415118\">https://doi.org/10.1109/ICASSP.2005.1415118</a>."},"intvolume":"         1","page":"333-336","year":"2005","user_id":"44006","department":[{"_id":"54"}],"_id":"11828","language":[{"iso":"eng"}],"keyword":["adaptive codes","adaptive multirate codec","AMR","distributed speech recognition","ETSI","extended advanced front-end","recognition performance","SFDSR","simulated GSM transmission","soft-feature distributed speech recognition","speech codecs","speech coding","speech recognition","variable rate codes","XAFE"],"type":"conference","publication":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)","status":"public","abstract":[{"text":"In this paper we present a comparison of the recently proposed Soft-Feature Distributed Speech Recognition (SFDSR) with the two evaluated candidate codecs for Speech Enabled Services over wireless networks: Adaptive Multirate Codec (AMR) and the ETSI Extended Advanced Front-End for Distributed Speech Recognition (XAFE). It is shown that SFDSR achieves the best recognition performance on a simulated GSM transmission, followed by XAFE and AMR.We also present some new results concerning SFDSR which demonstrate the versatility of the approach. Further, a simple method is introduced which considerably reduces the computational effort.","lang":"eng"}]},{"status":"public","abstract":[{"lang":"eng","text":"In the direct parameter specification (DPS) mode of sensorimotor control, response parameters can be specified by stimuli that are not consciously perceived [Psychological Research/Psychologische Forschung 52 (1990) 207]. DPS is contingent on the current intentions. The invisible stimuli can be processed for the purposes of sensorimotor control only if they match the actual intentions, for example, share task-relevant features. The present experiments explore whether attentional capture by masked abrupt-onset stimuli is mediated via DPS. Participants judged which of two visual targets appeared first. Masked primes preceded one of the targets. The primes were either similar to the targets or not, in shape, or in color. Target-like (task-relevant), but not distractor-like (task-irrelevant), primes facilitated perceptual latencies of targets trailing at their positions. Thus, the latency effects resulted from DPS of an attention shift, rather than from bottom-up capture or from top-down "}],"type":"journal_article","publication":"Vision Research","language":[{"iso":"eng"}],"extern":"1","keyword":["direct parameter specification","DPS","attention shift","latency priming","sensorimotor control","stimuli","task-relevant features","visual targets","color","shape","latency effects","Adult","Attention","Discrimination (Psychology)","Female","Humans","Judgment","Male","Perceptual Masking","Reaction Time","Visual Perception","Attention","Perceptual Motor Processes","Response Latency","Stimulus Onset","Visual Stimulation","Form and Shape Perception","Sensory Adaptation"],"user_id":"42165","department":[{"_id":"424"}],"_id":"6065","citation":{"apa":"Scharlau, I., &#38; Ansorge, U. (2003). Direct parameter specification of an attention shift: Evidence from perceptual latency priming. <i>Vision Research</i>, <i>43</i>(12), 1351–1363.","bibtex":"@article{Scharlau_Ansorge_2003, title={Direct parameter specification of an attention shift: Evidence from perceptual latency priming.}, volume={43}, number={12}, journal={Vision Research}, author={Scharlau, Ingrid and Ansorge, Ulrich}, year={2003}, pages={1351–1363} }","mla":"Scharlau, Ingrid, and Ulrich Ansorge. “Direct Parameter Specification of an Attention Shift: Evidence from Perceptual Latency Priming.” <i>Vision Research</i>, vol. 43, no. 12, 2003, pp. 1351–63.","short":"I. Scharlau, U. Ansorge, Vision Research 43 (2003) 1351–1363.","ama":"Scharlau I, Ansorge U. Direct parameter specification of an attention shift: Evidence from perceptual latency priming. <i>Vision Research</i>. 2003;43(12):1351-1363.","chicago":"Scharlau, Ingrid, and Ulrich Ansorge. “Direct Parameter Specification of an Attention Shift: Evidence from Perceptual Latency Priming.” <i>Vision Research</i> 43, no. 12 (2003): 1351–63.","ieee":"I. Scharlau and U. Ansorge, “Direct parameter specification of an attention shift: Evidence from perceptual latency priming.,” <i>Vision Research</i>, vol. 43, no. 12, pp. 1351–1363, 2003."},"page":"1351 - 1363","intvolume":"        43","year":"2003","issue":"12","publication_status":"published","publication_identifier":{"issn":["0042-6989"]},"main_file_link":[{"open_access":"1","url":"https://kw.uni-paderborn.de/fileadmin/fakultaet/Institute/psychologie/Kognitive_Psychologie/Publikationen/ScharlauAnsorge2003VisResDPS.pdf"}],"title":"Direct parameter specification of an attention shift: Evidence from perceptual latency priming.","date_created":"2018-12-10T07:01:37Z","author":[{"id":"451","full_name":"Scharlau, Ingrid","orcid":"0000-0003-2364-9489","last_name":"Scharlau","first_name":"Ingrid"},{"first_name":"Ulrich","full_name":"Ansorge, Ulrich","last_name":"Ansorge"}],"volume":43,"oa":"1","date_updated":"2022-06-07T00:26:34Z"},{"main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2000/LiHa00.pdf"}],"doi":"10.1109/ICASSP.2000.859157","title":"LDA derived cepstral trajectory filters in adverse environmental conditions","author":[{"first_name":"M.","last_name":"Lieb","full_name":"Lieb, M."},{"first_name":"Reinhold","id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach"}],"date_created":"2019-07-12T05:29:50Z","volume":2,"oa":"1","date_updated":"2022-01-06T06:51:11Z","citation":{"chicago":"Lieb, M., and Reinhold Haeb-Umbach. “LDA Derived Cepstral Trajectory Filters in Adverse Environmental Conditions.” In <i>IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000)</i>, 2:II1105-II1108 vol.2, 2000. <a href=\"https://doi.org/10.1109/ICASSP.2000.859157\">https://doi.org/10.1109/ICASSP.2000.859157</a>.","ieee":"M. Lieb and R. Haeb-Umbach, “LDA derived cepstral trajectory filters in adverse environmental conditions,” in <i>IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000)</i>, 2000, vol. 2, pp. II1105-II1108 vol.2.","ama":"Lieb M, Haeb-Umbach R. LDA derived cepstral trajectory filters in adverse environmental conditions. In: <i>IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000)</i>. Vol 2. ; 2000:II1105-II1108 vol.2. doi:<a href=\"https://doi.org/10.1109/ICASSP.2000.859157\">10.1109/ICASSP.2000.859157</a>","bibtex":"@inproceedings{Lieb_Haeb-Umbach_2000, title={LDA derived cepstral trajectory filters in adverse environmental conditions}, volume={2}, DOI={<a href=\"https://doi.org/10.1109/ICASSP.2000.859157\">10.1109/ICASSP.2000.859157</a>}, booktitle={IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000)}, author={Lieb, M. and Haeb-Umbach, Reinhold}, year={2000}, pages={II1105-II1108 vol.2} }","short":"M. Lieb, R. Haeb-Umbach, in: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000), 2000, pp. II1105-II1108 vol.2.","mla":"Lieb, M., and Reinhold Haeb-Umbach. “LDA Derived Cepstral Trajectory Filters in Adverse Environmental Conditions.” <i>IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000)</i>, vol. 2, 2000, pp. II1105-II1108 vol.2, doi:<a href=\"https://doi.org/10.1109/ICASSP.2000.859157\">10.1109/ICASSP.2000.859157</a>.","apa":"Lieb, M., &#38; Haeb-Umbach, R. (2000). LDA derived cepstral trajectory filters in adverse environmental conditions. In <i>IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000)</i> (Vol. 2, pp. II1105-II1108 vol.2). <a href=\"https://doi.org/10.1109/ICASSP.2000.859157\">https://doi.org/10.1109/ICASSP.2000.859157</a>"},"page":"II1105-II1108 vol.2","intvolume":"         2","year":"2000","language":[{"iso":"eng"}],"keyword":["acoustic echo cancellation algorithms","adverse environmental conditions","automatic speech recognition","cepstral analysis","cepstral features","cepstral mean normalization","command word task","delta-delta features","delta features","echo suppression","error rate reductions","feature vector components","FIR filters","LDA derived cepstral trajectory filters","linear discriminant analysis","long-range feature filters","phone accuracy","real-life room impulse responses","reverberant data","spectral parameters","speech recognition","standard TIMIT phone recognition task"],"user_id":"44006","department":[{"_id":"54"}],"_id":"11869","status":"public","abstract":[{"text":"Amongst several data driven approaches for designing filters for the time sequence of spectral parameters, the linear discriminant analysis (LDA) based method has been proposed for automatic speech recognition. Here we apply LDA-based filter design to cepstral features, which better match the inherent assumption of this method that feature vector components are uncorrelated. Extensive recognition experiments have been conducted both on the standard TIMIT phone recognition task and on a proprietary 130-words command word task under various adverse environmental conditions, including reverberant data with real-life room impulse responses and data processed by acoustic echo cancellation algorithms. Significant error rate reductions have been achieved when applying the novel long-range feature filters compared to standard approaches employing cepstral mean normalization and delta and delta-delta features, in particular when facing acoustic echo cancellation scenarios and room reverberation. For example, the phone accuracy on reverberated TIMIT data could be increased from 50.7\\% to 56.0\\%","lang":"eng"}],"type":"conference","publication":"IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2000)"}]