Report of the Committee appointed to inquire into the Present condition and distribution of the flags, standards and colors, which have been taken by the forces of the United States from their enemies, and whether it would be expedient to make any provision in relation to them.--

Adam Seybet, Chairman.

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.

The practical application of a meta-analysis of deinstitutionalization : adaptive behaviour outcomes and the piloting of a transitional questionnaire for adults with intellectual disabilities

This investigation examined the effects of de institutionalization on the adaptive behaviour and adjustment of adults with intellectual disabilities (ID). In study 1, a meta-analysis was conducted with 23 studies on deinstitutionalization adaptive behaviour outcomes. Deinstitutionalization was associated with modest improvements in adaptive behaviour however outcomes varied across adaptive behaviour domains and other substantive variables. Clinical and service implications of these results were explicated. Noting the trends from the meta-analysis, study 2 used this information in refining and piloting an Agency Transition Survey used to evaluate community transitions for persons with ID. Information derived from the survey was found to be valuable and adequate for the effective evaluation of transitional success. Potential applications of the survey and meta-analysis results were illustrated.

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.

The relation between video game violence and aggression

Experimental research has shown that playing violent video games produces higher levels of aggressive cognition, aggressive affect, physiological arousal, and aggressive behavior (in the short-term) than non-violent video games (see Anderson, Gentile & Buckley, 2007). However, there are two major limitations with these studies. First, the majority of experimental studies that have compared the effects of violent versus non-violent video games on aggression have failed to equate these games in terms of competitiveness, difficulty, and pace of action. Thus, although the common finding is that violent video games produce higher levels of aggression than nonviolent video games, other unmatched factors beyond the actual violent content may be responsible for the elevated levels of aggression. Second, previous experimental studies have tended to use a measure of aggression that may also measure competitiveness, leading to questions about whether violent video games are related to aggression or competitiveness. The present thesis addressed these two issues by fIrst equating a violent and non-violent video game on competitiveness, difficulty and pace of action in Experiment I , and then comparing the effect of each game on aggressive behavior using an unambiguous measure of aggressive behavior (i.e., the Hot Sauce Paradigm). We found that video game violence was not sufficient to elevate aggressive behavior compared to a non-violent video game. Practical implications and directions for future research are discussed.

Relation of temperament and authoritative parenting on subtypes of adolescent behaviour

Over the years, researchers have investigated direct, conditional, and meditational pathways of adolescent aggression in relation to both temperament and parenting behaviours. However, no study to date has considered these relations with respect to a measure of aggression differentiated by form (e.g., overt, relational) and function (e.g., proactive, reactive). The present study examined the differential association of adolescent temperament and authoritative parenting on four subtypes of aggression. Participants included mothers, fathers, and one adolescent (between the ages of 10-19) from 663 families, recruited through random digit dialing. Parents reported on their child's temperament and occurrence of aggressive behaviours in addition to the perception of their own authoritative parenting. Adolescents reported on their own temperament and aggressive behaviours as well as on both their mother and father's authoritative parenting. Multiple regression analyses confirmed predictions that some aspects of temperament and authoritative parenting provide motivation towards the engagement of different aggressive behaviours. For example, higher negative affect was related to reactive types of aggression, whereas a strong desire for novel or risky behaviours related to proactive aggression. However, differences in effortful control altered the trajectory for both relationships. Higher levels of self-regulation reduced the impact of negative affect on reactive-overt aggression. Greater self-regulation also reduced the impact of surgency on proactive-overt aggression when age was a factor. Structural equation modeling was then used to assess the process through which adolescents become more or less susceptible to impulsive behaviours. Although the issue ofbi-directionality cannot be ruled out, temperament characteristics were the proximal correlate for aggression subtypes as opposed to authoritative parenting dimensions. Effortful control was found to partially mediate the relation between parental acceptancelinvolvement and reactive-relational and reactive-overt aggression, suggesting that higher levels of warmth and support as perceived by the child related to increased levels of self-regulation and emotional control, which in tum lead to less reactive-relational and less reactive-overt types of aggression in adolescents. On the other hand, negative affect partially mediated the relation between parental psychological autonomy granting and these two subtypes of aggression, supporting predictions that higher levels of autonomy granting (perceived independence) related to lower levels of frustration, which in tum lead to less reactive-relational and reactive-overt aggression in adolescents. Both findings provide less evidence for the evocative person-environment correlation and more support for temperament being an open system shaped by experience and authoritative parenting dimensions. As one of the first known studies examining the differential association of authoritative parenting and temperament on aggression subtypes, this study demonstrates the role parents can play in shaping and altering their children's temperament and the effects it can have on aggressive behaviour.

