What happens in the first 200 ms of word reading : ERP studies on visual word recognition with top-down and bottom-up approaches /

In this thesis, three main questions were addressed using event-related potentials (ERPs): (1) the timing of lexical semantic access, (2) the influence of "top-down" processes on visual word processing, and (3) the influence of "bottom-up" factors on visual word processing. The timing of lexical semantic access was investigated in two studies using different designs. In Study 1,14 participants completed two tasks: a standard lexical decision (LD) task which required a word/nonword decision to each target stimulus, and a semantically primed version (LS) of it using the same category of words (e.g., animal) within each block following which participants made a category judgment. In Study 2, another 12 participants performed a standard semantic priming task, where target stimulus words (e.g., nurse) could be either semantically related or unrelated to their primes (e.g., doctor, tree) but the order of presentation was randomized. We found evidence in both ERP studies that lexical semantic access might occur early within the first 200 ms (at about 170 ms for Study 1 and at about 160 ms for Study 2). Our results were consistent with more recent ERP and eye-tracking studies and are in contrast with the traditional research focus on the N400 component. "Top-down" processes, such as a person's expectation and strategic decisions, were possible in Study 1 because of the blocked design, but they were not for Study 2 with a randomized design. Comparing results from two studies, we found that visual word processing could be affected by a person's expectation and the effect occurred early at a sensory/perceptual stage: a semantic task effect in the PI component at about 100 ms in the ERP was found in Study 1 , but not in Study 2. Furthermore, we found that such "top-down" influence on visual word processing might be mediated through separate mechanisms depending on whether the stimulus was a word or a nonword. "Bottom-up" factors involve inherent characteristics of particular words, such as bigram frequency (the total frequency of two-letter combinations of a word), word frequency (the frequency of the written form of a word), and neighborhood density (the number of words that can be generated by changing one letter of an original word or nonword). A bigram frequency effect was found when comparing the results from Studies 1 and 2, but it was examined more closely in Study 3. Fourteen participants performed a similar standard lexical decision task but the words and nonwords were selected systematically to provide a greater range in the aforementioned factors. As a result, a total of 18 word conditions were created with 18 nonword conditions matched on neighborhood density and neighborhood frequency. Using multiple regression analyses, we foimd that the PI amplitude was significantly related to bigram frequency for both words and nonwords, consistent with results from Studies 1 and 2. In addition, word frequency and neighborhood frequency were also able to influence the PI amplitude separately for words and for nonwords and there appeared to be a spatial dissociation between the two effects: for words, the word frequency effect in PI was found at the left electrode site; for nonwords, the neighborhood frequency effect in PI was fovind at the right elecfrode site. The implications of otir findings are discussed.

Nestmate recognition in the large carpenter bee, Xylocopa virginica /

