Nacionalni portal odprte znanosti

Kim T., Choi K., Moon S.:
A SYSTEM DYNAMICS APPROACH TO MAINTENANCE CAPACITY OPTIMIZATION UNDER SPLIT ACQUISITION: A MILITARY CASE STUDY
Fakulteta za strojništvo

This study examines maintenance capacity adjustment strategies under split acquisition, a common practice in defense procurement driven by budgetary and production constraints. Using the Republic of Korea Air Force (R

Zhao Y., Ma Z., Wang Y., Su X.:
DYNAMIC RAW MATERIAL ORDERING UNDER DEMAND UNCERTAINTY: A MARKOV CHAIN–NEWSVENDOR APPROACH
Fakulteta za strojništvo

Marič Maja:
RAZISKOVANJE POVEZANOSTI MED SHIZOFRENIJO, PSIHOPATIJO IN KRIMINALNIM VEDENJEM
Fakulteta za varnostne vede

Zaključno delo obravnava metodološke značilnosti kvantitativnih raziskav, ki proučujejo povezanost med psihopatijo, shizofrenijo oziroma motnjami iz spektra shizofrenije in kriminalnim vedenjem. Namen naloge je bil analizirati raziskovalne načrte, način vzorče

Mohorko Luka:
VPLIV ČUSTVENČKOV NA ZAZNANO KREDIBILNOST PHISHING SPOROČIL V STAROSTNI SKUPINI 45‒54 LET
Fakulteta za varnostne vede

V diplomski nalogi je bil preučen vpliv uporabe emojijev na zaznano kredibilnost phishing sporočil v starostni skupini med 45 in 54 let. Namen raziskave je bil ugotoviti, ali prisotnost emojijev vpliva na zaznavo zaupanja vrednosti phishing sporoč

Li Y. X., Chen H., Zhou L.:
INDUSTRIAL MULTI-OBJECT DETECTION FOR AUTOMOTIVE BATTERY MANUFACTURING USING A CBAM-ENHANCED YOLOV5 FRAMEWORK
Fakulteta za strojništvo

The mixing stage of automotive battery production requires reliable monitoring of raw material types, personnel actions, and correct tool use. However, accurate multi-scale object detection in complex scenes remains

Krebs Lucija:
OBVEŠČEVALNI NEUSPEH IZRAELA
Fakulteta za varnostne vede

V diplomski nalogi je obravnavan obveščevalni neuspeh Izraela ob napadu Hamasa 7. oktobra 2023. Namen naloge je bilo ugotoviti, kateri dejavniki v obveščevalnem procesu so prispevali k temu, da Izrael napada ni pravočasno zaznal, pravilno interpretiral in preprečil. Naloga je sestavljena iz teoretičnega in

Kondić Janko:
IMPLEMENTACIJA IN ANALIZA VISOKO ZMOGLJIVEGA SISTEMA ZA PREDPOMNJENJE PODATKOV V DELOVNEM POMNILNIKU
Fakulteta za matematiko, naravoslovje in informacijske tehnologije

Marinković Boris:
ASSEMBLY REALITY
Fakulteta za matematiko, naravoslovje in informacijske tehnologije

Anbar Nurdagül, Kalaycı Tekgül, Meidl Wilfried:
A SURVEY ON BENT PARTITIONS
Fakulteta za matematiko, naravoslovje in informacijske tehnologije

Since their introduction, many results on bent partitions appeared in various directions and in several papers. The objective of this survey is to provide an introduction to this relatively young topic and a comprehensive overview of th

Mileski Vanja, Vičič Jernej, Kavšek Branko:
TIME SERIES FORECASTING OF CUSTOMER SPEND USING INCEPTION-RESIDUAL CONVOLUTIONAL NEURAL NETWORKS
Fakulteta za matematiko, naravoslovje in informacijske tehnologije

This paper addresses next-month customer spend forecasting in retail using a large-scale, multi- year dataset from a major Slovenian retailer. The dataset consists of 247,

Barber Rachel, Dobson Edward Tauscher:
FINDING AUTOMORPHISM GROUPS OF DOUBLE COSET GRAPHS AND CAYLEY GRAPHS ARE EQUIVALENT PROBLEMS
Fakulteta za matematiko, naravoslovje in informacijske tehnologije

It has long been known that a vertex-transitive graph Γ Γ is isomorphic to a double coset graph Cos⁡(G,H,S) Cos(G,H,S), where G≤Aut⁡(Γ) G≤Aut(Γ) is a transitive group, H≤G H≤G is a

Šprem Nikica, Papakostas Konstantinos, Rodriguez Recio Mariano, Gančević Pavao, Corlatti Luca, Jerina Klemen:
NATURALIZED RANGE EXPANSION
Fakulteta za matematiko, naravoslovje in informacijske tehnologije

Introduced ungulates can threaten native species through habitat modification, competition, pathogen transmission, or hybridization. Aoudad Ammotragus lervia, a species nativ

Reixach Jaume, Blum Christian, Djukanović Marko, Raidl Günther R.:
A NEURAL NETWORK BASED GUIDANCE FOR A BRKGA
Univerza v Novi Gorici

In this work we apply machine learning to better guide a biased random key genetic algorithm (Brkga) for the longest common square subsequence (LCSqS) problem. The problem is a variant of the well-known longest common subsequence (LCS) problem i

Reixach Jaume, Blum Christian, Djukanović Marko, Raidl Günther R.:
A BIASED RANDOM KEY GENETIC ALGORITHM FOR SOLVING THE LONGEST COMMON SQUARE SUBSEQUENCE PROBLEM
Univerza v Novi Gorici

This article considers the longest common square subsequence (LCSqS) problem, a variant of the longest common subsequence (LCS) problem in which solutions must be square strings. A square strin

Iurlano Enrico, Zec Tatjana, Djukanović Marko, Raidl Günther R.:
SIGNED DOUBLE ROMAN DOMINATION ON CUBIC GRAPHS
Univerza v Novi Gorici

The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from {±1,2,3} to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility is given whe

Djukanović Marko, Kartelj Aleksandar, Eftimov Tome, Reixach Jaume, Blum C.:
EFFICIENT SEARCH ALGORITHMS FOR THE RESTRICTED LONGEST COMMON SUBSEQUENCE PROBLEM
Univerza v Novi Gorici

This paper deals with the restricted longest common subsequence (RLCS) problem, an extension of the well-studied longest common subsequence problem involving two sets of strings: the input strings a

Iurlano Enrico, Raidl Günther R., Djukanović Marko:
THE GRAPH BURNING PROBLEM UNDER CONSTRAINED DIFFUSION
Univerza v Novi Gorici

Relying on a simplified model of fire spread, the Graph Burning Problem is an NP-hard combinatorial optimization problem that yields a metric of social contagion or vulnerability of a network. It concerns a discrete-time process on a simple undirecte

Djukanović Marko:
EXACT AND HEURISTIC APPROACHES FOR SOLVING STRING PROBLEMS FROM BIOINFORMATICS
Univerza v Novi Gorici

This thesis provides several new algorithms for solving prominent string problems from the literature, most of these being variants of the well-known longest common subsequence (LCS) problem. Given a set of input strings, a longest common subsequence is a str