3,343 research outputs found

    Poets in dialogue, dialogues in poets

    Full text link
    Is there something noticeably peculiar about dialogues with poets when transformed into writing, be it in electronic or printed form? The pauses and hesitations, the thrust and parry, the slurrings and overlappings of ordinary speech by and large disappear. In their place is an artifice, a deliberate creation of a script, with questions and responses clearly marked for our attention. Might we be approaching a tidied duologue which, some might also cynically remark, largely reproduces a dual monologue? Moreover, when poets are in dialogue, with whom or what does the poet converse

    Truths in narrative fiction?

    Full text link

    Nietzsche on music: perspectives from the birth of tragedy

    Full text link

    Demonstration of rapid and sensitive module leak certification for Space Station Freedom

    Get PDF
    A leak detection and quantification demonstration using perflurocarbon tracer (PFT) technology was successfully performed at the NASA Marshall Space Flight Center on January 25, 1991. The real-time Dual Trap Analyzer (DTA) at one-half hour after the start of the first run gave an estimated leak rate of 0.7 mL/min. This has since been refined to be 1.15 (+ or -) 0.09 mL/min. The leak rates in the next three runs were determined to be 9.8 (+ or -) 0.7, -0.4 (+ or -) 0.3, and 76 (+ or -) 6 mL/min, respectively. The theory on leak quantification in the steady-state and time-dependent modes for a single zone test facility was developed and applied to the above determinations. The laboratory PFT analysis system gave a limit-of-detection (LOD) of 0.05 fL for ocPDCH. This is the tracer of choice and is about 100-fold better than that for the DTA. Applied to leak certification, the LOD is about 0.00002 mL/s (0.000075 L/h), a 5 order-of-magnitude improvement over the original leak certification specification. Furthermore, this limit can be attained in a measurement period of 3 to 4 hours instead of days, weeks, or months. A new Leak Certification Facility is also proposed to provide for zonal (three zones) determination of leak rates. The appropriate multizone equations, their solutions, and error analysis have already been derived. A new concept of seal-integrity certification has been demonstrated for a variety of controlled leaks in the range of module leak testing. High structural integrity leaks were shown to have a linear dependence of flow on (Delta)p. The rapid determination of leak rates at different pressures is proposed and is to be determined while subjecting the module to other external force-generating parameters such as vibration, torque, solar intensity, etc

    Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time

    Full text link
    We describe and analyze Zig-zag Sort--a deterministic data-oblivious sorting algorithm running in O(n log n) time that is arguably simpler than previously known algorithms with similar properties, which are based on the AKS sorting network. Because it is data-oblivious and deterministic, Zig-zag Sort can be implemented as a simple O(n log n)-size sorting network, thereby providing a solution to an open problem posed by Incerpi and Sedgewick in 1985. In addition, Zig-zag Sort is a variant of Shellsort, and is, in fact, the first deterministic Shellsort variant running in O(n log n) time. The existence of such an algorithm was posed as an open problem by Plaxton et al. in 1992 and also by Sedgewick in 1996. More relevant for today, however, is the fact that the existence of a simple data-oblivious deterministic sorting algorithm running in O(n log n) time simplifies the inner-loop computation in several proposed oblivious-RAM simulation methods (which utilize AKS sorting networks), and this, in turn, implies simplified mechanisms for privacy-preserving data outsourcing in several cloud computing applications. We provide both constructive and non-constructive implementations of Zig-zag Sort, based on the existence of a circuit known as an epsilon-halver, such that the constant factors in our constructive implementations are orders of magnitude smaller than those for constructive variants of the AKS sorting network, which are also based on the use of epsilon-halvers.Comment: Appearing in ACM Symp. on Theory of Computing (STOC) 201
    corecore