68 results on '"Graph"'
Search Results
2. Problem maksimalnog protoka
- Author
-
Piplica, Jelena, Perić, Jurica, Klaričić Bakula, Milica, and Laštre, Ana
- Subjects
put ,arc ,Ford-Fulkerson algorithm ,digraph ,Dijkstra algoritam ,augmenting path ,rezidualni kapacitet ,PRIRODNE ZNANOSTI. Matematika ,Ford-Fulkerson algoritam ,težinska funkcija ,minimalni rez ,Dijkstra’s algorithm ,graf ,rezidualni graf ,Bellman-Ford algoritam ,residual capacity ,weight function ,Bellman-Ford algorithm ,path ,digraf ,stablo ,graph ,tree ,minimum cut ,uvećavajući put ,network ,mreža ,residual graph ,NATURAL SCIENCES. Mathematics ,luk - Abstract
Dijkstra algoritam i Bellman-Ford algoritam su algoritmi koji se koriste za pronalaženje najkraćeg puta u težinskom grafu. Dijkstra algoritam djeluje na pozitivnim težinama bridova i koristi se za pronalaženje najkraćeg puta od jednog početnog vrha do svih ostalih vrhova u grafu. Bellman-Ford algoritam, s druge strane, može se koristiti čak i kada postoje negativne težine bridova, ali ima složenost vremena veću od Dijkstra algoritma. Ford-Fulkerson algoritam koristi se za pronalaženje maksimalnog mrežnog protoka, a temelji se na uvećavajućim putevima. Ovaj algoritam iterativno pronalazi uvećavajuće puteve i uvećava protok dok ne postigne maksimalni protok. Ovi algoritmi su važan alat za rješavanje različitih problema u području grafova i optimizacije., Dijkstra’s algorithm and Bellman-Ford algorithm are algorithms used to find the shortest path in a weighted graph. Dijkstra’s algorithm works with positive edge weights and is used to find the shortest path from a single source node to all other nodes in the graph. On the other hand, the Bellman-Ford algorithm can handle graphs with negative edge weights but has a higher time complexity compared to Dijkstra’s algorithm. The Ford-Fulkerson algorithm is used to find the maximum flow in a network and is based on augmenting paths. This algorithm iteratively finds augmenting paths and increases the flow until it reaches the maximum flow. All algorithms are important tools for solving various graph and optimization problems.
- Published
- 2023
3. Implementacija i primjena algoritama za problem najkraćeg puta
- Author
-
Udiljak, Karla and Horvat Dmitrović, Lana
- Subjects
algoritmi za pronalazak najkraćeg puta ,TECHNICAL SCIENCES. Computing ,Dijkstra ,TEHNIČKE ZNANOSTI. Računarstvo ,problem najkraćeg puta ,A ,graf ,graph ,shortest path algorithms ,shortest path problem - Abstract
Problem najkraćeg puta modelira se pomoću grafova, a svodi se na traženje podgrafa s najmanjom težinom. Dijeli se na četiri varijante: najkraći put od jednog početnog vrha do svih ostalih, od svih ostalih do jednog odredišnog, između jednog para vrhova te između svih parova vrhova u grafu. Detaljno su objašnjeni algoritmi BFS, Dijkstrin i Bellman-Ford koji rješavaju prva dva navedena tipa problema, Floyd-Warshall i Johnson se primjenjuju kod četvrte varijante problema te A* koji pronalazi najkraći put kod trećeg navedenog tipa problema. Problem svoju primjenu nalazi u navigaciji kao što je to Google Maps, komunikacijskim sustavima, Internet usmjeravanju, društvenim mrežama i brojnim drugim. U sklopu rada implementirani su i uspoređeni Dijkstrin i A* algoritmi na jednostavnom navigacijskom programu. The shortest path problem is modeled using graphs, and is based on searching for the subgraph with the smallest weight. Four types of shortest path problem are: Single-Source Shortest-Path Problem, Single-Destination Shortest-Path Problem, Single-Pair Shortest-Path Problem and All-Pairs Shortest-Path Problem. The explained algorithms are BFS, Dijkstra and Bellman-Ford algorithms that solve the first two types of problems, Floyd-Warshall and Johnson used for the fourth variant of the problem, and A*, which finds the shortest path for the third type of problem. The problem finds its application in navigation such as Google Maps, communication systems, Internet routing, social networks and many others. As part of the work, Dijkstra's and A* algorithms were implemented and compared on a simple navigation program.
- Published
- 2023
4. Primjena neuralnih mreža na bojanje grafova
- Author
-
Roginić, Matija and Pavčević, Mario Osvin
- Subjects
kromatski broj ,model ,NP-potpun ,neural network ,chromatic number ,TECHNICAL SCIENCES. Computing ,TEHNIČKE ZNANOSTI. Računarstvo ,neuralna mreža ,graf ,graph ,NP-complete - Abstract
Početni problem bio je razvijanje neuralne mreže za određivanje kromatskog broja grafa. Odlučili smo se za konvolucijsku neuralnu mrežu zato što prema literaturi daje najbolje rezultate za ovakav problem. Na raspolaganju smo imali bazu od 1000 grafova koje smo podijelili u tri skupa (za učenje, provjeru i testiranje). Mrežu smo istrenirali te zatim provjerili njene performanse na skupu za testiranje. Došli smo do rezultata da u 80% slučajeva ona točno predviđa kromatski broj. Zatim smo napravili usporedbu s manjim skupom podataka gdje smo iz početnog skupa uzeli prvo 500, a zatim i 250 grafova te na njima proveli isti postupak i došli do zaključka da u našem slučaju veličina skupa podataka ne igra značajnu ulogu. Our problem was developing a neural network for determining a chromatic number of a graph. We have decided on a convolutional neural network, because, according to the literature, it gives the best result for a problem like ours. On disposal, we have a database with 100 graphs, and we split them into three sets (for training, validation and testing). We train our network and check its performance on a training set. The result was, that in 80% of cases, it correctly predicts a chromatic number. Then we make a comparison with a smaller dataset where we take 500 and 250 graphs from the original dataset and repeat the same procedure. The conclusion was that, in our case, the size of a dataset does not have a significant role.
- Published
- 2023
5. Tree-search algorithms
- Author
-
Pintur, Antonela, Vojković, Tanja, Laštre, Ana, and Erceg, Goran
- Subjects
Jarnik-Prim ,Boruvka-Kruskal ,PRIRODNE ZNANOSTI. Matematika ,Dijkstra ,minimal spanning tree ,minimalno razapinjuće stablo ,graf ,graph ,NATURAL SCIENCES. Mathematics - Abstract
Teorija grafova je danas iznimno popularna grana matematike sa širokim primjenama. Najčešće primjene su u rješavanju problema pronalaska najkraćih puteva kako bi se minimizirali razni troškovi pa je korisno pogledati različite algoritme pretrage koje imamo u stablima. Najpoznatiji algoritmi su Jarnik-Prim algoritam i Boruvka-Kruskal kojima je jedina razlika u redoslijedu odabira bridova (”puteva”), a kao rezultat daju jednako stablo., Graph theory is lately an extremely popular branch of mathematics with wide applications. The most common applications are in solving problems of finding the shortest paths to minimize various costs, so it is useful to look and understand different types of search algorithms that are used in trees. The most famous algorithms are Jarnik-Prim algorithm and Boruvka-Kruskal. The only difference between these two is in the order selection of edges (”paths“) but the result is the same tree in both cases.
- Published
- 2023
6. Discharging method
- Author
-
Čondić, Ante, Vojković, Tanja, Laštre, Ana, and Jelić, Ivan
- Subjects
PRIRODNE ZNANOSTI. Matematika ,graph theory ,bojenje grafova ,graph coloring ,graf ,graph ,NATURAL SCIENCES. Mathematics ,planarni grafovi ,teorija grafova ,planar graphs - Abstract
Cilj ovog rada bio je objasniti primjenu metode pražnjenja koja ima važnu ulogu u teoriji grafova i korištena je u slavnom dokazu teorema o četiri boje. Metoda se provodi kroz dva koraka, dodjeljivanje naboja vrhovima, bridovima ili stranama grafa te premještanje tih naboja po određenom skupu pravila. Kroz razne primjere u planarnim grafovima i bojenjima smo pokazali kako navedena metoda funkcionira., The aim of this work was to explain the application of discharging method, which has an important role in graph theory and was used in the famous proof of the four color theorem. The method is implemented through two steps, assigning charges to the vertices, edges or faces of the graph and moving these charges according to a certain set of rules. Through various examples in planar graphs and colorings, we have shown how the specified method works.
- Published
- 2023
7. ELEMENTARY FUNCTIONS IN MECHANICAL ENGINEERING
- Author
-
Kadić, Paulina, Čuletić Čondrić, Maja, Stoić, Marija, and Lacković, Ivica
- Subjects
application of elementary functions ,elementary functions ,properties ,graph - Abstract
Elementarne funkcije su funkcije koje se mogu dobiti iz potencija, eksponencijalnih, logaritamskih, trigonometrijskih i arcus funkcija pomoću primjena četiri računske radnje i kompozicije funkcija. Postoji devet elementarnih funkcija, to su: polinomi, racionalna, eksponencijalna, logaritamska, hiperbolna, area, trigonometrijska te ciklometrijska funkcija i opće potencije. Zadatak ovog završnog rada je prikaz njihovih svojstava, grafičkih prikaza te primjeri primjene u strojarstvu. Neka od svojstava za funkcije navedena u ovom radu su: nultočke, parnost i neparnost, domena, jesu li funkcije rastuće ili padajuće, maksimum i minimum. Svaka se elementarna funkcija može prikazati i grafički. Većina funkcija prikazana grafički je krivulja dok je jedino graf linearne funkcije pravac., Elementary functions can be obtained from powers, exponential, logarithmic, trigonometric and arcus functions by applying the four arithmetic operations and composition of functions. There are nine elementary functions: polynomials, rational, exponential, logarithmic, hyperbolic, area, trigonometric and cyclometric functions and general powers. The task of this final paper is to present their properties, graphic representations and examples of application in mechanical engineering. Some properties for functions listed in this paper are nullpoints, parity and odd, domain, whether functions are increasing or decreasing, maximum and minimum. Each elementary function can also be displayed graphically. Most functions shown graphically are curves, while only the graph of a linear function is a straight line.
- Published
- 2022
8. Some families of incidence geometries
- Author
-
Obadić, Sandra, Švob, Andrea, Mostarac, Nina, and Grbac, Ana
- Subjects
relation ,affine plane ,geometry ,vector subspace ,line ,point ,graph ,projective plane - Abstract
U ovom radu zanimat će nas područje incidencijskih geometrija koje se sastoje od nepraznog skupa točaka i pravaca te je njihova veza opisana relacijom incidencije. Proučavat ćemo neke najpoznatije familije tih geometrija te istražiti i neka njihova svojstva., In this paper, we will be interested in the field of incidence geometries, which consist of a non-empty set of points and a possibily empty set of lines, and their connection is described by the incidence relation. We will study some of the most famous families of these geometries and show some of their properties.
- Published
- 2022
9. Program for visualizing the relationship between functions, derivatives and integrals
- Author
-
Gorup, Andrija and Pašić, Mervan
- Subjects
function ,algorithm ,Android ,TECHNICAL SCIENCES. Computing ,TEHNIČKE ZNANOSTI. Računarstvo ,derivacija ,derivative ,algoritam ,graf ,funkcija ,graph ,integral ,Java - Abstract
U ovom radu opisan je proces izrade aplikacije za iscrtavanje grafova funkcija, derivacija i integrala. Opisani su svi algoritmi korišteni za programsko stvaranje matematičkih funkcija iz ulaznog teksta, kao i svi algoritmi i metode za iscrtavanje grafova na zaslon. Naglasak je stavljen na poopćene algoritme umjesto konkretnih implementacija. This paper describes the process of creating an application for plotting graphs of functions, derivatives, and integrals. All algorithms used to programmatically create mathematical functions from input text are described, as well as all algorithms and methods used for plotting graphs. Emphasis is placed on generalized algorithms instead of concrete implementations.
- Published
- 2022
10. Planar Graph Vizualization Algorithms
- Author
-
Lujo, Antonio and Pavčević, Mario Osvin
- Subjects
Kuratowskijev podgraf ,TEHNIČKE ZNANOSTI. Računarstvo ,vrh ,NetworkX ,edge ,face ,ploha ,triangulacija ,triangulation ,graph ,planarity ,canonical order of vertices ,Graphviz ,Boost Graph Library ,brid ,TECHNICAL SCIENCES. Computing ,JGraph ,kanonski poredak vrhova ,vertex ,graf ,Kuratowski subgraph ,planarnost - Abstract
Teorija grafova bitno je područje u matematici za prikaz podataka i odnosa između objekata. Planarni grafovi važna su vrsta grafova i postoje mnogi programi pomoću kojih je moguće prikazati takve grafove na dvodimenzionalnoj površini ekrana. U ovom radu su detaljnije opisana tri programa otvorenog koda: NetworkX, Boost Graph Library i JGraph, opisani su algoritmi koje oni koriste, i njihova međusobna usporedba. Testiran je njihov rad na primjerima grafova i prikazano je kakve rezultate daju. Graph theory is an important area in mathematics for presenting data and relationship between objects. Planar graphs are an important type of graphs and there are many programs that can be used to display such graphs on a two-dimensional screen surface. This paper describes in more detail three open source programs: NetworkX, Boost Graph Library and JGraph, describes the algorithms they use, and their comparison with each other. Their work was tested on examples of graphs and it is shown what results they give.
- Published
- 2022
11. Sparivanja na grafovima i Teorem o braku.
- Author
-
Klobucar, Antoaneta and Tot, Brigita
- Abstract
This article describes matching in graphs, in particular in bipartite graphs. A criterium for existence of perfect matching is proved and applied to an example of matching in a group of boys and girls. [ABSTRACT FROM AUTHOR]
- Published
- 2017
12. Automation of industrial plant model for product processing using programmable logic controller S7-1500 in programming language GRAPH
- Author
-
Luštica, Marin and Sumina, Damir
- Subjects
PLCSIM ,LAD ,TECHNICAL SCIENCES. Electrical Engineering ,TEHNIČKE ZNANOSTI. Elektrotehnika ,TIA Portal ,GRAPH ,PLC ,Factory I/O - Abstract
Programirljivi logički kontroleri su neizostavni dijelovi sustava automatizacije. Cilj ovog rada je automatizacija postrojenja koje se bavi obradom predmeta. Sustav je izveden u obliku virtualnog postrojenja koji je modeliran u software-u Factory I/O. Njime se upravlja iz simulatora PLCSIM-a koji je sastavni dio TIA portala. TIA portal je također korišten za pisanje programskog koda i opis rada PLC-a. Programsko rješenje je izvedeno u LAD dijagramu i u GRAPHU. LAD je bio prvi programski jezik za programiranje PLC, te je sam kod nalik na relejne sheme koje su nekad upravljale automatiziranim postrojenjima. GRAPH je grafički sekvencijski jezik koji problem upravljanja razbija u niz koraka, koji se neprestano ponavljaju. Uočljive su razlike između rješenja, te prednosti i nedostatci jednog jezika u odnosu na drugi. Programmable logic controller is the most important part of the automation system today. The point of this thesis is the automation of the factory whose purpose is the production of the objects. Factory is virtually implemented in the software named Factory I/O. It is connected and controlled with the simulator PLCSIM from the automation software TIA Portal. TIA Portal is used to write program for PLC too. Program is implemented in two programming languages, LAD and GRAPH. LAD diagram was the first using programming language for PLCs, it is graphically similar to relay circuits which was technology to control automation systems before programmable logic controllers came out. GRAPH is graphical sequential programming language which divides program into sequence steps. The difference is seen between two languages and pros and cons one language in front of the other.
- Published
- 2021
13. Analysis of the interconnection of collected sensor data
- Author
-
Skukan, Ana and Ježić, Gordan
- Subjects
Meteorologija ,Data ,Coefficient ,TEHNIČKE ZNANOSTI. Računarstvo ,Agriculture ,Korelacija ,Graf ,Podaci ,Graph ,Correlation ,Meteorology ,TECHNICAL SCIENCES. Computing ,Analize ,Analysis ,Python ,Agrikultura ,Koeficijent - Abstract
U današnje doba analize podataka i manipulacija istih igra veliku ulogu u poboljšanju kvalitete života. Računalna znanost i njezina grana znanost o podacima su trenutno tražene pozicije za sve aspekte života. Iz tog razloga se poljoprivreda, vrlo bitna grana ljudskog života, razvija u smjeru analize podataka radi maksimizacije koristi koje dobivaju od farmi kao i radi same kvalitete proizvoda. U poljoprivrednim analizama bitan faktor je kredibilnost izvora od kojeg dobivaju podatke kao i analize istoga. Kroz ovaj rad bili su analizirani podaci različitih izvora kako bi se izračunala njihova korelacija. Za izvore su bili korišteni Agri4Cast i Copernicus, a korelacija se računala po svakome mjesecu 2019. godine za varijable temperature, padalina, sunčeve radijacije i vjetra. Cilj je bio time zaključiti koreliraju li izvori i u kojoj mjeri. Mjerenja su bila prikazana raspršenim grafovima gdje je na x-osi uvijek bio datum u mjesecu, a na y-osi varijabla za koju se radi analiza. Za korelacije su bili korišteni Pearsonov, Spearmanov i Kendallov koeficijent, a izračuni su se prikazivali tabličnim i grafičkim putem. Koeficijentima se računala jačina korelacije, ovisno o tome ponašaju li se varijable linearno ili ne te kolika je razlika između istih. Kako bi mjerenja i vizualizacije bili efikasni i brzi, koristio se Python te pripadajuće knjižice za analize podataka (NumPy, Matplotlib, Pandas i Scipy) koje imaju vrlo jednostavnu vizualizaciju i reprezentaciju podataka. Kroz analize u radu zaključeno je da postoje jake korelacije određenih varijabli no i disbalans u drugim varijablama. Od 4 varijable koje su se koristile u izračunima, dvije imaju jaku korelaciju, jedna ima srednje jaku, a jedna ima slabu do srednje jaku korelaciju (uz iznimke jake korelacije u nekim mjesecima). Prema dobivenim podacima je jasno da izvori nisu kompletno kompetentni za sve podatke, a zaključak je da koreliraju no variraju od slabe do jake korelacije sukladno analiziranim varijablama. In today's day and age data analysis and data manipulation play a big part in improving the quality of life. Computer science and its branch data science are one of the most wanted positions for all aspects of life. For that reason, agriculture started developing in the direction of data analysis for maximization of usage of farms and for product quality. In agriculture analysis very important factor is credibility of source from which data comes and credibility of analysis of data. Through this thesis data from different sources was analysed so that correlation between them could be calculated. For sources were used Agri4Cast and Copernicus and correlation was calculated for each month of 2019. for variables of temperature, precipitation, radiation, and wind. The goal was to conclude do those two sources correlate and how much. Source data was interpreted through scatter graphs where x axis had dates of the month, and y axis had variable that was being analysed. For correlations were used three different coefficients: Pearson’s, Spearman’s, and Kendall’s. Calculations were presented tabularly and graphically. With coefficients was calculated how strong the data correlation is and do variables act linearly. Python was used with proper libraries for data analysis (NumPy, Matplotlib, Pandas and Scipy) so that visualization and calculations would go faster and more efficient. Through analysis in this paper, it was concluded that strong correlations exist with some variables but there is lack of correlation on others. Out of 4 variables that were used in calculations, two have strong correlation, one has medium correlation, and one has weak to medium correlation (with exceptions of few months). By given data sources do not match completely for all data and conclusion is that they correlate but in range from weak to strong correlation, depending on the data.
- Published
- 2021
14. Analysis of Knight's Tour Problem
- Author
-
Palameta, Marko and Horvat Dmitrović, Lana
- Subjects
Knight ,Backtracking ,TEHNIČKE ZNANOSTI. Računarstvo ,Graf ,State space search ,Warnsdorffovo pravilo ,Graph ,Algoritam DFS ,Tremaux tree ,DFS algorithm ,Tremaux stablo ,TECHNICAL SCIENCES. Computing ,Šah ,Hamiltonian path ,Chess ,Pretraživanje prostora stanja ,Warnsdorff's rule ,Hamiltonovski put ,Skakač - Abstract
Problem obilaska skakača na ploči je problem iz domene teorije grafova. Šahovska figura skakač, svojim potezima u obliku slova L, posjećuje polja šahovske ploče na način da ih posjeti samo jedanput. Općenito, riječ je o problemu pronalaska hamiltonovskog puta u neusmjerenom grafu. Za rješavanje problema koristi se Backtracking algoritam, uz primjenu Warnsdorffovog pravila za optimizaciju. A knight's tour problem is a problem from the domain of graph theory. The knight chess piece, with its moves in the shape of a letter L, traverses the squares of the chessboard in a way that visits each square only once. In general, this is a problem of finding a hamiltonian path in an undirected graph. The problem is solved using Backtracking algorithm, with the application of Warnsdorff's rule for optimization.
- Published
- 2021
15. Anomaly detection in graphs
- Author
-
Galić, Dominik and Vrdoljak, Boris
- Subjects
anomalija ,TECHNICAL SCIENCES. Computing ,vizualizacija ,TEHNIČKE ZNANOSTI. Računarstvo ,detection ,anomaly ,detekcija ,graf ,graph ,visualization ,Python - Abstract
U ovom diplomskom radu prikazane su vrste grafova s obzirom na vremensku promjenjivost topologije, najčešće vrste anomalija te metode za otkrivanje anomalija u grafovima. Prvi korak je istraživanje postojećih implementacija nad popularnim skupovima podataka koji su javno dostupni. Nakon toga izabrana su dva pristupa za detekciju anomalija u anonimiziranim podacima telekomunikacijske kompanije. Prvi pristup detektirao je anomalije koristeći metodu dubokog strojnog učenja autoencodere, dok se drugi pristup temelji na algoritmu DNODA koji promatra direktno susjedstvo čvorova u grafu. Metode su implementirane korištenjem programskog jezika Python, a vizualizacije bibliotekama za vizualizaciju jezika R. Within this thesis, I have shown different types of graphs based on their topology with respect to the temporal component, the most common types of graph anomalies, and methods for detecting anomalies in graphs. The first step is to investigate existing implementations on popular datasets. The next step is choosing two methods for graph anomaly detection in the anonymized dataset from a telecommunication company. The first approach is detecting anomalies using the deep learning method – autoencoders, and the second approach is based on detecting anomalies with respect to the direct neighborhood of graph nodes. Algorithms were implemented using Python programming language and visualizations are made with programming libraries for the R language.
- Published
- 2021
16. Interaktivna web-aplikacija za bojanje grafova
- Author
-
Linarić, Filip and Nakić, Anamari
- Subjects
bojanje grafa ,TECHNICAL SCIENCES. Computing ,TEHNIČKE ZNANOSTI. Računarstvo ,graph coloring ,Graf ,Bojanje grafa ,graf ,graph - Abstract
Teorija grafova područje je matematike koje se vrlo često primjenjuje u računarstvu. Bojanje grafova može se identificirati s podjelom skupa vrhova ili bridova na disjunktne skupove s posebnim svojstvima, što otvara raznolike mogućnosti primjene u računarstvu. U sklopu ovog rada opisani su osnovni rezultati o bojanju grafova te je izrađena edukativna web-aplikacija za bojanje grafova. Aplikacija je napravljena u obliku interaktivne igre te je mogu koristiti korisnici bez prethodnog znanja o teoriji grafova. Graph theory is an area of mathematics that is very often applied in computing. Graph coloring can be identified with partitioning of a set of vertices or edges into disjoint sets with special properties, which opens up a variety of applications in computing. In this thesis, we describe the basic results on graph coloring and an educational web application for graph coloring that we developed. The application is in the form of an interactive game and can be used by users without prior knowledge of graph theory.
- Published
- 2021
17. Primjena grafovskih mjera u analizi svojstava grafova iz stvarnog svijeta
- Author
-
Petravić, Matej and Delač, Goran
- Subjects
social networks ,Facebook ,centrality analysis ,TEHNIČKE ZNANOSTI. Računarstvo ,Twitter ,analiza puta ,networkx ,graph properties ,graph ,community analysis ,metrike ,graph analysis ,analiza grafova ,svojstva grafa ,metrics ,analiza centralnosti ,graf ,analiza povezanosti ,analiza zajednica ,društvene mreže ,networkx, Python ,TECHNICAL SCIENCES. Computing ,path analysis ,connectivity analysis ,Python - Abstract
Analiza grafova doživljava nagli rast korištenja u obradi podataka. Lakoća korištenja i upravljanja podacima daje veliku prednost nad relacijskim analizama. U ovom radu je opisana analiza grafova, njezina podjela i svojstva grafa koja su potrebna za razumijevanje rezultata analize. Programska potpora je ostvarena u programskom jeziku Python i korištena je knjižnica networkx. Na kraju rada su prikazani i objašnjeni rezultati analize društvenih mreža, Facebook i Twitter te prometnih cesta u Europi. Graph analysis is experiencing a sharp increase in usage in data processing. Ease of use and data management gives a great advantage over relational analysis. This paper describes the analysis of graphs, its division and the properties of graphs that are needed to understand the results of analysis. Software support is provided in the Python programming language, and networkx library was used. At the end of the paper, the results of the analysis of social networks, Facebook and Twitter traffic roads in Europe are presented and explained.
- Published
- 2021
18. Metode za ispitivanje izomorfnosti stabala
- Author
-
Mihovilović, Ivan and Nakić, Anamari
- Subjects
klasifikacija stabala ,TECHNICAL SCIENCES. Computing ,TEHNIČKE ZNANOSTI. Računarstvo ,izomorfna stabla ,isomorphic trees ,graf ,graph ,tree classification ,Graf ,Stablo ,Izomorfizam grafova - Abstract
U ovom radu prikazane su različite tehnike za ispitivanje izomorfnosti stabala: matematička i računalna. Klasificirana su sva stabla s n vrhova, n = 1, 2, . . ., 9. Izrađena je web aplikacija za računanje s grafovima, koja ujedno ima i mogućnost klasifikacije stabala s manjim brojem vrhova. This thesis presents different techniques for examining tree isomorphism: mathematical and computational. All trees with n vertices are classified, n = 1, 2, . . ., 9. A web application for computing with graphs has been developed, which also has the possibility of classifying trees with a small number of vertices.
- Published
- 2021
19. Vizualizacija podataka i pamćenje na primjeru srednjoškolske populacije
- Author
-
Kreč, Ivan and Čerepinko, Darijo
- Subjects
working and Long-term memory ,pamćenje ,tablica ,mudrost ,mnemonic ,informacija ,radno i dugoročno pamćenje ,Graph ,tekst ,kratkoročno ,Memory ,TECHNICAL SCIENCES. Graphic Technology. Processes of Graphic Reproduction ,Vizualizacija podataka ,mneumonici ,Information ,graf ,podatak ,Wisdom ,Data ,Data Visualization ,Short-term ,znanje ,Infographic ,TEHNIČKE ZNANOSTI. Grafička tehnologija. Procesi grafičke reprodukcije ,Text ,infografika ,Knowledge ,Table - Abstract
Izumi kao što su piktogrami, klinasto pismo, tiskarski stroj, otkriće struje te razvoj digitalnih medija ključne su prekretnice u ljudskoj povijesti i društvenoj evoluciji. Načini na koje zapisujemo, analiziramo i prenosimo podatke i informacije uvelike diktira i način života – koji je u današnje vrijeme ubrzan. Najbolji opis današnjeg ljudskoj ponašanja skovao je George Miller koji opisuje čovjeka kao žderača informacija tj. „informavora“. Pitanje kojim se bavi ovaj rad pokušava odgovoriti na problem prikaza podataka – točnije na koji način je najbolje prikazati podatke da bi ih čim lakše izdvojili iz ogromnog informacijskog šuma i najefikasnije ih zapamtili tj. naučili. Vizualizacija je tehnika stvaranja vizualnih prikaza podataka i informacija koji bi nam trebali olakšati procese pamćenja i analize te nam omogućuju da čim brže i uz manje napora dođemo do zaključka ili odgovora na neko pitanje. Vizualizacija podataka uvelike ovisi o namjeni same vizualizacije – u ovom slučaju to su materijali za učenje, tipu podatka i ciljnoj skupini koju u ovom istraživanju čine učenici srednjih škola. Kroz istraživanje provedeno nad 91 ispitanikom, pokušalo se utvrditi koliki utjecaj vizualizirani podaci imaju na kratkoročno i dugoročno pamćenje. Početna hipoteza temelji se na rezultatima mnogih istraživanja pamćenja koja su dokazala da lakše pamtimo podatke ukoliko ih percipiramo kroz dva ili više različitih osjetila – primjerice kombinacije teksta i slike, ili teksta i zvuka. Ispitanici su podijeljeni u 4 skupine od kojih je KS na raspolaganju imala samo tekst sa podacima, dok su testne skupine uz tekst imale vizualne dodatke u obliku tablica, grafova i infografike. Rezultati istraživanja potvrdili su prvobitnu hipotezu da će skupine koje su uz tekst imale i vizualizacije zapamtiti više podataka, i to u prosjeku za 7% sveukupno (vizualizirani i nevizualizirani podaci), dok je ta razlika još veća u slučaju kada se uspoređuju rezultati samo podataka koji su bili vizualizirani te iznosi 15,5%. Ispitanici su upoznati i većina ih se koristi raznim mneumonicima kao što su usitnjavanje (chunking), mentalne mape, LOCI, te smatraju kako je vizualizacija podataka veoma koristan alat koji ima pozitivan utjecaj na proces pamćenja i učenja. Inventions like the pictogram, cuneiform, the printing press, the discovery of electricity, and the development of digital media are key milestones in human history and social evolution. How we record, analyze, and transmit data and information are largely dictated by the way of life – which, nowadays is accelerated. The best description of today's human behavior was coined by George Miller, who describes humans as „informavores“ - information eaters. The main question this paper is concerned with is the problem of displaying dana – more precisely, in what format should the data be presented so that the information can be easily singed out and memorized from the vast information noise that is produced. Visualization is the technique of creating visual representations of data and information and has proven to be a helpful tool that can facilitate the processes of memory and data analysis. The type of visualization depends largely on the purpose of the visualization itself (in this case helping learning materials), the type of data that is going to be used, and the target group which in this case are highschool students. 91 participants were included in the analysis which had the goal to determine the impact of visual aids on short and long-term memory. The initial hypothesis relies on many memory studies that have shown that it is easier to remember dana if it is perceived through two or more different senses – for example, text and image or text and sound. The participants were divided into 4 groups of which the Control Group had access only to the textual representation of the data while the other 3 Test Groups, besides the text, had access to visual aids like Tables, Graphs, and Infographics. The results of this research confirmed the initial hypothesis – the participants in all Test Groups remembered more dana, by an overall average of 7% (visualized and non-visualized data), while the difference for visualized data only is even bigger and amounts to an average of 15,5%. The participants are familiar with most mnemonics like chunking, mental maps, LOCI, and find that Data Visualization is a very useful tool that has a positive impact on memory and learning processes.
- Published
- 2020
20. Fast heuristics for vertex cover problem
- Author
-
Tolj, Bruno, Rudec, Tomislav, and Baumgartner, Alfonzo
- Subjects
heuristika ,algorithm ,heuristic ,algoritam ,vršni pokrivač ,graf ,graph ,TEHNIČKE ZNANOSTI. Računarstvo. Procesno računarstvo ,vertex cover ,TECHNICAL SCIENCES. Computing. Process Computing - Abstract
Cilj ovog završnog rada bio je napisati algoritam za rješavanje problema vršnog pokrivača iz teorije grafova. Algoritam je napisan u programskom jeziku C++. Rad je podjeljen na pet poglavlja. Nakon uvoda u drugom poglavlju problem je stavljen u kontekst s ostalim problemima vezanim uz teoriju grafova i NP-potpunu klasu problema. U trećem poglavlju opisani su i uspoređeni postojeći algoritmi prema brzini izvođenja i točnosti. Četvrto poglavlje bavi se posebnim slučajevima koji se mogu lakše rješiti i pravilima za grafove pomoću kojih se sužava mogući raspon rješenja. U petom poglavlju objašnjen je novi algoritam i uspoređen sa drugim algoritmima navedenima u ovome radu. The goal of this paper was writing an algorithm for solving the vertex cover problem from graph theory. The algorithm is written in the C++ programming language. The paper is split into five chapters. After introduction in the second chapter the problem is put into context with other problems in graph theory and the NP-complete class. In the third chapter existing algorithms are described and compared based on execution speed and accuracy. The forth chapter deals with special cases which can be solved easier and graph rules which help narrow down the range of possible solutions. In the fifth chapter the new algorithm is explained and compared with other algorithms listed in this paper.
- Published
- 2020
21. Analysis of Sorting Problem by Prefix Reversals
- Author
-
Bašić, Hana and Burić, Tomislav
- Subjects
permutacije ,sorting by prefix reversals ,TECHNICAL SCIENCES. Computing ,permutations ,TEHNIČKE ZNANOSTI. Računarstvo ,Sortiranje palačinki ,graf ,graph ,Pancake sorting ,sortiranje reverznim prefiksima - Abstract
Problem sortiranja uz reverzne prefikse kolokvijalno je poznat kao problem palačinki, a primijenjuje se u raspoređivanju procesa u mrežama paralelnih procesora. U radu je matematički analiziran problem, te je prikazana implementacija programske aplikacije koja vizualno prikazuje različite varijante ovakvih sortiranja. Nedavno je dokazano da je problem sortiranja palačinki NP-težak problem te još uvijek nije poznat minimalni broj koraka potrebnih za sortiranje, tek su nađene gornje ograde za taj broj. The problem of sorting with reverse prefixes is colloquially known as the pancake problem, and it is applied in scheduling processes in networks of parallel processors. The paper mathematically analyzes the problem, and presents the implementation of a software application that visually shows different variants of such sorting. It has recently been proven that the problem of sorting pancakes is an NP-difficult problem and the minimum number of steps required for sorting is still unknown, the upper fences for that number have just been found.
- Published
- 2020
22. Development of sequential control algorithm for car wash model in GRAPH programming language
- Author
-
Likakur, Dominik and Sumina, Damir
- Subjects
Automation ,TECHNICAL SCIENCES. Electrical Engineering ,Siemens ,TEHNIČKE ZNANOSTI. Elektrotehnika ,Autopraonica ,TIA Portal ,GRAPH ,PLC ,WinCC ,Car wash ,Automatizacija ,HMI - Abstract
U sklopu završnog rada razvijen je sekvencijalni upravljački algoritam za upravljanje modelom automatske autopraonice pomoću programirljivog logičkog kontrolera Siemens S7-1500. Za izradu algoritma korišten je programski jezik GRAPH u sklopu programskog paketa TIA Portal. Također je izrađeno i osnovno vizualizacijsko sučelje koje služi za nadzor i upravljanje sustavom. Testiranje algoritma izvođeno je pomoću alata PLCSIM i funkcije traces. Aktivacijom određenih digitalnih ulaza prati se stanje digitalnih izlaza i tako se uspješno provodi simulacija sekvence pranja automobila. Ovo omogućava testiranje algoritma bez ikakve dodatne hardverske opreme. As part of the final assignment, a sequential control algorithm was developed to control the automatic car wash model using the Siemens S7-1500 programmable logic controller. The GRAPH programming language within the TIA Portal software package was used to create the algorithm. A basic visualization interface has also been developed to monitor and manage the system. Algorithm testing was performed using the PLCSIM tool and the traces function. By activating certain digital inputs, the state of the digital outputs is monitored and thus the simulation of the car wash sequence is successfully performed. This allows the algorithm to be tested without any additional hardware.
- Published
- 2020
23. Algorithms for Analysis of Hyperlinks in Web Pages
- Author
-
Matijaščić, Mihael and Delač, Goran
- Subjects
Internet search engine ,probability ,TEHNIČKE ZNANOSTI. Računarstvo ,hubovi i identiteti ,link ,algoritam ,arc ,node ,importance ,TECHNICAL SCIENCES. Computing ,poveznica ,Website ,Internet stranica ,graf ,važnost ,identity ,hubs and authorities ,Internet ,PageRank vrijednost ,čvorište ,identitet ,luk ,vjerojatnost ,Internet tražilica ,vektor ,matrica ,PageRank value ,graph ,matrix ,Algorithm ,vector - Abstract
U ovom završnom radu opisuju se dva poznata algoritma, PageRank i algoritam hubova i identiteta koji vrše analizu poveznica u grafu Internet stranica, te na temelju dobivenih informacije rangiraju stranice po važnosti. U početku se opisuje teorijska pozadina algoritama, kako se obrađuju iznimne situacije nastale u samom grafu Internet stranica, i kako se izvodi proces računanja vrijednosti koje algoritmi pridjeljuju stranicama. Zatim se opisuje arhitektura programskog ostvarenja, koju ulogu imaju pojedini dijelove arhitekture, kako su ostvareni određeni programski dijelovi važni za dohvaćanje podataka i računanje vrijednosti tih podataka, koji su ulazni a koji izlazni podaci programskog ostvarenja te kako je dizajnirana grafička komponenta programskog ostvarenja. Na kraju se prikazuju i objašnjavaju statistički podaci dobivenih tijekom rangiranja određenih eksperimentalnih skupova Internet stranica. In this paper, we have described two well-known algorithms, PageRank and the Hubs and Authority Algorithm, which analyzed the links on the graph of web sites, and the information obtained ranked the pages by importance. Initially, the theoretical background of the algorithm is described, how the exceptional situations that arise in the graph of the Internet page are processed, and how the process of calculating the values that the algorithms add to the pages is performed. Then, the architecture of the program is described, what is the role of individual parts of the architecture, how certain program parts are important for retrieving data and calculating the value of this data, which are input and output data of the program and how the graphic component of the program is designed. Finally, the statistics obtained during the ranking of certain experimental sets of Internet sites are presented and explained.
- Published
- 2020
24. TECHNICAL ANALYSIS OF STOCK OF ĐURO ĐAKOVIĆ GROUP D.D. (DDJH)
- Author
-
Gašpar, Katarina, Sorić, Branko, Jakaša, Petra, and Vidović, Jelena
- Subjects
motion estimation ,volume ,graph ,technical analysis ,stocks ,price ,equity security - Abstract
U ovom radom objasnit će se tehnička analiza dionice. Kako bi se bolje shvatila tehnička analiza dionice, opisat će se i definirati dionice, a zatim tehnička analiza istih. Dionica je vlasnički vrijednosni papir koji predstavlja pravo vlasništva u određenom dioničkom društvu. Cijenu dionica određuje ponuda i potražnja, a one se mogu kupiti ili prodati na uređenom tržištu ili izvan njega. Bitno je razlikovati fundamentalni od tehničkog pristupa analizi dionice. Tehnička analiza može se definirati kao procjena kretanja cijena dionice, kojoj je osnovni temelj za procjenu pregled povijesnih kretanja cijena i volumena trgovanja dionice. Tehnička analiza ima za zadaću ustanoviti i predvidjeti buduće kretanje cijene dionice na temelju događanja u prošlosti. Osnova tehničke analize su grafovi. Osnovna pretpostavka koja treba biti ispunjena prilikom primjenjivanja tehničke analize je zadovoljavajući volumen kako bi njezina referentnost bila veća. Tehnička analiza se na Hrvatskom tržištu kapitala počela primjenjivati tek od kada se značajno povećala likvidnost tržišta, odnosno porasli volumeni i prometi na burzi. U radu je napravljena tehnička analiza grupacije Đuro Đaković d.d., This paper will explain the technical analysis of stock. In order to better understand the technical analysis of the stock, the stock will be described and defined, followed by a technical analysis of the stock. A stock is an equity security that represents ownership in a particular stock company. The price of the stock is determined by supply and demand, which can be bought or sold on or off the regulated market. It is important to differentiate the fundamental from the technical approach to stock analysis. Technical analysis can be defined as an estimate of stock price movements, the basis for which is an assessment of historical price movements and trading volume of a stock. The technical analysis has the task of identifying and predicting future movements in the stock price based on events in the past. Technical analysis is based on graphs. The basic premise that needs to be fulfilled when applying technical analysis is a satisfactory volume to make its reference greater. Technical analysis on the Croatian capital market began to apply only when the liquidity of the market increased significantly, that is, volumes and turnover on the stock market increased. The technical analysis of the Đuro Đaković Group d.d. is made in this paper.
- Published
- 2019
25. Abstract data type graph
- Author
-
Đaić, Katarina and Orehovački, Tihomir
- Subjects
neusmjereni graf ,edge ,depth-first search ,Prim's algorithm ,Floyd-Warshall algorithm ,DRUŠTVENE ZNANOSTI. Informacijske i komunikacijske znanosti. Informacijski sustavi i informatologija ,directed graph ,Floyd- Warshall algoritam ,node ,Dijkstrin algoritam ,Dijkstra's algorithm ,graf, rub, vrh, usmjereni graf, neusmjereni graf, pretraživanje u dubinu, pretraživanje u širinu, Primov algoritam, Kruskalov algoritam, Dijkstrin algoritam, Floyd- Warshall algoritam, Bellman- Ford algoritam ,graf ,Primov algoritam ,pretraživanje u dubinu ,vrh ,Bellman-Ford algorithm ,breadth- first search ,graph ,undirected graph ,brid ,Bellman- Ford algoritam ,Kruskal's algorithm ,usmjereni graf ,Kruskalov algoritam ,SOCIAL SCIENCES. Information and Communication Sciences. Information Systems and Information Science ,pretraživanje u širinu - Abstract
U ovom radu, pod naslovom „Apstraktni tip podataka graf“ je definiran sami graf te su napravljene implementacije u programskim jezicima Python te C++. Preciznije, graf predstavlja vrstu podatkovne strukture putem koje se implementira matematički koncept grafa. Isti se uglavnom sastoji od konačnog (promjenjivog) skupa uređenih parova koji se zovu lukovi (bridovi) i od entiteta koji se zovu čvorovi. Naime, postoje dvije glavne vrste grafa, a to su usmjereni te neusmjereni. Oni se razlikuju po načinu na koji se crtaju, ali i po implementaciji. Osim toga, postoje i dvije vrste pretraživanja grafa, a to su pretraživanje u dubinu i u širinu. Također, opisani su još razni algoritmi te implementirani, a to su Primov, Kruskalov, Dijkstrin, Floyd- Warshall i Bellman- Ford algoritam. In this graduation thesis, the "Abstract data type graph" is defined graph itself and implemented in the programming languages of Python and C++. More precisely, the graph represents the type of data structure by which the mathematical concept of the graph is implemented. The same is mainly composed of the final (variable) set of arranged pairs called the arches (edges) and of the entities called the nodes. Namely, there are two main types of graphs that are directed and undirected. They differ in the way they are drawn but also by their implementation. In addition, there are also two types of graph lookups, which are search depth and breadth. Also various algorithms have been introduced, such as Prim's, Kruskal's, Dijkstra's, Floyd-Warshall and Bellman-Ford algorithm.
- Published
- 2019
26. Application of Heuristic Algorithms in Graph Partition
- Author
-
Golić, Luka and Burić, Tomislav
- Subjects
Fiduccia-Mattheyses ,TEHNIČKE ZNANOSTI. Računarstvo ,Kernighan-Lin ,Spektralno particioniranje ,Graf ,veličina reza grafa ,Graph ,Cut-size ,VLSI ,Višerazinsko particioniranje ,Multi-level partitioning ,TECHNICAL SCIENCES. Computing ,Hypergraph ,Spectral partitioning ,Particioniranje ,Hipergraf ,Partitioning - Abstract
U ovome radu se opisuju algoritmi koji koriste heurističke funkcije za particioniranje grafova. Na primjeru izgradnje integriranih čipova je osviještena važnost tog područja računarske znanosti. Prvo je opisan Kernighan-Lin algoritam. Jedan od najstarijih heurističkih algoritama široko korišten. Opisani su njegovi nedostatci koje pokriva iduće navedeni algoritam, Fiduccia-Mattheyses. Ta dva algoritma su detaljno opisana i pojašnjena na konkretnom primjeru. Spektralno te višerazinsko particioniranje su također objašnjeni jer su danas najraširenije metode za particioniranje grafova. Radi njihove široke familije algoritama i matematičke složenosti ovdje nisu razmatrani na razini detalja. Stoga su ta dva algoritma opisana na konceptualnoj razini uz navođenje osnovnih pojmova potrebna za osnovno shvaćanje rada. In this paper the algorithms which use heuristic functions for partitioning of graphs are being described. The importance of that area of computer science is shown in the example of the construction of integrated chips. First is described Kernighan-Lin algorithm - it's one of the oldest heuristic algorith with widespread use. The next one described is Fiduccia-Mattheyses - this one covers the flaws of the Keenighan-Lin algorithm. These two are minutely described and explained on the concrete example. Spectral and multilevel potentiation are also explained because of theire widespread use in potentiation of graphs. Because of theire wide family of algorithms and mathematical complexity in this paper they are not observed in large details. For that reason these two algorithms are described on conceptual level with basic terms necessary for understanding.
- Published
- 2019
27. Development of WEB Application for Cryptocurrency Portfolio Management in REACT.JS Environment
- Author
-
Kuča, Alen and Orehovački, Tihomir
- Subjects
front end ,portfelj ,okvir ,kriptovaluta ,route ,programsko inženjerstvo ,graph ,DRUŠTVENE ZNANOSTI. Informacijske i komunikacijske znanosti. Informacijski sustavi i informatologija ,web ,back end ,baza ,cryptocurrency ,portfolio ,state ,Bitcoin, kriptovaluta, portfelj, graf, web, React, state, api, front end, back end, ruta, baza, okvir ,api ,framework ,React ,graf ,SOCIAL SCIENCES. Information and Communication Sciences. Information Systems and Information Science ,Bitcoin ,ruta ,database - Abstract
Cilj ovog rada je bilo izradit web aplikaciju za upravljanje portferlja kriptovaluta pomoću MERN tehnologija. Kroz dijagram obrasca uporabe i dijagram slijeda obrasca uporabe vizualno su prikazane razrade funkcionalnosti aplikacije. Također opisan je prototip sučelja za sve osnovne stranice aplikacije. Objašnjena je implemetnacija, korištene tehnologije, struktura i pojedine komponente aplikacije. Struktura aplikacije podjeljena je na dva osnovna dijela a to su „front end“ koji sadrži sve komponente za prikaz sučelja i „back end“ koji sadrži vezu za server, bazu i rute za komuniciranje sa bazom aplikacije. Dokumentacija sadrži korisničke upute koja korisniku detaljno opisuje mogućnosti aplikacije. Aplikacija je objavljena na www.altposit.com domeni. The purpose of this work was to create a web portfolio web application for managing cryptocurrencies using MERN technologies. Through the Use case diagram and the Use case sequance diagram, the functionalities of the application are visually displayed. An interface prototype for all the basic pages of the appliocation is also described. The implementation, the technologies used, the structure and the individual components of the application are also explained. The structure of the application is divided into two basic parts, namely the front end containing all components for displaying the interface and the back end containing the connection to the server, database and routes for communication with the application database. The documentation contains user instructions that detail the capabilities of the application to the user. The application is published on the www.altposit.com domain.
- Published
- 2019
28. Automation of industrial baking plant model using programmable logic controller S7-1500 in programming language GRAPH
- Author
-
Majstorović, Mateo and Sumina, Damir
- Subjects
automatizacija ,TECHNICAL SCIENCES. Electrical Engineering ,vizualizacija ,TEHNIČKE ZNANOSTI. Elektrotehnika ,TIA Portal ,GRAPH ,PLC ,visualization ,automation - Abstract
U radu je potrebno automatizirati model industrijskog postrojenja za pečenje upotrebom programirljivog logičkog kontrolera S7-1500. Potrebno je razviti algoritam upravljanja i programirati kontroler u programskom jeziku GRAPH u sklopu programskog paketa TIA Portal. Definirati sve korake sekvencijalnog rada sustava i uvjete za prelazak iz trenutnog u sljedeće stanje. U programskom paketu WinCC razviti vizualizacijsko sučelje s pomoću kojega je moguće upravljati modelom postrojenja. Eksperimentalno provjeriti djelovanje razvijenog programa. This thesis aims to automate a model of the industrial baking plant using the programmable logic controller S7-1500. The goal is to develop a control algorithm and program the controller in the GRAPH programming language within the TIA Portal program package. To define all sequential system operation steps and conditions for switching from current to next state. To develop a visualization interface within the WinCC program package which would allow management of the model of the plant. Experimentally check the performance of the developed program.
- Published
- 2019
29. Deep Learning Techniques on Graph-Structured Data
- Author
-
Pavlić, Marko and Čavrak, Igor
- Subjects
graf konvolucijska mreža ,inductive learning ,relational inductive biases ,TEHNIČKE ZNANOSTI. Računarstvo ,PyTorch Geometric ,deep learning ,supervised and unsupervised learning ,node embedding ,graph ,induktivnost ,duboko učenje ,graf ,reprezentacija vrha ,nadzirano i nenadzirano učenje ,mehanizam pažnje ,kombinatorna generalizacija ,relacijske induktivne sklonosti ,Python ,PyTorch ,combinatorial generalization ,TECHNICAL SCIENCES. Computing ,graph convolutional network ,attention mechanism - Abstract
Graf je sveprisutna struktura podataka na kojoj je moguće izvoditi zadatke dubokog učenja pomoću različitih tehnika. U ovom su radu opisane poznate graf duboke neuronske mreže uz objašnjenje teorijskih osnova i navođenje njihovih prednosti i nedostataka. Također je iznesen i sveobuhvatan pregled područja dubokog učenja na grafovima, a postojeće tehnike dubokog učenja dodatno su objašnjene u kontekstu graf dubokih neuronskih mreža. U sklopu rada implementirani su i robusno evaluirani različiti modeli graf dubokih neuronskih mreža, kako na skupovima podataka koji sadrže grafove citiranja, tako i na skupu podataka koji sadrži detektirane neurone iz slika histopatoloških preparata u cerebralnom korteksu mozga. Graph is a ubiquitous data structure, effective for deep learning tasks using various techniques. This thesis describes well-known graph deep neural networks along with techniques' theoretical bases and their advantages and disadvantages. Furthermore, this thesis gives a comprehensive study of deep learning on graphs. Understanding of existent deep learning techniques is upgraded through the scope of graph deep neural networks. In addition, several techniques are implemented, trained and robustly evaluated on miscellaneous datasets, including citation graphs and neurons detected on images of histopathological slides of brain's cerebral cortex.
- Published
- 2019
30. Greedy Algorithms for Solving Travelling Salesman Problem
- Author
-
Pejić, Mateo and Burić, Tomislav
- Subjects
Problem trgovačkog putnika ,Travelling salesman problem ,Hamiltonian cycle ,TECHNICAL SCIENCES. Computing ,TEHNIČKE ZNANOSTI. Računarstvo ,Pohlepni algoritam ,Matrica susjedstva ,Graf ,Hamiltonovski ciklus ,Neighborhood matrix ,Graph ,Greedy algorithms - Abstract
Problem trgovačkog putnika je jedan od najčuvenijih i najintrigantijih problema koji se jednostavno modeliraju i preformuliraju pomoću grafova. On gledan kroz prizmu teorije grafova glasi ovako: U potpunom težinskom grafu nađi hamiltonovski ciklus minimalne duljine. Pri rješavanju ovog problema koriste se razne metode među kojima su i pohlepni algoritmi. Prednosti pohlepnih algoritama su jednostavnost, intuitivnost i mala kompleksnost, a nedostaci su kratkovidni pogled (gleda se najbolje rješenje za taj korak) zbog čega ne garantira dobra globalna rješenja, te dosta ovise o instanci problema zbog čega je teško napraviti robustan algoritam koji radi za sve instance problema. Travelling salesman problem is one of the most famous and the most intriguing problems which can be easily modelled using graph theory. When defined by graph theory this problem looks like this: In complete weighted graph find the Hamiltonian cycle of the minimum length. Because travelling salesman problem is Np-hard problem we use a variety of methods to solve it. The simplest methods are greedy algorithms. Benefits of greedy algorithms are simplicity, intuition and small complexity. Disadvantages of greedy algorithms are shortsightedness (they are only looking for the best choice for a next step) and their dependency on instance of a problem, which makes it difficult to create a robust algorithm that works for all instances of the problem.
- Published
- 2019
31. Sequence to Graph Mapping
- Author
-
Batić, Dominik and Šikić, Mile
- Subjects
sequence mapping ,mapiranje, graf, DNA ,TECHNICAL SCIENCES. Computing ,slijed ,TEHNIČKE ZNANOSTI. Računarstvo ,de Bruijn graf ,mapiranje ,de Brujin graph ,graf ,graph - Abstract
Poravnanje dviju sekvenci jedan je od glavnih problema u bioinformatici. U svrhu rješavanja tog problema razvijeni su brojni algoritmi. Najpoznatiji algoritmi su Needleman – Wunschov algoritam globalnog poravnanja te Smith - Watermanov algoritam lokalnog poravnanja. Iako precizni dani algoritmi imaju kvadratnu memorijsku i vremensku složenost što ih čini neupotrebljivim pri poravnanju dugih sekvenci poput poravnanja očitanja na ljudski genom. S ciljem smanjenja vremenske i prostorne složenosti razvijeni su algoritmi temeljeni na heuristici. Kako bi kompaktnije prikazali podatke danas se sve više referentni genom zamjenjuje grafičkim prikazima poput de Brujin grafova. U ovom radu razmotrili smo heuristički algoritam koji poravnava očitanja na graf. Pri tome su za izradu i samo poravnanje korišteni već gotovi alati BCALM2 i GraphAligner. Algoritam predočen u ovom radu međukorak je između navedenih alata. U cilju smanjenja vremenske složenosti poravnanja on pronalazi regije grafa na koje bi se mapirala očitanja. Na taj način izdvajamo podgrafove izvornog grafa i mapiranje vršimo nad njima. Nažalost algoritam zbog prevelikih prekida u sekvencama grafa nije uspješan u mapiranju očitanja na graf. Sequence alignment remains one of the most challenging problems in the field of bioinformatics. In order to solve this problem many algorithms have been developed. One of the most well-known algorithms include dynamic programing algorithm for global alignment, introduced by Needleman and Wunsch and local alignment algorithm, introduced by Smith and Waterman. Despite their excellent alignment accuracy their time complexity of O (n^2) renders them impractical when aligning long sequences. In attempt to reduce time and space complexity new algorithms based on heuristics have been developed. In order to compactly represent data from a set of reeds reference genomes are nowadays being more and more replaced by graphical representations such as de Brujin graphs. In this paper we discussed a heuristic based algorithm for sequence to graph alignment. The algorithm uses already existing tools for compacting a de Brujin graph and mapping reeds to the said graph, named BCALM2 and GraphAligner respectively. Our algorithm steps in between those tools. To reduce time complexity of the alignment process it finds regions to which reeds map. By doing so we single out subgraphs which are then used in the alignment. Unfortunately, due to gaps that occur between regions, matching minimizers in sequences and regions fails to produce effective results.
- Published
- 2019
32. Fruchterman-Reingold Algorithm for Force-directed Graph Drawing
- Author
-
Radoš, Antonia and Srbljić, Siniša
- Subjects
algorithm ,Fruchterman-Reingold ,optimisation ,TEHNIČKE ZNANOSTI. Računarstvo ,vrh ,silom usmjereno ,edge ,algoritam ,graph ,force-directed ,crtanje grafova ,graph drawing ,sila ,brid ,TECHNICAL SCIENCES. Computing ,vertex ,graf ,optimizacija ,force - Abstract
Crtanje grafova široko je korišteno u matematici i računarstvu. Algoritmi za silom usmjereno crtanje među najfleksibilnijim su metodama za računanje razmještaja čvorova jednostavnih neusmjerenih grafova. U ovom radu opisano je nekoliko algoritama za silom usmjereno crtanje, no samo je Fruchterman-Reingold algoritam detaljno objašnjen i implementiran. Fruchterman-Reingold algoritam za silom usmjereno crtanje grafova je modifikacija prijašnjeg modela Eadesovog algoritma. Radili smo na nasumičnim grafovima s određenim parametrima broja vrhova, bridova i temperature i optimizirali njihov izgled vlastitom implementacijom algoritma. Svakome vrhu dodijelili smo privlačne i odbojne sile i pustili sustav da dosegne svoju ravnotežu. Rezultat je jednostavan, elegantan, konceptualno intuitivan i učinkovit algoritam. Graph layout is extensively used in the field of mathematics and computer science. Firce-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. In this bachelor’s thesis a few force-directed algorithms are described, but only Fruchterman-Reingold algorithm was thoroughly explained and implemented. Fruchterman-Reingold algorithm is a modification of a spring-embedder model. We created random graphs and then optimised their node positions using our own implementation of the algorithm. We assigned atrractive and repulsive forces on nodes and then the let the foces move the system to its equilibrium. The result is a simple, elegant, conceptually-intuitive and efficient algorithm.
- Published
- 2019
33. Upper Bound Genome Assembly Construction
- Author
-
Požega, Luka and Šikić, Mile
- Subjects
TECHNICAL SCIENCES. Computing ,TEHNIČKE ZNANOSTI. Računarstvo ,genome assembly ,upper bound ,sastavljanje genoma ,graf ,graph ,gornja granica ,gornja granica, sastavljanje genoma, graf - Abstract
U ovom radu je opisan alat za računanje gornje granice u sastavljanju genoma. U potpunosti je napisan u jeziku C++ i testiran na nekoliko skupova podataka. Alat ispisuje postotak pokrivenosti genoma ovisno o ulaznim podacima dobivenih sekven-ciranjem. Također se kreira i datoteka u GFA format koja služi za sastavljanje grafa. U radu je korišteno nekoliko algoritama poput sweep line algoritma, pretraživanja u dubinu i Needleman–Wunsch algoritma. Testiran je na dva skupa podataka: genomu bakterije Escherichie coli i kvascu Saccharomyces cerevisiae. Glavnu primjenu c ́e nac ́i u evaluiranju kvalitete podatak dobivenih sekvenciranjem, kao i kod evaluiranja drugih alata za sastavljanje genoma. In this thesis, a tool for genome upper bound assembly was created. It was fully written in C++ and tested on couple of datasets. Tool outputs percentage of the genome coverage that is possible to build in an ideal case considering sequenced data provided at the input. It also creats a graph file in GFA format. Algorithms like sweep line, depth-first search and Needleman–Wunsch were implemented. Tool was tested on datasets of Escerichia coli and yeast Saccharomyces cerevisiae. It might be mainly used in evaluating quality of the sequenced data and other de novo assembly methods.
- Published
- 2019
34. Probabilistic method in extremal combinatorics problems
- Author
-
Zec, Ivana, Vukičević, Damir, Golemac, Anka, and Vojković, Tanja
- Subjects
random variable ,probability distribution ,cycle ,walks ,graph ,entropy function ,Lovász Local Lemma ,variance ,expectation - Abstract
Vjerojatnosna metoda je snažan alat u kombinatorici i teoriji grafova. Osnovni princip vjerojatnosne metode je sljedeći. Želimo pokazati da postoji neki kombinatorni objekt koji zadovoljava neko svojstvo P. Da bismo to pokazali, promatramo proizvoljni objekt iz dobro odabranog vjerojatnosnog prostora i računamo vjerojatnost da taj objekt zadovoljava svojstvo P. Ako dobijemo da je ova vjerojatnost veća od nula, zaključujemo da objekt s traženim svojstvom P postoji. Ako ne postoji objekt koji zadovoljava svojstvo P, onda će vjerojatnost koju smo izračunali biti nula. U ovom radu pokazali smo kako primjenom vjerojatnosne metode možemo riješiti neke od problema ekstremalne kombinatorike., The probabilistic method is a powerful tool in Combinatorics and Graph Theory. The general principle of the probabilistic method is the following. We want to show the existence of a combinatorial object satisfying a given property P. To do this, we consider a random object in a well chosen probability space and we compute the probability that such an object satisfies the property P. If we show that this probability is greater then 0, then we deduce that an object with property P exists. Indeed, if no object were satisfying property P, then the probability would be zero. In this work, we showed how to solve some of the extremal combinatorics problems by applying the probabilistic method.
- Published
- 2019
35. Automatizacija modela postrojenja za prešanje upotrebom programirljivog logičkog kontrolera S7-1500 u programskom jeziku GRAPH
- Author
-
Odak, Ernest and Sumina, Damir
- Subjects
automatizacija ,LAD ,postrojenje za prešanje ,Siemens ,TEHNIČKE ZNANOSTI. Elektrotehnika ,vizualizacijsko sučelje ,S7-1500 ,Step 7 ,TIA Portal ,machine press plant ,TECHNICAL SCIENCES. Electrical Engineering ,visualization interface ,GRAPH ,PLC ,WinCC ,automatizacija, postrojenje za prešanje ,automation - Abstract
Završnim radom je automatiziran model industrijskog postrojenja za prešanje programskim jezikom GRAPH koristeći PLC S7-1500 i programsku podršku TIA Portal. Model je povezan s PLC-om po točno određenim adresama ulaza i izlaza. Razvijeno je i vizualizacijsko sučelje u programskom paketu WinCC pomoću kojeg je moguće upravljati u dva načina rada: automatskom i ručnom. Eksperimentalno je provjerena funkcionalnost razvijenog programa, te upotreba vizualizacijskog sučelja. Final assignment automates the model of the machine press plant in the GRAPH programming language using PLC S7-1500 and software TIA Portal. The model is connected with PLC over specific addresses of digital inputs and outputs. Visualization interface is developed in program package WinCC and it is possible to operate in two control modes: automatic and manual. The functionality of the developed program has been experimentally verified, such as usage of the visualization interface.
- Published
- 2019
36. Algoritmi obilaska mreža
- Author
-
Škoro, Matej and Domazet-Lošo, Mirjana
- Subjects
shortest path ,topologija ,topology ,TEHNIČKE ZNANOSTI. Računarstvo ,Bellman - Ford algorithm ,algorithms ,Dijkstrin algoritam ,complex network ,grouping ,TECHNICAL SCIENCES. Computing ,cost ,raf ,mreža ,teorija mreža ,kompleksna mreža ,promjer ,radijus ,grupiranje ,središnjost ,algoritmi ,najkraći put ,cijena ,heuristika ,Bellman - Fordov algoritam ,Floyd Warshallov algoritam ,pretraživanje u širinu ,pretraživanje u dubinu ,pretraživanje jednolikom cijenom ,heurističko pretraživanje ,graf ,breadth first search ,depth first search ,diameter ,heuristic search ,Floyd Warshall algorithm ,uniform cost search ,centrality ,graph ,network ,heuristic ,Dijkstra's shortest path algorithm ,radius - Abstract
Mrežama se vrlo efikasno vizualno i matematički mogu prikazati odnosi između pojedinih čvorova (objekata) i stoga su trenutno u velikoj mjeri primjenjive u mnogim znanostima. Također su od velike važnosti algoritmi obilaska mreža koje možemo podijeliti na algoritme pretraživanja (koji se, primjerice, u velikoj mjeri koriste u umjetnoj inteligenciji) i algoritme pronalaska najkraćeg puta. U ovom radu objašnjeni su matematički pojmovi vezani uz obrade mreža (topologija, promjer, radijus, stupanj središnjosti) i prikazani najvažniji algoritmi obilaska mreža. Također je implementirano nekoliko algoritama te prikazana usporedba vremenskog izvršavanja istih. Relations between given objects can be shown and represented very efficiently visually and mathematical using networks, so networks are currently applicable in many different sciences. Network traversal algorithms, which can be divided in shortest path problems and network search algorithms (which are commom used in artifficial inteligence), are also of big importance. In this thesis, basic mathematical terms of the network are explained (eg. topology, diameter, radius, grouping, centrality), so as network traversal algorithms. Furthermore, some of the explained algorithms are implemented and time efficiency is calculated, shown and compared.
- Published
- 2019
37. Visualisation of graph data structure
- Author
-
Ćorić, Dario and Baumgartner, Alfonzo
- Subjects
json ,TECHNICAL SCIENCES. Computing. Data Processing ,node.js ,edge ,javascript ,graf ,čvor ,graph ,TEHNIČKE ZNANOSTI. Računarstvo. Obradba informacija ,grana ,node ,jquery ,vis.js - Abstract
Cilj rada bio je opisati stvaranje web aplikacije za vizualizaciju grafa. Opisani su stvaranje poslužitelja za aplikaciju i metode za rad s podatcima o grafu. Moguće je stvoriti graf pomoću sučelja ili čitanjem iz tekstualne datoteke. Korištene su tehnologije JavaScript, Node.js, Express i biblioteka vis.js, uz još neke pomoćne biblioteke. The aim of this paper was to describe the creation of a graph visualization web application. The creation of a server and methods for graph data manipulation were described. A graph can be created using the application interface or by reading from a text file. The technologies used are JavaScript, Node.js, Express and the vis.js library, along with other libraries.
- Published
- 2018
38. Implementacija apstraktnih tipova podataka u programskom jeziku C++
- Author
-
Oblak, Domagoj and Orehovački, Tihomir
- Subjects
prioritetni red ,stog ,DRUŠTVENE ZNANOSTI. Informacijske i komunikacijske znanosti. Informacijski sustavi i informatologija ,red ,binarno stablo ,složenost algoritama ,doubly linked list ,C++ programming language ,linked list ,graf ,implementation ,set ,binary tree ,rječnik ,implementacija ,stack ,stablo ,dvostruko vezana lista ,graph ,vezana lista ,tree ,queue ,apstraktni tip podataka ,skup ,SOCIAL SCIENCES. Information and Communication Sciences. Information Systems and Information Science ,programski jezik C++ ,complexity ,abstract data type ,priority queue ,dictionary - Abstract
Tema ovog završnog rada je „Implementacija apstraktnih tipova podataka u programskom jeziku C++“. Detaljno su opisani apstraktni tipovi podataka i operacije koje se izvršavaju nad njima. Oni nisu ugrađeni u programskom jeziku već ih programer sam implementira, a implementacije se razlikuju po strukturi i algoritmima za izvršavanje pojedine operacije, tako svaki apstraktni tip podatka može imati više implementacija. Dijele se na četiri vrste, a to su linearni, hijerarhijski, dvodimenzionalni nehijerarhijski i skupovni. U programskom jeziku C++ će biti implementirani svi navedeni apstraktni tipovi te na kraju svakog poglavlja određena složenost svake funkcije. In this bachelor's thesis „Implementation of abstract data types in C++ programming language“ the abstract data types and operations that are executed over them are described in detail. They are not embedded in the programming language, but are implemented by the developer, and implementations vary by structure and algorithms to execute an operation, so any abstract data type can have multiple implementations. They are divided into four types, linear, hierarchical, two-dimensional non-hierarchical and sets. In the C ++ programming language, all of the above mentioned types will be implemented, and at the end of each chapter will determine the complexity of each function.
- Published
- 2018
39. COINvestigator - web application for e-currency analysis
- Author
-
Rački, Luka and Trontl, Krešimir
- Subjects
INVESTIGATION ,COMPARISON ,DATA ,INVESTMENT ,TEHNIČKE ZNANOSTI. Računarstvo ,ISTRAŽIVANJE ,STATISTIKA ,VRIJEDNOST ,CRYPTO ,TECHNICAL SCIENCES. Computing ,USPOREDBA ,JAVASCRIPT ,VALUE ,REACT ,PODATCI ,MONEY ,GRAF ,KRIPTO ,BITCOIN ,COIN ,ULAGANJE ,NOVAC ,API ,node ,javascript ,bitcoin ,istraživanje ,usporedba ,podatci ,statistika ,ulaganje ,graf ,novac ,vrijednost ,kripto ,STATISTIC ,GRAPH ,NODE - Abstract
Ovaj rad se bavi temom izrade web aplikacije za analizu kriptovaluta. Za razvoj aplikacije korištena je JavaScript biblioteka React. Realizirana aplikacija omogućuje korisniku pretraživanje baze kriptovaluta kako bi saznao podatke o određenoj valuti, međusobno uspoređivanje valuta i prikaz najnovijih vijesti u svijetu kriptovaluta. U radu je ukratko objašnjena povijest nastanka i teorijska pozadina JavaScripta, Reacta i kriptovaluta te proces izrade, način realizacije i korištenje izrađene aplikacije. This work's theme is the development of a web application that analyses cryptocurrency. The technology that is used for the application's development is the JavaScript library React. The application allows the user to search the cryptocurrency database to view information about a specific coin, it allows the user to compare multiple cryptocurrencies based on various parameters, and it also allows the user to read the latest news in the cryptocurrency world. This work briefly covers the history and theoretical background of JavaScript, React, and cryptocurrency, as well as the development process and the application usage.
- Published
- 2018
40. Analysis of Network Algorithms for Finding Minimum Spanning Tree
- Author
-
Češnjaj, Valentino and Burić, Tomislav
- Subjects
Kruskal algoritam ,graph theory ,TEHNIČKE ZNANOSTI. Računarstvo ,TEHNIČKE ZNANOSTI. Elektrotehnika ,minimalno razapinjuće stablo ,Prim's algorithm ,Kruskal algorithm ,Boruvka's algorithm ,graph ,minimum spanning tree ,teorija grafova ,Prim algoritam ,TECHNICAL SCIENCES. Electrical Engineering ,TECHNICAL SCIENCES. Computing ,graf ,Boruvka algoritam - Abstract
U ovom radu cilj je bio analizirati algoritme za traženje minimalnog razapinjućeg stabla kao i pokazati princip njihovog rada. Pokušali smo vidjeti koje su sličnosti, a koje razlike u njihovom radu i kako gustoća grafa kojeg rješavaju utječe na vrijeme izvođenja algoritma. U uvodnom dijelu smo objasnili temeljne pojmove iz teorije grafova i pojedine teoreme kako bi što bolje razumjeli pojam stabla minimalne težine u grafu. Nadalje smo vidjeli koju primjenu ta teorija grafova ima u realnom svijetu i na koji način modelirati probleme iz stvarnog života pomoću nje. Sljedeće poglavlje se više baziralo na stablima u grafu(minimalne težine) gdje smo se posebno koncentrirali na teorem o ciklusu i teorem o rezu koji se koriste u izvođenju algoritama za traženje minimalnog razapinjućeg stabla. Spomenuli smo i definirali protokol STP koji se takoreći temelji na logici minimalnog razapinjućeg stabla. Na posljetku smo opisali same algoritme i analizirali njihov rad na istom grafu kako bi uvidjeli razlike i sličnosti u načinima njihovog izvođenja. The purpose of this work was to analyze algorithms for searching minimum spanning tree and to show how they work. We tried to see which are the similarities and which are the differences in their steps of execution as the fact how they work in different time complexity for divers given graph density. In introductory part, we explained the core terms of graph theory and some important theorems which can help us to better understand the meaning of minimum spanning tree. Further, we explain the application of graph theory field in real life situations and how can we model our problems. The next chapter was mostly based on trees in the graph(minimum weight) where we specially focused on the theorem about the cut and the theorem about a cycle. We also explained the protocol called STP which is mostly based on work of finding the minimum spanning tree in the network. At the end, we describe the algorithms which are used to find the minimum spanning trees and saw how they work comparing it with each other.
- Published
- 2018
41. Colorings of planar graphs
- Author
-
Ivić, Sarah, Vukičević, Damir, Vojković, Tanja, and Pleština, Jelena
- Subjects
graph ,planarity ,coloring - Abstract
U ovom diplomskom radu naglasak je na starim i novim problemima bojanja planarnih grafova. U radu su definirani osnovni pojmovi teorije grafova, bojanje grafova te planarnost. Također su iskazani razni teoremi i prikazane su veze i posljedice istih. Teorija grafova je grana matematike u kojoj se većina pojmova, definicija, teorema, te razni problemi i njihova rješenja mogu prikazati slikom. U skladu s tim, tekst u radu je potkrijepljen slikama kako bi se tema rada što zornije prikazala., In this master’s thesis, the emphasis is on the old and new problems of coloring planar graphs. The thesis defines the basic concepts of graph theory, coloring of graphs and planarity. Various theorems were also shown and the connections and consequences of the same were presented. Graph theory is the branch of mathematics in which most concepts, definitions, theorems, and various problems and their solutions can be depicted in a picture. Accordingly, the text in the thesis is backed up by the pictures in order to show the work theme as plain as possible.
- Published
- 2018
42. Stochastic path planning for unreliable transportation system
- Author
-
Čolak, Anđela, Mladenović, Saša, Zaharija, Goran, and Krpan, Divna
- Subjects
path finding ,breadth-first search ,graph ,agents ,tree - Abstract
Ovaj rad bavi se pretragama dinamičkog prostora. Stvarni prostor pretvara se u usmjereni graf u kojem čvorovi predstavljaju raskrižja a lukovi prelaske cestama. Koristeći pretragu po širini, agenti pretražuju put i parametre puta množe (ili dijele) onima unesenim s korisničkog sučelja kako bi pronašli optimalan put. Kada svi agenti završe posao, korisnik se pomiče za jedan čvor te se pretraga ponavlja kako bi se osvježili rezultati pretrage. Pretraga završava kada korisnik dođe do cilja., This paper is concentrated on dynamic route finding. Graph is constructed from real space in the way that crossroards are represented by nodes and edges represent, not roads, but every potencial road passage. Agents search path using Breadth-first search. They collect data from edges and multiply (or divide) them by parameters that has gotten from user interface to find optimal path. When all agents are done, user moves one node and search starts again to refresh result. Search completely stops when user reaches its goal.
- Published
- 2018
43. Procjena očekivanog stupnja potpunosti genoma iz dostupnih očitanja
- Author
-
Fureš, Matej and Šikić, Mile
- Subjects
Minimap ,BFS ,algorithm ,TEHNIČKE ZNANOSTI. Računarstvo ,mapiranje ,očitanje ,Gepard ,algoritam ,graph ,maping ,TECHNICAL SCIENCES. Computing ,C++, Minimap, Gepard, mapiranje, očitanje, graf, BFS, algoritam, Python, bash ,read ,graf ,bash ,C++ ,Python - Abstract
Zadatak završnog rada alat je za provjeru mogućnosti sastavljanja genoma za dani skup očitavanja. Alat se radi u svrhu validacije skupa očitanja prilikom sastavljanja genoma te izačuna omjera duljina novo sastavljenog slijeda i početne reference. Problem je riješen korištenjem programskog jezika C++ te alata Minimap i Gepard. U samom programu korišteni su algoritmi Sweep line i BFS za filtraciju podataka, odnosno za obilazak grafa. Implementirano je rješenje zadovoljavajuće riješilo zadani problem, a njegova poboljšanja mogla bi se napraviti drugačijim parametrima pri ocjenjivanju kvalitete mapiranja ili korištenjem drugih alata. The task of this assignment was implementation of a tool capable of testing the capability of assembling genomes from available reads. The tool was made for the purpose of validating sets of reads while assembling genomes and calculating ratios of lengths between original reference and newly made genome. The problem has been solved using programming language C++ and tools like Minimap and Gepard. In the solution we use Sweep line algorithm for data filtration and BFS algorithm for making a path on the graph. The implementation solved our problem to high degree, and eventual upgrades could be made by changing filtering methods or changing the tools that were used.
- Published
- 2018
44. Algorithms for Network Shortest Path Finding and their Software Implementation
- Author
-
Maligec, Matej and Grgić, Krešimir
- Subjects
algorithm ,Floyd-Warshall ,TECHNICAL SCIENCES. Electrical Engineering. Telecommunications and Informatics ,Dijkstra ,TEHNIČKE ZNANOSTI. Elektrotehnika. Telekomunikacije i informatika ,algoritam ,graf ,Bellman-Ford ,graph - Abstract
Algoritmi za pronalaženje najkraćih puteva u mreži vrlo su bitni za brz i pouzdan prijenos podataka od početne to krajnje točke u mreži. Neki od tih algoritama su Dijkstrin, Bellman-Fordov i Floyd-Warshallov algoritam. Dijkstrin algoritam radi samo sa pozitivnim težinskim vrijednostima grana, dok Bellman-Fordov i Floyd-Warshallov algoritam mogu raditi i sa negativnim vrijednostima. Kod Bellman-Fordovog algoritma može doći do detekcije negativnog ciklusa, što znači da se vrijednost najkraćeg puta do određenog čvora može beskonačno smanjivati. Ukoliko negativan ciklus ne postoji, Dijkstrin i Bellman-Fordov algoritam imaju slično vrijeme izvođenja, dok Floyd-Warshallov algoritam ima najveće vrijeme izvođenja zbog prikaza izlaznih vrijednosti u obliku matrice te velikog broja mogućih međurješenja. Shortest path algorithms are very important for fast and reliable data transportation from a starting to an ending point in a network. Some of these algorithms are Dijkstra's, Bellman-Ford's and Floyd-Warshall's algorithm. Dijkstra's algorithm works only with positive edge weights, whereas Bellman-Ford's and Floyd-Warshall's algorithms are able to work with negative edge weights aswell. Bellman-Ford's algorithm is capable of negative cycle detection, which means that the shortest path value to a specific vertex can be infinitely reduced. If there is no such cycle, Dijkstra's and Bellman-Ford's algorithms have a similar runtime, while Floyd-Warshall's algorithm has the greatest runtime of the three, because of the format of the output values being a data matrix and a large amount of possible intermediate solutions.
- Published
- 2017
45. Business intelligence system dashboards
- Author
-
Grbac, Nikola and Bevanda, Vanja
- Subjects
poslovna inteligencija ,layout ,SOCIAL SCIENCES. Economics. Business Informatics ,raspored elemenata ,business information system ,podaci ,graph ,poslovni sustav ,boja ,business intelligence ,information ,color ,upravljačka ploča ,data ,informacije ,dashboard ,DRUŠTVENE ZNANOSTI. Ekonomija. Poslovna informatika ,grafikon - Abstract
Poduzeća koja žele maksimizirati uspješnost u donošenju odluka mogu u svoje poslovne sustave implementirati sustav poslovne inteligencije. To su sustavi koji služe u svojoj osnovi kao potpora u donošenju odluka i kao opskrba ključnih zaposlenika s ključnim informacijama. Pravovremene informacije su temelj donošenja ispravnih odluka za poslovanje. Upravljačke ploče služe kako bi se te informacije prikazale iz baza i skladišta podataka na zaslonima korisnika u najpreglednijem obliku. Da bi to učinkovito napravile, koriste se upravljačkim pločama na kojima se u najsažetijem obliku prikazuju podaci. Te podatke je dobro prikazani na jasan i pregledan način. Također moraju biti razumljivi i za razumijevanje ne smiju oduzimati previše vremena. Za to se koriste grafikoni za vizualni prikaz informacija jer je to jedan od najučinkovitijih medija za to. Mora se paziti pri odabiru grafikona kako bi grafikon bio ispravan za tip podataka koji se prikazuju. Grafikone se prikazuje u karticama i njihov raspored može presuditi upravljačkoj ploči. Ne treba prikazivati previše informacija na ploči i poželjno je da one budu međusobno logički povezane. Poželjno je i da je raspored informacija složen po važnosti od gore prema dolje, te s lijeva na desno. Posljednja kategorija su boje koje uz raspored elemenata mogu značajno promijeniti sam izgled stranice. Polazišna točka su pozadinske boje koje određuju ton ploče. One trebaju biti zagasite, blijede i ne smiju odvlačiti pažnju od bitnih stvari. Druga točka su boje za naglašavanje. Dobro je da one budu u dobrom kontrastu s pozadinskim bojama i moraju se dobro vidjeti. Ukupna ploča ne bi trebala biti prešarena pa je dobro odabrati set od nekoliko boja. Za naglašavanje se često koriste tzv. boje semafora, odnosno crvena, žuta i zelena jer one imaju jasno i opće poznato značenje. Companies that are looking to maximize their efficiency at decision making can implement business intelligence systems into their existent business information systems. Those are systems which purpose is to support decision making and to supply key employees with key information crucial for their jobs. Timely informations are fundamental for good decision making. Dashboards purpose is to display informations from databases and data warehouses to displays on user screens in the most visually effective way. To fulfill that role well, dashboards show data in the simplest and shortest way possible. The data must be shown in a clear and descriptive way. It also has to be easy to understand and interpret without wasting too much time. That is why graphs are used to visually display data, simply because it is the most efficient way to do so. It must be taken into consideration to select the correct graph to display the particular type of data we are trying to present. Graphs are displayed in scorecards , and the layout of those scorecards is crucial to the usability of dashboards. There should not be too much informations on a single dashboard, and those informations that are shown, should be logically related. It is advisable that the order of displaying informations, based on their importance, is from top to bottom, as well as from left to right. Last important category are colors, as they can significantly alter the look and feel of the page, just like layout. Starting point is the background color, as they dictate the tone of dashboards. It is good if they are darker shade and lower saturation, in order to not distract from important informations. Second point are highlight colors, they ought to be in good contrast with background color so they are properly visible. It is wise to take into consideration not to make dashboard too colorful, so it is best to stick to a set of colors and use them consistently.
- Published
- 2017
46. Floyd-Warshall Algorithm for Finding Shortest Paths in a Graph
- Author
-
Marcelić, Maroje and Burić, Tomislav
- Subjects
Algorithm ,Floyd-Warshall ,Shortest path ,TECHNICAL SCIENCES. Computing ,Dijkstra ,TEHNIČKE ZNANOSTI. Računarstvo ,Graf ,Algoritam ,Graph ,Najkraći put - Abstract
Tema rada je traženje najkracih puteva u težinskom grafu. Potrebno je implementi- ´ rati i analizirati Floyd-Warshallov algoritam na razlicitim primjerima grafova. Korisnik ˇ pristupa aplikaciji kroz interaktivno sucelje koje treba ponuditi razne opcije generira- ˇ nja i unosa grafa. Topic of the work is searching for shortest paths in weighted graph. It is required to implement an analyze Floyd-Warshall algorithm on different graph examples. User approaches the application through interactive interface that needs to offer different options of generating and entering a graph.
- Published
- 2017
47. Problem of Finding Ramsey Numbers
- Author
-
Bušić, Hrvoje and Burić, Tomislav
- Subjects
clique ,Ramsey numbers ,TEHNIČKE ZNANOSTI. Računarstvo ,Ramsey theory ,Ramseyev teorem ,Ramsey theorem ,Ramseyevi brojevi ,graph ,Ramseyeva teorija ,klika ,Bron-Kerbosch algoritam traženja klika ,TECHNICAL SCIENCES. Computing ,graf ,Bron-Kerbosch clique finding algorithm ,Frank P. Ramsey - Abstract
Ramseyeva teorija za danu strukturu za koju se vjeruje da posjeduje određeno svojstvo, želi odrediti uvjete pod kojima će struktura ostvariti upravo promatrano svojstvo. Matematičari i računalni znanstvenici iz raznih smjerova i na različite načine pokušavaju pristupiti jezgrenom problemu Ramseyevog teorema: eksponencijalno rastućem prostoru pretraživanja stanja u obliku bojanih grafova. Naivni pristup iscrpnog pretraživanja prostora stanja se pokazao neodgovarajućim čak i za male Ramseyeve brojeve, čime pokušaji rješavanja teorema privlače brojne implementacije naprednih algoritama i metaheuristika. Metaheuristike se nadalje osnažuju znanjem iz domene problema, stečenim kroz iskustvo istraživača koji se godinama bave teoremom. Ramsey's theory for a given structure believed to possess a certain property wants to determine the conditions under which the structure will realize the just observed property. Mathematicians and computer scientists from different directions and in various ways try to approach the core problem of Ramsey's theorem: an exponentially growing search space in the form of painted graphs. The brute force approach has proved inadequate even for small Ramsey numbers, which led to attempts to solve the theorem with implementations of advanced algorithms and metaheuristics. Metaheuristics are continuously improved with knowledge of the problem domain, gained through the experience of researchers who have been dealing with the theorem for years.
- Published
- 2017
48. Analysis of Algorithms for Finding Maximum Flow in a Graph
- Author
-
Bosnar, Lovro and Burić, Tomislav
- Subjects
Ford-Fulkersonov algoritam ,pretraživanje u dubinu ,tok ,TEHNIČKE ZNANOSTI. Računarstvo ,graph ,Ford-Fulkerson algorithm ,Dijkstrin algoritam ,Dijkstra's algorithm ,TECHNICAL SCIENCES. Computing ,flow ,network ,mreža ,graf ,breadth first search ,depth first search ,pretraživanje u širinu - Abstract
Cilj ovog rada bio je istražiti algoritam traženja maksimalnog toka u grafu, ali s različitim algoritmima traženja puta. Motivacija je bila potpunije upoznavanje maksimalnog toka i algoritama pretraživanja. U prvom dijelu je dana temeljna teorija grafova, objašnjen je specifičan graf – mreža te tok u mreži. U drugom dijelu je objašnjen algoritam za traženje maksimalnog toka. Specifično je obrađen Ford-Fulkersonov algoritam. Konačno u trećem dijelu prikazana je programska implementacija. Objašnjen je način prikaza grafa u računalu. Nakon svih potrebnih definicija analizirana su tri algoritma za traženje puta. Algoritam pretraživanja u širinu, algoritam pretraživanja u dubinu i Dijkstrin algoritam. Algoritmi su opisani matematički, pseudokodom te u dodatku se nalazi programska implementacija. Za svaki od algoritama navedene su iteracije i neke ključne karakteristike. Purpose of this paper was to study maximum flow algorithm with different path finding algorithms. Motivation was to learn more about maximum flow and path finding algorithms. The first part of this paper contains fundamentals of graph theory, theory behind specific graphs called networks and flow in network. The second part defines the core of this paper – Ford-Fulkerson maximum flow algorithm. Algorithm was described mathematically and with pseudo-code. The third part contains specifics of program implementation and analysis of maximum flow algorithm with different path finding algorithms. It was defined how to represent a graph in a computer. Chosen algorithms are: breadth first search, depth first search and Dijkstra's algorithm. Every path finding algoritam was described and for every algorithm the corresponding iterations were showed.
- Published
- 2017
49. Sparivanja na grafovima i Teorem o braku
- Author
-
Antoaneta Klobučar and Brigita Tot
- Subjects
graf ,sparivanje na grafovima ,bipartitni graf ,Hallov teorem ,graph ,matching in graphs ,bipartite graphs ,Hall’s theorem - Abstract
U članku je prikazan problem sparivanja na grafovima, specijalno na bipartitnim grafovima. Dokazan je kriterij za postojanje savršenog sparivanja i primijenjen je na primjeru sparivanja grupe mladića i djevojaka., This article describes matching in graphs, in particular in bipartite graphs. A criterium for existence of perfect matching is proved and applied to an example of matching in a group of boys and girls.
- Published
- 2017
50. Radni okvir za automatsko raspoređivanje dijagrama
- Author
-
Bobinac, Tomislav and Fertalj, Krešimir
- Subjects
graph layout ,dijagram ,automatsko raspoređivanje ,vizualizacija grafova ,automatic layout ,TEHNIČKE ZNANOSTI. Računarstvo ,graph ,crtanje grafova ,graph drawing ,radni okvir, dijagram, graf, automatsko raspoređivanje, raspoređivanje grafova, vizualizacija grafova, crtanje grafova ,framework ,TECHNICAL SCIENCES. Computing ,raspoređivanje grafova ,graf ,radni okvir ,graph visualization ,diagram - Abstract
Cilj rada bio je izrada radnog okvira za automatsko raspoređivanje elemenata dijagrama. Kako bi radni okvir bio što bolje dizajniran, provedena je funkcionalna analiza najpopularnijih alata i algoritma za raspoređivanje grafova. Zbog velikih razlika u implementacijama razvijeno rješenje koristi zajedničko sučelje kako bi objedinilo postojeća rješenja. Razvijeni sustav sastoji se od tri glavne komponente: radnog okvira, programa sa sučeljem komandne linije i programa s grafičkim sučeljem. Radni okvir omogućava laganu nadogradnju već postojećim ili novim funkcionalnostima, dok druga dva programa pružaju korisnicima intuitivno sučelje za raspoređivanje grafova. Sustav je ostvario traženu funkcionalnost, ali još ima puno prostora za poboljšanje grafičke komponente sustava. The goal of this thesis was to develop a framework for an automatic layout of diagram elements. In order for the framework to have the best possible design, functional analysis was done for the most popular graph layout tools and algorithms. Due to large differences between implementations, the developed solution uses a common interface in order to unite existing solutions. The developed system consists of three main components: a framework, a program with a command line interface and a program with a graphical user interface. The framework enables easy extensibility with existing or new functionalities, while the other two programs provide an intuitive interface for graph layout to users. The system has accomplished required functionality, but there's still much room for improvement regarding the graphical component of the system.
- Published
- 2017
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.