Rigorously documented and generously illustrated, Forms of constraint surveys prison architecture from earliest times to the present. Embedding his discussion of architectural detail in a history of social ideas about prisoners and imprisonment, criminologist Norman Johnston considers the architectural design and features of prisons in light of the purposes they were meant to serve. Johnston describes the preferred types of prison layout in various eras and locations. He assesses the success or failure of building elements in fulfilling goals such as prisoner isolation, segregation by gender or by severity of crime, adequate hygiene, rehabilitative activities, and surveillance of prisoners and guards. As goals and the consequent demands on the physical structure changed, new templates for the ideal prison emerged. Johnston traces the gradual rise of prison design as an architectural specialty and profiles the early figures and organizations devoted to the field, including William Blackburn, the first architect to specialize in prison design; John Haviland, architect of the influential Pennsylvania prison style; and Jeremy and Samuel Bentham, who conceived the much-discussed but never built Panopticon. He describes changes in prison design as architecture and penal philosophy leadership passed from one country to another. He also provides broad coverage of penal methods and prison architecture around the world.

An inspiring yet practical guide for transforming limitations into opportunities A Beautiful Constraint: How to Transform Your Limitations Into Advantages And Why It's Everyone's Business Now is a book about everyday, practical inventiveness, designed for the constrained times in which we live. It describes how to take the kinds of issues that all of us face today—lack of time, money, resources, attention, know-how—and see in them the opportunity for transformation of oneself and one's organization's fortunes. The ideas in the book are based on the authors' extensive work as business consultants, and are brought to life in 35 personal interviews from such varied sources as Nike, IKEA, Unilever, the U.S. Navy, Formula One racecar engineers, public school teachers in California, and barley farmers in South Africa. Underpinned by scientific research into the psychology of breakthrough, the book is a practical handbook full of tools and tips for how to make more from less. Beautifully designed and accessible, A Beautiful Constraint will appeal beyond its core business audience to anyone who needs to find the opportunity in constraint. The book takes the reader on a journey through the mindset, method and motivation required to move from the initial "victim" stage into the transformation stage. It challenges us to: Examine how we've become path dependent—stuck with routines that blind us from seeing opportunity along new paths Ask Propelling Questions to help us break free of those paths and put the most pressing and valuable constraints at the heart of our process Adopt a Can If mentality to answer these questions—focused on "how," not "if" Access the abundance to be found all around us to help transform constraints Activate the high-octane mix of emotions necessary to fuel the tenacity required for success We live in a world of seemingly ever-increasing constraints, driven as much by an overabundance of choices and connections as by a scarcity of time and resources. How we respond to these constraints is one of the most important issues of our time and will be a large determinant of our progress as people, businesses and planet, in the future. A Beautiful Constraint calls for a more widespread capability for constraint-driven problem solving and provides the framework to achieve that.

Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area.

Constraint reasoning has matured over the last three decades with contributions from a diverse community of researchers in artificial intelligence, databases and programming languages, operations research, management science, and applied mathematics. In Constraint Processing, Rina Dechter synthesizes these contributions, as well as her own significant work, to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.

Constraints are everywhere: most computational problems can be described in terms of restrictions imposed on the set of possible solutions, and constraint programming is a problem-solving technique that works by incorporating those restrictions in a programming environment. It draws on methods from combinatorial optimisation and artificial intelligence, and has been successfully applied in a number of fields from scheduling, computational biology, finance, electrical engineering and operations research through to numerical analysis. This textbook for upper-division students provides a thorough and structured account of the main aspects of constraint programming. The author provides many worked examples that illustrate the usefulness and versatility of this approach to programming, as well as many exercises throughout the book that illustrate techniques, test skills and extend the text. Pointers to current research, extensive historical and bibliographic notes, and a comprehensive list of references will also be valuable to professionals in computer science and artificial intelligence.

After a quick primer on database design basics and the SQL query language (for those programmers who may be building their first database application), this book provides an overview of SQL Server itself, which has been dramatically redesigned with the 2005 release Once readers have grasped the fundamentals of database design and SQL concepts, they will then learn how to implement those concepts with Microsoft SQL Server 2005 Addresses creating and changing tables, managing keys, database normalization, writing scripts, working with stored procedures, programming with XML, and using SQL Server reporting and data transformation services The companion Web site provides all of the code found in the book

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming. - Covers the whole field of constraint programming- Survey-style chapters- Five chapters on applications