Ponedeljkov seminar računalništva in informatike - Arhiv
| 2025 | 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 |
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
četrtek, 16. januar 2025 Ivan DAMNJANOVIĆ: Finding the number of inequivalent arithmetic expressions on n variables
V ponedeljek, 20. januarja 2025, bo ob 17.00 uri izvedeno
predavanje v okviru PONEDELJKOVEGA SEMINARJA RAČUNALNIŠTVA IN INFORMATIKE
Oddelkov za Informacijske znanosti in tehnologije UP FAMNIT in UP IAM.
ČAS/PROSTOR: 20. januar 2025 ob 17.00 v FAMNIT-VP2.
-----------------------------------------------
PREDAVATELJ: Ivan DAMNJANOVIĆ
-----------------------------------------------
Ivan Damnjanović is pursuing a PhD degree in Mathematical Sciences at the Faculty of Mathematics, Natural Sciences and Information Technologies at the University of Primorska. He previously obtained a PhD degree in Electrical Engineering and Computing at the Faculty of Electronic Engineering at the University of Niš, where he currently works as a teaching assistant at the department of mathematics.
-----------------------------------------------------------------------------------------------------------------
NASLOV: Finding the number of inequivalent arithmetic expressions on n variables
-----------------------------------------------------------------------------------------------------------------
POVZETEK:
Given n distinct formal variables, in how many ways can we use them to construct different arithmetic expressions? An expression tree is a rooted tree whose internal nodes correspond to some operations to be performed, while its leaves are formal variables. Here, we deal with the expression trees such that the only allowed operations are the four standard arithmetic operations (addition, subtraction, multiplication and division) together with, optionally, additive inversion. We consider two expressions to be equivalent if their expression trees yield the same formal expression. To begin, we provide certain theoretical results concerning the equivalence of arithmetic expressions. Afterwards, we disclose a Θ(n^2) algorithm that computes the number of inequivalent arithmetic expressions on n distinct variables. The algorithm covers both the case when the unary operation of additive inversion is allowed and when it is not.
(This is a joint work with Ivan Stošić and Žarko Ranđelović.)
Seminar bo potekal v živo, s pričetkom ob 17:00 uri v učilnici FAMNIT-VP2.
Pozor, to je eno uro kasneje kot ponavadi !!!
Vabljeni.
petek, 10. januar 2025 Jovan PAVLOVIĆ: A Data-Driven Approach for the Analysis of Ridership Fluctuations in Transit Systems
V ponedeljek, 13. januarja 2025, bo ob 16.00 uri izvedeno
predavanje v okviru PONEDELJKOVEGA SEMINARJA RAČUNALNIŠTVA IN INFORMATIKE
Oddelkov za Informacijske znanosti in tehnologije UP FAMNIT in UP IAM.
ČAS/PROSTOR: 13. januar 2025 ob 16.00 v FAMNIT-VP2.
------------------------------------------
PREDAVATELJ: Jovan PAVLOVIĆ
------------------------------------------
Jovan Pavlović is a second-year Data Science master's student at UP FAMNIT, where he also earned his bachelor's degree in Mathematics.
--------------------------------------------------------------------------------------------------------------------------------
NASLOV: A Data-Driven Approach for the Analysis of Ridership Fluctuations in Transit Systems
--------------------------------------------------------------------------------------------------------------------------------
POVZETEK:
This seminar explores a data-driven approach to analyzing ridership fluctuations in public transportation systems, especially during pandemics. It focuses on identifying critical components within urban transit systems, by employing agent-based simulations and graph analytics techniques. Key findings reveal specific transit stops and routes that are highly sensitive to changes in demand, often serving as bottlenecks or high-risk areas for the spread of infectious diseases.
Seminar bo potekal v živo, s pričetkom ob 16:00 uri v učilnici FAMNIT-VP2.
Vabljeni.
