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.

The DISC1 Pathway in the Genetic Etiology of Schizophrenia

Schizophrenia is a severe psychotic disorder affecting 0.5-1 % of the population. The disorder is characterized by hallucinations; delusions; disorganized behavior and speech; avolition; anhedonia; flattened affect and cognitive deficits. The etiology of the disorder is complex with evidence for multiple genes contributing to the onset of the disorder along with environmental factors. DISC1 is one of the most promising candidate genes for schizophrenia. It codes for a protein which takes part in numerous molecular interactions along several pathways. This network, termed as the DISC1 pathway, is evidently important for the development and maturation of the central nervous system from the embryo until young adulthood. Disruption at these pathways is thought to predispose schizophrenia. In the present study, we have studied the DISC1 pathway in the etiology of schizophrenia in the Finnish population. We have utilized large Finnish samples; the schizophrenia family sample where DISC1 was originally shown to associate with schizophrenia and the Northern Finland birth cohort 1966 (NFBC66). Several DISC1 binding partners displayed evidence for association in the family sample along with DISC1. Through a genome-wide linkage study, we found a significant linkage signal to a locus where a DISC1 binding partner NDE1 is located at the carriers of a certain DISC1 risk variant. In a follow-up study, genetic markers in NDE1 displayed significant evidence for association with schizophrenia. Further exploration of association between 11 genes of the DISC1 pathway and schizophrenia led to recognition of novel variants in NDEL1, PDE4B and PDE4D that significantly either increased or decreased the risk for schizophrenia. Further, we found evidence that DISC1 itself has a significant role in the human mental functioning even in the healthy population. Variants in DISC1 had a significant effect on anhedonia which is a trait present at everybody but is in its severe form one of the main symptoms of schizophrenia and correlates with the risk of developing the disorder. Further, utilizing genome-wide marker data, we recognized three genes; MIR620; CCDC141 and LCT; that are closely related to the DISC1 pathway but which effects on anhedonia were observable only at the individuals who carried these specific DISC1 variants. Our findings significantly add up to the previous evidence for the involvement of DISC1 and the DISC1 pathway in the etiology of schizophrenia and psychosis. Our results support the concept of a number of DISC1 pathway related genes contributing in the etiology of schizophrenia along with DISC1 and provide new candidates for the studies of schizophrenia. Our findings also significantly increase the importance of DISC1 itself as having a role in psychological functioning in the general population.

Audience members watching the opening ceremonies of the Heidelberg festival, with opening speech given by Thomas Mann.

Typed caption: Festakt in der Stadthalle zur Eroeffnung der Heidelberger Festpiele 1929. Thomas Mann hielt die Festrede. Unsere Aufnahme zeigt einen Ausschnitt aus der Festversammlung, an der die geistige Prominenz Heidelbergs und zahlreiche bedeutende Persoenlichkeiten des deutschen Kulturlebends teilnahmen. Von links nach rechts in der 1. Reihe: Rene Schickele, Rudolf Rittner, Gustav Hargung, Prof. Dr. Martin Dibelius, Gerhart Hauptmann, Dr. Rudolf H. Goldschmidt, Oberbuergermeister Dr. Neinhaus, Thomas Mann und Frau, Kultusminister Leers, Rudolf G. Binding; In der 3. Reihe: Oberbaurat L. Schmieder, Nobelpreistraeger Dr. F. Bergius, Bankdirektor Fremerey, Prof. Hellpach, Prof. Radbruch

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.

Compressive Sensing For Sparsely Excited Speech Signals

Compressive sensing (CS) has been proposed for signals with sparsity in a linear transform domain. We explore a signal dependent unknown linear transform, namely the impulse response matrix operating on a sparse excitation, as in the linear model of speech production, for recovering compressive sensed speech. Since the linear transform is signal dependent and unknown, unlike the standard CS formulation, a codebook of transfer functions is proposed in a matching pursuit (MP) framework for CS recovery. It is found that MP is efficient and effective to recover CS encoded speech as well as jointly estimate the linear model. Moderate number of CS measurements and low order sparsity estimate will result in MP converge to the same linear transform as direct VQ of the LP vector derived from the original signal. There is also high positive correlation between signal domain approximation and CS measurement domain approximation for a large variety of speech spectra.

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).

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).

Activity recognition using binary tree SVM

