<p> Kimberlite diatremes from a single genetic source were examined. Macrocryst and groundmass constituents were identified, as well as their alteration products. It was hypothesized that carbon dioxide and water vapour were present at the time of formation. Limestone inclusions and peridotite xenoliths were examined, as well as fabrics within the xenoliths. It was concluded that water is present in the upper mantle. Ilmenite nodules were determined to be phenocrysts, as opposed to xenocrysts. A paragenetic sequence for the kimberlite was resolved. Ilmenite was classified as the best indicator mineral for exploration purposes.</p> / Thesis / Bachelor of Science (BSc)

Abstract Not Provided. / Thesis / Bachelor of Arts (BA)

This thesis focuses on the humanitarian implications of economic sanctions. States are increasingly using sanctions as a foreign policy tool, but the ramifications for the citizens of the country have yet to be analyzed in depth. Although sanctions are an extremely powerful foreign policy tool, the humanitarian implications are too drastic. There are two main outcomes of sanctions that states seek: the pressure of the sanctions forces the government to change their policy or the humanitarian implications force the citizens to revolt against the government. These outcomes rarely occur as we can see clearly in cases such as Cuba or North Korea. This thesis will use three case studies: Cuba, Iraq, and Iran. The three cases differ in the type of sanctions which in return varies the degree of humanitarian implications. The types of sanctions are unilateral, multilateral, and universal. The four sectors of humanitarian implications are economic growth, health and drugs, food and nutrition, and education. Cuba has sustained unilateral economic sanctions imposed by the United States for years and the sanctions have not made a change in the attitudes of the government. Instead the sanctions have created humanitarian implications in Cuba. Because the government refuses to allow any dissent from citizens, the sanctions will neither change the policy of the government nor pressure citizens to revolt against the government. Therefore the sanctions in Cuba have been quite ineffective and have solely had the effect of hurting the ordinary citizens of Cuba. The second case study is of Iraq. Iraq is the most publicized case of humanitarian implications of universal sanctions. The infamous interview with Madeleine Albright stating that the half a million children that died in Iraq because of the sanctions and war were 'worth it.' Although this statement was later clarified, it shed light on the dramatic implications of the sanctions. The sanctions hurt almost every sector of Iraq and left the state in shambles. The last case study is on Iran. The US has imposed sanctions on Iran for years, but the UN community got involved after the Iranian nuclear program. These sanctions are for the most part multilateral. The sanctions against Iran have also had significant humanitarian implications, specifically economic growth and the health and drugs sector. It is unknown if the new government of Iran will prompt a change in the sanctions imposed by the international community. All three case studies will present a strong correlation between the economic sanctions imposed and the humanitarian implications. The three states that are used as case studies were showing progress in at least one of the humanitarian sectors prior to the imposition of sanctions. We can see decay in economic growth, health and drugs, and food and nutrition most prevalently.

