This book presents a holistic view on compiler assisted practical secure multi-party computation (MPC) over Boolean circuits. It discusses that two or more parties jointly evaluate a function over their inputs in such a way that each party keeps its input unknown to the other parties in MPC. MPC provides a generic way to construct Privacy-Enhancing Technologies, which protect sensitive data during processing steps in untrusted environments. A major obstacle in the past was to generate MPC applications by hand. Recently, special compilers have been developed to build all kinds of applications. This book also explains in detail how efficient MPC applications can be created automatically from ANSI-C, thus, bridging the areas of cryptography, compilation and hardware synthesis. It also gives an insight into the requirements for creating efficient applications for MPC and is hence of interest to not only researchers in the area of MPC but also developers realizing practical applications with MPC. For a better understanding of the complete compile chain from ANSI-C to circuits, which is the 'machine code' of MPC, the authors first give the necessary background information on MPC protocols, Boolean logic, and logic synthesis. Then the authors describe the various compilation steps required to translate any code into an adequate circuit description. Afterwards, the authors introduce a variety of optimization techniques for two classes of MPC protocols, namely techniques that improve the runtime of applications in constant- and multi-round MPC protocols. The authors also illustrate how efficient parallelization of MPC protocols can be achieved using the assistance of compilers. It presents the effectiveness of the proposed techniques by giving a detailed evaluation on benchmarking applications. Most of the aforementioned techniques are implemented in our open source compiler that is accompanying this book and allows to study compilation for MPC in practice.Researchers who are interested in practical secure multi-party computation (MPC), and developers who are interested in realizing MPC applications in practice will find this book useful as a reference, as well as advanced-level students in computer science.

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 constitutes the post-conference proceedings of the 11th International Conference on Critical Information Infrastructures Security, CRITIS 2016, held in Paris, France, in October 2016. The 22 full papers and 8 short papers presented were carefully reviewed and selected from 58 submissions. They present the most recent innovations, trends, results, experiences and concerns in selected perspectives of critical information infrastructure protection covering the range from small-scale cyber-physical systems security via information infrastructures and their interaction with national and international infrastructures.

This book constitutes the refereed proceedings of the 6th International Conference,on Theory and Practice of Natural Computing, TPNC 2017, held in Prague, Czech Republic, December 2017. The 22 full papers presented in this book, together with one invited talk, werecarefully reviewed and selected from 39 submissions. The papers are organized around the following topical sections: applications of natural computing; evolutionary computation; fuzzy logic; Molecular computation; neural networks; quantum computing.

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.

Get an introduction to functional data structures using R and write more effective code and gain performance for your programs. This book teaches you workarounds because data in functional languages is not mutable: for example you'll learn how to change variable-value bindings by modifying environments, which can be exploited to emulate pointers and implement traditional data structures. You'll also see how, by abandoning traditional data structures, you can manipulate structures by building new versions rather than modifying them. You'll discover how these so-called functional data structures are different from the traditional data structures you might know, but are worth understanding to do serious algorithmic programming in a functional language such as R. By the end of Functional Data Structures in R, you'll understand the choices to make in order to most effectively work with data structures when you cannot modify the data itself. These techniques are especially applicable for algorithmic development important in big data, finance, and other data science applications. What You'll Learn Carry out algorithmic programming in R Use abstract data structures Work with both immutable and persistent data Emulate pointers and implement traditional data structures in R Build new versions of traditional data structures that are known Who This Book Is For Experienced or advanced programmers with at least a comfort level with R. Some experience with data structures recommended.

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.

This monograph gives a thorough treatment of the celebrated compositions of signature and encryption that allow for verifiability, that is, to efficiently prove properties about the encrypted data. This study is provided in the context of two cryptographic primitives: (1) designated confirmer signatures, an opaque signature which was introduced to control the proliferation of certified copies of documents, and (2) signcryption, a primitive that offers privacy and authenticity at once in an efficient way. This book is a useful resource to researchers in cryptology and information security, graduate and PhD students, and security professionals.

