The Alien Algorithm


Book Description

Veena will let nothing stand in her way to get her daughter back. Seven-year-old Molly has been snatched from her and dragged off to a secret military lab. Veena's clues have dried up, and now she's on the run. While fleeing, she stumbles upon an alien technology that could change everything, or at least give her a bargaining chip to trade for her daughter's freedom with—if only she could figure out how to make it work. But first she needs to rescue her husband. At least she knows where he is now...sort of. Trapped in a cave somewhere on a planet of inedible moss inhabited by a group of reclusive, unwelcoming Luddites. Chasing sparse clues, Veena and her crew race through a secret underground city, a run-down space station, across a glittering collection of floating islands and out into the void of deep space—all with a bounty hunter hot on their tail. Can she figure out how to use the alien technology before it's too late? Is it the answer to getting her daughter back? Find out in this race-across-the-galaxy sequel to Fractured Orbits.




Algorithms - ESA 2003


Book Description

This book constitutes the refereed proceedings of the 11th Annual European Symposium on Algorithms, ESA 2003, held in Budapest, Hungary, in September 2003. The 66 revised full papers presented were carefully reviewed and selected from 165 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical analysis issues to real-world applications, engineering, and experimental analysis of algorithms.




Advanced Distributed Systems


Book Description

This book constitutes the thoroughly refereed post-proceedings of the Fifth International School and Symposium on Advanced Distributed Systems, ISSADS 2005, held in Guadalajara, Mexico in January 2005. The 50 revised full papers presented were carefully reviewed and selected from over 100 submissions. The papers are organized in topical sections on database systems, distributed and parallel algorithms, real-time distributed systems, cooperative information systems, fault tolerance, information retrieval, modeling and simulation, wireless networks and mobile computing, artificial life and multi agent systems.




Mathematical Foundations of Nature-Inspired Algorithms


Book Description

This book presents a systematic approach to analyze nature-inspired algorithms. Beginning with an introduction to optimization methods and algorithms, this book moves on to provide a unified framework of mathematical analysis for convergence and stability. Specific nature-inspired algorithms include: swarm intelligence, ant colony optimization, particle swarm optimization, bee-inspired algorithms, bat algorithm, firefly algorithm, and cuckoo search. Algorithms are analyzed from a wide spectrum of theories and frameworks to offer insight to the main characteristics of algorithms and understand how and why they work for solving optimization problems. In-depth mathematical analyses are carried out for different perspectives, including complexity theory, fixed point theory, dynamical systems, self-organization, Bayesian framework, Markov chain framework, filter theory, statistical learning, and statistical measures. Students and researchers in optimization, operations research, artificial intelligence, data mining, machine learning, computer science, and management sciences will see the pros and cons of a variety of algorithms through detailed examples and a comparison of algorithms.







Parallel Computing: Software Technology, Algorithms, Architectures & Applications


Book Description

Advances in Parallel Computing series presents the theory and use of of parallel computer systems, including vector, pipeline, array, fifth and future generation computers and neural computers. This volume features original research work, as well as accounts on practical experience with and techniques for the use of parallel computers.




Sams Teach Yourself Game Programming in 24 Hours


Book Description

A gentle introduction to game programming on the Windows platform for the complete beginner.




The Hierophancy Files


Book Description

Beneath the surface details of our planet lies a numbers matrix, and somebody just stole its key, putting our world in jeopardy. In 2050, geomancers and Light grid engineers at the Hierophancy in Sun Valley, Idaho, perfected an algorithm that runs all the Earth’s psychic affairs. In 2065, somebody stole it. This is the account of how they got it back. They had to get it back because in the wrong hands, this math formula could take over or end the planet. The Hierophancy is a secret group that works with the planet’s subtle energy terrain. You’ll know its outer expression as a landscape of sacred sites. Their job is to reveal the Holy Light that comes out of these many nodes and to fix it when there’s a problem. Why? They’re Hierophants—think of them as engineers of the planet’s Light grid. In April 2065, they discovered there was problem, a big one. Hierophancy staff member Frederick Atkinson narrates what they did about it. It’s a fairly wild ride involving unsuspected levels of planetary reality, routine cooperation of extraterrestrial colleagues, lots of angels, Ascended Masters, and even a guest consultation with the Chief Architect of All Reality. The result is a concentrated detective hunt across time and space to find that stolen mathematics. The quest for the stolen arithmetic takes the team to sites in Bolivia, Canada, Japan, and Iceland and back to the planet’s earliest days and other key moments in its geomantic life as they probe the engineering intricacies that comprise the Earth’s esoteric reality. An awful lot is at stake—namely, the fate of five related planets across this and other galaxies because they’re directly tied into the Earth and they need those numbers back too.




Discrete Mathematics with Ducks


Book Description

Discrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions of mathematics challenging. At the same time, it provides stimulating material that instructors can use for more advanced students. The first edition was widely well received, with its whimsical writing style and numerous exercises and materials that engaged students at all levels. The new, expanded edition continues to facilitate effective and active learning. It is designed to help students learn about discrete mathematics through problem-based activities. These are created to inspire students to understand mathematics by actively practicing and doing, which helps students better retain what they’ve learned. As such, each chapter contains a mixture of discovery-based activities, projects, expository text, in-class exercises, and homework problems. The author’s lively and friendly writing style is appealing to both instructors and students alike and encourages readers to learn. The book’s light-hearted approach to the subject is a guiding principle and helps students learn mathematical abstraction. Features: The book’s Try This! sections encourage students to construct components of discussed concepts, theorems, and proofs Provided sets of discovery problems and illustrative examples reinforce learning Bonus sections can be used by instructors as part of their regular curriculum, for projects, or for further study




Algorithms—Advances in Research and Application: 2012 Edition


Book Description

Algorithms—Advances in Research and Application: 2012 Edition is a ScholarlyEditions™ eBook that delivers timely, authoritative, and comprehensive information about Algorithms. The editors have built Algorithms—Advances in Research and Application: 2012 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Algorithms in this eBook to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Algorithms—Advances in Research and Application: 2012 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.