Skip to main content

Books in Mathematics

The Mathematics collection presents a range of foundational and advanced research content across applied and discrete mathematics, including fields such as Computational Mathematics; Differential Equations; Linear Algebra; Modelling & Simulation; Numerical Analysis; Probability & Statistics.

  • The Retinoids: v. 2

    • 1st Edition
    • BAERT ET BAERT ET AL
    • English
    The Retinoids is a collection of papers that deals with the biochemistry and metabolism of the retinoids and of specific retinoid-binding proteins that are found in plasma and in cells. Some papers describes the biosynthesis and metabolism of retinol, with plasma retinol-binding protein, with intracellular retinoid-binding proteins, as well as with the metabolism and role of retinoids in the eye. Other papers review the metabolism of retinoic acid and synthetic retinoids, the cellular and molecular mechanisms of action of the retinoids, and applied biology of the retinoids. Several papers discuss toxicology, teratology, immunology, and the applications of retinoids in the fields of cancer and dermatology. One paper describes the transport of retinoic acid and other acidic retinoids in plasma in association with serum albumin. Another paper hypothesizes that vitamin A affects differentiation at the cellular level and addresses how tissue specificity of this action can arise. One paper examines the role of retinoid-binding proteins in vertebrate visual system, particularly how these proteins transport retinoids in the serum, cell sap, and interstitial spaces of the eye. The collection can prove useful for biologists, microbiologists, cellular biologists, students and professors of biology, oncology, ophthalmology or dermatology.
  • Systematic Glossary of the Terminology of Statistical Methods

    English/French/Spanish/Russian
    • 1st Edition
    • I. Paenson
    • English
    Systematic Glossary of the Terminology of Statistical Methods focuses on the elaboration of terms used in statistical methods. The publication first elaborates on the subject and basic methods of statistics, collection of statistical data, and classification and tabulation of statistical data. Discussions focus on the basic methods of statistics, units used in statistics, statistical inquiry, and the subject of statistics. The text then ponders on graphic presentation, averages, and measurements of variation. The manuscript examines essential theoretical distributions, moments of a frequency distribution, and statistical inference. Topics include point and interval estimations, binomial and normal distributions, nature of theoretical distributions, and elements of the theory of probability. The text also evaluates the theory of attributes, correlation, analysis of variance, and time series, including decomposition of time series, multiple correlation, and variance analysis with two or more principles of classification. The publication is a valuable reference for readers interested in the terms used in statistical methods.
  • A Graduate Course in Probability

    • 1st Edition
    • Howard G. Tucker
    • Z. W. Birnbaum + 1 more
    • English
    Probability and Mathematical Statistics: A Series of Monographs and Textbooks: A Graduate Course in Probability presents some of the basic theorems of analytic probability theory in a cohesive manner. This book discusses the probability spaces and distributions, stochastic independence, basic limiting operations, and strong limit theorems for independent random variables. The central limit theorem, conditional expectation and martingale theory, and Brownian motion are also elaborated. The prerequisite for this text is knowledge of real analysis or measure theory, particularly the Lebesgue dominated convergence theorem, Fubini's theorem, Radon-Nikodym theorem, Egorov's theorem, monotone convergence theorem, and theorem on unique extension of a sigma-finite measure from an algebra to the sigma-algebra generated by it. This publication is suitable for a one-year graduate course in probability given in a mathematics program and preferably for students in their second year of graduate work.
  • Foundations of Microprogramming

    Architecture, Software, and Applications
    • 1st Edition
    • Ashok K. Agrawala + 1 more
    • Robert L. Ashenhurst
    • English
    Foundations of Microprogramming: Architecture, Software, and Applications discusses the foundations and trends in microprogramming, focusing on the architectural, software, and application aspects of microprogramming. The book reviews microprocessors, microprogramming concepts, and characteristics, as well as the architectural features in microprogrammed computers. The text explains support software and the different hierarchies or levels of languages. These include assembler languages which are mnemonic or symbolic representation of machine commands; the procedure oriented machine-dependent; and the procedure oriented machine independent. A simulator is used to interpret programs written in machine or micro-language before the instructions in the program can be run. A simulator and translator (which change some steps from one program written in another language to another program) should interface with the design language of the computer for these components to operate even when a new machine is developed. The book cites four existing computers which have "simple" diagonal microinstructions such as the Hewlett-Packard HP21MX and the Microdata 3200. Horizontal types of microinstructions allow parallel execution of many micro-operations, such as the Cal Data family of computers, the Varian 73, and the NANODATA QM-1. Microprogramming is applied in emulation, program enhancement, operating systems, signal processing, and graphics. The text can benefit programmers, computer engineers, computer technicians, and computer instructors dealing with many aspects of computers such as programming, hardware interface, networking, engineering or design.
  • Computer Chess

    • 1st Edition
    • Monroe Newborn
    • Thomas A. Standish
    • English
    Computer Chess deals with the history of computer chess games and the programming of computer chess. Topics covered include chess programs such as the one initiated by Richard Greenblatt and those launched by the United States and the USSR in 1966-1967. The United States Computer Chess Championships from 1970 to 1973 are also discussed. Comprised of 10 chapters, this book begins with a historical overview of the basic ideas underlying computer chess and several of the earliest computer games. The next chapter deals with the chess match held in 1966 pitting the Kotok-McCarthy Chess Program of the United States and the ITEP (Institute of Theoretical and Experimental Physics) Chess Program of the Soviet Union. The reader is then introduced to Greenblatt's program, named Mac Hack Six, the first chess program to compete respectably against humans in tournament play. Subsequent chapters focus on the U.S. Computer Chess Championships, from its first edition in New York in 1970 to the fourth, held in Atlanta in 1973. Russia's chess program called KAISSA, an improved version of the ITEP Chess Program, is also described. The final chapter is devoted to OSTRICH, a chess-playing program written by George Arnold in the Digital Computer Laboratory of Columbia University's Department of Electrical Engineering and Computer Science in 1971. This monograph will be of value to computer science and those interested in computer chess programs and in the broader field of artificial intelligence.
  • Differential Equations and Numerical Mathematics

    Selected Papers Presented to a National Conference Held in Novosibirsk, September 1978
    • 1st Edition
    • G. I. Marchuk
    • English
    Differential Equations and Numerical Mathematics contains selected papers presented in a national conference held in Novosibirsk on September 1978. This book, as the conference, is organized into three sections. Section A describes the modern theory of efficient cubature formulas; embedding theorems; and problems of spectral analysis. Section B considers the theoretical questions of partial differential equations, with emphasis on hyperbolic equations and systems, formulations, and methods for nonclassical problems of mathematical physics. Section C addresses the various problems of numerical mathematics, with focus on the optimum and asymptotically optimum algorithms for solving the problems of numerical mathematics.
  • Algebraic Theory of Automata

    • 1st Edition
    • Abraham Ginzburg
    • Robert L. Ashenhurst
    • English
    Algebraic Theory of Automata provides information pertinent to the methods and results of algebraic theory of automata. This book covers a variety of topics, including sets, semigroup, groupoids, isomorphism, semiautomata, proof of Kleene's theorem, and algebraic manipulations. Organized into seven chapters, this book begins with an overview of the fundamental properties of groups and semigroups. This text then examines the notion of semiautomaton, which serves as a basis for a rich and interesting theory. Other chapters consider algebraic notions and methods that are very useful in dealing with semiautomata. This book discusses as well some properties of the notion of covering of semiautomata. The final chapter deals with the theory of Krohn and Rhodes. This book is a valuable resource for graduate students.
  • A Computational Logic

    • 1st Edition
    • Robert S. Boyer + 1 more
    • Thomas A. Standish
    • English
    ACM Monograph Series: A Computational Logic focuses on the use of induction in proving theorems, including the use of lemmas and axioms, free variables, equalities, and generalization. The publication first elaborates on a sketch of the theory and two simple examples, a precise definition of the theory, and correctness of a tautology-checker. Topics include mechanical proofs, informal development, formal specification of the problem, well-founded relations, natural numbers, and literal atoms. The book then examines the use of type information to simplify formulas, use of axioms and lemmas as rewrite rules, and the use of definitions. Topics include nonrecursive functions, computing values, free variables in hypothesis, infinite backwards chaining, infinite looping, computing type sets, and type prescriptions. The manuscript takes a look at rewriting terms and simplifying clauses, eliminating destructors and irrelevance, using equalities, and generalization. Concerns include reasons for eliminating isolated hypotheses, precise statement of the generalization heuristic, restricting generalizations, precise use of equalities, and multiple destructors and infinite looping. The publication is a vital source of data for researchers interested in computational logic.
  • Computational Linguistics

    International Series in Modern Applied Mathematics and Computer Science
    • 1st Edition
    • Nick Cercone
    • English
    Computational Linguistics provides an overview of the variety of important research in computational linguistics in North America. This work is divided into 15 chapters and begins with a survey of the theoretical foundations and parsing strategies for natural language. The succeeding chapters deal with psychological and linguistic modeling, discourse processing analysis, text and content analysis, and natural language understanding, as well as knowledge organization, memory models, and learning. Other chapters describe the programming systems and considerations for computation linguistics. The last chapters look into the nature of natural language front-end processes to database systems. These chapters also examine the human factors interface. This book will prove useful to computing scientists, philosophers, psychologists, and linguists.
  • Tables of Laguerre Polynomials and Functions

    Mathematical Tables Series, Vol. 39
    • 1st Edition
    • V.S. Aizenshtadt + 2 more
    • English
    Tables of Laguerre Polynomials and Functions contains the values of Laguerre polynomials and Laguerre functions for n = 2 , 3 , . . . , 7 ; s = 0(0.1) 1; x = 0(0.1) 10(0.2) 30, and the zeroes and coefficients of the polynomials for n = 2 (1) 10 and s = 0(0.05) 1. The book also explains the Laguerre polynomials, their properties, Laguerre functions, and the tabulation of the Laguerre polynomials and functions. The book contains three tables: tables of values of Laguerre polynomials and functions, tables of the coefficients of the polynomials, and tables of their roots. The first table consists of six parts arranged successively in the ascending order of the degree n. Researchers have calculated the tables for a wider range of values of the parameters n, s and x (n = 2(1) 10, s = 0(0.05) 1, x = 0(0.1) 10(0.2) 30(0.5) 80) using computers at the Institute of Mathematics and Computer Technology of the Byelorussian Academy of Sciences and the Computer Centre of the Academy of Sciences of the U.S.S.R. Scientists and investigators at computer centers, research institutes, and engineering organizations will find the book highly valuable.