This book constitutes the refereed proceedings of the First International Conference on Advances in Computing and Data Sciences, ICACDS 2016, held in Ghaziabad, India, in November 2016. The 64 full papers were carefully reviewed and selected from 502 submissions. The papers are organized in topical sections on Advanced Computing; Communications; Informatics; Internet of Things; Data Sciences.

The two volume set CCIS 775 and 776 constitutes the refereed proceedings of the First International Conference on Computational Intelligence, Communications, and Business Analytics, CICBA 2017, held in Kolkata, India, in March 2017. The 90 revised full papers presented in the two volumes were carefully reviewed and selected from 276 submissions. The papers are organized in topical sections on data science and advanced data analytics; signal processing and communications; microelectronics, sensors, intelligent networks; computational forensics (privacy and security); computational intelligence in bio-computing; computational intelligence in mobile and quantum computing; intelligent data mining and data warehousing; computational intelligence.

The volume is a collection of high-quality peer-reviewed research papers presented in the International Conference on Artificial Intelligence and Evolutionary Computation in Engineering Systems (ICAIECES 2016) held at SRM University, Chennai, Tamilnadu, India. This conference is an international forum for industry professionals and researchers to deliberate and state their research findings, discuss the latest advancements and explore the future directions in the emerging areas of engineering and technology. The book presents original work and novel ideas, information, techniques and applications in the field of communication, computing and power technologies.

This book presents the algorithms used to provide recommendations by exploiting matrix factorization and tensor decomposition techniques. It highlights well-known decomposition methods for recommender systems, such as Singular Value Decomposition (SVD), UV-decomposition, Non-negative Matrix Factorization (NMF), etc. and describes in detail the pros and cons of each method for matrices and tensors. This book provides a detailed theoretical mathematical background of matrix/tensor factorization techniques and a step-by-step analysis of each method on the basis of an integrated toy example that runs throughout all its chapters and helps the reader to understand the key differences among methods. It also contains two chapters, where different matrix and tensor methods are compared experimentally on real data sets, such as Epinions, GeoSocialRec, Last.fm, BibSonomy, etc. and provides further insights into the advantages and disadvantages of each method. The book offers a rich blend of theory and practice, making it suitable for students, researchers and practitioners interested in both recommenders and factorization methods. Lecturers can also use it for classes on data mining, recommender systems and dimensionality reduction methods.

This book serves as a basic reference for those interested in the application of metaheuristics to speech enhancement. The major goal of the book is to explain the basic concepts of optimization methods and their use in heuristic optimization in speech enhancement to scientists, practicing engineers, and academic researchers in speech processing. The authors discuss why it has been a challenging problem for researchers to develop new enhancement algorithms that aid in the quality and intelligibility of degraded speech. They present powerful optimization methods to speech enhancement that can help to solve the noise reduction problems. Readers will be able to understand the fundamentals of speech processing as well as the optimization techniques, how the speech enhancement algorithms are implemented by utilizing optimization methods, and will be given the tools to develop new algorithms. The authors also provide a comprehensive literature survey regarding the topic.

David Foerster examines privacy protection for vehicular communication under the assumption of an attacker that is able to compromise back-end systems - motivated by the large number of recent security incidents and revelations about mass surveillance. The author aims for verifiable privacy protection enforced through cryptographic and technical means, which safeguards user data even if back-end systems are not fully trusted. Foerster applies advanced cryptographic concepts, such as anonymous credentials, and introduces a novel decentralized secret sharing algorithm to fulfill complex and seemingly contradicting requirements in several vehicle-to-x application scenarios. Many of the concepts and results can also be applied to other flavors of internet of things systems.

Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. Handbook of Finite State Based Models and Applications provides a complete collection of introductory materials on finite state theories, algorithms, and the latest domain applications. For beginners, the book is a handy reference for quickly looking up model details. For more experienced researchers, it is suitable as a source of in-depth study in this area.

