This book constitutes the refereed proceedings of the 7th International Workshop on Multiple Access Communications, MACOM 2014, held in Halmstad, Sweden, in August 2014. The 12 full papers presented were carefully reviewed and selected from 22 submissions. They describe the latest advancements in the field of multiple access communications with an emphasis on reliability issues, physical layer techniques, cognitive radio, medium access control protocols, and video coding.

This book constitutes the refereed proceedings of the 16 International Symposium on Stabilization, Safety and Security of Distributed Systems, SSS 2013, held in Osaka, Japan, in September/October 2014. The 21 regular papers and 8 short papers presented were carefully reviewed and selected from 44 submissions. The Symposium is organized in several tracks, reflecting topics to self-* properties. The tracks are self-stabilization; ad-hoc; sensor and mobile networks; cyberphysical systems; fault-tolerant and dependable systems; formal methods; safety and security; and cloud computing; P2P; self-organizing; and autonomous systems.

This book and its companion volume, LNCS vols. 7928 and 7929 constitute the proceedings of the 4th International Conference on Swarm Intelligence, ICSI 2013, held in Harbin, China in June 2013. The 129 revised full papers presented were carefully reviewed and selected from 268 submissions. The papers are organized in 22 cohesive sections covering all major topics of swarm intelligence research and developments. The following topics are covered in this volume: analysis of swarm intelligence based algorithms, particle swarm optimization, applications of particle swarm optimization algorithms, ant colony optimization algorithms, biogeography-based optimization algorithms, novel swarm-based search methods, bee colony algorithms, differential evolution, neural networks, fuzzy methods, evolutionary programming and evolutionary games.

This book constitutes the refereed proceedings of the 8th International Workshop on Hybrid Metaheuristics, HM 2013, held in Ischia, Italy, in May 2013. The 16 revised full papers presented were carefully reviewed and selected from 30 submissions. The selected papers cover both theoretical and experimental results, including new paradigmatic hybrid solvers and automatic design approaches as well as applications to logistics and public transport.

The two volume-set, LNCS 7930 and LNCS 7931, constitutes the refereed proceedings of the 5th International Work-Conference on the Interplay between Natural and Artificial Computation, IWINAC 2013, held in Mallorca, Spain, in June 2013. The 92 revised full papers presented in LNCS 7930 and LNCS 7931 were carefully reviewed and selected from numerous submissions. The first part, LNCS 7930, entitled "Natural and Artificial Models in Computation and Biology," includes all the contributions mainly related to the methodological, conceptual, formal, and experimental developments in the fields of neurophysiology and cognitive science. The second part, LNCS 7931, entitled "Natural and Artificial Computation in Engineering and Medical Applications," contains the papers related to bioinspired programming strategies and all the contributions related to the computational solutions to engineering problems in different application domains, specially Health applications, including the CYTED "Artificial and Natural Computation for Health" (CANS) research network papers. In addition, this two volume-set reflects six interesting areas: cognitive robotics; natural computing; wetware computation; quality of life technologies; biomedical and industrial perception applications; and Web intelligence and neuroscience.

This book constitutes the thoroughly refereed post-conference proceedings of the 5th International Conference on Advanced Infocomm Technology, ICAIT 2012, held in Paris, France, July 2012.
The 32 revised full papers presented together with 4 invited talks were carefully selected from 97 submissions. The papers are organized in topical sections on fixed mobile convergence and emerging networks technologies, performance and quality of service, fiber technologies and multimedia processing, communication softwares and services, security, sensor technologies and wireless systems, energy-aware networks and power management, and mobile ad-hoc, mesh and vehicular networks.

The Eighth Annual Working Conference of Information Security Management and Small Systems Security, jointly presented by WG11.1 and WG11.2 of the International Federation for Information Processing (IFIP), focuses on various state-of-art concepts in the two relevant fields. The conference focuses on technical, functional as well as managerial issues. This working conference brings together researchers and practitioners of different disciplines, organisations, and countries, to discuss the latest developments in (amongst others) information security methods, methodologies and techniques, information security management issues, risk analysis, managing information security within electronic commerce, computer crime and intrusion detection. We are fortunate to have attracted two highly acclaimed international speakers to present invited lectures, which will set the platform for the reviewed papers. Invited speakers will talk on a broad spectrum of issues, all related to information security management and small system security issues. These talks cover new perspectives on electronic commerce, security strategies, documentation and many more. All papers presented at this conference were reviewed by a minimum of two international reviewers. We wish to express our gratitude to all authors of papers and the international referee board. We would also like to express our appreciation to the organising committee, chaired by Gurpreet Dhillon, for all their inputs and arrangements. Finally, we would like to thank Les Labuschagne and Hein Venter for their contributions in compiling this proceeding for WG11.1 and WG 11.2.

