‘He wasn’t nice to our country’: children’s discourses about the ‘glocalized’ nature of political events in the Global North

The accessibility of new media combined with emerging patterns of migration are challenging current definitions of community as we see a shift from close-knit face-to-face interactions to more diverse ‘glocalized’ networks that defines community as a social rather than a spatial dimension. These changes mean that social connections, and fundamentally a person’s sense of belonging, have moved beyond a local neighbourhood to depend upon global networks. This was the case for the children in the current longitudinal ethnographic study that followed one class in a diverse primary school in the north of England every 2 years from their Reception year to Year 6. This article draws upon data collected while the children were in Year 6, aged 10 to 11. It uncovers the range of linguistic and semiotic resources that the children used to communicate with their school peers about two recent political events in the Global North, namely, the United Kingdom’s European Union (EU) Referendum in 2016 that has resulted in Brexit and the US Presidential Election in late 2016 and Donald Trump’s Inauguration in early 2017. Unearthing the ‘glocalized’ discourses in the children’s narratives, this article uncovers the connections that the children made between these political events and their nuclear family’s experiences living in the United Kingdom and their extended family’s experiences in their countries of origin. In providing an account of the children’s discourses surrounding these political events, this article uncovers the ways in which sociopolitical events of global significance become meaningful for this group of children and reveals that the children understand the global as situated, constructed within specific contexts and influenced by local interpretations. As the children orientate themselves to media depictions of these events, their shifting perceptions of global politics alongside their intersecting experiences of racial, national and religious inequalities come to the fore in their peer interactions at school

Enteropathogen Resource Integration Center (ERIC): bioinformatics support for research on biodefense-relevant enterobacteria

ERIC, the Enteropathogen Resource Integration Center (www.ericbrc.org), is a new web portal serving as a rich source of information about enterobacteria on the NIAID established list of Select Agents related to biodefense—diarrheagenic Escherichia coli, Shigella spp., Salmonella spp., Yersinia enterocolitica and Yersinia pestis. More than 30 genomes have been completely sequenced, many more exist in draft form and additional projects are underway. These organisms are increasingly the focus of studies using high-throughput experimental technologies and computational approaches. This wealth of data provides unprecedented opportunities for understanding the workings of basic biological systems and discovery of novel targets for development of vaccines, diagnostics and therapeutics. ERIC brings information together from disparate sources and supports data comparison across different organisms, analysis of varying data types and visualization of analyses in human and computer-readable formats

Cost analysis of nondeterministic probabilistic programs

We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework. Moreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds

Cost Analysis of Nondeterministic Probabilistic Programs

We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework. Moreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach by presenting experimental results on a variety of programs, motivated by real-world applications, for which we efficiently synthesize tight resource-usage bounds.Comment: A conference version will appear in the 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019

Surface water data at Los Alamos National Laboratory: 1995 water year. Progress report

The principle investigators collected and computed surface water discharge data from 15 stream-gaging stations that cover most of Los Alamos National Laboratory. The United States Department of Interior Geological Survey, Water Resources Division, operates two of the stations under a subcontract; these are identified in the station manuscripts. Included in this report are data from one seepage run conducted in Los Alamos Canyon during the 1995 water year

Surface Water Data at Los Alamos National Laboratory: 2002 Water Year

The principal investigators collected and computed surface water discharge data from 34 stream-gaging stations that cover most of Los Alamos National Laboratory and one at Bandelier National Monument. Also included are discharge data from three springs--two that flow into Canon de Valle and one that flows into Water Canyon--and peak flow data from 16 stations

Surface Water Data at Los Alamos National Laboratory: 1999 Water Year

The principal investigators collected and computed surface water discharge data from 22 stream-gaging stations that cover most of Los Alamos National Laboratory with one at Bandelier National Monument. Also included are discharge data from three springs that flow into Canon de Valle and nine partial-record storm water stations

Surface Water Data at Los Alamos National Laboratory 1998 Water Year

The principal investigators collected and computed surface water discharge data from 19 stream-gaging stations that cover most of Los Alamos National Laboratory. Also included are discharge data from three springs that flow into Caiion de Vane