Kooperativer Bibliotheksverbund

UID:

Format: XIV, 468 S. : graph. Darst. , 1 Diskette (9 cm)

ISBN: 0-387-94518-0

Note: Bd. 1 u.d.T.: Economic and financial modeling with Mathematica. - Systemvoraussetzungen: files can be read on DOS/Windows, Macintosh, NeXT, and UNIX computers; Mathematica 2.2 or later is recommended for maximum use of the diskette files

Language: English

Subjects: Computer Science , Economics

Keywords: Ökonometrisches Modell ; Mathematica ; Finanzplanungsmodell ; Mathematica ; Aufsatzsammlung ; Aufsatzsammlung ; Aufsatzsammlung ; Lehrbuch

URL: Inhaltsverzeichnis

URL: Inhaltstext

URL: Inhaltstext

URL: http://www.loc.gov/catdir/enhancements/fy0815/96200216-d.html

Author information: Varian, Hal R. 1947-

UID:

Format: 1 online resource (223 pages)

ISBN: 9783030053185

Series Statement: The Springer Series on Challenges in Machine Learning Ser.

Note: Intro -- Foreword -- Preface -- Acknowledgments -- Contents -- Part I AutoML Methods -- 1 Hyperparameter Optimization -- 1.1 Introduction -- 1.2 Problem Statement -- 1.2.1 Alternatives to Optimization: Ensembling and Marginalization -- 1.2.2 Optimizing for Multiple Objectives -- 1.3 Blackbox Hyperparameter Optimization -- 1.3.1 Model-Free Blackbox Optimization Methods -- 1.3.2 Bayesian Optimization -- 1.3.2.1 Bayesian Optimization in a Nutshell -- 1.3.2.2 Surrogate Models -- 1.3.2.3 Configuration Space Description -- 1.3.2.4 Constrained Bayesian Optimization -- 1.4 Multi-fidelity Optimization -- 1.4.1 Learning Curve-Based Prediction for Early Stopping -- 1.4.2 Bandit-Based Algorithm Selection Methods -- 1.4.3 Adaptive Choices of Fidelities -- 1.5 Applications to AutoML -- 1.6 Open Problems and Future Research Directions -- 1.6.1 Benchmarks and Comparability -- 1.6.2 Gradient-Based Optimization -- 1.6.3 Scalability -- 1.6.4 Overfitting and Generalization -- 1.6.5 Arbitrary-Size Pipeline Construction -- Bibliography -- 2 Meta-Learning -- 2.1 Introduction -- 2.2 Learning from Model Evaluations -- 2.2.1 Task-Independent Recommendations -- 2.2.2 Configuration Space Design -- 2.2.3 Configuration Transfer -- 2.2.3.1 Relative Landmarks -- 2.2.3.2 Surrogate Models -- 2.2.3.3 Warm-Started Multi-task Learning -- 2.2.3.4 Other Techniques -- 2.2.4 Learning Curves -- 2.3 Learning from Task Properties -- 2.3.1 Meta-Features -- 2.3.2 Learning Meta-Features -- 2.3.3 Warm-Starting Optimization from Similar Tasks -- 2.3.4 Meta-Models -- 2.3.4.1 Ranking -- 2.3.4.2 Performance Prediction -- 2.3.5 Pipeline Synthesis -- 2.3.6 To Tune or Not to Tune? -- 2.4 Learning from Prior Models -- 2.4.1 Transfer Learning -- 2.4.2 Meta-Learning in Neural Networks -- 2.4.3 Few-Shot Learning -- 2.4.4 Beyond Supervised Learning -- 2.5 Conclusion -- Bibliography. , 3 Neural Architecture Search -- 3.1 Introduction -- 3.2 Search Space -- 3.3 Search Strategy -- 3.4 Performance Estimation Strategy -- 3.5 Future Directions -- Bibliography -- Part II AutoML Systems -- 4 Auto-WEKA: Automatic Model Selection and Hyperparameter Optimization in WEKA -- 4.1 Introduction -- 4.2 Preliminaries -- 4.2.1 Model Selection -- 4.2.2 Hyperparameter Optimization -- 4.3 CASH -- 4.3.1 Sequential Model-Based Algorithm Configuration (SMAC) -- 4.4 Auto-WEKA -- 4.5 Experimental Evaluation -- 4.5.1 Baseline Methods -- 4.5.2 Results for Cross-Validation Performance -- 4.5.3 Results for Test Performance -- 4.6 Conclusion -- 4.6.1 Community Adoption -- Bibliography -- 5 Hyperopt-Sklearn -- 5.1 Introduction -- 5.2 Background: Hyperopt for Optimization -- 5.3 Scikit-Learn Model Selection as a Search Problem -- 5.4 Example Usage -- 5.5 Experiments -- 5.6 Discussion and Future Work -- 5.7 Conclusions -- Bibliography -- 6 Auto-sklearn: Efficient and Robust Automated MachineLearning -- 6.1 Introduction -- 6.2 AutoML as a CASH Problem -- 6.3 New Methods for Increasing Efficiency and Robustness of AutoML -- 6.3.1 Meta-learning for Finding Good Instantiations of Machine Learning Frameworks -- 6.3.2 Automated Ensemble Construction of Models Evaluated During Optimization -- 6.4 A Practical Automated Machine Learning System -- 6.5 Comparing Auto-sklearn to Auto-WEKA and Hyperopt-Sklearn -- 6.6 Evaluation of the Proposed AutoML Improvements -- 6.7 Detailed Analysis of Auto-sklearn Components -- 6.8 Discussion and Conclusion -- 6.8.1 Discussion -- 6.8.2 Usage -- 6.8.3 Extensions in PoSH Auto-sklearn -- 6.8.4 Conclusion and Future Work -- Bibliography -- 7 Towards Automatically-Tuned Deep Neural Networks -- 7.1 Introduction -- 7.2 Auto-Net 1.0 -- 7.3 Auto-Net 2.0 -- 7.4 Experiments -- 7.4.1 Baseline Evaluation of Auto-Net 1.0 and Auto-sklearn. , 7.4.2 Results for AutoML Competition Datasets -- 7.4.3 Comparing AutoNet 1.0 and 2.0 -- 7.5 Conclusion -- Bibliography -- 8 TPOT: A Tree-Based Pipeline Optimization Toolfor Automating Machine Learning -- 8.1 Introduction -- 8.2 Methods -- 8.2.1 Machine Learning Pipeline Operators -- 8.2.2 Constructing Tree-Based Pipelines -- 8.2.3 Optimizing Tree-Based Pipelines -- 8.2.4 Benchmark Data -- 8.3 Results -- 8.4 Conclusions and Future Work -- Bibliography -- 9 The Automatic Statistician -- 9.1 Introduction -- 9.2 Basic Anatomy of an Automatic Statistician -- 9.2.1 Related Work -- 9.3 An Automatic Statistician for Time Series Data -- 9.3.1 The Grammar over Kernels -- 9.3.2 The Search and Evaluation Procedure -- 9.3.3 Generating Descriptions in Natural Language -- 9.3.4 Comparison with Humans -- 9.4 Other Automatic Statistician Systems -- 9.4.1 Core Components -- 9.4.2 Design Challenges -- 9.4.2.1 User Interaction -- 9.4.2.2 Missing and Messy Data -- 9.4.2.3 Resource Allocation -- 9.5 Conclusion -- Bibliography -- Part III AutoML Challenges -- 10 Analysis of the AutoML Challenge Series 2015-2018 -- 10.1 Introduction -- 10.2 Problem Formalization and Overview -- 10.2.1 Scope of the Problem -- 10.2.2 Full Model Selection -- 10.2.3 Optimization of Hyper-parameters -- 10.2.4 Strategies of Model Search -- 10.3 Data -- 10.4 Challenge Protocol -- 10.4.1 Time Budget and Computational Resources -- 10.4.2 Scoring Metrics -- 10.4.3 Rounds and Phases in the 2015/2016 Challenge -- 10.4.4 Phases in the 2018 Challenge -- 10.5 Results -- 10.5.1 Scores Obtained in the 2015/2016 Challenge -- 10.5.2 Scores Obtained in the 2018 Challenge -- 10.5.3 Difficulty of Datasets/Tasks -- 10.5.4 Hyper-parameter Optimization -- 10.5.5 Meta-learning -- 10.5.6 Methods Used in the Challenges -- 10.6 Discussion -- 10.7 Conclusion -- Bibliography -- Correction to: Neural Architecture Search.

