This book features high-quality, peer-reviewed research papers presented at the Fourth International Conference on Smart Technologies in Data Science and Communication (SMART-DSC 2021), held in Koneru Lakshmaiah Education Foundation, Guntur, Andhra Pradesh, India, on 18-19 February 2021. It includes innovative and novel contributions in the areas of data analytics, communication, and soft computing.

Deep connections exist between harmonic and applied analysis and the diverse yet connected topics of machine learning, data analysis, and imaging science. This volume explores these rapidly growing areas and features contributions presented at the second and third editions of the Summer Schools on Applied Harmonic Analysis, held at the University of Genova in 2017 and 2019. Each chapter offers an introduction to essential material and then demonstrates connections to more advanced research, with the aim of providing an accessible entrance for students and researchers. Topics covered include ill-posed problems; concentration inequalities; regularization and large-scale machine learning; unitarization of the radon transform on symmetric spaces; and proximal gradient methods for machine learning and imaging.

The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O( n log n) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all p0: .sible inputs."

This book focuses on how the BOXES Methodology, which is based on the work of Donald Michie, is applied to ill-defined real-time control systems with minimal a priori knowledge of the system. The method is applied to a variety of systems including the familiar pole and cart. This second edition includes a new section that covers some further observations and thoughts, problems, and evolutionary extensions that the reader will find useful in their own implementation of the method. This second edition includes a new section on how to handle jittering about a system boundary which in turn causes replicated run times to become part of the learning mechanism. It also addresses the aging of data values using a forgetfulness factor that causes wrong values of merit to be calculated. Another question that is addressed is "Should a BOXES cell ever be considered fully trained and, if so, excluded from further dynamic updates". Finally, it expands on how system boundaries may be shifted using data from many runs using an evolutionary paradigm.

This textbook introduces major topics that include quantum bits, superposition, entanglement, logic gates, quantum search algorithm, quantum Fourier transform, inverse quantum Fourier transform, Shor's order-finding algorithm and phase estimation. Everyone can write algorithms and programs in the cloud making using IBM's quantum computers that support IBM Q Experience which contains the composer, open quantum assembly language, simulators and real quantum devices. Furthermore, this book teaches you how to use open quantum assembly language to write quantum programs for dealing with complex problems. Through numerous examples and exercises, readers will learn how to write a quantum program with open quantum assembly language for solving any problem from start to complete. This book includes six main chapters: *Quantum Bits and Quantum Gates-learn what quantum bits are, how to declare and measure them, what quantum gates are and how they work on a simulator or a real device in the cloud. *Boolean Algebra and its Applications-learn how to decompose CCNOT gate into six CNOT gates and nine gates of one bit and how to use NOT gates, CNOT gates and CCNOT gates to implement logic operations including NOT, OR, AND, NOR, NAND, Exclusive-OR (XOR) and Exclusive-NOR (XNOR). *Quantum Search Algorithm and its Applications-learn core concepts of quantum search algorithm and how to write quantum programs to implement core concepts of quantum search algorithm for solving two famous NP-complete problems that are the satisfiability problem in n Boolean variables and m clauses and the clique problem in a graph with n vertices and q edges. *Quantum Fourier Transform and its Applications-learn core concepts of quantum Fourier transform and inverse quantum Fourier transform and how to write quantum programs to implement them for solving two real applications that are to compute the period and the frequency of two given oracular functions. *Order-Finding and Factoring-learn core concepts of Shor's order-finding algorithm and how to write quantum programs to implement Shor's order-finding algorithm for completing the prime factorization to 15. Phase Estimation and its Applications-learn core concepts of phase estimation and quantum counting and how to write quantum programs to implement them to compute the number of solution(s) in the independent set problem in a graph with two vertices and one edge.

This book provides an overview of state-of-the-art implementations of quantum random number generators (QRNGs), and especially examines their relation to classical statistical randomness models and numerical techniques for computing random numbers. The reader - who ideally has a background in classical statistics, computer science, or cryptography - is introduced to the world of quantum bits step by step, and explicit relations between QRNGs and their classical counterparts are identified along the way. Random number generation is a major pillar of cryptography. Capitalizing on the randomness inherent in quantum phenomena is a rapidly evolving branch of quantum cryptography with countless applications for the future. The value of quantum randomness for cryptographic purposes is empirically demonstrated in statistical evaluations of QRNGs' performance compared to classical techniques for true and pseudorandom number generation. The book then provides an overview of technical implementations of QRNGs, before a concluding discussion of major achievements and remaining obstacles in the field rounds out the coverage, while also opening the door for future research directions.

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.