<p> Given a point p and d + 1 sets (i.e., colours) of points in dimension d, the Colourful Feasibility Problem is to decide whether there are d + 1 points of different colours containing p in their convex hull; and if yes, find such a point set. The monochrome version of this problem, expressing p as a linear combination of d + 1 points in a set S, can be solved using traditional linear optimization algorithms. The Colourful Feasibility Problem was presented by Bárány and Onn in 1997, and it is still not known if a polynomial-time algorithm exists. The case where we have d colours in dimension d and no restriction on the size of the sets has been shown to be strongly NP-complete through a reduction of 3-SAT. We define the core of a configuration to be the intersection of the convex hulls of each colour. We start from the important subcase that we call Colourful Core Feasibility Problem where we have d + 1 points of each colour, and p in the core. By Bárány's 1982 Colourful Caratheodory Theorem, a solution is guaranteed to exist, and the problem is to exhibit one. This problem is described by Bárány and Onn as "an outstanding problem on the border line between tractable and intractable problems". Besides applications to combinatorics, The Colourful Feasibility Problem models a situation where we want to select a set of points that is both diverse and representative.</p> <p> While we have not found out whether the Colourful Core Feasibility Problem can be solved in polynomial time, our contributions are on both the theoretical and practical performance of algorithms to solve the Colourful Feasibility Problem. The algorithms proposed by Bárány and Onn are essentially geometric, and the complexity guarantees depend crucially on having p inside the core. We consider modifications of these algorithms which update multiple colours at each stage, as well a greedy heuristic where we choose the adjacent simplex of maximum volume in each iteration and a random sampling approach. Our test suite includes unstructured random problems, ill-conditioned problems, problems with a restricted number of solutions and infeasible problems. We conclude that the most robust and nearly fastest algorithm for the Colourful Core Feasibility Problem is the multi-update variant which yields substantial gains over the original ones. Alternative approaches based on nondefinite quadratic optimization problem and positive semidefinite relaxation, and a combinatorial algorithm not depending on having p in the core are also introduced. Finally, we give the first upper bound for the minimal number of colourful simplices containing a core point and the first improvement of the lower bound since Bárány's result in 1982.</p> / Thesis / Master of Science (MSc)

Yes / People experience dementia in different ways, not just in terms of the type and severity of symptoms, but also in terms of how they react to and manage living with dementia. Increasingly, people with dementia are expressing a desire to get on with their everyday lives. They want to avoid being defined solely in relation to dementia and to continue to be considered as valued members of society. This is particularly important as the term dementia often has negative connotations. It is widely considered as a stigma. Neurological impairment may interfere with people’s ability to get on with their lives, as may differences in coping skills, financial resources, the emotional and psychological impact of dementia, and access to timely and good quality support. Reactions of relatives, friends and fellow citizens are also important, as well as society’s response to dementia. This was highlighted by Kitwood in the 1990s when he outlined what came to be known as the biopsychosocial model of dementia . There are also differences at the level of society, reflected in practices, attitudes and structures. These may, on the surface, seem fair or neutral (i.e. “that’s just the way it is”). In many cases, however, they reflect a lack of consideration and failure to act in a responsible, ethical and even legal way towards people with dementia... In this report, we focus on the possible implications for ethics, policy and practice of raising awareness about the potential of framing dementia as a potential disability.

Static learning in the form of logic implications captures Boolean relationships between various gates in a circuit. In the past, logic implications have been applied in several areas of electronic design automation (EDA) including: test-pattern-generation, logic and fault simulation, fault diagnosis, logic optimization, etc. While logic implications have assisted in solving several EDA problems, their usefulness has not been fully explored. We believe that logic implications have not been carefully analyzed in the past, and this lack of thorough investigation has limited their applicability in solving hard EDA problems. In this dissertation, we offer deeper insights into the Boolean relationships exhibited in a circuit, and present techniques to extract their full potential in solving two hard problems in test and verification: (1) Efficient identification of sequentially untestable stuck-at faults, and (2) Equivalence checking of sequential circuits. Additionally, for the dissertation, we define a new concept called multi-cycle path delay faults (M-pdf) for latch based designs with multiple clock domains, and propose an implications-based methodology for the identification of untestable M-pdfs for such designs. One of the main bottlenecks in the efficiency of test-pattern-generation (TPG) is the presence of untestable faults in a design. State-of-the-art automatic test pattern generators (ATPG) spend a lot of effort (in both time and memory) targeting untestable faults before aborting on such faults, or, eventually identifying these faults as untestable (if given enough computational resources). In either case, TPG is considerably slowed down by the presence of untestable faults. Thus, efficient methods to identify untestable faults are desired. In this dissertation, we discuss a number of solutions that we have developed for the purpose of untestable fault identification. The techniques that we propose are fault-independent and explore properties associated with logic implications to derive conclusions about untestable faults. Experimental results for benchmark circuits show that our techniques achieve a significant increase in the number of untestable faults identified, at low memory and computational overhead. The second related problem that we address in this proposal is that of determining the equivalence of sequential circuits. During the design phase, hardware goes through several stages of optimizations (for area, speed, power, etc). Determining the functional correctness of the design after each optimization step by means of exhaustive simulation can be prohibitively expensive. An alternative to prove functional correctness of the optimized design is to determine the design's functional equivalence w.r.t. some golden model which is known to be functionally correct. Efficient techniques to perform this process, known as equivalence checking, have been investigated in the research community. However, equivalence checking of sequential circuits still remains a challenging problem. In an attempt to solve this problem, we propose a Boolean SAT (satisfiability) based framework that utilizes logic implications for the purpose of sequential equivalence checking. Finally, we define a new concept called multi-cycle path-delay faults (M-pdfs). Traditionally, path delay faults have been analyzed for flip-flop based designs over the boundary of a single clock cycle. However, path delay faults may span multiple clock cycles, and a technique is desired to model and analyze such path delay faults. This is especially essential for latch based designs with multiple clock domains, because the problem of identifying untestable faults is more complex in such design environments. In this dissertation, we propose a three-step methodology to identify untestable M-pdfs in latch-based designs with multiple clocks using logic implications. / Ph. D.