Additional Edition: Print version: Hutter, Frank Automated Machine Learning Cham : Springer International Publishing AG,c2019 ISBN 9783030053178

Language: English

Subjects: Computer Science

Keywords: Electronic books. ; Electronic books. ; Electronic books. ; Aufsatzsammlung

URL: Click to View

URL: ProQuest Ebook Central

URL: SpringerLink

URL: SpringerLink

URL: https://link.springer.com/10.1007/978-3-030-05318-5

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Buchcover

URL: kostenfrei

URL: lizenzpflichtig

UID:

Format: 1 online resource (515 pages)

Edition: 1st ed.

ISBN: 9781484228968

Note: Intro -- Table of Contents -- About the Authors -- Acknowledgments -- Foreword -- Introduction -- Chapter 1: Conceptualizing the Secure Internet of Things -- The BadUSB Thumb Drive -- Air-Gap Security -- Stuxnet -- Designing Safe and Secure Cyber-Physical Systems -- Constrained Computing and Moore's Law -- Trusted IoT Networks and the Network Edge -- Conclusion -- Chapter 2: IoT Frameworks and Complexity -- Introduction -- Historical Background to IoT -- IoT Ecosystem -- Connectivity Technology -- Messaging Technology -- Platform Technology -- Elements of an IoT System -- IoT Device -- IoT Device Architectural Goals -- Interoperability -- Security -- IoT Network -- IoT System Management -- Device Lifecycle -- Manufacturing -- Supply Chain -- Deployment -- Normal Operation and Monitoring -- Manage -- Update -- Decommissioning -- IoT Framework -- IoT Framework Design Goals -- IoT Data Model and System Abstractions -- IoT Node -- IoT Operations Abstraction -- Connectivity Elements -- Manageability Elements -- Security Elements -- Consider the Cost of Cryptography -- Summary IoT Framework Considerations -- IoT Framework Architecture -- Data Object Layer -- Node Interaction Layer -- Platform Abstraction Layer -- Platform Layer -- Security Challenges with IoT Frameworks -- Consumer IoT Framework Standards -- Open Connectivity Foundation (OCF) -- OCF Core Framework Layer -- OCF Profiles Framework Layer -- The OCF Device Abstraction -- OCF Security -- AllSeen Alliance/AllJoyn -- AllJoyn Security -- Universal Plug and Play -- UPnP Security -- Lightweight Machine 2 Machine (LWM2M) -- LWM2M Architecture -- LWM2M Device Management -- LWM2M Security -- One Machine to Machine (OneM2M) -- OneM2M Security -- Industrial IoT Framework Standards -- Industrial Internet of Things Consortium (IIC) and OpenFog Consortium. , Open Platform Communications-Unified Architecture (OPC-UA) -- OPC-UA Framework Architecture -- OPC-UA Security -- Data Distribution Service (DDS) -- DDS Framework Architecture -- DDS Security -- Security Enveloping -- Security Tokens -- Security Plugin Modules -- Framework Gateways -- Framework Gateway Architecture -- Type I Framework Gateway -- Type II Framework Gateway -- Type III Framework Gateway -- Type IV Framework Gateway -- Security Considerations for Framework Gateways -- Security Endpoints Within the Gateway -- Security Endpoints in Type I Gateways -- Security Endpoints in Type II Gateways -- Security Endpoints in Type III Gateways -- Security Endpoints in Type IV Gateways -- Security Framework Gateway Architecture -- Summary -- Chapter 3: Base Platform Security Hardware Building Blocks -- Background and Terminology -- Assets, Threats, and Threat Pyramid -- Inverted Threat Pyramid -- Sample IoT Device Lifecycle -- End-to-End (E2E) Security -- Security Essentials -- Device Identity -- Protected Boot -- Protected Storage -- Trusted Execution Environment (TEE) -- Built-In Security -- Base Platform Security Features Overview -- CPU Hosted Crypto Implementations -- Malware Protection (OS Guard) -- OS Guard (SMEP) -- OS Guard (SMAP) -- Encryption/Decryption Using AES-NI -- Sign/Verify Using Intel® SHA Extensions -- Intel® Data Protection Technology with Secure Key (DRNG) -- Converged Security and Manageability Engine (CSME) -- Secure/Verified, Measured Boot and Boot Guard -- Trusted Execution Technology (TXT) -- Platform Trust Technology (PTT) -- Enhanced Privacy ID (EPID) -- Memory Encryption Technologies -- TME -- MKTME -- Dynamic Application Loader (DAL) -- Software Guard Extensions (SGX) - IA CPU Instructions -- Identity Crisis -- Enhanced Privacy Identifier (EPID) -- Anonymity -- PTT/TPM -- Device Boot Integrity - Trust But Verify. , Secure Boot Mechanisms -- Secure Boot Terminology Overview -- Overview of BIOS/UEFI Secure Boot Using Boot Guard Version 1.0 (BtG) -- Data Protection - Securing Keys, Data at Rest and in Transit -- Intel Platform Trust Technology (PTT) -- Windows PTT Architecture -- Linux PTT Software Stack -- Runtime Protection - Ever Vigilant -- Intel Virtualization Technology (Intel VT) -- Software Guard Extensions (SGX) -- Intel CSE/CSME - DAL -- Isolation from Rich Execution Environment -- Authenticity and Security -- Portability -- Intel Trusted Execution Technology (TXT) -- Threats Mitigated -- Zero-Day Attacks -- Other Attacks -- Conclusion -- References -- Chapter 4: IoT Software Security Building Blocks -- Understanding the Fundamentals of Our Architectural Model -- Operating Systems -- Threats to Operating Systems -- Zephyr: Real-Time Operating System for Devices -- Zephyr Execution Separation -- Zephyr Memory Separation -- Zephyr Privilege Levels and System Authorization -- Zephyr Programming Error Protections -- Zephyr's Other Security Features -- Zephyr Summary -- Linux Operating Systems -- Pulsar: Wind River Linux -- Ubuntu IoT Core -- Intel® Clear Linux -- Linux Summary -- Hypervisors and Virtualization -- Threats to Hypervisors -- Intel® ACRN -- Real-Time and Power Management Guarantees in ACRN -- ACRN Summary -- Software Separation and Containment -- Containment Security Principles -- Threats to Extended Application Containment -- Containers -- Kata Containers -- Kata Containers Summary -- Trusted Execution Environments -- Software Guard Extensions -- SGX Security Summary -- Android Trusty -- Trusty TEE Security Summary -- Containment Summary -- Network Stack and Security Management -- Intel Data Plane Development Kit -- Security Management -- Secure Device Onboarding -- Platform Integrity -- Network Defense -- Platform Monitoring. , McAfee Embedded Control -- Network Stack and Security Summary -- Device Management -- Mesh Central -- Wind River Helix Device Cloud -- Device Management Summary -- System Firmware and Root-of-Trust Update Service -- Threats to Firmware and RoT Update -- Turtle Creek System Update and Manageability Service -- System Firmware and RoT Summary -- Application-Level Language Frameworks -- JavaScript and Node.js or Sails -- Java and Android -- EdgeX Foundry -- Application-Level Framework Summary -- Message Orchestration -- Message Queuing Telemetry Transport -- OPC Unified Architecture -- Constrained Application Protocol -- Message Orchestration Summary -- Applications -- Summary -- Chapter 5: Connectivity Technologies for IoT -- Ethernet Time-Sensitive Networking -- Legacy Ethernet-Based Connectivity in Industrial Applications -- Key Benefits of TSN -- TSN Standards -- TSN Profiles -- 802.1AS/AS-Rev -- 802.1Qbv -- 802.1Qbu -- 802.1CB -- 802.1Qcc -- 802.1Qci -- 802.1Qch -- 802.1Qcr -- TSN and Security -- OPC-UA Over TSN -- Overview of Wireless Connectivity Technologies -- Considerations for Choosing Wireless Technologies for IoT -- Spectrum -- Range and Capacity -- Network Topology -- Quality of Service -- Network Management -- Security -- Wi-Fi -- Bluetooth -- Zigbee -- NFC -- GPS/GNSS -- Cellular -- 5G Cellular -- Key Standards, Regulatory, and Industry Bodies Involved in 5G -- New Use Cases Enabled by 5G -- Key Technology Enablers for 5G -- LPWAN - Low-Power Wide Area Networks -- LoRa -- Sigfox -- Weightless -- Comparison of Low-Power LTE and Other LPWAN Technologies -- A Case Study - Smart Homes -- Summary -- References -- Chapter 6: IoT Vertical Applications and Associated Security Requirements -- Common Domain Requirements and the Security MVP -- Some Common Threats -- Retail Solutions -- Security Objectives and Requirements -- Threats. , Standards - Regulatory and Industry -- Transportation Solutions14 -- Connected Vehicle Infrastructure -- Security Objectives and Requirements -- Threats -- Mitigations -- Standards - Regulatory and Industry -- Industrial Control System (ICS) and Industrial IoT (IIoT) -- Security Objectives and Requirements -- Threats -- Standards - Regulatory and Industry -- Digital Surveillance System -- Security Objectives and Requirements -- Threats -- Standards - Regulatory and Industry -- Summary -- Appendix: Conclusion -- Economics of Constrained Roots-of-Trust -- IoT Frameworks - Necessary Complexity -- Hardware Security - More Than a Toolbox -- IOT Software - Building Blocks with Glue -- Ethernet TSN - Everybody's Common Choice? -- Security MVP - The Champion Within a Fractured IoT Ecosystem -- The Way Forward -- Index.

