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

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform’s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

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.

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.

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.