Algorithms Unplugged

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.

How do some birds, turtles, and insects possess navigational abilities that rival the best manmade navigational technologies? Who or what taught the honey bee its dance, or its hive mates how to read the complex message of the dance? How do blind mound-building termites master passive heating and cooling strategies that dazzle skilled human architects? In The Origin of Species Charles Darwin conceded that such instincts are "so wonderful" that the mystery of their origin would strike many "as a difficulty sufficient to overthrow my whole theory." In Animal Algorithms, Eric Cassell surveys recent evidence and concludes that the difficulty remains, and indeed, is a far more potent challenge to evolutionary theory than Darwin imagined.

Bring the power and flexibility of C++ to all your DSP applications The multimedia revolution has created hundreds of new uses for Digital Signal Processing, but most software guides have continued to focus on outdated languages such as FORTRAN and Pascal for managing new applications. Now C++ Algorithms for Digital Signal Processing applies object-oriented techniques to this growing field with software you can implement on your desktop PC. C++ Algorithms for Digital Signal Processing's programming methods can be used for applications as diverse as: Digital audio and video Speech and image processing Digital communications Radar, sonar, and ultrasound signal processing Complete coverage is provided, including: Overviews of DSP and C++ Hands-on study with dozens of exercises Extensive library of customizable source code Import and Export of Microsoft WAV and Matlab data files Multimedia professionals, managers, and even advanced hobbyists will appreciate C++ Algorithms for Digital Signal Processing as much as students, engineers, and programmers. It's the ideal bridge between programming and signal processing, and a valuable reference for experts in either field. Source code for all of the DSP programs and DSP data associated with the examples discussed in this book and Appendix B and the file README.TXT which provide more information about how to compile and run the programs can be downloaded from www.informit.com/title/9780131791442

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.

Provides a simple introduction to algorithms for young readers who are not yet ready for coding on computers.

From the creator of the bestselling Mr. Panda series comes an amusing picture book about the fun you can have when you unplug. Meet Blip. Blip loves being plugged into her computer. When a blackout occurs, Blip trips over her wire and tumbles outside. Suddenly, Blip's gray world is filled with color and excitement. She plays with her new friends and has adventures all day long. When Blip finally returns home, she realizes that the world can be even brighter once you unplug.

This book constitutes revised selected papers from the 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, held in Patras, Greece, in September 2015. The 16 full papers presented in this volume were carefully reviewed and selected from 30 submissions. The deal with algorithms analysis and problem complexity; computer communication networks; computation by abstract devices; and mathematics of computing.

While the growth of computational thinking has brought new awareness to the importance of computing education, it has also created new challenges. Many educational initiatives focus solely on the programming aspects, such as variables, loops, conditionals, parallelism, operators, and data handling, divorcing computing from real-world contexts and applications. This decontextualization threatens to make learners believe that they do not need to learn computing, as they cannot envision a future in which they will need to use it, just as many see math and physics education as unnecessary. The Handbook of Research on Tools for Teaching Computational Thinking in P-12 Education is a cutting-edge research publication that examines the implementation of computational thinking into school curriculum in order to develop creative problem-solving skills and to build a computational identity which will allow for future STEM growth. Moreover, the book advocates for a new approach to computing education that argues that while learning about computing, young people should also have opportunities to create with computing, which will have a direct impact on their lives and their communities. Featuring a wide range of topics such as assessment, digital teaching, and educational robotics, this book is ideal for academicians, instructional designers, teachers, education professionals, administrators, researchers, and students.