Additional Edition: Print version: Cheruvu, Sunil Demystifying Internet of Things Security Berkeley, CA : Apress L. P.,c2019 ISBN 9781484228951

Language: English

Subjects: Computer Science , Economics

Keywords: Electronic books. ; Electronic books

URL: Click to View

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Full-text  ((OIS Credentials Required))

URL: ProQuest Ebook Central

URL: lizenzpflichtig

UID:

Format: 1 online resource (807 pages)

Edition: 1st ed.

ISBN: 9781484243985

Note: Intro -- Table of Contents -- About the Authors -- Acknowledgments -- Preface -- Part 1 -- Chapter 1: Jumping Right In: "Hello, TBB!" -- Why Threading Building Blocks? -- Performance: Small Overhead, Big Benefits for C++ -- Evolving Support for Parallelism in TBB and C++ -- Recent C++ Additions for Parallelism -- The Threading Building Blocks (TBB) Library -- Parallel Execution Interfaces -- Interfaces That Are Independent of the Execution Model -- Using the Building Blocks in TBB -- Let's Get Started Already! -- Getting the Threading Building Blocks (TBB) Library -- Getting a Copy of the Examples -- Writing a First "Hello, TBB!" Example -- Building the Simple Examples -- Steps to Set Up an Environment -- Building on Windows Using Microsoft Visual Studio -- Building on a Linux Platform from a Terminal -- Using the Intel Compiler -- tbbvars and pstlvars Scripts -- Setting Up Variables Manually Without Using the tbbvars Script or the Intel Compiler -- A More Complete Example -- Starting with a Serial Implementation -- Adding a Message-Driven Layer Using a Flow Graph -- Adding a Fork-Join Layer Using a parallel_for -- Adding a SIMD Layer Using a Parallel STL Transform -- Summary -- Chapter 2: Generic Parallel Algorithms -- Functional / Task Parallelism -- A Slightly More Complicated Example: A Parallel Implementation of Quicksort -- Loops: parallel_for, parallel_reduce, and parallel_scan -- parallel_for: Applying a Body to Each Element in a Range -- A Slightly More Complicated Example: Parallel Matrix Multiplication -- parallel_reduce: Calculating a Single Result Across a Range -- A Slightly More Complicated Example: Calculating π by Numerical Integration -- parallel_scan: A Reduction with Intermediate Values -- How Does This Work? -- A Slightly More Complicated Example: Line of Sight -- Cook Until Done: parallel_do and parallel_pipeline. , parallel_do: Apply a Body Until There Are No More Items Left -- A Slightly More Complicated Example: Forward Substitution -- parallel_pipeline: Streaming Items Through a Series of Filters -- A Slightly More Complicated Example: Creating 3D Stereoscopic Images -- Summary -- For More Information -- Chapter 3: Flow Graphs -- Why Use Graphs to Express Parallelism? -- The Basics of the TBB Flow Graph Interface -- Step 1: Create the Graph Object -- Step 2: Make the Nodes -- Step 3: Add Edges -- Step 4: Start the Graph -- Step 5: Wait for the Graph to Complete Executing -- A More Complicated Example of a Data Flow Graph -- Implementing the Example as a TBB Flow Graph -- Understanding the Performance of a Data Flow Graph -- The Special Case of Dependency Graphs -- Implementing a Dependency Graph -- Estimating the Scalability of a Dependency Graph -- Advanced Topics in TBB Flow Graphs -- Summary -- Chapter 4: TBB and the Parallel Algorithms of the C++ Standard Template Library -- Does the C++ STL Library Belong in This Book? -- A Parallel STL Execution Policy Analogy -- A Simple Example Using std::for_each -- What Algorithms Are Provided in a Parallel STL Implementation? -- How to Get and Use a Copy of Parallel STL That Uses TBB -- Algorithms in Intel's Parallel STL -- Capturing More Use Cases with Custom Iterators -- Highlighting Some of the Most Useful Algorithms -- std::for_each, std::for_each_n -- std::transform -- std::reduce -- std::transform_reduce -- A Deeper Dive into the Execution Policies -- The sequenced_policy -- The parallel_policy -- The unsequenced_policy -- The parallel_unsequenced_policy -- Which Execution Policy Should We Use? -- Other Ways to Introduce SIMD Parallelism -- Summary -- For More Information -- Chapter 5: Synchronization: Why and How to Avoid It -- A Running Example: Histogram of an Image -- An Unsafe Parallel Implementation. , A First Safe Parallel Implementation: Coarse-Grained Locking -- Mutex Flavors -- A Second Safe Parallel Implementation: Fine-Grained Locking -- A Third Safe Parallel Implementation: Atomics -- A Better Parallel Implementation: Privatization and Reduction -- Thread Local Storage, TLS -- enumerable_thread_specific, ETS -- combinable -- The Easiest Parallel Implementation: Reduction Template -- Recap of Our Options -- Summary -- For More Information -- Chapter 6: Data Structures for Concurrency -- Key Data Structures Basics -- Unordered Associative Containers -- Map vs. Set -- Multiple Values -- Hashing -- Unordered -- Concurrent Containers -- Concurrent Unordered Associative Containers -- concurrent_hash_map -- Concurrent Support for map/multimap and set/multiset Interfaces -- Built-In Locking vs. No Visible Locking -- Iterating Through These Structures Is Asking for Trouble -- Concurrent Queues: Regular, Bounded, and Priority -- Bounding Size -- Priority Ordering -- Staying Thread-Safe: Try to Forget About Top, Size, Empty, Front, Back -- Iterators -- Why to Use This Concurrent Queue: The A-B-A Problem -- When to NOT Use Queues: Think Algorithms! -- Concurrent Vector -- When to Use tbb::concurrent_vector Instead of std::vector -- Elements Never Move -- Concurrent Growth of concurrent_vectors -- Summary -- Chapter 7: Scalable Memory Allocation -- Modern C++ Memory Allocation -- Scalable Memory Allocation: What -- Scalable Memory Allocation: Why -- Avoiding False Sharing with Padding -- Scalable Memory Allocation Alternatives: Which -- Compilation Considerations -- Most Popular Usage (C/C++ Proxy Library): How -- Linux: malloc/new Proxy Library Usage -- macOS: malloc/new Proxy Library Usage -- Windows: malloc/new Proxy Library Usage -- Testing our Proxy Library Usage -- C Functions: Scalable Memory Allocators for C. , C++ Classes: Scalable Memory Allocators for C++ -- Allocators with std::allocator< -- T> -- Signature -- scalable_allocator -- tbb_allocator -- zero_allocator -- cached_aligned_allocator -- Memory Pool Support: memory_pool_allocator -- Array Allocation Support: aligned_space -- Replacing new and delete Selectively -- Performance Tuning: Some Control Knobs -- What Are Huge Pages? -- TBB Support for Huge Pages -- scalable_allocation_mode(int mode, intptr_t value) -- TBBMALLOC_USE_HUGE_PAGES -- TBBMALLOC_SET_SOFT_HEAP_LIMIT -- int scalable_allocation_command(int cmd, void ∗param) -- TBBMALLOC_CLEAN_ALL_BUFFERS -- TBBMALLOC_CLEAN_THREAD_BUFFERS -- Summary -- Chapter 8: Mapping Parallel Patterns to TBB -- Parallel Patterns vs. Parallel Algorithms -- Patterns Categorize Algorithms, Designs, etc. -- Patterns That Work -- Data Parallelism Wins -- Nesting Pattern -- Map Pattern -- Workpile Pattern -- Reduction Patterns (Reduce and Scan) -- Fork-Join Pattern -- Divide-and-Conquer Pattern -- Branch-and-Bound Pattern -- Pipeline Pattern -- Event-Based Coordination Pattern (Reactive Streams) -- Summary -- For More Information -- Part 2 -- Chapter 9: The Pillars of Composability -- What Is Composability? -- Nested Composition -- Concurrent Composition -- Serial Composition -- The Features That Make TBB a Composable Library -- The TBB Thread Pool (the Market) and Task Arenas -- The TBB Task Dispatcher: Work Stealing and More -- Putting It All Together -- Looking Forward -- Controlling the Number of Threads -- Work Isolation -- Task-to-Thread and Thread-to-Core Affinity -- Task Priorities -- Summary -- For More Information -- Chapter 10: Using Tasks to Create Your Own Algorithms -- A Running Example: The Sequence -- The High-Level Approach: parallel_invoke -- The Highest Among the Lower: task_group -- The Low-Level Task Interface: Part One - Task Blocking. , The Low-Level Task Interface: Part Two - Task Continuation -- Bypassing the Scheduler -- The Low-Level Task Interface: Part Three - Task Recycling -- Task Interface Checklist -- One More Thing: FIFO (aka Fire-and-Forget) Tasks -- Putting These Low-Level Features to Work -- Summary -- For More Information -- Chapter 11: Controlling the Number of Threads Used for Execution -- A Brief Recap of the TBB Scheduler Architecture -- Interfaces for Controlling the Number of Threads -- Controlling Thread Count with task_scheduler_init -- Controlling Thread Count with task_arena -- Controlling Thread Count with global_control -- Summary of Concepts and Classes -- The Best Approaches for Setting the Number of Threads -- Using a Single task_scheduler_init Object for a Simple Application -- Using More Than One task_scheduler_init Object in a Simple Application -- Using Multiple Arenas with Different Numbers of Slots to Influence Where TBB Places Its Worker Threads -- Using global_control to Control How Many Threads Are Available to Fill Arena Slots -- Using global_control to Temporarily Restrict the Number of Available Threads -- When NOT to Control the Number of Threads -- Figuring Out What's Gone Wrong -- Summary -- Chapter 12: Using Work Isolation for Correctness and Performance -- Work Isolation for Correctness -- Creating an Isolated Region with  this_task_arena::isolate -- Oh No! Work Isolation Can Cause Its Own Correctness Issues! -- Even When It Is Safe, Work Isolation Is Not Free -- Using Task Arenas for Isolation: A Double-Edged Sword -- Don't Be Tempted to Use task_arenas to Create Work Isolation for Correctness -- Summary -- For More Information -- Chapter 13: Creating Thread-to-Core and Task-to-Thread Affinity -- Creating Thread-to-Core Affinity -- Creating Task-to-Thread Affinity -- When and How Should We Use the TBB Affinity Features? -- Summary. , For More Information.

