90-degree dolly rollover test of an electric vehicle per FMVSS 208 test procedure - 1977 Electra-Van 500. Final report.

National Highway Traffic Safety Administration, Washington, D.C.

Impact intrusion characteristics of fuel systems. Final report.

National Highway Safety Bureau, Washington, D.C.

Final design and implementation plan for evaluating the effectiveness of FMVSS 301: fuel system integrity. Tasks #4 & #5 report.

National Highway Traffic Safety Administration, Washington, D.C.

Guidance manual for petroleum-related LUST cleanups in Illinois /

"Spring 1990."

Sampling and cleanup requirements for used oil underground storage tanks.

At head of title: Leaking underground storage tanks.

Radio leaks: Presenting and contesting leaks in radio news broadcasts

his paper analyzes the discursive construction and contestation of ‘leaked’ stories in news broadcast programmes. Drawing on a sample of BBC Radio 4 news programmes recorded between May and June 2000, we analyze four items of news presented as leaks about upcoming events. We suggest that these examples highlight the leaking of information as a valuable newsworthy commodity in that it not only allows news organizations to report what is going to be news before it happens but also enables speculative discourse as to the meaning of the event yet to happen. However, in order for a story to be accepted as a leak it must be seen to fulfil a number of criteria. With this in mind, we identify four features accompanying the introduction of the news items as leaks in the process of authentification: secrecy, authorship/ownership and future orientation. The article then discusses how these features are used when contesting the status of a news story as a leak, and how temporal play contributes to downgrading the content of the leak and, hence, its relevance, immediacy and newsworthiness.

Development and evaluation of a youth mental health community awareness campaign - The Compass Strategy

Background: Early detection and treatment of mental disorders in adolescents and young adults can lead to better health outcomes. Mental health literacy is a key to early recognition and help seeking. Whilst a number of population health initiatives have attempted to improve mental health literacy, none to date have specifically targeted young people nor have they applied the rigorous standards of population health models now accepted as best practice in other health areas. This paper describes the outcomes from the application of a health promotion model to the development, implementation and evaluation of a community awareness campaign designed to improve mental health literacy and early help seeking amongst young people. Method: The Compass Strategy was implemented in the western metropolitan Melbourne and Barwon regions of Victoria, Australia. The Precede-Proceed Model guided the population assessment, campaign strategy development and evaluation. The campaign included the use of multimedia, a website, and an information telephone service. Multiple levels of evaluation were conducted. This included a cross-sectional telephone survey of mental health literacy undertaken before and after 14 months of the campaign using a quasi-experimental design. Randomly selected independent samples of 600 young people aged 12 - 25 years from the experimental region and another 600 from a comparison region were interviewed at each time point. A series of binary logistic regression analyses were used to measure the association between a range of campaign outcome variables and the predictor variables of region and time. Results: The program was judged to have an impact on the following variables, as indicated by significant region-by-time interaction effects ( p < 0.05): awareness of mental health campaigns, self-identified depression, help for depression sought in the previous year, correct estimate of prevalence of mental health problems, increased awareness of suicide risk, and a reduction in perceived barriers to help seeking. These effects may be underestimated because media distribution error resulted in a small amount of print material leaking into the comparison region. Conclusion: We believe this is the first study to apply the rigorous standards of a health promotion model including the use of a control region to a mental health population intervention. The program achieved many of its aims despite the relatively short duration and moderate intensity of the campaign.

O USO DAS TECNOLOGIAS DA INFORMAÇÃO NA LIBERAÇÃO DE DADOS NA REDE: O CASO WIKILEAKS

O trabalho apresenta um estudo de caso do site Wikileaks, fundado pelo ex-hacker australiano Julian Assange, que ganhou fama mundial em 2010 por vazar documentos secretos dos Estados Unidos relacionados às guerras do Afeganistão e Iraque, e das embaixadas americanas de todo o mundo. A publicação de todo este conteúdo gerou uma grande controvérsia no alto escalão da política internacional e trouxe a tona como os donos do poder e da mídia monopolizada agem para calar os discursos de narradores que podem colocar a sobrevivência política destes atores do poder em risco. Este trabalho, portanto, apresenta um caso onde as novas mídias digitais promoveram aquele que foi chamado de o maior vazamento da história e como os atores políticos reagiram a este fenômeno, com uma campanha de pressão e difamação de Assange para tentar cessar as ações do site.

