springer international publishing springer nov 2009 (6 Ergebnisse)

Taschenbuch. Zustand: Neu. Neuware -Considerable progress has been made in recent years in the development of dialogue systems that support robust and efficient human-machine interaction using spoken language. Spoken dialogue technology allows various interactive applications to be built and used for practical purposes, and research focuses on issues that aim to increase the system's communicative competence by including aspects of error correction, cooperation, multimodality, and adaptation in context.This book gives a comprehensive view of state-of-the-art techniques that are used to build spoken dialogue systems. It provides an overview of the basic issues such as system architectures, various dialogue management methods, system evaluation, and also surveys advanced topics concerning extensions of the basic model to more conversational setups.The goal of the book is to provide an introduction to the methods, problems, and solutions that are used in dialogue system development and evaluation. It presents dialogue modelling and system development issues relevant in both academic and industrial environments and also discusses requirements and challenges for advanced interaction management and future research.Table of Contents: Preface / Introduction to Spoken Dialogue Systems / Dialogue Management / Error Handling / Case Studies: Advanced Approaches to Dialogue Management / Advanced Issues / Methodologies and Practices of Evaluation / Future Directions / References / Author BiographiesSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 168 pp. Englisch.

Taschenbuch. Zustand: Neu. Neuware -This lecture provides a tutorial introduction to the Nyström and locally-corrected Nyström methods when used for the numerical solutions of the common integral equations of two-dimensional electromagnetic fields. These equations exhibit kernel singularities that complicate their numerical solution. Classical and generalized Gaussian quadrature rules are reviewed. The traditional Nyström method is summarized, and applied to the magnetic field equation for illustration. To obtain high order accuracy in the numerical results, the locally-corrected Nyström method is developed and applied to both the electric field and magnetic field equations. In the presence of target edges, where current or charge density singularities occur, the method must be extended through the use of appropriate singular basis functions and special quadrature rules. This extension is also described. Table of Contents: Introduction / Classical Quadrature Rules / The Classical Nyström Method / The Locally-Corrected Nyström Method / Generalized Gaussian Quadrature / LCN Treatment of Edge SingularitiesSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 116 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code. The number of states used can be reduced and techniques used for decoding convolutional codes, such as the list Viterbi decoding algorithm, can be applied directly on the trellis. The finite state machine interpretation can be easily migrated to Markov source case. We can encode Markov sources without considering the conditional probabilities, while using the list Viterbi decoding algorithm which utilizes the conditional probabilities. We can also use context-based arithmetic coding to exploit the conditional probabilities of the Markov source and apply a finite state machine interpretation to this problem.The finite state machine interpretation also allows us to more systematically understand arithmetic codes with forbidden symbols. It allows us to find the partial distance spectrum of arithmetic codes with forbidden symbols. We also propose arithmetic codes with memories which use high memory but low implementation precision arithmetic codes. The low implementation precision results in a state machine with less complexity. The introduced input memories allow us to switch the probability functions used for arithmetic coding. Combining these two methods give us a huge parameter space of the arithmetic codes with forbidden symbols. Hence we can choose codes with better distance properties while maintaining the encoding efficiency and decoding complexity. A construction and search method is proposed and simulation results show that we can achieve a similar performance as turbo codes when we apply this approach to rate 2/3 arithmetic codes.Table of Contents: Introduction / Arithmetic Codes / Arithmetic Codes with Forbidden Symbols / Distance Property and Code Construction / Conclusion 80 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Considerable progress has been made in recent years in the development of dialogue systems that support robust and efficient human-machine interaction using spoken language. Spoken dialogue technology allows various interactive applications to be built and used for practical purposes, and research focuses on issues that aim to increase the system's communicative competence by including aspects of error correction, cooperation, multimodality, and adaptation in context. This book gives a comprehensive view of state-of-the-art techniques that are used to build spoken dialogue systems. It provides an overview of the basic issues such as system architectures, various dialogue management methods, system evaluation, and also surveys advanced topics concerning extensions of the basic model to more conversational setups. The goal of the book is to provide an introduction to the methods, problems, and solutions that are used in dialogue system development and evaluation. It presents dialogue modelling and system development issues relevant in both academic and industrial environments and also discusses requirements and challenges for advanced interaction management and future research. Table of Contents: Preface / Introduction to Spoken Dialogue Systems / Dialogue Management / Error Handling / Case Studies: Advanced Approaches to Dialogue Management / Advanced Issues / Methodologies and Practices of Evaluation / Future Directions / References / Author Biographies 168 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This lecture provides a tutorial introduction to the Nyström and locally-corrected Nyström methods when used for the numerical solutions of the common integral equations of two-dimensional electromagnetic fields. These equations exhibit kernel singularities that complicate their numerical solution. Classical and generalized Gaussian quadrature rules are reviewed. The traditional Nyström method is summarized, and applied to the magnetic field equation for illustration. To obtain high order accuracy in the numerical results, the locally-corrected Nyström method is developed and applied to both the electric field and magnetic field equations. In the presence of target edges, where current or charge density singularities occur, the method must be extended through the use of appropriate singular basis functions and special quadrature rules. This extension is also described. Table of Contents: Introduction / Classical Quadrature Rules / The Classical Nyström Method / The Locally-Corrected Nyström Method / Generalized Gaussian Quadrature / LCN Treatment of Edge Singularities 116 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code. The number of states used can be reduced and techniques used for decoding convolutional codes, such as the list Viterbi decoding algorithm, can be applied directly on the trellis. The finite state machine interpretation can be easily migrated to Markov source case. We can encode Markov sources without considering the conditional probabilities, while using the list Viterbi decoding algorithm which utilizes the conditional probabilities. We can also use context-based arithmetic coding to exploit the conditional probabilities of the Markov source and apply a finite state machine interpretation to this problem. The finite state machine interpretation also allows us to more systematically understand arithmetic codes with forbidden symbols. It allows us to find the partial distance spectrum of arithmetic codes with forbidden symbols. We also propose arithmetic codes with memories which use high memory but low implementation precision arithmetic codes. The low implementation precision results in a state machine with less complexity. The introduced input memories allow us to switch the probability functions used for arithmetic coding. Combining these two methods give us a huge parameter space of the arithmetic codes with forbidden symbols. Hence we can choose codes with better distance properties while maintaining the encoding efficiency and decoding complexity. A construction and search method is proposed and simulation results show that we can achieve a similar performance as turbo codes when we apply this approach to rate 2/3 arithmetic codes. Table of Contents: Introduction / Arithmetic Codes / Arithmetic Codes with Forbidden Symbols / Distance Property and Code Construction / ConclusionSpringer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 80 pp. Englisch.