This book constitutes the refereed proceedings of the 5th International Conference on Decision and Game Theory for Security, GameSec 2014, held in Los Angeles, CA, USA, in November 2014. The 16 revised full papers presented together with 7 short papers were carefully reviewed and selected from numerous submissions. The covered topics cover multiple facets of cyber security that include: rationality of adversary, game-theoretic cryptographic techniques, vulnerability discovery and assessment, multi-goal security analysis, secure computation, economic-oriented security, and surveillance for security. Those aspects are covered in a multitude of domains that include networked systems, wireless communications, border patrol security, and control systems.

Thisvolumecontainstheinvitedandregularpaperspresentedat TCS 2010,the 6thIFIP International Conference on Theoretical Computer Science, organised by IFIP Tech- cal Committee 1 (Foundations of Computer Science) and IFIP WG 2.2 (Formal - scriptions of Programming Concepts) in association with SIGACT and EATCS. TCS 2010 was part of the World Computer Congress held in Brisbane, Australia, during September 20-23, 2010 ( ). TCS 2010 is composed of two main areas: (A) Algorithms, Complexity and Models of Computation, and (B) Logic, Semantics, Speci?cation and Veri?cation. The selection process led to the acceptance of 23 papers out of 39 submissions, eachofwhichwasreviewedbythreeProgrammeCommitteemembers.TheProgramme Committee discussion was held electronically using Easychair. The invited speakers at TCS 2010 are: Rob van Glabbeek (NICTA, Australia) Bart Jacobs (Nijmegen, The Netherlands) Catuscia Palamidessi (INRIA and LIX, Paris, France) Sabina Rossi (Venice, Italy) James Harland (Australia) and Barry Jay (Australia) acted as TCS 2010 Chairs. We take this occasion to thank the members of the Programme Committees and the external reviewers for the professional and timely work; the conference Chairs for their support; the invited speakers for their scholarly contribution; and of course the authors for submitting their work to TCS 2010.

The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.

This book constitutes the proceedings of the 28th International Symposium on Distributed Computing, DISC 2014, held in Austin, TX, USA, in October 2014. The 35 full papers presented in this volume were carefully reviewed and selected from 148 full paper submissions. In the back matter of the volume a total of 18 brief announcements is presented. The papers are organized in topical sections named: concurrency; biological and chemical networks; agreement problems; robot coordination and scheduling; graph distances and routing; radio networks; shared memory; dynamic and social networks; relativistic systems; transactional memory and concurrent data structures; distributed graph algorithms; and communication.

Identity Based Encryption (IBE) is a type of public key encryption and has been intensely researched in the past decade. Identity-Based Encryption summarizes the available research for IBE and the main ideas that would enable users to pursue further work in this area. This book will also cover a brief background on Elliptic Curves and Pairings, security against chosen Cipher text Attacks, standards and more. Advanced-level students in computer science and mathematics who specialize in cryptology, and the general community of researchers in the area of cryptology and data security will find Identity-Based Encryption a useful book. Practitioners and engineers who work with real-world IBE schemes and need a proper understanding of the basic IBE techniques, will also find this book a valuable asset.

Machine learning, one of the top emerging sciences, has an extremely broad range of applications. However, many books on the subject provide only a theoretical approach, making it difficult for a newcomer to grasp the subject material. This book provides a more practical approach by explaining the concepts of machine learning algorithms and describing the areas of application for each algorithm, using simple practical examples to demonstrate each algorithm and showing how different issues related to these algorithms are applied.

This book constitutes the refereed proceedings of the 6th International Workshop on Post-Quantum Cryptography, PQCrypto 2014, held in Waterloo, ON, Canada, in October 2014. The 16 revised full papers presented were carefully reviewed and selected from 37 submissions. The papers cover all technical aspects of cryptographic research related to the future world with large quantum computers such as code-based cryptography, lattice-based cryptography, multivariate cryptography, isogeny-based cryptography, security proof frameworks, cryptanalysis and implementations.

This book constitutes the proceedings of the International Conference on Adaptive and Intelligent Systems, ICAIS 2014, held in Bournemouth, UK, in September 2014. The 19 full papers included in these proceedings together with the abstracts of 4 invited talks, were carefully reviewed and selected from 32 submissions. The contributions are organized under the following topical sections: advances in feature selection; clustering and classification; adaptive optimization; advances in time series analysis.

