Computer science Books

Book SynopsisDEEP LEARNING TOOLS for PREDICTING STOCK MARKET MOVEMENTS The book provides a comprehensive overview of current research and developments in the field of deep learning models for stock market forecasting in the developed and developing worlds. The book delves into the realm of deep learning and embraces the challenges, opportunities, and transformation of stock market analysis. Deep learning helps foresee market trends with increased accuracy. With advancements in deep learning, new opportunities in styles, tools, and techniques evolve and embrace data-driven insights with theories and practical applications. Learn about designing, training, and applying predictive models with rigorous attention to detail. This book offers critical thinking skills and the cultivation of discerning approaches to market analysis. The book: details the development of an ensemble model for stock market prediction, combining long short-term memory and autoregressive integrate

Read more less

Book SynopsisProvides the knowledge and insights necessary to contribute to the Information Systems decision-making process Managing & Using Information Systems: A Strategic Approach delivers a solid knowledgebase of basic concepts to help MBA students and general business managers alike become informed, competent participants in Information Systems (IS) decisions. Now in its eighth edition, this fully up-to-date textbook explains the fundamental principles and practices required to use and manage information while illustrating how information systems can create or obstruct opportunities and even propel digital transformations within a wide range of organizations. Drawing from their expertise in both academia and industry, the authors discuss the business and design processes relevant to IS while presenting a basic framework that connects business strategy, IS strategy, and organizational strategy. Step by step, readers are guided through each essential aspect of InformationTable of ContentsPreface v Acknowledgments ix About the Authors xi Introduction 1 The Case for Participating in Decisions about Information Systems 3 What If a Manager Doesn’t Participate? 6 Skills Needed to Participate Effectively in Information Technology Decisions 7 Basic Assumptions 8 Summary 13 Key Terms 14 Foundational Readings 14 1 The Information Systems Strategy Triangle 15 Brief Overview of Business Strategy Frameworks 19 Why Are Strategic Advantage Models Essential to Planning for Information Systems? 25 Brief Overview of Organizational Strategies 25 Brief Overview of Information Systems Strategy 26 Summary 27 Key Terms 28 Foundational Readings 29 Discussion Questions 29 Case Study 1-1 Judo Bank: Business Strategy 30 Case Study 1-2 Amazon in 2023 31 2 Strategic Use of Information Resources 33 Evolution of Information Resources 35 Information Resources as Strategic Tools 37 How Can Information Resources Be Used Strategically? 38 Sustaining Competitive Advantage with Information Resources 44 Risks 48 External Relationships 50 Co- creating IT and Business Strategy 51 Summary 51 Key Terms 52 Foundational Readings 52 Discussion Questions 53 Case Study 2-1 Instacart: Gaining Strategic Advantage During a Pandemic 54 Case Study 2-2 Amazon Go: How Far Can It Go? 55 3 Organizational Strategy and Information Systems 57 Information Systems and Organizational Design 59 Information Systems and Management Control Systems 65 Information Systems and Culture 69 Summary 73 Key Terms 73 Foundational Readings 74 Discussion Questions 74 Case Study 3-1 [24]7.ai 75 Case Study 3-2 Uber’s Use of Algorithmic Management 76 4 Information Technology and the Design of Work 78 Work Design Framework 80 What Types of Work Are Impacted by Information Technology 81 Where and When Work Is Done and Who Does It 88 The Future of Work 94 Summary 98 Key Terms 98 Foundational Reading 98 Discussion Questions 99 Case Study 4-1 Conducting Bank Examinations Remotely 100 Case Study 4-2 Automation at Southern Glazer’s Wine and Spirits LLC 101 5 Information Systems and Digital Transformation 103 Functional Perspective Versus Business Process Perspective 105 Building Agile and Dynamic Business Processes 108 Gaining Acceptance for IT- Induced Change to Work 111 Digital Transformation 113 Techniques for Understanding Business Processes 114 Types of Enterprise Systems 115 Enterprise System Issues 120 Summary 123 Key Terms 124 Foundational Readings 124 Discussion Questions 125 Case Study 5-1 Gnosis Freight: Post- COVID Digital Transformation 126 Case Study 5-2 Carestream Health 127 6 Architecture and Infrastructure 129 From Vision to Implementation 131 The Leap from Strategy to Architecture to Infrastructure 133 Multi- Homing, Virtualization, and Cloud Computing 142 Other Managerial Considerations 144 Summary 148 Key Terms 148 Foundational Readings 149 Discussion Questions 149 Case Study 6-1 Enterprise Architecture at Chubb Industries 150 Case Study 6-2 Mohawk Paper 151 7 Cybersecurity 153 NIST Cybersecurity Framework 154 IT Security Governance Framework 156 Cyberattacks and How They Occurred 158 The Impossibility of 100% Security 162 What Should Management Do? 164 How Do We Measure How Secure We Are? 169 Resiliency or Protection? 171 Summary 171 Key Terms 172 Discussion Questions 172 Case Study 7-1 City of Baltimore 173 Case Study 7-2 Airline Industry Frequent Flyer Info Data Breach 174 8 The Business of Information Technology 175 Organizing to Respond to Business: A Maturity Model 177 Understanding the IT Organization 178 What a Manager Can Expect from the IT Organization 178 What the IT Organization Does Not Do 180 Chief Information Officer 180 Building a Business Case 182 IT Portfolio Management 184 Valuing IT Investments 185 Monitoring IT Investments 187 Funding IT Resources 192 How Much Does IT Cost? 194 Summary 197 Key Terms 198 Discussion Questions 198 Case Study 8-1 Blockchain Adoption Barriers in the Healthcare Industry in Iran 200 Case Study 8-2 Air France/KLM Airlines 201 9 Information Technology Governance 203 IT Governance 204 Centralized versus Decentralized Organizational Structures 205 Decision Rights and Governance 207 Governance Frameworks for Financial Control Decisions 210 Platform Governance 212 Summary 216 Key Terms 216 Foundational Reading 217 Discussion Questions 217 Case Study 9-1 Governance to Keep Deutsche Bahn on Track 218 Case Study 9-2 The “MyJohnDeere” Platform 218 10 Information Technology Sourcing 220 Sourcing Decision Cycle Framework 221 Outsourcing in the Broader Context 233 Summary 235 Key Terms 235 Foundational Readings 235 Discussion Questions 236 Case Study 10-1 Delta: Landing in the Cloud 237 Case Study 10-2 O2 and RPA 238 11 Managing IT Projects 240 What Defines a Project? 242 What Is Project Management? 243 Project Elements 245 IT Projects 248 IT Project Development Methodologies and Approaches 249 Managing IT Project Risk 255 Gauging Success 259 Summary 260 Key Terms 261 Foundational Readings 261 Discussion Questions 261 Case Study 11-1 Digital Transformation of Insurance Claim Management 263 Case Study 11-2 A Tale of Two Scrum Projects at Dutch Railways (Nederlandse Spoorwegen) 265 12 Business Intelligence, Artificial Intelligence, Knowledge Management, and Analytics 268 Knowledge Management 269 Business Analytics and Business Intelligence 275 Competing with Business Analytics 276 Components of Business Analytics 277 Big Data and the Internet of Things 282 Artificial Intelligence, Machine Learning, and Deep Learning 285 Summary 287 Key Terms 288 Foundational Readings 288 Discussion Questions 289 Case Study 12-1 Netflix: Analytics Now, AI Later? 290 Case Study 12-2 Nest and the Internet of Things (IoT) 291 13 Privacy, Ethical, and Societal Considerations for Information Management 292 What Is Expected of Management? 293 Responsible Computing 294 Corporate Social Responsibility 296 PAPA: Privacy, Accuracy, Property, and Accessibility 300 AI, Business, and Society 307 Green Computing 309 Summary 310 Key Terms 311 Foundational Reading 311 Discussion Questions 311 Case Study 13-1 A TikTok Challenge To TikTok Itself 312 Case Study 13-2 Ethical Decision Making 314 Glossary G- 1 Index I- 1

Read more less

Book SynopsisCYBERNETICAL INTELLIGENCE Highly comprehensive, detailed, and up-to-date overview of artificial intelligence and cybernetics, with practical examples and supplementary learning resources Cybernetical Intelligence: Engineering Cybernetics with Machine Intelligence is a comprehensive guide to the field of cybernetics and neural networks, as well as the mathematical foundations of these technologies. The book provides a detailed explanation of various types of neural networks, including feedforward networks, recurrent neural networks, and convolutional neural networks as well as their applications to different real-world problems. This groundbreaking book presents a pioneering exploration of machine learning within the framework of cybernetics. It marks a significant milestone in the field's history, as it is the first book to describe the development of machine learning from a cybernetics perspective. The introduction of the concept of Cybernetical Intellige

Read more less

