Surveys recent advances in combinatorial properties of switching fabrics Written by an expert in the area of switching fabrics
Advances in Multivariate Statistical Analysis (Theory and Decision Library B, #5)
The death of Professor K. C. Sreedharan Pillai on June 5, 1985 was a heavy loss to many statisticians all around the world. This volume is dedicated to his memory in recog- nition of his many contributions in multivariate statis- tical analysis. It brings together eminent statisticians Working in multivariate analysis from around the world. The research and expository papers cover a cross-section of recent developments in the field. This volume is especially useful to researchers and to those wh...
Art Gallery Theorems and Algorithms (International Series of Monographs on Computer Science, #3)
by Joseph O'Rourke
Art gallery theorems and algorithms are so called because they relate to problems involving the visibility of geometrical shapes and their internal surfaces. This book explores generalizations and specializations in these areas; among the presentations are recently discovered theorems on orthogonal polygons, polygons with holes, exterior visibility, visibility graphs, and visibility in three dimensions. The author formulates many open problems and offers several conjectures, providing arguments...
Computer Science Logic (Lecture Notes in Computer Science, #832)
by E Borger, Yuri Gurevich, and K Meinke
Evolutionary Multiobjective Optimization (Advanced Information and Knowledge Processing)
Evolutionary Multi-Objective Optimization is an expanding field of research. This book brings a collection of papers with some of the most recent advances in this field. The topic and content is currently very fashionable and has immense potential for practical applications and includes contributions from leading researchers in the field. Assembled in a compelling and well-organised fashion, Evolutionary Computation Based Multi-Criteria Optimization will prove beneficial for both academic and in...
Symbolic Algebraic Methods and Verification Methods
The usual usual "implementation" "implementation" ofreal numbers as floating point numbers on exist- iing ng computers computers has the well-known disadvantage that most of the real numbers are not exactly representable in floating point. Also the four basic arithmetic operations can usually not be performed exactly. For numerical algorithms there are frequently error bounds for the computed approximation available. Traditionally a bound for the infinity norm is estima- ted using ttheoretical h...
Modelling and Optimization of Distributed Parameter Systems Applications to Engineering
Parameterized and Exact Computation (Theoretical Computer Science and General Issues, #8246) (Lecture Notes in Computer Science, #8246)
This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013. The 29 revised full papers presented were carefully reviewed and selected from 58 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and...
Partial Update Least-Square Adaptive Filtering (Synthesis Lectures on Communications)
by Bei Xie and Tamal Bose
Adaptive filters play an important role in the fields related to digital signal processing and communication, such as system identification, noise cancellation, channel equalization, and beamforming. In practical applications, the computational complexity of an adaptive filter is an important consideration. The Least Mean Square (LMS) algorithm is widely used because of its low computational complexity ($O(N)$) and simplicity in implementation. The least squares algorithms, such as Recursive Lea...
Secure Sensor Cloud (Synthesis Lectures on Algorithms and Software in Engineering)
by Vimal Kumar, Amartya Sen, and Sanjay Madria
The sensor cloud is a new model of computing paradigm for Wireless Sensor Networks (WSNs), which facilitates resource sharing and provides a platform to integrate different sensor networks where multiple users can build their own sensing applications at the same time. It enables a multi-user on-demand sensory system, where computing, sensing, and wireless network resources are shared among applications. Therefore, it has inherent challenges for providing security and privacy across the sensor cl...
Reachability Problems (Lecture Notes in Computer Science, #6945)
by Giorgio Delzanno
This book constitutes the refereed proceedings of the Second International Workshop on Machine Learning in Medical Imaging, MLMI 2011, held in conjunction with MICCAI 2011, in Toronto, Canada, in September 2011. The 44 revised full papers presented were carefully reviewed and selected from 74 submissions. The papers focus on major trends in machine learning in medical imaging aiming to identify new cutting-edge techniques and their use in medical imaging.
Parallel Computing Technologies (Theoretical Computer Science and General Issues, #10421) (Lecture Notes in Computer Science, #6873)
This book constitutes the proceedings of the Third International Conference on Parallel Computing Technologies, PaCT '95, held in St. Petersburg, Russia in September 1995. The volume presents 45 revised full papers selected from a total of 98 submissions, including six invited presentations. The proceedings is organized in parts on theory, software, hardware and architecture, and applications to large-scale problems. Parallel processing technologies are shown to be the touchstone of parallel the...
Fundamentals of Computation Theory (Lecture Notes in Computer Science, #2751)
The papers in this volume were presented at the 14th Symposium on Fun- mentals of Computation Theory. The symposium was established in 1977 as a biennial event for researchers interested in all aspects of theoretical computer science, in particular in al- rithms, complexity, and formal and logical methods. The previous FCT con- rences were held in the following cities: Poznan ' (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985...
Real-world problems and modern optimization techniques to solve them Here, a team of international experts brings together core ideas for solving complex problems in optimization across a wide variety of real-world settings, including computer science, engineering, transportation, telecommunications, and bioinformatics. Part One-covers methodologies for complex problem solving including genetic programming, neural networks, genetic algorithms, hybrid evolutionary algorithms, and more. Part Two-d...
Cubic Fields with Geometry (CMS Books in Mathematics)
by Samuel A Hambleton and Hugh C. Williams
The objective of this book is to provide tools for solving problems which involve cubic number fields. Many such problems can be considered geometrically; both in terms of the geometry of numbers and geometry of the associated cubic Diophantine equations that are similar in many ways to the Pell equation. With over 50 geometric diagrams, this book includes illustrations of many of these topics. The book may be thought of as a companion reference for those students of algebraic number theory who...
Les Systemes Dynamiques Discrets (Mathematiques Et Applications, #19)
by Francois Robert
Un systeme dynamique discret est un ensemble fini d'elements, prenant chacun un nombre fini d'etats, et evoluant, dans un temps discret, par interactions mutuelles. Ce livre est consacre a l'analyse de la dynamique temporelle de tels systemes. Grace a des outils de metrique discrete, on etablit des resultats de convergence globale (contraction booleenne) convergence locale vers un point fixe ou vers un cycle, et ceci pour differents modes operatoires.
Mathematical Foundations of Nature-Inspired Algorithms (SpringerBriefs in Optimization)
by Xin-She Yang and Xing-Shi He
This book presents a systematic approach to analyze nature-inspired algorithms. Beginning with an introduction to optimization methods and algorithms, this book moves on to provide a unified framework of mathematical analysis for convergence and stability. Specific nature-inspired algorithms include: swarm intelligence, ant colony optimization, particle swarm optimization, bee-inspired algorithms, bat algorithm, firefly algorithm, and cuckoo search. Algorithms are analyzed from a wide spectrum...
Evolutionary Computation in Combinatorial Optimization (Lecture Notes in Computer Science, #4446)
by Carlos Cotta and Jano Van Hemert
This book constitutes the refereed proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2009, held in Tubingen, Germany, in April 2009. The 21 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various ind...
Symbolic and Numerical Scientific Computation (Lecture Notes in Computer Science, #2630)
Applied Cryptography and Network Security (Lecture Notes in Computer Science, #3089) (Security and Cryptology, #5037)
The second International Conference on Applied Cryptography and Network Security (ACNS 2004) was sponsored and organized by ICISA (the International Communications and Information Security Association). It was held in Yellow Mountain, China, June 8-11, 2004. The conference proceedings, representing papers from the academic track, are published in this volume of the Lecture Notes in Computer Science (LNCS) of Springer-Verlag. The area of research that ACNS covers has been gaining importance in re...
Theory and Applications of Satisfiability Testing (Lecture Notes in Computer Science, #3569)
by Fahiem Bacchus
The 8th International Conference on Theory and Applications of Satis?ability Testing(SAT2005)providedaninternationalforumforthemostrecentresearch on the satis?ablity problem (SAT). SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the ?rst problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satis?ability testing has proved to extremely useful in a wide range of di?erent disciplines, both from...
Structural Information and Communication Complexity (Lecture Notes in Computer Science, #3499)
by Andrzej Pelc
This book constitutes the refereed proceedings of the 12th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005, held in Mont Saint-Michel, France in May 2005. The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers address issues such as topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless networking, mo...