1. Distancebased Invariants and Measures in GraphsAleksander Kelenc, 2019, doctoral dissertation Abstract: This doctoral dissertation is concerned with aspects on distance related topics in graphs. We study three main topics, namely a recently introduced measure called the Hausdorff distance of graphs and two new graph invariants  the edge metric dimension and the mixed metric dimension of graphs. All three topics are part of the metric graph theory since they are tightly connected with the basic concept of distance between two vertices of a graph.
The Hausdorff distance is a relatively new measure of the similarity of graphs.
The notion of the Hausdorff distance considers a special kind of common subgraph of the compared graphs and depends on the structural properties outside of the common subgraph. We study the Hausdorff distance between certain families of graphs that often appear in chemical graph theory. Next to a few results for general graphs, we determine formulae for the distance between paths and cycles.
Previously, there was no known efficient algorithm for the problem of determining the Hausdorff distance between two trees, and in this dissertation we present a polynomialtime algorithm for it. The algorithm is recursive and it utilizes the divide and conquer technique. As a subtask it also uses a procedure that is based on the wellknown graph algorithm for finding a maximum bipartite matching.
The edge metric dimension is a graph invariant that deals with distinguishing the edges of a graph. Let $G=(V(G),E(G))$ be a connected graph, let $w \in V(G)$ be a vertex, and let $e=uv \in E(G)$ be an edge. The distance between the vertex $w$ and the edge $e$ is given by $d_G(e,w)=\min\{d_G(u,w),d_G(v,w)\}$. A vertex $w \in V(G)$ distinguishes two edges $e_1,e_2 \in E(G)$ if $d_G(w,e_1) \ne d_G(w,e_2)$. A set $S$ of vertices in a connected graph $G$ is an edge metric generator of $G$ if every two distinct edges of $G$ are distinguished by some vertex of $S$. The smallest cardinality of an edge metric generator of $G$ is called the edge metric dimension and is denoted by $dim_e(G)$. The concept of the edge metric dimension is new. We study its mathematical properties. We make a comparison between the edge metric dimension and the standard metric dimension of graphs while presenting some realization results concerning the two. We prove that computing the edge metric dimension of connected graphs is NPhard and give some approximation results. Moreover, we present bounds and closed formulae for the edge metric dimension of several classes of graphs.
The mixed metric dimension is a graph invariant similar to the edge metric dimension that deals with distinguishing the elements (vertices and edges) of a graph. A vertex $w \in V(G)$ distinguishes two elements of a graph $x,y \in E(G)\cup V(G)$ if $d_G(w,x) \ne d_G(w,y)$. A set $S$ of vertices in a connected graph $G$ is a mixed metric generator of $G$ if every two elements $x,y \in E(G) \cup V(G)$ of $G$, where $x \neq y$, are distinguished by some vertex of $S$. The smallest cardinality of a mixed metric generator of $G$ is called the mixed metric dimension and is denoted by $dim_m(G)$. In this dissertation, we consider the structure of mixed metric generators and characterize graphs for which the mixed metric dimension equals the trivial lower and upper bounds. We also give results on the mixed metric dimension of certain families of graphs and present an upper bound with respect to the girth of a graph. Finally, we prove that the problem of determining the mixed metric dimension of a graph is NPhard in the general case. Keywords: Hausdorff distance, distance between graphs, graph algorithms, trees, graph similarity, edge metric dimension, edge metric generator, mixed metric dimension, metric dimension Published: 03.08.2020; Views: 239; Downloads: 44 Full text (800,48 KB) 
2. Natureinspired algorithms for hyperparameter optimizationFilip Glojnarić, 2019, master's thesis Abstract: This master thesis is focusing on the utilization of natureinspired algorithms for hyperparameter optimization, how they work and how to use them. We present some existing methods for hyperparameter optimization as well as propose a novel method that is based on six different natureinspired algorithms: Firefly algorithm, Grey Wolf Optimizer, Particle Swarm Optimization, Genetic algorithm, Differential Evolution, and Hybrid Bat algorithm. We also show the optimization results (set of hyperparameters) for each algorithm and we present the plots of the accuracy for each combination and handpicked one. In discussion of the results, we provide the answers on our research questions as well as propose ideas for future work. Keywords: artificial intelligence, artificial neural networks, machine learning, natureinspired algorithms, evolutionary algorithms Published: 09.12.2019; Views: 500; Downloads: 58 Full text (969,13 KB) 
3. Differential evolution and largescale optimization applicationsAleš Zamuda, scientific or documentary film, sound or video publication Abstract: Differential Evolution (DE) is one of the most popular, highperformance optimization algorithms with variants that have been outperforming others for years. As a result, DE has grown to accommodate wide usage for a variety of disciplines across scientific fields. Differential Evolution and LargeScale Optimization Applications presents a researchbased overview and crossdisciplinary applications of optimization algorithms. Emphasizing applications of Differential Evolution (DE) across sectors and laying the foundation for further use of DE algorithms in realworld settings, this video is an essential resource for researchers, engineers, and graduatelevel students. Topics Covered : Algorithms, Optimization, Parallel Differential Evolution, Performance Improvement, Stochastic Methods, Tree Model Reconstruction. Keywords: differential Evolution, optimization, algorithms, stochastic methods, tree models, tree model reconstruction Published: 14.05.2019; Views: 449; Downloads: 145 Link to file This document has many files! More...

