Computer science Books

Book SynopsisStrategy is the art of thinking about war before it occurs. Noting that space already plays a role in all of today’s wars, Space Strategy studies how conflicts are extending into this new domain. The book defines extra-atmospheric space and focuses on its varying features and constraints. By exploring the opportunities for action provided by different strategic positions, the book analyzes the most plausible combat scenarios from, against and within space. It explains the concepts of militarization, weaponization and martialization of space and shows how space systems constitute an essential component of information literacy – the key to power in the 21st Century. Space Strategy then demonstrates why our society, having become space-dependent, must take appropriate measures to develop its spatioresilience. Finally, the author summarizes his reflections in the form of a mnemonic listing twelve principles of space strategy. Completed by educational appendices and a glossary containing one thousand entries, Space Strategy meets the needs of students, researchers or any other reader curious about expanding their knowledge of strategy. Table of ContentsForeword ixGeneral Jean-Loup CHRÉTIEN Preface xiiiGeneral Jean-Paul PALOMÉROS Notice to Readers xv Acknowledgements xix Introduction xxv Chapter 1. Space Strategy: From Words to Actions 1 1.1. Geostrategy of space and space strategy 1 1.2. Principles and methods to the systemic analysis approach 6 1.3. Debris, laser and spaceplane 10 1.4. Conclusion 14 Chapter 2. Strategic Space: What Are the Limits? 17 2.1. Physical limits of outer space 17 2.2. Functional limits of space and outer space 26 2.3. Judicial limit of outer space 36 2.4. Conclusion 41 Chapter 3. How Can We Reach Space and Then Act Within It? 43 3.1. Piercing the gravitational opacity 43 3.1.1. How to reach space? 44 3.1.2. What are the trajectories followed by spatial vehicles? 47 3.1.3. How to navigate in space? 50 3.2. Utilizing physical and radioelectric radiation 52 3.3. Space positions worth occupying or controlling 57 3.4. Conclusion 72 Chapter 4. Space: What Are the Strategic Stakes? 73 4.1. Centripetal force of terrestrial strategic stakes 74 4.2. Centrifugal weakness of an autonomous strategic space factor 79 4.3. Space as strategic vector of information dominance 86 4.4. Conclusion 93 Chapter 5. Fighting Against Earth from Space? 97 5.1. Militarized space: global support 99 5.2. Weaponized space: celestial offensive 106 5.3. “Martialized” space: the alternative way 112 5.4. Conclusion 116 Chapter 6. Fighting Against Space from Earth? 121 6.1. Space situational awareness 123 6.2. Whoever controls the low ground controls the high ground 128 6.3. Space and nuclear: deterred deterrence? 134 6.4. Conclusion 139 Chapter 7. Combat within Space? 141 7.1. Small Earth space strategy 142 7.2. Strategic expansion of aerospace 155 7.3. The great lunar and Lagrangian strategy 161 7.4. Conclusion 172 Chapter 8. Twelve Principles of Space Strategy 175 8.1. The four “preliminary principles” of space strategy 176 8.1.1. Know what is happening in space 177 8.1.2. Elicit a sense of wonder turned toward the stars 180 8.1.3. Inform and train 182 8.1.4. Invest in the long term 185 8.2. The four “cardinal principles” of space strategy 188 8.2.1. Access space autonomously 189 8.2.2. Protect or attack the low ground to defend or defeat the high ground 193 8.2.3. Neutralize without destroying 198 8.2.4. Recreate the fog of war to one’s advantage 199 8.3. The four “complementary principles” of space strategy 202 8.3.1. Take advantage of the specificities of space 203 8.3.2. Promote and protect non-physical lines of communications 205 8.3.3. Develop space resilience 207 8.3.4. Contribute to the global strategy 211 8.4. Conclusion 214 Chapter 9. Moving Beyond Space Strategy 215 9.1. The four “i”s: indispensable, invisible, imaginary, inescapable 218 9.2. Space warrant to and part of mankind’s global commons. 225 9.3. Space: platform for irenology 229 9.4. Conclusion 232 Conclusion 235 Postface 241General Patrick de ROUSIERS Appendix 1. Physical Limits of Outer Space 243 Appendix 2. Kepler's Laws 269 Appendix 3. Space Laws 273 Appendix 4. Excerpt from the Report of the Legal Subcommittee of UN OOSA on Its Fifty-Fourth Session – Held in Vienna from April 13–27, 2015 277 Appendix 5. Detailed Description of “Two-Line Element (TLE)” Orbital Parameters 285 Appendix 6. “We Choose to Go to the Moon” 289 How to Use This Glossary 295 Glossary 301 Bibliography 453 Main Internet Sites 455 Index 459

