Chapman & Hall/CRC Computer and Information Science Series – serie

Metaheuristic optimization has become a prime alternative for solving complex optimization problems in several areas. Hence, practitioners and researchers have been paying extensive attention to those metaheuristic algorithms that are mainly based on natural phenomena. However, when those algorithms are implemented, there are not enough books that deal with theoretical and experimental problems in a friendly manner so this book presents a novel structure that includes a complete description of the most important metaheuristic optimization algorithms as well as a new proposal of a new metaheuristic optimization named earthquake optimization. This book also has several practical exercises and a toolbox for MATLAB® and a toolkit for LabVIEW are integrated as complementary material for this book. These toolkits allow readers to move from a simulation environment to an experimentation one very fast. This book is suitable for researchers, students, and professionals in several areas, such as economics, architecture, computer science, electrical engineering, and control systems.The unique features of this book are as follows: Developed for researchers, undergraduate and graduate students, and practitioners A friendly description of the main metaheuristic optimization algorithms Theoretical and practical optimization examples A new earthquake optimization algorithm Updated state-of-the-art and research optimization projects The authors are multidisciplinary/interdisciplinary lecturers and researchers who have written a structure-friendly learning methodology to understand each metaheuristic optimization algorithm presented in this book.

Describing state-of-the-art solutions in distributed system architectures, Integration of Services into Workflow Applications presents a concise approach to the integration of loosely coupled services into workflow applications. It discusses key challenges related to the integration of distributed systems and proposes solutions, both in terms of theoretical aspects such as models and workflow scheduling algorithms, and technical solutions such as software tools and APIs.The book provides an in-depth look at workflow scheduling and proposes a way to integrate several different types of services into one single workflow application. It shows how these components can be expressed as services that can subsequently be integrated into workflow applications. The workflow applications are often described as acyclic graphs with dependencies which allow readers to define complex scenarios in terms of basic tasks.Presents state-of-the-art solutions to challenges in multi-domain workflow application definition, optimization, and executionProposes a uniform concept of a service that can represent executable components in all major distributed software architectures used todayDiscusses an extended model with determination of data flows among parallel paths of a workflow application Since workflow applications often process big data, the book explores the dynamic management of data with various storage constraints during workflow execution. It addresses several practical problems related to data handling, including data partitioning for parallel processing next to service selection and scheduling, processing data in batches or streams, and constraints on data sizes that can be processed at the same time by service instances. Illustrating several workflow applications that were proposed, implemented, and benchmarked in a real BeesyCluster environment, the book includes templates for

Performance Analysis of Queuing and Computer Networks develops simple models and analytical methods from first principles to evaluate performance metrics of various configurations of computer systems and networks. It presents many concepts and results of probability theory and stochastic processes.After an introduction to queues in computer networks, this self-contained book covers important random variables, such as Pareto and Poisson, that constitute models for arrival and service disciplines. It then deals with the equilibrium M/M/1/∞queue, which is the simplest queue that is amenable for analysis. Subsequent chapters explore applications of continuous time, state-dependent single Markovian queues, the M/G/1 system, and discrete time queues in computer networks. The author then proceeds to study networks of queues with exponential servers and Poisson external arrivals as well as the G/M/1 queue and Pareto interarrival times in a G/M/1 queue. The last two chapters analyze bursty, self-similar traffic, and fluid flow models and their effects on queues.

Scalable and Secure Internet Services and Architecture provides an in-depth analysis of many key scaling technologies. Topics include: server clusters and load balancing; QoS-aware resource management; server capacity planning; Web caching and prefetching; P2P overlay network; mobile code and security; and mobility support for adaptive grid computing.The author discusses each topic by first defining a problem, then reviewing current representative approaches for solving it. He then describes in detail the underlying principles of the technologies and the application of these principles, along with balanced coverage of concepts and engineering trade-offs. The book demonstrates the effectiveness of the technologies via rigorous mathematical modeling and analysis, simulation, and practical implementations. It blends technologies in a unified framework for scalable and secure Internet services, delivering a systematic treatment based upon the author's cutting-edge research experience.This volume describes in breadth and depth advanced scaling technologies that support media streaming, e-commerce, grid computing, personalized content delivery, distributed file sharing, network management, and other Internet applications.