The book first introduces the fundamentals of automata theory, including regular expressions, as well as widely used automata, such as transducers, tree automata, quantum automata, and timed automata. It then presents algorithms for the minimization and incremental construction of finite automata and describes Esterel, an automata-based synchronous programming language for embedded system software development.

Moving on to applications, the book explores regular path queries on graph-structured data, timed automata in model checking security protocols, pattern matching, compiler design, and XML processing. It also covers other finite state-based modeling approaches and applications, including Petri nets, statecharts, temporal logic, and UML state machine diagrams.

This book constitutes the proceedings of the 5th International Conference on Context-Aware Systems and Applications, ICCASA 2016, held in Thu Dau Mot, Vietnam, in November 2016. The 22 revised full papers presented were carefully selected from 35 submissions and cover a wide spectrum in the area of Context-Aware-Systems (CAS). CAS is characterized by its self- facets such as self-organization, self-configuration, self-healing, self-optimization, self-protection, where context awareness used to dynamically control computing and networking functions. The overall goal of CAS is to realize nature-inspired autonomic systems that can manage themselves without direct human interventions.

This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.

The master thesis of Susanne Goebel generates the deep understanding of the Mobile Ambient (MA) calculus that is necessary to use it as a modeling language. Instead of calculus terms a much more convenient representation via MA trees naturally maps to the application area of networks where processes pass hierarchical protection domains like firewalls. The work analyses MA's function principles and derives a translation into Safe Petri nets. It extends to arbitrary MA processes but finiteness of the net and therefore decidability of reachability is only guaranteed for bounded processes. The construction is polynomial in process size and bounds so that reachability analysis is only PSPACE-complete.

The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017.The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP.

This book constitutes the refereed proceedings of the Second Russian Supercomputing Days, RuSCDays 2016, held in Moscow, Russia, in September 2016. The 28 revised full papers presented were carefully reviewed and selected from 94 submissions. The papers are organized in topical sections on the present of supercomputing: large tasks solving experience; the future of supercomputing: new technologies.

This book constitutes revised selected papers from the workshopscollocated with the SEFM 2015 conference on Software Engineering andFormal Methods, held in York, UK, in September 2015.The 25 papers included in this volume were carefully reviewed and selected from 32 submissions. The satellite workshops provided a highly interactive and collaborative environment for researchers and practitioners from industry and academia to discuss emerging areas of software engineering and formal methods.The four workshops were: ATSE 2015: The 6th Workshop on Automating Test Case Design, Selection and Evaluation; HOFM 2015: The 2nd Human-Oriented Formal Methods Workshop; MoKMaSD 2015: The 4th International Symposium on Modelling and Knowledge Management Applications: Systems and Domains; VERY*SCART 2015: The 1st International Workshop on the Art of Service Composition and Formal Verification for Self-* Systems.

This concise and accessible textbook will enable readers to quickly develop the working skills necessary to solve computational problems in a server-based environment, using HTML and PHP. The importance of learning by example (as opposed to simply learning by copying) is emphasized through extensive use of hands-on exercises and examples, with a specific focus on useful science and engineering applications. The clearly-written text is designed to be simple to follow for the novice student, without requiring any background in programming or mathematics beyond algebra. Topics and features: describes the creation of HTML pages and the characteristics of HTML documents, showing how to use HTML tables, forms, lists, and frames to organize documents for use with PHP applications; explains how to set up a PHP environment, using a local or remote server; introduces the capabilities and syntax of the PHP language, including coverage of array syntax and use; examines user-defined functions in programming, summarizing PHP functions for reading and writing files, viewing the content of variables, and manipulating strings; reviews the PHP GD graphics library, presenting applications for creating pie charts, bar graphs, and line graphs suitable for displaying scientific data; includes appendices listing HTML and ASCII special characters, and highlighting the essential basic strategies for solving computational problems. Supplying all of the tools necessary to begin coding in HTML and PHP, this invaluable textbook is ideal for undergraduate students taking introductory courses in programming. The book will also serve as a helpful self-study text for professionals in any technical field.

