Hasil Pencarian  ::  Simpan CSV :: Kembali

"This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems."

"This book was the first and remains the only book to give a comprehensive treatment of the behavior of linear or nonlinear systems when they are connected in a closed-loop fashion, with the output of one system forming the input of the other. The study of the stability of such systems requires one to draw upon several branches of mathematics but most notably functional analysis."

"Generalized (or pseudo-) inverse concepts routinely appear throughout applied mathematics and engineering, in both research literature and textbooks. Although the basic properties are readily available, some of the more subtle aspects and difficult details of the subject are not well documented or understood. This book is an excellent reference for researchers and students who need or want more than just the most basic elements. First published in 1979, the book remains up-to-date and readable, and it includes chapters on Markov Chains and the Drazin inverse methods that have become significant to many problems in applied mathematics."

"Topics include: ways modern statistical procedures can yield estimates of pi more precisely than the original Buffon procedure traditionally used; the question of density and measure for random geometric elements that leave probability and expectation statements invariant under translation and rotation; the number of random line intersections in a plane and their angles of intersection; developments due to W. L. Stevens's ingenious solution for evaluating the probability that n random arcs of size a cover a unit circumference completely; the development of M. W. Crofton's mean value theorem and its applications in classical problems; and an interesting problem in geometrical probability presented by a karyograph."

"Simulation has become the preferred approach for engineers and scientists who design complex systems because it allows them to test whether a system design meets all necessary performance standards. This book provides an introduction to computer-aided system design with Simulink, a robust, accurate, and easily used simulation tool. The author takes readers on a tour of the Simulink environment that shows how to develop a system model and execute the design steps needed to make the model into a functioning design laboratory. Included along the way are the mathematics of systems: difference equations and z transforms, ordinary differential equations (both linear and nonlinear) and Laplace transforms, and numerical methods for solving differential equations.Because specific applications require specific tools, the author introduces additional software packages that work within the Simulink environment. The Signal Processing Blockset extends Simulink into the areas of both analog and digital signal processing; Stateflow is used for state charts and signal flow for modeling event-driven systems; SimPowerSystems handles physical modeling, in particular the modeling of electrical circuits including power systems, motor drives, power generation equipments, and three-phase power transmission lines; and SimMechanics develops models of mechanical systems such as robots. In total, the author covers over 70 applications taken from several disciplines, and he describes numerous tested, annotated, and reusable models and blocks to help readers apply the book material to their own applications."

"Perturbation Bounds for Matrix Eigenvalues contains a unified exposition of spectral variation inequalities for matrices. The text provides a complete and self-contained collection of bounds for the distance between the eigenvalues of two matrices, which could be arbitrary or restricted to special classes. The book emphasis on sharp estimates, general principles, elegant methods, and powerful techniques, makes it a good reference for researchers and students."

"The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures."

"Interest in the temporal fluctuations of biological populations can be traced to the dawn of civilization. How can mathematics be used to gain an understanding of population dynamics? This monograph introduces the theory of structured population dynamics and its applications, focusing on the asymptotic dynamics of deterministic models. This theory bridges the gap between the characteristics of individual organisms in a population and the dynamics of the total population as a whole. In this monograph, many applications that illustrate both the theory and a wide variety of biological issues are given, along with an interdisciplinary case study that illustrates the connection of models with the data and the experimental documentation of model predictions. The author also discusses the use of discrete and continuous models and presents a general modeling theory for structured population dynamics. Cushing begins with an obvious point: individuals in biological populations differ with regard to their physical and behavioral characteristics and therefore in the way they interact with their environment. Studying this point effectively requires the use of structured models. Specific examples cited throughout support the valuable use of structured models. Included among these are important applications chosen to illustrate both the mathematical theories and biological problems that have received attention in recent literature."

"This versatile book teaches control system design using H∞infty techniques that are simple and compatible with classical control, yet powerful enough to quickly allow the solution of physically meaningful problems. The authors begin by teaching how to formulate control system design problems as mathematical optimization problems and then discuss the theory and numerics for these optimization problems. Their approach is simple and direct, and since the book is modular, the parts on theory can be read independently of the design parts and vice versa, allowing readers to enjoy the book on many levels.The development of H∞infty engineering was one of the main accomplishments of control in the 1980s. However, until now, there has not been a publication suitable for teaching the topic at the undergraduate level. This book fills that gap by teaching control system design using H∞infty techniques at a level within reach of the typical engineering and mathematics student. It also contains a readable account of recent developments and mathematical connections.The authors treat control design problems in a physically correct way. They present a small set of specific rules that the reader can apply to convert a particular design problem to the fundamental optimization problem of H∞infty control. This precisely formulated mathematics problem can then be solved on a computer. The book introduces the control software package OPTDesign, which allows the reader to easily reproduce the calculations done in the solved examples and even try variations on them. The description of how to convert an engineering problem to a form suitable for CAD is simpler than in other books."

"Combinatorial data analysis (CDA) refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely central. The focus of this monograph is on the identification of arrangements, which are then further restricted to where the combinatorial search is carried out by a recursive optimization process based on the general principles of dynamic programming (DP). The authors provide a comprehensive and self-contained review delineating a very general DP paradigm or schema that can serve two functions. First, the paradigm can be applied in various special forms to encompass all previously proposed applications suggested in the classification literature. Second, the paradigm can lead directly to many more novel uses. An appendix is included as a user's manual for a collection of programs available as freeware. The incorporation of a wide variety of CDA tasks under one common optimization framework based on DP is one of the book's strongest points. The authors include verifiably optimal solutions to nontrivially sized problems over the array of data analysis tasks discussed."