Auflistung Doctoral Dissertations nach Titel
-
Bačanin Džakula, Nebojša (Beograd , 2015)[more][less]
Zusammenfassung: Hard optimization problems that cannot be solved within acceptable computational time by deterministic mathematical methods have been successfully solved in recent years by population-based stochastic metaheuristics, among which swarm intelligence algorithms represent a prominent class. This thesis investigates improvements of the swarm intelligence metaheuristics by hybridization. During analysis of the existing swarm intelligence metaheuristics in some cases de ciencies and weaknesses in the solution space search mechanisms were observed, primarily as a consequence of the mathematical model that simulates natural process as well as inappropriate balance between intensi cation and diversi cation. The thesis examines whether existing swarm intelligence algorithms for global optimization could be improved (in the sense of obtaining better results, faster convergence, better robustness) by hybridization with other algorithms. A number of hybridized swarm intelligence metaheuristics were developed and implemented. Considering the fact that good hybrids are not created as a random combination of individual functional elements and procedures from di erent algorithms, but rather established on comprehensive analysis of the functional principles of the algorithms that are used in the process of hybridization, development of the hybrid approaches was preceded by thorough research of advantages and disadvantages of each involved algorithm in order to determine the best combination that neutralizes disadvantages of one approach by incorporating the strengths of the other. Developed hybrid approaches were veri ed by testing on standard benchmark sets for global optimization, with and without constraints, as well as on well-known practical problems. Comparative analysis with the state-of-the-art algorithms from the literature demonstrated quality of the developed hybrids and con rmed the hypothesis that swarm intelligence algorithms can be successfully improved by hybridization. URI: http://hdl.handle.net/123456789/4245 Dateien zu dieser Ressource: 1
phdBacaninNebojsa.pdf ( 3.813Mb ) -
Banković, Milan (Beograd , 2016)[more][less]
Zusammenfassung: SMT solvers implement decision procedures that check for satisfiability of first-order logical formulae with respect to some decidable theory. They rely on the powerful techniques that are used for solving boolean satisfiability problem (SAT), combined with specific procedures that permit reasoning in a particular theory. Typical applications of SMT solvers are mostly found in software verification, and for this reason the theories frequently considered in SMT solvers are best suited for such kind of applications. Extending the applicability of SMT solvers to other areas may require defining new SMT theories, as well as developing the corresponding decision procedures for such theories. In that sense, in this thesis we consider improving of SMT solvers by extending their applicability to solving CSP problems. Such problems consider variables with finite domains, and the goal is to find the assignment of values to the variables of the problem satisfying all the imposed constraints. When CSP solving is considered, the main drawback of the existing SMT theories is that they are not adapted to the problems with finite domains, and are also incapable of reasoning about global constraints, which play the significant role in most CSP problems. For this reason, in this thesis a novel SMT theory is defined that enables natural representation of CSP problems, since it includes support for some frequently used global constraints. For such theory, we developed a decision procedure based on the existing techniques borrowed from the traditional CSP solvers, but these techniques are adapted in the way that permits their usage within SMT solvers. The decision procedure currently supports two types of global constraints: the alldifferent constraint and the linear constraint. In case of the alldifferent constraint, the main contribution is a novel algorithm for generating explanations of conflicts and propagations, which is required for the conflict analysis. In case of the linear constraint, a novel filtering algorithm is developed that takes into consideration the existence of the alldifferent constraints in the given problem, which can lead to a stronger propagation. Another direction of improving SMT solvers that is considered in the thesis is the usage of the parallelization techniques. We consider the parallelization of the simplex algorithm, which is used in SMT solvers as the decision procedure for the linear arithmetic. We also consider the parallel portfolio approach, as well as the hybridization of the two approaches. A comprehensive experimental evaluation is provided on a large number of instances, both industrial and randomly generated. For the purpose of all the mentioned research, during the work on the thesis a new open-source SMT solver called argosmt is developed, based on DPLL(T ) architecture. URI: http://hdl.handle.net/123456789/5835 Dateien zu dieser Ressource: 1
Disertacija_8.pdf ( 2.359Mb ) -
Lučić, Zoran (Belgrade , 1985)[more][less]
URI: http://hdl.handle.net/123456789/97 Dateien zu dieser Ressource: 1
phdZoranLucic.pdf ( 1.861Mb ) -
Madaras-Silađi, Rozalija (Novi Sad)[more][less]
URI: http://hdl.handle.net/123456789/193 Dateien zu dieser Ressource: 1
phdRozalijaMadarasSiladji.pdf ( 3.002Mb ) -
Vujošević, Luka (Belgrade , 1964)[more][less]
URI: http://hdl.handle.net/123456789/220 Dateien zu dieser Ressource: 1
phdLukaVujosevic.pdf ( 2.312Mb ) -
Jovanović, Milan (Belgrade)[more][less]
URI: http://hdl.handle.net/123456789/58 Dateien zu dieser Ressource: 1
phdMilanJovanovic.pdf ( 1.497Mb ) -
Lazarević, Ivan (Beograd , 2022)[more][less]
Zusammenfassung: In this doctoral thesis we obtained some results in graph theory and its applica tions. In the rst chapter, we give the review of basic notions and theorems of combinatorial theory of graphs, spectral theory of graphs, random graphs and distribution of their eigenvalues. The most detailed consideration is given to adjacency matrix and properties of its spectrum. In particular, in this dissertation we study Energy of graphs and generalizations of it. Energy of graph is the sum of absolute values of eigenvalues of a graph. Schatten norms of graphs represent p-th degree norm of singular values of graph, and the special cases of this norm for p = 1 corresponds to the Energy of graph. In chapter three of this dissertation we are given the most original scienti c contribution. We prove the conjecture of Nikiforov about Schatten norms of graphs when p > 2. First we prove that conjecture is true for some special classes of graph (for trees and strongly regular graph with maximal energy). After that, we prove the conjecture in the general case. Auxiliary theorem obtained in the proof of this conjecture is also an original result which gives a sharp upper bound of sum of quadratic of the largest k singular values of graph. A corollary of this theorem which gives an upper bound for sum of squares of the biggest two singular values of graph can be useful in further research. In the subsection 3.3 we give an original theorem about asymptotic properties of spectrum and thus energy of complement graph for a large values of n. In the subsection 3.4 we calculate a mean of p-th degree of singular values and upper bound of geometric mean of almost all graphs. The last chapter shows relation between combinatorial theory of graphs with universal universal algebra and mathematical logic. The central part of this chapter is original and shorter proof of an important theorem which solves a dichotomy conjecture for CSP problem on undirected graphs. URI: http://hdl.handle.net/123456789/5371 Dateien zu dieser Ressource: 1
Ivan_teza20042022.pdf ( 1.428Mb ) -
Čeki, Atila (Beograd , 2013)[more][less]
Zusammenfassung: The dissertation presents a program for modeling binary systems, Infinity, which combines the traditional principles of modeling (Roche geometry, von Zeipel’s law of temperature distribution and so forth) with a novel geometrical representation of the system. The study of binary stars has a long tradition in Serbia, mostly due to the research done by dr Gojko Đurašević. The program presented in the dissertation is based on his program for modeling of active close binary systems with an accretion disk (Đurašević, 1991) and brings several significant improvements that can be classified in two categories: The first group of improvements has to do with generalizing the model. First and foremost, the new program is applicable to systems with eccentric orbits, and is capable of computing and solving the inverse problem for radial velocities. It also features a new algorithm for determining which elements of the stellar surface are visible during the eclipse. The new algorithm allows for computing the light curves with greater precision using a method of ‘adaptive subdivision’ in the region of eclipse. The geometrical aspects of modeling the accretion disk are also improved and now include the possibility to create both conical and toroidal disks. The second group of improvements is related to the modeling of physical processes on the binary system components. The most significant change is in the way the emergent flux is calculated. Namely, the Đurašević program assumes that the elements of stellar surface produce blackbody radiation, while the new program assigns a one-dimensional Kurucz stellar atmosphere model calculated under the LTE assumption. Improvements are also made in the treatment of the influence of photometric filters on the calculated light curve, and the list of supported filters is extended. A binary system is described by the Roche model, which assumes that the motion and shape of the components are determined by the superposition of gravitational and centrifugal forces, while all the other interactions are neglected. The stars are treated as point masses (under the assumption of total central condensation), so their internal structure is not considered. If the system contains an accretion disk, it is assumed that its mass can be neglected, and that its presence doesn’t influence the dynamics of the system and the shape of the stars. The surface of the components is represented with a polygonal mesh. The stars are approximated with a geodesic, and the accretion disk with an axially-symmetric mesh. The new algorithm for solving the problem of visibility detection, proposed in the dissertation, is based on the so called inverse painter’s algorithm that originates from the field of computer graphics. The most important property of this algorithm is that, other than the polygonal meshes representing the components, it doesn’t require any other information about the geometry of the system. This makes the modeling program easily extendable to more exotic geometric configurations such as systems with eccentric or circumbinary disks, planetary and multiple systems, and so forth. It is assumed that within a single element of stellar surface all the physical quantities – local effective temperature, gravitational acceleration, emergent flux and radial velocity – are constant. Its radiation is affected by gravity darkening, limb darkening and the reflection effect. Gravity darkening is described using von Zeipel’s law, and the limb darkening can be calculated using one of the five available approximations (linear, logarithmic, square-root, quadratic and nonlinear fourth-order approximation). The reflection effect, as well as the temperature distribution along the accretion disk, are calculated using the approach from the Đurašević program (Đurašević, 1991). The local amount of radiation can additionally be affected by active regions that are represented with dark or bright circular spots. The emergent flux is computed as the sum of fluxes from all the surface elements visible in the given moment, and the radial velocity is calculated from the superposition from three kinds of motion: the proper motion of the system center of mass, the motion of the center of the star around the center of mass due to orbital revolution, and the motion of elementary surface around the center of the star due to rotation. Synthetic light and radial velocity curves obtained in this way can be directly compared to observations. The new program solves the inverse problem – estimating the optimal model parameters to fit the given observations – using the Nelder-Mead simplex algorithm to minimize the sum of squares of deviations between the observed and calculated light and radial velocity curves. The validity of the program and the proposed improvements is done by analyzing several binary systems and comparing the results with published solutions obtained with the Đurašević program. URI: http://hdl.handle.net/123456789/5839 Dateien zu dieser Ressource: 1
Disertacija4228.pdf ( 4.176Mb ) -
Alatrash, Emhimed Salem (Beograd , 2015)[more][less]
Zusammenfassung: Ontologies, often defined as an explicit specification of conceptualization, are necessary for knowledge representation and knowledge exchange. This means that ontology describes concepts and relations that exist in a domain. To enable knowledge exchange, it is necessary to describe these concepts and relations in a better way than just ordering them in taxonomy. A computational ontology consists of a number of different components, such as Concepts, Instances, Individuals or Facts, Relations and Attributes. The present research is intended to consider different software tools related to Semantic web, and achieve a kind of comparison among them. In fact, five ontology-editors are described and compared. They are: Apollo, Onto Studio, Protégé, Swoop and TopBraid Composer Free Edition. The structure and basic features of these editors as well as the way of using them are described. The main criterion used in the process of comparing these editors lies in their convenience for the user, and the possibility to apply them in different kinds of application. The main goal of the work is to introduce a method for ontology construction of a certain domain in applying the Semantic web. A number of software tools adapted to build up the domain ontologies of most wide–spread natural languages are available; however accomplishing that for any given natural language presents a challenge. This research proposes a semi-automatic procedure to create ontologies for different natural languages. The approach utilizes various software tools that are available on the Internet, most notably DODDLE-OWL which is a domain ontology development tool implemented for English and Japanese languages. Through this tool, WordNet, Protégé and XSLT transformations, the researcher proposes a general procedure to construct domain ontology for any natural language. URI: http://hdl.handle.net/123456789/4266 Dateien zu dieser Ressource: 1
phdEmhimedAlatrash.pdf ( 2.171Mb ) -
Jović, Aleksandar (Beograd , 2021)[more][less]
Zusammenfassung: The continuous-time programming problem consists in minimizing an integral functional, with phase constraints of different types. The subject of this doctoral dissertation is to establish extremum conditions as well as duality theorems for a class of convex and smooth continuous-time programming problems, with phase constraints of the inequality type. Unfortunately, some of the results in this field are not valid, which is confirmed in 2019. In this paper, new optimality conditions for the aforementioned class of problems are ob tained. The theorems of weak and strong duality are proved. The main tool for deriving these results is a new theorem of the alternative for a convex system of strict and nonstrict inequal ities in infinite dimensional spaces. In order to apply the aforementioned theorem, a suitable regularity condition must be satisfied. Some optimality conditions are obtained with additional constraint regularity qualification. Theoretical results are confirmed by practical examples. URI: http://hdl.handle.net/123456789/5298 Dateien zu dieser Ressource: 1
A.Jovic_doktorska_disertacija.pdf ( 1.280Mb ) -
Vicanović, Jelena (Beograd , 2024)[more][less]
Zusammenfassung: A convex continuous-time maximization problem is formulated and the nec- essary optimality conditions in the infinite-dimensional case are obtained. As a main tool for obtaining optimal conditions in this dissertation we use the new theorem of the alternative. Since there’s no a differentiability assumption, we perform a linearization of the problem using subdifferentials. It is proved that the multiplier with the objective function won’t be equal to zero. It was also shown that if the linear and non-linear constraints are separated, with additional assumptions it can be guaranteed that the multiplier with non-linear constraints will also be non-zero. In the following, an integral constraint is added to the original convex problem, so that a Lyapunov-type problem, i.e. an isoperimetric problem, is considered. Lin- earization of the problem using subdifferentials proved to be a practical way to ignore the lack of differentiability, so the optimality conditions were derived in a similar way. It is shown that the obtained results will also be valid for the vector case of the isoperimetric problem. Additionally, the optimality conditions for the smooth problem were considered. On the minimization problem, it was shown that the necessary conditions of Karush-Kuhn-Tucker type will be valid with the additional regularity constraint condition. Also, any point that satisfies the mentioned optimality conditions will be a global minimum. URI: http://hdl.handle.net/123456789/5676 Dateien zu dieser Ressource: 1
J.Vicanovic_doktorska_disertacija.pdf ( 2.198Mb ) -
Nikolić, Mladen (Belgrade , 2013)[more][less]
Zusammenfassung: In this thesis the problem of guiding search in automated theorem proving is considered. The thesis consists of two parts that have the CDCL search system, the system intensively used by modern SAT solvers, as their common topic. In the rst part of the thesis a simple approach to guiding search is considered | guiding by the selection of the solver, its heuristics, and their parameters, based on the properties of an instance to be solved. The basis of the proposed methods for algorithm selection is syntactical similarity of formulae which is re ected in their graph structure. This graph similarity is established and analyzed by using an original graph similarity measure (which turned out to be useful in other contexts, too). Yet, practical approaches to measuring similarity of formulae are based on their numerical features due to the computational complexity issues. Two simple methods for algorithm selection, based on k nearest neighbors, were proposed. The rst technique, ArgoSmArT is based on classi cation of instance in one of the prede ned families for which the e cient algorithms are known. The instance is solved by algorithm corresponding to the family to which the instance was classi ed. The second technique, ArgoSmArT k-NN is based on nding several similar instances in the training set for which the solving times by all considered algorithms are known. The instance is solved by the algorithm that behaves the best on those instances. ArgoSmArT technique is better suited for con guration selection of a SAT solver, and ArgoSmArT k-NN for SAT solver selection. ArgoSmArT k-NN technique showed to be more e cient than the most important and very complex system for SAT solver selection | SATzilla system. Apart from CNF SAT solver selection, the problem of non-CNF SAT solver selection is considered. The focus was not on solver selection techniques, since the proposed techniques are directly applicable, but on the attributes that can be used to describe non-CNF SAT instances, which have not been proposed earlier. The results in this domain are positive, but still limited. The main reason for that is the lack of greater number of non-CNF SAT solver of di erent behaviour, which is not surprising, having in mind that this kind of solvers is in its early stage of development. Apart from construction of e cient SAT solver selection system, the methodology of SAT solver comparison, based on statistical hypothesis testing is proposed. The need for such a methodology comes from great run time variations of single instance solving by a solver, which can result in di erent SAT solver orderings when one tries to compare their performance or rank them, as experimentally demonstrated. The proposed methodology gives the estimate of statistical signi cance of the performed test and the estimate of the e ect size, for instance the probability of a solver being faster than another. The second part of the thesis is concerned with generalizing CDCL search system to fragments of rst order logic. The proposed system can be used as a basis for e cient proving in some fragment if the rules of resolution and factoring are speci ed for that fragment. These rules are de ned for an extension of coherent logic. The soundness and completeness of the system are proved. The system has several distinguishing features which are a consequence of previously performed analysis of challenges in coherent logic theorem proving. The system enables rst order reasoning, instead of ground one characteristic for all existing coherent logic provers. Moreover, it introduces backjumps and lemma learning. The special attention in system design was paid to the possibility of generating readable proofs by the prover implementing the system. This possibility is one of the greatest qualities of coherent logic, but it is not easy to achieve if CDCL search system is used. One of the properties of the system that came from the need for generation of readable proofs is preservation of quanti ers in proving process which is rather unusual for existing CDCL systems. Another advantage of the proposed CDCL system is the possibility of transfer of heuristics which are already successfully employed in SAT solving to other domains. Based on the proposed system, the proof procedure Calypso for extended coherent logic was de ned which can also be used in standard coherent logic. The extension of Rete algorithm which enables detection of con icts and literals to be propagated or decided is proposed. Procedure Claypso is implemented in C++. It was evaluated on a representative coherent logic problems and it showed superior to other coherent logic provers and also the prover Vampire, the most e cient prover for rst order logic. Based on the results presented in this thesis, it can be concluded that the main hypothesis of this work, that the search system used in CDCL SAT solvers can be signi cantly improved by simple guiding and that it can be successfully formulated for fragments of rst order logic such as coherent logic, was con rmed and that the concrete answers on how to do that were provided. URI: http://hdl.handle.net/123456789/2584 Dateien zu dieser Ressource: 1
nikolic_mladen.pdf ( 1.448Mb ) -
Jovanović Spasojević, Tanja (Beograd , 2022)[more][less]
Zusammenfassung: In this thesis, subjects of consideration are the embeddings theorems of weighted Bergman spaces in Lp-spaces, as well as embeddings theorems of harmonic mixed norm spaces. The first part of the thesis generalizes the theorems of embeddings Bergman spaces into Lp(μ)-spaces, where μ is a Borel measure on a given domain. They have been earlier studied on domains such as unit ball and upper half-space. Generalization refers to bounded domains Ω ⊂ Rn with C1 boundary. This embedding will be valid to any p > 0, whenever the measure of the spaces Lp satisfies the Carledon condition. Reverse the direction will be valid only in case if p > 1 + α+2 n−2 . The second part of the dissertation also generalizes the embeddings theorems of mixed norm spaces of harmonic functions on a unit ball, where the generalization is applied to the domain Ω ⊂ Rn with C1 boundary. However, in addition we are obtaining another important result relating to the limitation of the maximum operators in the mixed norm on the general domain for the class of QNS functions. URI: http://hdl.handle.net/123456789/5799 Dateien zu dieser Ressource: 1
Disertacija_13689.pdf ( 1.643Mb ) -
Jovanović Spasojević, Tanja (Beograd , 2022)[more][less]
Zusammenfassung: In this thesis, subjects of consideration are the embeddings theorems of weighted Bergman spaces in Lp-spaces, as well as embeddings theorems of harmonic mixed norm spaces. The first part of the thesis generalizes the theorems of embeddings Bergman spaces into Lp(μ)-spaces, where μ is a Borel measure on a given domain. They have been earlier studied on domains such as unit ball and upper half-space. Generalization refers to bounded domains Ω ⊂ Rn with C1 boundary. This embedding will be valid to any p > 0, whenever the measure of the spaces Lp satisfies the Carledon condition. Reverse the direction will be valid only in case if p > 1 + α+2 n−2 . The second part of the dissertation also generalizes the embeddings theorems of mixed norm spaces of harmonic functions on a unit ball, where the generalization is applied to the domain Ω ⊂ Rn with C1 boundary. However, in addition we are obtaining another important result relating to the limitation of the maximum operators in the mixed norm on the general domain for the class of QNS functions. URI: http://hdl.handle.net/123456789/5378 Dateien zu dieser Ressource: 1
Jovanovic_Spasojevic_Tanja.pdf ( 1.643Mb ) -
Jovanović, Predrag (Belgrade , 2005)[more][less]
-
Dimovski, Igor (Novi Sad , 2011)[more][less]
Zusammenfassung: A comprehensive pedagogical research regarding teaching mathematics at a tertiary, university level has been presented in the PhD dissertation. The educational resources tailored in an electronic form using the programme package Matlab are integrated in the learning process. The impact of ICT use to the essential knowledge that refers to multivariate calculus (functions of several variables, vector-valued functions and the three-dimensional analytical geometry) has been statistically explored by intensive use of 3D static and dynamic visual tools. Part of the students who have participated in the research have developed Matlab programmes all by their own. One part of the research has been focused on probable impact of the programming skills on learning mathematical concepts. URI: http://hdl.handle.net/123456789/3874 Dateien zu dieser Ressource: 1
PhD_I_Dimovski.pdf ( 5.423Mb ) -
Pavlović, Mrina (Beograd , 2022)[more][less]
Zusammenfassung: The studyofgalaxiesthroughhighredshiftsarekeytounderstandingthe evolutionofgalaxiesthroughcosmictimes.Assuchobjectsareverydifficultto observedirectly,theyaremainlyexaminedusingempiricallyderivedtoolssuchas the numerouscorrelationsbetweentheirdifferentparametriccharacteristics,one of thembeingthelinearrelationshipbetweenfar-infraredandradioemissionin star-forming galaxies,namedtheFarInfrared-Radio(FIR)Correlation.Although the correlationwasconsideredtobestableintermsoflinearity,recentworks, whichincludegalaxiesathighredshifts(0 < z< 6), showedalargedeviation from thecorrelationinthesesystems.Thegoalofthisdoctoraldissertationis an examinationofthephysicalprocessesthatleadtothiskindofbehavior.As a possiblecauseofthisevolution,wewillassumeforthefirsttime,andexamine interactionsbetweengalaxies(collisionsandcloseapproaches).Interactionsbe- tweengalaxiesleadtotheformationofshockwavesonlargescalesthatcanlead to changesintherelationshipbetweeninfraredandradioemissions.Ourhypoth- esis wastestedinseveralstadiumsandthemainresultsareasfollows:1.We developedmodelsoftheevolutionoftheFIRcorrelationwithredshiftasfunctions of thegalaxyinteractionrate.Wetestedthemodelsonasampleofgalaxieswith an alreadydeterminedmorphologyseparatelyfordiscgalaxiesandforgalaxies that haverecentlybeenorarecurrentlyinteracting-irregulargalaxies. 2. Inasmallsampleof34galaxiesthatwetookfrompaperMiettinenetal.(2017), it wasshownthatthereisanindicationthattheinteractionbetweengalaxiescan beresponsiblefortheevolutionofthecorrelationwiththeredshift. 3. Thenextanalysiswasperformedonamuchlargersampleofstar-forming galaxies takenfromCOSMOSfield,wherewedidnotfindanyevolutionofcorre- lation withtheredshift.Also,itwasshownthatthemeanvalueofthecorrelation parameter islowerinirregulargalaxiesthanindiskgalaxies. Although recentobservationsindicatedanevolutionoftheFIRcorrelation with redshift,theresultsofthisresearchfailedtoreproducethatevolutionand showedthattheFIRcorrelationisstablewithredshift.However,itwasalso shownthatduetotheinteractionofgalaxies,theevolutionoftheFIRcorrelation is possibleiftherepresentationofinteractingsystemsinthesampleishigher. URI: http://hdl.handle.net/123456789/5795 Dateien zu dieser Ressource: 1
Disertacija_15613.pdf ( 8.624Mb ) -
Pavlović, Marina (Beograd , 2022)[more][less]
Zusammenfassung: The study of galaxies through high redshifts are key to understanding the evolution of galaxies through cosmic times. As such objects are very difficult to observe directly, they are mainly examined using empirically derived tools such as the numerous correlations between their different parametric characteristics, one of them being the linear relationship between far-infrared and radio emission in star-forming galaxies, named the Far Infrared-Radio (FIR) Correlation.Although the correlation was considered to be stable in terms of linearity, recent works, which include galaxies at high redshifts (0 < z < 6), showed a large deviation from the correlation in these systems. The goal of this doctoral dissertation is an examination of the physical processes that lead to this kind of behavior. As a possible cause of this evolution, we will assume for the first time, and examine interactions between galaxies (collisions and close approaches). Interactions be- tween galaxies lead to the formation of shock waves on large scales that can lead to changes in the relationship between infrared and radio emissions. Our hypoth- esis was tested in several stadiums and the main results are as follows: 1. We developed models of the evolution of the FIR correlation with redshift as functions of the galaxy interaction rate. We tested the models on a sample of galaxies with an already determined morphology separately for disc galaxies and for galaxies that have recently been or are currently interacting - irregular galaxies. 2. In a small sample of 34 galaxies that we took from paper Miettinen et al. (2017), it was shown that there is an indication that the interaction between galaxies can be responsible for the evolution of the correlation with the redshift. 3. The next analysis was performed on a much larger sample of star-forming galaxies taken from COSMOS field, where we did not find any evolution of corre- lation with the redshift. Also, it was shown that the mean value of the correlation parameter is lower in irregular galaxies than in disk galaxies. Although recent observations indicated an evolution of the FIR correlation with redshift, the results of this research failed to reproduce that evolution and showed that the FIR correlation is stable with redshift. However, it was also shown that due to the interaction of galaxies, the evolution of the FIR correlation is possible if the representation of interacting systems in the sample is higher. URI: http://hdl.handle.net/123456789/5460 Dateien zu dieser Ressource: 1
Disertacija_Marina_Pavlovic.pdf ( 8.624Mb ) -
Milanović-Lazarević, Smilja (Belgrade , 1987)[more][less]
URI: http://hdl.handle.net/123456789/248 Dateien zu dieser Ressource: 1
phdSmiljaMilanovicLazarevic.PDF ( 4.155Mb ) -
Dimitrijević, Milan (Belgrade)[more][less]
Zusammenfassung: A detailed analysis of the motion of a charged particle under the influence of Coulomb, polarization, and quadrupolar potential has been performed, and analytical expressions for particle path parameters have been obtained. Also, conditions for existence of a critical impact parameter, which separates paths ending in the atom from those going to infinity, have been examined, and methods for its determination have been elaborated. Results of this investigations have been applied to the theory of Stark broadening (broadening of spectral lines under the influence of collisions with charged particles), where a special attention has been paid to the adiabatic limit, and to quasistatic and impact approximations. Modification of Stark broadening functions has been performed and it has been demonstrated that the biggest influence of path curvature on them, is in the vicinity of the critical impact parameter, which separates paths ending in the atom from those going to infinity. The change in the values of the Stark broadening functions will have the largest influence on Stark broadening parameters for lines for which, at the most probable velocity, influence of the contribution of inelastic collisions is dominant and effective polarizability large. The application of semiempirical approximative approach for calculation of Stark broadening parameters for multiply charged emitters, has been analyzed as well, and the modification of semiclassical theory has been performed. The averaged ratio of experimental and theoretical results is 0.75 for semiempirical, 1.47 for semiclassical, and 1.04 for modified semiclassical approach.У раду је извршена детаљна анализа кретања наелектрисане честице под утицајем Кулоновог, поларизационог и квадруполног потенцијала и добијени су аналитички изрази за параметре путање честице. Такође су испитани услови за егзистенцију критичног сударног параметра, који раздваја путање које завршавају у атому од оних које одлазе у бесконачност, и разрађене методе за његово налажење. Резултати овог испитивања су примењени на теорију Штарковог ширења (ширења спектралних линија под утицајем судара са наелектрисаним честицама), при чему је посебна пажња посвећена адијабатској граници и квазистатичкој и сударној апроксимацији. Изведена је модификација функција Штарковог ширења и показано је да је највећи утицај закривљености путање на њих, у близини критичног сударног параметра, који раздваја путање које завршавају у атому од оних које одлазе у бесконачност. Промена у величини функција Штарковог ширења ће највише утицати на параметре Штарковог ширења код линија за које је, при највероватнијој брзини, утицај доприноса нееластичних судара доминантан а ефективна поларизабилност велика. Такође је анализирана примена семиемпиријског апроксимативног прилаза за израчунавање параметара Штарковог ширења за вишеструко наелектрисане емитере, при чему је извршена модификација семикласичне теорије. Усредњени однос експерименталних и теоријских резултата је 0.75 за семиемпиријски, 1.47 за семикласични а 1.04 за модификовани семикласични прилаз. URI: http://hdl.handle.net/123456789/77 Dateien zu dieser Ressource: 1
Dimitrijevic.pdf ( 6.262Mb )