Continuing medical education has been characterized as didactic and ineffective. This thesis explores the use of Knowledge Building theory, pedagogy, and technology to test an alternative model for physician engagement—one that emphasizes sustained and creative work with ideas. Several important conceptual changes in continuing medical education are implied by the Knowledge Building model—changes that extend the traditional approach through engagement in (a) collective responsibility for group achievements rather than exclusive focus on individual advancement and (b) work in design-mode, with ideas treated as objects of creation and assemblage into larger wholes and new applications, with extension beyond belief-mode where evidence-based acceptance or rejection of beliefs dominates. The goal is to engage physicians in “cultures of participation” where individual learning and collective knowledge invention or metadesign advance in parallel. This study was conducted in a continuing medical education End-of-Life Care Distance Education course, for family physicians, from 2004 to 2009. A mixed methods case study methodology was used to determine if social-mediated Knowledge Building improved physicians’ knowledge, and if so, what social network structural relationships and sociocognitive dynamics support knowledge improvement, democratization of knowledge, and a metadesign perspective. Traditional pre-/posttest learning measures across 4-years showed significant gains (9% on paired t-test = 5.34, p < 0.001) and large effect size (0.82). Social network analysis of ten 2008/2009 modules showed significant difference in density of build-on notes across groups. Additional results demonstrated a relationship between high knowledge gains and social network measures of centrality/distribution and cohesion. Correlation of posttest scores with centrality variables were all positive. Position/power analyses highlighted core-periphery sociocognitive dynamics between the facilitator and students. Facilitators most often evoked partner/expert relationships. Questions rather than statements dominated the discourse; discourse complexity was elaborated/compiled as opposed to reduced/dispersed. Themes beyond predefined learning objectives emerged and Knowledge Building principles of community responsibility, idea improvability, and democratization of knowledge were evident. Overall, results demonstrate the potential of collective Knowledge Building and design-mode work in continuing medical education, with individual learning representing an important by-product. There were no discernible decrements in performance, suggesting significant advantages rather than tradeoffs from engagement in Knowledge Building.

Finding subgroups within social networks is important for understanding and possibly influencing the formation and evolution of online communities. This thesis addresses the problem of finding cohesive subgroups within social networks inferred from online interactions. The dissertation begins with a review of relevant literature and identifies existing methods for finding cohesive subgroups. This is followed by the introduction of the SCAN method for identifying subgroups in online interaction. The SCAN (Social Cohesion Analysis of Networks) methodology involves three steps: selecting the possible members (Select), collecting those members into possible subgroups (Collect) and choosing the cohesive subgroups over time (Choose). Social network analysis, clustering and partitioning, and similarity measurement are then used to implement each of the steps. Two further case studies are presented, one involving the TorCamp Google group and the other involving YouTube vaccination videos, to demonstrate how the methodology works in practice. Behavioural measures of Sense of Community and the Social Network Questionnaire are correlated with the SCAN method to demonstrate that the SCAN approach can find meaningful subgroups. Additional empirical findings are reported. Betweenness centrality appears to be a useful filter for screening potential subgroup members, and members of cohesive subgroups have stronger community membership and influence than others. Subgroups identified using weighted average hierarchical clustering are consistent with the subgroups identified using the more computationally expensive k-plex analysis. The value of similarity measurement in assessing subgroup cohesion over time is demonstrated, and possible problems with the use of Q modularity to identify cohesive subgroups are noted. Applications of this research to marketing, expertise location, and information search are also discussed.

The sharing of needles among injection drug users (IDUs) is a common route of Human Immunodeficiency Virus and Hepatitis C Virus transmission. Through the increased utilization of social network analysis, researchers have been able to examine how the interpersonal relationships of IDUs affect injection risk behaviour. This study involves a secondary analysis of data from a cross-sectional study of 156 IDUs from Winnipeg, Manitoba titled “Social Network Analysis of Injection Drug Users”. Multiple logistic regression analysis was used to assess the individual and the social network characteristics associated with needle sharing among the IDUs. Generalized Estimating Equations analysis was used to determine the injecting dyad characteristics which influence needle sharing behaviour between the IDUs and their injection drug using network members. The results revealed five key thematic findings that were significantly associated with needle sharing: (1) types of drug use, (2) socio-demographic status, (3) injecting in semi-public locations, (4) intimacy, and (5) social influence. The findings from this study suggest that comprehensive prevention approaches that target individuals and their network relationships may be necessary for sustainable reductions in needle sharing among IDUs. / February 2006

This dissertation research is focused on how we, as researchers, ‘influence’ others researchers. In particular, I am concerned with the notion of what constitutes the ‘influence’ of a scholar and how ‘influence’ is conferred upon scholars. This research is concerned with the construct called ‘scholarly influence’. Scholarly influence is of interest because a clear “theory of scholarly influence” does not yet exist. Rather a number of surrogate measures or concepts that are variable are used to evaluate the value of one’s academic work. ‘Scholarly influence’ is broken down into ‘ideational influence’ or the influence that one has through publication and the uptake of the ideas presented in the publication, and ‘social influence’ or the influence that one has through working with other researchers. Finally through the use of the definition of ‘scholarly influence’ this dissertation tries to commence a definition of ‘quality’ in scholarly work.

