Hypercubes and Neural Networks - PowerPoint PPT Presentation

1 / 54
About This Presentation
Title:

Hypercubes and Neural Networks

Description:

Hypercube Graph. Recursive Definition ... Inhibitory Hypercube ... or strongly stable state of the inhibitory hypercube network, respectively. ... – PowerPoint PPT presentation

Number of Views:45
Avg rating:3.0/5.0
Slides: 55
Provided by: csu5150
Category:

less

Transcript and Presenter's Notes

Title: Hypercubes and Neural Networks


1
Hypercubes and Neural Networks
  • bill wolfe
  • 9/21/2005

2
(No Transcript)
3
(No Transcript)
4
(No Transcript)
5
(No Transcript)
6
(No Transcript)
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
Modeling
21
activation level
Net Input
22
Saturation
0 lt ai lt 1
23
Dynamics
daj/dt Netj (1-aj)(aj)
24
3 Neuron Example
25
Brain State lta1, a2, a3gt
26
Thinking
27
Binary Model
aj 0 or 1
Neurons are either on or off
28
Binary Stability
aj 1 and Netj gt0 Or aj 0 and Netj lt0
29
Hypercubes
30
(No Transcript)
31
(No Transcript)
32
4-Cube
33
4-Cube
34
(No Transcript)
35
(No Transcript)
36
5-Cube
37
5-Cube
38
5-Cube
39
(No Transcript)
40
Hypercube Computer Game
http//www1.tip.nl/t515027/hypercube.html
41
Hypercube Graph
2-Cube
Adjacency Matrix
42
Recursive Definition

43
Eigenvectors of the Adjacency Matrix
Theorem 1 If v is an eigenvector of Qn-1 with
eigenvalue x then the concatenated vectors
v,v and v,-v are eigenvectors of Qn with
eigenvalues x1 and x-1 respectively.
44
Proof

45
Generating Eigenvectors and Eigenvalues
46
Walsh Functions for n1, 2, 3
47
(No Transcript)
48
(No Transcript)
49
eigenvector
binary number
1 1 1 1 -1 -1 -1 -1
000 001 010 011 100 101 110 111
50
n3
51
Theorem 3 Let k be the number of 1 choices in
the recursive construction of the eigenvectors of
the n-cube. Then for k not equal to n each
Walsh state has 2n-k-1 non adjacent subcubes of
dimension k that are labeled 1 on their
vertices, and 2n-k-1 non adjacent subcubes of
dimension k that are labeled -1 on their
vertices. If k n then all the vertices are
labeled 1. (Note Here, "non adjacent" means the
subcubes do not share any edges or vertices and
there are no edges between the subcubes).
52
n5, k 3
n5, k 2
53
Inhibitory Hypercube
54
Theorem 5 Each Walsh state with positive, zero,
or negative eigenvalue is an unstable, weakly
stable, or strongly stable state of the
inhibitory hypercube network, respectively.
Write a Comment
User Comments (0)
About PowerShow.com