Pristupno predavanje za izbor docenta za užu naučnu oblast Računarstvo i informatika

Pristupno predavanje u okviru konkursa za izbor jednog docenta  za užu naučnu oblast: Računarstvo i informatika

Na konkurs se prijavilo  2 kandidata
Kandidati: dr Stefan Mišković i dr Sead Mašović

Naslov predavanja: „Dinamičko programiranje”

Datum, vreme i mesto održavanja:  28. 6.  2024. godine  u 11 časova na Matematičkom fakultetu (Studentski trg 16). 

Članovi komisije:   

1. dr Filip Marić, red. prof.
2. dr Miroslav Marić, red.prof.
3. dr Zoran Ognjanović, naučni savetnik MI SANU

Datum objavljivanja: 12. 6. 2024. godine

 

detaljnije

Konferencija posvećena Kosti Došenu na MI SANU, 13. i 14. jun 2024.

U Matematičkom institutu u Beogradu 13. i 14. juna 2024. u sali 301f biće održana konferencija u čast pokojnog Koste Došena, istaknutog matematičara i filozofa. Govoriće brojni prijatelji, studenti i kolege.

Program skupa je dostupan na ovom linku:
https://www.mi.sanu.ac.rs/novi_sajt/news/news_pages/kosta70prg.pdf

Prenos skupa možete pratiti na ovom linku:
https://miteam.mi.sanu.ac.rs/call/5jazssgYAMXyj2qt9/YeOnxFBePovXifQ5vbTXpET0RqBuTwCk3eFD6pAZHY4

detaljnije

Seminar za simplektičku topologiju, 11. jun 2024.

Naredni sastanak Seminara za simplektičku topologiju biće održan u utorak, 11. juna 2024, u sali 840 Matematičkog fakulteta sa početkom u 17 časova.

Predavač: Frol Zapoljski

Naslov predavanja: ON THE CONTACT MAPPING CLASS GROUP OF THE CONTACTIZATION OF MILNORʼS A_m-FIBERS

Apstrakt:
The symplectic isotopy problem for a given symplectic manifold is determining which symplectomorphisms are smoothly isotopic to the identity, but not through symplectomorphisms. Equivalently, this problem concerns the size of the kernel of the natural homomorphism from the symplectic mapping class group to its smooth counterpart. An analogous problem can be posed for a given contact manifold. On the symplectic side, a beautiful construction due to Khovanov-Seidel yields an embedding of the braid group on m+1 strands into the symplectic mapping class group of Milnorʼs A_m-fiber, which is a certain smooth affine variety in any complex dimension at least 2. Moreover, they show that the aforementioned kernel is always large, with its size depending on the dimension. On the contact side we consider the contactization of the Milnor fiber, and show that the composition of the Khovanov-Seidel embedding with a natural lifting homomorphism from the symplectic mapping class group of the fiber to the contact mapping class group of its contactization is injective. In particular, we obtain large subgroups of the contact mapping class group which are smoothly trivial. The proof uses a partially linearized version of the Chekanov-Eliashberg Legendrian contact homology for two-component Legendrian links. Joint work with Sergei Lanzat.

detaljnije

Seminar Odlučivanje - teorija, tehnologija, 13. jun 2024.

Naredni sastanak Seminara biće održan onlajn u četvrtak, 13. juna 2024. sa početkom u 13 časova.

Predavač: Tatjana Davidović, Mathematical Institute of the Serbian Academy of Sciences and Arts

Naslov predavanja: PROOF-OF-USEFUL-WORK CONSENSUS PROTOCOL BASED ON SOLVING REAL-LIFE OPTIMIZATION PROBLEMS
 
Apstrakt: BlockChain (BC) is a distributed database system, popular for its innovative, unsupervised maintaining process: it uses the so-called consensus protocol (CP) to avoid inference of any third party of absolute trust. As the main issues in maintaining BC, security, privacy, consistency, and energy consumption are identified. According to the recent literature, some of these issues can be formulated as Combinatorial Optimization (CO) problems, and this fact motivated us to consider incorporating the CO approaches into the BC. The main goal of this talk is to summarize the results, related to the above mentioned topic, achieved during the realization of AI4TrustBC project (2020-2023).

We proposed a new Combinatorial Optimization Consensus Protocol (COCP), based on Proof-of-Useful-Work (PoU) concept that assumes solving instances of the real-life CO problems. The main advantages of COCP are efficient utilization of computing resources, solving the real-life instances of CO problems, and providing a broad range of incentives for the various BC participants. We enumerate potential benefits of the COCP with respect to practical impacts and savings in power consumption, describe in detail some illustrative examples, and identify several challenges that should be resolved in order to implement a useful, secure, and efficient PoUW consensus protocol.