Spontanoeusly resolved macroaneurysm associated with a congenital anomalous retinal artery

Purpose: To report the outcome of retinal artery macroaneurysm associated with a congenital anomalous retinal artery. Methods: The patient was examined with ophthalmoscopy and fluorescein angiography. Results: A 60-year-old woman presented with visual acuity of 20/80 in her right eye. She was found to have an abnormal retinal vessel emerging from the optic disk, passing toward the center of the macula, and looping back toward the disk. The center of the loop had a leaking macroaneurysm, which was treated conservatively. At the 4-month follow-up visit, the visual acuity in the right eye had improved to 20/20 with resolution of most of the macular edema, exudates, and hemorrhage. Conclusion: This case demonstrates that retinal artery macroaneurysm can be successfully managed with a conservative approach, even when associated with a congenital anomalous retinal vessel.

Reflections on race in contemporary Ireland

Any reflection on the category "race" in the contemporary world is inevitably framed by the cumulative layers of meanings and practices attached to bodies and cultures over the previous centuries. If the idea of race resembles anything, it is a palimpsest,1with past interpretations leaking through to make the ink of the present run. Accordingly, I present some historical notes not as a distinct prelude to the "real" story, positing a rupture of past and present, but as the beginning of the story proper.

Practical secure information flow in programming languages

If we classify variables in a program into various security levels, then a secure information flow analysis aims to verify statically that information in a program can flow only in ways consistent with the specified security levels. One well-studied approach is to formulate the rules of the secure information flow analysis as a type system. A major trend of recent research focuses on how to accommodate various sophisticated modern language features. However, this approach often leads to overly complicated and restrictive type systems, making them unfit for practical use. Also, problems essential to practical use, such as type inference and error reporting, have received little attention. This dissertation identified and solved major theoretical and practical hurdles to the application of secure information flow. ^ We adopted a minimalist approach to designing our language to ensure a simple lenient type system. We started out with a small simple imperative language and only added features that we deemed most important for practical use. One language feature we addressed is arrays. Due to the various leaking channels associated with array operations, arrays have received complicated and restrictive typing rules in other secure languages. We presented a novel approach for lenient array operations, which lead to simple and lenient typing of arrays. ^ Type inference is necessary because usually a user is only concerned with the security types for input/output variables of a program and would like to have all types for auxiliary variables inferred automatically. We presented a type inference algorithm B and proved its soundness and completeness. Moreover, algorithm B stays close to the program and the type system and therefore facilitates informative error reporting that is generated in a cascading fashion. Algorithm B and error reporting have been implemented and tested. ^ Lastly, we presented a novel framework for developing applications that ensure user information privacy. In this framework, core computations are defined as code modules that involve input/output data from multiple parties. Incrementally, secure flow policies are refined based on feedback from the type checking/inference. Core computations only interact with code modules from involved parties through well-defined interfaces. All code modules are digitally signed to ensure their authenticity and integrity. ^

Secure information flow via stripping and fast simulation

Type systems for secure information flow aim to prevent a program from leaking information from H (high) to L (low) variables. Traditionally, bisimulation has been the prevalent technique for proving the soundness of such systems. This work introduces a new proof technique based on stripping and fast simulation, and shows that it can be applied in a number of cases where bisimulation fails. We present a progressive development of this technique over a representative sample of languages including a simple imperative language (core theory), a multiprocessing nondeterministic language, a probabilistic language, and a language with cryptographic primitives. In the core theory we illustrate the key concepts of this technique in a basic setting. A fast low simulation in the context of transition systems is a binary relation where simulating states can match the moves of simulated states while maintaining the equivalence of low variables; stripping is a function that removes high commands from programs. We show that we can prove secure information flow by arguing that the stripping relation is a fast low simulation. We then extend the core theory to an abstract distributed language under a nondeterministic scheduler. Next, we extend to a probabilistic language with a random assignment command; we generalize fast simulation to the setting of discrete time Markov Chains, and prove approximate probabilistic noninterference. Finally, we introduce cryptographic primitives into the probabilistic language and prove computational noninterference, provided that the underling encryption scheme is secure.

Design of a low power - high temperature heated ceramic sensor to detect halogen gases

