New release in this series of beloved colouring books. Follow us into a world of fantasy and fantastic creatures!Over 100 pages! Extra thick colouring book with hundreds of different designs.Out now: The Ultimate Christmas Colouring and The Ultimate Christmas Activity book. Get into the Christmas spirit!A wonderful and personal little present and the perfect activities when Christmas can‘t come fast enough.black and white insidedesigned to build up confidence and improve fine motor skills and handwritingsuitable for children ages 4 to at least 10designs in various skill levelsincreasing complexity and different picture styles keep it fun and interestingFind all JD Evers children’s stories, colouring & activity books and the bullet book notebook series by clicking on the author‘s name under the book title;Stay informed about new releases by clicking the {+Follow} button under the book picture.Also available for children:The Ultimate Colouring Book for BoysThe Ultimate Colouring Book for Girls The Ultimate Colouring Book – Heavy Duty & Transportation (Cars, Trucks, Boats, Trains, Planes and all kinds of Vehicles)The Ultimate Colouring Book – Fairy Tales (Storybook Colouring)The Ultimate Colouring Book – Magic, Monsters, Ghosts & Witches The Ultimate Colouring Book – World of Animals , Toddler Edition for little KidsThe Ultimate Colouring Book – Magic, Fantasy, Fairy Tales & Legends (Unicorns, Horses, Ponies, Mermaids, Ballerinas, Princesses and Fairies for Girls)The Ultimate Colouring & Activity Book - Toddler‘s Alphabet , ABC EditionThe Ultimate Fashion Sketch and Colouring Book for Girls, Teens and Adults (Fashion Colouring and Designing your own Clothes)Seasonal colouring books:The Ultimate Colouring Book - Christmas Edition The Ultimate Colouring Book – Halloween Edition The Ultimate Activity Book – Christmas Edition Colouring books for adults:Extreme Colouring: TOTAL DISTRACTION The world is full of FANTASTIC ANIMALS Underwater Magic: SECRET OCEAN HIDDEN WORLD Behind the RainbowDoodle Art: FANTASY GARDENS Read more

"My absolute favorite for this kind of interview preparation is Steven Skiena’s The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace … graph problems are -- they should be part of every working programmer’s toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. … every 1 – pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Get that Job at Google)"Steven Skiena’s Algorithm Design Manual retains its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. … Every programmer should read this book, and anyone working in the field should keep it close to hand. … This is the best investment … a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education)"It is wonderful to open to a random spot and discover aninteresting algorithm. This is the only textbook I felt compelled to bring with me out of my student days.... The color really adds a lot of energy to the new edition of the book!" (Cory Bart, University of Delaware)"The is the most approachable book on algorithms I have." (Megan Squire, Elon University)---This newly expanded and updated third edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficiency. It serves as the primary textbook of choice for algorithm design courses and interview self-study, while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Practical Algorithm Design, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, the Hitchhiker's Guide to Algorithms, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations, and an extensive bibliography. NEW to the third edition: -- New and expanded coverage of randomized algorithms, hashing, divide and conquer, approximation algorithms, and quantum computing -- Provides full online support for lecturers, including an improved website component with lecture slides and videos -- Full color illustrations and code instantly clarify difficult concepts -- Includes several new "war stories" relating experiences from real-world applications -- Over 100 new problems, including programming-challenge problems from LeetCode and Hackerrank. -- Provides up-to-date links leading to the best implementations available in C, C++, and JavaAdditional Learning Tools: -- Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them -- Exercises include "job interview problems" from major software companies -- Highlighted "take home lessons" emphasize essential concepts -- The "no theorem-proof" style provides a uniquely accessible and intuitive approach to a challenging subject -- Many algorithms are presented with actual code (written in C) -- Provides comprehensive references to both survey articles and the primary literatureWritten by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this substantially enhanced third edition of The Algorithm Design Manual is an essential learning tool for students and professionals needed a solid grounding in algorithms. Professor Skiena is also the author of the popular Springer texts, The Data Science Design Manual and Programming Challenges: The Programming Contest Training Manual. Read more

A stimulating excursion into pure mathematics aimed at "the mathematically traumatized," but great fun for mathematical hobbyists and serious mathematicians as well. This book leads the reader from simple graphs through planar graphs, Euler's formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, more. Includes exercises. 1976 edition. Read more

This book is an introduction to the language and standard proof methods of mathematics. It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra. Although it may be more meaningful to the student who has had some calculus, there is really no prerequisite other than a measure of mathematical maturity.Topics include sets, logic, counting, methods of conditional and non-conditional proof, disproof, induction, relations, functions, calculus proofs and infinite cardinality. Read more