Book SynopsisA comprehensive overview for directors aiming to meet their cybersecurity responsibilities In Cyber Guardians: Empowering Board Members for Effective Cybersecurity, veteran cybersecurity advisor Bart McDonough delivers a comprehensive and hands-on roadmap to effective cybersecurity oversight for directors and board members at organizations of all sizes. The author includes real-world case studies, examples, frameworks, and blueprints that address relevant cybersecurity risks, including the industrialized ransomware attacks so commonly found in today's headlines. In the book, you'll explore the modern cybersecurity landscape, legal and regulatory requirements, risk management and assessment techniques, and the specific role played by board members in developing and promoting a culture of cybersecurity. You'll also find: Examples of cases in which board members failed to adhere to regulatory and legal requirements to notify the victims of data breaches aboTable of ContentsPreface: What to Expect from This Book xv Chapter 1 Introduction 1 Summary of a Board’s Incident Response 5 Checklist for a Board’s Incident Response 8 Chapter 2 Cybersecurity Basics 11 CIA Framework 13 Key Cybersecurity Concepts and Terminology for Board Members 19 Threats and Risks 19 Vulnerabilities and Exploits 20 Malware 21 Social Engineering 22 Encryption and Data Protection 23 Authentication and Access Control 24 Common Cyber Threats and Risks Faced by Companies 26 Phishing 26 Malware 27 Ransomware 28 Business Email Compromise 29 Insider Threats 30 Third-Party Risk 31 Mistakes/Errors 32 Emerging Threats 33 Advanced Persistent Threats 34 Supply Chain Attacks 35 Data Destruction 36 Zero-Day Exploits 37 Internet of Things Attacks 38 Cloud Security 39 Mobile Device Security 40 Key Technologies and Defense Strategies 42 Firewall Technology 42 Intrusion Detection/Prevention Systems 43 Encryption 44 Multifactor Authentication 45 Virtual Private Network 46 Antivirus and Anti-malware Software 47 Endpoint Detection and Response 48 Patch Management 49 Cloud Technology 49 Identity and Access Management 50 Mobile Device Management 51 Data Backup and Recovery 52 Zero-Trust Architecture 54 Micro-segmentation 55 Secure Access Service Edge 56 Containerization 56 Artificial Intelligence and Machine Learning 57 Blockchain 59 Quantum Computing 61 Threat Intelligence 64 What Is Threat Intelligence? 65 How Can Threat Intelligence Help Organizations? 65 What Should Board Members Know About Threat Intelligence? 66 Threat Actors 67 External Threat Actors 68 State-Sponsored Attackers 68 Hacktivists 70 Cybercriminals 70 Competitors 72 Terrorists 72 Internal Actors 73 Employees 73 Contractors 75 Third-Party Vendors 76 Motivations of Threat Actors 77 Financial Gain 77 Political and Strategic Objectives 78 Ideological Beliefs 79 Personal Motivations 80 Tactics, Techniques, and Procedures 81 Examples of TTPs Used by Different Threat Actors 81 MITRE ATT&CK Framework 83 Chapter 2 Summary 85 Chapter 3 Legal and Regulatory Landscape 87 Overview of Relevant Cybersecurity Regulations and Laws 90 Federal Regulations in the United States 90 The Federal Trade Commission Act 90 The Gramm-Leach-Bliley Act 92 The Health Insurance Portability and Accountability Act 94 State Regulations in the United States 97 Data Breach Notification Laws 97 California Consumer Privacy Act 99 European Union Regulations 101 General Data Protection Regulation 101 Network and Information Security Directive 102 ePrivacy Directive 104 Industry Standards 105 Payment Card Industry Data Security Standard 105 National Institute of Standards and Technology 107 Securities Exchange Commission 108 2011 Cybersecurity Disclosure Guidance 108 2018 Cybersecurity Disclosure Guidance 108 2023 Proposal for New Cybersecurity Requirements 109 Discussion of Compliance Requirements and Industry Standards 112 Compliance Requirements 112 Sarbanes-Oxley Act 112 New York State Department of Financial Services Cybersecurity Regulation 114 Industry Standards 117 Center for Internet Security Controls 117 International Organization for Standardization 27001 118 Individual Director Liability 120 Chapter 3 Summary 124 Chapter 4 Board Oversight of Cybersecurity 127 The Board’s Role in Overseeing Cybersecurity Strategy 129 Legal Responsibilities 130 Developing an Effective Cybersecurity Governance Framework 131 Best Practices for Board Engagement and Reporting 133 Regular Reporting 133 Use of Metrics 134 Executive Briefings 136 Cybersecurity Drills 137 Independent Assessments 138 Overcoming Objections to Effective Cybersecurity Oversight 139 Promoting a Cybersecurity Culture 141 Chapter 4 Summary 143 Chapter 5 Board Oversight of Cybersecurity: Ensuring Effective Governance 145 The Role of the Board in Overseeing Cybersecurity 147 Developing an Effective Cybersecurity Governance Framework 150 Conduct a Cybersecurity Risk Assessment 150 Implement a Threat Intelligence Program 150 Develop a Risk Management Framework 150 Prioritize High-Impact Risks 151 Regularly Review and Update Risk Management Strategies 151 Strategies for Identifying, Assessing, and Prioritizing Cyber Risks 152 Conducting Cybersecurity Risk Assessments 154 How to Develop and Promote a Culture of Cybersecurity 156 Chapter 5 Summary 158 Chapter 6 Incident Response and Business Continuity Planning 161 Implementing Cybersecurity Policies and Procedures 164 Incident Response and Business Continuity Planning 165 Incident Response Plan 166 Business Continuity Planning 166 Incident Response Planning 167 Defining the Types of Assessments 170 Penetration Testing 170 Vulnerability Scanning 171 Security Risk Assessments 173 Threat Modeling 174 Social Engineering Assessments 175 Compliance Assessments 176 Red Team/Blue Team Exercise 177 Chapter 6 Summary 178 Chapter 7 Vendor Management and Third-Party Risk 181 The Importance of Third-Party Risk Management for Board Members 183 Best Practices for Managing Third-Party Cyber Risk 184 Legal and Regulatory Considerations in Third-Party Risk Management 185 Sample Questions to ask Third-Party Vendors 187 Chapter 7 Summary 189 Chapter 8 Cybersecurity Training and Awareness 191 Importance of Cybersecurity Awareness for All Employees 193 Strategies for Providing Effective Training and Awareness Programs 195 More Detail on Effective Training Strategies 198 Chapter 8 Summary 200 Chapter 9 Cyber Insurance 201 Understanding Cyber Insurance 202 What Is Cyber Insurance? 202 Why Is Cyber Insurance Important? 203 Evolution of Cyber Insurance 204 The Role of the Board in Cyber Insurance 204 Key Components of Cyber Insurance 205 Types of Coverage 205 Policy Limits and Deductibles 206 Exclusions 207 Retroactive Dates 207 Policy Periods 208 Cyber Risk Assessments 208 Evaluating and Purchasing Cyber Insurance 209 Assessing the Organization’s Risk Profile 209 Determining the Appropriate Level of Coverage 210 Selecting an Insurer 211 Negotiating Terms and Conditions 211 Implementing the Policy 212 Managing and Reviewing the Cyber Insurance Policy 213 Filing a Claim 213 Managing a Claim Dispute 214 Reviewing and Renewing the Policy 214 Chapter 9 Summary 215 Chapter 10 Conclusion: Moving Forward with Cybersecurity Governance 219 The Board’s Role in Cybersecurity Governance 222 Key Takeaways and Action Items for Board Members 225 Chapter 10 Summary 226 Appendix A Checklist of Key Considerations for Board Members 229 Appendix B Sample Questions 231 Appendix C Sample Board Meeting Agenda 233 Appendix D List of Key Vendors 235 Appendix E Cybersecurity Resources 237 Appendix F Cybersecurity Books 239 Appendix G Cybersecurity Podcasts 241 Appendix H Cybersecurity Websites and Blogs 243 Appendix I Tabletop Exercise: Cybersecurity Incident Response 245 Appendix J Articles 249 About the Author 253 Acknowledgments 255 Index 257

Read more less

Book SynopsisThis book containing 33 chapters provides an insightful look at creative approaches toward the accelerated development of computing and multidisciplinary IT solutions for society. Technology is advancing on all fronts and is opening new and innovative adaptations to our modern world every single day causing huge shifts in practices and patterns. These new technologies allow us opportunities to gain insights into the discoveries of creative and innovative approaches. The book covers emerging next-generation computing research, developments of computing, and multidisciplinary ICT solutions in seven themes: The first theme concerns the emerging research into next-generation computing like cloud computing, cyber security, and gaming; The second theme pertains to information technology in the textile industry; The third theme zeroes in on the adoption of ICT for digitalization, artificial intelligence, and machine learning; The fourth theme ad

Read more less

Book Synopsis'Architects and other designers inhabit a curious borderland between the virtual and the physical. They have always been concerned with conjuring up things that don't exist but might, imagining them in detail, and eventually finding ways to translate these visions into physical reality.Trade Review"For the knowledgeable reader in ICT research it is a must to confirm where technology is now and moreover to see where it is going in the future." Building EngineerTable of ContentsNote on editors page vii List of contributors viii Note on Think Lab xii Acknowledgements xiii Foreword – Virtual worlds, virtual prototypes, and design xivWilliam J. Mitchell Introduction – Virtually there. . . ? xxiPeter Brandon PART 1 DESIGN, ENGINEERING AND MANUFACTURING CHALLENGES 1 1 Emerging paradigms and models in digital design – Performance-based architectural design 3Rivka Oxman 2 Algorithmic design optimization 21Manfred Grohmann and Oliver Tessmann 3 VR or PR: Virtual or physical reality? 35Anthony Thorpe, Richard A. Buswell, Rupert C. Soar and Alistair G. F. Gibb 4 Digital affordances: Emerging knowledge and cognition in design 47Tuba Kocatürk PART 2 CHALLENGES FOR IMPLEMENTATION: FROM VIRTUAL THROUGH TO CONSTRUCTION 57 5 One Island East, Hong Kong: A case study in construction virtual prototyping 59Martin Riese 6 The virtual building: A designer’s perspective 72Martin Simpson PART 3 CHALLENGES FOR VISUALIZATION AND SIMULATION 87 7 Planning and scheduling in a virtual prototyping environment 89Andrew Baldwin, C. W. Kong, T. Huang, H. L. Guo, K. D. Wong and Heng Li 8 Reshaping the life cycle process with virtual design and construction methods 104Martin Fischer 9 Virtual prototyping from need to pre-construction 113Robin Drogemuller 10 The need for creativity enhancing design tools 131Souheil Soubra PART 4 CHALLENGES FOR INFORMATION AND KNOWLEDGE MODELLING 145 11 Context-aware virtual prototyping 147Chimay J. Anumba and Zeeshan Aziz 12 nD modelling, present and future 158Ghassan Aouad, Song Wu and Angela Lee 13 Interoperable knowledge: Achievements and future challenges 171Yacine Rezgui and Simona Barresi 14 Knowledge management systems in the future 192Matthew Bacon PART 5 OTHER CHALLENGES: AGENT TECHNOLOGIES, SECURITY, REGULATIONS AND MANAGEMENT CONTROL 211 15 Future agent-driven virtual prototyping environments in construction 213Joseph H. M. Tah 16 The nature of virtuality and the need for enhanced security in the virtual world 230Grahame S. Cooper 17 The future of virtual construction and regulation checking 241Nicholas Nisbet, Jeffrey Wix and David Conover 18 Virtual prototyping of financial flows as a form of management control 251Richard J. Boland, Jr, Fred Collopy, Julia Grant and Lin Zhao PART 6 VISIONS, ROADMAPS AND FUTURE SCENARIOS 259 19 VR – Roadmap: A vision for 2030 in the built environment 261Nashwan Dawood, R. Marasini and John Dean 20 Future collaborative workspaces for the construction industry 278Terrence Fernando 21 The future organization: Sustainable competitiveness through virtual prototyping 290Mustafa Alshawi Index 305

Read more less

