تحسين النتائح
ترتيب حسب
من
الى
الصفحة 8
الصفحة 8
Mathematical Methods in Time Series Analysis and Digital Image Processing
The aim of this volume is to bring together research directions in theoretical signal and imaging processing developed rather independently in electrical engineering, theoretical physics, mathematics and the computer sciences. In particular, mathematically justified algorithms and methods, the mathematical analysis of these algorithms, and methods as well as the investigation of connections between methods from time series analysis and image processing are reviewed. An interdisciplinary comparison of these methods, drawing upon common sets of test problems from medicine and geophysical/enviromental sciences, is also addressed.
Mathematical Methods in Engineering
This book contains some of the contributions that have been carefully selected and peer-reviewed, which were presented at the International Symposium MME06 Mathematical Methods in Engineering, held in Cankaya University, Ankara, April 2006. The Symposium provided a setting for discussing recent developments in Fractional Mathematics, Neutrices and Generalized Functions, Boundary Value Problems, Applications of Wavelets, Dynamical Systems and Control Theory.
Mathematical Masterpieces : Further Chronicles by the Explorers
Experience the discovery of mathematics by reading the original work of some of the greatest minds throughout history. Here are the stories of four mathematical adventures, including the Bernoulli numbers as the passage between discrete and continuous phenomena, the search for numerical solutions to equations throughout time, the discovery of curvature and geometric space, and the quest for patterns in prime numbers. Each story is told through the words of the pioneers of mathematical thought. Particular advantages of the historical approach include providing context to mathematical inquiry, perspective to proposed conceptual solutions, and a glimpse into the direction research has taken.
Matematica generale con il calcolatore
By introducing mathematical objects, it teaches students how to use a computer to perform numerical and symbolic calculations, define a function and calculate its values, plot and explore graphs, and execute simple algorithms. The course is rich in examples, applications, and models, drawn from economics, physics, biology, statistics, and mathematics itself. The analysis of these models constitutes, in a certain sense, the true purpose of the mathematical theory covered. Automatic calculation tools (mathematics software, spreadsheets) are used extensively to explore and illustrate concepts and properties. Mathcad® software, in particular, was used, both as a calculation tool and as a simple yet powerful programming language. Considerable space is devoted to approximation, emphasizing the distinction between numerical and symbolic calculation; to algorithms as a synthesis of the syntactic and semantic aspects of mathematical objects; and to computer simulation, interpreted as a "physical" experiment and a source of conjecture. The ability to use a calculator marks a sort of "democratization" of mathematics: even complex results, which have always required a broad background of knowledge and laborious calculations, are now quickly accessible to anyone who understands the meaning of mathematical objects and knows how to use the syntax.
Markov Chains : Models, Algorithms and Applications
Markov chains are a particularly powerful and widely used tool for analyzing a variety of stochastic (probabilistic) systems over time. This monograph will present a series of Markov models, starting from the basic models and then building up to higher-order models. Included in the higher-order discussions are multivariate models, higher-order multivariate models, and higher-order hidden models. In each case, the focus is on the important kinds of applications that can be made with the class of models being considered in the current chapter. Special attention is given to numerical algorithms that can efficiently solve the models. Therefore, Markov Chains: Models, Algorithms and Applications outlines recent developments of Markov chain models for modeling queueing sequences, Internet, re-manufacturing systems, reverse logistics, inventory systems, bio-informatics, DNA sequences, genetic networks, data mining, and many other practical systems.
Machine Learning in Document Analysis and Recognition
The objective of Document Analysis and Recognition (DAR) is to recognize the text and graphicalcomponents of a document and to extract information. With ?rst papers dating back to the 1960’s, DAR is a mature but still gr- ing research?eld with consolidated and known techniques. Optical Character Recognition (OCR) engines are some of the most widely recognized pr- ucts of the research in this ?eld, while broader DAR techniques are nowadays studied and applied to other industrial and o?ce automation systems. In the machine learning community, one of the most widely known - search problems addressed in DAR is recognition of unconstrained handwr- ten characters which has been frequently used in the past as a benchmark for evaluating machine learning algorithms, especially supervised classi?ers.
Logic, Thought and Action
Contribute to our understanding of this dynamic process by clearly presenting and discussing the most important hypotheses, issues and theories in philosophical and logical study of language, thought and action. Among the fundamental issues discussed are the rationality and freedom of agents, theoretical and practical reasoning, individual and collective attitudes and actions, the nature of cooperation and communication, the construction and conditions of adequacy of scientific theories, propositional contents and their truth conditions, illocutionary force, time, aspect and presupposition in meaning, speech acts within dialogue, the dialogical approach to logic and the structure of dialogues and other language games, as well as formal methods needed in logic or artificial intelligence to account for choice, paradoxes, uncertainty and imprecision.
Logic Synthesis for Compositional Microprogram Control Units
In this book control algorithms are represented by the linear graph-schemes of algorithms (GSA), where the number of operator vertices is not less than 75% of the total number of all algorithm vertices. A special class of control units named as compositional microprogram control units (CMCU) is proposed as the best way for interpretation of linear control algorithms.
Linkage in Evolutionary Computation
The whole volume consisting of 19 chapters is divided into 3 parts: Models and Theories; Operators and Frameworks; Applications. This edited volume will serve as a useful guide and reference for researchers who are currently working in the area of linkage. For postgraduate research students, this volume will serve as a good source of reference. It is also suitable as a text for a graduate level course focusing on linkage issues.
Linear Systems
Linear systems theory plays a broad and fundamental role in electrical, mechanical, chemical and aerospace engineering, communications, and signal processing. A thorough introduction to systems theory with emphasis on control is presented in this self-contained textbook. The book examines the fundamental properties that govern the behavior of systems by developing their mathematical descriptions. Linear time-invariant, time-varying, continuous-time, and discrete-time systems are covered. Rigorous development of classic and contemporary topics in linear systems, as well as extensive coverage of stability and polynomial matrix/fractional representation, provide the necessary foundation for further study of systems and control.
Linear Programming : Foundations and Extensions
Linear Programming: Foundations and Extensions is an introduction to the field of optimization. The book emphasizes constrained optimization, beginning with a substantial treatment of linear programming, and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. The book is carefully written. Specific examples and concrete algorithms precede more abstract topics. Topics are clearly developed with a large number of numerical examples worked out in detail.
Linear and Nonlinear Programming
"Linear and Nonlinear Programming" is considered a classic textbook in Optimization. While it is a classic, it also reflects modern theoretical insights. These insights provide structure to what might otherwise be simply a collection of techniques and results, and this is valuable both as a means for learning existing material and for developing new results. One major insight of this type is the connection between the purely analytical character of an optimization problem, expressed perhaps by properties of the necessary conditions, and the behavior of algorithms used to solve a problem. This was a major theme of the first and second editions. Now the third edition has been completely updated with recent Optimization Methods. Yinyu Ye has written chapters and chapter material on a number of these areas including Interior Point Methods.
Lectures in Supercomputational Neurosciences : Dynamics in Complex Brain Networks
The present volume is an introduction, largely from the physicists' perspective, to the subject matter with in-depth contributions by system neuroscientists. A conceptual model for complex networks of neurons is introduced that incorporates many important features of the real brain, such as various types of neurons, various brain areas, inhibitory and excitatory coupling and the plasticity of the network. The computational implementation on supercomputers, which is introduced and discussed in detail in this book, will enable the readers to modify and adapt the algortihm for their own research.
Lectures in Supercomputational Neurosciences : Dynamics in Complex Brain Networks
The present volume is an introduction, largely from the physicists' perspective, to the subject matter with in-depth contributions by system neuroscientists. A conceptual model for complex networks of neurons is introduced that incorporates many important features of the real brain, such as various types of neurons, various brain areas, inhibitory and excitatory coupling and the plasticity of the network. The computational implementation on supercomputers, which is introduced and discussed in detail in this book, will enable the readers to modify and adapt the algortihm for their own research.
Le raisonnement bayésien : Modélisation et inférence = Bayesian reasoning : Modeling and inference
Describes in detail the practice of the Bayesian statistical approach using many examples chosen for their educational interest. The first part gives the general principles of statistical modeling making it possible to supervise but also to come to the aid of the imagination of the apprentice modeler. By examining examples of increasing difficulty, the reader forges the keys to building their own model. The second part presents the most useful calculation algorithms for estimating the unknowns of the model. Each inference method is presented and illustrated by numerous application cases.
Large-Scale Nonlinear Optimization
Large-Scale Nonlinear Optimization reviews and discusses recent advances in the development of methods and algorithms for nonlinear optimization and its applications, focusing on the large-dimensional case, the current forefront of much research.The chapters of the book including theoretical analysis, algorithmic development, implementation issues and applications.
Laplacian Eigenvectors of Graphs : Perron-Frobenius and Faber-Krahn Type Theorems
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.
Lagrangian and Hamiltonian Methods for Nonlinear Control 2006 ; Proceedings from the 3rd IFAC Workshop, Nagoya, Japan, July 2006
A Differential-Geometric Approach for Bernstein’s Degrees-of-Freedom Problem.- Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping.- Synchronization of Networked Lagrangian Systems.- An Algorithm to Discretize One-Dimensional Distributed Port Hamiltonian Systems.- Virtual Lagrangian Construction Method for Infinitedimensional Systems with Homotopy Operators.- Direct Discrete-Time Design for Sampled-Data Hamiltonian Control Systems.- Kinematic Compensation in Port-Hamiltonian Telemanipulation.- Interconnection and Damping Assignment Passivity-Based Control of a Four-Tank System.- Towards Power-based Control Strategies for a Class of Nonlinear Mechanical Systems.- Power Shaping Control of Nonlinear Systems: A Benchmark Example.- Total Energy Shaping Control of Mechanical Systems: Simplifying the Matching Equations via Coordinate Changes.- Simultaneous Interconnection and Damping Assignment Passivity–Based Control: Two Practical Examples.
Knowledge-Driven Computing : Knowledge Engineering and Intelligent Computations
Knowledge-Driven Computing constitutes an emerging area of intensive research located at the intersection of Computational Intelligence and Knowledge Engineering with strong mathematical foundations. It embraces methods and approaches coming from diverse computational paradigms, such as evolutionary computation and nature-inspired algorithms, logic programming and constraint programming, rule-based systems, fuzzy sets and many others. The use of various knowledge representation formalisms and knowledge processing and computing paradigms is oriented towards the efficient resolution of computationally complex and difficult problems.
Knowledge Discovery from Legal Databases
Describes data mining , techniques as they apply to law. Law students, legal academics and applied information technology specialists are guided thorough all phases of the knowledge discovery from databases process with clear explanations of numerous data mining algorithms including rule induction, neural networks and association rules. Throughout the text, assumptions that make data mining in law quite different to mining other data are made explicit. Issues such as the selection of commonplace cases, the use of discretion as a form of open texture, transformation using argumentation concepts and evaluation and deployment approaches are discussed at length.
