[Notes] Those who lack of total points should attend on 11th December at 11:30 at 310 Those who were given "OK" can proceed to exam on 14th December ============================================================================================================= (x1) |<-------- (x2) -------->|additional Showed result [A] AS-34 Sep Oct Nov| Dec metro-anime total total => of Thursday 08:10-11:20 03 04 | 17 01 15 29 12 | 20 26 27 11 or not? points attendance practice --------------------------------------------------------------------------------------------------------- Builina Roman 2.5 | 4.5 2.5*# ^2.6 3 - | - - - - -- 15.1 5 Golenko Dmitrii 5 | -* 3@ ^2.6 3.5 3.1| 4 3/2 4 OK 26.7 7.5 OK Katolik Alexandr - | 4.5 4 ^2.6 3 3.7| 4 3/2 4 OK 27.3 7.5 OK Bakun Anton 2.5 | - 3 ^2.6 4 3 | 4 5 OK 24.1 7 OK Koroluk Andrew 4 | 4.5 3 ^2.6 3 4.7| 4 OK 25.8 7 OK Belous Sophia 5.2 | 4.5 5 ^2.6 5 5 | OK 27.3 6 OK Evkhovich Tat'yana 4 | 4.7 - ^2.6 4.9 5 | 4 OK 25.2 6 OK Korol Andrew 5.1 | 4.6 - ^2.5 4.5 4.5| 3/2 4 OK 26.7 7 OK Kil'beda Olga 5 | 4.7 4.5 ^2.6 4.9 4.7| OK 26.4 6 OK ------------------------------------------------------------------------------------------------------------ (1-2) loop with 1000 pixels, 2 cars starting with speed = 20 from pixel = 0 and pixel = 500 (3) membership function of ONE rule, e.g., "IF speed = (slow) AND distance = (long) THEN brake = (strong) This is 4D and not possible to show by graph => So show table with 7 such as bottom of this page Show me part of this table with 10 lines, e.g., speed=20, distanc =800 and brake = 0,1,2,3,...,9 (4) Do as (3) for group C below (25 Oct) but repeat the procedure for distance=100,200,300,...,900 show me table such as the table at the bottom of this page and then 2D graphs arranged in 3D coordinate of distance-spead-break (5) Same as ones done on 8th October. (6) Classify 8 different dataset assigned each by Takagi-Sugeno Singleton Consequence rule (7) Cluster your target with 3 differnt value of alpha 0.15, 0.55 and 0.95 using Max-Min formula --- additional 11/20=>Time series prediction challenge-2; 11/26=>Time series prediction challenge-3 ------------------------------------------------------------------------ *=>showed up but too late; #=>report sent but for different grope's; i #=>11/05; &=>11/20 ^=>I was shocked to know later that all of you left an identical results and went home. I almost know who did the task seriously and who did not. But I dared to give you the idenitcal point of 2.6 Those victimized who were supoosed to be given 4 or 4.5 should say 'sorry' and 'thanks' for still being given 2.6 instead of 0. This behavior is called "plagiarizm" - crime! ============================================================================================================ |<------------ (x2) ------------>|additional Showed result [D] AS-34 Sep Oct Nov | Dec metro-anime total total => of Thusday 08:10-11:20 10 24 08 22 05 19 |20 27 11 or not? points attendance practice ------------------------------------------------------------------------------------------------------------ Kuchur Alexander 4.8 5 ^3 4.8 5 5& | OK 27.6 6 OK Lykianuk Roman 4.5* 5 ^3.5 4 2.5 5 | OK 24.5 6 OK Marchanka Ilya 5.0 5 ^5.2 5.2 5.5 5.2| OK 31.1 6 OK Omelchuk Anton 3 5 ^5 4 2.5 5 | OK 24.5 6 OK Patseyuk Dzmitry 4.5 5.2 ^5 5 2.5 5 | OK 27.2 6 OK Repeiko Dmitry 3 5.2 ^5 4 2.5 5 | OK 24.7 6 OK I Sobotovich Dmitry 3 4.9 ^2.5 4.5& 2.5 5 | 3/2 4 OK 27.9 7.5 OK Soloduha Pavel 4.0 5.1 ^5 4 3 5.2| OK 26.3 6 OK Torgasheva Olga 3 5 ^5 5 2.5 5 | 4 OK 29.5 7 OK Yanuschuk Dmitry 3 4.5& ^3.5 4 3 5 | 3/2 OK 24.5 6.5 OK ------------------------------------------------------------------------------------------------------------- (1) speed should be added -1/-2/-3/-4/-5/0/1/2/3/4/5 at random & break = 10 iff distance < 10 (2) Calculate one break value from center of gravity of 11 values corresponding to one pair of (speed, distance) under 3 rules of {IF speed=() AND distance=() THEN break=()} (3) Same as ones done on 2nd October but with 10 different distance, i.e., 100,200,300,...,900 (4) Iris data classification from 25 samples of A, B and C. (i) design 3 Gaussian membership, (ii) 6 rules, (iii) create algorithm deciding y from x1,x2,x3,x4 using Takagi-Sugeno (iii) show success rate, i.e. No.of.OK/75 (5) Cluster with fuzzy proximity relation (6) Cluster your target, e.g., Russian alphabet with alpha=0.55 using Max-Min formula -------- *=>09/17; &=>11/20 ============================================================================================================= (x1)|<---------- (x2) ---------->|(x1)|additional Showed result [B] AS-35 Sep Oct Nov | metro-anime total total => of Friday 11:30-15:00 03 | 18 02 16 30 13 | 27 | or not? points attendance practice ------------------------------------------------------------------------------------------------------------- Bokhanov Evgenii 5.2 | 7 5 ^4 5.2 5.2| 6 | OK 34.6 6 OK Vechorko Anna 5 | 5 5 ^4 4.9 5 | 6 | OK 31.9 6 OK Godun Aleksandr 5 | 5 3 ^4 3& 4.5| 6 | OK 27.5 6 OK Zakharov Andrei 5 | 5 3 ^3.5 4& 5 | 6 | OK 28.5 6 OK Kotov Oleg 5 | 7 5 ^4 5 5 | 6 | OK 34 6 OK Leonovec Vasilii 5 | 5 4 ^4 4.9 4.7| 6 | OK 30.6 6 OK Lubiako Dmitrii 5 | 5 3 ^4 5 4.5| 3 | OK 28 6 OK Lutych Roman 4.5 | 4.9 4.5 ^4 5 4 | 6 | OK 29.9 6 OK Magomedova Aminat 4.5#| 5 2.5 ^4 4.8 5 | 6 | OK 28.8 6 OK Pavlukovich Ivan 4.5 | 5 4.5 ^4 3.5 4.5| 6 | OK 29 6 OK Sanchuk Aleksandr 5 | 5 4 ^4 4.9 5 | 6 | OK 30.9 6 OK Sobolev Igor 5 | 7 5 ^4.9 5.2 5 | 6 | OK 35.1 6 OK -------------------------------------------------------------------------------------------------------------- Total points = p2+p3+p4+p5+p6+(p1+p7)/2 ------------------------------------------------------------------------------------------------------------ (1) speed should be added -1/-2/0/1/2 at random with no brake. If crash stop animation! (2) Membership function of two ruled of the form [IF speed=() AND distance=() THEN brake=()] (3) Same as ones done on 1st October but 10 rules instead of 3 (4) same as last time but division of speed sould be more than 10, e.g., 5,10,15,20,25,...,60 (5) Same as the one on 22 Oct, but use linear-combination consequence instead of singleton, such as (6) Cluster your target with alpha=0.55 using MAX-PROD, MAX-AVG and MAX-Delta formula -------- *=>09/04; #=>11/06; &=>11/20 ============================================================================================================= (x1) |<---------- (x2) ---------->|(x1)|aditional Showed result [C] AS-35 Sep Oct Nov | metro-anime total total => of Friday 11:30-15:00 04 | 11 25 09 23 06 | 20 | 27 or not? points attendance practice ----------------------------|---------------------------------------------------------------------------------- Radchuk Aliona 6 | 3.5 4.9 ^4 5 6 | 4 | OK 28.4 6 OK Supruniuk Darya 5 | 4 4.9 ^4 3.5 4.5| 4 | OK 25.4 6 OK Kivachuk Aliaksandra 5 | 4 4.9 ^4 5 4.5| 4 | OK 26.9 6 OK Chepeleu Kiryl 5 | 3.7 4.9 ^4 5 4.5| 4 | OK 26.6 6 OK Denisenko Viktor 5 | 3.4 4.9 ^4 3.5 3.5| 4 | OK 24.3 6 OK Kabachuk Dmitry 5 | 3.5 4.9 ^3.5 5 3.5| 4 | OK 24.9 6 OK Verenich Dmitry 5 | 3.5 4.9 ^4 3.5 4.5| 4 | OK 24.9 6 OK Derevnyuk Viktor 5 | 3.4 4.9 ^4 3.5 4.5| 4 | OK 24.8 6 OK Shevchenko Alexandr 5 | 3 4.9 ^4 3.5 4 | 4 | 3/2 OK 25.4 6.5 OK Dongotarov Ilia 5 | 3.5 4.9 ^4.5 3.5 3 | 4 | 3/2 OK 25.4 6.5 OK Garah Alexey 5 | 3 4* ^4 3.5 4.5| 4 | 3/2 OK 25 6.5 OK ------------------------------------------------------------------------------------------------------------ Total points = p2+p3+p4+p5+p6+(p1+p7)/2 ------------------------------------------------------------------------------------------------------------ (1) speed should be added -1/-2/0/1/2 at random with no brake. If crash stop animation! (2) 3D membership function of, e.g., {Speed=(slow) AND Distance=(long)} using membership function of each (3) Calculate one break value from center of gravity of 11 values corresponding to one pair of (speed, distance) under 3 rules of {IF speed=() AND distance=() THEN break=()} Repeat the above 11 times for speed=0,6,12,18,24,30,36,42,48,54,60 while distance=200, e.g. as constant. Then show me the graph of speed vs. brake hopefully in 3D space. (4) for 10 rules instead of 3, do the above with distance being 100,200,300,...,900 with each of these 9 distances speed being 5,10,15,20,...,60 then create 3D-surface of (distance-speed-brake) with 108 points. Show me (i) 10 rules (ii) part of big table, (ii) whole smalle table, and (iV) 3D graph. All in JPG (5) Same as the one on 22 Oct, but use provabilistic consequence instead of singleton (6) Cluster your target, e.g., Russian alphabet with alpha=0.55 using Max-Min formula (7) Time series prediction challenge-2 ----- *=>11/12 ============================================================================================================= Comment about the work and result on 09/11: * To get a high point, Be original or be first!!! Even a good result would get fewer points. If similar results or copy are reported by others, points of those results will be reduced. * Take a time to make your result beautiful. Just a screen-copy will not have a good point. * Even task has not completed show a part of what you have done! Note on 09/17: -------------------------------------------------------- speed mu distance mu break mu | mu overall -------------------------------------------------------- 0 0 0 0 0 0 | 0 0 0 0 0 1 0 | 0 . . . . . . | 0 . . . . . . | 0 . . . . . . | 0 20 0.3 800 0.7 6 0.2| min(0.3,0.7)*0.2=0.06 . . . . . . | 0 . . . . . . | 0 . . . . . . | 0 40 0 1000 0 9 0 | 0 -------------------------------------------------------- Note on 10/01: ==================== distance spead break -------------------- 100 10 ? 100 20 ? 100 30 ? . . . 100 60 ? ------------------ 200 10 ? . . . . . . . . . 900 60 ? ==================== Note on 11/30 IF x1=() & x2=() & x3=() & x4=() THEN y_1=a1*x1 + a2*x2 + a3*x3 + a4*x4 IF x1=() & x2=() & x3=() & x4=() THEN y_2=a1*x1 + a2*x2 + a3*x3 + a4*x4 ..................................... ..................................... IF x1=() & x2=() & x3=() & x4=() THEN y_6=a1*x1 + a2*x2 + a3*x3 + a4*x4 where,in case of 6 rules, 24 ai should be specified, for example (you should determine) a1 a2 a3 a4 Rule-1 0.8 0.8 0.4 0.1 Rule-2 0.5 0.4 0.7 0.2 Rule-3 0.2 0.7 0.7 0.8 Rule-4 0.2 0.2 0.4 0.9 Rule-5 0.7 0.4 0.4 0.5 Rule-6 0.9 0.1 0.9 0.5 you should show the table x1 | x2 | x3 | x4 | y=(M1*y1+M2*y2+...+M6*y6)/(M1+M2+...+M6)| class | OK or NOT ------------------------------------------------------------------------------- .65 |.80 |.20 |.08 | | 1 | OK .62 |.68 |.20 |.08 | | 3 | NO Give (i) 3 graph of membership. (ii) 6 rules. (iii) matrix of [a_ij]. (iv) exe. (v) table of OK or NOT Notes on 05 Nov: How can I evaluate your report via email without knowing your effort during 190 minutes of practice time at 310? - Those who didn't put intermediate result to my Ubuntu PC were given only 2.5 for this reason. Notes on 06 Nov: Someone rebooted my Ubunto PC at 310. Don't worry, however, all the files was always archived in the BSTU server Now (on 10 Nov) I'm working at 310. But unfortunatery, the folder whose name include " " (space) cannot be accessed by primitive ftp operation All of us should know this traditional protocol. Don't get accustomed to MicroSoft convention! Mamma Mia! Note recently - Points after ^ are result of the common task for all four groups. So evaluated from comparison of all results - Now you should demonstrate your metro-animation by finding time and visit me at 310 !!! ALL OF YOU GET 'OK' FOR THIS IN THE TABLE BELOW !!! Lecture on 07 December will not be made. Each of you prepare for the exam!