The effect of gregarine parasite infections, age, and diet on calling song structure and mating behaviour in the Texas field cricket, Gryllus integer

In the past ten years, many researchers have focussed their attention on parasites regarding the role they may play in causing variations in male secondary sexual traits and subsequent effects on female choice. Male age has also been suggested to be an important factor in female choice if old age reflects superior genes. This study investigated the effects that gregarine gut parasites, age, and diet have on the calling and mating behaviour of the male Texas field cricket, Gryllus integer. Male calling songs were recorded in the laboratory using a Digital Signal Processing Network. The song parameters measured were: pulse rate, pulse width, burst duration, pulses per burst, interburst interval, and percent missing pulses. The effects of parasite load and age on the various calling song parameters was investigated in crickets that were fed two different diets varying in nutritional quality. None of the calling song parameters were affected by either parasite load or age in either diet grou p. Courtship behaviour was ob served and recorded using an Eventlog recorder on an IBM computer in the laboratory. Females mated equally with paras(tized and unparasitized males and with old and young males The total duration and proportion of time spent performing each of 9 courtship displays were recorded for males on each diet. Only one display was affected by parasite load. Highly parasitized males fed the nutritionally inferior diet juddered for a proportionately shorter time than males with low parasite loads. Also, older males performed juddering and shaking antennae proportionally longer and juddering and raising wings for longer durations than younger males. Males that successfully mated were observed for performance of 8 post-copulatory guarding behaviour displays. None of the guarding behaviours were affected by parasite load. However, one display was affected by age, with older males performing guard turning for shorter durations than younger males. Results are discuss,ed in terms of the influence of parasites and age on female choice.

Evolutionary synthesis of stochastic gene network models using feature-based search spaces

A feature-based fitness function is applied in a genetic programming system to synthesize stochastic gene regulatory network models whose behaviour is defined by a time course of protein expression levels. Typically, when targeting time series data, the fitness function is based on a sum-of-errors involving the values of the fluctuating signal. While this approach is successful in many instances, its performance can deteriorate in the presence of noise. This thesis explores a fitness measure determined from a set of statistical features characterizing the time series' sequence of values, rather than the actual values themselves. Through a series of experiments involving symbolic regression with added noise and gene regulatory network models based on the stochastic 'if-calculus, it is shown to successfully target oscillating and non-oscillating signals. This practical and versatile fitness function offers an alternate approach, worthy of consideration for use in algorithms that evaluate noisy or stochastic behaviour.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Is more information always good? : investigating the impact of website interface features on e-retailer's sales performance

A number of frameworks have been suggested for online retailing, but still there exists little consensus among researchers and practitioners regarding the appropriate amount of information critical and essential to the improvement of customers' satisfaction and their purchase intention. Against this backdrop, this study contributes to the current practical and theoretical discussions and conversations about how information search and perceived risk theories can be applied to the management of online retailer website features. This paper examines the moderating role of website personalization in studying the relationship between information content provided on the top US retailers' websites, and customer satisfaction and purchase intention. The study also explores the role played by customer satisfaction and purchase intention in studying the relationship between information that is personalized to the needs of individual customers and online retailers' sales performance. Results indicate that the extent of information content features presented to online customers alone is not enough for companies looking to satisfy and motivate customers to purchase. However, information that is targeted to an individual customer influences customer satisfaction and purchase intention, and customer satisfaction in tum serves as a driver to the retailer's online sales performance.

Comparison of classification ability of hyperball algorithms to neural network and k-nearest neighbour algorithms

The main focus of this thesis is to evaluate and compare Hyperbalilearning algorithm (HBL) to other learning algorithms. In this work HBL is compared to feed forward artificial neural networks using back propagation learning, K-nearest neighbor and 103 algorithms. In order to evaluate the similarity of these algorithms, we carried out three experiments using nine benchmark data sets from UCI machine learning repository. The first experiment compares HBL to other algorithms when sample size of dataset is changing. The second experiment compares HBL to other algorithms when dimensionality of data changes. The last experiment compares HBL to other algorithms according to the level of agreement to data target values. Our observations in general showed, considering classification accuracy as a measure, HBL is performing as good as most ANn variants. Additionally, we also deduced that HBL.:s classification accuracy outperforms 103's and K-nearest neighbour's for the selected data sets.

Riffing on a Theme: Faculty Experiences With Service-Learning in a Food Security Research Network in Ontario

While service-learning is often said to be beneficial for all those involved—students, community members, higher education institutions, and faculty members—there are relatively few studies of the attraction to, and effect of, service-learning on faculty members. Existing studies have tended to use a survey design, and to be based in the United States. There is a lack of information on faculty experiences with service-learning in Ontario or Canada. This qualitative case study of faculty experiences with service-learning was framed through an Appreciative Inquiry social constructionist approach. The data were drawn from interviews with 18 faculty members who belong to a Food Security Research Network (FSRN) at a university in northern Ontario, reports submitted by the network, and personal observation of a selection of network-related events. This dissertation study revealed how involvement with service-learning created opportunities for faculty learning and growth. The focus on food security and a commitment to the sustainability of local food production was found to be an ongoing attraction to service-learning and a means to engage in and integrate research and teaching on matters of personal and professional importance to these faculty members. The dissertation concludes with a discussion of the FSRN’s model and the perceived value of a themed, transdisciplinary approach to service-learning. This study highlights promising practices for involving faculty in service-learning and, in keeping with an Appreciative Inquiry approach, depicts a view of faculty work at its best.

Using Network Analysis to Understand and Advance Falls Prevention Services and Programs

The purpose of this study was to understand referral linkages that exist among falls prevention agencies in a southern Ontario region using network analysis theory. This was a single case study which included fifteen individual interviews. The data was analyzed through the constant comparative approach. Ten themes emerged and are classified into internal and external factors. Themes associated with internal factors are: 1) health professionals initiating services; 2) communication strategies; 3) formal partnerships; 4) trust; 5) program awareness; and 6) referral policies. Themes associated with external factors are: 1) client characteristics; 2) primary and community care collaboration; 3) networking; and 4) funding. Recommendations to improve the referral pathway are: 1) electronic database; 2) electronic referral forms; 3) educating office staff; and 4) education days. This study outlined the benefit of using network analysis to understand referral pathways and the importance of implementing strategies that will improve falls prevention referral pathways.

