Handbook of Research on Intelligent Data Processing and Information Security Systems

Handbook of Research on Intelligent Data Processing and Information Security Systems
Author: Bilan, Stepan Mykolayovych
Publisher: IGI Global
Total Pages: 434
Release: 2019-11-29
Genre: Computers
ISBN: 1799812928

Intelligent technologies have emerged as imperative tools in computer science and information security. However, advanced computing practices have preceded new methods of attacks on the storage and transmission of data. Developing approaches such as image processing and pattern recognition are susceptible to breaches in security. Modern protection methods for these innovative techniques require additional research. The Handbook of Research on Intelligent Data Processing and Information Security Systems provides emerging research exploring the theoretical and practical aspects of cyber protection and applications within computer science and telecommunications. Special attention is paid to data encryption, steganography, image processing, and recognition, and it targets professionals who want to improve their knowledge in order to increase strategic capabilities and organizational effectiveness. As such, this book is ideal for analysts, programmers, computer engineers, software engineers, mathematicians, data scientists, developers, IT specialists, academicians, researchers, and students within fields of information technology, information security, robotics, artificial intelligence, image processing, computer science, and telecommunications.

Cellular Automata And Complexity

Cellular Automata And Complexity
Author: Stephen Wolfram
Publisher: CRC Press
Total Pages: 615
Release: 2018-03-08
Genre: Mathematics
ISBN: 0429973721

Are mathematical equations the best way to model nature? For many years it had been assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal that one should instead build models that are based directly on simple computer programs. Wolfram made a detailed study of a class of such models known as cellular automata, and discovered a remarkable fact: that even when the underlying rules are very simple, the behaviour they produce can be highly complex, and can mimic many features of what we see in nature. And based on this result, Wolfram began a program of research to develop what he called A Science of Complexity."The results of Wolfram's work found many applications, from the so-called Wolfram Classification central to fields such as artificial life, to new ideas about cryptography and fluid dynamics. This book is a collection of Wolfram's original papers on cellular automata and complexity. Some of these papers are widely known in the scientific community others have never been published before. Together, the papers provide a highly readable account of what has become a major new field of science, with important implications for physics, biology, economics, computer science and many other areas.

Additive Cellular Automata

Additive Cellular Automata
Author: Parimal Pal Chaudhuri
Publisher: John Wiley & Sons
Total Pages: 372
Release: 1997-07-11
Genre: Technology & Engineering
ISBN: 9780818677175

This book presents an extensive survey and report of related research on important developments in cellular automata (CA) theory. The authors introduce you to this theory in a comprehensive manner that will help you understand the basics of CA and be prepared for further research. They illustrate the matrix algebraic tools that characterize group CA and help develop its applications in the field of VLSI testing. The text examines schemes based on easily testable FSM, bit-error correcting code, byte error correcting code, and characterization of 2D cellular automata. In addition, it looks into CA-based universal pattern generation, data encryption, and synthesis of easily testable combinational logic. The book covers new characterizations of group CA behavior, CA-based tools for fault diagnosis, and a wide variety of applications to solve real-life problems.

Identification Of Cellular Automata

Identification Of Cellular Automata
Author: Andrew I. Adamatzky
Publisher: CRC Press
Total Pages: 384
Release: 1994-11-25
Genre: Science
ISBN: 9780748401727

This book presents the foundation and development of the theory of cellular automata identification and its application to natural systems. It first sets out the known and proposes the new classes of cellular automata. Numerous examples are included for ease of understanding. It then deals with the designs of algorithms for cellular automata identification. Conceptual questions of automata theory are next addressed and the focus is shifted from synthesis to analysis and from pronostication to accurate factorization. Finally, the author discusses a number of naturally occuring specific instances with a view to expanding and transforming current ideas on cellular automata practice.

Theory and Practice of Natural Computing

Theory and Practice of Natural Computing
Author: Carlos Martín-Vide
Publisher:
Total Pages:
Release: 2017
Genre: Artificial intelligence
ISBN: 9783319710709

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

Nonlinear System Identification

Nonlinear System Identification
Author: Stephen A. Billings
Publisher: John Wiley & Sons
Total Pages: 611
Release: 2013-07-29
Genre: Technology & Engineering
ISBN: 1118535553

Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains describes a comprehensive framework for the identification and analysis of nonlinear dynamic systems in the time, frequency, and spatio-temporal domains. This book is written with an emphasis on making the algorithms accessible so that they can be applied and used in practice. Includes coverage of: The NARMAX (nonlinear autoregressive moving average with exogenous inputs) model The orthogonal least squares algorithm that allows models to be built term by term where the error reduction ratio reveals the percentage contribution of each model term Statistical and qualitative model validation methods that can be applied to any model class Generalised frequency response functions which provide significant insight into nonlinear behaviours A completely new class of filters that can move, split, spread, and focus energy The response spectrum map and the study of sub harmonic and severely nonlinear systems Algorithms that can track rapid time variation in both linear and nonlinear systems The important class of spatio-temporal systems that evolve over both space and time Many case study examples from modelling space weather, through identification of a model of the visual processing system of fruit flies, to tracking causality in EEG data are all included to demonstrate how easily the methods can be applied in practice and to show the insight that the algorithms reveal even for complex systems NARMAX algorithms provide a fundamentally different approach to nonlinear system identification and signal processing for nonlinear systems. NARMAX methods provide models that are transparent, which can easily be analysed, and which can be used to solve real problems. This book is intended for graduates, postgraduates and researchers in the sciences and engineering, and also for users from other fields who have collected data and who wish to identify models to help to understand the dynamics of their systems.

