This book provides an extensive review of three interrelated issues: land fragmentation, land consolidation, and land reallocation, and it presents in detail the theoretical background, design, development and application of a prototype integrated planning and decision support system for land consolidation. The system integrates geographic information systems (GIS) and artificial intelligence techniques including expert systems (ES) and genetic algorithms (GAs) with multi-criteria decision methods (MCDM), both multi-attribute (MADM) and multi-objective (MODM). The system is based on four modules for measuring land fragmentation; automatically generating alternative land redistribution plans; evaluating those plans; and automatically designing the land partitioning plan. The presented research provides a new scientific framework for land-consolidation planning both in terms of theory and practice, by presenting new findings and by developing better tools and methods embedded in an integrated GIS environment. It also makes a valuable contribution to the fields of GIS and spatial planning, as it provides new methods and ideas that could be applied to improve the former for the benefit of the latter in the context of planning support systems. "From the 1960s, ambitious research activities set out to observe regarding IT-support of the complex and time consuming redistribution processes within land consolidation - without any practically relevant results, until now. This scientific work is likely to close that gap. This distinguished publication is highly recommended to land consolidation planning experts, researchers and academics alike." - Prof. Dr.-Ing. Joachim Thomas, Munster/ Germany "Planning support systems take new scientific tools based on GIS, optimisation and simulation and use these to inform the process of plan-making and policy. This book is one of the first to show how this can be consistently done and it is a triumph of demonstrating how such systems can be made operational. Essential reading for planners, analysts and GI scientists." - Prof. Michael Batty, University College London

This book provides the most updated information of how membrane lipids mediate protein signaling from studies carried out in animal and plant cells. Also, there are some chapters that go beyond and expand these studies of protein-lipid interactions at the structural level. The book begins with a literature review from investigations associated to sphingolipids, followed by studies that describe the role of phosphoinositides in signaling and closing with the function of other key lipids in signaling at the plasma membrane and intracellular organelles.

The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Foundations of Mathematics and Computational Complexity covers a broad spectrum of results in logic and set theory that are relevant to the foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as important for foundations as are the more traditional concepts of computability and provability. Emphasis is on explaining the essence of concepts and the ideas of proofs, rather than presenting precise formal statements and full proofs. Each section starts with concepts and results easily explained, and gradually proceeds to more difficult ones. The notes after each section present some formal definitions, theorems and proofs. Logical Foundations of Mathematics and Computational Complexity is aimed at graduate students of all fields of mathematics who are interested in logic, complexity and foundations. It will also be of interest for both physicists and philosophers who are curious to learn the basics of logic and complexity theory.

This book surveys key algorithm developments between 1990 and 2012, with brief descriptions, a unified pseudocode for each algorithm and downloadable program code. Provides a taxonomy to clarify similarities and differences as well as historical relationships.

This book constitutes the post-conference proceedings of the Third International Workshop on Machine Learning, Optimization, and Big Data, MOD 2017, held in Volterra, Italy, in September 2017. The 50 full papers presented were carefully reviewed and selected from 126 submissions. The papers cover topics in the field of machine learning, artificial intelligence, computational optimization and data science presenting a substantial array of ideas, technologies, algorithms, methods and applications.

This book provides a comprehensive overview on emergent bursty patterns in the dynamics of human behaviour. It presents common and alternative understanding of the investigated phenomena, and points out open questions worthy of further investigations. The book is structured as follows. In the introduction the authors discuss the motivation of the field, describe bursty phenomena in case of human behaviour, and relate it to other disciplines. The second chapter addresses the measures commonly used to characterise heterogeneous signals, bursty human dynamics, temporal paths, and correlated behaviour. These definitions are first introduced to set the basis for the discussion of the third chapter about the observations of bursty human patterns in the dynamics of individuals, dyadic interactions, and collective behaviour. The subsequent fourth chapter discusses the models of bursty human dynamics. Various mechanisms have been proposed about the source of the heterogeneities in human dynamics, which leads to the introduction of conceptually different modelling approaches. The authors address all of these perspectives objectively, highlight their strengths and shortcomings, and mention possible extensions to them. The fifth chapter addresses the effect of individual heterogeneous behaviour on collective dynamics. This question in particular has been investigated in various systems including spreading phenomena, random walks, and opinion formation dynamics. Here the main issues are whether burstiness speeds up or slows down the co-evolving processes, and how burstiness modifies time-dependent paths in the system that determine the spreading patterns of any kind of information or influence. Finally in the sixth chapter the authors end the review with a discussion and future perspectives. It is an ideal book for researchers and students who wish to enter the field of bursty human dynamics or want to expand their knowledge on such phenomena.

