€ 16.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

Comprehensive survey of artificial intelligence -- the study of how computers can be made to act intelligently. Includes introductory and advanced material. Extensive notes updating the main text. 132 illustrations.

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 43.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

A recent survey stated that 52% of embedded projects are late by 4-5 months. This book can help get those projects in on-time with design patterns. The author carefully takes into account the special concerns found in designing and developing embedded applications specifically concurrency, communication, speed, and memory usage. Patterns are given in UML (Unified Modeling Language) with examples including ANSI C for direct and practical application to C code. A basic C knowledge is a prerequisite for the book while UML notation and terminology is included. General C programming books do not include discussion of the contraints found within embedded system design. The practical examples give the reader an understanding of the use of UML and OO (Object Oriented) designs in a resource-limited environment. Also included are two chapters on state machines. The beauty of this book is that it can help you today. . Design Patterns within these pages are immediately applicable to your project Addresses embedded system design concerns such as concurrency, communication, and memory usage Examples contain ANSI C for ease of use with C programming code

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 130.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

Algebraic Cryptanalysis bridges the gap between a course in cryptography, and being able to read the cryptanalytic literature. This book is divided into three parts: Part One covers the process of turning a cipher into a system of equations; Part Two covers finite field linear algebra; Part Three covers the solution of Polynomial Systems of Equations, with a survey of the methods used in practice, including SAT-solvers and the methods of Nicolas Courtois. Topics include: Analytic Combinatorics, and its application to cryptanalysis The equicomplexity of linear algebra operations Graph coloring Factoring integers via the quadratic sieve, with its applications to the cryptanalysis of RSA Algebraic Cryptanalysis is designed for advanced-level students in computer science and mathematics as a secondary text or reference book for self-guided study. This book is suitable for researchers in Applied Abstract Algebra or Algebraic Geometry who wish to find more applied topics or practitioners working for security and communications companies.

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 107.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

This handbook provides a unique and in-depth survey of the current state-of-the-art in software engineering, covering its major topics, the conceptual genealogy of each subfield, and discussing future research directions. Subjects include foundational areas of software engineering (e.g. software processes, requirements engineering, software architecture, software testing, formal methods, software maintenance) as well as emerging areas (e.g., self-adaptive systems, software engineering in the cloud, coordination technology). Each chapter includes an introduction to central concepts and principles, a guided tour of seminal papers and key contributions, and promising future research directions. The authors of the individual chapters are all acknowledged experts in their field and include many who have pioneered the techniques and technologies discussed. Readers will find an authoritative and concise review of each subject, and will also learn how software engineering technologies have evolved and are likely to develop in the years to come. This book will be especially useful for researchers who are new to software engineering, and for practitioners seeking to enhance their skills and knowledge.

Anbieter: buecher.de

Stand: Jan 17, 2019 Zum Angebot

Stand: Jan 17, 2019 Zum Angebot

€ 88.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience. In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience. In 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory´s seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session. 50 Years of Integer Programming offers an account of featured talks at the 2008 Aussois workshop, namely - Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli: Polyhedral Approaches to Mixed Integer Linear Programming - William Cook: 50+ Years of Combinatorial Integer Programming - Francois Vanderbeck and Laurence A. Wolsey: Reformulation and Decomposition of Integer Programs The book contains reprints of key historical articles together with new introductions and historical perspectives by the authors: Egon Balas, Michel Balinski, Jack Edmonds, Ralph E. Gomory, Arthur M. Geoffrion, Alan J. Hoffman & Joseph B. Kruskal, Richard M. Karp, Harold W. Kuhn, and Ailsa H. Land & Alison G. Doig. It also contains written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community: - Friedrich Eisenbrand: Integer Programming and Algorithmic Geometry of Numbers - Raymond Hemmecke, Matthias Köppe, Jon Lee, and Robert Weismantel: Nonlinear Integer Programming - Andrea Lodi: Mixed Integer Programming Computation - Francois Margot: Symmetry in Integer Linear Programming - Franz Rendl: Semidefinite Relaxations for Integer Programming - Jean-Philippe P. Richard and Santanu S. Dey: The Group-Theoretic Approach to Mixed Integer Programming Integer programming holds great promise for the future, and continues to build on its foundations. Indeed, Gomory´s finite cutting-plane method for the pure integer case is currently being reexamined and is showing new promise as a practical computational method. This book is a uniquely useful celebration of the past, present and future of this important and active field. Ideal for students and researchers in mathematics, computer science and operations research, it exposes mathematical optimization, in particular integer programming and combinatorial optimization, to a broad audience.

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 54.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

