Abstract

The ever increasing data on world wide web calls for the use of vertical search engines. Sandhan is one such search engine which offers search in tourism and health genres in more than 10 different Indian languages. In this work we build a URL based genre identification module for Sandhan. A direct impact of this work is on building focused crawlers to gather Indian language content. We conduct experiments on tourism and health web pages in Hindi language. We experiment with three approaches-list based, naive Bayes and incremental naive Bayes. We evaluate our approaches against another web page classification algorithm built on the parsed text of manually labeled web pages. We find that incremental naive Bayes approach outperforms the other two. While doing our experiments we work with different features like words, n-grams and all grams. Using n-gram features we achieve classification accuracies of 0.858 and 0.873 for tourism and health genres respectively.

Abstract

This paper presents a novel answer summarization approach for community Question Answering services (cQAs) to address the problem of “incomplete answer”, i.e., missing valuable information from the “best answer” of a complex multi-sentence question, which can be obtained from other answers to the same question. Our method automatically generate a novel and non-redundant summary from cQA answers using structured determinantal point processes (SDPP). Experimental evaluation on sample dataset from Yahoo Answers shows significant improvement over baseline approaches.

Abstract

Legal judgements are complex in nature and contain cita-tions to other judgements. Research efforts are going on to develop meth-ods for efficient search of relevant legal information by extending the pop-ular approaches used in information retrieval and web searching research areas. In the literature, it was shown that it is possible to find similarjudgements by exploiting citations or links. In this paper, an approachh as been has been proposed using the notion of “paragraph-link” to im-prove the efficiency of link-based similarity method. The experiments on real-world data set and user evaluation study show the encouraging results.

Abstract

Toggle navigation CCSD. HAL: HAL; HALSHS; TEL; MédiHAL; Liste des portails; AURéHAL; API; Data; Documentation. Episciences.org: Episciences.org; Revues; Documentation. Sciencesconf.org; Support. Connexion: Connexion; Connexion avec ORCID; se connecter avec Fédération; Créer un compte; Mot de passe oublié ? Login oublié ? fr; en. HAL - hal.archives-ouvertes.fr. Accueil; Déposer; Consulter: par thème arXiv; Par type de document; Les derniers dépôts; par année de publication; par laboratoire; —————; HAL; TEL; INSPIRE-HEP; ArXiv; CDS - CERN. Rechercher. in2p3-01577700, version 1. Structure, energetics, and dynamics of smectite clay hydration: Molecular dynamics investigations of hectorite” (oral). Christin P. Morrow A. Ozgur Yazaydin 1 Marimuthu Krishnan Geoffrey M. Bowers Andrey G. Kalinichev 2 R. James Kirkpatrick Détails. 1 Department of Chemistry. 2 SUBATECH - Laboratoire

Abstract

The relationship between the NMR methyl group axial order parameter and the side chain conformational entropy is investigated in inhibitor-bound and apo human HIV protease using molecular dynamics simulation. Three distinct entropic classes of methyl-bearing side chains, determined by the topological distance of the methyl group from the protein backbone (i.e., the number of χ-bonds between the Cα and the carbon of the CH3 group), are revealed by atomistic trajectory analyses performed in the local frame of reference of individual methyl probes. The results demonstrate that topologically equivalent methyl groups experience similar nonbonded microenvironments regardless of the type of residues to which they are attached. Similarly, methyl groups that belong to the same side chain but that are not topologically equivalent exhibit different thermodynamic and dynamic properties. The two-parameter classification (based upon entropy and methyl axial order parameter) of side chains described here permits improved estimates of the conformational entropies of proteins from NMR motional parameters.

Abstract

The past few years have witnessed the development of non-spherical metal nanoparticles with complex morphologies, which offer tremendous potential in materials science, chemistry, physics and medicine. Covering all important aspects and techniques of preparation and characterization of metal nanoparticles with controlled morphology and architecture, this book provides a sound overview-from the basics right up to recent developments. Renowned research scientists from all over the world present the existing knowledge in the field, covering theory and modeling, synthesis and properties of these nanomaterials. By emphasizing the underlying concepts and principles in detail, this book enables researchers to fully recognize the future research scope and the application potential of the complex-shaped metal nanoparticles, inspiring further research in this field.

Abstract

Labels associated with social images are valuable source of information for tasks of image annotation, understanding and retrieval. These labels are often found to be noisy, mainly due to the collaborative tagging activities of users. Existing methods on annotation have been developed and verified on noise free labels of images. In this paper, we propose a novel and generic framework that exploits the collective knowledge embedded in noisy label co-occurrence pairs to derive robust annotations. We compare our method with a well-known image annotation algorithm and show its superiority in terms of annotation accuracy on benchmark Corel5K and ESP datasets in presence of noisy labels.

Abstract

In this work, we aim at understanding semantic interaction among graspable objects in both direct and indirect physical contact for robotic manipulation tasks. Given an object of interest, its support relationship with other graspable objects is inferred hierarchically. The support relationship is used to predict the “support order” or the order in which the surrounding objects need to be removed in order to manipulate the target object. We believe, this can extend the scope of robotic manipulation tasks to typical clutter involving physical contact, overlap and objects of generic shapes and sizes. We have created an RGBD dataset consisting of various objects present in clutter using Kinect. We conducted our experimentation and analysed the performance of our work on the images from the same dataset.

Abstract

Labels associated with social images are valuable source of information for tasks of image annotation, understanding and retrieval.These labels are often found to be noisy, mainly due to the collabo-rative tagging activities of users. Existing methods on annotation havebeen developed and verified on noise free labels of images. In this paper,we propose a novel and generic framework that exploits the collective knowledge embedded in noisy label co-occurrence pairs to derive robust annotations. We compare our method with a well-known image annota-tion algorithm and show its superiority in terms of annotation accuracy on benchmark Corel5K and ESP datasets in presence of noisy labels.

Abstract

Detecting compact overlapping communities in large networks is an important pattern recognition proble mwith applications in many domains. Most community de-tection algorithms trade-off between community sizes, their compactness and the scalability of finding communities. Clique Percolation Method (CPM) [1] and Local Fitness Maximization(LFM) [2] are two prominent and commonly used overlapping community detection methods that scale with large networks.However, significant number of communities found by the mare large, noisy, and loose. In this paper, we propose a general algorithm that takes such large and loose communities generated by any method and refines them into compact com-munities in a systematic fashion. We define a new measure of community-ness based on eigenvector centrality, identify loose communities using this measure and propose an algorithm for partitioning such loose communities into compact communities.We refine the communities found by CPM and LFM using our method and show their effectiveness compared to the original communities in a recommendation engine task.