https://cdv.uniba.sk/ Najnovšie novinky sk https://cdv.uniba.sk/fileadmin/tt_news_article.gif https://cdv.uniba.sk/ Najnovšie novinky TYPO3 - get.content.right http://blogs.law.harvard.edu/tech/rss Thu, 31 Dec 2026 00:00:00 +0100 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/doktorandske-kolokvium-kai-zekeri-adams-2992025/calendar_date/2027/may/ [Translate to Russian:] v pondelok 29.9.2025 o 13:10 hod. v miestnosti I 9 Prednášajúci: Zekeri Adams  Názov: On the Decidability of Full Set-Theoretic Semantics for SubClassOf in Higher-Order DLs Termín: 29.9.2025, 13:10 hod., I/9
Abstrakt:
Metamodeling in ontologies provides a systematic means of representing complex domains by capturing relationships across multiple abstraction levels. Central to this process is subsumption, a fundamental relation for hierarchical reasoning that underpins the organization of ontological knowledge. In this work, we build on an extended higher-order description logic framework denoted HIRS*(L), which incorporates metamodeling via two semantically fixed roles: instanceOf and subClassOf. These roles enforce explicit meta-level constraints, enabling a more expressive treatment of both hierarchical and meta-level constructs. Four variants of this logic are known, with three established as decidable. However, the question of decidability remains unresolved for the full set-theoretic semantics of the subClassOf relation applied to all concepts. Our work addresses this gap by examining the decidability of this extended system, denoted HIRS_SA(L) for an arbitrary base description logic L, and seeks to align it with well-understood decidable fragments of first-order logic. Stránka seminára Youtube kanál seminára ]]> [FMFI] Prednášky a semináre [FMFI] Kalendár Damas.Gruska@fmph.uniba.sk Thu, 25 Sep 2025 10:32:00 +0200 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/seminar-z-teoretickej-informatiky-martin-takac-732025/calendar_date/2027/may/ [Translate to Russian:] v piatok 7.3.2025 o 11:00 hod. v posluchárni C Prednášajúci: Martin Takáč (Zayed University of Artificial Intelligence) Názov: Solving Combinatorial Problems Using Reinforcement Learning and Large Language Models Termín: 7.3.2025, 11:00 hod., poslucháreň C
Abstrakt: 
The Vehicle Routing Problem (VRP) remains a critical challenge in logistics and resource management due to its NP-hard nature and the complexity of stochastic demands. This talk explores solutions to VRP through the application of Reinforcement Learning (RL) and Large Language Models (LLMs). Firstly, we introduce a novel end-to-end framework for solving the Vehicle Routing Problem using RL. Our approach leverages the correlation between stochastic demands and other observable variables, demonstrating that non-i.i.d. stochastic demands can enhance routing solutions. In parallel, we discuss the application of Large Language Models (LLMs) to VRP through a novel prompting strategy called Self-Guiding Exploration (SGE). This method enhances LLMs’ ability to solve combinatorial problems by autonomously generating multiple thought trajectories for each VRP task. These trajectories are decomposed into actionable subtasks, executed sequentially, and refined to ensure optimal outcomes. Our findings indicate that SGE significantly outperforms existing prompting strategies, demonstrating its effectiveness in optimizing VRP solutions. Martin Takac is an Associate Professor and the Deputy Department Chair of Machine Learning at the Mohamed bin Zayed University of Artificial Intelligence (MBZUAI) in the UAE. Prior to joining MBZUAI, he was an Associate Professor in the Department of Industrial and Systems Engineering at Lehigh University, where he had been on faculty since 2014. He earned his B.S. (2008) and M.S. (2010) degrees in Mathematics from Comenius University, Slovakia, and his Ph.D. (2014) in Mathematics from the University of Edinburgh, United Kingdom. Martin’s research focuses on the development and analysis of algorithms for machine learning, AI-driven scientific discovery, protein-DNA interaction studies, and the application of machine learning to energy systems. His work has earned him several prestigious awards, including the Best Ph.D. Dissertation Award by the OR Society (2014), the Leslie Fox Prize (2nd Prize; 2013) by the Institute for Mathematics and its Applications, the INFORMS Computing Society Best Student Paper Award (runner-up; 2012), and the Charles Broyden Prize for the best paper published in the 2022 volume of Optimization Methods and Software. He has received funding from multiple U.S. National Science Foundation programs, including a TRIPODS Institute grant in collaboration with Lehigh, Northwestern, and Boston University. Recently, he was also awarded three grants in partnership with the Weizmann Institute of Science. Martin has served as an Associate Editor for journals such as Mathematical Programming Computation, Journal of Optimization Theory and Applications, and Optimization Methods and Software. Additionally, he has taken on the role of Area Chair for top conferences such as AISTATS, NeurIPS, and ICLR, and served as a Senior Area Chair for NeurIPS 2024. ]]> [FMFI] Prednášky a semináre [FMFI] Kalendár Tomas.Vinar@fmph.uniba.sk Sun, 02 Mar 2025 15:24:00 +0100 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/veltrh-prace-na-fif-uk/calendar_date/2027/may/ Dňa 5. marca 2025 sa študujúcim z našej fakulty naskytne výnimočná príležitosť preskúmať kariérne... 5. marca 2025 sa naša fakulta v čase od 10.00 do 13.00 h premení na centrum kariérnych možností, kde sa budete môcť porozprávať so zástupcami a zástupkyňami renomovaných spoločností, získať užitočné tipy a možno aj nájsť svoju budúcu prácu. ČO VÁS ČAKÁ?