This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as “counting.” The book consist almost entirely of problems. Some of the problems are designed to lead you to think about a concept, others are designed to help you figure out a concept and state a theorem about it, while still others ask you to prove the theorem. Other problems give you a chance to use a theorem you have proved. From time to time there is a discussion that pulls together some of the things you have learned or introduces a new idea for you to work with. Many of the problems are designed to build up your intuition for how combinatorial mathematics works.Above all, this book is dedicated to the principle that doing mathematics is fun. As long as you know that some of the problems are going to require more than one attempt before you hit on the main idea, you can relax and enjoy your successes, knowing that as you work more and more problems and share more and more ideas, problems that seemed intractable at first become a source of satisfaction later on.This book is released under an open source licence and is available in electronic form for free at http://bogart.openmathbooks.org/. Read more

Crypto can be cryptic. Serious Cryptography, 2nd Edition arms you with the tools you need to pave the way to understanding modern crypto. This practical guide to modern encryption breaks down the fundamental mathematical concepts at the heart of cryptography without shying away from meaty discussions of how they work. You’ll learn about authenticated encryption, secure randomness, hash functions, block ciphers, and public-key techniques such as RSA and elliptic curve cryptography. You'll also learn: Key concepts in cryptography, such as computational security, attacker models, and forward secrecyThe strengths and limitations of the TLS protocol behind HTTPS secure websitesQuantum computation and post-quantum cryptographyAbout various vulnerabilities by examining numerous code examples and use casesHow to choose the best algorithm or protocol and ask vendors the right questionsEach chapter includes a discussion of common implementation mistakes using real-world examples and details what could go wrong and how to avoid these pitfalls. This new second edition has been thoroughly revised and updated, with a new chapter on Cryptocurrency. Whether you’re a seasoned practitioner or a beginner looking to dive into the field, Serious Cryptography will provide a complete survey of modern encryption and its applications. Read more

The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader. Read more

Lovers of mathematics, young and old, professional and amateur, will enjoy this book. It is mathematics with fun: a collection of attractive problems that will delight and test readers. Many of the problems are drawn from the large number that have entertained and challenged students, guests and colleagues over the years during afternoon tea. The problems have their roots in many areas of mathematics. They vary greatly in difficulty: some are very easy, but most are far from trivial, and quite a few rather hard. Many provide substantial and surprising results that form the tip of an iceberg, providing an introduction to an important topic. To enjoy and appreciate the problems, readers should browse the book choosing one that looks particularly enticing, and think about it on and off for a while before resorting to the hint or the solution. Follow threads for an enjoyable and enriching journey through mathematics. Read more

Malliavin Calculus in Finance: Theory and Practice, Second Edition introduces the study of stochastic volatility (SV) models via Malliavin Calculus. Originally motivated by the study of the existence of smooth densities of certain random variables, Malliavin calculus has had a profound impact on stochastic analysis. In particular, it has been found to be an effective tool in quantitative finance, as in the computation of hedging strategies or the efficient estimation of the Greeks.This book aims to bridge the gap between theory and practice and demonstrate the practical value of Malliavin calculus. It offers readers the chance to discover an easy-to-apply tool that allows us to recover, unify, and generalize several previous results in the literature on stochastic volatility modeling related to the vanilla, the forward, and the VIX implied volatility surfaces. It can be applied to local, stochastic, and also to rough volatilities (driven by a fractional Brownian motion) leading to simple and explicit results.FeaturesIntermediate-advanced level text on quantitative finance, oriented to practitioners with a basic background in stochastic analysis, which could also be useful for researchers and students in quantitative financeIncludes examples on concrete models such as the Heston, the SABR and rough volatilities, as well as several numerical experiments and the corresponding Python scriptsCovers applications on vanillas, forward start options, and options on the VIX.The book also has a Github repository with the Python library corresponding to the numerical examples in the text. The library has been implemented so that the users can re-use the numerical code for building their examples. The repository can be accessed here: https://bit.ly/2KNex2Y.New to the Second EditionIncludes a new chapter to study implied volatility within the Bachelier framework.Chapters 7 and 8 have been thoroughly updated to introduce a more detailed discussion on the relationship between implied and local volatilities, according to the new results in the literature. Read more

This book gives a lively development of the mathematics needed to answer the question, ""How many times should a deck of cards be shuffled to mix it up?"" The shuffles studied are the usual ones that real people use: riffle, overhand, and smooshing cards around on the table.The mathematics ranges from probability (Markov chains) to combinatorics (symmetric function theory) to algebra (Hopf algebras). There are applications to magic tricks and gambling along with a careful comparison of the mathematics to the results of real people shuffling real cards. The book explores links between shuffling and higher mathematics--Lie theory, algebraic topology, the geometry of hyperplane arrangements, stochastic calculus, number theory, and more. It offers a useful springboard for seeing how probability theory is applied and leads to many corners of advanced mathematics.The book can serve as a text for an upper division course in mathematics, statistics, or computer science departments and will be appreciated by graduate students and researchers in mathematics, statistics, and computer science, as well as magicians and people with a strong background in mathematics who are interested in games that use playing cards. Read more