The three volume set provides a systematic overview of theories and technique on social network analysis. Volume 3 of the set mainly focuses on the propagation models and evolution rules of information. Information retrieval and dissemination, topic discovery and evolution, algorithms of influence maximization are discussed in detail. It is an essential reference for scientist and professionals in computer science.

This, the 27th issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, contains extended and revised versions of 12 papers presented at the Big Data and Technology for Complex Urban Systems symposium, held in Kauai, HI, USA in January 2016. The papers explore the use of big data in complex urban systems in the areas of politics, society, commerce, tax, and emergency management.

This book constitutes the proceedings of the 16th IMA International Conference on Cryptography and Coding, IMACC 2017, held at Oxford, UK, in December 2017. The 19 papers presented were carefully reviewed and selected from 32 submissions. The conference focuses on a diverse set of topics both in cryptography and coding theory.

This book offers an introduction to cryptology, the science that makes secure communications possible, and addresses its two complementary aspects: cryptography---the art of making secure building blocks---and cryptanalysis---the art of breaking them. The text describes some of the most important systems in detail, including AES, RSA, group-based and lattice-based cryptography, signatures, hash functions, random generation, and more, providing detailed underpinnings for most of them. With regard to cryptanalysis, it presents a number of basic tools such as the differential and linear methods and lattice attacks. This text, based on lecture notes from the author's many courses on the art of cryptography, consists of two interlinked parts. The first, modern part explains some of the basic systems used today and some attacks on them. However, a text on cryptology would not be complete without describing its rich and fascinating history. As such, the colorfully illustrated historical part interspersed throughout the text highlights selected inventions and episodes, providing a glimpse into the past of cryptology. The first sections of this book can be used as a textbook for an introductory course to computer science or mathematics students. Other sections are suitable for advanced undergraduate or graduate courses. Many exercises are included. The emphasis is on providing reasonably complete explanation of the background for some selected systems.

The two-volume set LNCS 10627 and 10628 constitutes the refereed proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017. The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications.

This book constitutes the proceedings of the 12th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2017, held in Harbin, China, December 2017. The 50 full papers presented were selected from 143 submissions. The papers deal with studies abstracting computing ideas such as data structures, operations with data, ways to control operations, computing models from living phenomena or biological systems such as evolution, cells, tissues, neural networks, immune systems, and ant colonies.

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 volume, the 32nd issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, focuses on Big Data Analytics and Knowledge Discovery, and contains extended and revised versions of five papers selected from the 17th International Conference on Big Data Analytics and Knowledge Discovery, DaWaK 2015, held in Valencia, Spain, during September 1-4, 2015. The five papers focus on the exact detection of information leakage, the binary shapelet transform for multiclass time series classification, a discrimination-aware association rule classifier for decision support (DAAR), new word detection and tagging on Chinese Twitter, and on-demand snapshot maintenance in data warehouses using incremental ETL pipelines, respectively. discovery,="" contains="" extended="" revised="" versions="" five="" papers="" selected="" from="" 17th="" international="" conference="" discovery="" (dawak="" 2015),="" held="" in="" valencia,="" spain,="" during="" september="" 1-4,="" 2015.="" focus="" exact="" detection="" information="" leakage,="" binary="" shapelet="" transform="" for="" multiclass="" time="" series="" classification,="" a="" discrimination-aware="" association="" rule="" classifier="" decision="" support="" (daar),="" new="" word="" tagging="" chinese="" twitter,="" on-demand="" snapshot="" maintenance="" warehouses="" using="" incremental="" etl="" pipelines,="" respectively.

This book constitutes the refereed proceedings of the 11th International Conference on Parallel Computational Technologies, PCT 2017, held in Kazan, Russia, in April 2017. The 24 revised full papers presented were carefully reviewed and selected from 167 submissions. The papers are organized in topical sections on high performance architectures, tools and technologies; parallel numerical algorithms; supercomputer simulation.

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.

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.