TY - JOUR A1 - Wenninger, Marc A1 - Bayerl, Sebastian P. A1 - Schmidt, Jochen A1 - Riedhammer, Korbinian T1 - Timage – A Robust Time Series Classification Pipeline JF - Artificial Neural Networks and Machine Learning – ICANN 2019: Text and Time Series. ICANN 2019. Lecture Notes in Computer Science N2 - Time series are series of values ordered by time. This kind of data can be found in many real world settings. Classifying time series is a difficult task and an active area of research. This paper investigates the use of transfer learning in Deep Neural Networks and a 2D representation of time series known as Recurrence Plots. In order to utilize the research done in the area of image classification, where Deep Neural Networks have achieved very good results, we use a Residual Neural Networks architecture known as ResNet. As preprocessing of time series is a major part of every time series classification pipeline, the method proposed simplifies this step and requires only few parameters. For the first time we propose a method for multi time series classification: Training a single network to classify all datasets in the archive with one network. We are among the first to evaluate the method on the latest 2018 release of the UCR archive, a well established time series classification benchmarking dataset. KW - neural networks Y1 - 2019 VL - 11730 PB - Springer CY - Cham ER - TY - JOUR A1 - Wenninger, Marc A1 - Stecher, Dominik A1 - Schmidt, Jochen T1 - SVM-Based Segmentation of Home Appliance Energy Measurements JF - Proceedings 8th IEEE International Conference on Machine Learning and Applications -ICMLA 2019 N2 - Generating a more detailed understanding of domestic electricity demand is a major topic for energy suppliers and householders in times of climate change. Over the years there have been many studies on consumption feedback systems to inform householders, disaggregation algorithms for Non-Intrusive-Load-Monitoring (NILM), Real-Time-Pricing (RTP) to promote supply aware behavior through monetary incentives and appliance usage prediction algorithms. While these studies are vital steps towards energy awareness, one of the most fundamental challenges has not yet been tackled: Automated detection of start and stop of usage cycles of household appliances. We argue that most research efforts in this area will benefit from a reliable segmentation method to provide accurate usage information. We propose a SVM-based segmentation method for home appliances such as dishwashers and washing machines. The method is evaluated using manually annotated electricity measurements of five different appliances recorded over two years in multiple households. KW - Machine Learning Y1 - 2019 SP - 1666 EP - 1670 ER - TY - BOOK A1 - Schmidt, Jochen T1 - Grundkurs Informatik - Das Übungsbuch: 148 Aufgaben mit Lösungen KW - Grundlagen Übungen Y1 - 2019 SN - 978-3658259440 PB - Springer Vieweg CY - Wiesbaden ET - 1 ER - TY - CHAP A1 - Goeller, Toni A1 - Wenninger, Marc A1 - Schmidt, Jochen T1 - Towards Cost-Effective Utility Business Models - Selecting a Communication Architecture for the Rollout of New Smart Energy Services T2 - Proceedings of the 7th International Conference on Smart Cities and Green ICT Systems - Volume 1: SMARTGREENS N2 - The IT architecture for meter reading and utility services is at the core of new business models and has a decisive role as an enabler for resource efficiency measures. The communication architecture used by those services has significant impact on cost, flexibility and speed of new service rollout. This article describes how the dominant system model for meter reading came about, what alternative models exist, and what trade-offs those models have for rollout of new services by different stakeholders. Control of a self learning home automation system by dynamic tariff information (Real-Time-Pricing) is given as an application example. KW - Smart Meter, Advanced Metering Infrastructure, AMI Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:861-opus4-8332 SN - 978-989-758-292-9 SP - 231 EP - 237 PB - SciTePress ER - TY - CHAP A1 - Armengaud, Erik A1 - Macher, Georg A1 - Massoner, Alexander A1 - Frager, Sebastian A1 - Adler, Rasmus A1 - Schneider, Daniel A1 - Longo, Simone A1 - Melis, Massimiliano A1 - Groppo, Riccardo A1 - Villa, Federica A1 - O’Leary, Padraig A1 - Bambury, Kevin A1 - Anita, Finnegan A1 - Zeller, Marc A1 - Höfig, Kai A1 - Papadopoulos, Yiannis A1 - Hawkins, Richard A1 - Kelly, Tim T1 - DEIS: Dependability Engineering Innovation for Industrial CPS T2 - Advanced Microsystems for Automotive Applications 2017 N2 - The open and cooperative nature of Cyber-Physical Systems (CPS) poses new challenges in assuring dependability. The DEIS project (Dependability Engineering Innovation for automotive CPS. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 732242, see http://www.deis-project.eu) addresses these challenges by developing technologies that form a science of dependable system integration. In the core of these technologies lies the concept of a Digital Dependability Identity (DDI) of a component or system. DDIs are modular, composable, and executable in the field facilitating (a) efficient synthesis of component and system dependability information over the supply chain and (b) effective evaluation of this information in-the-field for safe and secure composition of highly distributed and autonomous CPS. The paper outlines the DDI concept and opportunities for application in four industrial use cases. KW - Industrial CPS KW - Dependability Engineering KW - Automotive Applications Y1 - 2018 SP - 151 EP - 163 PB - Springer CY - Cham ER - TY - CHAP A1 - Scheffler, T. A1 - Gehde, M. A1 - Späth, M. A1 - Karlinger, Peter T1 - Nutzung von Werkzeug und Maschinendaten zur Ermittlung des Fließerhaltens T2 - Technomer Chemnitz KW - Fließerhalten Y1 - 2017 ER - TY - CHAP A1 - Wenninger, Marc A1 - Schmidt, Jochen A1 - Goeller, Toni T1 - Appliance Usage Prediction for the Smart Home with an Application to Energy Demand Side Management - And Why Accuracy is not a Good Performance Metric for this Problem. T2 - 6th International Conference on Smart Cities and Green ICT Systems (SMARTGREENS) N2 - Shifting energy peak load is a subject that plays a huge role in the currently changing energy market, where renewable energy sources no longer produce the exact amount of energy demanded. Matching demand to supply requires behavior Changes on the customerside, which can be achieved by incentives suchas Real-Time-Pricing (RTP). Various studies show that such incentives cannot be utilized without a complexity reduction, e.g., by smart home automation systems that inform the customer about possible savings or automatically schedule appliances to off-peak load phases. We propose a probabilistic appliance usage prediction based on historical energy data that can be used to identify the times of day where an appliance will be used and therefore make load shift recommendations that suite the customer’s usage profile. A huge issue is how to provide a valid performance evaluation for this particular problem. We will argue why the commonly used accuracy metric is not suitable, and suggest to use other metrics like the area under the Receiver Operating Characteristic (ROC) curve, Matthews Correlation Coefficient (MCC) or F1-Score instead. KW - Real Time Pricing (RTP) KW - Household Appliance Usage Prediction KW - Demand Side Management Y1 - 2017 ER - TY - CHAP A1 - Möhrle, Felix A1 - Bizik, Kai A1 - Zeller, Marc A1 - Höfig, Kai A1 - Rothfelder, Martin A1 - Liggesmeyer, Peter T1 - A Formal Approach for Automating Compositional Safety Analysis Using Flow Type Annotations In Component Fault Trees T2 - Proceedings of the 27th European Safety and Reliability Conference (ESREL): Safety and Reliability – Theory and Applications., Portorož, Slovenia: Taylor & Francis (CRC Press). N2 - Safety assurance is a major challenge in the design of modern embedded systems that has become increasingly difficult in recent years. Growing system sizes and the rise of Cyber-Physical systems confront safety engineers with large sets of configurations to be analyzed. Current approaches are usually carried out at design time and do not address the need for automated assessments in the field. With Component Fault Trees (CFTs) there exists a component-based methodology that enables an efficient modular composition of safety artifacts. The combined model is a system-level CFT that can be analyzed by means of popular Fault Tree Analysis techniques that are widely accepted in the industry. However, when composing models, their interfacing elements must be connected manually which impedes the automation of the procedure. In this work, we introduce the notion of flow types that represent a particular kind of component interaction and define a taxonomy of related failure behavior. By annotating CFTs with types, a machine-readable vocabulary is provided that allows for an automated interconnection of their interfaces. This way, the automatic composition of models according to system architecture is enabled, allowing for automated safety assessments on system-level. We demonstrate the feasibility of our approach using an example ethylene vaporization unit. KW - Compositional safety analysis KW - Flow type annotations KW - CFT Y1 - 2017 ER - TY - CHAP A1 - Zeller, Marc A1 - Höfig, Kai A1 - Schwinn, Jean-Pascal T1 - ArChes—Automatic generation of component fault trees from continuous function charts T2 - 2017 IEEE 15th International Conference on Industrial Informatics (INDIN), July 2017, Emden, Germany. N2 - The growing size and complexity of software in embedded systems poses new challenges to the safety assessment of embedded control systems. In industrial practice, the control software is mostly treated as a black box during the system's safety analysis. The appropriate representation of the failure propagation of the software is a pressing need in order to increase the accuracy of safety analyses. However, it also increase the effort for creating and maintaining the safety analysis models (such as fault trees) significantly. In this work, we present a method to automatically generate Component Fault Trees from Continuous Function Charts. This method aims at generating the failure propagation model of the detailed software specification. Hence, control software can be included into safety analyses without additional manual effort required to construct the safety analysis models of the software. Moreover, safety analyses created during early system specification phases can be verified by comparing it with the automatically generated one in the detailed specification phased. KW - Industrial Informatics KW - CFT KW - Function charts Y1 - 2017 ER - TY - JOUR A1 - Frank, Ludwig T1 - The Binomial and Negative Binomial Distribution in Discrete Time Markov Chains JF - Markov Processes And Related Fields N2 - The classical results of the binomial and negative binomial probability distribution are generalized by means of homogeneous Discrete Time Markov Chains to series of stochastically independent random trials. These have not only two possible outcomes but two groups of them -- different kinds of successes and failures with occurrence probabilities depending on the outcome of the previous trial. This generalization allows a uniform view of occupation time, first passage time and recurrence time. Our results are consequently derived and presented in matrix form, the probabilities as well as the moments. They can be applied to all Discrete Time Markov Chains, especially in computer capacity planning, performability and economics. KW - discrete time Markov Chains KW - binomial distribution KW - matrix representation KW - recurrence time KW - first passage time KW - occupation time Y1 - 2017 VL - 23 IS - 3 SP - 377 EP - 400 ER - TY - GEN A1 - Beneken, Gerd ED - Sigs- Datacom Verlag, T1 - http://www.sigs-datacom.de/fachzeitschriften/agile-sw-entwicklung-und-architektur-poster-2016.html N2 - Fachposter zur agilen Softwareentwicklung und -Architektur KW - agile Software- Entwicklung KW - Software- Architektur Y1 - 2018 ER - TY - BOOK A1 - Petkovic, Dusan T1 - 6. Auflage: Microsoft SQL Server 2016: A Beginner's Guide N2 - Get up and running on Microsoft SQL Server 2016 in no time with help from this thoroughly revised, practical resource. The book offers thorough coverage of SQL management and development and features full details on the newest business intelligence, reporting, and security features. Filled with new real-world examples and hands-on exercises, Microsoft SQL Server 2016: A Beginner's Guide, Sixth Edition, starts by explaining fundamental relational database system concepts. From there, you will learn how to write Transact-SQL statements, execute simple and complex database queries, handle system administration and security, and use the powerful analysis and BI tools. XML, spatial data, and full-text search are also covered in this step-by-step tutorial. · Revised from the ground up to cover the latest version of SQL Server · Ideal both as a self-study guide and a classroom textbook · Written by a prominent professor and best-selling author KW - Sql server KW - Microsoft KW - Database Y1 - 2018 SN - 978-1-25-964179-4 PB - McGraw- Hill Osborne Media CY - Columbus, Ohio ET - 6 ER - TY - CHAP A1 - Möhrle, Felix A1 - Zeller, Marc A1 - Höfig, Kai A1 - Rothfelder, Martin A1 - Liggesmeyer, Peter T1 - Automating compositional safety analysis using a failure type taxonomy for component fault trees T2 - Risk, Reliability and Safety: Innovating Theory and Practice: Proc. of ESREL N2 - Safety assurance is a major challenge in the design of today’s complex embedded systems and future Cyber-physical systems. Changes in a system’s architectural design invalidate former safety analyses and require a manual adaptation of related safety analysis models in order to restore consistency. In this work, we present an approach for automating the compositional assembly of Component Fault Trees by automatically generating mappings between their input and output failure modes. Therefore, we propose a taxonomy of failure types for annotating model elements and deriving a model of the failure propagation. This way, automatic and system-wide safety analyses can be executed and easily repeated after making modifications to the system’s architecture. We demonstrate the feasibility of our approach using an example ethylene vaporization unit from an industrial domain. KW - Compositional safety analysis KW - CFT Y1 - 2016 SP - 1380 EP - 1387 ER - TY - CHAP A1 - Zeller, Marc A1 - Höfig, Kai T1 - INSiDER: Incorporation of system and safety analysis models using a dedicated reference model T2 - 2016 Annual Reliability and Maintainability Symposium (RAMS) N2 - In order to enable model-based, iterative design of safety-relevant systems, an efficient incorporation of safety and system engineering is a pressing need. Our approach interconnects system design and safety analysis models efficiently using a dedicated reference model. Since all information are available in a structured way, traceability between the model elements and consistency checks enable automated synchronization to guarantee that information within both kind of models are consistent during the development life-cycle. KW - Safety KW - CFT Y1 - 2016 SP - 1 EP - 6 ER - TY - GEN A1 - Höfig, Kai T1 - Automated Recertification of a Safety Critical System N2 - A method for automated recertification of a safety critical system with at least one altered functionality is provided. The method includes providing a failure propagation model of the safety critical system. The method also includes updating the failure propagation model of the safety critical system according to the at least one altered functionality using inner port dependency traces between inports and outports of a failure propagation model element representing the at least one altered functionality. The method includes calculating top events of the updated failure propagation model, and comparing the calculated top events with predetermined system requirements to recertify the safety critical system. KW - Automated recertification KW - Safety-critical systems Y1 - 2016 N1 - US Patent App. 14/586,818 ER - TY - GEN A1 - Höfig, Kai T1 - Analyzing the availability of a system N2 - An apparatus and method for analyzing availability of a system including subsystems each having at least one failure mode with a corresponding failure effect on the system are provided. The apparatus includes a degraded mode tree generation unit configured to automatically generate a degraded mode tree. The degraded mode tree includes at least one degraded mode element representing a degraded system state of the system that deviates from a normal operation state of the system based on a predetermined generic system meta model stored in a database including Failure Mode and Effects Analysis elements representing subsystems, failure modes, failure effects, and diagnostic measures. The apparatus also includes a processor configured to evaluate the generated degraded mode tree for calculation of the availability of the system. KW - System availability KW - Mode trees KW - Failure Mode Y1 - 2016 N1 - US Patent App. 15/048,644 ER - TY - GEN A1 - Höfig, Kai A1 - Zeller, Marc T1 - Automated Qualification of a Safety Critical System N2 - A method for automated qualification of a safety critical system including a plurality of components is provided. A functional safety behavior of each component is represented by an associated component fault tree element. The method includes automatically performing a failure port mapping of output failure modes to input failure modes of component fault tree elements based on a predetermined generic fault type data model stored in a database. KW - Automated qualification KW - Safety-critical systems KW - Fault trees Y1 - 2016 N1 - US Patent App. 14/644,119 ER - TY - CHAP A1 - Faria, Arlo A1 - Riedhammer, Korbinian A1 - Janin, Adam A1 - Bauer, A. T1 - REMEETING: Searchable Conversations T2 - INTERSPEECH 2016, Annual Conference of the International Speech Communication Association (ISCA), IEEE Workshop on Spoken Language Technologies (SLT), San Francisco, USA, September 2016. KW - Speech Recognition Y1 - 2016 ER - TY - BOOK A1 - Ernst, H. A1 - Schmidt, Jochen A1 - Beneken, Gerd T1 - Grundkurs Informatik: Grundlagen und Konzepte für die erfolgreiche IT-Praxis - Eine umfassende, praxisorientierte Einführung N2 - Zahlensysteme und binäre Arithmetik Nachricht und Information Codierung und Datenkompression Verschlüsselung Schaltalgebra, Schaltnetze und Elemente der Computerhardware Rechnerarchitekturen Rechnernetze Betriebssysteme Datenbanken Automatentheorie und formale Sprachen Berechenbarkeit und Komplexität Suchen und Sortieren Bäume und Graphen prozedurale und objektorientierte Programmierung (C und Java) Anwendungsprogrammierung im Internet (HTML, CSS, JavaScript und PHP) Software-Engineering KW - Informatik KW - Anwendungsprogrammierung im Internet Y1 - 2016 PB - Springer Vieweg CY - Berlin ER - TY - BOOK A1 - Beneken, Gerd A1 - Ernst, H. A1 - Schmidt, Jochen T1 - Grundkurs Informatik: Grundlagen und Konzepte für die erfolgreiche IT-Praxis - Eine umfassende, praxisorientierte Einführung (Auflage von 2015) N2 - Das Buch bietet eine umfassende und praxisorientierte Einführung in die wesentlichen Grundlagen und Konzepte der Informatik. Es umfasst den Stoff, der typischerweise in den ersten Semestern eines Informatikstudiums vermittelt wird, vertieft Zusammenhänge, die darüber hinausgehen und macht sie verständlich. Die Themenauswahl orientiert sich an der langfristigen Relevanz für die praktische Anwendung. Praxisnah und aktuell werden die Inhalte für Studierende der Informatik und verwandter Studiengänge sowie für im Beruf stehende Praktiker vermittelt. Die vorliegende fünfte Auflage wurde grundlegend überarbeitet und aktualisiert. KW - Informatik KW - Lehrbuch KW - IT- Praxis Y1 - 2015 PB - Springer Vieweg CY - Berlin ER - TY - GEN A1 - Beneken, Gerd ED - Software & Support Media GmbH, T1 - PHP ist nur was für Hackerbuden? Über die Bedeutung von PHP im Informatikstudium", N2 - Vortrag zum Thema PHP im Informatikstudium KW - PHP KW - Informatikstudium Y1 - 2018 ER - TY - GEN A1 - Beneken, Gerd ED - Gesellschaft für Informatik, T1 - Fail Better: Erfahrungen aus 12 Jahren Requirements Engineering in studentischen Projekten" N2 - Vortrag zum Thema Requirements Engineering in studentischen Projekten KW - Requirements Engineering KW - Informatikstudium Y1 - 2018 ER - TY - GEN A1 - Beneken, Gerd ED - Sigs- Datacom Verlag, T1 - Agiles Projektmanagement N2 - Fachposter zum Thema Agiles Projektmanagement KW - Projektmanagement Y1 - 2018 ER - TY - CHAP A1 - Höfig, Kai A1 - Zeller, Marc A1 - Heilmann, Reiner T1 - ALFRED: a methodology to enable component fault trees for layered architectures T2 - 2015 41st Euromicro Conference on Software Engineering and Advanced Applications (SEAA), August 2015,Funchal, Portugal. IEEE. N2 - Identifying drawbacks or insufficiencies in terms of safety is important also in early development stages of safety critical systems. In industry, development artefacts such as components or units, are often reused from existing artefacts to save time and costs. When development artefacts are reused, their existing safety analysis models are an important input for an early safety assessment for the new system, since they already provide a valid model. Component fault trees support such reuse strategies by a compositional horizontal approach. But current development strategies do not only divide systems horizontally, e.g., By encapsulating different functionality into separate components and hierarchies of components, but also vertically, e.g. Into software and hardware architecture layers. Current safety analysis methodologies, such as component fault trees, do not support such vertical layers. Therefore, we present here a methodology that is able to divide safety analysis models into different layers of a systems architecture. We use so called Architecture Layer Failure Dependencies to enable component fault trees on different layers of an architecture. These dependencies are then used to generate safety evidence for the entire system and over all different architecture layers. A case study applies the approach to hardware and software layers. KW - Fault trees KW - Layered architecture Y1 - 2015 SP - 167 EP - 176 ER - TY - CHAP A1 - Höfig, Kai A1 - Zeller, Marc A1 - Schorp, Konstantin T1 - Automated failure propagation using inner port dependency traces T2 - 2015 11th International ACM SIGSOFT Conference on Quality of Software Architectures (QoSA), Mai 2015, Montreal, QC, Canada. N2 - Safety assurance is a major challenge in the design of complex embedded and Cyber-physical Systems. Especially, changes and adoptions during the design or run-time of an embedded system invalidate former safety analyses and require an adaptation of the system's safety analysis models. In this paper, we present a methodology to fill up empty safety analysis artifacts in component fault trees using so-called inner port dependency traces to describe failure propagation. Thus, enabling a imprecise but rapid safety analysis of an entire system at early development stages or during system run-time for the automated certification of Cyber-physical Systems. We evaluate our approach using case study from the automotive domain. KW - Failure propagation KW - Port dependency traces KW - Cyber-physical Systems KW - Software safety Y1 - 2015 SP - 123 EP - 128 ER - TY - CHAP A1 - Möhrle, Felix A1 - Zeller, Marc A1 - Höfig, Kai A1 - Rothfelder, Martin A1 - Liggesmeyer, Peter T1 - Automated compositional safety analysis using component fault trees T2 - Proceedings of the IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW 2015), November 2015, Gaithersburg, MD. N2 - Safety assurance is a major challenge in the design of today's complex embedded systems and future Cyber-physical systems. Especially changes in a system's architectural design invalidate former safety analyses and require an adaptation of related safety analysis models in order to restore consistency. In this work, we present an approach for automatically generating mappings between failure ports in compositional safety analysis models. This way, automatic and system-wide safety analyses are enabled that can be easily repeated after making modifications to the system's architecture. We demonstrate the feasibility of our approach using a case study from the automotive domain. KW - Safety KW - Fault trees KW - Adaption models KW - Automotive Engineering Y1 - 2015 SP - 152 EP - 159 ER - TY - GEN A1 - Guo, Zhensheng A1 - Höfig, Kai T1 - Integrated Model-Based Safety Analysis N2 - A method for integrated model-based safety analysis includes integrating a safety analysis model into a system development model of a safety-critical system. The system development model includes model components. The safety analysis model models a failure logic separately for each of the model components. The method includes representing dependencies among the model components with a design structure matrix. The design structure matrix represents each of the model components with a row and a column and shows dependencies between model components with corresponding entries. The method also includes sequencing the design structure matrix, and identifying at least one dependency loop and loop components in the sequenced design structure matrix. The loop components are part of the at least one dependency loop. KW - Integrated model-based safety analysis KW - Safety-critical systems Y1 - 2015 N1 - US Patent App. 14/066,403 ER - TY - CHAP A1 - Faria, Arlo A1 - Riedhammer, Korbinian T1 - REMEETING — Get More Out Of Meetings T2 - INTERSPEECH 2015, 16th Annual Conference of the International Speech Communication Association, Dresden, Germany, September 2015. N2 - Remeeting is a tool that helps you get more out of in-person meetings. Calendar integration and a special email address allow users to email agenda items prior to a certain meeting. A discrete notification at the time of the meeting reminds the user to start the recording. During the meeting, the user focuses on the conversation, or can add notes and photos if desired. After the meeting, every participant gets notified by an automated email that lists the participants along with automatically extracted keywords, notes and photos. This stimulates collaboration, and keeps follow-up contributions at a central place: Just reply to add further notes to the meeting. The resulting meeting “document” can be shared with others and reviewed using a web app that acts as a visual index to the meeting. This makes Remeeting the perfect tool for regular group meetings, standups and interviews, where people typically track progress and follow up on. Remeeting is leveraging, promoting and contributing to open source projects including kaldi and docker. KW - Speech Recognition KW - speaker identification KW - automatic summarization KW - productivity Y1 - 2015 ER - TY - GEN A1 - Beneken, Gerd ED - Sigs- Datacom Verlag, T1 - Agiles Requirements Engineering N2 - Fachposter zum Thema Agiles Requirements Engineering KW - Requirements Engineering KW - Software Y1 - 2018 ER - TY - CHAP A1 - Jarz, Ewald ED - TUS, T1 - Review of the Austrian and German E-Governance Concept T2 - VI-th International Scientific Conference "E-GOVERNANCE" jointly with the "Science Days – 2014" of TU-Sofia, 2014 KW - E-Governance KW - Austria KW - Germany Y1 - 2014 ER - TY - CHAP A1 - Höfig, Kai A1 - Armbruster, Michael A1 - Schmidt, Reiner T1 - A vehicle control platform as safety element out of context. T2 - HiPEAC Computing Systems Week, Barcelona, Spain, May 2014. KW - Vehicle control platform KW - Software safety Y1 - 2014 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Bocklet, Tobias A1 - Orozco-Arroyave, Juan Rafael A1 - Nöth, Elmar T1 - Semi-Automatic Calibration for Dereverberation by Spectral Subtraction for Continuous Speech Recognition T2 - ITG Symposium on Speech Communication 2014, Erlangen. N2 - In this article, we describe a semi-automatic calibration algorithm for dereverberation by spectral subtraction. We verify the method by a comparison to a manual calibration derived from measured room impulse responses (RIR). We conduct extensive experiments to understand the effect of all involved parameters and to verify values suggested in the literature. The experiments are performed on a text read by 31 speakers and recorded by a headset and three far-field microphones. Results are measured in terms of automatic speech recognition (ASR) performance using a 1-gram model to emphasize acoustic recognition performance. To accommodate for the acoustic change by dereverberation we apply supervised MAP adaptation to the hidden Markov model output probabilities. The combination of dereverberation and adaptation yields a relative improvement of about 35% in terms of word error rate (WER) compared to the original signal. KW - Speech Recognition Y1 - 2014 PB - VDE VERLAG GMBH ER - TY - CHAP A1 - Ghahremani, Pegah A1 - BabaAli, Bagher A1 - Povey, Daniel A1 - Riedhammer, Korbinian A1 - Trmal, Jan A1 - Khudanpur, Sanjeev T1 - A Pitch Extraction Algorithm Tuned for Automatic Speech Recognition T2 - 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Florence, Italy, May 2014. N2 - In this paper we present an algorithm that produces pitch and probability-of-voicing estimates for use as features in automatic speech recognition systems. These features give large performance improvements on tonal languages for ASR systems, and even substantial improvements for non-tonal languages. Our method, which we are calling the Kaldi pitch tracker (because we are adding it to the Kaldi ASR toolkit), is a highly modified version of the getf0 (RAPT) algorithm. Unlike the original getf0 we do not make a hard decision whether any given frame is voiced or unvoiced; instead, we assign a pitch even to unvoiced frames while constraining the pitch trajectory to be continuous. Our algorithm also produces a quantity that can be used as a probability of voicing measure; it is based on the normalized autocorrelation measure that our pitch extractor uses. We present results on data from various languages in the BABEL project, and show a large improvement over systems without tonal features and systems where pitch and POV information was obtained from SAcC or getf0. KW - Automatic Speech Recognition Y1 - 2014 PB - IEEE ER - TY - CHAP A1 - Bocklet, Tobias A1 - Maier, Andreas A1 - Riedhammer, Korbinian A1 - Eysholdt, Ulrich A1 - Nöth, Elmar T1 - Erlangen-CLP: A Large Annotated Corpus of Speech from Children with Cleft Lip and Palate. T2 - Language Resources and Evaluation Conference (LREC), Reykjavik, Iceland, May 2014. N2 - In this paper we describe Erlangen-CLP, a large speech database of children with Cleft Lip and Palate. More than 800 German children with CLP (most of them between 4 and 18 years old) and 380 age matched control speakers spoke the semi-standardized PLAKSS test that consists of words with all German phonemes in different positions. So far 250 CLP speakers were manually transcribed, 120 of these were analyzed by a speech therapist and 27 of them by four additional therapists. The tharapists marked 6 different processes/criteria like pharyngeal backing and hypernasality which typically occur in speech of people with CLP. We present detailed statistics about the the marked processes and the inter-rater agreement. KW - Cleft Lip and palate KW - pathologic speech KW - Children's Speech Y1 - 2014 ER - TY - CHAP A1 - Faria, Arlo A1 - Riedhammer, Korbinian T1 - REMEETING — Get More Out of Meetings T2 - INTERSPEECH 2014, 15th Annual Conference of the International Speech Communication Association, IEEE Workshop on Spoken Language Technologies (SLT), Singapore, September 2014. KW - Speech Recognition KW - speaker identification KW - automatic summarization KW - productivity Y1 - 2014 ER - TY - BOOK A1 - Hammerschall, Ulrike A1 - Beneken, Gerd T1 - Software Requirements (Pearson Studium - IT) N2 - Das Lehrbuch Software Requirements von Ulrike Hammerschall und Gerd Beneken führt in die Grundkonzepte des Requirements Engineering ein und zeigt anhand vieler anschaulicher Beispiele, wie man systematisch und methodisch bei der Ermittlung, Dokumentation, Spezifikation, Modellierung, Validierung und Verwaltung von Software Requirements vorgeht. Mit seinem Inhalt und didaktisch wertvollem Aufbau richtet sich das Buch an Studierende der Fachrichtung Informatik und Wirtschaftsinformatik, sowie aller verwandten Fachrichtungen, die sich mit den Themen Software Engineering oder Requirements Engineering beschäftigen. Software Requirements sind die Anforderungen der Anwender an die Funktionalität eines geplanten Software-Systems. Requirements Engineering ist der Prozess zur methodischen Erhebung und Beschreibung der Anforderungen. Die Kunst eines guten Requirements Engineerings ist die Entwicklung einer stabilen Anforderungsbasis als zuverlässige Grundlage für die weitere Entwicklung der Software. Das vorliegende Buch führt in die Grundkonzepte des Requirements Engineering ein und zeigt anhand vieler Beispiele, wie man systematisch und methodisch bei der Ermittlung, Dokumentation, Spezifikation, Modellierung, Validierung und Verwaltung von Software Requirements vorgeht. Ausführliche Methodenbeschreibungen dienen zur Erläuterung und ein durchgängiges Fallbeispiel hilft dem Leser die Anwendung der Methoden nachzuvollziehen. Mit Hilfe der Übungen am Ende jedes Kapitels, können die Methoden selbst eingeübt werden. Neben dem klassischen Dokument-getriebenen Requirements Engineering beschäftigt sich das Buch mit den Methoden des agilen Requirements Engineering und vergleicht die beiden Ansätze. Zusätzlich bietet das Buch einen Blick über den Tellerrand und betrachtet die Schnittstellen des Requirements Engineerings zu anderen Teilprozessen im Entwicklungsprozess. Das Buch richtet sich an Studierende der Fachrichtung Informatik und Wirtschaftsinformatik, sowie aller verwandten Fachrichtungen, die sich mit den Themen Software Engineering oder Requirements Engineering beschäftigen. - Der RE-Prozess, Vorgehen und Methodik. - Anforderungsermittlung, -dokumentation und -spezifikation. - Querschnittliche Aufgaben wie Validierung, Modellierung und Management von Anforderungen - Agiles RE, Vorgehen und Methodik. - Schnittstellen zu benachbarten Teilprozessen (Projektmanagement, Qualitätsmanagement, Software-Architektur) sowie zum Usability Engineering. - Einführung und Verbesserung des Requirements Engineering Prozesses in einer Organisation. KW - Software Requirements KW - Software Engineering KW - Requirements Engineering KW - Studium Informatik KW - Studium Wirtschaftsinformatik Y1 - 2013 PB - Pearson Studium CY - Hallbergmoos ER - TY - GEN A1 - Beneken, Gerd ED - BICCnet, T1 - Studienziel: Software Ingenieur(in), Studentische Projekte mit KMU N2 - Agenda: Studienziel Software-Ingenieur(in) � Projekte im Rahmen des Informatik-Studiums � Projektbeispiele -IT Partner in Forschungsprojekten Labor für Software-Technik -IT Partner in Forschungsprojekten -Einzelanfertigungen für genau einen Kunden -Unterstützung von Startups / Testen von Geschäftsideen -Projekte mit kleinen und mittleren Unternehmen � Zusammenarbeit mit FH: Nächste Schritte KW - Software Engineering KW - kleine und mittelständische Unternehmen (KMU) Y1 - 2018 ER - TY - CHAP A1 - Jung, Jessica A1 - Höfig, Kai A1 - Domis, Dominik A1 - Jedlitschka, Andreas A1 - Hiller, Martin T1 - Experimental comparison of two safety analysis methods and its replication T2 - 2013 ACM / IEEE International Symposium on Empirical Software Engineering and Measurement, December 2013, Baltimore, MD, USA. N2 - (Background) Empirical Software Engineering (SE) strives to provide empirical evidence about the pros and cons of SE approaches. This kind of knowledge becomes relevant when the issue is whether to change from a currently employed approach to a new one or not. An informed decision is required and is particularly important in the development of safety-critical systems. For example, for the safety analysis of safety-critical embedded systems, methods such as Failure Mode and Effect Analysis (FMEA) and Fault Tree Analysis (FTA) are used. With the advent of model-based systems and software development, the question arises whether safety engineering methods should also be adopted. New technologies such as Component Integrated Fault Trees (CFT) come into play. Industry demands to know the benefits of these new methods over established ones such as Fault Trees (FT). (Methods) For the purpose of comparing CFT and FT with regard to the capabilities of the safety analysis methods (such as quality of the results) and to the participants' rating of the consistency, clarity, and maintainability of the methods, we designed a comparative study as a controlled experiment using a within-subject design. The experiment was run with seven academic staff members working towards their PhD. The study was replicated with eleven domain experts from industry. (Results) Although the analysis of the tasks' solutions showed that the use of CFT did not yield a significantly different number of correct or incorrect solutions, the participants rated the modeling capacities of CFT higher in terms of model consistency, clarity, and maintainability. (Conclusion) From this first evidence, we conclude that CFT have the potential of being beneficial for companies looking for a safety analysis approachfor projects using model-based development. KW - Safety Analysis KW - CFT KW - FMEA Y1 - 2013 SN - 978-0-7695-5056-5 SP - 223 EP - 232 ER - TY - CHAP A1 - Jung, Jessica A1 - Jedlitschka, Andreas A1 - Höfig, Kai A1 - Domis, Dominik A1 - Hiller, Martin T1 - A controlled experiment on component fault trees T2 - International Conference on Computer Safety, Reliability, and Security (SAFECOMP 2013) N2 - In safety analysis for safety-critical embedded systems, methods such as FMEA and fault trees (FT) are strongly established in practice. However, the current shift towards model-based development has resulted in various new safety analysis methods, such as Component Integrated Fault Trees (CFT). Industry demands to know the benefits of these new methods. To compare CFT to FT, we conducted a controlled experiment in which 18 participants from industry and academia had to apply each method to safety modeling tasks from the avionics domain. Although the analysis of the solutions showed that the use of CFT did not yield a significantly different number of correct or incorrect solutions, the participants subjectively rated the modeling capacities of CFT significantly higher in terms of model consistency, clarity, and maintainability. The results are promising for the potential of CFT as a model-based approach. KW - Safety-critical embedded systems KW - FMEA KW - CFT Y1 - 2013 SP - 285 EP - 292 PB - Springer CY - Berlin, Heidelberg ER - TY - CHAP A1 - Wegmann, Steven A1 - Faria, Arlo A1 - Janin, Adam A1 - Riedhammer, Korbinian A1 - Morgan, Nelson T1 - The Tao of ATWV: Probing the mysteries of keyword search performance T2 - IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU), Olomouc, Czech Republic, Dezember 2013. N2 - In this paper we apply diagnostic analysis to gain a deeper understanding of the performance of the the keyword search system that we have developed for conversational telephone speech in the IARPA Babel program. We summarize the Babel task, its primary performance metric, “actual term weighted value” (ATWV), and our recognition and keyword search systems. Our analysis uses two new oracle ATWV measures, a bootstrap-based ATWV confidence interval, and includes a study of the underpinnings of the large ATWV gains due to system combination. This analysis quantifies the potential ATWV gains from improving the number of true hits and the overall quality of the detection scores in our system's posting lists. It also shows that system combination improves our systems' ATWV via a small increase in the number of true hits in the posting lists. KW - Speech Recognition Y1 - 2013 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Gropp, Martin A1 - Bocklet, Tobias A1 - Hönig, Florian A1 - Nöth, Elmar A1 - Steidl, Stefan T1 - LMELectures: A Multimedia Corpus of Academic Spoken English T2 - First Workshop on Speech, Language and Audio in Multimedia (SLAM 2013), Marseille, France, August 2013, ISCA Archive. N2 - This paper describes the acquisition, transcription and annotation of a multi-media corpus of academic spoken English, the LMELectures. It consists of two lecture se-ries that were read in the summer term 2009 at the com-puter science department of the University of Erlangen-Nuremberg, covering topics in pattern analysis, machine learning and interventional medical image processing. In total, about 40 hours of high-definition audio and video of a single speaker was acquired in a constant recording en-vironment. In addition to the recordings, the presentation slides are available in machine readable (PDF) format. The manual annotations include a suggested segmenta-tion into speech turns and a complete manual transcrip-tion that was done using BLITZSCRIBE2, a new tool for the rapid transcription. For one lecture series, the lecturer assigned key words to each recordings; one recording of that series was further annotated with a list of ranked key phrases by five human annotators each. The corpus is available for non-commercial purpose upon request. KW - corpus description KW - academic spoken English KW - e-learning Y1 - 2013 SP - 102 EP - 107 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Hai Do, Van A1 - Hieronymus, James T1 - A Study on LVCSR and Keyword Search for Tagalog T2 - INTERSPEECH 2013, 14th Annual Conference of the International Speech Communication Association (ISCA), Lyon, France, August 2013. N2 - We describe a state-of-the-art large vocabulary continuous speech recognition (LVCSR) and keyword search (KWS) system trained on roughly 70 hours of conversational telephone speech. Using the Kaldi speech recognition toolkit, we investigate several aspects: for the acoustic front-end, we analyze the use of mel-frequency cepstral coefficients (MFCC), pitch and probability-of-voicing (PoV), and deep neural network (DNN) bottleneck (BN) features, as well as their feature-level combination ("tandem"). For the acousticphonetic decision tree, we explore different hidden Markov model (HMM) topologies for the glottalization phoneme /?/ to model its typically short duration. For the acoustic model, we compare regular continuous HMM with a sort of multi-codebook subspace Gaussian mixture model (SGMM) that lead to an overall best word error rate (WER) of 58.7% and 56.3%, respectively. The KWS is implemented as a word lattice search, and is augmented by a syllable lattice back-up search to capture out-of-vocabulary keywords as well as misrecognized lexical surface forms due to ambiguous prefix and hyphenation rules. KW - Speech Recognition KW - keyword spotting Y1 - 2013 ER - TY - CHAP A1 - Bocklet, Tobias A1 - Riedhammer, Korbinian A1 - Eysholdt, Ulrich A1 - Nöth, Elmar T1 - Automatic Phoneme Analysis in Children with Cleft Lip and Palate T2 - 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vancouver, BC, Canada, May 2013. N2 - Cleft Lip and Palate (CLP) is among the most frequent congenital abnormalities. The impaired facial development affects the articulation, with different phonemes being impacted inhomogeneously among different patients. This work focuses on automatic phoneme analysis of children with CLP for a detailed diagnosis and therapy control. In clinical routine, the state-of-the-art evaluation is based on perceptual evaluations. Perceptual ratings act as ground-truth throughout this work, with the goal to build an automatic system that is as reliable as humans. We propose two different automatic systems focusing on modeling the articulatory space of a speaker: one system models a speaker by a GMM, the other system employs a speech recognition system and estimates fMLLR matrices for each speaker. SVR is then used to predict the perceptual ratings. We show that the fMLLR-based system is able to achieve automatic phoneme evaluation results that are in the same range as perceptual inter-rater-agreements. KW - Pathology KW - automatic assessment KW - spectral features KW - GMM KW - fMLLR Y1 - 2013 SP - 7572 EP - 7576 PB - IEEE ER - TY - CHAP A1 - Zenger, A. A1 - Schmidt, Jochen A1 - Krödel, M. T1 - Towards the Intelligent Home: Using Reinforcement-Learning for Optimal Heating Control T2 - Advances in Artificial Intelligence, Proceedings of the 36th Annual Conference on AI, volume 8077 of Lecture Notes in Artificial Intelligence N2 - We propose a reinforcement learning approach to heating control in home automation, that can acquire a set of rules enabling an agent to heat a room to the desired temperature at a defined time while conserving as much energy as possible. Experimental results are presented that show the feasibility of our method. KW - Target Temperature KW - Reward Function KW - Heating control KW - Home Automation KW - Approximate dynamic program Y1 - 2013 PB - Springer ER - TY - BOOK A1 - Petkovic, Dusan T1 - 5. Auflage- Microsoft SQL Server 2012 A Beginner's Guide N2 - Get Started on Microsoft SQL Server 2012 in No TimeLearn to use all of the powerful features available in SQL Server 2012 quickly and easily. Microsoft SQL Server 2012: A Beginner's Guide explains the fundamentals of each topic alongside examples and tutorials that walk you through real-world database tasks. Install SQL Server 2012, construct high-performance databases, use powerful Transact-SQL statements, create stored procedures and triggers, and execute simple and complex database queries. Performance tuning, Database Engine security, Business Intelligence, and XML are also covered. Set up, configure, and maintain SQL Server 20012 Build and manage database objects using Transact-SQL statements Create stored procedures and user-defined functionsOptimize database performance, availability, and reliabilityImplement solid security using authentication, encryption, and authorization Automate tasks using SQL Server AgentCreate reliable data backups and perform flawless system restoresUse all-new SQL Server 2012 Business Intelligence, development, and administration toolsLearn in detail the SQL Server XML technology (SQLXML) KW - Sql server KW - Microsoft KW - Database Y1 - 2018 SN - 978-0-07-176160-4 PB - McGraw- Hill Osborne Media CY - Columbus, Ohio ER - TY - RPRT A1 - Jarz, Ewald T1 - Skriptum Geschäftsprozesse N2 - In diesem Skriptum sind die wesentlichen Methoden zur Modellierung, Gestaltung, Planung, Steuerung und Automatisierung von Geschäftsprozessen zusammengefasst und erläutert. KW - Geschäftsprozessmodellierung, UML, BPMN, ARIS, EPK Y1 - 2012 ER - TY - CHAP A1 - Höfig, Kai T1 - Failure-dependent timing analysis-a new methodology for probabilistic worst-case execution time analysis T2 - International GI/ITG Conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance. N2 - Embedded real-time systems are growing in complexity, which goes far beyond simplistic closed-loop functionality. Current approaches for worst-case execution time (WCET) analysis are used to verify the deadlines of such systems. These approaches calculate or measure the WCET as a single value that is expected as an upper bound for a system’s execution time. Overestimations are taken into account to make this upper bound a safe bound, but modern processor architectures expand those overestimations into unrealistic areas. Therefore, we present in this paper how of safety analysis model probabilities can be combined with elements of system development models to calculate a probabilistic WCET. This approach can be applied to systems that use mechanisms belonging to the area of fault tolerance, since such mechanisms are usually quantified using safety analyses to certify the system as being highly reliable or safe. A tool prototype implementing this approach is also presented which provides reliable safe upper bounds by performing a static WCET analysis and which overcomes the frequently encountered problem of dependence structures by using a fault injection approach. KW - Fault tolerance KW - Embedded real-time systems KW - Software safety KW - WCET Y1 - 2012 SP - 61 EP - 75 PB - Springer CY - Berlin, Heidelberg ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Gropp, Martin A1 - Nöth, Elmar T1 - The FAU Video Lecture Browser System T2 - 2012 IEEE Spoken Language Technology Workshop (SLT), Miami, FL, USA, December 2012. N2 - A growing number of universities and other educational institutions provide recordings of lectures and seminars as an additional resource to the students. In contrast to educational films that are scripted, directed and often shot by film professionals, these plain recordings are typically not post-processed in an editorial sense. Thus, the videos often contain longer periods of inactivity or silence, unnecessary repetitions, or corrections of prior mistakes. This paper describes the FAU Video Lecture Browser system, a web-based platform for the interactive assessment of video lectures, that helps to close the gap between a plain recording and a useful e-learning resource by displaying automatically extracted and ranked key phrases on an augmented time line based on stream graphs. In a pilot study, users of the interface were able to complete a topic localization task about 29 % faster than users provided with the video only while achieving about the same accuracy. The user interactions can be logged on the server to collect data to evaluate the quality of the phrases and rankings, and to train systems that produce customized phrase rankings. KW - automatic speech recognition KW - key phrase extraction KW - key phrase ranking KW - visualization KW - user interaction Y1 - 2012 SP - 392 EP - 397 PB - IEEE ER - TY - CHAP A1 - Hönig, Florian A1 - Bocklet, Tobias A1 - Riedhammer, Korbinian A1 - Batliner, Anton A1 - Nöth, Elmar T1 - The Automatic Assessment of Non-native Prosody: Combining Classical Prosodic Analysis with Acoustic Modelling T2 - INTERSPEECH 2012, 13th Annual Conference of the International Speech Communication Association (ISCA), Portland, OR, USA, September 2012. N2 - In earlier studies, we assessed the degree of non-nativeness employing prosodic information. In this paper, we combine prosodic information with (1) features derived from a Gaussian Mixture Model used as Universal Background Model (GMM-UBM), a powerful approach used in speaker identification, and (2) openSMILE, a standard open-source toolkit for extracting acoustic features. We evaluate our approach with English speech from 94 non-native speakers. GMM-UBM or openSMILE modelling alone yields lower performance than our prosodic feature vector; however, adding information from the GMM-UBM modelling or openSMILE by late fusion improves results. KW - computer-assisted language learning KW - non-native prosody KW - rhythm KW - automatic assessment Y1 - 2012 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Ring, Martin A1 - Nöth, Elmar A1 - Kolb, Daniel T1 - A Software Kit for Automatic Voice Descrambling T2 - 2012 IEEE International Conference on Communications (ICC); IEEE International Workshop on Security and Forensics in Communication Systems (SFCS). N2 - Voice scrambling is widely used to add privacy to the radio communication of various authorities - but is also used by criminals to evade prosecution. In this article, we consider various analog voice scrambling techniques such as fixed frequency inversion, splitband inversion and rolling code scramblers. We explain how to break them using automatically extracted measures and scoring algorithms, and evaluate the proposed system using simulated data. While the simple inversion can be easily broken, the more advanced techniques require additional work prior to unsupervised automatization; the presented user interface allows the user to refine the automatic results to obtain a high quality solution. KW - Speech Recognition Y1 - 2012 SP - 8349 EP - 8353 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Bocklet, Tobias A1 - Goshal, Arnab A1 - Povey, Daniel T1 - Revisiting Semi-Continuous Hidden Markov Models T2 - 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, March 2012. N2 - In the past decade, semi-continuous hidden Markov models (SCHMMs) have not attracted much attention in the speech recognition community. Growing amounts of training data and increasing sophistication of model estimation led to the impression that continuous HMMs are the best choice of acoustic model. However, recent work on recognition of under-resourced languages faces the same old problem of estimating a large number of parameters from limited amounts of transcribed speech. This has led to a renewed interest in methods of reducing the number of parameters while maintaining or extending the modeling capabilities of continuous models. In this work, we compare classic and multiple-codebook semi-continuous models using diagonal and full covariance matrices with continuous HMMs and subspace Gaussian mixture models. Experiments on the RM and WSJ corpora show that while a classical semicontinuous system does not perform as well as a continuous one, multiple-codebook semi-continuous systems can perform better, particular when using full-covariance Gaussians. KW - automatic speech recognition KW - acoustic modeling Y1 - 2012 SP - 4721 EP - 4724 PB - IEEE ER - TY - CHAP A1 - Povey, Daniel A1 - Hannemann, Mirko A1 - Boulianne, Gilles A1 - Burget, Lukáš A1 - Ghoshal, Arnab A1 - Janda, Miloš A1 - Karafiát, Martin A1 - Kombrink, Stefan A1 - Motlíček, Petr A1 - Qian, Yanmin A1 - Riedhammer, Korbinian A1 - Veselý, Karel A1 - Thang Vu, Ngoc T1 - Generating Exact Lattices in the WFST Framework T2 - 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, May 2012. N2 - We describe a lattice generation method that is exact, i.e. it satisfies all the natural properties we would want from a lattice of alternative transcriptions of an utterance. This method does not introduce substantial overhead above one-best decoding. Our method is most directly applicable when using WFST decoders where the WFST is “fully expanded”, i.e. where the arcs correspond to HMM transitions. It outputs lattices that include HMM-state-level alignments as well as word labels. The general idea is to create a state-level lattice during decoding, and to do a special form of determinization that retains only the best-scoring path for each word sequence. This special determinization algorithm is a solution to the following problem: Given a WFST A, compute a WFST B that, for each input-symbol-sequence of A, contains just the lowest-cost path through A. KW - Speech Recognition KW - Lattice Generation Y1 - 2012 SP - 4213 EP - 4216 ER - TY - BOOK A1 - Riedhammer, Korbinian T1 - Interactive Approaches to Video Lecture Assessment N2 - Folks that have been here last winter prior to ASRU might be familiar with the title of that talk. But don't be misled, I'll have something new for you. In this talk, I will give an overview over the FAU Lecture Browser which I developed in the context of my thesis. I will start out with the description of a novel data set: The LME Lectures are a corpus of two series of graduate level computer science lectures with 18 recordings each. The courses cover topics in medical image processing and pattern analysis/machine learning. The roughly 40 hours of speech were manually transcribed, and one particular lecture was annotated with key phrases by five human raters. Using this data set, I trained three different speech recognizers using regular continuous, multi-codebook semi-continuous and subspace Gaussian mixture models, that show an error rate of about 10% WER. I will then briefly describe the key phrase extraction and automatic ranking, which was then compared against five raters on one lecture recording. Finally, I will talk about a little usability study where 10 students were asked to perform a certain task-- with and without the proposed lecture browser. Although the number of contestants is limited, the numbers are interesting: the users that had the interface could complete the tasks about 30% faster than the control group, while maintaining about the same accuracy. KW - Speech Recognition Y1 - 2012 PB - Logos Verlag Berlin GmbH CY - Berlin ER - TY - JOUR A1 - Bocklet, Tobias A1 - Riedhammer, Korbinian A1 - Nöth, Elmar A1 - Eysholdt, Ulrich A1 - Haderlein, Tino T1 - Automatic Intelligibility Assessment of Speakers After Laryngeal Cancer by Means of Acoustic Modeling JF - Journal of Voice N2 - One aspect of voice and speech evaluation after laryngeal cancer is acoustic analysis. Perceptual evaluation by expert raters is a standard in the clinical environment for global criteria such as overall quality or intelligibility. So far, automatic approaches evaluate acoustic properties of pathologic voices based on voiced/unvoiced distinction and fundamental frequency analysis of sustained vowels. Because of the high amount of noisy components and the increasing aperiodicity of highly pathologic voices, a fully automatic analysis of fundamental frequency is difficult. We introduce a purely data-driven system for the acoustic analysis of pathologic voices based on recordings of a standard text. KW - Speech Recognition KW - Lung cancer technologies Y1 - 2012 IS - 26(3) SP - 390 EP - 397 ER - TY - CHAP A1 - Höfig, Kai T1 - FDTA–A Tool Chain for Failure-Dependent Timing Analysis T2 - Proc. of the 11th International Workshop on Worst-Case Execution Time Analysis N2 - Embedded real-time systems are growing in complexity, which goes far beyond simplistic closedloop functionality. Current approaches of worst-case execution time (WCET) analysis are used to verify deadlines of such systems, especially when they are safety critical. These approaches calculate or measure WCET as a single value that is expected as an upper bound for a system's execution time. Overestimations are taken into account to make this upper bound a safe bound, but modern processor architectures with caches, multi-threading, and instruction pipelines often expand those overestimations for safe upper bounds into unrealistic areas. Some approaches try to overcome this problem by calculating multiple upper bounds and argue that each single upper bound will hold for a certain probability (probabilistic worst-case execution time). Even though some of them tackle the problem of obtaining reliable probabilistic values for such upper bounds, more effort is required. Therefore, we present in this paper how probabilities of safety analysis models can be combined with elements of system development models to calculate a probabilistic worst-case execution time. This approach can be applied to systems that use mechanisms belonging to the area of fault tolerance, since such mechanisms are usually quantified in safety analyses to certify the system as being highly reliable or safe. KW - FDTA-A KW - Failure-Dependent Timing Analysis KW - Tool chains Y1 - 2011 ER - TY - CHAP A1 - Höfig, Kai A1 - Domis, Dominik T1 - Failure-Dependent execution time analysis T2 - Proceedings of the Joint ACM SIGSOFT Conference–QoSA and ACM SIGSOFT Symposium–ISARCS on Quality of Software Architectures–QoSA and Architecting Critical Systems–ISARCS, Boulder, Colorado, USA, June 2011. N2 - The growing complexity of safety-critical embedded systems is leading to an increased complexity of safety analysis models. Often used fault tolerance mechanisms have complex failure behavior and produce overhead compared to systems without such mechanisms. The question arises whether the overhead for fault tolerance is acceptable for the increased safety of a system. Manually modeling the timing behavior is cost intensive and error prone. Current approaches of safety analysis and execution time analysis are not able to reflect the timing behavior of complex mechanisms according to failures. In this paper, we describe an approach that combines safety analysis models with execution times to extract different execution times for different failure conditions. This provides a detailed view on the safety behavior in combination with the produced overhead and allows to find and certify appropriate fault tolerance mechanisms. KW - Software architecture KW - Safety-critical systems KW - Analysis models Y1 - 2011 SP - 115 EP - 122 PB - ACM CY - New York, NY, USA ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Gropp, Martin A1 - Nöth, Elmar T1 - A Novel Lecture Browser Using Key Phrases and Stream Graphs T2 - Lehrstuhl für Mustererkennung, Universität Erlangen-Nürnberg N2 - We present a novel lecture browser that utilizes ranked key phrases displayed on a stream graph to overcome the shortcomings of traditional extractive (query-based) summaries. The system extracts key phrases from the ASR transcripts, performs an unsupervised ranking, and displays an initial number of phrases on the stream graph. This graph gives an intuition of when which key phrase is spoken, and how dominant it is throughout the lecture. The user can select the phrases to be displayed and furthermore adjust the ranking of the all phrases. All user interactions are logged to a server to improve the ranking algorithms and provide user specific rankings. KW - Speech Recognition Y1 - 2011 ER - TY - CHAP A1 - Gropp, Martin A1 - Nöth, Elmar A1 - Riedhammer, Korbinian T1 - A Novel Lecture Browsing System Using Ranked Key Phrases and StreamGraphs T2 - 14th International Conference on Text, Speech and Dialogue (TSD), September 2011, Pilsen, Czech Republic. N2 - A growing number of universities offer recordings of lectures, seminars and talks in an online e-learning portal. However, the user is often not interested in the entire recording, but is looking for parts covering a certain topic. Usually, the user has to either watch the whole video or “zap” through the lecture and risk missing important details. We present an integrated web-based platform to help users find relevant sections within recorded lecture videos by providing them with a ranked list of key phrases. For a user-defined subset of these, a StreamGraph visualizes when important key phrases occur and how prominent they are at the given time. To come up with the best key phrase rankings, we evaluate three different key phrase ranking methods using lectures of different topics by comparing automatic with human rankings, and show that human and automatic rankings yield similar scores using Normalized Discounted Cumulative Gain (NDCG). KW - key phrases KW - ranking KW - visualization KW - browsing KW - E-Learning Y1 - 2011 SP - 17 EP - 24 ER - TY - CHAP A1 - Steidl, Stefan A1 - Riedhammer, Korbinian A1 - Bocklet, Tobias A1 - Hönig, Florian A1 - Nöth, Elmar T1 - Java Visual Speech Components for Rapid Application Development of GUI based Speech Processing Applications T2 - INTERSPEECH 2011, 12th Annual Conference of the International Speech Communication Association, Florence, Italy, August 2011. N2 - In this paper, we describe a new Java framework for an easy and efficient way of developing new GUI based speech processing applications. Standard components are provided to display the speech signal, the power plot, and the spectrogram. Furthermore, a component to create a new transcription and to display and manipulate an existing transcription is provided, as well as a component to display and manually correct external pitch values. These Swing components can be easily embedded into own Java programs. They can be synchronized to display the same region of the speech file. The object-oriented design provides base classes for rapid development of own components. KW - Speech Processing Applications KW - Java KW - Graphical User Interfaces (GUI) KW - Rapid Application Development (RAD) Y1 - 2011 SP - 3257 EP - 3260 ER - TY - CHAP A1 - Bocklet, Tobias A1 - Riedhammer, Korbinian A1 - Nöth, Elmar T1 - Drink and Speak: On the automatic classification of alcohol intoxination by acoustic, prosodic and text-based features T2 - INTERSPEECH 2011, 12th Annual Conference of the International Speech Communication Association, Florence, Italy, August 2011. N2 - This paper focuses on the automatic detection of a person's blood level alcohol based on automatic speech processing approaches. We compare 5 different feature types with different ways of modeling. Experiments are based on the ALC corpus of IS2011 Speaker State Challenge. The classification task is restricted to the detection of a blood alcohol level above 0.5‰. Three feature sets are based on spectral observations: MFCCs, PLPs, TRAPS. These are modeled by GMMs. Classification is either done by a Gaussian classifier or by SVMs. In the later case classification is based on GMM-based supervectors, i.e. concatenation of GMM mean vectors. A prosodic system extracts a 292-dimensional feature vector based on a voiced-unvoiced decision. A transcription-based system makes use of text transcriptions related to phoneme durations and textual structure. We compare the stand-alone performances of these systems and combine them on score level by logistic regression. The best stand-alone performance is the transcriptionbased system which outperforms the baseline by 4.8% on the development set. A Combination on score level gave a huge boost when the spectral-based systems were added (73.6%). This is a relative improvement of 12.7% to the baseline. On the test-set we achieved an UA of 68.6% which is a significant improvement of 4.1% to the baseline system. KW - GMM KW - alcohol intoxication KW - system fusion Y1 - 2011 SP - 3213 EP - 3216 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Bocklet, Tobias A1 - Nöth, Elmar T1 - Compensation of Extrinsic Variability in Speaker Verification Systems on Simulated Skype and HF Channel Data T2 - 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Prague, Czech Republic, May 2011. N2 - In this work we focus on speaker verification on channels of varying quality, namely Skype and high frequency (HF) radio. In our setup, we assume to have telephone recordings of speakers for training, but recordings of different channels for testing with varying (lower) signal quality. Starting from a Gaussian mixture / support vector machine (GMM/SVM) baseline, we evaluate multi-condition training (MCT), an ideal channel classification approach (ICC), and nuisance attribute projection (NAP) to compensate for the loss of information due to the transmission. In an evaluation on Switchboard-2 data using Skype and HF channel simulators, we show that, for good signal quality, NAP improves the baseline system performance from 5% EER to 3.33% EER (for both Skype and HF). For strongly distorted data, MCT or, if adequate, ICC turn out to be the method of choice. KW - speaker verification KW - channel compensation Y1 - 2011 SP - 4840 EP - 4843 ER - TY - CHAP A1 - Domis, Dominik A1 - Höfig, Kai A1 - Trapp, Mario T1 - A consistency check algorithm for component-based refinements of fault trees T2 - 2010 IEEE 21st International Symposium on Software Reliability Engineering (ISSRE), November 2010, San Jose, CA, USA. N2 - The number of embedded systems in our daily lives that are distributed, hidden, and ubiquitous continues to increase. Many of them are safety-critical. To provide additional or better functionalities, they are becoming more and more complex, which makes it difficult to guarantee safety. It is undisputed that safety must be considered before the start of development, continue until decommissioning, and is particularly important during the design of the system and software architecture. An architecture must be able to avoid, detect, or mitigate all dangerous failures to a sufficient degree. For this purpose, the architectural design must be guided and verified by safety analyses. However, state-of-the-art component-oriented or model-based architectural design approaches use different levels of abstraction to handle complexity. So, safety analyses must also be applied on different levels of abstraction, and it must be checked and guaranteed that they are consistent with each other, which is not supported by standard safety analyses. In this paper, we present a consistency check for CFTs that automatically detects commonalities and inconsistencies between fault trees of different levels of abstraction. This facilitates the application of safety analyses in top-down architectural designs and reduces effort. KW - embedded systems KW - Fault trees Y1 - 2010 SP - 171 EP - 180 ER - TY - CHAP A1 - Kiesmüller, Ulrich A1 - Sossalla, Sebastian A1 - Brinda, Torsten A1 - Riedhammer, Korbinian T1 - Online Identification of Learner Problem Solving Strategies Using Pattern Recognition Methods T2 - Proceedings of the 15th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2010), Bilkent, Ankara, Turkey, June 2010. N2 - Learning and programming environments used in computer science education give feedback to the users by system messages. These are triggered by programming errors and give only "technical" hints without regard to the learners' problem solving process. To adapt the messages not only to the factual but also to the procedural knowledge of the learners, their problem solving strategies have to be identified automatically and in process. This article describes a way to achieve this with the help of pattern recognition methods. Using data from a study with 65 learners aged 12 to 13 using a learning environment for programming, a classification system based on hidden Markov models is trained and integrated in the very same environment. We discuss findings in that data and the performance of the automatic online identification, and present first results using the developed software in class. KW - Pattern Recognition KW - Computer Science Education KW - Secondary Education KW - Problem Solving Strategies KW - Algorithms KW - Tool-Based Analysis Y1 - 2010 SP - 274 EP - 278 ER - TY - CHAP A1 - Zäh, Uwe A1 - Riedhammer, Korbinian A1 - Bocklet, Tobias A1 - Nöth, Elmar T1 - Clap Your Hands! Calibrating Spectral Subtraction for Dereverberation T2 - 2010 IEEE International Conference on Acoustics, Speech and Signal Processing(ICASSP), Dallas, TX, USA, March 2010. N2 - Reverberation effects as observed by room microphones severely degrade the performance of automatic speech recognition systems. We investigate the use of dereverberation by spectral subtraction as proposed by Lebart and Boucher and introduce a simple approach to estimate the required decay parameter by clapping hands. Experiments on small vocabulary continuous speech recognition task on read speech show that using the calibrated dereverberation improves WER from 73.2 to 54.7 for the best microphone. In combination with system adaptation, the WER could be reduced to 28.2, which is only a 16% relative loss of performance comparison to using a headset instead of a room microphone. KW - Speech Recognition KW - robustness Y1 - 2010 SP - 4226 EP - 4229 ER - TY - CHAP A1 - Spiegl, Werner A1 - Riedhammer, Korbinian A1 - Steidl, Stefan A1 - Nöth, Elmar T1 - FAU IISAH Corpus – A German Speech Database Consisting of Human-Machine and Human-Human Interaction Acquired by Close-Talking and Far-Distance Microphones T2 - 7th Conference on International Language Resources and Evaluation (LREC 2010), European Language Resources Association (ELRA), Valletta, Malta, May 2010. KW - Speech Recognition Y1 - 2018 SP - 2420 EP - 2423 ER - TY - JOUR A1 - Riedhammer, Korbinian A1 - Favre, Benoit A1 - Hakkani-Tür, Dilek T1 - Long story short - Global unsupervised models for keyphrase based meeting summarization JF - SPEECH COMMUNICATION KW - Speech Recognition KW - Meeting Summarization Y1 - 2010 VL - 2010 IS - 52(10) SP - 801 EP - 815 ER - TY - JOUR A1 - Tur, Gokhan A1 - Stolcke, Andreas A1 - Voss, Lynn A1 - Peters, Stanley A1 - Hakkani-Tür, Dilek A1 - Dowding, John A1 - Favre, Benoit A1 - Fernandez, Raquel A1 - Frampton, Matthew A1 - Frandsen, Michael A1 - Frederickson, Clint A1 - Graciarena, Martin A1 - Kintzing, Donald A1 - Leveque, Kyle A1 - Mason, Shane A1 - Niekrasz, John A1 - Purver, Matthew A1 - Riedhammer, Korbinian A1 - Shriberg, Elizabeth A1 - Tien, Jing A1 - Vergyri, Dimitra A1 - Yang, Fan T1 - The CALO Meeting Assistant System JF - IEEE Transactions on Audio, Speech and Language Processing N2 - The CALO Meeting Assistant (MA) provides for distributed meeting capture, annotation, automatic transcription and semantic analysis of multiparty meetings, and is part of the larger CALO personal assistant system. This paper presents the CALO-MA architecture and its speech recognition and understanding components, which include real-time and offline speech transcription, dialog act segmentation and tagging, topic identification and segmentation, question-answer pair identification, action item recognition, decision extraction, and summarization. KW - Multiparty meetings processing KW - speech recognition KW - spoken language understanding Y1 - 2010 VL - 2010 IS - 18(6) SP - 1601 EP - 1611 ER - TY - JOUR A1 - Darms, M. A1 - Fölster, F. A1 - Schmidt, Jochen A1 - Fröhlich, D. A1 - Eckert, A. T1 - Data Fusion Strategies in Advanced Driver Assistance Systems JF - SAE International Journal of Passenger Cars – Electronic and Electrical Systems N2 - Data fusion plays a central role in more and more automotive applications, especially for driver assistance systems. On the one hand the process of data fusion combines data and information to estimate or predict states of observed objects. On the other hand data fusion introduces abstraction layers for data description and allows building more flexible and modular systems.The data fusion process can be divided into a low-level processing (tracking and object discrimination) and a high level processing (situation assessment). High level processing becomes more and more the focus of current research as different assistance applications will be combined into one comprehensive assistance system. Different levels/strategies for data fusion can be distinguished: Fusion on raw data level, fusion on feature level and fusion on decision level. All fusion strategies can be found in current driver assistance implementations. The paper gives an overview of the different fusion strategies and shows their application in current driver assistance systems. For low level processing a raw data fusion approach in a stereo video system is described, as an example for feature level fusion the fusion of radar and camera data for tracking is explained. As an example for a high level fusion algorithm an approach for a situation assessment based on multiple sensors is given. The paper describes practical realizations of these examples and points out their potential to further increase traffic safety with reasonably low cost for the overall system. KW - Driver Assistent Systems KW - Data Fusion KW - automotive applications Y1 - 2010 ER - TY - CHAP A1 - Adler, Rasmus A1 - Domis, Dominik A1 - Höfig, Kai A1 - Kemmann, Sören A1 - Kuhn, Thomas A1 - Schwinn, Jean- Pascal A1 - Trapp, Mario T1 - Integration of component fault trees into the UML T2 - International Conference on Model Driven Engineering Languages and Systems. N2 - Efficient safety analyses of complex software intensive embedded systems are still a challenging task. This article illustrates how model-driven development principles can be used in safety engineering to reduce cost and effort. To this end, the article shows how well accepted safety engineering approaches can be shifted to the level of model-driven development by integrating safety models into functional development models. Namely, we illustrate how UML profiles, model transformations, and techniques for multi language development can be used to seamlessly integrate component fault trees into the UML. KW - Safety Analysis KW - fault trees KW - Model driven engineering languages Y1 - 2010 SP - 312 EP - 327 PB - Springer-Verlag CY - Berlin, Heidelberg ER - TY - CHAP A1 - Bocklet, Tobias A1 - Maier, Andreas A1 - Riedhammer, Korbinian A1 - Nöth, Elmar T1 - Towards a Language-independent Intelligibility Assessment of Children with Cleft Lip and Palate T2 - WOCCI '09 Proceedings of the 2nd Workshop on Child, Computer and Interaction (WOCCI 2009), Cambridge, Massachusetts, November 2009, Article No. 6. N2 - We describe a novel evaluation system for the intelligibility assessment of children with CLP on standardized tests. The system is solely based on standard cepstral features in form of MFCCs. No other information like word alignments is used. So the system can be easily adapted to other languages. For each child one GMM is created by adaptation of a UBM to the speaker-specific MFCCs. The components of this GMM are concatenated in order to create a so-called GMM supervector. These GMM supervectors are then used as meta features for an SVR. We evaluated our language-independent system on two different datasets of children suffering from CLP. One dataset contains recordings of 35 German children, where the children named different pictograms. The other dataset contains recordings of 14 Italian speaking children, who repeated standardized sentences. On both datasets we achieved high correlations: up to 0.81 for the German dataset and 0.83 for the Italian dataset. KW - Speech Recognition Y1 - 2009 SP - 2015 EP - 2018 ER - TY - CHAP A1 - Garg, Nikhil A1 - Favre, Benoit A1 - Riedhammer, Korbinian A1 - Hakkani-Tür, Dilek T1 - A Graph Based Method for Meeting Summarization T2 - INTERSPEECH 2009, 10th Annual Conference of the International Speech Communication Association, Brighton, United Kingdom, September 2009. N2 - This paper presents an unsupervised, graph based approach for extractive summarization of meetings. Graph based methods such as TextRank have been used for sentence extraction from news articles. These methods model text as a graph with sentences as nodes and edges based on word overlap. A sentence node is then ranked according to its similarity with other nodes. The spontaneous speech in meetings leads to incomplete, informed sentences with high redundancy and calls for additional measures to extract relevant sentences. We propose an extension of the TextRank algorithm that clusters the meeting utterances and uses these clusters to construct the graph. We evaluate this method on the AM I meeting corpus and show a significant improvement over TextRank and other baseline methods. KW - Summarization KW - Page Rank Y1 - 2009 SP - 1499 EP - 1502 ER - TY - CHAP A1 - Gillick, Dan A1 - Riedhammer, Korbinian A1 - Favre, Benoit A1 - Hakkani-Tür, Dilek T1 - A Global Optimization Framework for Meeting Summarization T2 - 2009 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Taipei, Taiwan, April 2009. N2 - We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by frequency, and an integer linear program to determine the best set of utterances, that is, covering as many concepts as possible while satisfying a length constraint, we achieve ROUGE scores at least as good as a ROUGE-based oracle derived from human summaries. This brings us to a critical discussion of ROUGE and the future of extractive meeting summarization. KW - meeting summarization KW - integer linear programming KW - summarization evaluation Y1 - 2009 SP - 4769 EP - 4772 ER - TY - JOUR A1 - Haderlein, Tino A1 - Riedhammer, Korbinian A1 - Maier, Andreas A1 - Nöth, Elmar A1 - Eysholdt, Ulrich A1 - Rosanowski, Frank T1 - Automatisierung des Postlaryngektomie-Telefontests JF - HNO N2 - In dieser Studie wird ein objektives Verfahren für die Verständlichkeitsmessung mit dem Postlaryngektomie-Telefontest (PLTT) mittels automatischer Spracherkennungstechnik beschrieben. 31 Sprecher mit tracheoösophagealer Ersatzstimme (25 Männer und 6 Frauen; 63,4±8,7 Jahre) wurden zunächst von 11 naiven Hörern bewertet. Der vom Spracherkennungssystem ermittelte Verständlichkeitsgrad wird als Prozentsatz korrekt verstandener Wörter einer Wortkette, der Wortakkuratheit bzw. -korrektheit, angegeben und mit den subjektiv ermittelten PLTT-Werten verglichen. Die durchschnittliche PLTT-Gesamtverständlichkeit der 11 naiven Hörer liegt bei 47%, die automatisch ermittelte Wortakkuratheit und Wortkorrektheit liegen deutlich niedriger (etwa 0% bzw. etwa 15%). Die Korrelation zwischen menschlicher und maschineller Bewertung liegt jedoch z. T. über 0,9. Für den Gesamtverständlichkeitswert des PLTT kann mit Hilfe der automatischen Spracherkennung objektiv und effizient ein äquivalentes Maß berechnet werden. KW - Spracherkennungssoftware KW - Automatische Mustererkennung KW - Sprechverständlichkeit KW - Auswertungsmethoden KW - Korrelation von Daten Y1 - 2009 VL - 2009 IS - 57 SP - 51 EP - 56 PB - Springer-Verlag ER - TY - CHAP A1 - Wong, C.K. A1 - Yeap, W.K. A1 - Schmidt, Jochen T1 - Our Next Generation of Robotics Researchers? Teaching Robotics at Primary School Level. T2 - Readings in Technology and Education: Proceedings of International Conference on Information Communication Technologies in Education N2 - In this paper, we present our experience in designing and teaching of our first robotics course for students at primary school level. The course was carried out over a comparatively short period of time, namely 6 weeks, 2 hours per week. In contrast to many other projects, we use robots that researchers used to conduct their research and discuss problems faced by these researchers. Thus, this is not a behavioural study but a hands-on learning experience for the students. The aim is to highlight the development of autonomous robots and artificial intelligence as well as to promote science and robotics in schools. KW - Robotic Research KW - Teaching Robotics KW - Software Development Y1 - 2009 ER - TY - CHAP A1 - Beneken, Gerd A1 - Feindor, R. A1 - Turmayr, J. T1 - Integrierte Werkzeugunterstützung für kleine Projekte: Der Rosenheimer Team-Server T2 - 3. Workshop: Vorgehensmodelle in der Praxis - Werkzeuge und Anwendung (TUM) N2 - Aktuelle Projekte werden nur noch selten von einem einzigen Team an einem einzigen Standort bearbeitet. Um verteilt arbeitende Teams, Auftrag- und Unterauftragnehmer zu koordinieren, ist einerseits ein abgestimmtes Vorgehen notwendig, andererseits müssen Projekte in solchen Szenarios durch Werkzeuge unterstützt werden. Die problemorientierte und organisationsspezifische Integration von Werkzeugen und Vorgehensmodellen ist ein wesentliches Erfolgskriterium für Organisationen und ihre Projekte. Werkzeuge können Anwender unterstützen und durch vorgegebene Prozesse wie z.B. Risikomanagement oder Berichtswesen führen. Eine nahtlose Integration eines Vorgehensmodells in eine gegebene und akzeptierte Werkzeugumgebung kann sich positiv auf den Erfolg von Prozessanpassungen auswirken. Effizienzsteigerungen, bspw. durch die automatische Generierung von Vorlagen oder Dokumentation, machen Werkzeugintegrierte Prozesse auch für Entwickler interessant. Auf der anderen Seite müssen Projektspezifische Anforderungen an Werkzeuge und Prozesse berücksichtigt werden, die eine Flexibilität in der Anwendung und Benutzung erforderlich machen. Dieser 3. Workshop diskutiert in Fortsetzung der Workshops Formalisierung und Anwendung sowie Reife und Qualität unterschiedliche und facettenreiche Fragen, die sich hinsichtlich der Werkzeugunterstützung und der werkzeuggeführten Anwendung von Vorgehensmodellen ergeben. Insbesondere die semi- und vollautomatische Integration von Vorgehensmodellen, die Generierung von Arbeitsumgebungen und Optionen zur Anwenderunterstützung und Anwenderführung spielen hier zentrale Rollen. Im Zentrum des Workshops steht der Lifecycle von Vorgehensmodellen mit dem Schwerpunkt der Operationalisierung durch Werkzeuge und der geführten/unterstützten Anwendung. Von besonderem Interesse sind Fragen nach der Konzeption und Durchführung von Werkzeugen und Anwenderunterstützung im Kontext verschiedener Vorgehensmodelle, wie bspw. dem V-Modell XT, Scrum, Prince2, RUP, XP. Themenüberblick: Der 1-täige Workshop zielt im Wesentlichen auf folgende Themen: Verbesserung der Akzeptanz von Vorgehensmodellen Werkzeugunterstützte Prozesseinführung: Einführung und Einführbarkeit mithilfe von Werkzeugen Etablierung und Durchsetzung, Do's und Dont's Kontinuierliche werkzeugunterstützte Prozessverbesserung Kosten und Nutzen, Abhängigkeiten, Vor- und Nachteile Werkzeugunterstützung bei der Projektdurchführung Lose gekoppelte Werkzeuglandschaften vs. integrierte Tools Werkzeugunterstützte Planung, Steuerung von Agilen Projekten Unterstützung für kleine, große und verteilte Teams Werkzeugunterstützung bei Auswahl, Anpassung und Tailoring Grenzen der Werkzeugunterstützung Formalisierung und Werkzeugunterstützung von Prozessen und Prozessschritten Vorgehens- und Reifegradmodelle: V-Model XT, XP, CMMI, RUP, Scrum etc. KW - Software Engineering KW - Softwareprojekte KW - Projektmanagement Y1 - 2018 ER - TY - THES A1 - Beneken, Gerd T1 - Logische Architekturen: Eine Theorie der Strukturen und ihre Anwendung in Dokumentation und Projektmanagement  N2 - Software-Architektur und Projektmanagement sind Mittel, um große Software-Entwicklungsprojekte beherrschbar zu machen. Die Verbindung zwischen beiden Disziplinen wird in dieser Arbeit mithilfe einer Architekturtheorie hergestellt: Ein Verfahren wird vorgeschlagen, mit dem die Beschreibung der logischen Architektur und die Projektplanung iterativ abgeglichen und verbessert werden können. Verfahren zur architekturbasierten Optimierung der Planung werden daraus entwickelt. Die Dokumentation von Architekturen mithilfe von Architektursichten ist der zweite Schwerpunkt. Mathematisch fundierte Verfahren zur Erzeugung von Sichten werden mithilfe einer Architekturtheorie definiert. Die Verfahren erzeugen etwa Architektursichten, die Projektmanagement und die Kommunikation innerhalb des Projektes mithilfe von Planungsinformationen unterstützen. Ein prototypisches Werkzeug demonstriert Anwendbarkeit der Theorie und der vorgeschlagenen Verfahren KW - Projektmanagement KW - Software- Architektur KW - Systemarchitektur KW - Graphentheorie Y1 - 2018 ER - TY - BOOK A1 - Petkovic, Dusan T1 - 4. Auflage- Microsoft SQL Server 2008, A Beginner's Guide N2 - Get Started on Microsoft SQL Server 2008 in No TimeLearn to use all of the powerful features available in SQL Server 2008 quickly and easily. Microsoft SQL Server 2008: A Beginner's Guide explains the fundamentals of each topic alongside examples and tutorials that walk you through real-world database tasks. Install SQL Server 2008, construct high-performance databases, use powerful Transact-SQL statements, create stored procedures and triggers, and execute simple and complex database queries. Performance tuning, Database Engine security, Business Intelligence, and XML are also covered. Set up, configure, and maintain SQL Server 2008 Build and manage database objects using Transact-SQL statements Create stored procedures and user-defined functionsOptimize database performance, availability, and reliability Implement solid security using authentication, encryption, and authorization Automate tasks using SQL Server Agent Create reliable data backups and perform flawless system restores Use all-new SQL Server 2008 Business Intelligence, development, and administration toolsLearn in detail the SQL Server XML technology (SQLXML) KW - Sql server KW - Microsoft KW - Database Y1 - 2018 SN - 978-0-07-154638-6 PB - McGraw- Hill Osborne Media CY - Columbus, Ohio ET - 4. Auflage ER - TY - CHAP A1 - Jarz, Ewald A1 - Mayr, Ingemar ED - Scientific-technical Union of Mechanical Engineering, T1 - Automated Documentation as Support at the Implementation of ITIL Processes T2 - Information and Communication Technologies for Sustainable Development – Workshop Proceedings: Sozopol, Bulgaria, 2007 N2 - The present paper examines which benefit an automated documentation of the IT infrastructure can have for the configuration management process of ITIL, and whether it is possible to fully automate documentation. The result is the conclusion that the documentation process can be fully automated. It follows from this analysis that the automated documentation can “only” supply information for the ITIL configuration management, respectively for the CMDB. KW - ITIL, configuration management, automated documentation Y1 - 2008 SP - 308 EP - 309 PB - TUS CY - Sofia ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Favre, Benoit A1 - Hakkani-Tür, Dilek T1 - A Keyphrase Based Approach to Interactive Meeting Summarization T2 - 2008 IEEE Workshop on Spoken Language Technologies (SLT), Goa, India, December 2008. N2 - Rooted in multi-document summarization, maximum marginal relevance (MMR) is a widely used algorithm for meeting summarization (MS). A major problem in extractive MS using MMR is finding a proper query: the centroid based query which is commonly used in the absence of a manually specified query, can not significantly outperform a simple baseline system. We introduce a simple yet robust algorithm to automatically extract keyphrases (KP) from a meeting which can then be used as a query in the MMR algorithm. We show that the KP based system significantly outperforms both baseline and centroid based systems. As human refined KPs show even better summarization performance, we outline how to integrate the KP approach into a graphical user interface allowing interactive summarization to match the user's needs in terms of summary length and topic focus. KW - meeting summarization KW - keyword generation KW - user interaction Y1 - 2008 SP - 153 EP - 156 ER - TY - CHAP A1 - Tur, Gokhan A1 - Stolcke, Andreas A1 - Voss, Lynn A1 - Dowding, John A1 - Favre, Benoit A1 - Fernandez, Raquel A1 - Frampton, Matthew A1 - Frandsen, Michael A1 - Frederickson, Clive A1 - Graciarena, Martin A1 - Hakkani-Tür, Dilek A1 - Kintzing, Donald A1 - Leveque, Kyle A1 - Mason, Shane A1 - Niekrasz, John A1 - Peters, Stanley A1 - Purver, Matthew A1 - Riedhammer, Korbinian A1 - Shriberg, Elizabeth A1 - Tien, Jing A1 - Vergyri, Dimitra A1 - Yang, Fan T1 - The CALO Meeting Speech Recognition and Understanding System T2 - 2008 IEEE Workshop on Spoken Language Technologies (SLT), Goa, India, December 2008. N2 - The CALO meeting assistant provides for distributed meeting capture, annotation, automatic transcription and semantic analysis of multiparty meetings, and is part of the larger CALO personal assistant system. This paper summarizes the CALO-MA architecture and its speech recognition and understanding components, which include real-time and offline speech transcription, dialog act segmentation and tagging, question-answer pair identification, action item recognition, decision extraction, and summarization. KW - Speech Recognition KW - multiparty meetings processing KW - spoken language understanding Y1 - 2008 SP - 69 EP - 72 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Gillick, Dan A1 - Favre, Benoit A1 - Hakkani-Tür, Dilek T1 - Packing the Meeting Summarization Knapsack T2 - INTERSPEECH 2008, 9th Annual Conference of the International Speech Communication Association (ISCA), Brisbane, Australia, September 2008. N2 - Despite considerable work in automatic meeting summarization over the last few years, comparing results remains difficult due to varied task conditions and evaluations. To address this issue, we present a method for determining the best possible extractive summary given an evaluation metric like ROUGE. Our oracle system is based on a knapsack-packing framework, and though NP-Hard, can be solved nearly optimally by a genetic algorithm. To frame new research results in a meaningful context, we suggest presenting our oracle results alongside two simple baselines. We show oracle and baseline results for a variety of evaluation scenarios that have recently appeared in this field. KW - summarization KW - meetings KW - evaluation Y1 - 2008 SP - 2434 EP - 2437 ER - TY - BOOK A1 - Riedhammer, Korbinian T1 - An Automatic Intelligibility Test Based on the Post-Laryngectomy Telephone Test KW - Speech Recognition Y1 - 2008 PB - Mueller Verlag CY - Nürnberg ER - TY - JOUR A1 - Haderlein, Tino A1 - Riedhammer, Korbinian A1 - Nöth, Elmar A1 - Toy, Hikmet A1 - Schuster, Maria A1 - Eysholdt, Ulrich A1 - Hornegger, Joachim A1 - Rosanowski, Frank T1 - Application of Automatic Speech Recognition to Quantitative Assessment of Tracheoesophageal Speech in Different Signal Quality JF - Folia Phoniatrica Et Logopaedica N2 - Tracheoesophageal voice is state-of-the-art in voice rehabilitation after laryngectomy. Intelligibility on a telephone is an important evaluation criterion as it is a crucial part of social life. An objective measure of intelligibility when talking on a telephone is desirable in the field of postlaryngectomy speech therapy and its evaluation. Based upon successful earlier studies with broadband speech, an automatic speech recognition (ASR) system was applied to 41 recordings of postlaryngectomy patients. Recordings were available in different signal qualities; quality was the crucial criterion for this study. Compared to the intelligibility rating of 5 human experts, the ASR system had a correlation coefficient of r = -0.87 and Krippendorff's alpha of 0.65 when broadband speech was processed. The rater group alone achieved alpha = 0.66. With the test recordings in telephone quality, the system reached r = -0.79 and alpha = 0.67. For medical purposes, a comprehensive diagnostic approach to (substitute) voice has to cover both subjective and objective tests. An automatic recognition system such as the one proposed in this study can be used for objective intelligibility rating with results comparable to those of human experts. This holds for broadband speech as well as for automatic evaluation via telephone. KW - Speech Recognition Software Y1 - 2008 VL - 2008 IS - 61(1) SP - 12 EP - 17 ER - TY - JOUR A1 - Schmidt, Jochen A1 - Niemann, H. T1 - Data Selection for Hand-eye Calibration: A Vector Quantization Approach JF - The International Journal of Robotics Research N2 - This paper presents new vector quantization based methods for selecting well-suited data for hand-eye calibration from a given sequence of hand and eye movements. Data selection can improve the accuracy of classic hand-eye calibration, and make it possible in the first place in situations where the standard approach of manually selecting positions is inconvenient or even impossible, especially when using continuously recorded data. A variety of methods is proposed, which differ from each other in the dimensionality of the vector quantization compared to the degrees of freedom of the rotation representation, and how the rotation angle is incorporated. The performance of the proposed vector quantization based data selection methods is evaluated using data obtained from a manually moved optical tracking system (hand) and an endoscopic camera (eye). KW - hand- eye calibration KW - vektor quantization Y1 - 2018 ER - TY - CHAP A1 - Yeap, W.K. A1 - Wong, C.K. A1 - Schmidt, Jochen T1 - Using a Mobile Robot to Test a Theory of Cognitive Mapping. T2 - Robotics and Cognitive Approaches to Spatial Mapping, Springer Tracts in Advanced Robotics N2 - This paper describes using a mobile robot, equipped with some sonar sensors and an odometer, to test navigation through the use of a cognitive map. The robot explores an office environment, computes a cognitive map, which is a network of ASRs [36, 35], and attempts to find its way home. Ten trials were conducted and the robot found its way home each time. From four random positions in two trials, the robot estimated the home position relative to its current position reasonably accurately. Our robot does not solve the simultaneous localization and mapping problem and the map computed is fuzzy and inaccurate with much of the details missing. In each homeward journey, it computes a new cognitive map of the same part of the environment, as seen from the perspective of the homeward journey. We show how the robot uses distance information from both maps to find its way home. KW - Cognitive Mapping KW - Mobile Robot KW - Simultaneous Localization  Y1 - 2008 PB - Springer CY - Berlin ER - TY - CHAP A1 - Jarz, Ewald ED - ASO, T1 - Best Practice in Business Process Orientation and ERP Systems in Austria T2 - Information and Communication Technologies for Sustainable Development – Workshop Proceedings: Sozopol, Bulgaria, 2007 N2 - In this paper a general overview of economic data of Austria is given and best practices in the field of business process orientation and ERP system integration are illustrated. KW - Business process, ERP systems, Austria Y1 - 2007 SP - 7 EP - 9 PB - TUS CY - Sofia ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Stemmer, Georg A1 - Haderlein, Tino A1 - Schuster, Mario A1 - Rosanowski, Frank A1 - Nöth, Elmar A1 - Maier, Andreas T1 - Towards Robust Automatic Evaluation of Pathologic Telephone Speech T2 - 2007 IEEE Workshop on Automatic Speech Recognition & Understanding (ASRU), Kyoto, Japan, December 2007. N2 - For many aspects of speech therapy an objective evaluation of the intelligibility of a patient's speech is needed. We investigate the evaluation of the intelligibility of speech by means of automatic speech recognition. Previous studies have shown that measures like word accuracy are consistent with human experts' ratings. To ease the patient's burden, it is highly desirable to conduct the assessment via phone. However, the telephone channel influences the quality of the speech signal which negatively affects the results. To reduce inaccuracies, we propose a combination of two speech recognizers. Experiments on two sets of pathological speech show that the combination results in consistent improvements in the correlation between the automatic evaluation and the ratings by human experts. Furthermore, the approach leads to reductions of 10% and 25% of the maximum error of the intelligibility measure. KW - Biomedical acoustics KW - Speech intelligibility KW - Speech processing KW - Acoustic applications Y1 - 2007 SP - 717 EP - 722 ER - TY - CHAP A1 - Haderlein, Tino A1 - Riedhammer, Korbinian A1 - Maier, Andreas A1 - Nöth, Elmar A1 - Toy, Hikmet A1 - Rosanowski, Frank T1 - An Automatic Version of the Post-Laryngectomy Telephone Test T2 - TSD 2007, 10th International Conference on Text, Speech and Dialogue, Proceedings, Pilsen, Czech Republic, September 2007. N2 - Tracheoesophageal (TE) speech is a possibility to restore the ability to speak after total laryngectomy, i.e. the removal of the larynx. The quality of the substitute voice has to be evaluated during therapy. For the intelligibility evaluation of German speakers over telephone, the Post-Laryngectomy Telephone Test (PLTT) was defined. Each patient reads out 20 of 400 different monosyllabic words and 5 out of 100 sentences. A human listener writes down the words and sentences understood and computes an overall score. This paper presents a means of objective and automatic evaluation that can replace the subjective method. The scores of 11 naïve raters for a set of 31 test speakers were compared to the word recognition rate of speech recognizers. Correlation values of about 0.9 were reached. KW - Automatic Speech Recognition KW - Mono Poly KW - Total Laryngectomy KW - Speech Recognition System KW - Automatic Evaluation Y1 - 2007 SP - 238 EP - 245 PB - Springer-Verlag ER - TY - CHAP A1 - Nöth, Elmar A1 - Maier, Andreas A1 - Haderlein, Tino A1 - Riedhammer, Korbinian A1 - Rosanowski, Frank A1 - Schuster, Maria T1 - Automatic Evaluation of Pathologic Speech - from Research to Routine Clinical Use T2 - TSD 2007, 10th International Conference on Text, Speech and Dialogue, Pilsen, Czech Republic, September 2007. N2 - Previously we have shown that ASR technology can be used to objectively evaluate pathologic speech. Here we report on progress for routine clinical use: 1) We introduce an easy-to-use recording and evaluation environment. 2) We confirm our previous results for a larger group of patients. 3) We show that telephone speech can be analyzed with the same methods with only a small loss of agreement with human experts. 4) We show that prosodic information leads to more robust results. 5) We show that text reference instead of transliteration can be used for evaluation. Using word accuracy of a speech recognizer and prosodic features as features for SVM regression, we achieve a correlation of .90 between the automatic analysis and human experts. KW - Automatic Speech Recognition KW - Pathologic Speech KW - Automatic Evaluation KW - Prosodic Feature KW - Speech Recognizer Y1 - 2007 SP - 294 EP - 301 PB - Springer-Verlag ER - TY - CHAP A1 - Haderlein, Tino A1 - Eysholdt, Ulrich A1 - Riedhammer, Korbinian A1 - Nöth, Elmar A1 - Rosanowski, Frank T1 - Automatisierung des Postlaryngektomie-Telefontests (PLTT) T2 - Aktuelle phoniatrisch-pädaudiologische Aspekte N2 - In früheren Arbeiten wurde gezeigt, dass automatische Spracherkennungsverfahren verwendet werden können, um die Verständlichkeit von Sprechern mit tracheoösophagealer Ersatzstimme (TE-Stimme) automatisch zu bewerten [1,2]. In diesem Beitrag wird eine automatische Version des Postlaryngektomie-Telefontests (PLTT, [3]) vorgestellt, der einen eingeführten Standardtest für die Verständlichkeit über das Telefon darstellt. KW - Spracherkennung Y1 - 2007 SP - 66 EP - 69 ER - TY - BOOK A1 - Schildt, Herbert ED - Riedhammer, Korbinian T1 - C/C++ GE-PACKT KW - Programmiersprache C/C++ Y1 - 2007 PB - Mitp-Verlag CY - Frechen bei Köln ET - 3. Auflage ER - TY - BOOK A1 - Schildt, Herbert ED - Riedhammer, Korbinian T1 - ++ Die professionelle Referenz. IT-Studienausgabe KW - Programmiersprache C++ Y1 - 2007 PB - Mitp-Verlag CY - Frechen bei Köln ET - 2. Auflage ER - TY - CHAP A1 - Schmidt, Jochen A1 - Wong, C.K. A1 - Yeap, W.K. T1 - Spatial Information Extraction for Cognitive Mapping with a Mobile Robot. T2 - Conference on Spatial Information Theory: COSIT'07, Melbourne, Australia. Volume 4736 of Lecture Notes in Computer Science N2 - When animals (including humans) first explore a new environment, what they remember is fragmentary knowledge about the places visited. Yet, they have to use such fragmentary knowledge to find their way home. Humans naturally use more powerful heuristics while lower animals have shown to develop a variety of methods that tend to utilize two key pieces of information, namely distance and orientation information. Their methods differ depending on how they sense their environment. Could a mobile robot be used to investigate the nature of such a process, commonly referred to in the psychological literature as cognitive mapping? What might be computed in the initial explorations and how is the resulting “cognitive map” be used for localization? In this paper, we present an approach using a mobile robot to generate a “cognitive map”, the main focus being on experiments conducted in large spaces that the robot cannot apprehend at once due to the very limited range of its sensors. The robot computes a “cognitive map” and uses distance and orientation information for localization. KW - Mobile Robot KW - Sonar Sensor KW - Robotic Research Y1 - 2018 ER - TY - JOUR A1 - Schmidt, Jochen A1 - Wong, C.K. A1 - Yeap, W.K. T1 - Localisation and Mapping with a Mobile Robot Using Sparse Range Data JF - Autonomous Robots and Agents, Studies in Computational Intelligence (SCI), N2 - We present an approach for indoor mapping and localisation using sparse range data, acquired by a mobile robot equipped with sonar sensors. The chapter consists of two main parts. First, a split and merge based method for dividing a given metric map into distinct regions is presented, thus creating a topological map in a metric framework. Spatial information extracted from this map is then used for self-localisation on the return home journey. The robot computes local confidence maps for two simple localisation strategies based on distance and relative orientation of regions. These local maps are then fused to produce overall confidence maps. KW - Mobile Robot KW - Sonar Sensor KW - Sensor Data Fusion KW - Robotic Research Y1 - 2007 PB - Springer ER - TY - CHAP A1 - Wong, C.K. A1 - Yeap, W.K. A1 - Schmidt, Jochen T1 - Using a Mobile Robot for Cognitive Mapping T2 - International Joint Conference on Artificial Intelligence (IJCAI), pages 2243-2248, Hyderabad, India, 2007 N2 - When animals (including humans) first explore a new environment, what they remember is fragmentary knowledge about the places visited. Yet, they have to use such fragmentary knowledge to find their way home. Humans naturally use more powerful heuristics while lower animals have shown to developa varietyof methodsthat tend to utilize two key pieces of information,namely distance and orientation information. Their methods differ depending on how they sense their environment. Could a mobile robot be used to investigate the nature of such a process, commonly referred to in the psychological literature as cognitive mapping? What might be computed in the initial explorations and how is the resulting “cognitive map” be used to return home? In this paper, we presented a novel approach using a mobile robot to do cognitive mapping. Our robot computes a “cognitive map” and uses distance and orientation information to find its way home. The process developed provides interesting insights into the nature of cognitive mapping and encourages us to use a mobile robot to do cognitive mapping in the future, as opposed to its popular use in robot mapping. KW - Cognitive Mapping KW - Sonar Sensor KW - Robotic Research Y1 - 2007 ER - TY - BOOK A1 - Kuhrmann, Marco A1 - Beneken, Gerd T1 - Windows® Communication Foundation: Konzepte - Programmierung - Migration N2 - Eines der ersten deutschsprachigen Bücher zum Thema! Marco Kuhrmann / Gerd Beneken Windows® Communication Foundation Konzepte - Programmierung – Migration (copy) Die Windows Communication Foundation ist als Kommunikationsframework Bestandteil von .NET 3.0. Sie stellt die Grundlage für Service-orientierte, Web Service-basierte, verteilte Anwendungen unter Microsoft Windows dar. Dieses Buch gibt Ihnen einen umfassenden Überblick über die neue Plattform. Es führt grundlegende Konzepte ein und stellt einen kompakten Leitfaden für die Softwareentwicklung auf Basis der Windows Communication Foundation dar. Anhand praktischer Beispiele werden Sie durch die Themen Services, Messaging usw. bis hin zu Fragen der Migration geführt. KW - Programmieren mit Windows KW - Windows Communication Foundation Y1 - 2006 PB - Spektrum Akademischer Verlag CY - Heidelberg ER - TY - CHAP A1 - Beneken, Gerd T1 - Referenzarchitekturen T2 - Handbuch der Software-Architektur N2 - Die Architektur eines Software-Systems ist im Wesentlichen die Beschreibung des Systems anhand einzelner Beziehungen, die zwischen diesen Bausteinen bestehen. Die Wahl einer bestimmten Architektur ist eine grundlegende Entscheidung im Entwicklungsprozess und hat großen Einfluss auf die Qualität des späteren Systems. In diesem Handbuch wird erstmalig ein fundierter Einstieg und Überblick über den Stand der Technik und zukunftsweisende Entwicklungen im Bereich der Software-Architekturen gegeben. Ausgehend von der Rolle des Software-Architekten werden die Konstruktion und Evolution sowie Migration von Software-Architekturen systematisch aufbereitet. Als Modellierungssprache wird überwiegend die Unified Modeling Language (UML) verwendet. Um ein umfassendes Verständnis für die Bedeutung von Architekturbeschreibungen zu erhalten, werden auch dieThemen Management, Bewertung und Wiederverwendung von Software-Architekturen behandelt. Ebenso wird auf neuere Konzepte wie Model-Driven Architecture (MDA), Software-Produktlinien, Reverse Engineering sowie Performance- und Sicherheitsaspekte eingegangen. Dabei werden die Konzepte beispielhaft illustriert. Im Anhang befinden sich ein Kapitel über formale Grundlagen der Architekturmodellierung, eine Übersicht über Architekturbeschreibungssprachen sowie ein Glossar. Das Buch ist ein Gemeinschaftswerk der Mitglieder des Arbeitskreises Software-Architektur der Gesellschaft für Informatik KW - Software- Architektur KW - Unified Modeling Language (UML) Y1 - 2018 PB - dpunkt CY - Heidelberg ER - TY - CHAP A1 - Jarz, Ewald ED - Grabe, Daniela ED - Zimmermann, Lisa T1 - Experiences with Multimedia based Case Studies T2 - MApEC - Multimedia Applications in Education Conference Proceedings 2006 N2 - This paper shows the experiences made with a multimedia based case study in academic education. The case study has been used within three courses of business process engineering. It was compared to a case study based solely on text. 13 assumptions have been evaluated. The main conclusion is that the multimedia based case study is much more practice oriented than a text based case study. Also the solutions of the students, which did the multimedia based case study, have been of higher quality. But on the other hand the expectations of the students to a multimedia based system are hard to meet. Based on these experiences some hints in further developing of multimedia based case studies are formulated. KW - Multimedia KW - Case Study KW - experiences KW - business process KW - learning by doing Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:861-opus4-10717 SP - 188 EP - 192 PB - FH JOANNEUM CY - Graz ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Haderlein, Tino A1 - Schuster, Maria A1 - Rosanowski, Frank A1 - Nöth, Elmar T1 - Automatic Evaluation of Tracheoesophageal Telephone Speech T2 - First International Language Technologies Conference (IS-LTC 2006), Ljubljana, Slovenia, October 2006. N2 - The tracheoesophageal (TE) substitute voice is currently state–of–the–art treatment to restore the ability to speak after laryngectomy. The intelligibility while talking over a telephone is an important clinical factor, as it is a crucial part of the patients’ social life. An objective way to rate the intelligibility of substitute voices when talking over a telephone is desirable to improve the post–laryngectomy speech therapy. An automatic speech recognition (ASR) system was applied to 41 high quality recordings of post–laryngectomy patients. The ASR system was trained with normal, non–pathologic speech. It yielded a word accuracy (WA) of 36.9%±18.0%; compared to the intelligibility rating of a group of human experts the ASR system had a correlation coefficient of -.88. After downsampling the 41 recordings to telephone quality, the ASR system reached a WA of 26.4%±13.9% leading to a correlation coefficient of -.80. These results confirm that an ASR system can be used for objective intelligibility rating over the telephone. KW - Speech Recognition Y1 - 2006 SP - 17 EP - 22 ER - TY - CHAP A1 - Riedhammer, Korbinian A1 - Haderlein, Tino A1 - Nöth, Elmar A1 - Toy, Hikmet A1 - Eysholdt, Ulrich A1 - Rosanowski, Frank T1 - Die tracheoösophageale Ersatzstimme: Automatische Verständlichkeitsbewertung über das Telefon T2 - 23. Wissenschaftliche Jahrestagung der Deutschen Gesellschaft für Phoniatrie und Pädaudiologie. Heidelberg, September 2006. Aktuelle phoniatrisch-pädaudiologische Aspekte. N2 - Die tracheoösophageale Ersatzstimme TE ist heute "state of the art" der Stimmrehabilitation nach einer Laryngektomie. In dieser Studie, einem Teilprojekt eines von der Deutschen Krebshilfe geförderten Forschungsvorhabens, ging es um die objektive Bewertung des Behandlungsfortschritts. Untersucht wurden 41 Laryngektomierte mit einer TE (Provox-Stimmventilprothese) durchgeführt. Ziel der Studie war es, die Verständlichkeit im Gespräch und am Telefon objektiv zu beurteilen und zu vergleichen, um den Patienten in der Zukunft die telefonische Evaluation von zuhause aus zu ermöglichen. Zur Bewertung diente ein für Marktzwecke professionalisiertes automatisches Spracherkennungssystem. Es wurden zunächst Nahbesprechungsaufnahmen des "Nordwind und Sonne"-Textes von fünf Experten hinsichtlich ihrer Verständlichkeit beurteilt. Aus diesen Aufnahmen entstanden durch Abspielen über ein Telefon simulierte Telefonaufnahmen. Zielkriterium der automatischen Analyse war die Wortakkuratheit WA, die mit der an Schulnoten orientierten Stimmbewertung durch die Experten korreliert wurde. Die Studie ergab eine Korrelation von -0,82 für die Nahbesprechungs- und -0,69 für die Telefonaufnahmen. Die Ergebnisse zeigen, dass die automatische Verständlichkeitsbewertung von Ersatzstimmen auch per Telefon prinzipiell möglich ist. Möglichkeiten, die Qualitätsverluste durch die Telefonübertragung und die somit niedrigere Korrelation zu kompensieren, werden aufgezeigt. KW - Spracherkennung Y1 - 2006 SP - 51 EP - 53 ER -