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

Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings (Lecture Notes in Computer Science #13538)

This book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, Germany, in September 2022.The 12 papers included in these proceedings were carefully reviewed and selected from21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc.

Approximation and Online Algorithms: 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers (Lecture Notes in Computer Science #11312)

This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

Approximation and Online Algorithms: 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers (Lecture Notes in Computer Science #12982)

This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.

Approximation and Online Algorithms: 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers (Lecture Notes in Computer Science #10787)

This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017.The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

Approximation and Optimization: Proceedings of the International Seminar, held in Havana, Cuba, January 12-16, 1987 (Lecture Notes in Mathematics #1354)

Approximation and Optimization: Algorithms, Complexity and Applications (Springer Optimization and Its Applications #145)

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading experts and reflect emerging directions and connections in data approximation and optimization. Chapters discuss state of the art topics with highly relevant applications throughout science, engineering, technology and social sciences. Academics, researchers, data science practitioners, business analysts, social sciences investigators and graduate students will find the number of illustrations, applications, and examples provided useful. This volume is based on the conference Approximation and Optimization: Algorithms, Complexity, and Applications, which was held in the National and Kapodistrian University of Athens, Greece, June 29–30, 2017. The mix of survey and research content includes topics in approximations to discrete noisy data; binary sequences; design of networks and energy systems; fuzzy control; large scale optimization; noisy data; data-dependent approximation; networked control systems; machine learning ; optimal design; no free lunch theorem; non-linearly constrained optimization; spectroscopy.

Approximation and Stability Properties of Numerical Methods for Hyperbolic Conservation Laws

The book focuses on stability and approximation results concerning recent numerical methods for the numerical solution of hyperbolic conservation laws. The work begins with a detailed and thorough introduction of hyperbolic conservation/balance laws and their numerical treatment. In the main part, recent results in such context are presented focusing on the investigation of approximation properties of discontinuous Galerkin and flux reconstruction methods, the construction of (entropy) stable numerical methods and the extension of existing (entropy) stability results for both semidiscrete and fully discrete schemes, and development of new high-order methods.

Approximation by Max-Product Type Operators

This monograph presents a broad treatment of developments in an area of constructive approximation involving the so-called "max-product" type operators. The exposition highlights the max-product operators as those which allow one to obtain, in many cases, more valuable estimates than those obtained by classical approaches. The text considers a wide variety of operators which are studied for a number of interesting problems such as quantitative estimates, convergence, saturation results, localization, to name several.Additionally, the book discusses the perfect analogies between the probabilistic approaches of the classical Bernstein type operators and of the classical convolution operators (non-periodic and periodic cases), and the possibilistic approaches of the max-product variants of these operators. These approaches allow for two natural interpretations of the max-product Bernstein type operators and convolution type operators: firstly, as possibilistic expectations of some fuzzy variables, and secondly, as bases for the Feller type scheme in terms of the possibilistic integral. These approaches also offer new proofs for the uniform convergence based on a Chebyshev type inequality in the theory of possibility.Researchers in the fields of approximation of functions, signal theory, approximation of fuzzy numbers, image processing, and numerical analysis will find this book most beneficial. This book is also a good reference for graduates and postgraduates taking courses in approximation theory.

Approximation by Multivariate Singular Integrals (SpringerBriefs in Mathematics)

Approximation by Multivariate Singular Integrals is the first monograph to illustrate the approximation of multivariate singular integrals to the identity-unit operator. The basic approximation properties of the general multivariate singular integral operators is presented quantitatively, particularly special cases such as the multivariate Picard, Gauss-Weierstrass, Poisson-Cauchy and trigonometric singular integral operators are examined thoroughly. This book studies the rate of convergence of these operators to the unit operator as well as the related simultaneous approximation. The last chapter, which includes many examples, presents a related Korovkin type approximation theorem for functions of two variables. Relevant background information and motivation is included in this exposition, and as a result this book can be used as supplementary text for several advanced courses. The results presented apply to many areas of pure and applied mathematics, such a mathematical analysis, probability, statistics and partial differential equations. This book is appropriate for researchers and selected seminars at the graduate level.

Approximation by Solutions of Partial Differential Equations (Nato Science Series C: #365)

This volume consists of the proceedings of the NATO Advanced Research Workshop on Approximation by Solutions of Partial Differential Equations, Quadrature Formulae, and Related Topics, which was held at Hanstholm, Denmark. These proceedings include the main invited talks and contributed papers given during the workshop. The aim of these lectures was to present a selection of results of the latest research in the field. In addition to covering topics in approximation by solutions of partial differential equations and quadrature formulae, this volume is also concerned with related areas, such as Gaussian quadratures, the Pompelu problem, rational approximation to the Fresnel integral, boundary correspondence of univalent harmonic mappings, the application of the Hilbert transform in two dimensional aerodynamics, finely open sets in the limit set of a finitely generated Kleinian group, scattering theory, harmonic and maximal measures for rational functions and the solution of the classical Dirichlet problem. In addition, this volume includes some problems in potential theory which were presented in the Problem Session at Hanstholm.

Approximation, Complex Analysis, and Potential Theory (NATO Science Series II: Mathematics, Physics and Chemistry #37)

Hermann Weyl considered value distribution theory to be the greatest mathematical achievement of the first half of the 20th century. The present lectures show that this beautiful theory is still growing. An important tool is complex approximation and some of the lectures are devoted to this topic. Harmonic approximation started to flourish astonishingly rapidly towards the end of the 20th century, and the latest development, including approximation manifolds, are presented here. Since de Branges confirmed the Bieberbach conjecture, the primary problem in geometric function theory is to find the precise value of the Bloch constant. After more than half a century without progress, a breakthrough was recently achieved and is presented. Other topics are also presented, including Jensen measures. A valuable introduction to currently active areas of complex analysis and potential theory. Can be read with profit by both students of analysis and research mathematicians.

Approximation Methods for Navier-Stokes Problems: Proceedings of the Symposium Held by the International Union of Theoretical and Applied Mechanics (IUTAM) at the University of Paderborn, Germany, September 9-15, 1979 (Lecture Notes in Mathematics #771)

Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications (SpringerBriefs in Optimization)

Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications. This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science.

Approximation Methods in Probability Theory (Universitext)

This book presents a wide range of well-known and less common methods used for estimating the accuracy of probabilistic approximations, including the Esseen type inversion formulas, the Stein method as well as the methods of convolutions and triangle function. Emphasising the correct usage of the methods presented, each step required for the proofs is examined in detail. As a result, this textbook provides valuable tools for proving approximation theorems. While Approximation Methods in Probability Theory will appeal to everyone interested in limit theorems of probability theory, the book is particularly aimed at graduate students who have completed a standard intermediate course in probability theory. Furthermore, experienced researchers wanting to enlarge their toolkit will also find this book useful.

Approximation Methods in Science and Engineering

Approximation Methods in Engineering and Science covers fundamental and advanced topics in three areas: Dimensional Analysis, Continued Fractions, and Stability Analysis of the Mathieu Differential Equation. Throughout the book, a strong emphasis is given to concepts and methods used in everyday calculations. Dimensional analysis is a crucial need for every engineer and scientist to be able to do experiments on scaled models and use the results in real world applications. Knowing that most nonlinear equations have no analytic solution, the power series solution is assumed to be the first approach to derive an approximate solution. However, this book will show the advantages of continued fractions and provides a systematic method to develop better approximate solutions in continued fractions. It also shows the importance of determining stability chart of the Mathieu equation and reviews and compares several approximate methods for that. The book provides the energy-rate method to study the stability of parametric differential equations that generates much better approximate solutions.

Approximation of Additive Convolution-Like Operators: Real C*-Algebra Approach (Frontiers in Mathematics)

This book deals with numerical analysis for certain classes of additive operators and related equations, including singular integral operators with conjugation, the Riemann-Hilbert problem, Mellin operators with conjugation, double layer potential equation, and the Muskhelishvili equation. The authors propose a unified approach to the analysis of the approximation methods under consideration based on special real extensions of complex C*-algebras. The list of the methods considered includes spline Galerkin, spline collocation, qualocation, and quadrature methods. The book is self-contained and accessible to graduate students.

The Approximation of Continuous Functions by Positive Linear Operators (Lecture Notes in Mathematics #293)

Approximation of Euclidean Metric by Digital Distances

This book discusses different types of distance functions defined in an n-D integral space for their usefulness in approximating the Euclidean metric. It discusses the properties of these distance functions and presents various kinds of error analysis in approximating Euclidean metrics. It also presents a historical perspective on efforts and motivation for approximating Euclidean metrics by digital distances from the mid-sixties of the previous century. The book also contains an in-depth presentation of recent progress, and new research problems in this area.

Approximation of Free-Discontinuity Problems (Lecture Notes in Mathematics #1694)

Functionals involving both volume and surface energies have a number of applications ranging from Computer Vision to Fracture Mechanics. In order to tackle numerical and dynamical problems linked to such functionals many approximations by functionals defined on smooth functions have been proposed (using high-order singular perturbations, finite-difference or non-local energies, etc.) The purpose of this book is to present a global approach to these approximations using the theory of gamma-convergence and of special functions of bounded variation. The book is directed to PhD students and researchers in calculus of variations, interested in approximation problems with possible applications.

Approximation of Functions of Several Variables and Imbedding Theorems (Grundlehren der mathematischen Wissenschaften #205)

Approximation of Stochastic Invariant Manifolds: Stochastic Manifolds for Nonlinear SPDEs I (SpringerBriefs in Mathematics)

This first volume is concerned with the analytic derivation of explicit formulas for the leading-order Taylor approximations of (local) stochastic invariant manifolds associated with a broad class of nonlinear stochastic partial differential equations. These approximations take the form of Lyapunov-Perron integrals, which are further characterized in Volume II as pullback limits associated with some partially coupled backward-forward systems. This pullback characterization provides a useful interpretation of the corresponding approximating manifolds and leads to a simple framework that unifies some other approximation approaches in the literature. A self-contained survey is also included on the existence and attraction of one-parameter families of stochastic invariant manifolds, from the point of view of the theory of random dynamical systems.

Approximation, Optimization and Mathematical Economics

The articles in this proceedings volume reflect the current trends in the theory of approximation, optimization and mathematical economics, and include numerous applications. The book will be of interest to researchers and graduate students involved in functional analysis, approximation theory, mathematical programming and optimization, game theory, mathematical finance and economics.

Approximation, Probability, and Related Fields

Proceedings of a conference held in Santa Barbara, California, May 20-22, 1993

Approximation, Randomization and Combinatorial Optimization: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001 (Lecture Notes in Computer Science #2129)

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 (Lecture Notes in Computer Science #2764)

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.