This book is a collection of extended versions of the papers presented at the Symposium on Next Generation Wireless Networks, May 26, 2000, New Jersey Institute of Technology, Newark, NJ. Each chapter includes, in addition to technical contributions, a tutorial of the corresponding area. It has been a privilege to bring together these contributions from researchers on the leading edge of the field. The papers were submitted in response to a call for papers aiming to concentrate on the applications and services for the "next generation," deliberately omitting the numeric reference so that the authors' vision of the future would not be limited by the definitive requirements of a particular set of standards. The book, as a result, reflects the top-down approach by focusing on enabling technologies for the applications and services that are the defining essentials for future wireless networks. This approach strikes a balance between the academia and the industry by addressing new wireless network architectures enabling mobility and location enhanced applications and services that will give wireless systems the competitive edge over others. The main theme of the book is the advent of wireless networks as an irreplaceable means of global communication as opposed to a mere substitute for, or a competitor of, wireline networks. Geolocation emerges as the facilitator of mobility and location sensitive services. The fields of geolocation and wireless communications have been forced to merge, following the Federal Commission of Communications' (FCC) ruling that obliges wireless providers with emergency caller geolocation.

Great advances have been made in the database field. Relational and object- oriented databases, distributed and client/server databases, and large-scale data warehousing are among the more notable. However, none of these advances promises to have as great and direct an effect on the daily lives of ordinary citizens as video databases. Video databases will provide a quantum jump in our ability to deal with visual data, and in allowing people to access and manipulate visual information in ways hitherto thought impossible. Video Database Systems: Issues, Products and Applications gives practical information on academic research issues, commercial products that have already been developed, and the applications of the future driving this research and development. This book can also be considered a reference text for those entering the field of video or multimedia databases, as well as a reference for practitioners who want to identify the kinds of products needed in order to utilize video databases. Video Database Systems: Issues, Products and Applications covers concepts, products and applications. It is written at a level which is less detailed than that normally found in textbooks but more in-depth than that normally written in trade press or professional reference books. Thus, it seeks to serve both an academic and industrial audience by providing a single source of information about the research issues in the field, and the state-of-the-art of practice.

* Provides simple, conceptual descriptions of everyday technologies * Includes clear examples and diagrams that demonstrate the principles and techniques, not just a "how-to" punch list * Covers advanced topics for readers who want to dive into the deep end of the technology pool * Avoids jargon-where terminology does appear, the text will provide clear, concise definitions

This book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event. The 22 revised full papers presented together with invited talk were carefully reviewed and selected from 60 submissions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.

This book constitutes the refereed proceedings of the 9th International Symposium on Bioinformatics Research and Applications, ISBRA 2013, held in Charlotte, NC, USA, in May 2013. The 25 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 46 submissions. The papers cover a wide range of biomedical databases and data integration, high-performance bio-computing, biomolecular imaging, high-throughput sequencing data analysis, bio-ontologies, molecular evolution, comparative genomics and phylogenomics, molecular modeling and simulation, pattern discovery and classification, computational proteomics, population genetics, data mining and visualization, software tools and applications.

This book constitutes the refereed proceedings of the International Conference on Intelligent Information Systems, IIS 2013, held in Warsaw, Poland in June 2013. The 28 full papers included in this volume were carefully reviewed and selected from 53 submissions. The contributions are organized in topical sections named: Natural language processing, text and Web mining, and machine learning and search.

This book provides a broad coverage of fundamental and advanced con cepts of data structures and algorithms. The material presented includes a treatment of elementary data structures such as arrays, lists, stacks, and trees, as well as newer structures that have emerged to support the process ing of multidimensional or spatial data files. These newer structures and algorithms have received increasing attention in recent years in conjunc tion with the rapid growth in computer-aided design, computer graphics, and related fields in which multidimensional data structures are of great interest. Our main objective is to mesh the underlying concepts with application examples that are of practical use and are timely in their implementations. To this end, we have used mainly the Abstract Data Structure (or Abstract Data Type (ADT)) approach to define structures for data and operations. Object-oriented programming (OOP) methodologies are employed to im plement these ADT concepts. In OOP, data and operations for an ADT are combined into a single entity (object). ADTs are used to specifiy the objects-arrays, stacks, queues, trees, and graphs. OOP allows the pro grammer to more closely mimic the real-world applications. This OOP is more structured and modular than previous attempts. OOP has become de facto state-of-the-art in the 1990s.

This volume is a compilation of the research program of the 10th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2013, held at Yorktown Heights, NY, USA, in May 2013. This volume contains 20 full papers and 11 short papers that were carefully reviewed and selected from 71 submissions. The papers focus on new techniques or applications in the intersection of constraint programming (CP), artificial intelligence (AI) and operations research (OR).