This book constitutes the refereed proceedings of the 13th International Conference on Parallel Problem Solving from Nature, PPSN 2013, held in Ljubljana, Slovenia, in September 2014. The total of 90 revised full papers were carefully reviewed and selected from 217 submissions. The meeting began with 7 workshops which offered an ideal opportunity to explore specific topics in evolutionary computation, bio-inspired computing and metaheuristics. PPSN XIII also included 9 tutorials. The papers are organized in topical sections on adaption, self-adaption and parameter tuning; classifier system, differential evolution and swarm intelligence; coevolution and artificial immune systems; constraint handling; dynamic and uncertain environments; estimation of distribution algorithms and metamodelling; genetic programming; multi-objective optimisation; parallel algorithms and hardware implementations; real world applications; and theory.

This book and its companion volume, LNCS vol. 8794 and 8795 constitute the proceedings of the 5th International Conference on Swarm Intelligence, ICSI 2014, held in Hefei, China in October 2014. The 107 revised full papers presented were carefully reviewed and selected from 198 submissions. The papers are organized in 18 cohesive sections, 3 special sessions and one competitive session covering all major topics of swarm intelligence research and development such as novel swarm-based search methods; novel optimization algorithm; particle swarm optimization; ant colony optimization for travelling salesman problem; artificial bee colony algorithms; artificial immune system; evolutionary algorithms; neural networks and fuzzy methods; hybrid methods; multi-objective optimization; multi-agent systems; evolutionary clustering algorithms; classification methods; GPU-based methods; scheduling and path planning; wireless sensor networks; power system optimization; swarm intelligence in image and video processing; applications of swarm intelligence to management problems; swarm intelligence for real-world application.

This book is nothing less than a complete and comprehensive survey of the state-of-the-art of terrorism informatics. It covers the application of advanced methodologies and information fusion and analysis. It also lays out techniques to acquire, integrate, process, analyze, and manage the diversity of terrorism-related information for international and homeland security-related applications. The book details three major areas of terrorism research: prevention, detection, and established governmental responses to terrorism. It systematically examines the current and ongoing research, including recent case studies and application of terrorism informatics techniques. The coverage then presents the critical and relevant social/technical areas to terrorism research including social, privacy, data confidentiality, and legal challenges.

This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014. The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.

Genetic Algorithms in Java Basics is a brief introduction to solving problems using genetic algorithms, with working projects and solutions written in the Java programming language. This brief book will guide you step-by-step through various implementations of genetic algorithms and some of their common applications, with the aim to give you a practical understanding allowing you to solve your own unique, individual problems. After reading this book you will be comfortable with the language specific issues and concepts involved with genetic algorithms and you'll have everything you need to start building your own. Genetic algorithms are frequently used to solve highly complex real world problems and with this book you too can harness their problem solving capabilities. Understanding how to utilize and implement genetic algorithms is an essential tool in any respected software developers toolkit. So step into this intriguing topic and learn how you too can improve your software with genetic algorithms, and see real Java code at work which you can develop further for your own projects and research. Guides you through the theory behind genetic algorithms Explains how genetic algorithms can be used for software developers trying to solve a range of problems Provides a step-by-step guide to implementing genetic algorithms in Java

This book constitutes the refereed proceedings of 5 workshops of the 15th International Conference on Web-Age Information Management, WAIM 2014, held in Macau, China, June 16-18, 2014. The 38 revised full papers are organized in topical sections on the 5 following workshops: Second International Workshop on Emergency Management in Big Data Age, BigEM 2014; Second International Workshop on Big Data Management on Emerging Hardware, HardBD 2014; International Workshop on Data Management for Next-Generation Location-based Services, DaNoS 2014; International Workshop on Human Aspects of Making Recommendations in Social Ubiquitous Networking Environment, HRSUME 2014; International Workshop on Big Data Systems and Services, BIDASYS 2014.

This book constitutes the proceedings of the International Workshop on Clustering High-Dimensional Data, CHDD 2012, held in Naples, Italy, in May 2012. The 9 papers presented in this volume were carefully reviewed and selected from 15 submissions. They deal with the general subject and issues of high-dimensional data clustering; present examples of techniques used to find and investigate clusters in high dimensionality; and the most common approach to tackle dimensionality problems, namely, dimensionality reduction and its application in clustering.

This book constitutes the refereed proceedings of the 20th International Conference on DNA Computing and Molecular Programming, DNA 20, held in Kyoto, Japan, in September 2014. The 10 full papers presented were carefully selected from 55 submissions. The papers are organized in many disciplines (including mathematics, computer science, physics, chemistry, material science and biology) to address the analysis, design, and synthesis of information-based molecular systems.

