The vast circulations of mobile devices, sensors and data mean that the social world is now defined by a complex interweaving of human and machine agency. Key to this is the growing power of algorithms - the decision-making parts of code - in our software dense and data rich environments. Algorithms can shape how we are retreated, what we know, who we connect with and what we encounter, and they present us with some important questions about how society operates and how we understand it. This book offers a series of concepts, approaches and ideas for understanding the relations between algorithms and power. Each chapter provides a unique perspective on the integration of algorithms into the social world. As such, this book directly tackles some of the most important questions facing the social sciences today. This book was originally published as a special issue of Information, Communication & Society.

This book offers an introduction to the topic of data science based on the visual processing of data. It deals with ethical considerations in the digital transformation and presents a process framework for the evaluation of technologies. It also explains special features and findings on the failure of data science projects and presents recommendation systems in consideration of current developments. Machine learning functionality in business analytics tools is compared and the use of a process model for data science is shown.The integration of renewable energies using the example of photovoltaic systems, more efficient use of thermal energy, scientific literature evaluation, customer satisfaction in the automotive industry and a framework for the analysis of vehicle data serve as application examples for the concrete use of data science. The book offers important information that is just as relevant for practitioners as for students and teachers.

Solving complex optimization problems with parallel metaheuristics
Parallel Metaheuristics brings together an international group of experts in parallelism and metaheuristics to provide a much-needed synthesis of these two fields. Readers discover how metaheuristic techniques can provide useful and practical solutions for a wide range of problems and application domains, with an emphasis on the fields of telecommunications and bioinformatics. This volume fills a long-existing gap, allowing researchers and practitioners to develop efficient metaheuristic algorithms to find solutions.
The book is divided into three parts:
* Part One: Introduction to Metaheuristics and Parallelism, including an Introduction to Metaheuristic Techniques, Measuring the Performance of Parallel Metaheuristics, New Technologies in Parallelism, and a head-to-head discussion on Metaheuristics and Parallelism
* Part Two: Parallel Metaheuristic Models, including Parallel Genetic Algorithms, Parallel Genetic Programming, Parallel Evolution Strategies, Parallel Ant Colony Algorithms, Parallel Estimation of Distribution Algorithms, Parallel Scatter Search, Parallel Variable Neighborhood Search, Parallel Simulated Annealing, Parallel Tabu Search, Parallel GRASP, Parallel Hybrid Metaheuristics, Parallel Multi-Objective Optimization, and Parallel Heterogeneous Metaheuristics
* Part Three: Theory and Applications, including Theory of Parallel Genetic Algorithms, Parallel Metaheuristics Applications, Parallel Metaheuristics in Telecommunications, and a final chapter on Bioinformatics and Parallel Metaheuristics
Each self-contained chapter begins with clear overviews and introductions that bring the reader up to speed, describes basic techniques, and ends with a reference list for further study. Packed with numerous tables and figures to illustrate the complex theory and processes, this comprehensive volume also includes numerous practical real-world optimization problems and their solutions.
This is essential reading for students and researchers in computer science, mathematics, and engineering who deal with parallelism, metaheuristics, and optimization in general.

This two-volume book provides an insight into the 10th International Conference on Soft Computing for Problem Solving (SocProS 2020). This international conference is a joint technical collaboration of Soft Computing Research Society and Indian Institute of Technology Indore. The book presents the latest achievements and innovations in the interdisciplinary areas of soft computing. It brings together the researchers, engineers and practitioners to discuss thought-provoking developments and challenges, in order to select potential future directions. It covers original research papers in the areas including but not limited to algorithms (artificial immune system, artificial neural network, genetic algorithm, genetic programming and particle swarm optimization) and applications (control systems, data mining and clustering, finance, weather forecasting, game theory, business and forecasting applications). The book will be beneficial for young as well as experienced researchers dealing across complex and intricate real-world problems for which finding a solution by traditional methods is a difficult task.

Integer linear programming (ILP) is a versatile modeling and optimization technique that is increasingly used in non-traditional ways in biology, with the potential to transform biological computation. However, few biologists know about it. This how-to and why-do text introduces ILP through the lens of computational and systems biology. It uses in-depth examples from genomics, phylogenetics, RNA, protein folding, network analysis, cancer, ecology, co-evolution, DNA sequencing, sequence analysis, pedigree and sibling inference, haplotyping, and more, to establish the power of ILP. This book aims to teach the logic of modeling and solving problems with ILP, and to teach the practical 'work flow' involved in using ILP in biology. Written for a wide audience, with no biological or computational prerequisites, this book is appropriate for entry-level and advanced courses aimed at biological and computational students, and as a source for specialists. Numerous exercises and accompanying software (in Python and Perl) demonstrate the concepts.

