Kooperativer Bibliotheksverbund

UID:

Umfang: 894 Seiten : , Illustrationen, Diagramme.

Ausgabe: 6., aktualisierte Auflage

ISBN: 978-3-86894-237-8 , 3-86894-237-8

Serie: it - Informatik

Originaltitel: Computer networking

Anmerkung: Hier auch später erschienene, unveränderte Nachdrucke. - Auf dem Umschag: Extras online

Weitere Ausg.: Erscheint auch als Online-Ausgabe ISBN 978-3-86326-686-8

Sprache: Deutsch

Fachgebiete: Informatik , Wirtschaftswissenschaften

Schlagwort(e): Rechnernetz ; Internet ; Faseroptik ; Netzwerk ; Kommunikationsprotokoll ; Computer ; Transportschicht ; Lehrbuch ; Lehrbuch

URL: Inhaltstext

URL: Inhaltsverzeichnis

URL: Klappentext

URL: Inhaltstext

URL: Inhaltsverzeichnis

URL: Klappentext

Mehr zum Autor: Ross, Keith W. 1956-

Mehr zum Autor: Kurose, James F. 1956-

UID:

Umfang: 1 online resource (807 pages)

Ausgabe: 1st ed.

ISBN: 9781484243985

Anmerkung: 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.

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

Sprache: Englisch

Fachgebiete: Informatik

Schlagwort(e): 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:

Umfang: xv, 607 Seiten : , Illustrationen, Diagramme.

Ausgabe: Second edition

ISBN: 978-1-0716-1417-4 , 978-1-0716-1420-4 , 1-0716-1417-7

Serie: Springer texts in statistics

Inhalt: An Introduction to Statistical Learning provides an accessible overview of the field of statistical learning, an essential toolset for making sense of the vast and complex data sets that have emerged in fields ranging from biology to finance to marketing to astrophysics in the past twenty years. This book presents some of the most important modeling and prediction techniques, along with relevant applications. Topics include linear regression, classification, resampling methods, shrinkage approaches, tree-based methods, support vector machines, clustering, deep learning, survival analysis, multiple testing, and more. Color graphics and real-world examples are used to illustrate the methods presented. Since the goal of this textbook is to facilitate the use of these statistical learning techniques by practitioners in science, industry, and other fields, each chapter contains a tutorial on implementing the analyses and methods presented in R, an extremely popular open source statistical software platform.

Weitere Ausg.: Erscheint auch als Online-Ausgabe ISBN 978-1-4614-7138-7

Weitere Ausg.: Erscheint auch als Online-Ausgabe ISBN 978-1-0716-1418-1

Sprache: Englisch

Fachgebiete: Informatik , Wirtschaftswissenschaften , Mathematik , Psychologie , Soziologie

Schlagwort(e): Statistik ; R ; Statistik ; Maschinelles Lernen ; Lehrbuch ; Einführung

URL: Inhaltsverzeichnis

URL: Inhaltsverzeichnis

URL: Inhaltsverzeichnis

URL: Inhaltsverzeichnis

Mehr zum Autor: Hastie, Trevor 1953-

Mehr zum Autor: Tibshirani, Robert 1956-

UID:

Umfang: 735 Seiten , Illustrationen, Diagramme

Ausgabe: 13th edition, global edition

ISBN: 1292263423 , 9781292263427

Anmerkung: Authorized adaptation from the United Stated edition, entitled Computer Science: An overview, 13th edition, ISBN 978-0-13-487546-0, by J. Glenn Brookshear and Dennis Brylow, published by Person Education © 2019

Weitere Ausg.: Äquivalent

Weitere Ausg.: Erscheint auch als Online-Ausgabe 978-1-292-26344-1

Sprache: Englisch

Fachgebiete: Informatik

Schlagwort(e): Informatik ; Informatik ; Lehrbuch ; Einführung ; Einführung ; Lehrbuch

URL: Inhaltsverzeichnis

UID:

Umfang: VIII, 188 p. , online resource.

ISBN: 9783540478461

Serie: Lecture Notes in Computer Science, 273

