6,615 research outputs found

    Design considerations for a space database

    Get PDF
    Part of the information used in a real-time simulator is stored in the visual database. This information is processed by an image generator and displayed as a real-time visual image. The database must be constructed in a specific format, and it should efficiently utilize the capacities of the image generator that is was created for. A visual simulation is crucially dependent upon the success with which the database provides visual cues and recognizable scenes. For this reason, more and more attention is being paid to the art and science of creating effective real-time visual databases. Investigated here are the database design considerations required for a space-oriented real-time simulator. Space applications often require unique designs that correspond closely to the particular image-generator hardware and visual-database-management software. Specific examples from the databases constructed for NASA and its Evans and Sutherland CT6 image generator illustrate the various design strategies used in a space-simulation environment. These database design considerations are essential for all who would create a space database

    Random Indexing K-tree

    Get PDF
    Random Indexing (RI) K-tree is the combination of two algorithms for clustering. Many large scale problems exist in document clustering. RI K-tree scales well with large inputs due to its low complexity. It also exhibits features that are useful for managing a changing collection. Furthermore, it solves previous issues with sparse document vectors when using K-tree. The algorithms and data structures are defined, explained and motivated. Specific modifications to K-tree are made for use with RI. Experiments have been executed to measure quality. The results indicate that RI K-tree improves document cluster quality over the original K-tree algorithm.Comment: 8 pages, ADCS 2009; Hyperref and cleveref LaTeX packages conflicted. Removed clevere

    Repeat-Accumulate Codes for Reconciliation in Continuous Variable Quantum Key Distribution

    Full text link
    This paper investigates the design of low-complexity error correction codes for the verification step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate codes which demonstrate good performances for CVQKD reconciliation

    Motility of the reticulum and rumen of sheep given juice-extracted pasture

    Get PDF
    1. Sheep were fed on different diets of juice-extracted herbage to determine what effect juice-extraction had on reticulo-rumen motility. 2. The frequency of A and B sequences of contraction of the reticulo-rumen were recorded during eating, rumination and inactivity for continuous periods of 24–72 h by using integrated electromyograms obtained from electrodes implanted in the musculature of the reticulum and cranial dorsal rumen. 3. Animals were fed on herbage in which approximately 200 g/kg dry matter had been removed in juice extracted from ryegrass (Lolium perenne), white clover (Trifolium repens), mixed ryegrass–white clover and lucerne (Medicago saliva). 4. Over all the frequency of A sequences of contraction did not differ in animals fed on pressed herbage or the unpressed material from which it was derived, although it was slower during rumination on some of the pressed material. In contrast, the frequency of B sequences was higher on the pressed material. The frequencies of contraction of A and B sequences in animals fed on pressed herbage was related to the activity of the animals in the order eating > rumination > inactivity. 5. Changes in reticulo-rumen motility due to juice extraction were small and the frequencies of A and B sequences of contraction in sheep fed on pressed herbage were in the range encountered in ruminants consuming more conventional foods
    corecore