This book presents the best-selected papers presented at the International Conference on Data Science, Computation and Security (IDSCS-2021), organized by the Department of Data Science, CHRIST (Deemed to be University), Pune Lavasa Campus, India, during April 16-17, 2021. The proceeding is targeting the current research works in the areas of data science, data security, data analytics, artificial intelligence, machine learning, computer vision, algorithms design, computer networking, data mining, big data, text mining, knowledge representation, soft computing, and cloud computing.

A computational perspective on partial order and lattice theory, focusing on algorithms and their applications This book provides a uniform treatment of the theory and applications of lattice theory. The applications covered include tracking dependency in distributed systems, combinatorics, detecting global predicates in distributed systems, set families, and integer partitions. The book presents algorithmic proofs of theorems whenever possible. These proofs are written in the calculational style advocated by Dijkstra, with arguments explicitly spelled out step by step. The author s intent is for readers to learn not only the proofs, but the heuristics that guide said proofs. Introduction to Lattice Theory with Computer Science Applications: * Examines; posets, Dilworth s theorem, merging algorithms, lattices, lattice completion, morphisms, modular and distributive lattices, slicing, interval orders, tractable posets, lattice enumeration algorithms, and dimension theory * Provides end of chapter exercises to help readers retain newfound knowledge on each subject * Includes supplementary material at www.ece.utexas.edu/~garg Introduction to Lattice Theory with Computer Science Applications is written for students of computer science, as well as practicing mathematicians.

Comprehensive Metaheuristics: Algorithms and Applications presents the foundational underpinnings of metaheuristics and a broad scope of algorithms and real-world applications across a variety of research fields. The book starts with fundamentals, mathematical prerequisites, and conceptual approaches to provide readers with a solid foundation. After presenting multi-objective optimization, constrained optimization, and problem formation for metaheuristics, world-renowned authors give readers in-depth understanding of the full spectrum of algorithms and techniques. Scientists, researchers, academicians, and practitioners who are interested in optimizing a process or procedure to achieve a goal will benefit from the case studies of real-world applications from different domains. The book takes a much-needed holistic approach, putting the most widely used metaheuristic algorithms together with an in-depth treatise on multi-disciplinary applications of metaheuristics. Each algorithm is thoroughly analyzed to observe its behavior, providing a detailed tutorial on how to solve problems using metaheuristics. New case studies and research problem statements are also discussed, which will help researchers in their application of the concepts.

This volume covers digital design techniques, exercises and applications. The book discusses digital design and implementation in the context of VLSI and embedded system design. It covers basic digital design techniques to high speed design techniques. The contents also cover performance improvement, optimization concepts and design case studies. It includes pedagogical features such as design examples and illustrations. This book will be a useful guide for hardware engineers, logic design engineers, professionals and hobbyists looking to learn and use the digital design to develop VLSI based algorithms, architectures and products.

As one of the most comprehensive machine learning texts around, this book does justice to the field's incredible richness, but without losing sight of the unifying principles. Peter Flach's clear, example-based approach begins by discussing how a spam filter works, which gives an immediate introduction to machine learning in action, with a minimum of technical fuss. Flach provides case studies of increasing complexity and variety with well-chosen examples and illustrations throughout. He covers a wide range of logical, geometric and statistical models and state-of-the-art topics such as matrix factorisation and ROC analysis. Particular attention is paid to the central role played by features. The use of established terminology is balanced with the introduction of new and useful concepts, and summaries of relevant background material are provided with pointers for revision if necessary. These features ensure Machine Learning will set a new standard as an introductory textbook.

This book features research papers presented at the International Conference on Emerging Technologies in Data Mining and Information Security (IEMIS 2020) held at the University of Engineering & Management, Kolkata, India, during July 2020. The book is organized in three volumes and includes high-quality research work by academicians and industrial experts in the field of computing and communication, including full-length papers, research-in-progress papers and case studies related to all the areas of data mining, machine learning, Internet of things (IoT) and information security.

This is the newly-revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.

Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life. This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties. The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios.

