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 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.

Advances in Computational Algorithms and Data Analysis offers state of the art tremendous advances in computational algorithms and data analysis. The selected articles are representative in these subjects sitting on the top-end-high technologies. The volume serves as an excellent reference work for researchers and graduate students working on computational algorithms and data analysis.

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 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.

This book comprises papers on diverse aspects of fuzzy logic, neural networks, and nature-inspired optimization meta-heuristics and their application in various areas such as intelligent control and robotics, pattern recognition, medical diagnosis, time series prediction and optimization of complex problems. The book is organized into seven main parts, each with a collection of papers on a similar subject. The first part presents new concepts and algorithms based on type-2 fuzzy logic for dynamic parameter adaptation in meta-heuristics. The second part discusses network theory and applications, and includes papers describing applications of neural networks in diverse areas, such as time series prediction and pattern recognition. The third part addresses the theory and practice of meta-heuristics in different areas of application, while the fourth part describes diverse fuzzy logic applications in the control area, which can be considered as intelligent controllers. The next two parts explore applications in areas, such as time series prediction, and pattern recognition and new optimization and evolutionary algorithms and their applications respectively. Lastly, the seventh part addresses the design and application of different hybrid intelligent systems.

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.

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 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.

This is the first book primarily dedicated to clustering using multiobjective genetic algorithms with extensive real-life applications in data mining and bioinformatics. The authors first offer detailed introductions to the relevant techniques - genetic algorithms, multiobjective optimization, soft computing, data mining and bioinformatics. They then demonstrate systematic applications of these techniques to real-world problems in the areas of data mining, bioinformatics and geoscience. The authors offer detailed theoretical and statistical notes, guides to future research, and chapter summaries. The book can be used as a textbook and as a reference book by graduate students and academic and industrial researchers in the areas of soft computing, data mining, bioinformatics and geoscience.

This comprehensive compendium provides a rigorous framework to tackle the daunting challenges of designing correct and efficient algorithms. It gives a uniform approach to the design, analysis, optimization, and verification of algorithms. The volume also provides essential tools to understand algorithms and their associated data structures.This useful reference text describes a way of thinking that eases the task of proving algorithm correctness. Working through a proof of correctness reveals an algorithm's subtleties in a way that a typical description does not. Algorithm analysis is presented using careful definitions that make the analyses mathematically rigorous.

This book focuses on artifi cial intelligence in the field of digital signal processing and wireless communication. The implementation of machine learning and deep learning in audio, image, and video processing is presented, while adaptive signal processing and biomedical signal processing are also explored through DL algorithms, as well as 5G and green communication. Finally, metaheuristic algorithms of related mathematical problems are explored.

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.

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."

This contributed volume offers practical solutions and design-, modeling-, and implementation-related insights that address current research problems in memristors, memristive devices, and memristor computing. The book studies and addresses related challenges in and proposes solutions for the future of memristor computing. State-of-the-art research on memristor modeling, memristive interconnections, memory circuit architectures, software simulation tools, and applications of memristors in computing are presented. Utilising contributions from numerous experts in the field, written in clear language and illustrated throughout, this book is a comprehensive reference work. Memristor Computing Systems explains memristors and memristive devices in an accessible way for graduate students and researchers with a basic knowledge of electrical and control systems engineering, as well as prompting further research for more experienced academics.

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."

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.

This book introduces the reader to FPGA based design for RTL synthesis. It describes simple to complex RTL design scenarios using SystemVerilog. The book builds the story from basic fundamentals of FPGA based designs to advance RTL design and verification concepts using SystemVerilog. It provides practical information on the issues in the RTL design and verification and how to overcome these. It focuses on writing efficient RTL codes using SystemVerilog, covers design for the Xilinx FPGAs and also includes implementable code examples. The contents of this book cover improvement of design performance, assertion based verification, verification planning, and architecture and system testing using FPGAs. The book can be used for classroom teaching or as a supplement in lab work for undergraduate and graduate coursework as well as for professional development and training programs. It will also be of interest to researchers and professionals interested in the RTL design for FPGA and ASIC.

This open access book gives an overview of cutting-edge work on a new paradigm called the "sublinear computation paradigm," which was proposed in the large multiyear academic research project "Foundations of Innovative Algorithms for Big Data." That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as "fast," but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required.The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms.

This book provides tools and algorithms for solving a wide class of optimization tasks by learning from their repetitions. A unified framework is provided for learning algorithms that are based on the stochastic gradient (a golden standard in learning), including random simultaneous perturbations and the response surface the methodology. Original algorithms include model-free learning of short decision sequences as well as long sequences-relying on model-supported gradient estimation. Learning is based on whole sequences of a process observation that are either vectors or images. This methodology is applicable to repetitive processes, covering a wide range from (additive) manufacturing to decision making for COVID-19 waves mitigation. A distinctive feature of the algorithms is learning between repetitions-this idea extends the paradigms of iterative learning and run-to-run control. The main ideas can be extended to other decision learning tasks, not included in this book. The text is written in a comprehensible way with the emphasis on a user-friendly presentation of the algorithms, their explanations, and recommendations on how to select them. The book is expected to be of interest to researchers, Ph.D., and graduate students in computer science and engineering, operations research, decision making, and those working on the iterative learning control.

This book includes high-quality papers presented at the Second International Conference on Data Science and Management (ICDSM 2021), organized by the Gandhi Institute for Education and Technology, Bhubaneswar, from 19 to 20 February 2021. It features research in which data science is used to facilitate the decision-making process in various application areas, and also covers a wide range of learning methods and their applications in a number of learning problems. The empirical studies, theoretical analyses and comparisons to psychological phenomena described contribute to the development of products to meet market demands.

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.

This book develops survey data analysis tools in Python, to create and analyze cross-tab tables and data visuals, weight data, perform hypothesis tests, and handle special survey questions such as Check-all-that-Apply. In addition, the basics of Bayesian data analysis and its Python implementation are presented. Since surveys are widely used as the primary method to collect data, and ultimately information, on attitudes, interests, and opinions of customers and constituents, these tools are vital for private or public sector policy decisions. As a compact volume, this book uses case studies to illustrate methods of analysis essential for those who work with survey data in either sector. It focuses on two overarching objectives: Demonstrate how to extract actionable, insightful, and useful information from survey data; and Introduce Python and Pandas for analyzing survey data.

In many real-world problems, rare categories (minority classes) play essential roles despite their extreme scarcity. The discovery, characterization and prediction of rare categories of rare examples may protect us from fraudulent or malicious behavior, aid scientific discovery, and even save lives. This book focuses on rare category analysis, where the majority classes have smooth distributions, and the minority classes exhibit the compactness property. Furthermore, it focuses on the challenging cases where the support regions of the majority and minority classes overlap. The author has developed effective algorithms with theoretical guarantees and good empirical results for the related techniques, and these are explained in detail. The book is suitable for researchers in the area of artificial intelligence, in particular machine learning and data mining.