More than ever before, two imperatives, ‘the right to know’ and ‘the need to keep secret’, find themselves in a contest for a position of primacy in the contemporary legal system. The need to keep secret is antipathetic to the right to know. The Canadian Charter of Human Rights and Freedoms has entrenched a person’s right to disclosure of both exculpatory and inculpatory material in possession of the prosecution. Moreover, the common law has placed the additional responsibility on the prosecution to inquire of third parties as to the existence and production of material relevant to the defence. Despite the entrenchment of the right to disclosure the demands by the state have steadily grown for more evidence to be withheld from defendants, parties to proceedings and the public in general. The applications for in camera or ex parte hearings are common place and frequently acceded to. This thesis seeks to examine the clash of the two imperatives from the Canadian perspective. By using a comparative analysis of other jurisdictions throughout the thesis, it examines the various legislative instruments and common law employed in the Canadian Courts in respect of ‘ordinary’ criminal trials as well as trials of suspected terrorists, specifically, in respect of disclosure and the ability to withhold material from other parties and refrain from the obligation to disclose. The thesis includes a full analysis of disclosure options, public interest immunity, informer privilege, special advocates and other regimes, and claims of privilege in the interests of national security. The thesis provides a number of detailed recommendations as to how Canada can better balance rights of accused against the public interest and the needs of those who enforce the law.. The recommendations call for legal reforms, some new institutions for better accountability and new internal standards for those engaged in the investigation of crimes and national security matters. / Thesis (Ph.D, Law) -- Queen's University, 2012-04-25 15:01:59.292

Thesis (M.M.A.S.)--School of Advanced Airpower Studies, 1995. / Subject: Cheap access to space. Cover page date: [1995]. Vita. Includes bibliographical references.

<div> <p>This dissertation examines long-run food security in Niger in an era of climate change and comprises three interlinked essays. The first essay investigates the socio-economic projections for Niger in the current climate change literature in a growth accounting framework and provides a critical assessment to evaluate global projections in the context of a low-income developing country. The second essay quantifies the combined and individual impacts of income, population growth, agricultural productivity, and climate change on food security outcomes by mid-century in rural and urban Niger. Finally, the third essay assesses three policy scenarios considering accelerated investments in agricultural research and dissemination (R&D), reductions in fertility rates, and regional market integration.</p> </div> <br>

The thesis analyzes security perception of Britain within the framework of European security integration. The time that is covered in the thesis is between 1945 and 2003. The thesis exam,ines the assumptions constructing British position and intends to reveal that each of the country in Europe has possessed its own perception of security and defense within this significant process, and that -one of whose position made a profound impact on further development of European security and defense policies. That is the position of Britain. This study, therefore, will try to reveal the position of Britain and her policies in terms of European efforts for having a common identity on security and defense.

Sans exécuter une application, est-il possible de prévoir quelle est la méthode cible d’un site d’appel ? Est-il possible de savoir quels sont les types et les valeurs qu’une expression peut contenir ? Est-il possible de déterminer de manière exhaustive l’ensemble de comportements qu’une application peut effectuer ? Dans les trois cas, la réponse est oui, à condition d’accepter une certaine approximation. Il existe une classe d’algorithmes − peu connus à l’extérieur du cercle académique − qui analysent et simulent un programme pour calculer de manière conservatrice l’ensemble des informations qui peuvent être véhiculées dans une expression.Dans cette thèse, nous présentons ces algorithmes appelés CFAs (acronyme de Control Flow Analysis), plus précisément l’algorithme multivariant k-l-CFA. Nous combinons l’algorithme k-l-CFA avec l’analyse de taches (taint analysis),qui consiste à suivre une donnée sensible dans le flot de contrôle, afin de déterminer si elle atteint un puits (un flot sortant du programme). Cet algorithme, en combinaison avec l’interprétation abstraite pour les valeurs, a pour objectif de calculer de manière aussi exhaustive que possible l’ensemble des comportements d’une application. L’un des problèmes de cette approche est le nombre élevé de faux-positifs, qui impose un post-traitement humain. Il est donc essentiel de pouvoir augmenter la précision de l’analyse en augmentant k.k-l-CFA est notoirement connu comme étant très combinatoire, sa complexité étant exponentielle dans la valeur de k. La première contribution de cette thèse est de concevoir un modèle et une implémentation la plus efficace possible, en séparant soigneusement les parties statiques et dynamiques de l’analyse, pour permettre le passage à l’échelle. La seconde contribution de cette thèse est de proposer une nouvelle variante de CFA basée sur k-l-CFA, et appelée *-CFA, qui consiste à faire du paramètre k une propriété de chaque variante, de façon à ne l’augmenter que dans les contextes qui le justifient.Afin d’évaluer l’efficacité de notre implémentation de k-l-CFA, nous avons effectué une comparaison avec le framework Wala. Ensuite, nous validons l’analyse de taches et la détection de comportements avec le Benchmark DroidBench. Enfin, nous présentons les apports de l’algorithme *-CFA par rapport aux algorithmes standards de CFA dans le contexte d’analyse de taches et de détection de comportements. / Without executing an application, is it possible to predict the target method of a call site? Is it possible to know the types and values that an expression can contain? Is it possible to determine exhaustively the set of behaviors that an application can perform? In all three cases, the answer is yes, as long as a certain approximation is accepted.There is a class of algorithms - little known outside of academia - that can simulate and analyze a program to compute conservatively all information that can be conveyed in an expression. In this thesis, we present these algorithms called CFAs (Control flow analysis), and more specifically the multivariant k-l-CFA algorithm.We combine k-l-CFA algorithm with taint analysis, which consists in following tainted sensitive data inthe control flow to determine if it reaches a sink (an outgoing flow of the program).This combination with the integration of abstract interpretation for the values, aims to identify asexhaustively as possible all behaviors performed by an application.The problem with this approach is the high number of false positives, which requiresa human post-processing treatment.It is therefore essential to increase the accuracy of the analysis by increasing k.k-l-CFA is notoriously known as having a high combinatorial complexity, which is exponential commensurately with the value of k.The first contribution of this thesis is to design a model and most efficient implementationpossible, carefully separating the static and dynamic parts of the analysis, to allow scalability.The second contribution of this thesis is to propose a new CFA variant based on k-l-CFA algorithm -called *-CFA - , which consists in keeping locally for each variant the parameter k, and increasing this parameter in the contexts which justifies it.To evaluate the effectiveness of our implementation of k-l-CFA, we make a comparison with the Wala framework.Then, we do the same with the DroidBench benchmark to validate out taint analysis and behavior detection. Finally , we present the contributions of *-CFA algorithm compared to standard CFA algorithms in the context of taint analysis and behavior detection.

No description available.