Recognition And Top-Down Generation Of Beta-Acyclic Database Schemes

Database schemes can be viewed as hypergraphs with individual relation schemes corresponding to the edges of a hypergraph. Under this setting, a new class of "acyclic" database schemes was recently introduced and was shown to have a claim to a number of desirable properties. However, unlike the case of ordinary undirected graphs, there are several unequivalent notions of acyclicity of hypergraphs. Of special interest among these are agr-, beta-, and gamma-, degrees of acyclicity, each characterizing an equivalence class of desirable properties for database schemes, represented as hypergraphs. In this paper, two complementary approaches to designing beta-acyclic database schemes have been presented. For the first part, a new notion called "independent cycle" is introduced. Based on this, a criterion for beta-acyclicity is developed and is shown equivalent to the existing definitions of beta-acyclicity. From this and the concept of the dual of a hypergraph, an efficient algorithm for testing beta-acyclicity is developed. As for the second part, a procedure is evolved for top-down generation of beta-acyclic schemes and its correctness is established. Finally, extensions and applications of ideas are described.

Microsomal 11a-hydroxylation of progesterone in Image : Part I: Characterization of the hydroxylase system

Microsomes (105,000xg sediment) prepared from induced cells of Image was found to hydroxylate progesterone to 11a-hydroxyprogesterone (11a-OHP) in high yields (85-90% in 30 min.) in the presence of NADPH and O2. The pH optimum for the hydroxylase was found to be 7.7. However, for the isolation of active microsomes grinding of the mycelium should be carried out at pH 8.3. Metyrapone, carbon monoxide, SKF-525A, p-CMB and N-methyl maleimide inhibited the hydroxylase activity indicating the involvement of cytochrome P-450 system. The inhibition of the hydroxylase by cytochrome Image and the presence of high levels of NADPH-cytochrome Image reductase in induced microsomes suggest that the reductase could be one of the components in the hydroxylase system.

Stopover destination image: Using the repertory test to identify salient attributes

This paper reports a rare investigation of stopover destination image. Although the topic of destination image has been one of the most popular in the tourism literature since the 1970s, there has been a lack of research attention in relation to the context of stopover destinations for long haul international travellers. The purpose of this study was to identify attributes deemed salient to Australian consumers when considering stopover destinations for long haul travel to the United Kingdom and Europe. Underpinned by Personal Construct Theory (PCT), the study used the Repertory Test to identify 21 salient attributes, which could be used in the development of a survey instrument to measure the attractiveness of a competitive set of stopover destinations. While the list of attributes shared some commonality with general studies of destination image reported in the literature, the elicitation of a relatively large number of stopover context specific attributes highlights the potential benefit of engaging with consumers in qualitative research, such as using the Repertory Test, during the questionnaire development stage.

Dynamic Space Warping Of Strokes For Recognition Of Online Handwritten Characters

This paper suggests a scheme for classifying online handwritten characters, based on dynamic space warping of strokes within the characters. A method for segmenting components into strokes using velocity profiles is proposed. Each stroke is a simple arbitrary shape and is encoded using three attributes. Correspondence between various strokes is established using Dynamic Space Warping. A distance measure which reliably differentiates between two corresponding simple shapes (strokes) has been formulated thus obtaining a perceptual distance measure between any two characters. Tests indicate an accuracy of over 85% on two different datasets of characters.

Differential recognition by tick-resistant cattle of the recombinantly expressed Rhipicephalus microplus serine protease inhibitor-3 (RMS-3)

Rhipicephalus micro plus is an important bovine ectoparasite, widely distributed in tropical and subtropical regions of the world causing large economic losses to the cattle industry. Its success as an ectoparasite is associated with its capacity to disarm the antihemostatic and anti-inflammatory reactions of the host. Serpins are protease inhibitors with an important role in the modulation of host-parasite interactions. The cDNA that encodes for a R. microplus serpin was isolated by RACE and subsequently cloned into the pPICZ alpha A vector. Sequence analysis of the cDNA and predicted amino acid showed that this cDNA has a conserved serpin domain. B- and T-cell epitopes were predicted using bioinformatics tools. The recombinant R. microplus serpin (rRMS-3) was secreted into the culture media of Pichia pastoris after methanol induction at 0.2 mg l(-1) qRT-PCR expression analysis of tissues and life cycle stages demonstrated that RMS-3 was mainly expressed in the salivary glands of female adult ticks. Immunological recognition of the rRMS-3 and predicted B-cell epitopes was tested using tick-resistant and susceptible cattle sera. Only sera from tick-resistant bovines recognized the B-cell epitope AHYNPPPPIEFT (Seq7). The recombinant RMS-3 was expressed in P. pastoris, and ELISA screening also showed higher recognition by tick-resistant bovine sera. The results obtained suggest that RMS-3 is highly and specifically secreted into the bite site of R. microplus feeding on tick-resistant bovines. Capillary feeding of semi-engorged ticks with anti-AHYNPPPPIEFT sheep sera led to an 81.16% reduction in the reproduction capacity of R. microplus. Therefore, it is possible to conclude that R. microplus serpin (RMS-3) has an important role in the host-parasite interaction to overcome the immune responses in resistant cattle. (C) 2012 Elsevier GmbH. All rights reserved.

Improved optical character recognition by matched filtering

