Resultado de la búsqueda
9 búsqueda de la palabra clave 'Languages,'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsqueda
Título : Handbook of Floating-Point Arithmetic Tipo de documento: documento electrónico Autores: Jean-Michel Muller ; SpringerLink (Online service) ; Nicolas Brisebarre ; Florent de Dinechin ; Claude-Pierre Jeannerod ; Vincent Lefèvre ; Guillaume Melquiond ; Nathalie Revol ; Damien Stehlé ; Serge Torres Editorial: Boston : Birkhäuser Boston Fecha de publicación: 2010 Número de páginas: XXIV, 572 p Il.: online resource ISBN/ISSN/DL: 978-0-8176-4705-6 Idioma : Inglés (eng) Palabras clave: Mathematics Programming languages (Electronic computers) Algorithms Computer science mathematics Applied Engineering Computational and Numerical Analysis Algorithm Problem Complexity Math Applications in Science Appl.Mathematics/Computational Methods of Languages, Compilers, Interpreters Clasificación: 51 Matemáticas Resumen: Floating-point arithmetic is by far the most widely used way of implementing real-number arithmetic on modern computers. Although the basic principles of floating-point arithmetic can be explained in a short amount of time, making such an arithmetic reliable and portable, yet fast, is a very difficult task. From the 1960s to the early 1980s, many different arithmetics were developed, but their implementation varied widely from one machine to another, making it difficult for nonexperts to design, learn, and use the required algorithms. As a result, floating-point arithmetic is far from being exploited to its full potential. This handbook aims to provide a complete overview of modern floating-point arithmetic, including a detailed treatment of the newly revised (IEEE 754-2008) standard for floating-point arithmetic. Presented throughout are algorithms for implementing floating-point arithmetic as well as algorithms that use floating-point arithmetic. So that the techniques presented can be put directly into practice in actual coding or design, they are illustrated, whenever possible, by a corresponding program. Key topics and features include: * Presentation of the history and basic concepts of floating-point arithmetic and various aspects of the past and current standards * Development of smart and nontrivial algorithms, and algorithmic possibilities induced by the availability of a fused multiply-add (fma) instruction, e.g., correctly rounded software division and square roots * Implementation of floating-point arithmetic, either in software—on an integer processor—or hardware, and a discussion of issues related to compilers and languages * Coverage of several recent advances related to elementary functions: correct rounding of these functions and computation of very accurate approximations under constraints * Extensions of floating-point arithmetic such as certification, verification, and big precision Handbook of Floating-Point Arithmetic is designed for programmers of numerical applications, compiler designers, programmers of floating-point algorithms, designers of arithmetic operators, and more generally, students and researchers in numerical analysis who wish to better understand a tool used in their daily work and research. Nota de contenido: Introduction, Basic Definitions, and Standards -- Definitions and Basic Notions -- Floating-Point Formats and Environment -- Cleverly Using Floating-Point Arithmetic -- Basic Properties and Algorithms -- The Fused Multiply-Add Instruction -- Enhanced Floating-Point Sums, Dot Products, and Polynomial Values -- Languages and Compilers -- Implementing Floating-Point Operators -- Algorithms for the Five Basic Operations -- Hardware Implementation of Floating-Point Arithmetic -- Software Implementation of Floating-Point Arithmetic -- Elementary Functions -- Evaluating Floating-Point Elementary Functions -- Solving the Table Maker’s Dilemma -- Extensions -- Formalisms for Certifying Floating-Point Algorithms -- Extending the Precision -- Perspectives and Appendix -- Conclusion and Perspectives -- Appendix: Number Theory Tools for Floating-Point Arithmetic En línea: http://dx.doi.org/10.1007/978-0-8176-4705-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33538 Handbook of Floating-Point Arithmetic [documento electrónico] / Jean-Michel Muller ; SpringerLink (Online service) ; Nicolas Brisebarre ; Florent de Dinechin ; Claude-Pierre Jeannerod ; Vincent Lefèvre ; Guillaume Melquiond ; Nathalie Revol ; Damien Stehlé ; Serge Torres . - Boston : Birkhäuser Boston, 2010 . - XXIV, 572 p : online resource.
ISBN : 978-0-8176-4705-6
Idioma : Inglés (eng)
Palabras clave: Mathematics Programming languages (Electronic computers) Algorithms Computer science mathematics Applied Engineering Computational and Numerical Analysis Algorithm Problem Complexity Math Applications in Science Appl.Mathematics/Computational Methods of Languages, Compilers, Interpreters Clasificación: 51 Matemáticas Resumen: Floating-point arithmetic is by far the most widely used way of implementing real-number arithmetic on modern computers. Although the basic principles of floating-point arithmetic can be explained in a short amount of time, making such an arithmetic reliable and portable, yet fast, is a very difficult task. From the 1960s to the early 1980s, many different arithmetics were developed, but their implementation varied widely from one machine to another, making it difficult for nonexperts to design, learn, and use the required algorithms. As a result, floating-point arithmetic is far from being exploited to its full potential. This handbook aims to provide a complete overview of modern floating-point arithmetic, including a detailed treatment of the newly revised (IEEE 754-2008) standard for floating-point arithmetic. Presented throughout are algorithms for implementing floating-point arithmetic as well as algorithms that use floating-point arithmetic. So that the techniques presented can be put directly into practice in actual coding or design, they are illustrated, whenever possible, by a corresponding program. Key topics and features include: * Presentation of the history and basic concepts of floating-point arithmetic and various aspects of the past and current standards * Development of smart and nontrivial algorithms, and algorithmic possibilities induced by the availability of a fused multiply-add (fma) instruction, e.g., correctly rounded software division and square roots * Implementation of floating-point arithmetic, either in software—on an integer processor—or hardware, and a discussion of issues related to compilers and languages * Coverage of several recent advances related to elementary functions: correct rounding of these functions and computation of very accurate approximations under constraints * Extensions of floating-point arithmetic such as certification, verification, and big precision Handbook of Floating-Point Arithmetic is designed for programmers of numerical applications, compiler designers, programmers of floating-point algorithms, designers of arithmetic operators, and more generally, students and researchers in numerical analysis who wish to better understand a tool used in their daily work and research. Nota de contenido: Introduction, Basic Definitions, and Standards -- Definitions and Basic Notions -- Floating-Point Formats and Environment -- Cleverly Using Floating-Point Arithmetic -- Basic Properties and Algorithms -- The Fused Multiply-Add Instruction -- Enhanced Floating-Point Sums, Dot Products, and Polynomial Values -- Languages and Compilers -- Implementing Floating-Point Operators -- Algorithms for the Five Basic Operations -- Hardware Implementation of Floating-Point Arithmetic -- Software Implementation of Floating-Point Arithmetic -- Elementary Functions -- Evaluating Floating-Point Elementary Functions -- Solving the Table Maker’s Dilemma -- Extensions -- Formalisms for Certifying Floating-Point Algorithms -- Extending the Precision -- Perspectives and Appendix -- Conclusion and Perspectives -- Appendix: Number Theory Tools for Floating-Point Arithmetic En línea: http://dx.doi.org/10.1007/978-0-8176-4705-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33538 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Bayesian Networks in R : with Applications in Systems Biology Tipo de documento: documento electrónico Autores: Radhakrishnan Nagarajan ; SpringerLink (Online service) ; Scutari, Marco ; Sophie Lèbre Editorial: New York, NY : Springer New York Fecha de publicación: 2013 Otro editor: Imprint: Springer Colección: Use R!, ISSN 2197-5736 num. 48 Número de páginas: XIII, 157 p. 36 illus Il.: online resource ISBN/ISSN/DL: 978-1-4614-6446-4 Idioma : Inglés (eng) Palabras clave: Statistics Programming languages (Electronic computers) and Computing/Statistics Programs Statistical Theory Methods Languages, Compilers, Interpreters Clasificación: 51 Matemáticas Resumen: Bayesian Networks in R with Applications in Systems Biology introduces the reader to the essential concepts in Bayesian network modeling and inference in conjunction with examples in the open-source statistical environment R. The level of sophistication is gradually increased across the chapters with exercises and solutions for enhanced understanding and hands-on experimentation of key concepts. Applications focus on systems biology with emphasis on modeling pathways and signaling mechanisms from high throughput molecular data. Bayesian networks have proven to be especially useful abstractions in this regards as exemplified by their ability to discover new associations while validating known ones. It is also expected that the prevalence of publicly available high-throughput biological and healthcare data sets may encourage the audience to explore investigating novel paradigms using the approaches presented in the book Nota de contenido: Introduction -- Bayesian Networks in the Absence of Temporal Information -- Bayesian Networds in the Presence of Temporal Information -- Bayesian Network Inference Algorithms -- Parallel Computing for Bayesian Networks -- Solutions -- Index -- References En línea: http://dx.doi.org/10.1007/978-1-4614-6446-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32307 Bayesian Networks in R : with Applications in Systems Biology [documento electrónico] / Radhakrishnan Nagarajan ; SpringerLink (Online service) ; Scutari, Marco ; Sophie Lèbre . - New York, NY : Springer New York : Imprint: Springer, 2013 . - XIII, 157 p. 36 illus : online resource. - (Use R!, ISSN 2197-5736; 48) .
ISBN : 978-1-4614-6446-4
Idioma : Inglés (eng)
Palabras clave: Statistics Programming languages (Electronic computers) and Computing/Statistics Programs Statistical Theory Methods Languages, Compilers, Interpreters Clasificación: 51 Matemáticas Resumen: Bayesian Networks in R with Applications in Systems Biology introduces the reader to the essential concepts in Bayesian network modeling and inference in conjunction with examples in the open-source statistical environment R. The level of sophistication is gradually increased across the chapters with exercises and solutions for enhanced understanding and hands-on experimentation of key concepts. Applications focus on systems biology with emphasis on modeling pathways and signaling mechanisms from high throughput molecular data. Bayesian networks have proven to be especially useful abstractions in this regards as exemplified by their ability to discover new associations while validating known ones. It is also expected that the prevalence of publicly available high-throughput biological and healthcare data sets may encourage the audience to explore investigating novel paradigms using the approaches presented in the book Nota de contenido: Introduction -- Bayesian Networks in the Absence of Temporal Information -- Bayesian Networds in the Presence of Temporal Information -- Bayesian Network Inference Algorithms -- Parallel Computing for Bayesian Networks -- Solutions -- Index -- References En línea: http://dx.doi.org/10.1007/978-1-4614-6446-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32307 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Developing Statistical Software in Fortran 95 Tipo de documento: documento electrónico Autores: David R. Lemmon ; SpringerLink (Online service) ; Schafer, Joseph L Editorial: New York, NY : Springer New York Fecha de publicación: 2005 Colección: Statistics and Computing, ISSN 1431-8784 Número de páginas: XVI, 324 p Il.: online resource ISBN/ISSN/DL: 978-0-387-28123-0 Idioma : Inglés (eng) Palabras clave: Statistics Software engineering Programming languages (Electronic computers) Computer mathematics Computational intelligence and Computing/Statistics Programs Engineering/Programming Operating Systems Languages, Compilers, Interpreters Intelligence Science Engineering Mathematics Numerical Analysis Clasificación: 51 Matemáticas Resumen: Many books teach computational statistics. Until now, however, none has shown how to write a good program. This book gives statisticians, biostatisticians and methodologically-oriented researchers the tools they need to develop high-quality statistical software. Topics include how to Program in Fortran 95 using a pseudo object-oriented style Write accurate and efficient computational procedures Create console applications Build dynamic-link libraries (DLLs) and Windows-based software components Develop graphical user interfaces (GUIs). Through detailed examples, readers are shown how to call Fortran procedures from packages including Excel, SAS, SPSS, S-PLUS, R, and MATLAB. They are even given a tutorial on creating GUIs for Fortran computational code using Visual Basic.NET. This book is for those who want to learn how to create statistical applications quickly and effectively. Prior experience with a programming language such as Basic, Fortran or C is helpful but not required. More experienced programmers will learn new strategies to harness the power of modern Fortran and the object-oriented paradigm. This may serve as a supplementary text for a graduate course on statistical computing. David R. Lemmon is a Research Associate at The Methodology Center in The Pennsylvania State University's College of Health and Human Development. He holds a Ph.D. in Mechanical Engineering from the University of Cincinnati. His areas of previous work include finite element analysis, automobile crash simulation, and biomechanical modeling of the diabetic foot. Since 2001, he has served as the Center's Senior Statistical Programmer, managing the creation of new statistical software for research and education. Joseph L. Schafer is Associate Professor in the Department of Statistics at The Pennsylvania State University and a Principal Investigator at The Methodology Center. He holds a Ph.D. in Statistics from Harvard University. His areas of research include statistical methods for missing values, analysis of longitudinal data, statistical computing and methodology for studies of substance-use prevention. He has served as a statistical consultant to numerous government agencies and has taught many workshops and short courses on topics related to missing data Nota de contenido: Motivation -- to Modern Fortran -- A Pseudo Object-Oriented Style -- Implementing Computational Routines -- Developing a Console Application -- Creating and Using Dynamic-Link Libraries -- Creating COM Servers -- Creating COM Clients En línea: http://dx.doi.org/10.1007/0-387-28123-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35135 Developing Statistical Software in Fortran 95 [documento electrónico] / David R. Lemmon ; SpringerLink (Online service) ; Schafer, Joseph L . - New York, NY : Springer New York, 2005 . - XVI, 324 p : online resource. - (Statistics and Computing, ISSN 1431-8784) .
ISBN : 978-0-387-28123-0
Idioma : Inglés (eng)
Palabras clave: Statistics Software engineering Programming languages (Electronic computers) Computer mathematics Computational intelligence and Computing/Statistics Programs Engineering/Programming Operating Systems Languages, Compilers, Interpreters Intelligence Science Engineering Mathematics Numerical Analysis Clasificación: 51 Matemáticas Resumen: Many books teach computational statistics. Until now, however, none has shown how to write a good program. This book gives statisticians, biostatisticians and methodologically-oriented researchers the tools they need to develop high-quality statistical software. Topics include how to Program in Fortran 95 using a pseudo object-oriented style Write accurate and efficient computational procedures Create console applications Build dynamic-link libraries (DLLs) and Windows-based software components Develop graphical user interfaces (GUIs). Through detailed examples, readers are shown how to call Fortran procedures from packages including Excel, SAS, SPSS, S-PLUS, R, and MATLAB. They are even given a tutorial on creating GUIs for Fortran computational code using Visual Basic.NET. This book is for those who want to learn how to create statistical applications quickly and effectively. Prior experience with a programming language such as Basic, Fortran or C is helpful but not required. More experienced programmers will learn new strategies to harness the power of modern Fortran and the object-oriented paradigm. This may serve as a supplementary text for a graduate course on statistical computing. David R. Lemmon is a Research Associate at The Methodology Center in The Pennsylvania State University's College of Health and Human Development. He holds a Ph.D. in Mechanical Engineering from the University of Cincinnati. His areas of previous work include finite element analysis, automobile crash simulation, and biomechanical modeling of the diabetic foot. Since 2001, he has served as the Center's Senior Statistical Programmer, managing the creation of new statistical software for research and education. Joseph L. Schafer is Associate Professor in the Department of Statistics at The Pennsylvania State University and a Principal Investigator at The Methodology Center. He holds a Ph.D. in Statistics from Harvard University. His areas of research include statistical methods for missing values, analysis of longitudinal data, statistical computing and methodology for studies of substance-use prevention. He has served as a statistical consultant to numerous government agencies and has taught many workshops and short courses on topics related to missing data Nota de contenido: Motivation -- to Modern Fortran -- A Pseudo Object-Oriented Style -- Implementing Computational Routines -- Developing a Console Application -- Creating and Using Dynamic-Link Libraries -- Creating COM Servers -- Creating COM Clients En línea: http://dx.doi.org/10.1007/0-387-28123-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=35135 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Instruction Sequences for Computer Science Tipo de documento: documento electrónico Autores: Jan A. Bergstra ; SpringerLink (Online service) ; Cornelis A. Middelburg Editorial: Paris : Atlantis Press Fecha de publicación: 2012 Colección: Atlantis Studies in Computing, ISSN 2212-8557 num. 2 Número de páginas: XVI, 232 p Il.: online resource ISBN/ISSN/DL: 978-94-91216-65-7 Idioma : Inglés (eng) Palabras clave: Computer science organization Programming languages (Electronic computers) Computers logic Mathematical Science Computation by Abstract Devices Logics and Meanings of Programs Logic Formal Languages Languages, Compilers, Interpreters Systems Organization Communication Networks Clasificación: 51 Matemáticas Resumen: This book demonstrates that the concept of an instruction sequence offers a novel and useful viewpoint on issues relating to diverse subjects in computer science. Selected issues relating to well-known subjects from the theory of computation and the area of computer architecture are rigorously investigated in this book thinking in terms of instruction sequences. The subjects from the theory of computation, to wit the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits. The subjects from the area of computer architecture, to wit instruction sequence performance, instruction set architectures and remote instruction processing, are usually not investigated in a rigorous way at all Nota de contenido: Introduction -- Instruction Sequences -- Instruction Processing -- Expressiveness of Instruction Sequences -- Computation-Theoretic Issues -- Computer-Architectural Issues -- Instruction Sequences and Process Algebra -- Variations on a Theme -- Appendix A: Five Challenges for Projectionism -- Appendix B: Natural Number Functional Units -- Appendix C: Dynamically Instantiated Instructions -- Appendix D: Analytic Execution Architectures En línea: http://dx.doi.org/10.2991/978-94-91216-65-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33067 Instruction Sequences for Computer Science [documento electrónico] / Jan A. Bergstra ; SpringerLink (Online service) ; Cornelis A. Middelburg . - Paris : Atlantis Press, 2012 . - XVI, 232 p : online resource. - (Atlantis Studies in Computing, ISSN 2212-8557; 2) .
ISBN : 978-94-91216-65-7
Idioma : Inglés (eng)
Palabras clave: Computer science organization Programming languages (Electronic computers) Computers logic Mathematical Science Computation by Abstract Devices Logics and Meanings of Programs Logic Formal Languages Languages, Compilers, Interpreters Systems Organization Communication Networks Clasificación: 51 Matemáticas Resumen: This book demonstrates that the concept of an instruction sequence offers a novel and useful viewpoint on issues relating to diverse subjects in computer science. Selected issues relating to well-known subjects from the theory of computation and the area of computer architecture are rigorously investigated in this book thinking in terms of instruction sequences. The subjects from the theory of computation, to wit the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits. The subjects from the area of computer architecture, to wit instruction sequence performance, instruction set architectures and remote instruction processing, are usually not investigated in a rigorous way at all Nota de contenido: Introduction -- Instruction Sequences -- Instruction Processing -- Expressiveness of Instruction Sequences -- Computation-Theoretic Issues -- Computer-Architectural Issues -- Instruction Sequences and Process Algebra -- Variations on a Theme -- Appendix A: Five Challenges for Projectionism -- Appendix B: Natural Number Functional Units -- Appendix C: Dynamically Instantiated Instructions -- Appendix D: Analytic Execution Architectures En línea: http://dx.doi.org/10.2991/978-94-91216-65-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33067 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : M-Solid Varieties of Algebras Tipo de documento: documento electrónico Autores: J. Koppitz ; SpringerLink (Online service) ; K. Denecke Editorial: Boston, MA : Springer US Fecha de publicación: 2006 Colección: Advances in Mathematics num. 10 Número de páginas: XIV, 342 p Il.: online resource ISBN/ISSN/DL: 978-0-387-30806-7 Idioma : Inglés (eng) Palabras clave: Mathematics Programming languages (Electronic computers) Mathematical logic Algebra Group theory Ordered algebraic structures General Algebraic Systems Theory and Generalizations Order, Lattices, Structures Languages, Compilers, Interpreters Logic Formal Languages Clasificación: 51 Matemáticas Resumen: M-Solid Varieties of Algebras provides a complete and systematic introduction to the fundamentals of the hyperequational theory of universal algebra, offering the newest results on M-solid varieties of semirings and semigroups. The book aims to develop the theory of M-solid varieties as a system of mathematical discourse that is applicable in several concrete situations. It applies the general theory to two classes of algebraic structures, semigroups and semirings. Both these varieties and their subvarieties play an important role in computer science. A unique feature of this book is the use of Galois connections to integrate different topics. Galois connections form the abstract framework not only for classical and modern Galois theory, involving groups, fields and rings, but also for many other algebraic, topological, ordertheoretical, categorical and logical theories. This concept is used throughout the whole book, along with the related topics of closure operators, complete lattices, Galois closed subrelations and conjugate pairs of completely additive closure operators. Audience This book is intended for researchers in the fields of universal algebra, semigroups, and semirings; researchers in theoretical computer science; and students and lecturers in these fields Nota de contenido: Basic Concepts -- Closure Operators and Lattices -- M-Hyperidentities and M-solid Varieties -- Hyperidentities and Clone Identities -- Solid Varieties of Arbitrary Type -- Monoids of Hypersubstitutions -- M-Solid Varieties of Semigroups -- M-solid Varieties of Semirings En línea: http://dx.doi.org/10.1007/0-387-30806-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34774 M-Solid Varieties of Algebras [documento electrónico] / J. Koppitz ; SpringerLink (Online service) ; K. Denecke . - Boston, MA : Springer US, 2006 . - XIV, 342 p : online resource. - (Advances in Mathematics; 10) .
ISBN : 978-0-387-30806-7
Idioma : Inglés (eng)
Palabras clave: Mathematics Programming languages (Electronic computers) Mathematical logic Algebra Group theory Ordered algebraic structures General Algebraic Systems Theory and Generalizations Order, Lattices, Structures Languages, Compilers, Interpreters Logic Formal Languages Clasificación: 51 Matemáticas Resumen: M-Solid Varieties of Algebras provides a complete and systematic introduction to the fundamentals of the hyperequational theory of universal algebra, offering the newest results on M-solid varieties of semirings and semigroups. The book aims to develop the theory of M-solid varieties as a system of mathematical discourse that is applicable in several concrete situations. It applies the general theory to two classes of algebraic structures, semigroups and semirings. Both these varieties and their subvarieties play an important role in computer science. A unique feature of this book is the use of Galois connections to integrate different topics. Galois connections form the abstract framework not only for classical and modern Galois theory, involving groups, fields and rings, but also for many other algebraic, topological, ordertheoretical, categorical and logical theories. This concept is used throughout the whole book, along with the related topics of closure operators, complete lattices, Galois closed subrelations and conjugate pairs of completely additive closure operators. Audience This book is intended for researchers in the fields of universal algebra, semigroups, and semirings; researchers in theoretical computer science; and students and lecturers in these fields Nota de contenido: Basic Concepts -- Closure Operators and Lattices -- M-Hyperidentities and M-solid Varieties -- Hyperidentities and Clone Identities -- Solid Varieties of Arbitrary Type -- Monoids of Hypersubstitutions -- M-Solid Varieties of Semigroups -- M-solid Varieties of Semirings En línea: http://dx.doi.org/10.1007/0-387-30806-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34774 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar PermalinkRecent Advances in Algorithmic Differentiation / SpringerLink (Online service) ; Shaun Forth ; Paul Hovland ; Eric Phipps ; Jean Utke ; Andrea Walther (2012)
PermalinkPermalinkPermalink
