Takes an interdisciplinary approach to contribute to the ongoing development of human-AI interaction. Current debate and development of AI is "algorithm-driven" or technical-oriented in lieu of human-centered. At present, there is no systematic interdisciplinary discussion to effectively deal with issues and challenges arising from AI. This book offers critical analysis of the logic and social implications of algorithmic processes. Reporting from the processes of scientific research, the results can be useful for understanding the relationship between algorithms and humans, allowing AI designers to assess the quality of the meaningful interactions with AI systems.

This textbook integrates important mathematical foundations, efficient computational algorithms, applied statistical inference techniques, and cutting-edge machine learning approaches to address a wide range of crucial biomedical informatics, health analytics applications, and decision science challenges. Each concept in the book includes a rigorous symbolic formulation coupled with computational algorithms and complete end-to-end pipeline protocols implemented as functional R electronic markdown notebooks. These workflows support active learning and demonstrate comprehensive data manipulations, interactive visualizations, and sophisticated analytics. The content includes open problems, state-of-the-art scientific knowledge, ethical integration of heterogeneous scientific tools, and procedures for systematic validation and dissemination of reproducible research findings.Complementary to the enormous challenges related to handling, interrogating, and understanding massive amounts of complex structured and unstructured data, there are unique opportunities that come with access to a wealth of feature-rich, high-dimensional, and time-varying information. The topics covered in Data Science and Predictive Analytics address specific knowledge gaps, resolve educational barriers, and mitigate workforce information-readiness and data science deficiencies. Specifically, it provides a transdisciplinary curriculum integrating core mathematical principles, modern computational methods, advanced data science techniques, model-based machine learning, model-free artificial intelligence, and innovative biomedical applications. The book's fourteen chapters start with an introduction and progressively build foundational skills from visualization to linear modeling, dimensionality reduction, supervised classification, black-box machine learning techniques, qualitative learning methods, unsupervised clustering, model performance assessment, feature selection strategies, longitudinal data analytics, optimization, neural networks, and deep learning. The second edition of the book includes additional learning-based strategies utilizing generative adversarial networks, transfer learning, and synthetic data generation, as well as eight complementary electronic appendices. This textbook is suitable for formal didactic instructor-guided course education, as well as for individual or team-supported self-learning. The material is presented at the upper-division and graduate-level college courses and covers applied and interdisciplinary mathematics, contemporary learning-based data science techniques, computational algorithm development, optimization theory, statistical computing, and biomedical sciences. The analytical techniques and predictive scientific methods described in the book may be useful to a wide range of readers, formal and informal learners, college instructors, researchers, and engineers throughout the academy, industry, government, regulatory, funding, and policy agencies. The supporting book website provides many examples, datasets, functional scripts, complete electronic notebooks, extensive appendices, and additional materials.

This book offers advanced parallel and distributed algorithms and experimental laboratory prototypes of unconventional shortest path solvers. In addition, it presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines. The shortest path problem is a fundamental and classical problem in graph theory and computer science and is frequently applied in the contexts of transport and logistics, telecommunication networks, virtual reality and gaming, geometry, and social networks analysis. Software implementations include distance-vector algorithms for distributed path computation in dynamics networks, parallel solutions of the constrained shortest path problem, and application of the shortest path solutions in gathering robotic swarms. Massively parallel algorithms utilise cellular automata, where a shortest path is computed either via matrix multiplication in automaton arrays, or via the representation of data graphs in automaton lattices and using the propagation of wave-like patterns. Unconventional shortest path solvers are presented in computer models of foraging behaviour and protoplasmic network optimisation by the slime mould Physarum polycephalum and fluidic devices, while experimental laboratory prototypes of path solvers using chemical media, flows and droplets, and electrical current are also highlighted. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computers scientists and engineers to chemists and biologists.

Techniques for Designing and Analyzing Algorithms Design and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course. This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented. In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course. Features The first three chapters provide a mathematical review, basic algorithm analysis, and data structures Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included Proofs of correctness of algorithms are included when appropriate The book presents a suitable amount of mathematical rigor After reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers.

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.

Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.

Elucidating the spatial and temporal dynamics of how things connect has become one of the most important areas of research in the 21st century. Network science now pervades nearly every science domain, resulting in new discoveries in a host of dynamic social and natural systems, including: how neurons connect and communicate in the brain, how information percolates within and among social networks, the evolution of science research through co-authorship networks, the spread of epidemics and many other complex phenomena. Over the past decade, advances in computational power have put the tools of network analysis in the hands of increasing numbers of scientists, enabling more explorations of our world than ever before possible. Information science, social sciences, systems biology, ecosystems ecology, neuroscience and physics all benefit from this movement, which combines graph theory with data sciences to develop and validate theories about the world around us. This book brings together cutting-edge research from the network science field and includes diverse and interdisciplinary topics such as: modeling the structure of urban systems, behavior in social networks, education and learning, data network architecture, structure and dynamics of organizations, crime and terrorism, as well as network topology, modularity and community detection.

