1,720,992 research outputs found
Razvoj aplikacije u Laravel okruženju
Get PDFLaravel je besplatno, open-source PHP razvojno okruženje zamišljeno za razvoj web aplikacija, koje, kroz svoju izražajnu i elegantnu sintaksu, omogućava programeru da brzo i efikasno implementira komponente aplikacije. Rad započinje objašnjavanjem pojma i funkcije razvojnog okruženja. Potom se, kao tema rada, uvodi Laravel te se ukratko izlaže njegova povijest i usporedba s drugim PHP razvojnim okruženjima. U nastavku rada se na sistematičan način prikazuje razvoj aplikacije u Laravel okruženju. Prvo se govori o Laravelovim značajkama koje pridonose njegovoj funkcionalnosti. Zatim se objašnjava MVC arhitekturalni obrazac koji predstavlja jezgru arhitekture aplikacije izrađene u Laravelu te tok usmjeravanja kroz aplikaciju, koji MVC upotpunjuje do jedinstvene cjeline. Potom se prelazi na objašnjenje interakcije s bazama podataka koju Laravel omogućuje. Konačno, obrađuje se i autentikacija, kao nužan element svake moderne web aplikacije. Rad završava poglavljem praktične primjene u kojem autor svoju aplikaciju, koju je u cijelosti razvio uz pomoć Laravela, koristi kao primjer razvoja aplikacije u ovom okruženju. Uz to, kod aplikacije protkan je kroz cijeli rad kako bi se čitatelju prikazali jednostavniji i složeniji primjeri korištenja Laravelovih komponenata i alata za izradu aplikacije.Laravel is a free, open-source PHP framework designed for web application development which uses its expressive and elegant syntax to enable the developer to implement application components quickly and efficiently. The thesis begins by explaining the concept and function of the framework. Then, as the main topic, Laravel is introduced with a brief overview of its history and comparison with other PHP frameworks. The thesis continues with a systematic elaboration of a Laravel framework application development. Firstly, Laravel’s features that contribute to its functionality are discussed. Secondly, the MVC software architectural pattern which is the core of the architecture of a Laravel made application is explained, as well as the routing which completes MVC to a unique entity. Then the interaction with databases that Laravel provides is elaborated. Finally, authentication as a necessary element of any modern web application is discussed. The thesis ends with a chapter of practical use in which the author presents the application that she fully developed using Laravel, to demonstrate how an application can be developed in this framework. Additionally, the application code is interwoven through the whole thesis so that simpler and more complicated examples of using Laravel’s components and tools for creating the application are demonstrated
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Konvolucijske neuronske mreže
Get PDFU ovom diplomskom radu detaljno je obrađen model konvolucijskih neuronskih mreža. U prvom dijelu rada dan je uvod u klasične neuronske mreže, radi boljeg razumijevanja arhitekture i osnovnih pojmova dubokih modela. Drugi dio rada započinje opisom operacije konvolucije, koja se primjenjuje u konvolucijskim mrežama. U nastavku smo opisali svaki sloj konvolucijske mreže te dali matematički prikaz algoritma učenja modela. Nakon toga, naveli smo neke od najčešćih problema koji se javljaju prilikom učenja mreže te prikazali neke od optimizacijskih i regularizacijskih metoda, koje rješavaju dane probleme i poboljšavaju učenje modela. Na samom kraju rada, opisali smo implementacijsko rješenje za problem neuronskog prijenosa stila, s umjetničke slike na odabranu fotografiju. Model je razvijen pomoću biblioteke TensorFlow za strojno učenje. Za učenje modela korištena je okolina razvojnog oblaka Google Colaboratory, koja pruža besplatnu upotrebu grafičkih kartica. Rezultati modela su slike s primijenjenim stilom drugih slika, koje su prikazane u posljednjem poglavlju rada.In this thesis we gave a detailed view of convolutional neural network models. In the first part of the thesis, we presented a gentle introduction to classic neural networks for better understanding, with some basic concepts of deep learning models. Second part of the thesis begins with the convolution operation description, which is the main carrier operation in convolutional neural networks. Furthermore, we described every CNN layer, and gave a mathematical background for the learning algorithm. After that, we presented some most common problems which can occur while training deep models. We described some optimization and regularization methods that can solve these problems and improve the model learning. Lastly, we described an implementation for neural style transfer problem, from an artistic image to a chosen photography. The model is implemented using TensorFlow machine learning library. Model is learned in Google Colaboratory environment which offers free GPU support. Results of the model computations are images, with style transferred from other images, as shown in the last chapter of the thesis
Latentna semantička analiza, varijante i primjene
Get PDFU današnje vrijeme sve više težimo tome da omogućimo da računalo izvršava zadatke, koje čovjek čini rutinski, jednako brzo i efikasno. Jedan od takvih zadataka je i pronalazak par dokumenata iz kolekcije koji su najrelevantniji za korisnikov upit. Prvi korak u rješavanju tog problema je reprezentacija kolekcije dokumenata pojmovno-dokumentnom matricom, čiji elementi predstavljaju tf-idf težine riječi u dokumentu. Na taj način smo svaki dokument prikazali vektorom u prostoru pojmova. Ako i upit prikažemo vektorom, onda za usporedbu upita i dokumenta iz kolekcije, možemo iskoristiti standardne mjere sličnosti, poput kosinusne. U takvom prostoru, sinonimi će biti ortogonalni, a višeznačnice će biti predstavljene jednim vektorom, neovisno o kontekstu u kojem se riječ nalazi. Motivirani tom činjenicom i velikom dimenzijom pojmovno-dokumentne matrice, odlučili smo ju aproksimirati matricom nižeg ranga. Aproksimaciju je omogućila singularna dekompozicija matrice (SVD). Pokazali smo da aproksimacijom uzimamo u obzir kontekst u kojem se riječ nalazi. Kako bismo korisnikov upit mogli usporediti s vektorima dokumenata u novonastalom prostoru i njega transformiramo. Pokazali smo kako u slučaju dinamičke kolekcije možemo dodati nove dokumente i pojmove u već postojeći latentni prostor. Iako je opisana metoda, koju kraće zovemo LSA, donekle riješila problem sinonima, preostao je problem s višeznačnicama. Osim toga, LSA pretpostavlja da šum uzorka podataka (dobiven zbog jezične varijabilnosti) ima Gaussovu distribuciju, što nije prirodna pretpostavka. Sljedećom metodom, pLSA, pretpostavili smo da svaki dokument dolazi iz nekog generativnog, vjerojatnosnog procesa čije parametre tražimo maksimizacijom izglednosti. Svaki dokument je mješavina latentnih koncepata i tražimo posteriorne vjerojatnosti tih koncepata uz dana opažanja. Međutim, pLSA ih shvaća kao parametar modela, što dovodi do prenaučenosti. Zato smo prezentirali još jedan model, LDA, koji te vjerojatnosti tretira kao distribuciju koja ovisi o nekom parametru. Kao i pLSA, i LDA reprezentira dokumente kao mješavinu latentnih tema, ali teme su sada distribucije riječi iz rječnika. Zato je bilo potrebno definirati neku distribuciju distribucija, gdje se prirodno nametnula Diricheltova distribucija. Na kraju smo ukratko prikazali modeliranje tema na kolekciji članaka iz Wikipedije.Nowadays, more and more important is to make a computer that performs tasks that man does routinely, as fast and efficiently. One of these tasks is finding a few documents from the given collection, that are most relevant for user’s query. The first step in solving this problem is representing the collection of documents as a term-document matrix, whose elements are tf-idf weights of words in the document. In this way, we represent each document as a vector in the space of terms. If the query is represented as a vector as well, standard similarity measures, such as a cosine similarity, can be used for comparison of the query and documents. In such space, synonyms will be orthogonal and polysemies will be presented with one vector, regardless of the context of the word. Motivated by this fact, and a large dimension of the term-document matrix, a lower rank approximation of the matrix is done. The approximation is gained using a singular value decomposition (SVD) of the matrix. We have shown that the approximation takes into account the context of the words. The query needs to be transformed into a new space as well, so it can be compared with vectors in this lower dimensional space. We showed how can we add new documents and terms in the case of a dynamic collection. While this method, solves the problem of synonyms to some extent, the problem with polysemies remains unsolved. In addition, LSA assumes that the data noise (gained from language variability) has a Gaussian distribution, which is not a natural assumption. The following method, pLSA, assumes that each document comes from a generative, probabilistic process, whose parameters we seek with maximization of likelihood. Each document is a mixture of latent concepts and we look for posterior probabilities of these concepts when observations are given. However, pLSA assumes these probabilities are parameters of model which leads to over-fitting of the model. Therefore, we present another model, LDA, that treats these probabilities as a distribution that depends on some parameter. Documents are, again, represented as a mixture of latent topics, but these topics are a distribution of words from the dictionary. Therefore, it is necessary to define a distribution of distributions and a natural choice is the Dirichelt distribution. Finally, we have briefly presented a topic modeling of the collection of articles from Wikipedia
Algoritmi za brzo množenje i dijeljenje velikih prirodnih brojeva
Get PDFEfikasna realizacija osnovnih aritmetičkih operacija na velikim brojevima se, obično, izvodi tako da brojeve prikažemo kao niz znamenki u nekoj odabranoj bazi, tako da se osnovne operacije na znamenkama egzaktno i brzo izvode u aritmetici računala. Algoritmi za zbrajanje i oduzimanje brojeva koji oponašaju algoritme za "ručno" računanje, linearno ovise o duljini brojeva i optimalni su. S druge strane, algoritmi koji oponašaju "ručno" množenje i dijeljenje su kvadratne složenosti. U ovom radu smo pokazali da postoje bolji algoritmi za množenje i dijeljenje velikih brojeva. Najprije smo detaljno opisali algoritam klasičnog ("ručnog") množenja, za kojeg smo dokazali da ima kvadratnu složenost. Prvo poboljšanje tog algoritma smo dobili metodom "podijeli pa vladaj" -- podijelili smo brojeve na 2 i više dijelova. Uz korištenje polinomne interpolacije i evaluacije, dobili smo algoritam čija složenost ne ovisi više kvadratno o duljini brojeva. Taj algoritam se zove Karatsubin algoritam, u čast A. Karatsube, koji je prvi došao do tog algoritma. Također, napravili smo i implementaciju klasičnog i Karatsubinog algoritma u programskom jeziku Java te smo na primjeru pokazali da je Karasubin algoritam efikasniji od klasičnog algoritma. Još bolji algoritam je Schönhage--Strassenov algoritam, koji koristi brzu Fourierovu transformaciju za množenje polinoma. Jedno poglavlje smo posvetili opisu tog algoritma te pokazali da je njegova složenost . To je, trenutno, najbrži poznati algoritam za množenje brojeva. Na kraju smo opisali i opći algoritam za brzo dijeljenje, preko brzog množenja, koji je baziran na Newtonovoj metodi s progresivnim povećanjem točnosti. Dokazali smo da složenost algoritma za brzo dijeljenje linearno ovisi o izabranom algoritmu za množenje.Efficient realization of basic arithmetic operations on big natural numbers is usually performed by representing big numbers as arrays of digits in a chosen base, so that arithmetic operations on digits are performed exactly and quickly in computer arithmetics. Addition and subtraction algorithms, which simulate ”manual” addition and subtraction, have linear complexity, depending on number length. Also, these algorithms are optimal. On the other hand, ”manual” multiplication and division algorithms have quadratic complexity, and they are not optimal. At the beginning of this thesis, we described the classic multiplication algorithm and proved that the complexity of this algorithm is quadratic. We got the first improvement in complexity by designing an algorithm with the ”divide and conquer” strategy. By splitting numbers in 2 or more pieces, and with usage of polynomial interpolation and evaluation, we got an algorithm whose complexity is less than quadratic. This algorithm is called Karatsuba’s algorithm, in honor of A. Karatsuba, who invented this algorithm. We have also implemented the classic and Karatsuba’s algorithm in Java programming language, and showed an example of improvement in speed by using Karatsuba’s algorithm, instead of the classic algorithm. An even better multiplication algorithm is the Schönhage–Strassen algorithm, which uses the Fast Fourier Transform for polynomial multiplication. We have one chapter dedicated to describing this algorithm which has the complexity . This is the fastest multiplication algorithm, so far. At the end, we have described a general division algorithm, based on fast multiplication, which uses Newton’s method with progressive accuracy improvement. We have proved that the complexity of this algorithm depends linearly on the complexity of the chosen multiplication algorith
- …
