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.

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.

The time-course of lexical activation in Japanese morphographic word recognition: Evidence for a character-driven processing model

This lexical decision study with eye tracking of Japanese two-kanji-character words investigated the order in which a whole two-character word and its morphographic constituents are activated in the course of lexical access, the relative contributions of the left and the right characters in lexical decision, the depth to which semantic radicals are processed, and how nonlinguistic factors affect lexical processes. Mixed-effects regression analyses of response times and subgaze durations (i.e., first-pass fixation time spent on each of the two characters) revealed joint contributions of morphographic units at all levels of the linguistic structure with the magnitude and the direction of the lexical effects modulated by readers’ locus of attention in a left-to-right preferred processing path. During the early time frame, character effects were larger in magnitude and more robust than radical and whole-word effects, regardless of the font size and the type of nonwords. Extending previous radical-based and character-based models, we propose a task/decision-sensitive character-driven processing model with a level-skipping assumption: Connections from the feature level bypass the lower radical level and link up directly to the higher character level.

Characterizing Dynamic Optimization Benchmarks for the Comparison of Multi-Modal Tracking Algorithms

Population-based metaheuristics, such as particle swarm optimization (PSO), have been employed to solve many real-world optimization problems. Although it is of- ten sufficient to find a single solution to these problems, there does exist those cases where identifying multiple, diverse solutions can be beneficial or even required. Some of these problems are further complicated by a change in their objective function over time. This type of optimization is referred to as dynamic, multi-modal optimization. Algorithms which exploit multiple optima in a search space are identified as niching algorithms. Although numerous dynamic, niching algorithms have been developed, their performance is often measured solely on their ability to find a single, global optimum. Furthermore, the comparisons often use synthetic benchmarks whose landscape characteristics are generally limited and unknown. This thesis provides a landscape analysis of the dynamic benchmark functions commonly developed for multi-modal optimization. The benchmark analysis results reveal that the mechanisms responsible for dynamism in the current dynamic bench- marks do not significantly affect landscape features, thus suggesting a lack of representation for problems whose landscape features vary over time. This analysis is used in a comparison of current niching algorithms to identify the effects that specific landscape features have on niching performance. Two performance metrics are proposed to measure both the scalability and accuracy of the niching algorithms. The algorithm comparison results demonstrate the algorithms best suited for a variety of dynamic environments. This comparison also examines each of the algorithms in terms of their niching behaviours and analyzing the range and trade-off between scalability and accuracy when tuning the algorithms respective parameters. These results contribute to the understanding of current niching techniques as well as the problem features that ultimately dictate their success.

Community and the Recognition of the Other: A Levinasian Examination of The City, Inc. 1987-1992

This case study examines how The City, Inc.’s work within North and South Minneapolis, Minnesota neighborhoods from 1987 and 1992 was framed within a compilation of articles drawn from prominent Twin Cities’ daily newspapers. Positioned within a conceptual framework based on the ethical philosophy of Emmanuel Levinas, this study explores how the idea of community, as constructed and reinforced through organizational initiatives and local print media, impacts the everyday relationships of those within and between communities. Framed within a discourse analysis, Levinasian ethics considers what aspects of community discourse restrict and oppress the relation with the other. The study concludes by suggesting how the identified aspects of conditional belonging, finding the trace, and building community can be valuable in offering an alternative to assessment-style research by considering the relationship and responsibility of the one for the other.

Role of Phosphorylation of the Oxysterol Binding Protein (OSBP) in (PI(4)P) and Sterol-Containing Membrane Recognition and Binding

Studies have demonstrated that the oxysterol binding protein (OSBP) acts as a phosphatidylinositol phosphate (PIP)-sterol exchanger at membrane contact sites (MCS) of the endoplasmic reticulum (ER) and Golgi. OSBP is known to pick up phosphatidylinositol-4-phosphate (PI(4)P) from the ER, transfer it to the trans-Golgi in exchange for a cholesterol molecule that is then transferred from the trans-Golgi to the ER. Upon further examination of this pathway by Ridgway et al. (1), it appeared that phosphorylation of OSBP played a role in the localization of OSBP. The dephosphorylation state of OSBP was linked to Golgi localization and the depletion of cholesterol at the ER. To mimic the phosphorylated state of OSBP, the mutant OSBP-S5E was designed by Ridgway et al. (1). The lipid and sterol recognition by wt-OSBP and its phosphomimic mutant OSBP-S5E were investigated using immobilized lipid bilayers and dual polarization interferometry (DPI). DPI is a technique in which the protein binding affinity to immobilized lipid bilayers is measured and the binding behavior is examined through real time. Lipid bilayers containing 1,2-dioleoyl-sn-glycero-3-phosphocholine (DOPC) and varying concentrations of PI(4)Ps or sterols (cholesterol or 25-hydroxycholesterol) were immobilized on a silicon nitride chip. It was determined that wt-OSBP binds differently to PI(4)P-containing bilayers compared to OSBP-S5E. The binding behavior suggested that wt-OSBP extracts PI(4)P and the change in the binding behavior, in the case of OSBP-S5E, suggested that the phosphorylation of OSBP may prevent the recognition and/or extraction of PI(4)P. In the presence of sterols, the overall binding behavior of OSBP, regardless of phosphorylation state, was fairly similar. The maximum specific bound mass of OSBP to sterols did not differ as the concentration of sterols increased. However, comparing the maximum specific bound mass of OSBP to cholesterol with oxysterol (25-hydroxycholesterol), OSBP displayed nearly a 2-fold increase in bound mass. With the absence of the wt-OSBP-PI(4)P binding behavior, it can be speculated that the sterols were not extracted. In addition, the binding behavior of OSBP was further tested using a fluorescence based binding assay. Using 22-(N-(7-nitrobenz-2-oxa-1,3-diazol-4-yl)amino)-23,24-bisnor-5-cholen-3β-ol (22-NBD cholesterol), wt-OSBP a one site binding dissociation constant Kd, of 15 ± 1.4 nM was determined. OSBP-S5E did not bind to 22-NBD cholesterol and Kd value was not obtained.

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.

A Scalability Study and New Algorithms for Large-Scale Many-Objective Optimization

Many real-world optimization problems contain multiple (often conflicting) goals to be optimized concurrently, commonly referred to as multi-objective problems (MOPs). Over the past few decades, a plethora of multi-objective algorithms have been proposed, often tested on MOPs possessing two or three objectives. Unfortunately, when tasked with solving MOPs with four or more objectives, referred to as many-objective problems (MaOPs), a large majority of optimizers experience significant performance degradation. The downfall of these optimizers is that simultaneously maintaining a well-spread set of solutions along with appropriate selection pressure to converge becomes difficult as the number of objectives increase. This difficulty is further compounded for large-scale MaOPs, i.e., MaOPs possessing large amounts of decision variables. In this thesis, we explore the challenges of many-objective optimization and propose three new promising algorithms designed to efficiently solve MaOPs. Experimental results demonstrate the proposed optimizers to perform very well, often outperforming state-of-the-art many-objective algorithms.