Book SynopsisThe design of cryptographic systems must be based on firm foundations, whereas ad hoc approaches and heuristics are a very dangerous way to go. These foundations were developed in works -authored by Shafi Goldwasser and/or Silvio Micali. This book celebrates these works, and reproduces some of them.Table of Contents Preface Acknowledgments Photo and Text Credits PART I BIOGRAPHIES, INTERVIEWS, AND AWARD LECTURES A Story Behind Every Problem: A Brief Biography of Shafi Goldwasser One Obsession at a Time: A Brief Biography of Silvio Micali An Interview with Shafi Goldwasser An Interview with Silvio Micali The Cryptographic Lens: Shafi Goldwasser's Turing Lecture Proofs, According to Silvio: Silvio Micali's Turing Lecture PART II ORIGINAL PAPERS Probabilistic Encryption The Knowledge Complexity of Interactive Proof Systems How to Generate Cryptographically Strong Sequences of Pseudorandom Bits How to Construct Random Functions A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems How to Play Any Mental Game: A Completeness Theorem for Protocols with Honest Majority Non-Interactive Zero-Knowledge (NIZK) Proof Systems Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions PART III PERSPECTIVES On the Foundations of Cryptography On the Impact of Cryptography on Complexity Theory On Some Noncryptographic Works of Goldwasser and Micali Fundamentals of Fully Homomorphic Encryption Interactive Proofs for Lattice Problems Following a Tangent of Proofs A Tutorial on Concurrent Zero-Knowledge Doubly Efficient Interactive Proofs Computational Entropy A Survey of Leakage-Resilient Cryptography Editor and Author Biographies

Read more less

Book SynopsisThe design of cryptographic systems must be based on firm foundations, whereas ad hoc approaches and heuristics are a very dangerous way to go. These foundations were developed in works -authored by Shafi Goldwasser and/or Silvio Micali. This book celebrates these works, and reproduces some of them.Table of Contents Preface Acknowledgments Photo and Text Credits PART I BIOGRAPHIES, INTERVIEWS, AND AWARD LECTURES A Story Behind Every Problem: A Brief Biography of Shafi Goldwasser One Obsession at a Time: A Brief Biography of Silvio Micali An Interview with Shafi Goldwasser An Interview with Silvio Micali The Cryptographic Lens: Shafi Goldwasser's Turing Lecture Proofs, According to Silvio: Silvio Micali's Turing Lecture PART II ORIGINAL PAPERS Probabilistic Encryption The Knowledge Complexity of Interactive Proof Systems How to Generate Cryptographically Strong Sequences of Pseudorandom Bits How to Construct Random Functions A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems How to Play Any Mental Game: A Completeness Theorem for Protocols with Honest Majority Non-Interactive Zero-Knowledge (NIZK) Proof Systems Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions PART III PERSPECTIVES On the Foundations of Cryptography On the Impact of Cryptography on Complexity Theory On Some Noncryptographic Works of Goldwasser and Micali Fundamentals of Fully Homomorphic Encryption Interactive Proofs for Lattice Problems Following a Tangent of Proofs A Tutorial on Concurrent Zero-Knowledge Doubly Efficient Interactive Proofs Computational Entropy A Survey of Leakage-Resilient Cryptography Editor and Author Biographies

Read more less

Book SynopsisOffers a celebration of Leslie Lamport’s work on concurrency, interwoven in four-and-a-half decades of an evolving industry: from the introduction of the first personal computer to an era when parallel and distributed multiprocessors are abundant.Table of Contents Preface Photo and Text Credits Introduction The Computer Science of Concurrency: The Early Years PART I TECHNICAL PERSPECTIVES ON LAMPORT'S WORK Shared Memory and the Bakery Algorithm The Notions of Time and Global State in a Distributed System Byzantine Faults State Machine Replication with Benign Failures Formal Specification and Verification Biography PART II SELECTED PAPERS A New Solution of Dijkstra's Concurrent Programming Problem Time, Clocks, and the Ordering of Events in a Distributed System How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs The Byzantine Generals Problem The Mutual Exclusion Problem: Part I—A Theory of Interprocess Communication The Mutual Exclusion Problem: Part II—Statement and Solutions The Part-Time Parliament References Index Biographies

Read more less

Book SynopsisDrawing upon new and existing oral histories, extensive use of National Science Foundation (NSF) documents, and the experience of two of the authors as senior managers, this book describes how NSF’s programmatic activities originated and evolved to become the primary source of funding for research in computing and information technologies.Table of Contents Preface PART I CHRONOLOGICAL HISTORY 1950-1974: Science Information, Computing Facilities, Education, and Basic Research 1974-1986: CER, CSNET, NSFNET, and the Founding of CISE 1986-1998: The New Directorate in a Period of Computer Science Expansion 1999-2006: Broadening Computer Science with New Initiatives 2007-2016: The Growing Centrality of CISE to NSF PART II SELECTED SUBJECT STUDIES Pre-CISE Computing Facilities and Education Programs Pre-CISE Computing Research Information Technology Research Networking Research and Deployment NSF Support of High-Performance Computation CISE's Role in Broadening Participation in Computing What Does an AD/CISE Do? PART III SUMMARY AND CONCLUSIONSSummary and Conclusions APPENDIXESComputing Organizations at NSF

Read more less

Book SynopsisBuilding on concepts from the history of science and technology, this volume examines such areas as fundamentals, operating systems, programming languages, programming environments, networking, and databases. Topics are covered from their earliest beginnings to their modern variants.

Read more less

Book SynopsisBuilding on concepts from the history of science and technology, this volume examines such areas as fundamentals, operating systems, programming languages, programming environments, networking, and databases. Topics are covered from their earliest beginnings to their modern variants.

Read more less

Book SynopsisOffers an overview of the state-of-the-art and emerging themes in affective computing, including a comprehensive review of the existing approaches to affective computing systems and social signal processing. The book provides in-depth case studies of applied affective computing in various domains, such as social robotics and mental well-being.

Read more less

Book SynopsisOffers an overview of the state-of-the-art and emerging themes in affective computing, including a comprehensive review of the existing approaches to affective computing systems and social signal processing. The book provides in-depth case studies of applied affective computing in various domains, such as social robotics and mental well-being.

Read more less

Book SynopsisTells the story of the entrepreneurs who were able to harness the energy of computer science researchers supported by governments and universities, and the tremendous commercial demand for Internetworking computers. The centerpiece of this history comes from unpublished interviews from the late 1980s with over 80 computing industry pioneers.Table of Contents Prelude to Change: Data Communications, 1949–1968 Onset of Competition: Data Communications, 1968–1972 Packet Switching and ARPANET: Networking, 1959–1972 Market Order: Data Communications, 1973–1979 Protocol Confusion: Networking, 1972–1979 Emergence of Local Area Networks: Networking, 1976–1981 The Chaos of Competition: Networking, 1981–1982 The Need for Standards: Networking, 1975–1984 Market Order: Networking, 1983–1986 Adaptation of Wide Area Networks: Data Communications, 1979–1986 Market Consolidation: Data Communications and Networking, 1986–1988 Government Support for Internetworking, 1983–1988 The Emergence of Internetworking, 1985–1988 Conclusions

Read more less

Table of ContentsContributing Authors. Preface. Part I: Introduction to Logic-Based Artificial Intelligence. 1. Introduction to Logic-Based Artificial Intelligence; J. Minker. Part II: Commonsense Reasoning. 2. Concepts of Logical AI; J. McCarthy. Part III: Knowledge Representation. 3. Two Approaches to Efficient Open-World Reasoning; G. De Giacomo, H. Levesque. 4. Declarative Problem-Solving in DLV; T. Eder, et al. Part IV: Nonmonotonic Reasoning. 5. The Role of Default Logic in Knowledge Representation; J.P. Delgrande, Torsten Schaub. 6. Approximations, stable operators, well-founded fixpoints, applications in nonmonotonic reasoning; M. Denecker, et al. Part V: Logic for Causation, Actions. 7. Getting to the Airport: The Oldest Planning Problem in AI; V. Lifschitz, et al. Part VI: Planning, Problem Solving. 8. Encoding Domain Knowledge for Propositional Planning; H. Kautz, B. Selman. 9. Functional Strips; H. Geffner. Part VII: Logic, Planning, High Level Robotics. 10. Planning with Natural Actions in the Situation Calculus; F. Pirri, R. Reiter. 11. Reinventing Shakey; M. Shanahan. Part VIII: Logic for Agents, Actions. 12. Reasoning Agents in Dynamic Domains; C. Baral, M. Gelfond. 13. Dynamic Logic for Reasoning about Actions, Agents; J.-J.Ch. Meyer. Part IX: Inductive Reasoning. 14. Logic-Based Machine Learning; S. Muggleton, F. Marginean. Part X: Possibilistic Logic. 15. Decision, Nonmonotonic Reasoning, Possibilistic Logic; S. Benferhat, etal. Part Xl: Logic, Beliefs. 16. The Role(s) of Belief in AI; D. Perlis. 17. Modeling the Beliefs of Other Agents; R.H. Thomason. Part XII: Logic, Language. 18. The Situations We Talk about; L.K. Schuberi. Part XIII: Computational Logic. 19. Linear Time Datalog, Branching.Time Logic; G. Goitlob, et al. 20. On the Expressive Power of Planning Formalisms; B. Nebel. Part XIV: Knowledge Base System Implementations. 21. Extending the Smodels System with Cardinality, Weight Constraints; I. Niemelä, P. Simons. 22. Nonmonotonic Reasoning in LDL++; H. Wang, C. Zaniolo. Part XV: Applications of Theorem Proving, Logic Programming. 23. Towards a Mechanically Checked Theory of Computation; J. Strother Moore. 24. Logic-Based Techniques in Data Integration; A.Y. Levy. Index.

Read more less

Book SynopsisTrade Review“The author has a deep background in modern databases from both industry and academic aspects. Many fundamental research papers in related fields are used in this book. … In general, a book this good is not often seen. It will greatly benefit people from both industry and academia who study next-generation databases in this modern, big data era.” (Feng Yu, Computing Reviews, computingreviews.com, June, 2016)Table of ContentsPart I: The Database Revolution1. Three Database Revolutions2. Google, Big Data, and Hadoop3. Sharding, Amazon, and the Birth of NoSQL4. Document Databases5. Graph Databases6. Columnar Databases7. SSD and In-Memory TechnologiesPart II: The New Architectures8. Distribution and Clustering Models9. Consistency Models10. Data Models11. Data Models and Storage12. Access Methods and APIsPart III: Afterword13. Where to Next?Part IV: AppendixesA. Next Generation Database Survey

Read more less

