Browse Results

Select your format based upon: 1) how you want to read your book, and 2) compatibility with your reading tool. To learn more about using Bookshare with your device, visit the Help Center.

Here is an overview of the specialized formats that Bookshare offers its members with links that go to the Help Center for more information.

• Bookshare Web Reader - A customized reading tool for Bookshare members offering all the features of DAISY with a single click of the "Read Now" link.
• DAISY (Digital Accessible Information System) - A digital book file format. DAISY books from Bookshare are DAISY 3.0 text files that work with just about every type of access technology that reads text. Books that contain images will have the download option of ‘DAISY Text with Images’.
• BRF (Braille Refreshable Format) - Digital Braille for use with refreshable Braille devices and Braille embossers.
• MP3 (MPEG audio layer 3) - Provides audio only with no text. These books are created with a text-to-speech engine and spoken by Kendra, a high quality synthetic voice from Ivona. Any device that supports MP3 playback is compatible.
• DAISY Audio - Similar to the DAISY option above; however, this option uses MP3 files created with our text-to-speech engine that utilizes Ivonas Kendra voice. This format will work with Daisy Audio compatible players such as Victor Reader Stream and Read2Go.
• EPUB - A standard e-book format that can be read on many tools, such as iBooks, Readium or others.
• Word - Accessible Word output, which can be unzipped and opened in any tool that allows .docx files

COMPSTAT: Proceedings in Computational Statistics 14th Symposium held in Utrecht, The Netherlands, 2000

This Volume contains the Keynote, Invited and Full Contributed papers presented at COMPSTAT 2000. A companion volume (Jansen & Bethlehem, 2000) contains papers describing the Short Communications and Posters. COMPST AT is a one­ week conference held every two years under the auspices of the International Association of Statistical Computing, a section of the International Statistical Institute. COMPST AT 2000 is jointly organised by the Department of Methodology and Statistics of the Faculty of Social Sciences of Utrecht University, and Statistics Netherlands. It is taking place from 21-25 August 2000 at Utrecht University. Previous COMPSTATs (from 1974-1998) were in Vienna, Berlin, Leiden, Edinburgh, Toulouse, Prague, Rome, Copenhagen, Dubrovnik, Neuchatel, Vienna, Barcelona and Bristol. The conference is the main European forum for developments at the interface between statistics and computing. This was encapsulated as follows on the COMPST A T 2000 homepage http://neon. vb.cbs.nlIrsml compstat. Statistical computing provides the link between statistical theory and applied statistics. As at previous COMPSTATs, the scientific programme will range over all aspects of this link, from the development and implementation of new statistical ideas through to user experiences and software evaluation. The programme should appeal to anyone working in statistics and using computers, whether in universities, industrial companies, research institutes or as software developers. At COMPST AT 2000 there is a special interest in the interplay with official statistics. This is evident from papers in the area of computerised data collection, survey methodology, treatment of missing data, and the like.

Compstat: Proceedings in Computational Statistics 11th Symposium held in Vienna, Austria, 1994

This book assembles papers which were presented at the biennial sympo­ sium in Computational Statistics held und er the a!uspices of the International Association for Statistical Computing (IASC), a section of ISI, the Interna­ tional Statistical Institute. This symposium named COMPSTAT '94 was organized by the Statistical Institutes of the University of Vienna and the University of Technology of Vienna, Austria. The series of COMPSTAT Symposia started 1974 in Vienna. Mean­ while they took place every other year in Berlin (Germany, 1976), Leiden (The Netherlands, 1978), Edinburgh (Great Britain, 1980), Toulouse (France, 1982), Prague (Czechoslovakia, 1984), Rom (Italy, 1986), Copenhagen (Den­ mark, 1988), Dubrovnik (Yugoslavia, 1990) and Neuchätel (Switzerland, 1992). This year we are celebrating the 20th anniversary in Vienna, Austria. It has obviously been observed a movement from "traditional" computa­ tional statistics with emphasis on methods which produce results quickly and reliably, to computationally intensive methods like resampling procedures, Bayesian methods, dynamic graphics, to very recent areas like neural net­ works, accentuation on spatial statistics, huge data sets, analysis strategies, etc. For the organization of the symposium, new guidelines worked out by the IASC in written form were in effect this time. The goal was to refresh somehow the spirit of the start of COMPSTAT '74, keep the tradition of the series and ensure a certain continuity in the sequence of biannual meetings.

