On the edge : exploring homeless women's social networks

This thesis aims to uncover the ways that previously homeless women in the Niagara region are able (or unable) to rely on friends, family and service providers in times of crisis (homelessness and poverty). Eleven women were interviewed and their experiences indicate that social networks cannot take the place of comprehensive and inclusive social policy. Time and time again, their stories showed that they were left negotiating the detritus of neo-liberal policies.

Niagara alternative food projects : networks, discourses and nature /

This thesis undertakes an exploration of the nature of alternative food projects in Niagara. A review of various theoretical approaches to the study of food and agriculture, suggests that actor-network theory offers the most useful lens through which to understand these projects. In particular, actor-network theory facilitates non-dualistic theorisations of power and scale and a commitment to the inclusion of non-humans in the 'social' sciences. The research is based on 19 in-depth interviews with actors involved in various urban and rural projects including community supported agriculture, community gardens, chefs using local seasonal food, a winery that grows organically, the good food box, a value-added small business, and organic producers. The analysis consists of four themes. The first analytical section pays special attention to the prominence of agri-tourism in Niagara, and examines the ways in which the projects in the sample interact with agri-tourist networks. In the second section the discussion focuses on the discourses and practices of resistance among Niagara alternative food actors. The participants' interviews suggest there are more discourses of resistance toward agri-tourist than toward dominant food networks. The third section questions commodity chain theorisations of alternative food projects. In particular, this section shows how the inclusion of non-human actors in an analysis confounds conceptualisations of 'short' and 'local' chains. The final analytical section assesses relations of power in Niagara alternative food projects. Three important conclusions arise from this research. First, Niagara alternative food projects cannot be conceptualised as operating at the 'local' scale. Broadening the scope of analysis to include non-human actors, it becomes apparent that these projects actually draw on a variety of extra-local actors. They are at once local and global. Second, the projects in this sample are simultaneously part of alternative, dominant and agri-tourist networks. While Niagara alternative food projects do perform many of the roles characteristic of alternative food systems, they are also involved in practices of development, business, and class distinction. Thus, alternative food networks should not be understood as separate from and in direct opposition to dominant food networks. Despite the second conclusion, this research determines that Niagara alternative food projects have made significant strides in the reworking of power. The projects represented in this thesis do engage in resistant practices and are associated with increased levels ofjustice.

'What ever happened to breakdancing?' : transnational b-boy/b-girl networks, underground video magazines and imagined affinities

In 1997, Paul Gilroy was able to write: "I have been asking myself, whatever happened to breakdancing" (21), a form of vernacular dance associated with urban youth that emerged in the 1970s. However, in the last decade, breakdancing has experienced a massive renaissance in movies (You Got Served), commercials ("Gotta Have My Pops!") and documentaries (the acclaimed Freshest Kids). In this thesis, 1 explore the historical development of global b-boy/bgirl culture through a qualitative study involving dancers and their modes of communication. Widespread circulation of breakdancing images peaked in the mid-1980s, and subsequently b-boy/b-girl culture largely disappeared from the mediated landscape. The dance did not reemerge into the mainstream of North American popular culture until the late 1990s. 1 argue that the development of major transnational networks between b-boys and b-girls during the 1990s was a key factor in the return of 'b-boying/b-girling' (known formerly as breakdancing). Street dancers toured, traveled and competed internationally throughout this decade. They also began to create 'underground' video documentaries and travel video 'magazines.' These video artefacts circulated extensively around the globe through alternative distribution channels (including the backpacks of traveling dancers). 1 argue that underground video artefacts helped to produce 'imagined affinities' between dancers in various nations. Imagined affinities are identifications expressed by a cultural producer who shares an embodied activity with other practitioners through either mediated texts or travels through new places. These 'imagined affinities' helped to sustain b-boy/b-girl culture by generating visual/audio representations of popularity for the dance movement across geographical regions.

Particle swarm optimization for two-connected networks with bounded rings

The Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique modeled on the social behaviour of flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem. As PSO is originally designed to handle a continuous solution space, modification of the algorithm was necessary in order to adapt it for such a highly constrained discrete combinatorial optimization problem. Presented are an indirect transcription scheme for applying PSO to such discrete optimization problems and an oscillating mechanism for averting stagnation.

Scales, networks and uncertainty : an examination of environmental policy-making in Ontario