Cette thèse traite du problème du calcul des implications, c'est-à-dire des régularités de la forme "quand il y a A, il y a B", dans des ensembles de données composés d'objets décrits par des attributs. Calculer toutes les implications peut être vu comme l'énumération d'ensembles d'attributs appelés pseudo-intensions. Nous savons que ces pseudo-intensions ne peuvent pas être énumérées avec un délai polynomial dans l'ordre lectique mais aucun résultat n'existe, à l'heure actuelle, pour d'autres ordres. Bien que certains algorithmes existants n'énumèrent pas forcément dans l'ordre lectique, aucun n'a un délai polynomial. Cette absence de connaissances sur les autres ordres autorise toujours l'existence d'un algorithme avec délai polynomial et le trouver serait une avancée utile et significative. Malheureusement, les algorithmes actuels ne nous autorisent pas à choisir l'ordre d'énumération, ce qui complique considérablement et inutilement l'étude de l'influence de l'ordre dans la complexité. C'est donc pour aller vers une meilleure compréhension du rôle de l'ordre dans l'énumération des pseudo-intensions que nous proposons un algorithme qui peut réaliser cette énumération dans n'importe quel ordre qui respecte la relation d'inclusion. Dans la première partie, nous expliquons et étudions les propriétés de notre algorithme. Comme pour tout algorithme d'énumération, le principal problème est de construire tous les ensembles une seule fois. Nous proposons pour cela d'utiliser un arbre couvrant, lui-même basé sur l'ordre lectique, afin d'éviter de multiples constructions d'un même ensemble. L'utilisation de cet arbre couvrant au lieu de l'ordre lectique classique augmente la complexité spatiale mais offre plus de flexibilité dans l'ordre d'énumération. Nous montrons que, comparé à l'algorithme Next Closure bien connu, le nôtre effectue moins de fermetures logiques sur des contextes peu denses et plus de fermetures quand le nombre moyen d'attributs par objet dépasse 30% du total. La complexité spatiale de l'algorithme est aussi étudiée de façon empirique et il est montré que des ordres différents se comportent différemment, l'ordre lectique étant le plus efficace. Nous postulons que l'efficacité d'un ordre est fonction de sa distance à l'ordre utilisé dans le test de canonicité. Dans la seconde partie, nous nous intéressons au calcul des implications dans un cadre plus complexe : les données relationnelles. Dans ces contextes, les objets sont représentés à la fois par des attributs et par des relations avec d'autres objets. Le besoin de représenter les informations sur les relations produit une augmente exponentielle du nombre d'attributs, ce qui rend les algorithmes classiques rapidement inutilisables. Nous proposons une modification de notre algorithme qui énumère les pseudo-intensions de contextes dans lesquels l'information relationnelle est représentée par des attributs. Nous fournissons une étude rapide du type d'information relationnelle qui peut être prise en compte. Nous utilisons l'exemple des logiques de description comme cadre pour l'expression des données relationnelles. Dans la troisième partie, nous étendons notre travail au domaine plus général des règles d'association. Les règles d'association sont des régularités de la forme ``quand il y a A, il y a B avec une certitude de x%''. Ainsi, les implications sont des règles d'association certaines. Notre algorithme calcule déjà une base pour les implications et nous proposons une très simple modification et montrons qu'elle lui permet de calculer la base de Luxenburger en plus de la base de Duquenne-Guigues. Cela permet à notre algorithme de calculer une base de cardinalité minimale pour les règles d'association. / This thesis deals with the problem of the computation of implications, which are regularities of the form "when there is A there is B", in datasets composed of objects described by attributes. Computing all the implications can be viewed as the enumeration of sets of attributes called pseudo-intents. It is known that pseudointents cannot be enumerated with a polynomial delay in the lectic order but no such result exists for other orders. While some current algorithms do not enumerate in the lectic order, none of them have a polynomial delay. The lack of knowledge on other orders leaves the possibility for a polynomial-delay algorithm to exist and inding it would be an important and useful step. Unfortunately, current algorithms do not allow us to choose the order so studying its inuence on the complexity of the enumeration is harder than necessary. We thus take a first step towards a better understanding of the role of the order in the enumeration of pseudo-intents by providing an algorithm that can enumerate pseudo-intents in any order that respects the inclusion relation.In the first part, we explain and study the properties of our algorithm. As with all enumeration algorithms, the first problem is to construct all the sets only once.We propose to use a spanning tree, itself based on the lectic order, to avoid multiple constructions of a same set. The use of this spanning tree instead of the classic lectic order increases the space complexity but others much more exibility in the enumeration order. We show that, compared to the well-known Next Closure algorithm, ours performs less logical closures on sparse contexts and more once the average number of attributes per object exceeds 30%. The space complexity of the algorithm is also empirically studied and we show that different orders behave differently with the lectic order being the most efficient. We postulate that the efficiency of an order is function of its distance to the order used in the canonicity test. In the second part, we take an interest in the computation of implications in a more complex setting : relational data. In these contexts, objects are represented by both attributes and binary relations with other objects. The need to represent relation information causes an exponential increase in the number of attributes so naive algorithms become unusable extremely fast. We propose a modification of our algorithm that enumerates the pseudo-intents of contexts in which relational information is represented by attributes. A quick study of the type of relational information that can be considered is provided. We use the example of description logics as a framework for expressing relational data. In the third part, we extend our work to the more general domain of association rules. Association rules are regularities of the form \when there is A there is B with x% certainty" so implications are association rules with 100% certainty. Our algorithm already computes a basis for implications so we propose a very simple modification and demonstrate that it can compute the Luxenburger basis of a context along with the Duquenne-Guigues basis. This effectively allows our algorithm to compute a basis for association rules that is of minimal cardinality.