The book presents laboratory experiments concerning ARM microcontrollers, and discusses the architecture of the Tiva Cortex-M4 ARM microcontrollers from Texas Instruments, describing various ways of programming them. Given the meager peripherals and sensors available on the kit, the authors describe the design of Padma - a circuit board with a large set of peripherals and sensors that connects to the Tiva Launchpad and exploits the Tiva microcontroller family's on-chip features. ARM microcontrollers, which are classified as 32-bit devices, are currently the most popular of all microcontrollers. They cover a wide range of applications that extend from traditional 8-bit devices to 32-bit devices. Of the various ARM subfamilies, Cortex-M4 is a middle-level microcontroller that lends itself well to data acquisition and control as well as digital signal manipulation applications. Given the prominence of ARM microcontrollers, it is important that they should be incorporated in academic curriculums. However, there is a lack of up-to-date teaching material - textbooks and comprehensive laboratory manuals. In this book each of the microcontroller's resources - digital input and output, timers and counters, serial communication channels, analog-to-digital conversion, interrupt structure and power management features - are addressed in a set of more than 70 experiments to help teach a full semester course on these microcontrollers. Beyond these physical interfacing exercises, it describes an inexpensive BoB (break out board) that allows students to learn how to design and build standalone projects, as well a number of illustrative projects.

This book contains a selection of papers presented during a special workshop on Complexity Science organized as part of the 9th International Conference on GIScience 2016. Expert researchers in the areas of Agent-Based Modeling, Complexity Theory, Network Theory, Big Data, and emerging methods of Analysis and Visualization for new types of data explore novel complexity science approaches to dynamic geographic phenomena and their applications, addressing challenges and enriching research methodologies in geography in a Big Data Era.

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 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 book provides a comprehensive introduction and a novel mathematical foundation of the field of information geometry with complete proofs and detailed background material on measure theory, Riemannian geometry and Banach space theory. Parametrised measure models are defined as fundamental geometric objects, which can be both finite or infinite dimensional. Based on these models, canonical tensor fields are introduced and further studied, including the Fisher metric and the Amari-Chentsov tensor, and embeddings of statistical manifolds are investigated. This novel foundation then leads to application highlights, such as generalizations and extensions of the classical uniqueness result of Chentsov or the Cramer-Rao inequality. Additionally, several new application fields of information geometry are highlighted, for instance hierarchical and graphical models, complexity theory, population genetics, or Markov Chain Monte Carlo. The book will be of interest to mathematicians who are interested in geometry, information theory, or the foundations of statistics, to statisticians as well as to scientists interested in the mathematical foundations of complex systems.

This book investigates the coordinated power management of multi-tenant data centers that account for a large portion of the data center industry. The authors include discussion of their quick growth and their electricity consumption, which has huge economic and environmental impacts. This book covers the various coordinated management solutions in the existing literature focusing on efficiency, sustainability, and demand response aspects. First, the authors provide a background on the multi-tenant data center covering the stake holders, components, power infrastructure, and energy usage. Then, each power management mechanism is described in terms of motivation, problem formulation, challenges and solution.

The 14 contributed chapters in this book survey the most recent developments in high-performance algorithms for NGS data, offering fundamental insights and technical information specifically on indexing, compression and storage; error correction; alignment; and assembly. The book will be of value to researchers, practitioners and students engaged with bioinformatics, computer science, mathematics, statistics and life 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.

