The connection between on-farm assessed welfare (A-index) and production parameters of the sows

Tämän tutkimuksen tavoitteena oli selvittää tilalla määritetyn hyvinvoinnin yhteyttä emakoiden tuotantotuloksiin. Hyvinvointia arvioitiin suomalaisen hyvinvointi-indeksin, A-indeksi, avulla. Tuotantotuloksina käytettiin kahta erilaista tuotosaineistoa, jotka molemmat pohjautuivat kansalliseen tuotosseuranta aineistoon. Hyvinvointimääritykset tehtiin 30 porsastuotantosikalassa maaliskuun 2007 aikana. A-indeksi koostuu kuudesta kategoriasta ’liikkumismahdollisuudet’, ’alustan ominaisuudet’, ’sosiaaliset kontaktit’, ’valo, ilma ja melu’, ’ruokinta ja veden saanti’ sekä ’eläinten terveys ja hoidon taso’. Jokaisessa kategoriassa on 3-10 pääosin ympäristöperäistä muuttujaa, jotka vaihtelevat osastoittain. Maksimipistemäärä osastolle on 100. Hyvinvointimittaukset tehtiin porsitus-, tiineytys- ja joutilasosastoilla. Erillisten tiineytysosastojen pienen lukumäärän takia (n=7) tilakohtaiset tiineytys- ja joutilasosastopisteet yhdistettiin ja keskiarvoja käytettiin analyyseissä. Yhteyksiä tuotokseen tutkittiin kahden eri aineiston avulla 1) Tilaraportti aineisto (n=29) muodostuu muokkaamattomista tila- ja tuotostuloksista tilavierailua edeltävän vuoden ajalta, 2) POTSIaineisto (n=30) muodostuu POTSI-ohjelmalla (MTT) muokatusta tuotantoaineistosta, joka sisältää managementtiryhmän (tila, vuosi, vuodenaika) vaikutuksen ensikoiden ja emakoiden pahnuekohtaiseen tuotokseen. Yhteyksiä analysointiin korrelaatio- ja regressioanalyysien avulla. Vaikka osallistuminen tutkimukseen oli vapaaehtoista, molempien tuotantoaineistojen perusteella tutkimustilat edustavat keskituottoista suomalaista sikatilaa. A-indeksin kokonaispisteet vaihtelivat välillä 37,5–64,0 porsitusosastolla ja 39,5–83,5 joutilasosastolla. Tilaraporttiaineistoa käytettäessä paremmat pisteet porsitusosaston ’eläinten terveys ja hoidon taso’ -kategoriasta lyhensivät eläinten lisääntymissykliä, lisäsivät syntyvien pahnueiden ja porsaiden määrää sekä alensivat kuolleena syntyneiden lukumäärää. Regressiomallin mukaan ’eläinten terveys ja hoidon taso’ -kategoria selitti syntyvien porsaiden lukumäärän, porsimisvälin pituuden sekä keskiporsimiskerran vaihtelua. Paremmat pisteet joutilasosaston ’liikkumismahdollisuudet’ kategoriasta alensivat syntyneiden pahnueiden sekä syntyneiden että vieroitettujen porsaiden lukumäärää. Regressiomallin mukaan ensikkopahnueiden osuus ja ”liikkumismahdollisuudet” kategorian pisteet selittivät vieroitettujen porsaiden lukumäärän vaihtelua. POTSI-aineiston yhteydessä kuolleena syntyneiden porsaiden lukumäärän aleneminen oli ensikoilla yhteydessä parempiin porsitusosaston ’sosiaalisiin kontakteihin’ ja emakoilla puolestaan joutilasosaston parempiin ’eläinten terveys ja hoidon taso’ pisteisiin. Kahden eri tuotantoaineiston avulla saadut tulokset erosivat toisistaan. Seuraavissa tutkimuksissa onkin suositeltavampaa käyttää Tilaraporttiaineistoja, joissa tuotokset ilmoitetaan vuosikohtaisina. Tämän tutkimuksen perusteella hyvinvoinnilla ja tuotoksella on yhteyksiä, joilla on myös merkittävää taloudellista vaikutusta. Erityisesti hyvä eläinten hoito ja eläinten terveys lisäävät tuotettujen porsaiden määrää ja lyhentävät lisääntymiskiertoa. Erityishuomiota tulee kiinnittää vapaana olevien joutilaiden emakoiden sosiaaliseen stressiin ja rehunsaannin varmistamiseen kaikille yksilöille.

Electrocardiographic parameters of ventricular repolarization : modifiers and the prognostic value

Electric activity of the heart consists of repeated cardiomyocyte depolarizations and repolarizations. Abnormalities in repolarization predispose to ventricular arrhythmias. In body surface electrocardiogram, ventricular repolarization generates the T wave. Several electrocardiographic measures have been developed both for clinical and research purposes to detect repolarization abnormalities. The study aim was to investigate modifiers of ventricular repolarization with the focus on the relationship of the left ventricular mass, antihypertensive drugs, and common gene variants, to electrocardiographic repolarization parameters. The prognostic value of repolarization parameters was also assessed. The study subjects originated from a population of more than 200 middle-aged hypertensive men attending the GENRES hypertension study, and from an epidemiological survey, the Health 2000 Study, including more than 6000 participants. Ventricular repolarization was analysed from digital standard 12-lead resting electrocardiograms with two QT-interval based repolarization parameters (QT interval, T-wave peak to T-wave end interval) and with a set of four T-wave morphology parameters. The results showed that in hypertensive men, a linear change in repolarization parameters is present even in the normal range of left ventricular mass, and that even mild left ventricular hypertrophy is associated with potentially adverse electrocardiographic repolarization changes. In addition, treatments with losartan, bisoprolol, amlodipine, and hydrochlorothiazide have divergent short-term effects on repolarization parameters in hypertensive men. Analyses of the general population sample showed that single nucleotide polymorphisms in KCNH2, KCNE1, and NOS1AP genes are associated with changes in QT-interval based repolarization parameters but not consistently with T-wave morphology parameters. T-wave morphology parameters, but not QT interval or T-wave peak to T-wave end interval, provided independent prognostic information on mortality. The prognostic value was specifically related to cardiovascular mortality. The results indicate that, in hypertension, altered ventricular repolarization is already present in mild left ventricular mass increase, and that commonly used antihypertensive drugs may relatively rapidly and treatment-specifically modify electrocardiographic repolarization parameters. Common variants in cardiac ion channel genes and NOS1AP gene may also modify repolarization-related arrhythmia vulnerability. In the general population, T-wave morphology parameters may be useful in the risk assessment of cardiovascular mortality.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.