This paper presents an effective classification method based on Support Vector Machines (SVM) in the context of activity recognition. Local features that capture both spatial and temporal information in activity videos have made significant progress recently. Efficient and effective features, feature representation and classification plays a crucial role in activity recognition. For classification, SVMs are popularly used because of their simplicity and efficiency; however the common multi-class SVM approaches applied suffer from limitations including having easily confused classes and been computationally inefficient. We propose using a binary tree SVM to address the shortcomings of multi-class SVMs in activity recognition. We proposed constructing a binary tree using Gaussian Mixture Models (GMM), where activities are repeatedly allocated to subnodes until every new created node contains only one activity. Then, for each internal node a separate SVM is learned to classify activities, which significantly reduces the training time and increases the speed of testing compared to popular the `one-against-the-rest' multi-class SVM classifier. Experiments carried out on the challenging and complex Hollywood dataset demonstrates comparable performance over the baseline bag-of-features method.

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.

Näkövammaisten tietokoneavusteinen tiedon hankinta

The study examines various uses of computer technology in acquisition of information for visually impaired people. For this study 29 visually impaired persons took part in a survey about their experiences concerning acquisition of infomation and use of computers, especially with a screen magnification program, a speech synthesizer and a braille display. According to the responses, the evolution of computer technology offers an important possibility for visually impaired people to cope with everyday activities and interacting with the environment. Nevertheless, the functionality of assistive technology needs further development to become more usable and versatile. Since the challenges of independent observation of environment were emphasized in the survey, the study led into developing a portable text vision system called Tekstinäkö. Contrary to typical stand-alone applications, Tekstinäkö system was constructed by combining devices and programs that are readily available on consumer market. As the system operates, pictures are taken by a digital camera and instantly transmitted to a text recognition program in a laptop computer that talks out loud the text using a speech synthesizer. Visually impaired test users described that even unsure interpretations of the texts in the environment given by Tekstinäkö system are at least a welcome addition to complete perception of the environment. It became clear that even with a modest development work it is possible to bring new, useful and valuable methods to everyday life of disabled people. Unconventional production process of the system appeared to be efficient as well. Achieved results and the proposed working model offer one suggestion for giving enough attention to easily overlooked needs of the people with special abilities. ACM Computing Classification System (1998): K.4.2 Social Issues: Assistive technologies for persons with disabilities I.4.9 Image processing and computer vision: Applications Keywords: Visually impaired, computer-assisted, information, acquisition, assistive technology, computer, screen magnification program, speech synthesizer, braille display, survey, testing, text recognition, camera, text, perception, picture, environment, trasportation, guidance, independence, vision, disabled, blind, speech, synthesizer, braille, software engineering, programming, program, system, freeware, shareware, open source, Tekstinäkö, text vision, TopOCR, Autohotkey, computer engineering, computer science

On the Specificity of Carbohydrate-Lectin Recognition The Interaction of a Lectin from Ricinus communis Beans with Simple Saccharides and Concanavalin A

A galactose-specific protein (RC1) isolated from Ricinus communis beans was found to give a precipitin reaction with concanavalin A. Its carbohydrate content amounted to 8–9% of the total protein and was found to be rich in mannose. The interaction of RC1 with galactose and lactose was measured in 0.05 M phosphate buffer containing 0.2 M NaCl (pH 6.8) by the method of conventional equilibrium dialysis. From the analysis of the binding data according to Scatchard method the association constant (Ka) at 5°C was calculated as 3.8 mM−1 and 1.2 mM−1 for lactose and galactose, respectively. In both cases the number of binding sites per molecule of RC1 with molecular weight of 120000 was found to be 2. From the temperature-dependent Ka values for the binding of lactose, the values of –5.7 kcal/mol and –4.3 cal × mol−1× K−1 were calculated for ΔH and ΔS, respectively. The addition of concanavalin A to RC1 or vice versa led to the formation of the insoluble complex RC1· ConA4 containing one molecule of RC1 and one molecule of tetrameric concanavalin A (ConA4) which could be dissociated upon addition of concanavalin A-specific sugars. The complex formation results in a time-dependent appearance of turbidity in the time range from 10s to 10 min. From the measurement of the time-dependent appearance and disappearance of the turbidity the formation (kf) and dissociation (kd) rate constants were calculated as 3 mM−1× s−1 and 0.07 ks−1 respectively. The ratio kf/kd (43μM −1), that corresponds to the association constant of complex RC1· ConA4, is higher than that of mannoside · ConA4 and thereby suggests that protein-protein interaction contributes significantly in stabilising glycoprotein · lectin complexes. The relevance of this finding to the understanding of the chemical specificities that are involved in a model cell-lectin interaction is discussed.

Identification of key DNA elements involved in promoter recognition by Mxr1p, a master regulator of methanol utilization pathway in Pichia pastoris

Mxr1p (methanol expression regulator 1) functions as a key regulator of methanol metabolism in the methylotrophic yeast Pichia pastoris. In this study, a recombinant Mxr1p protein containing the N-terminal zinc finger DNA binding domain was overexpressed and purified from E coli cells and its ability to bind to promoter sequences of AOXI encoding alcohol oxidase was examined. In the AOXI promoter, Mxr1p binds at six different regions. Deletions encompassing these regions result in a significant decrease in AOXI promoter activity in vivo. Based on the analysis of AOXI promoter sequences, a consensus sequence for Mxr1p binding consisting of a core 5' CYCC 3' motif was identified. When the core CYCC sequence is mutated to CYCA, CYCT or CYCM (M = 5-methylcytosine), Mxr1p binding is abolished. Though Mxr1p is the homologue of Saccharomyces cerevisiae Adr1p transcription factor, it does not bind to Adr1p binding site of S. cerevisiae alcohol dehydrogenase promoter (ADH2UAS1). However, two point mutations convert ADH2UAS1 into an Mxr1p binding site. The identification of key DNA elements involved in promoter recognition by Mxr1p is an important step in understanding its function as a master regulator of the methanol utilization pathway in P. pastoris.

Robust and High-resolution Voiced/Unvoiced Classification in Noisy Speech Using A Signal Smoothness Criterion

We propose a novel technique for robust voiced/unvoiced segment detection in noisy speech, based on local polynomial regression. The local polynomial model is well-suited for voiced segments in speech. The unvoiced segments are noise-like and do not exhibit any smooth structure. This property of smoothness is used for devising a new metric called the variance ratio metric, which, after thresholding, indicates the voiced/unvoiced boundaries with 75% accuracy for 0dB global signal-to-noise ratio (SNR). A novelty of our algorithm is that it processes the signal continuously, sample-by-sample rather than frame-by-frame. Simulation results on TIMIT speech database (downsampled to 8kHz) for various SNRs are presented to illustrate the performance of the new algorithm. Results indicate that the algorithm is robust even in high noise levels.