The effectiveness of linear matched filters for improved character discrimination in presence of random noise and poorly defined characters has been investigated. We have found that although the performance of the filter in presence of random noise is reasonably good (16 dB gain in signal-to-noise-ratio) its performance is poor when the unknown character is distorted (linear shift and rotation).

Mandelic acid-4-hydroxylase, a new inducible entyme from Image

A soluble fraction of Image catalyzed the hydroxylation of mandelic acid to Image -hydroxymandelic acid. The enzyme had a pH optimum of 5.4 and showed an absolute requirement for Fe2+, tetrahydropteridine, NADPH. Image -Hydroxymandelate, the product of the enzyme reaction was identified by paper chromatography, thin layer chromatography, UV and IR-spectra.

Improved optical character recognition by matched filtering

The effectiveness of linear matched filters for improved character discrimination in presence of random noise and poorly defined characters has been investigated. We have found that although the performance of the filter in presence of random noise is reasonably good (16 dB gain in signal-to-noise-ratio) its performance is poor when the unknown character is distorted (linear shift and rotation).

Number and proportion of selenocucleosides in the transfer RNA of Image Image

tRNA isolated from . grown in a medium containing [75Se] sodium selenosulfate was converted to nucleosides and analysed for selenonucleosides on a phosphocellulose column. Upon chromatography of the nucleosides on phosphocellulose column, the radioactivity resolved into three peaks. The first peak consisted of free selenium and traces of undigested nucleotides. The second peak was identified as 4-selenouridine by co-chromatographing with an authentic sample of 4-selenouridine. The identity of the third peak was not established. The second and third peaks represented 93% and 7% of the selenium present in nucleosides respectively.

Robust automatic face clustering in news video

Clustering identities in a video is a useful task to aid in video search, annotation and retrieval, and cast identification. However, reliably clustering faces across multiple videos is challenging task due to variations in the appearance of the faces, as videos are captured in an uncontrolled environment. A person's appearance may vary due to session variations including: lighting and background changes, occlusions, changes in expression and make up. In this paper we propose the novel Local Total Variability Modelling (Local TVM) approach to cluster faces across a news video corpus; and incorporate this into a novel two stage video clustering system. We first cluster faces within a single video using colour, spatial and temporal cues; after which we use face track modelling and hierarchical agglomerative clustering to cluster faces across the entire corpus. We compare different face recognition approaches within this framework. Experiments on a news video database show that the Local TVM technique is able effectively model the session variation observed in the data, resulting in improved clustering performance, with much greater computational efficiency than other methods.

A model for visual recognition of alphanumerics

In this paper we propose a hypothetical scheme for recognizing the alphanumerics. The scheme is based on the known physiological structure of the visual cortex and the concept of a short Lino extractor nouron (SLEN). We assumo four basic typca of such units for extracting vertical, horizontal, right and left inclined straight line segments. The patterns reconstructed from the scheme show perfect agreement with the test patterns. The model indicates that the recognition of letters T and H requires extraction of the largest number of features.

Class-specific sparse codes for representing activities

In this paper we investigate the effectiveness of class specific sparse codes in the context of discriminative action classification. The bag-of-words representation is widely used in activity recognition to encode features, and although it yields state-of-the art performance with several feature descriptors it still suffers from large quantization errors and reduces the overall performance. Recently proposed sparse representation methods have been shown to effectively represent features as a linear combination of an over complete dictionary by minimizing the reconstruction error. In contrast to most of the sparse representation methods which focus on Sparse-Reconstruction based Classification (SRC), this paper focuses on a discriminative classification using a SVM by constructing class-specific sparse codes for motion and appearance separately. Experimental results demonstrates that separate motion and appearance specific sparse coefficients provide the most effective and discriminative representation for each class compared to a single class-specific sparse coefficients.

Modeling Efficient Classification as a Process of Confidence Assessment and Delegation

In visual object detection and recognition, classifiers have two interesting characteristics: accuracy and speed. Accuracy depends on the complexity of the image features and classifier decision surfaces. Speed depends on the hardware and the computational effort required to use the features and decision surfaces. When attempts to increase accuracy lead to increases in complexity and effort, it is necessary to ask how much are we willing to pay for increased accuracy. For example, if increased computational effort implies quickly diminishing returns in accuracy, then those designing inexpensive surveillance applications cannot aim for maximum accuracy at any cost. It becomes necessary to find trade-offs between accuracy and effort. We study efficient classification of images depicting real-world objects and scenes. Classification is efficient when a classifier can be controlled so that the desired trade-off between accuracy and effort (speed) is achieved and unnecessary computations are avoided on a per input basis. A framework is proposed for understanding and modeling efficient classification of images. Classification is modeled as a tree-like process. In designing the framework, it is important to recognize what is essential and to avoid structures that are narrow in applicability. Earlier frameworks are lacking in this regard. The overall contribution is two-fold. First, the framework is presented, subjected to experiments, and shown to be satisfactory. Second, certain unconventional approaches are experimented with. This allows the separation of the essential from the conventional. To determine if the framework is satisfactory, three categories of questions are identified: trade-off optimization, classifier tree organization, and rules for delegation and confidence modeling. Questions and problems related to each category are addressed and empirical results are presented. For example, related to trade-off optimization, we address the problem of computational bottlenecks that limit the range of trade-offs. We also ask if accuracy versus effort trade-offs can be controlled after training. For another example, regarding classifier tree organization, we first consider the task of organizing a tree in a problem-specific manner. We then ask if problem-specific organization is necessary.