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

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

Petition for a Writ of Certiorari. Lavigne v. Cajun Deep Foundations, L.L.C., 137 S.Ct. 1328 (2017) (No. 16-464), 2016 WL 5929996

QUESTIONS PRESENTED (1) To establish a prima facie case of discriminatory termination, is a plaintiff required to show that he was replaced by someone outside his or her protected group? (2) Under Title VII of the Civil Rights Act of 1964, a plaintiff prior to:bringing a civil action must first file a charge with the EEOC, usually within 300 days of the action complained of. The Question Presented is: Where a claimant files a timely Title VII charge asserting that employer conduct was the result of a particular unlawful motive, may the claimant after the end of the charge-filing period amend that charge, or bring a civil action, asserting that the conduct was also the result of a second unlawful motive

Reply Brief. Lavigne v. Cajun Deep Foundations, L.L.C., 137 S.Ct. 1328 (2017) (No. 16-464), 2016 WL 9443770

QUESTIONS PRESENTED (1) To establish a prima facie case of discriminatory termination, is a plaintiff required to show that he was replaced by someone outside his or her protected group?* (2) Under Title VII of the Civil Rights Act of 1964, a plaintiff prior to:bringing a civil action must first file a charge with the EEOC, usually within 300 days of the action complained of. The Question Presented is: Where a claimant files a timely Title VII charge asserting that employer conduct was the result of a particular unlawful motive, may the claimant after the end of the charge-filing period amend that charge, or bring a civil action, asserting that the conduct was also the result of a second unlawful motive

Achieving a Prioritized Research and Technology Development Portfolio for the Dust Management Project

Mission architectures for human exploration of the lunar surface continue to advance as well as the definitions of capability needs, best practices and engineering design to mitigate the impact of lunar dust on exposed systems. The NASA DMP has been established as the agency focal point for dust characterization, technology, and simulant development. As described in this paper, the DMP has defined a process for selecting and justifying its R&T portfolio. The technology prioritization process, which is based on a ranking system according to weighted criteria, has been successfully applied to the current DMP dust mitigation technology portfolio. Several key findings emerged from this assessment. Within the dust removal and cleaning technologies group, there are critical technical challenges that must be overcome for these technologies to be implemented for lunar applications. For example, an in-situ source of CO2 on the moon is essential to the CO2 shower technology. Also, significant development effort is required to achieve technology readiness level TRL 6 for the electrostatic cleaning system for removal of particles smaller than 50 pm. The baseline materials related technologies require considerable development just to achieve TRL 6. It is also a nontrivial effort to integrate the materials in hardware for lunar application. At present, there are no terrestrial applications that are readily adaptable to lunar surface applications nor are there any obvious leading candidates. The unique requirements of dust sealing systems for lunar applications suggest an extensive development effort will be necessary to mature dust sealing systems to TRL 6 and beyond. As discussed here, several alternate materials and technologies have achieved high levels of maturity for terrestrial applications and warrant due diligence in ongoing assessment of the technology portfolio. The present assessment is the initial step in an ongoing effort to continually evaluate the DMP technology portfolio and external non-NASA relevant technology developments efforts to maintain an optimal investment profile. At the same time, there is an ongoing review of agency-wide dust-related R&T activities. The results of these ongoing assessments will be reported in future publications

Formal Analysis of V2X Revocation Protocols

Research on vehicular networking (V2X) security has produced a range of security mechanisms and protocols tailored for this domain, addressing both security and privacy. Typically, the security analysis of these proposals has largely been informal. However, formal analysis can be used to expose flaws and ultimately provide a higher level of assurance in the protocols. This paper focusses on the formal analysis of a particular element of security mechanisms for V2X found in many proposals: the revocation of malicious or misbehaving vehicles from the V2X system by invalidating their credentials. This revocation needs to be performed in an unlinkable way for vehicle privacy even in the context of vehicles regularly changing their pseudonyms. The REWIRE scheme by Forster et al. and its subschemes BASIC and RTOKEN aim to solve this challenge by means of cryptographic solutions and trusted hardware. Formal analysis using the TAMARIN prover identifies two flaws with some of the functional correctness and authentication properties in these schemes. We then propose Obscure Token (OTOKEN), an extension of REWIRE to enable revocation in a privacy preserving manner. Our approach addresses the functional and authentication properties by introducing an additional key-pair, which offers a stronger and verifiable guarantee of successful revocation of vehicles without resolving the long-term identity. Moreover OTOKEN is the first V2X revocation protocol to be co-designed with a formal model.Comment: 16 pages, 4 figure

Formal Analysis of Key Integrity in PKCS#11

PKCS#11 is a standard API to cryptographic devices such as smarcards, hardware security modules and usb crypto-tokens. Though widely adopted, this API has been shown to be prone to attacks in which a malicious user gains access to the sensitive keys stored in the devices. In 2008, Delaune, Kremer and Steel proposed a model to formally reason on this kind of attacks. We extend this model to also describe flaws that are based on integrity violations of the stored keys. In particular, we consider scenarios in which a malicious overwriting of keys might fool honest users into using attacker’s own keys, while performing sensitive operations. We further enrich the model with a trusted key mechanism ensuring that only controlled, non-tampered keys are used in cryptographic operations, and we show how this modified API prevents the above mentioned key-replacement attacks

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

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