Preliminary phonological analysis of the Limi dialect of Humla Bhotia

The purpose of this research was to analyse the phonological system of the Limi dialect of Humla Bhotia. Humla Bhotia is a Tibeto-Burman language that is spoken by approximately 4000 5000 people in the far northwestern Humla province of the Kingdom of Nepal. The language has not previously been the subject of analysis. The data base for this thesis was collected on two different dialects of Humla Bhotia in Kathmandu, the capital of Nepal, from February to May 2000. I had three language informants who speak Humla Bhotia as their mother tongue. One of the informants speaks the Upper Humla dialect and the other two informants speak the Limi dialect. In this thesis I have concentrated on the phonology of the dialect of Limi but occasionally I also make reference to the Upper Humla dialect. The Limi data base consists of 600 words elicited in isolation, sentences where words have been checked for consonantal and pitch variation, and five texts comprising 117 sentences. Firstly, I have studied the geographical location, population and dialects of Humla Bhotia. Five dialects were identified: Limi, Upper Humla, La Yakba, Nyinba and Humli Khyampa. Information on the dialect areas is based on the accounts of seven mother tongue speakers of the language and on Nancy Levine s (1988) anthropological research of the ethnic group Nyinba. Secondly, I have analysed the phonological system of Limi from the viewpoint of American stucturalism much along the lines followed by Pike 1966 [1947] ja 1967 [1948]. In defining the prosodic elements I have also used acoustic analysis. In the Limi dialect there are 7 vowel phonemes. No vowel clusters occur within the same syllable. In this preliminary analysis 29 contrastive plosives, 8 affricates and 5 6 fricatives were found. The data also revealed 4 nasal phonemes, two rhotic phonemes, one lateral phoneme and two central approximants. Further research is however called for to check the phonemic status of these segments. Four contrastive prosodic elements were encountered: nasalisation, length, phonation type and pitch movement. There are two contrastive types of phonation: tense and lax. Many words were found with a third type of phonation, modal phonation. How modal phonation relates to the prosodic system is unclear at this stage and is therefore left for further research to determine. There are two contrastive pitch movement tonemes: a rising toneme and falling toneme. The falling toneme occurs in free variation with a level pitch contour. Rising appears to be linked with lax phonation and falling with tense phonation.

Categorical Meteorological Products: Evaluation and Analysis

In meteorology, observations and forecasts of a wide range of phenomena for example, snow, clouds, hail, fog, and tornados can be categorical, that is, they can only have discrete values (e.g., "snow" and "no snow"). Concentrating on satellite-based snow and cloud analyses, this thesis explores methods that have been developed for evaluation of categorical products and analyses. Different algorithms for satellite products generate different results; sometimes the differences are subtle, sometimes all too visible. In addition to differences between algorithms, the satellite products are influenced by physical processes and conditions, such as diurnal and seasonal variation in solar radiation, topography, and land use. The analysis of satellite-based snow cover analyses from NOAA, NASA, and EUMETSAT, and snow analyses for numerical weather prediction models from FMI and ECMWF was complicated by the fact that we did not have the true knowledge of snow extent, and we were forced simply to measure the agreement between different products. The Sammon mapping, a multidimensional scaling method, was then used to visualize the differences between different products. The trustworthiness of the results for cloud analyses [EUMETSAT Meteorological Products Extraction Facility cloud mask (MPEF), together with the Nowcasting Satellite Application Facility (SAFNWC) cloud masks provided by Météo-France (SAFNWC/MSG) and the Swedish Meteorological and Hydrological Institute (SAFNWC/PPS)] compared with ceilometers of the Helsinki Testbed was estimated by constructing confidence intervals (CIs). Bootstrapping, a statistical resampling method, was used to construct CIs, especially in the presence of spatial and temporal correlation. The reference data for validation are constantly in short supply. In general, the needs of a particular project drive the requirements for evaluation, for example, for the accuracy and the timeliness of the particular data and methods. In this vein, we discuss tentatively how data provided by general public, e.g., photos shared on the Internet photo-sharing service Flickr, can be used as a new source for validation. Results show that they are of reasonable quality and their use for case studies can be warmly recommended. Last, the use of cluster analysis on meteorological in-situ measurements was explored. The Autoclass algorithm was used to construct compact representations of synoptic conditions of fog at Finnish airports.

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.