Over the course of a generation, algorithms have gone from mathematical abstractions to powerful mediators of daily life. In evolving from static computer programs hand-coded by engineers to the products of machine learning, these technologies have made our lives more efficient, more entertaining, and, sometimes, better informed. At the same time, complex algorithms are increasingly crushing the basic rights of individual citizens. Allegedly anonymized datasets and statistical models routinely leak our most sensitive personal information; applications for everything from loans to college reflect racial and gender bias. Meanwhile, users manipulate algorithms to "game" search engines, spam filters, online reviewing services and navigation apps. Understanding and improving the science behind the algorithms that run our lives is quickly becoming one of the most pressing issues of this century. Traditional solutions, such as laws, regulations and watchdog groups, have proven woefully inadequate, at best. Derived from the cutting-edge of scientific research, The Ethical Algorithm offers a new approach: a set of principled solutions based on the emerging and exciting science of socially aware algorithm design. Weaving together the science behind algorithm design with stories of citizens, lawyers, scientists, and activists experiencing the trial-and-error of research in real-time, Michael Kearns and Aaron Roth present a strikingly original way forward, showing how we can begin to work together to protect people from the unintended impacts of algorithms-and, sometimes, protect the science that could save us from ourselves.

The book presents a succession of RISC-V processor implementations in increasing difficulty (non pipelined, pipelined, deeply pipelined, multithreaded, multicore). Each implementation is shown as an HLS (High Level Synthesis) code in C++ which can really be synthesized and tested on an FPGA based development board (such a board can be freely obtained from the Xilinx University Program targeting the university professors). The book can be useful for three reasons. First, it is a novel way to introduce computer architecture. The codes given can serve as labs for a processor architecture course. Second, the book content is based on the RISC-V Instruction Set Architecture, which is an open-source machine language promised to become the machine language to be taught, replacing DLX and MIPS. Third, all the designs are implemented through the High Level Synthesis, a tool which is able to translate a C program into an IP (Intellectual Property). Hence, the book can serve to engineers willing to implement processors on FPGA and to researchers willing to develop RISC-V based hardware simulators.

Algorithms were always an important part of many branches in the sciences. In many manuals and handbooks, algorithms of problems of computational mathematics are focused on the manual performance or by means of a calculator. In this book, descriptions of algorithms, their solutions and main characteristics are discussed. The present work is the outcome of many years of the authors' work on solving different problems and tasks from domains of instruction making, metrology, system analysis, ecology, data analysis from ecology, agriculture, medicine and creation of corresponding universal computer packages and systems.

This book features research presented and discussed during the Research & Innovation Forum (Rii Forum) 2020. As such, this book offers a unique insight into emerging topics, issues and developments pertinent to the fields of technology, innovation and education and their social impact. Papers included in this book apply inter- and multi-disciplinary approaches to query such issues as technology-enhanced teaching and learning, smart cities, information systems, cognitive computing and social networking. What brings these threads of the discussion together is the question of how advances in computer science - which are otherwise largely incomprehensible to researchers from other fields - can be effectively translated and capitalized on so as to make them beneficial for society as a whole. In this context, Rii Forum and Rii Forum proceedings offer an essential venue where diverse stakeholders, including academics, the think tank sector and decision-makers, can engage in a meaningful dialogue with a view to improving the applicability of advances in computer science.

The Handbook of Data Structures and Applications was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly as other areas of computer science, the book aims to update those areas that have seen advances. Retaining the seven-part structure of the first edition, the handbook begins with a review of introductory material, followed by a discussion of well-known classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. The editors next analyze miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination of the applications of data structures. Four new chapters have been added on Bloom Filters, Binary Decision Diagrams, Data Structures for Cheminformatics, and Data Structures for Big Data Stores, and updates have been made to other chapters that appeared in the first edition. The Handbook is invaluable for suggesting new ideas for research in data structures, and for revealing application contexts in which they can be deployed. Practitioners devising algorithms will gain insight into organizing data, allowing them to solve algorithmic problems more efficiently.

This book features research papers presented at the International Conference on Emerging Technologies in Data Mining and Information Security (IEMIS 2020) held at the University of Engineering & Management, Kolkata, India, during July 2020. The book is organized in three volumes and includes high-quality research work by academicians and industrial experts in the field of computing and communication, including full-length papers, research-in-progress papers, and case studies related to all the areas of data mining, machine learning, Internet of things (IoT), and information security.

A ONE-STOP, DEFINITIVE GUIDE TO DATA MODELING FOR IT PROFESSIONALS

Data Modeling Fundamentals is a comprehensive guide to the foundation and principles behind data modeling and its essential role in successful database design. The only book specifically addressing the essentials of data modeling for IT professionals, it includes:

An overview of data modeling concepts, techniques, and symbols

Anatomy of a comprehensive data model describing the various components

Extensive details of entities, attributes, identifiers, and relationships

Transition from data modeling to database design and implementation, datanormalization, and modeling for decision-support systems