COMPSTAT: Proceedings in Computational Statistics 8th Symposium held in Copenhagen 1988

The papers assembled in this volume were presented at COMPSTAT 1988, the 8th biannual Symposium in Computational Statistics held under the auspices of the International Association for Statistical Computing. The current impact of computers on the theory and practice of statistics can be traced at many levels: on one level, the ubiquitous personal computer has made methods for explorative data analysis and display, rarely even described in conventional statistics textbooks, widely available. At another level, advances in computing power permit the development and application of statistical methods in ways that previously have been infeasible. Some of these methods, for example Bayesian methods, are deeply rooted in the philosophical basis of statistics, while others, for example dynamic graphics, present the classical statistical framework with quite novel perspectives. The contents of this volume provide a cross-section of current concerns and interests in computational statistics. A dominating topic is the application of artificial intelligence to statistics (and vice versa), where systems deserving the label" expert systems" are just beginning to emerge from the haze of good intentions with which they hitherto have been clouded. Other topics that are well represented include: nonparametric estimation, graphical techniques, algorithmic developments in all areas, projection pursuit and other computationally intensive methods. COMPSTAT symposia have been held biannually since 1974. This tradition has made COMPSTAT a major forum for advances in computational statistics with contributions from many countries in the world. Two new features have been introduced at COMPSTAT '88.

Compstat: Proceedings in Computational Statistics

This COMPSTAT 2002 book contains the Keynote, Invited, and Full Contributed papers presented in Berlin, August 2002. A companion volume including Short Communications and Posters is published on CD. The COMPSTAT 2002 is the 15th conference in a serie of biannual conferences with the objective to present the latest developments in Computational Statistics and is taking place from August 24th to August 28th, 2002. Previous COMPSTATs were in Vienna (1974), Berlin (1976), Leiden (1978), Edinburgh (1980), Toulouse (1982), Pra~ue (1984), Rome (1986), Copenhagen (1988), Dubrovnik (1990), Neuchatel (1992), Vienna (1994), Barcelona (1996), Bris­ tol (1998) and Utrecht (2000). COMPSTAT 2002 is organised by CASE, Center of Applied Statistics and Eco­ nomics at Humboldt-Universitat zu Berlin in cooperation with F'reie Universitat Berlin and University of Potsdam. The topics of COMPSTAT include methodological applications, innovative soft­ ware and mathematical developments, especially in the following fields: statistical risk management, multivariate and robust analysis, Markov Chain Monte Carlo Methods, statistics of E-commerce, new strategies in teaching (Multimedia, In­ ternet), computerbased sampling/questionnaires, analysis of large databases (with emphasis on computing in memory), graphical tools for data analysis, classification and clustering, new statistical software and historical development of software.

COMPSTAT: Proceedings in Computational Statistics, 9th Symposium held at Dubrovnik, Yugoslavia, 1990

Although no-one is, probably, too enthused about the idea, it is a fact that the development of most empirical sciences to a great extent depends on the development of data analysis methods and techniques, which, due to the necessity of application of computers for that purpose, actually means that it practically depends on the advancement and orientation of computer statistics. Every other year the International Association for Statistical Computing sponsors the organizition of meetings of individual s professiona77y involved in computational statistics. Since these meetings attract professionals from allover the world, they are a good sample for the estimation of trends in this area which some believe is a statistics proper while others claim it is computer science. It seems, though, that an increasing number of colleagues treat it as an independent scientific or at least technical discipline. This volume contains six invited papers, 41 contributed papers and, finally, two papers which are, formally, software descriptions, but it was agreed by the Program Committee that they should be included in a separate section entitled "Notes about new developments in statistical software", due to their special significance for current trends in computational statistics.

COMPSTAT: Proceedings in Computational Statistics 13th Symposium held in Bristol, Great Britain, 1998