In recent years, the United Kingdom's Home Office has started using automated systems to make immigration decisions. These systems promise faster, more accurate, and cheaper decision-making, but in practice they have exposed people to distress, disruption, and even deportation. This book identifies a pattern of risky experimentation with automated systems in the Home Office. It analyses three recent case studies including: a voice recognition system used to detect fraud in English-language testing; an algorithm for identifying 'risky' visa applications; and automated decision-making in the EU Settlement Scheme. The book argues that a precautionary approach is essential to ensure that society benefits from government automation without exposing individuals to unacceptable risks.

This book describes how we can design and make efficient processors for high-performance computing, AI, and data science. Although there are many textbooks on the design of processors we do not have a widely accepted definition of the efficiency of a general-purpose computer architecture. Without a definition of the efficiency, it is difficult to make scientific approach to the processor design. In this book, a clear definition of efficiency is given and thus a scientific approach for processor design is made possible. In chapter 2, the history of the development of high-performance processor is overviewed, to discuss what quantity we can use to measure the efficiency of these processors. The proposed quantity is the ratio between the minimum possible energy consumption and the actual energy consumption for a given application using a given semiconductor technology. In chapter 3, whether or not this quantity can be used in practice is discussed, for many real-world applications. In chapter 4, general-purpose processors in the past and present are discussed from this viewpoint. In chapter 5, how we can actually design processors with near-optimal efficiencies is described, and in chapter 6 how we can program such processors. This book gives a new way to look at the field of the design of high-performance processors.

Reversible grammar allows computational models to be built that are equally well suited for the analysis and generation of natural language utterances. This task can be viewed from very different perspectives by theoretical and computational linguists, and computer scientists. The papers in this volume present a broad range of approaches to reversible, bi-directional, and non-directional grammar systems that have emerged in recent years. This is also the first collection entirely devoted to the problems of reversibility in natural language processing. Most papers collected in this volume are derived from presentations at a workshop held at the University of California at Berkeley in the summer of 1991 organised under the auspices of the Association for Computational Linguistics. This book will be a valuable reference to researchers in linguistics and computer science with interests in computational linguistics, natural language processing, and machine translation, as well as in practical aspects of computability.

Techniques and principles of minimax theory play a key role in many areas of research, including game theory, optimization, and computational complexity. In general, a minimax problem can be formulated as min max f(x, y) (1) ",EX !lEY where f(x, y) is a function defined on the product of X and Y spaces. There are two basic issues regarding minimax problems: The first issue concerns the establishment of sufficient and necessary conditions for equality minmaxf(x,y) = maxminf(x,y). (2) "'EX !lEY !lEY "'EX The classical minimax theorem of von Neumann is a result of this type. Duality theory in linear and convex quadratic programming interprets minimax theory in a different way. The second issue concerns the establishment of sufficient and necessary conditions for values of the variables x and y that achieve the global minimax function value f(x*, y*) = minmaxf(x, y). (3) "'EX !lEY There are two developments in minimax theory that we would like to mention.

This book discusses one of the major applications of artificial intelligence: the use of machine learning to extract useful information from multimodal data. It discusses the optimization methods that help minimize the error in developing patterns and classifications, which further helps improve prediction and decision-making. The book also presents formulations of real-world machine learning problems, and discusses AI solution methodologies as standalone or hybrid approaches. Lastly, it proposes novel metaheuristic methods to solve complex machine learning problems. Featuring valuable insights, the book helps readers explore new avenues leading toward multidisciplinary research discussions.

This book contains international perspectives that unifies the themes of strategic management, decision theory, and data science. It contains thought-provoking presentations of case studies backed by adequate analysis adding significance to the discussions. Most of the decision-making models in use do take due advantage of collection and processing of relevant data using appropriate analytics oriented to provide inputs into effective decision-making. The book showcases applications in diverse fields including banking and insurance, portfolio management, inventory analysis, performance assessment of comparable economic agents, managing utilities in a health-care facility, reducing traffic snarls on highways, monitoring achievement of some of the sustainable development goals in a country or state, and similar other areas that showcase policy implications. It holds immense value for researchers as well as professionals responsible for organizational decisions.