Childhood bullying affects over 25% of today’s youth and causes up to 160,000 missed school days per year. Bullying causes short and long term adverse effects to both mental and physical health. Many organizations encourage healthcare providers to take an active role in bullying prevention. However, there has been little research into the role of primary healthcare providers regarding childhood bullying and the effectiveness of different approaches to screening and management. Therefore the purposes of this dissertation were to a) explore childhood bullying and the role of the healthcare provider in bullying prevention, b) develop and evaluate the psychometric properties of Hensley’s Healthcare Provider’s Practices, Attitudes, Self-confidence, & Knowledge Regarding Bullying Questionnaire. Pediatric healthcare providers were asked to participate in this study if they conducted well-child exams on a weekly basis. Information on the provider’s current bullying assessment practices, attitudes, self-confidence, and knowledge regarding bullying was gathered. Results indicated that approximately one-half (46.6%, n=55) of the healthcare providers reported assessing their patients for bullying behaviors during well-child exams. The strongest predictor of positively assessing for bullying was attitudes, recording an odds ratio of 1.24. This indicated for every one-unit increase in attitudes score, the odds of assessing for bullying will be 24% higher. The odds ratio of self-efficacy or self-confidence was 1.18, indicating that for every one-unit increase in self-efficacy score, the odds of assessing for bullying will be 18% higher.