Generating finite integral relation algebras

Relation algebras and categories of relations in particular have proven to be extremely useful as a fundamental tool in mathematics and computer science. Since relation algebras are Boolean algebras with some well-behaved operations, every such algebra provides an atom structure, i.e., a relational structure on its set of atoms. In the case of complete and atomic structure (e.g. finite algebras), the original algebra can be recovered from its atom structure by using the complex algebra construction. This gives a representation of relation algebras as the complex algebra of a certain relational structure. This property is of particular interest because storing the atom structure requires less space than the entire algebra. In this thesis I want to introduce and implement three structures representing atom structures of integral heterogeneous relation algebras, i.e., categorical versions of relation algebras. The first structure will simply embed a homogeneous atom structure of a relation algebra into the heterogeneous context. The second structure is obtained by splitting all symmetric idempotent relations. This new algebra is in almost all cases an heterogeneous structure having more objects than the original one. Finally, I will define two different union operations to combine two algebras into a single one.

Message from the President of the United States, in relation to the claim of Virginia, an account of interest paid by that State, on moneys borrowed for the payment of the militia thereof, for services rendered the United States

April 13, 1824. Printed by order of the Senate of the United States. At head of title: 18th congress, 1st session. [64]. Printed by Cales and Seaton

A report of the Secretary of State, in relation to individuals selected from American prisoners of war, and sent to Great Britain for trial, and also in relation to any orders for retaliation

Printed by Roger C. Weightman

Thoughts upon the conduct of our administration in relation both to Great Britain and France, more especially in reference to the late negotiation, concerning the attack on the Chesapeake

Printed at the Repertory Office

An Examination of Youth Perceptions and Understandings of their Experiences with Extrajudicial Sanctions in Relation to Key Principles of the YCJA

It is unclear how the principles of meaningful consequences, fair and proportionate accountability, and rehabilitation and reintegration under the Youth Criminal Justice Act (2003) are understood and experienced by youth participating in diversion from youth court. Interviews with 20 youth revealed that, from their understanding, extrajudicial sanctions were viewed as accomplishing the goals of meaningful consequences and fair and proportionate accountability relatively well, but less emphasis was placed on rehabilitation and reintegration. The findings suggest that there may be a need an examination of the spectrum of responses available to youth under the umbrella of Extrajudicial Sanctions and their ability to achieve the key principles of the legislation. Implications for both youth and policy are addressed.

Generating Relation Algebras for Qualitative Spatial Reasoning

Basic relationships between certain regions of space are formulated in natural language in everyday situations. For example, a customer specifies the outline of his future home to the architect by indicating which rooms should be close to each other. Qualitative spatial reasoning as an area of artificial intelligence tries to develop a theory of space based on similar notions. In formal ontology and in ontological computer science, mereotopology is a first-order theory, embodying mereological and topological concepts, of the relations among wholes, parts, parts of parts, and the boundaries between parts. We shall introduce abstract relation algebras and present their structural properties as well as their connection to algebras of binary relations. This will be followed by details of the expressiveness of algebras of relations for region based models. Mereotopology has been the main basis for most region based theories of space. Since its earliest inception many theories have been proposed for mereotopology in artificial intelligence among which Region Connection Calculus is most prominent. The expressiveness of the region connection calculus in relational logic is far greater than its original eight base relations might suggest. In the thesis we formulate ways to automatically generate representable relation algebras using spatial data based on region connection calculus. The generation of new algebras is a two pronged approach involving splitting of existing relations to form new algebras and refinement of such newly generated algebras. We present an implementation of a system for automating aforementioned steps and provide an effective and convenient interface to define new spatial relations and generate representable relational algebras.

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.