{"id":1510,"date":"2022-02-16T14:40:27","date_gmt":"2022-02-16T14:40:27","guid":{"rendered":"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/?page_id=1510"},"modified":"2022-10-03T19:39:22","modified_gmt":"2022-10-03T19:39:22","slug":"inteligenta-artificiala-2021-2022","status":"publish","type":"page","link":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/research\/all-years\/inteligenta-artificiala-2021-2022\/","title":{"rendered":"Inteligenta artificiala 2021-2022"},"content":{"rendered":"<div><\/div>\n<div>\n<p>Salut&#8230;daca ati ajuns aici, mai faceti inca un pas si dati join pe MsTeams la grupul cu codul c7mt8zz. Multumesc!<\/p>\n<p>Vom folosi platforma MsTeams pentru activitatea din acest semestru la disciplina AI.\u00a0\u00a0Daca, din motive tehnice, MsTeams nu functioneaza, ne vom auzi si vedea pe zoom (link-ul spre meeting va fi aici).<\/p>\n<p>&nbsp;<\/p>\n<p>&#8230;. sa incepem &#8220;sa ne dam cu bicicleta&#8221;\u00a0&#x1f6b2;<\/p>\n<p>Cerinte:<\/p>\n<ul>\n<li>inscrierea in grupul MsTeams (vezi mai sus)<\/li>\n<li>consultarea materialelor specifice &#8211; detalii [<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\" target=\"_blank\" rel=\"noopener\">aici<\/a>]<\/li>\n<li>participarea activa la cursuri si laboratoare\n<ul>\n<li>participare activa la laborator = intrare in meeting-ul online AND rezolvare quiz AND discutii despre munca realizata<\/li>\n<li>prezenta la laborator = rezolvarea unui quiz pe tematica laboratorului<\/li>\n<\/ul>\n<\/li>\n<li>realizarea si prezentarea proiectului (aplicatie si documentatie)<\/li>\n<\/ul>\n<p>Nota:<\/p>\n<ul>\n<li>nu este permisa inregistrarea activitatilor didactice.\u00a0Conform LEN 2011, inregistrarea prin orice procedee a activitatii didactice poate fi facuta numai cu acordul profesorului.<strong><br \/>\n<\/strong><\/li>\n<\/ul>\n<p>Echipa:<\/p>\n<ul>\n<li>noi (Laura Diosan, Alexandra Todericiu, Gabi Mircea, Bogdan Mursa, Alexandru Pirvu, Rares Iova)<\/li>\n<li>voi, studentii<\/li>\n<\/ul>\n<p>Evaluare:<\/p>\n<ul>\n<li>pe baza punctelor acumulate la curs, laborator, proiect si examenul din sesiune<\/li>\n<\/ul>\n<\/div>\n<div>\n<table border=\"3\" width=\"660\">\n<tbody>\n<tr>\n<td width=\"510\"><strong>Evaluare (<span style=\"color: #ff0000;\">toate assertiunile trebuie respectate<\/span>)<\/strong><br \/>\nASSERT (NrPrezenteLab &gt;= 10)<br \/>\nASSERT (NrPuncteUnLaboratorPredat &gt;= LimMinimaLab)<br \/>\n<span style=\"color: #ff0000;\">ASSERT (existaMinim8LaboratoarePredate == True)<\/span><br \/>\nASSERT (nrPunctePeUnLaboratorNepredat == 0)<br \/>\nASSERT (600 &lt;= nrPuncteExamenScris &lt;= 2000)<\/td>\n<td width=\"120\"><strong>Punctaj <\/strong><br \/>\n&lt;2500<br \/>\n[2 500, 3 000]<br \/>\n[3 001, 4 500]<br \/>\n[4 501, 6 000]<br \/>\n[6 001, 7 000]<br \/>\n[7 001, 7 500]<br \/>\n&gt;7 500<\/td>\n<td width=\"30\"><strong>Nota<\/strong><br \/>\n<strong>4<\/strong><br \/>\n<strong>5<\/strong><br \/>\n<strong>6<\/strong><br \/>\n<strong>7<\/strong><br \/>\n<strong>8<\/strong><br \/>\n<strong>9<\/strong><br \/>\n<strong>10<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>Reguli<\/strong>\u00a0[<a href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/rules.pdf\" target=\"_blank\" rel=\"noopener\">link<\/a>]<\/p>\n<p><strong>Situatie punctaje [<\/strong><a href=\"https:\/\/ubbcluj-my.sharepoint.com\/:x:\/g\/personal\/laura_diosan_ubbcluj_ro\/ESY3zikFuKNDiu-5R2FyBjwBW8XiDgs47jwezXgk6p_wOw?e=4UDyTo\" target=\"_blank\" rel=\"noopener\">link<\/a>]<\/p>\n<\/div>\n<div><\/div>\n<div>Fiecare student trebuie sa respecte urmatorii pasi in derulararea laboratoarelor:<\/div>\n<div>\n<ol>\n<li>Consemnarea prezentei la laborator &#8211; in cazul laboratoarelor &#8220;remote&#8221;, prezenta inseamna participarea in sesiunea online initiata de cadrul didactic si efectuarea activitatii specifice (probleme de implementat pe loc, quiz-uri, etc)<\/li>\n<li>Se realizeaza tema.<\/li>\n<li>Se creaza un cont de GitHub (<a href=\"http:\/\/www.github.com\">github.com<\/a>) unde se va incarca (intr-un repository) proiectul aferent temei primite la laborator. Contul creat se va folosi pentru toate temele de laborator.<\/li>\n<li>Se accepta invitatia de participare la GitHub-ClassRoom aferenta fiecarei teme de laborator (link existent in tabelul cu planificarea materiei pe saptamani din pagina de cs a cursului) si se conecteaza cu contul de Github si cu userul de acces in reteaua facultatii.<\/li>\n<li>Se prezinta tema cadrului didactic in cadrul sesiunilor live folosind medii de comunicare face-to-face sau on-line si, dupa caz si la nevoie,\u00a0se poate folosi editorul Visual Studio Code (<a href=\"https:\/\/code.visualstudio.com\/\">https:\/\/code.visualstudio.com\/<\/a>) cu extensia corespunzatoare limbajului folosit (<a href=\"https:\/\/code.visualstudio.com\/docs\/languages\/overview\">https:\/\/code.visualstudio.com\/docs\/languages\/overview<\/a>) cu optiunea Live Share (<a href=\"https:\/\/code.visualstudio.com\/blogs\/2017\/11\/15\/live-share\">https:\/\/code.visualstudio.com\/blogs\/2017\/11\/15\/live-share<\/a>)<\/li>\n<li>Se incarca codul proiectului in GitHub classroom respectand termenele de predare.\n<ul>\n<li>pentru fiecare tema va exista in gitclassrooom un assignment, respectiv un repo pentru fiecare student<\/li>\n<li>fiecare tema trebuie incarcata in repo-ul aferent astfel:\n<ul>\n<li>pana la finalul laboratorului prevazut ca deadline &#8211; pentru evaluare obisnuita &#8211; sau<\/li>\n<li>pana la finalul urmatorului laborator (dupa cel prevazut ca deadline) &#8211; pentru evaluare cu penalizare de 10% intarziere;<\/li>\n<li>pana la finalul urmatorului urmatorului laborator (dupa cel prevazut ca deadline) &#8211; pentru evaluare cu penalizare de 20% intarziere;<\/li>\n<li>dupa expirarea acestui termen, nu se mai evalueaza temele incarcate<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/li>\n<li>Pentru gestiunea mai usoara a materialelor incarcate, se recomanda folosirea unei aplicatii de versionare (fie facilitatile oferite de VS Code <a href=\"https:\/\/code.visualstudio.com\/docs\/editor\/versioncontrol\" target=\"_blank\" rel=\"noopener\">link<\/a>, fie aplicatii de genul SourceTree <a href=\"https:\/\/www.sourcetreeapp.com\/\" target=\"_blank\" rel=\"noopener\">link<\/a>)<\/li>\n<li>Identificarea unor proiecte similare incarcate de 2 sau mai multi studenti va determina acordarea unui punctaj egal cu 0 (zero) puncte pentru acele teme tuturor studentilor implicati.<\/li>\n<\/ol>\n<\/div>\n<table style=\"height: 1858px;\" border=\"0\" width=\"879\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">Sapt<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Curs<\/span><\/td>\n<td width=\"338\"><span style=\"color: #000000;\">Bibliografie<\/span><\/td>\n<td width=\"100\"><span style=\"color: #000000;\">Lab<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S1<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Organizatorice &#8211; [<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/tree\/main\/2021-2022\/lectures\/00_admin.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/span><br \/>\n<span style=\"color: #000000;\"> Introducere \u00een IA &#8211; [<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/tree\/main\/2021-2022\/lectures\/01_introAI.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]\u00a0<\/span><br \/>\n<span style=\"color: #000000;\"> Metode de c\u0103utare &#8211; [<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/tree\/main\/2021-2022\/lectures\/01_search_uninformed.pdf\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; metode neinformate si informate, Hill Climbing, Simulated Annealing, Tabu Search<\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele I.1, I.2, II.3, II.4 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele 1 &#8211; 4 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele 2.1 \u2013 2.5 din <a style=\"color: #000000;\" href=\"http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/\">http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/<\/a><\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi simpli [<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab01\/AI-lab01.md\" target=\"_blank\" rel=\"noopener\">md<\/a>][<a href=\"https:\/\/classroom.github.com\/a\/Bstf3nuo\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S2<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Metode de c\u0103utare<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; Algoritmi Evolutivi\u00a0\u00a0<\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">suplimnetar despre alti AE\u00a0<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 14 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1998<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 7.6 din A. A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul 9 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi euristici\u00a0 [<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab02\/AI-lab02.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/JhGfCuun\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S3<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Metode de c\u0103utare- Algoritmi inspira\u0163i de furnici, algoritmi inspira\u0163i de inteligen\u0163a de grup)\u00a0&#8211;\u00a0[]<\/span><\/p>\n<p><span style=\"color: #000000;\">Metode de c\u0103utare adversial\u0103\u00a0&#8211;\u00a0[]<\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 16 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">James Kennedy, Russel Eberhart, Particle Swarm<br \/>\nOptimisation, Proceedings of IEEE International Conference<br \/>\non Neural Networks. IV. pp. 1942\u20131948, 1995<br \/>\n(05_ACO_PSO\/PSO_00.pdf)<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Marco Dorigo, Christian Blum, Ant colony optimization<br \/>\ntheory: A survey, Theoretical Computer Science 344 (2005)<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul II.5 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 6 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi evolutivi\u00a0 [<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab03\/AI-lab03.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/m1yEbDQs\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S4<\/span><\/td>\n<td width=\"349\">\u00a0\u00a0<span style=\"color: #000000;\">Invatare automata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; problematica\u00a0\u00a0[]<\/span><\/td>\n<td rowspan=\"7\" width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul VI (18) din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 8 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 10, 11, 12, 13, 15 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul V din D. J. C. MacKey, Information Theory, Inferenceand Learning Algorithms, Cambridge University Press, 2003<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul 3 si 4 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">Algoritmi evolutivi (2)\u00a0 [<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab04\/AI-lab04.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/aHNhYlpl\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">\u00a0Invatare automata supervizata<br \/>\n&#8211; algoritmi (least square, gradient descent, logistic regression)\u00a0\u00a0\u00a0[]<\/span><\/td>\n<td width=\"100\">\u00a0Algoritmi ACO\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab05\/AI-lab05.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/xnwXrU8r\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S6<\/span><\/td>\n<td width=\"349\">\u00a0<span style=\"color: #000000;\">Invatare automata supervizata\u00a0<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (ANN)\u00a0\u00a0\u00a0[]<\/span><\/td>\n<td width=\"100\">Evaluare ML\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab06\/AI-lab06.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/1ol-j7tm\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><\/td>\n<td width=\"349\"><\/td>\n<td width=\"100\">Metoda celor mai mici patrate\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab07\/AI-lab07.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/rXZHECJv\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S8<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (ANN &#8211; partea 2 )\u00a0[]<\/span><\/td>\n<td width=\"100\">Gradient Descrescator\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab07\/AI-lab07.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/BAWXnxk2\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S9<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (SVM, GP, kNN, DT)\u00a0[]<\/span><\/td>\n<td width=\"100\">Regresie logisitca \u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab09\/AI-lab09.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/B-B3PGBk\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S10<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata nesupervizata\u00a0[]<\/span><\/td>\n<td width=\"100\">ANN\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab10\/AI-lab10.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/jC1ijI4j\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S11<\/span><\/td>\n<td width=\"349\">Sisteme bazate pe reguli \u00een medii certe [<span style=\"color: #000000;\">]<\/span> si incerte\u00a0[<span style=\"color: #000000;\">]<\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small;\">capitolul III din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 4 \u015fi 5 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 2 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 6 \u015fi 7 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul V din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 3 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 8 \u015fi 9 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n<td width=\"100\">kMeans\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab11\/AI-lab11.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/XKECbeuw\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S12<\/td>\n<td width=\"349\">\u00a0Aplicatii []<\/td>\n<td width=\"338\"><\/td>\n<td width=\"100\">Emotions\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab12\/AI-lab12.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/bgUaRVd0\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S13<\/td>\n<td width=\"349\"><\/td>\n<td width=\"338\"><\/td>\n<td width=\"100\">User analytics\u00a0[<a style=\"color: #000000;\" href=\"https:\/\/github.com\/lauradiosan\/AI-UBB\/blob\/main\/2021-2022\/labs\/lab13\/AI-lab13.md\" target=\"_blank\" rel=\"noopener\">md<\/a>] [<a href=\"https:\/\/classroom.github.com\/a\/rtGCa7fT\" target=\"_blank\" rel=\"noopener\">git<\/a>]<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S14<\/td>\n<td width=\"349\"><\/td>\n<td width=\"338\"><\/td>\n<td width=\"100\"><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Salut&#8230;daca ati ajuns aici, mai faceti inca un pas si dati join pe MsTeams la grupul cu codul c7mt8zz. Multumesc! Vom folosi platforma MsTeams pentru activitatea din acest semestru la disciplina AI.\u00a0\u00a0Daca, din motive tehnice, MsTeams nu functioneaza, ne vom auzi si vedea pe zoom (link-ul spre meeting va fi aici). &nbsp; &#8230;. sa incepem [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":32,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1510"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/comments?post=1510"}],"version-history":[{"count":13,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1510\/revisions"}],"predecessor-version":[{"id":1550,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1510\/revisions\/1550"}],"up":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/32"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/media?parent=1510"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}