953 research outputs found

    A VLSI pipeline design of a fast prime factor DFT on a finite field

    Get PDF
    A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). A pipeline structure is used to implement this prime factor DFT over GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented

    A framework for automatic semantic video annotation

    Get PDF
    The rapidly increasing quantity of publicly available videos has driven research into developing automatic tools for indexing, rating, searching and retrieval. Textual semantic representations, such as tagging, labelling and annotation, are often important factors in the process of indexing any video, because of their user-friendly way of representing the semantics appropriate for search and retrieval. Ideally, this annotation should be inspired by the human cognitive way of perceiving and of describing videos. The difference between the low-level visual contents and the corresponding human perception is referred to as the ā€˜semantic gapā€™. Tackling this gap is even harder in the case of unconstrained videos, mainly due to the lack of any previous information about the analyzed video on the one hand, and the huge amount of generic knowledge required on the other. This paper introduces a framework for the Automatic Semantic Annotation of unconstrained videos. The proposed framework utilizes two non-domain-specific layers: low-level visual similarity matching, and an annotation analysis that employs commonsense knowledgebases. Commonsense ontology is created by incorporating multiple-structured semantic relationships. Experiments and black-box tests are carried out on standard video databases for action recognition and video information retrieval. White-box tests examine the performance of the individual intermediate layers of the framework, and the evaluation of the results and the statistical analysis show that integrating visual similarity matching with commonsense semantic relationships provides an effective approach to automated video annotation

    ProteinDBS v2.0: a web server for global and local protein structure search

    Get PDF
    ProteinDBS v2.0 is a web server designed for efficient and accurate comparisons and searches of structurally similar proteins from a large-scale database. It provides two comparison methods, global-to-global and local-to-local, to facilitate the searches of protein structures or substructures. ProteinDBS v2.0 applies advanced feature extraction algorithms and scalable indexing techniques to achieve a high-running speed while preserving reasonably high precision of structural comparison. The experimental results show that our system is able to return results of global comparisons in seconds from a complete Protein Data Bank (PDB) database of 152 959 protein chains and that it takes much less time to complete local comparisons from a non-redundant database of 3276 proteins than other accurate comparison methods. ProteinDBS v2.0 supports query by PDB protein ID and by new structures uploaded by users. To our knowledge, this is the only search engine that can simultaneously support global and local comparisons. ProteinDBS v2.0 is a useful tool to investigate functional or evolutional relationships among proteins. Moreover, the common substructures identified by local comparison can be potentially used to assist the human curation process in discovering new domains or folds from the ever-growing protein structure databases. The system is hosted at http://ProteinDBS.rnet.missouri.edu

    Contribution of the cyclic nucleotide gated channel subunit, CNG-3, to olfactory plasticity in Caenorhabditis elegans.

    Get PDF
    In Caenorhabditis elegans, the AWC neurons are thought to deploy a cGMP signaling cascade in the detection of and response to AWC sensed odors. Prolonged exposure to an AWC sensed odor in the absence of food leads to reversible decreases in the animal's attraction to that odor. This adaptation exhibits two stages referred to as short-term and long-term adaptation. Previously, the protein kinase G (PKG), EGL-4/PKG-1, was shown necessary for both stages of adaptation and phosphorylation of its target, the beta-type cyclic nucleotide gated (CNG) channel subunit, TAX-2, was implicated in the short term stage. Here we uncover a novel role for the CNG channel subunit, CNG-3, in short term adaptation. We demonstrate that CNG-3 is required in the AWC for adaptation to short (thirty minute) exposures of odor, and contains a candidate PKG phosphorylation site required to tune odor sensitivity. We also provide in vivo data suggesting that CNG-3 forms a complex with both TAX-2 and TAX-4 CNG channel subunits in AWC. Finally, we examine the physiology of different CNG channel subunit combinations

    Metastable liquid-liquid phase transition in a single-component system with only one crystal phase and no density anomaly

    Get PDF
    We investigate the phase behavior of a single-component system in 3 dimensions with spherically-symmetric, pairwise-additive, soft-core interactions with an attractive well at a long distance, a repulsive soft-core shoulder at an intermediate distance, and a hard-core repulsion at a short distance, similar to potentials used to describe liquid systems such as colloids, protein solutions, or liquid metals. We showed [Nature {\bf 409}, 692 (2001)] that, even with no evidences of the density anomaly, the phase diagram has two first-order fluid-fluid phase transitions, one ending in a gas--low-density liquid (LDL) critical point, and the other in a gas--high-density liquid (HDL) critical point, with a LDL-HDL phase transition at low temperatures. Here we use integral equation calculations to explore the 3-parameter space of the soft-core potential and we perform molecular dynamics simulations in the interesting region of parameters. For the equilibrium phase diagram we analyze the structure of the crystal phase and find that, within the considered range of densities, the structure is independent of the density. Then, we analyze in detail the fluid metastable phases and, by explicit thermodynamic calculation in the supercooled phase, we show the absence of the density anomaly. We suggest that this absence is related to the presence of only one stable crystal structure.Comment: 15 pages, 21 figure

    ESSVCS: an enriched secret sharing visual cryptography

    Get PDF
    Visual Cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares that are able to be stacked together so as to approximately recover the original image. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the Human Visual System (HVS). The distinguishing characteristic of VC is the ability of secret restoration without the use of computation. However because of restrictions of the HVS, pixel expansion and alignment problems, a VC scheme perhaps can only be applied to share a small size of secret image. In this paper, we present an Enriched Secret Sharing Visual Cryptography Scheme (ESSVCS) to let the VC shares carry more secrets, the technique is to use cypher output of private-key systems as the input random numbers of VC scheme, meanwhile the encryption key could be shared, the shared keys could be associated with the VC shares. After this operation, VC scheme and secret sharing scheme are merged with the private-key system. Under this design, we implement a (k; t; n)-VC scheme. Compared to those existing schemes, our scheme could greatly enhance the ability of current VC schemes and could cope with pretty rich secrets

    BRISCā€”An Open Source Pulmonary Nodule Image Retrieval Framework

    Get PDF
    We have created a content-based image retrieval framework for computed tomography images of pulmonary nodules. When presented with a nodule image, the system retrieves images of similar nodules from a collection prepared by the Lung Image Database Consortium (LIDC). The system (1) extracts images of individual nodules from the LIDC collection based on LIDC expert annotations, (2) stores the extracted data in a flat XML database, (3) calculates a set of quantitative descriptors for each nodule that provide a high-level characterization of its texture, and (4) uses various measures to determine the similarity of two nodules and perform queries on a selected query nodule. Using our framework, we compared three feature extraction methods: Haralick co-occurrence, Gabor filters, and Markov random fields. Gabor and Markov descriptors perform better at retrieving similar nodules than do Haralick co-occurrence techniques, with best retrieval precisions in excess of 88%. Because the software we have developed and the reference images are both open source and publicly available they may be incorporated into both commercial and academic imaging workstations and extended by others in their research
    • ā€¦
    corecore