Наредни састанак Семинара биће одржан у уторак, 6. јуна 2023, у сали 301ф Математичког института САНУ са почетком у 14.15.

Предавач: Prof. dr.sc. Neven Vrček, University of Zagreb, Faculty of Organization and Informatics, Croatia

Наслов предавања: SMART FRAMEWORKS FOR SMART INDUSTRY – SWARM AS A RESEARCH PLATFORM

Апстракт: Rapid technological development and convergence of technologies brought up a concept of smartness as a paradigm for modern society. We are talking about smart products, smart buildings, smart cities, smart ecosystems, etc. In order to fulfill expectations these concepts must be researched from many perspectives which overarch disciplines and reduce friction for widespread adoption of smart paradigm. Besides the obvious technological domain, we have to include legal aspects, user behavior, business models, etc. One approach to research these heterogeneous, and yet convergent domains, is to set up frameworks which can be used in various contexts and analyze them from different perspectives. This presentation introduces the SWARM of drones as a platform used to analyze various aspects that can adapt to the different domain requirements, most often within a smart urban environment. The platform developed within a project UNMANNED AERIAL VEHICLE CONTROL AND SURVEILLANCE FRAMEWORK is a testbed for the use and control of SWARM of drones. The platform combines technology-related research activities such as artificial intelligence for SWARM control, RF signal propagation and location determination within various use cases such as smart logistics, pollution identification, air quality monitoring etc. All these are accompanied with research about possible business models, legal requirements, privacy assessment, risk analysis and cost benefit analysis. The platform has interoperable modules that can be easily changed and adapted to various use cases. Our experience shows that such frameworks can gather scientists from various disciplines and bring up innovative solutions which have scientific and applied value.

Напомена: Регистрациона форма за учешће на Семинару је доступна на линку:
https://miteam.mi.sanu.ac.rs/call/wnz6oyxsQsy29LfJA/MjQ__eH607WeAL9X7IFtUI98xdQQgVkp-ljiEKPPfXr

Уколико желите само да пратите предавање без могућности активног учешћа, пренос је доступан на линку:
https://miteam.mi.sanu.ac.rs/asset/YoqHWKALRkRTbK9So

Наредни састанак Семинара биће одржан у петак, 9. јуна 2023, у сали 301ф Матматичког института САНУ са почетком у 14.15.

Предавач: Александра Маринковић, Математички факултет, Универзитет у Београду

Наслов предавања: SYMPLECTIC CIRCLE ACTIONS ON MANIFOLDS WITH A CONTACT TYPE BOUNDAR

Апстракт: In this talk we consider circle actions on symplectic manifolds that have a (convex) contact type boundary. The most natural examples from classical mechanics are cotangent bundles with their natural actions induced by an action on the base manifold. We show that many of the key ideas of Morse-Bott theory, used for closed symplectic manifolds, could also be applied in the boundary case. However, in contrast to the closed symplectic case, we show that any symplectic circle action on a symplectic manifold with a contact type boundary is always Hamiltonian. We further show several results about the topology of these symplectic manifolds. In particular, we show that the contact type boundary is connected if the dimension of the symplectic manifold is 4.

This talk is based on a joint work with Klaus Niederküger.

Напомена: Предавања се могу пратити на даљину преко линка:
https://miteam.mi.sanu.ac.rs/call/T9XDGChhq8aDcNqmz/qw7wIwci2jv2rdg9I9CrXkm7OJhF_LB8DfjXZp4jTFV

Регистрациона форма је доступна на:
https://miteam.mi.sanu.ac.rs/asset/tz97w4Hu4c3unsJ7N

Наредни састанак Семинара биће одржан у среду, 7. јуна 2023, у сали 301ф Матматичког института САНУ са почетком у 13 часова. У питању је заједнички састанак са Одељењем за математику.

Предавач: Alexey Semenov,
Head of the Department of Mathematical Logic and Theory of Algorithms of Lomonosov Moscow State University; Director of Axel Berg Institute of Cybernetics and Educational Computing of Russian Academy of Sciences; Academician of Russian Academy of Sciences and Russian Academy of Education

Наслов предавања: THE THEORY OF DEFINABILITY

Апстракт: Definability theory can be considered as an important part of all mathematics along with proof theory, model theory, and computation theory. This was constantly emphasized by Alfred Tarski, who owns remarkable results in this theory, the main question of which is: is it possible to define some concept or relation, through other concepts, relations.

The report will give a general overview of the results in definability theory since the XIX century, including the Svenonius Theorem (completeness theorem for definability), the latest results of the author, his students and colleagues are presented, and a wide spectrum of open problems and possible solutions are proposed. The presence of this spectrum is a characteristic feature of the current state of definability theory.

The report can also provide a general overview of the research on mathematical logic, theory of algorithms and Computer Science going on at Moscow University, Moscow, and Russia.

Напомена: Предавања се могу пратити на даљину преко линка:
https://miteam.mi.sanu.ac.rs/asset/iYxPidYtFqBC9sT7a

Регистрациона форма је доступна на:
https://miteam.mi.sanu.ac.rs/asset/oaqCm4EyPhHR6kM6N