Additional Edition: Print version: Voss, Michael Pro TBB Berkeley, CA : Apress L. P.,c2019 ISBN 9781484243978

Language: English

Subjects: Computer Science

Keywords: Electronic books. ; Electronic books

URL: Click to View

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Full-text  ((OIS Credentials Required))

URL: ProQuest Ebook Central

URL: lizenzpflichtig

UID:

Format: XXIII, 412 S. ; , 24 cm.

ISBN: 0-471-45380-3 , 978-0-471-45380-2 , 0-471-25311-1 , 978-0-470-22626-1

Content: A primer in practical computer security aimed at those shopping, communication, or doing business online. -- almost everyone, in other words. -- P. 4 of cover.

Note: Hier auch später erschienene, unveränderte Nachdrucke

Language: English

Subjects: Computer Science , Economics

Keywords: Datensicherung ; Rechnernetz ; Kryptologie ; Informationssystem ; Computersicherheit ; Informationssystem ; Datenübertragung ; Datensicherung ; Informationssystem ; Kryptologie ; Rechnernetz ; Computersicherheit

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016701326&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016701326&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: http://www.loc.gov/catdir/toc/onix04/00042252.html

URL: http://www.loc.gov/catdir/enhancements/fy0705/00042252-b.html

Author information: Schneier, Bruce 1963-

