The Tourism-Development Nexus in Namibia : A Study on National Tourism Policy and Local Tourism Enterprises' Policy Knowledge

The tourism development nexus in southern Africa involves highly topical issues related to tourism planning, power relations, community participation, and natural resources. Namibia offers a particularly interesting context for the study of these issues due to its colonial legacy, vast tourism potential, recently adopted tourism policy and community-based approaches to tourism and natural resource management. This study is an interdisciplinary endeavour to analyse the role of tourism in Namibia s post-apartheid transformation process by focusing on Namibian tourism policy and local tourism enterprises' policy knowledge. Major attention is paid to how the tourism policy's national development objectives are understood and conceptualised by the representatives of different tourism enterprises and the ways in which they relate to the practical needs of the enterprises. Through such local policy knowledge the study explores various opportunities, challenges and constraints related to the promotion of tourism as a development strategy. The study utilises a political economy approach to tourism and development through three current and interrelated discourses which are relevant in the Namibian context. These are tourism, power and inequality, tourism and sustainable development, and tourism and poverty reduction. The qualitative research material was gathered in Namibia in 2006-2007 and 2008. This material consists of 34 semi-structured interviews in 16 tourism enterprises, including private trophy hunting farms and private lodges, small tour operators and community-based tourism enterprises. In addition, the research material consists of observations in the enterprises, and 37 informal and 23 expert interviews. The findings indicate that in the light of local tourism enterprises the tourism policy objectives appear more complex and ambiguous. Furthermore, they involve multiple meanings and interpretations which reflect the socio-economic stratification of the informants and Namibian society, together with the professional stratification of the tourism enterprises and restrictions on the capacity of tourism to address the development objectives. In the light of such findings it is obvious that aspects of power and inequality affect the tourism development nexus in Namibia. The study concludes that, as in the case of other southern African countries, in order to promote sustainable development and reduce poverty, Namibia should not only target tourism growth but pay attention to who benefits from that growth and how. From a political economy point of view, it is important that prevailing structural challenges are addressed equally in the planning of tourism, development and natural resource management. Such approach would help the Namibian majority to enjoy the benefits of increasing tourism in the country.

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.

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

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.

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.

Importance of meridional circulation i flux transport dynamo: the possibility of a maunder-like grand minimum

Meridional circulation is an important ingredient in flux transport dynamo models. We have studied its importance on the period, the amplitude of the solar cycle, and also in producing Maunder-like grand minima in these models. First, we model the periods of the last 23 sunspot cycles by varying the meridional circulation speed. If the dynamo is in a diffusion-dominated regime, then we find that most of the cycle amplitudes also get modeled up to some extent when we model the periods. Next, we propose that at the beginning of the Maunder minimum the amplitude of meridional circulation dropped to a low value and then after a few years it increased again. Several independent studies also favor this assumption. With this assumption, a diffusion-dominated dynamo is able to reproduce many important features of the Maunder minimum remarkably well. If the dynamo is in a diffusion-dominated regime, then a slower meridional circulation means that the poloidal field gets more time to diffuse during its transport through the convection zone, making the dynamo weaker. This consequence helps to model both the cycle amplitudes and the Maunder-like minima. We, however, fail to reproduce these results if the dynamo is in an advection-dominated regime.

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.

Local texture and microstructure in cube-oriented nickel single crystal deformed by equal channel angular extrusion

Local texture and microstructure was investigated to study the deformation mechanisms during equal channel angular extrusion of a high purity nickel single crystal of initial cube orientation. A detailed texture and microstructure analysis by various diffraction techniques revealed the complexity of the deformation patterns in different locations of the billet. A modeling approach, taking into account slip system activity, was used to interpret the development of this heterogeneous deformation.

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.

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csiszar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner bases method to compute an implicit representation of minimum KL-divergence models.

Local variability and base sequence effects in DNA crystal structures.