This Volume contains the Keynote, Invited and Full Contributed papers presented at COMPSTAT'98. A companion volume (Payne & Lane, 1998) contains papers describing the Short Communications and Posters. COMPSTAT is a one-week conference held every two years under the auspices of the International Association of Statistical Computing, a section of the International Statistical Institute. COMPSTAT'98 is organised by IACR-Rothamsted, IACR-Long Ashton, the University of Bristol Department of Mathematics and the University of Bath Department of Mathematical Sciences. It is taking place from 24-28 August 1998 at University of Bristol. Previous COMPSTATs (from 1974-1996) were in Vienna, Berlin, Leiden, Edinburgh, Toulouse, Prague, Rome, Copenhagen, Dubrovnik, Neuchatel, Vienna and Barcelona. The conference is the main European forum for developments at the interface between statistics and computing. This was encapsulated as follows in the COMPSTAT'98 Call for Papers. Statistical computing provides the link between statistical theory and applied statistics. The scientific programme of COMPSTAT ranges over all aspects of this link, from the development and implementation of new computer-based statistical methodology through to innovative applications and software evaluation. The programme should appeal to anyone working in statistics and using computers, whether in universities, industrial companies, research institutes or as software developers.

COMPSTAT: Proceedings in Computational Statistics 12th Symposium held in Barcelona, Spain, 1996

COMPSTAT symposia have been held regularly since 1974 when they started in Vienna. This tradition has made COMPSTAT a major forum for the interplay of statistics and computer sciences with contributions from many well known scientists all over the world. The scientific programme of COMPSTAT '96 covers all aspects of this interplay, from user-experiences and evaluation of software through the development and implementation of new statistical ideas. All papers presented belong to one of the three following categories: - Statistical methods (preferable new ones) that require a substantial use of computing; - Computer environments, tools and software useful in statistics; - Applications of computational statistics in areas of substantial interest (environment, health, industry, biometrics, etc.).

COMPSTAT 1982 5th Symposium held at Toulouse 1982: Part I: Proceedings in Computational Statistics

COMPSTAT 2004 - Proceedings in Computational Statistics: 16th Symposium Held in Prague, Czech Republic, 2004

Statistical computing provides the link between statistical theory and applied statistics. The content of the book covers all aspects of this link, from the development and implementation of new statistical ideas to user experiences and software evaluation. The proceedings should appeal to anyone working in statistics and using computers, whether in universities, industrial companies, government agencies, research institutes or as software developers

COMPSTAT 2006 - Proceedings in Computational Statistics: 17th Symposium Held in Rome, Italy, 2006

International Association for Statistical Computing The International Association for Statistical Computing (IASC) is a Section of the International Statistical Institute. The objectives of the Association are to foster world-wide interest in e?ective statistical computing and to - change technical knowledge through international contacts and meetings - tween statisticians, computing professionals, organizations, institutions, g- ernments and the general public. The IASC organises its own Conferences, IASC World Conferences, and COMPSTAT in Europe. The 17th Conference of ERS-IASC, the biennial meeting of European - gional Section of the IASC was held in Rome August 28 - September 1, 2006. This conference took place in Rome exactly 20 years after the 7th COMP- STAT symposium which was held in Rome, in 1986. Previous COMPSTAT conferences were held in: Vienna (Austria, 1974); West-Berlin (Germany, 1976); Leiden (The Netherlands, 1978); Edimbourgh (UK, 1980); Toulouse (France, 1982); Prague (Czechoslovakia, 1984); Rome (Italy, 1986); Copenhagen (Denmark, 1988); Dubrovnik (Yugoslavia, 1990); Neuchˆ atel (Switzerland, 1992); Vienna (Austria,1994); Barcelona (Spain, 1996);Bristol(UK,1998);Utrecht(TheNetherlands,2000);Berlin(Germany, 2002); Prague (Czech Republic, 2004).

COMPSTAT 2008: Proceedings in Computational Statistics

18th Symposium Held in Porto, Portugal, 2008

