Python Programming: An Introduction to Computer Science: This is the second edition of John Zelle's Python Programming, updated for Python 3. This book is designed to be used as the primary textbook in a college-level first course in computing. It takes a fairly traditional approach, emphasizing problem solving, design, and programming as the core skills of computer science. However, these ideas are illustrated using a non-traditional language, namely Python. Although Python is used as the language, teaching Python is not the main point of this book. Rather, Python is used to illustrate fundamental principles of design and programming that apply in any language or computing environment. In some places, I have purposely avoided certain Python features and idioms that are not generally found in other languages. There are already many good books about Python on the market; this book is intended as an introduction to computing. Features include the following: *Extensive use of computer graphics. *Interesting examples. *Readable prose. *Flexible spiral coverage. *Just-in-time object coverage. *Extensive end-of-chapter problems.

Date Added: 3/8/2011 11:14:38 PM | Visits: 34643

Categories in Computer Science and Logic: Category theory has had important uses in logic since the invention of topos theory in the early 1960s, and logic has always been an important component of theoretical computer science. A new development has been the increase in direct interactions between category theory and computer science. In June 1987, an AMS-IMS-SIAM Summer Research Conference on Categories in Computer Science and Logic was held at the University of Colorado in Boulder. The aim of the conference was to bring together researchers working on the interconnections between category theory and computer science or between computer science and logic. The conference emphasized the ways in which the general machinery developed in category theory could be applied to specific questions and be used for category-theoretic studies of concrete problems. This volume represents the proceedings of the conference. (Some of the participants??� contributions have been published elsewhere.)

The papers published here relate to three different aspects of the conference. The first concerns topics relevant to all three fields, including, for example, Horn logic, lambda calculus, normal form reductions, algebraic theories, and categorical models for computability theory. In the area of logic, topics include semantical approaches to proof-theoretical questions, internal properties of specific objects in (pre-) topoi and their representations, and categorical sharpening of model-theoretic notions. Finally, in the area of computer science, the use of category theory in formalizing aspects of computer programming and program design is discussed.

Date Added: 3/8/2011 11:14:09 PM | Visits: 31857

Elsevier's Dictionary of Computer Science: The dictionary contains 10,120 terms with about 4,000 cross references that are commonly used in the theory and practice of computers. The terminology covers the following fields and subfields: software and hardware engineering; computer architecture; theory of algorithms; computer algebra; information systems; data processing and databases; microprogramming; computer graphics; computer networks and communications; multimedia; office automation; computer education.

Date Added: 3/8/2011 11:12:55 PM | Visits: 32091

Geometric Algebra for Computer Science: In fields such as robotics, computer graphics, and computer games, it is necessary to compute complex interactions of objects in virtual 3D worlds. In a virtual world, there may be thousands of these objects interacting with each other in real-time. Linear algebra (vector math) is traditionally used to perform these calculations, but linear algebra requires long and complex computer programs to implement and can create very difficult programming challenges
Developers of real-time applications spend a lot of time trying to squeeze the last ounce of performance out of them. Geometric algebra (GA) is a new and compact way of representing the geometry of these objects that makes the computation and the programming of them much easier. Once only the domain of academic researchers, this book introduces GA to programmers, shows how it extends from linear algebra, and describes how to model geometries using GA. The last part of the book describes techniques for creating applications. A companion website link is included with GaViewer, a program written in C that allows programming experiments with GA. Geometric Algebra for Computer Science describes what many feel will be the future of geometrical computation.
* The first book on Geometric Algebra for programmers in computer graphics and entertainment computing
* Written by leaders in the field providing essential information on this new technique for 3D graphics
* This full color book includes a website with GAViewer, a program to experiment with GA

Date Added: 3/8/2011 11:10:07 PM | Visits: 31763

Fete of Combinatorics and Computer Science: Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is L�szl� Lov�sz, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lov�sz' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume "Building Bridges". The other speakers were able to finish their contribution only later, these are collected in the present volume.

Date Added: 3/8/2011 11:09:46 PM | Visits: 31995

Mathematical Foundations of Computer Science 2009: The 56 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 148 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, including algorithmic game theory, algorithmic tearning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, theoretical issues in artificial intelligence.

Date Added: 3/8/2011 11:09:20 PM | Visits: 33190

Simply Scheme: Introducing Computer Science: An introductory-level text for students who are not majoring in computer science as well as for computer science majors with no prior programming experience, Simply Scheme teaches computer science from a functional/symbolic point of view. It provides a solid platform from which students can go on to study the seminal work Structure and Interpretation of Computer Programs. Beginners will find the authors' approach sophisticated yet conversational and unintimidating. Using Scheme, a modern dialect of Lisp, they teach fundamental ideas and concepts of computer science -- composition of functions, function as object, recursion, abstraction (data abstraction and procedural abstraction), and sequential (non-functional) techniques -- in a way that avoids confusing technical pitfalls. Interesting nonmathematical programming examples use words and sentences as data; practical examples are represented by miniature spreadsheet and database programs. Simply Scheme devotes five chapters to recursion, presenting distinct ways for readers to think about this watershed idea. There is also a chapter on file input/output, and students are able to work on substantial, realistic programming projects in the first semester. Compared to Pascal- or C-based texts, Simply Scheme has many advantages in its use of the Scheme programming language. Scheme is interactive and allows for ease of program development and debugging; its first-class functions and automatic storage allocation provide a high level of abstraction so that programmers can concentrate on the desired goal instead of on the computer; its simple, uniform syntax doesn't take up months of class time. Simply Scheme differs from other Scheme-based books in its detailed and thorough exploration of the beginning steps in computer science. In addition to its emphasis on recursion, it also explores higher-order procedures and trees in depth, leaving object-oriented programming and the more difficult environment model for a later course. Simply Scheme extends the standard Scheme language with word and sentence data types to make symbolic programming easier for beginners. It also features a series of large sample programs and a series of suggested large programming projects.

Date Added: 3/8/2011 10:44:09 PM | Visits: 33936

How To Be A Programmer: How To Be A Programmer
was written by Read, Robert

Date Added: 10/25/2010 11:06:07 PM | Visits: 32322

Executing Temporal Logic: Executing Temporal Logic
was written by Moszkowski, Ben

Date Added: 10/25/2010 11:06:04 PM | Visits: 33167

The Not So Short Introduction To Latex: The Not So Short Introduction To Latex
was
was written by Oetiker, Tobias

Date Added: 10/25/2010 11:06:02 PM | Visits: 32000