Eight-year-old Terysa loves to solve problems. Give her some time and she'll figure out how to solve anything. So when Terysa is given an older computer for her birthday, she faces her biggest challenge yet: can she make it talk? Terysa is full of good ideas, but will any of them work, or does she need to change her approach and think less like a human and think more like a computer? This fun and interactive story introduces children to the basics of coding through an engaging narrative based on the true story of a little girl who loves to solve problems! Looking for more resources for your family or students? Sign up to extend the lesson with FREE age-appropriate lessons according to state and federal education standards at https://www.terysasolvesit.com/extend-the-lesson
"...readers...explore the life of Mary Jackson, who overcame the challenges of segregation and sexism to become the first female African American engineer at NASA"--
Constrained Coding and Soft Iterative Decoding is the first work to combine the issues of constrained coding and soft iterative decoding (e.g., turbo and LDPC codes) from a unified point of view. Since constrained coding is widely used in magnetic and optical storage, it is necessary to use some special techniques (modified concatenation scheme or bit insertion) in order to apply soft iterative decoding. Recent breakthroughs in the design and decoding of error-control codes (ECCs) show significant potential for improving the performance of many communications systems. ECCs such as turbo codes and low-density parity check (LDPC) codes can be represented by graphs and decoded by passing probabilistic (a.k.a. `soft') messages along the edges of the graph. This message-passing algorithm yields powerful decoders whose performance can approach the theoretical limits on capacity. This exposition uses `normal graphs,' introduced by Forney, which extend in a natural manner to block diagram representations of the system and provide a simple unified framework for the decoding of ECCs, constrained codes, and channels with memory. Soft iterative decoding is illustrated by the application of turbo codes and LDPC codes to magnetic recording channels. For magnetic and optical storage, an issue arises in the use of constrained coding, which places restrictions on the sequences that can be transmitted through the channel; the use of constrained coding in combination with soft ECC decoders is addressed by the modified concatenation scheme also known as `reverse concatenation.' Moreover, a soft constraint decoder yields additional coding gain from the redundancy in the constraint, which may be of practical interest in the case of optical storage. In addition, this monograph presents several other research results (including the design of sliding-block lossless compression codes, and the decoding of array codes as LDPC codes). Constrained Coding and Soft Iterative Decoding will prove useful to students, researchers and professional engineers who are interested in understanding this new soft iterative decoding paradigm and applying it in communications and storage systems.
“If you’ve got a good idea, and you know it’s going to work, go ahead and do it.” The inspiring story of Grace Hopper—the boundary-breaking woman who revolutionized computer science—is told told in an engaging picture book biography. Who was Grace Hopper? A software tester, workplace jester, cherished mentor, ace inventor, avid reader, naval leader—AND rule breaker, chance taker, and troublemaker. Acclaimed picture book author Laurie Wallmark (Ada Byron Lovelace and the Thinking Machine) once again tells the riveting story of a trailblazing woman. Grace Hopper coined the term “computer bug” and taught computers to “speak English.” Throughout her life, Hopper succeeded in doing what no one had ever done before. Delighting in difficult ideas and in defying expectations, the insatiably curious Hopper truly was “Amazing Grace” . . . and a role model for science- and math-minded girls and boys. With a wealth of witty quotes, and richly detailed illustrations, this book brings Hopper's incredible accomplishments to life.
Computers are everywhere. Even a smartphone is a mini computer. With digital technologies so prevalent in today's world, it's important for young learners to know how they work. This book introduces kids to the design and function of the hardware and networks that digitally connect us. Utilizing colorful infographics and simple language, this book discusses the history of the first computers, different types of computers, and the important parts that make a computer run. It makes learning about computers easy for young readers, and it will inspire your budding engineers.
Offers an illustrated telling of the story of Ada Byron Lovelace, from her early creative fascination with mathematics and science and her devastating bout with measles, to the ground-breaking algorithm she wrote for Charles Babbage's analytical engine.
Young readers are exposed to the exciting world of coding. They will be given an introduction to the basics of key computer programming markup languages, such as HTML and CSS. In learning about these essential computer skills and subjects, readers will improve their problem-solving skills and prepare to make their own website or even pursue a career in coding. In addition to the age-appropriate text, there are informative diagrams, helpful fact boxes, instructional graphic organizers, and eye-catching illustrations, which make this topic to make even more interesting and engaging for young readers.
Algorithmic Results in List Decoding introduces and motivates the problem of list decoding, and discusses the central algorithmic results of the subject, culminating with the recent results on achieving "list decoding capacity." The main technical focus is on giving a complete presentation of the recent algebraic results achieving list decoding capacity, while pointers or brief descriptions are provided for other works on list decoding. Algorithmic Results in List Decoding is intended for scholars and graduate students in the fields of theoretical computer science and information theory. The author concludes by posing some interesting open questions and suggests directions for future work.
This detailed guide explores the historical development of algorithms and how they are used as a way of teaching computers to work through problems. Named for Persian mathematician Muhammad ibn Musa al-Khwarizmi, modern algorithms and functions make programing more efficient. Algorithms are simplified for readers using words, flowcharts, and pseudo code to build a beginning understanding of algorithms and how they are used in our modern, computerized world. Young coders and STEM students are sure to strengthen their technical skills with an in-depth and fun exploration of this essential coding topic.