In the late 1960s British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells' states are updated simultaneously and in discrete time. A dead cell comes to life if it has exactly three live neighbours. A live cell remains alive if two or three of its neighbours are alive, otherwise the cell dies. Conway's Game of Life became the most programmed solitary game and the most known cellular automaton. The book brings together results of forty years of study into computational, mathematical, physical and engineering aspects of The Game of Life cellular automata. Selected topics include phenomenology and statistical behaviour; space-time dynamics on Penrose tilling and hyperbolic spaces; generation of music; algebraic properties; modelling of financial markets; semi-quantum extensions; predicting emergence; dual-graph based analysis; fuzzy, limit behaviour and threshold scaling; evolving cell-state transition rules; localization dynamics in quasi-chemical analogues of GoL; self-organisation towards criticality; asynochrous implementations. The volume is unique because it gives a comprehensive presentation of the theoretical and experimental foundations, cutting-edge computation techniques and mathematical analysis of the fabulously complex, self-organized and emergent phenomena defined by incredibly simple rules.

This book is the first systematic exposition on the emerging domain of wireless power transfer in ad hoc communication networks. It selectively spans a coherent, large spectrum of fundamental aspects of wireless power transfer, such as mobility management in the network, combined wireless power and information transfer, energy flow among network devices, joint activities with wireless power transfer (routing, data gathering and solar energy harvesting), and safety provisioning through electromagnetic radiation control, as well as fundamental and novel circuits and technologies enabling the wide application of wireless powering. Comprising a total of 27 chapters, contributed by leading experts, the content is organized into six thematic sections: technologies, communication, mobility, energy flow, joint operations, and electromagnetic radiation awareness. It will be valuable for researchers, engineers, educators, and students, and it may also be used as a supplement to academic courses on algorithmic applications, wireless protocols, distributed computing, and networking.

Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation.

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.This book serves also as a comprehensive presentation of the theory and application of mixed matrices, developed primarily by the present author in the last decade. A mixed matrix is a convenient mathematical tool for systems analysis, compatible with the physical observation that "fixed constants" and "system parameters" are to be distinguished in the description of engineering systems.This book will be extremely useful to graduate students and researchers in engineering, mathematics and computer science.

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material.

There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms.

This book follows the "semidefinite side" of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms."

Cryptographic Engineering is the first book that discusses the design techniques and methods. The material of this book is scattered in journal and conference articles, and authors lecture notes. This is a first attempt by top cryptographic engineers to bring this material in a book form and make it available to electrical engineering and computer science students and engineers working for the industry.

This book is intended for a graduate-level course in Cryptographic Engineering to be taught in Electrical Engineering, Computer Engineering, and Computer Science departments. Students will have to have the knowledge of basic cryptographic algorithms before taking this course which will teach them how to design cryptographic hardware (FPGA, ASIC, custom) and embedded software to be used in secure systems.

Additionally, engineers working in the industry will be interested in this book to learn how to design cryptographic chips and embedded software. Engineers working on the design of cellular phones, mobile computing and sensor systems, web and enterprise security systems which rely upon cryptographic hardware and software will be interested in this book. Essential and advanced design techniques for cryptography will be covered by this book."

This book provides a valuable combination of relevant research works on developing smart city ecosystem from the artificial intelligence (AI) and Internet of things (IoT) perspective. The technical research works presented here are focused on a number of aspects of smart cities: smart mobility, smart living, smart environment, smart citizens, smart government, and smart waste management systems as well as related technologies and concepts. This edited book offers critical insight to the key underlying research themes within smart cities, highlighting the limitations of current developments and potential future directions.

This book compares the performance of various evolutionary computation (EC) techniques when they are faced with complex optimization problems extracted from different engineering domains. Particularly focusing on recently developed algorithms, it is designed so that each chapter can be read independently. Several comparisons among EC techniques have been reported in the literature, however, they all suffer from one limitation: their conclusions are based on the performance of popular evolutionary approaches over a set of synthetic functions with exact solutions and well-known behaviors, without considering the application context or including recent developments. In each chapter, a complex engineering optimization problem is posed, and then a particular EC technique is presented as the best choice, according to its search characteristics. Lastly, a set of experiments is conducted in order to compare its performance to other popular EC methods.

