Computer programming / software engineering Books
Taylor & Francis Ltd HIGHER NATIONAL COMPUTING TUTOR RESOURCE PACK 2ND EDITION
a huge range and FREE tracked UK delivery on ALL orders.
£128.25
Taylor & Francis Ltd Real Process Improvement Using the CMMI
a huge range and FREE tracked UK delivery on ALL orders.
£75.99
Cambridge University Press Foundations of Parallel Programming
a huge range and FREE tracked UK delivery on ALL orders.
£35.14
Cambridge University Press A Short Course in Computational Science and Engineering
a huge range and FREE tracked UK delivery on ALL orders.
£29.44
Cambridge University Press Principles of Constraint Programming
a huge range and FREE tracked UK delivery on ALL orders.
£48.44
Cambridge University Press Student Solution Manual for Essential Mathematical Methods for the Physical Sciences
a huge range and FREE tracked UK delivery on ALL orders.
£18.99
Cambridge University Press Formal Methods for Distributed Processing
a huge range and FREE tracked UK delivery on ALL orders.
£45.59
Cambridge University Press Program Construction 22 Cambridge Computer Science Texts Series Number 22
a huge range and FREE tracked UK delivery on ALL orders.
£41.79
Cambridge University Press Testing in Software Development
a huge range and FREE tracked UK delivery on ALL orders.
£29.99
Cambridge University Press Concurrent Programming 26 Cambridge Computer Science Texts Series Number 26
a huge range and FREE tracked UK delivery on ALL orders.
£37.99
Cambridge University Press Efficient Algorithms for Listing Combinatorial Structures 5 Distinguished Dissertations in Computer Science Series Number 5
a huge range and FREE tracked UK delivery on ALL orders.
£88.00
Cambridge University Press The Muse Method for Usability Engineering
a huge range and FREE tracked UK delivery on ALL orders.
£115.90
Cambridge University Press The Muse Method for Usability Engineering
a huge range and FREE tracked UK delivery on ALL orders.
£52.24
Cambridge University Press Semiotics of Programming
a huge range and FREE tracked UK delivery on ALL orders.
£57.95
Cambridge University Press Memory as a Programming Concept in C and C
Book SynopsisThis 2004 book provides students and professional programmers with a concise yet comprehensive view of the role memory plays in all aspects of programming and program behaviour. Describes the techniques and tools to deal with the problems related to memory and its effective use, assuming only a basic knowledge of C or C++.Table of Contents1. Introduction; 2. From source file to executable file; 3. Variables and objects, pointers and addresses; 4. Dynamic allocation and deallocation of memory; 5. Functions and function calls; 6. One-dimensional arrays and strings; 7. Multi-dimensional arrays; 8. Classes and objects; 9. Linked data structures; 10. Memory leaks and their debugging; 11. Programs in execution - processes and threads.
£40.84
Cambridge University Press Parallel Scientific Computing in C and Mpi
a huge range and FREE tracked UK delivery on ALL orders.
£71.24
Cambridge University Press Qualified Types
a huge range and FREE tracked UK delivery on ALL orders.
£35.14
Cambridge University Press Logic Programming
a huge range and FREE tracked UK delivery on ALL orders.
£35.14
Cambridge University Press Predicate Transformer Semantics
a huge range and FREE tracked UK delivery on ALL orders.
£49.39
Cambridge University Press Online Computation Compet Analysis
a huge range and FREE tracked UK delivery on ALL orders.
£75.99
Cambridge University Press Information Theory Inference and Learning
Book SynopsisInformation theory and inference, taught together in this exciting textbook, lie at the heart of many important areas of modern technology - communication, signal processing, data mining, machine learning, pattern recognition, computational neuroscience, bioinformatics and cryptography. The book introduces theory in tandem with applications. Information theory is taught alongside practical communication systems such as arithmetic coding for data compression and sparse-graph codes for error-correction. Inference techniques, including message-passing algorithms, Monte Carlo methods and variational approximations, are developed alongside applications to clustering, convolutional codes, independent component analysis, and neural networks. Uniquely, the book covers state-of-the-art error-correcting codes, including low-density-parity-check codes, turbo codes, and digital fountain codes - the twenty-first-century standards for satellite communications, disk drives, and data broadcast. RichlyTrade Review'This is an extraordinary and important book, generous with insight and rich with detail in statistics, information theory, and probabilistic modeling across a wide swathe of standard, creatively original, and delightfully quirky topics. David MacKay is an uncompromisingly lucid thinker, from whom students, faculty and practitioners all can learn.' Peter Dayan and Zoubin Ghahramani, Gatsby Computational Neuroscience Unit, University College, London'This is primarily an excellent textbook in the areas of information theory, Bayesian inference and learning algorithms. Undergraduates and postgraduates students will find it extremely useful for gaining insight into these topics; however, the book also serves as a valuable reference for researchers in these areas. Both sets of readers should find the book enjoyable and highly useful.' David Saad, Aston University'An utterly original book that shows the connections between such disparate fields as information theory and coding, inference, and statistical physics.' Dave Forney, Massachusetts Institute of Technology'An instant classic, covering everything from Shannon's fundamental theorems to the postmodern theory of LDPC codes. You'll want two copies of this astonishing book, one for the office and one for the fireside at home.' Bob McEliece, California Institute of Technology'… a quite remarkable work … the treatment is specially valuable because the author has made it completely up-to-date … this magnificent piece of work is valuable in introducing a new integrated viewpoint, and it is clearly an admirable basis for taught courses, as well as for self-study and reference. I am very glad to have it on my shelves.' Robotica'With its breadth, accessibility and handsome design, this book should prove to be quite popular. Highly recommended as a primer for students with no background in coding theory, the set of chapters on error correcting codes are an excellent brief introduction to the elements of modern sparse graph codes: LDPC, turbo, repeat-accumulate and fountain codes are described clearly and succinctly.' IEEE Transactions on Information TheoryTable of Contents1. Introduction to information theory; 2. Probability, entropy and inference; 3. More about inference; Part I. Data Compression: 4. The source coding theorem; 5. Symbol codes; 6. Stream codes; 7. Codes for integers; Part II. Noisy-Channel Coding: 8. Dependent random variables; 9. Communication over a noisy channel; 10. The noisy-channel coding theorem; 11. Error-correcting codes and real channels; Part III. Further Topics in Information Theory: 12. Hash codes; 13. Binary codes; 14. Very good linear codes exist; 15. Further exercises on information theory; 16. Message passing; 17. Constrained noiseless channels; 18. Crosswords and codebreaking; 19. Why have sex? Information acquisition and evolution; Part IV. Probabilities and Inference: 20. An example inference task: clustering; 21. Exact inference by complete enumeration; 22. Maximum likelihood and clustering; 23. Useful probability distributions; 24. Exact marginalization; 25. Exact marginalization in trellises; 26. Exact marginalization in graphs; 27. Laplace's method; 28. Model comparison and Occam's razor; 29. Monte Carlo methods; 30. Efficient Monte Carlo methods; 31. Ising models; 32. Exact Monte Carlo sampling; 33. Variational methods; 34. Independent component analysis; 35. Random inference topics; 36. Decision theory; 37. Bayesian inference and sampling theory; Part V. Neural Networks: 38. Introduction to neural networks; 39. The single neuron as a classifier; 40. Capacity of a single neuron; 41. Learning as inference; 42. Hopfield networks; 43. Boltzmann machines; 44. Supervised learning in multilayer networks; 45. Gaussian processes; 46. Deconvolution; Part VI. Sparse Graph Codes; 47. Low-density parity-check codes; 48. Convolutional codes and turbo codes; 49. Repeat-accumulate codes; 50. Digital fountain codes; Part VII. Appendices: A. Notation; B. Some physics; C. Some mathematics; Bibliography; Index.
£52.24
Cambridge University Press The Haskell School of Expression Learning Functional Programming through Multimedia
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Cambridge University Press The Haskell School of Expression Learning Functional Programming through Multimedia
a huge range and FREE tracked UK delivery on ALL orders.
£43.69
Cambridge University Press Semiotics of Programming
a huge range and FREE tracked UK delivery on ALL orders.
£33.24
Cambridge University Press Formal Methods for Distributed Processing
a huge range and FREE tracked UK delivery on ALL orders.
£128.25
Cambridge University Press Design Patterns in Communications Software 19 SIGS Reference Library Series Number 19
a huge range and FREE tracked UK delivery on ALL orders.
£94.04
Cambridge University Press Intro to Distributed Algorithms 2ed
a huge range and FREE tracked UK delivery on ALL orders.
£59.84
Cambridge University Press Memory Program Concept C and C
a huge range and FREE tracked UK delivery on ALL orders.
£98.80
Cambridge University Press Principles of Constraint Programming
a huge range and FREE tracked UK delivery on ALL orders.
£61.75
Cambridge University Press Constraint Logic Programming using Eclipse
a huge range and FREE tracked UK delivery on ALL orders.
£67.44
Cambridge University Press Constraint Handling Rules
a huge range and FREE tracked UK delivery on ALL orders.
£46.54
Cambridge University Press Modeling in EventB System and Software Engineering
Book SynopsisA practical text suitable for an introductory or advanced course in formal methods, this book presents a mathematical approach to modelling and designing systems using an extension of the B formal method: Event-B. Based on the idea of refinement, the author's systematic approach allows the user to construct models gradually and to facilitate a systematic reasoning method by means of proofs. Readers will learn how to build models of programs and, more generally, discrete systems, but this is all done with practice in mind. The numerous examples provided arise from various sources of computer system developments, including sequential programs, concurrent programs and electronic circuits. The book also contains a large number of exercises and projects ranging in difficulty. Each of the examples included in the book has been proved using the Rodin Platform tool set, which is available free for download at www.event-b.org.Trade Review'This present book is the definitive treatment of the new B dialect, written by its creator. Unlike its classical B predecessor which is intended as a reference for the classical B methodology, the present volume is squarely aimed at teaching, though the considerably lighter theory of Event-B permits some of the chapters to act as a reference too.' logcom.oxfordjournals.org'… a rich and accessible book, demonstrating both the strengths and weaknesses of the use of Event-B, and containing varied and valuable case studies as its core. It is written in a pleasant colloquial style, with changes in the vocal tempo and tone leaping off the pages. … should be seriously considered for introductory courses on formal modelling with associated proof.' Journal of Functional ProgrammingTable of ContentsPrologue: faultless systems – yes we can!; Acknowledgements; 1. Introduction; 2. Controlling cars on a bridge; 3. A mechanical press controller; 4. A simple file transfer protocol; 5. The Event-B modeling notation and proof obligations rules; 6. Bounded re-transmission protocol; 7. Development of a concurrent program; 8. Development of electronic circuits; 9. Mathematical language; 10. Leader election on a ring-shaped network; 11. Synchronizing a tree-shaped network; 12. Routing algorithm for a mobile agent; 13. Leader election on a connected graph network; 14. Mathematical models for proof obligations; 15. Development of sequential programs; 16. A location access controller; 17. Train system; 18. Problems; Index.
£115.90
Cambridge University Press A First Guide to Computational Modelling in Physics
a huge range and FREE tracked UK delivery on ALL orders.
£56.99
Cambridge University Press Cultures of Programming
a huge range and FREE tracked UK delivery on ALL orders.
£75.99
Cambridge University Press Learning Scientific Programming with Python
Book SynopsisLearn to master basic programming tasks from scratch with real-life scientific examples drawn from many different areas of science and engineering. This complete introduction to using Python teaches Numpy, SciPy and Matplotlib libraries and is supported by extensive online resources to provide a targeted package for students and researchers.Trade Review'This book is well illustrated and is supported by an extensive collection of resources online in the book's website, scipython.com. This site has code listings and solutions to exercises. I would readily recommend this book to any student (or even a colleague) who wishes to achieve a solid foundation in Python programming.' Vasudevan Lakshminarayanan, Contemporary PhysicsTable of Contents1. Introduction; 2. The core Python language I; 3. Interlude: simple plotting with pylab; 4. The core Python language II; 5. IPython and IPython notebook; 6. NumPy; 7. Matplotlib; 8. SciPy; 9. General scientific programming; Appendix A. Solutions; Index.
£82.64
Cambridge University Press Programming Languages
This 'great ideas applied in practice' textbook emphasizes practice. It distills key programming languages and their design ideas down to small, simple languages implemented by an interpreter, The hands-on approach lets readers develop skills that will help them be productive programmers even in languages they've never seen before.
£61.74
Cambridge University Press Modern Fortran in Practice
Book SynopsisFrom its earliest days, the Fortran programming language has been designed with computing efficiency in mind. The latest standard, Fortran 2008, incorporates a host of modern features, including object-orientation, array operations, user-defined types, and provisions for parallel computing. This tutorial guide shows Fortran programmers how to apply these features in twenty-first-century style: modular, concise, object-oriented, and resource-efficient, using multiple processors. It offers practical real-world examples of interfacing to C, memory management, graphics and GUIs, and parallel computing using MPI, OpenMP, and coarrays. The author also analyzes several numerical algorithms and their implementations and illustrates the use of several open source libraries. Full source code for the examples is available on the book's website.Trade Review'A language cannot survive without a means to learn about it. This implies the availability not only of textbooks on the language's syntax and semantics but also of books on how to use the language in real-life situations. Somehow, experience in the use and application of a language needs to be passed on to a new generation of programmers and new features require advice on how they are best to be used. Here, at a time when only rarely is a single language used in isolation, but more often in conjunction with other languages or with various tools, Modern Fortran in Practice fulfils a real need for practical advice in the field. I recommend it to all Fortran practitioners.' Michael Metcalf, from the Foreword'Scientists, mathematicians, and engineers will find that Modern Fortran in Practice speaks their language. Arjen Markus introduces modern Fortran features using real-world examples and practical advice. If your knowledge of Fortran stops at FORTRAN-77 or even Fortran 90, Markus's book will open your eyes to what today's Fortran can do for you.' Steve Lionel, Senior Member Technical Staff, Intel Corporation'Modern Fortran in Practice shows by practical examples how reliable and maintainable programs can be written. Starting with examples in Fortran 95, Fortran 2003/2008 features are then introduced and used to improve the code, thus showing different approaches but also providing a solution for older compilers. The author covers the whole development - from algorithm choice and error handling to graphical interfaces, parallelization, and unit testing. The book is an ideal complement to books that focus on the syntax of Fortran.' Tobias Burnus, Institute for Advanced Simulation, Research Centre Jülich'This book is a very welcome complement to the existing literature on modern Fortran. While most Fortran books serve as comprehensive language references, this book stands out for its extensive demonstrations of practical applications of the language. Especially interesting are the many demonstrations of the newest programming paradigms Fortran supports, including object-oriented programming, functional programming, and parallel programming.' Damian Rouson, Sandia National LaboratoryTable of Contents1. Introduction to modern Fortran; 2. Array-valued functions; 3. Mathematical abstractions; 4. Memory management; 5. An interface problem; 6. Interfacing to C: SQLite as an example; 7. Graphics, GUIs, and the internet; 8. Unit testing; 9. Code reviews; 10. Robust implementation of several simple algorithms; 11. Object-oriented programming; 12. Parallel programming; Appendix A. Tools for development and maintenance; Appendix B. Caveats.
£54.14
Cambridge University Press Competitive Programming in Python
Book SynopsisWant to kill it at your job interview in the tech industry? Want to win that coding competition? Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. Readers can expect to master 128 algorithms in Python and discover the right way to tackle a problem and quickly implement a solution of low complexity. Classic problems like Dijkstra''s shortest path algorithm and Knuth-Morris-Pratt''s string matching algorithm are featured alongside lesser known data structures like Fenwick trees and Knuth''s dancing links. The book provides a framework to tackle algorithmic problem solving, including: Definition, Complexity, Applications, Algorithm, Key Information, Implementation, Variants, In Practice, and Problems. Python code included in the boTrade Review'This book guides the reader through a collection of interesting problems, teaching us many ideas that underlie efficient algorithms. The simplicity of Python helps highlight the beauty and accessibility of the ideas. I found it a most enjoyable and engaging book.' Anupam Gupta, Carnegie Mellon UniversityTable of Contents1. Introduction; 2. Character strings; 3. Sequences; 4. Arrays; 5. Intervals; 6. Graphs; 7. Cycles in graphs; 8. Shortest paths; 9. Matching and flows; 10. Trees; 11. Sets; 12. Points and polygons; 13. Rectangles; 14. Numbers and matrices; 15. Exhaustive search; 16. Conclusion.
£32.29
Pearson Education (US) Introduction to Game Design Prototyping and
Book SynopsisTable of Contents P1 Game Design and Paper Prototyping 0 Introduction 1 Thinking Like a Designer 2 Game Analysis Lexicons 3 The Layered Tetrad 4 Acting Like a Designer 5 Design Goals 6 The Inscribed Layer 7 The Dynamic Layer 8 The Cultural Layer 9 Paper Prototyping and Iteration 10 Playtesting and Usability Testing 11 Math & Game Balance 12 Puzzle Design 13 Guiding the Player 14 The Digital Game Industry 15 The Agile Development Prototyping Mentality P2 Digital Prototyping 16 Thinking in Digital Systems 17 Introducing our Development Environment: Unity 18 Introducing our Language: C# 19 Your First Program: Hello World 20 Debugging 21 Variables and Components 22 Boolean Operations and Conditionals 23 Loops 24 Lists and Arrays 25 Functions and Parameters 26 Classes 27 Object-Oriented Thinking P3 Game Prototype Examples and Tutorials 28 Prototype 1: Apple Picker 29 Prototype 2: Mission Demolition 30 Prototype 3: Space SHMUP 31 Prototype 4: Prospector Solitaire 32 Prototype 5: Bartok 33 Prototype 6: Word Game 34 Prototype 7: QuickSnap 35 Prototype 8: Omega Mage P4 Appendices 36 Standard Project Setup Procedure 37 Useful Concepts Reference 38 Online References
£59.49
MIT Press Ltd Principles of Abstract Interpretation
Book SynopsisIntroduction to abstract interpretation, with examples of applications to the semantics, specification, verification, and static analysis of computer programs.Formal methods are mathematically rigorous techniques for the specification, development, manipulation, and verification of safe, robust, and secure software and hardware systems. Abstract interpretation is a unifying theory of formal methods that proposes a general methodology for proving the correctness of computing systems, based on their semantics. The concepts of abstract interpretation underlie such software tools as compilers, type systems, and security protocol analyzers. This book provides an introduction to the theory and practice of abstract interpretation, offering examples of applications to semantics, specification, verification, and static analysis of programming languages with emphasis on calculational design. The book covers all necessary computer science and mathematical concepts--includ
£76.00
MIT Press Ltd Machine Learning from Weak Supervision An
Book SynopsisFundamental theory and practical algorithms of weakly supervised classification, emphasizing an approach based on empirical risk minimization.Standard machine learning techniques require large amounts of labeled data to work well. When we apply machine learning to problems in the physical world, however, it is extremely difficult to collect such quantities of labeled data. In this book Masashi Sugiyama, Han Bao, Takashi Ishida, Nan Lu, Tomoya Sakai and Gang Niu present theory and algorithms for weakly supervised learning, a paradigm of machine learning from weakly labeled data. Emphasizing an approach based on empirical risk minimization and drawing on state-of-the-art research in weakly supervised learning, the book provides both the fundamentals of the field and the advanced mathematical theories underlying them. It can be used as a reference for practitioners and researchers and in the classroom.The book first mathematically formulates classification problems,
£58.90
MIT Press Ltd Automata Theory
Book SynopsisA comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.This textbook presents automata theory from a fresh viewpoint inspired by its main modern application, program verification, where automata are viewed as data structures for the algorithmic manipulation of sets and relations. This novel “automata as data structures” paradigm makes holistic connections between automata theory and other areas of computer science not covered in traditional texts, linking the study of algorithms and data structures with that of the theory of formal languages and computability. Esparza and Blondin provide incisive overviews of core concepts along with illustrated examples and exercises that facilitate quick comprehension of rigorous material. Uses novel “automata as data structures” approach Algorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verification The first introduction to automata on infinite words that does not assume prior knowledge of finite automata Suitable for both undergraduate and graduate students Thorough, engaging presentation of concepts balances description, examples, and theoretical results Extensive illustrations, exercises, and solutions deepen comprehension
£72.20
MIT Press Ltd Programming for the Puzzled Learn to Program
Book SynopsisLearning programming with one of “the coolest applications around”: algorithmic puzzles ranging from scheduling selfie time to verifying the six degrees of separation hypothesis.This book builds a bridge between the recreational world of algorithmic puzzles (puzzles that can be solved by algorithms) and the pragmatic world of computer programming, teaching readers to program while solving puzzles. Few introductory students want to program for programming's sake. Puzzles are real-world applications that are attention grabbing, intriguing, and easy to describe. Each lesson starts with the description of a puzzle. After a failed attempt or two at solving the puzzle, the reader arrives at an Aha! moment—a search strategy, data structure, or mathematical fact—and the solution presents itself. The solution to the puzzle becomes the specification of the code to be written. Readers will thus know what the code is supposed to do before seeing the code it
£24.00
John Wiley & Sons Inc Software Development Rhythms
Book SynopsisAn accessible, innovative perspective on using the flexibility of agile practices to increase software quality and profitability When agile approaches in your organization don''t work as expected or you feel caught in the choice between agility and discipline, it is time to stop and think about software development rhythms! Agile software development is a popular development process that continues to reshape philosophies on the connections between disciplined processes and agile practices. In Software Development Rhythms, authors Lui and Chan explain how adopting one practice and combining it with another builds upon the flexibility of agile practices to create a type of synergy defined as software development rhythms. The authors demonstrate how these rhythms can be harmonized to achieve synergies, making them stronger together than they would be apart. Software Development Rhythms provides programmers with a powerful metaphor for resolving some classic software management Trade Review"It is full of case studies, anecdotes, and exercises, all illustrated with clever, yet instructive cartoons." (Ubiquity, June 10-16, 2008)Table of ContentsPART I: ESSENTIALS. Chapter 1: No Programmer Dies. 1.1 Developing Software vs. Building a Tunnel. 1.1.1 The good old days? 1.1.2 The more things change the more they stay the same? 1.1.3 Behind Software Products. 1.1.4 Deal or not deal. 1.2 Do-Re-Mi Do-Re-Mi. 1.2.1 Iterative Models. 1.2.2 Code and Fix. 1.2.3 Chaos. 1.2.4 Methodology that matters. 1.3 Software Development Rhythms. 1.3.1 Stave Chart by Example. 1.3.2 Game Theory. 1.3.3 IN-OUT Diagram. 1.3.4 Master-Coach Diagram. 1.3.5 No Mathematics. 1.3.6 Where to Explore Rhythms. Chapter 2: Understanding Programmers. 2.1 Personality and Intelligence. 2.1.1 Virtuosi. 2.1.2 Meeting your team. 2.1.3 Recruiting Programmers. 2.2 Outsourced Programmers. 2.2.1 Programmers in Their Environments. 2.2.2 Programmers, Cultures, and Teams. 2.3 Experienced Management. 2.3.1 Being Casual about Causal Relationships. 2.3.2 Not Learning From Experience. 2.3.3 Doing things right right now. Chapter 3: Start with Open Source. 3.1 Process and Practice. 3.1.1 The 4Ps of Projects. 3.1.2 Agile Values. 3.1.3 Zero-point collaboration. 3.2 OSS Development. 3.2.1 Software Cloning. 3.2.2 Software Quality. 3.2.3 Starting Processes. 3.2.4 Open Source Development Community. 3.2.5 Ugrammers. 3.2.6 Participant Roles. 3.2.7 Rapid Release. 3.2.8 Black-box Programming. 3.2.9 Open Source Software Practices. 3.3 OOS-Like Development. 3.3.1 Agile Practices. 3.3.2 Communication Proximity. 3.3.3 Loose and Tight Couple. 3.3.4 Co-located OSS Development. PART II: RHYTHMS. Chapter 4: Plagiarism Programming. 4.1 Plagiarism. 4.1.1 Existing Code. 4.1.2 Social Network Analysis. 4.1.3 Being Plagiarized. 4.1.4 Turn everyone into a programmer. 4.1.5 Pattern Language. 4.1.6 Software Team Capability. 4.1.7 Rough-Cut Design. 4.1.8 Training is not a solution. 4.2 Nothing Faster than Plagiarism. 4.2.1 Immorality. 4.2.2 Unprecedented Code. 4.2.3 People Network. 4.2.4 Rhythm for Plagiarism. 4.2.5 Plagiarism at Work. 4.3 Business and Rhythm for Plagiarism. 4.3.1 15 Minute Business Presentation. 4.3.2 Marketing Research. 4.3.3 Chatting Robot. 4.3.4 Old Song New Singer. Chapter 5: Pair Programming. 5.1 Art and Science. 5.1.1 The Right Partner. 5.1.2 Noisy Programming. 5.1.3 Just Training. 5.1.4 Pay to watch. 5.2 Two Worlds. 5.2.1 Moneyless World. 5.2.2 Money-led World. 5.2.3 Economics. 5.2.4 Mythical Quality-time. 5.2.5 Elapsed Time. 5.2.6 Critical Path Method. 5.2.7 Why two not three: Anti-Group. 5.2.8 Software Requirements are Puzzles. 5.3 Programming Task Demands. 5.3.1 2 and 4 is 6. 5.3.2 2 and 4 is 4. 5.3.3 2 and 4 is 3. 5.3.4 2 and 4 ≥ 2. 5.3.5 2 and 4 is unknown. 5.4 Pair programming is more than programming. 5.4.1 Design by Code. 5.4.2 Pair Design. 5.4.3 Rhythmic Pair Programming. 5.5 Pair programming Team Coached. Chapter 6: Repeat Programming. 6.1 Controversies in Pair Programming. 6.1.1 Is Programming a Unique Work? 6.1.2 Are Three Minds Better Than Two? 6.1.3 Un-replicable Experiments. 6.2 Repeat Programming. 6.2.1 Variances. 6.2.2 Principles. 6.2.3 Triple Programming Unproductive. 6.3 Rhythm: Pair - Solo - Pair - Solo. 6.3.1 Persistence. 6.3.2 Connection. 6.3.3 Motivation. 6.4 An exception that proves Brooks’ Law. 6.4.1 Low Morale. 6.4.2 Communication Costs. 6.4.3 Rhythm for Late Projects. Chapter 7: Agile Teaming. 7.1 Project Teams. 7.1.1 Self-organizing teams. 7.1.2 Teams in Team. 7.1.3 Project Team Composition. 7.1.4 Team Life Cycle vs. Learning Curve. 7.2 Productivity. 7.2.1 The Illusion of Productivity. 7.2.2 Collective Code Ownership. 7.2.3 Accountability, Responsibility and Transparency. 7.3 Problems and Problem Owners. 7.3.1 Rhythm: Trouble - Restructuring. 7.3.2 Teaming Principles. 7.4 Failing Projects Rescued. 7.4.1 Project Traffic Light. 7.4.2 A Business Case. 7.4.3 Steering Committee Meeting. 7.4.4 Agile Teaming in Action. 7.5 Beware of Iago. Chapter 8: Incremental Design. 8.1 Modeling and Planning. 8.1.1 Agile Planning. 8.1.2 Design by Functional Modules. 8.1.3 Simple Design. 8.1.4 Total Cost Concept. 8.2 Rework or reuse. 8.2.1 Unpreventable Rework. 8.2.2 Improvisation. 8.2.3 Up-front Design. 8.3 Just-in-time Software Development. 8.3.1 The CMM Rhythm. 8.3.2 A Factory Tour. 8.3.3 Walking Worker. 8.3.4 Just-in-time Software Development. 8.3.5 Incremental Design. 8.4 Requirements Complexity. 8.4.1 Forgotten Requirements. 8.4.2 Conflicting Requirements. 8.4.3 Rapid Changing Requirements. 8.4.4 Requirements and Design. 8.5 Refactoring. 8.5.1 Refactoring Activities. 8.5.2 Refactoring by Challenging. 8.5.3 Refactoring for Design Patterns. 8.5.4 Making Deliberate Mistakes. Chapter 9: Test-Driven Development. 9.1 Reverse Waterfall. 9.1.1 Design - Code - Test. 9.1.2 Test - Code - Design. 9.2 Test-First Programming. 9.2.1 Testing and Verification. 9.2.2 Break-point testing. 9.2.3 Supporting Practices. 9.3 Rhythm: Test - Code - Refactor. 9.3.1 Simple Example. 9.3.2 Automation. 9.3.3 Revolution in Consciousness! 9.3.4 Test Case for Collaboration. 9.4 Rapid Software Process Improvement. 9.4.1 Training Program. 9.4.2 Project Planning. 9.4.3 Project Tracking. 9.4.4 Software Quality. 9.4.5 Software Configuration. 9.4.6 People Discipline. Epilogue: Medley. Appendix I: Nammik. References.
£83.55
John Wiley & Sons Inc Doing Physics with Scientific Notebook
Book SynopsisThe goal of this book is to teach undergraduate students how to use Scientific Notebook (SNB) to solve physics problems. SNB software combines word processing and mathematics in standard notation with the power of symbolic computation. As its name implies, SNB can be used as a notebook in which students set up a math or science problem, write and solve equations, and analyze and discuss their results. Written by a physics teacher with over 20 years experience, this text includes topics that have educational value, fit within the typical physics curriculum, and show the benefits of using SNB. This easy-to-read text: Provides step-by-step instructions for using Scientific Notebook (SNB) to solve physics problems Features examples in almost every section to enhance the reader''s understanding of the relevant physics and to provide detailed instructions on using SNB Follows the traditional physics cuTable of ContentsPreface xv So we’re all on the same page... xvii What is science? xviii To the Student xix To the Teacher xx Contact Information xx Acknowledgments xxi 1 Introduction to SNB 1 Why SNB? 1 The Basics 2 Physics à la mode: Math or Text 8 Creating Mathematical Expressions 8 Evaluate and Evaluate Numerically 11 Scientific Notation 13 Substitution and Endpoint Evaluation 14 Solving Equations 17 Solve Exact 18 Solve Numeric 21 Systems of Equations 24 The Compute Menu 25 Simplify and Expand 25 Factor 26 Rewrite and Combine 28 Check Equality 29 Polynomials 31 Power Series 32 Definitions 35 Other Good Stuff 37 Computing In-place 37 Making Assumptions About Variables 37 Limits 40 A Few Words About Calculus 42 Units 46 Converting Units 47 User-Defined Units 51 Plotting 52 Plot 2D Rectangular 54 Other 2-Dimensional Plots 55 Plot 3D Rectangular 58 Cylindrical and Spherical Plots 60 Plotting Data 63 Fitting a Curve to Data 63 Differential Equations 67 Solve ODE Exact and Laplace 68 Solve ODE Numeric 70 Problems 75 2 One-Dimensional Kinematics 83 Constant Acceleration 83 Displacement and Position 83 Velocity and Acceleration 84 Equations of Motion 86 Signs of the Times 88 Free Fall 89 Varying Acceleration 91 Displacement, Velocity, and Acceleration 91 Equations of Motion 93 Gravity and Air Resistance 96 Resisting Air Resistance is Futile 97 Long-Distance Free Fall 99 Problems 102 3 Vectors 105 Components of a Vector 107 Magnitude and Direction 108 Adding Vectors 111 The Component Method 112 The SNB Method 113 The Graphing Method 115 Unit Vectors 119 Multiplying Vectors 120 Dot Product 121 Cross Product 122 Problems 125 4 Projectile Motion 127 No Air Resistance 127 Trajectory 132 Time of Flight 134 Maximum Height 135 Linear Air Resistance 137 Trajectory 141 Time of Flight and Range 143 Maximum Height 145 Turn Off the Air! 146 Turn Down the Air! 147 Quadratic Air Resistance 151 Height-Dependent Air Resistance 152 Problems 154 5 Newton’s Laws of Motion 157 Newton’s First Law 157 Newton’s Second Law for Constant Forces 158 Newton’s Second Law for Varying Forces 165 Time-Dependent Forces 165 Velocity-Dependent Forces 167 Position-Dependent Forces 170 Newton’s Third Law 173 Problems 175 6 Conservation Laws 179 Definitions 179 Conservation of Energy 181 Work 181 The Work-Energy Theorem 185 Potential Energy 186 Mechanical Energy is Conserved 188 A Complete Bookkeeping 191 Conservation of Momentum 193 Collisions in 1-Dimension 193 Collisions in 2-Dimensions 196 Rockets 199 Deep Space 199 Launch 202 Air Resistance 207 Varying Gravity and Air Resistance 213 Problems 216 7 Circular Motion 221 Uniform Circular Motion 222 The Rotating Umbrella 224 Rotational Kinematics 227 The Compact Disk 229 Newton’s Second Law and Circular Motion 233 Uniform Circular Motion and the 2nd Law 233 Non-Uniform Circular Motion and the 2nd Law 235 Sliding on a Sphere 236 Problems 248 8 Harmonic Motion 251 Simple Harmonic Motion, Simply 251 Energy and SHM 254 Not-Quite-as-Simple Harmonic Motion 255 Energy and SHM, Again 257 Damped Harmonic Motion 259 Underdamped (β2 < ω20) 259 Critically Damped (β2 = ω20) 261 Overdamped (β2 > ω20) 262 Driven Harmonic Motion 263 Constant Driving Force, no Damping 263 Sinusoidal Driving Force, no Damping 264 Constant Driving Force with Damping 265 Sinusoidal Driving Force with Damping 267 Small Oscillations 270 Not-so-Simple Harmonic Motion 272 Problems 275 9 Central Forces 279 Equations of Motion 279 Newtonian Gravitation 285 Kepler’s Laws 286 The Effective Potential 292 Two Special Forces 296 The 3-d Harmonic Oscillator 296 The Inverse-Square Force 299 Numerical Stuff 303 Problems 305 10 Fluids 309 Density and Pressure 309 Static Fluids 311 Buoyancy 312 Fluids in Motion 314 Bernoulli’s Equation 316 Applications of Bernoulli’s Equation 318 A More Realistic Approach 320 Flow in a Pipe 321 Stokes’ Law 330 Problems 331 11 Temperature and Heat 335 Temperature Scales 335 Absolute Temperature 337 Heat and Work 338 Heat Flow 339 Change in Temperature: Specific Heat 339 Change in State: Latent Heat 340 Calorimetry 341 Varying Specific Heat 344 The Specific Heat of Solids 345 Problems 353 12 Special Relativity 359 The Two Postulates 360 The Consequences 361 Time Dilation 363 Length Contraction 364 Addition of Velocities 365 Simultaneity 367 The Lorentz Transformation 367 Space-Time 370 Relativistic Momentum and Energy 375 Relativistic Collisions 378 Relativistic Dynamics 382 Four-Vectors 387 Problems 392 A Topics in Classical Physics 397 Newton’s Nose-Cone Problem 397 Simple Shapes 398 Frusta and Fudges 403 Newton’s Minimizer 409 Indented Tips and the Minimizer 411 The Shape of the Eiffel Tower 414 An Interesting Classical Orbit 417 Fisher’s Crystal 421 Problems 428 B Topics in Modern Physics 435 The Tale of the Traveling Triplets 435 Trip 1: Constance goes to Vega 435 Relativistic Interlude: Constant Acceleration 437 Trip 2: Axel goes to Vega 441 What happens on the way to Vega... 443 Orbits in General Relativity 445 Angular Momentum 447 Precessing Ellipses and Periodic Orbits 451 Be the Ball: Embedding Diagrams 456 Classical Lifetime of a Hydrogen Atom 460 Missed It By That Much 460 Can Special Relativity Save the Day? 462 Quantum Mechanical Bound States 465 Infinite Square Well (“Particle in a Box”) 467 Finite Square Well 470 V-shaped Linear Well 477 Problems 483 References and Suggested Reading 491 Index 495
£65.95
John Wiley & Sons Inc System Design for Telecommunication Gateways
Book SynopsisSystem Design for Telecommunication Gateways provides a thorough introduction to designing telecommunication network equipment based on the latest hardware designs and software methods available on the market.Trade Review"System Design for Telecommunication Gateways provides a thorough review of designing telecommunication network equipment based on the latest hardware designs and software methods available on the market." (Fixed Mobile Convergence, 15 March 2011)Table of ContentsAbbreviations. Abbreviations. 1. Introduction. 2. System View. 2.1 System Architecting. 2.2 Platform-based Approach. 2.3 System Verification. 3. Hardware Technologies and Platforms. 3.1 Different Form Factors. 3.2 Stacking chassis. 3.3 Cluster Computing. 3.4 Inter-blade Interconnect. 3.5 Hardware Solutions for Data, Control and Management Planes Processing. 4 Software Technologies and Platforms. 4.1 Basic Software Platform. 4.2 Expanded Software Platform. 4.3 Single-Threaded and Multi-X Software Designs. 4.4 Partitioning OS and Virtualization. Figures. Tables. References. Index.
£93.05
John Wiley & Sons Inc Introductory Programming with ObjectOriented C
Book SynopsisA gentle introductory programming book written specifically to teach readers to use objects for the very beginning, rather than starting with structured programming. Perfect for structure programmers that need to learn the object-oriented perspective. Covers the fundamentals of C++ and gives a firm grounding in the object-oriented paradigm. Begins with the systems development life cycle and demonstrates where the software development cycle fits within it.Table of ContentsSoftware Development: The Organizational Process. Software Development: The Programming Process. The Role of Binary. Introducing the Object-Oriented Paradigm. Anatomy of a C++ Program. Variables. Declaring Member Functions. Writing and Using Member Functions. Stream I/O. File I/O. Doing Arithmetic. Making Decisions. Repeating Actions. Introducing Arrays. Arrays of Objects. Strings. Pointers. Inheritance. Linked Lists. Overloading. Templates. Summing Up. Glossary. Index.
£150.26
John Wiley & Sons Inc Software Engineering
Book SynopsisPeters and Pedrycz have written the first comprehensive and complete text on a quantitative approach to Software Engineering. This book provides the reader with well-defined and carefully described software practices based on industry standards. It presents practical approaches to specifying, designing and testing software as well as the foundations of Software Engineering. Frameworks, methods and technologies in aid of the activities typically found in software projects, are thoroughly presented. This book includes a complete case study representing all of the major phases in software development.Emphasizing both the design and analysis of the technology, Peters and Pedrycz have created a highly balanced introduction to Software Engineering. This text provides students with a holistic look at software design by encouraging them to view the process as an interplay between hardware and software. The reader will also find the latest information in the field, frequent referencesTable of ContentsSOFTWARE ENGINEER'S WORKSHOP. Software Engineering Landscape. Software Processes. Requirements Engineering. Software Design: Architectures. SoftwareDesign: Validation and Risk Analysis. Design Elaboration. Design Elaboration: Mobile Computing. Software Verification. Software Measures. Software Cost Estimation. Software Reliability. Computational Intelligence in Software Engineering. READINGS. Index.
£206.96
