The legacy of the Roman emperor Augustus and the culture of his age was profound and immediately evident after his death in 14 CE. His first four successors based their claims to rule on kinship with him, thus establishing the Julio-Claudian dynasty (14–68 CE), and plied an evolving form of the Principate, the political arrangement Augustus carved out for himself. His building and restoration programs gave the city an “Augustan” appearance that remained relatively unchanged throughout subsequent reigns. And, among literary luminaries of his age, figures such as Horace and Ovid left an indelible mark on the poetic practices of future generations while Virgil insinuated himself still more deeply into the Roman psyche. But it was after the reigns of Augustus’ own descendants, oddly enough, that we witness the most spirited and thoroughgoing engagement with the Augustan past; during the reign of the emperor Domitian, the third and last ruler of the subsequent Flavian dynasty (81–96 CE), there was a veritable Augustan renaissance. This volume represents the first book-length treatment of the reception of Augustus and his age during the reign of Domitian. Its thirteen chapters, authored by an international group of scholars, offer readers a glimpse into the fascinating history and culture of Domitian’s Rome and its multifaceted engagement with the Augustan past. Combining material and literary cultural approaches and covering a diverse range of topics—art, architecture, literature, history, law—the studies in this volume capture the rich complexity of the Augustan legacy in Domitian’s Rome while also revising our understanding of Domitian’s own legacy. Far from being the cruel tyrant history has made him out to be, Domitian emerges as a studious, thoughtful cultivator of the Augustan past who helped shape an age that not only took inspiration from that past, but managed to rival it.
Advanced Algorithms and Data Structures introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. Summary As a software engineer, you’ll encounter countless programming challenges that initially seem confusing, difficult, or even impossible. Don’t despair! Many of these “new” problems already have well-established solutions. Advanced Algorithms and Data Structures teaches you powerful approaches to a wide range of tricky coding challenges that you can adapt and apply to your own applications. Providing a balanced blend of classic, advanced, and new algorithms, this practical guide upgrades your programming toolbox with new perspectives and hands-on techniques. Purchase of the print book includes a free eBook in PDF, Kindle, and ePub formats from Manning Publications. About the technology Can you improve the speed and efficiency of your applications without investing in new hardware? Well, yes, you can: Innovations in algorithms and data structures have led to huge advances in application performance. Pick up this book to discover a collection of advanced algorithms that will make you a more effective developer. About the book Advanced Algorithms and Data Structures introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. You’ll discover cutting-edge approaches to a variety of tricky scenarios. You’ll even learn to design your own data structures for projects that require a custom solution. What's inside Build on basic data structures you already know Profile your algorithms to speed up application Store and query strings efficiently Distribute clustering algorithms with MapReduce Solve logistics problems using graphs and optimization algorithms About the reader For intermediate programmers. About the author Marcello La Rocca is a research scientist and a full-stack engineer. His focus is on optimization algorithms, genetic algorithms, machine learning, and quantum computing. Table of Contents 1 Introducing data structures PART 1 IMPROVING OVER BASIC DATA STRUCTURES 2 Improving priority queues: d-way heaps 3 Treaps: Using randomization to balance binary search trees 4 Bloom filters: Reducing the memory for tracking content 5 Disjoint sets: Sub-linear time processing 6 Trie, radix trie: Efficient string search 7 Use case: LRU cache PART 2 MULTIDEMENSIONAL QUERIES 8 Nearest neighbors search 9 K-d trees: Multidimensional data indexing 10 Similarity Search Trees: Approximate nearest neighbors search for image retrieval 11 Applications of nearest neighbor search 12 Clustering 13 Parallel clustering: MapReduce and canopy clustering PART 3 PLANAR GRAPHS AND MINIMUM CROSSING NUMBER 14 An introduction to graphs: Finding paths of minimum distance 15 Graph embeddings and planarity: Drawing graphs with minimal edge intersections 16 Gradient descent: Optimization problems (not just) on graphs 17 Simulated annealing: Optimization beyond local minima 18 Genetic algorithms: Biologically inspired, fast-converging optimization
Don’t be perplexed by data structures! This fun, friendly, and fully illustrated guide makes it easy to learn useful data structures you’ll put to work every day. Grokking Data Structures makes it a breeze to learn the most useful day-to-day data structures. You’ll follow a steady learning path from absolute basics to advanced concepts, all illustrated with fun examples, engaging industry stories, and hundreds of graphics and cartoons. In Grokking Data Structures you’ll learn how to: • Understand the most important and widely used data structures • Identify use cases where data structures make the biggest difference • Pick the best data structure solution for a coding challenge • Understand the tradeoffs of data structures and avoid catastrophes • Implement basic data collections like arrays, linked lists, stacks, and priority queues • Use trees and binary search trees (BSTs) to organize data • Use graphs to model relationships and learn about complex data • Efficiently search by key using hash tables and hashing functions • Reason about time and memory requirements of operations on data structures Grokking Data Structures carefully guides you from the most basic data structures like arrays or linked lists all the way to powerful structures like graphs. It’s perfect for beginners, and you won’t need anything more than high school math to get started. Each data structure you encounter comes with its own complete Python implementation so you can start experimenting with what you learn right away. Foreword by Daniel Zingaro. Purchase of the print book includes a free eBook in PDF and ePub formats from Manning Publications. About the technology Data structures are vital for shaping and handling your data organization. They’re also an important part of most IT job interviews! Whether you’re new to data structures or just dusting off what you learned in school, this book will get you up to speed fast with no advanced math, abstract theory, or complicated proofs. About the book Grokking Data Structures introduces common and useful data structures that every developer needs to know. Real-world examples show you how data structures are used in practice, from making your searches faster to handling triage in an emergency room. You’ll love the fun cartoons, insightful stories, and useful Python code samples that make data structures come alive. And unlike jargon-laden academic texts, this book is easy-to-read and practical. What's inside • Fast searches using hash tables • Trees and binary search trees (BSTs) to organize data • Use graphs to model complex data • The best data structures for a coding challenge About the reader For readers who know the basics of Python. A perfect companion to Grokking Algorithms! About the author Marcello La Rocca is a research scientist and a full-stack engineer. He has contributed to large-scale web applications and machine learning infrastructure at Twitter, Microsoft, and Apple. The technical editor on this book was Beau Carnes. Table of Contents 1 Introducing data structures: Why you should learn about data structures 2 Static arrays: Building your first data structure 3 Sorted arrays: Searching faster, at a price 4 Big-O notation: A framework for measuring algorithm efficiency 5 Dynamic arrays: Handling dynamically sized datasets 6 Linked lists: A flexible dynamic collection 7 Abstract data types: Designing the simplest container—the bag 8 Stacks: Piling up data before processing it 9 Queues: Keeping information in the same order as it arrives 10 Priority queues and heaps: Handling data according to its priority 11 Binary search trees: A balanced container 12 Dictionaries and hash tables: How to build and use associative arrays 13 Graphs: Learning how to model complex relationships in data
This first book to critically summarize the latest achievements and emerging applications within this interdisciplinary topic focuses on one of the most important types of detectors for elementary particles and photons: resistive plate chambers (RPCs). In the first part, the outstanding, international team of authors comprehensively describes and presents the features and design of single and double-layer RPCs before covering more advanced multi-layer RPCs. The second part then focuses on the application of RPCs in high energy physics, materials science, medicine and security. Throughout, the experienced authors adopt a didactic approach, with each subject presented in a simple way, increasing in complexity step by step.
This book introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. Youll discover cutting-edge approaches to a variety of tricky scenarios. --
Don’t be perplexed by data structures! This fun, friendly, and fully illustrated guide makes it easy to learn useful data structures you’ll put to work every day. Grokking Data Structures makes it a breeze to learn the most useful day-to-day data structures. You’ll follow a steady learning path from absolute basics to advanced concepts, all illustrated with fun examples, engaging industry stories, and hundreds of graphics and cartoons. In Grokking Data Structures you’ll learn how to: • Understand the most important and widely used data structures • Identify use cases where data structures make the biggest difference • Pick the best data structure solution for a coding challenge • Understand the tradeoffs of data structures and avoid catastrophes • Implement basic data collections like arrays, linked lists, stacks, and priority queues • Use trees and binary search trees (BSTs) to organize data • Use graphs to model relationships and learn about complex data • Efficiently search by key using hash tables and hashing functions • Reason about time and memory requirements of operations on data structures Grokking Data Structures carefully guides you from the most basic data structures like arrays or linked lists all the way to powerful structures like graphs. It’s perfect for beginners, and you won’t need anything more than high school math to get started. Each data structure you encounter comes with its own complete Python implementation so you can start experimenting with what you learn right away. Foreword by Daniel Zingaro. Purchase of the print book includes a free eBook in PDF and ePub formats from Manning Publications. About the technology Data structures are vital for shaping and handling your data organization. They’re also an important part of most IT job interviews! Whether you’re new to data structures or just dusting off what you learned in school, this book will get you up to speed fast with no advanced math, abstract theory, or complicated proofs. About the book Grokking Data Structures introduces common and useful data structures that every developer needs to know. Real-world examples show you how data structures are used in practice, from making your searches faster to handling triage in an emergency room. You’ll love the fun cartoons, insightful stories, and useful Python code samples that make data structures come alive. And unlike jargon-laden academic texts, this book is easy-to-read and practical. What's inside • Fast searches using hash tables • Trees and binary search trees (BSTs) to organize data • Use graphs to model complex data • The best data structures for a coding challenge About the reader For readers who know the basics of Python. A perfect companion to Grokking Algorithms! About the author Marcello La Rocca is a research scientist and a full-stack engineer. He has contributed to large-scale web applications and machine learning infrastructure at Twitter, Microsoft, and Apple. The technical editor on this book was Beau Carnes. Table of Contents 1 Introducing data structures: Why you should learn about data structures 2 Static arrays: Building your first data structure 3 Sorted arrays: Searching faster, at a price 4 Big-O notation: A framework for measuring algorithm efficiency 5 Dynamic arrays: Handling dynamically sized datasets 6 Linked lists: A flexible dynamic collection 7 Abstract data types: Designing the simplest container—the bag 8 Stacks: Piling up data before processing it 9 Queues: Keeping information in the same order as it arrives 10 Priority queues and heaps: Handling data according to its priority 11 Binary search trees: A balanced container 12 Dictionaries and hash tables: How to build and use associative arrays 13 Graphs: Learning how to model complex relationships in data
Catalogo della mostra di Siena, Magazzini del Sale (19 luglio-15 settembre 1996). Marcello Jori ha tracciato i confini di quella che è stata definita "zona protetta" per artisti viventi e leggendari, da lui personalmente selezionati, invitati e ritratti. Intorno al corpo di ogni artista ha progettato la forma architettonica dell'abitazione che il soggetto occupa nella città meravigliosa. Gli "abitanti" di questa città sono fino ad oggi: Giulio Paolini, Tony Cragg, Mario Merz, Morimura, Gerhard Richter, Luigi Ontani, Hermann Nitsch, Julian Schnabel, Sigmar Polke, Anselm Kiefer, Enzo Cucchi, Salvo, Mimmo Paladino, Alessandro Mendini, Peter Halley, Gilbert & George.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.