Whose ETSIP? National and local ownership of Namibia's education and training sector improvement programme

Tämä työ tarkastelee kansallista ja paikallista omistajuutta Namibian opetussektorin kehittämisohjelmassa. Opetussektorin kehittämisohjelma ETSIP on 15-vuotinen sektoriohjelma vuosille 2005-2015 ja sen tavoitteena on edesauttaa Namibian kehittymistä tietoyhteiskunnaksi. Tutkimuksen tarkoituksena on selvittää miten kansallinen ja paikallinen omistajuus on toteutunut ETSIP prosessin aikana. Erityisesti pyritään selvittämään paikallistason opetussektorin virkamiesten näkemyksiä ETSIP prosessista, heidän roolistaan siinä ja siitä millaisia vaikuttamisen ja hallinnan mahdollisuuksia heillä on ollut prosessin aikana. Tutkimuksen lähtökohta on laadullinen ja lähestymistapa konstruktionistinen: tutkimus tarkastelee todellisuutta ihmisten kokemusten, näkemysten ja toiminnan kautta. Tutkimusaineisto koostuu haastatteluista, epävirallisista keskusteluista, lehtiartikkeleista ja ETSIP dokumenteista. Tutkimus osoittaa että kansallinen omistajuus on epämääräinen käsite sillä kansallisia toimijoita ja näkemyksiä on useita. Tutkimus vahvistaa Castel-Brancon huomion siitä, että omistajuutta on tarkasteltava kontekstissaan: muuttuvana ja kilpailtuna. ETSIPin rinnalle ollaan valmistelemassa uutta strategista ohjelmaa opetusministeriölle mikä saattaa muuttaa omistajuutta ETSIPiin. ETSIP dokumenttien omistajuusretoriikka myötäilee kansainvälisiä sitoumuksia avun vaikuttavuuden parantamiseksi mutta niistä puuttuu syvällisempi analyysi siitä, miten kansallinen ja paikallinen omistajuus toteutuisi käytännössä. Avunantajien näkemys omistajuudesta on suppea: omistajuus nähdään lähinnä sitoutumisena ennalta määrättyyn politiikkaohjelmaan. Haastatteluaineistosta nousee esiin Whitfieldin ja Frazerin jaottelu suppeista ja laajoista omistajuuskäsityksistä. Sitoutumista ETSIP ohjelmaan pidetään tärkeänä mutta riittämättömänä määritteenä omistajuudelle. Paikallisella tasolla sitoutuminen ETSIP ohjelman periaatteisiin ja tavoitteisiin on toteutunut melko hyvin mutta jos omistajuutta tarkastellaan laajemmin vaikutusvallan ja hallinnan käsitteiden kautta voidaan todeta että omistajuus on ollut heikkoa. Paikallisella tasolla ei ole ollut juurikaan vaikutusvaltaa ETSIP ohjelman sisältöön eikä mahdollisuutta hallita ohjelman toteutusta ja päättää siitä mitä hankkeita ohjelman kautta rahoitetaan. Tujanin demokraattisen omistajuuden käsite kuvaa tarvetta muuttaa ja laajentaa omistajuusajattelua huomioiden paikallisen tason paremmin. Tämä tutkimus viittaa siihen että omistajuuden toteutuminen paikallisella tasolla edellyttäisi institutionaalisen kulttuurin muutosta ja institutionaalisen legitimiteetin vahvistamista. Omistajuuden mahdollistamiseksi paikallisella tasolla tarvittaisiin poliittista johtajuutta, luottamusta, vastuullisuuden kulttuurin kehittämistä, tehokkaampaa tiedonjakoa, laajaa osallistumista, vuoropuhelua ja yhteistyötä. Ennen kaikkea tarvittaisiin paikallisen tason vaikutusvaltaa päätöksenteossa ja kontrollia resurssien käytöstä. Tälle muutokselle on selvä tarve ja tilaus.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

A simple local 3-approximation algorithm for vertex cover

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required. (c) 2009 Elsevier B.V. All rights reserved.

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

Optimal Use of Treatment Modalities and Treatment Results of Osteosarcoma and Soft Tissue Sarcomas

Soft tissue sarcomas are malignant tumours of mesenchymal origin. Because of infiltrative growth pattern, simple enucleation of the tumour causes a high rate of local recurrence. Instead, these tumours should be resected with a rim of normal tissue around the tumour. Data on the adequate margin width are scarce. At Helsinki University Central Hospital (HUCH) a multidisciplinary treatment group started in 1987. Surgical resection with a wide margin (2.5 cm) is the primary aim. In case of narrower margin radiation therapy is necessary. The role of adjuvant chemotherapy remains unclear. Our aims were to study local control by the surgical margin and to develop a new prognostic tool to aid decision-making on which patients should receive adjuvant chemotherapy. Patients with soft tissue sarcoma of the extremity or the trunk wall referred to HUCH during 1987-2002 form material in Studies I and II. External validation material comes from the Lund university sarcoma registry. The smallest surgical margin of at least 2.5 centimetres yielded local control of 89 per cent at five years. Amputation rate was 9 per cent. The proposed prognostic model with necrosis, vascular invasion, size on a continuous scale, depth, location and grade worked well both in Helsinki material and in the validation material, and it also showed good calibration. Based on the present study, we recommend the smallest surgical margin of 2-3 centimetres in soft tissue sarcoma irrespective of grade. Improvement in local control was present but modest in margins wider than 1 centimetre. In cases where gaining a wider margin would lead to a considerable loss of function, smaller margin is to be considered combined to radiation therapy. Patients treated with inadequate margins should be offered radiation therapy irrespective of tumour grade. Our new prognostic model to estimate 10-year survival probability in patients with soft tissue sarcoma of the extremities or trunk wall showed good dicscrimination and calibration. For time being the prognostic model is available for scientific use and further validations. In the future, the model may aid in clinical decision-making. For operable osteosarcoma, neoadjuvant multidrug chemotherapy followed by delayed surgery and multidrug adjuvant chemotherapy is the treatment of choice. Overall survival rates at five years are approximately 75 per cent in modern trials with classical osteosarcoma. All patients diagnosed and reported to the Finnish Cancer Registry with osteosarcoma in Finland during 1971-2005 form the material in Studies III and IV. Limb-salvage rate increased from 23 per cent to 78 per cent during 1971-2005. The 10-year sarcoma-specific survival for the whole study population improved from 32 per cent to 62 per cent. It was 75 per cent for patients with a local high-grade osteosarcoma of the extremity diagnosed during 1991-2005. This study outlines the improved prognosis of osteosarcoma patients in Finland with modern chemotherapy. The 10-year survival rates are good also in an international scale. Nonetheless, their limb-salvage rate remains inferior to those seen for highly selected patient series. Overall, the centralisation of osteosarcoma treatment would most likely improve both survival and limb-salvage rates even further.

