Canada/U.S. border crossing: facilitation and constraint

Abstract The aim of this research project is to draw on accounts of experiences ofborder crossing and regulation at the Canada/U.S. border at Niagara in order to illuminate the dynamics of differentiation and inequality at this site. The research is informed by claims that the world is turning into a global village due to transnational flows oftechnology, infonnation, capital and people. Much of the available literature on globalization shows that while the transfer of technology, information, and capital are enhanced, the transnational movement of people is both facilitated and constrained in complex and unequal ways. In this project, the workings of facilitation and constraint were explored through an analysis often interviews with people who had spent a substantial portion oftheir childhood (e.g. 5 years) in a Canadian border community. The interviewees were at the time ofthe research between the ages of 19 and 25. Because most ofthe respondents were 'white' Canadians of working to upper middle class status, my focus was to explore how 'whiteness' as privilege may translate into enhanced movement across borders and how 'white' people may internalize and enjoy this privilege but may often deny its reality. I was also interested in how inequality is perceived, understood, and legitimated by these relatively privileged people. My analysis ofthe ten accounts ofborder crossing and regulation suggests that differentially situated people experience border crossing differently. An important finding is that while relatively privileged border crossers perceived and often problernatized differential treatment based on external factors such as physical appearance, and especially race, most did not challenge such treatment but rather saw it as acceptable. These findings are located within newer literature that addresses the increasing securitization ofborders and migration in western societies.

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.

Rhapsodes of social science : Herodotus' performance of politeic inquiry

Herodotus' logos represents many examples ofthe relationship between political and paradigmatic authority, and the synthesis ofthese examples in a community characterized by free and equal speech. Herodotus' walkabout narrator sets forth an inquiry into knowledge-seeking he extends the isegoria principle from Athenian politics to the broader world. The History demonstrates (a) various modes of constructing meaning, (b) interacting notions ofhow people have lived and living questions as to how we ought to live, and (c) an investigation ofthe nature and limits ofhuman knowledge. Representing diverse wisdom, publicly and privately discovered and presented, Herodotus sets forth Solon's wise advice and law-making, the capital punishment of the learned Anacharsis, the investigative outrages of Cambyses and Psammetichus' more pious experiments. Their stories challenge and complement their communities' characters - the relative constraint under which the Egyptians and Persians make their investigations, the Scythians' qualified openness and the relative fearlessness and freedom in which the Greeks set forth their inquiries. Setting forth the investigator-storykeeper as a poetic historian, Herodotus shows that history as poetry thwarts natural decay by allowing custom to be reformed in an open milieu, and thus win through and survive. Despite the potential dangers that openness shares with tyranny, Herodotus' inquiry sets up a contest ofworld-views in which it is mutability that openness affords a community that ensures its survival.

Sexual selections in the northern fall field cricket, Gryllus pennsylvanicus: a manipulation of the adult sex ratio

The operational sex ratio has long been considered an important constraint on the structure of mating systems. The effects of an experimentally manipulated sex ratio on mating behavior and selection were investigated in a polygynous species, Gryllus pennsylvanicus, where the potential exists for spatial/temporal fluctuations in sex ratio of field populations. Four different sex ratios (males: females, 5:0, 5:2, 5:5, 5:10) were investigated. Observations were conducted in late summer over two field seasons, from 2400 h , to 1000 h EST. Several male characters thought to be associated with male reproduc.tive success were studied: calling duration, searching distance, weight, fighting behavior, courtship frequency, and mating success. Variance in male mating success was used as the indicator for the opportunity for sexual selection. Total selection was estimated as the univariate regression coefficient between relative fitness and the character of interest, while direct selection was estimated as standardized partial regression coefficients generated from a multiple regression of relative fitness on each character. The opportunity for sexual selection was highest at 5:2 and lowest at 5:10. The frequency of fighting behavior was highest at 5:2 and 5:5. Fighting ability (% wins) was determined to be an important correlate of male body weight. Direct selection for increased male body weight was detected at 5:2, while total selection for body weight was seen at 5:5. Selection on male body weight was not detected at 5: 10. Calling duration decreased as sex ratio became more female-biased. Total and direct selection were detected for increased calling at 5:2, only total selection for calling was seen at 5:5, whereas direct selection against calling was detected at 5: 10. Searching distance also decreased as sex ratio became more female-biased, however no form of selection was detected for searching at any of the sex ratios. Data are discussed in terms of sexual selection on male reproductive tactics, the mating system and maintenance of genetic variation in male reproductive behavior.

Bounds on edit metric codes with combinatorial DNA constraints

The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.

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.