The design, construction and optimization of a low power-high temperature heated ceramic sensor to detect leaking of halogen gases in refrigeration systems are presented. The manufacturing process was done with microelectronic assembly and the Low Temperature Cofire Ceramic (LTCC) technique. Four basic sensor materials were fabricated and tested: Li2SiO3, Na2SiO3, K2SiO3, and CaSiO 3. The evaluation of the sensor material, sensor size, operating temperature, bias voltage, electrodes size, firing temperature, gas flow, and sensor life was done. All sensors responded to the gas showing stability and reproducibility. Before exposing the sensor to the gas, the sensor was modeled like a resistor in series and the calculations obtained were in agreement with the experimental values. The sensor response to the gas was divided in surface diffusion and bulk diffusion; both were analyzed showing agreement between the calculations and the experimental values. The sensor with 51.5%CaSiO3 + 48.5%Li 2SiO3 shows the best results, including a stable current and response to the gas. ^

Foundations of quantitative information flow: Channels, cascades, and the information order

Secrecy is fundamental to computer security, but real systems often cannot avoid leaking some secret information. For this reason, the past decade has seen growing interest in quantitative theories of information flow that allow us to quantify the information being leaked. Within these theories, the system is modeled as an information-theoretic channel that specifies the probability of each output, given each input. Given a prior distribution on those inputs, entropy-like measures quantify the amount of information leakage caused by the channel. ^ This thesis presents new results in the theory of min-entropy leakage. First, we study the perspective of secrecy as a resource that is gradually consumed by a system. We explore this intuition through various models of min-entropy consumption. Next, we consider several composition operators that allow smaller systems to be combined into larger systems, and explore the extent to which the leakage of a combined system is constrained by the leakage of its constituents. Most significantly, we prove upper bounds on the leakage of a cascade of two channels, where the output of the first channel is used as input to the second. In addition, we show how to decompose a channel into a cascade of channels. ^ We also establish fundamental new results about the recently-proposed g-leakage family of measures. These results further highlight the significance of channel cascading. We prove that whenever channel A is composition refined by channel B, that is, whenever A is the cascade of B and R for some channel R, the leakage of A never exceeds that of B, regardless of the prior distribution or leakage measure (Shannon leakage, guessing entropy leakage, min-entropy leakage, or g-leakage). Moreover, we show that composition refinement is a partial order if we quotient away channel structure that is redundant with respect to leakage alone. These results are strengthened by the proof that composition refinement is the only way for one channel to never leak more than another with respect to g-leakage. Therefore, composition refinement robustly answers the question of when a channel is always at least as secure as another from a leakage point of view.^

Two-bit pattern analysis for quantitative information flow

Protecting confidential information from improper disclosure is a fundamental security goal. While encryption and access control are important tools for ensuring confidentiality, they cannot prevent an authorized system from leaking confidential information to its publicly observable outputs, whether inadvertently or maliciously. Hence, secure information flow aims to provide end-to-end control of information flow. Unfortunately, the traditionally-adopted policy of noninterference, which forbids all improper leakage, is often too restrictive. Theories of quantitative information flow address this issue by quantifying the amount of confidential information leaked by a system, with the goal of showing that it is intuitively "small" enough to be tolerated. Given such a theory, it is crucial to develop automated techniques for calculating the leakage in a system. ^ This dissertation is concerned with program analysis for calculating the maximum leakage, or capacity, of confidential information in the context of deterministic systems and under three proposed entropy measures of information leakage: Shannon entropy leakage, min-entropy leakage, and g-leakage. In this context, it turns out that calculating the maximum leakage of a program reduces to counting the number of possible outputs that it can produce. ^ The new approach introduced in this dissertation is to determine two-bit patterns, the relationships among pairs of bits in the output; for instance we might determine that two bits must be unequal. By counting the number of solutions to the two-bit patterns, we obtain an upper bound on the number of possible outputs. Hence, the maximum leakage can be bounded. We first describe a straightforward computation of the two-bit patterns using an automated prover. We then show a more efficient implementation that uses an implication graph to represent the two- bit patterns. It efficiently constructs the graph through the use of an automated prover, random executions, STP counterexamples, and deductive closure. The effectiveness of our techniques, both in terms of efficiency and accuracy, is shown through a number of case studies found in recent literature. ^