149 resultados para Tensor Encoding
Resumo:
Infectious cDNA clones of RNA viruses are important research tools, but flavivirus cDNA clones have proven difficult to assemble and propagate in bacteria. This has been attributed to genetic instability and/or host cell toxicity, however the mechanism leading to these difficulties has not been fully elucidated. Here we identify and characterize an efficient cryptic bacterial promoter in the cDNA encoding the dengue virus (DENV) 5′ UTR. Following cryptic transcription in E. coli, protein expression initiated at a conserved in-frame AUG that is downstream from the authentic DENV initiation codon, yielding a DENV polyprotein fragment that was truncated at the N-terminus. A more complete understanding of constitutive viral protein expression in E. coli might help explain the cloning and propagation difficulties generally observed with flavivirus cDNA.
Resumo:
In information retrieval, a user's query is often not a complete representation of their real information need. The user's information need is a cognitive construction, however the use of cognitive models to perform query expansion have had little study. In this paper, we present a cognitively motivated query expansion technique that uses semantic features for use in ad hoc retrieval. This model is evaluated against a state-of-the-art query expansion technique. The results show our approach provides significant improvements in retrieval effectiveness for the TREC data sets tested.
Resumo:
We propose to use the Tensor Space Modeling (TSM) to represent and analyze the user’s web log data that consists of multiple interests and spans across multiple dimensions. Further we propose to use the decomposition factors of the Tensors for clustering the users based on similarity of search behaviour. Preliminary results show that the proposed method outperforms the traditional Vector Space Model (VSM) based clustering.
Resumo:
Existing recommendation systems often recommend products to users by capturing the item-to-item and user-to-user similarity measures. These types of recommendation systems become inefficient in people-to-people networks for people to people recommendation that require two way relationship. Also, existing recommendation methods use traditional two dimensional models to find inter relationships between alike users and items. It is not efficient enough to model the people-to-people network with two-dimensional models as the latent correlations between the people and their attributes are not utilized. In this paper, we propose a novel tensor decomposition-based recommendation method for recommending people-to-people based on users profiles and their interactions. The people-to-people network data is multi-dimensional data which when modeled using vector based methods tend to result in information loss as they capture either the interactions or the attributes of the users but not both the information. This paper utilizes tensor models that have the ability to correlate and find latent relationships between similar users based on both information, user interactions and user attributes, in order to generate recommendations. Empirical analysis is conducted on a real-life online dating dataset. As demonstrated in results, the use of tensor modeling and decomposition has enabled the identification of latent correlations between people based on their attributes and interactions in the network and quality recommendations have been derived using the 'alike' users concept.
Resumo:
In this work, a Langevin dynamics model of the diffusion of water in articular cartilage was developed. Numerical simulations of the translational dynamics of water molecules and their interaction with collagen fibers were used to study the quantitative relationship between the organization of the collagen fiber network and the diffusion tensor of water in model cartilage. Langevin dynamics was used to simulate water diffusion in both ordered and partially disordered cartilage models. In addition, an analytical approach was developed to estimate the diffusion tensor for a network comprising a given distribution of fiber orientations. The key findings are that (1) an approximately linear relationship was observed between collagen volume fraction and the fractional anisotropy of the diffusion tensor in fiber networks of a given degree of alignment, (2) for any given fiber volume fraction, fractional anisotropy follows a fiber alignment dependency similar to the square of the second Legendre polynomial of cos(θ), with the minimum anisotropy occurring at approximately the magic angle (θMA), and (3) a decrease in the principal eigenvalue and an increase in the transverse eigenvalues is observed as the fiber orientation angle θ progresses from 0◦ to 90◦. The corresponding diffusion ellipsoids are prolate for θ < θMA, spherical for θ ≈ θMA, and oblate for θ > θMA. Expansion of the model to include discrimination between the combined effects of alignment disorder and collagen fiber volume fraction on the diffusion tensor is discussed.
Resumo:
In the field of face recognition, Sparse Representation (SR) has received considerable attention during the past few years. Most of the relevant literature focuses on holistic descriptors in closed-set identification applications. The underlying assumption in SR-based methods is that each class in the gallery has sufficient samples and the query lies on the subspace spanned by the gallery of the same class. Unfortunately, such assumption is easily violated in the more challenging face verification scenario, where an algorithm is required to determine if two faces (where one or both have not been seen before) belong to the same person. In this paper, we first discuss why previous attempts with SR might not be applicable to verification problems. We then propose an alternative approach to face verification via SR. Specifically, we propose to use explicit SR encoding on local image patches rather than the entire face. The obtained sparse signals are pooled via averaging to form multiple region descriptors, which are then concatenated to form an overall face descriptor. Due to the deliberate loss spatial relations within each region (caused by averaging), the resulting descriptor is robust to misalignment & various image deformations. Within the proposed framework, we evaluate several SR encoding techniques: l1-minimisation, Sparse Autoencoder Neural Network (SANN), and an implicit probabilistic technique based on Gaussian Mixture Models. Thorough experiments on AR, FERET, exYaleB, BANCA and ChokePoint datasets show that the proposed local SR approach obtains considerably better and more robust performance than several previous state-of-the-art holistic SR methods, in both verification and closed-set identification problems. The experiments also show that l1-minimisation based encoding has a considerably higher computational than the other techniques, but leads to higher recognition rates.
Resumo:
This thesis makes several contributions towards improved methods for encoding structure in computational models of word meaning. New methods are proposed and evaluated which address the requirement of being able to easily encode linguistic structural features within a computational representation while retaining the ability to scale to large volumes of textual data. Various methods are implemented and evaluated on a range of evaluation tasks to demonstrate the effectiveness of the proposed methods.
Resumo:
Reports of children and teachers taking transformative social action in schools are becoming rare. This session illustrates how teachers, while feeling the weight of accountability testing in schools, are active agents who can re-imagine literacy pedagogy to change elements of their community. It reports the critical dimensions of a movie-making unit with Year 5 students within a school reform project. The students filmed interviews with people in the local shops to gather lay-knowledge and experiences of the community. The short documentaries challenged stereotypes about what it is like to live in Logan, and critically identified potential improvements to public spaces in the local community. A student panel presented these multimodal texts at a national conference of social activists and community leaders. The report does not valorize or privilege local or lay knowledge over dominant knowledge, but argues that prescribed curriculum should not hinder the capacity for critical consciousness.
Resumo:
Monte Carlo simulations were used to investigate the relationship between the morphological characteristics and the diffusion tensor (DT) of partially aligned networks of cylindrical fibres. The orientation distributions of the fibres in each network were approximately uniform within a cone of a given semi-angle (θ0). This semi-angle was used to control the degree of alignment of the fibres. The networks studied ranged from perfectly aligned (θ0 = 0) to completely disordered (θ0 = 90°). Our results are qualitatively consistent with previous numerical models in the overall behaviour of the DT. However, we report a non-linear relationship between the fractional anisotropy (FA) of the DT and collagen volume fraction, which is different to the findings from previous work. We discuss our results in the context of diffusion tensor imaging of articular cartilage. We also demonstrate how appropriate diffusion models have the potential to enable quantitative interpretation of the experimentally measured diffusion-tensor FA in terms of collagen fibre alignment distributions.
Resumo:
Potato leafroll virus (PLRV) is a positive-strand RNA virus that generates subgenomic RNAs (sgRNA) for expression of 3' proximal genes. Small RNA (sRNA) sequencing and mapping of the PLRV-derived sRNAs revealed coverage of the entire viral genome with the exception of four distinctive gaps. Remarkably, these gaps mapped to areas of PLRV genome with extensive secondary structures, such as the internal ribosome entry site and 5' transcriptional start site of sgRNA1 and sgRNA2. The last gap mapped to ~500. nt from the 3' terminus of PLRV genome and suggested the possible presence of an additional sgRNA for PLRV. Quantitative real-time PCR and northern blot analysis confirmed the expression of sgRNA3 and subsequent analyses placed its 5' transcriptional start site at position 5347 of PLRV genome. A regulatory role is proposed for the PLRV sgRNA3 as it encodes for an RNA-binding protein with specificity to the 5' of PLRV genomic RNA. © 2013.
Resumo:
Barley yellow dwarf virus-PAV (BYDV-PAV) is the most serious and widespread virus of cereals worldwide. Natural resistance genes against this luteovirus give inadequate control, and previous attempts to introduce synthetic resistance into cereals have produced variable results. In an attempt to generate barley with protection against BYDV-PAV, plants were transformed with a transgene designed to produce hairpin (hp)RNA containing BYDV-PAV sequences. From 25 independent barley lines transformed with the BYDV-PAV hpRNA construct, nine lines showed extreme resistance to the virus and the majority of these contained a single transgene. In the progeny of two independent transgenic lines, inheritance of a single transgene consistently correlated with protection against BYDV-PAV. This protection was rated as immunity because the virus could not be detected in the challenged plants by ELISA nor recovered by aphid feeding experiments. In the field, BYDV-PAV is sometimes associated with the related luteovirus Cereal yellow dwarf virus-RPV (CYDV-RPV). When the transgenic plants were challenged with BYDV-PAV and CYDV-RPV together, the plants were susceptible to CYDV-RPV but immune to BYDV-PAV. This shows that the immunity is virus-specific and not broken down by the presence of CYDV. It suggests that CYDV-RPV does not encode a silencing-suppressor gene or that its product does not protect BYDV-PAV against the plant's RNAi-like defence mechanism. Either way, our results indicate that the BYDV-PAV immunity will be robust in the field and is potentially useful in minimizing losses in cereal production worldwide.
Resumo:
Cold-active lipases are of significant interest as biocatalysts in industrial processes. We have identified a lipase that displayed activity towards long carbon-chain-p-nitrophenyl substrates (C12–C18) at 25 °C from the culture supernatant of an Antarctic Penicillium expansum strain assigned P. expansum SM3. Zymography revealed a protein band of around 30 kDa with activity towards olive oil. DNA fragments of a lipase gene designated as lipPE were isolated from the genomic DNA of P. expansum SM3 by genomic walking PCR. Subsequently, the complete genomic lipPE gene was amplified using gene-specific primers designed from the 5′- and 3′-regions. Reverse transcription PCR was used to amplify the lipPE cDNA. The deduced amino acid sequence consisted of 285 residues that included a predicted signal peptide. Three peptides identified by LC/MS/MS analysis of the proteins in the culture supernatant of P. expansum were also present in the deduced amino acid sequence of the lipPE gene suggesting that this gene encoded the lipase identified by initial zymogram activity analysis. Full analysis of the nucleotide and the deduced amino acid sequences indicated that the lipPE gene encodes a novel P. expansum lipase. The lipPE gene was expressed in E. coli for further characterization of the enzyme with a view of assessing its suitability for industrial applications.
Resumo:
Restriction fragment length polymorphisms have been used to determine the chromosomal location of the genes encoding the glycine decarboxylase complex (GDC) and serine hydroxymethyltransferase (SHMT) of pea leaf mitochondria. The genes encoding the H subunit of GDC and the genes encoding SHMT both show linkage to the classical group I marker i. In addition, the genes for the P protein of GDC show linkage to the classic group I marker a. The genes for the L and T proteins of GDC are linked to one another and are probably situated on the satellite of chromosome 7. The mRNAs encoding the five polypeptides that make up GDC and SHMT are strongly induced when dark-grown etiolated pea seedlings are placed in the light. Similarly, when mature plants are placed in the dark for 48 h, the levels of both GDC protein and SHMT mRNAs decline dramatically and then are induced strongly when these plants are returned to the light. During both treatments a similar pattern of mRNA induction is observed, with the mRNA encoding the P protein of GDC being the most rapidly induced and the mRNA for the H protein the slowest. Whereas during the greening of etiolated seedlings the polypeptides of GDC and SHMT show patterns of accumulation similar to those of the corresponding mRNAs, very little change in the level of the polypeptides is seen when mature plants are placed in the dark and then re-exposed to the light.
Resumo:
Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account manifold geometry is typically done via (1) embedding the manifolds in tangent spaces, or (2) embedding into Reproducing Kernel Hilbert Spaces (RKHS). While embedding into tangent spaces allows the use of existing Euclidean-based learning algorithms, manifold shape is only approximated which can cause loss of discriminatory information. The RKHS approach retains more of the manifold structure, but may require non-trivial effort to kernelise Euclidean-based learning algorithms. In contrast to the above approaches, in this paper we offer a novel solution that allows SPD matrices to be used with unmodified Euclidean-based learning algorithms, with the true manifold shape well-preserved. Specifically, we propose to project SPD matrices using a set of random projection hyperplanes over RKHS into a random projection space, which leads to representing each matrix as a vector of projection coefficients. Experiments on face recognition, person re-identification and texture classification show that the proposed approach outperforms several recent methods, such as Tensor Sparse Coding, Histogram Plus Epitome, Riemannian Locality Preserving Projection and Relational Divergence Classification.
Resumo:
A common problem with the use of tensor modeling in generating quality recommendations for large datasets is scalability. In this paper, we propose the Tensor-based Recommendation using Probabilistic Ranking method that generates the reconstructed tensor using block-striped parallel matrix multiplication and then probabilistically calculates the preferences of user to rank the recommended items. Empirical analysis on two real-world datasets shows that the proposed method is scalable for large tensor datasets and is able to outperform the benchmarking methods in terms of accuracy.