This book describes new algorithms and ideas for making effective decisions under constraints, including applications in control engineering, manufacturing (how to optimally determine the production level), econometrics (how to better predict stock market behavior), and environmental science and geosciences (how to combine data of different types). It also describes general algorithms and ideas that can be used in other application areas. The book presents extended versions of selected papers from the annual International Workshops on Constraint Programming and Decision Making (CoProd'XX) from 2013 to 2016. These workshops, held in the US (El Paso, Texas) and in Europe (Wurzburg, Germany, and Uppsala, Sweden), have attracted researchers and practitioners from all over the world. It is of interest to practitioners who benefit from the new techniques, to researchers who want to extend the ideas from these papers to new application areas and/or further improve the corresponding algorithms, and to graduate students who want to learn more - in short, to anyone who wants to make more effective decisions under constraints.

Gain a deeper understanding of how Raspberry Pi works to get the results you want right in the palm of your hand. This book helps you understand the right connections and software to drive your Raspberry Pi into opening the worlds of programming, electronic experiments, system control, digital imaging, and the Internet of Things to you. You'll discover how to expand your Pi's storage for bigger programs, use its onboard connections to interface with cameras and control devices, printers and scanners. You'll also see how to share information with Windows and Apple computers and mobile devices, and use it away from AC power. You'll be able to turn any HDTV into a media player; stream and share files from desktop and mobile devices; use your Pi for image capture via camera or scanner; and more! Expanding Your Raspberry Pi is your guide to doing almost anything a bigger computer can do - if you're ready for the challenge. What You'll Learn Connect, use, and manage mass storage devices for greater versatility Link with desktop, laptop, and mobile devices using the Pi's built-in Wi-Fi and Bluetooth features Share resources from your Pi with desktop and mobile devices Capture video and still photos with your Pi Who This Book Is ForNetwork administrators: Connect Raspberry Pi devices to other devices on a wired or wireless network for media streaming, file serving, or print serving Teachers: Use Raspberry Pi to teach students how to connect different types of computers and operating systems with each other. IT workers: Use Raspberry Pi with your existing printers, scanners, webcams, and home network

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.

Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities - the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon. The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs. Contents Oriented Matroids, the Pattern Recognition Problem, and Tope Committees Boolean Intervals Dehn-Sommerville Type Relations Farey Subsequences Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets Committees of Set Families, and Relative Blocking Constructions in Posets Layers of Tope Committees Three-Tope Committees Halfspaces, Convex Sets, and Tope Committees Tope Committees and Reorientations of Oriented Matroids Topes and Critical Committees Critical Committees and Distance Signals Symmetric Cycles in the Hypercube Graphs

The book presents various state-of-the-art approaches for process synchronization in a distributed environment. The range of algorithms discussed in the book starts from token based mutual exclusion algorithms that work on tree based topology. Then there are interesting solutions for more flexible logical topology like a directed graph, with or without cycle. In a completely different approach, one of the chapters presents two recent voting-based DME algorithms. All DME algorithms presented in the book aim to ensure fairness in terms of first come first serve (FCFS) order among equal priority processes. At the same time, the solutions consider the priority of the requesting processes and allocate resource for the earliest request when no such request from a higher priority process is pending.

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.

Data management systems enable various influential applications from high-performance online services (e.g., social networks like Twitter and Facebook or financial markets) to big data analytics (e.g., scientific exploration, sensor networks, business intelligence). As a result, data management systems have been one of the main drivers for innovations in the database and computer architecture communities for several decades. Recent hardware trends require software to take advantage of the abundant parallelism existing in modern and future hardware. The traditional design of the data management systems, however, faces inherent scalability problems due to its tightly coupled components. In addition, it cannot exploit the full capability of the aggressive micro-architectural features of modern processors. As a result, today's most commonly used server types remain largely underutilized leading to a huge waste of hardware resources and energy. In this book, we shed light on the challenges present while running DBMS on modern multicore hardware. We divide the material into two dimensions of scalability: implicit/vertical and explicit/horizontal. The first part of the book focuses on the vertical dimension: it describes the instruction- and data-level parallelism opportunities in a core coming from the hardware and software side. In addition, it examines the sources of under-utilization in a modern processor and presents insights and hardware/software techniques to better exploit the microarchitectural resources of a processor by improving cache locality at the right level of the memory hierarchy. The second part focuses on the horizontal dimension, i.e., scalability bottlenecks of database applications at the level of multicore and multisocket multicore architectures. It first presents a systematic way of eliminating such bottlenecks in online transaction processing workloads, which is based on minimizing unbounded communication, and shows several techniques that minimize bottlenecks in major components of database management systems. Then, it demonstrates the data and work sharing opportunities for analytical workloads, and reviews advanced scheduling mechanisms that are aware of nonuniform memory accesses and alleviate bandwidth saturation.

This book presents the mathematical background underlying security modeling in the context of next-generation cryptography. By introducing new mathematical results in order to strengthen information security, while simultaneously presenting fresh insights and developing the respective areas of mathematics, it is the first-ever book to focus on areas that have not yet been fully exploited for cryptographic applications such as representation theory and mathematical physics, among others. Recent advances in cryptanalysis, brought about in particular by quantum computation and physical attacks on cryptographic devices, such as side-channel analysis or power analysis, have revealed the growing security risks for state-of-the-art cryptographic schemes. To address these risks, high-performance, next-generation cryptosystems must be studied, which requires the further development of the mathematical background of modern cryptography. More specifically, in order to avoid the security risks posed by adversaries with advanced attack capabilities, cryptosystems must be upgraded, which in turn relies on a wide range of mathematical theories. This book is suitable for use in an advanced graduate course in mathematical cryptography, while also offering a valuable reference guide for experts.