[Note] If you find "OK" in your column result, you may proceed to exam!
=====================================================================================================
AI-9 Group-1          Sep            Oct       Nov|(additional)            total    total    
Monday 08:10-11:20    01   15   29   13   27   10 | 17  20  24  26  27   points attendances => result
--------------------------------------------------|--------------------------------------------------
Oxremyuk   Danil      2.5  3.5  3    4%   3    2.5|         5.5          24          7           OK
Kurgan     Andrey     2.5  5    3.5  -    2.5  3.5| 3.5     4            24.5        7           OK
Medvedskij Konstantin 2.5* 4    5    4    4    4  |         6            29.5        7           OK
Mixno      Egor       3.5* 3.5  2.5  4    4    4.5| 4.5                  26.5        7           OK
Karinkov   Anatolij   2.5  2.5  2.5  4    4    3  | 4       5.5          28          8           OK
Radkovich  Andrej     3.5% 3.5  3    3.5  3.5  3.5|         5.9          26.5        7           OK
Begeza     Konstantin 3.5% 3$   3.1@ -   -    -   | 3    5  4   4.5  4.5 30.6        8           OK
  %=>11/03 (Lucky dog two sausages); $=>11/13 (All one); 
  11/17=> IPD; 11/20=> Lucky dog; 11/24=> optimization of 3D function; 
  11/26=> TSP; 11/27=> Lucky dog with 4 sausages
-----------------------------------------------------------------------------------------------------
(1) All One Problem with "1" and "0" both 50 %
(2) Minimization of Rustrigin function -5 < x_i < 5 in 20-D and 2-D
(3) TSP with N=4,5,6,7... random location in (0,0)-(1000,1000)
       - create coordinates of N cities at random => calculat distance matrix
         => calculate distance of all the possible tours and pick up shortest one
         => when found N is almost too big to do the above try with evolution!
(4) Lucky dog for 4 sausages at (200,200),(200,800),(800,800),(800,200)
       with (i) Fitness Share and/or (ii) Crowding
(5) Dimension Reduction from 30 points on hyersphere surface in 8-D to 2-D space
(6) Evolving Neural Network (7-7-1) to solve 7-even-parity
------------------------------------------------ 
*=>09/08; %=>11/03; $=>11/13; @=>11/17; &=>11/20
------------------------------------------------------------------------------------------
additional for Begeza, Archom, Pokalo
11/17=> IPD, 11/24=> two 3D functions minimization; 11/27=> Lucky-dog with 4 sauages
==========================================================================================
AI-9 Group-2          Sep       Oct       Nov     |(additional) Dec        total    total
Monday 08:10-11:20    08   22   06   20   03   17 | 24   26   27   11   17 points attendance => result
--------------------------------------------------|--------------------------------------------
Borisyuk   Sergej     2.5  4    2.5  2    4    4.8| 5.5                    25.3       7          OK
Dashkevich Aleksandr  2.5  4    2.5  2.5# 4    4.8| 6                      26.3       7          OK
Kozeko     Elena      4.5  5    5    4.5  4.5  3  |                        26.5       6          OK
Kontsevich Bladislav  4%   5    3    4*   4    4  | 5.9                    29.9       7          OK
Kuznetsov  Aleksandr  4    4.5  5    3    4.2  4  | 4.5                    29.2       7          OK
Lavrenyuk  Maksim     4.5  -    5    4    4.2  5  | 4                      26.7       7          OK
Shamshur   Andrej     4.2  4.5  2.5  2.5  4    4.7| 6                      28.4       7          OK        
Pokalo     Sergej     -    2.5  2.5  3.5# 2.5  2.5| 3         3    3.5  5  25.5       9          OK
Trofimuk   Artyom     2.5  2.5  2.5  5&   4*   3  | 3    5    5            32.5       9          OK
   *=>10/27 optimize 3D function; &=>11/20:(luckey-dog); #=>11/26(TSP)
   11/24=> optimization of 3D function; 11/26=> TSP; 11/27=> Lucky dog with 4 sausage
----------------------------------------------------------
Pokalo's report sent by email was not the task of the day!
------------------------------------------------------------------------------------------------
(1) All One Problem with "1" being 20 %; then 1% still have time
(2) Lucky Dog: dogs start with (500,500) looking for one sausage at (200,800)
       in the troidal field (0,0)-(1000,1000)
(3) y=sin^6(5*pi*x) with (i) Fitness Sharing or (ii) Crowding algorithm
(4) Iterated Prisonner's Dilemma (IPD): The best evolved chromosome vs.
       (i) Random, (ii) Always Yes, (iii) Always No, and (iv) Tit-for-Tat
    Show fitness-generation 4 example game above with 12 innings with 1st 3 games being random
(5) Lucky dog with two sausage in a T-shape land
(6) Neural-network for 7-even-parity with 7-7-1 structure
--------------------------------------------------|-----------------------------------------------
*=>10/27; %=>11/10; &=>11/20;   
==================================================================================================
[Previous Notes]
Those who are not fulfil two conditions should come to 310 on 24 Nov