Abstract Many species of social insects have the ability to recognize their nestmates. In bees, sociality is maintained by bees that recognize which individuals should be helped and which should be hanned in order to maximize fitness (either inclusive or individual) (Hamilton 1964; Lin and Michener 1972). Since female bees generally lay eggs in a single nest, it is highly likely that bees found cohabitating in the same nest are siblings. According to the kin selection hypothesis, individuals should cooperate and avoid aggression with same sex nestmates (Hamilton 1964). However, in opposite sex pairs that are likely kin, aggression should increase among nestmates as an expression of inbreeding avoidance (Lihoreau et al. 2007). Female bees often guard nest entrances, recognizing and excluding foreign conspecific females that threaten to steal nest resources (Breed and Page 1991). Conversely, males that aggressively guard territories should avoid aggression towards other males that are likely kin (Shellman-Reeve and Gamboa 1984). In order to test whether Xy/ocopa virginica can distinguish nestmates from non-nestmates, circle tube testing arenas were used. Measures of aggression, cooperation and tolerance were evaluated to detennine the presence of nestmate recognition in this species. The results of this study indicate that male and female X virginica have the ability to distinguish nestmates from non-nestmates. Individuals in same sex pairs demonstrated increased pushing, biting, and C-posturing when faced with non-nestmates. Males in same sex pairs also attempted to pass (unsuccessfully) nOIl-nestmates more often than ncstmates, suggesting that this behaviour may be an cxpression of dominancc in males. Increased cooperation exemplified by successful passes was not observed among nestmates. However, incrcased tolerance in the [onn of head-to-head touching was observed for nestmates in female same sex and opposite sex pairs. These results supported the kin selection hypothesis. Moreover, increased tolerance among opposite sex non-nestmates suggested that X virginica do not demonstrate inbreeding avoidance among nestmates. 3 The second part of this study was conducted to establish the presence and extent of drifting, or travelling to different nests, in a Xylocopa virgillica population. Drifting in flying Hymenoptera is reported to be the result of navigation error and guard bees erroneously admitting novel individuals into the nest (Michener 1966). Since bees in this study were individually marked and captured at nest entrances, the locations where individuals were caught allowed me to determine where and how often bees travelled from nest to nest. Ifbees were captured near their home nests, changing nests may have been deliberate or explained by navigational error. However, ifbees were found in nests further away from their homes, this provides stronger evidence that flying towards a novel nest may have been deliberate. Female bees are often faithful to their own nests (Kasuya 1981) and no drifting was expected in female X virginica because they raise brood and contribute to nest maintenance activities. Contrary to females, males were not expected to remain faithful to a single nest. Results showed that many more females drifted than expected and that they were most often recaptured in a single nest, either their home nest or a novel nest. There were some females that were never caught in the same nest twice. In addition, females drifted to further nests when population density was low (in 2007), suggesting they seek out and claim nesting spaces when they are available. Males, as expected, showed the opposite pattern and most males drifted from nest to nest, never recaptured in the same location. This pattern indicates that males may be nesting wherever space is available, or nesting in benches nearest to their territories. This study reveals that both female and male X virginica are capable of nestmate recognition and use this ability in a dynamic environment, where nest membership is not as stable as once thought.

Immuno-cytochemical localization of glycoproteins involved in recognition and attachment in a mycoparatism

Polyclonal antibodies prepared against the two glycoproteins (Mr 100 and 85 kDa) involved in recognition and attachment of the mycoparasite, Piptocephalis virginiana, to its hosts, Mortierella pusilla and Phascolomyces articulosus, susceptible and resistant, respectively, were employed to localize the antigens at their cell surfaces. Indirect immunocytochemical technique using secondary antibodies labelled with either FITC or gold particles as probes, were used. FITC-Iabelled antibodies revealed a discontinous pattern of fluorescence on the hyphae of MortlerelLa pusilla and no fluorescence on the hyphae of Phascolomyces articulosus. Intensity of fluorescence was high in the germinating spores of both the fungi. Fluoresence could be observed on P. articulosus hyphae pretreated with a commercial proteinase. Fluorescence was not observed on either hyphae or germinating spores of the nonhost M0 r tie re11 a ca ndelabrum and the mycoparasite P. virginiana. Antibodies labelled with gold conjugate showed a different pattern of antigen localization on the hyphal walls of the susceptible and resistant hosts. Patches of gold particles were observed allover the whole cell wall of the susceptible host but only on the inner cell wall layer of the resistant host. Cell wall fragments of the susceptible host but not those of the resistant host, previously incubated with the antibodies inhibited attachment of the mycoparasite. Implications of preferential localization of the antigen in the resistant host and its absence in the nonhost are described.

Involvement of fimbriae in host-mycoparasite recognition

Extracellular, non-flagellar appendages, termed fimbriae are widespread among fungi. Fungal fimbriae range in diameter from 6-10 nm and exhibit lengths of up to 30 ~m. Fungal fimbriae have been implicated in several functions: adhesion, conjugation and flocculation. A possible role of fimbriae in host-mycoparasite interactions was the focus of this study . Using electron microscopy, fimbriae were observed on the surfaces of Mortiere lla cande labrum, Mortie re lla pusi lla and Phascolomyces articulosus with diameter means of 9.1±0.4 nm, 9.4±0.5 nm and 8.6±0.6 nm, respectively, and lengths of up to 25 ~m. Fimbriae were not observed on the surface of the mycoparasite, Piptocephalis virginiana. Polyclonal antiserum (AU) prepared against the fimbrial protein of Ustilago violacea cross-reacted with 60 and 57 kDa M. candelabrum proteins. In addition, AU cross-reacted with 64 kDa proteins from both M. pusilla and P. articulosus. The proteins that cross-reacted with AU were electroeluted from polyacrylamide gels and were shown to subsequently form fibrils. The diameter means for the electroeluted fibrils were: for M. candelabrum 9.7±0.3 nm, M. pusilla 8.4±0.6 nm and P articulosus 9.2±0.5 nm. Finally, to ascertain the role of fimbriae in host-mycoparasite interactions, AU was incubated with P. virginiana and M. pusilla (mycoparasite/susceptible host) and with P. virginiana and P . articulosus (mycoparasite/ resistant host). It was observed that AU decreased significantly the level of contact between P. virginiana and M. pusilla and between P. virginiana and P. articulosus in comparison to prelmmune serum treatments. Thus, it was proposed that fimbriae might play recognition and attachment roles in early events of mycoparasitism.

A framework for understanding the factors that influence spectators' recall and recognition of embedded sponsorship stimuli

Now, more than ever, sponsors of athletic events demand to see evidence of a commercial return, such as enhanced brand awareness, for their investment of cash or non-cash resources (Lough et aI., 2000). The most common way to measure the impact of perimeter signage (Le., any billboard or sign that displays a company's brand name and/or logo and which surrounds the playing area) on spectators' awareness of event sponsors has been through the use of brand name recall and recognition tests (Shilbury & Berriman, 1996). Recall testing requires spectators to list all of the sponsors they can remember seeing at, for example, an athletic event, strictly from memory and without any help (Cuneen & Hannan, 1993). With recognition testing, spectators are required to identify sponsors from a prepared list which include "dummy" brand names (i.e., sponsors that are present in the list but which do not actually sponsor the event). In order to determine whether sponsors' brand awareness objectives are being met, it is important for sport and recreation marketers to understand what influences a spectator's ability to remember (Le., recall and/or recognize) the brand names of companies who advertise on perimeter signage. The purpose this study was to examine the factors that influence spectators' recall and recognition of embedded sponsorship stimuli (i.e., company brand names on perimeter signage surrounding the play area) at a Canadian University's men's basketball game and football game. These factors included the number of games spectators attended over the course of the season (i.e., repeated exposure to sponsorship stimuli), spectators' level of involvement with the event, and spectators' level of involvement with the advertisements (i.e., perimeter signage). This study also examined the differences between recall and recognition as a means of measuring spectators' awareness of sponsors, and attempted to determine if there are sport differences in spectators' recall and recognition of perimeter signage. Upon leaving the football stadium or gymnasium, spectators were approached, at random, by trained research assistants located at each exit and asked to complete a brief survey questionnaire. Respondents completed the survey on-site. A total of 358 completed surveys were collected from spectators who attended the football (N = 277) and basketball (N = 81) games. The data suggest that football and basketball respondents recognized more sponsors' brand names than they recalled. In addition, football respondents who were highly involved with the event (i.e., those individuals who viewed attending the events as fun, interesting and exciting) attended more games over the course of the season and had significantly higher brand name recognition of sponsors who advertised on perimeter signage than those individuals with low involvement with the athletic event. Football respondents who were highly involved with the sponsors' advertisements (i.e., those individuals who viewed sponsors' perimeter signage as appealing, valuable and important) had significantly higher brand name recall of event sponsors than those individuals with low involvement with these sponsors' advertisements. Repeated exposure to perimeter signage did not have a significant influence on football or basketball respondents' recall or recognition of sponsors. Finally, the data revealed that football respondents had significantly higher recall of sponsors' brand names than basketball respondents. Conversely, basketball respondents had significantly higher recognition of sponsors' brand names than did football respondents.

Advocating recognition and redistribution in poverty alleviation programs in Ghana : an examination of state and NGO programs and policies

Abstract This thesis argues that poverty alleviation strategies and programs carried out by the government and Non Governmental Organizations in Ghana provide affirmative solutions to poverty. This is because, these intervention strategies have been influenced by conventional discourses on poverty that fail to adequately address non-economic issues of poverty such as powerlessness, marginalization and tmder-representation. The study is carried out in a two-pronged manner; first, it analyses state policies and strategies, particularly the Ghana Poverty Reduction Strategy (GPRS), on poverty alleviation and compares these to NGO programs, implemented with funds and support from external donor organizations. Specifically, I focus on how NGOs and the governnlent of Ghana negotiate autonomy and financial dependency with their funding donor-partners and how these affect their policies and programs. Findings from this study reveal that while external influences dominate poverty alleviation policies and strategies, NGOs and the government of Ghana exercise varying degrees of agency in navigating these issues. In particular, NGOs have been able to adapt their programs to the changing needs of donor markets, and are also actively engaged in re-orienting poverty back to the political domain through advocacy campaigns. Overall, rural communities in Ghana depend on charitable NGOs for the provision of essential social services, while the Ghanaian government depends on international donor assistance for its development projects.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Decoding algorithms using side-effect machines

Bioinformatics applies computers to problems in molecular biology. Previous research has not addressed edit metric decoders. Decoders for quaternary edit metric codes are finding use in bioinformatics problems with applications to DNA. By using side effect machines we hope to be able to provide efficient decoding algorithms for this open problem. Two ideas for decoding algorithms are presented and examined. Both decoders use Side Effect Machines(SEMs) which are generalizations of finite state automata. Single Classifier Machines(SCMs) use a single side effect machine to classify all words within a code. Locking Side Effect Machines(LSEMs) use multiple side effect machines to create a tree structure of subclassification. The goal is to examine these techniques and provide new decoders for existing codes. Presented are ideas for best practices for the creation of these two types of new edit metric decoders.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

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.

Using genetic algorithms for the single allocation hub location problem

Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and uncapacitated variants of the SAHLP based on new chromosome representations and crossover operators are explored. The GAs is tested on two well-known sets of real-world problems with up to 200 nodes. The obtained results are very promising. For most of the test problems the GA obtains improved or best-known solutions and the computational time remains low. The proposed GAs can easily be extended to other variants of location problems arising in network design planning in transportation systems.

Behavioural and neural correlates of emotion recognition as a function of psychopathic personality traits

Psychopathy is associated with well-known characteristics such as a lack of empathy and impulsive behaviour, but it has also been associated with impaired recognition of emotional facial expressions. The use of event-related potentials (ERPs) to examine this phenomenon could shed light on the specific time course and neural activation associated with emotion recognition processes as they relate to psychopathic traits. In the current study we examined the PI , N170, and vertex positive potential (VPP) ERP components and behavioural performance with respect to scores on the Self-Report Psychopathy (SRP-III) questionnaire. Thirty undergraduates completed two tasks, the first of which required the recognition and categorization of affective face stimuli under varying presentation conditions. Happy, angry or fearful faces were presented under with attention directed to the mouth, nose or eye region and varied stimulus exposure duration (30, 75, or 150 ms). We found that behavioural performance to be unrelated to psychopathic personality traits in all conditions, but there was a trend for the Nl70 to peak later in response to fearful and happy facial expressions for individuals high in psychopathic traits. However, the amplitude of the VPP was significantly negatively associated with psychopathic traits, but only in response to stimuli presented under a nose-level fixation. Finally, psychopathic traits were found to be associated with longer N170 latencies in response to stimuli presented under the 30 ms exposure duration. In the second task, participants were required to inhibit processing of irrelevant affective and scrambled face distractors while categorizing unrelated word stimuli as living or nonliving. Psychopathic traits were hypothesized to be positively associated with behavioural performance, as it was proposed that individuals high in psychopathic traits would be less likely to automatically attend to task-irrelevant affective distractors, facilitating word categorization. Thus, decreased interference would be reflected in smaller N170 components, indicating less neural activity associated with processing of distractor faces. We found that overall performance decreased in the presence of angry and fearful distractor faces as psychopathic traits increased. In addition, the amplitude of the N170 decreased and the latency increased in response to affective distractor faces for individuals with higher levels of psychopathic traits. Although we failed to find the predicted behavioural deficit in emotion recognition in Task 1 and facilitation effect in Task 2, the findings of increased N170 and VPP latencies in response to emotional faces are consistent wi th the proposition that abnormal emotion recognition processes may in fact be inherent to psychopathy as a continuous personality trait.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.

Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem

Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origin-destination links are impractical. This work investigates the single allocation hub location problem, and proposes a genetic algorithm (GA) approach for it. The effectiveness of using a single-objective criterion measure for the problem is first explored. Next, a multi-objective GA employing various fitness evaluation strategies such as Pareto ranking, sum of ranks, and weighted sum strategies is presented. The effectiveness of the multi-objective GA is shown by comparison with an Integer Programming strategy, the only other multi-objective approach found in the literature for this problem. Lastly, two new crossover operators are proposed and an empirical study is done using small to large problem instances of the Civil Aeronautics Board (CAB) and Australian Post (AP) data sets.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.