Query Click and Text Similarity Graph for Query Suggestions

Query suggestion is an important feature of the search engine with the explosive and diverse growth of web contents. Different kind of suggestions like query, image, movies, music and book etc. are used every day. Various types of data sources are used for the suggestions. If we model the data into various kinds of graphs then we can build a general method for any suggestions. In this paper, we have proposed a general method for query suggestion by combining two graphs: (1) query click graph which captures the relationship between queries frequently clicked on common URLs and (2) query text similarity graph which finds the similarity between two queries using Jaccard similarity. The proposed method provides literally as well as semantically relevant queries for users' need. Simulation results show that the proposed algorithm outperforms heat diffusion method by providing more number of relevant queries. It can be used for recommendation tasks like query, image, and product suggestion.

Note on the Similarity Solutions of Unsteady Jets in Rotating Fluids

The structure of time dependent jets in rotating fluids using similarity transformations is studied theoretically for which exact solutions are discussed. Approximate solution using a modified yon Mises transformation is also explored.

Dynamics Of Thermotropic Liquid Crystals Across The Isotropic-Nematic Transition And Their Similarity With Glassy Relaxation In Supercooled Liquids

No abstract.

A detailed study of Li-DNA fibres at various salt concentrations reveals a non-helical B-DNA and a possible similarity of solution and solid state structures

A thorough investigation of salt concentration dependence of lithium DNA fibres is made using X-ray diffraction. While for low salt the C-form pattern is obtained, crystalline B-type diffraction patterns result on increasing the salt concentration. The salt content in the gel (from which fibres are drawn) is estimated by equilibrium dialysis using the Donnan equilibrium principle. The salt range giving the best crystalline B pattern is determined. It is found that in this range meridional reflections occur on the fourth and sixth layer lines. In addition, the tenth layer meridian is absent at a particular salt concentration. These results strongly suggest the presence of non-helical features in the DNA molecule. Preliminary analysis of the diffraction patterns indicates a structural variability within the B-form itself. Further, the possibility of the structural parameters of DNA being similar in solid state and in solution is discussed.

Robust heuristics for scalable optimization of complex SQL queries

Modern database systems incorporate a query optimizer to identify the most efficient "query execution plan" for executing the declarative SQL queries submitted by users. A dynamic-programming-based approach is used to exhaustively enumerate the combinatorially large search space of plan alternatives and, using a cost model, to identify the optimal choice. While dynamic programming (DP) works very well for moderately complex queries with up to around a dozen base relations, it usually fails to scale beyond this stage due to its inherent exponential space and time complexity. Therefore, DP becomes practically infeasible for complex queries with a large number of base relations, such as those found in current decision-support and enterprise management applications. To address the above problem, a variety of approaches have been proposed in the literature. Some completely jettison the DP approach and resort to alternative techniques such as randomized algorithms, whereas others have retained DP by using heuristics to prune the search space to computationally manageable levels. In the latter class, a well-known strategy is "iterative dynamic programming" (IDP) wherein DP is employed bottom-up until it hits its feasibility limit, and then iteratively restarted with a significantly reduced subset of the execution plans currently under consideration. The experimental evaluation of IDP indicated that by appropriate choice of algorithmic parameters, it was possible to almost always obtain "good" (within a factor of twice of the optimal) plans, and in the few remaining cases, mostly "acceptable" (within an order of magnitude of the optimal) plans, and rarely, a "bad" plan. While IDP is certainly an innovative and powerful approach, we have found that there are a variety of common query frameworks wherein it can fail to consistently produce good plans, let alone the optimal choice. This is especially so when star or clique components are present, increasing the complexity of th- e join graphs. Worse, this shortcoming is exacerbated when the number of relations participating in the query is scaled upwards.

An exact similarity solution in radiation-gas-dynamics

We have found an exact similarity solution of the point explosion problem in the case when the total energy of the shock wave that is produced is not constant but decreases with time and when the loss due to radiation escape is significant. We have compared the results of our exact solution with those of exact numerical solutions of Elliot and Wang and have explained the cause why our solution differs from theirs in certain aspects.

Extended self-similarity works for the Burgers equation and why

Extended self-similarity (ESS), a procedure that remarkably extends the range of scaling for structure functions in Navier-Stokes turbulence and thus allows improved determination of intermittency exponents, has never been fully explained. We show that ESS applies to Burgers turbulence at high Reynolds numbers and we give the theoretical explanation of the numerically observed improved scaling at both the IR and UV end, in total a gain of about three quarters of a decade: there is a reduction of subdominant contributions to scaling when going from the standard structure function representation to the ESS representation. We conjecture that a similar situation holds for three-dimensional incompressible turbulence and suggest ways of capturing subdominant contributions to scaling.

Efficiency of nonhomologous DNA end joining varies among somatic tissues, despite similarity in mechanism