This textbook is designed for students. Rather than the typical definition-theorem-proof-repeat style, this text includes much more commentary, motivation and explanation. The proofs are not terse, and aim for understanding over economy. Furthermore, dozens of proofs are preceded by "scratch work" or a proof sketch to give students a big-picture view and an explanation of how they would come up with it on their own.This book covers intuitive proofs, direct proofs, sets, induction, logic, the contrapositive, contradiction, functions and relations. The text aims to make the ideas visible, and contains over 200 illustrations. The writing is relaxed and conversational, and includes periodic attempts at humor.This text is also an introduction to higher mathematics. This is done in-part through the chosen examples and theorems. Furthermore, following every chapter is an introduction to an area of math. These include Ramsey theory, number theory, topology, sequences, real analysis, big data, game theory, cardinality and group theory.After every chapter are "pro-tips," which are short thoughts on things I wish I had known when I took my intro-to-proofs class. They include finer comments on the material, study tips, historical notes, comments on mathematical culture, and more. Also, after each chapter's exercises is an introduction to an unsolved problem in mathematics.In the first appendix we discuss some further proof methods, the second appendix is a collection of particularly beautiful proofs, and the third is some writing advice. Read more

This is the C++ version of our book. See the website for links to the Java version, as well as to a version that uses larger fonts. Have you ever... Wanted to work at an exciting futuristic company? Struggled with an interview problem that could have been solved in 15 minutes? Wished you could study real-world computing problems? If so, you need to read Elements of Programming Interviews (EPI). EPI is your comprehensive guide to interviewing for software development roles. The core of EPI is a collection of over 250 problems with detailed solutions. The problems are representative of interview questions asked at leading software companies. The problems are illustrated with 200 figures, 300 tested programs, and 150 additional variants. The book begins with a summary of the nontechnical aspects of interviewing, such as strategies for a great interview, common mistakes, perspectives from the other side of the table, tips on negotiating the best offer, and a guide to the best ways to use EPI. We also provide a summary of data structures, algorithms, and problem solving patterns. Coding problems are presented through a series of chapters on basic and advanced data structures, searching, sorting, algorithm design principles, and concurrency. Each chapter stars with a brief introduction, a case study, top tips, and a review of the most important library methods. This is followed by a broad and thought-provoking set of problems.A practical, fun approach to computer science fundamentals, as seen through the lens of common programming interview questions. Jeff Atwood/Co-founder, Stack Overflow and Discourse Read more

As the world's first and only full-scale computational language, the Wolfram Language represents a milestone in the development of programming languages that makes leading-edge computation accessible to everyone. Unique in its approach of building in vast knowledge and automation, the Wolfram Language scales from a single line of easy-to-understand interactive code to million-line production systems.This book provides an elementary introduction to the Wolfram Language and modern computational thinking. It assumes no prior knowledge of programming, and is suitable for both technical and non-technical college and middle-to-high-school students as well as anyone with an interest in the latest technology and its practical application. Read more

If you struggle with binary multiplication, or Big O Notation, this is the book for you. This textbook companion will help improve your essential maths skills for computer science, whichever awarding body specification you're following. You can use it throughout your course, whenever you feel you need some extra help.- Develop your understanding of both maths and computer science with all worked examples and questions within a computer science context- Improve your confidence with a step-by-step approach to every maths skill- Measure your progress with guided and non-guided questions to see how you're improving- Understand where you're going wrong with full worked solutions to every question - Feel confident in expert guidance from experienced teachers and examiners Victoria Ellis and Gavin Craddock, reviewed by Dr Kathleen Maitland, Senior Lecturer in Computing and Director of the SAS Student Academy at Birmingham City University Read more

The breathtakingly rapid pace of change in computing makes it easy to overlook the pioneers who began it all. The Universal Computer: The Road from Leibniz to Turing explores the fascinating lives, ideas, and discoveries of seven remarkable mathematicians. It tells the stories of the unsung heroes of the computer age – the logicians. Read more