Quality data modeling and agile data modeling in practice

Trends in data modeling methodologies and techniques

Chapter summaries with review questions and exercises at the conclusion of each chapter help readers gauge their understanding of the material presented. Complete with real-world examples, references, and an abundance of practical tips and suggestions, Data Modeling Fundamentals is an indispensable resource for both novice and experienced data modelers.

This book presents various computational and cognitive modeling approaches in the areas of health, education, finance, theenvironment, engineering, commerce and industry. Gathering selected conference papers presented atthe International Conference on Trends in Computational and Cognitive Engineering (TCCE), it sharescutting-edge insights and ideas from mathematicians, engineers, scientists and researchers anddiscusses fresh perspectives on problem solving in a range of research areas.

The two-volume set LNCS 12415 and 12416 constitutes the refereed proceedings of of the 19th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2020, held in Zakopane, Poland*, in October 2020. The 112 revised full papers presented were carefully reviewed and selected from 265 submissions. The papers included in the first volume are organized in the following six parts: neural networks and their applications; fuzzy systems and their applications; evolutionary algorithms and their applications; pattern classification; bioinformatics, biometrics and medical applications; artificial intelligence in modeling and simulation. The papers included in the second volume are organized in the following four parts: computer vision, image and speech analysis; data mining; various problems of artificial intelligence; agent systems, robotics and control. *The conference was held virtually due to the COVID-19 pandemic.

The gap between theoretical ideas and messy reality, as seen in Neal Stephenson, Adam Smith, and Star Trek. We depend on-we believe in-algorithms to help us get a ride, choose which book to buy, execute a mathematical proof. It's as if we think of code as a magic spell, an incantation to reveal what we need to know and even what we want. Humans have always believed that certain invocations-the marriage vow, the shaman's curse-do not merely describe the world but make it. Computation casts a cultural shadow that is shaped by this long tradition of magical thinking. In this book, Ed Finn considers how the algorithm-in practical terms, "a method for solving a problem"-has its roots not only in mathematical logic but also in cybernetics, philosophy, and magical thinking. Finn argues that the algorithm deploys concepts from the idealized space of computation in a messy reality, with unpredictable and sometimes fascinating results. Drawing on sources that range from Neal Stephenson's Snow Crash to Diderot's Encyclopedie, from Adam Smith to the Star Trek computer, Finn explores the gap between theoretical ideas and pragmatic instructions. He examines the development of intelligent assistants like Siri, the rise of algorithmic aesthetics at Netflix, Ian Bogost's satiric Facebook game Cow Clicker, and the revolutionary economics of Bitcoin. He describes Google's goal of anticipating our questions, Uber's cartoon maps and black box accounting, and what Facebook tells us about programmable value, among other things. If we want to understand the gap between abstraction and messy reality, Finn argues, we need to build a model of "algorithmic reading" and scholarship that attends to process, spearheading a new experimental humanities.

A remarkable look at how the growth, technology, and politics of high-frequency trading have altered global financial markets In today's financial markets, trading floors on which brokers buy and sell shares face-to-face have increasingly been replaced by lightning-fast electronic systems that use algorithms to execute astounding volumes of transactions. Trading at the Speed of Light tells the story of this epic transformation. Donald MacKenzie shows how in the 1990s, in what were then the disreputable margins of the US financial system, a new approach to trading-automated high-frequency trading or HFT-began and then spread throughout the world. HFT has brought new efficiency to global trading, but has also created an unrelenting race for speed, leading to a systematic, subterranean battle among HFT algorithms. In HFT, time is measured in nanoseconds (billionths of a second), and in a nanosecond the fastest possible signal-light in a vacuum-can travel only thirty centimeters, or roughly a foot. That makes HFT exquisitely sensitive to the length and transmission capacity of the cables connecting computer servers to the exchanges' systems and to the location of the microwave towers that carry signals between computer datacenters. Drawing from more than 300 interviews with high-frequency traders, the people who supply them with technological and communication capabilities, exchange staff, regulators, and many others, MacKenzie reveals the extraordinary efforts expended to speed up every aspect of trading. He looks at how in some markets big banks have fought off the challenge from HFT firms, and how exchanges sometimes engineer technical systems to favor certain types of algorithms over others. Focusing on the material, political, and economic characteristics of high-frequency trading, Trading at the Speed of Light offers a unique glimpse into its influence on global finance and where it could lead us in the future.

Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Engineering, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective. This book offers theoretical analysis techniques as well as algorithmic design patterns and experimental methods for the engineering of algorithms.
Market: Computer Scientists; Programmers.