Book SynopsisPart I: Overview.- Chapter 1: Introduction.- Chapter 2: What Is Zero Trust?.- Chapter 3: Zero Trust Architectures.- Chapter 4: Zero Trust in Practice.- Part II: Zero Trust and Enterprise Architecture Components.- Chapter 5: Identity and Access Management.- Chapter 6: Network Infrastructure.- Chapter 7: Network Access Control.- Chapter 8: Intrusion Detection and Prevention Systems.- Chapter 9: Virtual Private Networks.- Chapter 10: Next-Generation Firewalls.- Chapter 11: Security Operations.- Chapter 12: Privileged Access Management.- Chapter 13: Data Protection.- Chapter 14: Infrastructure and Platform as a Service.- Chapter 15: Software as a Service.- Chapter 16: IoT Devices and Things.- Part III: Putting It All Together.- Chapter 17: A Zero Trust Policy Model.- Chapter 18: Zero Trust Scenarios.- Chapter 19: Making Zero Trust Successful.- Chapter 20: Conclusion.- Chapter 21: Afterword.- Appendix A: Further Reading.-Table of Contents

Read more less

Book SynopsisLearn the fundamentals of the Java 17 LTS or Java Standard Edition version 17 Long Term Support release, including basic programming concepts and the object-oriented fundamentals necessary at all levels of Java development.Table of Contents1. Programming Concepts 2. Setting Up the Environment 3. Writing Java Programs 4. Data Types 5. Operators 6. Statements 7. Classes and Objects 8. Methods 9. Constructors 10. Modules11. Object and Objects Classes 12. Wrapper Classes 13. Execution Handling 14. Assertions 15. Strings 16. Dates and Times 17. Formatting Data 18. Regular Expressions 19. Arrays 20. Inheritance 21. Interfaces 22. Enum Types 23. Java Shell Appendix A: Character Encodings Appendix B: Documentation Comments

Read more less

