Resultado de la búsqueda
23 búsqueda de la palabra clave 'Techniques'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsqueda
Título : Collaborative Quality Assurance in Information Systems Development : The Interaction of Software Development Techniques and Team Cognition Tipo de documento: documento electrónico Autores: Kai Spohrer ; SpringerLink (Online service) Editorial: Cham : Springer International Publishing Fecha de publicación: 2016 Otro editor: Imprint: Springer Colección: Progress in IS, ISSN 2196-8705 Número de páginas: XVIII, 243 p. 17 illus. in color Il.: online resource ISBN/ISSN/DL: 978-3-319-25163-9 Idioma : Inglés (eng) Palabras clave: Business Knowledge management Management information systems Computer programming Software engineering Cognitive psychology and Programming Techniques Engineering Psychology Clasificación: 658 Empresas. Organización de empresas Resumen: This book examines how and why collaborative quality assurance techniques, particularly pair programming and peer code review, affect group cognition and software quality in agile software development teams. Prior research on these extremely popular but also costly techniques has focused on isolated pairs of developers and ignored the fact that they are typically applied in larger, enduring teams. This book is one of the first studies to investigate how these techniques depend on and influence the joint cognitive accomplishments of entire development teams rather than individuals. It employs theories on transactive memory systems and functional affordances to provide answers based on empirical research. The mixed-methods research presented includes several in-depth case studies and survey results from more than 500 software developers, team leaders, and product managers in 81 software development teams. The book's findings will advance IS research and have explicit implications for developers of code review tools, information systems development teams, and software development managers Nota de contenido: Introduction -- Theoretical Foundations -- Research Design -- Findings -- Discussion of Findings -- Conclusion En línea: http://dx.doi.org/10.1007/978-3-319-25163-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=41545 Collaborative Quality Assurance in Information Systems Development : The Interaction of Software Development Techniques and Team Cognition [documento electrónico] / Kai Spohrer ; SpringerLink (Online service) . - Cham : Springer International Publishing : Imprint: Springer, 2016 . - XVIII, 243 p. 17 illus. in color : online resource. - (Progress in IS, ISSN 2196-8705) .
ISBN : 978-3-319-25163-9
Idioma : Inglés (eng)
Palabras clave: Business Knowledge management Management information systems Computer programming Software engineering Cognitive psychology and Programming Techniques Engineering Psychology Clasificación: 658 Empresas. Organización de empresas Resumen: This book examines how and why collaborative quality assurance techniques, particularly pair programming and peer code review, affect group cognition and software quality in agile software development teams. Prior research on these extremely popular but also costly techniques has focused on isolated pairs of developers and ignored the fact that they are typically applied in larger, enduring teams. This book is one of the first studies to investigate how these techniques depend on and influence the joint cognitive accomplishments of entire development teams rather than individuals. It employs theories on transactive memory systems and functional affordances to provide answers based on empirical research. The mixed-methods research presented includes several in-depth case studies and survey results from more than 500 software developers, team leaders, and product managers in 81 software development teams. The book's findings will advance IS research and have explicit implications for developers of code review tools, information systems development teams, and software development managers Nota de contenido: Introduction -- Theoretical Foundations -- Research Design -- Findings -- Discussion of Findings -- Conclusion En línea: http://dx.doi.org/10.1007/978-3-319-25163-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=41545 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Optimization—Theory and Practice Tipo de documento: documento electrónico Autores: Wilhelm Forst ; SpringerLink (Online service) ; Dieter Hoffmann Editorial: New York, NY : Springer New York Fecha de publicación: 2010 Colección: Springer Undergraduate Texts in Mathematics and Technology, ISSN 1867-5506 Número de páginas: XVIII, 402 p Il.: online resource ISBN/ISSN/DL: 978-0-387-78977-4 Idioma : Inglés (eng) Palabras clave: Mathematics Computer programming science Algebra mathematics Mathematical optimization Optimization Programming Techniques Symbolic and Algebraic Manipulation Computational Numerical Analysis Science Engineering Clasificación: 51 Matemáticas Resumen: Optimization is an important field in its own right but also plays a central role in numerous applied sciences, including operations research, management science, economics, finance, and engineering. Optimization — Theory and Practice offers a modern and well-balanced presentation of various optimization techniques and their applications. The book's clear structure, sound theoretical basics complemented by insightful illustrations and instructive examples, makes it an ideal introductory textbook and provides the reader with a comprehensive foundation in one of the most fascinating and useful branches of mathematics. Notable features include: Detailed explanations of theoretic results accompanied by supporting algorithms and exercises, often supplemented by helpful hints or MATLAB®/MAPLE® code fragments; an overview of the MATLAB® Optimization Toolbox and demonstrations of its uses with selected examples; accessibility to readers with a knowledge of multi-dimensional calculus, linear algebra, and basic numerical methods. Written at an introductory level, this book is intended for advanced undergraduates and graduate students, but may also be used as a reference by academics and professionals in mathematics and the applied sciences Nota de contenido: 1. Introduction: Examples of Optimization Problems, Historical Overview -- 2. Optimality Conditions: Convex Sets, Inequalities, Local First- and Second-Order Optimality Conditions, Duality -- 3. Unconstrained Optimization Problems: Elementary Search and Localization Methods, Descent Methods with Line Search, Trust Region Methods, Conjugate Gradient Methods, Quasi-Newton Methods -- 4. Linearly Constrained Optimization Problems: Linear and Quadratic Optimization, Projection Methods -- 5. Nonlinearly Constrained Optimization Methods: Penalty Methods, SQP Methods -- 6. Interior-Point Methods for Linear Optimization: The Central Path, Newton's Method for the Primal-Dual System, Path-Following Algorithms, Predictor-Corrector Methods -- 7. Semidefinite Optimization: Selected Special Cases, The S-Procedure, The Function log°det, Path-Following Methods, How to Solve SDO Problems?, Icing on the Cake: Pattern Separation via Ellipsoids -- 8. Global Optimization: Branch and Bound Methods, Cutting Plane Methods -- Appendices: A Second Look at the Constraint Qualifications, The Fritz John Condition, Optimization Software Tools for Teaching and Learning -- Bibliography -- Index of Symbols -- Subject Index En línea: http://dx.doi.org/10.1007/978-0-387-78977-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33510 Optimization—Theory and Practice [documento electrónico] / Wilhelm Forst ; SpringerLink (Online service) ; Dieter Hoffmann . - New York, NY : Springer New York, 2010 . - XVIII, 402 p : online resource. - (Springer Undergraduate Texts in Mathematics and Technology, ISSN 1867-5506) .
ISBN : 978-0-387-78977-4
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer programming science Algebra mathematics Mathematical optimization Optimization Programming Techniques Symbolic and Algebraic Manipulation Computational Numerical Analysis Science Engineering Clasificación: 51 Matemáticas Resumen: Optimization is an important field in its own right but also plays a central role in numerous applied sciences, including operations research, management science, economics, finance, and engineering. Optimization — Theory and Practice offers a modern and well-balanced presentation of various optimization techniques and their applications. The book's clear structure, sound theoretical basics complemented by insightful illustrations and instructive examples, makes it an ideal introductory textbook and provides the reader with a comprehensive foundation in one of the most fascinating and useful branches of mathematics. Notable features include: Detailed explanations of theoretic results accompanied by supporting algorithms and exercises, often supplemented by helpful hints or MATLAB®/MAPLE® code fragments; an overview of the MATLAB® Optimization Toolbox and demonstrations of its uses with selected examples; accessibility to readers with a knowledge of multi-dimensional calculus, linear algebra, and basic numerical methods. Written at an introductory level, this book is intended for advanced undergraduates and graduate students, but may also be used as a reference by academics and professionals in mathematics and the applied sciences Nota de contenido: 1. Introduction: Examples of Optimization Problems, Historical Overview -- 2. Optimality Conditions: Convex Sets, Inequalities, Local First- and Second-Order Optimality Conditions, Duality -- 3. Unconstrained Optimization Problems: Elementary Search and Localization Methods, Descent Methods with Line Search, Trust Region Methods, Conjugate Gradient Methods, Quasi-Newton Methods -- 4. Linearly Constrained Optimization Problems: Linear and Quadratic Optimization, Projection Methods -- 5. Nonlinearly Constrained Optimization Methods: Penalty Methods, SQP Methods -- 6. Interior-Point Methods for Linear Optimization: The Central Path, Newton's Method for the Primal-Dual System, Path-Following Algorithms, Predictor-Corrector Methods -- 7. Semidefinite Optimization: Selected Special Cases, The S-Procedure, The Function log°det, Path-Following Methods, How to Solve SDO Problems?, Icing on the Cake: Pattern Separation via Ellipsoids -- 8. Global Optimization: Branch and Bound Methods, Cutting Plane Methods -- Appendices: A Second Look at the Constraint Qualifications, The Fritz John Condition, Optimization Software Tools for Teaching and Learning -- Bibliography -- Index of Symbols -- Subject Index En línea: http://dx.doi.org/10.1007/978-0-387-78977-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33510 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : The Cinderella.2 Manual : Working with The Interactive Geometry Software Tipo de documento: documento electrónico Autores: Jürgen Richter Gebert ; SpringerLink (Online service) ; Ulrich H. Kortenkamp Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2012 Número de páginas: XIV, 458 p. 377 illus., 300 illus. in color Il.: online resource ISBN/ISSN/DL: 978-3-540-34926-6 Idioma : Inglés (eng) Palabras clave: Mathematics Computer programming Algorithms Geometry Continuum physics Electronics Microelectronics and Microelectronics, Instrumentation Classical Physics Programming Techniques Clasificación: 51 Matemáticas Resumen: Cinderella.2, the new version of the well-known interactive geometry software, has become an even more versatile tool than its predecessor. It now consists of three connected parts: An enhanced geometry component with new features like transformations and dynamic fractals, a simulation laboratory to explore basic laws of Newton mechanics, and an easy to use scripting language that enables any user to quickly extend the software even further. The Cinderella.2 Manual is the first book to offer complete instruction and techniques for using Cinderella.2. It contains a wealth of examples, in particular for the CindyScript language which interacts smoothly with the geometry and simulation components, and a complete reference. Cinderella.2 is Math in Motion all the way, and this book provides comprehensive documentation from start to finish En línea: http://dx.doi.org/10.1007/978-3-540-34926-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32900 The Cinderella.2 Manual : Working with The Interactive Geometry Software [documento electrónico] / Jürgen Richter Gebert ; SpringerLink (Online service) ; Ulrich H. Kortenkamp . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2012 . - XIV, 458 p. 377 illus., 300 illus. in color : online resource.
ISBN : 978-3-540-34926-6
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer programming Algorithms Geometry Continuum physics Electronics Microelectronics and Microelectronics, Instrumentation Classical Physics Programming Techniques Clasificación: 51 Matemáticas Resumen: Cinderella.2, the new version of the well-known interactive geometry software, has become an even more versatile tool than its predecessor. It now consists of three connected parts: An enhanced geometry component with new features like transformations and dynamic fractals, a simulation laboratory to explore basic laws of Newton mechanics, and an easy to use scripting language that enables any user to quickly extend the software even further. The Cinderella.2 Manual is the first book to offer complete instruction and techniques for using Cinderella.2. It contains a wealth of examples, in particular for the CindyScript language which interacts smoothly with the geometry and simulation components, and a complete reference. Cinderella.2 is Math in Motion all the way, and this book provides comprehensive documentation from start to finish En línea: http://dx.doi.org/10.1007/978-3-540-34926-6 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32900 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Algorithmic Topology and Classification of 3-Manifolds Tipo de documento: documento electrónico Autores: Sergei Matveev ; SpringerLink (Online service) Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2007 Colección: Algorithms and Computation in Mathematics, ISSN 1431-1550 num. 9 Número de páginas: XIV, 492 p Il.: online resource ISBN/ISSN/DL: 978-3-540-45899-9 Idioma : Inglés (eng) Palabras clave: Mathematics Computer programming science Algorithms Differential geometry Topology Programming Techniques Geometry Symbolic and Algebraic Manipulation Clasificación: 51 Matemáticas Resumen: From the reviews of the 1st edition: "This book provides a comprehensive and detailed account of different topics in algorithmic 3-dimensional topology, culminating with the recognition procedure for Haken manifolds and including the up-to-date results in computer enumeration of 3-manifolds. Originating from lecture notes of various courses given by the author over a decade, the book is intended to combine the pedagogical approach of a graduate textbook (without exercises) with the completeness and reliability of a research monograph… All the material, with few exceptions, is presented from the peculiar point of view of special polyhedra and special spines of 3-manifolds. This choice contributes to keep the level of the exposition really elementary. In conclusion, the reviewer subscribes to the quotation from the back cover: "the book fills a gap in the existing literature and will become a standard reference for algorithmic 3-dimensional topology both for graduate students and researchers". R. Piergallini, Zentralblatt für Mathematik 1048 (2004) For this 2nd edition, new results, new proofs, and commentaries for a better orientation of the reader have been added Nota de contenido: Simple and Special Polyhedra -- Complexity Theory of 3-Manifolds -- Haken Theory of Normal Surfaces -- Applications of the Theory of Normal Surfaces -- Algorithmic Recognition of S3 -- Classification of Haken 3-Manifolds -- 3-Manifold Recognizer -- The Turaev–Viro Invariants En línea: http://dx.doi.org/10.1007/978-3-540-45899-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34635 Algorithmic Topology and Classification of 3-Manifolds [documento electrónico] / Sergei Matveev ; SpringerLink (Online service) . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2007 . - XIV, 492 p : online resource. - (Algorithms and Computation in Mathematics, ISSN 1431-1550; 9) .
ISBN : 978-3-540-45899-9
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer programming science Algorithms Differential geometry Topology Programming Techniques Geometry Symbolic and Algebraic Manipulation Clasificación: 51 Matemáticas Resumen: From the reviews of the 1st edition: "This book provides a comprehensive and detailed account of different topics in algorithmic 3-dimensional topology, culminating with the recognition procedure for Haken manifolds and including the up-to-date results in computer enumeration of 3-manifolds. Originating from lecture notes of various courses given by the author over a decade, the book is intended to combine the pedagogical approach of a graduate textbook (without exercises) with the completeness and reliability of a research monograph… All the material, with few exceptions, is presented from the peculiar point of view of special polyhedra and special spines of 3-manifolds. This choice contributes to keep the level of the exposition really elementary. In conclusion, the reviewer subscribes to the quotation from the back cover: "the book fills a gap in the existing literature and will become a standard reference for algorithmic 3-dimensional topology both for graduate students and researchers". R. Piergallini, Zentralblatt für Mathematik 1048 (2004) For this 2nd edition, new results, new proofs, and commentaries for a better orientation of the reader have been added Nota de contenido: Simple and Special Polyhedra -- Complexity Theory of 3-Manifolds -- Haken Theory of Normal Surfaces -- Applications of the Theory of Normal Surfaces -- Algorithmic Recognition of S3 -- Classification of Haken 3-Manifolds -- 3-Manifold Recognizer -- The Turaev–Viro Invariants En línea: http://dx.doi.org/10.1007/978-3-540-45899-9 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34635 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Algorithms and Programming : Problems and Solutions Tipo de documento: documento electrónico Autores: Shen, Alexander ; SpringerLink (Online service) Editorial: New York, NY : Springer New York Fecha de publicación: 2010 Otro editor: Imprint: Springer Colección: Springer Undergraduate Texts in Mathematics and Technology, ISSN 1867-5506 Número de páginas: XII, 272 p Il.: online resource ISBN/ISSN/DL: 978-1-4419-1748-5 Idioma : Inglés (eng) Palabras clave: Mathematics Computer programming Algorithms mathematics Numerical analysis Analysis Programming Techniques Computational and Algorithm Problem Complexity Clasificación: 51 Matemáticas Resumen: "Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News Nota de contenido: Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR) En línea: http://dx.doi.org/10.1007/978-1-4419-1748-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33609 Algorithms and Programming : Problems and Solutions [documento electrónico] / Shen, Alexander ; SpringerLink (Online service) . - New York, NY : Springer New York : Imprint: Springer, 2010 . - XII, 272 p : online resource. - (Springer Undergraduate Texts in Mathematics and Technology, ISSN 1867-5506) .
ISBN : 978-1-4419-1748-5
Idioma : Inglés (eng)
Palabras clave: Mathematics Computer programming Algorithms mathematics Numerical analysis Analysis Programming Techniques Computational and Algorithm Problem Complexity Clasificación: 51 Matemáticas Resumen: "Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News Nota de contenido: Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR) En línea: http://dx.doi.org/10.1007/978-1-4419-1748-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33609 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar Ancient Astronomical Observations and the Study of the Moon’s Motion (1691-1757) / John M. Steele (2012)
PermalinkPermalinkPermalinkPermalinkPermalink