Stadsmodeller i 3D är en allt mer bidragande faktor inom GIS och vinster i tid för räddningstjänst vid användandet av 3D-GIS har påvisats. Arbetet presenterat i rapporten behandlar nätverksanalyser i 2D och 3D och har utförts på uppdrag av Gävle kommun.  Uppgiften har utförts med två huvudsakliga mål. Det första målet var att jämföra processtiderna för Dijkstras sökalgoritm mellan nätverk (ett mindre baserat på förvaltningshuset i Gävle och ett överdimensionerat nätverk) i 3D och motsvarande nätverk i 2D, för att sedan avgöra skillnaden. Det andra målet var att utveckla en applikation som tillåter vägledning i 3D för besökare från reception till önskad anställd och få rutten visualiserad i en 3D-modell. Arbetet har i huvudsak genomförts med ESRI ArcGIS Desktop 10 och ArcGIS Engine 10 Developer Kit. Programmeringen har utförts med C# i Visual Studio 2010. Applikationen fungerar dynamiskt genom att den hämtar personalinformation från en tabell med hjälp av SQL-sökningar och rutterna genereras vid varje enskild sökning. Resultaten för analyserna över processtiderna visar att det inte är någon signifikant skillnad mellan 2D- och 3D-nätverken. Den slutsats som kan dras är att processtiden inte är ett skäl att välja bort en 3D-miljö för nätverksanalyser. I framtiden finns stor potential för nätverksanalyser i 3D, framförallt i samverkan med 2D-nätverk. / City models in 3D are a growing factor in GIS and it has been demonstrated that rescue times will be reduced for emergency services with the use of 3D GIS. The work presented in this thesis deals with network analysis in 2D and 3D and has been carried out on behalf of Gävle municipality. The task has been carried out with two main objectives. The first objective was to compare processing times for Dijkstra's search algorithm for networks (one smaller network based on the house of administration (förvaltningshuset) in Gävle and one overdimensioned network) in 3D and the corresponding ones in 2D in order to determine the difference. The second objective was to develop an application which allows 3D guidance for visitors from the reception to the required personnel; the resulting route is then obtained and visualized in a 3D model. The work has mainly been conducted with ESRI ArcGIS Desktop 10 and ArcGIS Engine Developer Kit 10. The programming has been carried out with C# in Visual Studio 2010. The application works by dynamically retrieving employee information from a table by using SQL-queries and individual routes are generated for each search. The analysis results for the process times show that there are no significant differences between the 2D and 3D networks. The conclusion to be drawn is that the process time is not a reason to opt out of a 3D environment for network analysis. In the future there is great potential for network analysis in 3D, especially in conjunction with 2D networks.

New social networking and social web tools are becoming available and are easing the process of customizing online social environments. With these developments in technology, core design efforts are being extended beyond usability for individual users and beginning to include notions of sociability for the engagement of communities of users. This thesis is an investigation of these developments. It is guided by the principal research question: how do you design for social engagement in an online social environment intended to facilitate interaction in a community of users? To address this question, this thesis presents a domain-community model developed from the communities of practice concept and the Work Domain Analysis model used in Cognitive Work Analysis. The domain-community model provides a basis for the design a composition of web components for an online social environment that will addresses issues of social engagement and domain effectiveness. In a case study, the domain-community model was used as a basis for the redesign of a social networking portal used by an international development leadership community called UCP-SARnet. A social network analysis of core members of UCP-SARnet was conducted before and after the portal was redesigned. From the social network analysis, it was concluded that the structure of UCP-SARnet was positively affected by the redesign: core group members reported they knew one another significantly more after the redesign of the website than before the redesign. User experience measures of the UCP-SARnet portal, website usage data, and a tally of website communication activity also changed significantly with the redesign of the website. This provided more evidence that a design informed by Cognitive Work Analysis and communities of practice produced a measurable effect on the structure of the UCP-SARnet online community. As such, this model can provide a basis for designers of online communities to more systematically account for social phenomena in relation to collective efforts in a given work domain. Furthermore, it is expected the effectiveness of the model can be taken forward with future work by refining the domain-community model, developing techniques to translate the model into interface concepts, and building practices for community-based research and design.