The importance and usefulness of local doublet parameters in understanding sequence dependent effects has been described for A- and B-DNA oligonucleotide crystal structures. Each of the two sets of local parameters described by us in the NUPARM algorithm, namely the local doublet parameters, calculated with reference to the mean z-axis, and the local helical parameters, calculated with reference to the local helix axis, is sufficient to describe the oligonucleotide structures, with the local helical parameters giving a slightly magnified picture of the variations in the structures. The values of local doublet parameters calculated by NUPARM algorithm are similar to those calculated by NEWHELIX90 program, only if the oligonucleotide fragment is not too distorted. The mean values obtained using all the available data for B-DNA crystals are not significantly different from those obtained when a limited data set is used, consisting only of structures with a data resolution of better than 2.4 A and without any bound drug molecule. Thus the variation observed in the oligonucleotide crystals appears to be independent of the quality of their crystallinity. No strong correlation is seen between any pair of local doublet parameters but the local helical parameters are interrelated by geometric relationships. An interesting feature that emerges from this analysis is that the local rise along the z-axis is highly correlated with the difference in the buckle values of the two basepairs in the doublet, as suggested earlier for the dodecamer structures (Bansal and Bhattacharyya, in Structure & Methods: DNA & RNA, Vol. 3 (Eds., R.H. Sarma and M.H. Sarma), pp. 139-153 (1990)). In fact the local rise values become almost constant for both A- and B-forms, if a correction is applied for the buckling of the basepairs. In B-DNA the AA, AT, TA and GA basepair sequences generally have a smaller local rise (3.25 A) compared to the other sequences (3.4 A) and this seems to be an intrinsic feature of basepair stacking interaction and not related to any other local doublet parameter. The roll angles in B-DNA oligonucleotides have small values (less than +/- 8 degrees), while mean local twist varies from 24 degrees to 45 degrees. The CA/TG doublet sequences show two types of preferred geometries, one with positive roll, small positive slide and reduced twist and another with negative roll, large positive slide and increased twist.(ABSTRACT TRUNCATED AT 400 WORDS)

Conformation of substituted polyacetylenes in solution : relationship between electronic properties and local order

A study of the chain conformation in solutions of polyphenylacetylene and poly(2-octyne) has been performed. The two polymers differ in many ways : polyphenylacetylene gives a red solution while poly(2-octyne) is transparent and, a marked difference on the chain rigidity is observed : the statistical length are 45 Å and 135 Å respectively. From the study of these two systems, one deduces that curvature fluctuations play a minor role on the π electrons localization, and that the torsion between monomer units is the pertinent parameter to understand the chain conformation and the π electrons localization.

A Theory of the Lifted Temperature Minimum on Calm Clear Nights

Numerous reports from several parts of the world have confirmed that on calm clear nights a minimum in air temperature can occur just above ground, at heights of the order of $\frac{1}{2}$ m or less. This phenomenon, first observed by Ramdas & Atmanathan (1932), carries the associated paradox of an apparently unstable layer that sustains itself for several hours, and has not so far been satisfactorily explained. We formulate here a theory that considers energy balance between radiation, conduction and free or forced convection in humid air, with surface temperature, humidity and wind incorporated into an appropriate mathematical model as parameters. A complete numerical solution of the coupled air-soil problem is used to validate an approach that specifies the surface temperature boundary condition through a cooling rate parameter. Utilizing a flux-emissivity scheme for computing radiative transfer, the model is numerically solved for various values of turbulent friction velocity. It is shown that a lifted minimum is predicted by the model for values of ground emissivity not too close to unity, and for sufficiently low surface cooling rates and eddy transport. Agreement with observation for reasonable values of the parameters is demonstrated. A heuristic argument is offered to show that radiation substantially increases the critical Rayleigh number for convection, thus circumventing or weakening Rayleigh-Benard instability. The model highlights the key role played by two parameters generally ignored in explanations of the phenomenon, namely surface emissivity and soil thermal conductivity, and shows that it is unnecessary to invoke the presence of such particulate constituents as haze to produce a lifted minimum.