Keywords:
Artificial intelligence.
;
Electronic books.
Description / Table of Contents:
Joining in the centenary celebration of the life and work of Alan Turing, this book reviews the latest developments in artificial intelligence, evolutionary computation and metaheuristics, all of which can be traced back to Turing's pioneer work.
Type of Medium:
Online Resource
Pages:
1 online resource (796 pages)
Edition:
1st ed.
ISBN:
9783642296949
Series Statement:
Studies in Computational Intelligence Series ; v.427
URL:
https://ebookcentral.proquest.com/lib/geomar/detail.action?docID=3070984
DDC:
006.3
Language:
English
Note:
Title -- Preface -- Contents -- Part I Artificial Intelligence and Cryptography -- Turing Test as a Defining Feature of AI-Completeness -- Introduction -- The Theory of AI-Completeness -- Definitions -- Turing Test as the First AI-Complete Problem -- Reducing Other Problems to TT -- Other Probably AI-Complete Problems -- 1st AI-Hard Problem: Programming -- Beyond AI-Completeness -- Conclusions -- References -- Artificial Intelligence Evolved from Random Behaviour: Departure from the State of the Art -- Introduction -- Artificial Intelligence vs. Natural Intelligence -- Definition of Human Intelligence -- Informal Definitions of Machine Intelligence -- Formal Definitions of Machine Intelligence -- A Thought on Artificial Intelligence So-Far-Proposed -- Artificial Intelligence Evolved from Randomness -- Machiavellian Intelligence -- Hibbard's Formal Definition Revisited -- Avidian -- A Modern Interpretation of Turing Test -- During 50 Years Since the Proposal -- An Easy Way to Cheat Human? -- Turing Test These Days -- Biologically Inspired Artificial Intelligence -- A Benchmark to Evaluate Artificial Intelligence -- To Aim a Real Human-Like Machine Intelligence -- Huge Number of Neurons-From Emulation to Simulation -- Toward Real AI by Parallelism -- Conclusions -- References -- Turing: Then, Now and Still Key -- Introduction -- Simplified Model of the Human Brain -- A List of Requirements for Intelligence -- General Mechanisms and Processes for Building a Solution -- Related Work -- Conclusions -- References -- Imitation Programming Unorganised Machines -- Introduction -- Background -- Discrete Dynamical Systems -- Graph-Based Representations -- Unorganised Machines -- Imitation Programming: Cultural Search -- Experimentation -- Asynchrony -- A Comparison with Evolution -- Towards Memristive Hardware -- Implication A-Types -- Synapse.
,
Conclusions -- References -- Towards Machine Equivalent Consciousness -- Introduction -- Patterns of Human Perceptions -- Sensation of Sight -- Sensation of Hearing -- Sensation of Smell -- Sensation of Taste -- Sensation of Touch -- A Comparison between Human and Machine Perceptions -- Awareness as Perceived Pattern of Physical Energy Changes -- Turing's Ideas for Building a Machine with Self-awareness -- Differences in Drawing Inference between Humans and Machines -- An Unfixable Difference in Drawing Inference -- A Fixable Difference -- Conclusion -- References -- Multicriteria Models for Learning Ordinal Data: A Literature Review -- Introduction -- Terminology and Concepts -- Multicriteria Decision Analysis -- MCDA Methods -- Inductive Learning Algorithms -- Feature Selection Algorithms on Ordinal Data -- Performance Measures -- Conclusion -- References -- Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem -- Introduction -- The RSA Cryptosystem -- Diophantine Approximations -- Diophantine Approximations Cryptanalysis of RSA -- Wiener's Attack on RSA -- de Weger's Generalization of Wiener's Attack -- Another Generalization of Wiener's Attack -- Nassr et al. Generalization of Wiener's Attack -- Lattices -- Small Solution of Polynomial Equations -- Howgrave-Graham's Theorem -- Coppersmith's Theorem -- Herrmann and May's Theorem for Bivariate Modular Linear Equations -- The Small Inverse Problem -- Lattice-Reduction Cryptanalysis of RSA -- Factoring the RSA Modulus with Partial Knowledge of p -- Factoring the RSA Modulus with Small Prime Difference -- Boneh and Durfee's Class of Weak Keys -- Another Generalization of Wiener's Attack on RSA -- Least Significant Bits of d Known -- The \Phi-Hiding Assumption -- Diophantine and Lattice Cryptanalysis of RSA -- Bl\"{o}mer and May's Class of Weak Keys -- Another Class of Weak Keys.
,
Conclusion -- References -- Artificial Intelligence Methods in Early Childhood Education -- Introduction -- Background -- Educational Technology in Early Childhood: General Issues -- Intelligent Educational Systems -- Intelligent Educational Robots for Young Children -- Case Studies of Integrating IESs in Early Childhood Settings -- Outline of IES Approaches in Early Childhood -- Discussion of Derived Results -- Case Studies of Robot Integration in Early Childhood Settings -- Approaches Integrating Robots in Typical Early Childhood Classrooms -- Robots and Young Children with Special Needs -- General Approaches Concerning Robots and Young Children -- Discussion -- Conclusions -- References -- Recursively Generated Evolutionary Turing Machines and Evolutionary Automata -- Introduction -- Basic Evolutionary Machines -- Computations by Evolutionary Machines -- Construction of Evolutionary Machines -- Conclusion -- References -- On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography -- Introduction -- On Cryptography Basics, Cremona Group and Dynamical Systems -- Symmetric Cryptography -- Idea of a Asymmetry -- On the Discrete Logarithm Problem for Special Subgroups of Cremona Group -- On the History of Constructive Multivariate Cryptography -- Dynamical Systems with Large Cycle Indicator, Related Public Keys and Key Exchange Protocols -- On the Case of Ring Extensions -- On the Velocities of Growth of Orders for Polynomial Encryption Maps Based on Dynamical Systems of Large Girth and of Large Cycle Indicator -- Conclusion -- References -- On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines -- Introduction -- On Algebraic Graphs, Automata and Turing Machines Related to Algebraic Graph.
,
Extremal Simple Graphs of Large Girth or Large Cycle Indicator -- On Families of Digraphs of Large Girth or Large Cycle Indicator -- Explicit Algebraic Constructions of Graphs, Digraphs of Large Girth or Large Cycle Indicator and Dynamical Systems -- Polarities of Incidence Structures and Related Dynamical Systems -- Improvement of Constants, Transitivity of Some Turing Machines -- Correlation with Expansion Properties -- On the Recent Implementation of Turing Machines Related to Graph Based Dynamical Systems -- Comparison of Our Symmetric Algorithm with RC4 -- Comparison with DES -- On the Expansion of Speed Evaluation for Some Other Stream Ciphers -- Conclusion -- References -- AIML Knowledge Base Construction from Text Corpora -- Introduction: Turing Test and Conversational Agents -- Turing Test as a Regulative Idea -- Chatbot Early History and General Developments -- Chatbot Applications for Educational Purpose -- AIML Language and Architecture -- Corpus Based Chatbots and Linguistic Issues -- The Corpus -- Building a Glossary: Linguistic Issues -- Corpus Based FAQ -- Steps for Chatter-Bot Generation -- Requirements for the Chatter-Bot -- Input Set Definition -- Chatter-Bot Lexical Knowledge Base Construction -- Chatter-Bot Testing -- Discussion -- Tools and Resources -- References -- Multidisciplinary Trends in Modern Artificial Intelligence: Turing's Way -- Introduction -- Artificial Intelligence: Challenges and Multidisciplinarity -- Symbolic and Connectionist Artificial Intelligence -- In Between AI Approaches: Multi-Agent Systems -- Natural and Artificial Intelligence -- Bio-inspired Methods and Transdisciplinarity -- Dynamic and Nonlinear Artificial Intelligence -- Chaos and Artificial Intelligence -- Chaotic Neural Network Basics -- Clustering Challenges -- Evolution of CNN -- Synchronization Phenomenon and Oscillatory Clusters.
,
Structure Complexity and Delaunay Triangulation -- Clustering and Classification by CNN -- Fractals and Oscillatory Dynamics -- Chaotic Neural Network and Multidiscilinarity -- Turing Ideas and Hardware Implementation of CNN -- Conclusion -- References -- An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence -- Introduction -- Sparse Signal Optimization -- Sparse Signal Pursuit -- Proximal Gradient Method -- Solving Basis Pursuit via PG -- Applications in Compressive Sensing -- Sparse Learning -- Low Rank Matrix Completion -- Low Rank Matrix Completion -- PG Optimization for MC -- MC Applications: A General Review -- Noisy Depth Maps Fusion via MC -- Low Rank Structure Learning from Corruptions -- Low Rank Structure Learning -- Illumination Decomposition via LRSL -- Discussions on Future Works -- References -- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays -- Introduction -- Related Work -- Mixed Covering Array Problem -- Proposed Approach -- Creating the Initial Solution -- Tabu List Definitions -- Neighborhood Functions -- Evaluation Function -- Stop Criterion -- Experimental Design: Analysis and Results -- First MiTS Design for MCA -- Second MiTS Design for MCA -- Third MiTS Design for MCA -- Conclusions -- References -- Part II Evolutionary Computation and Metaheuristics -- Metaheuristic Optimization: Nature-Inspired Algorithms and Applications -- Introduction -- Metaheuristics -- Metaheuristic Algorithms -- Ant Algorithms -- Bee Algorithms -- Genetic Algorithms -- Differential Evolution -- Particle Swarm Optimization -- Firefly Algorithm -- Harmony Search -- Bat Algorithm -- Cuckoo Search -- Artificial Neural Networks -- Neural Networks -- Back Propagation Algorithm -- Characteristics of Metaheuristics -- No-Free-Lunch Theorems.
,
Search for Free Lunches.
Permalink