Iskanje po katalogu digitalne knjižnice

Opis: The masters thesis, which follows the paper Graph drawing applications in combinatorial theory of maturity models, in preparation, coauthored by the author of the thesis, introduces the tiled graphs as models of learning and maturing processes. In the thesis, we show how tiled graphs can combine graphs of learning spaces or antimatroids (partial cubes) and maturity models (total orders) to yield models of learning processes. We visualise processes with optimal drawings. In the thesis, we show NP-hardness of visualisation problems resulting from most detailed models. Further, we introduce a simpler model, which ignores the details of learning and for which the visualisation problem can be solved in a polynomial time. For the rest of the thesis, we consider this model. We describe an algorithm, which finds a drawing of an ordinal panel data graph with a minimal number of edge crossings. For this problem we further define an extremal crossing number for a chosen family of ordinal panel data. Further, we explore a certain type of random instances of ordinal panel data and the expected value of a crossing number for this type of random instances. After that, we define a problem of finding the most suitable ordering on categories in panel data, in other words finding the best maturity model to fit the data. We prove the NP-hardness of the problem and formulate an integer linear program. Master thesis consists of nine chapters. The first chapter contains known results and definitions from set and graph theory and a section of computational complexity theory (NP-hardness), which will be used throughout the thesis. The following chapters present the new theory introduced in the aforementioned paper in preparation and the needed additional results and definitions. In the last chapter we present the thesis and some selected parts of the thesis with the help of learning space theory. The chapter serves as both the overview of the thesis and the use case for the theory of learning spaces, presented in the thesis.
Ključne besede: Maturity models, learning spaces, crossing number, crossing minimisation, tile crossing number.
Objavljeno v DKUM: 14.03.2024; Ogledov: 463; Prenosov: 22
Celotno besedilo (1,46 MB)

Opis: Pursuit-evasion games study the number of cops needed to capture therobber in a game played on a graph, in which the cops and the robber movealternatively to neighbouring vertices, and the robber is captured if a copsteps on the vertex the robber is in. A common tool in analyzing this copnumber of a graph is a cop moving along a shortest path in a graph, thuspreventing the robber to step onto this path. We generalize this approach byintroducing a shadow of the robber, the maximal set of vertices from whichthe cop parries the protected subgraph. In this context, the robber becomesan intruder and the cop becomes the guard. We show that the shadow canbe computed in polynomial time, implying polynomial time algorithms forcomputing both a successful guard as well as a successful intruder, whicheverexists. Furthermore, we show that shadow function generalizes the conceptof graph retractions. In some cases, this implies a polynomially computablecertification of the negative answer to the NP-complete problem of existenceof a retraction to a given subgraph.
Ključne besede: pursuit-evasion game, graph searching, guarding, shadow function, graph retraction
Objavljeno v DKUM: 17.08.2023; Ogledov: 423; Prenosov: 46
Celotno besedilo (377,93 KB)
Gradivo ima več datotek! Več...

Opis: Priročnik primerov pedagoške prakse poučevanja in učenja na univerzitetnem nivoju z osredotočenostjo na naravoslovno-matematična področja je namenjen vsem visokošolskim učiteljem in sodelavcem, ki želijo v svoj pedagoški proces vpeljati preverjene pedagoške prakse z namenom izboljšati študijski uspeh in opolnomočiti študente z ustreznimi kompetencami za njihovo nadaljnjo karierno pot. V priročniku predstavimo proces usvajanja znanja od odkrivanja do uporabe skozi lestvico stopenj zrelosti tehnologij. Pri tem želimo poudariti omejenost virov kot so znanje, inteligenca, čustvena inteligenca, empatija, čas, pozornost, zaupanje in pomen njihovega optimalnega izkoriščanja. Skozi konkretne primere učinkovitih pedagoških praks želimo vzpodbuditi visokošolske učitelje in sodelavce, da v pedagoški proces vpeljejo sodobne metode učenja in jih kombinirajo s tradicionalnimi.
Ključne besede: univerzalni model procesa, tehnološka zrelost, učinkovite pedagoške prakse, naravoslovje, matematika
Objavljeno v DKUM: 16.05.2022; Ogledov: 719; Prenosov: 102
Celotno besedilo (3,07 MB)
Gradivo ima več datotek! Več...

Opis: Perceptual researchers often argue that natural selection supports veridical perceptions, respectively those that accurately reflect the environment. They also claim that beings whose perceptions are truer are also more fit. This assumption was tested using standard tools of evolutionary game theory in a simple environment. The result was that more veridical perceptions are not necessarily more successful. In the majority of the parameter space, veridical perceptions are extinct in competition with simplified perceptions, based on adaptive behavior in a given environment. In the thesis, we build upon mentioned territorial games introduced by Mark, Marion, and Hoffman in 2010, and extend four of their territory perception and selection strategies with two novel ones that together constitute a model of technological readiness valley of death. Whenever utility of a resource is not monotonous in the amount of that resource, the technological valley of death emerges. While the development of the science behind these models is in its infancy, modeling and understanding the phenomenon may shed light on progress and related phenomena in society.
Ključne besede: evolution, perception, utility, Monte Carlo simulation, game theory
Objavljeno v DKUM: 22.11.2019; Ogledov: 1781; Prenosov: 188
Celotno besedilo (1,56 MB)

Opis: Prodiranje podatkovno gnanih storitev v organizacije prinaša poleg novih poslovnih procesov, možnosti in priložnosti tudi vrsto izzivov. Kakršnokoli na podatkih utemeljeno modeliranje ima lahko podlago le v kakovostnih, realno stanje natančno odsevajočih podatkih. V magistrskem delu je predstavljen model, ki s spremljanjem kakovosti podatkovnih virov omogoča njihovim upravnikom pridobiti informacije o kakovosti posameznih podatkovnih tokov, kar jim posledično pomaga pri odpravljanju nepravilnosti in dvigu njihove kakovosti. Modeli kakovosti podatkov iz literature lahko vključujejo kar več deset kategorij kakovosti, med katerimi so najpogosteje uporabljene popolnost, rednost, usklajenost in natančnost. Vsaka kategorija kakovosti ima definirana različna preverjanja oz. validacije, s pomočjo katerih se šteje ali kako drugače analizira meritve, ki ne izpolnjujejo pogojev te kategorije kakovosti in tako se pridobi kazalnike kakovosti podatkov. Predstavljen je tudi taksonomski pregled omenjenih kategorij kakovosti, področij, na katerih se uporabljajo, ter kriterijev za primernost njihove uporabe. Model in indikatorji kakovosti so ilustrirani s primerom vrednotenja kakovosti podatkov za potrebe napovedovanja proizvodnje sončnih elektrarn. Rezultati kažejo na to, da delež nekakovostnih podatkov občutno vpliva na napake pri napovedovanju fotovoltaične proizvodnje električne energije. Pomembno se zdi izpostaviti, da je dodana vrednost magisterija koncept vrednotenja modelskih napak in samostojno dodana preverjanja ter opis modela kazalnikov kakovosti, kar se je razvijalo in dopolnjevalo skozi več uspešno izpeljanih projektov na to temo.
Ključne besede: Model kakovosti podatkov, dimenzije kakovosti podatkov, kazalniki kakovosti, osamelci, taksonomija, Monte Carlo simulacija, vrednotenje napak, napovedovanje proizvodnje električne energije.
Objavljeno v DKUM: 05.11.2019; Ogledov: 1464; Prenosov: 32
Celotno besedilo (1,40 MB)