Book SynopsisExpand your knowledge of Java with this entertaining learning guide, which features 100+ exercises and programming challenges. Java Challenges will prepare you for your next exam or job interview, and covers many practical topics, such as strings, arrays, data structures, recursion, and date and time. The APIs and other material included in this book are Java 17 compatible. Each topic is addressed in its own separate chapter, starting with an introduction to the basics and followed by multiple exercises of varying degrees of difficulty, helping you to improve your programming skills effectively. Detailed sample solutions, including the algorithms used for all tasks, are included to maximize your understanding of each area.Author Michael Inden also describes alternative solutions and analyzes possible pitfalls and typical errors. Three appendices round out the book: one covering JShell, which is often helpful for trying out the code snippets and examples in the book, followed by an inTable of Contents1 Introduction ................................................ 11.1 Structure of the chapters ...................................... 11.2 Basic structure of the Eclipse project ............................ 31.3 Basic framework for unit tests .................................. 41.4 Note on programming style .................................... 51.5 Trying out the examples and solutions........................... 9I Fundamentals 112 Mathematical problems ...................................... 132.1 Introduction.................................................. 132.1.1 Roman numerals....................................... 172.1.2 Number Games ........................................ 182.2 Exercises ................................................... 212.2.1 Exercise 1: Basic Arithmetic (★✩✩✩✩) ................... 212.2.2 Exercise 2: Number as text (★★✩✩✩) .................... 222.2.3 Exercise 3: Perfect numbers (★★✩✩✩) ................... 222.2.4 Exercise 4: Prime Numbers (★★✩✩✩) ................... 232.2.5 Exercise 5: Prime number pairs (★★✩✩✩) ................ 232.2.6 Exercise 6: Checksum (★★✩✩✩) ........................ 232.2.7 Exercise 7: Roman numbers (★★★★✩) .................. 242.2.8 Exercise 8: Combinatorics (★★✩✩✩) .................... 242.2.9 Exercise 9: Armstrong Numbers (★★✩✩✩) ............... 252.2.10 Exercise 10: Max Change Calculator (★★★★✩) ........... 252.2.11 Exercise 11: Related Numbers (★★✩✩✩)................. 262.2.12 Exercise 12: Prime factorization (★★★✩✩)................ 262.3 Solutions .................................................... 272.3.1 Solution 1: Basic Arithmetic (★✩✩✩✩) ................... 272.3.2 Solution 2: Number as text (★★✩✩✩) .................... 302.3.3 Solution 3: Perfect numbers (★★✩✩✩) ................... 322.3.4 Solution 4: Prime Numbers (★★✩✩✩) .................... 342.3.5 Solution 5: Prime number pairs (★★✩✩✩) ................ 36vi Inhaltsverzeichnis2.3.6 Solution 6: Checksum (★★✩✩✩) ........................ 402.3.7 Solution 7: Roman numbers (★★★★✩) ................... 412.3.8 Solution 8: Combinatorics (★★✩✩✩) ..................... 462.3.9 Solution 9: Armstrong Numbers (★★✩✩✩) ................ 492.3.10 Solution 10: Max Change Calculator (★★★★✩) ............ 522.3.11 Solution 11: Related Numbers (★★✩✩✩) ................. 542.3.12 Solution 12: Prime factorization (★★★✩✩) ................ 553 Recursion .................................................. 593.1 Introduction.................................................. 593.1.1 Mathematical examples ................................. 593.1.2 Algorithmic examples ................................... 633.1.3 Steps when multiplying the digits of a number.............. 673.1.4 Typical problems ....................................... 683.2 Exercises ................................................... 713.2.1 Exercise 1: Fibonacci (★★✩✩✩) ......................... 713.2.2 Exercise 2: Process digits (★★✩✩✩) ..................... 713.2.3 Exercise 3: GCD (★★✩✩✩) ............................. 723.2.4 Exercise 4: Reverse String (★★✩✩✩) .................... 733.2.5 Exercise 5: Array Sum (★★✩✩✩) ........................ 733.2.6 Exercise 6: Array Min (★★✩✩✩) ......................... 733.2.7 Exercise 7: Conversions (★★✩✩✩) ...................... 743.2.8 Exercise 8: Exponential Function (★★✩✩✩)............... 753.2.9 Exercise 9: Pascal’s triangle (★★✩✩✩) ................... 763.2.10 Exercise 10: Number palindromes (★★★★✩).............. 763.2.11 Exercise 11: Permutations (★★★✩✩) .................... 773.2.12 Exercise 12: Count Substrings (★★✩✩✩) ................. 773.2.13 Exercise 13: Ruler (★★✩✩✩) ........................... 783.3 Solutions .................................................... 793.3.1 Solution 1: Fibonacci (★★✩✩✩) ......................... 793.3.2 Solution 2: Process digits (★★✩✩✩) ..................... 813.3.3 Solution 3: GCD (★★✩✩✩) ............................. 823.3.4 Solution 4: Reverse String (★★✩✩✩) .................... 853.3.5 Solution 5: Array Sum (★★✩✩✩) ........................ 863.3.6 Solution 6: Array Min (★★✩✩✩) ......................... 873.3.7 Solution 7: Conversions (★★✩✩✩)....................... 883.3.8 Solution 8: Exponential Function (★★✩✩✩) ............... 923.3.9 Solution 9: Pascal’s triangle (★★✩✩✩) ................... 953.3.10 Solution 10: Number palindromes (★★★★✩) .............. 983.3.11 Solution 11: Permutations (★★★✩✩) ..................... 1013.3.12 Solution 12: Count Substrings (★★✩✩✩) ................. 1043.3.13 Solution 13: Ruler (★★✩✩✩) ............................ 108Inhaltsverzeichnis vii4 Strings ..................................................... 1114.1 Introduction.................................................. 1114.1.1 The class String ..................................... 1124.1.2 The classes StringBuffer and StringBuilder ........ 1134.1.3 Class Character ..................................... 1144.1.4 Examples related to Character and String ............. 1154.2 Exercises ................................................... 1184.2.1 Exercise 1: Number conversions (★★✩✩✩) ............... 1184.2.2 Exercise 2: Joiner (★✩✩✩✩) ............................ 1184.2.3 Exercise 3: Reverse String (★★✩✩✩) .................... 1194.2.4 Exercise 4: Palindrome (★★★✩✩) ....................... 1194.2.5 Exercise 5: No Duplicate Chars (★★★✩✩) ................ 1204.2.6 Exercise 6: Remove Duplicate Letters (★★★✩✩) .......... 1204.2.7 Exercise 7: Capitalize (★★✩✩✩) ........................ 1214.2.8 Exercise 8: Rotation (★★✩✩✩) .......................... 1224.2.9 Exercise 9: Well formed braces (★★✩✩✩) ................ 1224.2.10 Exercise 10: Anagram (★★✩✩✩) ........................ 1234.2.11 Exercise 11: Morse Code (★★✩✩✩) ..................... 1234.2.12 Exercise 12: Pattern Checker (★★★✩✩) .................. 1244.2.13 Exercise 13: Tennis score (★★★✩✩) ..................... 1244.2.14 Exercise 14: Version numbers (★★✩✩✩) ................. 1254.2.15 Exercise 15: Conversion strToLong (★★✩✩✩) ........... 1254.2.16 Exercise 16: Print Tower (★★★✩✩) ...................... 1264.3 Solutions .................................................... 1274.3.1 Solution 1: Number conversions (★★✩✩✩) ............... 1274.3.2 Solution 2: Joiner (★✩✩✩✩) ............................ 1304.3.3 Solution 3: Reverse String (★★✩✩✩) .................... 1324.3.4 Solution 4: Palindrome (★★★✩✩)........................ 1344.3.5 Solution 5: No Duplicate Chars (★★★✩✩) ................ 1374.3.6 Solution 6: Remove Duplicate Letters (★★★✩✩) ........... 1384.3.7 Solution 7: Capitalize (★★✩✩✩) ......................... 1404.3.8 Solution 8: Rotation (★★✩✩✩) .......................... 1444.3.9 Solution 9: Well formed braces (★★✩✩✩) ................ 1454.3.10 Solution 10: Anagram (★★✩✩✩) ........................ 1474.3.11 Solution 11: Morse Code (★★✩✩✩)...................... 1484.3.12 Solution 12: Pattern Checker (★★★✩✩) .................. 1504.3.13 Solution 13: Tennis score (★★★✩✩) ..................... 1524.3.14 Solution 14: Version numbers (★★✩✩✩).................. 1564.3.15 Solution 15: Conversion strToLong (★★✩✩✩) ........... 1584.3.16 Solution 16: Print Tower (★★★✩✩)....................... 161viii Inhaltsverzeichnis5 Arrays ...................................................... 1655.1 Introduction.................................................. 1655.1.1 One-dimensional arrays ................................. 1665.1.2 Multidimensional arrays ................................. 1765.1.3 Typical errors .......................................... 1835.2 Exercises ................................................... 1845.2.1 Exercise 1: Even before odd numbers (★★✩✩✩) .......... 1845.2.2 Exercise 2: Flip (★★✩✩✩) .............................. 1845.2.3 Exercise 3: Palindrome (★★✩✩✩) ....................... 1845.2.4 Exercise 4: Inplace Rotate (★★★✩✩) .................... 1855.2.5 Exercise 5: Jewels Board Init (★★★✩✩) .................. 1855.2.6 Exercise 6: Jewels Board Erase Diamonds (★★★★✩) ...... 1875.2.7 Exercise 7: Spiral Traversal (★★★★✩) .................... 1885.2.8 Exercise 8: Add One to Array As Number (★★✩✩✩) ....... 1885.2.9 Exercise 9: Sudoku Checker (★★★✩✩)................... 1895.2.10 Exercise 10: Flood-Fill (★★✩✩✩) ........................ 1905.2.11 Exercise 11: Array Merge (★★✩✩✩) ..................... 1915.2.12 Exercise 12: Array Min and Max (★★✩✩✩) ............... 1915.2.13 Exercise 13: Array Split (★★★✩✩) ....................... 1925.2.14 Exercise 14: Minesweeper Board (★★★✩✩) .............. 1935.3 Solutions .................................................... 1955.3.1 Solution 1: Even before odd numbers (★★✩✩✩) ........... 1955.3.2 Solution 2: Flip (★★✩✩✩) .............................. 1995.3.3 Solution 3: Palindrome (★★✩✩✩)........................ 2035.3.4 Solution 4: Inplace Rotate (★★★✩✩) ..................... 2055.3.5 Solution 5: Jewels Board Init (★★★✩✩) .................. 2095.3.6 Solution 6: Jewels Board Erase Diamonds (★★★★✩) ...... 2165.3.7 Solution 7: Spiral Traversal (★★★★✩) .................... 2255.3.8 Solution 8: Add One to Array As Number (★★✩✩✩) ........ 2305.3.9 Solution 9: Sudoku Checker (★★★✩✩) ................... 2325.3.10 Solution 10: Flood-Fill (★★✩✩✩) ........................ 2385.3.11 Solution 11: Array Merge (★★✩✩✩)...................... 2425.3.12 Solution 12: Array Min and Max (★★✩✩✩) ................ 2465.3.13 Solution 13: Array Split (★★★✩✩) ....................... 2495.3.14 Solution 14: Minesweeper Board (★★★✩✩) ............... 254Inhaltsverzeichnis ix6 Date processing ............................................ 2616.1 Introduction.................................................. 2616.1.1 The enumerations DayOfWeek and Month ................ 2616.1.2 The classes LocalDate, LocalTime and LocalDateTime 2626.1.3 The class ZonedDateTime ............................. 2646.1.4 The class ZoneId ..................................... 2656.1.5 Class Duration....................................... 2666.1.6 The class Period ..................................... 2676.1.7 Date arithmetic ........................................ 2686.1.8 Formatting and parsing ................................. 2706.2 Exercises ................................................... 2726.2.1 Exercise 1: Leap Years (★✩✩✩✩) ....................... 2726.2.2 Exercise 2: Basic knowledge Date-API (★★✩✩✩).......... 2726.2.3 Exercise 3: Length of Month (★★✩✩✩) ................... 2736.2.4 Exercise 4: Time Zones (★★✩✩✩) ....................... 2736.2.5 Exercise 5: Time Zone Calculation (★★✩✩✩) ............. 2736.2.6 Exercise 6: Calculations with LocalDate ................. 2746.2.7 Exercise 7: Calendar output (★★★✩✩) ................... 2746.2.8 Exercise 8: Weekdays (★✩✩✩✩) ........................ 2756.2.9 Exercise 9: Sundays and leap years (★★✩✩✩) ............ 2766.2.10 Exercise 10: TemporalAdjuster (★★★✩✩)................. 2766.2.11 Exercise 11: NthWeekdayAdjuster (★★★✩✩) ............. 2776.2.12 Exercise 12: Payday-TemporalAdjuster (★★★✩✩) ......... 2776.2.13 Exercise 13: Formatting and Parsing (★★✩✩✩) ........... 2786.2.14 Exercise 14: Fault Tolerant Parsing (★★✩✩✩) ............. 2786.3 Solutions .................................................... 2796.3.1 Solution 1: Leap Years (★✩✩✩✩) ........................ 2796.3.2 Solution 2: Basic knowledge Date-API (★★✩✩✩) .......... 2806.3.3 Solution 3: Length of Month (★★✩✩✩) ................... 2816.3.4 Solution 4: Time Zones (★★✩✩✩) ....................... 2826.3.5 Solution 5: Time Zone Calculation (★★✩✩✩).............. 2836.3.6 Solution 6: Calculations with LocalDate ................. 2846.3.7 Solution 7: Calendar output (★★★✩✩) ................... 2866.3.8 Solution 8: Weekdays (★✩✩✩✩) ........................ 2896.3.9 Solution 9: Sundays and leap years (★★✩✩✩) ............ 2926.3.10 Solution 10: TemporalAdjuster (★★★✩✩) ................. 2946.3.11 Solution 11: NthWeekdayAdjuster (★★★✩✩) .............. 2956.3.12 Solution 12: Payday-TemporalAdjuster (★★★✩✩) .......... 2976.3.13 Solution 13: Formatting and Parsing (★★✩✩✩) ............ 3016.3.14 Solution 14: Fault Tolerant Parsing (★★✩✩✩) ............. 302x Inhaltsverzeichnis7 Basic data structures: lists, sets, and maps ................... 3057.1 Introduction.................................................. 3057.1.1 The interface Collection.............................. 3057.1.2 Lists and the interface List ......................... 3067.1.3 Sets and the interface Set .............................. 3077.1.4 Key-value mappings and the interface map ................ 3077.1.5 The stack as LIFO data structure ......................... 3087.1.6 The queue as FIFO data structure........................ 3097.2 Exercises ................................................... 3117.2.1 Exercise 1: Set operations (★★✩✩✩) .................... 3117.2.2 Exercise 2: List Reverse (★★✩✩✩) ...................... 3117.2.3 Exercise 3: Remove Duplicates (★★✩✩✩) ................ 3127.2.4 Exercise 4: Maximum Profit (★★★✩✩) ................... 3127.2.5 Exercise 5: Longest sequence (★★★✩✩) ................. 3137.2.6 Exercise 6: Own stack (★★✩✩✩) ........................ 3137.2.7 Exercise 7: Well-formed braces (★★✩✩✩) ................ 3137.2.8 Exercise 8: Check Magic Triangle (★★★✩✩) .............. 3147.2.9 Exercise 9: Pascal’s triangle (★★★✩✩) ................... 3147.2.10 Exercise 10: Most Frequent Elements (★★✩✩✩) .......... 3157.2.11 Exercise 11: Addition of digits (★★★✩✩) ................. 3157.2.12 Exercise 12: Compound Key (★★✩✩✩) .................. 3167.2.13 Exercise 13: List Merge (★★✩✩✩) ....................... 3167.2.14 Exercise 14: Excel Magic Select (★★✩✩✩) ............... 3177.3 Solutions .................................................... 3187.3.1 Solution 1: Set operations (★★✩✩✩) ..................... 3187.3.2 Solution 2: List Reverse (★★✩✩✩)....................... 3237.3.3 Solution 3: Remove Duplicates (★★✩✩✩) ................ 3267.3.4 Solution 4: Maximum Profit (★★★✩✩) .................... 3277.3.5 Solution 5: Longest sequence (★★★✩✩) ................. 3307.3.6 Solution 6: Own stack (★★✩✩✩) ........................ 3337.3.7 Solution 7: Well-formed braces (★★✩✩✩) ................ 3357.3.8 Solution 8: Check Magic Triangle (★★★✩✩)............... 3407.3.9 Solution 9: Pascal’s triangle (★★★✩✩) ................... 3447.3.10 Solution 10: Most Frequent Elements (★★✩✩✩) ........... 3467.3.11 Solution 11: Addition of digits (★★★✩✩) .................. 3487.3.12 Solution 12: Compound Key (★★✩✩✩) ................... 3527.3.13 Solution 13: List Merge (★★✩✩✩) ....................... 3547.3.14 Solution 14: Excel Magic Select (★★✩✩✩)................ 356Inhaltsverzeichnis xiII More advanced and tricky topics 3618 Advanced recursion ......................................... 3638.1 Memoization ................................................. 3638.1.1 Memoization for Fibonacci numbers ...................... 3638.1.2 Memoization for Pascal’s triangle ......................... 3658.2 Backtracking ................................................. 3688.2.1 n-queens problem ...................................... 3688.3 Exercises ................................................... 3728.3.1 Exercise 1: Towers of Hanoi (★★★✩✩) ................... 3728.3.2 Exercise 2: Edit Distance (★★★★✩) ..................... 3738.3.3 Exercise 3: Longest Common Subsequence (★★★✩✩) ..... 3738.3.4 Exercise 4: Way out of labyrinth (★★★✩✩) ................ 3748.3.5 Exercise 5: Sudoku Solver (★★★★✩) .................... 3758.3.6 Exercise 6: Math Operator Checker (★★★★✩) ............ 3768.3.7 Exercise 7: Water Bucket Problem (★★★✩✩) ............. 3778.3.8 Exercise 8: All palindrome substrings (★★★★✩) ........... 3788.3.9 Exercise 9: n-queens problem (★★★✩✩) ................. 3788.4 Solutions .................................................... 3798.4.1 Solution 1: Towers of Hanoi (★★★✩✩) ................... 3798.4.2 Solution 2: Edit Distance (★★★★✩) ...................... 3858.4.3 Solution 3: Longest Common Subsequence (★★★✩✩) ..... 3918.4.4 Solution 4: Way out of labyrinth (★★★✩✩) ................ 3948.4.5 Solution 5: Sudoku Solver (★★★★✩) ..................... 3978.4.6 Solution 6: Math Operator Checker (★★★★✩) ............. 4058.4.7 Solution 7: Water Bucket Problem (★★★✩✩) .............. 4108.4.8 Solution 8: All palindrome substrings (★★★★✩) ........... 4138.4.9 Solution 9: n-queens problem (★★★✩✩).................. 4179 Binary trees ................................................ 4259.1 Introduction.................................................. 4259.1.1 Structure, terminology and examples of use ............... 4259.1.2 Binary trees ........................................... 4269.1.3 Binary trees with order: binary search trees ............... 4279.1.4 Traversals ............................................. 4299.1.5 Balanced trees and other properties ...................... 4329.1.6 Trees for the examples and exercises ..................... 4349.2 Exercises ................................................... 4369.2.1 Exercise 1: Tree Traversal (★★✩✩✩) ..................... 4369.2.2 Exercise 2: In-, Pre- und Postorder iterative (★★★★✩)...... 4369.2.3 Exercise 3: Tree Height (★★✩✩✩) ....................... 4369.2.4 Exercise 4: Lowest Common Ancestor (★★★✩✩) .......... 4379.2.5 Exercise 5: Breadth-First (★★★✩✩) ...................... 437xii Inhaltsverzeichnis9.2.6 Exercise 6: Level Sum (★★★★✩) ........................ 4389.2.7 Exercise 7: Tree Rotate (★★★✩✩) ....................... 4389.2.8 Exercise 8: Reconstruction (★★★✩✩) .................... 4399.2.9 Exercise 9: Math Evaluation (★★✩✩✩) ................... 4399.2.10 Exercsie 10: Symmetry (★★✩✩✩) ....................... 4409.2.11 Exercise 11: Check Binary Search Tree (★★✩✩✩) ......... 4419.2.12 Exercise 12: Completeness (★★★★★) ................... 4419.2.13 Exercise 13: Tree Printer (★★★★★) ...................... 4439.3 Solutions .................................................... 4469.3.1 Solution 1: Tree Traversal (★★✩✩✩) ..................... 4469.3.2 Solution 2: In-, Pre- und Postorder iterative (★★★★✩) ...... 4489.3.3 Solution 3: Tree Height (★★✩✩✩) ....................... 4569.3.4 Solution 4: Lowest Common Ancestor (★★★✩✩) .......... 4579.3.5 Solution 5: Breadth-First (★★★✩✩) ...................... 4619.3.6 Solution 6: Level Sum (★★★★✩) ........................ 4639.3.7 Solution 7: Tree Rotate (★★★✩✩) ....................... 4679.3.8 Solution 8: Reconstruction (★★★✩✩) .................... 4709.3.9 Solution 9: Math Evaluation (★★✩✩✩) ................... 4769.3.10 Solution 10: Symmetry (★★✩✩✩) ....................... 4779.3.11 Solution 11: Check Binary Search Tree (★★✩✩✩) ......... 4819.3.12 Solution 12: Completeness (★★★★★) .................... 4839.3.13 Solution 13: Tree Printer (★★★★★) ...................... 49310 Searching and sorting ....................................... 50310.1 Introduction Search ........................................... 50310.1.1 Searching in Collections and Arrays ...................... 50310.1.2 Binary search with binarySearch() .................... 50510.2 Introduction Sort ............................................. 50610.2.1 Insertion Sort .......................................... 50610.2.2 Selection Sort ......................................... 50810.2.3 Merge Sort ............................................ 51010.2.4 Quick Sort ............................................ 51110.2.5 Bucket Sort ........................................... 51410.2.6 Final Thoughts ........................................ 51510.3 Exercises ................................................... 51610.3.1 Exercise 1: Contains All (★★✩✩✩)....................... 51610.3.2 Exercise 2: Partitioning (★★★✩✩) ....................... 51610.3.3 Exercise 3: Binary Search (★★✩✩✩)..................... 51710.3.4 Exercise 4: Insertion Sort (★★✩✩✩) ..................... 51710.3.5 Exercise 5: Selection Sort (★★✩✩✩) ..................... 51810.3.6 Exercise 6: Quick Sort (★★★✩✩) ........................ 51810.3.7 Exercise 7: Bucket Sort (★★✩✩✩) ....................... 51910.3.8 Exercise 8: Search in rotated data (★★★★✩).............. 519Inhaltsverzeichnis xiii10.4 Solutions .................................................... 52110.4.1 Solution 1: Contains All (★★✩✩✩) ....................... 52110.4.2 Solution 2: Partitioning (★★★✩✩) ........................ 52210.4.3 Solution 3: Binary Search (★★✩✩✩) ..................... 52410.4.4 Solution 4: Insertion Sort (★★✩✩✩)...................... 52810.4.5 Solution 5: Selection Sort (★★✩✩✩) ..................... 52910.4.6 Solution 6: Quick Sort (★★★✩✩) ........................ 53010.4.7 Solution 7: Bucket Sort (★★✩✩✩) ....................... 53210.4.8 Solution 8: Search in rotated data (★★★★✩) .............. 53411 Conclusion and supplementary literature ..................... 54111.1 Conclusion .................................................. 54111.1.1 Lessons learned per chapter ............................ 54111.1.2 Noteworthy ............................................ 54311.2 Puzzles ..................................................... 54411.2.1 Gold bags – detect the fake ............................. 54511.2.2 Horse race – determine fastest three horses ............... 54611.3 Supplementary literature ...................................... 549III Appendix 553A Quick start JShell ........................................... 555A.1 Java + REPL => jshell ...................................... 555B Short introduction JUnit 5 ................................... 561B.1 Writing and running tests ...................................... 561B.1.1 Example: A first unit test ................................ 561B.1.2 Fundamentals of writing and running tests................. 562B.1.3 Handling expected exceptions with assertThrows() ...... 565B.2 Parameterized tests with JUnit 5 ............................... 566C Quick start O-notation ....................................... 569C.1 Estimations with the O-notation ................................ 569C.1.1 Complexity classes ..................................... 570C.1.2 Complexity and program running time .................... 572