This book provides research on the state-of-the-art methods for data management in the fourth industrial revolution, with particular focus on cloud.based data analytics for digital manufacturing infrastructures. Innovative techniques and methods for secure, flexible and profi table cloud manufacturing will be gathered to present advanced and specialized research in the selected area.

Covers three important aspects of smart cities i.e., healthcare, smart communication and information, and smart transportation technologies Discusses on various security aspects of medical documents and the data preserving mechanisms Provides better solution using IoT techniques for healthcare, transportation, and communication systems Includes the implementation example, various datasets, experimental results, and simulation procedures Offers solution for various disease prediction systems with intelligent techniques

Graduate students and researchers in applied mathematics, optimization, engineering, computer science, and management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts.

This book includes selected papers presented at International Conference on Computational Intelligence, Data Science and Cloud Computing (IEM-ICDC) 2020, organized by the Department of Information Technology, Institute of Engineering & Management, Kolkata, India, during 25-27 September 2020. It presents substantial new research findings about AI and robotics, image processing and NLP, cloud computing and big data analytics as well as in cyber security, blockchain and IoT, and various allied fields. The book serves as a reference resource for researchers and practitioners in academia and industry.

The first edition of Exercises in Programming Style was honored as an ACM Notable Book and praised as "The best programming book of the decade." This new edition retains the same presentation but has been upgraded to Python 3, and there is a new section on neural network styles. Using a simple computational task (term frequency) to illustrate different programming styles, Exercises in Programming Style helps readers understand the various ways of writing programs and designing systems. It is designed to be used in conjunction with code provided on an online repository. The book complements and explains the raw code in a way that is accessible to anyone who regularly practices the art of programming. The book can also be used in advanced programming courses in computer science and software engineering programs. The book contains 40 different styles for writing the term frequency task. The styles are grouped into ten categories: historical, basic, function composition, objects and object interactions, reflection and metaprogramming, adversity, data-centric, concurrency, interactivity, and neural networks. The author states the constraints in each style and explains the example programs. Each chapter first presents the constraints of the style, next shows an example program, and then gives a detailed explanation of the code. Most chapters also have sections focusing on the use of the style in systems design as well as sections describing the historical context in which the programming style emerged.

Entering the field of artificial intelligence and data science can seem daunting to beginners with little to no prior background, especially those with no programming experience. The concepts used in self-driving cars and virtual assistants like Amazon's Alexa may seem very complex and difficult to grasp. The aim of Artificial Intelligence in Python is to make AI accessible and easy to understand for people with little to no programming experience though practical exercises. Newcomers will gain the necessary knowledge on how to create such systems, which are capable of executing tasks that require some form of human-like intelligence. This book introduces readers to various topics and examples of programming in Python, as well as key concepts in artificial intelligence. Python programming skills will be imparted as we go along. Concepts and code snippets will be covered in a step-by-step manner, to guide and instill confidence in beginners. Complex subjects in deep learning and machine learning will be broken down into easy-to-digest content and examples. Artificial intelligence implementations will also be shared, allowing beginners to generate their own artificial intelligence algorithms for reinforcement learning, style transfer, chatbots, speech, and natural language processing.

As a software engineer, you'll encounter countless programming challenges that initially seem confusing, difficult, or even impossible. Don't despair! Many of these "new" problems already have well-established solutions. Advanced Algorithms and Data Structures teaches you powerful approaches to a wide range of tricky coding challenges that you can adapt and apply to your own applications. Providing a balanced blend of classic, advanced, and new algorithms, this practical guide upgrades your programming toolbox with new perspectives and hands-on techniques. about the technology Data structures and algorithms are the foundations for how programs store and process information. Choosing the optimal algorithms ensures that your programs are fast, efficient, and reliable. about the book Algorithms and Data Structures in Action expands on the basic algorithms you already know to give you a better selection of solutions to different programming problems. In it, you'll discover techniques for improving priority queues, efficient caching, clustering data, and more. Each example is fully illustrated with graphics, language agnostic pseudo-code, and code samples in various languages. When you're done, you will be able to implement advanced and little-known algorithms to deliver better performance from your code. what's inside Improving on basic data structures Efficient caching Nearest neighbour search, including k-d trees and S-trees Full 'pseudo-code' and samples in multiple languages about the readerFor programmers with basic or intermediate skills. Written in a language-agnostic manner, no specific language knowledge is required. about the author Marcello La Rocca is a research scientist and a full-stack engineer focused on optimization algorithms, genetic algorithms, machine learning and quantum computing. He has contributed to large-scale web applications at companies like Twitter and Microsoft, has undertaken applied research in both academia and industry, and authored the Neatsort adaptive sorting algorithm.