For courses in Image Processing and Computer Vision. Introduce your students to image processing with the industry´s most prized text For 40 years, Image Processing has been the foundational text for the study of digital image processing. The book is suited for students at the college senior and first-year graduate level with prior background in mathematical analysis, vectors, matrices, probability, statistics, linear systems, and computer programming. As in all earlier editions, the focus of this edition of the book is on fundamentals. The 4th Edition, which celebrates the book´s 40th anniversary, is based on an extensive survey of faculty, students, and independent readers in 150 institutions from 30 countries. Their feedback led to expanded or new coverage of topics such as deep learning and deep neural networks, including convolutional neural nets, the scale-invariant feature transform (SIFT), maximally-stable extremal regions (MSERs), graph cuts, k-means clustering and superpixels, active contours (snakes and level sets), and exact histogram matching. Major improvements were made in reorganizing the material on image transforms into a more cohesive presentation, and in the discussion of spatial kernels and spatial filtering. Major revisions and additions were made to examples and homework exercises throughout the book.

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 52.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

Can computers change what you think and do? Can they motivate you to stop smoking, persuade you to buy insurance, or convince you to join the Army? ´´Yes, they can,´´ says Dr. B.J. Fogg, director of the Persuasive Technology Lab at Stanford University. Fogg has coined the phrase ´´Captology´´(an acronym for computers as persuasive technologies) to capture the domain of research, design, and applications of persuasive computers.In this thought-provoking book, based on nine years of research in captology, Dr. Fogg reveals how Web sites, software applications, and mobile devices can be used to change people´s attitudes and behavior. Technology designers, marketers, researchers, consumers-anyone who wants to leverage or simply understand the persuasive power of interactive technology-will appreciate the compelling insights and illuminating examples found inside. Persuasive technology can be controversial-and it should be. Who will wield this power of digital influence? And to what end? Now is the time to survey the issues and explore the principles of persuasive technology, and B.J. Fogg has written this book to be your guide. Filled with key term definitions in persuasive computing Provides frameworks for understanding this domain Describes real examples of persuasive technologies

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 42.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

´´. . .the best introduction to cryptography I´ve ever seen. . . .The book the National Security Agency wanted never to be published. . . .´´ -Wired Magazine ´´. . .monumental . . . fascinating . . . comprehensive . . . the definitive work on cryptography for computer programmers . . .´´ -Dr. Dobb´s Journal ´´. . .easily ranks as one of the most authoritative in its field.´´ -PC Magazine ´´. . .the bible of code hackers.´´ -The Millennium Whole Earth Catalog This new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography-the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. What´s new in the Second Edition? * New information on the Clipper Chip, including ways to defeat the key escrow mechanism * New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher * The latest protocols for digital signatures, authentication, secure elections, digital cash, and more * More detailed information on key management and cryptographic implementations

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 87.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

The 12th International Symposium on Graph Drawing (GD 2004)was held d- ing September 29 October 2, 2004, at City College, CUNY, in the heart of Harlem, New York City. GD 2004 attracted 94 participants from 19 countries. In response to the call for papers, the program committee received 86 re- larsubmissionsdescribingoriginalresearchand/orsystemdemonstrations.Each submissionwasreviewedbyatleastthreeprogramcommitteemembersandc- ments were returned to the authors. Following extensive e-mail discussions, the program committee accepted 39 long papers (11 pages each in the proceedings) and 12 short papers (6 pages each). In addition, 4 posters were displayed and discussed in the conference exhibition room (2 pages each in the proceedings). Theprogramcommittee ofGD 2004invitedtwo distinguishedlecturers.P- fessorPaulSeymourfromPrincetonUniversitypresenteda newcharacterization ofclaw-freegraphs(jointworkwithMariaChudnovsky).ProfessorErikDemaine from MIT reported on his joint work with Fedor Fomin, MohammadTaghi - jiaghayi and Dimitrios Thilikos, concerning fast (often subexponential) ?x- parameter algorithms and polynomial approximation schemes for broad classes of NP-hard problems in topological graph theory. A survey of the subject by Professors Demaine and Hajiaghayi is included in this volume. As usual, the annual graph drawing contest was held during the conference. This time the contest had two distinct tracks: the graph drawing challenge and the freestyle contest. A report is included in the proceedings.

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot

€ 99.99 *

ggf. zzgl. Versand

ggf. zzgl. Versand

