Democratizing the Criminal: Jury Nullification as Exercise of Sovereign Discretion over the Friend-Enemy Distinction

This dissertation examines jury nullification - the ability of American juries in particular criminal cases to ignore or override valid law to be applied to defendants by acquitting them in cases in which the facts are undisputed or clear - as an exercise of sovereignty over the friend-enemy distinction as those terms are defined by Carl Schmitt. It begins with a biography of Schmitt and a description of his concept of sovereignty as ultimate decisional power. It then discusses sovereignty in the American context, with particular attention to the principles of the Founding and the nature of the fictively constructed American people. It next applies Schmitt\u27s concept of decisional sovereignty to the American context, concluding that sovereignty in America is diffuse, and its exercise by particular governmental actors is to some degree cloaked, and that the sovereignty of the American people, while crucial to the founding moment, is largely latent in ordinary times. This application of Schmitt to sovereignty in America also demonstrates the deep tension between democratic popular sovereignty and rule-of-law liberalism. The dissertation then turns to Schmitt\u27s understanding of the distinction between friend and enemy as the central political axis, and argues that the criminal in the American context is functionally the enemy, if not the absolute enemy of the polity. It then discusses in detail the mechanics and history of jury nullification, ultimately concluding that jury nullification both operates at the crucial political moment at which enemies are generated (or not) through the application of criminal law to defendants, and is an act of popular sovereignty, intended by the Founders to help preserve a balance between democracy and liberalism by maintaining a central political role for the people

Supporting young gifted children through transitioning from early childhood education to school

The importance of the early years has long been recognised. Positive experiences in the early years help to build children’s learning and development across the lifespan. This article argues that strong collaborative partnerships between school and early childhood educational settings enhance transition experiences for all children, and specifically for gifted children. To ensure gifted children have positive and smooth transitions to school, teachers need to ensure there is sufficient flexibility within transition processes. Teachers also need to have a good understanding of the characteristics of gifted children in order to anticipate and dismantle potential limitations for the children within the transition. Transition to school process needs to cater for individual children and be sufficiently aware of current understandings of giftedness in order to support gifted children. This article considers the characteristics of the gifted child and how transition processes may affect them; and offers recommendations for practice to assist teachers to support the smother transition of gifted children from early childhood education into primary schooling

LOX Expert System

The LOX Expert System is a computer program which uses artificial intelligence (AI) techniques to diagnose instrumentation problems in the shuttle liquid oxygen fueling system. The KNOBS knowledge-based system is being modified for application to this problem. System functionality and fault isolation methods are described

TRADE: Object Tracking with 3D Trajectory and Ground Depth Estimates for UAVs

We propose TRADE for robust tracking and 3D localization of a moving target in cluttered environments, from UAVs equipped with a single camera. Ultimately TRADE enables 3d-aware target following. Tracking-by-detection approaches are vulnerable to target switching, especially between similar objects. Thus, TRADE predicts and incorporates the target 3D trajectory to select the right target from the tracker's response map. Unlike static environments, depth estimation of a moving target from a single camera is a ill-posed problem. Therefore we propose a novel 3D localization method for ground targets on complex terrain. It reasons about scene geometry by combining ground plane segmentation, depth-from-motion and single-image depth estimation. The benefits of using TRADE are demonstrated as tracking robustness and depth accuracy on several dynamic scenes simulated in this work. Additionally, we demonstrate autonomous target following using a thermal camera by running TRADE on a quadcopter's board computer

Fresh-Register Automata

What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store fresh names, and to compare incoming names with previously stored ones. These finite machines extend Kaminski and Francez’s Finite-Memory Automata by being able to recognise globally fresh inputs, that is, names fresh in the whole current run. We exam-ine the expressivity of FRA’s both from the aspect of accepted languages and of bisimulation equivalence. We establish primary properties and connections between automata of this kind, and an-swer key decidability questions. As a demonstrating example, we express the theory of the pi-calculus in FRA’s and characterise bisimulation equivalence by an appropriate, and decidable in the finitary case, notion in these automata

Vote-Independence: A Powerful Privacy Notion for Voting Protocols

International audienceRecently an attack on ballot privacy in Helios has been discovered [20], which is essentially based on copying other voter's votes. To capture this and similar attacks, we extend the classical threat model and introduce a new security notion for voting protocols: Vote-Independence. We give a formal definition and analyze its relationship to established privacy properties such as Vote-Privacy, Receipt-Freeness and Coercion-Resistance. In particular we show that even Coercion-Resistant protocols do not necessarily ensure Vote-Independence

Emerg. Infect. Dis

The multidrug-resistant (MDR) Salmonella enterica serotype Newport strain that produces CMY-2 β-lactamase(Newport MDR-AmpC) was the source of sporadic cases and outbreaks in humans in France during 2000–2005. Because this strain was not detected in food animals, it was most likely introduced into France through imported food products

Election Verifiability for Helios under Weaker Trust Assumptions

Most electronic voting schemes aim at providing verifiability: voters should trust the result without having to rely on some authorities. Actually, even a prominent voting system like Helios cannot fully achieve verifiability since a dishonest bulletin board may add ballots. This problem is called ballot stuffing. In this paper we give a definition of verifiability in the computational model to account for a malicious bulletin board that may add ballots. Next, we provide a generic construction that transforms a voting scheme that is verifiable against an honest bulletin board and an honest registration authority (weak verifiability) into a verifiable voting scheme under the weaker trust assumption that the registration authority and the bulletin board are not simultaneously dishonest (strong verifiability). This construction simply adds a registration authority that sends private credentials to the voters, and publishes the corresponding public credentials. We further provide simple and natural criteria that imply weak verifiability. As an application of these criteria, we formally prove the latest variant of Helios by Bernhard, Pereira and Warinschi weakly verifiable. By applying our generic construction we obtain a Helios-like scheme that has ballot privacy and strong verifiability (and thus prevents ballot stuffing). The resulting voting scheme, Helios-C, retains the simplicity of Helios and has been implemented and tested