Read more less

Book SynopsisSocial Learning Systems and Communities of Practice is a collection of classical and contemporary writing associated with learning and systemic change in contexts ranging from cities, to rural development to education to nursing to water management to public policy. It is likely to be of interest to anyone trying to understand how to think systemically and to act and interact effectively in situations experienced as complex, messy and changing. While mainly concerned with professional praxis, where theory and practice inform each other, there is much here that can apply at a personal level. This book offers conceptual tools and suggestions for new ways of being and acting in the world in relation to each other, that arise from both old and new understandings of communities, learning and systems. Starting with twentieth century insights into social learning, learning systems and appreciative systems from Donald Schön and Sir Geoffrey Vickers, the book goes on to consider the contemporary traditions of critical social learning systems and communities of practice, pioneered by Richard Bawden and Etienne Wenger and their colleagues. A synthesis of the ideas raised, written by the editor, concludes this reader. The theory and practice of social learning systems and communities of practice appear to have much to offer in influencing and managing systemic change for a better world.Trade ReviewFrom the reviews:“This collection of essays, starting with the work of Donald Schön and Geoffrey Vickers, and concluding with the work of Richard Bawden and Etienne Wenger among other contemporaries, is brought together by Chris Blackmore, senior lecturer in environmental and developmental systems at the Open University. It is appropriate for a seminar in communities of practice (CoP) or learning theory. … This is appropriate for a novice reader.” (Brad Reid, ACM Computing Reviews, March, 2011)Table of ContentsList of Figures.- Acknowledgements.- Introduction.- Part I Early Traditions of Social Learning Systems.- 1. Government as a Learning System.- 2. Insights into Appreciation and Learning Systems.- Part II Critical Social Learning Systems – The Hawkesbury Tradition.- 3. The Community Challenge: The Learning Response.- 4. Sustainability, Social Learning and the Democratic Imperative: Lessons from the Australian Landcare Movement.- 5. Traditions of Understanding: Language, Dialogue and Experience.- 6. Messy Issues, Worldviews and Systemic Competencies.- Part III Communities of Practice.- 7. Our World as a Learning System: A Communities-of-practice Approach.- 8. Conceptual Tools for CoPs as Social Learning Systems: Boundaries, Identity, Trajectories and Participation.- 9. Learning Nursing in the Workplace Community: The Generation of Professional Capital.- 10. Graduate Professional Education from a Community of Practice Perspective: The Role of Social and Technical Working.- 11. Communities of Practice and Social Learning Systems: The Career of a Concept.- Part IV Synthesis.- 12. Managing Systemic Change: What Future Roles for Social Learning Systems and Communities of Practice?.- Index

Read more less

Book SynopsisIC-SEC 2002 serves as a forum for engineers and scientists who are involved in the use of high performance computers, advanced numerical strategies, computational methods and simulation in various scientific and engineering disciplines. The conference creates a platform for presenting and discussing the latest trends and findings about the state of the art in their particular field(s) of interest. IC-SEC also provides a forum for the interdisciplinary blending of computational efforts in various diversified areas of science, such as biology, chemistry, physics and materials science, as well as all branches of engineering. The proceedings cover a broad range of topics and an application area which involves modelling and simulation work using high performance computers.Table of ContentsComputational Chemistry; Computational Fluid Dynamics; Computational Electromagnetics and Electronics; Computational Mechanics; Computational Science; Grid Computing; High End Computations; Micro-Electro-Mechanical Systems; Meshing.

Read more less

Book SynopsisThis book presents a selective collection of papers from the 20th International Symposium on Computer and Information Sciences, held in Istanbul, Turkey. The selected papers span a wide spectrum of topics in computer networks, including internet and multimedia, security and cryptography, wireless networks, parallel and distributed computing, and performance evaluation. These papers represent the results of the latest research of academicians from more than 30 countries.

Read more less

