41. Navigating COP16’s digital sequence information outcomes : what researchers need to do in practiceMelania Muñoz-García, Amber Hartman Scholz, 2025, drugi znanstveni članki Opis: The UN Convention on Biological Diversity adopted new rules for sharing benefits from publicly available genetic sequence data, also known as digital sequence information (DSI). In this Opinion, the authors describe the key elements researchers need to be aware of, address real-life questions, and explain the practical implications of these rules for research and development.
Ključne besede: COP16, digital sequence information, sequences, research
Objavljeno v RUP: 26.09.2025; Ogledov: 412; Prenosov: 6
 Celotno besedilo (2,22 MB)
Gradivo ima več datotek! Več... |
42. On commutative association schemes and associated (directed) graphsGiusy Monzillo, Safet Penjić, 2025, izvirni znanstveni članek Opis: Let ${\mathcal M}$ denote the Bose--Mesner algebra of a commutative $d$-class association scheme ${\mathfrak X}$ (not necessarily symmetric), and $\Gamma$ denote a (strongly) connected (directed) graph with adjacency matrix $A$. Under the assumption that $A$ belongs to ${\mathcal M}$, we describe the combinatorial structure of $\Gamma$. Moreover, we provide an algebraic-combinatorial characterization of $\Gamma$ when $A$ generates ${\mathcal M}$. Among else, we show that, if ${\mathfrak X}$ is a commutative $3$-class association scheme that is not an amorphic symmetric scheme, then we can always find a (directed) graph $\Gamma$ such that the adjacency matrix $A$ of $\Gamma$ generates the Bose--Mesner algebra ${\mathcal M}$ of ${\mathfrak X}$.
Ključne besede: commutative association schemes, association schemes, Bose-Mesner algebra, equitable partition, graphs generating schemes, quotient-polynomial graphs, x-distance-faithful intersection diagram
Objavljeno v RUP: 26.09.2025; Ogledov: 329; Prenosov: 4
Celotno besedilo (483,56 KB)
Gradivo ima več datotek! Več... |
43. In the constellation of dark personality traits : a scoping review of the dark personality coreNik Čavlovič, Vesna Jug, 2025, pregledni znanstveni članek Opis: Since the emergence of the Dark Triad/Dark Tetrad personality constructs, a growing body of literature has suggested a common core underlying socially aversive behaviors. With a multitude of diverse explanations on the horizon, the literature has become ambiguous and vague within the context of the dark personality framework, warranting further clarity. A scoping literature review was conducted by electronically searching five databases, yielding 12 articles included in the investigation. The results support the notion that the field of dark personality traits can progress from factorial trait labels toward a perspective where aversive traits are seen as emergent from interactions between individual components. These traits manifest as the most prominent candidate for the dark core, the Dark Factor of Personality (D), which encompasses the general tendency of malevolent characters in normal populations. The most notable measures in this context are the HEXACO model, with an emphasis on the Honesty-Humility dimension, and the D70, a set of items providing the most comprehensive representation of D. It is concluded that manifested socially aversive behaviors, accompanied by beliefs that serve as justifications, parallel two main components: the Antagonism component (promoting disutility for others) and the Emotional component (deficits in affective empathy).
Ključne besede: dark personality core, dark factor of personality, dark triad, dark tetrad, HEXACO honesty-humility
Objavljeno v RUP: 25.09.2025; Ogledov: 329; Prenosov: 7
Celotno besedilo (591,77 KB)
Gradivo ima več datotek! Več... |
44. Conformal hypergraphs : duality and implications for the upper clique transversal problemEndre Boros, Vladimir Gurvich, Martin Milanič, Yushi Uno, 2025, izvirni znanstveni članek Opis: Given a hypergraph H, the dual hypergraph of H is the hypergraph of all minimal transversals of H. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs. All these notions play an important role in many fields of mathematics and computer science, including combinatorics, algebra, database theory, etc. In this paper we study conformality of dual hypergraphs and prove several results related to the problem of recognizing this property. In particular, we show that the problem is in co-NP and can be solved in polynomial time for hypergraphs of bounded dimension. In the special case of dimension 3, we reduce the problem to 2-Satisfiability. Our approach has an implication in algorithmic graph theory: we obtain a polynomial-time algorithm for recognizing graphs in which all minimal transversals of maximal cliques have size at most k, for any fixed k.
Ključne besede: conformal hypergraph, dual hypergraph, hypergraph, maximal clique, upper clique transversal
Objavljeno v RUP: 25.09.2025; Ogledov: 323; Prenosov: 4
Celotno besedilo (475,86 KB)
Gradivo ima več datotek! Več... |
45. Is open source the future of AI? : a data-driven approachDomen Vake, Bogdan Šinik, Jernej Vičič, Aleksandar Tošić, 2025, izvirni znanstveni članek Opis: Large language models (LLMs) have become central to both academic research and industrial applications, fueling debates on their accuracy, usability, privacy, and potential misuse. While proprietary models benefit from substantial investments in data and computing resources, open-sourcing is often suggested as a means to enhance trust and transparency. Yet, open-sourcing comes with its own challenges, such as risks of illicit applications, limited financial incentives, and intellectual property concerns. Positioned between these extremes are hybrid approaches—including partially open models and licensing restrictions—that aim to balance openness with control. In this paper, we adopt a data-driven approach to examine the open-source development of LLMs. By analyzing contributions in model improvements, modifications, and methodologies, we assess how community efforts impact model performance. Our findings indicate that the open-source community can significantly enhance models, demonstrating that community-driven modifications can yield efficiency gains without compromising performance. Moreover, our analysis reveals distinct trends in community growth and highlights which architectures benefit disproportionately from open-source engagement. These insights provide an empirical foundation to inform balanced discussions among industry experts and policymakers on the future direction of AI development.
Ključne besede: large language models, artificial intelligence, open source, data science, HuggingFace
Objavljeno v RUP: 25.09.2025; Ogledov: 480; Prenosov: 4
Celotno besedilo (606,12 KB)
Gradivo ima več datotek! Več... |
46. Population structure and habitat connectivity of Phengaris teleius (Lepidoptera: Lycaenidae) in southern Slovenia : implications for conservation and landscape managementJure Jugovic, Ines Gorkič, Martina Lužnik, 2025, izvirni znanstveni članek Opis: We studied the vulnerable Scarce Large Blue butterfly (Phengaris teleius) population in loosely connected wet grasslands in southern Slovenia. Our goal was to understand the distribution and demographic traits of this population within the Seasonal Lakes of Pivka Nature Park (KP PPJ). From 2021 to 2022, we mapped suitable habitat patches in KP PPJ with the larval host plant Sanguisorba officinalis and host ant Myrmica spp. Out of eight identified potential patches, five were inhabited for at least one year. Our dispersal model, using an inverse-power function, indicated that all but one suitable patch could be connected by migrations of at least 1% of either sex, suggesting a metapopulation structure. The clustered habitat distribution (nearest neighbour index = 0.14) highlights the role of each patch as a “stepping stone” within the system. We also assessed demographic parameters in a subset of three patches: Klenik, Kalec, and Zagorje. In 2021, mark-release-recapture estimated the populations in two inhabited patches (Klenik, Kalec) at 197 males (95% CI: 159–265) and 315 females (95% CI: 205–525), showing a female-biased sex ratio (males : females = 1 : 1.6). We recorded a relatively long average life span (4.4 and 8.4 days for males and females, respectively) and a weak protandry, however about three-quarters of the population was present simultaneously, mainly in the largest patch (Klenik: > 85%). Recorded demographic traits (female-biased sex ratio, long lifespan, simultaneous peaks of both sexes, and high dispersal) support the persistence of this metapopulation. However, conservation efforts and a denser network of suitable patches are crucial to maintain its viability at this range’s southern edge.
Ključne besede: butterfly, mark-release-recapture, demography, movement, metapopulation
Objavljeno v RUP: 23.09.2025; Ogledov: 380; Prenosov: 8
Celotno besedilo (1,13 MB)
Gradivo ima več datotek! Več... |
47. Vertex numbers of simplicial complexes with free abelian fundamental groupFlorian Frick, Matt Superdock, 2025, izvirni znanstveni članek Opis: We show that the minimum number of vertices of a simplicial complex with fundamental group ℤn is at most O(n) and at least Ω(n3/4). For the upper bound, we use a result on orthogonal 1-factorizations of K2n. For the lower bound, we use a fractional Sylvester–Gallai result. This application of extremal results in discrete geometry seems to be new. We also prove that any group presentation ⟨S|R⟩ ≅ ℤn whose relations are of the form gahbic for g, h, i ∈ S has at least Ω(n3/2) generators.
Ključne besede: simplicial complex, fundamental group, incidence geometry
Objavljeno v RUP: 18.09.2025; Ogledov: 489; Prenosov: 8
Celotno besedilo (401,27 KB)
Gradivo ima več datotek! Več... |
48. On the metric subgraphs of a graphYanan Hu, Xingzhi Zhan, 2025, izvirni znanstveni članek Opis: The three subgraphs of a connected graph induced by the center, annulus and periphery are called its metric subgraphs. The main results are as follows. (1) There exists a graph of order n whose metric subgraphs are all paths if and only if n ≥ 13 and the smallest size of such a graph of order 13 is 22; (2) there exists a graph of order n whose metric subgraphs are all cycles if and only if n ≥ 15, and there are exactly three such graphs of order 15; (3) for every integer k ≥ 3, we determine the possible orders for the existence of a graph whose metric subgraphs are all connected k-regular graphs; (4) there exists a graph of order n whose metric subgraphs are connected and pairwise isomorphic if and only if n ≥ 24 and n is divisible by 3. An unsolved problem is posed.
Ključne besede: center, annulus, periphery, metric subgraphs, path, cycle
Objavljeno v RUP: 16.09.2025; Ogledov: 317; Prenosov: 8
Celotno besedilo (533,77 KB)
Gradivo ima več datotek! Več... |
49. Answers to questions about medial layer graphs of self-dual regular and chiral polytopesMarston Conder, Isabelle Steinmann, 2025, izvirni znanstveni članek Opis: An abstract n-polytope P is a partially-ordered set which captures important properties of a geometric polytope, for any dimension n. For even n ≥ 2, the incidences between elements in the middle two layers of the Hasse diagram of P give rise to the medial layer graph of P, denoted by G = G(P). If n = 4, and P is both highly symmetric and self-dual of type {p, q, p}, then a Cayley graph C covering G can be constructed on a group of polarities of P. In this paper we address some open questions about the relationship between G and C that were raised in a 2008 paper by Monson and Weiss, and describe some interesting examples of these graphs. In particular, we give the first known examples of improperly self-dual chiral polytopes of type {3, q, 3}, which are also among the very few known examples of highly symmetric self-dual finite polytopes that do not admit a polarity. Also we show that if p = 3 then C cannot have a higher degree of s-arc-transitivity than G, and we present a family of regular 4-polytopes of type {6, q, 6} for which the vertex-stabilisers in the automorphism group of C are larger than those for G.
Ključne besede: abstract polytope, regular polytope, chiral polytope, medial graph
Objavljeno v RUP: 16.09.2025; Ogledov: 338; Prenosov: 14
Celotno besedilo (576,38 KB)
Gradivo ima več datotek! Več... |
50. Growth, morphology and reproductive phenology of Gelidium adriaticum (Gelidiales, Rhodophyta) from the Slovenian coast (Gulf of Trieste, northern Adriatic)Claudio Battelli, Peter Glasnović, 2025, izvirni znanstveni članek Opis: The occurrence, growth, external morphology and reproductive phenology of a Gelidium adriaticum settlement from the midlittoral zone in St. Simon Bay (Slovenian coast, Gulf of Trieste, northern Adriatic Sea) were investigated. The study was based on monthly sampling conducted for one year, from January to December 2023. The studied settlement was well developed in shaded rock crevices, forming dense turfs with a very patchy and irregular distribution. It was character-ized by a slight predominance of tetrasporic thalli, with a ratio between the three reproductive stages (tetrasporic:sterile:cystocarpic) of 1.19:1.04:1.00. The mean values of the morphological characteristics studied (height and width of the thallus, width of the widest part of the thallus axis, width of the apical, middle and basal parts of the erect axes) varied between seasons and reproductive stages. In general, these values were lower in the cystocarpic thalli than those in the tetrasporic and sterile stages in all seasons.
Ključne besede: Gelidium adriaticum, midlittoral, growth, morphology, reproductive phenology, Slovenian coast, northern Adriatic
Objavljeno v RUP: 15.09.2025; Ogledov: 385; Prenosov: 4
Celotno besedilo (1,55 MB)
Gradivo ima več datotek! Več... |
