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

Finite Volumes for Complex Applications VI Problems & Perspectives: FVCA 6, International Symposium, Prague, June 6-10, 2011 (Springer Proceedings in Mathematics #4)

Finite volume methods are used for various applications in fluid dynamics, magnetohydrodynamics, structural analysis or nuclear physics. A closer look reveals many interesting phenomena and mathematical or numerical difficulties, such as true error analysis and adaptivity, modelling of multi-phase phenomena or fitting problems, stiff terms in convection/diffusion equations and sources. To overcome existing problems and to find solution methods for future applications requires many efforts and always new developments. The goal of The International Symposium on Finite Volumes for Complex Applications VI is to bring together mathematicians, physicists and engineers dealing with Finite Volume Techniques in a wide context. This book, divided in two volumes, brings a critical look at the subject (new ideas, limits or drawbacks of methods, theoretical as well as applied topics).

The Seventh European Conference on Combinatorics, Graph Theory and Applications: EuroComb 2013 (Publications of the Scuola Normale Superiore #16)

In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.

Inductive Logic Programming: 18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008, Proceedings (Lecture Notes in Computer Science #5194)

The 18th International Conference on Inductive Logic Programming was held in Prague, September 10–12, 2008. ILP returned to Prague after 11 years, and it is tempting to look at how the topics of interest have evolved during that time. The ILP community clearly continues to cherish its beloved ?rst-order logic representation framework. This is legitimate, as the work presented at ILP 2008 demonstrated that there is still room for both extending established ILP approaches (such as inverse entailment) and exploring novel logic induction frameworks (such as brave induction). Besides the topics lending ILP research its unique focus, we were glad to see in this year’s proceedings a good n- ber of papers contributing to areas such as statistical relational learning, graph mining, or the semantic web. To help open ILP to more mainstream research areas, the conference featured three excellent invited talks from the domains of the semantic web (Frank van Harmelen), bioinformatics (Mark Craven) and cognitive sciences (Josh Tenenbaum). We deliberately looked for speakers who are not directly involved in ILP research. We further invited a tutorial on stat- tical relational learning (Kristian Kersting) to meet the strong demand to have the topic presented from the ILP perspective. Lastly, Stefano Bertolo from the European Commission was invited to give a talk on the ideal niches for ILP in the current EU-supported research on intelligent content and semantics.

Forward Error Correction Based On Algebraic-Geometric Theory (SpringerBriefs in Electrical and Computer Engineering)

This book covers the design, construction, and implementation of algebraic-geometric codes from Hermitian curves. Matlab simulations of algebraic-geometric codes and Reed-Solomon codes compare their bit error rate using different modulation schemes over additive white Gaussian noise channel model. Simulation results of Algebraic-geometric codes bit error rate performance using quadrature amplitude modulation (16QAM and 64QAM) are presented for the first time and shown to outperform Reed-Solomon codes at various code rates and channel models. The book proposes algebraic-geometric block turbo codes. It also presents simulation results that show an improved bit error rate performance at the cost of high system complexity due to using algebraic-geometric codes and Chase-Pyndiah’s algorithm simultaneously. The book proposes algebraic-geometric irregular block turbo codes (AG-IBTC) to reduce system complexity. Simulation results for AG-IBTCs are presented for the first time.

Supercharge Your Applications With Graalvm: Hands-on Examples To Optimize And Extend Your Code Using Graalvm's High Performance And Polyglot Capabilities

Hands-on examples to optimize and extend your code using GraalVM's high performance and polyglot capabilities

New Paradigms in Flow Battery Modelling (Engineering Applications of Computational Methods #16)

This book provides a comprehensive review of the latest modelling developments in flow batteries, as well as some new results and insights. Flow batteries have long been considered the most flexible answer to grid scale energy storage, and modelling is a key component in their development. Recent modelling has moved beyond macroscopic methods, towards mesoscopic and smaller scales to select materials and design components. This is important for both fundamental understanding and the design of new electrode, catalyst and electrolyte materials. There has also been a recent explosion in interest in machine learning for electrochemical energy technologies. The scope of the book includes these latest developments and is focused on advanced techniques, rather than traditional modelling paradigms. The aim of this book is to introduce these concepts and methods to flow battery researcher, but the book would have a much broader appeal since these methods also employed in other battery and fuel cell systems and far beyond. The methods will be described in detail (necessary fundamental material in Appendices). The book appeals to graduate students and researchers in academia/industry working in electrochemical systems, or those working in computational chemistry/machine learning wishing to seek new application areas.

Basic Concepts in Computational Physics

With the development of ever more powerful computers a new branch of physics and engineering evolved over the last few decades: Computer Simulation or Computational Physics. It serves two main purposes:- Solution of complex mathematical problems such as, differential equations, minimization/optimization, or high-dimensional sums/integrals.- Direct simulation of physical processes, as for instance, molecular dynamics or Monte-Carlo simulation of physical/chemical/technical processes.Consequently, the book is divided into two main parts: Deterministic methods and stochastic methods. Based on concrete problems, the first part discusses numerical differentiation and integration, and the treatment of ordinary differential equations. This is augmented by notes on the numerics of partial differential equations. The second part discusses the generation of random numbers, summarizes the basics of stochastics which is then followed by the introduction of various Monte-Carlo (MC) methods. Specific emphasis is on MARKOV chain MC algorithms. All this is again augmented by numerous applications from physics. The final two chapters on Data Analysis and Stochastic Optimization share the two main topics as a common denominator. The book offers a number of appendices to provide the reader with more detailed information on various topics discussed in the main part. Nevertheless, the reader should be familiar with the most important concepts of statistics and probability theory albeit two appendices have been dedicated to provide a rudimentary discussion.

Formal Methods in Computer-Aided Design: 4th International Conference, FMCAD 2002, Portland, OR, USA, November 6-8, 2002, Proceedings (Lecture Notes in Computer Science #2517)

This volume contains the proceedings of the Fourth Biennial Conference on F- mal Methods in Computer-Aided Design (FMCAD). The conference is devoted to the use of mathematical methods for the analysis of digital hardware c- cuits and systems. The workreported in this bookdescribes the use of formal mathematics and associated tools to design and verify digital hardware systems. Functional veri?cation has become one of the principal costs in a modern computer design e?ort. FMCAD provides a venue for academic and industrial researchers and practitioners to share their ideas and experiences of using - screte mathematical modeling and veri?cation. Over the past 20 years, this area has grown from just a few academic researchers to a vibrant worldwide com- nity of people from both academia and industry. This volume includes 23 papers selected from the 47 submitted papers, each of which was reviewed by at least three program committee members. The history of FMCAD dates backto 1984, when the earliest meetings on this topic occurred as part of IFIP WG10.2.

Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings (Lecture Notes in Computer Science #1869)

This volume is the proceedings of the 13th International Conference on Theo­ rem Proving in Higher Order Logics (TPHOLs 2000) held 14-18 August 2000 in Portland, Oregon, USA. Each of the 55 papers submitted in the full rese­ arch category was refereed by at least three reviewers who were selected by the program committee. Because of the limited space available in the program and proceedings, only 29 papers were accepted for presentation and publication in this volume. In keeping with tradition, TPHOLs 2000 also offered a venue for the presen­ tation of work in progress, where researchers invite discussion by means of a brief preliminary talk and then discuss their work at a poster session. A supplemen­ tary proceedings containing associated papers for work in progress was published by the Oregon Graduate Institute (OGI) as technical report CSE-00-009. The organizers are grateful to Bob Colwell, Robin Milner and Larry Wos for agreeing to give invited talks. Bob Colwell was the lead architect on the Intel P6 microarchitecture, which introduced a number of innovative techniques and achieved enormous commercial success. As such, he is ideally placed to offer an industrial perspective on the challenges for formal verification. Robin Milner contributed many key ideas to computer theorem proving, and to functional programming, through his leadership of the influential Edinburgh LCF project.

Survival and Event History Analysis: A Process Point of View (Statistics for Biology and Health)

The aim of this book is to bridge the gap between standard textbook models and a range of models where the dynamic structure of the data manifests itself fully. The common denominator of such models is stochastic processes. The authors show how counting processes, martingales, and stochastic integrals fit very nicely with censored data. Beginning with standard analyses such as Kaplan-Meier plots and Cox regression, the presentation progresses to the additive hazard model and recurrent event data. Stochastic processes are also used as natural models for individual frailty; they allow sensible interpretations of a number of surprising artifacts seen in population data. The stochastic process framework is naturally connected to causality. The authors show how dynamic path analyses can incorporate many modern causality ideas in a framework that takes the time aspect seriously. To make the material accessible to the reader, a large number of practical examples, mainly from medicine, are developed in detail. Stochastic processes are introduced in an intuitive and non-technical manner. The book is aimed at investigators who use event history methods and want a better understanding of the statistical concepts. It is suitable as a textbook for graduate courses in statistics and biostatistics.

Applications and Theory of Petri Nets 2003: 24th International Conference, ICATPN 2003, Eindhoven, The Netherlands, June 23-27, 2003, Proceedings (Lecture Notes in Computer Science #2679)

The refereed proceedings of the 24th International Conference on Applications and Theory of Petri Nets, ICATPN 2003, held in Eindhoven, The Netherlands, in June 2003. The 25 revised full papers presented together with 6 invited contributions were carefully reviewed and selected from 77 submissions. All current issues on research and development in the area of Petri nets are addressed, in particular concurrent systems design and analysis, model checking, networking, business process modeling, formal methods in software engineering, agent systems, systems specification, systems validation, discrete event systems, protocols, and prototyping.

Business Process Management: International Conference, BPM 2003, Eindhoven, The Netherlands, June 26-27, 2003, Proceedings (Lecture Notes in Computer Science #2678)

The refereed proceedings of the International Conference on Business Process Management, BPM 2003, held in Eindhoven, The Netherlands, in June 2003. The 25 revised full papers presented together with an introductory survey article were carefully reviewed and selected from 77 submissions. Among the issues addressed are Web services, workflow modeling, business process modeling, collaborative computing, computer-supported collaborative work, workflow patterns, business process engineering, business process patterns, workflow systems, Petri nets, process services, business process reengineering, and business process management tools.

Microsoft Dynamics AX 2012 R3 Financial Management

This book is intended for application consultants, controllers, CFOs, and other professionals who are engaged in a Microsoft Dynamics AX implementation project. Basic knowledge of financial terms, concepts, and Microsoft Dynamics AX terminologies is required.

Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings (Lecture Notes in Computer Science #2081)

This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- torial optimization. The aim is to present recent developments in theory, com- tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III, - ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every three-year period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years.

Integer Programming and Combinatorial Optimization: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings (Lecture Notes in Computer Science #13265)

This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully reviewed and selected from 93 submissions addressing key techniques of document analysis. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.

A Practical Introduction to Survey Design: A Beginner′s Guide

This is your definitive guide to designing your social survey. It includes all the knowledge and skills you need to plan your survey with confidence and ease. Every step of survey design from developing your questions, to administering your survey and preparing your data for analysis, is explained in easy to follow language. It features: Case studies demonstrating how effective surveys are conducted in real life Clear advice on how to design an ethical social survey Practical exercises to help you construct your survey Suggestions for further reading taken from cutting edge, multidisciplinary sources The book also comes with a host of useful online resources, including templates and reflective questions, to help strengthen your understanding and apply your new found knowledge.

A Practical Introduction to Survey Design: A Beginner′s Guide

This is your definitive guide to designing your social survey. It includes all the knowledge and skills you need to plan your survey with confidence and ease. Every step of survey design from developing your questions, to administering your survey and preparing your data for analysis, is explained in easy to follow language. It features: Case studies demonstrating how effective surveys are conducted in real life Clear advice on how to design an ethical social survey Practical exercises to help you construct your survey Suggestions for further reading taken from cutting edge, multidisciplinary sources The book also comes with a host of useful online resources, including templates and reflective questions, to help strengthen your understanding and apply your new found knowledge.

A Practical Introduction to Survey Design: A Beginner′s Guide

This is your definitive guide to designing your social survey. It includes all the knowledge and skills you need to plan your survey with confidence and ease. Every step of survey design from developing your questions, to administering your survey and preparing your data for analysis, is explained in easy to follow language. It features: Case studies demonstrating how effective surveys are conducted in real life Clear advice on how to design an ethical social survey Practical exercises to help you construct your survey Suggestions for further reading taken from cutting edge, multidisciplinary sources The book also comes with a host of useful online resources, including templates and reflective questions, to help strengthen your understanding and apply your new found knowledge.

The Cambridge N-Body Lectures (Lecture Notes in Physics #760)

Published under the auspices of the Royal Astronomical Society, this volume contains a set of extensive school tested lectures, with the aim to give a coherent and thorough background knowledge of the subject and to introduce the latest developments in N-body computational astrophysics. The topics cover a wide range from the classical few-body problem with discussions of resonance, chaos and stability to realistic modelling of star clusters as well as descriptions of codes, algorithms and special hardware for N-body simulations. This collection of topics, related to the gravitational N-body problem, will prove useful to both students and researchers in years to come.1) Published under the auspices of the Royal Astronomical Society.

Parle ’91 Parallel Architectures and Languages Europe: Volume I: Parallel Architectures and Algorithms Eindhoven, The Netherlands, June 10–13, 1991 Proceedings (Lecture Notes in Computer Science #505)

The innovative progress in the development oflarge-and small-scale parallel computing systems and their increasing availability have caused a sharp rise in interest in the scientific principles that underlie parallel computation and parallel programming. The biannual "Parallel Architectures and Languages Europe" (PARLE) conferences aim at presenting current research material on all aspects of the theory, design, and application of parallel computing systems and parallel processing. At the same time, the goal of the PARLE conferences is to provide a forum for researchers and practitioners to ex­ change ideas on recent developments and trends in the field of parallel com­ puting and parallel programming. The first ~wo conferences, PARLE '87 and PARLE '89, have succeeded in meeting this goal and made PARLE a conference that is recognized worldwide in the field of parallel computation. PARLE '91 again offers a wealth of high-quality research material for the benefit of the scientific community. Compared to its predecessors, the scope of PARLE '91 has been broadened so as to cover the area of parallel algo­ rithms and complexity, in addition to the central themes of parallel archi­ tectures and languages. The proceedings of the PARLE '91 conference contain the text of all con­ tributed papers that were selected for the programme and of the invited papers by leading experts in the field.

Local Search in Combinatorial Optimization

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård.

Local Search in Combinatorial Optimization (PDF)

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård.

Plane and Solid Geometry (Universitext)

This is a book on Euclidean geometry that covers the standard material in a completely new way, while also introducing a number of new topics that would be suitable as a junior-senior level undergraduate textbook. The author does not begin in the traditional manner with abstract geometric axioms. Instead, he assumes the real numbers, and begins his treatment by introducing such modern concepts as a metric space, vector space notation, and groups, and thus lays a rigorous basis for geometry while at the same time giving the student tools that will be useful in other courses.

Die Berechnung der Zylinderschalen

An Introductory Course in Summability Theory

An introductory course in summability theory for students, researchers, physicists, and engineers In creating this book, the authors’ intent was to provide graduate students, researchers, physicists, and engineers with a reasonable introduction to summability theory. Over the course of nine chapters, the authors cover all of the fundamental concepts and equations informing summability theory and its applications, as well as some of its lesser known aspects. Following a brief introduction to the history of summability theory, general matrix methods are introduced, and the Silverman-Toeplitz theorem on regular matrices is discussed. A variety of special summability methods, including the Nörlund method, the Weighted Mean method, the Abel method, and the (C, 1) - method are next examined. An entire chapter is devoted to a discussion of some elementary Tauberian theorems involving certain summability methods. Following this are chapters devoted to matrix transforms of summability and absolute summability domains of reversible and normal methods; the notion of a perfect matrix method; matrix transforms of summability and absolute summability domains of the Cesàro and Riesz methods; convergence and the boundedness of sequences with speed; and convergence, boundedness, and summability with speed. • Discusses results on matrix transforms of several matrix methods • The only English-language textbook describing the notions of convergence, boundedness, and summability with speed, as well as their applications in approximation theory • Compares the approximation orders of Fourier expansions in Banach spaces by different matrix methods • Matrix transforms of summability domains of regular perfect matrix methods are examined • Each chapter contains several solved examples and end-of-chapter exercises, including hints for solutions An Introductory Course in Summability Theory is the ideal first text in summability theory for graduate students, especially those having a good grasp of real and complex analysis. It is also a valuable reference for mathematics researchers and for physicists and engineers who work with Fourier series, Fourier transforms, or analytic continuation. ANTS AASMA, PhD, is Associate Professor of Mathematical Economics in the Department of Economics and Finance at Tallinn University of Technology, Estonia. HEMEN DUTTA, PhD, is Senior Assistant Professor of Mathematics at Gauhati University, India. P.N. NATARAJAN, PhD, is Formerly Professor and Head of the Department of Mathematics, Ramakrishna Mission Vivekananda College, Chennai, Tamilnadu, India.