Data sorting

Ovaj rad prikazuje jedno od rješenja problema sortiranja podataka u jednodimenzionalnom polju (nizu) elemenata. U praksi se često pojavljuje potreba za sortiranjem podataka te se zbog toga traži što efikasniji i brži algoritam. U ovom radu detaljno je prikazan jedan od najboljih - merge-sort algoritam. Napravljene su i praktične izvedbe algoritama za sortiranje koje su testirane na različitim skupovima podataka.In this paper one solution of the problem of sorting an one-dimensional vector (array) of data is shown in this paper. A need for data sorting very often arises in the practice and therefore we are constantly searching for more efficient and faster sorting algorithms. One of the best sorting algorithms -merge-sort is shown in this paper in detail. We made two of sorting algorithms and tested them on different types of data

Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters, the matrix is positive definite (or positive semidefinite). We state a characterization in the form of equivalent conditions, and also propose some computationally cheap sufficient\,/\,necessary conditions. Our results extend the classical results on positive (semi-)definiteness of interval matrices. They may be useful for checking convexity or non-convexity in global optimization methods based on branch and bound framework and using interval techniques

Improved FPT algorithms for weighted independent set in bull-free graphs

Very recently, Thomass\'e, Trotignon and Vuskovic [WG 2014] have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution, running in time $2^{O(k^5)} \cdot n^9$. In this article we improve this running time to $2^{O(k^2)} \cdot n^7$. As a byproduct, we also improve the previous Turing-kernel for this problem from $O(k^5)$ to $O(k^2)$. Furthermore, for the subclass of bull-free graphs without holes of length at most $2p-1$ for $p \geq 3$, we speed up the running time to $2^{O(k \cdot k^{\frac{1}{p-1}})} \cdot n^7$. As $p$ grows, this running time is asymptotically tight in terms of $k$, since we prove that for each integer $p \geq 3$, Weighted Independent Set cannot be solved in time $2^{o(k)} \cdot n^{O(1)}$ in the class of $\{bull,C_4,\ldots,C_{2p-1}\}$-free graphs unless the ETH fails.Comment: 15 page

Antibiotikaeinsatz in der Bayerischen Schweinehaltungspraxis ABYS: Antibiotikaeinsatz und Antibiotikaresistenz in ökologischen Betrieben

Between 2012 and 2014, ABYS study recorded antibiotic use, detection and resistance data for 23 organic and 35 conventional pig farms. Antibiotic contents of farm-made fertilizers were assessed by LC/MS-MS. Phenotypic antimicrobial resistance was investigated in Escherichia (E.) coli (indicator bacteria); antimicrobial resistance genes of the total bacterial microbiota (sul(II), tet(A), tet(B), tet(M); marker Measured in nUDD (number of animals treated multiplied by treatment days), colistin was the most frequently used antibiotic, in organic farms followed by tylosin, doxycycline and amoxicillin. Antibiotic residues were rarely detected; however, manure contained up to 10^8 antimicrobial resistance genes per gram; concentrations were higher when the antibiotic had been used on farm. In six farms, antimicrobial resistant E. coli were tracked from the moment when pigs were placed on farm. Some isolates carried a broad variety of resistances from the very beginning that were maintained until slaughter, despite the fact that partly no antibiotics were applied during fattening. Approaches for reducing carry-over of antimicrobial resistant bacteria will be discusse