This book provides a practical and proven approach to designing relational databases. It contains two complementary design methodologies: logical data modeling and relational database design. The design methodologies are independent of product-specific implementations and have been applied to numerous relational product environments. 0201114348B04062001

集异璧－GEB，是数学家哥德尔、版画家艾舍尔、音乐家巴赫三个名字的前缀。《哥德尔、艾舍尔、巴赫书：集异璧之大成》是在英语世界中有极高评价的科普著作，曾获得普利策非小说奖。它通过对哥德尔的数理逻辑，艾舍尔的版画和巴赫的音乐三者的综合阐述，引人入胜地介绍了数理逻辑 学、可计算理 论、人工智能学、语言学、遗传学、音乐、绘画的理论等方面，构思精巧、含义深刻、视野广阔、富于哲学韵味。
中译本前后费时十余年，译者都是数学和哲学的专家，还得到原作者的直接参与，译文严谨通达，特别是在原作者的帮助下，把西方的文化典故和说法，尽可能转换为中国文化的典故和说法，使这部译本甚至可看作是一部新的创作，也是中外翻译史上的一个创举。

There's a hidden science that affects every part of your life. You are fluent in its terminology of email, WiFi, social networking, and encryption. You use its results when you make a telephone call, access the Internet, use any factory-produced product, or travel in any modern car. The discipline is so new that some prefer to call it a branch of engineering or mathematics. But it is so powerful and world-changing that you would be hard-pressed to find a single human being on the planet unaffected by its achievements. The science of computers enables the supply and creation of power, food, water, medicine, transport, money, communication, entertainment, and most goods in shops. It has transformed societies with the Internet, the digitization of information, mobile phone networks and GPS technologies. Here, Peter J. Bentley explores how this young discipline grew from its theoretical conception by pioneers such as Turing, through its growth spurts in the Internet, its difficult adolescent stage where the promises of AI were never achieved and dot-com bubble burst, to its current stage as a (semi)mature field, now capable of remarkable achievements. Charting the successes and failures of computer science through the years, Bentley discusses what innovations may change our world in the future.

At a time when Internet use is closely tracked and social networking sites supply data for targeted advertising, Lars Heide presents the first academic study of the invention that fueled today's information revolution: the punched card. Early punched cards helped to process the United States census in 1890. They soon proved useful in calculating invoices and issuing pay slips. As demand for more sophisticated systems and reading machines increased in both the United States and Europe, punched cards served ever-larger data-processing purposes. Insurance companies, public utilities, businesses, and governments all used them to keep detailed records of their customers, competitors, employees, citizens, and enemies. The United States used punched-card registers in the late 1930s to pay roughly 21 million Americans their Social Security pensions, Vichy France used similar technologies in an attempt to mobilize an army against the occupying German forces, and the Germans in 1941 developed several punched-card registers to make the war effort-and surveillance of minorities-more effective. Heide's analysis of these three major punched-card systems, as well as the impact of the invention on Great Britain, illustrates how different cultures collected personal and financial data and how they adapted to new technologies. This comparative study will interest students and scholars from a wide range of disciplines, including the history of technology, computer science, business history, and management and organizational studies.

"Computer: A History of the Information Machine "traces the history of the computer and shows how business and government were the first to explore its unlimited, information-processing potential. Old-fashioned entrepreneurship combined with scientific know-how inspired now famous computer engineers to create the technology that became IBM. Wartime needs drove the giant ENIAC, the first fully electronic computer. Later, the PC enabled modes of computing that liberated people from room-sized, mainframe computers.
This third edition provides updated analysis on software and computer networking, including new material on the programming profession, social networking, and mobile computing. It expands its focus on the IT industry with fresh discussion on the rise of Google and Facebook as well as how powerful applications are changing the way we work, consume, learn, and socialize. "Computer" is an insightful look at the pace of technological advancement and the seamless way computers are integrated into the modern world. Through comprehensive history and accessible writing, "Computer" is perfect for courses on computer history, technology history, and information and society, as well as a range of courses in the fields of computer science, communication, sociology, and management.

“There are at least two kinds of games,” states James P. Carse as he begins this extraordinary book. “One could be called finite; the other infinite.”
Finite games are the familiar contests of everyday life; they are played in order to be won, which is when they end. But infinite games are more mysterious. Their object is not winning, but ensuring the continuation of play. The rules may change, the boundaries may change, even the participants may change—as long as the game is never allowed to come to an end.
What are infinite games? How do they affect the ways we play our finite games? What are we doing when we play—finitely or infinitely? And how can infinite games affect the ways in which we live our lives?
Carse explores these questions with stunning elegance, teasing out of his distinctions a universe of observation and insight, noting where and why and how we play, finitely and infinitely. He surveys our world—from the finite games of the playing field and playing board to the infinite games found in culture and religion—leaving all we think we know illuminated and transformed. Along the way, Carse finds new ways of understanding everything, from how an actress portrays a role to how we engage in sex, from the nature of evil to the nature of science. Finite games, he shows, may offer wealth and status, power and glory, but infinite games offer something far more subtle and far grander.
Carse has written a book rich in insight and aphorism. Already an international literary event, Finite and Infinite Games is certain to be argued about and celebrated for years to come. Reading it is the first step in learning to play the infinite game.