Metaheuristic optimization has become a prime alternative for solving complex optimization problems in several areas. Hence, practitioners and researchers have been paying extensive attention to those metaheuristic algorithms that are mainly based on natural phenomena. However, when those algorithms are implemented, there are not enough books that deal with theoretical and experimental problems in a friendly manner so this book presents a novel structure that includes a complete description of the most important metaheuristic optimization algorithms as well as a new proposal of a new metaheuristic optimization named earthquake optimization. This book also has several practical exercises and a toolbox for MATLAB® and a toolkit for LabVIEW are integrated as complementary material for this book. These toolkits allow readers to move from a simulation environment to an experimentation one very fast. This book is suitable for researchers, students, and professionals in several areas, such as economics, architecture, computer science, electrical engineering, and control systems.The unique features of this book are as follows: Developed for researchers, undergraduate and graduate students, and practitioners A friendly description of the main metaheuristic optimization algorithms Theoretical and practical optimization examples A new earthquake optimization algorithm Updated state-of-the-art and research optimization projects The authors are multidisciplinary/interdisciplinary lecturers and researchers who have written a structure-friendly learning methodology to understand each metaheuristic optimization algorithm presented in this book.

Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems.Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more.About the EditorTeofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of scheduling, graph, computational geometry, communication, routing, etc.

Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems.Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more. About the EditorTeofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.

Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems.Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more.About the EditorTeofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.

The Handbook of Data Structures and Applications was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly as other areas of computer science, the book aims to update those areas that have seen advances.Retaining the seven-part structure of the first edition, the handbook begins with a review of introductory material, followed by a discussion of well-known classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. The editors next analyze miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination of the applications of data structures. Four new chapters have been added on Bloom Filters, Binary Decision Diagrams, Data Structures for Cheminformatics, and Data Structures for Big Data Stores, and updates have been made to other chapters that appeared in the first edition.The Handbook is invaluable for suggesting new ideas for research in data structures, and for revealing application contexts in which they can be deployed. Practitioners devising algorithms will gain insight into organizing data, allowing them to solve algorithmic problems more efficiently.

Internet of Things: Challenges, Advances, and Applications provides a comprehensive introduction to IoT, related technologies, and common issues in the adoption of IoT on a large scale. It surveys recent technological advances and novel solutions for challenges in the IoT environment. Moreover, it provides detailed discussion of the utilization of IoT and its underlying technologies in critical application areas, such as smart grids, healthcare, insurance, and the automotive industry. The chapters of this book are authored by several international researchers and industry experts. This book is composed of 18 self-contained chapters that can be read, based on interest. Features: Introduces IoT, including its history, common definitions, underlying technologies, and challenges Discusses technological advances in IoT and implementation considerations Proposes novel solutions for common implementation issues Explores critical application domains, including large-scale electric power distribution networks, smart water and gas grids, healthcare and e-Health applications, and the insurance and automotive industries The book is an excellent reference for researchers and post-graduate students working in the area of IoT, or related areas. It also targets IT professionals interested in gaining deeper knowledge of IoT, its challenges, and application areas.

Computer simulation is an effective and popular universal tool that can be applied to almost all disciplines. Requiring only basic knowledge of programming, mathematics, and probability theory, Computer Simulation: A Foundational Approach Using Python takes a hands-on approach to programming to introduce the fundamentals of computer simulation. The main target of the book is computer science and engineering students who are interested mainly in directly applying the techniques to their research problems. The book will be of great interest to senior undergraduate and starting graduate students in the fields of computer science and engineering and industrial engineering.

Real-world engineering problems often require concurrent optimization of several design objectives, which are conflicting in cases. This type of optimization is generally called multi-objective or multi-criterion optimization. The area of research that applies evolutionary methodologies to multi-objective optimization is of special and growing interest. It brings a viable computational solution to many real-world problems. Generally, multi-objective engineering problems do not have a straightforward optimal design. These kinds of problems usually inspire several solutions of equal efficiency, which achieve different trade-offs. Decision makers’ preferences are normally used to select the most adequate design. Such preferences may be dictated before or after the optimization takes place. They may also be introduced interactively at different levels of the optimization process. Multi-objective optimization methods can be subdivided into classical and evolutionary. The classical methods usually aim at a single solution while the evolutionary methods provide a whole set of so-called Pareto-optimal solutions. Evolutionary Multi-Objective System Design: Theory and Applicationsprovides a representation of the state-of-the-art in evolutionary multi-objective optimization research area and related new trends. It reports many innovative designs yielded by the application of such optimization methods. It also presents the application of multi-objective optimization to the following problems: Embrittlement of stainless steel coated electrodes Learning fuzzy rules from imbalanced datasets Combining multi-objective evolutionary algorithms with collective intelligence Fuzzy gain scheduling control Smart placement of roadside units in vehicular networks Combining multi-objective evolutionary algorithms with quasi-simplex local search Design of robust substitution boxes Protein structure prediction problem Core assignment for efficient network-on-chip-based system design

