Название: Dictionary of computing ISBN: 0199234000 ISBN-13(EAN): 9780199234004 Издательство: Oxford University Press Цена: 877 р. Наличие на складе: Поставка под заказ. Описание: This best-selling dictionary has been revised by a team of computer specialists, making it the most up-to-date and authoritative reference of its kind. Providing comprehensive coverage of computer applications in industry, school, work, education, and the home, it is the ideal reference for students, professionals, and anyone who uses computers.
Автор: O`Donnell Название: Discrete Mathematics Using a Computer ISBN: 1846282411 ISBN-13(EAN): 9781846282416 Издательство: Springer Рейтинг: Цена: 4670 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Offers a "hands-on" approach to teaching Discrete Mathematics. This second edition contains additional material on the applications of formal methods to practical programming problems. Designed for 1st and 2nd year undergraduates, it is also well suited for self-study.
Автор: Vl?du?iu Название: Computer Arithmetic ISBN: 364218314X ISBN-13(EAN): 9783642183140 Издательство: Springer Рейтинг: Цена: 11219 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computer Arithmetic provides a complete procedure for linking the digital design and arithmetic algorithms domain, based on original formalism and hardware description languages. Readers will find gate-level designs for all matrix/combinatorial arithmetic structures.
Автор: Jacques Calmet; Willi Geiselmann; J?rn M?ller-Quad Название: Mathematical Methods in Computer Science ISBN: 3540899936 ISBN-13(EAN): 9783540899938 Издательство: Springer Рейтинг: Цена: 5609 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains the proceedings of the conference Mathematical Methods in Computer Science, MMICS 2008, which was held during December 17-19, 2008, in Karlsruhe, Germany, in memory of Thomas Beth. The themes of the conference reflected the many interests of Thomas Beth.
Автор: Meduna Название: Formal Languages and Computation ISBN: 1466513454 ISBN-13(EAN): 9781466513457 Издательство: Taylor&Francis Рейтинг: Цена: 8359 р. Наличие на складе: Поставка под заказ.
Описание: Formal Languages and Computation: Models and Their Applications gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. Emphasizing the relationship between theory and application, the book describes many real-world applications, including computer science engineering techniques for language processing and their implementation. Covers the theory of formal languages and their models, including all essential concepts and properties Explains how language models underlie language processors Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models—regular expressions, finite automata, context-free grammars, and pushdown automata Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure Reviews the general theory of computation, particularly computability and decidability Considers problem-deciding algorithms in terms of their computational complexity measured according to time and space requirements Points out that some problems are decidable in principle, but they are, in fact, intractable problems for absurdly high computational requirements of the algorithms that decide them In short, this book represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigors to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. After studying this book, both student and professional should be able to understand the fundamental theory of formal languages and computation, write language processors, and confidently follow most advanced books on the subject.
Описание: This is the first entry-level book on algorithmic (also known as automatic) differentiation (AD), providing fundamental rules for the generation of first- and higher-order tangent-linear and adjoint code. The author covers the mathematical underpinnings as well as applications to real-world numerical simulation programs. Readers will find: • Many examples and exercises, including hints to solutions • The prototype AD tools dco and dcc for use with the examples and exercises • First- and higher-order tangent-linear and adjoint modes for a limited subset of C/C++, provided by the derivative code compiler dcc • A supplementary website containing sources of all software discussed in the book, additional exercises and comments on their solutions (growing over the coming years), links to other sites on AD, and errata. Ideal for undergraduate and graduate students, the book is also suitable for researchers and developers at all levels who need an introduction to AD.
Описание: Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
Автор: Ben-Ari Название: Mathematical Logic for Computer Science ISBN: 1447141288 ISBN-13(EAN): 9781447141280 Издательство: Springer Рейтинг: Цена: 4203 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems.The logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logicfor the verification of concurrent programs.The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking.
Описание: This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.
Автор: Vince Название: Quaternions for Computer Graphics ISBN: 0857297597 ISBN-13(EAN): 9780857297594 Издательство: Springer Рейтинг: Цена: 6544 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Sir William Rowan Hamilton was a genius, and will be remembered for his significant contributions to physics and mathematics. The Hamiltonian, which is used in quantum physics to describe the total energy of a system, would have been a major achievement for anyone, but Hamilton also invented quaternions, which paved the way for modern vector analysis. Quaternions are one of the most documented inventions in the history of mathematics, and this book is about their invention, and how they are used to rotate vectors about an arbitrary axis. Apart from introducing the reader to the features of quaternions and their associated algebra, the book provides valuable historical facts that bring the subject alive. Quaternions for Computer Graphics introduces the reader to quaternion algebra by describing concepts of sets, groups, fields and rings. It also includes chapters on imaginary quantities, complex numbers and the complex plane, which are essential to understanding quaternions. The book contains many illustrations and worked examples, which make it essential reading for students, academics, researchers and professional practitioners.
Student-Friendly Coverage of Probability, Statistical Methods, Simulation, and Modeling Tools Incorporating feedback from instructors and researchers who used the previous edition, Probability and Statistics for Computer Scientists, Second Edition helps students understand general methods of stochastic modeling, simulation, and data analysis; make optimal decisions under uncertainty; model and evaluate computer systems and networks; and prepare for advanced probability-based courses. Written in a lively style with simple language, this classroom-tested book can now be used in both one- and two-semester courses.
New to the Second Edition
Axiomatic introduction of probability
Expanded coverage of statistical inference, including standard errors of estimates and their estimation, inference about variances, chi-square tests for independence and goodness of fit, nonparametric statistics, and bootstrap
More exercises at the end of each chapter
Additional MATLAB(R) codes, particularly new commands of the Statistics Toolbox
In-Depth yet Accessible Treatment of Computer Science-Related Topics Starting with the fundamentals of probability, the text takes students through topics heavily featured in modern computer science, computer engineering, software engineering, and associated fields, such as computer simulations, Monte Carlo methods, stochastic processes, Markov chains, queuing theory, statistical inference, and regression. It also meets the requirements of the Accreditation Board for Engineering and Technology (ABET).
Encourages Practical Implementation of Skills Using simple MATLAB commands (easily translatable to other computer languages), the book provides short programs for implementing the methods of probability and statistics as well as for visualizing randomness, the behavior of random variables and stochastic processes, convergence results, and Monte Carlo simulations. Preliminary knowledge of MATLAB is not required. Along with numerous computer science applications and worked examples, the text presents interesting facts and paradoxical statements. Each chapter concludes with a short summary and many exercises.
Описание: Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also interest researchers working in mathematical logic, computer science and game theory.
Автор: Brent Название: Modern Computer Arithmetic ISBN: 0521194695 ISBN-13(EAN): 9780521194693 Издательство: Cambridge Academ Рейтинг: Цена: 6973 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics such as modular arithmetic, greatest common divisors, the Fast Fourier Transform (FFT), and the computation of elementary and special functions. Brent and Zimmermann present algorithms that are ready to implement in your favourite language, while keeping a high-level description and avoiding too low-level or machine-dependent details. The book is intended for anyone interested in the design and implementation of efficient high-precision algorithms for computer arithmetic, and more generally efficient multiple-precision numerical algorithms. It may also be used in a graduate course in mathematics or computer science, for which exercises are included. These vary considerably in difficulty, from easy to small research projects, and expand on topics discussed in the text. Solutions to selected exercises are available from the authors.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru