James Clark takes an innovative look at Britain's longest numbered road.

LC copy bound in 2 v.: v. 1, p. 1-509; v. 2, p. [509]-1153.

This eBook is a collection of articles from a Frontiers Research Topic. Frontiers Research Topics are very popular trademarks of the Frontiers Journals Series: they are collections of at least ten articles, all centered on a particular subject. With their unique mix of varied contributions from Original Research to Review Articles, Frontiers Research Topics unify the most influential researchers, the latest key findings and historical advances in a hot research area! Find out more on how to host your own Frontiers Research Topic or contribute to one as an author by contacting the Frontiers Editorial Office: frontiersin.org/about/contact.

Capturing such quintessentially American pastimes as baseball and road trips in one fascinating work, the updated and expanded third edition of Chris Epting’s Roadside Baseball chronicles more than 500 important events in baseball history with detailed descriptions of the event and information on each location. Packed with historical data, trivia, photographs, and baseball lore, entries include the birthplaces of baseball legends, ballparks, museums and halls of fame, final resting places, and many locations that are no longer standing. From out-of-the-way spots to the most popular stadiums in the U.S. and Canada, no site is too small or insignificant to be included in this comprehensive guide. The third edition of Roadside Baseball includes hundreds of newly discovered landmarks, including the former locations of stadiums that have been torn down since the last edition of the book (Yankee stadium, Shea stadium, Tiger stadium, etc.), information on the Negro Leagues Baseball Marker project which has placed headstones around the country to honor forgotten African-American ballplayers, new exhibits at existing MLB parks, and suggested daytrip itineraries located near your favorite stadiums. Other new entries include the actual diamond used for the classic film, The Sandlot; the exact location where Mickey Mantle’s legendary 565-foot blast landed; the baseball field in Orange County, California where many believe Babe Ruth hit the longest home run of his career against the great Walter Johnson (along with extremely rare photos of Ruth both batting and pitching during that very game); the newly marked location in Kekionga, Indiana where the first major league game was played in 1871; all 29 markers along the new “Hot Springs Baseball Trail” celebrating baseball history in Arkansas; and Heckscher Fields in Central Park, New York, where Larry David’s softball team played in an episode of “Curb Your Enthusisam.” Entries from the previous edition include the Buckminster Hotel in Boston, where the Black Sox planned their fix of the 1919 World Series; the original little league field and museum in Williamsport, Pennsylvania; the birthplace of Jackie Robinson; the place where Mickey Mantle was discovered by a scout from the New York Yankees; and the site of the original Wrigley Field, erected in Los Angeles in 1925. The third edition of Roadside Baseball is the most comprehensive book ever written on the locations of baseball landmarks, and the perfect gift for baseball fans of all ages!

The proceedings of the Second International Conference on [title] held in Cambridge, Massachusetts, April 1991, comprise 55 papers on topics including the logical specifications of reasoning behaviors and representation formalisms, comparative analysis of competing algorithms and formalisms, and ana

The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other Directions