<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/">
	<channel>
		
		<title>RSS feed uniba.sk</title>
		<link>https://uniba.sk/</link>
		<description>Najnovšie novinky</description>
		<language>sk</language>
		<image>
			<title>RSS feed uniba.sk</title>
			<url>https://uniba.sk/fileadmin/tt_news_article.gif</url>
			<link>https://uniba.sk/</link>
			<width></width>
			<height></height>
			<description>Najnovšie novinky</description>
		</image>
		<generator>TYPO3 - get.content.right</generator>
		<docs>http://blogs.law.harvard.edu/tech/rss</docs>
		
		
		
		<lastBuildDate>Thu, 31 Dec 2026 00:00:00 +0100</lastBuildDate>
		
		
		<item>
			<title>MedGames Junior 2024</title>
			<link>https://uniba.sk/</link>
			<description>The Jessenius Faculty of Medicine at Comenius University in Martin was abuzz with excitement on...</description>
			<content:encoded><![CDATA[This innovative event is designed for first to third-year students of general and dental medicine, aiming to enhance their practical and theoretical knowledge in a fun and interactive environment.
For the first time, the competition welcomed participants from other faculties outside of Martin, expanding its reach and fostering a broader exchange of skills and knowledge. This year's edition spanned two days, with Friday dedicated to practical workshops preparing the teams for the competition's challenges.
The contest kicked off on Friday evening with a simulated mass casualty incident, putting the students' skills and teamwork to the test under pressure. Saturday's schedule was packed with diverse tasks set by representatives from the faculty's institutes and clinics at University Hospital Martin, who also served as judges for the event.
<strong>The winners of the 2024 MedGames Junior were:</strong>
<ol><li>Team Včelári (Laura Fedorková, Michal Vyparina, Jakub Šagát)</li><li>Team Trichrome (Marek Laheye, Michaela Matušovová, Martin Matúšik)</li><li>Team 5T (Diana Urbanová, Petra Sumková, Martin Žilinka)</li></ol>
(all students of JLF UK)]]></content:encoded>
			<category>[JLF] Titulka - úzke novinky</category>
			
			<author>milos.hrabovsky@uniba.sk</author>
			<pubDate>Wed, 20 Mar 2024 17:24:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Doctoral colloquium - Janka Boborová (25.3.2024) </title>
			<link>https://uniba.sk/</link>
			<description>Monday 25.3.2024 at 13:10, Lecture room I/9</description>
			<content:encoded><![CDATA[<strong>Janka Boborová:<br /></strong><strong><em>CATS: Experimental solver employing multiple algorithms to tackle abduction</em></strong>
<br /><em>Abstract:<br /></em>Abduction is one of the inference types that is less explored, therefore, it is interesting to research in the area of ontologies and description logics. The task of abduction is to explain (in the form of facts) an observation (also a fact) using the background knowledge of a problem domain. It has been applied, for example, in medical diagnosis, criminology and model-based diagnosis. <br />There are few abduction solvers, and even fewer employ more than one abduction algorithm. We have an experimental implementation of an abduction solver, recently dubbed CATS, that included two abduction algorithms: Minimal Hitting Set algorithm (MHS) and MHS-MXP, which is a hybrid combination of MHS and the MergeXplain method (MXP) that is used to speed up the search for explanations. MHS-MXP is a new method that has been developed by our faculty and is still being optimized. On the other hand, the MHS algorithm is well-known but considered outdated. Therefore, we wanted to find newer versions that could be combined with MXP. <br />Our goal is to expand CATS with more abduction algorithms and their hybrid combination with MXP. Then, propose a proper evaluation and compare them. We also plan to look into optimizing our hybrid approaches. <br />We researched several algorithms, found newer variants of MHS, and successfully managed to implement one of them (HST) and its hybrid combination (HST-MXP) into our solver. Currently, we are working on optimizing CATS mainly in terms of memory use and major code refactorization. Then, we are ready to implement the second MHS variant called RC-Tree. 

]]></content:encoded>
			<category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
			<author>Damas.Gruska@fmph.uniba.sk</author>
			<pubDate>Wed, 20 Mar 2024 15:46:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Algebraic Graph Theory Seminar - István Porupsánszki (22.3.2024)  </title>
			<link>https://uniba.sk/</link>
			<description>Friday 22.3.2024 at 13:00, Lecture room M/IX (online too)</description>
			<content:encoded><![CDATA[<strong>István Porupsánszki</strong>&nbsp;(Eotvos Lorand&nbsp;University, Budapest):<em><br /></em><strong><em>Extremal edge-girth-regular graphs</em></strong>
<em>Termín:</em><strong>&nbsp;22.3.2024, 13:00 hod., M IX&nbsp;a&nbsp;<link https://teams.microsoft.com/l/meetup-join/19%3aab9b9a6df36b48c19de038da7d507095%40thread.tacv2/1602753426605?context=%7b%22Tid%22%3a%22ce31478d-6e7a-4ce7-8670-a5b9d51884f9%22%2c%22Oid%22%3a%2229de710c-24a4-4d42-942c-7c69b9656568%22%7d _blank>MS Teams</link>&nbsp;</strong>
<br /><em>Abstract:<br /></em>In my talk, I will introduce the edge-girth-regular cage problem which is the generalization of the cage problem. A graph of order n is called edge-girth-regular if it is a k-regular graph of girth g such that every edge is contained in exactly λ distinct girth cycles. We denote such a graph with egr(n,k,g,λ). The edge-girth-regular cage problem consists in finding an egr(n,k,g,λ) where the triple (k,g,λ) is fixed and the order n is minimal. There are two main parts of the problem: we need constructions and then we need tools to check whether they are extremal. I will talk about three lower bounds on the order of extremal egr graphs.them are combinatorial and the third one is purely algebraic. Its proof is based on the properties of the eigenvalues of the adjacency matrix.
<br />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&nbsp;<link https://teams.microsoft.com/l/meetup-join/19%3aab9b9a6df36b48c19de038da7d507095%40thread.tacv2/1602753426605?context=%7b%22Tid%22%3a%22ce31478d-6e7a-4ce7-8670-a5b9d51884f9%22%2c%22Oid%22%3a%2229de710c-24a4-4d42-942c-7c69b9656568%22%7d _blank>MS Teams</link>. In either case, we hope to see as many of you as possible (either in person or virtually) at our Friday gatherings.

]]></content:encoded>
			<category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
			<author>Martin.Macaj@fmph.uniba.sk</author>
			<pubDate>Tue, 19 Mar 2024 16:31:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Seminar of Graph Theory  - István Porupsánszki (21.3.2024)</title>
			<link>https://uniba.sk/</link>
			<description>Thursday 21.3.2024 at 9:50 hod., Lecture room C</description>
			<content:encoded><![CDATA[<strong>István Porupsánszki</strong> (Eotvos Lorand&nbsp;University, Budapest):<br /><strong><em>New families of (almost) edge-girth-regular graphs</em></strong>
<em>Abstract:<br /></em>The famous cage problem consists in finding k-regular graphs of girth g with minimal order. We know some lower bounds (Moore-bound) but in general this is a barely solved problem.<br />In my talk, I will introduce an alternative problem. An egr graph is a k-regular graph of girth g such that every edge is contained in exactly ? distinct girth cycles. With the incidence graph some finite geometrical structures we can construct egr graphs. However, since the initial graphs are bipartite we obtain egr graphs of even girth. At the end of my talk, I will talk about some techniques to obtain new families of (almost) egr graphs of girth 5.<br /><br />
<em><link http://new.dcs.fmph.uniba.sk/index.php/Seminare/SeminarZTeorieGrafov _blank - "stránka seminára">More information</link></em>]]></content:encoded>
			<category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
			<author>Martin.Skoviera@fmph.uniba.sk</author>
			<pubDate>Tue, 19 Mar 2024 09:31:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Invitation – 12th Forum „Students - Entreprises“   </title>
			<link>https://uniba.sk/</link>
			<description>Pozvánka – 12. ročník Fóra „Študenti - Firmy“  
Convocation - 12ème édition du Forum «...</description>
			<content:encoded><![CDATA[Pozvánka – 12. ročník Fóra „Študenti - Firmy“&nbsp;&nbsp;
<div>Convocation - 12ème édition du Forum « Etudiants - Entreprises »&nbsp;</div>
<div>Einladung - 12. Forum “Studierende - Unternehmen&quot;&nbsp;</div>
<div>Invitation – 12th Forum „Students - Entreprises“&nbsp;&nbsp;</div>
<hr />
<div></div>
<div>Dear colleagues,&nbsp;Dear students,&nbsp;&nbsp;
We would wish to inform you that on 20 March 2024, at 9:00 a.m., room D2 at the Faculty of Management, Comenius University in Bratislava, within the French program the 12th Forum „Students - Enterprises “ will take place.&nbsp;&nbsp;
During the forum, there will be an opportunity for students of the French program of international management and for others who join, to meet representatives of selected French companies.&nbsp;&nbsp;
The event will be held mainly in the French language.&nbsp;
<link fileadmin/fm/Aktualne/FORUM_2024/Program_Forum_2024_.pdf><strong>Program</strong></link></div>
<div><link fileadmin/fm/Aktualne/FORUM_2024/FORUM_2024_pozvanka.png><strong>Invitation</strong></link>
<br /><img src="/uploads/RTEmagicC_FORUM_2024_pozvanka_03.png.png" width="300" height="423" alt="" />&nbsp;&nbsp;</div>
<div>You are all cordially invited to join.&nbsp;&nbsp;</div>
<div></div>]]></content:encoded>
			<category>[FM] Kalendár</category>
			<category>[FM] Titulka - úzke novinky</category>
			
			
			<pubDate>Mon, 18 Mar 2024 20:11:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Wellbeing Mentorship Training Program</title>
			<link>http://fileadmin/jlf/PR/oznamy/2024/03/Call_for_applicants_students.pdf</link>
			<description>We are thrilled to announce the opening of our Wellbeing Mentorship Training Program, a unique  ...</description>
			<content:encoded><![CDATA[]]></content:encoded>
			<category>[JLF] Titulka - široké novinky</category>
			
			
			<pubDate>Mon, 18 Mar 2024 14:45:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Results of Selection for Erasmus Mobility</title>
			<link>http://www.fm.uniba.sk/en/international-relations/erasmus/erasmus-study-outgoing-students/results-of-selection/</link>
			<description>Results of Selection for Erasmus Mobility for Academic Year 2024/2025</description>
			<content:encoded><![CDATA[]]></content:encoded>
			<category>[FM] Titulka - široké novinky</category>
			
			
			<pubDate>Mon, 18 Mar 2024 10:05:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Invitation to the international conference E-Leader</title>
			<link>https://uniba.sk/</link>
			<description>Invitation to the international conference E-Leader to be held at FM UK on 3-5 June 2024.</description>
			<content:encoded><![CDATA[INVITATION TO THE E-LEADER INTERNATIONAL CONFERENCE AT THE FACULTY OF MANAGEMENT, COMENIUS UNIVERSITY AT BRATISLAVA ON 3-5 JUNE 2024,
FOR MORE INFORMATION PLEASE VISIT <link https://www.g-casa.com/E-Leader-slovakia24.html _blank>THE E-LEADER CONFERENCE WEB</link>&nbsp;
<div><hr /></div>
<div>INSTRUCTIONS FOR AUTHORS:
ALL PAPERS DEALING WITH ANY KIND OF&nbsp; E-APPLICATIONS ARE WELCOME. AS PROPOSALS PLEASE SEND THE ABSTRACT OF YOUR PAPER&nbsp; (MAX. 300 WORDS) TO THE FOLLOWING E-MAIL ADDRESSES: <link mailto:yanyou2000@yahoo.com>yanyou2000@yahoo.com</link>&nbsp;&nbsp; 
what is the email address of the President of the CASA Dr. Donald Hsu. 
With Dr. D. Hsu is it possible to arrange also the conditions for the active participation in the E-LEADER conference at Bratislava on 3-5 June 2024.
or
<link mailto:dusan.soltes@fm.uniba.sk>dusan.soltes@fm.uniba.sk</link>&nbsp;who is the local organizer of the e-Leader conference.
Especially students and PhD. students are invited to participate in the conference with their papers but also without papers.
In case of any questions please contact either Dr. R. Hsu or Prof. Dusan Soltes
We are looking forward to your participation in the E-Leader International Conference.</div>]]></content:encoded>
			<category>[FM] Titulka - široké novinky</category>
			
			
			<pubDate>Mon, 18 Mar 2024 09:54:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Lecturers and staff from partner universities</title>
			<link>http://www.fm.uniba.sk/en/about-faculty/akcie-organizovane-na-fm/erasmus-program-is-also-for-teachers-and-staff-exchanges/</link>
			<description>The summer semester started not only with the welcome of new Incoming International Students, but...</description>
			<content:encoded><![CDATA[]]></content:encoded>
			<category>[FM] Titulka - úzke novinky</category>
			
			
			<pubDate>Tue, 12 Mar 2024 19:50:00 +0100</pubDate>
			
		</item>
		
		<item>
			<title>Doctoral colloquium - Filip Kerák (18.3.2024) </title>
			<link>https://uniba.sk/</link>
			<description>Monday 18.3.2024 at 13:10, Lecture room I/9</description>
			<content:encoded><![CDATA[<strong>Filip Kerák:</strong>
<strong><br /></strong><em>Abstract:<br /></em>While sequencing DNA or RNA with nanopore, the sequencing machine outputs a signal that is later translated to a string over alphabet {A,C,G,T} using machine learning approaches. It has been shown that current approaches to this problem lead to systematic errors in recovered sequences, hindering the downstream analysis. The goal is to develop new methods that can characterize and identify such biases through probabilistic modeling and machine learning.
<em><link https://dai.fmph.uniba.sk/w/Doctoral_Colloquia/en _blank>More information</link></em>

]]></content:encoded>
			<category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
			<author>Damas.Gruska@fmph.uniba.sk</author>
			<pubDate>Tue, 12 Mar 2024 17:11:00 +0100</pubDate>
			
		</item>
		
	</channel>
</rss>