Read more less

Book SynopsisGet started quickly with Qt, the popular open source C++ framework for building C++-based applications and games. This book will have you building both fully functional desktop and mobile applications in no time, including some simple game applications.  Introducing Qt 6 begins by guiding you in setting up your tools and environment, and then walks you through the first baby steps of Qt framework. Next, you''ll learn the basics of how project and app structure are set up using Qt. Then, you''ll begin your first real hands-on projects using Qt, including a task and problem management application and two games.  As you progress, you can enhance these apps and games using additional Qt components and features. The book then delves into advanced topics in Qt, learning above and beyond what the Qt docs can offer, including local storage, C++ integration, deployment to Windows and Android, custom components and how to work with them. UpTable of ContentsPart 11. IntroductionPart 2 - Content2. Setting up the Tools 3. First Baby Steps with Qt4. Explaining the Basics of Project and App Structure5. First Real Projects6. Taskmaster7. Hang-Man Game8. Rock, Paper, Scissors GamePart 3 - Components, Features and Things9. Components10. Features 11. Writing Diagrams in Qt12. Advanced Topics in Qt

Read more less

Book SynopsisQuickly find solutions to dozens of common programming problemsencountered while building Java applications, with recipes presented in the popular problem-solution format. Look up the programming problem that you want to resolve. Read the solution. Apply the solution directly in your own code. Problem solved!Java 17 Recipes is updated to reflect changes in specification and implementation since the Java 9 edition of this book. Java 17 is the next long-term support release (LTS) of the core Java Standard Edition (SE) version 17 which also includes some of the features from previous short term support (STS) releases of Java 16 and previous versions.This new edition covers of some of the newest features, APIs, and more such as pattern matching for switch, Restore Always-Strict-Floating-Point-Semantics, enhanced pseudo-random number generators, the vector API, sealed classes, and enhancements in the use of String. Source code for all recipes is available in a dedicated GitHub repository. Table of Contents1. Getting Started with Java 172. Java 17 Enhancements3. Strings4. Numbers and Dates5. Object-Oriented Java6. Lambda Expressions7. Data Structures and Collections8. Input and Output9. Exceptions and Logging10. Concurrency11. Debugging and Unit Testing12. Unicode, Internationalization, and Currency Codes13. Working with Databases14. JavaFX Fundamentals15. Graphics with JavaFX16. Media with JavaFX17. Java Web Applications18. Nashorn and Scripting19. E-mail20. JSON and XML Processing21. Networking22. Java Modularity

Read more less

Book SynopsisIf you''re looking to increase your knowledge of one of the core modules of SAP S/4HANA, this is the book for you. Settle in and let a long-time SAP professional guide you through the SAP Production Planning and Execution module. Author Himanshu Goel begins by explaining the nuts and bolts of production planning in SAP S/4HANA, before delving into various manufacturing methodologies such as discrete manufacturing, repetitive manufacturing, and process industry. He''ll then walk you through setting up master data such as the material master, bill of material, work center, routing, and production version. You''ll then learn, step-by-step, how SAP PP processes are established from production order-based manufacturing to process order-based manufacturing.This book explains the complex concepts of production planning and execution in a straightforward manner and makes for an invaluable guide for SAP PP users from production plannTable of ContentsChapter 1: IntroductionChapter Goal: This section introduces the three production execution methodologies made possible in SAP software, and at a high level describes what developments have happened related to discrete manufacturing in SAP S/4HANA No of pages: 10 Sub -Topics : 1.1 Manufacturing Types 1.1.1 Discrete Manufacturing 1.1.2 Repetitive Manufacturing 1.1.3 Process Manufacturing Chapter 2: Master Data Chapter Goal: This section explains the master data needed for discrete manufacturing process. No of pages: 50 Sub - Topics 1. Material Master 2. BOM 3. Work Center 4. Routing 5. Production Version Chapter 3: Production Planning Chapter Goal: Production Planning No of pages: 40 Sub - Topics: 1. Sales & Operation Planning 2. Demand Management Chapter 4: Material Requirement Planning Chapter Goal: This chapter explains the concepts of Material Requirement Planning in SAP. No of pages: 30 Sub - Topics: 1. Material Requirement Planning 2. Master Production Scheduling 3. Consumption Based Planning Chapter 5: Production Order Management Chapter Goal: This chapter explains the production execution with Production order based manufacturing. No of pages: 40 Sub - Topics: 1. Production Order 2. Goods Issue 3. Confirmation 4. Goods Receipt Chapter 6: Repetitive Manufacturing Chapter Goal: This chapter explains the production execution with Repetitive manufacturing. No of pages: 20 Sub - Topics: 1. Master data for REM 2. Production execution with REM Chapter 7: Process Order Management Chapter Goal: This chapter explains the production execution with Process order based manufacturing. No of pages: 40 Sub - Topics: 1. Process Order 2. Goods Issue 3. Confirmation 4. Goods Receipt Chapter 8: Capacity Requirement Planning Chapter Goal: This chapter explains the capacity requirement planning. No of pages: 20 Sub - Topics: 1. Capacity Evaluation 2. Capacity Levelling Chapter 9: Reports Chapter Goal: This chapter explains the important reports and tools that can be used in SAP PP No of pages: 20 Sub - Topics: 1. Stock Requirement List 2. Production Order List 3. Stock List 4. Where used list Chapter 10: Innovations in S/4HANA Chapter Goal: This chapter explains the latest innovations in S/4HANA No of pages: 40 Sub - Topics: 1. Demand Driven MRP 2. MRP Live 3. Predictive MRP