With the ubiquitous diffusion of the IoT, Cloud Computing, 5G and other evolved wireless technologies into our daily lives, the world will see the Internet of the future expand ever more quickly. Driving the progress of communications and connectivity are mobile and wireless technologies, including traditional WLANs technologies and low, ultra-power, short and long-range technologies. These technologies facilitate the communication among the growing number of connected devices, leading to the generation of huge volumes of data. Processing and analysis of such "big data" brings about many opportunities, as well as many challenges, such as those relating to efficient power consumptions, security, privacy, management, and quality of service. This book is about the technologies, opportunities and challenges that can drive and shape the networks of the future. Written by established international researchers and experts, Networks of the Future answers fundamental and pressing research challenges in the field, including architectural shifts, concepts, mitigation solutions and techniques, and key technologies in the areas of networking. The book starts with a discussion on Cognitive Radio (CR) technologies as promising solutions for improving spectrum utilization, and also highlights the advances in CR spectrum sensing techniques and resource management methods. The second part of the book presents the latest developments and research in the areas of 5G technologies and Software Defined Networks (SDN). Solutions to the most pressing challenges facing the adoption of 5G technologies are also covered, and the new paradigm known as Fog Computing is examined in the context of 5G networks. The focus next shifts to efficient solutions for future heterogeneous networks. It consists of a collection of chapters that discuss self-healing solutions, dealing with Network Virtualization, QoS in heterogeneous networks, and energy efficient techniques for Passive Optical Networks and Wireless Sensor Networks. Finally, the areas of IoT and Big Data are discussed, including the latest developments and future perspectives of Big Data and the IoT paradigms.

From Internet of Things to Smart Cities: Enabling Technologies explores the information and communication technologies (ICT) needed to enable real-time responses to current environmental, technological, societal, and economic challenges. ICT technologies can be utilized to help with reducing carbon emissions, improving resource utilization efficiency, promoting active engagement of citizens, and more.This book aims to introduce the latest ICT technologies and to promote international collaborations across the scientific community, and eventually, the general public. It consists of three tightly coupled parts. The first part explores the involvement of enabling technologies from basic machine-to-machine communications to Internet of Things technologies. The second part of the book focuses on state of the art data analytics and security techniques, and the last part of the book discusses the design of human-machine interfaces, including smart home and cities.Features Provides an extended literature review of relevant technologies, in addition to detailed comparison diagrams, making new readers be easier to grasp fundamental and wide knowledge Contains the most recent research results in the field of communications, signal processing and computing sciences for facilitating smart homes, buildings, and cities Includes future research directions in Internet of Things, smart homes, smart buildings, smart grid, and smart cities Presents real examples of applying these enabling technologies to smart homes, transportation systems and cities With contributions from leading experts, the book follows an easy structure that not only presents timely research topics in-depth, but also integrates them into real world applications to help readers to better understand them.