Why do we find ourselves living in an Information Society? How did the collection, processing, and communication of information come to play an increasingly important role in advanced industrial countries relative to the roles of matter and energy? And why is this change recent--or is it? James Beniger traces the origin of the Information Society to major economic and business crises of the past century. In the United States, applications of steam power in the early 1800s brought a dramatic rise in the speed, volume, and complexity of industrial processes, making them difficult to control. Scores of problems arose: fatal train wrecks, misplacement of freight cars for months at a time, loss of shipments, inability to maintain high rates of inventory turnover. Inevitably the Industrial Revolution, with its ballooning use of energy to drive material processes, required a corresponding growth in the exploitation of information: "the Control Revolution." Between the 1840s and the 1920s came most of the important information-processing and communication technologies still in use today: telegraphy, modern bureaucracy. rotary power printing, the postage stamp, paper money, typewriter, telephone, punch-card processing, motion pictures, radio, and television. Beniger shows that more recent developments in microprocessors, computers, and telecommunications are only a smooth continuation of this "Control Revolution." Along the way he touches on many fascinating topics: why breakfast was invented, how trademarks came to be worth more than the companies that own them, why some employees wear uniforms, and whether time zones will always be necessary. The book is impressive not only for the breadth of its scholarship but also for the subtlety and force of its argument. It will be welcomed by sociologists, economists, historians of science and technology, and all curious in general.

An ontology is a formal description of concepts and relationships that can exist for a community of human and/or machine agents. The notion of ontologies is crucial for the purpose of enabling knowledge sharing and reuse. The Handbook on Ontologies provides a comprehensive overview of the current status and future prospectives of the field of ontologies considering ontology languages, ontology engineering methods, example ontologies, infrastructures and technologies for ontologies, and how to bring this all into ontology-based infrastructures and applications that are among the best of their kind. The field of ontologies has tremendously developed and grown in the five years since the first edition of the "Handbook on Ontologies." Therefore, its revision includes 21 completely new chapters as well as a major re-working of 15 chapters transferred to this second edition.

The capacity to think about our own thinking may lie at the heart of what it means to be both human and intelligent. Philosophers and cognitive scientists have investigated these matters for many years. Researchers in artificial intelligence have gone further, attempting to implement actual machines that mimic, simulate, and perhaps even replicate this capacity, called metareasoning. In this volume, leading authorities offer a variety of perspectives--drawn from philosophy, cognitive psychology, and computer science--on reasoning about the reasoning process. The book offers a simple model of reasoning about reason as a framework for its discussions. Following this framework, the contributors consider metalevel control of computational activities, introspective monitoring, distributed metareasoning, and, putting all these aspects of metareasoning together, models of the self. Taken together, the chapters offer an integrated narrative on metareasoning themes from both artificial intelligence and cognitive science perspectives.

The Invocation Model of Process Expression argues that mathematics does not provide the most appropriate conceptual foundations for computer science, but, rather, that these foundations are a primary source of unnecessary complexity and confusion.  It supports that there is a more appropriate conceptual model that unifies forms of expression considered quite disparate and simplifies issues considered complex and intractable.  This book presents that this model of process expression is alternative theory of computer science that is both valid and practical.

From the inventor of the PalmPilot comes a new and compelling theory of intelligence, brain function, and the future of intelligent machines

Jeff Hawkins, the man who created the PalmPilot, Treo smart phone, and other handheld devices, has reshaped our relationship to computers. Now he stands ready to revolutionize both neuroscience and computing in one stroke, with a new understanding of intelligence itself.
Hawkins develops a powerful theory of how the human brain works, explaining why computers are not intelligent and how, based on this new theory, we can finally build intelligent machines.
The brain is not a computer, but a memory system that stores experiences in a way that reflects the true structure of the world, remembering sequences of events and their nested relationships and making predictions based on those memories. It is this memory-prediction system that forms the basis of intelligence, perception, creativity, and even consciousness.
In an engaging style that will captivate audiences from the merely curious to the professional scientist, Hawkins shows how a clear understanding of how the brain works will make it possible for us to build intelligent machines, in silicon, that will exceed our human ability in surprising ways.
Written with acclaimed science writer Sandra Blakeslee, On Intelligence promises to completely transfigure the possibilities of the technology age. It is a landmark book in its scope and clarity.

Practical reasoning and situation calculus

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs.Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.