4. Multiobjective optimization algorithms with the island metaheuristic for effective project management problem solvingChristina Brester, Ivan Ryzhikov, Eugene Semenkin, 2017, original scientific article Abstract: Background and Purpose: In every organization, project management raises many different decisionmaking problems, a large proportion of which can be efficiently solved using specific decisionmaking support systems. Yet such kinds of problems are always a challenge since there is no timeefficient or computationally efficient algorithm to solve them as a result of their complexity. In this study, we consider the problem of optimal financial investment. In our solution, we take into account the following organizational resource and project characteristics: profits, costs and risks.
Design/Methodology/Approach: The decisionmaking problem is reduced to a multicriteria 01 knapsack problem. This implies that we need to find a nondominated set of alternative solutions, which are a tradeoff between maximizing incomes and minimizing risks. At the same time, alternatives must satisfy constraints. This leads to a constrained twocriterion optimization problem in the Boolean space. To cope with the peculiarities and high complexity of the problem, evolutionbased algorithms with an island metaheuristic are applied as an alternative to conventional techniques.
Results: The problem in hand was reduced to a twocriterion unconstrained extreme problem and solved with different evolutionbased multiobjective optimization heuristics. Next, we applied a proposed metaheuristic combining the particular algorithms and causing their interaction in a cooperative and collaborative way. The obtained results showed that the island heuristic outperformed the original ones based on the values of a specific metric, thus showing the representativeness of Pareto front approximations. Having more representative approximations, decisionmakers have more alternative project portfolios corresponding to different risk and profit estimations. Since these criteria are conflicting, when choosing an alternative with an estimated high profit, decisionmakers follow a strategy with an estimated high risk and vice versa.
Conclusion: In the present paper, the project portfolio decisionmaking problem was reduced to a 01 knapsack constrained multiobjective optimization problem. The algorithm investigation confirms that the use of the island metaheuristic significantly improves the performance of genetic algorithms, thereby providing an efficient tool for Financial Responsibility Centres Management. Keywords: 01 multiobjective constrained knapsack problem, project management portfolio problem, multiobjective evolutionbased optimization algorithms, collaborative and cooperative metaheuristics Published: 04.05.2018; Views: 618; Downloads: 189 Full text (993,98 KB) This document has many files! More...

5. Limit cycle bifurcated from a center in a three dimensional systemBo Sang, Brigita Ferčec, QinLong Wang, 2016, original scientific article Abstract: Based on the pseudodivision algorithm, we introduce a method for computing focal values of a class of 3dimensional autonomous systems. Using the $Є^1$order focal values computation, we determine the number of limit cycles bifurcating from each component of the center variety (obtained by Mahdi et al). It is shown that at most four limit cycles can be bifurcated from the center with identical quadratic perturbations and that the bound is sharp. Keywords: algorithms, three dimensional systems, focal value, limit cycle, Hopf bifurcation, center Published: 08.08.2017; Views: 1247; Downloads: 99 Full text (236,33 KB) This document has many files! More...

6. Computing the Szeged indexJanez Žerovnik, 1996, original scientific article Abstract: We give an explicit algorithm for computing the Szeged index of a graph which runs in ▫$O(mn)$▫ time, where ▫$n$▫ is the number of nodes and ▫$m$▫ is the number of edges. Keywords: mathematics, chemistry, chemical graph theory, molecular graphs, structural formulae, algorithms, topological index, Szeged index Published: 05.07.2017; Views: 614; Downloads: 80 Full text (1,83 MB) This document has many files! More...

7. A novel hybrid selfadaptive bat algorithmIztok Fister, Simon Fong, Janez Brest, Iztok Fister, 2014, original scientific article Abstract: Natureinspired algorithms attract many researchers worldwide for solving the hardest optimization problems. One of the newest members of this extensive family is the bat algorithm. To date,many variants of this algorithm have emerged for solving continuous as well as combinatorial problems. One of the more promising variants, a selfadaptive bat algorithm, has recently been proposed that enables a selfadaptation of its control parameters. In this paper, we have hybridized this algorithmusing differentDE strategies and applied these as a local search heuristics for improving the current best solution directing the swarm of a solution towards the better regions within a search space.The results of exhaustive experiments were promising and have encouraged us to invest more efforts into developing in this direction. Keywords: algorithms, optimization Published: 15.06.2017; Views: 915; Downloads: 261 Full text (1,92 MB) This document has many files! More...