From the Foreword:"This book exemplifies one of the most successful approaches to modeling and simulating [the] new generation of complex systems. FLAME was designed to make the building of large scale complex systems models straightforward and the simulation code that it generates is highly efficient and can be run on any modern technology. FLAME was the first such platform that ran efficiently on high performance parallel computers and a version for GPU technology is also available. At its heart, and the reason why it is so efficient and robust, is the use of a powerful computational model ‘Communicating X-machines’ which is general enough to cope with most types of modelling problems. As well as being increasingly important in academic research, FLAME is now being applied in industry in many different application areas. This book describes the basics of FLAME and is illustrated with numerous examples."—Professor Mike Holcombe, University of Sheffield, UKAgent-based models have shown applications in various fields such as biology, economics, and social science. Over the years, multiple agent-based modeling frameworks have been produced, allowing experts with non-computing background to easily write and simulate their models. However, most of these models are limited by the capability of the framework, the time it takes for a simulation to finish, or how to handle the massive amounts of data produced. FLAME (Flexible Large-scale Agent-based Modeling Environment) was produced and developed through the years to address these issues.This book contains a comprehensive summary of the field, covers the basics of FLAME, and shows how concepts of X-machines, can be stretched across multiple fields to produce agent models. It has been written with several audiences in mind. First, it is organized as a collection of models, with detailed descriptions of how models can be designed, especially for beginners. A number of theoretical aspects of software engineering and how they relate to agent-based models are discussed for students interested in software engineering and parallel computing. Finally, it is intended as a guide to developers from biology, economics, and social science, who want to explore how to write agent-based models for their research area. By working through the model examples provided, anyone should be able to design and build agent-based models and deploy them. With FLAME, they can easily increase the agent number and run models on parallel computers, in order to save on simulation complexity and waiting time for results.Because the field is so large and active, the book does not aim to cover all aspects of agent-based modeling and its research challenges. The models are presented to show researchers how they can build complex agent functions for their models. The book demonstrates the advantage of using agent-based models in simulation experiments, providing a case to move away from differential equations and build more reliable, close to real, models.The Open Access version of this book, available at https://doi.org/10.1201/9781315370729, has been made available under a Creative Commons Attribution-Non Commercial-No Derivatives 4.0 license.

From the Foreword"Getting CPS dependability right is essential to forming a solid foundation for a world that increasingly depends on such systems. This book represents the cutting edge of what we know about rigorous ways to ensure that our CPS designs are trustworthy. I recommend it to anyone who wants to get a deep look at these concepts that will form a cornerstone for future CPS designs."--Phil Koopman, Carnegie Mellon University, Pittsburgh, Pennsylvania, USATrustworthy Cyber-Physical Systems Engineering provides practitioners and researchers with a comprehensive introduction to the area of trustworthy Cyber Physical Systems (CPS) engineering. Topics in this book cover questions such asWhat does having a trustworthy CPS actually mean for something as pervasive as a global-scale CPS? How does CPS trustworthiness map onto existing knowledge, and where do we need to know more? How can we mathematically prove timeliness, correctness, and other essential properties for systems that may be adaptive and even self-healing? How can we better represent the physical reality underlying real-world numeric quantities in the computing system? How can we establish, reason about, and ensure trust between CPS components that are designed, installed, maintained, and operated by different organizations, and which may never have really been intended to work together? Featuring contributions from leading international experts, the book contains sixteen self-contained chapters that analyze the challenges in developing trustworthy CPS, and identify important issues in developing engineering methods for CPS.The book addresses various issues contributing to trustworthiness complemented by contributions on TCSP roadmapping, taxonomy, and standardization, as well as experience in deploying advanced system engineering methods in industry. Specific approaches to ensuring trustworthiness, namely, proof and refinement, are covered, as well as engineering methods for dealing with hybrid aspects.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, these cover only a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed.In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, they cover a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed.In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, they cover a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed.In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

Distributed Systems: An Algorithmic Approach, Second Edition provides a balanced and straightforward treatment of the underlying theory and practical applications of distributed computing. As in the previous version, the language is kept as unobscured as possible—clarity is given priority over mathematical formalism. This easily digestible text:Features significant updates that mirror the phenomenal growth of distributed systemsExplores new topics related to peer-to-peer and social networksIncludes fresh exercises, examples, and case studiesSupplying a solid understanding of the key principles of distributed computing and their relationship to real-world applications, Distributed Systems: An Algorithmic Approach, Second Edition makes both an ideal textbook and a handy professional reference.

The Handbook of Algorithms for Wireless Networking and Mobile Computing focuses on several aspects of mobile computing, particularly algorithmic methods and distributed computing with mobile communications capability. It provides the topics that are crucial for building the foundation for the design and construction of future generations of mobile and wireless networks, including cellular, wireless ad hoc, sensor, and ubiquitous networks. Following an analysis of fundamental algorithms and protocols, the book offers a basic overview of wireless technologies and networks. Other topics include issues related to mobility, aspects of QoS provisioning in wireless networks, future applications, and much more.