Наредни састанак Семинара биће одржан онлајн у среду, 7. јуна 2023, са почетком у 19 часова.

Предавач: Andrii Shalaginov, Associate Professor, Department of Technology, Kristiania University, College, Oslo, Norway

Наслов предавања: ARTIFICIAL INTELLIGENCE FOR CYBERSECURITY IN RESOURCE-CONSTRAINED SMART INFRASTRUCTURES: APPLICABILITY, OPPORTUNITIES AND ENERGY MODELLING

Апстракт: Rapid boosted digitalization through the last decade in addition to a worldwide orientation towards smarter and greener environments has resulted in many cities becoming more intelligent when it comes to automation and natural resources utilization. This includes faster development of 5G networks, Wi-Fi 6, blockchain and versatile application of AI. Smart Environment is a technology-enabled phenomenon that offers better, user-friendly and more efficient IoT-based environments with a specific focus on greener and more sustainable future both in rural and city-wise contexts. However, wide range of IoT-enabled devices often lack the means for implementing necessary cybersecurity measures capable of handling adversarial actions both due to limited standardization and weak computation capabilities. Furthermore, following the EU strategy towards energy consumption optimization, it is important to focus on modelling energy-aware Incident Response and Business Continuity from the technological perspective. Tangible cost in watts of cyber-physical threats and controls to prevent these threats need to assessed using intelligent AI-based human-understandable mechanisms. Not only will this help reduce the overall cost based on the performance per watt measure, but it will also give a better understanding of the energy consumption landscape for policymakers and IT governance managers.

Напомена: Регистрациона форма за учешће на Семинару је доступна на линку:
https://miteam.mi.sanu.ac.rs/asset/CW5nJWDSEZDj7p32p

Уколико желите само да пратите предавање без могућности активног учешћа, пренос је доступан на линку:
https://miteam.mi.sanu.ac.rs/asset/4LNW8WtML7rLKojoz

У петак, 2. јуна 2023, биће одржано специјално издање семинара Одељења за математику. Предавања ће одржати четворо гостију са института са Универзитета Приморске у Копру, Словенија. Предавања бити одржана у згради САНУ, Кнеза Михаила 35, сала 2 на 1. спрату, са следећим програмом:

11:00-11:45 Томаж Писански, Универза на Приморскем, Словенија

FROM THE HISTORY OF THE JOURNAL ARS MATHEMATICA CONTEMPORANEA

Fifteen years ago, in 2008, the first issue of mathematical research journal Ars Mathematica Contemporanea was published. A brief history of the first Slovenian mathematical journal, as well as the strategy that was used for its launching and later development, will be presented.

11:45-12:30 Драган Марушич, Универза на Приморскем, Словенија

ON HAMILTONICITY OF VERTEX TRANSITIVE GRAPHS

The following question asked by Lovász in 1970 tying together traversability and symmetry, two seemingly unrelated graph-theoretic concepts, remains unresolved after all these years: Does every finite connected vertex-transitive graph have a Hamilton path?

In my talk I will discuss certain partial results obtained thus far together with a connection to another long standing problem regarding vertex-transitive graphs, the so called „polycirculant conjecture“: is it true that every vertex-transitive graph admit a nontrivial automorphism with all orbits of the same size?

13:00-13:45 Клавдија Кутнар, Универза на Приморскем, Словенија

ON INTERSECTION DENSITIES OF TRANSITIVE GROUPS AND VERTEX-TRANSITIVE GRAPHS

The Erdös-Ko-Rado theorem, one of the central results in extremal combinatorics, which gives a bound on the size of a family of intersecting k-subsets of a set and classifies the families satisfying the bound, has been extended in various ways. In this talk I will discuss an extension of this theorem to the ambient of transitive permutation groups and vertex-transitive graphs.

Let V be a finite set and G a group acting on V. Two elements g,h ∈ G are said to be intersecting if g(v) = h(v) for some v ∈ V. More generally, a subset F of G is an intersecting set provided every pair of elements of F is intersecting. The intersection density ρ(G) of a transitive permutation group G is the maximum value of the quotient |F|/|G_v|, where F runs over all intersecting sets in G and G_v is a stabilizer of v ∈ V.

The intersection density array [ρ0,ρ_1, …,ρ(k-1)] of a vertex-transitive graph X is defined as a „collection“ of increasing intersection densities of transitive subgroups of Aut(X), that is, for any transitive subgroup G of Aut(X), we have ρ(G) = ρi for some i ∈ Z_k, with ρ_i<ρ(i+1).

In this talk I will present some recent results about intersection densities of certain transitive permutation groups and vertex-transitive graphs of small valencies. This is a joint work with Ademir Hujdurović, Ištván Kovác, Bojan Kuzma, Dragan Marušić, Štefko Miklavič, Marko Orel and Cyril Pujol.

13:45-14:30 Александер Малнич, Универза в Љубљани и Универза на Приморскем, Словенија

ON REFLEXIBLE POLYNOMIALS