UID:

Format: 1 online resource (265 pages)

Edition: 1st ed.

ISBN: 3-8394-6905-8

Series Statement: Edition Moderne Postmoderne Series

Content: Wie sieht ethische Verantwortung im Zeitalter der Digitalisierung, Datafizierung und Künstlichen Intelligenz aus? Die Beiträger*innen geben fundierte Einsichten in die KI-gestützte Entscheidungs- und Urteilsfindung. Von der digitalen Operationalisierung über die Rolle des Menschen im Zentrum des technischen Fortschritts bis hin zur Konzeption von vertrauenswürdigen Systemen - im Fokus steht die Diskussion von Chancen und Herausforderungen, die nicht nur Akademiker*innen vielseitige Anregungen zur weiteren Auseinandersetzung mit dem Thema gibt.

Note: Frontmatter -- , Editorial -- , Inhalt -- , Über das Verhältnis von Ethik und Algorithmen -- , Geist, Intelligenz, Information und Daten – Artificial Intelligence im Wandel der Wissenschaftskulturen -- , Moral Decision-Making via AI – deep ethics? About shifting or losing responsibility -- , AI-assisted reflection in child welfare -- , Addressing the needs and demands of child welfare: A connection between AI Ethics and Ethics of Vulnerability -- , Verantwortungsvolle Empfehlungssysteme für die medizinische Diagnostik -- , Zu viel Gewissheit? Herausforderungen künstlich-intelligenter Gesundheitsprädiktionen für die öffentliche Gesundheitsversorgung -- , Algorithmische Differenzierung und Diskriminierung aus Sicht der Menschenwürde -- , Normung und Standardisierung von KI-Systemen aus soziotechnischer Perspektive -- , Vertrauen im Kontext – Messung und Operationalisierung -- , Humaner als der Mensch? Zur sozialen Imagination autonomer Waffentechnik -- , Democratic Autonomy vs. Algorithms? Limits and opportunities for public reasoning -- , Autor*innenverzeichnis