Inhalt: This book presents developments of a language independent theory of program structure. The theory features a simple, natural notion of control structure which is much broader than in other theories of programming languages such as denotational semantics and program schemes. This notion permits treatment of control structures which involve not only the denotation of programs (i.e., their input/output behavior), but also their structure, size, run times, etc. The theory also treats the relation of control structure and complexity properties of programming languages. The book focuses on expressive interdependencies of control structures (which control structures can be expressed by which others). A general method of proving control structures expressively independent is developed. The book also considers characterizations of the expressive power of general purpose programming languages in terms of control structures. Several new characterizations are presented and two compactness results for such characterizations are shown.

Anmerkung: Motivations, background, and basic definitions -- Effective numberings, completions, and control structures -- Some special effective numberings -- Characterizations of acceptability -- Independence of control structures -- General programming properties of effective numberings of subrecursive classes.

In: Springer eBooks

Weitere Ausg.: Printed edition: ISBN 9783540182535

Sprache: Englisch

Fachgebiete: Informatik

Schlagwort(e): Hochschulschrift ; Hochschulschrift

DOI: 10.1007/3-540-18253-5

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

URL: Volltext

URL: Volltext

URL: Inhaltstext

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: lizenzpflichtig

URL: Inhaltstext

UID:

Umfang: II, 197 p. , online resource.

ISBN: 9783540384311

Serie: Lecture Notes in Computer Science, 102

Anmerkung: Algebraic computations -- Coates' algorithm -- Risch's theorem -- The problem of torsion divisors -- Gauss-Manin operators -- Elliptic integras concluded -- Curves over algebaic number fields.

In: Springer eBooks

Weitere Ausg.: Printed edition: ISBN 9783540102908

Sprache: Englisch

Fachgebiete: Informatik

DOI: 10.1007/3-540-10290-6

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

URL: Volltext

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: lizenzpflichtig

UID:

Umfang: XII, 1070 S. : , graph. Darst.

ISBN: 3-540-40464-3

Anmerkung: 2. Aufl. mehrbändig erschienen

Sprache: Deutsch

Fachgebiete: Informatik , Wirtschaftswissenschaften , Biologie

Schlagwort(e): Statistik ; Datenverarbeitung ; Statistik ; Numerisches Verfahren ; Statistik

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

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

URL: Inhaltsverzeichnis

URL: Kapitel 1

URL: Cover

URL: Inhaltstext

URL: Inhaltstext

URL: http://www.xplore-stat.de/ebooks/ebooks.html

URL: http://www.loc.gov/catdir/enhancements/fy0817/2004106523-d.html

Mehr zum Autor: Gentle, James E. 1943-

UID:

Umfang: XVI, 601 S. : zahlr. graph. Darst.

ISBN: 3-446-17520-2

Originaltitel: Object-oriented modelling and design

Sprache: Deutsch

Fachgebiete: Informatik

Schlagwort(e): Systementwicklung ; Objektorientierung ; Objektorientierte Programmierung ; Softwareentwicklung ; Datenmodell ; Objektorientierung ; Aufgabensammlung ; Aufgabensammlung ; Aufgabensammlung

Mehr zum Autor: Rumbaugh, James 1947-

UID:

Umfang: XVIII, 475 S. : Ill.

Ausgabe: 2. ed.

ISBN: 0-321-26797-4 , 978-0-321-26797-9

Serie: The Addison-Wesley object technology series

Anmerkung: Includes index. - Nebentitel: UML: the unified modeling language user guide

Sprache: Englisch

Fachgebiete: Informatik

Schlagwort(e): UML ; Softwareentwicklung ; Computergrafik

Mehr zum Autor: Rumbaugh, James, 1947-

Mehr zum Autor: Jacobson, Ivar, 1939-

Mehr zum Autor: Booch, Grady, 1955-

UID:

Umfang: XX, 412 S. : , zahlr. graph. Darst.

ISBN: 0-13-720871-5

Serie: James Martin books

Sprache: Englisch

Fachgebiete: Informatik , Wirtschaftswissenschaften

Schlagwort(e): Programmierung ; Objektorientierte Programmierung

Mehr zum Autor: Martin, James 1933-2013