Auflistung Mathematics nach Titel
-
Obradović, Milutin (Belgrade , 1984)[more][less]
URI: http://hdl.handle.net/123456789/63 Dateien zu dieser Ressource: 1
phdMilutinObradovic.pdf ( 1.416Mb ) -
Radičić, Biljana (Beograd , 2016)[more][less]
Zusammenfassung: In thisdissertation, k-circulantmatricesareconsidered,where k is an arbitrary complexnumber.Themethodforobtainingtheinverseofanon- singular k-circulantmatrix,foranarbitrary k ̸= 0, ispresented,andusing that method,theinverseofanonsingular k-circulantmatrixwithgeometric sequence (witharithmeticsequence)isobtained,foranarbitrary k ̸= 0 (for k = 1). Usingthefullrankfactorizationofàmatrix,theMoore-Penrosein- verseofasingular k-circulantmatrixwithgeometricsequence(witharithme- tic sequence)isdetermined,foranarbitrary k (for k = 1). Foranarbitrary k, the eigenvalues,thedeterminantandtheEuclideannormofa k-circulantma- trix withgeometricsequencei.e.witharithmeticsequencearederived,and boundsforthespectralnormofa k-circulantmatrixwithgeometricsequence are determined.Also, k-circulantmatriceswiththe rstrow (F1; F2; :::;Fn) i.e. (L1;L2; :::;Ln), where Fn i.e. Ln is the nth Fibonaccinumberi.e.Lucas number,areinvestigatedandtheeigenvaluesandtheEuclideannormsof suchmatricesareobtained.BoundsforthespectralnormsoftheHadamard inversesoftheabovematrices,foranarbitrary k ̸= 0, arealsodetermined. Attheendofthisdissertation,theeigenvalues,thedeterminantandbounds for thespectralnormofa k-circulantmatrixwithbinomialcoe cientsare derived,andboundsforthespectralnormoftheHadamardinverseofsuch matrix, foranarbitrary k ̸= 0, aredetermined. URI: http://hdl.handle.net/123456789/4456 Dateien zu dieser Ressource: 1
Disertacija_Biljana_Radicic.pdf ( 1.609Mb ) -
Milić, Svetozar (Belgrade)[more][less]
URI: http://hdl.handle.net/123456789/233 Dateien zu dieser Ressource: 1
phdSvetozarMilic.PDF ( 2.088Mb ) -
Stojković, Vojislav (Belgrade , 1981)[more][less]
URI: http://hdl.handle.net/123456789/368 Dateien zu dieser Ressource: 1
phdVojislavStojkovic.pdf ( 7.511Mb ) -
Krgović, Dragica (Belgrade , 1982)[more][less]
URI: http://hdl.handle.net/123456789/278 Dateien zu dieser Ressource: 1
phdDragicaKrgovic.pdf ( 3.332Mb ) -
Bogdanović, Stojan (Novi Sad)[more][less]
URI: http://hdl.handle.net/123456789/90 Dateien zu dieser Ressource: 1
phdStojanBogdanovic.pdf ( 2.457Mb ) -
Janjić, Slobodanka (Belgrade , 1985)[more][less]
URI: http://hdl.handle.net/123456789/85 Dateien zu dieser Ressource: 1
phdSlobodankaJanjic.pdf ( 2.247Mb ) -
Shkodra, Sadri (Priština)[more][less]
URI: http://hdl.handle.net/123456789/116 Dateien zu dieser Ressource: 1
phdSadriShkodra.pdf ( 31.02Mb ) -
Jovanović, Aleksandar (Beograd)[more][less]
Zusammenfassung: The dissertation consists of five chapters. The Chapters 1 and 2 contain the known results from the model theory and the set theory which are used in the other chapters. A classification of the properties of filters is given in Chapter 3. Some connections between combinatoric properties are made and the theorems about existence are also given. Ultraproducts are studied in Chapter 4. The structure of ultraproducts is connected with the structure of ultrafilters and cardinality of ultraproducts. Moreover, some other problems are studied, as the 2- cardinality problem. In the case of a measurable cardinal the connection with continuum problem is presented and several theorems of the cardinality of ultraproducts are proved. The problems about the real measure are studied in Chapter 5. The forcing is presented and by using results from Chapter 3 and Chapter 4 several properties are proved. The notion of norm of measure is introduced and some possible relations between additivity and norm of a measure are studied. Real large measurable cardinals are introduced analogously as the other large cardinals. The inspiration for this introduction were Solovay’s results of equconsistency of the theory ZDF + ”there is a measurable cardinal” and the theory ZDF+”there is a real measurable cardinal”. The relative consistency of the real large measurable cardinals with respect to ZDF+”the corresponding large cardinal” is proved by a generalization of Solovay’s forcing. URI: http://hdl.handle.net/123456789/683 Dateien zu dieser Ressource: 1
work001AleksandarJovanovic.pdf ( 16.02Mb ) -
Jovanov, Đurica (Beograd , 1991)[more][less]
URI: http://hdl.handle.net/123456789/4128 Dateien zu dieser Ressource: 1
Varijacione_nejednacine.PDF ( 910.5Kb ) -
Janković, Vladimir (Belgrade , 1983)[more][less]
URI: http://hdl.handle.net/123456789/260 Dateien zu dieser Ressource: 1
phdVladimirJankovic.pdf ( 4.919Mb ) -
Simić, Slavko (Belgrade , 1997)[more][less]
URI: http://hdl.handle.net/123456789/206 Dateien zu dieser Ressource: 1
phdSlavkoSimic.pdf ( 1.311Mb ) -
Lukić, Mirko (Belgrade)[more][less]
URI: http://hdl.handle.net/123456789/65 Dateien zu dieser Ressource: 1
phdMirkoLukic.pdf ( 2.405Mb ) -
Kulenović, Mustafa (Sarajevo)[more][less]
URI: http://hdl.handle.net/123456789/160 Dateien zu dieser Ressource: 1
phdMustafaKulenovic.pdf ( 3.174Mb ) -
Popstanojević, Zoran (Belgrade , 1963)[more][less]
URI: http://hdl.handle.net/123456789/224 Dateien zu dieser Ressource: 1
phdZoranPopstojanovic.pdf ( 1.549Mb ) -
Muzika Dizdarević, Manuela (Beograd , 2017)[more][less]
Zusammenfassung: Subject of this doctoral thesis is the application of algebraic techniques on one of the central topics of combinatorics and discrete geometry - polyomino tiling. Polyomino tilings are interesting not only to mathematicians, but also to physicists and biologists, and they can also be applied in computer science. In this thesis we put some emphasis on possibility to solve special class of tiling problems, that are invariant under the action of nite group, by using theory of Gr obner basis for polynomial rings with integer coe cients. Method used here is re ecting deep connection between algebra, geometry and combinatorics. Original scienti c contribution of this doctoral thesis is, at the rst place, in developing a techniques which enable us to consider not only ordinary Z?tiling problems in a lattice but the problems of tilings which are invariant under some subgroups of the symmetry group of the given lattice. Besides, it provides additional generalizations, originally provided by famous mathematicians J. Conway and J. Lagarias, about tiling of the triangular region in hexagonal lattice. Here is a summary of the content of the theses. In the rst chapter we give an exposition of the Gr obner basis theory. Especially, we emphasize Gr obner basis for polynomial rings with integer coe cients. This is because, in this thesis, we use algorithms for determining Gr obner basis for polynomials with integer coe cients. Second chapter provides basic facts about regular lattices in the plane. Also, this chapter provides some fundamental terms of polyomino tiling in the square and hexagonal lattice. Third chapter of this thesis is about studying Ztilings in the square lattice, which are invariant under the subgroup G of the group of all isometric transformations of the lattice which is generated by the central symmetry. One of the steps to resolve this problem was to determine a ring of invariants PG and its generators and relations among them. We use Gr obner basis theory to achieve this. Forth chapter covers the analysis of Ztilings in the hexagonal lattice which are symmetric with respect to the rotation of the plane for the angle of 120 . Main result of the fourth chapter is the theorem which gives conditions for symmetric tiling of the triangular region in plane TN, where N is the number of hexagons on each side of triangle. This theorem is one of the possible generalizations of the well known result, provided by Conway and Langarias. Fifth chapter provides another generalization of Conway and Lagarias result, but this time it is about determining conditions of tiling of triangular region TN in the hexagonal lattice not only with tribones, but with nbones. nbone is basic shape of of n connected cells in the hexagonal lattice, where n is arbitrary integer. URI: http://hdl.handle.net/123456789/4503 Dateien zu dieser Ressource: 1
muzikadizarevic.manuela.pdf ( 33.23Mb ) -
Lazarević, Ilija (Belgrade)[more][less]
URI: http://hdl.handle.net/123456789/331 Dateien zu dieser Ressource: 1
phdIlijaLazarevic.pdf ( 3.607Mb ) -
Lazović, Bojana (Beograd , 2018)[more][less]
URI: http://hdl.handle.net/123456789/4748 Dateien zu dieser Ressource: 1
B_Lazovic_Doktorska_disertacija.pdf ( 2.269Mb ) -
Jandrlić, Davorka (Beograd , 2016)[more][less]
Zusammenfassung: Application of association rule and support vector machine technique for T cell epitope prediction Abstract: Data mining is an interdisciplinary sub eld of computer science, including various scienti c disciplines such as: database systems, statistics, machine learning, arti cial intelligence and the others. The main task of data mining is automatic and semi-automatic analysis of large quantities of data to extract previously unknown, nontrivial and interesting patterns. Rapid development in the elds of immunology, genomics, proteomics, molecular biology and other related areas has caused a large increase in biological data. Drawing conclusions from these data requires sophisticated computational analyses. Without automatic methods to extract data it is almost impossible to investigate and analyze this data. Currently, one of the most active problems in immunoinformatics is T cell epitope identi cation. Identi cation of T - cell epitopes, especially dominant T - cell epitopes widely represented in population, is of the immense relevance in vaccine development and detecting immunological patterns characteristic for autoimmune diseases. Epitope-based vaccines are of great importance in combating infectious and chronic diseases and various types of cancer. Experimental methods for identi cation of T - cell epitopes are expensive, time consuming, and are not applicable for large scale research (especially not for the choice of the optimal group of epitopes for vaccine development which will cover the whole population or personalized vaccines). Computational and mathematical models for T - cell epitope prediction, based on MHC-peptide binding, are crucial to enable the systematic investigation and identi cation of T - cell epitopes on a large dataset and to complement expensive and time consuming experimentation [16]. T - cells (T - lymphocytes) recognize protein antigen(s) only when degradated to peptide fragments and complexed with Major Histocompatibility Complex (MHC) molecules on the surface of antigen-presenting cells [1]. The binding of these peptides (potential epitopes) to MHC molecules and presentation to T - cells is a crucial (and the most selective) step in both cellular and humoral adoptive immunity. Currently exist numerous of methodologies that provide identi cation of these epitopes. In this PhD thesis, discussed methods are exclusively based on peptide sequence binding to MHC molecules. It describes existing methodologies for T - cell epitope prediction, the shortcomings of existing methods and some of the available databases of experimentally determined linear T - cell epitopes. The new models for T - cell epitope prediction using data mining techniques are developed and extensive analyses concerning to whether disorder and hydropathy prediction methods could help understanding epitope processing and presentation is done. Accurate computational prediction of T cell epitope, which is the aim of this thesis, can greatly expedite epitope screening by reducing costs and experimental e ort. These theses deals with predictive data mining tasks: classi cation and regression, and descriptive data mining tasks: clustering, association rules and sequence analysis. The new-developed models, which are main contribution of the dissertation are comparable in performance with the best currently existing methods, and even better in some cases. Developed models are based on the support vector machine technique for classi cation and regression problems. À new approach of extracting the most important physicochemical properties that in uence the classi cation of MHC-binding ligands is also presented. For that purpose are developed new clustering-based classi cation models. The models are based on k-means clustering technique. The second part of the thesis concerns the establishment of rules and associations of T - cell epitopes that belong to di erent protein structures. The task of this part of research was to nd out whether disorder and hydropathy prediction methods could help in understanding epitope processing and presentation. The results of the application of an association rule technique and thorough analysis over large protein dataset where T cell epitopes, protein structure and hydropathy has been determined computationally, using publicly available tools, are presented. During the research on this theses new extendable open source software system that support bioinformatic research and have wide applications in prediction of various proteins characteristics is developed. A part of this thesis is described in the works [71][82][45][42][43][44][72][73] that are published or submitted for publications in several journals. The dissertation is organized as follows: In section1 is illustrated introduction to the problem of identifying T - cell epitopes, the importance of mathematical and computational methods in this area, vii as well as the importance of T - cell epitopes to the immune system and basis for functioning of the immune system. In section 2 are described in details data mining techniques that are used in the thesis for development of new models. Section 3 provides an overview of existing methods for predicting the T - cell epitopes and explains the work methodologies of existing models and methods. It pointed out the shortcomings of existing methods which have been the motivation for the development of new models for the T - cell epitope prediction. Some of the publicly available databases with the experimentally determined MHC binding peptides and T - cell epitope are described. In section 4 are presented new developed models for epitopes prediction. The developed models include three new encoding schemes for peptide sequences representation in the form of a vector which is more suitable as input to models based on the data mining techniques. Section 5 reports results of presented new classi cation and regression models. The new models are compared with each other as well as with currently existing methods for T cell epitope prediction. Section 6 presents the research results of the T - cell epitopes relationship with ordered and disordered regions in proteins. In the context of this chapter summary results are presented which are shown in more detail in the published works [71][82][45][44]. Section 7 concludes the dissertation with some discussion of the potential signi cance of obtained results and some directions for future work. URI: http://hdl.handle.net/123456789/4457 Dateien zu dieser Ressource: 1
doktorskaTezaDavorkaJandrlic.pdf ( 7.938Mb ) -
Karapandžić, Đorđe (Belgrade)[more][less]
URI: http://hdl.handle.net/123456789/142 Dateien zu dieser Ressource: 1
phdDjordjeKarapandzic.pdf ( 3.246Mb )