August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. Features + Benefits Focus on problem analysis and design techniques. Discussion is grounded in concrete problems and examples rather than abstract presentation of principles, with representative problems woven throughout the text. Over 200 well crafted problems from companies such as Yahoo!® and Oracle®. Each problem has been class tested for usefulness and accuracy in the authors´ own undergraduate algorithms courses. Broad coverage of algorithms for dealing with NP-hard problems and the application of randomization, increasingly important topics in algorithms. Algorithm Design Jon Kleinberg and Eva Tardos Table of Contents 1 Introduction: Some Representative Problems 1.1 A First Problem: Stable Matching 1.2 Five Representative Problems Solved Exercises Excercises Notes and Further Reading 2 Basics of Algorithms Analysis 2.1 Computational Tractability 2.2 Asymptotic Order of Growth Notation 2.3 Implementing the Stable Matching Algorithm using Lists and Arrays 2.4 A Survey of Common Running Times 2.5 A More Complex Data Structure: Priority Queues Solved Exercises Exercises Notes and Further Reading 3 Graphs 3.1 Basic Definitions and Applications 3.2 Graph Connectivity and Graph Traversal 3.3 Implementing Graph Traversal using Queues and Stacks 3.4 Testing Bipartiteness: An Application of Breadth-First Search 3.5 Connectivity in Directed Graphs 3.6 Directed Acyclic Graphs and Topological Ordering Solved Exercises Exercises Notes and Further Reading 4 Divide and Conquer 4.1 A First Recurrence: The Mergesort Algorithm 4.2 Further Recurrence Relations 4.3 Counting Inversions 4.4 Finding the Closest Pair of Points 4.5 Integer Multiplication 4.6 Convolutions and The Fast Fourier Transform Solved Exercises Exercises Notes and Further Reading 5 Greedy Algorithms 5.1 Interval Scheduling: The Greedy Algorithm Stays Ahead 5.2 Scheduling to Minimize Lateness: An Exchange Argument 5.3 Optimal Caching: A More Complex Exchange Argument 5.4 Shortest Paths in a Graph 5.5 The Minimum Spanning Tree Problem 5.6 Implementing Kruskal´s Algorithm: The Union-Find Data Structure 5.7 Clustering 5.8 Huffman Codes and the Problem of Data Compression *5.9 Minimum-Cost Arborescences: A Multi-Phase Greedy Algorithm Solved Exercises Excercises Notes and Further Reading 6 Dynamic Programming 6.1 Weighted Interval Scheduling: A Recursive Procedure 6.2 Weighted Interval Scheduling: Iterating over Sub-Problems 6.3 Segmented Least Squares: Multi-way Choices 6.4 Subset Sums and Knapsacks: Adding a Variable 6.5 RNA Secondary Structure: Dynamic Programming Over Intervals 6.6 Sequence Alignment 6.7 Sequence Alignment in Linear Space 6.8 Shortest Paths in a Graph 6.9 Shortest Paths and Distance Vector Protocols *6.10 Negative Cycles in a Graph Solved Exercises Exercises Notes and Further Reading 7 Network Flow 7.1 The Maximum Flow Problem and the Ford-Fulkerson Algorithm 7.2 Maximum Flows and Minimum Cuts in a Network 7.3 Choosing Good Augmenting Paths *7.4 The Preflow-Push Maximum Flow Algorithm 7.5 A First Application: The Bipartite Matching Problem 7.6 Disjoint Paths in Directed and Undirected Graphs 7.7 Extensions to the Maximum Flow Problem 7.8 Survey Design 7.9 Airline Scheduling 7.10 Image Segmentation 7.11 Project Selection 7.12 Baseball Elimination *7.13 A Further Direction: Adding Costs to the Matching Problem Solved Exercises Exercises Notes and Further Reading 8 NP and Computational Intractability 8.1 Polynomial-Time Reductions 8.2 Reductions via ´´Gadgets´´: The Satisfiability Problem 8.3 Efficient Certification and the Definition of NP 8.4 NP-Complete Problems 8.5 Sequencing Problems 8.6 Partitioning Problems 8.7 Graph Coloring 8.8 Numerical Problems 8.9 Co-NP and the Asymmetry of NP 8.10 A Partial Taxonomy of Hard Problems Solved Exercises Exercises Notes and Further Reading 9 PSPACE: A Class of Problems Beyond NP 9.1 PSPACE 9.2 Some Hard Problems in PSPACE 9.3 Solving Quantified Problems and Games in Polynomial Space 9.4 Solving the Planning

Anbieter: buecher.de

Stand: Jan 16, 2019 Zum Angebot

Stand: Jan 16, 2019 Zum Angebot