Books in the A Bradford Book series

This text presents a summary of the basic theoretical structures of classical mechanics, electricity and magnetism, quantum mechanics, statistical physics, special relativity and modern field theories.

Vinod Goel argues that the cognitive computational conception of the world requires our thought processes to be precise, rigid, discrete, and unambiguous; yet there are dense, ambiguous, and amorphous symbol systems, like sketching, painting, and poetry, found in the arts and much of everyday discourse that have an important, nontrivial place in cognition.

According to Peter Ludlow, there is a very close relation between the structure of natural language and that of reality, and one can gain insights into long-standing metaphysical questions by studying the semantics of natural language. In this book Ludlow uses the metaphysics of time as a case study and focuses on the dispute between A-theorists and B-theorists about the nature of time. According to B-theorists, there is no genuine change, but a permanent sequence of events ordered by an earlier-than/later-than relation. According to the version of the A-theory adopted by Ludlow (a position sometimes called presentism), there are no past or future events or times; what makes something past or future is how the world stands right now.Ludlow argues that each metaphysical picture is tied to a particular semantical theory of tense and that the dispute can be adjudicated on semantical grounds. A presentism-compatible semantics, he claims, is superior to a B-theory semantics in a number of respects, including its abilities to handle the indexical nature of temporal discourse and to account for facts about language acquisition. Along the way, Ludlow develops a conception of E-type temporal anaphora that can account for both temporal anaphora and complex tenses without reference to past and future events. His view has philosophical consequences for theories of logic, self-knowledge, and memory. As for linguistic consequences, Ludlow suggests that the very idea of grammatical tense may have to be dispensed with and replaced with some combination of aspect, modality, and evidentiality.

Does action always arise out of desire? G.F. Schueler examines this hotly debated topic in philosophy of action and moral philosophy, arguing that once two senses of "desire" are distinguished-roughly, genuine desires and pro attitudes-apparently plausible explanations of action in terms of the agent's desires can be seen to be mistaken.

Josef Stern addresses the question: Given the received conception of the form and goals of semantic theory, does metaphorical interpretation, in whole or part, fall within its scope?

Cziko shows how the lessons of Bernard and Darwin, updated with the best of current scientific knowledge, can provide solutions to certain long-standing theoretical and practical problems in behavioral science and enable us to develop new methods and topics for research.

An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications.The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.