2,814 research outputs found

    USSR Space Life Sciences Digest, volume 1, no. 4

    Get PDF
    An overview of the developments and direction of the USSR Space Life Sciences Program is given. Highlights of launches, program development, and mission planning are given. Results of ground-based research and space flight studies are summarized. Topics covered include: space medicine and physiology; space biology, and life sciences and technology

    USSR Space Life Sciences Digest, volume 2, no. 2

    Get PDF
    An overview of the developments and direction of the USSR Space Life Sciences Program is given. Highlights of launches, program development, and mission planning are given. Results of ground-based research and space flight studies are summarized. Topics covered include: space medicine and physiology; space biology; and life sciences and technology

    Wind tunnel test results of a new leading edge flap design for highly swept wings, a vortex flap

    Get PDF
    A leading edge flap design for highly swept wings, called a vortex flap, was tested on an arrow wing model in a low speed wind tunnel. A vortex flap differs from a conventional plain flap in that it has a leading edge tab which is counterdeflected from the main portion of the flap. This results in intentional separation at the flap leading edge, causing a vortex to form and lie on the flap. By trapping this vortex, the vortex flap can result in significantly improved wing flow characteristics relative to conventional flaps at moderate to high angles of attack, as demonstrated by the flow visualization results of this tests

    The Teen Suicide Research Project

    Get PDF

    Rubidium and lead abundances in giant stars of the globular clusters M 13 and NGC 6752

    Full text link
    We present measurements of the neutron-capture elements Rb and Pb in five giant stars of the globular cluster NGC 6752 and Pb measurements in four giants of the globular cluster M 13. The abundances were derived by comparing synthetic spectra with high resolution, high signal-to-noise ratio spectra obtained using HDS on the Subaru telescope and MIKE on the Magellan telescope. The program stars span the range of the O-Al abundance variation. In NGC 6752, the mean abundances are [Rb/Fe] = -0.17 +/- 0.06 (sigma = 0.14), [Rb/Zr] = -0.12 +/- 0.06 (sigma = 0.13), and [Pb/Fe] = -0.17 +/- 0.04 (sigma = 0.08). In M 13 the mean abundance is [Pb/Fe] = -0.28 +/- 0.03 (sigma = 0.06). Within the measurement uncertainties, we find no evidence for a star-to-star variation for either Rb or Pb within these clusters. None of the abundance ratios [Rb/Fe], [Rb/Zr], or [Pb/Fe] are correlated with the Al abundance. NGC 6752 may have slightly lower abundances of [Rb/Fe] and [Rb/Zr] compared to the small sample of field stars at the same metallicity. For M 13 and NGC 6752 the Pb abundances are in accord with predictions from a Galactic chemical evolution model. If metal-poor intermediate-mass asymptotic giant branch stars did produce the globular cluster abundance anomalies, then such stars do not synthesize significant quantities of Rb or Pb. Alternatively, if such stars do synthesize large amounts of Rb or Pb, then they are not responsible for the abundance anomalies seen in globular clusters.Comment: Accepted for publication in Ap

    Rubidium and lead abundances in giant stars of the globular clusters M4 and M5

    Get PDF
    We present measurements of the neutron-capture elements Rb and Pb for bright giants in the globular clusters M4 and M5. The clusters are of similar metallicity ([Fe/H] = -1.2) but M4 is decidedly s-process enriched relative to M5: [Ba/Fe] = +0.6 for M4 but 0.0 for M5. The Rb and Pb abundances were derived by comparing synthetic spectra with high-resolution, high signal-to-noise ratio spectra obtained with MIKE on the Magellan telescope. Abundances of Y, Zr, La, and Eu were also obtained. In M4, the mean abundances from 12 giants are [Rb/Fe] = 0.39 +/- 0.02 (sigma = 0.07), [Rb/Zr] = 0.17 +/- 0.03 (sigma = 0.08), and [Pb/Fe] = 0.30 +/- 0.02 (sigma = 0.07). In M5, the mean abundances from two giants are [Rb/Fe] = 0.00 +/- 0.05 (sigma = 0.06), [Rb/Zr] = 0.08 +/- 0.08 (sigma = 0.11), and [Pb/Fe] = -0.35 +/- 0.02 (sigma = 0.04). Within the measurement uncertainties, the abundance ratios [Rb/Fe], [Pb/Fe] and [Rb/X] for X = Y, Zr, La are constant from star-to-star in each cluster and none of these ratios are correlated with O or Na abundances. While M4 has a higher Rb abundance than M5, the ratios [Rb/X] are similar in both clusters indicating that the nature of the s-products are very similar for each cluster but the gas from which M4's stars formed had a higher concentration of these products.Comment: Accepted for publication in Ap

    Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols

    Get PDF
    We define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of the session. Hereby, we can describe the operational semantics of principals and of an intruder in a simple and modular way. Furthermore, using proof theoretic tools like the analysis of permutability of rules, we are able to find efficient proof strategies that we prove complete for special classes of security protocols including Needham-Schroeder. Based on the results of this preliminary analysis, we have implemented a Prolog meta-interpreter which allows for rapid prototyping and for checking safety properties of security protocols, and we have applied it for finding error traces and proving correctness of practical examples

    Attacking Group Protocols by Refuting Incorrect Inductive Conjectures

    Get PDF
    Automated tools for finding attacks on flawed security protocols often fail to deal adequately with group protocols. This is because the abstractions made to improve performance on fixed 2 or 3 party protocols either preclude the modelling of group protocols all together, or permit modelling only in a fixed scenario, which can prevent attacks from being discovered. This paper describes Coral, a tool for finding counterexamples to incorrect inductive conjectures, which we have used to model protocols for both group key agreement and group key management, without any restrictions on the scenario. We will show how we used Coral to discover 6 previously unknown attacks on 3 group protocols

    Machine-Checked Proofs For Realizability Checking Algorithms

    Full text link
    Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quality of complex embedded systems. Given appropriate architectural descriptions, assume/guarantee contracts, and compositional reasoning rules, these techniques can be used to prove important safety properties about the architecture prior to system construction. For these proofs to be meaningful, each leaf-level component contract must be realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. We have recently proposed (in [1]) a contract-based realizability checking algorithm for assume/guarantee contracts over infinite theories supported by SMT solvers such as linear integer/real arithmetic and uninterpreted functions. In that work, we used an SMT solver and an algorithm similar to k-induction to establish the realizability of a contract, and justified our approach via a hand proof. Given the central importance of realizability to our virtual integration approach, we wanted additional confidence that our approach was sound. This paper describes a complete formalization of the approach in the Coq proof and specification language. During formalization, we found several small mistakes and missing assumptions in our reasoning. Although these did not compromise the correctness of the algorithm used in the checking tools, they point to the value of machine-checked formalization. In addition, we believe this is the first machine-checked formalization for a realizability algorithm.Comment: 14 pages, 1 figur
    • ā€¦
    corecore