We have been developing the BC framework that combines the two above-mentioned research fields: BC and CO. It involves some basic steps toward the implementation of COCP. The first challenge to be resolved involves the existence of efficient methods for the underlying CO problems. Due to their complexity, we developed various types of heuristic methods to be utilized in the COCP. Most of these methods are problem-dependent stochastic heuristics or metaheuristics. Their usability within COCP requires careful analysis and estimation of the time necessary to provide solutions of desired quality. We proposed to apply Machine Learning techniques in this phase and to ensure fairness in the mining process. In addition, we considered the incorporation of the existing methods into our framework with an aim to spread the applicability of the proposed COCP to various CO domains. The search for the existing algorithms should be organized within CP as a part of useful work.

The presented research results were published in 2 journal articles and 5 conference papers, and have been obtained in the collaboration with:Project members: Milan Todorović, Dragan Urošević, Tatjana Jakšić-Kruger, Luka Matijević, Đorđe Jovanović (MISANU) Foreign researchers: Dušan Ramljak, Abhay Haridas, Barat Sharma (PSU) Students: Uroš Maleš (ETF), Dragutin Ostojić (PMF KG), Ognjen Nešković, Pavle Sekešan (MF).
 
Napomena: Predavanja se mogu pratiti na daljinu preko stranice:
https://miteam.mi.sanu.ac.rs/asset/tkKTsEvjqDmEEDx9a

detaljnije

Seminar za teoriju relativnosti i kosmološke modele, 12. jun 2024.

Naredni sastanak Seminara biće održan u sredu, 12. juna 2024, u sali 301f Matematičkog instituta SANU sa početkom u 12 časova.

Predavač: Ilijaš Farah, Research Chair in Foundations of Operator Algebras York University in Toronto, MI SANU

Naslov predavanja: U KOJOJ MERI JE EFIKASNOST MATEMATIKE U PRIRODNIM NAUKAMA NERAZUMNA?

Apstrakt: Matematičke teoreme dokazane iz definicija i aksioma (koje su rutinski izabrane po svojim estetskim kvalitetima, a ne po nekom "objektivnijem" kriterijumu) se već vekovima pokazuju "nerazumno efikasnim" u prirodnim naukama. (Prethodna rečenica je parafraza E. Wignera.) Sa druge strane, fizički eksperimenti često (empirijski) "potvrđuju" matematičke zakone. Konačno, opšteprihvaćene matematičke aksiome ne daju kompletan opis matematičke istine (Gedelova teorema, kao i brojni primeri nezavisnih "matematičkih" tvrđenja). Ovo predavanje je posvećeno spekulaciji koja proističe iz prethodnih rečenica i biće ilustrovano rezultatima I. Pitowskog kao i zajedničkim radom autora i M. Magidora.

Napomena: Seminar je moguće pratiti na daljinu putem linka:
https://matf.webex.com/wbxmjs/joinservice/sites/matf/meeting/download/8b9fe8cfab6a4f83b1b25b586fa0f592 protocolUID=2e5b93e777ae31de47717c284395f414#noRefresh

detaljnije

Seminar za veštačku inteligenciju, 12. jun 2024.

Naredni sastanak Seminara biće održan onlajn u sredu, 12. juna 2024, sa početkom u 19 časova.
 
Predavač: Dejan Grubišić, Rice University, Houston, Texas
 
Naslov predavanja: VELIKI JEZIČKI MODELI ZA OPTIMIZACIJU KOMPAJLERA
 
Apstrakt:
Kompajleri su ključna komponenta za povećanje performansi i efikasnosti softvera koji se izvršava na savremenim računarskim sistemima. Složenost savremenih arhitektura računara, softver koji se stalno razvija i količina računanja koja stalno raste, čine da ručne optimizacije nepraktičnim. Da bismo odgovorili na ove izazove, koristimo mašinsko učenje (eng. Machine Learning (ML)) kako bismo prepoznali zamršene obrasce i automatski prilagodili strategije generisanja koda i optimizacije specifičnim konfiguracijama hardvera, na taj način značajno povećavajući performanse programa. Na ovom predavanju govorimo o upotrebi velikih jezičkih modela za optimizaciju veličine koda i koje metode možemo koristiti da dodatno unapredimo performanse.

Napomena: Registraciona forma za učešće na Seminaru je dostupna na linku:
https://miteam.mi.sanu.ac.rs/asset/CW5nJWDSEZDj7p32p

Ukoliko želite samo da pratite predavanje bez mogućnosti aktivnog učešća, prenos je dostupan na linku:
https://miteam.mi.sanu.ac.rs/asset/4LNW8WtML7rLKojoz

detaljnije

Seminar za računarstvo i primenjenu matematiku, 11. jun 2024.

Naredni sastanak Seminara biće održan onlajn u utorak, 11. juna 2024. sa početkom u 14.15.
 
Predavač: dr Jasmina Pivar, Postdoc at Department of Informatics, University of Zagreb, Faculty of Economics & Busines
 