Comptia Casp+ Cas-004 Certification Guide: Develop Casp+ Skills And Learn All The Key Topics Needed To Prepare For The Certification Exam

Develop CASP+ skills and learn all the key topics needed to prepare for the certifi cation exam

Computability: A Mathematical Sketchbook (Graduate Texts in Mathematics #146)

Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.

Computability

This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of “mechanical process” using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski’s theorem on the non-representability of truth, Goedel’s incompleteness and Rosser’s incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church’s thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oracle computations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum’s complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.

Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday (Lecture Notes in Computer Science #10010)

This Festschrift is published in honor of Rodney G. Downey, eminent logician and computer scientist, surfer and Scottish country dancer, on the occasion of his 60th birthday.The Festschrift contains papers and laudations that showcase the broad and important scientific, leadership and mentoring contributions made by Rod during his distinguished career. The volume contains 42 papers presenting original unpublished research, or expository and survey results in Turing degrees, computably enumerable sets, computable algebra, computable model theory, algorithmic randomness, reverse mathematics, and parameterized complexity, all areas in which Rod Downey has had significant interests and influence. The volume contains several surveys that make the various areas accessible to non-specialists while also including some proofs that illustrate the flavor of the fields.

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which seeks to clarify what we mean by computation or algorithm. When is there a computational solution possible to some question? How can we show that none is possible? How computationally hard is the question we are concerned with? Arguably, this area lead to the development of digital computers. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space. Can we perform some task in a feasible number of steps? Can we perform some algorithm with only a limited memory? Does randomness help? Are there standard approaches to overcoming computational difficulty?

Computability and Complexity in Analysis: 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers (Lecture Notes in Computer Science #2064)

The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.

Computability and Models: Perspectives East and West (University Series in Mathematics)

Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com­ putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network.

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.The number of exercises included has more than tripled.Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

Computability of Julia Sets (Algorithms and Computation in Mathematics #23)

Among all computer-generated mathematical images, Julia sets of rational maps occupy one of the most prominent positions. Their beauty and complexity can be fascinating. They also hold a deep mathematical content. Computational hardness of Julia sets is the main subject of this book. By definition, a computable set in the plane can be visualized on a computer screen with an arbitrarily high magnification. There are countless programs to draw Julia sets. Yet, as the authors have discovered, it is possible to constructively produce examples of quadratic polynomials, whose Julia sets are not computable. This result is striking - it says that while a dynamical system can be described numerically with an arbitrary precision, the picture of the dynamics cannot be visualized. The book summarizes the present knowledge (most of it from the authors' own work) about the computational properties of Julia sets in a self-contained way. It is accessible to experts and students with interest in theoretical computer science or dynamical systems.

The Computability of the World: How Far Can Science Take Us? (The Frontiers Collection)

In this thought-provoking book Küppers, an internationally renowned physicist, philosopher and theoretical biologist, addresses a number of science's deepest questions: Can physics advance to the origin of all things and explain the unique phenomena of life, time and history? Are there unsolvable enigmas of the world? How did life originate? Is language a general phenomenon of Nature? What is time? Is it possible to express the history of the world in formulae? Where is science leading us? These and other provocative questions essential for a deeper understanding of the world are treated here in a refreshing and stimulating manner.

Computability Theory (Chapman Hall/CRC Mathematics Series)

Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences. Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level.The book includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science.Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable and lively way.

Computability Theory: Journeys Beyond The Turing Barrier (Chapman Hall/CRC Mathematics Series)

Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences. Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level.The book includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science.Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable and lively way.

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text.

Computable Models

Computational models can be found everywhere in present day science and engineering. In providing a logical framework and foundation for the specification and design of specification languages, Raymond Turner uses this framework to introduce and study computable models. In doing so he presents the first systematic attempt to provide computational models with a logical foundation. Computable models have wide-ranging applications from programming language semantics and specification languages, through to knowledge representation languages and formalism for natural language semantics. They are also implicit in computer modelling in many areas of physical and social science. This detailed investigation into the logical foundations of specification and specification languages and their application to the definition of programming languages, coupled with a clear exposition of theories of data and computable models as mathematical notions will be welcomed by researchers and graduate students.