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 Elements Using Maxima: Theory and Routines for Rods and Beams

This book provides a study aid on the finite element method. Based on the free computer algebra system “Maxima”, it presents routines to symbolically or numerically solve problems in the context of plane truss and frame structures. This allows readers to not only check classical “hand calculations” but also understand the computer implementation of the method. The mechanical theories focus on the classical one-dimensional structural elements, i.e. bars, Euler–Bernoulli and Timoshenko beams as well as their combination to generalized beam elements. Focusing on one-dimensional elements reduces the complexity of the mathematical framework and the resulting matrix equations can still be displayed with all components, and not only in a symbolic representation. The use of a computer algebra system and the incorporated functions, e.g. for equation solving, highlights the methodology of the finite element method rather than standard procedures.The book is based on the Springer Brief “Finite Elements for Truss and Frame Structures” (978-3-319-94940-6) by the same authors.

Finite Fields: Normal Bases and Completely Free Elements (The Springer International Series in Engineering and Computer Science #390)

Finite Fields are fundamental structures of Discrete Mathematics. They serve as basic data structures in pure disciplines like Finite Geometries and Combinatorics, and also have aroused much interest in applied disciplines like Coding Theory and Cryptography. A look at the topics of the proceed­ ings volume of the Third International Conference on Finite Fields and Their Applications (Glasgow, 1995) (see [18]), or at the list of references in I. E. Shparlinski's book [47] (a recent extensive survey on the Theory of Finite Fields with particular emphasis on computational aspects), shows that the area of Finite Fields goes through a tremendous development. The central topic of the present text is the famous Normal Basis Theo­ rem, a classical result from field theory, stating that in every finite dimen­ sional Galois extension E over F there exists an element w whose conjugates under the Galois group of E over F form an F-basis of E (i. e. , a normal basis of E over F; w is called free in E over F). For finite fields, the Nor­ mal Basis Theorem has first been proved by K. Hensel [19] in 1888. Since normal bases in finite fields in the last two decades have been proved to be very useful for doing arithmetic computations, at present, the algorithmic and explicit construction of (particular) such bases has become one of the major research topics in Finite Field Theory.

Finite Fields: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography (Mathematics and Its Applications #477)

This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in­ clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener­ ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod­ ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.

Finite Fields and Applications: Proceedings of The Fifth International Conference on Finite Fields and Applications Fq 5, held at the University of Augsburg, Germany, August 2–6, 1999

Finite Fields and Applications: 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers (Lecture Notes in Computer Science #2948)

Finite Fields with Applications to Coding Theory, Cryptography and Related Areas: Proceedings of the Sixth International Conference on Finite Fields and Applications, held at Oaxaca, México, May 21–25, 2001

Finite Form Representations for Meijer G and Fox H Functions: Applied to Multivariate Likelihood Ratio Tests Using Mathematica®, MAXIMA and R (Lecture Notes in Statistics #223)

This book depicts a wide range of situations in which there exist finite form representations for the Meijer G and the Fox H functions. Accordingly, it will be of interest to researchers and graduate students who, when implementing likelihood ratio tests in multivariate analysis, would like to know if there exists an explicit manageable finite form for the distribution of the test statistics. In these cases, both the exact quantiles and the exact p-values of the likelihood ratio tests can be computed quickly and efficiently.The test statistics in question range from common ones, such as those used to test e.g. the equality of means or the independence of blocks of variables in real or complex normally distributed random vectors; to far more elaborate tests on the structure of covariance matrices and equality of mean vectors. The book also provides computational modules in Mathematica®, MAXIMA and R, which allow readers to easily implement, plot and compute the distributions of any of these statistics, or any other statistics that fit into the general paradigm described here.

Finite Frames: Theory and Applications (Applied and Numerical Harmonic Analysis)

Hilbert space frames have long served as a valuable tool for signal and image processing due to their resilience to additive noise, quantization, and erasures, as well as their ability to capture valuable signal characteristics. More recently, finite frame theory has grown into an important research topic in its own right, with a myriad of applications to pure and applied mathematics, engineering, computer science, and other areas. The number of research publications, conferences, and workshops on this topic has increased dramatically over the past few years, but no survey paper or monograph has yet appeared on the subject.Edited by two of the leading experts in the field, Finite Frames aims to fill this void in the literature by providing a comprehensive, systematic study of finite frame theory and applications. With carefully selected contributions written by highly experienced researchers, it covers topics including:* Finite Frame Constructions;* Optimal Erasure Resilient Frames;* Quantization of Finite Frames;* Finite Frames and Compressed Sensing;* Group and Gabor Frames;* Fusion Frames.Despite the variety of its chapters' source and content, the book's notation and terminology are unified throughout and provide a definitive picture of the current state of frame theory.With a broad range of applications and a clear, full presentation, this book is a highly valuable resource for graduate students and researchers across disciplines such as applied harmonic analysis, electrical engineering, quantum computing, medicine, and more. It is designed to be used as a supplemental textbook, self-study guide, or reference book.

Finite Geometries: Proceedings of the Fourth Isle of Thorns Conference (Developments in Mathematics #3)

When? These are the proceedings of Finite Geometries, the Fourth Isle of Thorns Conference, which took place from Sunday 16 to Friday 21 July, 2000. It was organised by the editors of this volume. The Third Conference in 1990 was published as Advances in Finite Geometries and Designs by Oxford University Press and the Second Conference in 1980 was published as Finite Geometries and Designs by Cambridge University Press. The main speakers were A. R. Calderbank, P. J. Cameron, C. E. Praeger, B. Schmidt, H. Van Maldeghem. There were 64 participants and 42 contributions, all listed at the end of the volume. Conference web site http://www. maths. susx. ac. uk/Staff/JWPH/ Why? This collection of 21 articles describes the latest research and current state of the art in the following inter-linked areas: • combinatorial structures in finite projective and affine spaces, also known as Galois geometries, in which combinatorial objects such as blocking sets, spreads and partial spreads, ovoids, arcs and caps, as well as curves and hypersurfaces, are all of interest; • geometric and algebraic coding theory; • finite groups and incidence geometries, as in polar spaces, gener­ alized polygons and diagram geometries; • algebraic and geometric design theory, in particular designs which have interesting symmetric properties and difference sets, which play an important role, because of their close connections to both Galois geometry and coding theory.

Finite Geometry and Character Theory (Lecture Notes in Mathematics #1601)

Difference sets are of central interest in finite geometry and design theory. One of the main techniques to investigate abelian difference sets is a discrete version of the classical Fourier transform (i.e., character theory) in connection with algebraic number theory. This approach is described using only basic knowledge of algebra and algebraic number theory. It contains not only most of our present knowledge about abelian difference sets, but also gives applications of character theory to projective planes with quasiregular collineation groups. Therefore, the book is of interest both to geometers and mathematicians working on difference sets. Moreover, the Fourier transform is important in more applied branches of discrete mathematics such as coding theory and shift register sequences.

Finite Mixture and Markov Switching Models (Springer Series in Statistics)

The past decade has seen powerful new computational tools for modeling which combine a Bayesian approach with recent Monte simulation techniques based on Markov chains. This book is the first to offer a systematic presentation of the Bayesian perspective of finite mixture modelling. The book is designed to show finite mixture and Markov switching models are formulated, what structures they imply on the data, their potential uses, and how they are estimated. Presenting its concepts informally without sacrificing mathematical correctness, it will serve a wide readership including statisticians as well as biologists, economists, engineers, financial and market researchers.

Finite Mixture of Skewed Distributions (SpringerBriefs in Statistics)

This book presents recent results in finite mixtures of skewed distributions to prepare readers to undertake mixture models using scale mixtures of skew normal distributions (SMSN). For this purpose, the authors consider maximum likelihood estimation for univariate and multivariate finite mixtures where components are members of the flexible class of SMSN distributions. This subclass includes the entire family of normal independent distributions, also known as scale mixtures of normal distributions (SMN), as well as the skew-normal and skewed versions of some other classical symmetric distributions: the skew-t (ST), the skew-slash (SSL) and the skew-contaminated normal (SCN), for example. These distributions have heavier tails than the typical normal one, and thus they seem to be a reasonable choice for robust inference. The proposed EM-type algorithm and methods are implemented in the R package mixsmsn, highlighting the applicability of the techniques presented in the book.This work is a useful reference guide for researchers analyzing heterogeneous data, as well as a textbook for a graduate-level course in mixture models. The tools presented in the book make complex techniques accessible to applied researchers without the advanced mathematical background and will have broad applications in fields like medicine, biology, engineering, economic, geology and chemistry.

Finite Model Theory: First Edition (Perspectives in Mathematical Logic)

Finite model theory has its origin in classical model theory, but owes its systematic development to research from complexity theory. The book presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed- point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. Other topics include DATALOG languages, quantifiers and oracles, 0-1 laws, and optimization and approximation problems. The book is written in such a way that the resp. parts on model theory and descriptive complexity theory may be read independently.

Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,“thebranchof mathematical logic which deals with the relation between a formal language and its interpretations”. No wonder, then, that mathematical logic, and ?nite model theory in particular, should ?nd manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure. This volume gives a broadoverviewof some central themes of ?nite model theory: expressive power, descriptive complexity, and zero–one laws, together with selected applications to database theory and arti?cial intelligence, es- cially constraint databases and constraint satisfaction problems. The ?nal chapter provides a concise modern introduction to modal logic,which emp- sizes the continuity in spirit and technique with ?nite model theory.

Finite Quantum Electrodynamics: The Causal Approach (Theoretical and Mathematical Physics)

In this textbook for graduate students in physics the author carefully analyses the role of causality in Q.E.D. This new approach avoids ultraviolet divergences, so that the detailed calculations of scattering processes and proofs can be carried out in a mathematically rigorous manner. Significant themes such as renormalizability, gauge invariance, unitarity, renormalization group, interacting fields and axial anomalies are discussed. The extension of the methods to non-abelian gauge theories is briefly described.The book differs considerably from its first edition: Chap. 3 on Causal Perturbation Theory was completely rewritten and Chap. 4 on Properties of the S-Matrix and Chap. 5 on Other Electromagnetic Couplings are new.

Finite Quantum Electrodynamics (Theoretical and Mathematical Physics)

In this book the author carefully analyses the role of the concept of causality in Quantum Electrodynamics. This approach makes it possible for the first time to publish a textbook on QED which not only includes full proofs and detailed calculations but is also mathematically rigorous. The book begins with Dirac's theory in part one, followed in part two by the quantum theory of free fields including a new approach to the concept of exterior fields. The third part is devoted to the study of the S-matrix of QED avoiding ultraviolet divergence. The most important physical results of QED are derived, and significant themes such as unitarity and renormalizability of the theory are discussed. This slim book addresses graduate students in physics. From the reviews: "In the summary on the back cover the unheard-of statement appears that now the first (mathematically) rigorous textbook on Quantum Electrodynamics was on hand. ... In fact, "Finite Quantum Electrodynamics" does justice to this claim. And, in addition, in a pregnant, lifely form. On 220 pages G. Scharf (Zurich) succeeds in presenting a concise description of QED ... As promised, only finite quantities appear ... In Russia I often feel frustrated that I studied Latin in school and Russian was not offered. Now I have the same feeling after reading Scharf's book. I studied the wrong grammar up to now." #Translated from a review by Thomas Schücker in Physik in unserer Zeit#1

Finite Sample Analysis in Quantum Estimation (Springer Theses)

In this thesis, the author explains the background of problems in quantum estimation, the necessary conditions required for estimation precision benchmarks that are applicable and meaningful for evaluating data in quantum information experiments, and provides examples of such benchmarks. The author develops mathematical methods in quantum estimation theory and analyzes the benchmarks in tests of Bell-type correlation and quantum tomography with those methods. Above all, a set of explicit formulae for evaluating the estimation precision in quantum tomography with finite data sets is derived, in contrast to the standard quantum estimation theory, which can deal only with infinite samples. This is the first result directly applicable to the evaluation of estimation errors in quantum tomography experiments, allowing experimentalists to guarantee estimation precision and verify quantitatively that their preparation is reliable.

Finite State Machine Datapath Design, Optimization, and Implementation (Synthesis Lectures on Digital Circuits & Systems)

Finite State Machine Datapath Design, Optimization, and Implementation explores the design space of combined FSM/Datapath implementations. The lecture starts by examining performance issues in digital systems such as clock skew and its effect on setup and hold time constraints, and the use of pipelining for increasing system clock frequency. This is followed by definitions for latency and throughput, with associated resource tradeoffs explored in detail through the use of dataflow graphs and scheduling tables applied to examples taken from digital signal processing applications. Also, design issues relating to functionality, interfacing, and performance for different types of memories commonly found in ASICs and FPGAs such as FIFOs, single-ports, and dual-ports are examined. Selected design examples are presented in implementation-neutral Verilog code and block diagrams, with associated design files available as downloads for both Altera Quartus and Xilinx Virtex FPGA platforms. A working knowledge of Verilog, logic synthesis, and basic digital design techniques is required. This lecture is suitable as a companion to the synthesis lecture titled Introduction to Logic Synthesis using Verilog HDL. Table of Contents: Calculating Maximum Clock Frequency / Improving Design Performance / Finite State Machine with Datapath (FSMD) Design / Embedded Memory Usage in Finite State Machine with Datapath (FSMD) Designs

Finite State Machine Logic Synthesis for Complex Programmable Logic Devices (Lecture Notes in Electrical Engineering #231)

This book is a monograph devoted to logic synthesis and optimization for CPLDs. CPLDs' macrocell can also be interpreted as programmable AND-fixed OR structure, well known as PAL-based structure. The question is: what should be done when the number of implicants representing function exceeds the number of product terms available in a logic block. The answer is ... in the book.Logic synthesis and optimization methods dedicated for PAL-based structures are proposed. The methods strive to find the optimum fit for the combinational logic and finite state machines to the structure of the logic device and aim at area and speed optimization. The theoretical background and complete strategies are richly illustrated with examples and figures.

Finite-State Methods and Natural Language Processing: 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers (Lecture Notes in Computer Science #6062)

This book constitutes the refereed proceedings of the 8th International Workshop on the Finite-State-Methods and Natural Language Processing, FSMNLP 2009. The workshop was held at the University of Pretoria, South Africa on July 2009. In total 21 papers were submitted and of those papers 13 were accepted as regular papers and a further 6 as extended abstracts. The papers are devoted to computational morphology, natural language processing, finite-state methods, automata, and related formal language theory.

Finite-State Methods and Natural Language Processing: 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers (Lecture Notes in Computer Science #4002)

This book constitutes the thoroughly refereed post-proceedings of the 5th International Workshop on Finite-State Methods in Natural Language Processing, FSMNLP 2005, held in Helsinki, Finland, September 2005. The book presents 24 revised full papers and seven revised poster papers together with two invited contributions and abstracts of six software demos. Topics include morphology, optimality theory, some special FSM families, weighted FSM algorithms, FSM representations, exploration, ordered structures, and surface parsing.

Finite-State Text Processing (Synthesis Lectures on Human Language Technologies)

Weighted finite-state transducers (WFSTs) are commonly used by engineers and computational linguists for processing and generating speech and text. This book first provides a detailed introduction to this formalism. It then introduces Pynini, a Python library for compiling finite-state grammars and for combining, optimizing, applying, and searching finite-state transducers. This book illustrates this library's conventions and use with a series of case studies. These include the compilation and application of context-dependent rewrite rules, the construction of morphological analyzers and generators, and text generation and processing applications.

Finite Versus Infinite: Contributions to an Eternal Dilemma (Discrete Mathematics and Theoretical Computer Science)

The finite - infinite interplay is central in human thinking, from ancient philosophers and mathematicians (Zeno, Pythagoras), to modern mathe­ matics (Cantor, Hilbert) and computer science (Turing, Godel). Recent developments in mathematics and computer science suggest a) radically new answers to classical questions (e. g. , does infinity exist?, where does infinity come from?, how to reconcile the finiteness of the human brain with the infinity of ideas it produces?), b) new questions of debate (e. g. , what is the role played by randomness?, are computers capable of handling the infinity through unconventional media of computation?, how can one approximate efficiently the finite by the infinite and, conversely, the infinite by finite?). Distinguished authors from around the world, many of them architects of the mathematics and computer science for the new century, contribute to the volume. Papers are as varied as Professor Marcus' activity, to whom this volume is dedicated. They range from real analysis to DNA com­ puting, from linguistics to logic, from combinatorics on words to symbolic dynamics, from automata theory to geography, and so on, plus an incursion into the old history of conceptions about infinity and a list of philosophical "open problems". They are mainly mathematical and theoretical computer science texts, but not all of them are purely mathematical.

The Finite Volume Method in Computational Fluid Dynamics: An Advanced Introduction with OpenFOAM® and Matlab (Fluid Mechanics and Its Applications #113)

This textbook explores both the theoretical foundation of the Finite Volume Method (FVM) and its applications in Computational Fluid Dynamics (CFD). Readers will discover a thorough explanation of the FVM numerics and algorithms used for the simulation of incompressible and compressible fluid flows, along with a detailed examination of the components needed for the development of a collocated unstructured pressure-based CFD solver. Two particular CFD codes are explored. The first is uFVM, a three-dimensional unstructured pressure-based finite volume academic CFD code, implemented within Matlab. The second is OpenFOAM®, an open source framework used in the development of a range of CFD programs for the simulation of industrial scale flow problems.With over 220 figures, numerous examples and more than one hundred exercise on FVM numerics, programming, and applications, this textbook is suitable for use in an introductory course on the FVM, in an advanced course on numerics, and as a reference for CFD programmers and researchers.

Finite Volumes for Complex Applications IX - Methods, Theoretical Aspects, Examples: FVCA 9, Bergen, Norway, June 2020 (Springer Proceedings in Mathematics & Statistics #323)

The proceedings of the 9th conference on "Finite Volumes for Complex Applications" (Bergen, June 2020) are structured in two volumes. The first volume collects the focused invited papers, as well as the reviewed contributions from internationally leading researchers in the field of analysis of finite volume and related methods. Topics covered include convergence and stability analysis, as well as investigations of these methods from the point of view of compatibility with physical principles. Altogether, a rather comprehensive overview is given on the state of the art in the field. The properties of the methods considered in the conference give them distinguished advantages for a number of applications. These include fluid dynamics, magnetohydrodynamics, structural analysis, nuclear physics, semiconductor theory, carbon capture utilization and storage, geothermal energy and further topics. The second volume covers reviewed contributions reporting successful applications of finite volume and related methods in these fields. The finite volume method in its various forms is a space discretization technique for partial differential equations based on the fundamental physical principle of conservation. Many finite volume methods preserve further qualitative or asymptotic properties, including maximum principles, dissipativity, monotone decay of free energy, and asymptotic stability, making the finite volume methods compatible discretization methods, which preserve qualitative properties of continuous problems at the discrete level. This structural approach to the discretization of partial differential equations becomes particularly important for multiphysics and multiscale applications. The book is a valuable resource for researchers, PhD and master’s level students in numerical analysis, scientific computing and related fields such as partial differential equations, as well as engineers working in numerical modeling and simulations.