diff --git a/src/lab/exp10/Illustration.html b/src/lab/exp10/Illustration.html index 000cd59e8..0022410aa 100644 --- a/src/lab/exp10/Illustration.html +++ b/src/lab/exp10/Illustration.html @@ -105,10 +105,10 @@
Consider N=4 points as shown in Figure 1 (a). The distances between each pair of points is given in Figure 1 (b).
-![]() |
-![]() |
+![]() |
+![]() |
| Figure 1 (a) | @@ -116,11 +116,11 @@
The possible pairing of points are given in Figures 2 (a) to 2 (c).
-![]() |
-![]() |
-![]() |
+![]() |
+![]() |
+![]() |
| Figure 2 (a): L=7.2 | diff --git a/src/lab/exp8/Illustration.html b/src/lab/exp8/Illustration.html index c90c6ced7..13351f9fe 100644 --- a/src/lab/exp8/Illustration.html +++ b/src/lab/exp8/Illustration.html @@ -117,10 +117,10 @@
-![]() |
For the travelling salesman problem of 50 cities, we consider
@@ -132,11 +132,9 @@
-![]() |

Observe the output of the network for different number of cities. Start from a small number of cities (such as 10), and go up diff --git a/src/lab/exp8/Tutorial.html b/src/lab/exp8/Tutorial.html index e7a62d1d9..cdec4ad15 100644 --- a/src/lab/exp8/Tutorial.html +++ b/src/lab/exp8/Tutorial.html @@ -127,10 +127,10 @@
-![]() |
The training of SOM is based on the principle of competitive learning (Refer experiment 7, Artificial Neural Networks virtual labs).