Real-time and embedded systems are essential to our lives, from controlling car engines and regulating traffic lights to monitoring plane takeoffs and landings to providing up-to-the-minute stock quotes. Bringing together researchers from both academia and industry, the Handbook of Real-Time and Embedded Systems provides comprehensive covera

This handbook is the first to present a unified, comprehensive treatment of graph theory, combinatorial optimization, and related algorithmic issues. It covers numerous topics of interest in applications in electrical, communication, computer, social, transportation, biological, and other networks. The book provides readers with the algorithmic and theoretical foundations to understand phenomena as shaped by their graph structures, develop needed algorithmic and optimization tools for the study of graph structures, and design and plan graph structures that lead to certain desirable behavior.

The ability of parallel computing to process large data sets and handle time-consuming operations has resulted in unprecedented advances in biological and scientific computing, modeling, and simulations. Exploring these recent developments, the Handbook of Parallel Computing: Models, Algorithms, and Applications provides comprehensive coverage on a

This handbook provides full coverage of the most recent and advanced topics in scheduling, assembling researchers from all relevant disciplines to facilitate new insights. Presented in six parts, these experts provides introductory material, complete with tutorials and algorithms, then examine classical scheduling problems. Part 3 explores scheduling models that originate in areas such as computer science, operations research. The following section examines scheduling problems that arise in real-time systems. Part 5 discusses stochastic scheduling and queueing networks, and the final section discusses a range of applications in a variety of areas, from airlines to hospitals.

The Practical Handbook of Internet Computing analyzes a broad array of technologies and concerns related to the Internet, including corporate intranets. Fresh and insightful articles by recognized experts address the key challenges facing Internet users, designers, integrators, and policymakers. In addition to discussing major applications, it also

Rapid energy estimation for energy efficient applications using field-programmable gate arrays (FPGAs) remains a challenging research topic. Energy dissipation and efficiency have prevented the widespread use of FPGA devices in embedded systems. Helping overcome these challenges, this book offers solutions for the development of energy efficient applications using FPGAs. It provides a framework for high-level hardware-software application development, describes energy performance modeling for reconfigurable system-on-chip devices, and explores energy efficient designs for various applications. The authors present a two-step rapid energy estimation technique that enables high-level design space exploration and offer a hardware-software design for energy efficient implementations of operating systems.

Energy-Aware Memory Management for Embedded Multimedia Systems: A Computer-Aided Design Approach presents recent computer-aided design (CAD) ideas that address memory management tasks, particularly the optimization of energy consumption in the memory subsystem. It explains how to efficiently implement CAD solutions, including theoretical methods and novel algorithms. The book covers various energy-aware design techniques, including data-dependence analysis techniques, memory size estimation methods, extensions of mapping approaches, and memory banking approaches. It shows how these techniques are used to evaluate the data storage of an application, reduce dynamic and static energy consumption, design energy-efficient address generation units, and much more.Providing an algebraic framework for memory management tasks, this book illustrates how to optimize energy consumption in memory subsystems using CAD solutions. The algorithmic style of the text should help electronic design automation (EDA) researchers and tool developers create prototype software tools for system-level exploration, with the goal to ultimately obtain an optimized architectural solution of the memory subsystem.

In spite of their importance and potential societal impact, there is currently no comprehensive source of information about vehicular ad hoc networks (VANETs). Cohesively integrating the state of the art in this emerging field, Vehicular Networks: From Theory to Practice elucidates many issues involved in vehicular networking, including traffic engineering, human factors studies, and novel computer science research.Divided into six broad sections, the book begins with an overview of traffic engineering issues, such as traffic monitoring and traffic flow modeling. It then introduces governmental and industrial efforts in the United States and Europe to set standards and perform field tests on the feasibility of vehicular networks. After highlighting innovative applications enabled by vehicular networks, the book discusses several networking-related issues, including routing and localization. The following section focuses on simulation, which is currently the primary method for evaluating vehicular networking systems. The final part explores the extent and impact of driver distraction with in-vehicle displays.Encompassing both introductory and advanced concepts, this guide covers the various areas that impact the design of applications for vehicular networks. It details key research challenges, offers guidance on developing future standards, and supplies valuable information on existing experimental studies.