Наредни састанак Семинара биће одржан онлајн у среду, 26. октобра 2022, од 19-20 часова. У питању је заједнички састанак са Семинаром за рачунарство и примењену математику.

Предавач: Syed Badruddoja, University of North Texas, Denton, TX, USA

Наслов предавања: TRUSTED AI WITH BLOCKCHAIN TO EMPOWER METAVERSE

Апстракт: The digital experience emerging in the virtual world is a reality with the advent of the metaverse. Augmented reality(AR), virtual reality(VR), extended reality(XR), and artificial intelligence(AI) algorithms would pave the way for an immersive experience for the users in the virtual space. However, the explosion of these technologies broaches new challenges to threaten the success of the metaverse due to security risks. Blockchain technology augmented with AI promises to deliver a trusted metaverse for everyone. Nevertheless, smart contracts fail to produce a cognitive prediction, dissuading users from confiding in the metaverse. We arm smart contracts with intelligence to predict using AI algorithms. Moreover, we deploy the smart contracts on the Ethereum blockchain platform and produce a prediction accuracy of 95% compared to Python library-based predictions. Our results show that the prediction delay can obstruct the growth of metaverse applications to accept blockchain technologies. Furthermore, the limitation of current blockchain technology can make integration unreasonable. Therefore, we discuss possible scalability solutions that can be part of our future work to help more metaverse applications adopt blockchain solutions.

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

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

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

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

Наслов предавања: ИНТЕГРАБИЛНОСТ У КОСИМПЛЕКТИЧКОЈ ГЕОМЕТРИЈИ

Апстракт предавања биће објављен на страници:
http://www.mi.sanu.ac.rs/novi_sajt/colloquiums/programs/mechcoll.oct2022.php#link3

Предавања се могу пратити на даљину преко линка:
https://miteam.mi.sanu.ac.rs/asset/YfY2cZTcN3YwGqFjc
Регистрациона форма је доступна на:
https://miteam.mi.sanu.ac.rs/asset/o9cuDZYqrq7jvFxw8

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

Предавач: Stefka Fidanova, Institute of Information and Communication technologies, Bulgarian Academy of Sciences

Наслов предавања: ANT ALGORITHM WITH FUZZY PHEROMONE UPDATING

Апстракт: Ant Colony Optimization (ACO) is among the best methods for solving hard combinatorial optimization problems. It mimics the ants behavior when they search for food. Ants deposit on the ground chemical substance called pheromone. After they follow the path with stronger pheromone concentration. It helps them to find a shorter path between the nest and source of the food. When the ACO is applied the first step is representation of the problem by graph. Then the ants walk on the graph and construct solutions, which are paths in a graph.

The ants construct feasible solutions beginning from random node. Every step ants compute a set of possible moves and select the best one, according to a probabilistic rule called transition probability. The transition probability depends on the quantity of the related pheromone and heuristic information. At the end of every information the pheromone is updated. First the old pheromone is decreased with a coefficient called evaporation, like evaporation in nature, and after is added a new pheromone, proportional to the quality of the achieved solution. In traditional ACO the sum of the evaporation coefficient and the coefficient of the new added pheromone is equal to~1. We propose intuitionistic fuzzy pheromone updating, where the sum of the two coefficients is less than~1. We propose two ways for calculation of the coefficients. The idea is tested on the Multidimensional Knapsack Problem and GPS surveying problem. The first is representative of subset problems and the second is representative of rdared problems.

Напомена: Састанак Семинара се може пратити на даљину преко линка:
https://miteam.mi.sanu.ac.rs/asset/YoqHWKALRkRTbK9So

За активно учешће неопходна је регистрација преко линка:
https://miteam.mi.sanu.ac.rs/call/wnz6oyxsQsy29LfJA/MjQ__eH607WeAL9X7IFtUI98xdQQgVkp-ljiEKPPfXr

Наредни састанак Семинара биће одржан у уторак, 25. октобра 2022, у сали 809 Математичког факултета са почетком у 18 часова.

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

Наслов предавања: УТИЦАЈ СУДАРА ГАЛАКСИЈА НА ЊИХОВУ ДИНАМИКУ И ЕВОЛУЦИЈУ

Наредни састанак Семинара биће одржан у уторак 25. октобра са почетком у 14.15 у сали 840 Математичког факултета.

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

Наслов предавања: CONTACT NON-SQUEEZING VIA SELECTIVE SYMPLECTIC HOMOLOGY

Апстракт: I will introduce a new version of symplectic homology that resembles the relative symplectic homology and that is related to the symplectic homology of a Liouville sector. This version, called selective symplectic homology, is associated with a Liouville domain and an open subset of its boundary. The selective symplectic homology is obtained as the direct limit of the Floer homology groups for Hamiltonians whoseslopes tend to infinity on the open subset but remain close to 0 and positive on the rest of the boundary. As an application, I will prove a contact non-squeezing phenomenon on homotopy spheres that are fillable by Liouville domains with infinite dimensional symplectic homology: there exists a smoothly embedded closed ball in such a sphere that cannot be made arbitrarily small by a contact isotopy. These homotopy spheres include examples that are diffeomorphic to standard spheres and whose contact structures are homotopic to standard contact structures.