Read more less

Book SynopsisIntermediate-Advanced user levelTable of Contents1. Fragen in natürlicher Sprache stellen2. Die Insights-Funktion3. Entdeckung wichtiger Einflussfaktoren4. Drill-Down und Zerlegung von Hierarchien5. Hinzufügen intelligenter Visualisierungen6. Mit Szenarien experimentieren7. Einen Datensatz charakterisieren8. Spalten aus Beispielen erstellen9. Ausführen von R- und Python-Visualisierungen10. Datenumwandlung mit R und Python11. Ausführen von Machine Learning Modellen in der Azure Cloud

Read more less

Book SynopsisMaster the fundamentals of Spring Framework 6 while learning from the real-world experiences of Spring experts. Over the course of this book, you'll learn how to leverage Spring 6 in tandem with the Kotlin programming language to build complex enterprise applications from top to bottom. From monoliths to cloud native apps for streaming microservices, you'll gain insight into every aspect of the process, including transactions, data access, persistence, and web and presentation tiers. As you progress through the book, the authors demonstrate how to run Kotlin with a single command, deploy new utility methods in String class, use Local-Variable Syntax for Lambda Parameters Nested Based Access Control, read/write strings to and from files, and using Flight Recorder. Also, a whole new generation of dependencies are available, and you'll see exactly how to make optimal use of them. A full sample application will show you how to apply Spring 6's new tools and techniques and see how they woTable of ContentsChapter 01 Introducing Spring Framework 6Chapter 02 Getting Started with Spring and KotlinChapter 03 Introducing IoCChapter 04 Spring Configuration In Detail and Spring BootChapter 05 Introducing Spring AOPChapter 06 Using Spring Data JPA with KotlinChapter 07 Using Spring Data JDBC with KotlinChapter 08 Using other Spring Data and Integrating with HibernateChapter 09 Transaction ManagementChapter 10 Validation Conversion FormattingChapter 11 Task SchedulingChapter 12 Using Spring RemotingChapter 13 Spring TestingChapter 14 Scripting Support In SpringChapter 15 Application MonitoringChapter 16 Web Applications and Microservices with Spring MVC and WebFluxChapter 17 WebSocketsChapter 18 Spring Projects Batch, Integration and moreChapter 19. Spring Cloud for Cloud-Native AppsAppendix A Setting Up Your Development Environment

Read more less

Book SynopsisBioCoder is a quarterly newsletter for DIYbio, synthetic bio, and anything related. You ll discover: Articles about interesting projects and experiments, such as the glowing plantArticles about tools, both those you buy and those you buildVisits to DIYbio laboratoriesProfiles of key people in the communityAnnouncements of events and other items of interestSafety pointers and tips about good laboratory practiceAnything that s interesting or useful: you tell us!And BioCoder is free (for the time being), unless you want a dead-tree version. We d like BioCoder to become self supporting (maybe even profitable), but we ll worry about that after we ve got a few issues under our belt.If you d like to contribute, send email to BioCoder@oreilly.com. Tell us what you d like to do, and we ll get you started.

Read more less

Book SynopsisThis practical book examines real-world scenarios where DNNsthe algorithms intrinsic to much of AIare used daily to process image, audio, and video data. Author Katy Warr considers attack motivations, the risks posed by this adversarial input, and methods for increasing AI robustness to these attacks.

Read more less

Book SynopsisWe live in an age of artificial intelligence. Machines think and act in ever more complex ways, making suggestions and decisions on our behalf. While AI might be seen as practical and profitable, issues of data surveillance, algorithmic control, and sexist and racist bias persist. In this rapidly changing landscape, social analysis of AI risks getting scaled down to issues of ‘ethics’, ‘responsibility’, and ‘fairness’. While these are important issues, they must be addressed not from an ‘AI first’ perspective, but more thoroughly in terms of power and contention. Approaching artificial intelligence from the often overlooked perspective of critical social theory, this book provides a much-needed intervention on how both old and new theories conceptualize the social consequences of AI. Questions are posed about the ideologies driving AI, the mythologies surrounding AI, and the complex relationship between AI and power. Simon Lindgren provides a way of defining AI as an object of social and political critique, and guides the reader through a set of contentious areas where AI and politics intersect. In relation to these topics, critical theories are drawn upon, both as an argument for and an illustration of how AI can be critiqued. Given the opportunities and challenges of AI, this book is a must-read for students and scholars in the humanities, social sciences, and STEM disciplines.Trade Review"This is a powerfully curated discussion that weaves together established and emerging scholarship, and hones conceptual tools for all those who want to understand the techno status quo with greater clarity and insight. Essential reading."Ruha Benjamin, author of Race After Technology and Viral Justice "In this book, Lindgren shows the enduring relevance of critical theory’s melding of philosophical insight and the demands of social justice. Critical Theory of AI surveys and re-contextualizes some of the most important contemporary critical work on AI, both rooting it in classic philosophy of technology, and showing how AI requires us to revise and extend that tradition. Rich with insights on the nature of AI and accessible to a wide audience, Critical Theory of AI is a compelling read."Frank Pasquale, Cornell University"A major contribution to critical thinking about AI. Simultaneously detailed and clearly grounded in critical theory but also written in a clear and accessible way, this book is an essential companion for researchers and students in their trajectory of making sense of the current hype of AI."Pieter Verdegem, University of Westminster“a very good book that offers a different and critical view of technological development. … Lindgren writes very well, making the book accessible to those interested in a comprehensive view of AI”Ove Christensen, kulturkapellet “Lindgren [is] an astute, elegant and provocative writer… the book [is] almost implausibly engrossing. … A glittering, powerful and resonant argument for more stringent ethical and legal regulation of the field”The Weekend AustralianTable of Contents1. AI and critical theory 2. AI assemblage 3. Ideology behind AI 4. Ideology within AI 5. Social machines 6. AI at work 7. AI subjects 8. AI in the loop References Index

Read more less

Book SynopsisMadsen's book should be welcome both to graduate students about toundertake dissertations and to faculty needing to learn the role ofthesis adviser. . . . Madsen tells how to propose, outline, write,defAnd, and possibly publish a dissertation, information whichshould save graduate students years, pain, and money. --Library JournalTrade Review"Madsen's book should be welcome both to graduate students about to undertake dissertations and to faculty needing to learn the role of thesis adviser. . . . Madsen tells how to propose, outline, write, defAnd, and possibly publish a dissertation, information which should save graduate students years, pain, and money."Table of Contents1. Starting and Completing the Dissertation. 2. Working with the Research Adviser and Advisory Committee. 3. Selecting and Shaping the Research Topic. 4. Preparing the Research Proposal. 5. Employing Basic Research Sources and Techniques. 6. Using the Library and Locating Essential Resources. 7. Organizing, Outlining, and Writing. 8. DefAnding the Thesis. 9. Adapting the Thesis for Publication and Presentation. Resources: Sample Proposals and Manuscript Pages A. SampleProposal: Historical Approach B. Sample Proposal: ExperimentalApproach C. Sample Pages.

Read more less

Book SynopsisHow can computers distinguish the coherent from the unintelligible, recognize new information in a sentence, or draw inferences from a natural language passage? Computational semantics is an exciting new field that seeks answers to these questions, and this volume is the first textbook wholly devoted to this growing sub discipline. The book explains the underlying theoretical issues and fundamental techniques for computing semantic representations for fragments of natural language. This volume will be an essential text for computer scientists, linguists, and anyone interested in the development of computational semantics.Trade Review"An exciting combination of standard Montague techniques, modern approaches to underspecification, and the use of first order theorem provers, all in a book that can be used by advanced undergraduates or graduate students." - Robin Cooper, Gorg University"

Read more less

Book Synopsis

Read more less

Book SynopsisPrinciples of Computer Science is an invigorating and rapid adventure that covers core introductory theoretical computer science topics, including discrete mathematics, logic, programming languages, and programming language pragmatics. Readers dive deep into the syntax and semantics of constructing a small yet usable programming language (interpreter) containing paradigms from functional and non-functional programming. Additionally, users will gain an understanding of compilation by writing functions that translate code written in their high-level language down to low-level machine language. Moreover, Crotts provides a perspective on event-driven programming, memory management via garbage collection, and much more. Principles of Computer Science assumes no prior programming experience--all topics are taught from scratch, making this a highly approachable and inclusive textbook.Table of ContentsPrefaceChapter 1: A Computing MindsetChapter 2: A Logic PrimerChapter 3: Data StructuresChapter 4: Formal LanguagesChapter 5: Programming and DesignChapter 6: InterpretationChapter 7: Functional ProgrammingChapter 8: Imperative ProgrammingChapter 9: CompilationChapter 10: Memory ManagementChapter 11: Event-Driven ProgrammingAppendix A: Environment and Code Setup Appendix B: Graphics Library Source CodeAppendix C: Assembly Environment SetupBibliographyIndex

Read more less

Book Synopsis

Read more less

Book SynopsisThe wireless medium is a shared resource. If nearby devices transmit at the same time, their signals interfere, resulting in a collision. In traditional networks, collisions cause the loss of the transmitted information. For this reason, wireless networks have been designed with the assumption that interference is intrinsically harmful and must be avoided. This book, a revised version of the author's award-winning Ph.D. dissertation, takes an alternate approach: Instead of viewing interference as an inherently counterproductive phenomenon that should to be avoided, we design practical systems that transform interference into a harmless, and even a beneficial phenomenon. To achieve this goal, we consider how wireless signals interact when they interfere, and use this understanding in our system designs. Specifically, when interference occurs, the signals get mixed on the wireless medium. By understanding the parameters of this mixing, we can invert the mixing and decode the interfered packets; thus, making interference harmless. Furthermore, we can control this mixing process to create strategic interference that allow decodability at a particular receiver of interest, but prevent decodability at unintended receivers and adversaries. Hence, we can transform interference into a beneficial phenomenon that provides security. Building on this approach, we make four main contributions: We present the first WiFi receiver that can successfully reconstruct the transmitted information in the presence of packet collisions. Next, we introduce a WiFi receiver design that can decode in the presence of high-power cross-technology interference from devices like baby monitors, cordless phones, microwave ovens, or even unknown technologies. We then show how we can harness interference to improve security. In particular, we develop the first system that secures an insecure medical implant without any modification to the implant itself. Finally, we present a solution that establishes secure connections between any two WiFi devices, without having users enter passwords or use pre-shared secret keys.