Let p be an odd prime. A polynomial f(x) = a_0 + a_1 x + … + a_n x^n over the field Z_p is reflexible if there exists λ ∈ Z^*p such that either λ a(n-i) = a_i (for all i = 0, 1, …, n) or else λ a_(n-i) = (-1)^i a_i (for all i = 0, 1, …, n).

Such polynomials were instrumental in the classification of 4-valent arc-transitive graphs arising as minimal elementary abelian covers of doubled cycles [JCTB 131 (2018), 109–137, joint work with Boštjan Kuzman and Primož Potočnik]. In the talk I will present some properties of reflexible polynomials.

Напомене: Предавања се могу пратити на даљину преко линка:
https://miteam.mi.sanu.ac.rs/call/T9XDGChhq8aDcNqmz/qw7wIwci2jv2rdg9I9CrXkm7OJhF_LB8DfjXZp4jTFV

Регистрациона форма је доступна на:
https://miteam.mi.sanu.ac.rs/asset/tz97w4Hu4c3unsJ7N

Наредни састанак Семинара биће одржан у петак, 2. јуна 2023, у сали 301ф Математичког института САНУ са почетком у 12 часова.

Предавач: Момчило Мркаић, Градски универзитет у Хонг Конгу

Наслов предавања: ДИЗАЈН МЕХАНИЗАМА СА И БЕЗ НОВЦА

Апстракт: Дизајн механизама је грана економије која је посебна по томе што поседује и перспективу рачунарских наука. Како је утицај Интернета растао, настало је ново поље названо алгоритамски дизајн механизама. Бави се оптимизационим проблемима у поставци теорије игара, као што су алоцирање меморије и усмеравање порука. Механизам треба да ради са претпоставком да сваки учесник има своје себичне циљеве. Учесници могу и да стратешки лажу, при чему би циљ механизма био да немају разлога за тим. Да би се поравнали циљеви индивидуа и целокупног друштва често се користи новац, али је могуће дизајнирати механизме без новца који ће осигурати искреност учесника.

Напомена: Предавања се могу пратити на даљину преко линка:
https://miteam.mi.sanu.ac.rs/call/CihYM6Nratzix7c8G/uJmcdEJs4INWQ8MEoLVzHRGxbfbBEWSBMwXBYcymVoj

Регистрациона форма је доступна на:
https://miteam.mi.sanu.ac.rs/asset/M4zcEwxkzy5PqNS73

Наредни састанак Семинара биће одржан у среду, 31. маја 2023. у сали N153 Математичког факултета (улица Светог Николе бр 39) са почетком у 18 часова.

Предавач: Милена Шошић

Наслов предавања: МОДЕЛОВАЊЕ МОРАЛНИХ И ЕМОЦИОНАЛНИХ КОМПОНЕНТИ ЈЕЗИКА У КЛАСИФИКАЦИЈИ КОНВЕРЗАЦИОНИХ ТЕКСТОВА (представљање теме докторске дисертације)

Апстракт је доступан на адреси:
http://computing.math.rs/files/2023-05-29-milena-sosic.pdf

Ове године се навршава 30 година семинара Математички методи механике Математичког института САНУ. Тим поводом, у среду 31. маја 2023 биће одржан једнодневни симпозијум у сали 301ф у Математичком институту САНУ са почетком у 9.15.

Програм скупа

Семинар је могуће пратити и онлајн и на даљину, путем следећег линка:
https://miteam.mi.sanu.ac.rs/call/33iAqZDsttsz8mgpY/4T0kIvmiahdjKeRkfJrlXN-MqksiB6cGuOFhJYUEHFi

Предавање академика Козлова биће преко Зум платформе, а детаљи приступа су следећи:
https://zoom.us/j/94982093119?pwd=RlZIdkxlaVl6YWwvN3dVL1ZBdlArZz09
Meeting ID: 949 8209 3119
Passcode: 913612

Наредни састанак Семинара биће одржан онлајн у среду, 31. маја 2023, са почетком у 19 часова.

Предавач: prof. José Pedro Cabalar Fernández, Computer Science and Information Technology Department, University of A Coruña, Spain

Наслов предавања: EXPLANATIONS FOR PRACTICAL KNOWLEDGE REPRESENTATION

Апстракт: Achieving a truly explainable Artificial Intelligence (AI) is nowadays a challenge not only for machine learning „black box“ techniques but even for symbolic automated reasoning, especially when the explanations of a conclusion are too large or hard to follow for an average human user. In the talk, I will first discuss several aspects of explainable symbolic AI systems and then proceed to introduce a kind of explanations for logic programs based on so-called justified models, that is, models for which an explanation graph exists. Finally, I will illustrate these concepts with several examples using the tool xclingo, that generates explanations for logic programs under the Answer Set Programming paradigm.

Напомена: Регистрациона форма за учешће на Семинару је доступна на линку:
https://miteam.mi.sanu.ac.rs/asset/CW5nJWDSEZDj7p32p

Уколико желите само да пратите предавање без могућности активног учешћа, пренос је доступан на линку:
https://miteam.mi.sanu.ac.rs/asset/4LNW8WtML7rLKojoz