A sequential analysis of "nú" and "núna" in Icelandic conversation

This thesis is an empirical study of how two words in Icelandic, "nú" and "núna", are used in contemporary Icelandic conversation. My aims in this study are, first, to explain the differences between the temporal functions of "nú" and "núna", and, second, to describe the non-temporal functions of "nú". In the analysis, a focus is placed on comparing the sequential placement of the two words, on their syntactical distribution, and on their prosodic realization. The empirical data comprise 14 hours and 11 minutes of naturally occurring conversation recorded between 1996 and 2003. The selected conversations represent a wide range of interactional contexts including informal dinner parties, institutional and non-institutional telephone conversations, radio programs for teenagers, phone-in programs, and, finally, a political debate on television. The theoretical and methodological framework is interactional linguistics, which can be described as linguistically oriented conversation analysis (CA). A comparison of "nú" and "núna" shows that the two words have different syntactic distributions. "Nú" has a clear tendency to occur in the front field, before the finite verb, while "núna" typically occurs in the end field, after the object. It is argued that this syntactic difference reflects a functional difference between "nú" and "núna". A sequential analysis of "núna" shows that the word refers to an unspecified period of time which includes the utterance time as well as some time in the past and in the future. This temporal relation is referred to as reference time. "Nú", by contrast, is mainly used in three different environments: a) in temporal comparisons, 2) in transitions, and 3) when the speaker is taking an affective stance. The non-temporal functions of "nú" are divided into three categories: a) "nú" as a tone particle, 2) "nú" as an utterance particle, and 3) "nú" as a dialogue particle. "Nú" as a tone particle is syntactically integrated and can occur in two syntactic positions: pre-verbally and post-verbally. I argue that these instances are employed in utterances in which a speaker is foregrounding information or marking it as particularly important. The study shows that, although these instances are typically prosodically non-prominent and unstressed, they are in some cases delivered with stress and with a higher pitch than the surrounding talk. "Nú" as an utterance particle occurs turn-initially and is syntactically non-integrated. By using "nú", speakers show continuity between turns and link new turns to prior ones. These instances initiate either continuations by the same speaker or new turns after speaker shifts. "Nú" as a dialogue particle occurs as a turn of its own. The study shows that these instances register informings in prior turns as unexpected or as a departure from the normal state of affairs. "Nú" as a dialogue particle is often delivered with a prolonged vowel and a recognizable intonation contour. A comparative sequential and prosodic analysis shows that in these cases there is a correlation between the function of "nú" and the intonation contour by which it is delivered. Finally, I argue that despite the many functions of "nú", all the instances can be said to have a common denominator, which is to display attention towards the present moment and the utterances which are produced prior or after the production of "nú". Instead of anchoring the utterances in external time or reference time, these instances position the utterance in discourse internal time, or discourse time.

Verkkoradio, musiikki ja radio - katsaus verkkoradioihin osana suomalaisten musiikin kuuntelua

This thesis examines Internet-radios and other web-based music services, and different ways these services are used in music listening in Finland. The research material was gathered in eight interviews that took place between spring 2005 and spring 2006 in southern Finland. The analysis distinguishes between five main types of Internet-radios: a) simulcasting, b) webcasting, c) podcasting, d) web-based sound archives, e) interactive music services. As a medium for music listening these combine aspects of computers and traditional radio. The role of Internet-radios in everyday life as well as different types of listening motivation are examined in the light of earlier research on taste, music listening and radio listening.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

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.

The influence of school smoking policy and school prevention programs on the smoking behaviour of high school students in Prince Edward Island, Canada

