<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
<channel>
<title>Doctoral Dissertations</title>
<link>http://hdl.handle.net/123456789/4</link>
<description/>
<item>
<title>ANALIZA PRSTENA MODULA PRIDRUŽIVANJEM GRAFOVA</title>
<link>http://hdl.handle.net/123456789/5843</link>
<description>ANALIZA PRSTENA MODULA PRIDRUŽIVANJEM GRAFOVA

Pucanović, Zoran

This dissertation examines various properties of commutative rings and modules&#13;
using algebraic combinatorial methods. If the graph is properly associated to a ring&#13;
R or to an R-module M , then examination of its properties gives useful information&#13;
about the ring R or R-module M .&#13;
This thesis discusses the determination of the radius of the total graph of a&#13;
commutative ring R in the case when this graph is connected. Typical extensions&#13;
such as polynomial rings, formal power series, idealization of the R-module M and&#13;
relations between the total graph of the ring R and its extensions are also dealt&#13;
with.&#13;
The total graph of a module, a generalization of the total graph of a ring is&#13;
presented. Various properties are proved and some relations to the total graph of a&#13;
ring as well as to the zero-divisor graph are established.&#13;
To gain a better understanding of clean rings and their relatives, the clean graph&#13;
CΓ(R) of a commutative ring with identity is introduced and its various proper-&#13;
ties established. Further investigation of clean graphs leads to additional results&#13;
concerning other classes of commutative rings.&#13;
One of the topics of this thesis is the investigation of the properties of the cor-&#13;
responding line graph L(TΓ(R)) of the total graph TΓ(R). The classification of&#13;
all commutative rings whose line graphs of the total graph are planar or toroidal&#13;
is given. It is shown that for every integer g ≥ 0 there are only finitely many&#13;
commutative rings such that γ(L(TΓ(R))) = g.&#13;
Also, in this thesis all toroidal graphs which are intersection graphs of ideals&#13;
of a commutative ring R are classified. An improvement over the previous results&#13;
concerning the planarity of these graphs is presented.

</description>
<pubDate>Sun, 01 Jan 2012 00:00:00 GMT</pubDate>
</item>
<item>
<title>MOGUĆNOSTI I OPTIMIZACIJA SLETANJA NA JUŽNU HEMISFERU MARSA</title>
<link>http://hdl.handle.net/123456789/5842</link>
<description>MOGUĆNOSTI I OPTIMIZACIJA SLETANJA NA JUŽNU HEMISFERU MARSA

Marčeta, Dušan

Almost 40 years after the rst successful landing on Mars, exploration of its surface&#13;
still presents enormous scienti c and technological challenge. This particularly holds&#13;
for the Mars southern highlands, which cover large part of the southern hemisphere&#13;
where no successful landings have been achieved up to date. On the other hand, in&#13;
the northern lowlands, which spans most of the northern hemisphere, there has been&#13;
7 successful landings. This difference is consequence of the speci c topography of the&#13;
Martian surface due to so-called global or hemispheric dichotomy, which is a unique&#13;
characteristic in the Solar system. Due to the difference in the surface elevations, the&#13;
vehicle trying to land on the southern highlands has thinner layer of the atmosphere&#13;
that can use for the dissipation of its kinetic energy. Since the vehicles from the&#13;
interplanetary trajectories enter the Martian atmosphere with hyperbolic velocities,&#13;
their kinetic energy is extremely large and possibility for its dissipation through&#13;
the interaction with the atmosphere has crucial importance for the landing on the&#13;
locations with high elevations.&#13;
Beside the differences in topography between northern lowlands and southern&#13;
highlands, there is also a big difference in the number of impact craters between these&#13;
two regions. This fact indicates that the southern highlands are several billion years&#13;
older than the northern lowlands, which were exposed to strong volcanic activity in&#13;
the relatively recent past. Such huge difference in age is strong motivation to explore&#13;
the entire surface of Mars in order to understand its complex geological evolution. In&#13;
addition, large number of open basins discovered in the southern highlands suggests&#13;
that these regions could contain liquid water in the past, which is one of the most&#13;
important reasons for exploring these sites.&#13;
The main objective of this dissertation is to determine whether it is possible to&#13;
land on the southern highlands, without advancing the technology which was used&#13;
for the previous landings on Mars. Since the atmosphere of Mars is extremely dy-&#13;
namic due to high sensitivity to insolation, the parameters in uencing the process&#13;
of landing, especially density and temperature, have extremely large variations on&#13;
the daily and annual scale. In that sense, it is necessary to accurately model the&#13;
in uence of the most important parameters, such as the orbital position of Mars and&#13;
local true solar time, in order to determine the optimal conditions for landing. For&#13;
this purpose, a numerical algorithm for determination of the trajectory of a vehicle&#13;
with arbitrary aerodynamic characteristics, moving through the atmosphere with ar-&#13;
bitrary vertical and horizontal pro les, under the in uence of arbitrary gravitational&#13;
eld, has been developed. Using this algorithm, large number of atmospheric tra-&#13;
jectories was simulated which enabled determination of the possibilities and optimal&#13;
conditions for landing on the southern highlands.

</description>
<pubDate>Thu, 01 Jan 2015 00:00:00 GMT</pubDate>
</item>
<item>
<title>UNAPREÐENJE HIBRIDIZACIJOM METAHEURISTIKA INTELIGENCIJE ROJEVA ZA REŠAVANJE PROBLEMA GLOBALNE OPTIMIZACIJE</title>
<link>http://hdl.handle.net/123456789/5841</link>
<description>UNAPREÐENJE HIBRIDIZACIJOM METAHEURISTIKA INTELIGENCIJE ROJEVA ZA REŠAVANJE PROBLEMA GLOBALNE OPTIMIZACIJE

Bačanin Džakula, Nebojša

Hard optimization problems that cannot be solved within acceptable computational&#13;
time by deterministic mathematical methods have been successfully solved in recent&#13;
years by population-based stochastic metaheuristics, among which swarm intelli-&#13;
gence algorithms represent a prominent class. This thesis investigates improvements&#13;
of the swarm intelligence metaheuristics by hybridization. During analysis of the&#13;
existing swarm intelligence metaheuristics in some cases de ciencies and weaknesses&#13;
in the solution space search mechanisms were observed, primarily as a consequence&#13;
of the mathematical model that simulates natural process as well as inappropriate&#13;
balance between intensi cation and diversi cation.&#13;
The thesis examines whether existing swarm intelligence algorithms for global op-&#13;
timization could be improved (in the sense of obtaining better results, faster con-&#13;
vergence, better robustness) by hybridization with other algorithms. A number&#13;
of hybridized swarm intelligence metaheuristics were developed and implemented.&#13;
Considering the fact that good hybrids are not created as a  random  combination of&#13;
individual functional elements and procedures from di erent algorithms, but rather&#13;
established on comprehensive analysis of the functional principles of the algorithms&#13;
that are used in the process of hybridization, development of the hybrid approaches&#13;
was preceded by thorough research of advantages and disadvantages of each involved&#13;
algorithm in order to determine the best combination that neutralizes disadvantages&#13;
of one approach by incorporating the strengths of the other.&#13;
Developed hybrid approaches were veri ed by testing on standard benchmark sets for&#13;
global optimization, with and without constraints, as well as on well-known practical&#13;
problems. Comparative analysis with the state-of-the-art algorithms from the lite-&#13;
rature demonstrated quality of the developed hybrids and con rmed the hypothesis&#13;
that swarm intelligence algorithms can be successfully improved by hybridization.&#13;
Keywords: swarm intelligence metaheuristics, hybrid algorithms, global optimiza-&#13;
tion.

</description>
<pubDate>Thu, 01 Jan 2015 00:00:00 GMT</pubDate>
</item>
<item>
<title>OCJENE NORME INTEGRALNIH OPERATORA NA PROSTORIMA BESOVA I BLOHA</title>
<link>http://hdl.handle.net/123456789/5840</link>
<description>OCJENE NORME INTEGRALNIH OPERATORA NA PROSTORIMA BESOVA I BLOHA

Vujadinović, Đorđije

In this work we investigate the various norms of known integral operators such&#13;
as Bergman projection and certain integral operators induced with Green function.&#13;
We have observed acting of the Bergman projection on the weighted Lebesgue spaces&#13;
with image in spaces of analytic functions, Bloch and Besov spaces. We obtained&#13;
the estimate for the norm of the Bergman projection onto the Besov spaces, when&#13;
1 &lt; p &lt; ∞, and this estimate is asimptoticaly sharp for p → +∞. We have found&#13;
norm for the special Hilbert case p = 2. We have also considered some weak type&#13;
inequalities for the norm of the Bergman projection onto Besov space B1 .We ob-&#13;
served the adjoint operator for the Bergman projection fot the mentioned case B1.&#13;
Precisely, in this case we obtained two-sided bounds of norm for the adjoint oper-&#13;
ator. It was represented a method for determinig the norm of the Bergman type&#13;
projection defined in weighted Lebesgue spaces and with image in Bloch space in&#13;
the unit ball B in Cn.&#13;
Specially, we have considered the norm of the integral operator induced with Green&#13;
function in a context of the weak solutions for the Poisson’s equation with ho-&#13;
mogenuous condition in the unit ball in higher dimensions. The norm for the men-&#13;
tioned operator was determined for the Hilbert case and when operator is defined on&#13;
L∞−spaces (and also L1−case, which is dual).Final results are related to estimating&#13;
the norm of gradient for the weak solutions of Poisson’s equation.

</description>
<pubDate>Wed, 01 Jan 2014 00:00:00 GMT</pubDate>
</item>
</channel>
</rss>