Through a case-study analysis of Ontario's ethanol policy, this thesis addresses a number of themes that are consequential to policy and policy-making: spatiality, democracy and uncertainty. First, I address the 'spatial debate' in Geography pertaining to the relevance and affordances of a 'scalar' versus a 'flat' ontoepistemology. I argue that policy is guided by prior arrangements, but is by no means inevitable or predetermined. As such, scale and network are pragmatic geographical concepts that can effectively address the issue of the spatiality of policy and policy-making. Second, I discuss the democratic nature of policy-making in Ontario through an examination of the spaces of engagement that facilitate deliberative democracy. I analyze to what extent these spaces fit into Ontario's environmental policy-making process, and to what extent they were used by various stakeholders. Last, I take seriously the fact that uncertainty and unavoidable injustice are central to policy, and examine the ways in which this uncertainty shaped the specifics of Ontario's ethanol policy. Ultimately, this thesis is an exercise in understanding sub-national environmental policy-making in Canada, with an emphasis on how policy-makers tackle the issues they are faced with in the context of environmental change, political-economic integration, local priorities, individual goals, and irreducible uncertainty.

Automatic Inference of Graph Models for Complex Networks with Genetic Programming

Complex networks can arise naturally and spontaneously from all things that act as a part of a larger system. From the patterns of socialization between people to the way biological systems organize themselves, complex networks are ubiquitous, but are currently poorly understood. A number of algorithms, designed by humans, have been proposed to describe the organizational behaviour of real-world networks. Consequently, breakthroughs in genetics, medicine, epidemiology, neuroscience, telecommunications and the social sciences have recently resulted. The algorithms, called graph models, represent significant human effort. Deriving accurate graph models is non-trivial, time-intensive, challenging and may only yield useful results for very specific phenomena. An automated approach can greatly reduce the human effort required and if effective, provide a valuable tool for understanding the large decentralized systems of interrelated things around us. To the best of the author's knowledge this thesis proposes the first method for the automatic inference of graph models for complex networks with varied properties, with and without community structure. Furthermore, to the best of the author's knowledge it is the first application of genetic programming for the automatic inference of graph models. The system and methodology was tested against benchmark data, and was shown to be capable of reproducing close approximations to well-known algorithms designed by humans. Furthermore, when used to infer a model for real biological data the resulting model was more representative than models currently used in the literature.

Electrophysiology of Oculomotor Delayed Response Tasks: A Model for the Maturation of Visual-Spatial Working Memory Networks

In the literature, persistent neural activity over frontal and parietal areas during the delay period of oculomotor delayed response (ODR) tasks has been interpreted as an active representation of task relevant information and response preparation. Following a recent ERP study (Tekok-Kilic, Tays, & Tkach, 2011 ) that reported task related slow wave differences over frontal and parietal sites during the delay periods of three ODR tasks, the present investigation explored developmental differences in young adults and adolescents during the same ODR tasks using 128-channel dense electrode array methodology and source localization. This exploratory study showed that neural functioning underlying visual-spatial WM differed between age groups in the Match condition. More specifically, this difference is localized anteriorly during the late delay period. Given the protracted maturation of the frontal lobes, the observed variation at the frontal site may indicate that adolescents and young adults may recruit frontal-parietal resources differently.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks

Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by random chance. In the study of complex networks, many graph models have been proposed to model the behaviours observed. However, constructing graph models manually is tedious and problematic. Many of the models proposed in the literature have been cited as having inaccuracies with respect to the complex networks they represent. However, recently, an approach that automates the inference of graph models was proposed by Bailey [10] The proposed methodology employs genetic programming (GP) to produce graph models that approximate various properties of an exemplary graph of a targeted complex network. However, there is a great deal already known about complex networks, in general, and often specific knowledge is held about the network being modelled. The knowledge, albeit incomplete, is important in constructing a graph model. However it is difficult to incorporate such knowledge using existing GP techniques. Thus, this thesis proposes a novel GP system which can incorporate incomplete expert knowledge that assists in the evolution of a graph model. Inspired by existing graph models, an abstract graph model was developed to serve as an embryo for inferring graph models of some complex networks. The GP system and abstract model were used to reproduce well-known graph models. The results indicated that the system was able to evolve models that produced networks that had structural similarities to the networks generated by the respective target models.

Community Detection in Multi-Layer Networks

In the scope of the current thesis we review and analyse networks that are formed by nodes with several attributes. We suppose that different layers of communities are embedded in such networks, besides each of the layers is connected with nodes' attributes. For example, examine one of a variety of online social networks: an user participates in a plurality of different groups/communities – schoolfellows, colleagues, clients, etc. We introduce a detection algorithm for the above-mentioned communities. Normally the result of the detection is the community supplemented just by the most dominant attribute, disregarding others. We propose an algorithm that bypasses dominant communities and detects communities which are formed by other nodes' attributes. We also review formation models of the attributed networks and present a Human Communication Network (HCN) model. We introduce a High School Texting Network (HSTN) and examine our methods for that network.

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.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.