51 Results for : traversal

  • Thumbnail
    Mobile Hacking
    Mobile Endgeräte, vor allem Smartphones und Tablets der Hersteller Apple und Google, sind inzwischen in fast jedem Haushalt vertreten. Auch in der Firmenwelt nehmen diese Geräte einen immer größeren Stellenwert ein und verarbeiten hochsensible Daten. Diese neuen Einsatzszenarien, gepaart mit Tausenden von Applikationen, schaffen neue Angriffsvektoren und Einfallstore in diese Geräte. Dieses Buch stellt die einzelnen Angriffsszenarien und Schwachstellen in den verwendeten Applikationen detailliert vor und zeigt, wie Sie diese Schwachstellen aufspüren können. Am Beispiel der aktuellen Betriebssysteme (Android, iOS und Windows Mobile) erhalten Sie einen umfassenden Einblick ins Penetration Testing von mobilen Applikationen. Sie lernen typische Penetration-Testing-Tätigkeiten kennen und können nach der Lektüre Apps der großen Hersteller untersuchen und deren Sicherheit überprüfen. Behandelt werden u.a. folgende Themen:- Forensische Untersuchung des Betriebssystems,- Reversing von mobilen Applikationen,- SQL-Injection- und Path-Traversal-Angriffe,- Runtime-Manipulation von iOS-Apps mittels Cycript,- Angriffe auf die HTTPS-Verbindung,- u.v.m.Vorausgesetzt werden fundierte Kenntnisse in Linux/Unix sowie erweiterte Kenntnisse in Java bzw. Objective-C.
    • Shop: buecher
    • Price: 30.80 EUR excl. shipping
  • Thumbnail
    Inter-Asterisk Exchange (Iax): Deployment Scenarios in Sip-Enabled Networks
    Find out how IAX can complement SIP to overcome complications encountered in current SIP-based communications Written by an expert in the field of telecommunications, this book describes the Inter-Asterisk Exchange protocol (IAX) and its operations, discussing the main characteristics of the protocol including NAT traversal, security, IPv6 support, interworking between IPv4 and IPv6, interworking with SIP and many others. The author presents the ways in which IAX can be activated so as to avoid complications such as NAT and the presence of intermediary boxes in operational architectures. This book analytically demonstrates the added values of IAX protocol compared to existing ones, while proposing viable deployment scenarios that assess the behavior of the protocol in operational networks. Key Features: * Promotes a viable alternative protocol to ease deployment of multimedia services * Analyses the capabilities of the IAX protocol and its ability to meet VoIP service provider requirements, and provides scenarios of introducing IAX within operational architectures * Addresses the advantages and disadvantages of SIP, and Details the features of IAX that can help, in junction with SIP, to overcome various disadvantages of SIP * Explores the added values of IAX protocol compared to existing protocols * Discusses the compatibility of new adopted architectures and associated protocols This book will be a valuable reference for service providers, protocol designers, vendors and service implementers. Lecturers and advanced students computer science, electrical engineering and telecoms courses will also find this book of interest.
    • Shop: buecher
    • Price: 138.99 EUR excl. shipping
  • Thumbnail
    Algorithms and Data Structures
    Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java.The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.
    • Shop: buecher
    • Price: 46.99 EUR excl. shipping
  • Thumbnail
    Algorithm Design: Pearson New International Edition
    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 DesignJon Kleinberg and Eva TardosTable of Contents 1 Introduction: Some Representative Problems 1.1 A First Problem: Stable Matching 1.2 Five Representative Problems Solved ExercisesExcercisesNotes and Further Reading2 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 Reading3 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 Reading5 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 ExercisesExercisesNotes and Further Reading7 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 ExercisesExercisesNotes 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 Coloring8.8 Numerical Problems 8.9 Co-NP and the Asymmetry of NP8.10 A Partial Taxonomy of Hard Problems Solved Exercises Exercises Notes and Further Reading9 PSPACE: A Class of Problems Beyond NP9.1 PSPACE 9.2 Some Hard Problems in PSPACE 9.3 Solving Quantified Problems and Games in Polynomial Space9.4 Solving the Planning Problem in Polynomial Space9.5 Proving Problems PSPACE-Complete Solved ExercisesExercisesNotes and Further Reading 10 Extending the Limits of Tractability 10.1 Finding Small Vertex Covers 10.2 Solving NP-Hard Problem on Trees 10.3 Coloring a Set of Circular Arcs *10.4 Tree Decompositions of Graphs *10.5 Constructing a Tree Decomposition Solved Exercises Exercises Notes and Further Reading11 Approximation Algorithms 11.1 Greedy Algorithms and Bounds on the Optimum: A Load Balancing Problem 11.2 The Center Selection Problem 11.3 Set Cover: A General Greedy Heuristic 11.4 The Pricing Method: Vertex Cover 11.5 Maximization via the Pricing method: The Disjoint Paths Problem 11.6 Linear Programming and Rounding: An Application to Vertex Cover *11.7 Load Balancing Revisited: A More Advanced LP Application 11.8 Arbitrarily Good Approximations: the Knapsack Problem Solved ExercisesExercisesNotes and Further Reading 12 Randomized Algorithms 12.1 A First Application: Contention Resolution 12.2 Finding the Global Minimum Cut 12.3 Random Variables and their Expectations 12.4 A Randomized Approximation Algorithm for MAX 3-SAT 12.5 Randomized Divide-and-Conquer: Median-Finding and Quicksort 12.6 Hashing: A Randomized Implementation of Dictionaries 12.7 Finding the Closest Pair of Points: A Randomized Approach 12.8 Randomized Caching 12.9 Chernoff Bounds 12.10 Load Balancing *12.11 Packet Routing 12.12 Background: Some Basic Probability DefinitionsSolved ExercisesExercisesNotes and Further Reading 13 Local Search 13.1 The Landscape of an Optimization Problem 13.2 The Metropolis Algorithm and Simulated Annealing 13.3 An Application of Local Search to Hopfield Neural Networks 13.4 Maximum Cut Approximation via Local Search 13.5 Choosing a Neighbor Relation *13.6 Classification via Local Search 13.7 Best-Response Dynamics and Nash EquilibriaSolved ExercisesExercisesNotes aAugust 6, 2009 Author, Jon Kleinberg, was recently cited in the 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.
    • Shop: buecher
    • Price: 94.99 EUR excl. shipping
  • Thumbnail
    Klaviermusik (solo) Vol.42
    With this issue - No 42 in Leslie Howard's marathon traversal of Liszt's solo piano music - we join Liszt on his fourth 2-CD trip to the opera house to hear music familiar and unfamiliar by Mozart, Meyerbeer, Bellini, Donizetti, Verdi, Auber, Raff and Wagner. Over half of the music (93 minutes of the total 152) has never been recorded before.
    • Shop: odax
    • Price: 21.18 EUR excl. shipping
  • Thumbnail
    Klaviermusik (solo) Vol.57
    Phew! We've made it! It's all over! This final volume (2 discs) of all 19 Hungarian Rhapsodies brings to an end Leslie Howard's marathon traversal of Liszt's complete music for solo piano on 95 CDs. The series has taken almost 14 years to record. There are 1377 tracks altogether, with a total duration of over 117 hours - that is nearly five days' continuous playing time.
    • Shop: odax
    • Price: 28.11 EUR excl. shipping
  • Thumbnail
    The Sonatas And Partitas For Solo Violin
    Mark Kaplan is one of the leading violinists of his generation. He plays a violin made by Antonio Stradivari in 1685, known as the Marquis. This recording is Kaplan's second studio traversal of the Sonatas and Partitas.
    • Shop: odax
    • Price: 14.82 EUR excl. shipping
  • Thumbnail
    Lurid Traversal of Route 7
    No description.
    • Shop: odax
    • Price: 35.77 EUR excl. shipping
  • Thumbnail
    Romantic Tales
    Each composer has a tale to tell, and they make us listen. Chopin writes a 'ballade' without words, returning again and again to the same refrain. He doesn't give us a story-line to follow or tell us what inspired this large-scale, dramatic work- he allows us to fill in the blanks and prepare our own script. Ravel, on the other hand, shares the poetry that inspired the three pieces of 'Gaspard de la Nuit' - the sea-nymph 'Ondine' who tries with her beautiful and seductive singing to lure mortals to her water kingdom- then let's out a shriek of laughter before returning to her palace at the bottom of the ocean. 'Le GIbet' paints a contrasting and much bleaker picture of a doomed man on the scaffold. Ravel makes us feel the eerieness of the dark night and sense the hanged man's limp body swinging back and forth in the wind. Then there is 'Scarbo'- seeming to emerge from the pages of 'Harry Potter.' Scarbo is an elf but a thoroughly bad elf, always causing mischief and chaos wherever he goes. Quite an amazing assortment of characters! Prokofiev supplies a brief interlude with a transcription of a prelude and fugue written for the organ by Buxtehude - a favorite from his student days. He transcribed this piece and shortened it during his period in America, planning to use it in his American concerts. The question remains as to why he took out the difficult middle section and the complicated bits- did he think that American audiences weren't sophisticated enough to understand the really complicated stuff? The first work that Prokofiev wrote after he arrived in America in 1918 (after missing the Russian Revolution in his homeland) was his delightful 'Tales of the Old Grandmother'- four brief tales, told by a confused and rather senile old woman, who sometimes revealed flashes of clarity with her magical stories. By the way, Prokofiev thought No. 4 was the best one of the lot- I find all of them delightful! Another Russian, Alexander Scriabin also has a tale to tell with his impassioned one-movement Fifth Sonata. He seems to journey right to the edge of a steep cliff, begging us to come right along with him. Contrasts are extreme and the gamut of emotions are wide. This man was intense!! Scriabin wrote that ecstasy 'was the ultimate answer to all questions and all activity of mind and body.' After the intensity of Scriabin and before plunging into the manic world of Schumann, Mendelssohn returns us to innocence with his charming Etude in F major- uncomplicated fun and thoroughly delightful! The G minor Sonata was a favorite of Schumann's wife, Clara and she loved performing this work. We feel Schumann's energy and vitality, and the first movement was written to show off Clara's virtuosity. He writes that the first movement should be played 'as fast as possible' and later on says 'faster' and by the coda writes again 'still faster.' He gives us some rest with the lyrical Second movement, and follows this with a gruff, three-part scherzo. Clara didn't like the original finale so Robert wrote another one for her- a virtuosic rondo with two themes that ends with a coda marked 'always faster and faster.' As an encore, Rachmaninoff's poignant Prelude in Gb completes our journey. With this dirge-like composition, this Russian explores his deep dark soul Ah, the wonderful places we can travel with these composers!! "An amazing traversal of many of the monuments of the solo piano literature. Nissman's intelligence, ardor, and versatility all recommend themselves to a listener. I wish I could adequately convey Nissman's ability to make the piano sing. It's the key to her magnificent Chopin, Liszt, and Rachmaninoff. It's never over-the-top or swooningly sentimental. I might call it 'chaste,' if that word didn't imply 'passionless,' which it certainly is not. It puts me in mind of Hofmannsthal's Marschalin - patrician, clear-eyed. " "This is bravura writing at it's most virtuosic and Nissman meets it head on with stunning bravura." "So Nissman gives us fine accounts of Chopin and Rachmaninoff, delights us in Prokofieff and Mendelssohn, and opens up eyes in Ravel and Schumann. I wonder what she'll do next? I can't wait."
    • Shop: odax
    • Price: 29.30 EUR excl. shipping
  • Thumbnail
    Romantic Piano Concerto Vol.36
    Howard Shelley's third disc in Hyperion's traversal of the complete extant piano concertos by Ignaz Moscheles brings us triumphant performances of the fourth and fifth concertos which are complemented by a spirited rendition of the Recollections of Ireland, composed almost by way of thanks for divine deliverance from a storm-tossed crossing of the Irish Sea in 1826.
    • Shop: odax
    • Price: 16.40 EUR excl. shipping

Similar searches: