<?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>Mathematical Sciences</title>
<link>http://hdl.handle.net/123456789/1</link>
<description/>
<item>
<title>UTICAJ INTERAKCIJA UDALJENIH GALAKSIJA NA NJIHOVO NETERMALNO RADIO ZRAČENJE</title>
<link>http://hdl.handle.net/123456789/5795</link>
<description>UTICAJ INTERAKCIJA UDALJENIH GALAKSIJA NA NJIHOVO NETERMALNO RADIO ZRAČENJE

Pavlović, Mrina

The studyofgalaxiesthroughhighredshiftsarekeytounderstandingthe&#13;
evolutionofgalaxiesthroughcosmictimes.Assuchobjectsareverydifficultto&#13;
observedirectly,theyaremainlyexaminedusingempiricallyderivedtoolssuchas&#13;
the numerouscorrelationsbetweentheirdifferentparametriccharacteristics,one&#13;
of thembeingthelinearrelationshipbetweenfar-infraredandradioemissionin&#13;
star-forming galaxies,namedtheFarInfrared-Radio(FIR)Correlation.Although&#13;
the correlationwasconsideredtobestableintermsoflinearity,recentworks,&#13;
whichincludegalaxiesathighredshifts(0 &lt; z&lt; 6), showedalargedeviation&#13;
from thecorrelationinthesesystems.Thegoalofthisdoctoraldissertationis&#13;
an examinationofthephysicalprocessesthatleadtothiskindofbehavior.As&#13;
a possiblecauseofthisevolution,wewillassumeforthefirsttime,andexamine&#13;
interactionsbetweengalaxies(collisionsandcloseapproaches).Interactionsbe-&#13;
tweengalaxiesleadtotheformationofshockwavesonlargescalesthatcanlead&#13;
to changesintherelationshipbetweeninfraredandradioemissions.Ourhypoth-&#13;
esis wastestedinseveralstadiumsandthemainresultsareasfollows:1.We&#13;
developedmodelsoftheevolutionoftheFIRcorrelationwithredshiftasfunctions&#13;
of thegalaxyinteractionrate.Wetestedthemodelsonasampleofgalaxieswith&#13;
an alreadydeterminedmorphologyseparatelyfordiscgalaxiesandforgalaxies&#13;
that haverecentlybeenorarecurrentlyinteracting-irregulargalaxies.&#13;
2. Inasmallsampleof34galaxiesthatwetookfrompaperMiettinenetal.(2017),&#13;
it wasshownthatthereisanindicationthattheinteractionbetweengalaxiescan&#13;
beresponsiblefortheevolutionofthecorrelationwiththeredshift.&#13;
3. Thenextanalysiswasperformedonamuchlargersampleofstar-forming&#13;
galaxies takenfromCOSMOSfield,wherewedidnotfindanyevolutionofcorre-&#13;
lation withtheredshift.Also,itwasshownthatthemeanvalueofthecorrelation&#13;
parameter islowerinirregulargalaxiesthanindiskgalaxies.&#13;
Although recentobservationsindicatedanevolutionoftheFIRcorrelation&#13;
with redshift,theresultsofthisresearchfailedtoreproducethatevolutionand&#13;
showedthattheFIRcorrelationisstablewithredshift.However,itwasalso&#13;
shownthatduetotheinteractionofgalaxies,theevolutionoftheFIRcorrelation&#13;
is possibleiftherepresentationofinteractingsystemsinthesampleishigher.

</description>
<pubDate>Sat, 01 Jan 2022 00:00:00 GMT</pubDate>
</item>
<item>
<title>SEMANTIC UNIFICATION AND SEARCHING OF BIOINFORMATICS DATABASES USING DATA MINING METHODS</title>
<link>http://hdl.handle.net/123456789/5794</link>
<description>SEMANTIC UNIFICATION AND SEARCHING OF BIOINFORMATICS DATABASES USING DATA MINING METHODS

Veljković, Aleksandar

Bioinformatics as a science of the future faces the problems of processing&#13;
a large amount of data that is increasing every day. In addition to the problem&#13;
of data storage, the challenge is also data analysis and the understanding of hidden&#13;
relations between biological entities that are observed only after unifying data&#13;
from different data sources. This thesis proposes a novel data model for the unification&#13;
of heterogeneous data from multiple bioinformatics databases and a system&#13;
architecture design for implementing software systems based on the proposed data&#13;
model. Additionally, the thesis defines an automated pipeline for discovering new&#13;
semantic similarity relations based on data mining methods using the data found&#13;
in the proposed data model. The data model, software architecture, and automatic&#13;
pipeline are evaluated using data from five real-world bioinformatics databases. The&#13;
results demonstrate a high flexibility of the data model and the high efficiency of&#13;
the software system implemented following the proposed architecture design.

</description>
<pubDate>Sun, 01 Jan 2023 00:00:00 GMT</pubDate>
</item>
<item>
<title>IN- SITU DUST DETECTION USING RADIO ANTENNAS OF DIFFERENT SPACECRAFT - SPACE OBSERVATIONS AND MODELING</title>
<link>http://hdl.handle.net/123456789/5793</link>
<description>IN- SITU DUST DETECTION USING RADIO ANTENNAS OF DIFFERENT SPACECRAFT - SPACE OBSERVATIONS AND MODELING

Racković Babić, Kristina

Interplanetary dust grains contain important information about the&#13;
Solar System. Analyzing these particles is an important aspect of the&#13;
heliosphere study. Dust impacts have been observed using radio and&#13;
wave instruments onboard the spacecraft since the 1980s. The interaction&#13;
between the impact-generated plasma cloud and antenna – spacecraft&#13;
system elements generates the characteristic signal waveform.&#13;
The present work focuses on the detection and interpretation of the&#13;
dust generated signals from radio instruments onboard various spacecraft&#13;
orbiting at 1 AU.&#13;
In the first part of the thesis, we aim to develop a model which links&#13;
the observed electric signals to the dust impact properties.We propose&#13;
a new model which takes into account the effect of impact - ionization&#13;
- charge collection and electrostatic-influence. Our model provides an&#13;
analytical expression for the pulse. It allows us to measure the amount&#13;
of total ion charge, the fraction of escaping charge, the rise timescale,&#13;
and the relaxation timescale. The proposed model is simple and convenient&#13;
for large data fitting. To validate the model, we use the Time Domain&#13;
Sampler (TDS) subsystem of the STEREO/WAVES instrument,&#13;
which generates high-cadence time series of voltage pulses for each&#13;
monopole. Since the beginning of the STEREO mission in 2007, we&#13;
have collected all the dust events detected by S/WAVES/TDS simultaneously&#13;
on all three monopoles at 1 AU. Our study confirms that&#13;
the rise time vastly exceeds the spacecraft’s short timescale of electron&#13;
collection by the spacecraft. Aside from electron dynamics, we&#13;
also obtained interesting results regarding the cloud’s electron temperature.&#13;
The presented model provides an effective tool for analyzing&#13;
vii&#13;
dust waveforms, and is applicable for different space missions which&#13;
investigate the distribution of dust particles, e.g., Solar Orbiter and&#13;
Parker Solar Probe.&#13;
In the second part of the thesis, we focus on the interstellar dust&#13;
(ISD). Interplanetary and interstellar dust are the two main dust populations&#13;
at 1 AU. Our objective is to search for interstellar dust by&#13;
analyzing the data sets collected by STEREO and Wind, starting from&#13;
the beginning of the missions. Between 2007 and 2012, while being at&#13;
the solar minimum with a solar dipole pointing southward, all three&#13;
spacecraft recorded ISD flux at 1 AU. However, before and after that&#13;
period, the disappearance of the interstellar component was noticeable.&#13;
The observed change of the impact rate suggests that the flux of interstellar&#13;
dust at 1 AU varies with the solar cycle. Each time the magnetic&#13;
dipole field changes its polarity during the solar cycle, small interstellar&#13;
grains experience focusing or defocusing. Consequently, the dust&#13;
grains are systematically deflected either towards, or away from the&#13;
solar magnetic equator plane by the solar wind magnetic field which&#13;
thus affects the dust dynamics and the total interstellar dust flux in&#13;
the inner heliosphere. Our study provides the first quantitative description&#13;
of the time variation of ISD flux at 1 AU.

</description>
<pubDate>Sat, 01 Jan 2022 00:00:00 GMT</pubDate>
</item>
<item>
<title>PREBROJAVANJE KLASA EKVIVALENCIJE BULOVIH FUNKCIJA</title>
<link>http://hdl.handle.net/123456789/5792</link>
<description>PREBROJAVANJE KLASA EKVIVALENCIJE BULOVIH FUNKCIJA

Carić, Marko