• Workshop formou Round Table – otvorená diskusia o stážach, pracovných príležitostiach a možnostiach na trhu práce
• Predstavenie študentských talentov – Inšpirujte sa úspešnými príbehmi našich študentov a študentiek
• Tombola – vyplňte na mieste online dotazník a hrajte o atraktívne ceny

Viac informácií v pozvánke
KTO PRÍDE? Na veľtrhu sa predstavia zástupkyne a zástupcovia týchto spoločností:

• AIESEC Slovensko
• Amnesty International Slovensko
• Dell Technologies
• DHL Supply Chain
• Future Generation Europe
• Johnson Controls
• Nexteria
• Partnersgroup SK
• PwC Slovensko
• Talent Solutions, s.r.o.
• Teach Next
• VISTA s.r.o. jazyková škola

Príďte si vypočuť, aké možnosti vás čakajú po štúdiu a urobte prvý krok k svojej vysnívanej kariére. Tešíme sa na vás.]]> [FiF] Titulka - podujatia - rubriky [FiF] Titulka - študujeme - rubriky [FiF] Kalendár Tue, 25 Feb 2025 16:51:00 +0100 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/important-notice/calendar_date/2027/may/ Dear international students, due to the lack of the mobility information from the faculties, the... [Mlyny] Titulka - široké novinky EN Mon, 04 Dec 2023 11:55:00 +0100 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/doktorandske-kolokvium-kai-stefan-pocos-4122023/calendar_date/2027/may/ [Translate to Russian:] v pondelok 4.12.2023 o 13:10 hod. v miestnosti I/9 Prednášajúci: Štefan Pócoš Názov: RecViT: Enhancing Vision Transformer with Top-Down Information Flow Termín: 4.12.2023, 13:10 hod., I/9
Abstrakt:
We propose and analyse a novel neural network architecture — recurrent vision transformer (RecViT). Building upon the popular vision transformer (ViT), we add a biologically inspired top-down connection, letting the network ‘reconsider’ its initial prediction. Moreover, using a recurrent connection creates space for feeding multiple similar, yet slightly modified or augmented inputs into the network, in a single forward pass. As it has been shown that a top-down connection can increase accuracy in case of convolutional networks, we analyse our architecture, combined with multiple training strategies, in the adversarial examples (AEs) scenario. Our results show that some versions of RecViT may indeed be more robust than the baseline ViT. We also leverage the fact that transformer networks have certain level of inherent explainability. By visualising attention maps of various input images, we gain some insight into the inner workings of our network. ]]> [FMFI] Prednášky a semináre [FMFI] Kalendár Damas.Gruska@fmph.uniba.sk Wed, 29 Nov 2023 15:01:00 +0100 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/seminar-z-teorie-grafov-shasha-zheng-9112023/calendar_date/2027/may/ [Translate to Russian:] vo štvrtok 9.11.2023 o 9:50 hod. v posluchárni C Prednášajúci: Shasha Zheng Názov: Cubic graphical regular representations of finite simple groups Termín: 9.11.2023, 9:50 hod., poslucháreň C
Abstrakt:
A graphical regular representation (GRR for short) of a group G is a Cayley graph of G whose full automorphism group is equal to the right regular permutation representation of G. In this talk, we study cubic GRRs of some families of classical groups and, based on some previously known results, confirm a conjecture made by Fang and Xia which asserts that with finitely many exceptions, every finite non-abelian simple group admits a cubic GRR. Stránka seminára]]> [FMFI] Prednášky a semináre [FMFI] Kalendár Martin.Skoviera@fmph.uniba.sk Tue, 28 Nov 2023 10:31:00 +0100 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/seminar-z-algebraickej-teorie-grafov-dominika-mihalova-27102023/calendar_date/2027/may/ [Translate to Russian:] v piatok 27.10.2023 o 13:00 hod. v posluchárni M VIII aj online Dominika Mihálová Názov: Constructions of Hypergraphical Regular Representations via $k$-uniform Hypergraphs of Certain Groups of Order Greater than $32$ Termín: 27.10.2023, 13:00 hod., M VIII a MS Teams 
Abstrakt:
We explores the problem of hypergraphical regular representation of finite group $G$ via $k$-uniform hypergraph. A hypergraphical regular representation preserves the group's structure within the hypergraph. We build upon previous research and investigates hypergraphical regular representations of certain groups of orders greater than $32$. We present an algorithm based on methods by Mihálová and Erskine and Tuite. The algorithm is implemented in the computational system \emph{GAP} to find hypergraphical regular representations for certain groups. The results include a table with groups for which hypergraphical regular representations via $k$-uniform hypergraphs were obtained. Those of you who are not able to attend in person or who are still uncertain about the safety of attending in person are welcome to attend via MS Teams. In either case, we hope to see as many of you as possible (either in person or virtually) at our Friday gatherings. ]]> [FMFI] Prednášky a semináre [FMFI] Kalendár Martin.Macaj@fmph.uniba.sk Tue, 07 Nov 2023 11:30:00 +0100 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/seminar-z-teorie-grafov-gena-hahn-5102023/calendar_date/2027/may/ [Translate to Russian:] vo štvrtok 5.10.2023 o 9:50 hod. v posluchárni C Prednášajúci: Geňa Hahn (Université de Montréal) Názov: From finite to infinite and back Termín: 5.10.2023, 9:50 hod., poslucháreň C
Abstrakt:
This is not a talk about new results but rather a gentle introduction to another way of thinking. We will review Ramsey's theorem in its infinite form and deduce the finite from it and then use the result to show the existence of another graph number. The latter is not provable by finite methods. Time permitting we mention other results where the infinite is needed to prove the finite.  Stránka seminára]]> [FMFI] Prednášky a semináre [FMFI] Kalendár Martin.Skoviera@fmph.uniba.sk Mon, 09 Oct 2023 12:48:00 +0200 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/oslavy-30-vyrocia-vstupu-sr-do-cern/calendar_date/2027/may/ [Translate to Russian:] Oslava sa uskutočníla na pôde fakulty v utorok 27. júna 2023 pod záštitou... stránke podujatia. ]]> [FMFI] Titulka - slider Pavol.Bartos@fmph.uniba.sk Tue, 26 Sep 2023 15:58:00 +0200 https://cdv.uniba.sk//ru/detail-aktuality/back_to_page/centrum-dalsieho-vzdelavania-uk/article/30-rokov-slovenskej-republiky-v-cern-e/calendar_date/2027/may/ [Translate to Russian:] Fakulta matematiky, fyziky a informatiky Univerzity Komentského v... Vedátor_sk a ambasádor CERN-u na Slovensku. Dizertáciu získal na FMFI UK, odkiaľ sa pobral na Dublinský Inštitút Pokročilých Štúdií, kde získal výskumný grant. Zaoberá sa modifikáciami kvantovej mechaniky, numerickými simuláciami a maticovými modelmi. Rád popularizuje čo najnormálnejšie témy ako oblaky, zvieratá či stromy. Napísal obľúbenú knihu Obyčajné zázraky. Pre oslavy 30. výročia Slovenska v CERN-e si pripravil tému, ktorá vŕta v hlave fyzikom i laikom - "Čo to vlastne je častica?" Barbora Eckerová je vedecká pracovníčka Katedry jadrovej fyziky a biofyziky na FMFI UK. Je členkou kolaborácie ATLAS v CERNe, v rámci ktorej vypracovala aj svoju dizertačnú prácu. Zaoberá sa štúdiom top kvarku a jeho vlastností.  V rámci osláv 30. výročia Slovenska v CERN-e bude rozprávať o tom, na čo nám vlastne sú urýchľovače. Tlačová správa Program podujatia]]> [FMFI] Titulka - slider [FMFI] Kalendár Pavol.Bartos@fmph.uniba.sk Fri, 23 Jun 2023 22:22:00 +0200