The book presents a comprehensive treatment on a novel design theory that fosters innovative thinking and creativity essential for addressing wicked problems. Wicked problems are ill-defined, ambiguous in both aims and solutions, and complex with interconnected and intertwined (coupled) factors. While being ubiquitous and difficult, however, wicked problems share characteristics common to science and design in three regards, namely agent finitude, system complexity, and problem normativity. These fundamental attributes allow a core cognitive process common to design and science to be identified and a strategic problem-solving conception of methodology be formulated as a result. The theory facilitates new opportunities for synergetic cross-disciplinary research and practice by incorporating the essences of Extenics to axiomatic design. Innovative thinking is enabled by exploring Extenics for problem reframing, paradigm shift, and abductive reasoning and by engaging axiomatic design in the co-evolution (iteration) of the need and viable design concept. The theory is unique in that it is a framework for quantifying imprecise and vague design information available during the conceptual design stage as mathematical expression and algorithm early in the design effort and enables the objective evaluation and emergence of an optimal design concept from among multitude of viable ones. The book is conceived for students and real-world practitioners in engineering, natural and social sciences, business, and fine arts who seek to develop powerful design thinking for solving problems in a creative and innovative way.

This book gives a comprehensive view of graph theory in informational retrieval (IR) and natural language processing(NLP). This book provides number of graph techniques for IR and NLP applications with examples. It also provides understanding of graph theory basics, graph algorithms and networks using graph. The book is divided into three parts and contains nine chapters. The first part gives graph theory basics and graph networks, and the second part provides basics of IR with graph-based information retrieval. The third part covers IR and NLP recent and emerging applications with case studies using graph theory. This book is unique in its way as it provides a strong foundation to a beginner in applying mathematical structure graph for IR and NLP applications. All technical details that include tools and technologies used for graph algorithms and implementation in Information Retrieval and Natural Language Processing with its future scope are explained in a clear and organized format.

Discusses concepts such as Basic Programming Principles, OOP Principles, Database Programming, GUI Programming, Network Programming, Data Analytics and Visualization, Statistical Analysis, Virtual Reality, Web Development, Machine Learning, Deep Learning Provides the code and the output for all the concepts discussed Includes a case study at the end of each chapter

This book highlights various evolutionary algorithm techniques for various medical conditions and introduces medical applications of evolutionary computation for real-time diagnosis. Evolutionary Intelligence for Healthcare Applications presents how evolutionary intelligence can be used in smart healthcare systems involving big data analytics, mobile health, personalized medicine, and clinical trial data management. It focuses on emerging concepts and approaches and highlights various evolutionary algorithm techniques used for early disease diagnosis, prediction, and prognosis for medical conditions. The book also presents ethical issues and challenges that can occur within the healthcare system. Researchers, healthcare professionals, data scientists, systems engineers, students, programmers, clinicians, and policymakers will find this book of interest.

The objective of the book is to provide materials to demonstrate the development of TOPSIS and to serve as a handbook. It contains the basic process of TOPSIS, numerous variant processes, property explanations, theoretical developments, and illustrative examples with real-world cases. Possible readers would be graduate students, researchers, analysts, and professionals who are interested in TOPSIS, a distance-based algorithm, and who would like to compare TOPSIS with other MCDM methods. The book serves as a research reference as well as a self-learning book with step-by-step illustrations for the MCDM community.

This volume is intended to be used as a textbook for a special topic course in computer science. It addresses contemporary research topics of interest such as intelligent control, genetic algorithms, neural networks, optimization techniques, expert systems, fractals, and computer vision. The work incorporates many new research ideas, and focuses on the role of continuous mathematics. Audience: This book will be valuable to graduate students interested in theoretical computer topics, algorithms, expert systems, neural networks, and software engineering.

In this book the author introduces a novel approach to securing exam systems. He provides an in-depth understanding, useful for studying the security of exams and similar systems, such as public tenders, personnel selections, project reviews, and conference management systems. After a short chapter that explains the context and objectives of the book, in Chap. 2 the author introduces terminology for exams and the foundations required to formulate their security requirements. He describes the tasks that occur during an exam, taking account of the levels of detail and abstraction of an exam specification and the threats that arise out of the different exam roles. He also presents a taxonomy that classifies exams by types and categories. Chapter 3 contains formal definitions of the authentication, privacy, and verifiability requirements for exams, a framework based on the applied pi-calculus for the specification of authentication and privacy, and a more abstract approach based on set-theory that enables the specification of verifiability. Chapter 4 describes the Huszti-Petho protocol in detail and proposes a security enhancement. In Chap. 5 the author details Remark!, a protocol for Internet-based exams, discussing its cryptographic building blocks and some security considerations. Chapter 6 focuses on WATA, a family of computer-assisted exams that employ computer assistance while keeping face-to-face testing. The chapter also introduces formal definitions of accountability requirements and details the analysis of a WATA protocol against such definitions. In Chaps. 4, 5, and 6 the author uses the cryptographic protocol verifier ProVerif for the formal analyses. Finally, the author outlines future work in Chap. 7. The book is valuable for researchers and graduate students in the areas of information security, in particular for people engaged with exams or protocols.