Book SynopsisOver 500 prokaryotic genomes have been sequenced to date, and thousands more have been planned for the next few years. While these genomic sequence data provide unprecedented opportunities for biologists to study the world of prokaryotes, they also raise extremely challenging issues such as how to decode the rich information encoded in these genomes. This comprehensive volume includes a collection of cohesively written chapters on prokaryotic genomes, their organization and evolution, the information they encode, and the computational approaches needed to derive such information. A comparative view of bacterial and archaeal genomes, and how information is encoded differently in them, is also presented. Combining theoretical discussions and computational techniques, the book serves as a valuable introductory textbook for graduate-level microbial genomics and informatics courses.Table of ContentsGeneral Characteristics of Prokaryotic Genomes and Replicons; Genes in Prokaryotic Genomes and Their Computational Prediction; Reconstruction of Genetic Code Evolution History and Applications; Dynamics of Prokaryotic Genome Evolution; Mobile Genetic Elements and Their Predictions; The Role of Gene Transfer in Microbial Evolution; Genome Reduction During Prokaryotic Evolution; Comparative Studies of Transcription and Regulation Signals in Bacteria and Archaea; Computational Techniques for Orthologous Gene Prediction in Prokaryotes; Computational Elucidation of Operons and Uber-Operons; Prediction of Regulons Through Comparative Genome Analyses; Prediction of Biological Pathways Through Data Mining and Information Fusion; Microbial Pathway Models; Metagenomics and Analysis.

Read more less

Book SynopsisThe pressure of working in the resource limited health service along with the requirement to maintain and develop a professional knowledge base leaves little time for staff to get seriously involved in related studies. Even students undertaking diploma and degree courses at university find little time to use computer based resources in spite of having them to hand. Just mention the word "computers" to some people and they mentally "switch off". Mental images of machines, "techno speak" and having to learn a whole new way of doing things do not tend to make their use very attractive. This practical book offers a way forward and will help the nurse to: Develop competence in using selected computer programs to find information relevant to professional clinical practice Avoid irrelevant depth of technical matter Make the best use of limited time resources whether it be at work, at home or in university-based study The reader will be introduced to computers at a basic level but with enough information to get started and to troubleshoot simple problems. Then you will be shown how to recognize and use applications (programs) useful to your professional practice. Finally you will be given a brief guide to some selected evidence based practice related web sites to start you off on your search.Table of Contents1. Assessment of The Computer. 2. Setting up a Computer System. 3 The healthy Computer, fit for Purpose and Function. 4. Word Processing. 5. The Internet and Internet Browser. 6. Information Searching Strategies Using The Internet browser. 7. Using Email for Networking. 8. Making Sense of Electronic information.

Read more less

Book SynopsisInformation and the technology that supports its collection, communication and analysis is a core concern of modern government, making e-government (meaning electronically enabled government) fundamental to the ongoing "reinvention" of public administration. But the quest for e-government opens up a range of issues - whether to take a "big bang" or an incremental approach to computerization, how to deal with security and privacy concerns, how to reconfigure the machinery of government to fit ICT practices - and decisions - hardware and software procurement, software architecture, access by whom to what. The spending of public money is always intriguing and perhaps money spent on ICT has been the most intriguing of all, with some spectacular failures costing millions. This book is written for a general audience and takes a critical look at policies, problems and prospects for e-government in a series of case studies. Why have ICT failures in the public sector occurred and what lessons do they provide for the future?Table of ContentsE-government and information system development; What is 'e-government'?; ICT in New Zealand's health sector: A story of lost opportunity; A major health care information system project failure; The INCIS fiasco in the New Zealand police force; Landonline: Qualified success or partial failure?; Lessons from computer development in the New Zealand public sector; Notes; References; Index.

Read more less