Global, Local and Vector-Valued Tb Theorems on Non-Homogeneous Metric Spaces

Various Tb theorems play a key role in the modern harmonic analysis. They provide characterizations for the boundedness of Calderón-Zygmund type singular integral operators. The general philosophy is that to conclude the boundedness of an operator T on some function space, one needs only to test it on some suitable function b. The main object of this dissertation is to prove very general Tb theorems. The dissertation consists of four research articles and an introductory part. The framework is general with respect to the domain (a metric space), the measure (an upper doubling measure) and the range (a UMD Banach space). Moreover, the used testing conditions are weak. In the first article a (global) Tb theorem on non-homogeneous metric spaces is proved. One of the main technical components is the construction of a randomization procedure for the metric dyadic cubes. The difficulty lies in the fact that metric spaces do not, in general, have a translation group. Also, the measures considered are more general than in the existing literature. This generality is genuinely important for some applications, including the result of Volberg and Wick concerning the characterization of measures for which the analytic Besov-Sobolev space embeds continuously into the space of square integrable functions. In the second article a vector-valued extension of the main result of the first article is considered. This theorem is a new contribution to the vector-valued literature, since previously such general domains and measures were not allowed. The third article deals with local Tb theorems both in the homogeneous and non-homogeneous situations. A modified version of the general non-homogeneous proof technique of Nazarov, Treil and Volberg is extended to cover the case of upper doubling measures. This technique is also used in the homogeneous setting to prove local Tb theorems with weak testing conditions introduced by Auscher, Hofmann, Muscalu, Tao and Thiele. This gives a completely new and direct proof of such results utilizing the full force of non-homogeneous analysis. The final article has to do with sharp weighted theory for maximal truncations of Calderón-Zygmund operators. This includes a reduction to certain Sawyer-type testing conditions, which are in the spirit of Tb theorems and thus of the dissertation. The article extends the sharp bounds previously known only for untruncated operators, and also proves sharp weak type results, which are new even for untruncated operators. New techniques are introduced to overcome the difficulties introduced by the non-linearity of maximal truncations.

FGF signaling in neurogenesis and patterning of the developing midbrain and anterior hindbrain

Embryonic midbrain and hindbrain are structures which will give rise to brain stem and cerebellum in the adult vertebrates. Brain stem contains several nuclei which are essential for the regulation of movements and behavior. They include serotonin-producing neurons, which develop in the hindbrain, and dopamine-producing neurons in the ventral midbrain. Degeneration and malfunction of these neurons leads to various neurological disorders, including schizophrenia, depression, Alzheimer s, and Parkinson s disease. Thus, understanding their development is of high interest. During embryogenesis, a local signaling center called isthmic organizer regulates the development of midbrain and anterior hindbrain. It secretes peptides belonging to fibroblast growth factor (FGF) and Wingless/Int (Wnt) families. These factors bind to their receptors in the surrounding tissues, and activate various downstream signaling pathways which lead to alterations in gene expression. This in turn affects the various developmental processes in this region, such as proliferation, survival, patterning, and neuronal differentiation. In this study we have analyzed the role of FGFs in the development of midbrain and anterior hindbrain, by using mouse as a model organism. We show that FGF receptors cooperate to receive isthmic signals, and cell-autonomously promote cell survival, proliferation, and maintenance of neuronal progenitors. FGF signaling is required for the maintenance of Sox3 and Hes1 expression in progenitors, and Hes1 in turn suppresses the activity of proneural genes. Loss of Hes1 is correlated with increased cell cycle exit and premature neuronal differentiation. We further demonstrate that FGF8 protein forms an antero-posterior gradient in the basal lamina, and might enter the neuronal progenitors via their basal processes. We also analyze the impact of FGF signaling on the various neuronal nuclei in midbrain and hindbrain. Rostral serotonergic neurons appear to require high levels of FGF signaling in order to develop. In the absence of FGF signaling, these neurons are absent. We also show that embryonic meso-diencephalic dopaminergic domain consists of two populations in the anterior-posterior direction, and that these populations display different molecular profiles. The anterior diencephalic domain appears less dependent on isthmic FGFs, and lack several genes typical of midbrain dopaminergic neurons, such as Pitx3 and DAT. In Fgfr compound mutants, midbrain dopaminergic neurons begin to develop but soon adopt characteristics which highly resemble those of diencephalic dopaminergic precursors. Our results indicate that FGF signaling regulates patterning of these two domains cell-autonomously.