The seminal text on fractal geometry for students and researchers: extensively revised and updated with new material, notes and references that reflect recent directions.Interest in fractal geometry continues to grow rapidly, both as a subject that is fascinating in its own right and as a concept that is central to many areas of mathematics, science and scientific research. Since its initial publication in 1990 Fractal Geometry: Mathematical Foundations and Applications has become a seminal text on the mathematics of fractals.  The book introduces and develops the general theory and applications of fractals in a way that is accessible to students and researchers from a wide range of disciplines.Fractal Geometry: Mathematical Foundations and Applications is an excellent course book for undergraduate and graduate students studying fractal geometry, with suggestions for material appropriate for a first course indicated. The book also provides an invaluable foundation and reference for researchers who encounter fractals not only in mathematics but also in other areas across physics, engineering and the applied sciences.Provides a comprehensive and accessible introduction to the mathematical theory and     applications of fractalsCarefully explains each topic using illustrative examples and diagramsIncludes the necessary mathematical background material, along with notes and references to enable the reader to pursue individual topicsFeatures a wide range of exercises, enabling readers to consolidate their understandingSupported by a website with solutions to exercises and additional material www.wileyeurope.com/fractalLeads onto the more advanced sequel Techniques in Fractal Geometry (also by Kenneth Falconer and available from Wiley) Read more

This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. Geared toward mathematics and computer science majors, it emphasizes applications, offering more than 200 exercises to help students test their grasp of the material and providing answers to selected exercises. 1991 edition. Read more

This revised and enlarged sixth edition of Proofs from THE BOOK features an entirely new chapter on Van der Waerden’s permanent conjecture, as well as additional, highly original and delightful proofs in other chapters.From the citation on the occasion of the 2018 "Steele Prize for Mathematical Exposition"“… It is almost impossible to write a mathematics book that can be read and enjoyed by people of all levels and backgrounds, yet Aigner and Ziegler accomplish this feat of exposition with virtuoso style. […] This book does an invaluable service to mathematics, by illustrating for non-mathematicians what it is that mathematicians mean when they speak about beauty.”From the Reviews"... Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. ... Aigner and Ziegler... write: "... all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations." I do. ... "Notices of the AMS, August 1999"... This book is a pleasure to hold and to look at: ample margins, nice photos, instructive pictures and beautiful drawings ... It is a pleasure to read as well: the style is clear and entertaining, the level is close to elementary, the necessary background is given separately and the proofs are brilliant. ..."LMS Newsletter, January 1999"Martin Aigner and Günter Ziegler succeeded admirably in putting together a broad collection of theorems and their proofs that would undoubtedly be in the Book of Erdös. The theorems are so fundamental, their proofs so elegant and the remaining open questions so intriguing that every mathematician, regardless of speciality, can benefit from reading this book. ..."SIGACT News, December 2011 Read more

Fortran remains one of the principal programming languages used in high-performance scientific, numerical, and engineering computing. A series of significant revisions to the standard versions of the language have progressively enhanced its capabilities, and the current standard - Fortran 2023 - brings with it further additions and improvements. The language as defined by its most recent standards, with their introduction of object-oriented programming and of coarrays, is often referred to generically as 'Modern Fortran', and this term is increasingly used in the literature.Thus, we see that Fortran's particular advantages as a high-end numerical language, especially where arrays are the main form of data object and/or where complex arithmetic is involved, are still to the fore. It is able to attain the highest achievable optimization, mainly because multi-dimensional arrays are 'natural' objects and because its pointers are highly constrained. There is every sign that Modern Fortran will continue to be used to tackle major scientific computing problems in the next decade and beyond and will long remain a living tribute to its early pioneers. This third edition of Modern Fortran Explained expands on the second. The material contained in the four final chapters of the second edition have been merged into the main text, thereby offering, in 20 chapters, a comprehensive and uniform description of Fortran 2018. The additional features now brought by the 2023 standard, which are mostly relatively minor in nature, are described in two final chapters, the first on generic programming and the second on the other features. This structure enables the reader to distinguish clearly between what is old and what is new.This new edition, written by experts in the field, three of whom have actively contributed to Fortran 2023, is thus a complete and authoritative description of Fortran in its latest form, with the intention that it remain the main reference work in the field. Read more

As the sophistication of cyber-attacks increases, understanding how to defend critical infrastructure systems―energy production, water, gas, and other vital systems―becomes more important, and heavily mandated. Industrial Network Security, Third Edition arms you with the knowledge you need to understand the vulnerabilities of these distributed supervisory and control systems.Author Eric Knapp examines the unique protocols and applications that are the foundation of Industrial Control Systems (ICS) and provides clear guidelines for their protection. This comprehensive reference gives you thorough understanding of the challenges facing critical infrastructures, new guidelines and security measures for infrastructure protection, knowledge of new and evolving security tools, and pointers on SCADA protocols and security implementation.All-new real-world examples of attacks against control systems such as Trisis, Industroyer, Incontroller, and moreNew information on Risk Management to better address cyber-physical systems and the risks associated with cyber-physical attacksIncludes all-new content on OT attack methodology, USB security, OT Cyber Kill Chains, Incident Response lifecycles, and moreProvides improved guidance for implementing security controls and risk mitigation strategies, including expanded coverage of network segmentation, monitoring, and threat detectionIncludes new coverage of network spans, mirrors, and taps, as well as asset discovery, log collection, and industrial-focused SIEM solution Read more