Additional Edition: ISBN 3-8376-6905-X

Language: German

Subjects: Computer Science , General works , Philosophy , Sociology

Keywords: Aufsatzsammlung

DOI: 10.1515/9783839469057

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Volltext  (kostenfrei)

URL: Cover

URL: Cover

URL: lizenzpflichtig

UID:

Format: X, 250 p. , online resource.

ISBN: 9783540389095

Series Statement: Lecture Notes in Computer Science, 175

Note: Instructions and models of algorithm implementation -- The synthesis of algorithms -- The formulation of algorithms synthesis in terms of P-functions -- The synthesis of (or)-interpreted matrix-instructions with disjoint colums -- The synthesis of (or)-interpreted matrix-instructions -- The synthesis of (and)-interpreted matrix-instructions -- A summary and the conclusion of part I -- Representation of instructions by means of parallel flowcharts or of Petri nets -- Synchronous and asynchronous implementation of instructions -- Programmed implementation of instructions -- Microprogrammed implementation of instructions -- A summary and the conclusion of part II -- Laws acting on P-functions -- The multivalued extension of P-functions and of their laws -- The vectorial extension of P-functions and of their laws -- Finite automata, matrix-instructions and speech recognition.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540133582

Language: English

Subjects: Computer Science

DOI: 10.1007/3-540-13358-5