This book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016. The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research.

This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternative to lattice. The authors analyze some of the shortcomings of conventional lattice structure and propose a novel algebraic structure in the form of Hyper-lattice to overcome problems with lattice. They establish how Hyper-lattice supports dynamic insertion of elements in a partial order set with a partial hierarchy between the set members. The authors present the characteristics and the different properties, showing how propositions and lemmas formalize Hyper-lattice as a new algebraic structure.

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic control problems and Markov decision processes. The algorithms developed represent a valuable contribution to the important field of computational network theory.

The LNCS journal Transactions on Large-Scale Data- and Knowledge-Centered Systems focuses on data management, knowledge discovery, and knowledge processing, which are core and hot topics in computer science. Since the 1990s, the Internet has become the main driving force behind application development in all domains. An increase in the demand for resource sharing across different sites connected through networks has led to an evolution of data- and knowledge-management systems from centralized systems to decentralized systems enabling large-scale distributed applications providing high scalability. Current decentralized systems still focus on data and knowledge as their main resource. Feasibility of these systems relies basically on P2P (peer-to-peer) techniques and the support of agent systems with scaling and decentralized control. Synergy between grids, P2P systems, and agent technologies is the key to data- and knowledge-centered systems in large-scale environments. This, the 29th issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, contains four revised selected regular papers. Topics covered include optimization and cluster validation processes for entity matching, business intelligence systems, and data profiling in the Semantic Web.

New generations of IT users are increasingly abstracted from the underlying devices and platforms that provide and safeguard their services. As a result they may have little awareness that they are critically dependent on the embedded security devices that are becoming pervasive in daily modern life. Secure Smart Embedded Devices, Platforms and Applications provides a broad overview of the many security and practical issues of embedded devices, tokens, and their operation systems, platforms and main applications. It also addresses a diverse range of industry/government initiatives and considerations, while focusing strongly on technical and practical security issues. The benefits and pitfalls of developing and deploying applications that rely on embedded systems and their security functionality are presented. A sufficient level of technical detail to support embedded systems is provided throughout the text, although the book is quite readable for those seeking awareness through an initial overview of the topics. This edited volume benefits from the contributions of industry and academic experts and helps provide a cross-discipline overview of the security and practical issues for embedded systems, tokens, and platforms. It is an ideal complement to the earlier work, Smart Cards Tokens, Security and Applications from the same editors.

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 work adds a new perspective to the stream of organizational IT security risk management literature, one that sheds light on the importance of IT security risk perceptions. Based on a large-scale empirical study of Cloud providers located in North America, the study reveals that in many cases, the providers' decision makers significantly underestimate their services' IT security risk exposure, which inhibits the implementation of necessary safeguarding measures. The work also demonstrates that even though the prevalence of IT security risk concerns in Cloud adoption is widely recognized, providers only pay very limited attention to the concerns expressed by customers, which not only causes serious disagreements with the customers but also considerably inhibits the adoption of the services.

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

The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.

This book discusses in detail the basic algorithms of video compression that are widely used in modern video codec. The authors dissect complicated specifications and present material in a way that gets readers quickly up to speed by describing video compression algorithms succinctly, without going to the mathematical details and technical specifications. For accelerated learning, hybrid codec structure, inter- and intra- prediction techniques in MPEG-4, H.264/AVC, and HEVC are discussed together. In addition, the latest research in the fast encoder design for the HEVC and H.264/AVC is also included.

This book constitutes the refereed proceedings of the 12th China Workshop on Machine Translation, CWMT 2016, held in Urumqi, China, in August 2016. The 10 English papers presented in this volume were carefully reviewed and selected from 76 submissions. They deal with statistical machine translation, hybrid machine translation, machine translation evaluation, post editing, alignment, and inducing bilingual knowledge from corpora.