Thomas Feller sheds some light on trust anchor architectures for trustworthy reconfigurable systems. He is presenting novel concepts enhancing the security capabilities of reconfigurable hardware. Almost invisible to the user, many computer systems are embedded into everyday artifacts, such as cars, ATMs, and pacemakers. The significant growth of this market segment within the recent years enforced a rethinking with respect to the security properties and the trustworthiness of these systems. The trustworthiness of a system in general equates to the integrity of its system components. Hardware-based trust anchors provide measures to compare the system configuration to reference measurements. Reconfigurable architectures represent a special case in this regard, as in addition to the software implementation, the underlying hardware architecture may be exchanged, even during runtime.

Mathematical summary for Digital Signal Processing Applications with Matlab consists of Mathematics which is not usually dealt in the DSP core subject, but used in DSP applications. Matlab programs with illustrations are given for the selective topics such as generation of Multivariate Gaussian distributed sample outcomes, Bacterial foraging algorithm, Newton's iteration, Steepest descent algorithm, etc. are given exclusively in the separate chapter. Also Mathematical summary for Digital Signal Processing Applications with Matlab is written in such a way that it is suitable for Non-Mathematical readers and is very much suitable for the beginners who are doing research in Digital Signal Processing.

This book constitutes the refereed proceedings of the 22st Annual European Symposium on Algorithms, ESA 2014, held in Wroclaw, Poland, in September 2014, as part of ALGO 2014. The 69 revised full papers presented were carefully reviewed and selected from 269 initial submissions: 57 out of 221 in Track A, Design and Analysis, and 12 out of 48 in Track B, Engineering and Applications. The papers present original research in the areas of design and mathematical analysis of algorithms; engineering, experimental analysis, and real-world applications of algorithms and data structures.

As a beginning graduate student, I recall being frustrated by a general lack of acces sible sources from which I could learn about (theoretical) cryptography. I remember wondering: why aren't there more books presenting the basics of cryptography at an introductory level? Jumping ahead almost a decade later, as a faculty member my graduate students now ask me: what is the best resource for learning about (various topics in) cryptography? This monograph is intended to serve as an answer to these 1 questions - at least with regard to digital signature schemes. Given the above motivation, this book has been written with a beginninggraduate student in mind: a student who is potentially interested in doing research in the ?eld of cryptography, and who has taken an introductory course on the subject, but is not sure where to turn next. Though intended primarily for that audience, I hope that advanced graduate students and researchers will ?nd the book useful as well. In addition to covering various constructions of digital signature schemes in a uni?ed framework, this text also serves as a compendium of various "folklore" results that are, perhaps, not as well known as they should be. This book could also serve as a textbook for a graduate seminar on advanced cryptography; in such a class, I expect the entire book could be covered at a leisurely pace in one semester with perhaps some time left over for excursions into related topics.

Production Grids in Asia: Applications, Developments and Global Ties, an edited volume, is based on ISGC (International Symposium on Grid Computing), one of the most prestigious annual events in Asia. It brings together scientists and engineers worldwide to exchange ideas, present challenges/solutions, and introduce future development in the field of Grid Computing. ISGC 2008 was held at Academia Sinica, Taipei, Taiwan in April 2008. The edited proceedings present international projects in Grid operation, Grid Middleware and e-Science applications. Leading Grid projects from Asia-Pacific are also covered. Production Grids in Asia: Applications, Developments and Global Ties is designed for a professional audience composed of industry researchers and practitioners within the Grid community. This volume is also suitable for advanced-level students in computer science.

The book is the first thorough overview of the first important steps to develop a worldwide virtual observatory so that, in the future, it could be easier to "dial-up" a part of the sky than wait many months to access a telescope. The articles in this book present details on the status of the first efforts to develop a standardized framework for the virtual observatory, including steps towards completion and deployment of technical infrastructure, uptake by data providers worldwide, and utilization by the scientific community.

The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be "syntax-directed", that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is "parsed" according to the syntax of the language, and the object code for the program is generated according to the semantics attached to the parsed syntactic entities. Context-free grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing context-free languages were devel oped. Practical considerations led to the definition of various kinds of restricted context-free grammars that are parsable by means of efficient deterministic linear-time algorithms.

This book constitutes the refereed proceedings of the 9th Chinese Conference on Biometric Recognition, CCBR 2014, held in Shenyang, China, in November 2014. The 60 revised full papers presented were carefully reviewed and selected from among 90 submissions. The papers focus on face, fingerprint and palmprint, vein biometrics, iris and ocular biometrics, behavioral biometrics, application and system of biometrics, multi-biometrics and information fusion, other biometric recognition and processing.

This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book. The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Groebner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.