This book focuses on the fundamentals of deep learning along with reporting on the current state-of-art research on deep learning. In addition, it provides an insight of deep neural networks in action with illustrative coding examples. Deep learning is a new area of machine learning research which has been introduced with the objective of moving ML closer to one of its original goals, i.e. artificial intelligence. Deep learning was developed as an ML approach to deal with complex input-output mappings. While traditional methods successfully solve problems where final value is a simple function of input data, deep learning techniques are able to capture composite relations between non-immediately related fields, for example between air pressure recordings and English words, millions of pixels and textual description, brand-related news and future stock prices and almost all real world problems. Deep learning is a class of nature inspired machine learning algorithms that uses a cascade of multiple layers of nonlinear processing units for feature extraction and transformation. Each successive layer uses the output from the previous layer as input. The learning may be supervised (e.g. classification) and/or unsupervised (e.g. pattern analysis) manners. These algorithms learn multiple levels of representations that correspond to different levels of abstraction by resorting to some form of gradient descent for training via backpropagation. Layers that have been used in deep learning include hidden layers of an artificial neural network and sets of propositional formulas. They may also include latent variables organized layer-wise in deep generative models such as the nodes in deep belief networks and deep boltzmann machines. Deep learning is part of state-of-the-art systems in various disciplines, particularly computer vision, automatic speech recognition (ASR) and human action recognition.

The Burrows-Wheeler Transform is one of the best lossless compression me- ods available. It is an intriguing - even puzzling - approach to squeezing redundancy out of data, it has an interesting history, and it has applications well beyond its original purpose as a compression method. It is a relatively late addition to the compression canon, and hence our motivation to write this book, looking at the method in detail, bringing together the threads that led to its discovery and development, and speculating on what future ideas might grow out of it. The book is aimed at a wide audience, ranging from those interested in learning a little more than the short descriptions of the BWT given in st- dard texts, through to those whose research is building on what we know about compression and pattern matching. The ?rst few chapters are a careful description suitable for readers with an elementary computer science ba- ground (and these chapters have been used in undergraduate courses), but later chapters collect a wide range of detailed developments, some of which are built on advanced concepts from a range of computer science topics (for example, some of the advanced material has been used in a graduate c- puter science course in string algorithms). Some of the later explanations require some mathematical sophistication, but most should be accessible to those with a broad background in computer science.

Encompassing a broad range of forms and sources of data, this textbook introduces data systems through a progressive presentation. Introduction to Data Systems covers data acquisition starting with local files, then progresses to data acquired from relational databases, from REST APIs and through web scraping. It teaches data forms/formats from tidy data to relationally defined sets of tables to hierarchical structure like XML and JSON using data models to convey the structure, operations, and constraints of each data form. The starting point of the book is a foundation in Python programming found in introductory computer science classes or short courses on the language, and so does not require prerequisites of data structures, algorithms, or other courses. This makes the material accessible to students early in their educational career and equips them with understanding and skills that can be applied in computer science, data science/data analytics, and information technology programs as well as for internships and research experiences. This book is accessible to a wide variety of students. By drawing together content normally spread across upper level computer science courses, it offers a single source providing the essentials for data science practitioners. In our increasingly data-centric world, students from all domains will benefit from the "data-aptitude" built by the material in this book.

This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups. The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a workshop in connection with the research project Thales on Algebraic Modeling of Topological and Computational Structures and Applications, held at the National Technical University of Athens, Greece in July 2015. The reader will benefit from the innovative approaches to tackling difficult questions in topology, applications and interrelated research areas, which largely employ algebraic tools.