Ponedeljkov seminar računalništva in informatike - Arhiv

ponedeljek, 18. september 2023 Dani ZUGAN: Vrednotenje algoritmov za iskanje najkrajših poti v omrežju

V ponedeljek, 18. septembra 2023, bosta ob 16.00 uri izvedeni dve
predavanji v okviru PONEDELJKOVEGA SEMINARJA RAČUNALNIŠTVA IN INFORMATIKE
Oddelkov za Informacijske znanosti in tehnologije UP FAMNIT in UP IAM.

ČAS/PROSTOR: 18. september 2023 ob 16.00 na daljavo prek ZOOM-a
(https://upr-si.zoom.us/j/297328207?pwd=S3Zpdk1VR3pjckNtWkQwKzlvcDR5UT09)

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------

1. predavanje:
============

------------------------------------
PREDAVATELJ: Jani SUBAN
------------------------------------

Jani Suban je študent prvega letnika magistrskega programa Računalništva in informatike na UP FAMNIT.

-------------------------------------------------------------------------------------
NASLOV: Empirična evalvacija urejenih slovarjev z ALGatorjem
-------------------------------------------------------------------------------------

POVZETEK:

Na seminarju bo predstavljena empirična evalvacija različnih implementacij abstraktne podatkovne strukture urejen slovar. Implementirane podatkovne strukture so binarno iskalno drevo, drevo AVL, rdeče-črno drevo, zip drevo, preskočni seznam in 2-3 drevo. Implementacije so bile testirane s pomočjo sistema za evalvacijo algoritmov in podatkovnih struktur ALGator. Iz rezultatov testiranja podatkovnih struktur, tako pri striktno naraščajočih, kot tudi naključnih posodobitvah in poizvedbah, je razvidno, da je časovna zahtevnost enaka pričakovani.

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------

2. predavanje:
============

-------------------------------------
PREDAVATELJ: Dani ZUGAN
-------------------------------------

Dani Zugan je študent prvega letnika magistrskega programa Računalništva in informatike na UP FAMNIT.

----------------------------------------------------------------------------------------------
NASLOV: Vrednotenje algoritmov za iskanje najkrajših poti v omrežju
----------------------------------------------------------------------------------------------

POVZETEK:

V članku so ovrednoteni trije različni algoritmi za izračun paroma najkrajših poti v grafu. Primerjamo znani Floyd-Warshallov algoritem z dvema preprostima modifikacijama. Ključna razlika je v tem, da so relaksacije izvedene na pametnejši način. Algoritme ovrednotimo na treh različnih modelih grafov - uniformnem Erdős-Rényijevem, binomskem Erdős-Rényijevem in Albert-Barabásijevem. Na podlagi rezultatov lahko ugotovimo, da sta oba spremenjena modificirana algoritma boljša od algoritma Floyd-Warshall.

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Seminar bo potekal v slovenskem jeziku, tokrat na daljavo prek Zoom-a
(https://upr-si.zoom.us/j/297328207?pwd=S3Zpdk1VR3pjckNtWkQwKzlvcDR5UT09)

Vabljeni!

---

sreda, 13. september 2023 Robert Scheffler: Optimal Bicycle Routes with Few Signal Stops

Tokrat izjemoma v četrtek, 14. septembra 2023, bo ob 14.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: 14. september 2023 ob 14.00 v FAMNIT-MP6.

----------------------------------------------
PREDAVATELJ: Robert SCHEFFLER
----------------------------------------------

Robert Scheffler studied computer science and received his master's degree in 2017. This year he made his PhD with his thesis about vertex and edge orderings of graphs. Currently, he is a Postdoc at the Chair of Discrete Mathematics and Foundations of Computer Science at Brandenburg University of Technology in Cottbus, Germany.

---------------------------------------------------------------------------
NASLOV: Optimal Bicycle Routes with Few Signal Stops
---------------------------------------------------------------------------

POVZETEK:

With the increasing popularity of cycling as a mode of transportation, there is a growing need for efficient routing algorithms that consider the specific requirements of cyclists. We study the optimization of bicycle routes while minimizing the number of stops at traffic signals. In particular, we consider three different types of stopping strategies and three types of routes, namely paths, trails, and walks. We present hardness results as well as a pseudo-polynomial algorithm for the problem of computing an optimal route with respect to a pre-defined stop bound.

Seminar bo potekal v angleškem jeziku v predavalnici FAMNIT-MP6 s pričetkom ob 14:00 uri.

Vabljeni

---

ponedeljek, 11. september 2023 Domen VAKE: Pseudo-Random Algorithm for Sending Messages in Decentralized Networks

V ponedeljek, 11. september 2023, 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: 11. avgust 2023 ob 16.00 na daljavo prek ZOOM-a
(https://upr-si.zoom.us/j/297328207?pwd=S3Zpdk1VR3pjckNtWkQwKzlvcDR5UT09)

----------------------------------------
PREDAVATELJ: Domen VAKE
----------------------------------------

Domen Vake is a second-year PhD student at UP FAMNIT under mentorship of assoc. prof. Branko Kavšek and assoc. prof Jernej Vičič.  His research interests include blockchain technologies and machine learning combining them in research of sensor network data.

---------------------------------------------------------------------------------------------------------------------
NASLOV: Pseudo-Random Algorithm for Sending Messages in Decentralized Networks
---------------------------------------------------------------------------------------------------------------------

POVZETEK:

We present an algorithm for the dissemination of messages in fully decentralized networks. The motivation for research comes from the field of blockchain technology and the development of decentralized network protocols. One of the key goals of such systems is an effective spread of data through the network. The goal of good algorithms is to get every message received as soon as possible. The presented algorithm works on the principle of pseudorandomness for determining the message path from the originator of the message to every node in the network. The proposed algorithm pseudorandomly generates a path for the message through the network. Upon receiving the message, each node is able to reproduce the same path and continue the propagation of the message. The algorithm implements a by-layer checking on the successful dissemination of the message, which sharply raises the fault tolerance of the algorithm.
 

Seminar bo potekal v slovenskem jeziku, tokrat na daljavo prek Zoom-a
(https://upr-si.zoom.us/j/297328207?pwd=S3Zpdk1VR3pjckNtWkQwKzlvcDR5UT09)

Vabljeni!      

---