The aim of the study was to examine the influence of school smoking policy and school smoking prevention programs on the smoking behaviour of students in high schools in Prince Edward Island using the School Health Action Planning Evaluation System (SHAPES). A total sample included 13,131 observations of students in grades 10-12 in ten high schools in Prince Edward Island over three waves of data collection (1999, 2000, and 2001). Changes in prevalence of smoking and factors influencing smoking behaviour were analyzed using descriptive statistics and Chi-Square tests. Multi-level logistic regression analyses were used to examine how both school and student characteristics were associated with smoking behaviour (I, II, III, IV). Since students were located within schools, a basic 2-level nested structure was used in which individual students (level 1) were nested within schools (level 2). For grade 12 students, the combination of both school policies and programs was not associated with the risk of smoking and the presence of the new policy was not associated with decreased risk of smoking, unless there were clear rules in place (I). For the grade 10 study, (II) schools with both policies and programs were not associated with decreased risk of smoking. However, the smoking behaviour of older students (grade 12) at a school was associated with younger students’ (grade 10) smoking behaviour. Students first enrolled in a high school in grade 9, rather than grade 10, were at increased risk of occasional smoking. For students who transitioned from grade 10 to 12 (III), close friends smoking had a substantial influence on smoking behaviour for both males and females (III). Having one or more close friends who smoke (Odds Ratio (OR) = 37.46; 95% CI = 19.39 to 72.36), one or more smokers in the home (OR = 2.35; 95% CI = 1.67 to 3.30) and seeing teachers and staff smoking on or near school property (OR=1.78; 95% CI = 1.13 to 2.80), were strongly associated with increased risk of smoking for grade 12 students. Smoking behaviour increased for both junior (Group 1) and senior (Group 2) students (IV). Group 1 students indicated a greater decrease in smoking behaviour and factors influencing smoking behaviour compared to those of Group 2. Students overestimating the percentage of youth their age who smoke was strongly associated with increased likelihood of smoking. Smoking rates showed a decreasing trend (1999, 2000, and 2001). However, policies and programs alone were not successful in influencing smoking behaviour of youth. Rather, factors within the students and schools contextual environment influenced smoking behaviour. Comprehensive approaches are required for school-based tobacco prevention interventions. Keywords: schools, policy, programs, smoking prevention, adolescents Subject Terms: school-based programming, public health, health promotion

Semi-supervised learning of WLAN radio maps

In this thesis a manifold learning method is applied to the problem of WLAN positioning and automatic radio map creation. Due to the nature of WLAN signal strength measurements, a signal map created from raw measurements results in non-linear distance relations between measurement points. These signal strength vectors reside in a high-dimensioned coordinate system. With the help of the so called Isomap-algorithm the dimensionality of this map can be reduced, and thus more easily processed. By embedding position-labeled strategic key points, we can automatically adjust the mapping to match the surveyed environment. The environment is thus learned in a semi-supervised way; gathering training points and embedding them in a two-dimensional manifold gives us a rough mapping of the measured environment. After a calibration phase, where the labeled key points in the training data are used to associate coordinates in the manifold representation with geographical locations, we can perform positioning using the adjusted map. This can be achieved through a traditional supervised learning process, which in our case is a simple nearest neighbors matching of a sampled signal strength vector. We deployed this system in two locations in the Kumpula campus in Helsinki, Finland. Results indicate that positioning based on the learned radio map can achieve good accuracy, especially in hallways or other areas in the environment where the WLAN signal is constrained by obstacles such as walls.

Relationship Drivers in Provider - Consumer Relationships. Empirical Studies of Customer Loyalty Programs (första upplagan slutsåld / first edition sold out, 'print on demand' 60 €)

The study addressed a phenomenon that has become common marketing practice, customer loyalty programs. Although a common type of consumer relationship, there is limited knowledge of its nature. The purpose of the study was to create structured understanding of the nature of customer relationships from both the provider’s and the consumer’s viewpoints by studying relationship drivers and proposing the concept of relational motivation as a provider of a common framework for the analysis of these views. The theoretical exploration focused on reasons for engaging in customer relationships for both the consumer and the provider. The themes of buying behaviour, industrial and network marketing and relationship marketing, as well as the concepts of a customer relationship, customer loyalty, relationship conditions, relational benefits, bonds and commitment were explored and combined in a new way. Concepts from the study of business-to-business relationships were brought over and their power in explaining the nature of consumer relationships examined. The study provided a comprehensive picture of loyalty programs, which is an important contribution to the academic as well as the managerial discussions. The consumer study provided deep insights into the nature of customer relationships. The study provides a new frame of reference to support the existing concepts of loyalty and commitment with the introduction of the relationship driver and relational motivation concepts. The result is a novel view of the nature of customer relationships that creates new understanding of the forces leading to loyal behaviour and commitment. The study concludes with managerial implications.

Search for innovative forest policies and programs.

XVIII IUFRO World Congress, Ljubljana 1986.

Quantification problems in the design of forest policy programs.

XVIII IUFRO World Congress, Ljubljana 1986.

Economic evaluation of forest policy programs.

XVIII IUFRO World Congress, Ljubljana 1986.

Increasing forestry investments by means of public policy programs.

XVIII IUFRO World Congress, Ljubljana 1986.

Public and private technical assistance programs for non-industrial private forest landowners in the southern United States.

XVIII IUFRO World Congress, Ljubljana 1986.

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.