A game-theoretic network formation model

We study the dynamics of a game-theoretic network formation model that yields large-scale small-world networks. So far, mostly stochastic frameworks have been utilized to explain the emergence of these networks. On the other hand, it is natural to seek for game-theoretic network formation models in which links are formed due to strategic behaviors of individuals, rather than based on probabilities. Inspired by Even-Dar and Kearns (2007), we consider a more realistic model in which the cost of establishing each link is dynamically determined during the course of the game. Moreover, players are allowed to put transfer payments on the formation of links. Also, they must pay a maintenance cost to sustain their direct links during the game. We show that there is a small diameter of at most 4 in the general set of equilibrium networks in our model. Unlike earlier model, not only the existence of equilibrium networks is guaranteed in our model, but also these networks coincide with the outcomes of pairwise Nash equilibrium in network formation. Furthermore, we provide a network formation simulation that generates small-world networks. We also analyze the impact of locating players in a hierarchical structure by constructing a strategic model, where a complete b-ary tree is the seed network.

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming

A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.

Untangling the Organizational Ambiguities in Supply Chain Risk Recognition, Assessment, and Response: The Role of Network Embeddedness

In this thesis, I focus on supply chain risk related ambiguity, which represents the ambiguities firms exhibit in recognizing, assessing, and responding to supply chain disruptions. I, primarily, argue that ambiguities associated with recognizing and responding to supply chain risk are information gathering and processing problems. Guided by the theoretical perspective of bounded rationality, I propose a typology of supply chain risk related ambiguity with four distinct dimensions. I, also, argue that the major contributor to risk related ambiguity is often the environment, specifically the web of suppliers. Hence, I focus on the characteristics of these supplier networks to examine the sources of ambiguity. I define three distinct elements of network embeddedness – relational, structural, and positional embeddedness – and argue that the ambiguity faced by a firm in appropriately identifying the nature or impacts of major disruptions is a function of these network properties. Based on a survey of large North American manufacturing firms, I found that the extent of the relational ties a firm has and its position in the network are significantly related to supply chain risk related ambiguity. However, this study did not provide any significant support for the hypothesized relationship between structural embeddedness and ambiguity. My research contributes towards the study of supply chain disruptions by using the idea of bounded rationality to understand supply chain risk related ambiguity and by providing evidence that the structure of supply chain networks influences the organizational understanding of and responses to supply chain disruptions.

Understanding Network Governance: A Case Study Exploration of Active Canada 20/20

Consistent with the governance shift towards network forms of governance, a number of new social movements have formed in response to the declining levels of physical activity in the Western world. One such movement is Active Canada 20/20: A Physical Activity Strategy and Change Agenda for Canada. Network governance is employed as the theoretical framework for this case study exploration of Active Canada 20/20 and the political landscape surrounding its development and implementation. Semi-structured interviews were conducted in addition to document/policy analysis and direct observations. Analysis of the data resulted in three overarching themes – the defining characteristics of network governance, the political landscape, and intersectoral linkages – that interconnect multifariously based the nature of the Canadian federal government and its relationship with the voluntary sector for physical activity. Despite progress in driving Active Canada 20/20 forward, entrenched dynamics of power need to be navigated within the political landscape surrounding network governance.

Canada’s new Open Access Policy: what does it mean for Brock researchers?

Presentation at Brock Library Spring Symposium 2015: What's really going on?

Identification of Network-Based Risk Factors Associated with Gonorrhea

The evolving antimicrobial resistance coupled with a recent increase in incidence highlights the importance of reducing gonococcal transmission. Establishing novel risk factors associated with gonorrhea facilitates the development of appropriate prevention and disease control strategies. Sexual Network Analysis (NA), a novel research technique used to further understand sexually transmitted infections, was used to identify network-based risk factors in a defined region in Ontario, Canada experiencing an increase in the incidence of gonorrhea. Linear network structures were identified as important reservoirs of gonococcal transmission. Additionally, a significant association between a central network position and gonorrhea was observed. The central participants were more likely to be younger, report a greater number of risk factors, engage in anonymous sex, have multiple sex partners in the past six months and have sex with the same sex. The network-based risk factors identified through sexual NA, serving as a method of analyzing local surveillance data, support the development of strategies aimed at reducing gonococcal spread.