Browsing by Title
-
Peleksić, Ljubica (Beograd , 2021)[more][less]
-
Šandrih, Branislava (Beograd , 2020)[more][less]
Abstract: The main goal of this dissertation is to put different text classification tasks inthe same frame, by mapping the input data into the common vector space of linguisticattributes. Subsequently, several classification problems of great importance for naturallanguage processing are solved by applying the appropriate classification algorithms.The dissertation deals with the problem of validation of bilingual translation pairs, sothat the final goal is to construct a classifier which provides a substitute for human evalu-ation and which decides whether the pair is a proper translation between the appropriatelanguages by means of applying a variety of linguistic information and methods.In dictionaries it is useful to have a sentence that demonstrates use for a particular dictio-nary entry. This task is called the classification of good dictionary examples. In this thesis,a method is developed which automatically estimates whether an example is good or badfor a specific dictionary entry.Two cases of short message classification are also discussed in this dissertation. In thefirst case, classes are the authors of the messages, and the task is to assign each messageto its author from that fixed set. This task is called authorship identification. The otherobserved classification of short messages is called opinion mining, or sentiment analysis.Starting from the assumption that a short message carries a positive or negative attitudeabout a thing, or is purely informative, classes can be: positive, negative and neutral.These tasks are of great importance in the field of natural language processing and theproposed solutions are language-independent, based on machine learning methods: sup-port vector machines, decision trees and gradient boosting. For all of these tasks, ademonstration of the effectiveness of the proposed methods is shown on for the Serbianlanguage. URI: http://hdl.handle.net/123456789/5090 Files in this item: 1
BranislavaSandrihPhd_konacno.pdf ( 9.053Mb ) -
Šulikovskii, V. I. (Moskva , 1963)[more][less]
-
Simić, Milica (Beograd , 2023)[more][less]
URI: http://hdl.handle.net/123456789/5643 Files in this item: 1
v1_masterMilicaSimic.pdf ( 12.65Mb ) -
Ninković, Radmila (Beograd , 2022)[more][less]
-
Šikić, Zvonimir (Profil International Zagreb , 2001)[more][less]
URI: http://hdl.handle.net/123456789/5570 Files in this item: 1
ZSikic_KNJIGA_O_KALENDARIMA.pdf ( 73.76Mb ) -
Dostojevski, Fjodor (Beograd , 2021)[more][less]
-
Bilimović, Anton (Beograd , 1937)[more][less]
URI: http://hdl.handle.net/123456789/3930 Files in this item: 1
Bilimovic_Koeficijent.PDF ( 3.644Mb ) -
Ivanović, Jelena (Beograd , 2020)[more][less]
Abstract: U teoriji kategorija, koherencija koja je vezana za odre eni tip kategori-ja, u najgrubljem smislu znaqi komutiranje dijagrama sastavljenih od kanonskihstrelica tih kategorija. Ovo komutiranje mo e biti bezuslovno ili uslovljenozadatim pretpostavkama. U savremenom smislu, koherencija, taqnije teoremekoherencije, podrazumevaju postojanje vernog funktora iz slobodno generisa-ne kategorije datog tipa u kategoriju koja omogu ava proveru jednakosti stre-lica. Takve su najqex e kategorije qije su strelice relacije ili dijagrami(mnogostrukosti, kobordizmi).Rezultati koherencije su od velikog znaqaja za opxtu teoriju dokaza. Naime,oni obezbe uju formiranje zadovoljavaju eg kriterijuma za jednakost izvo enjau odre enim deduktivnim sistemima i na taj naqin pru aju mogu nost defini-sanja osnovnog pojma kojim se teorija dokaza bavi.Predmet ove doktorske disertacije je prouqavanje topoloxkih dokaza ko-herencije i formiranje novih klasa politopa koje u takvim dokazima koheren-cije mogu poslu iti. Sadr aj disertacije je, dakle, u najve oj meri posve enspomenutim dokazima koherencije, odnosno raznovrsnim geometrijskim realiza-cijama specifiqnih apstraktnih politopa koji su zadati kombinatorno.Naime, ranih devedesetih godina, Mihail Kapranov je uveo familiju e-lijskih kompleksa pod nazivom permutoasociedri koja predstavlja ,,hibrid” dveznaqajne familije prostih politopa–familije asociedara i familije permuto-edara. Ovaj hibrid je predstavljao prvu geometrijsku interpretaciju udru i-vanja komutativnosti i asocijativnosti. Kapranov je pokazao da je datom elij-skom strukturom proizveoCW-loptu qime je dobio direktan topoloxki dokazkoherencije u simetriqnim monoidalnim kategorijama. Ubrzo nakon toga, Vik-tor Rajner i Ginter Cigler su ove elijske komplekse realizovali kao fami-liju konveksnih politopa. Me utim, dobijena familija nije familija prostihpolitopa. S druge strane, i svi asociedri i svi permutoedri jesu prosti. Onipripadaju nestoedarima–xiroko izuqavanoj familiji prostih politopa, kako sakombinatorne strane, tako i sa strane primena u torusnoj topologiji.Polazixte ove teze je da je prirodno prona i prost hibrid ove dve fami-lije, tj. prost permutoasociedar. Koriste i kombinatornu proceduru sliqnuonoj koja je proizvela i same asociedre i permutoedre, u ovoj disertaciji seuvodi apstraktni politop koji odgovara problemu koherencije, a koji se pritommo e realizovati kao prost politop. Preciznije, formirane su klasen-dimen-zionalnih prostih permutoasociedara koje daju topoloxki dokaz simetriqnemonoidalne koherencije, a zatim su te klase i geometrijski realizovane eks-plicitnim zadavanjem nejednaqina poluprostora uRn+1koji definixu politopexiii xivu klasama. Ovan-dimenzionalna realizacija je oznaqena saPAn. Pored toga,u tezi je ponu ena i alternativna realizacija iste familije uz pomo sumaMinkovskog. Naime, uvedena je familijan-dimenzionalnih politopa, oznaqe-na saPAn,c, koja je dobijena sumiranjem odre enih politopa. PolitopPAn,cjenormalno ekvivalentan politopuPAnza svakoc∈(0,1]. Req je o specifiqnojrealizaciji, po ugledu na realizaciju nestoedara Aleksandra Postnjikov, kojapodrazumeva da svaki sabirak, grubo reqeno, doprinosi nastajanju taqno jednepljosni rezultuju e sume Minkovskog. Drugim reqima, svaki sabirak dovodi dozarubljivanja teku e parcijalne sume odsecanjem jedne njene strane. Postnjikovje za sabirke koristio simplekse, dok ova disertacija pokazuje da je, u analog-noj realizaciji prostog permutoasociedra, za odre ene sabirke neophodno uzetipolitope koji ne samo da nisu simpleksi, ve nisu nu no ni prosti politopi. Usluqaju formiranja familijePAn,1, sabirci su definisani kao konveksni omo-taqi skupova taqaka uRn+1xto je znaqajna prednost sa stanovixta programi-ranja.Osim xto predstavlja direktan topoloxki dokaz teoreme koherencije u si-metriqnim monoidalnim kategorijama, poseban znaqaj ove alternativne reali-zacije je u uspostavljanju jasne veze izme u operacije sumiranja Minkovskogi operacije odsecanja strana permutoedra, tj. njegovog zarubljivanja. Iz oveveze implicitno sledi procedura za analognu realizaciju xire klase prostihpolitopa–familije prostih permutonestoedara.Na kraju, u tezi su date ocene hromatskih brojeva prostog permutoasociedrai nekih znaqajnih nestoedara, sa ciljem prouqavanja mogu e veze ovih klasapolitopa sa torusnim i kvazitorusnim mnogostrukostima.Tokom svih spomenutih istra ivanja, za potrebe ove disertacije je razvijenonekoliko softverskih rexenja (programa i aplikacija) uz pomo raznovrsnihprogramskih jezika i paketa (Java,polymake/Perl,Rhinoceros/ Grasshopper). Naj-znaqajnija me u njima opisana su u dodatku teze programskim kodom i odgo-varaju im ilustrativnim primerima. URI: http://hdl.handle.net/123456789/5104 Files in this item: 1
Ivanovic_Jelena_disertacija.pdf ( 2.983Mb ) -
Rogić, Jelena (Beograd , 2018)[more][less]
-
Tomanić, Lidija (Beograd , 2023)[more][less]
URI: http://hdl.handle.net/123456789/5672 Files in this item: 1
v1_masterLidijaTomanic.pdf ( 912.8Kb ) -
Drakulić, Uroš (Beograd , 2015)[more][less]
-
Tomić, S. Aleksandar (Astr. Soc. "Rudjer Bošković" , 2008)[more][less]
-
Ivanović, Aleksandar (Beograd , 2022)[more][less]
-
Milićević, Matej (Beograd , 2017)[more][less]
-
Milosavljević, Ivana (Beograd , 2023)[more][less]
URI: http://hdl.handle.net/123456789/5553 Files in this item: 1
masterIvanaMilosavljevic.pdf ( 466.1Kb ) -
Pešović, Marko (Beograd , 2021)[more][less]
Abstract: The combinatorial objects can be joined in a natural way with the correspondingcombinatorial Hopf algebras. Many classical enumerative invariants of combinatorial objectsare obtained as a result of universal morphism from the corresponding combinatorial Hopfalgebras to the combinatorial Hopf algebra of quasisymmetric functions.On the other hand, to combinatorial objects we can assign some geometric objects such ashyperplane arrangement or convex polytope. For example, simple graph corresponds to graphicalzonotope and matroid corresponds to matroid base polytope. These classes of polytopes belongto the class of polytopes known as generalized permutohedra. For a generalized permutohedronthere is a weighted quasisymmetric enumerator which for different classes of generalizedpermutohedra represents generalizations of classical enumerative invariants such as Stanley’schromatic symmetric function for graph and Billera−Jia−Rainer quasisymmetric function formatroid.A weighted quasisymmetric enumerator associated with a generalized permutohedron is aquasisymmetric function. For certain classes of generalized permutohedra this enumeratorcoincides with the result of the universal morphism from corresponding combinatorial Hopfalgebra. URI: http://hdl.handle.net/123456789/5207 Files in this item: 1
Pesovic_Marko.pdf ( 1.804Mb ) -
Majstorović, Ivana (Beograd , 2020)[more][less]
-
Cvetković, Dragoš (Belgrade , 1987)[more][less]
URI: http://hdl.handle.net/123456789/460 Files in this item: 1
book001DragosCvetkovic.pdf ( 15.14Mb ) -
Jelić Milutinović, Marija (Beograd , 2021)[more][less]
Abstract: In this dissertation we examine several important objects and concepts in combinatorialtopology, using both combinatorial and topological methods.The matching complexM(G) of a graphGis the complex whose vertex set is the setof all edges ofG, and whose faces are given by sets of pairwise disjoint edges. These com-plexes appear in many areas of mathematics. Our first approach to these complexes is newand structural - we give complete classification of all pairs (G,M(G)) for whichM(G) is ahomology manifold, with or without boundary. Our second approach focuses on determiningthe homotopy type or connectivity of matching complexes of several classes of graphs. Weuse a tool from discrete Morse theory called the Matching Tree Algorithm and inductiveconstructions of homotopy type.Two other complexes of interest are unavoidable complexes and threshold complexes.Simplicial complexK⊆2[n]is calledr-unavoidable if for each partitionA1t···tAr= [n] atleast one of the setsAiis inK. Inspired by the role of unavoidable complexes in the Tverbergtype theorems and Gromov-Blagojevi ́c-Frick-Ziegler reduction, we begin a systematic studyof their combinatorial properties. We investigate relations between unavoidable and thre-shold complexes. The main goal is to find unavoidable complexes which are unavoidable fordeeper reasons than containment of an unavoidable threshold complex. Our main examplesare constructed as joins of self-dual minimal triangulations ofRP2,CP2,HP2, and joins ofRamsey complex.The dissertation contains as well an application of the important “configuration space -test map” method. First, we prove a cohomological generalization of Dold’s theorem fromequivariant topology. Then we apply it to Yang’s case of Knaster’s problem, and obtain anew simpler proof. Also, we slightly improve few other cases of Knaster’s problem. URI: http://hdl.handle.net/123456789/5184 Files in this item: 1
Marija_Jelic_Milutinovic.pdf ( 5.212Mb )