Book SynopsisThis anthology of essays from the inventor of literate programming is a survey of Donald Knuth's papers on computer science. Donald Knuth's influence in computer science ranges from the invention of literate programming to the development of the TeX programming language. One of the foremost figures in the field of mathematical sciences, his papers are widely referenced and stand as milestones of development over a wide range of topics. This collection focuses on Professor Knuth's published science papers that serve as accessible surveys of their subject matter. It includes articles on the history of computing, algorithms, numerical techniques, computational models, typesetting, and more. This book will be appreciated by students and researchers from a wide range of areas within computer science and mathematics.Trade Review'This book should be a necessary asset of any library dealing with Computer Science and related subjects, representing a major piece of culture in Computer Science. Every reader will acquire a sound understanding of the foundation for some key issues in the field ... Knuth is a grand scientific author, whose dissertations on deep and abstract issues are lively and captivating pieces of reading.' David Rozier, Mathematics Today'This book contains everything Knuth has written on computer science for the non-specialist ... It is a lovely read. What - in sum - can one say, of our delightful discipline and of this delightful book? Enjoy.' Adrian Larner, The Computer JournalTable of Contents1. Von Neumann's first computer program; 2. Ancient Babylonian algorithms; 3. George Forsythe and the development of computer science; 4. Computer science and its relation to mathematics; 5. Algorithms; 6. Mathematics and computer science: Coping with finiteness; 7. Algorithms in modern mathematics and computer science; 8. The IBM 650: an appreciation from the field; 9. Theory and practice; 10. Algorithm and program; information and data; 11. Are toy problems useful?; 12. Theory and practice; 13. Algorithmic themes; 14. Typesetting concrete mathematics; 15. Computer programming and computer science; 16. This week's citation classic: artistic programming.

Read more less

Book SynopsisThis book focuses on strengthening 3D visualization skills through sketching exercises. It does not make reference to any particular computer-aided design software package.

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less

Book SynopsisGet up to speed on Git right now with Pragmatic Guide to Git. Task-oriented two-page spreads get you up and running with minimal fuss. Each left-hand page dives into the underlying implementation for each task. The right-hand page contains commands that focus on the task at hand, and cross references to other tasks that are related. You'll find what you need fast. Git is rapidly becoming the de-facto standard for the open source community. Its excellent merging capabilities, coupled with its speed and relative ease of use, make it an indispensable tool for any developer. New Git users will learn the basic tasks needed to work with Git every day, including working with remote repositories, dealing with branches and tags, exploring the history, and fixing problems when things go wrong. If you're already familiar with Git, this book will be your go-to reference for Git commands and best practices. You won't find a more practical approach to learning Git than Pragmatic Guide to Git.

Read more less

Book Synopsis

Read more less

Book SynopsisTough technology and business challenges face you at every stage of a project. The one-page ingredients in 101 Design Ingredients show you how to solve problems using practical examples you can apply right away. Case studies explain how leading companies combined these ingredients into their own unique recipes to catapult their businesses, and how you can too. One page, one ingredient. 101 reasons to become more successful at solving those big technology problems. 101 Design Ingredients will help your technology team identify problems, share responsibilities, and work better together. In part 1, you'll see case studies of how companies such as Facebook and Dropbox blended ingredients from this book to create recipes to solve specific business requirements for investment, innovation, leadership, and more. Each recipe shows how the company fine-tuned six of the ingredients to build their own unique solution. You'll learn how to mix and match ingredients to create your own recipes for success, tailored to your company's needs. In part 2, you'll find 101 problem-solving ingredients grouped into project stages, to help you apply the right ingredient at the right time. Start at any point and page through the humorously illustrated ingredients until you find one that matches your needs best. The ingredients cover the spectrum your business needs to be successful, with tips on team-building, creating a business model, product launch, productivity, and much more. Each ingredient includes three practical suggestions to get you started right away. The ingredients and recipes in this book can be applied by beginners starting out on their first technology project, as well as seasoned professionals who have been tackling the same big problems for years and need a fresh new approach to problem solving.

Read more less

Book SynopsisThe Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.Table of Contents Preface 1. Introduction PART I: THEORY OF THE SPARSE FOURIER TRANSFORM 2. Preliminaries 3. Simple and Practical Algorithm 4. Optimizing Runtime Complexity 5. Optimizing Sample Complexity 6. Numerical Evaluation PART II: APPLICATIONS OF THE SPARSE FOURIER TRANSFORM 7. GHz-Wide Spectrum Sensing and Decoding 8. Faster GPS Synchronization 9. Light Field Reconstruction Using Continuous Fourier Sparsity 10. Fast In-Vivo MRS Acquisition with Artifact Suppression 11. Fast Multi-Dimensional NMR Acquisition and Processing 12. Conclusion

Read more less

