SAVOURING ABILITIES SCALE (SAS): THE DEVELOPMENT OF A STRENGTHS - BASED ASSESSMENT FOR THERAPEUTIC RECREATION PROFESSIONALS

The purpose of this study was to develop and evaluate an assessment that measured savouring leisure. The assessment items developed were reviewed for content validity by eight international therapeutic recreation (TR) educators and administrators as well as eleven TR practitioners. An exploratory factor analysis was conducted to determine the most suitable items for the assessment. The results suggest that the original three subscale design needed to be modified to five. The reliability of the total assessment is α=.84. Statistical analysis for construct validity reveal 58.52% of the variance explained, and a moderate correlation was found between this study and other savouring assessments. The implications of the shift in conceptualization are reviewed through discussing factor analysis issues, the lived experience of savouring leisure, and the impact of the content validity process. This study contributes to the ongoing dialog of savouring leisure. Recommendations for future research are discussed.

Dynamics in large scale networks

In this thesis we study the properties of two large dynamic networks, the competition network of advertisers on the Google and Bing search engines and the dynamic network of friend relationships among avatars in the massively multiplayer online game (MMOG) Planetside 2. We are particularly interested in removal patterns in these networks. Our main finding is that in both of these networks the nodes which are most commonly removed are minor near isolated nodes. We also investigate the process of merging of two large networks using data captured during the merger of servers of Planetside 2. We found that the original network structures do not really merge but rather they get gradually replaced by newcomers not associated with the original structures. In the final part of the thesis we investigate the concept of motifs in the Barabási-Albert random graph. We establish some bounds on the number of motifs in this graph.