Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Functions as a self-study guide and textbook containing over 110 examples and 165 problem sets with answers, a comprehensive solutions manual, and computer programs that clarify arithmetic concepts-ideal for a two-semester course in structural dynamics, analysis and design of seismic structures, matrix methods of structural analysis, numerical methods in structural engineering, and advanced structural mechanics and design This book uses state-of-the-art computer technology to formulate displacement method with matrix algebra, facilitating analysis of structural dynamics and applications to earthquake engineering and UBC and IBC seismic building codes. Links code provisions to analytical derivations and compares individual specifications across codes, including the IBC-2000 With 3700 equations and 660 drawings and tables, Matrix Analysis of Structural Dynamics: Applications and Earthquake Engineering examines vibration of trusses, rigid and elastic frames, plane grid systems, and 3-D building systems with slabs, walls, bracings, beam-columns, and rigid zones presents single and multiple degree-of-freedom systems and various response behaviors for different types of time-dependent excitations outlines determinant, iteration, Jacobian, Choleski decomposition, and Sturm sequence eigensolution methods details proportional and nonproportional damping, steady-state vibration for undamped harmonic excitation, and transient vibration for general forcing function includes P-? effects, elastic media, coupling vibrations, Timoshenko theory, and geometric and material nonlinearity illustrates free and forced vibrations of frameworks and plates stressing isoparametric finite element formulation offers several numerical integration methods with solution criteria for error and stability behavior details models and computer calculations for bracings, RC beams and columns, coupling bending, and shear of low-rise walls and more Matrix Analysis
Recent years have seen an explosion of new mathematical results on
learning and processing in neural networks. This body of results
rests on a breadth of mathematical background which even few
specialists possess. In a format intermediate between a textbook
and a collection of research articles, this book has been assembled
to present a sample of these results, and to fill in the necessary
background, in such areas as computability theory, computational
complexity theory, the theory of analog computation, stochastic
processes, dynamical systems, control theory, time-series analysis,
Bayesian analysis, regularization theory, information theory,
computational learning theory, and mathematical statistics.
Anyone browsing at the stationery store will see an incredible array of pop-up cards available for any occasion. The workings of pop-up cards and pop-up books can be remarkably intricate. Behind such designs lies beautiful geometry involving the intersection of circles, cones, and spheres, the movements of linkages, and other constructions. The geometry can be modelled by algebraic equations, whose solutions explain the dynamics. For example, several pop-up motions rely on the intersection of three spheres, a computation made every second for GPS location. Connecting the motions of the card structures with the algebra and geometry reveals abstract mathematics performing tangible calculations. Beginning with the nephroid in the 19th-century, the mathematics of pop-up design is now at the frontiers of rigid origami and algorithmic computational complexity. All topics are accessible to those familiar with high-school mathematics; no calculus required. Explanations are supplemented by 140+ figures and 20 animations.
Biology is in the midst of a era yielding many significant discoveries and promising many more. Unique to this era is the exponential growth in the size of information-packed databases. Inspired by a pressing need to analyze that data, Introduction to Computational Biology explores a new area of expertise that emerged from this fertile field- the combination of biological and information sciences.
Problems in network optimization arise in all areas of technology and industrial management. The topic of network flows has applications in diverse fields such as chemistry, engineering, management science, scheduling and transportation, to name a few.
A best-seller in its French edition, the construction of this book is original and its success in the French market demonstrates its appeal. It is based on three principles: 1. An organization of the chapters by families of algorithms : exhaustive search, divide and conquer, etc. At the contrary, there is no chapter only devoted to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. 2. For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. 3. For its most part, the book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented ; often, some classical errors are pointed at. Roughly speaking, two thirds of the book are devoted to the detailed rational construction of the solutions.
Discrete Mathematics for New Technology has been designed to cover the core mathematics requirement for undergraduate computer science students in the UK and the USA. This has been approached in a comprehensive way whilst maintaining an easy to follow progression from the basic mathematical concepts covered by the GCSE in the UK and by high-school algebra in the USA, to the more sophisticated mathematical concepts examined in the latter stages of the book. The rigorous treatment of theory is punctuated by frequent use of pertinent examples. This is then reinforced with exercises to allow the reader to achieve a "feel" for the subject at hand. Hints and solutions are provided for these brain-teasers at the end of the book. Although aimed primarily at computer science students, the structured development of the mathematics enables this text to be used by undergraduate mathematicians, scientists and others who require an understanding of discrete mathematics. The topics covered include: logic and the nature of mathematical proof set theory, relations and functions, matrices and systems of linear equations, algebraic structures, Boolean algebras and a thorough treatise on graph theory. The authors have extensive experience of teaching undergraduate mathematics at colleges and universities in the British and American systems. They have developed and taught courses for a varied of non-specialists and have established reputations for presenting rigorous mathematical concepts in a manner which is accessible to this audience. Their current research interests lie in the fields of algebra, topology and mathematics education. Discrete Mathematics for New Technology is therefore a rare thing; areadable, friendly textbook designed for non-mathematicians, presenting material which is at the foundations of mathematics itself. It is essential reading.
Order stars is a recently developed technique to analyze and explain the behaviour of numerical methods. The main idea is to explore different features of numerical algorithms as properties of analytical functions in various portions of the complex plane. Thus, for example, the order of some numerical methods for ordinary differential equations can be translated to the language of approximation theory - specifically, to the question of how well a given rational function R approximates the exponential. Likewise, stability properties of the underlying method can be expressed as some other features of the function R. In this formulation, order stars establish the relationship between order and stability, helping in the search for better and more efficient computational algorithms.
This book introduces machine learning for readers with some background in basic linear algebra, statistics, probability, and programming. In a coherent statistical framework it covers a selection of supervised machine learning methods, from the most fundamental (k-NN, decision trees, linear and logistic regression) to more advanced methods (deep neural networks, support vector machines, Gaussian processes, random forests and boosting), plus commonly-used unsupervised methods (generative modeling, k-means, PCA, autoencoders and generative adversarial networks). Careful explanations and pseudo-code are presented for all methods. The authors maintain a focus on the fundamentals by drawing connections between methods and discussing general concepts such as loss functions, maximum likelihood, the bias-variance decomposition, ensemble averaging, kernels and the Bayesian approach along with generally useful tools such as regularization, cross validation, evaluation metrics and optimization methods. The final chapters offer practical advice for solving real-world supervised machine learning problems and on ethical aspects of modern machine learning.
Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.
Congruences are ubiquitous in computer science, engineering, mathematics, and related areas. Developing techniques for finding (the number of) solutions of congruences is an important problem. But there are many scenarios in which we are interested in only a subset of the solutions; in other words, there are some restrictions. What do we know about these restricted congruences, their solutions, and applications? This book introduces the tools that are needed when working on restricted congruences and then systematically studies a variety of restricted congruences. Restricted Congruences in Computing defines several types of restricted congruence, obtains explicit formulae for the number of their solutions using a wide range of tools and techniques, and discusses their applications in cryptography, information security, information theory, coding theory, string theory, quantum field theory, parallel computing, artificial intelligence, computational biology, discrete mathematics, number theory, and more. This is the first book devoted to restricted congruences and their applications. It will be of interest to graduate students and researchers across computer science, electrical engineering, and mathematics.
This is the first rigorous, self-contained treatment of the theory of deep learning. Starting with the foundations of the theory and building it up, this is essential reading for any scientists, instructors, and students interested in artificial intelligence and deep learning. It provides guidance on how to think about scientific questions, and leads readers through the history of the field and its fundamental connections to neuroscience. The author discusses many applications to beautiful problems in the natural sciences, in physics, chemistry, and biomedicine. Examples include the search for exotic particles and dark matter in experimental physics, the prediction of molecular properties and reaction outcomes in chemistry, and the prediction of protein structures and the diagnostic analysis of biomedical images in the natural sciences. The text is accompanied by a full set of exercises at different difficulty levels and encourages out-of-the-box thinking.
Unique selling point: * Industry standard book for merchants, banks, and consulting firms looking to learn more about PCI DSS compliance. Core audience: * Retailers (both physical and electronic), firms who handle credit or debit cards (such as merchant banks and processors), and firms who deliver PCI DSS products and services. Place in the market: * Currently there are no PCI DSS 4.0 books
Mathematicians have skills that, if deepened in the right ways, would enable them to use data to answer questions important to them and others, and report those answers in compelling ways. Data science combines parts of mathematics, statistics, computer science. Gaining such power and the ability to teach has reinvigorated the careers of mathematicians. This handbook will assist mathematicians to better understand the opportunities presented by data science. As it applies to the curriculum, research, and career opportunities, data science is a fast-growing field. Contributors from both academics and industry present their views on these opportunities and how to advantage them.
This book covers a variety of problems, and offers solutions to some, in: Statistical state and parameter estimation in nonlinear stochastic dynamical system in both the classical and quantum scenarios Propagation of electromagnetic waves in a plasma as described by the Boltzmann Kinetic Transport Equation Classical and Quantum General Relativity It will be of use to Engineering undergraduate students interested in analysing the motion of robots subject to random perturbation, and also to research scientists working in Quantum Filtering.
This book discusses an important area of numerical optimization, called interior-point method. This topic has been popular since the 1980s when people gradually realized that all simplex algorithms were not convergent in polynomial time and many interior-point algorithms could be proved to converge in polynomial time. However, for a long time, there was a noticeable gap between theoretical polynomial bounds of the interior-point algorithms and efficiency of these algorithms. Strategies that were important to the computational efficiency became barriers in the proof of good polynomial bounds. The more the strategies were used in algorithms, the worse the polynomial bounds became. To further exacerbate the problem, Mehrotra's predictor-corrector (MPC) algorithm (the most popular and efficient interior-point algorithm until recently) uses all good strategies and fails to prove the convergence. Therefore, MPC does not have polynomiality, a critical issue with the simplex method. This book discusses recent developments that resolves the dilemma. It has three major parts. The first, including Chapters 1, 2, 3, and 4, presents some of the most important algorithms during the development of the interior-point method around the 1990s, most of them are widely known. The main purpose of this part is to explain the dilemma described above by analyzing these algorithms' polynomial bounds and summarizing the computational experience associated with them. The second part, including Chapters 5, 6, 7, and 8, describes how to solve the dilemma step-by-step using arc-search techniques. At the end of this part, a very efficient algorithm with the lowest polynomial bound is presented. The last part, including Chapters 9, 10, 11, and 12, extends arc-search techniques to some more general problems, such as convex quadratic programming, linear complementarity problem, and semi-definite programming.
Active student engagement is key to this classroom-tested combinatorics text, boasting 1200+ carefully designed problems, ten mini-projects, section warm-up problems, and chapter opening problems. The author - an award-winning teacher - writes in a conversational style, keeping the reader in mind on every page. Students will stay motivated through glimpses into current research trends and open problems as well as the history and global origins of the subject. All essential topics are covered, including Ramsey theory, enumerative combinatorics including Stirling numbers, partitions of integers, the inclusion-exclusion principle, generating functions, introductory graph theory, and partially ordered sets. Some significant results are presented as sets of guided problems, leading readers to discover them on their own. More than 140 problems have complete solutions and over 250 have hints in the back, making this book ideal for self-study. Ideal for a one semester upper undergraduate course, prerequisites include the calculus sequence and familiarity with proofs.
* The book offers a well-balanced mathematical analysis of modelling physical systems. * Summarizes basic principles in differential geometry and convex analysis as needed. * The book covers a wide range of industrial and social applications, and bridges the gap between core theory and costly experiments through simulations and modelling. * The focus of the book is manifold ranging from stability of fluid flows, nano fluids, drug delivery, and security of image data to Pandemic modeling etc.
This book discusses the Sliding Mode Control (SMC) problems of networked control systems (NCSs) under various communication protocols including static/dynamic/periodic event-triggered mechanism, and stochastic communication, Round-Robin, weighted try-once-discard, multiple-packet transmission, and the redundant channel transmission protocol. The super-twisting algorithm and the extended-state-observer-based SMC scheme are described in this book for suppressing chattering. Besides, the SMC designs for two-dimensional (1-D) and two-dimensional (2-D) NCSs are illustrated as well. Features: Captures recent advances of theories, techniques, and applications of networked sliding mode control from an engineering-oriented perspective. Includes new design ideas and optimization techniques of networked sliding mode control theory. Provides advanced tools to apply networked sliding mode control techniques in the practical applications. Discusses some new tools to the engineering applications while dealing with the model uncertainties and external disturbances. This book aims at Researchers and professionals in Control Systems, Computer Networks, Internet of Things, and Communication Systems.
Features contributions from thought leaders across academia, industry, and government Focuses on novel algorithms and practical applications
- New advancements of fractal analysis with applications to many scientific, engineering, and societal issues - Recent changes and challenges of fractal geometry with the rapid advancement of technology - Attracted chapters on novel theory and recent applications of fractals. - Offers recent findings, modelling and simulations of fractal analysis from eminent institutions across the world - Analytical innovations of fractal analysis - Edited collection with a variety of viewpoints
Practical Mathematical Cryptography provides a clear and accessible introduction to practical mathematical cryptography. Cryptography, both as a science and as practice, lies at the intersection of mathematics and the science of computation, and the presentation emphasises the essential mathematical nature of the computations and arguments involved in cryptography. Cryptography is also a practical science, and the book shows how modern cryptography solves important practical problems in the real world, developing the theory and practice of cryptography from the basics to secure messaging and voting. The presentation provides a unified and consistent treatment of the most important cryptographic topics, from the initial design and analysis of basic cryptographic schemes towards applications. Features Builds from theory toward practical applications Suitable as the main text for a mathematical cryptography course Focus on secure messaging and voting systems.
Provides guidance on performance enhancement and reliability of IC chips. Provides a detailed hybrid optimization strategy for the optimal arrangement of IC chips on a board. The MATLAB program for the hybrid optimization strategy along with its stability analysis is carried out in a detailed manner.
An Image Processing Tour of College Mathematics aims to provide meaningful context for reviewing key topics of the college mathematics curriculum, to help students gain confidence in using concepts and techniques of applied mathematics, to increase student awareness of recent developments in mathematical sciences, and to help students prepare for graduate studies. The topics covered include a library of elementary functions, basic concepts of descriptive statistics, probability distributions of functions of random variables, definitions and concepts behind first- and second-order derivatives, most concepts and techniques of traditional linear algebra courses, an introduction to Fourier analysis, and a variety of discrete wavelet transforms - all of that in the context of digital image processing. Features Pre-calculus material and basic concepts of descriptive statistics are reviewed in the context of image processing in the spatial domain. Key concepts of linear algebra are reviewed both in the context of fundamental operations with digital images and in the more advanced context of discrete wavelet transforms. Some of the key concepts of probability theory are reviewed in the context of image equalization and histogram matching. The convolution operation is introduced painlessly and naturally in the context of naive filtering for denoising and is subsequently used for edge detection and image restoration. An accessible elementary introduction to Fourier analysis is provided in the context of image restoration. Discrete wavelet transforms are introduced in the context of image compression, and the readers become more aware of some of the recent developments in applied mathematics. This text helps students of mathematics ease their way into mastering the basics of scientific computer programming.
This is an introductory single-term numerical analysis text with a modern scientific computing flavor. It offers an immediate immersion in numerical methods featuring an up-to-date approach to computational matrix algebra and an emphasis on methods used in actual software packages, always highlighting how hardware concerns can impact the choice of algorithm. It fills the need for a text that is mathematical enough for a numerical analysis course yet applied enough for students of science and engineering taking it with practical need in mind. The standard methods of numerical analysis are rigorously derived with results stated carefully and many proven. But while this is the focus, topics such as parallel implementations, the Basic Linear Algebra Subroutines, halfto quadruple-precision computing, and other practical matters are frequently discussed as well. Prior computing experience is not assumed. Optional MATLAB subsections for each section provide a comprehensive self-taught tutorial and also allow students to engage in numerical experiments with the methods they have just read about. The text may also be used with other computing environments. This new edition offers a complete and thorough update. Parallel approaches, emerging hardware capabilities, computational modeling, and data science are given greater weight. |
You may like...
Algorithm Design: A Methodological…
Patrick Bosc, Marc Guyomard, …
Paperback
R1,617
Discovery Miles 16 170
Data-Driven Science and Engineering…
Steven L. Brunton, J. Nathan Kutz
Hardcover
PCI Compliance - Understand and…
Branden Williams, James Adamson
Paperback
R1,370
Discovery Miles 13 700
|