8. Gesture recognition from data streams of human motion sensor using accelerated PSO swarm search feature selection algorithmSimon Fong, Justin Liang, Iztok Fister, Iztok Fister, Sabah Mohammed, 2015, original scientific article Abstract: Human motion sensing technology gains tremendous popularity nowadays with practical applications such as video surveillance for security, hand signing, and smarthome and gaming. These applications capture human motions in realtime from video sensors, the data patterns are nonstationary and ever changing. While the hardware technology of such motion sensing devices as well as their data collection process become relatively mature, the computational challenge lies in the realtime analysis of these live feeds. In this paper we argue that traditional data mining methods run short of accurately analyzing the human activity patterns from the sensor data stream. The shortcoming is due to the algorithmic design which is not adaptive to the dynamic changes in the dynamic gesture motions. The successor of these algorithms which is known as data stream mining is evaluated versus traditional data mining, through a case of gesture recognition over motion data by using Microsoft Kinect sensors. Three different subjects were asked to read three comic strips and to tell the stories in front of the sensor. The data stream contains coordinates of articulation points and various positions of the parts of the human body corresponding to the actions that the user performs. In particular, a novel technique of feature selection using swarm search and accelerated PSO is proposed for enabling fast preprocessing for inducing an improved classification model in realtime. Superior result is shown in the experiment that runs on this empirical data stream. The contribution of this paper is on a comparative study between using traditional and data stream mining algorithms and incorporation of the novel improved feature selection technique with a scenario where different gesture patterns are to be recognized from streaming sensor data. Keywords: algorithms, human motion sensors, PSO Published: 07.04.2017; Views: 933; Downloads: 277 Full text (4,31 MB) This document has many files! More...

9. Web application for hierarchical organizational structure optimizationDavorin Kofjač, Blaž Bavec, Andrej Škraba, 2015, original scientific article Abstract: Background and Purpose: In a complex strictly hierarchical organizational structure, undesired oscillations may occur, which have not yet been adequately addressed. Therefore, parameter values, which define fluctuations and transitions from one state to another, need to be optimized to prevent oscillations and to keep parameter values between lower and upper bounds. The objective was to develop a simulation model of hierarchical organizational structure as a web application to help in solving the aforementioned problem.
Design/Methodology/Approach: The hierarchical structure was modeled according to the principles of System Dynamics. The problem of the undesired oscillatory behavior was addressed with deterministic finite automata, while the flow parameter values were optimized with genetic algorithms. These principles were implemented as a web application with JavaScript/ECMAScript.
Results: Genetic algorithms were tested against wellknown instances of problems for which the optimal analytical values were found. Deterministic finite automata was verified and validated via a threestate hierarchical organizational model, successfully preventing the oscillatory behavior of the structure.
Conclusion: The results indicate that the hierarchical organizational model, genetic algorithms and deterministic finite automata have been successfully implemented with JavaScript as a web application that can be used on mobile devices. The objective of the paper was to optimize the flow parameter values in the hierarchical organizational model with genetic algorithms and finite automata. The web application was successfully used on a threestate hierarchical organizational structure, where the optimal flow parameter values were determined and undesired oscillatory behavior was prevented. Therefore, we have provided a decision support system for determination of quality restructuring strategies. Keywords: hierarchical organizational structure, genetic algorithms, deterministic finite automata, system dynamics, optimization, human resources Published: 04.04.2017; Views: 688; Downloads: 58 Full text (1,19 MB) This document has many files! More...

10. A numerical simulation of metal injection mouldingBoštjan Berginc, Miran Brezočnik, Zlatko Kampuš, Borivoj Šuštaršič, 2009, original scientific article Abstract: Metal injection moulding (MIM) is already a wellestablished and promising technology for the mass production of small, complex, nearnetshape products. The dimensions and mechanical properties of MIM products are influenced by the feedstock characteristics, the process parameters of the injection moulding, as well as the debinding and the sintering. Numerical simulations are a very important feature of the beginning of any product or technology development. In the article two different techniques for measuring the rheological properties of MIM feedstocks are presented and compared. It was established that capillary rheometers are more appropriate for MIM feed stocks, while on the other hand, parallelplate rheometers are only suitable for shear rates lower than 10 s[sup]{1}. Later on we used genetic algorithms to determine the model coefficients for some numerical simulation software. The results of the simulation of the filling phase and a comparison with the experimental results are presented in the article. Keywords: metal injection moulding, numerical simulation, genetic algorithms Published: 14.03.2017; Views: 577; Downloads: 119 Full text (1,65 MB) This document has many files! More...