Naslov predavanja: ADOPTION OF BIG DATA TECHNOLOGIES IN EU SMART CITIES

Apstrakt: This research connects fields of smart cities and big data technologies by identifying factors influencing the adoption of big data technologies in European Union cities. The objective was to identify and evaluate factors that influence the adoption of big data technologies. Survey was carried out. The target population were cities of the European Union - EU28 countries with more than 40 thousand inhabitants. PLS-SEM was used to evaluate the model. Technological Readiness, Absorption Capacity, City Management Support, Existence of Smart City Strategy and Stakeholder Support were identified as factors that directly influence the Adoption of big data technologies in cities.

Napomena: Registraciona forma za učešće na Seminaru je dostupna na linku:
https://miteam.mi.sanu.ac.rs/call/wnz6oyxsQsy29LfJA/MjQ__eH607WeAL9X7IFtUI98xdQQgVkp-ljiEKPPfXr

Ukoliko želite samo da pratite predavanje bez mogućnosti aktivnog učešća, prenos je dostupan na linku:
https://miteam.mi.sanu.ac.rs/asset/YoqHWKALRkRTbK9So

detaljnije

Svečana dodela diploma 24.6.2024.

Svečana dodela diploma održaće se u ponedeljak, 24. juna 2024. godine u 13 sati u svečanoj sali Rektorata Univerziteta u Beogradu.

Spisak diploma:

Osnovne akademske studije
Master akademske studije

VAŽNO:

Upisivanje u knjigu diplomiranih obaviće se istog dana od 10 do 12 sati u 710/IV (zbornica).

Molimo Vas da dođete u navedenom terminu kako biste proverili sve podatke i potom na svečanoj dodeli mogli preuzeti diplomu.

Diplome mogu preuzeti i svi oni koji su propustili prethodne dodele diploma.

Hvala na razumevanju!

detaljnije

Studentski seminar, 7. jun 2024.

Naredni sastanak Seminara biće održan u petak, 7. juna 2024. godine u sali 301f Matematičkog instituta SANU sa početkom u 12 časova.
 
Predavač: Katarina Krivokuća, Berlinska matematička škola

Naslov predavanja: MATROIDI
 
Apstrakt:
Matroidi su kombinatorna struktura, uvedena od strane Vitnija 1930, kao uopštenje koncepta linearne nezavisnosti. Na ovom predavanju ćemo uvesti pojam neorijentisanog matroida, pripisati mu mrežu pljosni i definisati njenu Mebijusovu funkciju i karakteristični polinom. Nakon toga ćemo posmatrati dva konkretna primera pripisivanja matroida konfiguracijama hiperravni i grafovima, kako bismo videli koja sve njihova kombinatorna svojstva možemo pročitati iz informacija sačuvanih u matroidu. Matroidi su jako bitan alat u diskretnoj geometriji zato što čuvaju kombinatorna svojstva konfiguracija. Prelaskom na jezik orijentisanih matroida koji čuvaju i neku informaciju o znakovima pri linearnoj zavisnosti, dobijamo opštiji alat kroz koji možemo da posmatramo kombinatorna svojstva politopa.

 
Napomena: Predavanja se mogu pratiti na daljinu preko linka:
https://miteam.mi.sanu.ac.rs/call/CihYM6Nratzix7c8G/uJmcdEJs4INWQ8MEoLVzHRGxbfbBEWSBMwXBYcymVoj

Registraciona forma je dostupna na:
https://miteam.mi.sanu.ac.rs/asset/M4zcEwxkzy5PqNS73

detaljnije

Odeljenje za matematiku, 6. jun 2024.

Naredni sastanak Seminara biće održan u četvrtak, 6. juna 2024, u sali 301f Matematičkog instituta SANU sa početkom u 14 časova. U pitanju je zajednički sastanak sa Logičkim seminarom i Seminarom za verovatnosne logike.
 
Predavač: Adam Skalski, Mathematical Institute of the Polish Academy of Sciences, Warsaw
 
Naslov predavanja: WHAT IS A GOOD DEFINITION? IN SEARCH OF QUANTUM GROUPS

Apstrakt: Definitions form a fundamental part of the mathematical study. I will discuss the requirements that mathematicians put on "good" definitions and explain how such definitions develop, based on the notion of a locally compact quantum group, originating in 1970s and 1980s, and reaching a (possibly?) final form in the work of Kustermans and Vaes in 2000. Later developments will also be mentioned, but in general the talk will be accessible to general mathematical audience.

Napomena: Predavanja se mogu pratiti na daljinu preko linka:
https://miteam.mi.sanu.ac.rs/call/T9XDGChhq8aDcNqmz/qw7wIwci2jv2rdg9I9CrXkm7OJhF_LB8DfjXZp4jTFV
 
Registraciona forma je dostupna na:
https://miteam.mi.sanu.ac.rs/asset/tz97w4Hu4c3unsJ7N

detaljnije