111. |
112. |
113. |
114. |
115. Objavljanje raziskovalnih podatkov : predstavitev v okviru izobraževanja podatkovnih strokovnjakov, Ljubljana, 14. - 17. 10. 2024Ana Slavec, 2024, druge monografije in druga zaključena dela Ključne besede: Nacionalni portal odprte znanosti, odprta znanost, raziskovalni podatki, projekt Spoznaj, načela odprte znanosti, objavljanje raziskovalnih podatkov
Objavljeno v DiRROS: 03.03.2025; Ogledov: 81; Prenosov: 16
 Celotno besedilo (7,88 MB) |
116. Načrtovanje in pridobivanje raziskovalnih podatkov : predstavitev v okviru izobraževanja podatkovnih strokovnjakov, Ljubljana, 14. - 17. 10. 2024Ana Slavec, 2024, druge monografije in druga zaključena dela Ključne besede: Nacionalni portal odprte znanosti, odprta znanost, raziskovalni podatki, projekt Spoznaj, načela odprte znanosti, pridobivanje raziskovalnih podatkov
Objavljeno v DiRROS: 03.03.2025; Ogledov: 94; Prenosov: 21
Celotno besedilo (2,91 MB) |
117. Definicija in življenjski krog raziskovalnih podatkov : predstavitev v okviru izobraževanja podatkovnih strokovnjakov, Ljubljana, 14. - 17. 10. 2024Ana Slavec, 2024, druge monografije in druga zaključena dela Ključne besede: Nacionalni portal odprte znanosti, odprta znanost, raziskovalni podatki, projekt Spoznaj, načela odprte znanosti, metapodatki
Objavljeno v DiRROS: 03.03.2025; Ogledov: 57; Prenosov: 14
Celotno besedilo (3,93 MB) |
118. Resonance graphs of plane bipartite graphs as daisy cubesSimon Brezovnik, Zhongyuan Che, Niko Tratnik, Petra Žigert Pleteršek, 2025, izvirni znanstveni članek Povzetek: We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even ring systems, as well as 2-connected outerplane bipartite graphs. Firstly, we prove that if G is a plane elementary bipartite graph other than K2, then the resonance graph of G is a daisy cube if and only if the Fries number of G equals the number of finite faces of G. Next, we extend the above characterization from plane elementary bipartite graphs to plane bipartite graphs and show that the resonance graph of a plane bipartite graph G is a daisy cube if and only if G is weakly elementary bipartite such that each of its elementary component Gi other than K2 holds the property that the Fries number of Gi equals the number of finite faces of Gi. Along the way, we provide a structural characterization for a plane elementary bipartite graph whose resonance graph is a daisy cube, and show that a Cartesian product graph is a daisy cube if and only if all of its nontrivial factors are daisy cubes.
Ključne besede: daisy cube, fries number, peripherally 2-colorable, plane (weakly) elementary bipartite graph, resonance graph
Objavljeno v DiRROS: 03.03.2025; Ogledov: 63; Prenosov: 36
 Celotno besedilo (646,39 KB)
Gradivo ima več datotek! Več... |
119. Prevalence of sarcopenia among Slovenian older adults and associated risk factorsKatarina Puš, Saša Pišot, Uroš Marušič, Manca Peskar, Kaja Teraž, Miloš Kalc, Helena Blažun Vošner, Peter Kokol, Jernej Završnik, Boštjan Šimunič, 2025, izvirni znanstveni članek Povzetek: Introduction: Sarcopenia is a multifaceted condition affecting between 10 and 16% of the global population, and although multiple classification algorithms exist, no prevalence has been reported for a representative sample of the Slovenian population. Furthermore, multiple behavioural factors, such as malnutrition, physical inactivity, sedentary lifestyle and lower cognitive function, can contribute to the risk of sarcopenia. This study aims to: a) determine sarcopenia prevalence among Slovenian older adults according to different classification algorithms, b) compare the agreement among the algorithms and c) evaluate the relationship between proposed risk factors and sarcopenia. Methods: 654 participants (≥60 years, 30.4% males) have been classified into sarcopenia groups according to eight algorithms, and agreement (Fleiss K) between them was calculated. Additionally, age, sex, nutritional status, physical activity, sedentary levels and cognitive function were assessed as sarcopenia risk/protective factors. Results: The prevalence of sarcopenia according to EWGSOP2 was 4.1%, ranging from 2.1% to 15.3%, when classified by all eight algorithms. Overall agreement between algorithms was weak (K=.429; 95% CI .414 to .444) with 0.6% of participants classified as sarcopenic by all eight algorithms. Adequate nutrition and physical activity were identified as protective factors, while age, lower cognitive function and sedentary lifestyle were considered risk factors. Conclusion: Sarcopenia prevalence among the Slovenian general population was lower than in the global population. We can conclude that different sarcopenia algorithms lead to a different prevalence of sarcopenia. It is of great importance to be cautious when comparing prevalences among studies and to further validate the classification algorithms.
Ključne besede: sarcopenia, prevalence, epidemiology, classification algorithms, risk factors
Objavljeno v DiRROS: 03.03.2025; Ogledov: 76; Prenosov: 32
Celotno besedilo (294,19 KB)
Gradivo ima več datotek! Več... |
120. Maker–Breaker domination game critical graphsAthira Divakaran, Tanja Dravec, Tijo James, Sandi Klavžar, Latha S. Nair, 2025, izvirni znanstveni članek Povzetek: The Maker-Breaker domination game (MBD game) is a two-player game played on a graph G by Dominator and Staller. They alternately select unplayed vertices of G. The goal of Dominator is to form a dominating set with the set of vertices selected by him while that of Staller is to prevent this from happening. In this paper MBD game critical graphs are studied. Their existence is established and critical graphs are characterized for most of the cases in which the first player can win the game in one or two moves.
Ključne besede: Maker-Breaker game, Maker-Breaker domination game, Maker-Breaker domination number, Maker-Breaker domination game critical graph
Objavljeno v DiRROS: 03.03.2025; Ogledov: 76; Prenosov: 43
Celotno besedilo (486,21 KB)
Gradivo ima več datotek! Več... |