URL: http://dx.doi.org/10.1007/3-540-13358-5

URL: Volltext

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: lizenzpflichtig

UID:

Format: VIII, 142 p. , online resource.

ISBN: 9783540471639

Series Statement: Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, 446

Content: Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a comprehensive discussion of the termination problem in the context of logic programming. Although logic programs pose special difficulties for termination proofs it turns out that automation of this task is obtainable to a much larger degree than for programs in imperative languages. A technique for the automatic derivation of termination proofs is presented in detail. The discussion of several nontrivial examples illustrates its range of applicability. The approach is based on the concept of declarative semantics, and thus makes use of an important feature of logic programming.

Note: Basic notions -- Static program properties and transformations -- Terminating logic programs -- The problem of local variables -- And/or dataflow graphs -- A termination proof procedure -- Integration of unfolding techniques -- Conclusions.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540528371

Language: English

Subjects: Computer Science

Keywords: Hochschulschrift

DOI: 10.1007/3-540-52837-7

URL: http://dx.doi.org/10.1007/3-540-52837-7

URL: Volltext

URL: Volltext

URL: Inhaltstext

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: lizenzpflichtig

URL: Inhaltstext

UID:

Format: IX, 442 p. , online resource.

ISBN: 9783540477952

Series Statement: Lecture Notes in Computer Science, 270