In this dissertation, the problem of calculating the number of equiva-&#13;
lence classes of Boolean functions is discussed. The difficulty of determining the&#13;
number of equivalence classes increases sharply with the number of variables n.&#13;
The motivation for choosing this topic lies in the fact that concrete numbers have&#13;
been known so far only for relatively small values of n, although the problem itself&#13;
was theoretically solved a long time ago.&#13;
Let G be the group of permutations of the set Bn = {0, 1}n. The effect of&#13;
the group G on scalar, Bn 7 → B1, that is, vectorial invertible Boolean functions,&#13;
Bn 7 → Bn. Two scalar Boolean functions f (x) and g(x), defined on Bn, are&#13;
considered equivalent with respect to the group G, i.e. f ∼ g, if for some σ ∈ G&#13;
for every x ∈ Bn f (x) = g(σ(x)) holds. Two vector invertible Boolean functions&#13;
f (x) and g(x), are considered equivalent with respect to the group G, i.e. f ∼ g,&#13;
if for some pair (σ, ρ) ∈ G × G for each x ∈ Bn holds g(x) = ρ(f (σ(x))). The&#13;
equivalence relation ∼ decomposes the set of all Boolean functions into equivalence&#13;
classes. Equivalence of Boolean functions has significant applications in the logical&#13;
synthesis of combinatorial circuits and in cryptography, especially in connection&#13;
with the design of S-boxes.&#13;
Let Un(G) and Vn(G) denote number of equivalence classes of scalar, i.e. vector&#13;
invertible Boolean functions of n variables in relation to the group G. The numbers&#13;
Un(G) and Vn(G) can be calculated relatively simply if the cycle index of the group&#13;
G is known. The dissertation considers four groups G of permutations of the set&#13;
Bn:&#13;
• group S′&#13;
n induced by group Sn permutations of coordinates elements x =&#13;
(x1, x2, . . . , xn) ∈ Bn,&#13;
• group Gn, induced by permutations and complementations of coordinates,&#13;
• group of GLn linear invertible transformations elements of the vector space&#13;
Bn, i&#13;
• group of AGLn affine invertible transformations elements Bn.&#13;
If the permutation σ ∈ G has ik cycles of length k ⩾ 1, its cycle structure is&#13;
i(σ) = (i1, i2, . . .). The cyclic index of the group G is the generatrix&#13;
ZG(f1, f2, . . .) = 1&#13;
|G|&#13;
X&#13;
σ∈G&#13;
Y&#13;
k⩾1&#13;
f ik&#13;
k&#13;
of cycle structures of all permutations σ ∈ G. General expressions for cycle indices&#13;
the four considered groups are known, but the cycle indices themselves, i.e. the&#13;
numbers Un(G) and Vn(G), are practically calculated only for relatively small&#13;
values, for e.g. n ⩽ 10.&#13;
The dissertation presents original results in the field of enumeration of equiv-&#13;
alence classes of Boolean functions in relation to these four groups of transfor-&#13;
mations. A similar expression was derived for all four groups of transformations&#13;
for the cycle index in the form of sum over partitions of the number n. Based&#13;
on that expression and previously calculated tables, the cycle index is calculated&#13;
much more efficiently. An overview of known results for relatively small n and&#13;
new results in the thesis for larger n is shown in the following table:&#13;
Number\ G S′&#13;
n Gn GLn AGLn&#13;
Un(G) 11 → 33 10 → 32 8 → 31 10 → 31&#13;
Vn(G) 6 → 30 7 → 27 6 → 26 6 → 26&#13;
Specially, in the case of the permutation group S′&#13;
n, an effective direct procedure&#13;
for calculating the number of equivalence classes that does not use a cycle index&#13;
is shown, and is described in the third paper from the introductory chapter.&#13;
The second part of the dissertation concerns monotone Boolean functions —&#13;
scalar Boolean functions which satisfy the monotonicity condition (from x ⩽ y&#13;
follows f (x) ⩽ f (y)). Let rn, i.e. dn (the n-th Dedekind number), denote the&#13;
number of equivalence classes of monotone Boolean functions in relation to the&#13;
group S′&#13;
n, that is, the total number of monotone Boolean functions of n variables.&#13;
The difficulty of calculating the number rn increases rapidly with n, so that&#13;
until recently the last calculated member of the sequence was r7. The procedure&#13;
described in the dissertation is based on the Frobenius theorem, by which it was&#13;
determined number r8. In doing so, the known value of the number d8 is used.&#13;
The dissertation consists of the first - introductory chapter and the following&#13;
three chapters. In the second chapter, theoretical terms related to the material&#13;
from chapters 3 and 4 are introduced, and they refer to discrete mathematics,&#13;
combinatorics and cycle indices of the considered four groups of transformations.&#13;
Chapter 3 describes the procedure for calculating the cycle indices for the&#13;
four considered groups of permutations, as well as numbers Un(G) and Vn(G)&#13;
equivalence classes of Boolean functions in relation to these groups. First, common&#13;
improvements for all four groups are considered, and then specific accelerations&#13;
related to individual groups. These results are published in the second paper&#13;
listed in the introductory chapter.&#13;
In chapter 4, the problem of finding the number of equivalence classes of&#13;
monotone Boolean functions is solved. First, a general expression for calculating&#13;
the number rn is given based on the Frobenius theorem in the form of the sum&#13;
(by partitions of the number n) of the number of fixed points of the permutation&#13;
corresponding to the partition. After that, depending on the graphs corresponding&#13;
to different partitions, different ways of calculating the number of fixed points for&#13;
n ⩽ 8 are shown. The procedure based on which the number r8 was calculated,&#13;
which also represents the original contribution of this dissertation is presented -&#13;
see the first paper from the list from the introductory chapter. Applying a similar&#13;
procedure, Pawelski [31] calculated r8 practically at the same time as the obtained&#13;
result described in the dissertation.

</description>
<pubDate>Sun, 01 Jan 2023 00:00:00 GMT</pubDate>
</item>
</channel>
</rss>