Fault-Tolerant Parallel Computation presents recent advances in algorithmic ways of introducing fault-tolerance in multiprocessors under the constraint of preserving efficiency. The difficulty associated with combining fault-tolerance and efficiency is that the two have conflicting means: fault-tolerance is achieved by introducing redundancy, while efficiency is achieved by removing redundancy. This monograph demonstrates how in certain models of parallel computation it is possible to combine efficiency and fault-tolerance and shows how it is possible to develop efficient algorithms without concern for fault-tolerance, and then correctly and efficiently execute these algorithms on parallel machines whose processors are subject to arbitrary dynamic fail-stop errors. The efficient algorithmic approaches to multiprocessor fault-tolerance presented in this monograph make a contribution towards bridging the gap between the abstract models of parallel computation and realizable parallel architectures. Fault-Tolerant Parallel Computation presents the state of the art in algorithmic approaches to fault-tolerance in efficient parallel algorithms. The monograph synthesizes work that was presented in recent symposia and published in refereed journals by the authors and other leading researchers. This is the first text that takes the reader on the grand tour of this new field summarizing major results and identifying hard open problems. This monograph will be of interest to academic and industrial researchers and graduate students working in the areas of fault-tolerance, algorithms and parallel computation and may also be used as a text in a graduate course on parallel algorithmic techniques and fault-tolerance.

Today, Internet of Things (IoT) is ubiquitous as it is applied in practice in everything from Industrial Control Systems (ICS) to e-Health, e-commerce, Cyber Physical Systems (CPS), smart cities, smart parking, healthcare, supply chain management and many more. Numerous industries, academics, alliances and standardization organizations make an effort on IoT standardization, innovation and development. But there is still a need for a comprehensive framework with integrated standards under one IoT vision. Furthermore, the existing IoT systems are vulnerable to huge range of malicious attacks owing to the massive numbers of deployed IoT systems, inadequate data security standards and the resource-constrained nature. Existing security solutions are insufficient and therefore it is necessary to enable the IoT devices to dynamically counter the threats and save the system. Apart from illustrating the diversified IoT applications, this book also addresses the issue of data safekeeping along with the development of new security-enhancing schemes such as blockchain, as well as a range of other advances in IoT. The reader will discover that the IoT facilitates a multidisciplinary approach dedicated to create novel applications and develop integrated solutions to build a sustainable society. The innovative and fresh advances that demonstrate IoT and computational intelligence in practice are discussed in this book, which will be helpful and informative for scientists, research scholars, academicians, policymakers, industry professionals, government organizations and others. This book is intended for a broad target audience, including scholars of various generations and disciplines, recognized scholars (lecturers and professors) and young researchers (postgraduate and undergraduates) who study the legal and socio-economic consequences of the emergence and dissemination of digital technologies such as IoT. Furthermore, the book is intended for researchers, developers and operators working in the field of IoT and eager to comprehend the vulnerability of the IoT paradigm. The book will serve as a comprehensive guide for the advanced-level students in computer science who are interested in understanding the severity and implications of the accompanied security issues in IoT. Dr. Bharat Bhushan is an Assistant Professor of Department of Computer Science and Engineering (CSE) at School of Engineering and Technology, Sharda University, Greater Noida, India. Prof. (Dr.) Sudhir Kumar Sharma is currently a Professor and Head of the Department of Computer Science, Institute of Information Technology & Management affiliated to GGSIPU, New Delhi, India. Prof. (Dr.) Bhuvan Unhelkar (BE, MDBA, MSc, PhD; FACS; PSM-I, CBAP (R)) is an accomplished IT professional and Professor of IT at the University of South Florida, Sarasota-Manatee (Lead Faculty). Dr. Muhammad Fazal Ijaz is working as an Assistant Professor in Department of Intelligent Mechatronics Engineering, Sejong University, Seoul, Korea. Prof. (Dr.) Lamia Karim is a professor of computer science at the National School of Applied Sciences Berrechid (ENSAB), Hassan 1st University.