Read more less

Book SynopsisAs society rushes to digitize sensitive information and services, it is imperative to adopt adequate security protections. However, such protections fundamentally conflict with the benefits we expect from commodity computers. In other words, consumers and businesses value commodity computers because they provide good performance and an abundance of features at relatively low costs. Meanwhile, attempts to build secure systems from the ground up typically abandon such goals, and hence are seldomadopted.In this book, I argue that we can resolve the tension between security and features by leveraging the trust a user has in one device to enable her to securely use another commodity device or service, without sacrificing the performance and features expected of commodity systems. At a high level, we support this premise by developing techniques to allow a user to employ a small, trusted, portable device to securely learn what code is executing on her local computer. Rather than entrusting her data to the mountain of buggy code likely running on her computer, we construct an on-demand secure execution environment which can perform security-sensitive tasks and handle private data in complete isolation from all other software (and most hardware) on the system. Meanwhile, non-security-sensitive software retains the same abundance of features and performance it enjoys today.Having established an environment for secure code execution on an individual computer, we then show how to extend trust in this environment to network elements in a secure and efficient manner. This allows us to reexamine the design of network protocols and defenses, since we can now execute code on endhosts and trust the results within the network. Lastly, we extend the user's trust one more step to encompass computations performed on a remote host (e.g., in the cloud). We design, analyze, and prove secure a protocol that allows a user to outsource arbitrary computations to commodity computers run by an untrusted remote party (or parties) who may subject the computers to both software and hardware attacks. Our protocol guarantees that the user can both verify that the results returned are indeed the correct results of the specified computations on the inputs provided, and protect the secrecy of both the inputs and outputs of the computations. These guarantees are provided in a non-interactive, asymptotically optimal (with respect to CPU and bandwidth) manner.Thus, extending a user's trust, via software, hardware, and cryptographic techniques, allows us to provide strong security protections for both local and remote computations on sensitive data, while still preserving the performance and features of commodity computers.

Read more less

Book SynopsisAs science becomes increasingly computational, the limits of what is computationally tractable become a barrier to scientific progress. Many scientific problems, however, are amenable to human problem solving skills that complement computational power. By leveraging these skills on a larger scale---beyond the relatively few individuals currently engaged in scientific inquiry-there is the potential for new scientific discoveries. This book presents a framework for mapping open scientific problems into video games. The game framework combines computational power with human problem solving and creativity to work toward solving scientific problems that neither computers nor humans could previously solve alone. To maximize the potential contributors to scientific discovery, the framework designs a game to be played by people with no formal scientific background and incentivizes long-term engagement with a myriad of collaborative or competitive reward structures. The framework allows for the continual coevolution of the players and the game to each other: as players gain expertise through gameplay, the game changes to become a better tool. The framework is validated by being applied to proteomics problems with the video game Foldit. Foldit players have contributed to novel discoveries in protein structure prediction, protein design, and protein structure refinement algorithms. The coevolution of human problem solving and computer tools in an incentivized game framework is an exciting new scientific pathway that can lead to discoveries currently unreachable by other methods.

Read more less

Book SynopsisThe aim of cryptography is to design primitives and protocols that withstand adversarial behavior. Information theoretic cryptography, how-so-ever desirable, is extremely restrictive and most non-trivial cryptographic tasks are known to be information theoretically impossible. In order to realize sophisticated cryptographic primitives, we forgo information theoretic security and assume limitations on what can be efficiently computed. In other words we attempt to build secure systems conditioned on some computational intractability assumption such as factoring, discrete log, decisional Diffie-Hellman, learning with errors, and many more.In this work, based on the 2013 ACM Doctoral Dissertation Award-winning thesis, we put forth new plausible lattice-based constructions with properties that approximate the sought after multilinear maps. The multilinear analog of the decision Diffie-Hellman problem appears to be hard in our construction, and this allows for their use in cryptography. These constructions open doors to providing solutions to a number of important open problems.Table of Contents Introduction Survey of Applications Multilinear Maps and Graded Encoding Systems Preliminaries I: Lattices Preliminaries II: Algebraic Number Theory Background The New Encoding Schemes Security of Our Constructions Preliminaries III: Computation in a Number Field Survey of Lattice Cryptanalysis One-Round Key Exchange Generalizing Graded Encoding Systems Bibliography Author's Biography

Read more less

Book SynopsisAs science becomes increasingly computational, the limits of what is computationally tractable become a barrier to scientific progress. Many scientific problems, however, are amenable to human problem solving skills that complement computational power. By leveraging these skills on a larger scale-beyond the relatively few individuals currently engaged in scientific inquiry-there is the potential for new scientific discoveries. This book presents a framework for mapping open scientific problems into video games. The game framework combines computational power with human problem solving and creativity to work toward solving scientific problems that neither computers nor humans could previously solve alone. To maximize the potential contributors to scientific discovery, the framework designs a game to be played by people with no formal scientific background and incentivizes long-term engagement with a myriad of collaborative or competitive reward structures. The framework allows for the continual coevolution of the players and the game to each other: as players gain expertise through gameplay, the game changes to become a better tool. The framework is validated by being applied to proteomics problems with the video game Foldit. Foldit players have contributed to novel discoveries in protein structure prediction, protein design, and protein structure refinement algorithms. The coevolution of human problem solving and computer tools in an incentivized game framework is an exciting new scientific pathway that can lead to discoveries currently unreachable by other methods.

Read more less

Book SynopsisThe wireless medium is a shared resource. If nearby devices transmit at the same time, their signals interfere, resulting in a collision. In traditional networks, collisions cause the loss of the transmitted information. For this reason, wireless networks have been designed with the assumption that interference is intrinsically harmful and must be avoided. This book, a revised version of the author's award-winning Ph.D. dissertation, takes an alternate approach: Instead of viewing interference as an inherently counterproductive phenomenon that should to be avoided, we design practical systems that transform interference into a harmless, and even a beneficial phenomenon. To achieve this goal, we consider how wireless signals interact when they interfere, and use this understanding in our system designs. Specifically, when interference occurs, the signals get mixed on the wireless medium. By understanding the parameters of this mixing, we can invert the mixing and decode the interfered packets; thus, making interference harmless. Furthermore, we can control this mixing process to create strategic interference that allow decodability at a particular receiver of interest, but prevent decodability at unintended receivers and adversaries. Hence, we can transform interference into a beneficial phenomenon that provides security. Building on this approach, we make four main contributions: We present the first WiFi receiver that can successfully reconstruct the transmitted information in the presence of packet collisions. Next, we introduce a WiFi receiver design that can decode in the presence of high-power cross-technology interference from devices like baby monitors, cordless phones, microwave ovens, or even unknown technologies. We then show how we can harness interference to improve security. In particular, we develop the first system that secures an insecure medical implant without any modification to the implant itself. Finally, we present a solution that establishes secure connections between any two WiFi devices, without having users enter passwords or use pre-shared secret keys.

Read more less

Book SynopsisAs society rushes to digitize sensitive information and services, it is imperative to adopt adequate security protections. However, such protections fundamentally conflict with the benefits we expect from commodity computers. In other words, consumers and businesses value commodity computers because they provide good performance and an abundance of features at relatively low costs. Meanwhile, attempts to build secure systems from the ground up typically abandon such goals, and hence are seldomadopted.In this book, I argue that we can resolve the tension between security and features by leveraging the trust a user has in one device to enable her to securely use another commodity device or service, without sacrificing the performance and features expected of commodity systems. At a high level, we support this premise by developing techniques to allow a user to employ a small, trusted, portable device to securely learn what code is executing on her local computer. Rather than entrusting her data to the mountain of buggy code likely running on her computer, we construct an on-demand secure execution environment which can perform security-sensitive tasks and handle private data in complete isolation from all other software (and most hardware) on the system. Meanwhile, non-security-sensitive software retains the same abundance of features and performance it enjoys today.Having established an environment for secure code execution on an individual computer, we then show how to extend trust in this environment to network elements in a secure and efficient manner. This allows us to reexamine the design of network protocols and defenses, since we can now execute code on endhosts and trust the results within the network. Lastly, we extend the user's trust one more step to encompass computations performed on a remote host (e.g., in the cloud). We design, analyze, and prove secure a protocol that allows a user to outsource arbitrary computations to commodity computers run by an untrusted remote party (or parties) who may subject the computers to both software and hardware attacks. Our protocol guarantees that the user can both verify that the results returned are indeed the correct results of the specified computations on the inputs provided, and protect the secrecy of both the inputs and outputs of the computations. These guarantees are provided in a non-interactive, asymptotically optimal (with respect to CPU and bandwidth) manner.Thus, extending a user's trust, via software, hardware, and cryptographic techniques, allows us to provide strong security protections for both local and remote computations on sensitive data, while still preserving the performance and features of commodity computers.

Read more less

Book SynopsisThe aim of cryptography is to design primitives and protocols that withstand adversarial behavior. Information theoretic cryptography, how-so-ever desirable, is extremely restrictive and most non-trivial cryptographic tasks are known to be information theoretically impossible. In order to realize sophisticated cryptographic primitives, we forgo information theoretic security and assume limitations on what can be efficiently computed. In other words we attempt to build secure systems conditioned on some computational intractability assumption such as factoring, discrete log, decisional Diffie-Hellman, learning with errors, and many more.In this work, based on the 2013 ACM Doctoral Dissertation Award-winning thesis, we put forth new plausible lattice-based constructions with properties that approximate the sought after multilinear maps. The multilinear analog of the decision Diffie-Hellman problem appears to be hard in our construction, and this allows for their use in cryptography. These constructions open doors to providing solutions to a number of important open problems.Table of Contents Introduction Survey of Applications Multilinear Maps and Graded Encoding Systems Preliminaries I: Lattices Preliminaries II: Algebraic Number Theory Background The New Encoding Schemes Security of Our Constructions Preliminaries III: Computation in a Number Field Survey of Lattice Cryptanalysis One-Round Key Exchange Generalizing Graded Encoding Systems Bibliography Author's Biography

Read more less