As Information Technology becomes a vital part of our everyday activities, ranging from personal use to government and defense applications, the need to develop high-assurance systems increases. Data and applications security and privacy are crucial elements in developing such systems. Research Directions in Data and Applications Security XVIII presents original unpublished research results, practical experiences, and innovative ideas in the field of data and applications security and privacy. Topics presented in this volume include: -Database theory; -Inference control; -Data protection techniques; -Distributed systems; -Access control models; -Security policy; -Design and management; -Privacy; -Network security. This book is the eighteenth volume in the series produced by the International Federation for Information Processing (IFIP) Working Group 11.3 on Data and Applications Security. It contains twenty-three papers and two invited talks that were presented at the Eighteenth Annual IFIP WG 11.3 Conference on Data and Applications Security, which was sponsored by IFIP and held in Sitges, Catalonia, Spain in July 2004. Research Directions in Data and Applications Security XVIII is a high-quality reference volume that addresses several aspects of information protection, and is aimed at researchers, educators, students, and developers.

This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

This book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013.
The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search.

This book constitutes the thoroughly refereed post-conference proceedings of the 17th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2013, held Boston, MA, USA, in May 2013. The 10 revised papers presented were carefully reviewed and selected from 20 submissions. The papers cover the following topics parallel scheduling for commercial environments, scientific computing, supercomputing and cluster platforms.

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Evolutionary Algorithms (EAs) are population-based, stochastic search algorithms that mimic natural evolution. Due to their ability to find excellent solutions for conventionally hard and dynamic problems within acceptable time, EAs have attracted interest from many researchers and practitioners in recent years. This book "Variants of Evolutionary Algorithms for Real-World Applications" aims to promote the practitioner's view on EAs by providing a comprehensive discussion of how EAs can be adapted to the requirements of various applications in the real-world domains. It comprises 14 chapters, including an introductory chapter re-visiting the fundamental question of what an EA is and other chapters addressing a range of real-world problems such as production process planning, inventory system and supply chain network optimisation, task-based jobs assignment, planning for CNC-based work piece construction, mechanical/ship design tasks that involve runtime-intense simulations, data mining for the prediction of soil properties, automated tissue classification for MRI images, and database query optimisation, among others. These chapters demonstrate how different types of problems can be successfully solved using variants of EAs and how the solution approaches are constructed, in a way that can be understood and reproduced with little prior knowledge on optimisation.

The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2- or 3-dimensional space? Variants of this industrially-significant computational geometry problem also require the path to pass through specified areas and avoid defined obstacles.

This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Suitable for a second- or third-year university algorithms course, the text enables readers to understand not only the algorithms and their pseudocodes, but also the correctness proofs, the analysis of time complexities, and other related topics.

Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs in the plane; examines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curves; describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems; includes lists of symbols and abbreviations, in addition to other appendices.

This hands-on guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortest-path problems in practical applications will also find the book a useful resource.

Security and privacy are paramount concerns in information processing systems, which are vital to business, government and military operations and, indeed, society itself. Meanwhile, the expansion of the Internet and its convergence with telecommunication networks are providing incredible connectivity, myriad applications and, of course, new threats. Data and Applications Security XVII: Status and Prospects describes original research results, practical experiences and innovative ideas, all focused on maintaining security and privacy in information processing systems and applications that pervade cyberspace. The areas of coverage include: -Information Warfare, -Information Assurance, -Security and Privacy, -Authorization and Access Control in Distributed Systems, -Security Technologies for the Internet, -Access Control Models and Technologies, -Digital Forensics. This book is the seventeenth volume in the series produced by the International Federation for Information Processing (IFIP) Working Group 11.3 on Data and Applications Security. It presents a selection of twenty-six updated and edited papers from the Seventeenth Annual IFIP TC11 / WG11.3 Working Conference on Data and Applications Security held at Estes Park, Colorado, USA in August 2003, together with a report on the conference keynote speech and a summary of the conference panel. The contents demonstrate the richness and vitality of the discipline, and other directions for future research in data and applications security. Data and Applications Security XVII: Status and Prospects is an invaluable resource for information assurance researchers, faculty members and graduate students, as well as for individuals engaged in research and development in the information technology sector.

Foreword by Lars Knudsen Practical Intranet Security focuses on the various ways in which an intranet can be violated and gives a thorough review of the technologies that can be used by an organization to secure its intranet. This includes, for example, the new security architecture SESAME, which builds on the Kerberos authentication system, adding to it both public-key technology and a role-based access control service. Other technologies are also included such as a description of how to program with the GSS-API, and modern security technologies such as PGP, S/MIME, SSH, SSL IPSEC and CDSA. The book concludes with a comparison of the technologies. This book is different from other network security books in that its aim is to identify how to secure an organization's intranet. Previously books have concentrated on the Internet, often neglecting issues relating to securing intranets. However the potential risk to business and the ease by which intranets can be violated is often far greater than via the Internet. The aim is that network administrators and managers can get the information that they require to make informed choices on strategy and solutions for securing their own intranets. The book is an invaluable reference for network managers and network administrators whose responsibility it is to ensure the security of an organization's intranet. The book also contains background reading on networking, network security and cryptography which makes it an excellent research reference and undergraduate/postgraduate text book.