Failure to repair DNA double-strand breaks (DSBs) can lead to cell death or cancer. Although nonhomologous end joining (NHEJ) has been studied extensively in mammals, little is known about it in primary tissues. Using oligomeric DNA mimicking endogenous DSBs, NHEJ in cell-free extracts of rat tissues were studied. Results show that efficiency of NHEJ is highest in lungs compared to other somatic tissues. DSBs with compatible and blunt ends joined without modifications, while noncompatible ends joined with minimal alterations in lungs and testes. Thymus exhibited elevated joining, followed by brain and spleen, which could be correlated with NHEJ gene expression. However, NHEJ efficiency was poor in terminally differentiated organs like heart, kidney and liver. Strikingly, NHEJ junctions from these tissues also showed extensive deletions and insertions. Hence, for the first time, we show that despite mode of joining being generally comparable, efficiency of NHEJ varies among primary tissues of mammals.

Identification of Local Conformational Similarity in Structurally Variable Regions of Homologous Proteins Using Protein Blocks

Structure comparison tools can be used to align related protein structures to identify structurally conserved and variable regions and to infer functional and evolutionary relationships. While the conserved regions often superimpose well, the variable regions appear non superimposable. Differences in homologous protein structures are thought to be due to evolutionary plasticity to accommodate diverged sequences during evolution. One of the kinds of differences between 3-D structures of homologous proteins is rigid body displacement. A glaring example is not well superimposed equivalent regions of homologous proteins corresponding to a-helical conformation with different spatial orientations. In a rigid body superimposition, these regions would appear variable although they may contain local similarity. Also, due to high spatial deviation in the variable region, one-to-one correspondence at the residue level cannot be determined accurately. Another kind of difference is conformational variability and the most common example is topologically equivalent loops of two homologues but with different conformations. In the current study, we present a refined view of the ``structurally variable'' regions which may contain local similarity obscured in global alignment of homologous protein structures. As structural alphabet is able to describe local structures of proteins precisely through Protein Blocks approach, conformational similarity has been identified in a substantial number of `variable' regions in a large data set of protein structural alignments; optimal residue-residue equivalences could be achieved on the basis of Protein Blocks which led to improved local alignments. Also, through an example, we have demonstrated how the additional information on local backbone structures through protein blocks can aid in comparative modeling of a loop region. In addition, understanding on sequence-structure relationships can be enhanced through our approach. This has been illustrated through examples where the equivalent regions in homologous protein structures share sequence similarity to varied extent but do not preserve local structure.

Similarity solution of unsteady boundary layer equations with a magnetic field

The unsteady laminar incompressible boundary layer flow of an electrically conducting fluid in the stagnation region of two-dimensional and axisymmetric bodies with an applied magnetic field has been studied. The boundary layer equations which are parabolic partial differential equations with three independent variables have been reduced to a system of ordinary differential equations by using suitable transformations and then solved numerically using a shooting method. Here, we have obtained new solutions which are solutions of both the boundary layer and Navier-Stokes equations.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Sequence-Structure Similarity: Do Sequentially Identical Peptide Fragments have Similar Three-Dimensional Structures?

The rapidly growing structure databases enhance the probability of finding identical sequences sharing structural similarity. Structure prediction methods are being used extensively to abridge the gap between known protein sequences and the solved structures which is essential to understand its specific biochemical and cellular functions. In this work, we plan to study the ambiguity between sequence-structure relationships and examine if sequentially identical peptide fragments adopt similar three-dimensional structures. Fragments of varying lengths (five to ten residues) were used to observe the behavior of sequence and its three-dimensional structures. The STAMP program was used to superpose the three-dimensional structures and the two parameters (Sequence Structure Similarity Score (Sc) and Root Mean Square Deviation value) were employed to classify them into three categories: similar, intermediate and dissimilar structures. Furthermore, the same approach was carried out on all the three-dimensional protein structures solved in the two organisms, Mycobacterium tuberculosis and Plasmodium falciparum to validate our results.

Positive Relationships between Association Strength and Phenotypic Similarity Characterize the Assembly of Mixed-Species Bird Flocks Worldwide

Competition theory predicts that local communities should consist of species that are more dissimilar than expected by chance. We find a strikingly different pattern in a multicontinent data set (55 presence-absence matrices from 24 locations) on the composition of mixed-species bird flocks, which are important sub-units of local bird communities the world over. By using null models and randomization tests followed by meta-analysis, we find the association strengths of species in flocks to be strongly related to similarity in body size and foraging behavior and higher for congeneric compared with noncongeneric species pairs. Given the local spatial scales of our individual analyses, differences in the habitat preferences of species are unlikely to have caused these association patterns; the patterns observed are most likely the outcome of species interactions. Extending group-living and social-information-use theory to a heterospecific context, we discuss potential behavioral mechanisms that lead to positive interactions among similar species in flocks, as well as ways in which competition costs are reduced. Our findings highlight the need to consider positive interactions along with competition when seeking to explain community assembly.

Efficient external memory structures for range-aggregate queries

We present external memory data structures for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R-d, compute the aggregate of the weights of the points that lie inside a d-dimensional orthogonal query rectangle. The aggregates we consider in this paper include COUNT, sum, and MAX. First, we develop a structure for answering two-dimensional range-COUNT queries that uses O(N/B) disk blocks and answers a query in O(log(B) N) I/Os, where N is the number of input points and B is the disk block size. The structure can be extended to obtain a near-linear-size structure for answering range-sum queries using O(log(B) N) I/Os, and a linear-size structure for answering range-MAX queries in O(log(B)(2) N) I/Os. Our structures can be made dynamic and extended to higher dimensions. (C) 2012 Elsevier B.V. All rights reserved.