The aim of this essay was to describe the power elite of the Swedish town Karlshamn, and its influences on the local political process before the realization of the narrow-gauge railway Karlshamn-Wislanda-Jernväg. During the mid 19th century, a revolutionary period began in the Swedish pre-industrial epoch. The political and institutional regulatory frameworks were disassembled and restructured, away from protectionism and centrally controlled administration, for the benefit of free trade, local self-government and liberalism. The changes were carried through during times marked by a drastic increasing native population and upcoming demands for adjustments to meet the growth of the industrial-, trade- and labour markets. An essential industrial development factor was the building of the national railway network, which started after some important decisions in the Swedish Riksdag during the 1850´s. In close connection with governmental initiatives to build national trunk lines, processes on the local political arenas were initiated to rapidly obtain connections to these planned main lines. Focus in this study was put on the town Karlshamn 1855-1874 and the main document sources that were examined consisted of protocols and petitions from errands on the local political arenas, f.e. the town council. The material was methodically revised by means of a network- and field analysis. Through this analytical method it was possible to confirm the power elite actors, their potential networks and reproduced groups. The results point to the importance of the formal networks an their contributions to the accumulation of social capital. Above all, this was significant for the most important individuals in the process, the local wholesale dealers Edvard Ferdinand Meyer and Carl Gustaf Berg. The process also resulted in a reproduction of local political power, and the dominance on the political field was continued. All through the twenty-year lasting process, the railway issue became a possibility for the local elite, with representatives from the trading companies, to mobilize the political decisions in the direction of continuous economic development, and enlargement of the town´s commercial area. In the town of Karlshamn, with a stagnating economy, the new infrastructure, beside the connection to the main national lines, constituted a lifeline towards continuous financial expansion and competitiveness.

In recent years, many virtual communities have thrived with the rapid development of Internet. In the environment of virtual community, through the information exchange, members realize that they often have similar demands. In the case of online group-buying, buyers who have a common interest in a certain product group together to collect their collective power and thus get price discounts from suppliers. Hence online group-buying comprehends the need of interest, relationship, and transaction of virtual community. We are questioning whether the group-buying have invisible community relationships embedded in members¡¦ transaction activities. The purpose of this study is by the use of social network analysis to investigate the relationships of the network between initiators and participants and between co-participants. In particular we propose some measures based on social network analysis to help us understand the meanings of relationships of online group-buying network. According to the result of this study, we find the initiators have more power or resources to influence other members of the network between initiators and participants. And some active participants also have more power or resources to influence other participants of the network between co-participants. We also find the active initiators and participants would have more probability to occupy key positions of information flow.

In the process of urbanization, the population and economy are rapidly growing. To achieve the demand of urbanization, natural areas are developed into construction areas in the city. Nature areas began to shrink and fragment, causing a great deal of damage, such as species extinction. The ability of nature to control the flood, adjust the rain, and filter pollution has been lost. This study is based on the city of Kaohsiung and Kaohsiung County. The study uses a large scale to re-examine the spatial structure of this area to propose an effective and reasonable planning policy for the environment and ecosystem. The study introduces the concept of green infrastructure to develop a green network system for the city. Green infrastructure is a network connecting natural areas and open spaces that can save ecological value and retain the ecosystem function. A green infrastructure network consists of hubs and links, and the network pattern can be made for different purposes. The study chose green land with an area of more than twenty hectares for the hubs and chose the terrestrial animal for the target species. The study uses the least-cost path analysis to plan the links for the terrestrial animal. The least-cost path, which is the path of least resistance when the terrestrial animal passes through the landscape. All the hubs generated 903 links. To create the green infrastructure networks, this study uses the gravity model to evaluate which corridor is the most important. Using the graph theory, the study developed three plans for a green infrastructure network to meet different demands: the Paul Revere, Traveling Salesman, and Least Cost to User networks. Planners can see different demands dictating the choice between different green infrastructure networks. Finally, the study discusses the three-network structure, finding the important hubs and links for the terrestrial animal. These areas should be protected to maintain the green infrastructure network.

This dissertation considers graph theoretic generalizations of the maximum clique problem. Models that were originally proposed in social network analysis literature, are investigated from a mathematical programming perspective for the first time. A social network is usually represented by a graph, and cliques were the first models of "tightly knit groups" in social networks, referred to as cohesive subgroups. Cliques are idealized models and their overly restrictive nature motivated the development of clique relaxations that relax different aspects of a clique. Identifying large cohesive subgroups in social networks has traditionally been used in criminal network analysis to study organized crimes such as terrorism, narcotics and money laundering. More recent applications are in clustering and data mining wireless networks, biological networks as well as graph models of databases and the internet. This research has the potential to impact homeland security, bioinformatics, internet research and telecommunication industry among others. The focus of this dissertation is a degree-based relaxation called k-plex. A distance-based relaxation called k-clique and a diameter-based relaxation called k-club are also investigated in this dissertation. We present the first systematic study of the complexity aspects of these problems and application of mathematical programming techniques in solving them. Graph theoretic properties of the models are identified and used in the development of theory and algorithms. Optimization problems associated with the three models are formulated as binary integer programs and the properties of the associated polytopes are investigated. Facets and valid inequalities are identified based on combinatorial arguments. A branch-and-cut framework is designed and implemented to solve the optimization problems exactly. Specialized preprocessing techniques are developed that, in conjunction with the branch-and-cut algorithm, optimally solve the problems on real-life power law graphs, which is a general class of graphs that include social and biological networks. Computational experiments are performed to study the effectiveness of the proposed solution procedures on benchmark instances and real-life instances. The relationship of these models to the classical maximum clique problem is studied, leading to several interesting observations including a new compact integer programming formulation. We also prove new continuous non-linear formulations for the classical maximum independent set problem which maximize continuous functions over the unit hypercube, and characterize its local and global maxima. Finally, clustering and network design extensions of the clique relaxation models are explored.