Book SynopsisThe Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.Table of Contents Preface 1. Introduction PART I: THEORY OF THE SPARSE FOURIER TRANSFORM 2. Preliminaries 3. Simple and Practical Algorithm 4. Optimizing Runtime Complexity 5. Optimizing Sample Complexity 6. Numerical Evaluation PART II: APPLICATIONS OF THE SPARSE FOURIER TRANSFORM 7. GHz-Wide Spectrum Sensing and Decoding 8. Faster GPS Synchronization 9. Light Field Reconstruction Using Continuous Fourier Sparsity 10. Fast In-Vivo MRS Acquisition with Artifact Suppression 11. Fast Multi-Dimensional NMR Acquisition and Processing 12. Conclusion

Read more less

Book SynopsisThis book celebrates Michael Stonebraker's accomplishments that led to his 2014 ACM A.M. Turing Award "for fundamental contributions to the concepts and practices underlying modern database systems."The book describes, for the broad computing community, the unique nature, significance, and impact of Mike's achievements in advancing modern database systems over more than forty years. Today, data is considered the world's most valuable resource, whether it is in the tens of millions of databases used to manage the world's businesses and governments, in the billions of databases in our smartphones and watches, or residing elsewhere, as yet unmanaged, awaiting the elusive next generation of database systems. Every one of the millions or billions of databases includes features that are celebrated by the 2014 Turing Award and are described in this book.Why should I care about databases? What is a database? What is data management? What is a database management system (DBMS)? These are just some of the questions that this book answers, in describing the development of data management through the achievements of Mike Stonebraker and his over 200 collaborators. In reading the stories in this book, you will discover core data management concepts that were developed over the two greatest eras (so far) of data management technology.The book is a collection of 36 stories written by Mike and 38 of his collaborators: 23 world-leading database researchers, 11 world-class systems engineers, and 4 business partners. If you are an aspiring researcher, engineer, or entrepreneur you might read these stories to find these turning points as practice to tilt at your own computer-science windmills, to spur yourself to your next step of innovation and achievement.Table of Contents Data Management Technology Kairometer: The Historical Context Foreword Preface Introduction PART I 2014 ACM A.M. TURING AWARD PAPER AND LECTURE The Land Sharks Are on the Squawk Box PART II MIKE STONEBRAKER'S CAREER 1. Make it Happen: The Life of Michael Stonebraker PART III MIKE STONEBRAKER SPEAKS OUT: AN INTERVIEW WITH MARIANNE WINSLETT 2. Mike Stonebraker Speaks Out: An Interview PART IV THE BIG PICTURE 3. Leadership and Advocacy 4. Perspectives: The 2014 ACM Turing Award 5. Birth of an Industry: Path to the Turing Award 6. A Perspective of Mike from a 50-Year Vantage Point PART V STARTUPS 7. How to Start a Company in Five (Not So) Easy Steps 8. How to Create and Run a Stonebraker Startup-- The Real Story 9. Getting Grownups in the Room: A VC Perspective PART VI DATABASE SYSTEMS RESEARCH 10. Where Good Ideas Come From and How to Exploit Them 11. Where We Have Failed 12. Stonebraker and Open Source 13. The Relational Database Management Systems Genealogy PART VII CONTRIBUTIONS BY SYSTEM 14. Research Contributions of Mike Stonebraker: An Overview PART VII.A RESEARCH CONTRIBUTIONS BY SYSTEM 15. The Later Ingres Years 16. Looking Back at Postgres 17. Databases Meet the Stream Processing Era 18. C-Store: Through the Eyes of a Ph.D. Student 19. In-Memory, Horizontal, and Transactional: The H-Store OLTP DBMS Project 20. Scaling Mountains: SciDB and Scientific Data Management 21. Data Unification at Scale: Data Tamer 22. The BigDAWG Polystore System 23. Data Civilizer: End-to-End Support for Data Discovery, Integration, and Cleaning PART VII.B CONTRIBUTIONS FROM BUILDING SYSTEMS 24. The Commercial Ingres Codeline 25. The Postgres and Illustra Codelines 26. The Aurora/Borealis/SteamBase Codelines: A Tale of Three Systems 27. The Vertica Codeline 28. The VoltDB Codeline 29. The SciDB Codeline: Crossing the Chasm 30. The Tamr Codeline 31. The BigDAWG Codeline PART VIII PERSPECTIVES 32. IBM Relational Database Code Bases 33. Aurum: A Story about Research Taste 34. Nice: Or What It Was Like to Be Mike's Student 35. Michael Stonebraker: Competitor, Collaborator, Friend 36. The Changing of the Database Guard PART IX SEMINAL WORKS OF MICHAEL STONEBRAKER AND HIS COLLABORATORS OTLP Through the Looking Glass, and What We Found There ""One Size Fits All"": An Idea Whose Time Has Come and Gone The End of an Architectural Era (It's Time for a Complete Rewrite) C-Store: A Column-Oriented DBMS The Implementation of POSTGRES The Design and Implementation of INGRES The Collected Works of Michael Stonebraker References Index Biographies

Read more less

Book SynopsisThis book celebrates Michael Stonebraker's accomplishments that led to his 2014 ACM A.M. Turing Award "for fundamental contributions to the concepts and practices underlying modern database systems."The book describes, for the broad computing community, the unique nature, significance, and impact of Mike's achievements in advancing modern database systems over more than forty years. Today, data is considered the world's most valuable resource, whether it is in the tens of millions of databases used to manage the world's businesses and governments, in the billions of databases in our smartphones and watches, or residing elsewhere, as yet unmanaged, awaiting the elusive next generation of database systems. Every one of the millions or billions of databases includes features that are celebrated by the 2014 Turing Award and are described in this book.Why should I care about databases? What is a database? What is data management? What is a database management system (DBMS)? These are just some of the questions that this book answers, in describing the development of data management through the achievements of Mike Stonebraker and his over 200 collaborators. In reading the stories in this book, you will discover core data management concepts that were developed over the two greatest eras (so far) of data management technology.The book is a collection of 36 stories written by Mike and 38 of his collaborators: 23 world-leading database researchers, 11 world-class systems engineers, and 4 business partners. If you are an aspiring researcher, engineer, or entrepreneur you might read these stories to find these turning points as practice to tilt at your own computer-science windmills, to spur yourself to your next step of innovation and achievement.Table of Contents Data Management Technology Kairometer: The Historical Context Foreword Preface Introduction PART I 2014 ACM A.M. TURING AWARD PAPER AND LECTURE The Land Sharks Are on the Squawk Box PART II MIKE STONEBRAKER'S CAREER 1. Make it Happen: The Life of Michael Stonebraker PART III MIKE STONEBRAKER SPEAKS OUT: AN INTERVIEW WITH MARIANNE WINSLETT 2. Mike Stonebraker Speaks Out: An Interview PART IV THE BIG PICTURE 3. Leadership and Advocacy 4. Perspectives: The 2014 ACM Turing Award 5. Birth of an Industry: Path to the Turing Award 6. A Perspective of Mike from a 50-Year Vantage Point PART V STARTUPS 7. How to Start a Company in Five (Not So) Easy Steps 8. How to Create and Run a Stonebraker Startup-- The Real Story 9. Getting Grownups in the Room: A VC Perspective PART VI DATABASE SYSTEMS RESEARCH 10. Where Good Ideas Come From and How to Exploit Them 11. Where We Have Failed 12. Stonebraker and Open Source 13. The Relational Database Management Systems Genealogy PART VII CONTRIBUTIONS BY SYSTEM 14. Research Contributions of Mike Stonebraker: An Overview PART VII.A RESEARCH CONTRIBUTIONS BY SYSTEM 15. The Later Ingres Years 16. Looking Back at Postgres 17. Databases Meet the Stream Processing Era 18. C-Store: Through the Eyes of a Ph.D. Student 19. In-Memory, Horizontal, and Transactional: The H-Store OLTP DBMS Project 20. Scaling Mountains: SciDB and Scientific Data Management 21. Data Unification at Scale: Data Tamer 22. The BigDAWG Polystore System 23. Data Civilizer: End-to-End Support for Data Discovery, Integration, and Cleaning PART VII.B CONTRIBUTIONS FROM BUILDING SYSTEMS 24. The Commercial Ingres Codeline 25. The Postgres and Illustra Codelines 26. The Aurora/Borealis/SteamBase Codelines: A Tale of Three Systems 27. The Vertica Codeline 28. The VoltDB Codeline 29. The SciDB Codeline: Crossing the Chasm 30. The Tamr Codeline 31. The BigDAWG Codeline PART VIII PERSPECTIVES 32. IBM Relational Database Code Bases 33. Aurum: A Story about Research Taste 34. Nice: Or What It Was Like to Be Mike's Student 35. Michael Stonebraker: Competitor, Collaborator, Friend 36. The Changing of the Database Guard PART IX SEMINAL WORKS OF MICHAEL STONEBRAKER AND HIS COLLABORATORS OTLP Through the Looking Glass, and What We Found There ""One Size Fits All"": An Idea Whose Time Has Come and Gone The End of an Architectural Era (It's Time for a Complete Rewrite) C-Store: A Column-Oriented DBMS The Implementation of POSTGRES The Design and Implementation of INGRES The Collected Works of Michael Stonebraker References Index Biographies

Read more less

Book SynopsisNash equilibrium is the central solution concept in Game Theory.Since Nash's original paper in 1951, it has found countless applications in modeling strategic behavior of traders in markets, (human) drivers and (electronic) routers in congested networks, nations in nuclear disarmament negotiations, and more. A decade ago, the relevance of this solution concept was called into question by computer scientists, who proved (under appropriate complexity assumptions) that computing a Nash equilibrium is an intractable problem. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one? The remaining hope was that at least approximate Nash equilibria can be efficiently computed.Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. In this book, we provide strong evidence that even finding an approximate Nash equilibrium is intractable. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games.The problem of approximate Nash equilibrium in a two-player game poses a unique technical challenge: it is a member of the class PPAD, which captures the complexity of several fundamental total problems, i.e., problems that always have a solution; and it also admits a quasipolynomial time algorithm. Either property alone is believed to place this problem far below NP-hard problems in the complexity hierarchy; having both simultaneously places it just above P, at what can be called the frontier of intractability. Indeed, the tools we develop in this book to advance on this frontier are useful for proving hardness of approximation of several other important problems whose complexity lies between P and NP: Brouwer's fixed point, market equilibrium, CourseMatch (A-CEEI), densest k-subgraph, community detection, VC dimension and Littlestone dimension, and signaling in zero-sum games.Table of Contents Preface Part I: Overview The Frontier of Intractability Preliminaries Part II: Communication Complexity Communication Complexity of Approximate Nash Equilibrium Brouwer's Fixed Point Part III: PPAD PPAD-Hardness of Approximation The Generalized Circuit Problem Many-Player Games Bayesian Nash Equilibrium Market Equilibrium CourseMatch Part IV: Quasi-Polynomial Time Birthday Repetition Densest k-Subgraph Community Detection VC and Littlestone's Dimensions Signaling Part V: Approximate Nash Equilibrium2-Player Approximate Nash Equilibrium References Index Author Biography

Read more less

Book SynopsisNash equilibrium is the central solution concept in Game Theory.Since Nash's original paper in 1951, it has found countless applications in modeling strategic behavior of traders in markets, (human) drivers and (electronic) routers in congested networks, nations in nuclear disarmament negotiations, and more. A decade ago, the relevance of this solution concept was called into question by computer scientists, who proved (under appropriate complexity assumptions) that computing a Nash equilibrium is an intractable problem. And if centralized, specially designed algorithms cannot find Nash equilibria, why should we expect distributed, selfish agents to converge to one? The remaining hope was that at least approximate Nash equilibria can be efficiently computed.Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. In this book, we provide strong evidence that even finding an approximate Nash equilibrium is intractable. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games.The problem of approximate Nash equilibrium in a two-player game poses a unique technical challenge: it is a member of the class PPAD, which captures the complexity of several fundamental total problems, i.e., problems that always have a solution; and it also admits a quasipolynomial time algorithm. Either property alone is believed to place this problem far below NP-hard problems in the complexity hierarchy; having both simultaneously places it just above P, at what can be called the frontier of intractability. Indeed, the tools we develop in this book to advance on this frontier are useful for proving hardness of approximation of several other important problems whose complexity lies between P and NP: Brouwer's fixed point, market equilibrium, CourseMatch (A-CEEI), densest k-subgraph, community detection, VC dimension and Littlestone dimension, and signaling in zero-sum games.Table of Contents Preface Part I: Overview The Frontier of Intractability Preliminaries Part II: Communication Complexity Communication Complexity of Approximate Nash Equilibrium Brouwer's Fixed Point Part III: PPAD PPAD-Hardness of Approximation The Generalized Circuit Problem Many-Player Games Bayesian Nash Equilibrium Market Equilibrium CourseMatch Part IV: Quasi-Polynomial Time Birthday Repetition Densest k-Subgraph Community Detection VC and Littlestone's Dimensions Signaling Part V: Approximate Nash Equilibrium2-Player Approximate Nash Equilibrium References Index Author Biography

Read more less

Book SynopsisAgda is an advanced programming language based on Type Theory. Agda's type system is expressive enough to support full functional verification of programs, in two styles. In external verification, we write pure functional programs and then write proofs of properties about them. The proofs are separate external artifacts, typically using structural induction. In internal verification, we specify properties of programs through rich types for the programs themselves. This often necessitates including proofs inside code, to show the type checker that the specified properties hold. The power to prove properties of programs in these two styles is a profound addition to the practice of programming, giving programmers the power to guarantee the absence of bugs, and thus improve the quality of software more than previously possible.Verified Functional Programming in Agda is the first book to provide a systematic exposition of external and internal verification in Agda, suitable for undergraduate students of Computer Science. No familiarity with functional programming or computer-checked proofs is presupposed.The book begins with an introduction to functional programming through familiar examples like booleans, natural numbers, and lists, and techniques for external verification. Internal verification is considered through the examples of vectors, binary search trees, and Braun trees. More advanced material on type-level computation, explicit reasoning about termination, and normalization by evaluation is also included. The book also includes a medium-sized case study on Huffman encoding and decoding.

Read more less

Book SynopsisAgda is an advanced programming language based on Type Theory. Agda's type system is expressive enough to support full functional verification of programs, in two styles. In external verification, we write pure functional programs and then write proofs of properties about them. The proofs are separate external artifacts, typically using structural induction. In internal verification, we specify properties of programs through rich types for the programs themselves. This often necessitates including proofs inside code, to show the type checker that the specified properties hold. The power to prove properties of programs in these two styles is a profound addition to the practice of programming, giving programmers the power to guarantee the absence of bugs, and thus improve the quality of software more than previously possible.Verified Functional Programming in Agda is the first book to provide a systematic exposition of external and internal verification in Agda, suitable for undergraduate students of Computer Science. No familiarity with functional programming or computer-checked proofs is presupposed.The book begins with an introduction to functional programming through familiar examples like booleans, natural numbers, and lists, and techniques for external verification. Internal verification is considered through the examples of vectors, binary search trees, and Braun trees. More advanced material on type-level computation, explicit reasoning about termination, and normalization by evaluation is also included. The book also includes a medium-sized case study on Huffman encoding and decoding.

Read more less

Book SynopsisAda’s Legacy illustrates the depth and diversity of writers, thinkers, and makers who have been inspired by Ada Lovelace, the English mathematician and writer. The volume, which commemorates the bicentennial of Ada’s birth in December 1815, celebrates Lovelace’s many achievements as well as the impact of her life and work, which reverberated widely since the late nineteenth century. In the 21st century we have seen a resurgence in Lovelace scholarship, thanks to the growth of interdisciplinary thinking and the expanding influence of women in science, technology, engineering and mathematics. Ada’s Legacy is a unique contribution to this scholarship, thanks to its combination of papers on Ada’s collaboration with Charles Babbage, Ada’s position in the Victorian and Steampunk literary genres, Ada’s representation in and inspiration of contemporary art and comics, and Ada’s continued relevance in discussions around gender and technology in the digital age.With the 200th anniversary of Ada Lovelace’s birth on December 10, 2015, we believe that the timing is perfect to publish this collection of papers. Because of its broad focus on subjects that reach far beyond the life and work of Ada herself, Ada’s Legacy will appeal to readers who are curious about Ada’s enduring importance in computing and the wider world.Table of Contents Introduction Part 1: Ada's Legacy in Computing Charles Babbage, Ada Lovelace, and the Bernoulli Numbers Sketch of the Analytical Engine invented by Charles Babbage, Esq. Ada: Past, Present, Future The Ada Programming Language The Rise, Fall, and Persistence of Ada Part 2: Ada's Legacy in Literature "I shall in due time be a poet": Ada Lovelace's Poetical Science in its Literary Context "A Different Sort of Bird": Ada Lovelace in History and Steampunk Ada Bright and Dark: Steampunk Representations of the Enchantress of Numbers Part 3: Ada's Legacy in the Digital Age Oracle: The Engine Weaves "Genderless" Online Discourse in the 1970s: Muted Group Theory in Early Social Computing Rebooting the Ada Lovelace Mythos

Read more less