Cellular Automata Based Hamming Hash Family : Synthesis and Application CELLULAR AUTOMATA BASED HAMMING HASH FAMILY : SYNTHESIS AND APPLICATION Niloy Ganguly.

Slides:



Advertisements
Similar presentations
Pattern Recognition and Machine Learning
Advertisements

The Inverse Laplace Transform
NEURAL NETWORKS Perceptron
Experiments and Variables
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Curve Fitting ~ Least Squares Regression Chapter.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Flip-Flops and Related Devices Wen-Hung Liao, Ph.D.
Introduction to Training and Learning in Neural Networks n CS/PY 399 Lab Presentation # 4 n February 1, 2001 n Mount Union College.
Tuomas Sandholm Carnegie Mellon University Computer Science Department
Combinational Logic and Verilog. XORs and XNORs XOR.
Study of a Paper about Genetic Algorithm For CS8995 Parallel Programming Yanhua Li.
1. Elements of the Genetic Algorithm  Genome: A finite dynamical system model as a set of d polynomials over  2 (finite field of 2 elements)  Fitness.
An Illustrative Example
Three Other Types of Counters (BCD Counter, Ring Counter, Johnson Counter) Hun Wie (Theo) SJSU, 2011 Spring Prof: Dr. Sin-Min Lee CS147 Computer Organization.
Digital Logic Design CHAPTER 5 Sequential Logic. 2 Sequential Circuits Combinational circuits – The outputs are entirely dependent on the current inputs.
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
Generating Random Numbers in Hardware. Two types of random numbers used in computing: --”true” random numbers: ++generated from a physical source (e.g.,
CS623: Introduction to Computing with Neural Nets (lecture-10) Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay.
Dr M F Abbod Using Intelligent Optimisation Methods to Improve the Group Method of Data Handling in Time Series Prediction Maysam Abbod and Karishma Dashpande.
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 9 Sequential.
Theory and Applications of GF(2 p ) Cellular Automata P. Pal Chaudhuri Department of CST Bengal Engineering College (DU) Shibpur, Howrah India (LOGIC ON.
Governor’s School for the Sciences Mathematics Day 13.
Cellular Automata Evolution : Theory and Applications in Pattern Recognition and Classification Niloy Ganguly.
1 Machine Learning The Perceptron. 2 Heuristic Search Knowledge Based Systems (KBS) Genetic Algorithms (GAs)
Polynomial Discrete Time Cellular Neural Networks Eduardo Gomez-Ramirez † Giovanni Egidio Pazienza‡ † LIDETEA, POSGRADO E INVESTIGACION Universidad La.
Cellular Automata Based Authentication (CAA ) Monalisa Mukherjee 1 Niloy Ganguly 2 P Pal Chaudhuri 1 1 Department of Computer Science & Technology, Bengal.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
Bayesian Macromodeling for Circuit Level QCA Design Saket Srivastava and Sanjukta Bhanja Department of Electrical Engineering University of South Florida,
1 SNS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Subject: Digital communication Sem: V Cyclic Codes.
Cellular Automata based Edge Detection. Cellular Automata Definition A discrete mathematical system characterized by local interaction and an inherently.
Important Components, Blocks and Methodologies. To remember 1.EXORS 2.Counters and Generalized Counters 3.State Machines (Moore, Mealy, Rabin-Scott) 4.Controllers.
Ch 4. Linear Models for Classification (1/2) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized and revised by Hee-Woong Lim.
Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Lecture 16: Reconfigurable Computing Applications November 3, 2004 ECE 697F Reconfigurable Computing Lecture 16 Reconfigurable Computing Applications.
Niloy Ganguly Biplab K Sikdar P Pal Chaudhuri Presented by Niloy Ganguly Indian Institute of Social Welfare and Business Management. Calcutta
Cellular Automata Machine For Pattern Recognition Pradipta Maji 1 Niloy Ganguly 2 Sourav Saha 1 Anup K Roy 1 P Pal Chaudhuri 1 1 Department of Computer.
Complex Numbers, Division of Polynomials & Roots.
Molecular Scale Architectures Quantum Cellular Automata and Molecular Combinatorial Logic By Jeff Kramer.
CS851 – Biological Computing February 6, 2003 Nathanael Paul Randomness in Cellular Automata.
Computational Mechanics of ECAs, and Machine Metrics.
Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Design of a Robust Search Algorithm for P2P Networks
CES 592 Theory of Software Systems B. Ravikumar (Ravi) Office: 124 Darwin Hall.
Project funded by the Future and Emerging Technologies arm of the IST Programme Search in Unstructured Networks Niloy Ganguly, Andreas Deutsch Center for.
Artificial Intelligence CIS 342 The College of Saint Rose David Goldschmidt, Ph.D.
Department of Computer Science The University of Texas at Austin USA Joint Entity and Relation Extraction using Card-Pyramid Parsing Rohit J. Kate Raymond.
Cpe 252: Computer Organization1 Lo’ai Tawalbeh Lecture #3 Flip-Flops, Registers, Shift registers, Counters, Memory 3/3/2005.
Counters and registers Eng.Maha Alqubali. Registers Registers are groups of flip-flops, where each flip- flop is capable of storing one bit of information.
Counters In digital logic and computing, a counter is a device which stores (and sometimes displays) the number of times a particular event or process.
Govt. Engineering College- Gandhinagar. It is all about……  STATE MACHINE.
Chapter- 9 Programmable Logic Devices DHADUK ANKITA ENRL NO Noble Engineering College- Junagadh.
Semi-Supervised Clustering
Spatio-Temporal Information for Society Münster, 2014
Ch7: Hopfield Neural Model
Machine Learning Basics
Niloy Ganguly, Andreas Deutsch Center for High Performance Computing
1 Department of Engineering, 2 Department of Mathematics,
Hidden Markov Models Part 2: Algorithms
1 Department of Engineering, 2 Department of Mathematics,
1 Department of Engineering, 2 Department of Mathematics,
Department of Computer Science University of York
Comparing and Contrasting Functions
Discrete Mathematics CS 2610
The Engineering of Functional Designs in the Game of Life
Department of Computer Science & Engineering
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Cellular Automata Based Hamming Hash Family : Synthesis and Application CELLULAR AUTOMATA BASED HAMMING HASH FAMILY : SYNTHESIS AND APPLICATION Niloy Ganguly 1 Sandip Dhar 2 Anup K Roy 2 Biplab K Sikdar 2 P PalChaudhuri 2 1 IISWBM, Calcutta, West Bengal, India Department of Computer Science & Technology, Bengal Engineering College, India

Cellular Automata Based Hamming Hash Family : Synthesis and Application CELLULAR AUTOMATA A Locally Connected Network. Decentralized Control Yields Complex Computation. The paper is an illustration of the theme.

Cellular Automata Based Hamming Hash Family : Synthesis and Application HAMMING HASH FAMILY A new type of Hash Family generated by a special class of Cellular Automata - Multiple Attractor Cellular Automata(MACA). What is it ? The probability of collision between a pair of patterns, hashed in this family, varies inversely with their hamming distance. It has inherent computational capability The Hamming Hash Family(HHF) is effectively employed for the computation of average hamming distance in a large volume of data set in linear time.

Cellular Automata Based Hamming Hash Family : Synthesis and Application CELLULAR AUTOMATA A computational model with discrete cells updated synchronously ……….. CA cell - A memory element (D - flipflop) with some combinatorial logic { an XOR gate (linear) or XNOR gate (additive) or AND/OR gate (non-linear) } The state of the cell is dictated by the immediate neighbors of the cell Q CLK D Clock Combination al Logic From Left Neighbor From Right Neighbor A typical 2 - State 3 - Neighborhood CA Cell

Cellular Automata Based Hamming Hash Family : Synthesis and Application MACA - AS A HASH FUNCTION MACA - A special Class of non-group CA State transition graph of an MACA consists of a number of cyclic and non-cyclic states The set of non-cyclic states of an MACA forms inverted tree rooted at the cyclic states (attractors) A member of HHF is an MACA of n cell and forming k attractors Three neighborhood constraint of CA makes it behave as a hamming hash function

Cellular Automata Based Hamming Hash Family : Synthesis and Application MACA - AS A HASH FUNCTION MACA - 4 cell 4 attractors

Cellular Automata Based Hamming Hash Family : Synthesis and Application SYNTHESIS OF MACA Design Objective: Generate set of MACA each having n cells, k no of attractors. Each MACA a member of HHF. A probabilistic Divide and Conquer Algorithm Heuristically set k1 & k2 from k

Cellular Automata Based Hamming Hash Family : Synthesis and Application PERFORMANCE OF SYNTHESIS ALGORITHM Synthesis of MACA (Test Run = 1000). # cell (n) # attractor( k ) Hit ratio( % )

Cellular Automata Based Hamming Hash Family : Synthesis and Application AVERAGE HAMMING DISTANCE What is it ? Average Hamming Distance( AHD ) of a data set is represented as AHD = h(c i, c j )/k(k - 1) where h( c i, c j ) is the hamming distance between the pair of patterns c i, c j and k is the number of patterns in the data set. Application: Genetic algorithm, Immunology etc.

Cellular Automata Based Hamming Hash Family : Synthesis and Application RELATION BETWEEN HHF AND AHD Procedure :: Take a set of data. Calculate its AHD. Hash it in 30 members of HHF. Calculate collision.

Cellular Automata Based Hamming Hash Family : Synthesis and Application RELATION BETWEEN HHF AND AHD Observation :: Data sets having same AHD outputs same Collision.

Cellular Automata Based Hamming Hash Family : Synthesis and Application ALGORITHM FOR CALCULATING AHD For a particular cardinality of data set (say 50) Train the network with data set of various AHD Calculate Collision & obtain points (AHD,COLLISION) Draw regression line with the set of points. Take a new set & Hash it. Calculate Collision. Find AHD from the regression line with that collision.

Cellular Automata Based Hamming Hash Family : Synthesis and Application EXPERIMENTAL RESULTS Polynomial Equations & Error Mean: # cell ( n ) # Attr ( k ) Eq of Polynomial hdc-eq Error Mean E mAlgo Error Mean E mPE Y = X Y = X +0.76X (10) -4 X 3 Y = X

Cellular Automata Based Hamming Hash Family : Synthesis and Application THANK YOU