The customer service within the United States Coast Guard Naval Engineering department has increased significantly in the past decade. Many areas of the naval engineering departments have adopted a customer service policy in part or in whole. However, the naval engineering community is persistently working to reduce costs and operational liabilities generated through their support practices. Financial and operational liabilities have also grown in the past decade, and the United States Coast Guard Naval Engineering department has failed to aggressively address this issue until recently. This leaves naval engineering communities who use their own version of customer service policies to adopt a standard that is compliant toward the Coast Guard’s Naval Engineering force management goals. This paper looks at the history of Coast Guard Naval Engineering customer service issues, how the engineering community has managed the issues in the past and how improvements can be made. / text

One of the most visible indicators of the increasing global integration of the world economy over the past decade or so has been the phenomenal growth of Foreign Direct Investment (FDI) flows and expansion of cross-border activities of multinational enterprises. FDI inflows are considered as channels of entrepreneurship, technology, management skills, and resources that are scarce in developing countries and Southern Africa in particular. Recent developments in growth theory highlight the importance of improvements in technology, efficiency and productivity in simulating growth. In this regard, FDI’s contribution to growth comes through its role as a conduit for transferring its advanced technology from the industrialized to the developing economies and as such FDI inflows could help in the industrialization of the host countries. For instance, Findlay (1978) postulates that FDIs increases the rate of technical progress in the host country through a “contagion” effect from the more advanced technology and management practices used by foreign firms. Since FDI is said to be the most stable source of private capital for developing and transition economies, attracting FDI is at the top of the agenda of such economies around the world as they aim to reduce poverty that is deep and widespread. The paper will look at FDI and its contributions; discuss the relationship between FDI and economic growth; explore the determinants of FDI and economic growth; consider the implications of FDI to economic growth and poverty alleviation; examine Taiwan’s experience when its development was closer to current levels in Africa and Southern Africa in particular; and explore how the Southern African region can attain economic growth through FDI and alleviate its deep and widespread poverty. In trying to assess the extent to which FDI contributes to construction of production facilities, infusion of innovative technologies, management strategies, workforce practices, new employment, and skill transfer, the paper seeks to shed light on appropriate policies to pursue in order to encourage high volumes of FDI and their likely implications for economic growth and poverty alleviation. While economic growth is not synonymous with economic development, it is at least necessary. Provided that mechanisms exist to facilitate some trickle-down of the benefits of economic growth to the impoverished, economic growth can aid in poverty reduction. The most important mechanism by which trickle-down occurs is via employment-creating economic growth. In this way, it is possible that, if FDI serves as a catalyst for economic growth, it will stimulate development and contribute to alleviating poverty (Lipsey, R., 2000). David Dollar (2001) states that Globalization has been a force for growth and poverty reduction in a diverse group of countries and defines globalization as the growing integration of economies and societies around the world as a result of flows of goods and services, capital, people, and ideas. He claims that integration accelerates development and reduces gaps between the developed and developing countries by raising productivity in the developing world. In this way globalization can be a powerful force for poverty reduction. FDI is one element that links the Southern part of Africa to the global economy and as a World Bank report (2001) shows that rapid economic growth and poverty reduction are positive aspects of globalization, the volume of FDI attracted will have an influence on whether the Southern Africa’s poor can benefit from the globalization of markets.