Individual differences in risk-taking and associated characteristics : a test of specificity in executive functions /

Multiple measures have been devised by clinicians and theorists from many different backgrounds for the purpose of assessing the influence of the frontal lobes on behaviour. Some utilize self-report measures to investigate behavioural characteristics such as risktaking, sensation seeking, impulsivity, and sensitivity to reward and punishment in an attempt to understand complex human decision making. Others rely more on neuroimaging and electrophysiological investigation involving experimental tasks thought to demonstrate executive functions in action, while other researchers prefer to study clinical populations with selective damage. Neuropsychological models of frontal lobe functioning have led to a greater appreciation of the dissociations among various aspects of prefrontal cortex function. This thesis involves (1) an examination of various psychometric and experimental indices of executive functions for coherence as one would predict on the basis of highly developed neurophysiological models of prefrontal function, particularly those aspects of executive function that involve predominantly cognitive abilities versus processes characterized by affect regulation; and (2) investigation of the relations between risk-taking, attentional abilties and their associated characteristics using a neurophysiological model of prefrontal functions addressed in (1). Late adolescence is a stage in which the prefrontal cortices undergo intensive structural and functional maturational changes; this period also involves increases in levels of risky and sensation driven behaviours, as well as a hypersensitivity to reward and a reduction in inhibition. Consequently, late adolescence spears to represent an ideal developmental period in which to examine these decision-making behaviours due to the maximum variability of behavioural characteristics of interest. Participants were 45 male undergraduate 18- to 19-year olds, who completed a battery of measures that included self-report, experimental and behavioural measures designed to assess particular aspects of prefrontal and executive functioning. As predicted, factor analysis supported the grouping of executive process by type (either primarily cognitive or affective), conforming to the orbitofrontal versus dorsolateral typology; risk-taking and associated characteristics were associated more with the orbitofrontal than the dorsolateral factor, whereas attentional and planning abilities tended to correlate more strongly with the dorsolateral factor. Results are discussed in light of future assessment, investigation and understanding of complex human decision-making and executive functions. Implications, applications and suggestions for future research are also proposed.

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.

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.

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.

Prime Rational Functions and Integral Polynomials

Let f(x) be a complex rational function. In this work, we study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we derive some conditions for the case of complex polynomials. We consider also the divisibility of integral polynomials, and we present a generalization of a theorem of Nieto. We show that if f(x) and g(x) are integral polynomials such that the content of g divides the content of f and g(n) divides f(n) for an integer n whose absolute value is larger than a certain bound, then g(x) divides f(x) in Z[x]. In addition, given an integral polynomial f(x), we provide a method to determine if f is irreducible over Z, and if not, find one of its divisors in Z[x].

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.

(A) Photoregulation of DNA Functions by Cyclic Azobenzene-tethered Oligonucleotides (B) Site-specific Fluorescent Labeling of DNA using Inverse Electron Demand Diels-Alder Reaction between trans-Cyclooctene Derivatives and BODIPY-Tetrazine Adducts

(A) Most azobenzene-based photoswitches require UV light for photoisomerization, which limit their applications in biological systems due to possible photodamage. Cyclic azobenzene derivatives, on the other hand, can undergo cis-trans isomerization when exposed to visible light. A shortened synthetic scheme was developed for the preparation of a building block containing cyclic azobenzene and D-threoninol (cAB-Thr). trans-Cyclic azobenzene was found to thermally isomerize back to the cis-form in a temperature-dependent manner. cAB-Thr was transformed into the corresponding phosphoramidite and subsequently incorporated into oligonucleotides by solid phase synthesis. Melting temperature measurement suggested that incorporation of cis-cAB into oligonucleotides destabilizes DNA duplexes, these findings corroborate with circular dichroism measurement. Finally, Fluorescent Energy Resonance Transfer experiments indicated that trans-cAB can be accommodated in DNA duplexes. (B) Inverse Electron Demand Diels-Alder reactions (IEDDA) between trans-olefins and tetrazines provide a powerful alternative to existing ligation chemistries due to its fast reaction rate, bioorthogonality and mutual orthogonality with other click reactions. In this project, an attempt was pursued to synthesize trans-cyclooctene building blocks for oligonucleotide labeling by reacting with BODIPY-tetrazine. Rel-(1R-4E-pR)-cyclooct-4-enol and rel-(1R,8S,9S,4E)-Bicyclo[6.1.0]non-4-ene-9-ylmethanol were synthesized and then transformed into the corresponding propargyl ether. Subsequent Sonogashira reactions between these propargylated compounds with DMT-protected 5-iododeoxyuridine failed to give the desired products. Finally a methodology was pursued for the synthesis of BODIPY-tetrazine conjugates that will be used in future IEDDA reactions with trans-cyclooctene modified oligonucleotides.

Rationalizability of Choice Functions on General Domains without Full Transitivity

The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationships between the different notions of rationalizability involving, for example, the transitivity, quasi-transitivity, or acyclicity of the rationalizing relation. Furthermore, we discuss sufficient conditions and necessary conditions for rational choice on arbitrary domains. Transitive, quasi-transitive, and acyclical rationalizability are fully characterized for domains that contain all singletons and all two-element subsets of the universal set.

Functional Forms and Educational Production Functions

Different Functional Forms Are Proposed and Applied in the Context of Educational Production Functions. Three Different Specifications - the Linerar, Logit and Inverse Power Transformation (Ipt) - Are Used to Explain First Grade Students' Results to a Mathematics Achievement Test. with Ipt Identified As the Best Functional Form to Explain the Data, the Assumption of Differential Impact of Explanatory Variables on Achievement Following the Status of the Student As a Low Or High Achiever Is Retained. Policy Implications of Such Result in Terms of School Interventions Are Discussed in the Paper.

Efficient Strategy-Proof Allocation Functions in Linear Production Economies

In a linear production model, we characterize the class of efficient and strategy-proof allocation functions, and the class of efficient and coalition strategy-proof allocation functions. In the former class, requiring equal treatment of equals allows us to identify a unique allocation function. This function is also the unique member of the latter class which satisfies uniform treatment of uniforms.

Infinite-Horizon Choice Functions

We analyze infinite-horizon choice functions within the setting of a simple linear technology. Time consistency and efficiency are characterized by stationary consumption and inheritance functions, as well as a transversality condition. In addition, we consider the equity axioms Suppes-Sen, Pigou-Dalton, and resource monotonicity. We show that Suppes-Sen and Pigou-Dalton imply that the consumption and inheritance functions are monotone with respect to time—thus justifying sustainability—while resource monotonicity implies that the consumption and inheritance functions are monotone with respect to the resource. Examples illustrate the characterization results.

Self-Selective Social Choice Functions

It is not uncommon that a society facing a choice problem has also to choose the choice rule itself. In such situation voters’ preferences on alternatives induce preferences over the voting rules. Such a setting immediately gives rise to a natural question concerning consistency between these two levels of choice. If a choice rule employed to resolve the society’s original choice problem does not choose itself when it is also used in choosing the choice rule, then this phenomenon can be regarded as inconsistency of this choice rule as it rejects itself according to its own rationale. Koray (2000) proved that the only neutral, unanimous universally self-selective social choice functions are the dictatorial ones. Here we in troduce to our society a constitution, which rules out inefficient social choice rules. When inefficient social choice rules become unavailable for comparison, the property of self-selectivity becomes weaker and we show that some non-trivial self-selective social choice functions do exist. Under certain assumptions on the constitution we describe all of them.