Theory of Reversible Computing

Theory of Reversible Computing
Author: Kenichi Morita
Publisher: Springer
Total Pages: 463
Release: 2017-11-06
Genre: Computers
ISBN: 4431566066

This book describes reversible computing from the standpoint of the theory of automata and computing. It investigates how reversibility can be effectively utilized in computing. A reversible computing system is a “backward deterministic” system such that every state of the system has at most one predecessor. Although its definition is very simple, it is closely related to physical reversibility, one of the fundamental microscopic laws of Nature. Authored by the leading scientist on the subject, this book serves as a valuable reference work for anyone working in reversible computation or in automata theory in general. This work deals with various reversible computing models at several different levels, which range from the microscopic to the macroscopic, and aims to clarify how computation can be carried out efficiently and elegantly in these reversible computing models. Because the construction methods are often unique and different from those in the traditional methods, these computing models as well as the design methods provide new insights for future computing systems. Organized bottom-up, the book starts with the lowest scale of reversible logic elements and circuits made from them. This is followed by reversible Turing machines, the most basic computationally universal machines, and some other types of reversible automata such as reversible multi-head automata and reversible counter machines. The text concludes with reversible cellular automata for massively parallel spatiotemporal computation. In order to help the reader have a clear understanding of each model, the presentations of all different models follow a similar pattern: the model is given in full detail, a short informal discussion is held on the role of different elements of the model, and an example with illustrations follows each model.

Cellular Automata: Analysis and Applications

Cellular Automata: Analysis and Applications
Author: Karl-Peter Hadeler
Publisher: Springer
Total Pages: 467
Release: 2017-05-27
Genre: Mathematics
ISBN: 3319530437

This book provides an overview of the main approaches used to analyze the dynamics of cellular automata. Cellular automata are an indispensable tool in mathematical modeling. In contrast to classical modeling approaches like partial differential equations, cellular automata are relatively easy to simulate but difficult to analyze. In this book we present a review of approaches and theories that allow the reader to understand the behavior of cellular automata beyond simulations. The first part consists of an introduction to cellular automata on Cayley graphs, and their characterization via the fundamental Cutis-Hedlund-Lyndon theorems in the context of various topological concepts (Cantor, Besicovitch and Weyl topology). The second part focuses on classification results: What classification follows from topological concepts (Hurley classification), Lyapunov stability (Gilman classification), and the theory of formal languages and grammars (Kůrka classification)? These classifications suggest that cellular automata be clustered, similar to the classification of partial differential equations into hyperbolic, parabolic and elliptic equations. This part of the book culminates in the question of whether the properties of cellular automata are decidable. Surjectivity and injectivity are examined, and the seminal Garden of Eden theorems are discussed. In turn, the third part focuses on the analysis of cellular automata that inherit distinct properties, often based on mathematical modeling of biological, physical or chemical systems. Linearity is a concept that allows us to define self-similar limit sets. Models for particle motion show how to bridge the gap between cellular automata and partial differential equations (HPP model and ultradiscrete limit). Pattern formation is related to linear cellular automata, to the Bar-Yam model for the Turing pattern, and Greenberg-Hastings automata for excitable media. In addition, models for sand piles, the dynamics of infectious d

Recent Advances in Big Data and Deep Learning

Recent Advances in Big Data and Deep Learning
Author: Luca Oneto
Publisher: Springer
Total Pages: 402
Release: 2019-04-02
Genre: Computers
ISBN: 3030168417

This book presents the original articles that have been accepted in the 2019 INNS Big Data and Deep Learning (INNS BDDL) international conference, a major event for researchers in the field of artificial neural networks, big data and related topics, organized by the International Neural Network Society and hosted by the University of Genoa. In 2019 INNS BDDL has been held in Sestri Levante (Italy) from April 16 to April 18. More than 80 researchers from 20 countries participated in the INNS BDDL in April 2019. In addition to regular sessions, INNS BDDL welcomed around 40 oral communications, 6 tutorials have been presented together with 4 invited plenary speakers. This book covers a broad range of topics in big data and deep learning, from theoretical aspects to state-of-the-art applications. This book is directed to both Ph.D. students and Researchers in the field in order to provide a general picture of the state-of-the-art on the topics addressed by the conference.