Content: This volume contains 37 invited research papers collected in memory of Dieter Rödding, who is known for his work on the classification of recursive functions, on reduction classes, on the spectrum problem and on the complexity of cardinality quantifiers in predicate logic and in arithmetical hierarchy. He was one of the first to pursue the interaction of logic and computer science. The volume reflects the wide spectrum of Dieter Rödding's scientific interests.

Note: Minimal pairs for polynomial time reducibilities -- Primitive recursive word-functions of one variable -- Existential fixed-point logic -- Unsolvable decision problems for PROLOG programs -- You have not understood a sentence, unless you can prove it -- On the minimality of K, F, and D or: Why löten is non-trivial -- A 5-color-extension-theorem -- Closure relations, Buchberger's algorithm, and polynomials in infinitely many variables -- The benefit of microworlds in learning computer programming -- Skolem normal forms concerning the least fixpoint -- Spectral representation of recursively enumerable and coenumerable predicates -- Aggregating inductive expertise on partial recursive functions -- Domino threads and complexity -- Modelling of cooperative processes -- A setting for generalized computability -- First-order spectra with one variable -- On the early history of register machines -- Randomness, provability, and the separation of Monte Carlo Time and space -- Representation independent query and update operations on propositional definite Horn formulas -- Direct construction of mutually orthogonal latin squares -- Negative results about the length problem -- Some results on the complexity of powers -- The Turing complexity of AF C*-algebras with lattice-ordered KO -- Remarks on SASL and the verification of functional programming languages -- Numerical stability of simple geometric algorithms in the plane -- Communication with concurrent systems via I/0-procedures -- A class of exp-time machines which can be simulated by polytape machines -- ???-Automata realizing preferences -- Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen -- Grammars for terms and automata -- Relative konsistenz -- Segment translation systems -- First steps towards a theory of complexity over more general data structures -- On the power of single-valued nondeterministic polynomial time computations -- A concatenation game and the dot-depth hierarchy -- Do there exist languages with an arbitrarily small amount of context-sensitivity? -- The complexity of symmetric boolean functions.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540181705

Language: English

Subjects: Computer Science

Keywords: Aufsatzsammlung ; Festschrift ; Aufsatzsammlung ; Aufsatzsammlung

DOI: 10.1007/3-540-18170-9

URL: http://dx.doi.org/10.1007/3-540-18170-9

URL: Volltext

URL: Volltext

URL: Cover

URL: Inhaltstext

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: lizenzpflichtig

URL: Inhaltstext

UID:

Format: XIII, 268 p. , online resource.

ISBN: 9783540496755

Series Statement: Lecture Notes in Computer Science, 1043

Content: This book presents five tutorial-style lectures on various approaches to the problem of verifying distributed systems: three chapters concentrate on linear-time or branching-time temporal logics; one addresses process equivalence with an emphasis on infinite-state systems; and the final one presents a novel category-theoretic approach to verification. The various formalisms for expressing properties of concurrent systems, based on automata-theoretic techniques or structural properties, are studied in detail. Much attention is paid to the style of writing and complementary coverage of the relevant issues. Thus these lecture notes are ideally suited for advanced courses on logics for concurrent systems. Equally, they are indispensable reading for anyone researching the area of distributed computing.

Note: Specification Structures and propositions-as-types for concurrency -- Automated temporal reasoning about reactive systems -- Decidability results in automata and process theory -- Modal and temporal logics for processes -- An automata-theoretic approach to linear temporal logic.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540609155

Language: English

Subjects: Computer Science

Keywords: Aufsatzsammlung ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift

DOI: 10.1007/3-540-60915-6

URL: http://dx.doi.org/10.1007/3-540-60915-6

URL: Volltext

URL: Volltext

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: lizenzpflichtig