WorldWideScience

Sample records for profile similarity search

  1. The HMMER Web Server for Protein Sequence Similarity Search.

    Science.gov (United States)

    Prakash, Ananth; Jeffryes, Matt; Bateman, Alex; Finn, Robert D

    2017-12-08

    Protein sequence similarity search is one of the most commonly used bioinformatics methods for identifying evolutionarily related proteins. In general, sequences that are evolutionarily related share some degree of similarity, and sequence-search algorithms use this principle to identify homologs. The requirement for a fast and sensitive sequence search method led to the development of the HMMER software, which in the latest version (v3.1) uses a combination of sophisticated acceleration heuristics and mathematical and computational optimizations to enable the use of profile hidden Markov models (HMMs) for sequence analysis. The HMMER Web server provides a common platform by linking the HMMER algorithms to databases, thereby enabling the search for homologs, as well as providing sequence and functional annotation by linking external databases. This unit describes three basic protocols and two alternate protocols that explain how to use the HMMER Web server using various input formats and user defined parameters. © 2017 by John Wiley & Sons, Inc. Copyright © 2017 John Wiley & Sons, Inc.

  2. Similarity-based search of model organism, disease and drug effect phenotypes

    KAUST Repository

    Hoehndorf, Robert

    2015-02-19

    Background: Semantic similarity measures over phenotype ontologies have been demonstrated to provide a powerful approach for the analysis of model organism phenotypes, the discovery of animal models of human disease, novel pathways, gene functions, druggable therapeutic targets, and determination of pathogenicity. Results: We have developed PhenomeNET 2, a system that enables similarity-based searches over a large repository of phenotypes in real-time. It can be used to identify strains of model organisms that are phenotypically similar to human patients, diseases that are phenotypically similar to model organism phenotypes, or drug effect profiles that are similar to the phenotypes observed in a patient or model organism. PhenomeNET 2 is available at http://aber-owl.net/phenomenet. Conclusions: Phenotype-similarity searches can provide a powerful tool for the discovery and investigation of molecular mechanisms underlying an observed phenotypic manifestation. PhenomeNET 2 facilitates user-defined similarity searches and allows researchers to analyze their data within a large repository of human, mouse and rat phenotypes.

  3. POSTER: Privacy-Preserving Profile Similarity Computation in Online Social Networks

    NARCIS (Netherlands)

    Jeckmans, Arjan; Tang, Qiang; Hartel, Pieter H.

    2011-01-01

    Currently, none of the existing online social networks (OSNs) enables its users to make new friends without revealing their private information. This leaves the users in a vulnerable position when searching for new friends. We propose a solution which enables a user to compute her profile similarity

  4. Protein structural similarity search by Ramachandran codes

    Directory of Open Access Journals (Sweden)

    Chang Chih-Hung

    2007-08-01

    Full Text Available Abstract Background Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed, several methods have been designed to reduce three-dimensional protein structures to one-dimensional text strings that are then analyzed by traditional sequence alignment methods; however, the accuracy is usually sacrificed and the speed is still unable to match sequence similarity search tools. Here, we aimed to improve the linear encoding methodology and develop efficient search tools that can rapidly retrieve structural homologs from large protein databases. Results We propose a new linear encoding method, SARST (Structural similarity search Aided by Ramachandran Sequential Transformation. SARST transforms protein structures into text strings through a Ramachandran map organized by nearest-neighbor clustering and uses a regenerative approach to produce substitution matrices. Then, classical sequence similarity search methods can be applied to the structural similarity search. Its accuracy is similar to Combinatorial Extension (CE and works over 243,000 times faster, searching 34,000 proteins in 0.34 sec with a 3.2-GHz CPU. SARST provides statistically meaningful expectation values to assess the retrieved information. It has been implemented into a web service and a stand-alone Java program that is able to run on many different platforms. Conclusion As a database search method, SARST can rapidly distinguish high from low similarities and efficiently retrieve homologous structures. It demonstrates that the easily accessible linear encoding methodology has the potential to serve as a foundation for efficient protein structural similarity search tools. These search tools are supposed applicable to automated and high-throughput functional annotations or predictions for the ever increasing number of published protein structures in this post-genomic era.

  5. Exploring personalized searches using tag-based user profiles and resource profiles in folksonomy.

    Science.gov (United States)

    Cai, Yi; Li, Qing; Xie, Haoran; Min, Huaqin

    2014-10-01

    With the increase in resource-sharing websites such as YouTube and Flickr, many shared resources have arisen on the Web. Personalized searches have become more important and challenging since users demand higher retrieval quality. To achieve this goal, personalized searches need to take users' personalized profiles and information needs into consideration. Collaborative tagging (also known as folksonomy) systems allow users to annotate resources with their own tags, which provides a simple but powerful way for organizing, retrieving and sharing different types of social resources. In this article, we examine the limitations of previous tag-based personalized searches. To handle these limitations, we propose a new method to model user profiles and resource profiles in collaborative tagging systems. We use a normalized term frequency to indicate the preference degree of a user on a tag. A novel search method using such profiles of users and resources is proposed to facilitate the desired personalization in resource searches. In our framework, instead of the keyword matching or similarity measurement used in previous works, the relevance measurement between a resource and a user query (termed the query relevance) is treated as a fuzzy satisfaction problem of a user's query requirements. We implement a prototype system called the Folksonomy-based Multimedia Retrieval System (FMRS). Experiments using the FMRS data set and the MovieLens data set show that our proposed method outperforms baseline methods. Copyright © 2014 Elsevier Ltd. All rights reserved.

  6. Binary similarity measures for fingerprint analysis of qualitative metabolomic profiles.

    Science.gov (United States)

    Rácz, Anita; Andrić, Filip; Bajusz, Dávid; Héberger, Károly

    2018-01-01

    Contemporary metabolomic fingerprinting is based on multiple spectrometric and chromatographic signals, used either alone or combined with structural and chemical information of metabolic markers at the qualitative and semiquantitative level. However, signal shifting, convolution, and matrix effects may compromise metabolomic patterns. Recent increase in the use of qualitative metabolomic data, described by the presence (1) or absence (0) of particular metabolites, demonstrates great potential in the field of metabolomic profiling and fingerprint analysis. The aim of this study is a comprehensive evaluation of binary similarity measures for the elucidation of patterns among samples of different botanical origin and various metabolomic profiles. Nine qualitative metabolomic data sets covering a wide range of natural products and metabolomic profiles were applied to assess 44 binary similarity measures for the fingerprinting of plant extracts and natural products. The measures were analyzed by the novel sum of ranking differences method (SRD), searching for the most promising candidates. Baroni-Urbani-Buser (BUB) and Hawkins-Dotson (HD) similarity coefficients were selected as the best measures by SRD and analysis of variance (ANOVA), while Dice (Di1), Yule, Russel-Rao, and Consonni-Todeschini 3 ranked the worst. ANOVA revealed that concordantly and intermediately symmetric similarity coefficients are better candidates for metabolomic fingerprinting than the asymmetric and correlation based ones. The fingerprint analysis based on the BUB and HD coefficients and qualitative metabolomic data performed equally well as the quantitative metabolomic profile analysis. Fingerprint analysis based on the qualitative metabolomic profiles and binary similarity measures proved to be a reliable way in finding the same/similar patterns in metabolomic data as that extracted from quantitative data.

  7. Searching mixed DNA profiles directly against profile databases.

    Science.gov (United States)

    Bright, Jo-Anne; Taylor, Duncan; Curran, James; Buckleton, John

    2014-03-01

    DNA databases have revolutionised forensic science. They are a powerful investigative tool as they have the potential to identify persons of interest in criminal investigations. Routinely, a DNA profile generated from a crime sample could only be searched for in a database of individuals if the stain was from single contributor (single source) or if a contributor could unambiguously be determined from a mixed DNA profile. This meant that a significant number of samples were unsuitable for database searching. The advent of continuous methods for the interpretation of DNA profiles offers an advanced way to draw inferential power from the considerable investment made in DNA databases. Using these methods, each profile on the database may be considered a possible contributor to a mixture and a likelihood ratio (LR) can be formed. Those profiles which produce a sufficiently large LR can serve as an investigative lead. In this paper empirical studies are described to determine what constitutes a large LR. We investigate the effect on a database search of complex mixed DNA profiles with contributors in equal proportions with dropout as a consideration, and also the effect of an incorrect assignment of the number of contributors to a profile. In addition, we give, as a demonstration of the method, the results using two crime samples that were previously unsuitable for database comparison. We show that effective management of the selection of samples for searching and the interpretation of the output can be highly informative. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

  8. Accelerated Profile HMM Searches.

    Directory of Open Access Journals (Sweden)

    Sean R Eddy

    2011-10-01

    Full Text Available Profile hidden Markov models (profile HMMs and probabilistic inference methods have made important contributions to the theory of sequence database homology search. However, practical use of profile HMM methods has been hindered by the computational expense of existing software implementations. Here I describe an acceleration heuristic for profile HMMs, the "multiple segment Viterbi" (MSV algorithm. The MSV algorithm computes an optimal sum of multiple ungapped local alignment segments using a striped vector-parallel approach previously described for fast Smith/Waterman alignment. MSV scores follow the same statistical distribution as gapped optimal local alignment scores, allowing rapid evaluation of significance of an MSV score and thus facilitating its use as a heuristic filter. I also describe a 20-fold acceleration of the standard profile HMM Forward/Backward algorithms using a method I call "sparse rescaling". These methods are assembled in a pipeline in which high-scoring MSV hits are passed on for reanalysis with the full HMM Forward/Backward algorithm. This accelerated pipeline is implemented in the freely available HMMER3 software package. Performance benchmarks show that the use of the heuristic MSV filter sacrifices negligible sensitivity compared to unaccelerated profile HMM searches. HMMER3 is substantially more sensitive and 100- to 1000-fold faster than HMMER2. HMMER3 is now about as fast as BLAST for protein searches.

  9. SpolSimilaritySearch - A web tool to compare and search similarities between spoligotypes of Mycobacterium tuberculosis complex.

    Science.gov (United States)

    Couvin, David; Zozio, Thierry; Rastogi, Nalin

    2017-07-01

    Spoligotyping is one of the most commonly used polymerase chain reaction (PCR)-based methods for identification and study of genetic diversity of Mycobacterium tuberculosis complex (MTBC). Despite its known limitations if used alone, the methodology is particularly useful when used in combination with other methods such as mycobacterial interspersed repetitive units - variable number of tandem DNA repeats (MIRU-VNTRs). At a worldwide scale, spoligotyping has allowed identification of information on 103,856 MTBC isolates (corresponding to 98049 clustered strains plus 5807 unique isolates from 169 countries of patient origin) contained within the SITVIT2 proprietary database of the Institut Pasteur de la Guadeloupe. The SpolSimilaritySearch web-tool described herein (available at: http://www.pasteur-guadeloupe.fr:8081/SpolSimilaritySearch) incorporates a similarity search algorithm allowing users to get a complete overview of similar spoligotype patterns (with information on presence or absence of 43 spacers) in the aforementioned worldwide database. This tool allows one to analyze spread and evolutionary patterns of MTBC by comparing similar spoligotype patterns, to distinguish between widespread, specific and/or confined patterns, as well as to pinpoint patterns with large deleted blocks, which play an intriguing role in the genetic epidemiology of M. tuberculosis. Finally, the SpolSimilaritySearch tool also provides with the country distribution patterns for each queried spoligotype. Copyright © 2017 Elsevier Ltd. All rights reserved.

  10. Personalizing Web Search based on User Profile

    OpenAIRE

    Utage, Sharyu; Ahire, Vijaya

    2016-01-01

    Web Search engine is most widely used for information retrieval from World Wide Web. These Web Search engines help user to find most useful information. When different users Searches for same information, search engine provide same result without understanding who is submitted that query. Personalized web search it is search technique for proving useful result. This paper models preference of users as hierarchical user profiles. a framework is proposed called UPS. It generalizes profile and m...

  11. Similarity search processing. Paralelization and indexing technologies.

    Directory of Open Access Journals (Sweden)

    Eder Dos Santos

    2015-08-01

    The next Scientific-Technical Report addresses the similarity search and the implementation of metric structures on parallel environments. It also presents the state of the art related to similarity search on metric structures and parallelism technologies. Comparative analysis are also proposed, seeking to identify the behavior of a set of metric spaces and metric structures over processing platforms multicore-based and GPU-based.

  12. Fast business process similarity search

    NARCIS (Netherlands)

    Yan, Z.; Dijkman, R.M.; Grefen, P.W.P.J.

    2012-01-01

    Nowadays, it is common for organizations to maintain collections of hundreds or even thousands of business processes. Techniques exist to search through such a collection, for business process models that are similar to a given query model. However, those techniques compare the query model to each

  13. Using SQL Databases for Sequence Similarity Searching and Analysis.

    Science.gov (United States)

    Pearson, William R; Mackey, Aaron J

    2017-09-13

    Relational databases can integrate diverse types of information and manage large sets of similarity search results, greatly simplifying genome-scale analyses. By focusing on taxonomic subsets of sequences, relational databases can reduce the size and redundancy of sequence libraries and improve the statistical significance of homologs. In addition, by loading similarity search results into a relational database, it becomes possible to explore and summarize the relationships between all of the proteins in an organism and those in other biological kingdoms. This unit describes how to use relational databases to improve the efficiency of sequence similarity searching and demonstrates various large-scale genomic analyses of homology-related data. It also describes the installation and use of a simple protein sequence database, seqdb_demo, which is used as a basis for the other protocols. The unit also introduces search_demo, a database that stores sequence similarity search results. The search_demo database is then used to explore the evolutionary relationships between E. coli proteins and proteins in other organisms in a large-scale comparative genomic analysis. © 2017 by John Wiley & Sons, Inc. Copyright © 2017 John Wiley & Sons, Inc.

  14. Predicting the performance of fingerprint similarity searching.

    Science.gov (United States)

    Vogt, Martin; Bajorath, Jürgen

    2011-01-01

    Fingerprints are bit string representations of molecular structure that typically encode structural fragments, topological features, or pharmacophore patterns. Various fingerprint designs are utilized in virtual screening and their search performance essentially depends on three parameters: the nature of the fingerprint, the active compounds serving as reference molecules, and the composition of the screening database. It is of considerable interest and practical relevance to predict the performance of fingerprint similarity searching. A quantitative assessment of the potential that a fingerprint search might successfully retrieve active compounds, if available in the screening database, would substantially help to select the type of fingerprint most suitable for a given search problem. The method presented herein utilizes concepts from information theory to relate the fingerprint feature distributions of reference compounds to screening libraries. If these feature distributions do not sufficiently differ, active database compounds that are similar to reference molecules cannot be retrieved because they disappear in the "background." By quantifying the difference in feature distribution using the Kullback-Leibler divergence and relating the divergence to compound recovery rates obtained for different benchmark classes, fingerprint search performance can be quantitatively predicted.

  15. BLAST and FASTA similarity searching for multiple sequence alignment.

    Science.gov (United States)

    Pearson, William R

    2014-01-01

    BLAST, FASTA, and other similarity searching programs seek to identify homologous proteins and DNA sequences based on excess sequence similarity. If two sequences share much more similarity than expected by chance, the simplest explanation for the excess similarity is common ancestry-homology. The most effective similarity searches compare protein sequences, rather than DNA sequences, for sequences that encode proteins, and use expectation values, rather than percent identity, to infer homology. The BLAST and FASTA packages of sequence comparison programs provide programs for comparing protein and DNA sequences to protein databases (the most sensitive searches). Protein and translated-DNA comparisons to protein databases routinely allow evolutionary look back times from 1 to 2 billion years; DNA:DNA searches are 5-10-fold less sensitive. BLAST and FASTA can be run on popular web sites, but can also be downloaded and installed on local computers. With local installation, target databases can be customized for the sequence data being characterized. With today's very large protein databases, search sensitivity can also be improved by searching smaller comprehensive databases, for example, a complete protein set from an evolutionarily neighboring model organism. By default, BLAST and FASTA use scoring strategies target for distant evolutionary relationships; for comparisons involving short domains or queries, or searches that seek relatively close homologs (e.g. mouse-human), shallower scoring matrices will be more effective. Both BLAST and FASTA provide very accurate statistical estimates, which can be used to reliably identify protein sequences that diverged more than 2 billion years ago.

  16. PROSPECT improves cis-acting regulatory element prediction by integrating expression profile data with consensus pattern searches

    Science.gov (United States)

    Fujibuchi, Wataru; Anderson, John S. J.; Landsman, David

    2001-01-01

    Consensus pattern and matrix-based searches designed to predict cis-acting transcriptional regulatory sequences have historically been subject to large numbers of false positives. We sought to decrease false positives by incorporating expression profile data into a consensus pattern-based search method. We have systematically analyzed the expression phenotypes of over 6000 yeast genes, across 121 expression profile experiments, and correlated them with the distribution of 14 known regulatory elements over sequences upstream of the genes. Our method is based on a metric we term probabilistic element assessment (PEA), which is a ranking of potential sites based on sequence similarity in the upstream regions of genes with similar expression phenotypes. For eight of the 14 known elements that we examined, our method had a much higher selectivity than a naïve consensus pattern search. Based on our analysis, we have developed a web-based tool called PROSPECT, which allows consensus pattern-based searching of gene clusters obtained from microarray data. PMID:11574681

  17. Similarity search of business process models

    NARCIS (Netherlands)

    Dumas, M.; García-Bañuelos, L.; Dijkman, R.M.

    2009-01-01

    Similarity search is a general class of problems in which a given object, called a query object, is compared against a collection of objects in order to retrieve those that most closely resemble the query object. This paper reviews recent work on an instance of this class of problems, where the

  18. Target-nontarget similarity decreases search efficiency and increases stimulus-driven control in visual search.

    Science.gov (United States)

    Barras, Caroline; Kerzel, Dirk

    2017-10-01

    Some points of criticism against the idea that attentional selection is controlled by bottom-up processing were dispelled by the attentional window account. The attentional window account claims that saliency computations during visual search are only performed for stimuli inside the attentional window. Therefore, a small attentional window may avoid attentional capture by salient distractors because it is likely that the salient distractor is located outside the window. In contrast, a large attentional window increases the chances of attentional capture by a salient distractor. Large and small attentional windows have been associated with efficient (parallel) and inefficient (serial) search, respectively. We compared the effect of a salient color singleton on visual search for a shape singleton during efficient and inefficient search. To vary search efficiency, the nontarget shapes were either similar or dissimilar with respect to the shape singleton. We found that interference from the color singleton was larger with inefficient than efficient search, which contradicts the attentional window account. While inconsistent with the attentional window account, our results are predicted by computational models of visual search. Because of target-nontarget similarity, the target was less salient with inefficient than efficient search. Consequently, the relative saliency of the color distractor was higher with inefficient than with efficient search. Accordingly, stronger attentional capture resulted. Overall, the present results show that bottom-up control by stimulus saliency is stronger when search is difficult, which is inconsistent with the attentional window account.

  19. A Profile-Based Framework for Factorial Similarity and the Congruence Coefficient.

    Science.gov (United States)

    Hartley, Anselma G; Furr, R Michael

    2017-01-01

    We present a novel profile-based framework for understanding factorial similarity in the context of exploratory factor analysis in general, and for understanding the congruence coefficient (a commonly used index of factor similarity) specifically. First, we introduce the profile-based framework articulating factorial similarity in terms of 3 intuitive components: general saturation similarity, differential saturation similarity, and configural similarity. We then articulate the congruence coefficient in terms of these components, along with 2 additional profile-based components, and we explain how these components resolve ambiguities that can be-and are-found when using the congruence coefficient. Finally, we present secondary analyses revealing that profile-based components of factorial are indeed linked to experts' actual evaluations of factorial similarity. Overall, the profile-based approach we present offers new insights into the ways in which researchers can examine factor similarity and holds the potential to enhance researchers' ability to understand the congruence coefficient.

  20. MEASURING THE PERFORMANCE OF SIMILARITY PROPAGATION IN AN SEMANTIC SEARCH ENGINE

    Directory of Open Access Journals (Sweden)

    S. K. Jayanthi

    2013-10-01

    Full Text Available In the current scenario, web page result personalization is playing a vital role. Nearly 80 % of the users expect the best results in the first page itself without having any persistence to browse longer in URL mode. This research work focuses on two main themes: Semantic web search through online and Domain based search through offline. The first part is to find an effective method which allows grouping similar results together using BookShelf Data Structure and organizing the various clusters. The second one is focused on the academic domain based search through offline. This paper focuses on finding documents which are similar and how Vector space can be used to solve it. So more weightage is given for the principles and working methodology of similarity propagation. Cosine similarity measure is used for finding the relevancy among the documents.

  1. Combined semantic and similarity search in medical image databases

    Science.gov (United States)

    Seifert, Sascha; Thoma, Marisa; Stegmaier, Florian; Hammon, Matthias; Kramer, Martin; Huber, Martin; Kriegel, Hans-Peter; Cavallaro, Alexander; Comaniciu, Dorin

    2011-03-01

    The current diagnostic process at hospitals is mainly based on reviewing and comparing images coming from multiple time points and modalities in order to monitor disease progression over a period of time. However, for ambiguous cases the radiologist deeply relies on reference literature or second opinion. Although there is a vast amount of acquired images stored in PACS systems which could be reused for decision support, these data sets suffer from weak search capabilities. Thus, we present a search methodology which enables the physician to fulfill intelligent search scenarios on medical image databases combining ontology-based semantic and appearance-based similarity search. It enabled the elimination of 12% of the top ten hits which would arise without taking the semantic context into account.

  2. Inference-Based Similarity Search in Randomized Montgomery Domains for Privacy-Preserving Biometric Identification.

    Science.gov (United States)

    Wang, Yi; Wan, Jianwu; Guo, Jun; Cheung, Yiu-Ming; C Yuen, Pong

    2017-07-14

    Similarity search is essential to many important applications and often involves searching at scale on high-dimensional data based on their similarity to a query. In biometric applications, recent vulnerability studies have shown that adversarial machine learning can compromise biometric recognition systems by exploiting the biometric similarity information. Existing methods for biometric privacy protection are in general based on pairwise matching of secured biometric templates and have inherent limitations in search efficiency and scalability. In this paper, we propose an inference-based framework for privacy-preserving similarity search in Hamming space. Our approach builds on an obfuscated distance measure that can conceal Hamming distance in a dynamic interval. Such a mechanism enables us to systematically design statistically reliable methods for retrieving most likely candidates without knowing the exact distance values. We further propose to apply Montgomery multiplication for generating search indexes that can withstand adversarial similarity analysis, and show that information leakage in randomized Montgomery domains can be made negligibly small. Our experiments on public biometric datasets demonstrate that the inference-based approach can achieve a search accuracy close to the best performance possible with secure computation methods, but the associated cost is reduced by orders of magnitude compared to cryptographic primitives.

  3. δ-Similar Elimination to Enhance Search Performance of Multiobjective Evolutionary Algorithms

    Science.gov (United States)

    Aguirre, Hernán; Sato, Masahiko; Tanaka, Kiyoshi

    In this paper, we propose δ-similar elimination to improve the search performance of multiobjective evolutionary algorithms in combinatorial optimization problems. This method eliminates similar individuals in objective space to fairly distribute selection among the different regions of the instantaneous Pareto front. We investigate four eliminating methods analyzing their effects using NSGA-II. In addition, we compare the search performance of NSGA-II enhanced by our method and NSGA-II enhanced by controlled elitism.

  4. Similarity relations in visual search predict rapid visual categorization

    Science.gov (United States)

    Mohan, Krithika; Arun, S. P.

    2012-01-01

    How do we perform rapid visual categorization?It is widely thought that categorization involves evaluating the similarity of an object to other category items, but the underlying features and similarity relations remain unknown. Here, we hypothesized that categorization performance is based on perceived similarity relations between items within and outside the category. To this end, we measured the categorization performance of human subjects on three diverse visual categories (animals, vehicles, and tools) and across three hierarchical levels (superordinate, basic, and subordinate levels among animals). For the same subjects, we measured their perceived pair-wise similarities between objects using a visual search task. Regardless of category and hierarchical level, we found that the time taken to categorize an object could be predicted using its similarity to members within and outside its category. We were able to account for several classic categorization phenomena, such as (a) the longer times required to reject category membership; (b) the longer times to categorize atypical objects; and (c) differences in performance across tasks and across hierarchical levels. These categorization times were also accounted for by a model that extracts coarse structure from an image. The striking agreement observed between categorization and visual search suggests that these two disparate tasks depend on a shared coarse object representation. PMID:23092947

  5. Using relational databases for improved sequence similarity searching and large-scale genomic analyses.

    Science.gov (United States)

    Mackey, Aaron J; Pearson, William R

    2004-10-01

    Relational databases are designed to integrate diverse types of information and manage large sets of search results, greatly simplifying genome-scale analyses. Relational databases are essential for management and analysis of large-scale sequence analyses, and can also be used to improve the statistical significance of similarity searches by focusing on subsets of sequence libraries most likely to contain homologs. This unit describes using relational databases to improve the efficiency of sequence similarity searching and to demonstrate various large-scale genomic analyses of homology-related data. This unit describes the installation and use of a simple protein sequence database, seqdb_demo, which is used as a basis for the other protocols. These include basic use of the database to generate a novel sequence library subset, how to extend and use seqdb_demo for the storage of sequence similarity search results and making use of various kinds of stored search results to address aspects of comparative genomic analysis.

  6. Retrospective group fusion similarity search based on eROCE evaluation metric.

    Science.gov (United States)

    Avram, Sorin I; Crisan, Luminita; Bora, Alina; Pacureanu, Liliana M; Avram, Stefana; Kurunczi, Ludovic

    2013-03-01

    In this study, a simple evaluation metric, denoted as eROCE was proposed to measure the early enrichment of predictive methods. We demonstrated the superior robustness of eROCE compared to other known metrics throughout several active to inactive ratios ranging from 1:10 to 1:1000. Group fusion similarity search was investigated by varying 16 similarity coefficients, five molecular representations (binary and non-binary) and two group fusion rules using two reference structure set sizes. We used a dataset of 3478 actives and 43,938 inactive molecules and the enrichment was analyzed by means of eROCE. This retrospective study provides optimal similarity search parameters in the case of ALDH1A1 inhibitors. Copyright © 2013 Elsevier Ltd. All rights reserved.

  7. Query-dependent banding (QDB for faster RNA similarity searches.

    Directory of Open Access Journals (Sweden)

    Eric P Nawrocki

    2007-03-01

    Full Text Available When searching sequence databases for RNAs, it is desirable to score both primary sequence and RNA secondary structure similarity. Covariance models (CMs are probabilistic models well-suited for RNA similarity search applications. However, the computational complexity of CM dynamic programming alignment algorithms has limited their practical application. Here we describe an acceleration method called query-dependent banding (QDB, which uses the probabilistic query CM to precalculate regions of the dynamic programming lattice that have negligible probability, independently of the target database. We have implemented QDB in the freely available Infernal software package. QDB reduces the average case time complexity of CM alignment from LN(2.4 to LN(1.3 for a query RNA of N residues and a target database of L residues, resulting in a 4-fold speedup for typical RNA queries. Combined with other improvements to Infernal, including informative mixture Dirichlet priors on model parameters, benchmarks also show increased sensitivity and specificity resulting from improved parameterization.

  8. Cloud4Psi: cloud computing for 3D protein structure similarity searching.

    Science.gov (United States)

    Mrozek, Dariusz; Małysiak-Mrozek, Bożena; Kłapciński, Artur

    2014-10-01

    Popular methods for 3D protein structure similarity searching, especially those that generate high-quality alignments such as Combinatorial Extension (CE) and Flexible structure Alignment by Chaining Aligned fragment pairs allowing Twists (FATCAT) are still time consuming. As a consequence, performing similarity searching against large repositories of structural data requires increased computational resources that are not always available. Cloud computing provides huge amounts of computational power that can be provisioned on a pay-as-you-go basis. We have developed the cloud-based system that allows scaling of the similarity searching process vertically and horizontally. Cloud4Psi (Cloud for Protein Similarity) was tested in the Microsoft Azure cloud environment and provided good, almost linearly proportional acceleration when scaled out onto many computational units. Cloud4Psi is available as Software as a Service for testing purposes at: http://cloud4psi.cloudapp.net/. For source code and software availability, please visit the Cloud4Psi project home page at http://zti.polsl.pl/dmrozek/science/cloud4psi.htm. © The Author 2014. Published by Oxford University Press.

  9. How Google Web Search copes with very similar documents

    NARCIS (Netherlands)

    W. Mettrop (Wouter); P. Nieuwenhuysen; H. Smulders

    2006-01-01

    textabstractA significant portion of the computer files that carry documents, multimedia, programs etc. on the Web are identical or very similar to other files on the Web. How do search engines cope with this? Do they perform some kind of “deduplication”? How should users take into account that

  10. OS2: Oblivious similarity based searching for encrypted data outsourced to an untrusted domain

    Science.gov (United States)

    Pervez, Zeeshan; Ahmad, Mahmood; Khattak, Asad Masood; Ramzan, Naeem

    2017-01-01

    Public cloud storage services are becoming prevalent and myriad data sharing, archiving and collaborative services have emerged which harness the pay-as-you-go business model of public cloud. To ensure privacy and confidentiality often encrypted data is outsourced to such services, which further complicates the process of accessing relevant data by using search queries. Search over encrypted data schemes solve this problem by exploiting cryptographic primitives and secure indexing to identify outsourced data that satisfy the search criteria. Almost all of these schemes rely on exact matching between the encrypted data and search criteria. A few schemes which extend the notion of exact matching to similarity based search, lack realism as those schemes rely on trusted third parties or due to increase storage and computational complexity. In this paper we propose Oblivious Similarity based Search (OS2) for encrypted data. It enables authorized users to model their own encrypted search queries which are resilient to typographical errors. Unlike conventional methodologies, OS2 ranks the search results by using similarity measure offering a better search experience than exact matching. It utilizes encrypted bloom filter and probabilistic homomorphic encryption to enable authorized users to access relevant data without revealing results of search query evaluation process to the untrusted cloud service provider. Encrypted bloom filter based search enables OS2 to reduce search space to potentially relevant encrypted data avoiding unnecessary computation on public cloud. The efficacy of OS2 is evaluated on Google App Engine for various bloom filter lengths on different cloud configurations. PMID:28692697

  11. SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters

    Directory of Open Access Journals (Sweden)

    Lefkowitz Elliot J

    2004-10-01

    Full Text Available Abstract Background Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. Results We describe the implementation of SS-Wrapper (Similarity Search Wrapper, a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST that provides a complementary solution for BLAST searches when the database is too large to fit into

  12. SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters.

    Science.gov (United States)

    Wang, Chunlin; Lefkowitz, Elliot J

    2004-10-28

    Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node. Used together

  13. Similarity searching and scaffold hopping in synthetically accessible combinatorial chemistry spaces.

    Science.gov (United States)

    Boehm, Markus; Wu, Tong-Ying; Claussen, Holger; Lemmen, Christian

    2008-04-24

    Large collections of combinatorial libraries are an integral element in today's pharmaceutical industry. It is of great interest to perform similarity searches against all virtual compounds that are synthetically accessible by any such library. Here we describe the successful application of a new software tool CoLibri on 358 combinatorial libraries based on validated reaction protocols to create a single chemistry space containing over 10 (12) possible products. Similarity searching with FTrees-FS allows the systematic exploration of this space without the need to enumerate all product structures. The search result is a set of virtual hits which are synthetically accessible by one or more of the existing reaction protocols. Grouping these virtual hits by their synthetic protocols allows the rapid design and synthesis of multiple follow-up libraries. Such library ideas support hit-to-lead design efforts for tasks like follow-up from high-throughput screening hits or scaffold hopping from one hit to another attractive series.

  14. GEMINI: a computationally-efficient search engine for large gene expression datasets.

    Science.gov (United States)

    DeFreitas, Timothy; Saddiki, Hachem; Flaherty, Patrick

    2016-02-24

    Low-cost DNA sequencing allows organizations to accumulate massive amounts of genomic data and use that data to answer a diverse range of research questions. Presently, users must search for relevant genomic data using a keyword, accession number of meta-data tag. However, in this search paradigm the form of the query - a text-based string - is mismatched with the form of the target - a genomic profile. To improve access to massive genomic data resources, we have developed a fast search engine, GEMINI, that uses a genomic profile as a query to search for similar genomic profiles. GEMINI implements a nearest-neighbor search algorithm using a vantage-point tree to store a database of n profiles and in certain circumstances achieves an [Formula: see text] expected query time in the limit. We tested GEMINI on breast and ovarian cancer gene expression data from The Cancer Genome Atlas project and show that it achieves a query time that scales as the logarithm of the number of records in practice on genomic data. In a database with 10(5) samples, GEMINI identifies the nearest neighbor in 0.05 sec compared to a brute force search time of 0.6 sec. GEMINI is a fast search engine that uses a query genomic profile to search for similar profiles in a very large genomic database. It enables users to identify similar profiles independent of sample label, data origin or other meta-data information.

  15. Optimal neighborhood indexing for protein similarity search.

    Science.gov (United States)

    Peterlongo, Pierre; Noé, Laurent; Lavenier, Dominique; Nguyen, Van Hoa; Kucherov, Gregory; Giraud, Mathieu

    2008-12-16

    Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes. In order to speed up this technique, the index can be enhanced by storing additional information to limit the number of random memory accesses. However, this improvement leads to a larger index that may become a bottleneck. In the case of protein similarity search, we propose to decrease the index size by reducing the amino acid alphabet. The paper presents two main contributions. First, we show that an optimal neighborhood indexing combining an alphabet reduction and a longer neighborhood leads to a reduction of 35% of memory involved into the process, without sacrificing the quality of results nor the computational time. Second, our approach led us to develop a new kind of substitution score matrices and their associated e-value parameters. In contrast to usual matrices, these matrices are rectangular since they compare amino acid groups from different alphabets. We describe the method used for computing those matrices and we provide some typical examples that can be used in such comparisons. Supplementary data can be found on the website http://bioinfo.lifl.fr/reblosum. We propose a practical index size reduction of the neighborhood data, that does not negatively affect the performance of large-scale search in protein sequences. Such an index can be used in any study involving large protein data. Moreover, rectangular substitution score matrices and their associated statistical parameters can have applications in any study involving an alphabet reduction.

  16. Optimal neighborhood indexing for protein similarity search

    Directory of Open Access Journals (Sweden)

    Nguyen Van

    2008-12-01

    Full Text Available Abstract Background Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes. In order to speed up this technique, the index can be enhanced by storing additional information to limit the number of random memory accesses. However, this improvement leads to a larger index that may become a bottleneck. In the case of protein similarity search, we propose to decrease the index size by reducing the amino acid alphabet. Results The paper presents two main contributions. First, we show that an optimal neighborhood indexing combining an alphabet reduction and a longer neighborhood leads to a reduction of 35% of memory involved into the process, without sacrificing the quality of results nor the computational time. Second, our approach led us to develop a new kind of substitution score matrices and their associated e-value parameters. In contrast to usual matrices, these matrices are rectangular since they compare amino acid groups from different alphabets. We describe the method used for computing those matrices and we provide some typical examples that can be used in such comparisons. Supplementary data can be found on the website http://bioinfo.lifl.fr/reblosum. Conclusion We propose a practical index size reduction of the neighborhood data, that does not negatively affect the performance of large-scale search in protein sequences. Such an index can be used in any study involving large protein data. Moreover, rectangular substitution score matrices and their associated statistical parameters can have applications in any study involving an alphabet reduction.

  17. [Formula: see text]: Oblivious similarity based searching for encrypted data outsourced to an untrusted domain.

    Science.gov (United States)

    Pervez, Zeeshan; Ahmad, Mahmood; Khattak, Asad Masood; Ramzan, Naeem; Khan, Wajahat Ali

    2017-01-01

    Public cloud storage services are becoming prevalent and myriad data sharing, archiving and collaborative services have emerged which harness the pay-as-you-go business model of public cloud. To ensure privacy and confidentiality often encrypted data is outsourced to such services, which further complicates the process of accessing relevant data by using search queries. Search over encrypted data schemes solve this problem by exploiting cryptographic primitives and secure indexing to identify outsourced data that satisfy the search criteria. Almost all of these schemes rely on exact matching between the encrypted data and search criteria. A few schemes which extend the notion of exact matching to similarity based search, lack realism as those schemes rely on trusted third parties or due to increase storage and computational complexity. In this paper we propose Oblivious Similarity based Search ([Formula: see text]) for encrypted data. It enables authorized users to model their own encrypted search queries which are resilient to typographical errors. Unlike conventional methodologies, [Formula: see text] ranks the search results by using similarity measure offering a better search experience than exact matching. It utilizes encrypted bloom filter and probabilistic homomorphic encryption to enable authorized users to access relevant data without revealing results of search query evaluation process to the untrusted cloud service provider. Encrypted bloom filter based search enables [Formula: see text] to reduce search space to potentially relevant encrypted data avoiding unnecessary computation on public cloud. The efficacy of [Formula: see text] is evaluated on Google App Engine for various bloom filter lengths on different cloud configurations.

  18. SHOP: scaffold hopping by GRID-based similarity searches

    DEFF Research Database (Denmark)

    Bergmann, Rikke; Linusson, Anna; Zamora, Ismael

    2007-01-01

    A new GRID-based method for scaffold hopping (SHOP) is presented. In a fully automatic manner, scaffolds were identified in a database based on three types of 3D-descriptors. SHOP's ability to recover scaffolds was assessed and validated by searching a database spiked with fragments of known...... scaffolds were in the 31 top-ranked scaffolds. SHOP also identified new scaffolds with substantially different chemotypes from the queries. Docking analysis indicated that the new scaffolds would have similar binding modes to those of the respective query scaffolds observed in X-ray structures...

  19. Semantic similarity measure in biomedical domain leverage web search engine.

    Science.gov (United States)

    Chen, Chi-Huang; Hsieh, Sheau-Ling; Weng, Yung-Ching; Chang, Wen-Yung; Lai, Feipei

    2010-01-01

    Semantic similarity measure plays an essential role in Information Retrieval and Natural Language Processing. In this paper we propose a page-count-based semantic similarity measure and apply it in biomedical domains. Previous researches in semantic web related applications have deployed various semantic similarity measures. Despite the usefulness of the measurements in those applications, measuring semantic similarity between two terms remains a challenge task. The proposed method exploits page counts returned by the Web Search Engine. We define various similarity scores for two given terms P and Q, using the page counts for querying P, Q and P AND Q. Moreover, we propose a novel approach to compute semantic similarity using lexico-syntactic patterns with page counts. These different similarity scores are integrated adapting support vector machines, to leverage the robustness of semantic similarity measures. Experimental results on two datasets achieve correlation coefficients of 0.798 on the dataset provided by A. Hliaoutakis, 0.705 on the dataset provide by T. Pedersen with physician scores and 0.496 on the dataset provided by T. Pedersen et al. with expert scores.

  20. Generating "fragment-based virtual library" using pocket similarity search of ligand-receptor complexes.

    Science.gov (United States)

    Khashan, Raed S

    2015-01-01

    As the number of available ligand-receptor complexes is increasing, researchers are becoming more dedicated to mine these complexes to aid in the drug design and development process. We present free software which is developed as a tool for performing similarity search across ligand-receptor complexes for identifying binding pockets which are similar to that of a target receptor. The search is based on 3D-geometric and chemical similarity of the atoms forming the binding pocket. For each match identified, the ligand's fragment(s) corresponding to that binding pocket are extracted, thus forming a virtual library of fragments (FragVLib) that is useful for structure-based drug design. The program provides a very useful tool to explore available databases.

  1. BSSF: a fingerprint based ultrafast binding site similarity search and function analysis server

    Directory of Open Access Journals (Sweden)

    Jiang Hualiang

    2010-01-01

    Full Text Available Abstract Background Genome sequencing and post-genomics projects such as structural genomics are extending the frontier of the study of sequence-structure-function relationship of genes and their products. Although many sequence/structure-based methods have been devised with the aim of deciphering this delicate relationship, there still remain large gaps in this fundamental problem, which continuously drives researchers to develop novel methods to extract relevant information from sequences and structures and to infer the functions of newly identified genes by genomics technology. Results Here we present an ultrafast method, named BSSF(Binding Site Similarity & Function, which enables researchers to conduct similarity searches in a comprehensive three-dimensional binding site database extracted from PDB structures. This method utilizes a fingerprint representation of the binding site and a validated statistical Z-score function scheme to judge the similarity between the query and database items, even if their similarities are only constrained in a sub-pocket. This fingerprint based similarity measurement was also validated on a known binding site dataset by comparing with geometric hashing, which is a standard 3D similarity method. The comparison clearly demonstrated the utility of this ultrafast method. After conducting the database searching, the hit list is further analyzed to provide basic statistical information about the occurrences of Gene Ontology terms and Enzyme Commission numbers, which may benefit researchers by helping them to design further experiments to study the query proteins. Conclusions This ultrafast web-based system will not only help researchers interested in drug design and structural genomics to identify similar binding sites, but also assist them by providing further analysis of hit list from database searching.

  2. A search profile for dwellings with elevated radon levels

    DEFF Research Database (Denmark)

    Damkjær, A.; Andersen, C.E.; Majborn, B.

    1996-01-01

    A search profile for dwellings with elevated radon levels has been employed to investigate possibly radon-prone areas in Denmark and to find houses suitable for radon mitigation studies. The profile is defined as dwellings which are single-family houses with slab-on-grade foundation or partly...... basement/slab-on-grade foundation built on either fractured granitic basement rocks, or fractured limestone. Clayey till areas were also included in the profile in order to confirm earlier findings. Three areas representing these surface geologies were selected for indoor radon measurements with CR-39...... track detectors, and a total of 200 houses matching the profile underwent radon measurements during the winter 1994-95. The distribution of the measured radon concentrations were found in most cases to comply with log-normal distributions. Measurements in the living rooms of houses in each of the three...

  3. Similarity between neonatal profile and socioeconomic index: a spatial approach

    Directory of Open Access Journals (Sweden)

    d'Orsi Eleonora

    2005-01-01

    Full Text Available This study aims to compare neonatal characteristics and socioeconomic conditions in Rio de Janeiro city neighborhoods in order to identify priority areas for intervention. The study design was ecological. Two databases were used: the Brazilian Population Census and the Live Birth Information System, aggregated by neighborhoods. Spatial analysis, multivariate cluster classification, and Moran's I statistics for detection of spatial clustering were used. A similarity index was created to compare socioeconomic clusters with the neonatal profile in each neighborhood. The proportions of Apgar score above 8 and cesarean sections showed positive spatial correlation and high similarity with the socioeconomic index. The proportion of low birth weight infants showed a random spatial distribution, indicating that at this scale of analysis, birth weight is not sufficiently sensitive to discriminate subtler differences among population groups. The observed relationship between the neighborhoods' neonatal profile (particularly Apgar score and mode of delivery and socioeconomic conditions shows evidence of a change in infant health profile, where the possibility for intervention shifts to medical services and the Apgar score assumes growing significance as a risk indicator.

  4. Efficient blind search for similar-waveform earthquakes in years of continuous seismic data

    Science.gov (United States)

    Yoon, C. E.; Bergen, K.; Rong, K.; Elezabi, H.; Bailis, P.; Levis, P.; Beroza, G. C.

    2017-12-01

    Cross-correlating an earthquake waveform template with continuous seismic data has proven to be a sensitive, discriminating detector of small events missing from earthquake catalogs, but a key limitation of this approach is that it requires advance knowledge of the earthquake signals we wish to detect. To overcome this limitation, we can perform a blind search for events with similar waveforms, comparing waveforms from all possible times within the continuous data (Brown et al., 2008). However, the runtime for naive blind search scales quadratically with the duration of continuous data, making it impractical to process years of continuous data. The Fingerprint And Similarity Thresholding (FAST) detection method (Yoon et al., 2015) enables a comprehensive blind search for similar-waveform earthquakes in a fast, scalable manner by adapting data-mining techniques originally developed for audio and image search within massive databases. FAST converts seismic waveforms into compact "fingerprints", which are efficiently organized and searched within a database. In this way, FAST avoids the unnecessary comparison of dissimilar waveforms. To date, the longest duration of continuous data used for event detection with FAST was 3 months at a single station near Guy-Greenbrier, Arkansas, which revealed microearthquakes closely correlated with stages of hydraulic fracturing (Yoon et al., 2017). In this presentation we introduce an optimized, parallel version of the FAST software with improvements to the fingerprinting algorithm and the ability to detect events using continuous data from a network of stations (Bergen et al., 2016). We demonstrate its ability to detect low-magnitude earthquakes within several years of continuous data at locations of interest in California.

  5. Features of the search profiles in the INIS-RS service

    International Nuclear Information System (INIS)

    Komatsubara, Yasutoshi

    1982-01-01

    Report is presented on the INIS-RS service being performed for nuclear people in Japan from 1979. Brief information on the INIS database and the retrieval system is stated in the first place. Analyses are made on the 322 items to reveal the composition and characteristics of the search profiles processed at the JAERI. Results are shown on the executing ratios of preliminaly search and of ranking retrieval with weighted descriptors. Each number of search terms and of logical operators used in each query is described with correlation of the number between terms and AND(*) operators. Descriptions are also given on the relevance ratio of the retrieval and number of the documents retrieved. (author)

  6. Validation of SmartRank: A likelihood ratio software for searching national DNA databases with complex DNA profiles.

    Science.gov (United States)

    Benschop, Corina C G; van de Merwe, Linda; de Jong, Jeroen; Vanvooren, Vanessa; Kempenaers, Morgane; Kees van der Beek, C P; Barni, Filippo; Reyes, Eusebio López; Moulin, Léa; Pene, Laurent; Haned, Hinda; Sijen, Titia

    2017-07-01

    Searching a national DNA database with complex and incomplete profiles usually yields very large numbers of possible matches that can present many candidate suspects to be further investigated by the forensic scientist and/or police. Current practice in most forensic laboratories consists of ordering these 'hits' based on the number of matching alleles with the searched profile. Thus, candidate profiles that share the same number of matching alleles are not differentiated and due to the lack of other ranking criteria for the candidate list it may be difficult to discern a true match from the false positives or notice that all candidates are in fact false positives. SmartRank was developed to put forward only relevant candidates and rank them accordingly. The SmartRank software computes a likelihood ratio (LR) for the searched profile and each profile in the DNA database and ranks database entries above a defined LR threshold according to the calculated LR. In this study, we examined for mixed DNA profiles of variable complexity whether the true donors are retrieved, what the number of false positives above an LR threshold is and the ranking position of the true donors. Using 343 mixed DNA profiles over 750 SmartRank searches were performed. In addition, the performance of SmartRank and CODIS were compared regarding DNA database searches and SmartRank was found complementary to CODIS. We also describe the applicable domain of SmartRank and provide guidelines. The SmartRank software is open-source and freely available. Using the best practice guidelines, SmartRank enables obtaining investigative leads in criminal cases lacking a suspect. Copyright © 2017 Elsevier B.V. All rights reserved.

  7. RxnFinder: biochemical reaction search engines using molecular structures, molecular fragments and reaction similarity.

    Science.gov (United States)

    Hu, Qian-Nan; Deng, Zhe; Hu, Huanan; Cao, Dong-Sheng; Liang, Yi-Zeng

    2011-09-01

    Biochemical reactions play a key role to help sustain life and allow cells to grow. RxnFinder was developed to search biochemical reactions from KEGG reaction database using three search criteria: molecular structures, molecular fragments and reaction similarity. RxnFinder is helpful to get reference reactions for biosynthesis and xenobiotics metabolism. RxnFinder is freely available via: http://sdd.whu.edu.cn/rxnfinder. qnhu@whu.edu.cn.

  8. What Friends Are For: Collaborative Intelligence Analysis and Search

    Science.gov (United States)

    2014-06-01

    preferences, then the similarity measure could then be some type of vector angularity measurement. Regardless of how similarity is computed, once 26 the...III. In addition to implementing the model, the software supports analysis of search performance. The program is written in Java and Python and...profiles within the profile database are encoded in XML format, as seen in Figure 13. Profiler is written in both Java and Python and is dependent upon

  9. Keep Searching and You’ll Find

    DEFF Research Database (Denmark)

    Laursen, Keld

    2012-01-01

    This article critically reviews and synthesizes the contributions found in theoretical and empirical studies of firm-level innovation search processes. It explores the advantages and disadvantages of local and non-local search, discusses organizational responses, and identifies potential exogenous...... different search strategies, but end up with very similar technological profiles in fast-growing technologies. The article concludes by highlighting what we have learnt from the literature and suggesting some new avenues for research....

  10. Efficient Similarity Search Using the Earth Mover's Distance for Large Multimedia Databases

    DEFF Research Database (Denmark)

    Assent, Ira; Wichterich, Marc; Meisen, Tobias

    2008-01-01

    Multimedia similarity search in large databases requires efficient query processing. The Earth mover's distance, introduced in computer vision, is successfully used as a similarity model in a number of small-scale applications. Its computational complexity hindered its adoption in large multimedia...... databases. We enable directly indexing the Earth mover's distance in structures such as the R-tree and the VA-file by providing the accurate 'MinDist' function to any bounding rectangle in the index. We exploit the computational structure of the new MinDist to derive a new lower bound for the EMD Min...

  11. Content Based Retrieval Database Management System with Support for Similarity Searching and Query Refinement

    National Research Council Canada - National Science Library

    Ortega-Binderberger, Michael

    2002-01-01

    ... as a critical area of research. This thesis explores how to enhance database systems with content based search over arbitrary abstract data types in a similarity based framework with query refinement...

  12. Integrating user profile in medical CBIR systems to answer perceptual similarity queries

    Science.gov (United States)

    Bugatti, Pedro H.; Kaster, Daniel S.; Ponciano-Silva, Marcelo; Traina, Agma J. M.; Traina, Caetano, Jr.

    2011-03-01

    Techniques for Content-Based Image Retrieval (CBIR) have been intensively explored due to the increase in the amount of captured images and the need of fast retrieval of them. The medical field is a specific example that generates a large flow of information, especially digital images employed for diagnosing. One issue that still remains unsolved deals with how to reach the perceptual similarity. That is, to achieve an effective retrieval, one must characterize and quantify the perceptual similarity regarding the specialist in the field. Therefore, the present paper was conceived to fill in this gap creating a consistent support to perform similarity queries over medical images, maintaining the semantics of a given query desired by the user. CBIR systems relying in relevance feedback techniques usually request the users to label relevant images. In this paper, we present a simple but highly effective strategy to survey user profiles, taking advantage of such labeling to implicitly gather the user perceptual similarity. The user profiles maintain the settings desired for each user, allowing tuning the similarity assessment, which encompasses dynamically changing the distance function employed through an interactive process. Experiments using computed tomography lung images show that the proposed approach is effective in capturing the users' perception.

  13. Prioritization of candidate disease genes by topological similarity between disease and protein diffusion profiles.

    Science.gov (United States)

    Zhu, Jie; Qin, Yufang; Liu, Taigang; Wang, Jun; Zheng, Xiaoqi

    2013-01-01

    Identification of gene-phenotype relationships is a fundamental challenge in human health clinic. Based on the observation that genes causing the same or similar phenotypes tend to correlate with each other in the protein-protein interaction network, a lot of network-based approaches were proposed based on different underlying models. A recent comparative study showed that diffusion-based methods achieve the state-of-the-art predictive performance. In this paper, a new diffusion-based method was proposed to prioritize candidate disease genes. Diffusion profile of a disease was defined as the stationary distribution of candidate genes given a random walk with restart where similarities between phenotypes are incorporated. Then, candidate disease genes are prioritized by comparing their diffusion profiles with that of the disease. Finally, the effectiveness of our method was demonstrated through the leave-one-out cross-validation against control genes from artificial linkage intervals and randomly chosen genes. Comparative study showed that our method achieves improved performance compared to some classical diffusion-based methods. To further illustrate our method, we used our algorithm to predict new causing genes of 16 multifactorial diseases including Prostate cancer and Alzheimer's disease, and the top predictions were in good consistent with literature reports. Our study indicates that integration of multiple information sources, especially the phenotype similarity profile data, and introduction of global similarity measure between disease and gene diffusion profiles are helpful for prioritizing candidate disease genes. Programs and data are available upon request.

  14. Semantic similarity measures in the biomedical domain by leveraging a web search engine.

    Science.gov (United States)

    Hsieh, Sheau-Ling; Chang, Wen-Yung; Chen, Chi-Huang; Weng, Yung-Ching

    2013-07-01

    Various researches in web related semantic similarity measures have been deployed. However, measuring semantic similarity between two terms remains a challenging task. The traditional ontology-based methodologies have a limitation that both concepts must be resided in the same ontology tree(s). Unfortunately, in practice, the assumption is not always applicable. On the other hand, if the corpus is sufficiently adequate, the corpus-based methodologies can overcome the limitation. Now, the web is a continuous and enormous growth corpus. Therefore, a method of estimating semantic similarity is proposed via exploiting the page counts of two biomedical concepts returned by Google AJAX web search engine. The features are extracted as the co-occurrence patterns of two given terms P and Q, by querying P, Q, as well as P AND Q, and the web search hit counts of the defined lexico-syntactic patterns. These similarity scores of different patterns are evaluated, by adapting support vector machines for classification, to leverage the robustness of semantic similarity measures. Experimental results validating against two datasets: dataset 1 provided by A. Hliaoutakis; dataset 2 provided by T. Pedersen, are presented and discussed. In dataset 1, the proposed approach achieves the best correlation coefficient (0.802) under SNOMED-CT. In dataset 2, the proposed method obtains the best correlation coefficient (SNOMED-CT: 0.705; MeSH: 0.723) with physician scores comparing with measures of other methods. However, the correlation coefficients (SNOMED-CT: 0.496; MeSH: 0.539) with coder scores received opposite outcomes. In conclusion, the semantic similarity findings of the proposed method are close to those of physicians' ratings. Furthermore, the study provides a cornerstone investigation for extracting fully relevant information from digitizing, free-text medical records in the National Taiwan University Hospital database.

  15. Accelerating Information Retrieval from Profile Hidden Markov Model Databases.

    Science.gov (United States)

    Tamimi, Ahmad; Ashhab, Yaqoub; Tamimi, Hashem

    2016-01-01

    Profile Hidden Markov Model (Profile-HMM) is an efficient statistical approach to represent protein families. Currently, several databases maintain valuable protein sequence information as profile-HMMs. There is an increasing interest to improve the efficiency of searching Profile-HMM databases to detect sequence-profile or profile-profile homology. However, most efforts to enhance searching efficiency have been focusing on improving the alignment algorithms. Although the performance of these algorithms is fairly acceptable, the growing size of these databases, as well as the increasing demand for using batch query searching approach, are strong motivations that call for further enhancement of information retrieval from profile-HMM databases. This work presents a heuristic method to accelerate the current profile-HMM homology searching approaches. The method works by cluster-based remodeling of the database to reduce the search space, rather than focusing on the alignment algorithms. Using different clustering techniques, 4284 TIGRFAMs profiles were clustered based on their similarities. A representative for each cluster was assigned. To enhance sensitivity, we proposed an extended step that allows overlapping among clusters. A validation benchmark of 6000 randomly selected protein sequences was used to query the clustered profiles. To evaluate the efficiency of our approach, speed and recall values were measured and compared with the sequential search approach. Using hierarchical, k-means, and connected component clustering techniques followed by the extended overlapping step, we obtained an average reduction in time of 41%, and an average recall of 96%. Our results demonstrate that representation of profile-HMMs using a clustering-based approach can significantly accelerate data retrieval from profile-HMM databases.

  16. Female choice for male cuticular hydrocarbon profile in decorated crickets is not based on similarity to their own profile.

    Science.gov (United States)

    Steiger, S; Capodeanu-Nägler, A; Gershman, S N; Weddle, C B; Rapkin, J; Sakaluk, S K; Hunt, J

    2015-12-01

    Indirect genetic benefits derived from female mate choice comprise additive (good genes) and nonadditive genetic benefits (genetic compatibility). Although good genes can be revealed by condition-dependent display traits, the mechanism by which compatibility alleles are detected is unclear because evaluation of the genetic similarity of a prospective mate requires the female to assess the genotype of the male and compare it to her own. Cuticular hydrocarbons (CHCs), lipids coating the exoskeleton of most insects, influence female mate choice in a number of species and offer a way for females to assess genetic similarity of prospective mates. Here, we determine whether female mate choice in decorated crickets is based on male CHCs and whether it is influenced by females' own CHC profiles. We used multivariate selection analysis to estimate the strength and form of selection acting on male CHCs through female mate choice, and employed different measures of multivariate dissimilarity to determine whether a female's preference for male CHCs is based on similarity to her own CHC profile. Female mating preferences were significantly influenced by CHC profiles of males. Male CHC attractiveness was not, however, contingent on the CHC profile of the choosing female, as certain male CHC phenotypes were equally attractive to most females, evidenced by significant linear and stabilizing selection gradients. These results suggest that additive genetic benefits, rather than nonadditive genetic benefits, accrue to female mate choice, in support of earlier work showing that CHC expression of males, but not females, is condition dependent. © 2015 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2015 European Society For Evolutionary Biology.

  17. Detecting atypical examples of known domain types by sequence similarity searching: the SBASE domain library approach.

    Science.gov (United States)

    Dhir, Somdutta; Pacurar, Mircea; Franklin, Dino; Gáspári, Zoltán; Kertész-Farkas, Attila; Kocsor, András; Eisenhaber, Frank; Pongor, Sándor

    2010-11-01

    SBASE is a project initiated to detect known domain types and predicting domain architectures using sequence similarity searching (Simon et al., Protein Seq Data Anal, 5: 39-42, 1992, Pongor et al, Nucl. Acids. Res. 21:3111-3115, 1992). The current approach uses a curated collection of domain sequences - the SBASE domain library - and standard similarity search algorithms, followed by postprocessing which is based on a simple statistics of the domain similarity network (http://hydra.icgeb.trieste.it/sbase/). It is especially useful in detecting rare, atypical examples of known domain types which are sometimes missed even by more sophisticated methodologies. This approach does not require multiple alignment or machine learning techniques, and can be a useful complement to other domain detection methodologies. This article gives an overview of the project history as well as of the concepts and principles developed within this the project.

  18. Accelerating Information Retrieval from Profile Hidden Markov Model Databases.

    Directory of Open Access Journals (Sweden)

    Ahmad Tamimi

    Full Text Available Profile Hidden Markov Model (Profile-HMM is an efficient statistical approach to represent protein families. Currently, several databases maintain valuable protein sequence information as profile-HMMs. There is an increasing interest to improve the efficiency of searching Profile-HMM databases to detect sequence-profile or profile-profile homology. However, most efforts to enhance searching efficiency have been focusing on improving the alignment algorithms. Although the performance of these algorithms is fairly acceptable, the growing size of these databases, as well as the increasing demand for using batch query searching approach, are strong motivations that call for further enhancement of information retrieval from profile-HMM databases. This work presents a heuristic method to accelerate the current profile-HMM homology searching approaches. The method works by cluster-based remodeling of the database to reduce the search space, rather than focusing on the alignment algorithms. Using different clustering techniques, 4284 TIGRFAMs profiles were clustered based on their similarities. A representative for each cluster was assigned. To enhance sensitivity, we proposed an extended step that allows overlapping among clusters. A validation benchmark of 6000 randomly selected protein sequences was used to query the clustered profiles. To evaluate the efficiency of our approach, speed and recall values were measured and compared with the sequential search approach. Using hierarchical, k-means, and connected component clustering techniques followed by the extended overlapping step, we obtained an average reduction in time of 41%, and an average recall of 96%. Our results demonstrate that representation of profile-HMMs using a clustering-based approach can significantly accelerate data retrieval from profile-HMM databases.

  19. Searching for a WISC-R Profile for Learning Disabled Children: An Inappropriate Task?

    Science.gov (United States)

    Ryckman, David B.

    1981-01-01

    Although indexes of scatter on the Wechsler Intelligence Scale for Children-Revised computed for 100 learning disabled (LD) elementary children were significantly greater than values previously reported for the normal standardized sample, the substantial overlap suggests the inadvisability of continuing the search for a characteristic LD profile.…

  20. Similarity Digest Search: A Survey and Comparative Analysis of Strategies to Perform Known File Filtering Using Approximate Matching

    Directory of Open Access Journals (Sweden)

    Vitor Hugo Galhardo Moia

    2017-01-01

    Full Text Available Digital forensics is a branch of Computer Science aiming at investigating and analyzing electronic devices in the search for crime evidence. There are several ways to perform this search. Known File Filter (KFF is one of them, where a list of interest objects is used to reduce/separate data for analysis. Holding a database of hashes of such objects, the examiner performs lookups for matches against the target device. However, due to limitations over hash functions (inability to detect similar objects, new methods have been designed, called approximate matching. This sort of function has interesting characteristics for KFF investigations but suffers mainly from high costs when dealing with huge data sets, as the search is usually done by brute force. To mitigate this problem, strategies have been developed to better perform lookups. In this paper, we present the state of the art of similarity digest search strategies, along with a detailed comparison involving several aspects, as time complexity, memory requirement, and search precision. Our results show that none of the approaches address at least these main aspects. Finally, we discuss future directions and present requirements for a new strategy aiming to fulfill current limitations.

  1. Personalization in E-commerce using profiles similarity

    Directory of Open Access Journals (Sweden)

    Radu LIXANDROIU

    2015-06-01

    Full Text Available Understanding the use needs is one of the key factors of an online project. If these needs are quickly identified, the customer can be offered the best products immediately. Creating profiles allows the identification and communication of needs efficiently and effectively. Basically if these profiles are well established, it remains to identify just which is the closest profile to the online client. Profiling is a useful tool in marketing, increasing the functionality of sales application. These tools fall into customer-oriented tools, together with the analytical techniques ones and those suggesting the desired products.

  2. Applying ligands profiling using multiple extended electron distribution based field templates and feature trees similarity searching in the discovery of new generation of urea-based antineoplastic kinase inhibitors.

    Directory of Open Access Journals (Sweden)

    Eman M Dokla

    Full Text Available This study provides a comprehensive computational procedure for the discovery of novel urea-based antineoplastic kinase inhibitors while focusing on diversification of both chemotype and selectivity pattern. It presents a systematic structural analysis of the different binding motifs of urea-based kinase inhibitors and the corresponding configurations of the kinase enzymes. The computational model depends on simultaneous application of two protocols. The first protocol applies multiple consecutive validated virtual screening filters including SMARTS, support vector-machine model (ROC = 0.98, Bayesian model (ROC = 0.86 and structure-based pharmacophore filters based on urea-based kinase inhibitors complexes retrieved from literature. This is followed by hits profiling against different extended electron distribution (XED based field templates representing different kinase targets. The second protocol enables cancericidal activity verification by using the algorithm of feature trees (Ftrees similarity searching against NCI database. Being a proof-of-concept study, this combined procedure was experimentally validated by its utilization in developing a novel series of urea-based derivatives of strong anticancer activity. This new series is based on 3-benzylbenzo[d]thiazol-2(3H-one scaffold which has interesting chemical feasibility and wide diversification capability. Antineoplastic activity of this series was assayed in vitro against NCI 60 tumor-cell lines showing very strong inhibition of GI(50 as low as 0.9 uM. Additionally, its mechanism was unleashed using KINEX™ protein kinase microarray-based small molecule inhibitor profiling platform and cell cycle analysis showing a peculiar selectivity pattern against Zap70, c-src, Mink1, csk and MeKK2 kinases. Interestingly, it showed activity on syk kinase confirming the recent studies finding of the high activity of diphenyl urea containing compounds against this kinase. Allover, the new series

  3. SimShiftDB; local conformational restraints derived from chemical shift similarity searches on a large synthetic database

    Energy Technology Data Exchange (ETDEWEB)

    Ginzinger, Simon W. [Center of Applied Molecular Engineering, University of Salzburg, Department of Molecular Biology, Division of Bioinformatics (Austria)], E-mail: simon@came.sbg.ac.at; Coles, Murray [Max-Planck-Institute for Developmental Biology, Department of Protein Evolution (Germany)], E-mail: Murray.Coles@tuebingen.mpg.de

    2009-03-15

    We present SimShiftDB, a new program to extract conformational data from protein chemical shifts using structural alignments. The alignments are obtained in searches of a large database containing 13,000 structures and corresponding back-calculated chemical shifts. SimShiftDB makes use of chemical shift data to provide accurate results even in the case of low sequence similarity, and with even coverage of the conformational search space. We compare SimShiftDB to HHSearch, a state-of-the-art sequence-based search tool, and to TALOS, the current standard tool for the task. We show that for a significant fraction of the predicted similarities, SimShiftDB outperforms the other two methods. Particularly, the high coverage afforded by the larger database often allows predictions to be made for residues not involved in canonical secondary structure, where TALOS predictions are both less frequent and more error prone. Thus SimShiftDB can be seen as a complement to currently available methods.

  4. SimShiftDB; local conformational restraints derived from chemical shift similarity searches on a large synthetic database

    International Nuclear Information System (INIS)

    Ginzinger, Simon W.; Coles, Murray

    2009-01-01

    We present SimShiftDB, a new program to extract conformational data from protein chemical shifts using structural alignments. The alignments are obtained in searches of a large database containing 13,000 structures and corresponding back-calculated chemical shifts. SimShiftDB makes use of chemical shift data to provide accurate results even in the case of low sequence similarity, and with even coverage of the conformational search space. We compare SimShiftDB to HHSearch, a state-of-the-art sequence-based search tool, and to TALOS, the current standard tool for the task. We show that for a significant fraction of the predicted similarities, SimShiftDB outperforms the other two methods. Particularly, the high coverage afforded by the larger database often allows predictions to be made for residues not involved in canonical secondary structure, where TALOS predictions are both less frequent and more error prone. Thus SimShiftDB can be seen as a complement to currently available methods

  5. Self-similar solutions with compactly supported profile of some nonlinear Schrodinger equations

    Directory of Open Access Journals (Sweden)

    Pascal Begout

    2014-04-01

    Full Text Available ``Sharp localized'' solutions (i.e. with compact support for each given time t of a singular nonlinear type Schr\\"odinger equation in the whole space $\\mathbb{R}^N$ are constructed here under the assumption that they have a self-similar structure. It requires the assumption that the external forcing term satisfies that $\\mathbf{f}(t,x=t^{-(\\mathbf{p}-2/2}\\mathbf{F}(t^{-1/2}x$ for some complex exponent $\\mathbf{p}$ and for some profile function $\\mathbf{F}$ which is assumed to be with compact support in $\\mathbb{R}^N$. We show the existence of solutions of the form $\\mathbf{u}(t,x=t^{\\mathbf{p}/2}\\mathbf{U}(t^{-1/2}x$, with a profile $\\mathbf{U}$, which also has compact support in $\\mathbb{R}^N$. The proof of the localization of the support of the profile $\\mathbf{U}$ uses some suitable energy method applied to the stationary problem satisfied by $\\mathbf{U}$ after some unknown transformation.

  6. Towards novel organic high-Tc superconductors: Data mining using density of states similarity search

    Science.gov (United States)

    Geilhufe, R. Matthias; Borysov, Stanislav S.; Kalpakchi, Dmytro; Balatsky, Alexander V.

    2018-02-01

    Identifying novel functional materials with desired key properties is an important part of bridging the gap between fundamental research and technological advancement. In this context, high-throughput calculations combined with data-mining techniques highly accelerated this process in different areas of research during the past years. The strength of a data-driven approach for materials prediction lies in narrowing down the search space of thousands of materials to a subset of prospective candidates. Recently, the open-access organic materials database OMDB was released providing electronic structure data for thousands of previously synthesized three-dimensional organic crystals. Based on the OMDB, we report about the implementation of a novel density of states similarity search tool which is capable of retrieving materials with similar density of states to a reference material. The tool is based on the approximate nearest neighbor algorithm as implemented in the ANNOY library and can be applied via the OMDB web interface. The approach presented here is wide ranging and can be applied to various problems where the density of states is responsible for certain key properties of a material. As the first application, we report about materials exhibiting electronic structure similarities to the aromatic hydrocarbon p-terphenyl which was recently discussed as a potential organic high-temperature superconductor exhibiting a transition temperature in the order of 120 K under strong potassium doping. Although the mechanism driving the remarkable transition temperature remains under debate, we argue that the density of states, reflecting the electronic structure of a material, might serve as a crucial ingredient for the observed high Tc. To provide candidates which might exhibit comparable properties, we present 15 purely organic materials with similar features to p-terphenyl within the electronic structure, which also tend to have structural similarities with p

  7. Detecting and classifying method based on similarity matching of Android malware behavior with profile.

    Science.gov (United States)

    Jang, Jae-Wook; Yun, Jaesung; Mohaisen, Aziz; Woo, Jiyoung; Kim, Huy Kang

    2016-01-01

    Mass-market mobile security threats have increased recently due to the growth of mobile technologies and the popularity of mobile devices. Accordingly, techniques have been introduced for identifying, classifying, and defending against mobile threats utilizing static, dynamic, on-device, and off-device techniques. Static techniques are easy to evade, while dynamic techniques are expensive. On-device techniques are evasion, while off-device techniques need being always online. To address some of those shortcomings, we introduce Andro-profiler, a hybrid behavior based analysis and classification system for mobile malware. Andro-profiler main goals are efficiency, scalability, and accuracy. For that, Andro-profiler classifies malware by exploiting the behavior profiling extracted from the integrated system logs including system calls. Andro-profiler executes a malicious application on an emulator in order to generate the integrated system logs, and creates human-readable behavior profiles by analyzing the integrated system logs. By comparing the behavior profile of malicious application with representative behavior profile for each malware family using a weighted similarity matching technique, Andro-profiler detects and classifies it into malware families. The experiment results demonstrate that Andro-profiler is scalable, performs well in detecting and classifying malware with accuracy greater than 98 %, outperforms the existing state-of-the-art work, and is capable of identifying 0-day mobile malware samples.

  8. Cognitive Profiles on the Severe Impairment Battery Are Similar in Alzheimer Disease and Down Syndrome With Dementia.

    Science.gov (United States)

    Dick, Malcolm B; Doran, Eric; Phelan, Michael; Lott, Ira T

    2016-01-01

    Previous research has revealed similarities in the neuropathology, clinical presentation, and risk factors between persons with Alzheimer disease from the general population (GP-AD) and those with Down syndrome (DS-AD). Less is known, however, about the extent of similarities and differences in the cognitive profiles of these 2 populations. Fifty-one moderate to severely demented GP-AD and 59 DS-AD individuals participated in this study which compared the cognitive profiles of these 2 populations on the Severe Impairment Battery (SIB), controlling for sex as well as level of functional ability using a modified version of the Bristol Activities of Daily Living Scale. Overall, the neuropsychological profiles of the higher-functioning individuals within the DS-AD and advanced GP-AD groups, as represented by mean difference scores on the SIB as a whole and across the 9 separate cognitive domains, were very similar to one another after adjusting for sex and functional impairment. To our knowledge, this is the first study to directly compare the cognitive profiles of these 2 populations on the SIB. Findings suggest that the underlying dementia in GP-AD and DS-AD may have corresponding and parallel effects on cognition.

  9. Children's Search Engines from an Information Search Process Perspective.

    Science.gov (United States)

    Broch, Elana

    2000-01-01

    Describes cognitive and affective characteristics of children and teenagers that may affect their Web searching behavior. Reviews literature on children's searching in online public access catalogs (OPACs) and using digital libraries. Profiles two Web search engines. Discusses some of the difficulties children have searching the Web, in the…

  10. The cognitive profile of behavioural variant FTD and its similarities with ALS: a systematic review and meta-analysis.

    Science.gov (United States)

    Beeldman, Emma; Raaphorst, Joost; Klein Twennaar, Michelle; Govaarts, Rosanne; Pijnenburg, Yolande A L; de Haan, Rob J; de Visser, Marianne; Schmand, Ben A

    2018-02-09

    Approximately 30% of patients with amyotrophic lateral sclerosis (ALS) have cognitive impairment and 8%-14% fulfil the criteria for behavioural variant frontotemporal dementia (bv-FTD). The cognitive profiles of ALS and bv-FTD have been reported to be comparable, but this has never been systematically investigated. We aimed to determine the cognitive profile of bv-FTD and examine its similarities with that of ALS, to provide evidence for the existence of a cognitive disease continuum encompassing bv-FTD and ALS. We therefore systematically reviewed neuropsychological studies on bv-FTD patients and healthy volunteers. Neuropsychological tests were divided in 10 cognitive domains and effect sizes were calculated for all domains and compared with the cognitive profile of ALS by means of a visual comparison and a Pearson's r correlation coefficient. We included 120 studies, totalling 2425 bv-FTD patients and 2798 healthy controls. All cognitive domains showed substantial effect sizes, indicating cognitive impairment in bv-FTD patients compared to healthy controls. The cognitive domains with the largest effect sizes were social cognition, verbal memory and fluency (1.77-1.53). The cognitive profiles of bv-FTD and ALS (10 cognitive domains, 1287 patients) showed similarities on visual comparison and a moderate correlation 0.58 (p=0.13). When social cognition, verbal memory, fluency, executive functions, language and visuoperception were considered, i.e. the cognitive profile of ALS, Pearson's r was 0.73 (p=0.09), which raised to 0.92 (p=0.03), when language was excluded in this systematic analysis of patients with a non-language subtype of FTD. The cognitive profile of bv-FTD consists of deficits in social cognition, verbal memory, fluency and executive functions and shows similarities with the cognitive profile of ALS. These findings support a cognitive continuum encompassing ALS and bv-FTD. © Article author(s) (or their employer(s) unless otherwise stated in the text

  11. Content-based Music Search and Recommendation System

    Science.gov (United States)

    Takegawa, Kazuki; Hijikata, Yoshinori; Nishida, Shogo

    Recently, the turn volume of music data on the Internet has increased rapidly. This has increased the user's cost to find music data suiting their preference from such a large data set. We propose a content-based music search and recommendation system. This system has an interface for searching and finding music data and an interface for editing a user profile which is necessary for music recommendation. By exploiting the visualization of the feature space of music and the visualization of the user profile, the user can search music data and edit the user profile. Furthermore, by exploiting the infomation which can be acquired from each visualized object in a mutually complementary manner, we make it easier for the user to search music data and edit the user profile. Concretely, the system gives to the user an information obtained from the user profile when searching music data and an information obtained from the feature space of music when editing the user profile.

  12. Maternal and perinatal outcomes in 143 Danish women with gestational diabetes mellitus and 143 controls with a similar risk profile

    DEFF Research Database (Denmark)

    Jensen, Dorte Møller; Sørensen, B; Feilberg-Jørgensen, N

    2000-01-01

    To assess maternal and fetal outcomes in pregnancies complicated by gestational diabetes mellitus (GDM) compared to non-diabetic pregnancies with an otherwise similar risk profile and to study the association between different anti-diabetic treatments and fetal outcomes.......To assess maternal and fetal outcomes in pregnancies complicated by gestational diabetes mellitus (GDM) compared to non-diabetic pregnancies with an otherwise similar risk profile and to study the association between different anti-diabetic treatments and fetal outcomes....

  13. Visibiome: an efficient microbiome search engine based on a scalable, distributed architecture.

    Science.gov (United States)

    Azman, Syafiq Kamarul; Anwar, Muhammad Zohaib; Henschel, Andreas

    2017-07-24

    Given the current influx of 16S rRNA profiles of microbiota samples, it is conceivable that large amounts of them eventually are available for search, comparison and contextualization with respect to novel samples. This process facilitates the identification of similar compositional features in microbiota elsewhere and therefore can help to understand driving factors for microbial community assembly. We present Visibiome, a microbiome search engine that can perform exhaustive, phylogeny based similarity search and contextualization of user-provided samples against a comprehensive dataset of 16S rRNA profiles environments, while tackling several computational challenges. In order to scale to high demands, we developed a distributed system that combines web framework technology, task queueing and scheduling, cloud computing and a dedicated database server. To further ensure speed and efficiency, we have deployed Nearest Neighbor search algorithms, capable of sublinear searches in high-dimensional metric spaces in combination with an optimized Earth Mover Distance based implementation of weighted UniFrac. The search also incorporates pairwise (adaptive) rarefaction and optionally, 16S rRNA copy number correction. The result of a query microbiome sample is the contextualization against a comprehensive database of microbiome samples from a diverse range of environments, visualized through a rich set of interactive figures and diagrams, including barchart-based compositional comparisons and ranking of the closest matches in the database. Visibiome is a convenient, scalable and efficient framework to search microbiomes against a comprehensive database of environmental samples. The search engine leverages a popular but computationally expensive, phylogeny based distance metric, while providing numerous advantages over the current state of the art tool.

  14. GEPSI: A Gene Expression Profile Similarity-Based Identification Method of Bioactive Components in Traditional Chinese Medicine Formula.

    Science.gov (United States)

    Zhang, Baixia; He, Shuaibing; Lv, Chenyang; Zhang, Yanling; Wang, Yun

    2018-01-01

    The identification of bioactive components in traditional Chinese medicine (TCM) is an important part of the TCM material foundation research. Recently, molecular docking technology has been extensively used for the identification of TCM bioactive components. However, target proteins that are used in molecular docking may not be the actual TCM target. For this reason, the bioactive components would likely be omitted or incorrect. To address this problem, this study proposed the GEPSI method that identified the target proteins of TCM based on the similarity of gene expression profiles. The similarity of the gene expression profiles affected by TCM and small molecular drugs was calculated. The pharmacological action of TCM may be similar to that of small molecule drugs that have a high similarity score. Indeed, the target proteins of the small molecule drugs could be considered TCM targets. Thus, we identified the bioactive components of a TCM by molecular docking and verified the reliability of this method by a literature investigation. Using the target proteins that TCM actually affected as targets, the identification of the bioactive components was more accurate. This study provides a fast and effective method for the identification of TCM bioactive components.

  15. Outsourced similarity search on metric data assets

    KAUST Repository

    Yiu, Man Lung

    2012-02-01

    This paper considers a cloud computing setting in which similarity querying of metric data is outsourced to a service provider. The data is to be revealed only to trusted users, not to the service provider or anyone else. Users query the server for the most similar data objects to a query example. Outsourcing offers the data owner scalability and a low-initial investment. The need for privacy may be due to the data being sensitive (e.g., in medicine), valuable (e.g., in astronomy), or otherwise confidential. Given this setting, the paper presents techniques that transform the data prior to supplying it to the service provider for similarity queries on the transformed data. Our techniques provide interesting trade-offs between query cost and accuracy. They are then further extended to offer an intuitive privacy guarantee. Empirical studies with real data demonstrate that the techniques are capable of offering privacy while enabling efficient and accurate processing of similarity queries.

  16. A Similarity Search Using Molecular Topological Graphs

    Directory of Open Access Journals (Sweden)

    Yoshifumi Fukunishi

    2009-01-01

    Full Text Available A molecular similarity measure has been developed using molecular topological graphs and atomic partial charges. Two kinds of topological graphs were used. One is the ordinary adjacency matrix and the other is a matrix which represents the minimum path length between two atoms of the molecule. The ordinary adjacency matrix is suitable to compare the local structures of molecules such as functional groups, and the other matrix is suitable to compare the global structures of molecules. The combination of these two matrices gave a similarity measure. This method was applied to in silico drug screening, and the results showed that it was effective as a similarity measure.

  17. Wake structure and similar behavior of wake profiles downstream of a plunging airfoil

    Directory of Open Access Journals (Sweden)

    Ali R. DAVARI

    2017-08-01

    Full Text Available Very limited attention has already been paid to the velocity behavior in the wake region in unsteady aerodynamic problems. A series of tests has been performed on a flapping airfoil in a subsonic wind tunnel to study the wake structure for different sets of mean angle of attack, plunging amplitude and reduced frequency. In this study, the velocity profiles in the wake for various oscillation parameters have been measured using a wide shoulder rake, especially designed for the present experiments. The airfoil under consideration was a critical section of a 660 kW wind turbine. The results show that for a flapping airfoil the wake structure can be of drag producing type, thrust producing or neutral, depending on the mean angle of attack, oscillation amplitude and reduced frequency. In a thrust producing wake, a high-momentum high-velocity jet flow is formed in the core region of the wake instead of the conventional low-momentum flow. As a result, the drag force normally experienced by the body due to the momentum deficit would be replaced by a thrust force. According to the results, the momentum loss in the wake decreases as the reduced frequency increases. The thrust producing wake pattern for the flapping airfoil has been observed for sufficiently low angles of attack in the absence of the viscous effects. This phenomenon has also been observed for either high oscillation amplitudes or high reduced frequencies. According to the results, for different reduced frequencies and plunging amplitudes, such that the product of them be a constant, the velocity profiles exhibit similar behavior and coalesce on each other. This similarity parameter works excellently at small angles of attack. However, at near stall boundaries, the similarity is not as evident as before.

  18. Formulation and evaluation of a montelukast sodium orally disintegrating tablet with a similar dissolution profile as the marketed product.

    Science.gov (United States)

    Chen, Yong; Feng, Tingting; Li, Yong; Du, Bin; Weng, Weiyu

    2017-03-01

    A major challenge of orally disintegrating tablet (ODT) development is predicting its bioequivalence to its corresponding marketed product. Therefore, comparing ODT dissolution profiles to those of the corresponding marketed product is very important. The objective of this study was to develop a 5.2-mg montelukast sodium (MS) ODT with a similar dissolution profile to that of the marketed chewable tablet. Dissolution profiles were examined in different media to screen each formulation. We found that MS dissolution from ODTs in acidic medium heavily depended on manufacturing methods. All MS ODTs prepared using direct compression rapidly disintegrated in acidic medium. However, dispersed MS powders aggregated into sticky masses, resulting in slow dissolution. In contrast, MS ODTs prepared using wet granulation had much faster dissolution rates in acidic medium with no obvious aggregation. Additionally, the optimized formulation, prepared using wet granulation, displayed similar dissolution profiles to the marketed reference in all four types of media examined (f 2  >   50). The in vitro disintegration time of the optimized ODT was 9.5 ± 2.4 s, which meets FDA requirements. In conclusion, the wet granulation preparation method of MS ODTs resulted in a product with equivalent dissolution profiles as those of the marketed product.

  19. Self-similarity of temperature profiles in distant galaxy clusters: the quest for a universal law

    Science.gov (United States)

    Baldi, A.; Ettori, S.; Molendi, S.; Gastaldello, F.

    2012-09-01

    Context. We present the XMM-Newton temperature profiles of 12 bright (LX > 4 × 1044 erg s-1) clusters of galaxies at 0.4 high-redshift clusters, to investigate their properties, and to define a universal law to describe the temperature radial profiles in galaxy clusters as a function of both cosmic time and their state of relaxation. Methods: We performed a spatially resolved spectral analysis, using Cash statistics, to measure the temperature in the intracluster medium at different radii. Results: We extracted temperature profiles for the clusters in our sample, finding that all profiles are declining toward larger radii. The normalized temperature profiles (normalized by the mean temperature T500) are found to be generally self-similar. The sample was subdivided into five cool-core (CC) and seven non cool-core (NCC) clusters by introducing a pseudo-entropy ratio σ = (TIN/TOUT) × (EMIN/EMOUT)-1/3 and defining the objects with σ ratio σ is detected by fitting a function of r and σ, showing an indication that the outer part of the profiles becomes steeper for higher values of σ (i.e. transitioning toward the NCC clusters). No significant evidence of redshift evolution could be found within the redshift range sampled by our clusters (0.4 high-z sample with intermediate clusters at 0.1 0.4 has been attempted. We were able to define the closest possible relation to a universal law for the temperature profiles of galaxy clusters at 0.1 < z < 0.9, showing a dependence on both the relaxation state of the clusters and the redshift. Appendix A is only available in electronic form at http://www.aanda.org

  20. Automated search method for AFM and profilers

    Science.gov (United States)

    Ray, Michael; Martin, Yves C.

    2001-08-01

    A new automation software creates a search model as an initial setup and searches for a user-defined target in atomic force microscopes or stylus profilometers used in semiconductor manufacturing. The need for such automation has become critical in manufacturing lines. The new method starts with a survey map of a small area of a chip obtained from a chip-design database or an image of the area. The user interface requires a user to point to and define a precise location to be measured, and to select a macro function for an application such as line width or contact hole. The search algorithm automatically constructs a range of possible scan sequences within the survey, and provides increased speed and functionality compared to the methods used in instruments to date. Each sequence consists in a starting point relative to the target, a scan direction, and a scan length. The search algorithm stops when the location of a target is found and criteria for certainty in positioning is met. With today's capability in high speed processing and signal control, the tool can simultaneously scan and search for a target in a robotic and continuous manner. Examples are given that illustrate the key concepts.

  1. TargetSearch--a Bioconductor package for the efficient preprocessing of GC-MS metabolite profiling data.

    Science.gov (United States)

    Cuadros-Inostroza, Alvaro; Caldana, Camila; Redestig, Henning; Kusano, Miyako; Lisec, Jan; Peña-Cortés, Hugo; Willmitzer, Lothar; Hannah, Matthew A

    2009-12-16

    Metabolite profiling, the simultaneous quantification of multiple metabolites in an experiment, is becoming increasingly popular, particularly with the rise of systems-level biology. The workhorse in this field is gas-chromatography hyphenated with mass spectrometry (GC-MS). The high-throughput of this technology coupled with a demand for large experiments has led to data pre-processing, i.e. the quantification of metabolites across samples, becoming a major bottleneck. Existing software has several limitations, including restricted maximum sample size, systematic errors and low flexibility. However, the biggest limitation is that the resulting data usually require extensive hand-curation, which is subjective and can typically take several days to weeks. We introduce the TargetSearch package, an open source tool which is a flexible and accurate method for pre-processing even very large numbers of GC-MS samples within hours. We developed a novel strategy to iteratively correct and update retention time indices for searching and identifying metabolites. The package is written in the R programming language with computationally intensive functions written in C for speed and performance. The package includes a graphical user interface to allow easy use by those unfamiliar with R. TargetSearch allows fast and accurate data pre-processing for GC-MS experiments and overcomes the sample number limitations and manual curation requirements of existing software. We validate our method by carrying out an analysis against both a set of known chemical standard mixtures and of a biological experiment. In addition we demonstrate its capabilities and speed by comparing it with other GC-MS pre-processing tools. We believe this package will greatly ease current bottlenecks and facilitate the analysis of metabolic profiling data.

  2. Genome-Wide Expression Profiling of Five Mouse Models Identifies Similarities and Differences with Human Psoriasis

    Science.gov (United States)

    Swindell, William R.; Johnston, Andrew; Carbajal, Steve; Han, Gangwen; Wohn, Christian; Lu, Jun; Xing, Xianying; Nair, Rajan P.; Voorhees, John J.; Elder, James T.; Wang, Xiao-Jing; Sano, Shigetoshi; Prens, Errol P.; DiGiovanni, John; Pittelkow, Mark R.; Ward, Nicole L.; Gudjonsson, Johann E.

    2011-01-01

    Development of a suitable mouse model would facilitate the investigation of pathomechanisms underlying human psoriasis and would also assist in development of therapeutic treatments. However, while many psoriasis mouse models have been proposed, no single model recapitulates all features of the human disease, and standardized validation criteria for psoriasis mouse models have not been widely applied. In this study, whole-genome transcriptional profiling is used to compare gene expression patterns manifested by human psoriatic skin lesions with those that occur in five psoriasis mouse models (K5-Tie2, imiquimod, K14-AREG, K5-Stat3C and K5-TGFbeta1). While the cutaneous gene expression profiles associated with each mouse phenotype exhibited statistically significant similarity to the expression profile of psoriasis in humans, each model displayed distinctive sets of similarities and differences in comparison to human psoriasis. For all five models, correspondence to the human disease was strong with respect to genes involved in epidermal development and keratinization. Immune and inflammation-associated gene expression, in contrast, was more variable between models as compared to the human disease. These findings support the value of all five models as research tools, each with identifiable areas of convergence to and divergence from the human disease. Additionally, the approach used in this paper provides an objective and quantitative method for evaluation of proposed mouse models of psoriasis, which can be strategically applied in future studies to score strengths of mouse phenotypes relative to specific aspects of human psoriasis. PMID:21483750

  3. Beyond the search surface: visual search and attentional engagement.

    Science.gov (United States)

    Duncan, J; Humphreys, G

    1992-05-01

    Treisman (1991) described a series of visual search studies testing feature integration theory against an alternative (Duncan & Humphreys, 1989) in which feature and conjunction search are basically similar. Here the latter account is noted to have 2 distinct levels: (a) a summary of search findings in terms of stimulus similarities, and (b) a theory of how visual attention is brought to bear on relevant objects. Working at the 1st level, Treisman found that even when similarities were calibrated and controlled, conjunction search was much harder than feature search. The theory, however, can only really be tested at the 2nd level, because the 1st is an approximation. An account of the findings is developed at the 2nd level, based on the 2 processes of input-template matching and spreading suppression. New data show that, when both of these factors are controlled, feature and conjunction search are equally difficult. Possibilities for unification of the alternative views are considered.

  4. Combination of Pharmacophore Matching, 2D Similarity Search, and In Vitro Biological Assays in the Selection of Potential 5-HT6 Antagonists from Large Commercial Repositories.

    Science.gov (United States)

    Dobi, Krisztina; Flachner, Beáta; Pukáncsik, Mária; Máthé, Enikő; Bognár, Melinda; Szaszkó, Mária; Magyar, Csaba; Hajdú, István; Lőrincz, Zsolt; Simon, István; Fülöp, Ferenc; Cseh, Sándor; Dormán, György

    2015-10-01

    Rapid in silico selection of target-focused libraries from commercial repositories is an attractive and cost-effective approach. If structures of active compounds are available, rapid 2D similarity search can be performed on multimillion compound databases, but the generated library requires further focusing. We report here a combination of the 2D approach with pharmacophore matching which was used for selecting 5-HT6 antagonists. In the first screening round, 12 compounds showed >85% antagonist efficacy of the 91 screened. For the second-round (hit validation) screening phase, pharmacophore models were built, applied, and compared with the routine 2D similarity search. Three pharmacophore models were created based on the structure of the reference compounds and the first-round hit compounds. The pharmacophore search resulted in a high hit rate (40%) and led to novel chemotypes, while 2D similarity search had slightly better hit rate (51%), but lacking the novelty. To demonstrate the power of the virtual screening cascade, ligand efficiency indices were also calculated and their steady improvement was confirmed. © 2015 John Wiley & Sons A/S.

  5. Similarity of TIMSS Math and Science Achievement of Nations

    Directory of Open Access Journals (Sweden)

    Algirdas Zabulionis

    2001-09-01

    Full Text Available In 1991-97, the International Association for the Evaluation of Educational Achievement (IEA undertook a Third International Mathematics and Science Study (TIMSS in which data about the mathematics and science achievement of the thirteen year-old students in more than 40 countries were collected. These data provided the opportunity to search for patterns of students' answers to the test items: which group of items was relatively more difficult (or more easy for the students from a particular country (or group of countries. Using this massive data set an attempt was made to measure the similarities among country profiles of how students responded to the test items.

  6. Searching the protein structure database for ligand-binding site similarities using CPASS v.2

    Directory of Open Access Journals (Sweden)

    Caprez Adam

    2011-01-01

    Full Text Available Abstract Background A recent analysis of protein sequences deposited in the NCBI RefSeq database indicates that ~8.5 million protein sequences are encoded in prokaryotic and eukaryotic genomes, where ~30% are explicitly annotated as "hypothetical" or "uncharacterized" protein. Our Comparison of Protein Active-Site Structures (CPASS v.2 database and software compares the sequence and structural characteristics of experimentally determined ligand binding sites to infer a functional relationship in the absence of global sequence or structure similarity. CPASS is an important component of our Functional Annotation Screening Technology by NMR (FAST-NMR protocol and has been successfully applied to aid the annotation of a number of proteins of unknown function. Findings We report a major upgrade to our CPASS software and database that significantly improves its broad utility. CPASS v.2 is designed with a layered architecture to increase flexibility and portability that also enables job distribution over the Open Science Grid (OSG to increase speed. Similarly, the CPASS interface was enhanced to provide more user flexibility in submitting a CPASS query. CPASS v.2 now allows for both automatic and manual definition of ligand-binding sites and permits pair-wise, one versus all, one versus list, or list versus list comparisons. Solvent accessible surface area, ligand root-mean square difference, and Cβ distances have been incorporated into the CPASS similarity function to improve the quality of the results. The CPASS database has also been updated. Conclusions CPASS v.2 is more than an order of magnitude faster than the original implementation, and allows for multiple simultaneous job submissions. Similarly, the CPASS database of ligand-defined binding sites has increased in size by ~ 38%, dramatically increasing the likelihood of a positive search result. The modification to the CPASS similarity function is effective in reducing CPASS similarity scores

  7. Automated real-time search and analysis algorithms for a non-contact 3D profiling system

    Science.gov (United States)

    Haynes, Mark; Wu, Chih-Hang John; Beck, B. Terry; Peterman, Robert J.

    2013-04-01

    The purpose of this research is to develop a new means of identifying and extracting geometrical feature statistics from a non-contact precision-measurement 3D profilometer. Autonomous algorithms have been developed to search through large-scale Cartesian point clouds to identify and extract geometrical features. These algorithms are developed with the intent of providing real-time production quality control of cold-rolled steel wires. The steel wires in question are prestressing steel reinforcement wires for concrete members. The geometry of the wire is critical in the performance of the overall concrete structure. For this research a custom 3D non-contact profilometry system has been developed that utilizes laser displacement sensors for submicron resolution surface profiling. Optimizations in the control and sensory system allow for data points to be collected at up to an approximate 400,000 points per second. In order to achieve geometrical feature extraction and tolerancing with this large volume of data, the algorithms employed are optimized for parsing large data quantities. The methods used provide a unique means of maintaining high resolution data of the surface profiles while keeping algorithm running times within practical bounds for industrial application. By a combination of regional sampling, iterative search, spatial filtering, frequency filtering, spatial clustering, and template matching a robust feature identification method has been developed. These algorithms provide an autonomous means of verifying tolerances in geometrical features. The key method of identifying the features is through a combination of downhill simplex and geometrical feature templates. By performing downhill simplex through several procedural programming layers of different search and filtering techniques, very specific geometrical features can be identified within the point cloud and analyzed for proper tolerancing. Being able to perform this quality control in real time

  8. TargetSearch - a Bioconductor package for the efficient preprocessing of GC-MS metabolite profiling data

    Science.gov (United States)

    2009-01-01

    Background Metabolite profiling, the simultaneous quantification of multiple metabolites in an experiment, is becoming increasingly popular, particularly with the rise of systems-level biology. The workhorse in this field is gas-chromatography hyphenated with mass spectrometry (GC-MS). The high-throughput of this technology coupled with a demand for large experiments has led to data pre-processing, i.e. the quantification of metabolites across samples, becoming a major bottleneck. Existing software has several limitations, including restricted maximum sample size, systematic errors and low flexibility. However, the biggest limitation is that the resulting data usually require extensive hand-curation, which is subjective and can typically take several days to weeks. Results We introduce the TargetSearch package, an open source tool which is a flexible and accurate method for pre-processing even very large numbers of GC-MS samples within hours. We developed a novel strategy to iteratively correct and update retention time indices for searching and identifying metabolites. The package is written in the R programming language with computationally intensive functions written in C for speed and performance. The package includes a graphical user interface to allow easy use by those unfamiliar with R. Conclusions TargetSearch allows fast and accurate data pre-processing for GC-MS experiments and overcomes the sample number limitations and manual curation requirements of existing software. We validate our method by carrying out an analysis against both a set of known chemical standard mixtures and of a biological experiment. In addition we demonstrate its capabilities and speed by comparing it with other GC-MS pre-processing tools. We believe this package will greatly ease current bottlenecks and facilitate the analysis of metabolic profiling data. PMID:20015393

  9. TargetSearch - a Bioconductor package for the efficient preprocessing of GC-MS metabolite profiling data

    Directory of Open Access Journals (Sweden)

    Lisec Jan

    2009-12-01

    Full Text Available Abstract Background Metabolite profiling, the simultaneous quantification of multiple metabolites in an experiment, is becoming increasingly popular, particularly with the rise of systems-level biology. The workhorse in this field is gas-chromatography hyphenated with mass spectrometry (GC-MS. The high-throughput of this technology coupled with a demand for large experiments has led to data pre-processing, i.e. the quantification of metabolites across samples, becoming a major bottleneck. Existing software has several limitations, including restricted maximum sample size, systematic errors and low flexibility. However, the biggest limitation is that the resulting data usually require extensive hand-curation, which is subjective and can typically take several days to weeks. Results We introduce the TargetSearch package, an open source tool which is a flexible and accurate method for pre-processing even very large numbers of GC-MS samples within hours. We developed a novel strategy to iteratively correct and update retention time indices for searching and identifying metabolites. The package is written in the R programming language with computationally intensive functions written in C for speed and performance. The package includes a graphical user interface to allow easy use by those unfamiliar with R. Conclusions TargetSearch allows fast and accurate data pre-processing for GC-MS experiments and overcomes the sample number limitations and manual curation requirements of existing software. We validate our method by carrying out an analysis against both a set of known chemical standard mixtures and of a biological experiment. In addition we demonstrate its capabilities and speed by comparing it with other GC-MS pre-processing tools. We believe this package will greatly ease current bottlenecks and facilitate the analysis of metabolic profiling data.

  10. Outsourced Similarity Search on Metric Data Assets

    DEFF Research Database (Denmark)

    Yiu, Man Lung; Assent, Ira; Jensen, Christian S.

    2012-01-01

    . Outsourcing offers the data owner scalability and a low initial investment. The need for privacy may be due to the data being sensitive (e.g., in medicine), valuable (e.g., in astronomy), or otherwise confidential. Given this setting, the paper presents techniques that transform the data prior to supplying......This paper considers a cloud computing setting in which similarity querying of metric data is outsourced to a service provider. The data is to be revealed only to trusted users, not to the service provider or anyone else. Users query the server for the most similar data objects to a query example...

  11. A summary report on the search for current technologies and developers to develop depth profiling/physical parameter end effectors

    International Nuclear Information System (INIS)

    Nguyen, Q.H.

    1994-01-01

    This report documents the search strategies and results for available technologies and developers to develop tank waste depth profiling/physical parameter sensors. Sources searched include worldwide research reports, technical papers, journals, private industries, and work at Westinghouse Hanford Company (WHC) at Richland site. Tank waste physical parameters of interest are: abrasiveness, compressive strength, corrosiveness, density, pH, particle size/shape, porosity, radiation, settling velocity, shear strength, shear wave velocity, tensile strength, temperature, viscosity, and viscoelasticity. A list of related articles or sources for each physical parameters is provided

  12. A summary report on the search for current technologies and developers to develop depth profiling/physical parameter end effectors

    Energy Technology Data Exchange (ETDEWEB)

    Nguyen, Q.H.

    1994-09-12

    This report documents the search strategies and results for available technologies and developers to develop tank waste depth profiling/physical parameter sensors. Sources searched include worldwide research reports, technical papers, journals, private industries, and work at Westinghouse Hanford Company (WHC) at Richland site. Tank waste physical parameters of interest are: abrasiveness, compressive strength, corrosiveness, density, pH, particle size/shape, porosity, radiation, settling velocity, shear strength, shear wave velocity, tensile strength, temperature, viscosity, and viscoelasticity. A list of related articles or sources for each physical parameters is provided.

  13. APPLICATION OF A SELF-SIMILAR PRESSURE PROFILE TO SUNYAEV-ZEL'DOVICH EFFECT DATA FROM GALAXY CLUSTERS

    International Nuclear Information System (INIS)

    Mroczkowski, Tony; Miller, Amber; Bonamente, Max; Carlstrom, John E.; Culverhouse, Thomas L.; Greer, Christopher; Hennessy, Ryan; Leitch, Erik M.; Loh, Michael; Marrone, Daniel P.; Pryke, Clem; Sharp, Matthew; Hawkins, David; Lamb, James W.; Woody, David; Joy, Marshall; Maughan, Ben; Muchovej, Stephen; Nagai, Daisuke

    2009-01-01

    We investigate the utility of a new, self-similar pressure profile for fitting Sunyaev-Zel'dovich (SZ) effect observations of galaxy clusters. Current SZ imaging instruments-such as the Sunyaev-Zel'dovich Array (SZA)-are capable of probing clusters over a large range in a physical scale. A model is therefore required that can accurately describe a cluster's pressure profile over a broad range of radii from the core of the cluster out to a significant fraction of the virial radius. In the analysis presented here, we fit a radial pressure profile derived from simulations and detailed X-ray analysis of relaxed clusters to SZA observations of three clusters with exceptionally high-quality X-ray data: A1835, A1914, and CL J1226.9+3332. From the joint analysis of the SZ and X-ray data, we derive physical properties such as gas mass, total mass, gas fraction and the intrinsic, integrated Compton y-parameter. We find that parameters derived from the joint fit to the SZ and X-ray data agree well with a detailed, independent X-ray-only analysis of the same clusters. In particular, we find that, when combined with X-ray imaging data, this new pressure profile yields an independent electron radial temperature profile that is in good agreement with spectroscopic X-ray measurements.

  14. A Framework for Similarity Search with Space-Time Tradeoffs using Locality Sensitive Filtering

    DEFF Research Database (Denmark)

    Christiani, Tobias Lybecker

    2017-01-01

    that satisfies certain locality-sensitivity properties, we can construct a dynamic data structure that solves the approximate near neighbor problem in $d$-dimensional space with query time $dn^{\\rho_q + o(1)}$, update time $dn^{\\rho_u + o(1)}$, and space usage $dn + n^{1 + \\rho_u + o(1)}$ where $n$ denotes......We present a framework for similarity search based on Locality-Sensitive Filtering~(LSF),generalizing the Indyk-Motwani (STOC 1998) Locality-Sensitive Hashing~(LSH) framework to support space-time tradeoffs. Given a family of filters, defined as a distribution over pairs of subsets of space...... the number of points in the data structure.The space-time tradeoff is tied to the tradeoff between query time and update time (insertions/deletions), controlled by the exponents $\\rho_q, \\rho_u$ that are determined by the filter family. \\\\ Locality-sensitive filtering was introduced by Becker et al. (SODA...

  15. Methods of Profile Cloning Detection in Online Social Networks

    Directory of Open Access Journals (Sweden)

    Zabielski Michał

    2016-01-01

    Full Text Available With the arrival of online social networks, the importance of privacy on the Internet has increased dramatically. Thus, it is important to develop mechanisms that will prevent our hidden personal data from unauthorized access and use. In this paper an attempt was made to present a concept of profile cloning detection in Online Social Networks (OSN using Graph and Networks Theory. By analysing structural similarity of network and value of attributes of user personal profile, we will be able to search for attackers which steal our identity.

  16. Community-aware user profile enrichment in folksonomy.

    Science.gov (United States)

    Xie, Haoran; Li, Qing; Mao, Xudong; Li, Xiaodong; Cai, Yi; Rao, Yanghui

    2014-10-01

    In the era of big data, collaborative tagging (a.k.a. folksonomy) systems have proliferated as a consequence of the growth of Web 2.0 communities. Constructing user profiles from folksonomy systems is useful for many applications such as personalized search and recommender systems. The identification of latent user communities is one way to better understand and meet user needs. The behavior of users is highly influenced by the behavior of their neighbors or community members, and this can be utilized in constructing user profiles. However, conventional user profiling techniques often encounter data sparsity problems as data from a single user is insufficient to build a powerful profile. Hence, in this paper we propose a method of enriching user profiles based on latent user communities in folksonomy data. Specifically, the proposed approach contains four sub-processes: (i) tag-based user profiles are extracted from a folksonomy tripartite graph; (ii) a multi-faceted folksonomy graph is constructed by integrating tag and image affinity subgraphs with the folksonomy tripartite graph; (iii) random walk distance is used to unify various relationships and measure user similarities; (iv) a novel prototype-based clustering method based on user similarities is used to identify user communities, which are further used to enrich the extracted user profiles. To evaluate the proposed method, we conducted experiments using a public dataset, the results of which show that our approach outperforms previous ones in user profile enrichment. Copyright © 2014 Elsevier Ltd. All rights reserved.

  17. A Novel Personalized Web Search Model

    Institute of Scientific and Technical Information of China (English)

    ZHU Zhengyu; XU Jingqiu; TIAN Yunyan; REN Xiang

    2007-01-01

    A novel personalized Web search model is proposed.The new system, as a middleware between a user and a Web search engine, is set up on the client machine. It can learn a user's preference implicitly and then generate the user profile automatically. When the user inputs query keywords, the system can automatically generate a few personalized expansion words by computing the term-term associations according to the current user profile, and then these words together with the query keywords are submitted to a popular search engine such as Yahoo or Google.These expansion words help to express accurately the user's search intention. The new Web search model can make a common search engine personalized, that is, the search engine can return different search results to different users who input the same keywords. The experimental results show the feasibility and applicability of the presented work.

  18. Interest Profile Elevation, Big Five Personality Traits, and Secondary Constructs on the Self-Directed Search: A Replication and Extension

    Science.gov (United States)

    Bullock, Emily E.; Reardon, Robert C.

    2008-01-01

    The study used the Self-Directed Search (SDS) and the NEO-FFI to explore profile elevation, four secondary constructs, and the Big Five personality factors in a sample of college students in a career course. Regression model results showed that openness, conscientiousness, differentiation high-low, differentiation Iachan, and consistency accounted…

  19. Improving performance of content-based image retrieval schemes in searching for similar breast mass regions: an assessment

    International Nuclear Information System (INIS)

    Wang Xiaohui; Park, Sang Cheol; Zheng Bin

    2009-01-01

    This study aims to assess three methods commonly used in content-based image retrieval (CBIR) schemes and investigate the approaches to improve scheme performance. A reference database involving 3000 regions of interest (ROIs) was established. Among them, 400 ROIs were randomly selected to form a testing dataset. Three methods, namely mutual information, Pearson's correlation and a multi-feature-based k-nearest neighbor (KNN) algorithm, were applied to search for the 15 'the most similar' reference ROIs to each testing ROI. The clinical relevance and visual similarity of searching results were evaluated using the areas under receiver operating characteristic (ROC) curves (A Z ) and average mean square difference (MSD) of the mass boundary spiculation level ratings between testing and selected ROIs, respectively. The results showed that the A Z values were 0.893 ± 0.009, 0.606 ± 0.021 and 0.699 ± 0.026 for the use of KNN, mutual information and Pearson's correlation, respectively. The A Z values increased to 0.724 ± 0.017 and 0.787 ± 0.016 for mutual information and Pearson's correlation when using ROIs with the size adaptively adjusted based on actual mass size. The corresponding MSD values were 2.107 ± 0.718, 2.301 ± 0.733 and 2.298 ± 0.743. The study demonstrates that due to the diversity of medical images, CBIR schemes using multiple image features and mass size-based ROIs can achieve significantly improved performance.

  20. Profiles and Context for Structured Text Retrieval

    DEFF Research Database (Denmark)

    Koolen, Marijn; Bogers, Toine

    2017-01-01

    The combination of structured information retrieval with user profile information represents the scenario where systems search with an explicit statement of the information need—a search query—as well as a profile of a user, which can contain information about previous interactions, search histor...

  1. Familial searching on DNA mixtures with dropout

    NARCIS (Netherlands)

    Slooten, K.

    2016-01-01

    Familial searching, the act of searching a database for a relative of an unknown individual whose DNA profile has been obtained, is usually restricted to cases where the DNA profile of that person has been unambiguously determined. Therefore, it is normally applied only with a good quality single

  2. Trajectory similarity join in spatial networks

    KAUST Repository

    Shang, Shuo; Chen, Lisi; Wei, Zhewei; Jensen, Christian S.; Zheng, Kai; Kalnis, Panos

    2017-01-01

    With these applications in mind, we provide a purposeful definition of similarity. To enable efficient TS-Join processing on large sets of trajectories, we develop search space pruning techniques and take into account the parallel processing capabilities of modern processors. Specifically, we present a two-phase divide-and-conquer algorithm. For each trajectory, the algorithm first finds similar trajectories. Then it merges the results to achieve a final result. The algorithm exploits an upper bound on the spatiotemporal similarity and a heuristic scheduling strategy for search space pruning. The algorithm's per-trajectory searches are independent of each other and can be performed in parallel, and the merging has constant cost. An empirical study with real data offers insight in the performance of the algorithm and demonstrates that is capable of outperforming a well-designed baseline algorithm by an order of magnitude.

  3. Outsourced similarity search on metric data assets

    KAUST Repository

    Yiu, Man Lung; Assent, Ira; Jensen, Christian Sø ndergaard; Kalnis, Panos

    2012-01-01

    for the most similar data objects to a query example. Outsourcing offers the data owner scalability and a low-initial investment. The need for privacy may be due to the data being sensitive (e.g., in medicine), valuable (e.g., in astronomy), or otherwise

  4. OpenSearch technology for geospatial resources discovery

    Science.gov (United States)

    Papeschi, Fabrizio; Enrico, Boldrini; Mazzetti, Paolo

    2010-05-01

    In 2005, the term Web 2.0 has been coined by Tim O'Reilly to describe a quickly growing set of Web-based applications that share a common philosophy of "mutually maximizing collective intelligence and added value for each participant by formalized and dynamic information sharing". Around this same period, OpenSearch a new Web 2.0 technology, was developed. More properly, OpenSearch is a collection of technologies that allow publishing of search results in a format suitable for syndication and aggregation. It is a way for websites and search engines to publish search results in a standard and accessible format. Due to its strong impact on the way the Web is perceived by users and also due its relevance for businesses, Web 2.0 has attracted the attention of both mass media and the scientific community. This explosive growth in popularity of Web 2.0 technologies like OpenSearch, and practical applications of Service Oriented Architecture (SOA) resulted in an increased interest in similarities, convergence, and a potential synergy of these two concepts. SOA is considered as the philosophy of encapsulating application logic in services with a uniformly defined interface and making these publicly available via discovery mechanisms. Service consumers may then retrieve these services, compose and use them according to their current needs. A great degree of similarity between SOA and Web 2.0 may be leading to a convergence between the two paradigms. They also expose divergent elements, such as the Web 2.0 support to the human interaction in opposition to the typical SOA machine-to-machine interaction. According to these considerations, the Geospatial Information (GI) domain, is also moving first steps towards a new approach of data publishing and discovering, in particular taking advantage of the OpenSearch technology. A specific GI niche is represented by the OGC Catalog Service for Web (CSW) that is part of the OGC Web Services (OWS) specifications suite, which provides a

  5. Trajectory similarity join in spatial networks

    KAUST Repository

    Shang, Shuo

    2017-09-07

    The matching of similar pairs of objects, called similarity join, is fundamental functionality in data management. We consider the case of trajectory similarity join (TS-Join), where the objects are trajectories of vehicles moving in road networks. Thus, given two sets of trajectories and a threshold θ, the TS-Join returns all pairs of trajectories from the two sets with similarity above θ. This join targets applications such as trajectory near-duplicate detection, data cleaning, ridesharing recommendation, and traffic congestion prediction. With these applications in mind, we provide a purposeful definition of similarity. To enable efficient TS-Join processing on large sets of trajectories, we develop search space pruning techniques and take into account the parallel processing capabilities of modern processors. Specifically, we present a two-phase divide-and-conquer algorithm. For each trajectory, the algorithm first finds similar trajectories. Then it merges the results to achieve a final result. The algorithm exploits an upper bound on the spatiotemporal similarity and a heuristic scheduling strategy for search space pruning. The algorithm\\'s per-trajectory searches are independent of each other and can be performed in parallel, and the merging has constant cost. An empirical study with real data offers insight in the performance of the algorithm and demonstrates that is capable of outperforming a well-designed baseline algorithm by an order of magnitude.

  6. HangOut: generating clean PSI-BLAST profiles for domains with long insertions.

    Science.gov (United States)

    Kim, Bong-Hyun; Cong, Qian; Grishin, Nick V

    2010-06-15

    Profile-based similarity search is an essential step in structure-function studies of proteins. However, inclusion of non-homologous sequence segments into a profile causes its corruption and results in false positives. Profile corruption is common in multidomain proteins, and single domains with long insertions are a significant source of errors. We developed a procedure (HangOut) that, for a single domain with specified insertion position, cleans erroneously extended PSI-BLAST alignments to generate better profiles. HangOut is implemented in Python 2.3 and runs on all Unix-compatible platforms. The source code is available under the GNU GPL license at http://prodata.swmed.edu/HangOut/. Supplementary data are available at Bioinformatics online.

  7. The role of drug profiles as similarity metrics: applications to repurposing, adverse effects detection and drug-drug interactions.

    Science.gov (United States)

    Vilar, Santiago; Hripcsak, George

    2017-07-01

    Explosion of the availability of big data sources along with the development in computational methods provides a useful framework to study drugs' actions, such as interactions with pharmacological targets and off-targets. Databases related to protein interactions, adverse effects and genomic profiles are available to be used for the construction of computational models. In this article, we focus on the description of biological profiles for drugs that can be used as a system to compare similarity and create methods to predict and analyze drugs' actions. We highlight profiles constructed with different biological data, such as target-protein interactions, gene expression measurements, adverse effects and disease profiles. We focus on the discovery of new targets or pathways for drugs already in the pharmaceutical market, also called drug repurposing, in the interaction with off-targets responsible for adverse reactions and in drug-drug interaction analysis. The current and future applications, strengths and challenges facing all these methods are also discussed. Biological profiles or signatures are an important source of data generation to deeply analyze biological actions with important implications in drug-related studies. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  8. World Wide Web-based system for the calculation of substituent parameters and substituent similarity searches.

    Science.gov (United States)

    Ertl, P

    1998-02-01

    Easy to use, interactive, and platform-independent WWW-based tools are ideal for development of chemical applications. By using the newly emerging Web technologies such as Java applets and sophisticated scripting, it is possible to deliver powerful molecular processing capabilities directly to the desk of synthetic organic chemists. In Novartis Crop Protection in Basel, a Web-based molecular modelling system has been in use since 1995. In this article two new modules of this system are presented: a program for interactive calculation of important hydrophobic, electronic, and steric properties of organic substituents, and a module for substituent similarity searches enabling the identification of bioisosteric functional groups. Various possible applications of calculated substituent parameters are also discussed, including automatic design of molecules with the desired properties and creation of targeted virtual combinatorial libraries.

  9. Behavioral Profiles of Children with Williams Syndrome from Spain and the United States: Cross-Cultural Similarities and Differences

    Science.gov (United States)

    Pérez-García, Débora; Brun-Gasca, Carme; Pérez-Jurado, Luis A.; Mervis, Carolyn B.

    2017-01-01

    To identify similarities and differences in the behavioral profile of children with Williams syndrome from Spain (n = 53) and the United States (n = 145), we asked parents of 6- to 14-year-olds with Williams syndrome to complete the Child Behavior Checklist 6-18. The distribution of raw scores was significantly higher for the Spanish sample than…

  10. In Silico target fishing: addressing a "Big Data" problem by ligand-based similarity rankings with data fusion.

    Science.gov (United States)

    Liu, Xian; Xu, Yuan; Li, Shanshan; Wang, Yulan; Peng, Jianlong; Luo, Cheng; Luo, Xiaomin; Zheng, Mingyue; Chen, Kaixian; Jiang, Hualiang

    2014-01-01

    Ligand-based in silico target fishing can be used to identify the potential interacting target of bioactive ligands, which is useful for understanding the polypharmacology and safety profile of existing drugs. The underlying principle of the approach is that known bioactive ligands can be used as reference to predict the targets for a new compound. We tested a pipeline enabling large-scale target fishing and drug repositioning, based on simple fingerprint similarity rankings with data fusion. A large library containing 533 drug relevant targets with 179,807 active ligands was compiled, where each target was defined by its ligand set. For a given query molecule, its target profile is generated by similarity searching against the ligand sets assigned to each target, for which individual searches utilizing multiple reference structures are then fused into a single ranking list representing the potential target interaction profile of the query compound. The proposed approach was validated by 10-fold cross validation and two external tests using data from DrugBank and Therapeutic Target Database (TTD). The use of the approach was further demonstrated with some examples concerning the drug repositioning and drug side-effects prediction. The promising results suggest that the proposed method is useful for not only finding promiscuous drugs for their new usages, but also predicting some important toxic liabilities. With the rapid increasing volume and diversity of data concerning drug related targets and their ligands, the simple ligand-based target fishing approach would play an important role in assisting future drug design and discovery.

  11. High similarity of phylogenetic profiles of rate-limiting enzymes with inhibitory relation in Human, Mouse, Rat, budding Yeast and E. coli.

    Science.gov (United States)

    Zhao, Min; Qu, Hong

    2011-11-30

    The phylogenetic profile is widely used to characterize functional linkage and conservation between proteins without amino acid sequence similarity. To survey the conservative regulatory properties of rate-limiting enzymes (RLEs) in metabolic inhibitory network across different species, we define the enzyme inhibiting pair as: where the first enzyme in a pair is the inhibitor provider and the second is the target of the inhibitor. Phylogenetic profiles of enzymes in the inhibiting pairs are further generated to measure the functional linkage of these enzymes during evolutionary history. We find that the RLEs generate, on average, over half of all in vivo inhibitors in each surveyed model organism. And these inhibitors inhibit on average over 85% targets in metabolic inhibitory network and cover the majority of targets of cross-pathway inhibiting relations. Furthermore, we demonstrate that the phylogenetic profiles of the enzymes in inhibiting pairs in which at least one enzyme is rate-limiting often show higher similarities than those in common inhibiting enzyme pairs. In addition, RLEs, compared to common metabolic enzymes, often tend to produce ADP instead of AMP in conservative inhibitory networks. Combined with the conservative roles of RLEs in their efficiency in sensing metabolic signals and transmitting regulatory signals to the rest of the metabolic system, the RLEs may be important molecules in balancing energy homeostasis via maintaining the ratio of ATP to ADP in living cells. Furthermore, our results indicate that similarities of phylogenetic profiles of enzymes in the inhibiting enzyme pairs are not only correlated with enzyme topological importance, but also related with roles of the enzymes in metabolic inhibitory network.

  12. Domain similarity based orthology detection.

    Science.gov (United States)

    Bitard-Feildel, Tristan; Kemena, Carsten; Greenwood, Jenny M; Bornberg-Bauer, Erich

    2015-05-13

    Orthologous protein detection software mostly uses pairwise comparisons of amino-acid sequences to assert whether two proteins are orthologous or not. Accordingly, when the number of sequences for comparison increases, the number of comparisons to compute grows in a quadratic order. A current challenge of bioinformatic research, especially when taking into account the increasing number of sequenced organisms available, is to make this ever-growing number of comparisons computationally feasible in a reasonable amount of time. We propose to speed up the detection of orthologous proteins by using strings of domains to characterize the proteins. We present two new protein similarity measures, a cosine and a maximal weight matching score based on domain content similarity, and new software, named porthoDom. The qualities of the cosine and the maximal weight matching similarity measures are compared against curated datasets. The measures show that domain content similarities are able to correctly group proteins into their families. Accordingly, the cosine similarity measure is used inside porthoDom, the wrapper developed for proteinortho. porthoDom makes use of domain content similarity measures to group proteins together before searching for orthologs. By using domains instead of amino acid sequences, the reduction of the search space decreases the computational complexity of an all-against-all sequence comparison. We demonstrate that representing and comparing proteins as strings of discrete domains, i.e. as a concatenation of their unique identifiers, allows a drastic simplification of search space. porthoDom has the advantage of speeding up orthology detection while maintaining a degree of accuracy similar to proteinortho. The implementation of porthoDom is released using python and C++ languages and is available under the GNU GPL licence 3 at http://www.bornberglab.org/pages/porthoda .

  13. Parallel trajectory similarity joins in spatial networks

    KAUST Repository

    Shang, Shuo

    2018-04-04

    The matching of similar pairs of objects, called similarity join, is fundamental functionality in data management. We consider two cases of trajectory similarity joins (TS-Joins), including a threshold-based join (Tb-TS-Join) and a top-k TS-Join (k-TS-Join), where the objects are trajectories of vehicles moving in road networks. Given two sets of trajectories and a threshold θ, the Tb-TS-Join returns all pairs of trajectories from the two sets with similarity above θ. In contrast, the k-TS-Join does not take a threshold as a parameter, and it returns the top-k most similar trajectory pairs from the two sets. The TS-Joins target diverse applications such as trajectory near-duplicate detection, data cleaning, ridesharing recommendation, and traffic congestion prediction. With these applications in mind, we provide purposeful definitions of similarity. To enable efficient processing of the TS-Joins on large sets of trajectories, we develop search space pruning techniques and enable use of the parallel processing capabilities of modern processors. Specifically, we present a two-phase divide-and-conquer search framework that lays the foundation for the algorithms for the Tb-TS-Join and the k-TS-Join that rely on different pruning techniques to achieve efficiency. For each trajectory, the algorithms first find similar trajectories. Then they merge the results to obtain the final result. The algorithms for the two joins exploit different upper and lower bounds on the spatiotemporal trajectory similarity and different heuristic scheduling strategies for search space pruning. Their per-trajectory searches are independent of each other and can be performed in parallel, and the mergings have constant cost. An empirical study with real data offers insight in the performance of the algorithms and demonstrates that they are capable of outperforming well-designed baseline algorithms by an order of magnitude.

  14. Parallel trajectory similarity joins in spatial networks

    KAUST Repository

    Shang, Shuo; Chen, Lisi; Wei, Zhewei; Jensen, Christian S.; Zheng, Kai; Kalnis, Panos

    2018-01-01

    The matching of similar pairs of objects, called similarity join, is fundamental functionality in data management. We consider two cases of trajectory similarity joins (TS-Joins), including a threshold-based join (Tb-TS-Join) and a top-k TS-Join (k-TS-Join), where the objects are trajectories of vehicles moving in road networks. Given two sets of trajectories and a threshold θ, the Tb-TS-Join returns all pairs of trajectories from the two sets with similarity above θ. In contrast, the k-TS-Join does not take a threshold as a parameter, and it returns the top-k most similar trajectory pairs from the two sets. The TS-Joins target diverse applications such as trajectory near-duplicate detection, data cleaning, ridesharing recommendation, and traffic congestion prediction. With these applications in mind, we provide purposeful definitions of similarity. To enable efficient processing of the TS-Joins on large sets of trajectories, we develop search space pruning techniques and enable use of the parallel processing capabilities of modern processors. Specifically, we present a two-phase divide-and-conquer search framework that lays the foundation for the algorithms for the Tb-TS-Join and the k-TS-Join that rely on different pruning techniques to achieve efficiency. For each trajectory, the algorithms first find similar trajectories. Then they merge the results to obtain the final result. The algorithms for the two joins exploit different upper and lower bounds on the spatiotemporal trajectory similarity and different heuristic scheduling strategies for search space pruning. Their per-trajectory searches are independent of each other and can be performed in parallel, and the mergings have constant cost. An empirical study with real data offers insight in the performance of the algorithms and demonstrates that they are capable of outperforming well-designed baseline algorithms by an order of magnitude.

  15. Efficient data retrieval method for similar plasma waveforms in EAST

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Ying, E-mail: liuying-ipp@szu.edu.cn [SZU-CASIPP Joint Laboratory for Applied Plasma, Shenzhen University, Shenzhen 518060 (China); Huang, Jianjun; Zhou, Huasheng; Wang, Fan [SZU-CASIPP Joint Laboratory for Applied Plasma, Shenzhen University, Shenzhen 518060 (China); Wang, Feng [Institute of Plasma Physics Chinese Academy of Sciences, Hefei 230031 (China)

    2016-11-15

    Highlights: • The proposed method is carried out by means of bounding envelope and angle distance. • It allows retrieving for whole similar waveforms of any time length. • In addition, the proposed method is also possible to retrieve subsequences. - Abstract: Fusion research relies highly on data analysis due to its massive-sized database. In the present work, we propose an efficient method for searching and retrieving similar plasma waveforms in Experimental Advanced Superconducting Tokamak (EAST). Based on Piecewise Linear Aggregate Approximation (PLAA) for extracting feature values, the searching process is accomplished in two steps. The first one is coarse searching to narrow down the search space, which is carried out by means of bounding envelope. The second step is fine searching to retrieval similar waveforms, which is implemented by the angle distance. The proposed method is tested in EAST databases and turns out to have good performance in retrieving similar waveforms.

  16. Personalized Search

    CERN Document Server

    AUTHOR|(SzGeCERN)749939

    2015-01-01

    As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

  17. The Application of Similar Image Retrieval in Electronic Commerce

    Science.gov (United States)

    Hu, YuPing; Yin, Hua; Han, Dezhi; Yu, Fei

    2014-01-01

    Traditional online shopping platform (OSP), which searches product information by keywords, faces three problems: indirect search mode, large search space, and inaccuracy in search results. For solving these problems, we discuss and research the application of similar image retrieval in electronic commerce. Aiming at improving the network customers' experience and providing merchants with the accuracy of advertising, we design a reasonable and extensive electronic commerce application system, which includes three subsystems: image search display subsystem, image search subsystem, and product information collecting subsystem. This system can provide seamless connection between information platform and OSP, on which consumers can automatically and directly search similar images according to the pictures from information platform. At the same time, it can be used to provide accuracy of internet marketing for enterprises. The experiment shows the efficiency of constructing the system. PMID:24883411

  18. The Application of Similar Image Retrieval in Electronic Commerce

    Directory of Open Access Journals (Sweden)

    YuPing Hu

    2014-01-01

    Full Text Available Traditional online shopping platform (OSP, which searches product information by keywords, faces three problems: indirect search mode, large search space, and inaccuracy in search results. For solving these problems, we discuss and research the application of similar image retrieval in electronic commerce. Aiming at improving the network customers’ experience and providing merchants with the accuracy of advertising, we design a reasonable and extensive electronic commerce application system, which includes three subsystems: image search display subsystem, image search subsystem, and product information collecting subsystem. This system can provide seamless connection between information platform and OSP, on which consumers can automatically and directly search similar images according to the pictures from information platform. At the same time, it can be used to provide accuracy of internet marketing for enterprises. The experiment shows the efficiency of constructing the system.

  19. The application of similar image retrieval in electronic commerce.

    Science.gov (United States)

    Hu, YuPing; Yin, Hua; Han, Dezhi; Yu, Fei

    2014-01-01

    Traditional online shopping platform (OSP), which searches product information by keywords, faces three problems: indirect search mode, large search space, and inaccuracy in search results. For solving these problems, we discuss and research the application of similar image retrieval in electronic commerce. Aiming at improving the network customers' experience and providing merchants with the accuracy of advertising, we design a reasonable and extensive electronic commerce application system, which includes three subsystems: image search display subsystem, image search subsystem, and product information collecting subsystem. This system can provide seamless connection between information platform and OSP, on which consumers can automatically and directly search similar images according to the pictures from information platform. At the same time, it can be used to provide accuracy of internet marketing for enterprises. The experiment shows the efficiency of constructing the system.

  20. Application of 3D Zernike descriptors to shape-based ligand similarity searching.

    Science.gov (United States)

    Venkatraman, Vishwesh; Chakravarthy, Padmasini Ramji; Kihara, Daisuke

    2009-12-17

    The identification of promising drug leads from a large database of compounds is an important step in the preliminary stages of drug design. Although shape is known to play a key role in the molecular recognition process, its application to virtual screening poses significant hurdles both in terms of the encoding scheme and speed. In this study, we have examined the efficacy of the alignment independent three-dimensional Zernike descriptor (3DZD) for fast shape based similarity searching. Performance of this approach was compared with several other methods including the statistical moments based ultrafast shape recognition scheme (USR) and SIMCOMP, a graph matching algorithm that compares atom environments. Three benchmark datasets are used to thoroughly test the methods in terms of their ability for molecular classification, retrieval rate, and performance under the situation that simulates actual virtual screening tasks over a large pharmaceutical database. The 3DZD performed better than or comparable to the other methods examined, depending on the datasets and evaluation metrics used. Reasons for the success and the failure of the shape based methods for specific cases are investigated. Based on the results for the three datasets, general conclusions are drawn with regard to their efficiency and applicability. The 3DZD has unique ability for fast comparison of three-dimensional shape of compounds. Examples analyzed illustrate the advantages and the room for improvements for the 3DZD.

  1. A Hybrid Model Ranking Search Result for Research Paper Searching on Social Bookmarking

    Directory of Open Access Journals (Sweden)

    pijitra jomsri

    2015-11-01

    Full Text Available Social bookmarking and publication sharing systems are essential tools for web resource discovery. The performance and capabilities of search results from research paper bookmarking system are vital. Many researchers use social bookmarking for searching papers related to their topics of interest. This paper proposes a combination of similarity based indexing “tag title and abstract” and static ranking to improve search results. In this particular study, the year of the published paper and type of research paper publication are combined with similarity ranking called (HybridRank. Different weighting scores are employed. The retrieval performance of these weighted combination rankings are evaluated using mean values of NDCG. The results suggest that HybridRank and similarity rank with weight 75:25 has the highest NDCG scores. From the preliminary result of experiment, the combination ranking technique provide more relevant research paper search results. Furthermore the chosen heuristic ranking can improve the efficiency of research paper searching on social bookmarking websites.

  2. Density-based similarity measures for content based search

    Energy Technology Data Exchange (ETDEWEB)

    Hush, Don R [Los Alamos National Laboratory; Porter, Reid B [Los Alamos National Laboratory; Ruggiero, Christy E [Los Alamos National Laboratory

    2009-01-01

    We consider the query by multiple example problem where the goal is to identify database samples whose content is similar to a coUection of query samples. To assess the similarity we use a relative content density which quantifies the relative concentration of the query distribution to the database distribution. If the database distribution is a mixture of the query distribution and a background distribution then it can be shown that database samples whose relative content density is greater than a particular threshold {rho} are more likely to have been generated by the query distribution than the background distribution. We describe an algorithm for predicting samples with relative content density greater than {rho} that is computationally efficient and possesses strong performance guarantees. We also show empirical results for applications in computer network monitoring and image segmentation.

  3. Does linear separability really matter? Complex visual search is explained by simple search

    Science.gov (United States)

    Vighneshvel, T.; Arun, S. P.

    2013-01-01

    Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search. PMID:24029822

  4. Circulating Human Eosinophils Share a Similar Transcriptional Profile in Asthma and Other Hypereosinophilic Disorders.

    Science.gov (United States)

    Barnig, Cindy; Alsaleh, Ghada; Jung, Nicolas; Dembélé, Doulaye; Paul, Nicodème; Poirot, Anh; Uring-Lambert, Béatrice; Georgel, Philippe; de Blay, Fréderic; Bahram, Seiamak

    2015-01-01

    Eosinophils are leukocytes that are released into the peripheral blood in a phenotypically mature state and are capable of being recruited into tissues in response to appropriate stimuli. Eosinophils, traditionally considered cytotoxic effector cells, are leukocytes recruited into the airways of asthma patients where they are believed to contribute to the development of many features of the disease. This perception, however, has been challenged by recent findings suggesting that eosinophils have also immunomodulatory functions and may be involved in tissue homeostasis and wound healing. Here we describe a transcriptome-based approach-in a limited number of patients and controls-to investigate the activation state of circulating human eosinophils isolated by flow cytometry. We provide an overview of the global expression pattern in eosinophils in various relevant conditions, e.g., eosinophilic asthma, hypereosinophilic dermatological diseases, parasitosis and pulmonary aspergillosis. Compared to healthy subjects, circulating eosinophils isolated from asthma patients differed in their gene expression profile which is marked by downregulation of transcripts involved in antigen presentation, pathogen recognition and mucosal innate immunity, whereas up-regulated genes were involved in response to non-specific stimulation, wounding and maintenance of homeostasis. Eosinophils from other hypereosinophilic disorders displayed a very similar transcriptional profile. Taken together, these observations seem to indicate that eosinophils exhibit non-specific immunomodulatory functions important for tissue repair and homeostasis and suggest new roles for these cells in asthma immunobiology.

  5. Primary EBV infection induces an expression profile distinct from other viruses but similar to hemophagocytic syndromes.

    Directory of Open Access Journals (Sweden)

    Samantha K Dunmire

    Full Text Available Epstein-Barr Virus (EBV causes infectious mononucleosis and establishes lifelong infection associated with cancer and autoimmune disease. To better understand immunity to EBV, we performed a prospective study of natural infection in healthy humans. Transcriptome analysis defined a striking and reproducible expression profile during acute infection but no lasting gene changes were apparent during latent infection. Comparing the EBV response profile to multiple other acute viral infections, including influenza A (influenza, respiratory syncytial virus (RSV, human rhinovirus (HRV, attenuated yellow fever virus (YFV, and Dengue fever virus (DENV, revealed similarity only to DENV. The signature shared by EBV and DENV was also present in patients with hemophagocytic syndromes, suggesting these two viruses cause uncontrolled inflammatory responses. Interestingly, while EBV induced a strong type I interferon response, a subset of interferon induced genes, including MX1, HERC5, and OAS1, were not upregulated, suggesting a mechanism by which viral antagonism of immunity results in a profound inflammatory response. These data provide an important first description of the response to a natural herpesvirus infection in humans.

  6. Primary EBV Infection Induces an Expression Profile Distinct from Other Viruses but Similar to Hemophagocytic Syndromes

    Science.gov (United States)

    Dunmire, Samantha K.; Odumade, Oludare A.; Porter, Jean L.; Reyes-Genere, Juan; Schmeling, David O.; Bilgic, Hatice; Fan, Danhua; Baechler, Emily C.; Balfour, Henry H.; Hogquist, Kristin A.

    2014-01-01

    Epstein-Barr Virus (EBV) causes infectious mononucleosis and establishes lifelong infection associated with cancer and autoimmune disease. To better understand immunity to EBV, we performed a prospective study of natural infection in healthy humans. Transcriptome analysis defined a striking and reproducible expression profile during acute infection but no lasting gene changes were apparent during latent infection. Comparing the EBV response profile to multiple other acute viral infections, including influenza A (influenza), respiratory syncytial virus (RSV), human rhinovirus (HRV), attenuated yellow fever virus (YFV), and Dengue fever virus (DENV), revealed similarity only to DENV. The signature shared by EBV and DENV was also present in patients with hemophagocytic syndromes, suggesting these two viruses cause uncontrolled inflammatory responses. Interestingly, while EBV induced a strong type I interferon response, a subset of interferon induced genes, including MX1, HERC5, and OAS1, were not upregulated, suggesting a mechanism by which viral antagonism of immunity results in a profound inflammatory response. These data provide an important first description of the response to a natural herpesvirus infection in humans. PMID:24465555

  7. Application of 3D Zernike descriptors to shape-based ligand similarity searching

    Directory of Open Access Journals (Sweden)

    Venkatraman Vishwesh

    2009-12-01

    Full Text Available Abstract Background The identification of promising drug leads from a large database of compounds is an important step in the preliminary stages of drug design. Although shape is known to play a key role in the molecular recognition process, its application to virtual screening poses significant hurdles both in terms of the encoding scheme and speed. Results In this study, we have examined the efficacy of the alignment independent three-dimensional Zernike descriptor (3DZD for fast shape based similarity searching. Performance of this approach was compared with several other methods including the statistical moments based ultrafast shape recognition scheme (USR and SIMCOMP, a graph matching algorithm that compares atom environments. Three benchmark datasets are used to thoroughly test the methods in terms of their ability for molecular classification, retrieval rate, and performance under the situation that simulates actual virtual screening tasks over a large pharmaceutical database. The 3DZD performed better than or comparable to the other methods examined, depending on the datasets and evaluation metrics used. Reasons for the success and the failure of the shape based methods for specific cases are investigated. Based on the results for the three datasets, general conclusions are drawn with regard to their efficiency and applicability. Conclusion The 3DZD has unique ability for fast comparison of three-dimensional shape of compounds. Examples analyzed illustrate the advantages and the room for improvements for the 3DZD.

  8. Personalized Profile Based Search Interface With Ranked and Clustered Display

    National Research Council Canada - National Science Library

    Kumar, Sachin; Oztekin, B. U; Ertoz, Levent; Singhal, Saurabh; Han, Euihong; Kumar, Vipin

    2001-01-01

    We have developed an experimental meta-search engine, which takes the snippets from traditional search engines and presents them to the user either in the form of clusters, indices or re-ranked list...

  9. Gender similarities in somatic depression and in DSM depression secondary symptom profiles within the context of severity and bereavement.

    Science.gov (United States)

    Thompson, Angus H; Bland, Roger C

    2018-02-01

    Most population studies report higher rates of depression among women than men, and some researchers have observed gender differences in depression symptoms overall, or in sub-groupings (e.g. somatic depression). However, gender symptom differences have been inconsistent, prompting this investigation of gender differences in secondary DSM symptom profiles in the context of bereavement status, age, and depression severity. Individuals with symptoms of core depression (flat affect or anhedonia) were selected from a large survey of adults in the Alberta, Canada workforce. Analyses involved the comparison of gender profiles across the seven DSM-IV secondary depressive symptoms plus a MANOVA of sex, bereavement, and age, with secondary symptoms comprising the dependent variable. Gender profiles were very similar, irrespective of depression severity or bereavement. Secondary symptoms were marginally more common among women and more frequent among bereaved young adults, but there was no evidence for a gender-related somatic factor. First, data were gathered only for persons in the workforce and thus may not be generalizable to, for example, stay-at-home parents or those with employment issues. Second, the focus here is restricted to DSM symptoms, leaving risk factors, social roles, and brain functioning for separate investigation. Third, inferences were drawn from associations between groups of persons, rather than between individuals, requiring caution when speculating about individual attributes. Gender differences in depression represent a difference in amount, not kind, suggesting that the range of depressive experiences is similar for men and women. There was no gender difference ascribable to somatic depression. Copyright © 2017 Elsevier B.V. All rights reserved.

  10. An artificial functional family filter in homolog searching in next-generation sequencing metagenomics.

    Directory of Open Access Journals (Sweden)

    Ruofei Du

    Full Text Available In functional metagenomics, BLAST homology search is a common method to classify metagenomic reads into protein/domain sequence families such as Clusters of Orthologous Groups of proteins (COGs in order to quantify the abundance of each COG in the community. The resulting functional profile of the community is then used in downstream analysis to correlate the change in abundance to environmental perturbation, clinical variation, and so on. However, the short read length coupled with next-generation sequencing technologies poses a barrier in this approach, essentially because similarity significance cannot be discerned by searching with short reads. Consequently, artificial functional families are produced, in which those with a large number of reads assigned decreases the accuracy of functional profile dramatically. There is no method available to address this problem. We intended to fill this gap in this paper. We revealed that BLAST similarity scores of homologues for short reads from COG protein members coding sequences are distributed differently from the scores of those derived elsewhere. We showed that, by choosing an appropriate score cut-off, we are able to filter out most artificial families and simultaneously to preserve sufficient information in order to build the functional profile. We also showed that, by incorporated application of BLAST and RPS-BLAST, some artificial families with large read counts can be further identified after the score cutoff filtration. Evaluated on three experimental metagenomic datasets with different coverages, we found that the proposed method is robust against read coverage and consistently outperforms the other E-value cutoff methods currently used in literatures.

  11. Protein profiling reveals inter-individual protein homogeneity of arachnoid cyst fluid and high qualitative similarity to cerebrospinal fluid

    Directory of Open Access Journals (Sweden)

    Berle Magnus

    2011-05-01

    Full Text Available Abstract Background The mechanisms behind formation and filling of intracranial arachnoid cysts (AC are poorly understood. The aim of this study was to evaluate AC fluid by proteomics to gain further knowledge about ACs. Two goals were set: 1 Comparison of AC fluid from individual patients to determine whether or not temporal AC is a homogenous condition; and 2 Evaluate the protein content of a pool of AC fluid from several patients and qualitatively compare this with published protein lists of cerebrospinal fluid (CSF and plasma. Methods AC fluid from 15 patients with temporal AC was included in this study. In the AC protein comparison experiment, AC fluid from 14 patients was digested, analyzed by LC-MS/MS using a semi-quantitative label-free approach and the data were compared by principal component analysis (PCA to gain knowledge of protein homogeneity of AC. In the AC proteome evaluation experiment, AC fluid from 11 patients was pooled, digested, and fractionated by SCX chromatography prior to analysis by LC-MS/MS. Proteins identified were compared to published databases of proteins identified from CSF and plasma. AC fluid proteins not found in these two databases were experimentally searched for in lumbar CSF taken from neurologically-normal patients, by a targeted protein identification approach called MIDAS (Multiple Reaction Monitoring (MRM initiated detection and sequence analysis. Results We did not identify systematic trends or grouping of data in the AC protein comparison experiment, implying low variability between individual proteomic profiles of AC. In the AC proteome evaluation experiment, we identified 199 proteins. When compared to previously published lists of proteins identified from CSF and plasma, 15 of the AC proteins had not been reported in either of these datasets. By a targeted protein identification approach, we identified 11 of these 15 proteins in pooled CSF from neurologically-normal patients, demonstrating that

  12. Indexed variation graphs for efficient and accurate resistome profiling.

    Science.gov (United States)

    Rowe, Will P M; Winn, Martyn D

    2018-05-14

    Antimicrobial resistance remains a major threat to global health. Profiling the collective antimicrobial resistance genes within a metagenome (the "resistome") facilitates greater understanding of antimicrobial resistance gene diversity and dynamics. In turn, this can allow for gene surveillance, individualised treatment of bacterial infections and more sustainable use of antimicrobials. However, resistome profiling can be complicated by high similarity between reference genes, as well as the sheer volume of sequencing data and the complexity of analysis workflows. We have developed an efficient and accurate method for resistome profiling that addresses these complications and improves upon currently available tools. Our method combines a variation graph representation of gene sets with an LSH Forest indexing scheme to allow for fast classification of metagenomic sequence reads using similarity-search queries. Subsequent hierarchical local alignment of classified reads against graph traversals enables accurate reconstruction of full-length gene sequences using a scoring scheme. We provide our implementation, GROOT, and show it to be both faster and more accurate than a current reference-dependent tool for resistome profiling. GROOT runs on a laptop and can process a typical 2 gigabyte metagenome in 2 minutes using a single CPU. Our method is not restricted to resistome profiling and has the potential to improve current metagenomic workflows. GROOT is written in Go and is available at https://github.com/will-rowe/groot (MIT license). will.rowe@stfc.ac.uk. Supplementary data are available at Bioinformatics online.

  13. Custom Search Engines: Tools & Tips

    Science.gov (United States)

    Notess, Greg R.

    2008-01-01

    Few have the resources to build a Google or Yahoo! from scratch. Yet anyone can build a search engine based on a subset of the large search engines' databases. Use Google Custom Search Engine or Yahoo! Search Builder or any of the other similar programs to create a vertical search engine targeting sites of interest to users. The basic steps to…

  14. Will opposites attract? Similarities and differences in students' perceptions of the stereotype profiles of other health and social care professional groups.

    Science.gov (United States)

    Hean, Sarah; Clark, Jill Macleod; Adams, Kim; Humphris, Debra

    2006-03-01

    The extent to which health and social care (HSC) students hold stereotypical views of other HSC professional groups is of great potential importance to team working in health care. This paper explores students' perceptions of different HSC professional groups at the beginning of their university programmes. Findings are presented from an analysis of baseline data collected as part of the New Generation Project longitudinal cohort study which is assessing the impact of interprofessional education over time on a range of variables including stereotyping. Questionnaires were administered to a cohort of over 1200 students from 10 different HSC professional groups entering their first year of university. Stereotypes were measured using a tool adapted from Barnes et al. (2000) designed to elicit stereotype ratings on a range of nine characteristics. The findings confirm that students arrive at university with an established and consistent set of stereotypes about other health and social care professional groups. Stereotypical profiles were compiled for each professional group indicating the distinctive characteristics of the groups as well as the similarities and differences between groups.Midwives, social workers and nurses were rated most highly on interpersonal skills and on being a team player whilst doctors were rated most highly on academic ability. Doctors, midwives and social workers were perceived as having the strongest leadership role, whilst doctors were also rated most highly on decision making. All professions were rated highly on confidence and professional competence and, with the exception of social workers, on practical skills. A comparison of profiles for each professional group reveals that, for example, pharmacists and doctors were perceived as having very similar characteristics as were social workers, midwives and nurses. However, the profiles of nurses and doctors were perceived to be very different. The implications of these similarities and

  15. Data mining technique for fast retrieval of similar waveforms in Fusion massive databases

    International Nuclear Information System (INIS)

    Vega, J.; Pereira, A.; Portas, A.; Dormido-Canto, S.; Farias, G.; Dormido, R.; Sanchez, J.; Duro, N.; Santos, M.; Sanchez, E.; Pajares, G.

    2008-01-01

    Fusion measurement systems generate similar waveforms for reproducible behavior. A major difficulty related to data analysis is the identification, in a rapid and automated way, of a set of discharges with comparable behaviour, i.e. discharges with 'similar' waveforms. Here we introduce a new technique for rapid searching and retrieval of 'similar' signals. The approach consists of building a classification system that avoids traversing the whole database looking for similarities. The classification system diminishes the problem dimensionality (by means of waveform feature extraction) and reduces the searching space to just the most probable 'similar' waveforms (clustering techniques). In the searching procedure, the input waveform is classified in any of the existing clusters. Then, a similarity measure is computed between the input signal and all cluster elements in order to identify the most similar waveforms. The inner product of normalized vectors is used as the similarity measure as it allows the searching process to be independent of signal gain and polarity. This development has been applied recently to TJ-II stellarator databases and has been integrated into its remote participation system

  16. Efficient protein structure search using indexing methods.

    Science.gov (United States)

    Kim, Sungchul; Sael, Lee; Yu, Hwanjo

    2013-01-01

    Understanding functions of proteins is one of the most important challenges in many studies of biological processes. The function of a protein can be predicted by analyzing the functions of structurally similar proteins, thus finding structurally similar proteins accurately and efficiently from a large set of proteins is crucial. A protein structure can be represented as a vector by 3D-Zernike Descriptor (3DZD) which compactly represents the surface shape of the protein tertiary structure. This simplified representation accelerates the searching process. However, computing the similarity of two protein structures is still computationally expensive, thus it is hard to efficiently process many simultaneous requests of structurally similar protein search. This paper proposes indexing techniques which substantially reduce the search time to find structurally similar proteins. In particular, we first exploit two indexing techniques, i.e., iDistance and iKernel, on the 3DZDs. After that, we extend the techniques to further improve the search speed for protein structures. The extended indexing techniques build and utilize an reduced index constructed from the first few attributes of 3DZDs of protein structures. To retrieve top-k similar structures, top-10 × k similar structures are first found using the reduced index, and top-k structures are selected among them. We also modify the indexing techniques to support θ-based nearest neighbor search, which returns data points less than θ to the query point. The results show that both iDistance and iKernel significantly enhance the searching speed. In top-k nearest neighbor search, the searching time is reduced 69.6%, 77%, 77.4% and 87.9%, respectively using iDistance, iKernel, the extended iDistance, and the extended iKernel. In θ-based nearest neighbor serach, the searching time is reduced 80%, 81%, 95.6% and 95.6% using iDistance, iKernel, the extended iDistance, and the extended iKernel, respectively.

  17. Forensic utilization of familial searches in DNA databases.

    Science.gov (United States)

    Gershaw, Cassandra J; Schweighardt, Andrew J; Rourke, Linda C; Wallace, Margaret M

    2011-01-01

    DNA evidence is widely recognized as an invaluable tool in the process of investigation and identification, as well as one of the most sought after types of evidence for presentation to a jury. In the United States, the development of state and federal DNA databases has greatly impacted the forensic community by creating an efficient, searchable system that can be used to eliminate or include suspects in an investigation based on matching DNA profiles - the profile already in the database to the profile of the unknown sample in evidence. Recent changes in legislation have begun to allow for the possibility to expand the parameters of DNA database searches, taking into account the possibility of familial searches. This article discusses prospective positive outcomes of utilizing familial DNA searches and acknowledges potential negative outcomes, thereby presenting both sides of this very complicated, rapidly evolving situation. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

  18. Using collaborative filtering in social book search

    NARCIS (Netherlands)

    Huurdeman, H.; Kamps, J.; Koolen, M.; van Wees, J.

    2012-01-01

    In this paper we describe our participation in INEX 2012 in the Social Book Search Track and the Linked Data Track. For the Social Book Search Track we compare the impact of query- and user-independent popularity measures and recommendations based on user profiles. Book suggestions are more than

  19. Data mining technique for fast retrieval of similar waveforms in Fusion massive databases

    Energy Technology Data Exchange (ETDEWEB)

    Vega, J. [Asociacion EURATOM/CIEMAT Para Fusion, Madrid (Spain)], E-mail: jesus.vega@ciemat.es; Pereira, A.; Portas, A. [Asociacion EURATOM/CIEMAT Para Fusion, Madrid (Spain); Dormido-Canto, S.; Farias, G.; Dormido, R.; Sanchez, J.; Duro, N. [Departamento de Informatica y Automatica, UNED, Madrid (Spain); Santos, M. [Departamento de Arquitectura de Computadores y Automatica, UCM, Madrid (Spain); Sanchez, E. [Asociacion EURATOM/CIEMAT Para Fusion, Madrid (Spain); Pajares, G. [Departamento de Arquitectura de Computadores y Automatica, UCM, Madrid (Spain)

    2008-01-15

    Fusion measurement systems generate similar waveforms for reproducible behavior. A major difficulty related to data analysis is the identification, in a rapid and automated way, of a set of discharges with comparable behaviour, i.e. discharges with 'similar' waveforms. Here we introduce a new technique for rapid searching and retrieval of 'similar' signals. The approach consists of building a classification system that avoids traversing the whole database looking for similarities. The classification system diminishes the problem dimensionality (by means of waveform feature extraction) and reduces the searching space to just the most probable 'similar' waveforms (clustering techniques). In the searching procedure, the input waveform is classified in any of the existing clusters. Then, a similarity measure is computed between the input signal and all cluster elements in order to identify the most similar waveforms. The inner product of normalized vectors is used as the similarity measure as it allows the searching process to be independent of signal gain and polarity. This development has been applied recently to TJ-II stellarator databases and has been integrated into its remote participation system.

  20. Personality similarity and life satisfaction in couples

    OpenAIRE

    Furler Katrin; Gomez Veronica; Grob Alexander

    2013-01-01

    The present study examined the association between personality similarity and life satisfaction in a large nationally representative sample of 1608 romantic couples. Similarity effects were computed for the Big Five personality traits as well as for personality profiles with global and differentiated indices of similarity. Results showed substantial actor and partner effects indicating that both partners' personality traits were related to both partners' life satisfaction. Personality similar...

  1. Lagrangian-similarity diffusion-deposition model

    International Nuclear Information System (INIS)

    Horst, T.W.

    1979-01-01

    A Lagrangian-similarity diffusion model has been incorporated into the surface-depletion deposition model. This model predicts vertical concentration profiles far downwind of the source that agree with those of a one-dimensional gradient-transfer model

  2. Clinician search behaviors may be influenced by search engine design.

    Science.gov (United States)

    Lau, Annie Y S; Coiera, Enrico; Zrimec, Tatjana; Compton, Paul

    2010-06-30

    Searching the Web for documents using information retrieval systems plays an important part in clinicians' practice of evidence-based medicine. While much research focuses on the design of methods to retrieve documents, there has been little examination of the way different search engine capabilities influence clinician search behaviors. Previous studies have shown that use of task-based search engines allows for faster searches with no loss of decision accuracy compared with resource-based engines. We hypothesized that changes in search behaviors may explain these differences. In all, 75 clinicians (44 doctors and 31 clinical nurse consultants) were randomized to use either a resource-based or a task-based version of a clinical information retrieval system to answer questions about 8 clinical scenarios in a controlled setting in a university computer laboratory. Clinicians using the resource-based system could select 1 of 6 resources, such as PubMed; clinicians using the task-based system could select 1 of 6 clinical tasks, such as diagnosis. Clinicians in both systems could reformulate search queries. System logs unobtrusively capturing clinicians' interactions with the systems were coded and analyzed for clinicians' search actions and query reformulation strategies. The most frequent search action of clinicians using the resource-based system was to explore a new resource with the same query, that is, these clinicians exhibited a "breadth-first" search behaviour. Of 1398 search actions, clinicians using the resource-based system conducted 401 (28.7%, 95% confidence interval [CI] 26.37-31.11) in this way. In contrast, the majority of clinicians using the task-based system exhibited a "depth-first" search behavior in which they reformulated query keywords while keeping to the same task profiles. Of 585 search actions conducted by clinicians using the task-based system, 379 (64.8%, 95% CI 60.83-68.55) were conducted in this way. This study provides evidence that

  3. Textual and chemical information processing: different domains but similar algorithms

    Directory of Open Access Journals (Sweden)

    Peter Willett

    2000-01-01

    Full Text Available This paper discusses the extent to which algorithms developed for the processing of textual databases are also applicable to the processing of chemical structure databases, and vice versa. Applications discussed include: an algorithm for distribution sorting that has been applied to the design of screening systems for rapid chemical substructure searching; the use of measures of inter-molecular structural similarity for the analysis of hypertext graphs; a genetic algorithm for calculating term weights for relevance feedback searching for determining whether a molecule is likely to exhibit biological activity; and the use of data fusion to combine the results of different chemical similarity searches.

  4. Search engines and the production of academic knowledge

    NARCIS (Netherlands)

    van Dijck, J.

    2010-01-01

    This article argues that search engines in general, and Google Scholar in particular, have become significant co-producers of academic knowledge. Knowledge is not simply conveyed to users, but is co-produced by search engines’ ranking systems and profiling systems, none of which are open to the

  5. [Differences and similarities between the competencies of a nursing supervisor and an advanced clinical nurse specialist].

    Science.gov (United States)

    del Barrio-Linares, M; Pumar-Méndez, M J

    2015-01-01

    With the aim of contributing to the development of a more specific professional regulation, the present study was to identify differences and similarities between the competencies of the nursing supervisor and clinical nurse specialist in an intensive care unit. A critical analysis of the literature published between 2003 and 2013 was conducted, identified through systematic searches in electronic databases, health management and practitioner journals and reference lists of the 17 items included. «Management and administration» and «direct clinical practice» were identified as specific competencies of nursing supervisor and clinical nurse specialist respectively. «Collaboration», «leadership» and «research» emerged as competencies shared by both profiles, but with different a operationalization way of conducting it. These findings imply that regulation, education and implementation of these profiles must address their specific skills as the distinctive approach taken in operationalizing shared. Copyright © 2014 Elsevier España, S.L.U. y SEEIUC. All rights reserved.

  6. Efficient Similarity Retrieval in Music Databases

    DEFF Research Database (Denmark)

    Ruxanda, Maria Magdalena; Jensen, Christian Søndergaard

    2006-01-01

    Audio music is increasingly becoming available in digital form, and the digital music collections of individuals continue to grow. Addressing the need for effective means of retrieving music from such collections, this paper proposes new techniques for content-based similarity search. Each music...

  7. Fast Structural Search in Phylogenetic Databases

    Directory of Open Access Journals (Sweden)

    William H. Piel

    2005-01-01

    Full Text Available As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural search techniques that, given a query or pattern tree P and a database of phylogenies D, find trees in D that are sufficiently close to P . The “closeness” is a measure of the topological relationships in P that are found to be the same or similar in a tree D in D. We develop a filtering technique that accelerates searches and present algorithms for rooted and unrooted trees where the trees can be weighted or unweighted. Experimental results on comparing the similarity measure with existing tree metrics and on evaluating the efficiency of the search techniques demonstrate that the proposed approach is promising

  8. Cube search, revisited

    Science.gov (United States)

    Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

    2015-01-01

    Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

  9. Combination of 2D/3D ligand-based similarity search in rapid virtual screening from multimillion compound repositories. Selection and biological evaluation of potential PDE4 and PDE5 inhibitors.

    Science.gov (United States)

    Dobi, Krisztina; Hajdú, István; Flachner, Beáta; Fabó, Gabriella; Szaszkó, Mária; Bognár, Melinda; Magyar, Csaba; Simon, István; Szisz, Dániel; Lőrincz, Zsolt; Cseh, Sándor; Dormán, György

    2014-05-28

    Rapid in silico selection of target focused libraries from commercial repositories is an attractive and cost effective approach. If structures of active compounds are available rapid 2D similarity search can be performed on multimillion compound databases but the generated library requires further focusing by various 2D/3D chemoinformatics tools. We report here a combination of the 2D approach with a ligand-based 3D method (Screen3D) which applies flexible matching to align reference and target compounds in a dynamic manner and thus to assess their structural and conformational similarity. In the first case study we compared the 2D and 3D similarity scores on an existing dataset derived from the biological evaluation of a PDE5 focused library. Based on the obtained similarity metrices a fusion score was proposed. The fusion score was applied to refine the 2D similarity search in a second case study where we aimed at selecting and evaluating a PDE4B focused library. The application of this fused 2D/3D similarity measure led to an increase of the hit rate from 8.5% (1st round, 47% inhibition at 10 µM) to 28.5% (2nd round at 50% inhibition at 10 µM) and the best two hits had 53 nM inhibitory activities.

  10. Semantic Annotation of Unstructured Documents Using Concepts Similarity

    Directory of Open Access Journals (Sweden)

    Fernando Pech

    2017-01-01

    Full Text Available There is a large amount of information in the form of unstructured documents which pose challenges in the information storage, search, and retrieval. This situation has given rise to several information search approaches. Some proposals take into account the contextual meaning of the terms specified in the query. Semantic annotation technique can help to retrieve and extract information in unstructured documents. We propose a semantic annotation strategy for unstructured documents as part of a semantic search engine. In this proposal, ontologies are used to determine the context of the entities specified in the query. Our strategy for extracting the context is focused on concepts similarity. Each relevant term of the document is associated with an instance in the ontology. The similarity between each of the explicit relationships is measured through the combination of two types of associations: the association between each pair of concepts and the calculation of the weight of the relationships.

  11. Affinity between information retrieval system and search topic

    International Nuclear Information System (INIS)

    Ebinuma, Yukio

    1979-01-01

    Ten search profiles are tested on the INIS system at the Japan Atomic Energy Research Institute. The results are plotted on recall-precision chart ranging from 100% recall to 100% precision. The curves are not purely systems-dependent nor search-dependent, and are determined substantially by the ''affinity'' between the system and the search topic. The curves are named ''Affinity curves of search topics with information retrieval systems'', and hence retrieval affinity factors are derived. They are obtained not only for individual search topics but also for averages in the system. By such a quantitative examination, the difference of affinity among search topics in a given system, that of the same search topic among various systems, and that of systems to the same group of search topics can be compared reasonably. (author)

  12. [Search for potential gastric cancer biomarkers using low molecular weight blood plasma proteome profiling by mass spectrometry].

    Science.gov (United States)

    Shevchenko, V E; Arnotskaia, N E; Ogorodnikova, E V; Davydov, M M; Ibraev, M A; Turkin, I N; Davydov, M I

    2014-01-01

    Gastric cancer, one of the most widespread malignant tumors, still lacks reliable serum/plasma biomarkers of its early detection. In this study we have developed, unified, and tested a new methodology for search of gastric cancer biomarkers based on profiling of low molecular weight proteome (LMWP) (1-17 kDa). This approach included three main components: sample pre-fractionation, matrix-assisted laser desorption ionization time of flight mass spectrometry (MALDI-TOF-MS), data analysis by a bioinformatics software package. Applicability and perspectives of the developed approach for detection of potential gastric cancer markers during LMWP analysis have been demonstrated using 69 plasma samples from patients with gastric cancer (stages I-IV) and 238 control samples. The study revealed peptides/polypeptides, which may be potentially used for detection of this pathology.

  13. A sensitive short read homology search tool for paired-end read sequencing data.

    Science.gov (United States)

    Techa-Angkoon, Prapaporn; Sun, Yanni; Lei, Jikai

    2017-10-16

    Homology search is still a significant step in functional analysis for genomic data. Profile Hidden Markov Model-based homology search has been widely used in protein domain analysis in many different species. In particular, with the fast accumulation of transcriptomic data of non-model species and metagenomic data, profile homology search is widely adopted in integrated pipelines for functional analysis. While the state-of-the-art tool HMMER has achieved high sensitivity and accuracy in domain annotation, the sensitivity of HMMER on short reads declines rapidly. The low sensitivity on short read homology search can lead to inaccurate domain composition and abundance computation. Our experimental results showed that half of the reads were missed by HMMER for a RNA-Seq dataset. Thus, there is a need for better methods to improve the homology search performance for short reads. We introduce a profile homology search tool named Short-Pair that is designed for short paired-end reads. By using an approximate Bayesian approach employing distribution of fragment lengths and alignment scores, Short-Pair can retrieve the missing end and determine true domains. In particular, Short-Pair increases the accuracy in aligning short reads that are part of remote homologs. We applied Short-Pair to a RNA-Seq dataset and a metagenomic dataset and quantified its sensitivity and accuracy on homology search. The experimental results show that Short-Pair can achieve better overall performance than the state-of-the-art methodology of profile homology search. Short-Pair is best used for next-generation sequencing (NGS) data that lack reference genomes. It provides a complementary paired-end read homology search tool to HMMER. The source code is freely available at https://sourceforge.net/projects/short-pair/ .

  14. The role of crowding in parallel search: Peripheral pooling is not responsible for logarithmic efficiency in parallel search.

    Science.gov (United States)

    Madison, Anna; Lleras, Alejandro; Buetti, Simona

    2018-02-01

    Recent results from our laboratory showed that, in fixed-target parallel search tasks, reaction times increase in a logarithmic fashion with set size, and the slope of this logarithmic function is modulated by lure-target similarity. These results were interpreted as being consistent with a processing architecture where early vision (stage one) processes elements in the display in exhaustive fashion with unlimited capacity and with a limitation in resolution. Here, we evaluate the contribution of crowding to our recent logarithmic search slope findings, considering the possibility that peripheral pooling of features (as observed in crowding) may be responsible for logarithmic efficiency. Factors known to affect the strength of crowding were varied, specifically: item spacing and similarity. The results from three experiments converge on the same pattern of results: reaction times increased logarithmically with set size and were modulated by lure-target similarity even when crowding was minimized within displays through an inter-item spacing manipulation. Furthermore, we found logarithmic search efficiencies were overall improved in displays where crowding was minimized compared to displays where crowding was possible. The findings from these three experiments suggest logarithmic efficiency in efficient search is not the result peripheral pooling of features. That said, the presence of crowding does tend to reduce search efficiency, even in "pop-out" search situations.

  15. IMPROVING PERSONALIZED WEB SEARCH USING BOOKSHELF DATA STRUCTURE

    Directory of Open Access Journals (Sweden)

    S.K. Jayanthi

    2012-10-01

    Full Text Available Search engines are playing a vital role in retrieving relevant information for the web user. In this research work a user profile based web search is proposed. So the web user from different domain may receive different set of results. The main challenging work is to provide relevant results at the right level of reading difficulty. Estimating user expertise and re-ranking the results are the main aspects of this paper. The retrieved results are arranged in Bookshelf Data Structure for easy access. Better presentation of search results hence increases the usability of web search engines significantly in visual mode.

  16. Prevalence of stress references on college freshmen Facebook profiles.

    Science.gov (United States)

    Egan, Katie G; Moreno, Megan A

    2011-10-01

    Stress is common among college students and associated with adverse health outcomes. This study used the social networking Web site Facebook to identify self-reported stress and associated conditions among college students. Public Facebook profiles of undergraduate freshman at a large Midwestern State University (n = 300) were identified using a Facebook search. Content analysis of Facebook profiles included demographic information and displayed references to stress, weight concerns, depressive symptoms, and alcohol. The mean reported age was 18.4 years, and the majority of profile owners were female (62%). Stress references were displayed on 37% of the profiles, weight concerns on 6%, depressive symptoms on 24%, and alcohol on 73%. The display of stress references was associated with female sex (odds ratio [OR], 2.81; confidence interval [CI], 1.7-4.7), weight concerns (OR, 5.36; CI, 1.87-15.34), and depressive symptoms (OR, 2.7; CI, 1.57-4.63). No associations were found between stress and alcohol references. College freshmen frequently display references to stress on Facebook profiles with prevalence rates similar to self-reported national survey data. Findings suggest a positive association between referencing stress and both weight concerns and depressive symptoms. Facebook may be a useful venue to identify students at risk for stress-related conditions and to disseminate information about campus resources to these students.

  17. Music Retrieval based on Melodic Similarity

    NARCIS (Netherlands)

    Typke, R.

    2007-01-01

    This thesis introduces a method for measuring melodic similarity for notated music such as MIDI files. This music search algorithm views music as sets of notes that are represented as weighted points in the two-dimensional space of time and pitch. Two point sets can be compared by calculating how

  18. Proteome and metabolome profiling of cytokinin action in Arabidopsis identifying both distinct and similar responses to cytokinin down- and up-regulation.

    Science.gov (United States)

    Černý, Martin; Kuklová, Alena; Hoehenwarter, Wolfgang; Fragner, Lena; Novák, Ondrej; Rotková, Gabriela; Jedelsky, Petr L; Žáková, Katerina; Šmehilová, Mária; Strnad, Miroslav; Weckwerth, Wolfram; Brzobohaty, Bretislav

    2013-11-01

    In plants, numerous developmental processes are controlled by cytokinin (CK) levels and their ratios to levels of other hormones. While molecular mechanisms underlying the regulatory roles of CKs have been intensely researched, proteomic and metabolomic responses to CK deficiency are unknown. Transgenic Arabidopsis seedlings carrying inducible barley cytokinin oxidase/dehydrogenase (CaMV35S>GR>HvCKX2) and agrobacterial isopentenyl transferase (CaMV35S>GR>ipt) constructs were profiled to elucidate proteome- and metabolome-wide responses to down- and up-regulation of CK levels, respectively. Proteome profiling identified >1100 proteins, 155 of which responded to HvCKX2 and/or ipt activation, mostly involved in growth, development, and/or hormone and light signalling. The metabolome profiling covered 79 metabolites, 33 of which responded to HvCKX2 and/or ipt activation, mostly amino acids, carbohydrates, and organic acids. Comparison of the data sets obtained from activated CaMV35S>GR>HvCKX2 and CaMV35S>GR>ipt plants revealed unexpectedly extensive overlaps. Integration of the proteomic and metabolomic data sets revealed: (i) novel components of molecular circuits involved in CK action (e.g. ribosomal proteins); (ii) previously unrecognized links to redox regulation and stress hormone signalling networks; and (iii) CK content markers. The striking overlaps in profiles observed in CK-deficient and CK-overproducing seedlings might explain surprising previously reported similarities between plants with down- and up-regulated CK levels.

  19. Comparing image search behaviour in the ARRS GoldMiner search engine and a clinical PACS/RIS.

    Science.gov (United States)

    De-Arteaga, Maria; Eggel, Ivan; Do, Bao; Rubin, Daniel; Kahn, Charles E; Müller, Henning

    2015-08-01

    Information search has changed the way we manage knowledge and the ubiquity of information access has made search a frequent activity, whether via Internet search engines or increasingly via mobile devices. Medical information search is in this respect no different and much research has been devoted to analyzing the way in which physicians aim to access information. Medical image search is a much smaller domain but has gained much attention as it has different characteristics than search for text documents. While web search log files have been analysed many times to better understand user behaviour, the log files of hospital internal systems for search in a PACS/RIS (Picture Archival and Communication System, Radiology Information System) have rarely been analysed. Such a comparison between a hospital PACS/RIS search and a web system for searching images of the biomedical literature is the goal of this paper. Objectives are to identify similarities and differences in search behaviour of the two systems, which could then be used to optimize existing systems and build new search engines. Log files of the ARRS GoldMiner medical image search engine (freely accessible on the Internet) containing 222,005 queries, and log files of Stanford's internal PACS/RIS search called radTF containing 18,068 queries were analysed. Each query was preprocessed and all query terms were mapped to the RadLex (Radiology Lexicon) terminology, a comprehensive lexicon of radiology terms created and maintained by the Radiological Society of North America, so the semantic content in the queries and the links between terms could be analysed, and synonyms for the same concept could be detected. RadLex was mainly created for the use in radiology reports, to aid structured reporting and the preparation of educational material (Lanlotz, 2006) [1]. In standard medical vocabularies such as MeSH (Medical Subject Headings) and UMLS (Unified Medical Language System) specific terms of radiology are often

  20. Anonymous Search Histories Featuring Personalized Advertisement - Balancing Privacy with Economic Interests

    OpenAIRE

    Thorben Burghardt; Klemens Bohm; Achim Guttmann; Chris Clifton

    2011-01-01

    Search engines are key to finding information on the web. Search presently is free for users financed by targeted advertisement. Today, the current search terms determine the ad placement. In the near future, search-engine providers will make use of detailed user profiles for better ad placement. This puts user privacy at risk. Anonymizing search histories, which is a solution in principle, gives way to a trade-off between privacy and the usability of the data for ad placement. This paper stu...

  1. Proposal for a Similar Question Search System on a Q&A Site

    Directory of Open Access Journals (Sweden)

    Katsutoshi Kanamori

    2014-06-01

    Full Text Available There is a service to help Internet users obtain answers to specific questions when they visit a Q&A site. A Q&A site is very useful for the Internet user, but posted questions are often not answered immediately. This delay in answering occurs because in most cases another site user is answering the question manually. In this study, we propose a system that can present a question that is similar to a question posted by a user. An advantage of this system is that a user can refer to an answer to a similar question. This research measures the similarity of a candidate question based on word and dependency parsing. In an experiment, we examined the effectiveness of the proposed system for questions actually posted on the Q&A site. The result indicates that the system can show the questioner the answer to a similar question. However, the system still has a number of aspects that should be improved.

  2. Untargeted metabolomic profiling plasma samples of patients with lung cancer for searching significant metabolites by HPLC-MS method

    Science.gov (United States)

    Dementeva, N.; Ivanova, K.; Kokova, D.; Kurzina, I.; Ponomaryova, A.; Kzhyshkowska, J.

    2017-09-01

    Lung cancer is one of the most common types of cancer leading to death. Consequently, the search and the identification of the metabolites associated with the risk of developing cancer are very valuable. For the purpose, untargeted metabolic profiling of the plasma samples collected from the patients with lung cancer (n = 100) and the control group (n = 100) was conducted. After sample preparation, the plasma samples were analyzed using LC-MS method. Biostatistics methods were applied to pre-process the data for elicitation of dominating metabolites which responded to the difference between the case and the control groups. At least seven significant metabolites were evaluated and annotated. The most part of identified metabolites are connected with lipid metabolism and their combination could be useful for follow-up studies of lung cancer pathogenesis.

  3. Dark matter searches with Cherenkov telescopes: nearby dwarf galaxies or local galaxy clusters?

    Energy Technology Data Exchange (ETDEWEB)

    Sánchez-Conde, Miguel A. [SLAC National Laboratory and Kavli Institute for Particle Astrophysics and Cosmology, 2575 Sand Hill Road, Menlo Park, CA 94025 (United States); Cannoni, Mirco; Gómez, Mario E. [Dpto. Física Aplicada, Facultad de Ciencias Experimentales, Universidad de Huelva, 21071 Huelva (Spain); Zandanel, Fabio; Prada, Francisco, E-mail: masc@stanford.edu, E-mail: mirco.cannoni@dfa.uhu.es, E-mail: fabio@iaa.es, E-mail: mario.gomez@dfa.uhu.es, E-mail: fprada@iaa.es [Instituto de Astrofísica de Andalucía (CSIC), E-18008, Granada (Spain)

    2011-12-01

    In this paper, we compare dwarf galaxies and galaxy clusters in order to elucidate which object class is the best target for gamma-ray DM searches with imaging atmospheric Cherenkov telescopes (IACTs). We have built a mixed dwarfs+clusters sample containing some of the most promising nearby dwarf galaxies (Draco, Ursa Minor, Wilman 1 and Segue 1) and local galaxy clusters (Perseus, Coma, Ophiuchus, Virgo, Fornax, NGC 5813 and NGC 5846), and then compute their DM annihilation flux profiles by making use of the latest modeling of their DM density profiles. We also include in our calculations the effect of DM substructure. Willman 1 appears as the best candidate in the sample. However, its mass modeling is still rather uncertain, so probably other candidates with less uncertainties and quite similar fluxes, namely Ursa Minor and Segue 1, might be better options. As for galaxy clusters, Virgo represents the one with the highest flux. However, its large spatial extension can be a serious handicap for IACT observations and posterior data analysis. Yet, other local galaxy cluster candidates with more moderate emission regions, such as Perseus, may represent good alternatives. After comparing dwarfs and clusters, we found that the former exhibit annihilation flux profiles that, at the center, are roughly one order of magnitude higher than those of clusters, although galaxy clusters can yield similar, or even higher, integrated fluxes for the whole object once substructure is taken into account. Even when any of these objects are strictly point-like according to the properties of their annihilation signals, we conclude that dwarf galaxies are best suited for observational strategies based on the search of point-like sources, while galaxy clusters represent best targets for analyses that can deal with rather extended emissions. Finally, we study the detection prospects for present and future IACTs in the framework of the constrained minimal supersymmetric standard model. We

  4. Dark Matter Searches with Cherenkov Telescopes: Nearby Dwarf Galaxies or Local Galaxy Clusters?

    Energy Technology Data Exchange (ETDEWEB)

    Sanchez-Conde, Miguel A.; /KIPAC, Menlo Park /SLAC /IAC, La Laguna /Laguna U., Tenerife; Cannoni, Mirco; /Huelva U.; Zandanel, Fabio; /IAA, Granada; Gomez, Mario E.; /Huelva U.; Prada, Francisco; /IAA, Granada

    2012-06-06

    In this paper, we compare dwarf galaxies and galaxy clusters in order to elucidate which object class is the best target for gamma-ray DM searches with imaging atmospheric Cherenkov telescopes (IACTs). We have built a mixed dwarfs+clusters sample containing some of the most promising nearby dwarf galaxies (Draco, Ursa Minor, Wilman 1 and Segue 1) and local galaxy clusters (Perseus, Coma, Ophiuchus, Virgo, Fornax, NGC 5813 and NGC 5846), and then compute their DM annihilation flux profiles by making use of the latest modeling of their DM density profiles. We also include in our calculations the effect of DM substructure. Willman 1 appears as the best candidate in the sample. However, its mass modeling is still rather uncertain, so probably other candidates with less uncertainties and quite similar fluxes, namely Ursa Minor and Segue 1, might be better options. As for galaxy clusters, Virgo represents the one with the highest flux. However, its large spatial extension can be a serious handicap for IACT observations and posterior data analysis. Yet, other local galaxy cluster candidates with more moderate emission regions, such as Perseus, may represent good alternatives. After comparing dwarfs and clusters, we found that the former exhibit annihilation flux profiles that, at the center, are roughly one order of magnitude higher than those of clusters, although galaxy clusters can yield similar, or even higher, integrated fluxes for the whole object once substructure is taken into account. Even when any of these objects are strictly point-like according to the properties of their annihilation signals, we conclude that dwarf galaxies are best suited for observational strategies based on the search of point-like sources, while galaxy clusters represent best targets for analyses that can deal with rather extended emissions. Finally, we study the detection prospects for present and future IACTs in the framework of the constrained minimal supersymmetric standard model. We

  5. L1000CDS2: LINCS L1000 characteristic direction signatures search engine.

    Science.gov (United States)

    Duan, Qiaonan; Reid, St Patrick; Clark, Neil R; Wang, Zichen; Fernandez, Nicolas F; Rouillard, Andrew D; Readhead, Ben; Tritsch, Sarah R; Hodos, Rachel; Hafner, Marc; Niepel, Mario; Sorger, Peter K; Dudley, Joel T; Bavari, Sina; Panchal, Rekha G; Ma'ayan, Avi

    2016-01-01

    The library of integrated network-based cellular signatures (LINCS) L1000 data set currently comprises of over a million gene expression profiles of chemically perturbed human cell lines. Through unique several intrinsic and extrinsic benchmarking schemes, we demonstrate that processing the L1000 data with the characteristic direction (CD) method significantly improves signal to noise compared with the MODZ method currently used to compute L1000 signatures. The CD processed L1000 signatures are served through a state-of-the-art web-based search engine application called L1000CDS 2 . The L1000CDS 2 search engine provides prioritization of thousands of small-molecule signatures, and their pairwise combinations, predicted to either mimic or reverse an input gene expression signature using two methods. The L1000CDS 2 search engine also predicts drug targets for all the small molecules profiled by the L1000 assay that we processed. Targets are predicted by computing the cosine similarity between the L1000 small-molecule signatures and a large collection of signatures extracted from the gene expression omnibus (GEO) for single-gene perturbations in mammalian cells. We applied L1000CDS 2 to prioritize small molecules that are predicted to reverse expression in 670 disease signatures also extracted from GEO, and prioritized small molecules that can mimic expression of 22 endogenous ligand signatures profiled by the L1000 assay. As a case study, to further demonstrate the utility of L1000CDS 2 , we collected expression signatures from human cells infected with Ebola virus at 30, 60 and 120 min. Querying these signatures with L1000CDS 2 we identified kenpaullone, a GSK3B/CDK2 inhibitor that we show, in subsequent experiments, has a dose-dependent efficacy in inhibiting Ebola infection in vitro without causing cellular toxicity in human cell lines. In summary, the L1000CDS 2 tool can be applied in many biological and biomedical settings, while improving the extraction of

  6. Enhancing Divergent Search through Extinction Events

    DEFF Research Database (Denmark)

    Lehman, Joel; Miikkulainen, Risto

    2015-01-01

    for the capacity to evolve. This hypothesis is tested through experiments in two evolutionary robotics domains. The results show that combining extinction events with divergent search increases evolvability, while combining them with convergent search offers no similar benefit. The conclusion is that extinction...

  7. Short guide to SDI profiling at ORNL

    Energy Technology Data Exchange (ETDEWEB)

    Pomerance, H.S.

    1976-06-01

    ORNL has machine-searchable data bases that correspond to printed indexes and abstracts. This guide describes the peculiarities of those several data bases and the conventions of the ORNL search system so that users can write their own queries or search profiles and can interpret the part of the output that is encoded.

  8. Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.

    Science.gov (United States)

    Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W; Profita, Halley; Czaja, Sara J

    2015-01-01

    Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants' search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed.

  9. Search Engine For Ebook Portal

    Directory of Open Access Journals (Sweden)

    Prashant Kanade

    2017-05-01

    Full Text Available The purpose of this paper is to establish the textual analytics involved in developing a search engine for an ebook portal. We have extracted our dataset from Project Gutenberg using a robot harvester. Textual Analytics is used for efficient search retrieval. The entire dataset is represented using Vector Space Model where each document is a vector in the vector space. Further for computational purposes we represent our dataset in the form of a Term Frequency- Inverse Document Frequency tf-idf matrix. The first step involves obtaining the most coherent sequence of words of the search query entered. The entered query is processed using Front End algorithms this includes-Spell Checker Text Segmentation and Language Modeling. Back End processing includes Similarity Modeling Clustering Indexing and Retrieval. The relationship between documents and words is established using cosine similarity measured between the documents and words in Vector Space. Clustering performed is used to suggest books that are similar to the search query entered by the user. Lastly the Lucene Based Elasticsearch engine is used for indexing on the documents. This allows faster retrieval of data. Elasticsearch returns a dictionary and creates a tf-idf matrix. The processed query is compared with the dictionary obtained and tf-idf matrix is used to calculate the score for each match to give most relevant result.

  10. Interest in Anesthesia as Reflected by Keyword Searches using Common Search Engines.

    Science.gov (United States)

    Liu, Renyu; García, Paul S; Fleisher, Lee A

    2012-01-23

    Since current general interest in anesthesia is unknown, we analyzed internet keyword searches to gauge general interest in anesthesia in comparison with surgery and pain. The trend of keyword searches from 2004 to 2010 related to anesthesia and anaesthesia was investigated using Google Insights for Search. The trend of number of peer reviewed articles on anesthesia cited on PubMed and Medline from 2004 to 2010 was investigated. The average cost on advertising on anesthesia, surgery and pain was estimated using Google AdWords. Searching results in other common search engines were also analyzed. Correlation between year and relative number of searches was determined with psearch engines may provide different total number of searching results (available posts), the ratios of searching results between some common keywords related to perioperative care are comparable, indicating similar trend. The peer reviewed manuscripts on "anesthesia" and the proportion of papers on "anesthesia and outcome" are trending up. Estimates for spending of advertising dollars are less for anesthesia-related terms when compared to that for pain or surgery due to relative smaller number of searching traffic. General interest in anesthesia (anaesthesia) as measured by internet searches appears to be decreasing. Pain, preanesthesia evaluation, anesthesia and outcome and side effects of anesthesia are the critical areas that anesthesiologists should focus on to address the increasing concerns.

  11. Similarity queries for temporal toxicogenomic expression profiles.

    Directory of Open Access Journals (Sweden)

    Adam A Smith

    2008-07-01

    Full Text Available We present an approach for answering similarity queries about gene expression time series that is motivated by the task of characterizing the potential toxicity of various chemicals. Our approach involves two key aspects. First, our method employs a novel alignment algorithm based on time warping. Our time warping algorithm has several advantages over previous approaches. It allows the user to impose fairly strong biases on the form that the alignments can take, and it permits a type of local alignment in which the entirety of only one series has to be aligned. Second, our method employs a relaxed spline interpolation to predict expression responses for unmeasured time points, such that the spline does not necessarily exactly fit every observed point. We evaluate our approach using expression time series from the Edge toxicology database. Our experiments show the value of using spline representations for sparse time series. More significantly, they show that our time warping method provides more accurate alignments and classifications than previous standard alignment methods for time series.

  12. A study of Consistency in the Selection of Search Terms and Search Concepts: A Case Study in National Taiwan University

    Directory of Open Access Journals (Sweden)

    Mu-hsuan Huang

    2001-12-01

    Full Text Available This article analyzes the consistency in the selection of search terms and search contents of college and graduate students in National Taiwan University when they are using PsycLIT CD-ROM database. 31 students conducted pre-assigned searches, doing 59 searches generating 609 search terms. The study finds the consistency in selection of search terms of first level is 22.14% and second level is 35%. These results are similar with others’ researches. About the consistency in search concepts, no matter the overlaps of searched articles or judge relevant articles are lower than other researches. [Article content in Chinese

  13. Personal summarization from profile networks

    Institute of Scientific and Technical Information of China (English)

    Zhongqing WANG; Shoushan LI; Guodong ZHOU

    2017-01-01

    Personal profile information on social media like Linkedln.com and Facebook.com is at the core of many interesting applications,such as talent recommendation and contextual advertising.However,personal profiles usually lack consistent organization confronted with the large amount of available information.Therefore,it is always a challenge for people to quickly find desired information from them.In this paper,we address the task of personal profile summarization by leveraging both textual information and social connection information in social networks from both unsupervised and supervised learning paradigms.Here,using social connection information is motivated by the intuition that people with similar academic,business or social background (e.g.,comajor,co-university,and co-corporation) tend to have similar experiences and should have similar summaries.For unsupervised learning,we propose a collective ranking approach,called SocialRank,to combine textual information in an individual profile and social context information from relevant profiles in generating a personal profile summary.For supervised learning,we propose a collective factor graph model,called CoFG,to summarize personal profiles with local textual attribute functions and social connection factors.Extensive evaluation on a large dataset from LinkedIn.com demonstrates the usefulness of social connection information in personal profile summarization and the effectiveness of our proposed unsupervised and supervised learning approaches.

  14. Dual Target Search is Neither Purely Simultaneous nor Purely Successive.

    Science.gov (United States)

    Cave, Kyle R; Menneer, Tamaryn; Nomani, Mohammad S; Stroud, Michael J; Donnelly, Nick

    2017-08-31

    Previous research shows that visual search for two different targets is less efficient than search for a single target. Stroud, Menneer, Cave and Donnelly (2012) concluded that two target colours are represented separately based on modeling the fixation patterns. Although those analyses provide evidence for two separate target representations, they do not show whether participants search simultaneously for both targets, or first search for one target and then the other. Some studies suggest that multiple target representations are simultaneously active, while others indicate that search can be voluntarily simultaneous, or switching, or a mixture of both. Stroud et al.'s participants were not explicitly instructed to use any particular strategy. These data were revisited to determine which strategy was employed. Each fixated item was categorised according to whether its colour was more similar to one target or the other. Once an item similar to one target is fixated, the next fixated item is more likely to be similar to that target than the other, showing that at a given moment during search, one target is generally favoured. However, the search for one target is not completed before search for the other begins. Instead, there are often short runs of one or two fixations to distractors similar to one target, with each run followed by a switch to the other target. Thus, the results suggest that one target is more highly weighted than the other at any given time, but not to the extent that search is purely successive.

  15. The efficiency of similarity-focused comparisons in person perception.

    Science.gov (United States)

    Corcoran, Katja

    2013-01-01

    Comparison processes are ubiquitous in person perception. Comparative thinking can follow two routes: People either search for similarities or for dissimilarities while comparing. Which of these two routes is more efficient? Previous research indicates that people could compare two geometrical figures faster if they focused on similarities rather than dissimilarities. I examine comparisons of people and measure the consumption of cognitive resources as indicator for efficiency. The results confirm an efficiency-advantage of similarity-focused comparisons for social stimuli.

  16. Refining search terms for nanotechnology

    International Nuclear Information System (INIS)

    Porter, Alan L.; Youtie, Jan; Shapira, Philip; Schoeneck, David J.

    2008-01-01

    The ability to delineate the boundaries of an emerging technology is central to obtaining an understanding of the technology's research paths and commercialization prospects. Nowhere is this more relevant than in the case of nanotechnology (hereafter identified as 'nano') given its current rapid growth and multidisciplinary nature. (Under the rubric of nanotechnology, we also include nanoscience and nanoengineering.) Past efforts have utilized several strategies, including simple term search for the prefix nano, complex lexical and citation-based approaches, and bootstrapping techniques. This research introduces a modularized Boolean approach to defining nanotechnology which has been applied to several research and patenting databases. We explain our approach to downloading and cleaning data, and report initial results. Comparisons of this approach with other nanotechnology search formulations are presented. Implications for search strategy development and profiling of the nanotechnology field are discussed

  17. Refining search terms for nanotechnology

    Energy Technology Data Exchange (ETDEWEB)

    Porter, Alan L. [Georgia Institute of Technology (United States); Youtie, Jan [Georgia Institute of Technology, Enterprise Innovation Institute (United States)], E-mail: jan.youtie@innovate.gatech.edu; Shapira, Philip [Georgia Institute of Technology (United States); Schoeneck, David J. [Search Technology, Inc. (United States)

    2008-05-15

    The ability to delineate the boundaries of an emerging technology is central to obtaining an understanding of the technology's research paths and commercialization prospects. Nowhere is this more relevant than in the case of nanotechnology (hereafter identified as 'nano') given its current rapid growth and multidisciplinary nature. (Under the rubric of nanotechnology, we also include nanoscience and nanoengineering.) Past efforts have utilized several strategies, including simple term search for the prefix nano, complex lexical and citation-based approaches, and bootstrapping techniques. This research introduces a modularized Boolean approach to defining nanotechnology which has been applied to several research and patenting databases. We explain our approach to downloading and cleaning data, and report initial results. Comparisons of this approach with other nanotechnology search formulations are presented. Implications for search strategy development and profiling of the nanotechnology field are discussed.

  18. Similarity-based search of model organism, disease and drug effect phenotypes

    KAUST Repository

    Hoehndorf, Robert; Gruenberger, Michael; Gkoutos, Georgios V; Schofield, Paul N

    2015-01-01

    Background: Semantic similarity measures over phenotype ontologies have been demonstrated to provide a powerful approach for the analysis of model organism phenotypes, the discovery of animal models of human disease, novel pathways, gene functions

  19. Analysis of a librarian-mediated literature search service.

    Science.gov (United States)

    Friesen, Carol; Lê, Mê-Linh; Cooke, Carol; Raynard, Melissa

    2015-01-01

    Librarian-mediated literature searching is a key service provided at medical libraries. This analysis outlines ten years of data on 19,248 literature searches and describes information on the volume and frequency of search requests, time spent per search, databases used, and professional designations of the patron requestors. Combined with information on best practices for expert searching and evaluations of similar services, these findings were used to form recommendations on the improvement and standardization of a literature search service at a large health library system.

  20. The physical therapy profile questionnaire (PTPQ): development, validation and pilot testing.

    Science.gov (United States)

    Dizon, Janine Margarita R; Grimmer-Somers, Karen; Kumar, Saravana

    2011-09-19

    Country by country similarities and differences in physical therapy practice exists. Therefore, before updates in practice can be provided, such as trainings in evidence-based practice, it is necessary to identify the profile and nature of practice in a given country or setting. Following a search of the international literature, no appropriate tool was identified to collect and establish data to create the profile of physical therapy practice in the Philippines. We therefore developed, validated and pilot tested a survey instrument which would comprehensively describe the practice of physical therapy in the Philippines We used a mixed methods design to answer our study aims. A focus group interview was conducted among a group of physical therapists to establish the content and contexts of items to be included in the survey instrument. Findings were amalgamated with the information from the literature on developing survey instruments/questionnaires. A survey instrument was drafted and named as the Physical Therapy Profile Questionnaire (PTPQ). The PTPQ was then validated and pilot tested to a different group of physical therapists.The final version consisted of five separate parts namely (A) General information and demographics, (B) Practice Profile, (C) Treatment Preferences, (D) Bases for clinical work and (E) Bases for educational/research work. At present the PTPQ is relevant to the Philippines and could be used by any country which has a similar nature of practice with the Philippines. The Physical Therapy Practice Questionnaire (PTPQ) was shown to have good face and content validity among the Filipino physical therapists and their context of practice. It has also been found to be useful, easy to administer tool and in a format appealing to respondents. The PTPQ is expected to assist comprehensive data collection to create a profile of physical therapy practice in the Philippines.

  1. The physical therapy profile questionnaire (PTPQ: development, validation and pilot testing

    Directory of Open Access Journals (Sweden)

    Grimmer-Somers Karen

    2011-09-01

    Full Text Available Abstract Background Country by country similarities and differences in physical therapy practice exists. Therefore, before updates in practice can be provided, such as trainings in evidence-based practice, it is necessary to identify the profile and nature of practice in a given country or setting. Following a search of the international literature, no appropriate tool was identified to collect and establish data to create the profile of physical therapy practice in the Philippines. We therefore developed, validated and pilot tested a survey instrument which would comprehensively describe the practice of physical therapy in the Philippines Findings We used a mixed methods design to answer our study aims. A focus group interview was conducted among a group of physical therapists to establish the content and contexts of items to be included in the survey instrument. Findings were amalgamated with the information from the literature on developing survey instruments/questionnaires. A survey instrument was drafted and named as the Physical Therapy Profile Questionnaire (PTPQ. The PTPQ was then validated and pilot tested to a different group of physical therapists. The final version consisted of five separate parts namely (A General information and demographics, (B Practice Profile, (C Treatment Preferences, (D Bases for clinical work and (E Bases for educational/research work. At present the PTPQ is relevant to the Philippines and could be used by any country which has a similar nature of practice with the Philippines. Conclusion The Physical Therapy Practice Questionnaire (PTPQ was shown to have good face and content validity among the Filipino physical therapists and their context of practice. It has also been found to be useful, easy to administer tool and in a format appealing to respondents. The PTPQ is expected to assist comprehensive data collection to create a profile of physical therapy practice in the Philippines.

  2. Using concept similarity in cross ontology for adaptive e-Learning systems

    Directory of Open Access Journals (Sweden)

    B. Saleena

    2015-01-01

    Full Text Available e-Learning is one of the most preferred media of learning by the learners. The learners search the web to gather knowledge about a particular topic from the information in the repositories. Retrieval of relevant materials from a domain can be easily implemented if the information is organized and related in some way. Ontologies are a key concept that helps us to relate information for providing the more relevant lessons to the learner. This paper proposes an adaptive e-Learning system, which generates a user specific e-Learning content by comparing the concepts with more than one system using similarity measures. A cross ontology measure is defined, which consists of fuzzy domain ontology as the primary ontology and the domain expert’s ontology as the secondary ontology, for the comparison process. A personalized document is provided to the user with a user profile, which includes the data obtained from the processing of the proposed method under a User score, which is obtained through the user evaluation. The results of the proposed e-Learning system under the designed cross ontology similarity measure show a significant increase in performance and accuracy under different conditions. The assessment of the comparative analysis, showed the difference in performance of our proposed method over other methods. Based on the assessment results it is proved that the proposed approach is effective over other methods.

  3. Searching for patterns in TJ-II time evolution signals

    International Nuclear Information System (INIS)

    Farias, G.; Dormido-Canto, S.; Vega, J.; Sanchez, J.; Duro, N.; Dormido, R.; Ochando, M.; Santos, M.; Pajares, G.

    2006-01-01

    Since fusion plasma experiments generate hundreds of signals, it is important for their analysis to have automatic mechanisms for searching for similarities and retrieving specific data from the signal database. This paper describes a technique for searching in the TJ-II database that combines support vector machines and similarity query methods. Firstly, plasma signals are pre-processed by wavelet transform or discrete Fourier transform to reduce the dimensionality of the problem and to extract their main features. Secondly, support vector machines are used to classify a set of signals by reference to an input signal. Finally, similarity query methods (Euclidean distance and bounding envelope) are used to search the set of signals that best matches the input signal

  4. Behavioral Profiles of Children With Williams Syndrome From Spain and the United States: Cross-Cultural Similarities and Differences.

    Science.gov (United States)

    Pérez-García, Débora; Brun-Gasca, Carme; Pérez-Jurado, Luis A; Mervis, Carolyn B

    2017-03-01

    To identify similarities and differences in the behavioral profile of children with Williams syndrome from Spain (n = 53) and the United States (n = 145), we asked parents of 6- to 14-year-olds with Williams syndrome to complete the Child Behavior Checklist 6-18. The distribution of raw scores was significantly higher for the Spanish sample than the American sample for all of the higher-order factors and half of both the empirically based and Diagnostic and Statistical Manual of Mental Disorders (DSM)-oriented scales. In contrast, analyses based on country-specific T-scores indicated that the distribution for the Spanish sample was significantly higher than for the American sample only on the Social Problems scale. No gender differences were found. Genetic and cultural influences on children's behavior and cultural influences on parental ratings of behavior are discussed.

  5. Perceptual load corresponds with factors known to influence visual search.

    Science.gov (United States)

    Roper, Zachary J J; Cosman, Joshua D; Vecera, Shaun P

    2013-10-01

    One account of the early versus late selection debate in attention proposes that perceptual load determines the locus of selection. Attention selects stimuli at a late processing level under low-load conditions but selects stimuli at an early level under high-load conditions. Despite the successes of perceptual load theory, a noncircular definition of perceptual load remains elusive. We investigated the factors that influence perceptual load by using manipulations that have been studied extensively in visual search, namely target-distractor similarity and distractor-distractor similarity. Consistent with previous work, search was most efficient when targets and distractors were dissimilar and the displays contained homogeneous distractors; search became less efficient when target-distractor similarity increased irrespective of display heterogeneity. Importantly, we used these same stimuli in a typical perceptual load task that measured attentional spillover to a task-irrelevant flanker. We found a strong correspondence between search efficiency and perceptual load; stimuli that generated efficient searches produced flanker interference effects, suggesting that such displays involved low perceptual load. Flanker interference effects were reduced in displays that produced less efficient searches. Furthermore, our results demonstrate that search difficulty, as measured by search intercept, has little bearing on perceptual load. We conclude that rather than be arbitrarily defined, perceptual load might be defined by well-characterized, continuous factors that influence visual search. PsycINFO Database Record (c) 2013 APA, all rights reserved.

  6. Dynamic Search and Working Memory in Social Recall

    Science.gov (United States)

    Hills, Thomas T.; Pachur, Thorsten

    2012-01-01

    What are the mechanisms underlying search in social memory (e.g., remembering the people one knows)? Do the search mechanisms involve dynamic local-to-global transitions similar to semantic search, and are these transitions governed by the general control of attention, associated with working memory span? To find out, we asked participants to…

  7. Narcissists of a Feather Flock Together: Narcissism and the Similarity of Friends.

    Science.gov (United States)

    Maaß, Ulrike; Lämmle, Lena; Bensch, Doreen; Ziegler, Matthias

    2016-03-01

    Who is willing to expose himself or herself to narcissists on a long-term basis? Studies that address the interactions of narcissists focus mainly on their interactions with strangers. Hence, the aim of the present study was to investigate the extent to which two best friends' similarity in narcissism would influence their similarities in other personality profiles. A total of 290 best friends' dyads filled out measurements of the whole Dark Triad as well as the Big Five. For each personality domain, profile similarity and its dependence on the similarity in the Dark Triad were determined. Results showed that the friends' similarity in narcissism significantly predicted similarity in all Big Five domains. For the general Big Five similarity as well as extraversion, the effect of narcissism similarity was stronger for male than female or mixed friends. Similarity in psychopathy and Machiavellianism significantly predicted all domains except for openness and extraversion, respectively. © 2016 by the Society for Personality and Social Psychology, Inc.

  8. Optimizing Vector-Quantization Processor Architecture for Intelligent Query-Search Applications

    Science.gov (United States)

    Xu, Huaiyu; Mita, Yoshio; Shibata, Tadashi

    2002-04-01

    The architecture of a very large scale integration (VLSI) vector-quantization processor (VQP) has been optimized to develop a general-purpose intelligent query-search agent. The agent performs a similarity-based search in a large-volume database. Although similarity-based search processing is computationally very expensive, latency-free searches have become possible due to the highly parallel maximum-likelihood search architecture of the VQP chip. Three architectures of the VQP chip have been studied and their performances are compared. In order to give reasonable searching results according to the different policies, the concept of penalty function has been introduced into the VQP. An E-commerce real-estate agency system has been developed using the VQP chip implemented in a field-programmable gate array (FPGA) and the effectiveness of such an agency system has been demonstrated.

  9. Overview of the CLEF 2016 Social Book Search Lab

    DEFF Research Database (Denmark)

    Koolen, Marijn; Bogers, Toine; Gäde, Maria

    2016-01-01

    systems. The aim of the Interactive Track is to develop user interfaces that support users through each stage during complex search tasks and to investigate how users exploit professional metadata and user-generated content. The Mining Track focuses on detecting and linking book titles in online book......The Social Book Search (SBS) Lab investigates book search in scenarios where users search with more than just a query, and look for more than objective metadata. Real-world information needs are generally complex, yet almost all research focuses instead on either relatively simple search based...... on queries, or on profile-based recommendation. The goal is to research and develop techniques to support users in complex book search tasks. The SBS Lab has three tracks. The aim of the Suggestion Track is to develop test collections for evaluating ranking effectiveness of book retrieval and recommender...

  10. Statistical potential-based amino acid similarity matrices for aligning distantly related protein sequences.

    Science.gov (United States)

    Tan, Yen Hock; Huang, He; Kihara, Daisuke

    2006-08-15

    Aligning distantly related protein sequences is a long-standing problem in bioinformatics, and a key for successful protein structure prediction. Its importance is increasing recently in the context of structural genomics projects because more and more experimentally solved structures are available as templates for protein structure modeling. Toward this end, recent structure prediction methods employ profile-profile alignments, and various ways of aligning two profiles have been developed. More fundamentally, a better amino acid similarity matrix can improve a profile itself; thereby resulting in more accurate profile-profile alignments. Here we have developed novel amino acid similarity matrices from knowledge-based amino acid contact potentials. Contact potentials are used because the contact propensity to the other amino acids would be one of the most conserved features of each position of a protein structure. The derived amino acid similarity matrices are tested on benchmark alignments at three different levels, namely, the family, the superfamily, and the fold level. Compared to BLOSUM45 and the other existing matrices, the contact potential-based matrices perform comparably in the family level alignments, but clearly outperform in the fold level alignments. The contact potential-based matrices perform even better when suboptimal alignments are considered. Comparing the matrices themselves with each other revealed that the contact potential-based matrices are very different from BLOSUM45 and the other matrices, indicating that they are located in a different basin in the amino acid similarity matrix space.

  11. Search engines and the production of academic knowledge

    OpenAIRE

    van Dijck, J.

    2010-01-01

    This article argues that search engines in general, and Google Scholar in particular, have become significant co-producers of academic knowledge. Knowledge is not simply conveyed to users, but is co-produced by search engines’ ranking systems and profiling systems, none of which are open to the rules of transparency, relevance and privacy in a manner known from library scholarship in the public domain. Inexperienced users tend to trust proprietary engines as neutral mediators of knowledge and...

  12. Distractor dwelling, skipping, and revisiting determine target absent performance in difficult visual search

    Directory of Open Access Journals (Sweden)

    Gernot Horstmann

    2016-08-01

    Full Text Available Some targets in visual search are more difficult to find than others. In particular, a target that is similar to the distractors is more difficult to find than a target that is dissimilar to the distractors. Efficiency differences between easy and difficult searches are manifest not only in target-present trials but also in target-absent trials. In fact, even physically identical displays are searched through with different efficiency depending on the searched-for target. Here, we monitored eye movements in search for a target similar to the distractors (difficult search versus a target dissimilar to the distractors (easy search. We aimed to examine three hypotheses concerning the causes of differential search efficiencies in target-absent trials: (a distractor dwelling (b distractor skipping, and (c distractor revisiting. Reaction times increased with target similarity which is consistent with existing theories and replicates earlier results. Eye movement data indicated guidance in target trials, even though search was very slow. Dwelling, skipping, and revisiting contributed to low search efficiency in difficult search, with dwelling being the strongest factor. It is argued that differences in dwell time account for a large amount of total search time differences.

  13. Distractor Dwelling, Skipping, and Revisiting Determine Target Absent Performance in Difficult Visual Search

    Science.gov (United States)

    Horstmann, Gernot; Herwig, Arvid; Becker, Stefanie I.

    2016-01-01

    Some targets in visual search are more difficult to find than others. In particular, a target that is similar to the distractors is more difficult to find than a target that is dissimilar to the distractors. Efficiency differences between easy and difficult searches are manifest not only in target-present trials but also in target-absent trials. In fact, even physically identical displays are searched through with different efficiency depending on the searched-for target. Here, we monitored eye movements in search for a target similar to the distractors (difficult search) versus a target dissimilar to the distractors (easy search). We aimed to examine three hypotheses concerning the causes of differential search efficiencies in target-absent trials: (a) distractor dwelling (b) distractor skipping, and (c) distractor revisiting. Reaction times increased with target similarity which is consistent with existing theories and replicates earlier results. Eye movement data indicated guidance in target trials, even though search was very slow. Dwelling, skipping, and revisiting contributed to low search efficiency in difficult search, with dwelling being the strongest factor. It is argued that differences in dwell time account for a large amount of total search time differences. PMID:27574510

  14. Appropriate Similarity Measures for Author Cocitation Analysis

    NARCIS (Netherlands)

    N.J.P. van Eck (Nees Jan); L. Waltman (Ludo)

    2007-01-01

    textabstractWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of

  15. Notions of similarity for computational biology models

    KAUST Repository

    Waltemath, Dagmar

    2016-03-21

    Computational models used in biology are rapidly increasing in complexity, size, and numbers. To build such large models, researchers need to rely on software tools for model retrieval, model combination, and version control. These tools need to be able to quantify the differences and similarities between computational models. However, depending on the specific application, the notion of similarity may greatly vary. A general notion of model similarity, applicable to various types of models, is still missing. Here, we introduce a general notion of quantitative model similarities, survey the use of existing model comparison methods in model building and management, and discuss potential applications of model comparison. To frame model comparison as a general problem, we describe a theoretical approach to defining and computing similarities based on different model aspects. Potentially relevant aspects of a model comprise its references to biological entities, network structure, mathematical equations and parameters, and dynamic behaviour. Future similarity measures could combine these model aspects in flexible, problem-specific ways in order to mimic users\\' intuition about model similarity, and to support complex model searches in databases.

  16. Notions of similarity for computational biology models

    KAUST Repository

    Waltemath, Dagmar; Henkel, Ron; Hoehndorf, Robert; Kacprowski, Tim; Knuepfer, Christian; Liebermeister, Wolfram

    2016-01-01

    Computational models used in biology are rapidly increasing in complexity, size, and numbers. To build such large models, researchers need to rely on software tools for model retrieval, model combination, and version control. These tools need to be able to quantify the differences and similarities between computational models. However, depending on the specific application, the notion of similarity may greatly vary. A general notion of model similarity, applicable to various types of models, is still missing. Here, we introduce a general notion of quantitative model similarities, survey the use of existing model comparison methods in model building and management, and discuss potential applications of model comparison. To frame model comparison as a general problem, we describe a theoretical approach to defining and computing similarities based on different model aspects. Potentially relevant aspects of a model comprise its references to biological entities, network structure, mathematical equations and parameters, and dynamic behaviour. Future similarity measures could combine these model aspects in flexible, problem-specific ways in order to mimic users' intuition about model similarity, and to support complex model searches in databases.

  17. Notions of similarity for systems biology models.

    Science.gov (United States)

    Henkel, Ron; Hoehndorf, Robert; Kacprowski, Tim; Knüpfer, Christian; Liebermeister, Wolfram; Waltemath, Dagmar

    2018-01-01

    Systems biology models are rapidly increasing in complexity, size and numbers. When building large models, researchers rely on software tools for the retrieval, comparison, combination and merging of models, as well as for version control. These tools need to be able to quantify the differences and similarities between computational models. However, depending on the specific application, the notion of 'similarity' may greatly vary. A general notion of model similarity, applicable to various types of models, is still missing. Here we survey existing methods for the comparison of models, introduce quantitative measures for model similarity, and discuss potential applications of combined similarity measures. To frame model comparison as a general problem, we describe a theoretical approach to defining and computing similarities based on a combination of different model aspects. The six aspects that we define as potentially relevant for similarity are underlying encoding, references to biological entities, quantitative behaviour, qualitative behaviour, mathematical equations and parameters and network structure. We argue that future similarity measures will benefit from combining these model aspects in flexible, problem-specific ways to mimic users' intuition about model similarity, and to support complex model searches in databases. © The Author 2016. Published by Oxford University Press.

  18. Do Targeted Hiring Subsidies and Profiling Techniques Reduce Unemployment?

    DEFF Research Database (Denmark)

    Jahn, Elke; Wagner, Thomas

    2008-01-01

    To reduce equilibrium unemployment targeted hiring subsidies and profiling techniques for long-term unemployed are often recommended. To analyze the effects of these two instruments, our model combines two search methods: the public employment service and random search, jobseekers choose between...... an active and a passive search strategy, while labour market policy has two options available. First, only the long-term unemployed placed by the public employment service are subsidized. Second, the subsidy is paid for each match with a long-term unemployed irrespective of the search method used. We show...

  19. Using the Dual-Target Cost to Explore the Nature of Search Target Representations

    Science.gov (United States)

    Stroud, Michael J.; Menneer, Tamaryn; Cave, Kyle R.; Donnelly, Nick

    2012-01-01

    Eye movements were monitored to examine search efficiency and infer how color is mentally represented to guide search for multiple targets. Observers located a single color target very efficiently by fixating colors similar to the target. However, simultaneous search for 2 colors produced a dual-target cost. In addition, as the similarity between…

  20. Cybervetting internet searches for vetting, investigations, and open-source intelligence

    CERN Document Server

    Appel, Edward J

    2014-01-01

    Section I Behavior and TechnologyThe Internet's Potential for Investigators and Intelligence OfficersIntroductionGrowth of Internet UseA Practitioner's PerspectiveThe SearchInternet Posts and the People They ProfileFinding the NeedlesThe Need for SpeedSufficiency of SearchesNotesBehavior OnlineInternet Use GrowthEvolution of Internet UsesPhysical World, Virtual ActivitiesConnections and DisconnectingNotesUse and Abuse: Crime and Mis

  1. Analysis of newly established EST databases reveals similarities between heart regeneration in newt and fish

    Directory of Open Access Journals (Sweden)

    Weis Patrick

    2010-01-01

    Full Text Available Abstract Background The newt Notophthalmus viridescens possesses the remarkable ability to respond to cardiac damage by formation of new myocardial tissue. Surprisingly little is known about changes in gene activities that occur during the course of regeneration. To begin to decipher the molecular processes, that underlie restoration of functional cardiac tissue, we generated an EST database from regenerating newt hearts and compared the transcriptional profile of selected candidates with genes deregulated during zebrafish heart regeneration. Results A cDNA library of 100,000 cDNA clones was generated from newt hearts 14 days after ventricular injury. Sequencing of 11520 cDNA clones resulted in 2894 assembled contigs. BLAST searches revealed 1695 sequences with potential homology to sequences from the NCBI database. BLAST searches to TrEMBL and Swiss-Prot databases assigned 1116 proteins to Gene Ontology terms. We also identified a relatively large set of 174 ORFs, which are likely to be unique for urodele amphibians. Expression analysis of newt-zebrafish homologues confirmed the deregulation of selected genes during heart regeneration. Sequences, BLAST results and GO annotations were visualized in a relational web based database followed by grouping of identified proteins into clusters of GO Terms. Comparison of data from regenerating zebrafish hearts identified biological processes, which were uniformly overrepresented during cardiac regeneration in newt and zebrafish. Conclusion We concluded that heart regeneration in newts and zebrafish led to the activation of similar sets of genes, which suggests that heart regeneration in both species might follow similar principles. The design of the newly established newt EST database allows identification of molecular pathways important for heart regeneration.

  2. A similarity-based data warehousing environment for medical images.

    Science.gov (United States)

    Teixeira, Jefferson William; Annibal, Luana Peixoto; Felipe, Joaquim Cezar; Ciferri, Ricardo Rodrigues; Ciferri, Cristina Dutra de Aguiar

    2015-11-01

    A core issue of the decision-making process in the medical field is to support the execution of analytical (OLAP) similarity queries over images in data warehousing environments. In this paper, we focus on this issue. We propose imageDWE, a non-conventional data warehousing environment that enables the storage of intrinsic features taken from medical images in a data warehouse and supports OLAP similarity queries over them. To comply with this goal, we introduce the concept of perceptual layer, which is an abstraction used to represent an image dataset according to a given feature descriptor in order to enable similarity search. Based on this concept, we propose the imageDW, an extended data warehouse with dimension tables specifically designed to support one or more perceptual layers. We also detail how to build an imageDW and how to load image data into it. Furthermore, we show how to process OLAP similarity queries composed of a conventional predicate and a similarity search predicate that encompasses the specification of one or more perceptual layers. Moreover, we introduce an index technique to improve the OLAP query processing over images. We carried out performance tests over a data warehouse environment that consolidated medical images from exams of several modalities. The results demonstrated the feasibility and efficiency of our proposed imageDWE to manage images and to process OLAP similarity queries. The results also demonstrated that the use of the proposed index technique guaranteed a great improvement in query processing. Copyright © 2015 Elsevier Ltd. All rights reserved.

  3. Prior knowledge of category size impacts visual search.

    Science.gov (United States)

    Wu, Rachel; McGee, Brianna; Echiverri, Chelsea; Zinszer, Benjamin D

    2018-03-30

    Prior research has shown that category search can be similar to one-item search (as measured by the N2pc ERP marker of attentional selection) for highly familiar, smaller categories (e.g., letters and numbers) because the finite set of items in a category can be grouped into one unit to guide search. Other studies have shown that larger, more broadly defined categories (e.g., healthy food) also can elicit N2pc components during category search, but the amplitude of these components is typically attenuated. Two experiments investigated whether the perceived size of a familiar category impacts category and exemplar search. We presented participants with 16 familiar company logos: 8 from a smaller category (social media companies) and 8 from a larger category (entertainment/recreation manufacturing companies). The ERP results from Experiment 1 revealed that, in a two-item search array, search was more efficient for the smaller category of logos compared to the larger category. In a four-item search array (Experiment 2), where two of the four items were placeholders, search was largely similar between the category types, but there was more attentional capture by nontarget members from the same category as the target for smaller rather than larger categories. These results support a growing literature on how prior knowledge of categories affects attentional selection and capture during visual search. We discuss the implications of these findings in relation to assessing cognitive abilities across the lifespan, given that prior knowledge typically increases with age. © 2018 Society for Psychophysiological Research.

  4. Parallel content-based sub-image retrieval using hierarchical searching.

    Science.gov (United States)

    Yang, Lin; Qi, Xin; Xing, Fuyong; Kurc, Tahsin; Saltz, Joel; Foran, David J

    2014-04-01

    The capacity to systematically search through large image collections and ensembles and detect regions exhibiting similar morphological characteristics is central to pathology diagnosis. Unfortunately, the primary methods used to search digitized, whole-slide histopathology specimens are slow and prone to inter- and intra-observer variability. The central objective of this research was to design, develop, and evaluate a content-based image retrieval system to assist doctors for quick and reliable content-based comparative search of similar prostate image patches. Given a representative image patch (sub-image), the algorithm will return a ranked ensemble of image patches throughout the entire whole-slide histology section which exhibits the most similar morphologic characteristics. This is accomplished by first performing hierarchical searching based on a newly developed hierarchical annular histogram (HAH). The set of candidates is then further refined in the second stage of processing by computing a color histogram from eight equally divided segments within each square annular bin defined in the original HAH. A demand-driven master-worker parallelization approach is employed to speed up the searching procedure. Using this strategy, the query patch is broadcasted to all worker processes. Each worker process is dynamically assigned an image by the master process to search for and return a ranked list of similar patches in the image. The algorithm was tested using digitized hematoxylin and eosin (H&E) stained prostate cancer specimens. We have achieved an excellent image retrieval performance. The recall rate within the first 40 rank retrieved image patches is ∼90%. Both the testing data and source code can be downloaded from http://pleiad.umdnj.edu/CBII/Bioinformatics/.

  5. RAG-3D: a search tool for RNA 3D substructures

    Science.gov (United States)

    Zahran, Mai; Sevim Bayrak, Cigdem; Elmetwaly, Shereef; Schlick, Tamar

    2015-01-01

    To address many challenges in RNA structure/function prediction, the characterization of RNA's modular architectural units is required. Using the RNA-As-Graphs (RAG) database, we have previously explored the existence of secondary structure (2D) submotifs within larger RNA structures. Here we present RAG-3D—a dataset of RNA tertiary (3D) structures and substructures plus a web-based search tool—designed to exploit graph representations of RNAs for the goal of searching for similar 3D structural fragments. The objects in RAG-3D consist of 3D structures translated into 3D graphs, cataloged based on the connectivity between their secondary structure elements. Each graph is additionally described in terms of its subgraph building blocks. The RAG-3D search tool then compares a query RNA 3D structure to those in the database to obtain structurally similar structures and substructures. This comparison reveals conserved 3D RNA features and thus may suggest functional connections. Though RNA search programs based on similarity in sequence, 2D, and/or 3D structural elements are available, our graph-based search tool may be advantageous for illuminating similarities that are not obvious; using motifs rather than sequence space also reduces search times considerably. Ultimately, such substructuring could be useful for RNA 3D structure prediction, structure/function inference and inverse folding. PMID:26304547

  6. Medical Support for Aircraft Disaster Search and Recovery Operations at Sea: the RSN Experience.

    Science.gov (United States)

    Teo, Kok Ann Colin; Chong, Tse Feng Gabriel; Liow, Min Han Lincoln; Tang, Kong Choong

    2016-06-01

    The maritime environment presents a unique set of challenges to search and recovery (SAR) operations. There is a paucity of information available to guide provision of medical support for SAR operations for aircraft disasters at sea. The Republic of Singapore Navy (RSN) took part in two such SAR operations in 2014 which showcased the value of a military organization in these operations. Key considerations in medical support for similar operations include the resultant casualty profile and challenges specific to the maritime environment, such as large distances of area of operations from land, variable sea states, and space limitations. Medical support planning can be approached using well-established disaster management life cycle phases of preparedness, mitigation, response, and recovery, which all are described in detail. This includes key areas of dedicated training and exercises, force protection, availability of air assets and chamber support, psychological care, and the forensic handling of human remains. Relevant lessons learned by RSN from the Air Asia QZ8501 search operation are also included in the description of these key areas. Teo KAC , Chong TFG , Liow MHL , Tang KC . Medical support for aircraft disaster search and recovery operations at sea: the RSN experience. Prehosp Disaster Med. 2016; 31(3):294-299.

  7. Chromatographic fingerprint similarity analysis for pollutant source identification

    International Nuclear Information System (INIS)

    Xie, Juan-Ping; Ni, Hong-Gang

    2015-01-01

    In the present study, a similarity analysis method was proposed to evaluate the source-sink relationships among environmental media for polybrominated diphenyl ethers (PBDEs), which were taken as the representative contaminants. Chromatographic fingerprint analysis has been widely used in the fields of natural products chemistry and forensic chemistry, but its application to environmental science has been limited. We established a library of various sources of media containing contaminants (e.g., plastics), recognizing that the establishment of a more comprehensive library allows for a better understanding of the sources of contamination. We then compared an environmental complex mixture (e.g., sediment, soil) with the profiles in the library. These comparisons could be used as the first step in source tracking. The cosine similarities between plastic and soil or sediment ranged from 0.53 to 0.68, suggesting that plastic in electronic waste is an important source of PBDEs in the environment, but it is not the only source. A similarity analysis between soil and sediment indicated that they have a source-sink relationship. Generally, the similarity analysis method can encompass more relevant information of complex mixtures in the environment than a profile-based approach that only focuses on target pollutants. There is an inherent advantage to creating a data matrix containing all peaks and their relative levels after matching the peaks based on retention times and peak areas. This data matrix can be used for source identification via a similarity analysis without quantitative or qualitative analysis of all chemicals in a sample. - Highlights: • Chromatographic fingerprint analysis can be used as the first step in source tracking. • Similarity analysis method can encompass more relevant information of pollution. • The fingerprints strongly depend on the chromatographic conditions. • A more effective and robust method for identifying similarities is required

  8. Monte-Carlo Tree Search for Poly-Y

    NARCIS (Netherlands)

    Wevers, L.; te Brinke, Steven

    2014-01-01

    Monte-Carlo tree search (MCTS) is a heuristic search algorithm that has recently been very successful in the games of Go and Hex. In this paper, we describe an MCTS player for the game of Poly-Y, which is a connection game similar to Hex. Our player won the CodeCup 2014 AI programming competition.

  9. Fast protein tertiary structure retrieval based on global surface shape similarity.

    Science.gov (United States)

    Sael, Lee; Li, Bin; La, David; Fang, Yi; Ramani, Karthik; Rustamov, Raif; Kihara, Daisuke

    2008-09-01

    Characterization and identification of similar tertiary structure of proteins provides rich information for investigating function and evolution. The importance of structure similarity searches is increasing as structure databases continue to expand, partly due to the structural genomics projects. A crucial drawback of conventional protein structure comparison methods, which compare structures by their main-chain orientation or the spatial arrangement of secondary structure, is that a database search is too slow to be done in real-time. Here we introduce a global surface shape representation by three-dimensional (3D) Zernike descriptors, which represent a protein structure compactly as a series expansion of 3D functions. With this simplified representation, the search speed against a few thousand structures takes less than a minute. To investigate the agreement between surface representation defined by 3D Zernike descriptor and conventional main-chain based representation, a benchmark was performed against a protein classification generated by the combinatorial extension algorithm. Despite the different representation, 3D Zernike descriptor retrieved proteins of the same conformation defined by combinatorial extension in 89.6% of the cases within the top five closest structures. The real-time protein structure search by 3D Zernike descriptor will open up new possibility of large-scale global and local protein surface shape comparison. 2008 Wiley-Liss, Inc.

  10. Privacy-Preserving Patient Similarity Learning in a Federated Environment: Development and Analysis.

    Science.gov (United States)

    Lee, Junghye; Sun, Jimeng; Wang, Fei; Wang, Shuang; Jun, Chi-Hyuck; Jiang, Xiaoqian

    2018-04-13

    There is an urgent need for the development of global analytic frameworks that can perform analyses in a privacy-preserving federated environment across multiple institutions without privacy leakage. A few studies on the topic of federated medical analysis have been conducted recently with the focus on several algorithms. However, none of them have solved similar patient matching, which is useful for applications such as cohort construction for cross-institution observational studies, disease surveillance, and clinical trials recruitment. The aim of this study was to present a privacy-preserving platform in a federated setting for patient similarity learning across institutions. Without sharing patient-level information, our model can find similar patients from one hospital to another. We proposed a federated patient hashing framework and developed a novel algorithm to learn context-specific hash codes to represent patients across institutions. The similarities between patients can be efficiently computed using the resulting hash codes of corresponding patients. To avoid security attack from reverse engineering on the model, we applied homomorphic encryption to patient similarity search in a federated setting. We used sequential medical events extracted from the Multiparameter Intelligent Monitoring in Intensive Care-III database to evaluate the proposed algorithm in predicting the incidence of five diseases independently. Our algorithm achieved averaged area under the curves of 0.9154 and 0.8012 with balanced and imbalanced data, respectively, in κ-nearest neighbor with κ=3. We also confirmed privacy preservation in similarity search by using homomorphic encryption. The proposed algorithm can help search similar patients across institutions effectively to support federated data analysis in a privacy-preserving manner. ©Junghye Lee, Jimeng Sun, Fei Wang, Shuang Wang, Chi-Hyuck Jun, Xiaoqian Jiang. Originally published in JMIR Medical Informatics (http

  11. Fast Depiction Invariant Visual Similarity for Content Based Image Retrieval Based on Data-driven Visual Similarity using Linear Discriminant Analysis

    Science.gov (United States)

    Wihardi, Y.; Setiawan, W.; Nugraha, E.

    2018-01-01

    On this research we try to build CBIRS based on Learning Distance/Similarity Function using Linear Discriminant Analysis (LDA) and Histogram of Oriented Gradient (HoG) feature. Our method is invariant to depiction of image, such as similarity of image to image, sketch to image, and painting to image. LDA can decrease execution time compared to state of the art method, but it still needs an improvement in term of accuracy. Inaccuracy in our experiment happen because we did not perform sliding windows search and because of low number of negative samples as natural-world images.

  12. Similar Spectral Power Densities Within the Schumann Resonance and a Large Population of Quantitative Electroencephalographic Profiles: Supportive Evidence for Koenig and Pobachenko.

    Science.gov (United States)

    Saroka, Kevin S; Vares, David E; Persinger, Michael A

    2016-01-01

    In 1954 and 1960 Koenig and his colleagues described the remarkable similarities of spectral power density profiles and patterns between the earth-ionosphere resonance and human brain activity which also share magnitudes for both electric field (mV/m) and magnetic field (pT) components. In 2006 Pobachenko and colleagues reported real time coherence between variations in the Schumann and brain activity spectra within the 6-16 Hz band for a small sample. We examined the ratios of the average potential differences (~3 μV) obtained by whole brain quantitative electroencephalography (QEEG) between rostral-caudal and left-right (hemispheric) comparisons of 238 measurements from 184 individuals over a 3.5 year period. Spectral densities for the rostral-caudal axis revealed a powerful peak at 10.25 Hz while the left-right peak was 1.95 Hz with beat-differences of ~7.5 to 8 Hz. When global cerebral measures were employed, the first (7-8 Hz), second (13-14 Hz) and third (19-20 Hz) harmonics of the Schumann resonances were discernable in averaged QEEG profiles in some but not all participants. The intensity of the endogenous Schumann resonance was related to the 'best-of-fitness' of the traditional 4-class microstate model. Additional measurements demonstrated real-time coherence for durations approximating microstates in spectral power density variations between Schumann frequencies measured in Sudbury, Canada and Cumiana, Italy with the QEEGs of local subjects. Our results confirm the measurements reported by earlier researchers that demonstrated unexpected similarities in the spectral patterns and strengths of electromagnetic fields generated by the human brain and the earth-ionospheric cavity.

  13. Similar Spectral Power Densities Within the Schumann Resonance and a Large Population of Quantitative Electroencephalographic Profiles: Supportive Evidence for Koenig and Pobachenko.

    Directory of Open Access Journals (Sweden)

    Kevin S Saroka

    Full Text Available In 1954 and 1960 Koenig and his colleagues described the remarkable similarities of spectral power density profiles and patterns between the earth-ionosphere resonance and human brain activity which also share magnitudes for both electric field (mV/m and magnetic field (pT components. In 2006 Pobachenko and colleagues reported real time coherence between variations in the Schumann and brain activity spectra within the 6-16 Hz band for a small sample. We examined the ratios of the average potential differences (~3 μV obtained by whole brain quantitative electroencephalography (QEEG between rostral-caudal and left-right (hemispheric comparisons of 238 measurements from 184 individuals over a 3.5 year period. Spectral densities for the rostral-caudal axis revealed a powerful peak at 10.25 Hz while the left-right peak was 1.95 Hz with beat-differences of ~7.5 to 8 Hz. When global cerebral measures were employed, the first (7-8 Hz, second (13-14 Hz and third (19-20 Hz harmonics of the Schumann resonances were discernable in averaged QEEG profiles in some but not all participants. The intensity of the endogenous Schumann resonance was related to the 'best-of-fitness' of the traditional 4-class microstate model. Additional measurements demonstrated real-time coherence for durations approximating microstates in spectral power density variations between Schumann frequencies measured in Sudbury, Canada and Cumiana, Italy with the QEEGs of local subjects. Our results confirm the measurements reported by earlier researchers that demonstrated unexpected similarities in the spectral patterns and strengths of electromagnetic fields generated by the human brain and the earth-ionospheric cavity.

  14. Search for the return of activity in active asteroid 176P/LINEAR

    Energy Technology Data Exchange (ETDEWEB)

    Hsieh, Henry H. [Institute for Astronomy and Astrophysics, Academia Sinica, No. 1, Sec. 4, Roosevelt Road, Taipei 10617, Taiwan (China); Denneau, Larry; Jedicke, Robert; Kaluna, Heather M.; Keane, Jacqueline V.; Kleyna, Jan; MacLennan, Eric M.; Meech, Karen J.; Riesen, Timm; Schunova, Eva; Urban, Laurie; Vereš, Peter; Wainscoat, Richard J. [Institute for Astronomy, University of Hawaii, 2680 Woodlawn Drive, Honolulu, HI 96822 (United States); Fitzsimmons, Alan; Lacerda, Pedro [Astrophysics Research Centre, Queens University Belfast, Belfast BT7 1NN (United Kingdom); Hainaut, Olivier R. [European Southern Observatory, Karl-Schwarzschild-Straße 2, D-85748 Garching bei München (Germany); Ishiguro, Masateru [Department of Physics and Astronomy, Seoul National University, 599 Gwanak-ro, Gwanak, Seoul 151-742 (Korea, Republic of); Moskovitz, Nick A. [Department of Earth, Atmospheric and Planetary Sciences, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139 (United States); Snodgrass, Colin [Max-Planck-Institut für Sonnensystemforschung, Max-Planck-Str. 2, D-37191 Katlenburg-Lindau (Germany); Trujillo, Chadwick A., E-mail: hhsieh@asiaa.sinica.edu.tw [Gemini Observatory, Northern Operations Center, 670 North Aohoku Place, Hilo, HI 96720 (United States); and others

    2014-04-01

    We present the results of a search for the reactivation of active asteroid 176P/LINEAR during its 2011 perihelion passage using deep optical observations obtained before, during, and after that perihelion passage. Deep composite images of 176P constructed from data obtained between 2011 June and 2011 December show no visible signs of activity, while photometric measurements of the object during this period also show no significant brightness enhancements similar to that observed for 176P between 2005 November and 2005 December when it was previously observed to be active. An azimuthal search for dust emission likewise reveals no evidence for directed emission (i.e., a tail, as was previously observed for 176P), while a one-dimensional surface brightness profile analysis shows no indication of a spherically symmetric coma at any time in 2011. We conclude that 176P did not in fact exhibit activity in 2011, at least not on the level on which it exhibited activity in 2005, and suggest that this could be due to the devolatization or mantling of the active site responsible for its activity in 2005.

  15. Overview of the INEX 2014 Social Book Search Track

    DEFF Research Database (Denmark)

    Koolen, Marijn; Bogers, Toine; Kazai, Gabriella

    2014-01-01

    The goal of the INEX 2014 Social Book Search Track is to evaluate approaches for supporting users in searching collections of books based on book metadata and associated user-generated content. The track investigates the complex nature of relevance in book search and the role of traditional...... and user-generated book metadata in retrieval. We extended last year’s investigation into the nature of book suggestions from the LibraryThing forums and how they compare to book relevance judgements. Participants were encouraged to incorporate rich user profiles of both topic creators and other Library......Thing users to explore the relative value of recommendation and retrieval paradigms for book search. We found further support that such suggestions are a valuable alternative to traditional test collections that are based on top-k pooling and editorial relevance judgements....

  16. PubData: search engine for bioinformatics databases worldwide

    OpenAIRE

    Vand, Kasra; Wahlestedt, Thor; Khomtchouk, Kelly; Sayed, Mohammed; Wahlestedt, Claes; Khomtchouk, Bohdan

    2016-01-01

    We propose a search engine and file retrieval system for all bioinformatics databases worldwide. PubData searches biomedical data in a user-friendly fashion similar to how PubMed searches biomedical literature. PubData is built on novel network programming, natural language processing, and artificial intelligence algorithms that can patch into the file transfer protocol servers of any user-specified bioinformatics database, query its contents, retrieve files for download, and adapt to the use...

  17. Stationary neoclassical profiles of plasma parameters in stellarators

    International Nuclear Information System (INIS)

    Danilkin, I.S.; Mineev, A.B.

    1991-01-01

    Peculiarities of neoclassical model of heat and particle transfer, occuring by calculations of plasma stationary profile parameters in stellarators are considered. The main peculiarity out of all consists in ineadequate compatibility with real physical conditions on the boundary, requiring application of supplementary 'anomalous' transfer or special (but technically possible) adjustment of particle and heat sources to achieve solution in form of 'correct' monotonically sloping profile. It is stated, that neoclassical theory does not provide for well-known ambiguity of solutions for ambipolar electrical field by search of monotonous stationary profiles supported by outside sources

  18. ProCKSI: a decision support system for Protein (Structure Comparison, Knowledge, Similarity and Information

    Directory of Open Access Journals (Sweden)

    Błażewicz Jacek

    2007-10-01

    Full Text Available Abstract Background We introduce the decision support system for Protein (Structure Comparison, Knowledge, Similarity and Information (ProCKSI. ProCKSI integrates various protein similarity measures through an easy to use interface that allows the comparison of multiple proteins simultaneously. It employs the Universal Similarity Metric (USM, the Maximum Contact Map Overlap (MaxCMO of protein structures and other external methods such as the DaliLite and the TM-align methods, the Combinatorial Extension (CE of the optimal path, and the FAST Align and Search Tool (FAST. Additionally, ProCKSI allows the user to upload a user-defined similarity matrix supplementing the methods mentioned, and computes a similarity consensus in order to provide a rich, integrated, multicriteria view of large datasets of protein structures. Results We present ProCKSI's architecture and workflow describing its intuitive user interface, and show its potential on three distinct test-cases. In the first case, ProCKSI is used to evaluate the results of a previous CASP competition, assessing the similarity of proposed models for given targets where the structures could have a large deviation from one another. To perform this type of comparison reliably, we introduce a new consensus method. The second study deals with the verification of a classification scheme for protein kinases, originally derived by sequence comparison by Hanks and Hunter, but here we use a consensus similarity measure based on structures. In the third experiment using the Rost and Sander dataset (RS126, we investigate how a combination of different sets of similarity measures influences the quality and performance of ProCKSI's new consensus measure. ProCKSI performs well with all three datasets, showing its potential for complex, simultaneous multi-method assessment of structural similarity in large protein datasets. Furthermore, combining different similarity measures is usually more robust than

  19. Relations between perceptual and conceptual scope: how global versus local processing fits a focus on similarity versus dissimilarity.

    Science.gov (United States)

    Förster, Jens

    2009-02-01

    Nine studies showed a bidirectional link (a) between a global processing style and generation of similarities and (b) between a local processing style and generation of dissimilarities. In Experiments 1-4, participants were primed with global versus local perception styles and then asked to work on an allegedly unrelated generation task. Across materials, participants generated more similarities than dissimilarities after global priming, whereas for participants with local priming, the opposite was true. Experiments 5-6 demonstrated a bidirectional link whereby participants who were first instructed to search for similarities attended more to the gestalt of a stimulus than to its details, whereas the reverse was true for those who were initially instructed to search for dissimilarities. Because important psychological variables are correlated with processing styles, in Experiments 7-9, temporal distance, a promotion focus, and high power were predicted and shown to enhance the search for similarities, whereas temporal proximity, a prevention focus, and low power enhanced the search for dissimilarities. (PsycINFO Database Record (c) 2009 APA, all rights reserved).

  20. Survival Processing Enhances Visual Search Efficiency.

    Science.gov (United States)

    Cho, Kit W

    2018-05-01

    Words rated for their survival relevance are remembered better than when rated using other well-known memory mnemonics. This finding, which is known as the survival advantage effect and has been replicated in many studies, suggests that our memory systems are molded by natural selection pressures. In two experiments, the present study used a visual search task to examine whether there is likewise a survival advantage for our visual systems. Participants rated words for their survival relevance or for their pleasantness before locating that object's picture in a search array with 8 or 16 objects. Although there was no difference in search times among the two rating scenarios when set size was 8, survival processing reduced visual search times when set size was 16. These findings reflect a search efficiency effect and suggest that similar to our memory systems, our visual systems are also tuned toward self-preservation.

  1. Pentaquark searches with ALICE

    CERN Document Server

    Bobulska, Dana

    2016-01-01

    In this report we present the results of the data analysis for searching for possible invariant mass signals from pentaquarks in the ALICE data. Analysis was based on filtered data from real p-Pb events at psNN=5.02 TeV collected in 2013. The motivation for this project was the recent discovery of pentaquark states by the LHCb collaboration (c ¯ cuud resonance P+ c ) [1]. The search for similar not yet observed pentaquarks is an interesting research topic [2]. In this analysis we searched for a s ¯ suud pentaquark resonance P+ s and its possible decay channel to f meson and proton. The ALICE detector is well suited for the search of certain candidates thanks to its low material budget and strong PID capabilities. Additionally we might expect the production of such particles in ALICE as in heavy-ion and proton-ion collisions the thermal models describes well the particle yields and ratios [3]. Therefore it is reasonable to expect other species of hadrons, including also possible pentaquarks, to be produced w...

  2. Similar uptake profiles of microcystin-LR and -RR in an in vitro human intestinal model

    International Nuclear Information System (INIS)

    Zeller, P.; Clement, M.; Fessard, V.

    2011-01-01

    Highlights: → First description of in vitro cellular uptake of MCs into intestinal cells. → OATP 3A1 and OATP 4A1 are expressed in Caco-2 cell membranes. → MC-LR and MC-RR show similar uptake in Caco-2 cells. → MCs are probably excreted from Caco-2 cells by an active mechanism. -- Abstract: Microcystins (MCs) are cyclic hepatotoxins produced by various species of cyanobacteria. Their structure includes two variable amino acids (AA) leading to more than 80 MC variants. In this study, we focused on the most common variant, microcystin-LR (MC-LR), and microcystin-RR (MC-RR), a variant differing by only one AA. Despite their structural similarity, MC-LR elicits higher liver toxicity than MC-RR partly due to a discrepancy in their uptake by hepatic organic anion transporters (OATP 1B1 and 1B3). However, even though ingestion is the major pathway of human exposure to MCs, intestinal absorption of MCs has been poorly addressed. Consequently, we investigated the cellular uptake of the two MC variants in the human intestinal cell line Caco-2 by immunolocalization using an anti-MC antibody. Caco-2 cells were treated for 30 min to 24 h with several concentrations (1-50 μM) of both variants. We first confirmed the localization of OATP 3A1 and 4A1 at the cell membrane of Caco-2 cells. Our study also revealed a rapid uptake of both variants in less than 1 h. The uptake profiles of the two variants did not differ in our immunostaining study neither with respect to concentration nor the time of exposure. Furthermore, we have demonstrated for the first time the nuclear localization of MC-RR and confirmed that of MC-LR. Finally, our results suggest a facilitated uptake and an active excretion of MC-LR and MC-RR in Caco-2 cells. Further investigation on the role of OATP 3A1 and 4A1 in MC uptake should be useful to clarify the mechanism of intestinal absorption of MCs and contribute in risk assessment of cyanotoxin exposure.

  3. New particle searches at CDF

    International Nuclear Information System (INIS)

    Nodulman, L.J.

    1995-09-01

    One of the fundamental roles of a general purpose detector exploring, by means of increasing luminosity, higher and higher mass reach, is to search for new particles and exotic phenomena. This is a continuing effort for the CDF collaboration, and will report on several searches using about 20 pb -1 from the 1992/93 run labelled open-quotes run 1aclose quotes and ∼50 of the 90 pb -1 so far from the current open-quotes run 1b.close quotes These are mostly preliminary analyses, typically using a total of 70 pb -1 . Our limits on SUSY using missing E T with jets as well as three leptons are discussed elsewhere; results from the D0 collaboration are similar. I will discuss searches for additional vector bosons Z' and W', second generation scalar leptoquarks, as well as a broad search for objects decaying into jet pairs, including b-tagged jet pairs. I will also describe two events which do not fit in comfortably with either the standard model or a phenomenologically motivated search

  4. Simulation of visual search in the natural 2-D situation

    Directory of Open Access Journals (Sweden)

    Blanka Borin

    2004-08-01

    Full Text Available The goal of this research was to imitate the process of visual search in a natural two-dimensional situation and also to investigate the influence of variable features on the speed of the visual search. The experiment was designed upon one of the most influential theories in the research field of the visual search phenomenon – The Feature Integration Theory (Treisman, 1982. Although the FIT theory claims, that in case of a larger number of synchronous targets the mechanism of attention serially directs the mental processing from one target towards another, the results of our experiment has shown the possibility of not just serial but also parallel visual search. The results of the experiment have also shown that the similarity between features of the target and its surroundings takes effect on the speed of the target recognition. If the features are very similar or if there is no difference between the target and its surroundings, the visual search for the target is longer in comparison to the visual search for the target, which features don't resemble the target's surroundings.

  5. Quantum random-walk search algorithm

    International Nuclear Information System (INIS)

    Shenvi, Neil; Whaley, K. Birgitta; Kempe, Julia

    2003-01-01

    Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O(√(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms

  6. Simulation to Support Local Search in Trajectory Optimization Planning

    Science.gov (United States)

    Morris, Robert A.; Venable, K. Brent; Lindsey, James

    2012-01-01

    NASA and the international community are investing in the development of a commercial transportation infrastructure that includes the increased use of rotorcraft, specifically helicopters and civil tilt rotors. However, there is significant concern over the impact of noise on the communities surrounding the transportation facilities. One way to address the rotorcraft noise problem is by exploiting powerful search techniques coming from artificial intelligence coupled with simulation and field tests to design low-noise flight profiles which can be tested in simulation or through field tests. This paper investigates the use of simulation based on predictive physical models to facilitate the search for low-noise trajectories using a class of automated search algorithms called local search. A novel feature of this approach is the ability to incorporate constraints directly into the problem formulation that addresses passenger safety and comfort.

  7. Use of profile hidden Markov models in viral discovery: current insights

    Directory of Open Access Journals (Sweden)

    Reyes A

    2017-07-01

    Full Text Available Alejandro Reyes,1–3 João Marcelo P Alves,4 Alan Mitchell Durham,5 Arthur Gruber4 1Department of Biological Sciences, Universidad de los Andes, Bogotá, Colombia; 2Department of Pathology and Immunology, Center for Genome Sciences and Systems Biology, Washington University in Saint Louis, St Louis, MO, USA; 3Max Planck Tandem Group in Computational Biology, Universidad de los Andes, Bogotá, Colombia; 4Department of Parasitology, Institute of Biomedical Sciences, 5Department of Computer Science, Institute of Mathematics and Statistics, Universidade de São Paulo, São Paulo, Brazil Abstract: Sequence similarity searches are the bioinformatic cornerstone of molecular sequence analysis for all domains of life. However, large amounts of divergence between organisms, such as those seen among viruses, can significantly hamper analyses. Profile hidden Markov models (profile HMMs are among the most successful approaches for dealing with this problem, which represent an invaluable tool for viral identification efforts. Profile HMMs are statistical models that convert information from a multiple sequence alignment into a set of probability values that reflect position-specific variation levels in all members of evolutionarily related sequences. Since profile HMMs represent a wide spectrum of variation, these models show higher sensitivity than conventional similarity methods such as BLAST for the detection of remote homologs. In recent years, there has been an effort to compile viral sequences from different viral taxonomic groups into integrated databases, such as Prokaryotic Virus Orthlogous Groups (pVOGs and database of profile HMMs (vFam database, which provide functional annotation, multiple sequence alignments, and profile HMMs. Since these databases rely on viral sequences collected from GenBank and RefSeq, they suffer in variable extent from uneven taxonomic sampling, with low sequence representation of many viral groups, which affects the

  8. Ensemble attribute profile clustering: discovering and characterizing groups of genes with similar patterns of biological features

    Directory of Open Access Journals (Sweden)

    Bissell MJ

    2006-03-01

    Full Text Available Abstract Background Ensemble attribute profile clustering is a novel, text-based strategy for analyzing a user-defined list of genes and/or proteins. The strategy exploits annotation data present in gene-centered corpora and utilizes ideas from statistical information retrieval to discover and characterize properties shared by subsets of the list. The practical utility of this method is demonstrated by employing it in a retrospective study of two non-overlapping sets of genes defined by a published investigation as markers for normal human breast luminal epithelial cells and myoepithelial cells. Results Each genetic locus was characterized using a finite set of biological properties and represented as a vector of features indicating attributes associated with the locus (a gene attribute profile. In this study, the vector space models for a pre-defined list of genes were constructed from the Gene Ontology (GO terms and the Conserved Domain Database (CDD protein domain terms assigned to the loci by the gene-centered corpus LocusLink. This data set of GO- and CDD-based gene attribute profiles, vectors of binary random variables, was used to estimate multiple finite mixture models and each ensuing model utilized to partition the profiles into clusters. The resultant partitionings were combined using a unanimous voting scheme to produce consensus clusters, sets of profiles that co-occured consistently in the same cluster. Attributes that were important in defining the genes assigned to a consensus cluster were identified. The clusters and their attributes were inspected to ascertain the GO and CDD terms most associated with subsets of genes and in conjunction with external knowledge such as chromosomal location, used to gain functional insights into human breast biology. The 52 luminal epithelial cell markers and 89 myoepithelial cell markers are disjoint sets of genes. Ensemble attribute profile clustering-based analysis indicated that both lists

  9. Hierarchical Matching of Traffic Information Services Using Semantic Similarity

    Directory of Open Access Journals (Sweden)

    Zongtao Duan

    2018-01-01

    Full Text Available Service matching aims to find the information similar to a given query, which has numerous applications in web search. Although existing methods yield promising results, they are not applicable for transportation. In this paper, we propose a multilevel matching method based on semantic technology, towards efficiently searching the traffic information requested. Our approach is divided into two stages: service clustering, which prunes candidate services that are not promising, and functional matching. The similarity at function level between services is computed by grouping the connections between the services into inheritance and noninheritance relationships. We also developed a three-layer framework with a semantic similarity measure that requires less time and space cost than existing method since the scale of candidate services is significantly smaller than the whole transportation network. The OWL_TC4 based service set was used to verify the proposed approach. The accuracy of offline service clustering reached 93.80%, and it reduced the response time to 651 ms when the total number of candidate services was 1000. Moreover, given the different thresholds for the semantic similarity measure, the proposed mixed matching model did better in terms of recall and precision (i.e., up to 72.7% and 80%, respectively, for more than 1000 services compared to the compared models based on information theory and taxonomic distance. These experimental results confirmed the effectiveness and validity of service matching for responding quickly and accurately to user queries.

  10. Visual search for features and conjunctions in development.

    Science.gov (United States)

    Lobaugh, N J; Cole, S; Rovet, J F

    1998-12-01

    Visual search performance was examined in three groups of children 7 to 12 years of age and in young adults. Colour and orientation feature searches and a conjunction search were conducted. Reaction time (RT) showed expected improvements in processing speed with age. Comparisons of RT's on target-present and target-absent trials were consistent with parallel search on the two feature conditions and with serial search in the conjunction condition. The RT results indicated searches for feature and conjunctions were treated similarly for children and adults. However, the youngest children missed more targets at the largest array sizes, most strikingly in conjunction search. Based on an analysis of speed/accuracy trade-offs, we suggest that low target-distractor discriminability leads to an undersampling of array elements, and is responsible for the high number of misses in the youngest children.

  11. The baryonic self similarity of dark matter

    International Nuclear Information System (INIS)

    Alard, C.

    2014-01-01

    The cosmological simulations indicates that dark matter halos have specific self-similar properties. However, the halo similarity is affected by the baryonic feedback. By using momentum-driven winds as a model to represent the baryon feedback, an equilibrium condition is derived which directly implies the emergence of a new type of similarity. The new self-similar solution has constant acceleration at a reference radius for both dark matter and baryons. This model receives strong support from the observations of galaxies. The new self-similar properties imply that the total acceleration at larger distances is scale-free, the transition between the dark matter and baryons dominated regime occurs at a constant acceleration, and the maximum amplitude of the velocity curve at larger distances is proportional to M 1/4 . These results demonstrate that this self-similar model is consistent with the basics of modified Newtonian dynamics (MOND) phenomenology. In agreement with the observations, the coincidence between the self-similar model and MOND breaks at the scale of clusters of galaxies. Some numerical experiments show that the behavior of the density near the origin is closely approximated by a Einasto profile.

  12. Functional similarities between the dictyostelium protein AprA and the human protein dipeptidyl-peptidase IV.

    Science.gov (United States)

    Herlihy, Sarah E; Tang, Yu; Phillips, Jonathan E; Gomer, Richard H

    2017-03-01

    Autocrine proliferation repressor protein A (AprA) is a protein secreted by Dictyostelium discoideum cells. Although there is very little sequence similarity between AprA and any human protein, AprA has a predicted structural similarity to the human protein dipeptidyl peptidase IV (DPPIV). AprA is a chemorepellent for Dictyostelium cells, and DPPIV is a chemorepellent for neutrophils. This led us to investigate if AprA and DPPIV have additional functional similarities. We find that like AprA, DPPIV is a chemorepellent for, and inhibits the proliferation of, D. discoideum cells, and that AprA binds some DPPIV binding partners such as fibronectin. Conversely, rAprA has DPPIV-like protease activity. These results indicate a functional similarity between two eukaryotic chemorepellent proteins with very little sequence similarity, and emphasize the usefulness of using a predicted protein structure to search a protein structure database, in addition to searching for proteins with similar sequences. © 2016 The Protein Society.

  13. Functional similarities between the dictyostelium protein AprA and the human protein dipeptidyl‐peptidase IV

    Science.gov (United States)

    Herlihy, Sarah E.; Tang, Yu; Phillips, Jonathan E.

    2017-01-01

    Abstract Autocrine proliferation repressor protein A (AprA) is a protein secreted by Dictyostelium discoideum cells. Although there is very little sequence similarity between AprA and any human protein, AprA has a predicted structural similarity to the human protein dipeptidyl peptidase IV (DPPIV). AprA is a chemorepellent for Dictyostelium cells, and DPPIV is a chemorepellent for neutrophils. This led us to investigate if AprA and DPPIV have additional functional similarities. We find that like AprA, DPPIV is a chemorepellent for, and inhibits the proliferation of, D. discoideum cells, and that AprA binds some DPPIV binding partners such as fibronectin. Conversely, rAprA has DPPIV‐like protease activity. These results indicate a functional similarity between two eukaryotic chemorepellent proteins with very little sequence similarity, and emphasize the usefulness of using a predicted protein structure to search a protein structure database, in addition to searching for proteins with similar sequences. PMID:28028841

  14. Genotypic variability and mutant identification in cicer arietinum L. by seed storage protein profiling

    International Nuclear Information System (INIS)

    Hameed, A.; Iqbal, N.; Shah, T.M.

    2012-01-01

    A collection of thirty-four chickpea genotypes, including five kabuli and twenty-nine desi, were analyzed by SDS-PAGE for seed storage protein profiling. Total soluble seed proteins were resolved on 12% gels. A low level of variability was observed in desi as compared to kabuli genotypes. Dendrogram based on electrophoretic data clustered the thirty-four genotypes in four major groups. As large number of desi genotypes illustrated identical profiles, therefore could not be differentiated on the basis of seed storage protein profiles. One kabuli genotype ILC-195 found to be the most divergent showing 86% similarity with all other genotypes. ILC-195 can be distinguished from its mutant i.e., CM-2000 and other kabuli genotypes on the basis of three peptides i.e. SSP-66, SSP-43 and SSP-39. Some proteins peptides were found to be genotype specific like SSP-26 for ICCV-92311. Uniprot and NCBI protein databases were searched for already reported and characterized seed storage proteins in chickpea. Among 33 observed peptides, only six seed storages proteins from chickpea source were available in databases. On the basis of molecular weight similarity, identified peptides were SSP-64 as Serine/Threonine dehydratase, SSP-56 as Alpha-amylase inhibitor, SSP-50 as Provicillin, SSP-39 as seed imbibition protein, SSP-35 as Isoflavane reductase and SSP-19 as lipid transport protein. Highest variability was observed in vicillin subunits and beta subunits of legumins and its polymorphic forms. In conclusion, seed storage profiling can be economically used to asses the genetic variation, phylogenetic relationship and as markers to differentiate mutants from their parents. (author)

  15. OrChem - An open source chemistry search engine for Oracle®

    Science.gov (United States)

    2009-01-01

    Background Registration, indexing and searching of chemical structures in relational databases is one of the core areas of cheminformatics. However, little detail has been published on the inner workings of search engines and their development has been mostly closed-source. We decided to develop an open source chemistry extension for Oracle, the de facto database platform in the commercial world. Results Here we present OrChem, an extension for the Oracle 11G database that adds registration and indexing of chemical structures to support fast substructure and similarity searching. The cheminformatics functionality is provided by the Chemistry Development Kit. OrChem provides similarity searching with response times in the order of seconds for databases with millions of compounds, depending on a given similarity cut-off. For substructure searching, it can make use of multiple processor cores on today's powerful database servers to provide fast response times in equally large data sets. Availability OrChem is free software and can be redistributed and/or modified under the terms of the GNU Lesser General Public License as published by the Free Software Foundation. All software is available via http://orchem.sourceforge.net. PMID:20298521

  16. OrChem - An open source chemistry search engine for Oracle(R).

    Science.gov (United States)

    Rijnbeek, Mark; Steinbeck, Christoph

    2009-10-22

    Registration, indexing and searching of chemical structures in relational databases is one of the core areas of cheminformatics. However, little detail has been published on the inner workings of search engines and their development has been mostly closed-source. We decided to develop an open source chemistry extension for Oracle, the de facto database platform in the commercial world. Here we present OrChem, an extension for the Oracle 11G database that adds registration and indexing of chemical structures to support fast substructure and similarity searching. The cheminformatics functionality is provided by the Chemistry Development Kit. OrChem provides similarity searching with response times in the order of seconds for databases with millions of compounds, depending on a given similarity cut-off. For substructure searching, it can make use of multiple processor cores on today's powerful database servers to provide fast response times in equally large data sets. OrChem is free software and can be redistributed and/or modified under the terms of the GNU Lesser General Public License as published by the Free Software Foundation. All software is available via http://orchem.sourceforge.net.

  17. Shape representation modulating the effect of motion on visual search performance.

    Science.gov (United States)

    Yang, Lindong; Yu, Ruifeng; Lin, Xuelian; Liu, Na

    2017-11-02

    The effect of motion on visual search has been extensively investigated, but that of uniform linear motion of display on search performance for tasks with different target-distractor shape representations has been rarely explored. The present study conducted three visual search experiments. In Experiments 1 and 2, participants finished two search tasks that differed in target-distractor shape representations under static and dynamic conditions. Two tasks with clear and blurred stimuli were performed in Experiment 3. The experiments revealed that target-distractor shape representation modulated the effect of motion on visual search performance. For tasks with low target-distractor shape similarity, motion negatively affected search performance, which was consistent with previous studies. However, for tasks with high target-distractor shape similarity, if the target differed from distractors in that a gap with a linear contour was added to the target, and the corresponding part of distractors had a curved contour, motion positively influenced search performance. Motion blur contributed to the performance enhancement under dynamic conditions. The findings are useful for understanding the influence of target-distractor shape representation on dynamic visual search performance when display had uniform linear motion.

  18. Permission-based Index Clustering for Secure Multi-User Search

    OpenAIRE

    Eirini C. Micheli; Giorgos Margaritis; Stergios V. Anastasiadis

    2015-01-01

    Secure keyword search in shared infrastructures prevents stored documents from leaking sensitive information to unauthorized users. A shared index provides confidentiality if it is exclusively used by users authorized to search all the indexed documents. We introduce the Lethe indexing workflow to improve query and update efficiency in secure keyword search. The Lethe workflow clusters together documents with similar sets of authorized users, and creates shared indices for configurable docume...

  19. When Gravity Fails: Local Search Topology

    Science.gov (United States)

    Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

    1997-01-01

    Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

  20. Predicting user click behaviour in search engine advertisements

    Science.gov (United States)

    Daryaie Zanjani, Mohammad; Khadivi, Shahram

    2015-10-01

    According to the specific requirements and interests of users, search engines select and display advertisements that match user needs and have higher probability of attracting users' attention based on their previous search history. New objects such as user, advertisement or query cause a deterioration of precision in targeted advertising due to their lack of history. This article surveys this challenge. In the case of new objects, we first extract similar observed objects to the new object and then we use their history as the history of new object. Similarity between objects is measured based on correlation, which is a relation between user and advertisement when the advertisement is displayed to the user. This method is used for all objects, so it has helped us to accurately select relevant advertisements for users' queries. In our proposed model, we assume that similar users behave in a similar manner. We find that users with few queries are similar to new users. We will show that correlation between users and advertisements' keywords is high. Thus, users who pay attention to advertisements' keywords, click similar advertisements. In addition, users who pay attention to specific brand names might have similar behaviours too.

  1. Patient-Centered Tools for Medication Information Search.

    Science.gov (United States)

    Wilcox, Lauren; Feiner, Steven; Elhadad, Noémie; Vawdrey, David; Tran, Tran H

    2014-05-20

    Recent research focused on online health information seeking highlights a heavy reliance on general-purpose search engines. However, current general-purpose search interfaces do not necessarily provide adequate support for non-experts in identifying suitable sources of health information. Popular search engines have recently introduced search tools in their user interfaces for a range of topics. In this work, we explore how such tools can support non-expert, patient-centered health information search. Scoping the current work to medication-related search, we report on findings from a formative study focused on the design of patient-centered, medication-information search tools. Our study included qualitative interviews with patients, family members, and domain experts, as well as observations of their use of Remedy, a technology probe embodying a set of search tools. Post-operative cardiothoracic surgery patients and their visiting family members used the tools to find information about their hospital medications and were interviewed before and after their use. Domain experts conducted similar search tasks and provided qualitative feedback on their preferences and recommendations for designing these tools. Findings from our study suggest the importance of four valuation principles underlying our tools: credibility, readability, consumer perspective, and topical relevance.

  2. An information search model for online social Networks - MOBIRSE

    Directory of Open Access Journals (Sweden)

    Miguel Angel Niño Zambrano

    2015-09-01

    Full Text Available Online Social Networks (OSNs have been gaining great importance among Internet users in recent years.  These are sites where it is possible to meet people, publish, and share content in a way that is both easy and free of charge. As a result, the volume of information contained in these websites has grown exponentially, and web search has consequently become an important tool for users to easily find information relevant to their social networking objectives. Making use of ontologies and user profiles can make these searches more effective. This article presents a model for Information Retrieval in OSNs (MOBIRSE based on user profile and ontologies which aims to improve the relevance of retrieved information on these websites. The social network Facebook was chosen for a case study and as the instance for the proposed model. The model was validated using measures such as At-k Precision and Kappa statistics, to assess its efficiency.

  3. A survey on visual information search behavior and requirements of radiologists.

    Science.gov (United States)

    Markonis, D; Holzer, M; Dungs, S; Vargas, A; Langs, G; Kriewel, S; Müller, H

    2012-01-01

    The main objective of this study is to learn more on the image use and search requirements of radiologists. These requirements will then be taken into account to develop a new search system for images and associated meta data search in the Khresmoi project. Observations of the radiology workflow, case discussions and a literature review were performed to construct a survey form that was given online and in paper form to radiologists. Eye tracking was performed on a radiology viewing station to analyze typical tasks and to complement the survey. In total 34 radiologists answered the survey online or on paper. Image search was mentioned as a frequent and common task, particularly for finding cases of interest for differential diagnosis. Sources of information besides the Internet are books and discussions with colleagues. Search for images is unsuccessful in around 25% of the cases, stopping the search after around 10 minutes. The most common reason for failure is that target images are considered rare. Important additions for search requested in the survey are filtering by pathology and modality, as well as search for visually similar images and cases. Few radiologists are familiar with visual retrieval but they desire the option to upload images for searching similar ones. Image search is common in radiology but few radiologists are fully aware of visual information retrieval. Taking into account the many unsuccessful searches and time spent for this, a good image search could improve the situation and help in clinical practice.

  4. Impaired eye region search accuracy in children with autistic spectrum disorders.

    Directory of Open Access Journals (Sweden)

    John R Pruett

    Full Text Available To explore mechanisms underlying reduced fixation of eyes in autism, children with autistic spectrum disorders (ASD and typically developing children were tested in five visual search experiments: simple color feature; color-shape conjunction; face in non-face objects; mouth region; and eye region. No group differences were found for reaction time profile shapes in any of the five experiments, suggesting intact basic search mechanics in children with ASD. Contrary to early reports in the literature, but consistent with other more recent findings, we observed no superiority for conjunction search in children with ASD. Importantly, children with ASD did show reduced accuracy for eye region search (p = .005, suggesting that eyes contribute less to high-level face representations in ASD or that there is an eye region-specific disruption to attentional processes engaged by search in ASD.

  5. Impaired eye region search accuracy in children with autistic spectrum disorders.

    Science.gov (United States)

    Pruett, John R; Hoertel, Sarah; Constantino, John N; Moll, Angela LaMacchia; McVey, Kelly; Squire, Emma; Feczko, Eric; Povinelli, Daniel J; Petersen, Steven E

    2013-01-01

    To explore mechanisms underlying reduced fixation of eyes in autism, children with autistic spectrum disorders (ASD) and typically developing children were tested in five visual search experiments: simple color feature; color-shape conjunction; face in non-face objects; mouth region; and eye region. No group differences were found for reaction time profile shapes in any of the five experiments, suggesting intact basic search mechanics in children with ASD. Contrary to early reports in the literature, but consistent with other more recent findings, we observed no superiority for conjunction search in children with ASD. Importantly, children with ASD did show reduced accuracy for eye region search (p = .005), suggesting that eyes contribute less to high-level face representations in ASD or that there is an eye region-specific disruption to attentional processes engaged by search in ASD.

  6. Best matching Barenblatt profiles are delayed

    International Nuclear Information System (INIS)

    Dolbeault, Jean; Toscani, Giuseppe

    2015-01-01

    The growth of the second moments of the solutions of fast diffusion equations is asymptotically governed by the behavior of self-similar solutions. However, at next order, there is a correction term which amounts to a delay depending on the nonlinearity and on a distance of the initial data to the set of self-similar Barenblatt solutions. This distance can be measured in terms of a relative entropy to the best matching Barenblatt profile. This best matching Barenblatt function determines a scale. In new variables based on this scale, which are given by a self-similar change of variables if and only if the initial datum is one of the Barenblatt profiles, the typical scale is monotone and has a limit. Coming back to original variables, the best matching Barenblatt profile is delayed compared to the self-similar solution with same initial second moment as the initial datum. Such a delay is a new phenomenon, which has to be taken into account for instance when fitting experimental data. (paper)

  7. Scaling, Similarity, and the Fourth Paradigm for Hydrology

    Science.gov (United States)

    Peters-Lidard, Christa D.; Clark, Martyn; Samaniego, Luis; Verhoest, Niko E. C.; van Emmerik, Tim; Uijlenhoet, Remko; Achieng, Kevin; Franz, Trenton E.; Woods, Ross

    2017-01-01

    In this synthesis paper addressing hydrologic scaling and similarity, we posit that roadblocks in the search for universal laws of hydrology are hindered by our focus on computational simulation (the third paradigm), and assert that it is time for hydrology to embrace a fourth paradigm of data-intensive science. Advances in information-based hydrologic science, coupled with an explosion of hydrologic data and advances in parameter estimation and modelling, have laid the foundation for a data-driven framework for scrutinizing hydrological scaling and similarity hypotheses. We summarize important scaling and similarity concepts (hypotheses) that require testing, describe a mutual information framework for testing these hypotheses, describe boundary condition, state flux, and parameter data requirements across scales to support testing these hypotheses, and discuss some challenges to overcome while pursuing the fourth hydrological paradigm. We call upon the hydrologic sciences community to develop a focused effort towards adopting the fourth paradigm and apply this to outstanding challenges in scaling and similarity.

  8. Fibromyalgia and neuropathic pain - differences and similarities. A comparison of 3057 patients with diabetic painful neuropathy and fibromyalgia

    Science.gov (United States)

    2011-01-01

    Background Patients with diabetic neuropathy (DPN) and fibromyalgia differ substantially in pathogenetic factors and the spatial distribution of the perceived pain. We questioned whether, despite these obvious differences, similar abnormal sensory complaints and pain qualities exist in both entities. We hypothesized that similar sensory symptoms might be associated with similar mechanisms of pain generation. The aims were (1) to compare epidemiological features and co-morbidities and (2) to identify similarities and differences of sensory symptoms in both entities. Methods The present multi-center study compares epidemiological data and sensory symptoms of a large cohort of 1434 fibromyalgia patients and 1623 patients with painful diabetic neuropathy. Data acquisition included standard demographic questions and self-report questionnaires (MOS sleep scale, PHQ-9, PainDETECT). To identify subgroups of patients with characteristic combinations of symptoms (sensory profiles) a cluster analysis was performed using all patients in both cohorts. Results Significant differences in co-morbidities (depression, sleep disturbance) were found between both disorders. Patients of both aetiologies chose very similar descriptors to characterize their sensory perceptions. Burning pain, prickling and touch-evoked allodynia were present in the same frequency. Five subgroups with distinct symptom profiles could be detected. Two of the subgroups were characteristic for fibromyalgia whereas one profile occurred predominantly in DPN patients. Two profiles were found frequently in patients of both entities (20-35%). Conclusions DPN and fibromyalgia patients experience very similar sensory phenomena. The combination of sensory symptoms - the sensory profile - is in most cases distinct and almost unique for each one of the two entities indicating aetiology-specific mechanisms of symptom generation. Beside the unique aetiology-specific sensory profiles an overlap of sensory profiles can be

  9. SA-Search: a web tool for protein structure mining based on a Structural Alphabet.

    Science.gov (United States)

    Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre

    2004-07-01

    SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of fast 3D similarity searches such as the extraction of exact words using a suffix tree approach, and the search for fuzzy words viewed as a simple 1D sequence alignment problem. SA-Search is available at http://bioserv.rpbs.jussieu.fr/cgi-bin/SA-Search.

  10. Prevalence of Stress References on College Freshmen Facebook Profiles

    OpenAIRE

    EGAN, KATIE G.; MORENO, MEGAN A.

    2011-01-01

    Stress is common among college students and associated with adverse health outcomes. This study used the social networking Web site Facebook to identify self-reported stress and associated conditions among college students. Public Facebook profiles of undergraduate freshman at a large Midwestern State University (n = 300) were identified using a Facebook search. Content analysis of Facebook profiles included demographic information and displayed references to stress, weight concerns, depressi...

  11. Object recognition based on Google's reverse image search and image similarity

    Science.gov (United States)

    Horváth, András.

    2015-12-01

    Image classification is one of the most challenging tasks in computer vision and a general multiclass classifier could solve many different tasks in image processing. Classification is usually done by shallow learning for predefined objects, which is a difficult task and very different from human vision, which is based on continuous learning of object classes and one requires years to learn a large taxonomy of objects which are not disjunct nor independent. In this paper I present a system based on Google image similarity algorithm and Google image database, which can classify a large set of different objects in a human like manner, identifying related classes and taxonomies.

  12. Interactive searching of facial image databases

    Science.gov (United States)

    Nicholls, Robert A.; Shepherd, John W.; Shepherd, Jean

    1995-09-01

    A set of psychological facial descriptors has been devised to enable computerized searching of criminal photograph albums. The descriptors have been used to encode image databased of up to twelve thousand images. Using a system called FACES, the databases are searched by translating a witness' verbal description into corresponding facial descriptors. Trials of FACES have shown that this coding scheme is more productive and efficient than searching traditional photograph albums. An alternative method of searching the encoded database using a genetic algorithm is currenly being tested. The genetic search method does not require the witness to verbalize a description of the target but merely to indicate a degree of similarity between the target and a limited selection of images from the database. The major drawback of FACES is that is requires a manual encoding of images. Research is being undertaken to automate the process, however, it will require an algorithm which can predict human descriptive values. Alternatives to human derived coding schemes exist using statistical classifications of images. Since databases encoded using statistical classifiers do not have an obvious direct mapping to human derived descriptors, a search method which does not require the entry of human descriptors is required. A genetic search algorithm is being tested for such a purpose.

  13. Stage III & IV colon and rectal cancers share a similar genetic profile: a review of the Oregon Colorectal Cancer Registry.

    Science.gov (United States)

    Gawlick, Ute; Lu, Kim C; Douthit, Miriam A; Diggs, Brian S; Schuff, Kathryn G; Herzig, Daniel O; Tsikitis, Vassiliki L

    2013-05-01

    Determining the molecular profile of colon and rectal cancers offers the possibility of personalized cancer treatment. The purpose of this study was to determine whether known genetic mutations associated with colorectal carcinogenesis differ between colon and rectal cancers and whether they are associated with survival. The Oregon Colorectal Cancer Registry is a prospectively maintained, institutional review board-approved tissue repository with associated demographic and clinical information. The registry was queried for any patient with molecular analysis paired with clinical data. Patient demographics, tumor characteristics, microsatellite instability status, and mutational analysis for p53, AKT, BRAF, KRAS, MET, NRAS, and PIK3CA were analyzed. Categorical variables were compared using chi-square tests. Continuous variables between groups were analyzed using Mann-Whitney U tests. Kaplan-Meier analysis was used for survival studies. Comparisons of survival were made using log-rank tests. The registry included 370 patients: 69% with colon cancer and 31% with rectal cancer. Eighty percent of colon cancers and 68% of rectal cancers were stages III and IV. Mutational analysis found no significant differences in detected mutations between colon and rectal cancers, except that there were significantly more BRAF mutations in colon cancers compared with rectal cancers (10% vs 0%, P colon versus rectal cancers when stratified by the presence of KRAS, PIK3CA, and BRAF mutations. Stage III and IV colon and rectal cancers share similar molecular profiles, except that there were significantly more BRAF mutations in colon cancers compared with rectal cancers. Copyright © 2013 Elsevier Inc. All rights reserved.

  14. Solving Large Clustering Problems with Meta-Heuristic Search

    DEFF Research Database (Denmark)

    Turkensteen, Marcel; Andersen, Kim Allan; Bang-Jensen, Jørgen

    In Clustering Problems, groups of similar subjects are to be retrieved from data sets. In this paper, Clustering Problems with the frequently used Minimum Sum-of-Squares Criterion are solved using meta-heuristic search. Tabu search has proved to be a successful methodology for solving optimization...... problems, but applications to large clustering problems are rare. The simulated annealing heuristic has mainly been applied to relatively small instances. In this paper, we implement tabu search and simulated annealing approaches and compare them to the commonly used k-means approach. We find that the meta-heuristic...

  15. Report of the 1997 LEP2 working group on 'searches'

    International Nuclear Information System (INIS)

    Allanach, B.C.; Blair, G.A.; Diaz, M.A.

    1997-08-01

    A number of research program reports are presented from the LEP2 positron-electron collider in the area of searches for Higgs bosons, supersymmetry and supergravity. Working groups' reports cover prospective sensitivity of Higgs boson searches, radiative corrections to chargino production, charge and colour breaking minima in minimal Supersymmetric Standard Model, R-party violation effects upon unification predictions, searches for new pair-produced particles, single sneutrino production and searches related to effects similar to HERA experiments. The final section of the report summarizes the LEP 2 searches, concentrating on gians from running at 200 GeV and alternative paradigms for supersymmetric phenomenology. (UK)

  16. Self-similar solutions for toroidal magnetic fields in a turbulent jet

    International Nuclear Information System (INIS)

    Komissarov, S.S.; Ovchinnikov, I.L.

    1989-01-01

    Self-similar solutions for weak toroidal magnetic fields transported by a turbulent jet of incompressible fluid are obtained. It is shown that radial profiles of the self-similar solutions form a discrete spectrum of eigenfunctions of a linear differential operator. The strong depatures from the magnetic flux conservation law, used frequently in turbulent jet models for extragalactic radio sources, are found

  17. Visual Fashion-Product Search at SK Planet

    OpenAIRE

    Kim, Taewan; Kim, Seyeong; Na, Sangil; Kim, Hayoon; Kim, Moonki; Jeon, Byoung-Ki

    2016-01-01

    We build a large-scale visual search system which finds similar product images given a fashion item. Defining similarity among arbitrary fashion-products is still remains a challenging problem, even there is no exact ground-truth. To resolve this problem, we define more than 90 fashion-related attributes, and combination of these attributes can represent thousands of unique fashion-styles. The fashion-attributes are one of the ingredients to define semantic similarity among fashion-product im...

  18. Automatic Planning of External Search Engine Optimization

    Directory of Open Access Journals (Sweden)

    Vita Jasevičiūtė

    2015-07-01

    Full Text Available This paper describes an investigation of the external search engine optimization (SEO action planning tool, dedicated to automatically extract a small set of most important keywords for each month during whole year period. The keywords in the set are extracted accordingly to external measured parameters, such as average number of searches during the year and for every month individually. Additionally the position of the optimized web site for each keyword is taken into account. The generated optimization plan is similar to the optimization plans prepared manually by the SEO professionals and can be successfully used as a support tool for web site search engine optimization.

  19. SANSparallel: interactive homology search against Uniprot.

    Science.gov (United States)

    Somervuo, Panu; Holm, Liisa

    2015-07-01

    Proteins evolve by mutations and natural selection. The network of sequence similarities is a rich source for mining homologous relationships that inform on protein structure and function. There are many servers available to browse the network of homology relationships but one has to wait up to a minute for results. The SANSparallel webserver provides protein sequence database searches with immediate response and professional alignment visualization by third-party software. The output is a list, pairwise alignment or stacked alignment of sequence-similar proteins from Uniprot, UniRef90/50, Swissprot or Protein Data Bank. The stacked alignments are viewed in Jalview or as sequence logos. The database search uses the suffix array neighborhood search (SANS) method, which has been re-implemented as a client-server, improved and parallelized. The method is extremely fast and as sensitive as BLAST above 50% sequence identity. Benchmarks show that the method is highly competitive compared to previously published fast database search programs: UBLAST, DIAMOND, LAST, LAMBDA, RAPSEARCH2 and BLAT. The web server can be accessed interactively or programmatically at http://ekhidna2.biocenter.helsinki.fi/cgi-bin/sans/sans.cgi. It can be used to make protein functional annotation pipelines more efficient, and it is useful in interactive exploration of the detailed evidence supporting the annotation of particular proteins of interest. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

  20. Effective Filtering of Query Results on Updated User Behavioral Profiles in Web Mining

    Directory of Open Access Journals (Sweden)

    S. Sadesh

    2015-01-01

    Full Text Available Web with tremendous volume of information retrieves result for user related queries. With the rapid growth of web page recommendation, results retrieved based on data mining techniques did not offer higher performance filtering rate because relationships between user profile and queries were not analyzed in an extensive manner. At the same time, existing user profile based prediction in web data mining is not exhaustive in producing personalized result rate. To improve the query result rate on dynamics of user behavior over time, Hamilton Filtered Regime Switching User Query Probability (HFRS-UQP framework is proposed. HFRS-UQP framework is split into two processes, where filtering and switching are carried out. The data mining based filtering in our research work uses the Hamilton Filtering framework to filter user result based on personalized information on automatic updated profiles through search engine. Maximized result is fetched, that is, filtered out with respect to user behavior profiles. The switching performs accurate filtering updated profiles using regime switching. The updating in profile change (i.e., switches regime in HFRS-UQP framework identifies the second- and higher-order association of query result on the updated profiles. Experiment is conducted on factors such as personalized information search retrieval rate, filtering efficiency, and precision ratio.

  1. Parallel Harmony Search Based Distributed Energy Resource Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Ceylan, Oguzhan [ORNL; Liu, Guodong [ORNL; Tomsovic, Kevin [University of Tennessee, Knoxville (UTK)

    2015-01-01

    This paper presents a harmony search based parallel optimization algorithm to minimize voltage deviations in three phase unbalanced electrical distribution systems and to maximize active power outputs of distributed energy resources (DR). The main contribution is to reduce the adverse impacts on voltage profile during a day as photovoltaics (PVs) output or electrical vehicles (EVs) charging changes throughout a day. The IEEE 123- bus distribution test system is modified by adding DRs and EVs under different load profiles. The simulation results show that by using parallel computing techniques, heuristic methods may be used as an alternative optimization tool in electrical power distribution systems operation.

  2. Folksonomical P2P File Sharing Networks Using Vectorized KANSEI Information as Search Tags

    Science.gov (United States)

    Ohnishi, Kei; Yoshida, Kaori; Oie, Yuji

    We present the concept of folksonomical peer-to-peer (P2P) file sharing networks that allow participants (peers) to freely assign structured search tags to files. These networks are similar to folksonomies in the present Web from the point of view that users assign search tags to information distributed over a network. As a concrete example, we consider an unstructured P2P network using vectorized Kansei (human sensitivity) information as structured search tags for file search. Vectorized Kansei information as search tags indicates what participants feel about their files and is assigned by the participant to each of their files. A search query also has the same form of search tags and indicates what participants want to feel about files that they will eventually obtain. A method that enables file search using vectorized Kansei information is the Kansei query-forwarding method, which probabilistically propagates a search query to peers that are likely to hold more files having search tags that are similar to the query. The similarity between the search query and the search tags is measured in terms of their dot product. The simulation experiments examine if the Kansei query-forwarding method can provide equal search performance for all peers in a network in which only the Kansei information and the tendency with respect to file collection are different among all of the peers. The simulation results show that the Kansei query forwarding method and a random-walk-based query forwarding method, for comparison, work effectively in different situations and are complementary. Furthermore, the Kansei query forwarding method is shown, through simulations, to be superior to or equal to the random-walk based one in terms of search speed.

  3. Self-similar solutions for multi-species plasma mixing by gradient driven transport

    Science.gov (United States)

    Vold, E.; Kagan, G.; Simakov, A. N.; Molvig, K.; Yin, L.

    2018-05-01

    Multi-species transport of plasma ions across an initial interface between DT and CH is shown to exhibit self-similar species density profiles under 1D isobaric conditions. Results using transport theory from recent studies and using a Maxwell–Stephan multi-species approximation are found to be in good agreement for the self-similar mix profiles of the four ions under isothermal and isobaric conditions. The individual ion species mass flux and molar flux profile results through the mixing layer are examined using transport theory. The sum over species mass flux is confirmed to be zero as required, and the sum over species molar flux is related to a local velocity divergence needed to maintain pressure equilibrium during the transport process. The light ion species mass fluxes are dominated by the diagonal coefficients of the diffusion transport matrix, while for the heaviest ion species (C in this case), the ion flux with only the diagonal term is reduced by about a factor two from that using the full diffusion matrix, implying the heavy species moves more by frictional collisions with the lighter species than by its own gradient force. Temperature gradient forces were examined by comparing profile results with and without imposing constant temperature gradients chosen to be of realistic magnitude for ICF experimental conditions at a fuel-capsule interface (10 μm scale length or greater). The temperature gradients clearly modify the relative concentrations of the ions, for example near the fuel center, however the mixing across the fuel-capsule interface appears to be minimally influenced by the temperature gradient forces within the expected compression and burn time. Discussion considers the application of the self-similar profiles to specific conditions in ICF.

  4. Towards Efficient Search for Activity Trajectories

    DEFF Research Database (Denmark)

    Zheng, Kai; Shang, Shuo; Yuan, Jing

    2013-01-01

    , recent proliferation in location-based web applications (e.g., Foursquare, Facebook) has given rise to large amounts of trajectories associated with activity information, called activity trajectory. In this paper, we study the problem of efficient similarity search on activity trajectory database. Given...

  5. VPD residue search by monitoring scattered x-rays

    International Nuclear Information System (INIS)

    Mori, Y.; Yamagami, M.; Yamada, T.

    2000-01-01

    Recently, VPD-TXRF has come into wide use for semiconductor analysis. In VPD-TXRF technique, adjusting the mechanical measuring point to the center of dried residue is of importance for accurate determination. Until now, the following searching methods have been used: monitoring light scattering under bright illumination, using laser scattering particle mapper, applying internal standard as a marker. However, each method has individual disadvantage. For example, interference of Kβ line (ex. Sc-Kβ to Ti-Kα) occurs in the internal standard method. We propose a new searching method 'scattered x-ray search' which utilizes x-ray scattering form the dried residue as a marker. Since the line profile of x-ray scattering agrees with that of fluorescent x-rays, scattered x-ray can be used as an alternative marker instead of internal standard. According to our experimental results, this search method shows the same accuracy as internal standard method. The merits are as follows: 1) no need to add internal standard, 2) rapid search because of high intensity of scattered x-rays, 3) searching software for internal standard can be applied without any modification. In this method, diffraction of incident x-rays by substrate causes irregular change over the detected scattering x-rays. Therefore, this method works better under x-y controlled stage than r-Θ one. (author)

  6. Vocational Interests (The Self-Directed Search) of Female Carpenters

    Science.gov (United States)

    Swan, Kathy C.

    2005-01-01

    In this national sample of female carpenters (N=411) who began their apprenticeship with the United Brotherhood of Carpenters during the 1990s in the United States, the author provides a profile of female carpenters' vocational interests (The Self-Directed Search). The vocational interests of 137 male carpenters also were gathered for comparison.…

  7. Identification and Analysis of Multi-tasking Product Information Search Sessions with Query Logs

    Directory of Open Access Journals (Sweden)

    Xiang Zhou

    2016-09-01

    Full Text Available Purpose: This research aims to identify product search tasks in online shopping and analyze the characteristics of consumer multi-tasking search sessions. Design/methodology/approach: The experimental dataset contains 8,949 queries of 582 users from 3,483 search sessions. A sequential comparison of the Jaccard similarity coefficient between two adjacent search queries and hierarchical clustering of queries is used to identify search tasks. Findings: (1 Users issued a similar number of queries (1.43 to 1.47 with similar lengths (7.3-7.6 characters per task in mono-tasking and multi-tasking sessions, and (2 Users spent more time on average in sessions with more tasks, but spent less time for each task when the number of tasks increased in a session. Research limitations: The task identification method that relies only on query terms does not completely reflect the complex nature of consumer shopping behavior. Practical implications: These results provide an exploratory understanding of the relationships among multiple shopping tasks, and can be useful for product recommendation and shopping task prediction. Originality/value: The originality of this research is its use of query clustering with online shopping task identification and analysis, and the analysis of product search session characteristics.

  8. Self-Similarity and helical symmetry in vortex generator flow simulations

    DEFF Research Database (Denmark)

    Fernandez, U.; Velte, Clara Marika; Réthoré, Pierre-Elouan

    2014-01-01

    According to experimental observations, the vortices generated by vortex generators have previously been observed to be self-similar for both the axial (uz) and azimuthal (uӨ) velocity profiles. Further, the measured vortices have been observed to obey the criteria for helical symmetry...

  9. Similarities and differences in borderline and organic personality disorder.

    Science.gov (United States)

    Mathiesen, Birgit B; Simonsen, Erik; Soegaard, Ulf; Kvist, Kajsa

    2014-01-01

    Previous research has shown that brain injury patients with Organic Personality Disorder (OPD) may display "borderline" traits due to prefrontal damage, and their personality structure may be unstable and close to a borderline personality organisation. They may have few general neuropsychological dysfunctions but specific executive deficits. Similar deficits have been found in patients with Borderline Personality Disorder (BPD). The objective of this study was to identify differences and similarities between the neuropsychological and personality profiles of BPD and OPD patients. Twenty BPD patients and 24 OPD patients were assessed with the Structured Clinical Interview for DSM-IV Axis II Disorders (SCID-II), the Karolinska Psychodynamic Profile (KAPP), and a comprehensive neuropsychological test battery. Very few neuropsychological differences were found between the two patient groups. However, the verbal fluency, verbal intelligence, verbal memory, and immediate auditory memory/attention of the BPD patients were significantly poorer than the OPD patients'. The KAPP profiles of the BPD patients showed significantly poorer functioning in three areas: frustration tolerance, the body as a factor of self-esteem, and overall personality organisation. These results support our clinical experience and expectations concerning the severity of symptoms of both patient groups. We suggest considering in depth assessments of both neuropsychological and personality-related problems for each of these patients in order to inform treatment.

  10. Quantifying the Search Behaviour of Different Demographics Using Google Correlate

    Science.gov (United States)

    Letchford, Adrian; Preis, Tobias; Moat, Helen Susannah

    2016-01-01

    Vast records of our everyday interests and concerns are being generated by our frequent interactions with the Internet. Here, we investigate how the searches of Google users vary across U.S. states with different birth rates and infant mortality rates. We find that users in states with higher birth rates search for more information about pregnancy, while those in states with lower birth rates search for more information about cats. Similarly, we find that users in states with higher infant mortality rates search for more information about credit, loans and diseases. Our results provide evidence that Internet search data could offer new insight into the concerns of different demographics. PMID:26910464

  11. On the homogeneity and heterogeneity of cortical thickness profiles in Homo sapiens sapiens.

    Science.gov (United States)

    Koten, Jan Willem; Schüppen, André; Morozova, Maria; Lehofer, Agnes; Koschutnig, Karl; Wood, Guilherme

    2017-12-20

    Cortical thickness has been investigated since the beginning of the 20th century, but we do not know how similar the cortical thickness profiles among humans are. In this study, the local similarity of cortical thickness profiles was investigated using sliding window methods. Here, we show that approximately 5% of the cortical thickness profiles are similarly expressed among humans while 45% of the cortical thickness profiles show a high level of heterogeneity. Therefore, heterogeneity is the rule, not the exception. Cortical thickness profiles of somatosensory homunculi and the anterior insula are consistent among humans, while the cortical thickness profiles of the motor homunculus are more variable. Cortical thickness profiles of homunculi that code for muscle position and skin stimulation are highly similar among humans despite large differences in sex, education, and age. This finding suggests that the structure of these cortices remains well preserved over a lifetime. Our observations possibly relativize opinions on cortical plasticity.

  12. How to improve your PubMed/MEDLINE searches: 2. display settings, complex search queries and topic searching.

    Science.gov (United States)

    Fatehi, Farhad; Gray, Leonard C; Wootton, Richard

    2014-01-01

    The way that PubMed results are displayed can be changed using the Display Settings drop-down menu in the result screen. There are three groups of options: Format, Items per page and Sort by, which allow a good deal of control. The results from several searches can be temporarily stored on the Clipboard. Records of interest can be selected on the results page using check boxes and can then be combined, for example to form a reference list. The Related Citations is a valuable feature of PubMed that can provide a set of similar articles when you have identified a record of interest among the results. You can easily search for RCTs or reviews using the appropriate filters or field tags. If you are interested in clinical articles, rather than basic science or health service research, then the Clinical Queries tool on the PubMed home page can be used to retrieve them.

  13. Claim Assessment Profile: A Method for Capturing Healthcare Evidence in the Scientific Evaluation and Review of Claims in Health Care (SEaRCH).

    Science.gov (United States)

    Hilton, Lara; Jonas, Wayne B

    2017-02-01

    Grounding health claims in an evidence base is essential for determining safety and effectiveness. However, it is not appropriate to evaluate all healthcare claims with the same methods. "Gold standard" randomized controlled trials may skip over important qualitative and observational data about use, benefits, side effects, and preferences, issues especially salient in research on complementary and integrative health (CIH) practices. This gap has prompted a move toward studying treatments in their naturalistic settings. In the 1990s, a program initiated under the National Institutes of Health was designed to provide an outreach to CIH practices for assessing the feasibility of conducting retrospective or prospective evaluations. The Claim Assessment Profile further develops this approach, within the framework of Samueli Institute's Scientific Evaluation and Review of Claims in Health Care (SEaRCH) method. The goals of a Claim Assessment Profile are to clarify the elements that constitute a practice, define key outcomes, and create an explanatory model of these impacts. The main objective is to determine readiness and capacity of a practice to engage in evaluation of effectiveness. This approach is informed by a variety of rapid assessment and stakeholder-driven methods. Site visits, structured qualitative interviews, surveys, and observational data on implementation provide descriptive data about the practice. Logic modeling defines inputs, processes, and outcome variables; Path modeling defines an analytic map to explore. The Claim Assessment Profile is a rapid assessment of the evaluability of a healthcare practice. The method was developed for use on CIH practices but has also been applied in resilience research and may be applied beyond the healthcare sector. Findings are meant to provide sufficient data to improve decision-making for stakeholders. This method provides an important first step for moving existing promising yet untested practices into

  14. THE FUTILE SEARCH FOR GALACTIC DISK DARK MATTER

    International Nuclear Information System (INIS)

    Garrido Pestana, Jose Luis; Eckhardt, Donald H.

    2010-01-01

    Several approaches have been used to search for dark matter in our galactic disk, but with mixed results: maybe yes and maybe no. The prevailing approach, integrating the Poisson-Boltzmann equation for tracer stars, has led to more definitive results: yes and no. The touchstone 'yes' analysis of Bahcall et al. has subsequently been confirmed or refuted by various other investigators. This has been our motivation for approaching the search from a different direction: applying the virial theorem to extant data. We conclude that the vertical density profile of the disk is not in a state of equilibrium and, therefore, that the Poisson-Boltzmann approach is inappropriate and it thereby leads to indefensible conclusions.

  15. CBCL Pediatric Bipolar Disorder Profile and ADHD: Comorbidity and Quantitative Trait Loci Analysis

    Science.gov (United States)

    McGough, James J.; Loo, Sandra K.; McCracken, James T.; Dang, Jeffery; Clark, Shaunna; Nelson, Stanley F.; Smalley, Susan L.

    2008-01-01

    The pediatric bipolar disorder profile of the Child Behavior checklist is used to differentiate patterns of comorbidity and to search for quantitative trait loci in multiple affected ADHD sibling pairs. The CBCL-PBD profiling identified 8 percent of individuals with severe psychopathology and increased rates of oppositional defiant, conduct and…

  16. Search for SUSY in gauge mediated and anomaly mediated supersymmetry breaking models

    International Nuclear Information System (INIS)

    Nunnnemann, Thomas

    2004-01-01

    In this note, recent results on the search for Gauge Mediated Supersymmetry Breaking (GMSB) and Anomaly Mediated Supersymmetry Breaking (AMSB) at the LEP and Tevatron colliders are summarized. We report on DOe's search for GMSB in di-photon events with large missing transverse energy and discuss the sensitivity of similar searches based on future Tevatron integrated luminosities. (orig.)

  17. Assessing Analytical Similarity of Proposed Amgen Biosimilar ABP 501 to Adalimumab.

    Science.gov (United States)

    Liu, Jennifer; Eris, Tamer; Li, Cynthia; Cao, Shawn; Kuhns, Scott

    2016-08-01

    ABP 501 is being developed as a biosimilar to adalimumab. Comprehensive comparative analytical characterization studies have been conducted and completed. The objective of this study was to assess analytical similarity between ABP 501 and two adalimumab reference products (RPs), licensed by the United States Food and Drug Administration (adalimumab [US]) and authorized by the European Union (adalimumab [EU]), using state-of-the-art analytical methods. Comprehensive analytical characterization incorporating orthogonal analytical techniques was used to compare products. Physicochemical property comparisons comprised the primary structure related to amino acid sequence and post-translational modifications including glycans; higher-order structure; primary biological properties mediated by target and receptor binding; product-related substances and impurities; host-cell impurities; general properties of the finished drug product, including strength and formulation; subvisible and submicron particles and aggregates; and forced thermal degradation. ABP 501 had the same amino acid sequence and similar post-translational modification profiles compared with adalimumab RPs. Primary structure, higher-order structure, and biological activities were similar for the three products. Product-related size and charge variants and aggregate and particle levels were also similar. ABP 501 had very low residual host-cell protein and DNA. The finished ABP 501 drug product has the same strength with regard to protein concentration and fill volume as adalimumab RPs. ABP 501 and the RPs had a similar stability profile both in normal storage and thermal stress conditions. Based on the comprehensive analytical similarity assessment, ABP 501 was found to be similar to adalimumab with respect to physicochemical and biological properties.

  18. Plasmid profilling and similarities in identities of probable microbes isolated from crude oil contaminated agricultural soil

    Directory of Open Access Journals (Sweden)

    Toochukwu Ekwutosi OGBULIE

    2013-05-01

    Full Text Available Plasmid analysis of bacteria isolated from agricultural soil experimentally contaminated with crude oil was carried out and the resultant bands’ depicting the different molecular sizes of the plasmid DNA molecules per isolate was obtained. There was no visible band observed for Klebsiella indicating that the organism lack plasmid DNA that confers degradative ability to it, possibly the gene could be borne on the chromosomal DNA which enabled its persistence in the polluted soil. Molecular characterization was undertaken to confirm the identities of the possible microorganisms that may be present in crude oil-contaminated soil. The result of the DNA extracted and amplified in a PCR using EcoRI and EcoRV restriction enzymes for cutting the DNA of the bacterial cells indicated no visible band for cuts made with EcoRV restriction enzyme showing that the enzyme is not specific for bacterial DNA of isolates in the samples, hence there was no amplification. By contrast though, visible bands of amplicons were observed using EcoRI restriction enzymes. The resultant visible bands of microbial profile obtained using the universal RAPD primer with nucleotide sequence of 5’—CTC AAA GCA TCT AGG TCC A---3’ showed that only Pseudomonas fluorescens and Bacillus mycoides had visible bands at identical position on the gel indicating that both species possibly had identical sequence or genes of negligible differences coding for degradation of hydrocarbons as shown by similar values in molecular weight and positions in the gel electrophoresis field.

  19. Stationary neoclassical profiles of plasma parameters in stellarators

    International Nuclear Information System (INIS)

    Danilkin, I.S.; Mineev, A.B.

    1991-01-01

    The properties of the neoclassical model of heat and particle transport are considered in connection with calculations of stationary profiles of the plasma parameters in stellarators. The most important feature is the poor agreement with real physical conditions of the boundary, which imposes the necessity of invoking either an additional anomalous transport or a special (although technically possible) consistency between the particle and heat sources in order to obtain a solution in the form of a correct monotonically decreasing profile. In search for monotonic stationary profiles maintained by external sources, it is ascertained that the neoclassical theory does not give rise to the well-known multivalued solutions for the ambipolar electric field

  20. Polar solar panels: Arctic and Antarctic microbiomes display similar taxonomic profiles.

    Science.gov (United States)

    Tanner, Kristie; Martí, Jose Manuel; Belliure, Josabel; Fernández-Méndez, Mar; Molina-Menor, Esther; Peretó, Juli; Porcar, Manuel

    2018-02-01

    Solar panels located on high (Arctic and Antarctic) latitudes combine the harshness of the climate with that of the solar exposure. We report here that these polar solar panels are inhabited by similar microbial communities in taxonomic terms, dominated by Hymenobacter spp., Sphingomonas spp. and Ascomycota. Our results suggest that solar panels, even on high latitudes, can shape a microbial ecosystem adapted to irradiation and desiccation. © 2017 Society for Applied Microbiology and John Wiley & Sons Ltd.

  1. HMMEditor: a visual editing tool for profile hidden Markov model

    Directory of Open Access Journals (Sweden)

    Cheng Jianlin

    2008-03-01

    Full Text Available Abstract Background Profile Hidden Markov Model (HMM is a powerful statistical model to represent a family of DNA, RNA, and protein sequences. Profile HMM has been widely used in bioinformatics research such as sequence alignment, gene structure prediction, motif identification, protein structure prediction, and biological database search. However, few comprehensive, visual editing tools for profile HMM are publicly available. Results We develop a visual editor for profile Hidden Markov Models (HMMEditor. HMMEditor can visualize the profile HMM architecture, transition probabilities, and emission probabilities. Moreover, it provides functions to edit and save HMM and parameters. Furthermore, HMMEditor allows users to align a sequence against the profile HMM and to visualize the corresponding Viterbi path. Conclusion HMMEditor provides a set of unique functions to visualize and edit a profile HMM. It is a useful tool for biological sequence analysis and modeling. Both HMMEditor software and web service are freely available.

  2. Research on the User Interest Modeling of Personalized Search Engine

    Institute of Scientific and Technical Information of China (English)

    LI Zhengwei; XIA Shixiong; NIU Qiang; XIA Zhanguo

    2007-01-01

    At present, how to enable Search Engine to construct user personal interest model initially, master user's personalized information timely and provide personalized services accurately have become the hotspot in the research of Search Engine area.Aiming at the problems of user model's construction and combining techniques of manual customization modeling and automatic analytical modeling, a User Interest Model (UIM) is proposed in the paper. On the basis of it, the corresponding establishment and update algorithms of User Interest Profile (UIP) are presented subsequently. Simulation tests proved that the UIM proposed and corresponding algorithms could enhance the retrieval precision effectively and have superior adaptability.

  3. Musical structure analysis using similarity matrix and dynamic programming

    Science.gov (United States)

    Shiu, Yu; Jeong, Hong; Kuo, C.-C. Jay

    2005-10-01

    Automatic music segmentation and structure analysis from audio waveforms based on a three-level hierarchy is examined in this research, where the three-level hierarchy includes notes, measures and parts. The pitch class profile (PCP) feature is first extracted at the note level. Then, a similarity matrix is constructed at the measure level, where a dynamic time warping (DTW) technique is used to enhance the similarity computation by taking the temporal distortion of similar audio segments into account. By processing the similarity matrix, we can obtain a coarse-grain music segmentation result. Finally, dynamic programming is applied to the coarse-grain segments so that a song can be decomposed into several major parts such as intro, verse, chorus, bridge and outro. The performance of the proposed music structure analysis system is demonstrated for pop and rock music.

  4. Searching for X-ray Pulsations from Neutron Stars Using NICER

    Science.gov (United States)

    Ray, Paul S.; Arzoumanian, Zaven; Gendreau, Keith C.; Bogdanov, Slavko; Bult, Peter; Chakrabarty, Deepto; Chakrabarty, Deepto; Guillot, Sebastien; Harding, Alice; Ho, Wynn C. G.; Lamb, Frederick; Mahmoodifar, Simin; Miller, Cole; Strohmayer, Tod; Wilson-Hodge, Colleen; Wolff, Michael T.; NICER Science Team Working Group on Pulsation Searches and Multiwavelength Coordination

    2018-01-01

    The Neutron Star Interior Composition Explorer (NICER) presents an exciting new capability for discovering new modulation properties of X-ray emitting neutron stars, including large area, low background, extremely precise absolute time stamps, superb low-energy response and flexible scheduling. The Pulsation Searches and Multiwavelength Coordination working group has designed a 2.5 Ms observing program to search for pulsations and characterize the modulation properties of about 30 known or suspected neutron star sources across a number of source categories. A key early goal will be to search for pulsations from millisecond pulsars that might exhibit thermal pulsations from the surface suitable for pulse profile modeling to constrain the neutron star equation of state. In addition, we will search for pulsations from transitional millisecond pulsars, isolated neutron stars, LMXBs, accretion-powered millisecond pulsars, central compact objects and other sources. We present our science plan and initial results from the first months of the NICER mission.

  5. Visual search in barn owls: Task difficulty and saccadic behavior.

    Science.gov (United States)

    Orlowski, Julius; Ben-Shahar, Ohad; Wagner, Hermann

    2018-01-01

    How do we find what we are looking for? A target can be in plain view, but it may be detected only after extensive search. During a search we make directed attentional deployments like saccades to segment the scene until we detect the target. Depending on difficulty, the search may be fast with few attentional deployments or slow with many, shorter deployments. Here we study visual search in barn owls by tracking their overt attentional deployments-that is, their head movements-with a camera. We conducted a low-contrast feature search, a high-contrast orientation conjunction search, and a low-contrast orientation conjunction search, each with set sizes varying from 16 to 64 items. The barn owls were able to learn all of these tasks and showed serial search behavior. In a subsequent step, we analyzed how search behavior of owls changes with search complexity. We compared the search mechanisms in these three serial searches with results from pop-out searches our group had reported earlier. Saccade amplitude shortened and fixation duration increased in difficult searches. Also, in conjunction search saccades were guided toward items with shared target features. These data suggest that during visual search, barn owls utilize mechanisms similar to those that humans use.

  6. Mechanical profiles of murder and murderers: An extensive review.

    Science.gov (United States)

    Kamaluddin, M R; Md Shariff, N S; Mat Saat, G A

    2018-04-01

    Murder is an extreme form of violent crime which occurs across all social, cultural, and ethnic spheres. It is therefore, crucial to understand the nature and the extent of mechanical profiles of murder and murderers. The purpose of this article is to review such critical aspects of murder in a nutshell. An archival research methodology was employed in this study where relevant search for literatures on these mechanical aspects related to murder was made across search engines such as Google Scholar and Elsevier with relevant articles selected for this review. This review discusses in an in-depth manner, pivotal mechanical profiles which include motives, methods of killing, choice of weapon, settings, targeted body parts, and murder victim concealment. In-depth understanding of each mechanical aspect offers an opportunity to the public at large to expand their knowledge on murder prevention manners which is vital for crime prevention efforts in the future.

  7. An Analysis of the Applicability of Federal Law Regarding Hash-Based Searches of Digital Media

    Science.gov (United States)

    2014-06-01

    similarity matching, Fourth Amend- ment, federal law, search and seizure, warrant search, consent search, border search. 15. NUMBER OF PAGES 107 16. PRICE ...containing a white powdery substance labeled flour [53]. 3.3.17 United States v Heckenkamp 482 F.3d 1142 (9th Circuit 2007) People have a reasonable

  8. Search for semileptonic decays of photoproduced charmed mesons

    International Nuclear Information System (INIS)

    Coleman, R.N.

    1977-01-01

    In the broad band neutral beam at Fermilab, a search for photoproduction of charmed D mesons was done using photons of 100 to 300 GeV. The reaction considered was γ + Be → DantiD + X, leptons + ..., K 0 /sub s/nπ/sup +-/. No statistically significant evidence for D production is observed based on the K 0 /sub s/nπ/sup +-/ mass spectrum. The sensitivity of the search is commensurate with theoretical estimates of sigma(γp → DantiD + X) approximately 500 nb, however this is dependent on branching ratios and photoproduction models. Data are given on a similar search for semileptonic decays of charmed baryons. 48 references

  9. Quantum signature scheme based on a quantum search algorithm

    International Nuclear Information System (INIS)

    Yoon, Chun Seok; Kang, Min Sung; Lim, Jong In; Yang, Hyung Jin

    2015-01-01

    We present a quantum signature scheme based on a two-qubit quantum search algorithm. For secure transmission of signatures, we use a quantum search algorithm that has not been used in previous quantum signature schemes. A two-step protocol secures the quantum channel, and a trusted center guarantees non-repudiation that is similar to other quantum signature schemes. We discuss the security of our protocol. (paper)

  10. Concurrent and aerobic exercise training promote similar benefits in body composition and metabolic profiles in obese adolescents.

    Science.gov (United States)

    Monteiro, Paula Alves; Chen, Kong Y; Lira, Fabio Santos; Saraiva, Bruna Thamyres Cicotti; Antunes, Barbara Moura Mello; Campos, Eduardo Zapaterra; Freitas, Ismael Forte

    2015-11-26

    The prevalence of obesity in pediatric population is increasing at an accelerated rate in many countries, and has become a major public health concern. Physical activity, particularly exercise training, remains to be a cornerstone of pediatric obesity interventions. The purpose of our current randomized intervention trial was to compare the effects of two types of training matched for training volume, aerobic and concurrent, on body composition and metabolic profile in obese adolescents. Thus the aim of the study was compare the effects of two types of training matched for training volume, aerobic and concurrent, on body composition and metabolic profile in obese adolescents. 32 obese adolescents participated in two randomized training groups, concurrent or aerobic, for 20 weeks (50 mins x 3 per week, supervised), and were compared to a 16-subject control group. We measured the percentage body fat (%BF, primary outcome), fat-free mass, percentage of android fat by dual energy x-ray absorptiometry, and others metabolic profiles at baseline and after interventions, and compared them between groups using the Intent-to-treat design. In 20 weeks, both exercise training groups significantly reduced %BF by 2.9-3.6% as compare to no change in the control group (p = 0.042). There were also positive changes in lipid levels in exercise groups. No noticeable changes were found between aerobic and concurrent training groups. The benefits of exercise in reducing body fat and metabolic risk profiles can be achieved by performing either type of training in obese adolescents. RBR-4HN597.

  11. Genetic local search algorithm for optimization design of diffractive optical elements.

    Science.gov (United States)

    Zhou, G; Chen, Y; Wang, Z; Song, H

    1999-07-10

    We propose a genetic local search algorithm (GLSA) for the optimization design of diffractive optical elements (DOE's). This hybrid algorithm incorporates advantages of both genetic algorithm (GA) and local search techniques. It appears better able to locate the global minimum compared with a canonical GA. Sample cases investigated here include the optimization design of binary-phase Dammann gratings, continuous surface-relief grating array generators, and a uniform top-hat focal plane intensity profile generator. Two GLSA's whose incorporated local search techniques are the hill-climbing method and the simulated annealing algorithm are investigated. Numerical experimental results demonstrate that the proposed algorithm is highly efficient and robust. DOE's that have high diffraction efficiency and excellent uniformity can be achieved by use of the algorithm we propose.

  12. Comprehensive metabolomic profiling and incident cardiovascular disease: a systematic review

    Science.gov (United States)

    Background: Metabolomics is a promising tool of cardiovascular biomarker discovery. We systematically reviewed the literature on comprehensive metabolomic profiling in association with incident cardiovascular disease (CVD). Methods and Results: We searched MEDLINE and EMBASE from inception to Janua...

  13. Pro-eating disorder search patterns: the possible influence of celebrity eating disorder stories in the media.

    Science.gov (United States)

    Lewis, Stephen P; Klauninger, Laura; Marcincinova, Ivana

    2016-01-01

    Pro eating disorder websites often contain celebrity-focused content (e.g., images) used as thinspiration to engage in unhealthy eating disorder behaviours. The current study was conducted to examine whether news media stories covering eating disorder disclosures of celebrities corresponded with increases in Internet searches for pro eating disorder material. Results indicated that search volumes for pro eating disorder terms spiked in the month immediately following such news coverage but only for particularly high-profile celebrities. Hence, there may be utility in providing recovery-oriented resources within the search results for pro-eating disorder Internet searches and within news stories of this nature.

  14. Searching for uranium

    International Nuclear Information System (INIS)

    Spaargaren, F.A.

    1988-01-01

    In the not-so-distant past, the search for uranium usually followed a conceptual approach in which an unexplored terrain was selected because of its presumed similarities with one that is known to contain one or more deposits. A description, in general terms, is given of the methodology adopted during the different stages of the exploration programme, up to the point of a discovery. Three case histories prove that, in order to reach this point, a certain amount of improvisation and luck is usually required. (author)

  15. An advanced search engine for patent analytics in medicinal chemistry.

    Science.gov (United States)

    Pasche, Emilie; Gobeill, Julien; Teodoro, Douglas; Gaudinat, Arnaud; Vishnykova, Dina; Lovis, Christian; Ruch, Patrick

    2012-01-01

    Patent collections contain an important amount of medical-related knowledge, but existing tools were reported to lack of useful functionalities. We present here the development of TWINC, an advanced search engine dedicated to patent retrieval in the domain of health and life sciences. Our tool embeds two search modes: an ad hoc search to retrieve relevant patents given a short query and a related patent search to retrieve similar patents given a patent. Both search modes rely on tuning experiments performed during several patent retrieval competitions. Moreover, TWINC is enhanced with interactive modules, such as chemical query expansion, which is of prior importance to cope with various ways of naming biomedical entities. While the related patent search showed promising performances, the ad-hoc search resulted in fairly contrasted results. Nonetheless, TWINC performed well during the Chemathlon task of the PatOlympics competition and experts appreciated its usability.

  16. Electon density profiles of the topside ionosphere

    Directory of Open Access Journals (Sweden)

    D. Bilitza

    2002-06-01

    Full Text Available The existing uncertainties about the electron density profiles in the topside ionosphere, i.e., in the height region from h m F 2 to ~ 2000 km, require the search for new data sources. The ISIS and Alouette topside sounder satellites from the sixties to the eighties recorded millions of ionograms but most were not analyzed in terms of electron density profiles. In recent years an effort started to digitize the analog recordings to prepare the ionograms for computerized analysis. As of November 2001 about 350 000 ionograms have been digitized from the original 7-track analog tapes. These data are available in binary and CDF format from the anonymous ftp site of the National Space Science Data Center. A search site and browse capabilities on CDAWeb assist the scientific usage of these data. All information and access links can be found at http://nssdc.gsfc.nasa.gov/space/isis/isis-status. html. This paper describes the ISIS data restoration effort and shows how the digital ionograms are automatically processed into electron density profiles from satellite orbit altitude (1400 km for ISIS-2 down to the F peak. Because of the large volume of data an automated processing algorithm is imperative. The TOPside Ionogram Scaler with True height algorithm TOPIST software developed for this task is successfully scaling ~ 70% of the ionograms. An «editing process» is available to manually scale the more difficult ionograms. The automated processing of the digitized ISIS ionograms is now underway, producing a much-needed database of topside electron density profiles for ionospheric modeling covering more than one solar cycle.

  17. Terverticillate penicillia studied by direct electrospray mass spectrometric profiling of crude extracts II. Database and identification

    DEFF Research Database (Denmark)

    Smedsgaard, Jørn

    1997-01-01

    A mass spectral database was built using standard instrument software from 678 electrospray mass spectra (mass profiles) from crude fungal extracts of terverticillate taxa within the genus Penicillium. The match factors calculated from searching all the mass profiles stored in the database were...

  18. Searching for Orphan radiation sources

    International Nuclear Information System (INIS)

    Bystrov, Evgenij; Antonau, Uladzimir; Gurinovich, Uladzimir; Kazhamiakin, Valery; Petrov, Vitaly; Shulhovich, Heorhi; Tischenko, Siarhei

    2008-01-01

    Full text: The problem of orphan sources cannot be left unaddressed due high probability of accidental exposure and use of sources for terrorism. Search of objects of this kind is complex particularly when search territory is large. This requires devices capable of detecting sources, identifying their radionuclide composition, and correlating scan results to geographical coordinates and displaying results on a map. Spectral radiation scanner AT6101C can fulfill the objective of search for gamma and neutron radiation sources, radionuclide composition identification, correlation results to geographical coordinates and displaying results on a map. The scanner consists of gamma radiation scintillation detection unit based on NaI(Tl) crystal, neutron detection unit based on two He 3 counters, GPS receiver and portable ruggedized computer. Built-in and application software automates entire scan process, saving all results to memory for further analysis with visual representation of results as spectral information diagrams, count rate profile and gamma radiation dose rates on a geographical map. The scanner informs operator with voice messages on detection of radiation sources, identification result and other events. Scanner detection units and accessories are packed in a backpack. Weighing 7 kg, the scanner is human portable and can be used for scan inside cars. The scanner can also be used for radiation mapping and inspections. (author)

  19. Automatic Content Creation for Games to Train Students Distinguishing Similar Chinese Characters

    Science.gov (United States)

    Lai, Kwong-Hung; Leung, Howard; Tang, Jeff K. T.

    In learning Chinese, many students often have the problem of mixing up similar characters. This can cause misunderstanding and miscommunication in daily life. It is thus important for students learning the Chinese language to be able to distinguish similar characters and understand their proper usage. In this paper, we propose a game style framework in which the game content in identifying similar Chinese characters in idioms and words is created automatically. Our prior work on analyzing students’ Chinese handwriting can be applied in the similarity measure of Chinese characters. We extend this work by adding the component of radical extraction to speed up the search process. Experimental results show that the proposed method is more accurate and faster in finding more similar Chinese characters compared with the baseline method without considering the radical information.

  20. TPSS plasma engineering studies: profile effects and plasma power balance

    International Nuclear Information System (INIS)

    Borowski, S.K.; Strickler, D.J.

    1985-01-01

    A computationally fast profile-averaged, steady-state plasma model has been developed to allow studies of radial effects in ignited and driven tokamak systems. This code was used to search for the smallest size tokamak consistent with power balance calculations

  1. The Hofmethode: Computing Semantic Similarities between E-Learning Products

    Directory of Open Access Journals (Sweden)

    Oliver Michel

    2009-11-01

    Full Text Available The key task in building useful e-learning repositories is to develop a system with an algorithm allowing users to retrieve information that corresponds to their specific requirements. To achieve this, products (or their verbal descriptions, i.e. presented in metadata need to be compared and structured according to the results of this comparison. Such structuring is crucial insofar as there are many search results that correspond to the entered keyword. The Hofmethode is an algorithm (based on psychological considerations to compute semantic similarities between texts and therefore offer a way to compare e-learning products. The computed similarity values are used to build semantic maps in which the products are visually arranged according to their similarities. The paper describes how the Hofmethode is implemented in the online database edulap, and how it contributes to help the user to explore the data in which he is interested.

  2. Semantic Similarity between Web Documents Using Ontology

    Science.gov (United States)

    Chahal, Poonam; Singh Tomer, Manjeet; Kumar, Suresh

    2018-06-01

    The World Wide Web is the source of information available in the structure of interlinked web pages. However, the procedure of extracting significant information with the assistance of search engine is incredibly critical. This is for the reason that web information is written mainly by using natural language, and further available to individual human. Several efforts have been made in semantic similarity computation between documents using words, concepts and concepts relationship but still the outcome available are not as per the user requirements. This paper proposes a novel technique for computation of semantic similarity between documents that not only takes concepts available in documents but also relationships that are available between the concepts. In our approach documents are being processed by making ontology of the documents using base ontology and a dictionary containing concepts records. Each such record is made up of the probable words which represents a given concept. Finally, document ontology's are compared to find their semantic similarity by taking the relationships among concepts. Relevant concepts and relations between the concepts have been explored by capturing author and user intention. The proposed semantic analysis technique provides improved results as compared to the existing techniques.

  3. Semantic Similarity between Web Documents Using Ontology

    Science.gov (United States)

    Chahal, Poonam; Singh Tomer, Manjeet; Kumar, Suresh

    2018-03-01

    The World Wide Web is the source of information available in the structure of interlinked web pages. However, the procedure of extracting significant information with the assistance of search engine is incredibly critical. This is for the reason that web information is written mainly by using natural language, and further available to individual human. Several efforts have been made in semantic similarity computation between documents using words, concepts and concepts relationship but still the outcome available are not as per the user requirements. This paper proposes a novel technique for computation of semantic similarity between documents that not only takes concepts available in documents but also relationships that are available between the concepts. In our approach documents are being processed by making ontology of the documents using base ontology and a dictionary containing concepts records. Each such record is made up of the probable words which represents a given concept. Finally, document ontology's are compared to find their semantic similarity by taking the relationships among concepts. Relevant concepts and relations between the concepts have been explored by capturing author and user intention. The proposed semantic analysis technique provides improved results as compared to the existing techniques.

  4. Electrophysiologic similarities of overdose between digoxin and bufadienolides found in a Chinese aphrodisiac

    Directory of Open Access Journals (Sweden)

    Maxwell Bressman

    2017-02-01

    Full Text Available Classically derived from toad venom, bufadienolides are a group of cardioactive steroids with properties similar to digoxin. Some traditional Chinese medications, including several aphrodisiacs, contain bufadienolides. Owing to their physiologic similarities to digoxin, bufadienolides have been shown to produce a toxic profile similar to that of digoxin and there have been multiple case reports of the use of these aphrodisiacs resulting in death. This report will describe a case that illustrates the electrophysiologic similarities between bufadienolide toxicity and digoxin toxicity as well as the treatment of bufadienolide toxicity.

  5. Constructing a web recommender system using web usage mining and user’s profiles

    Directory of Open Access Journals (Sweden)

    T. Mombeini

    2014-12-01

    Full Text Available The World Wide Web is a great source of information, which is nowadays being widely used due to the availability of useful information changing, dynamically. However, the large number of webpages often confuses many users and it is hard for them to find information on their interests. Therefore, it is necessary to provide a system capable of guiding users towards their desired choices and services. Recommender systems search among a large collection of user interests and recommend those, which are likely to be favored the most by the user. Web usage mining was designed to function on web server records, which are included in user search results. Therefore, recommender servers use the web usage mining technique to predict users’ browsing patterns and recommend those patterns in the form of a suggestion list. In this article, a recommender system based on web usage mining phases (online and offline was proposed. In the offline phase, the first step is to analyze user access records to identify user sessions. Next, user profiles are built using data from server records based on the frequency of access to pages, the time spent by the user on each page and the date of page view. Date is of importance since it is more possible for users to request new pages more than old ones and old pages are less probable to be viewed, as users mostly look for new information. Following the creation of user profiles, users are categorized in clusters using the Fuzzy C-means clustering algorithm and S(c criterion based on their similarities. In the online phase, a neural network is offered to identify the suggested model while online suggestions are generated using the suggestion module for the active user. Search engines analyze suggestion lists based on rate of user interest in pages and page rank and finally suggest appropriate pages to the active user. Experiments show that the proposed method of predicting user recent requested pages has more accuracy and

  6. Neurodevelopmental profile of Fetal Alcohol Spectrum Disorder: A systematic review.

    Science.gov (United States)

    Lange, Shannon; Rovet, Joanne; Rehm, Jürgen; Popova, Svetlana

    2017-06-23

    In an effort to improve the screening and diagnosis of individuals with Fetal Alcohol Spectrum Disorder (FASD), research has focused on the identification of a unique neurodevelopmental profile characteristic of this population. The objective of this review was to identify any existing neurodevelopmental profiles of FASD and review their classification function in order to identify gaps and limitations of the current literature. A systematic search for studies published up to the end of December 2016 reporting an identified neurodevelopmental profile of FASD was conducted using multiple electronic bibliographic databases. The search was not limited geographically or by language of publication. Original research published in a peer-reviewed journal that involved the evaluation of the classification function of an identified neurodevelopmental profile of FASD was included. Two approaches have been taken to determine the pathognomonic neurodevelopmental features of FASD, namely the utilization of i) behavioral observations/ratings by parents/caregivers and ii) subtest scores from standardized test batteries assessing a variety of neurodevelopmental domains. Both approaches show some promise, with the former approach (which is dominated by research on the Neurobehavioral Screening Tool) having good sensitivity (63% to 98%), but varying specificity (42% to 100%), and the latter approach having good specificity (72% to 96%), but varying sensitivity (60% to 88%). The current review revealed that research in this area remains limited and a definitive neurodevelopmental profile of FASD has not been established. However, the identification of a neurodevelopmental profile will aid in the accurate identification of individuals with FASD, by adding to the armamentarium of clinicians. The full review protocol is available in PROSPERO ( http://www.crd.york.ac.uk/PROSPERO/ ); registration number CRD42016039326; registered 20 May 2016.

  7. Optimal Target Stars in the Search for Life

    Science.gov (United States)

    Lingam, Manasvi; Loeb, Abraham

    2018-04-01

    The selection of optimal targets in the search for life represents a highly important strategic issue. In this Letter, we evaluate the benefits of searching for life around a potentially habitable planet orbiting a star of arbitrary mass relative to a similar planet around a Sun-like star. If recent physical arguments implying that the habitability of planets orbiting low-mass stars is selectively suppressed are correct, we find that planets around solar-type stars may represent the optimal targets.

  8. Similarities and differences in pedestrian shopping behavior in emerging Chinese metropolises

    NARCIS (Netherlands)

    Zhu, W.; Wang, Donggen; Timmermans, H.J.P.; Saito, S.

    2007-01-01

    To give a general impression on the fast development of Chinese retailing, this paper reports a study on pedestrian shopping behavior in two city centers, East Nanjing Road and Wang Fujing Street in Shanghai and Beijing. Similarities and differences in pedestrian profiles, activities and movement

  9. Emerging Profiles for Cultured Meat; Ethics through and as Design.

    Science.gov (United States)

    van der Weele, Cor; Driessen, Clemens

    2013-07-26

    The development of cultured meat has gained urgency through the increasing problems associated with meat, but what it might become is still open in many respects. In existing debates, two main moral profiles can be distinguished. Vegetarians and vegans who embrace cultured meat emphasize how it could contribute to the diminishment of animal suffering and exploitation, while in a more mainstream profile cultured meat helps to keep meat eating sustainable and affordable. In this paper we argue that these profiles do not exhaust the options and that (gut) feelings as well as imagination are needed to explore possible future options. On the basis of workshops, we present a third moral profile, "the pig in the backyard". Here cultured meat is imagined as an element of a hybrid community of humans and animals that would allow for both the consumption of animal protein and meaningful relations with domestic (farm) animals. Experience in the workshops and elsewhere also illustrates that thinking about cultured meat inspires new thoughts on "normal" meat. In short, the idea of cultured meat opens up new search space in various ways. We suggest that ethics can take an active part in these searches, by fostering a process that integrates (gut) feelings, imagination and rational thought and that expands the range of our moral identities.

  10. Emerging Profiles for Cultured Meat; Ethics through and as Design

    Directory of Open Access Journals (Sweden)

    Clemens Driessen

    2013-07-01

    Full Text Available The development of cultured meat has gained urgency through the increasing problems associated with meat, but what it might become is still open in many respects. In existing debates, two main moral profiles can be distinguished. Vegetarians and vegans who embrace cultured meat emphasize how it could contribute to the diminishment of animal suffering and exploitation, while in a more mainstream profile cultured meat helps to keep meat eating sustainable and affordable. In this paper we argue that these profiles do not exhaust the options and that (gut feelings as well as imagination are needed to explore possible future options. On the basis of workshops, we present a third moral profile, “the pig in the backyard”. Here cultured meat is imagined as an element of a hybrid community of humans and animals that would allow for both the consumption of animal protein and meaningful relations with domestic (farm animals. Experience in the workshops and elsewhere also illustrates that thinking about cultured meat inspires new thoughts on “normal” meat. In short, the idea of cultured meat opens up new search space in various ways. We suggest that ethics can take an active part in these searches, by fostering a process that integrates (gut feelings, imagination and rational thought and that expands the range of our moral identities.

  11. A Novel Drug-Mouse Phenotypic Similarity Method Detects Molecular Determinants of Drug Effects.

    Directory of Open Access Journals (Sweden)

    Jeanette Prinz

    2016-09-01

    Full Text Available The molecular mechanisms that translate drug treatment into beneficial and unwanted effects are largely unknown. We present here a novel approach to detect gene-drug and gene-side effect associations based on the phenotypic similarity of drugs and single gene perturbations in mice that account for the polypharmacological property of drugs. We scored the phenotypic similarity of human side effect profiles of 1,667 small molecules and biologicals to profiles of phenotypic traits of 5,384 mouse genes. The benchmarking with known relationships revealed a strong enrichment of physical and indirect drug-target connections, causative drug target-side effect links as well as gene-drug links involved in pharmacogenetic associations among phenotypically similar gene-drug pairs. The validation by in vitro assays and the experimental verification of an unknown connection between oxandrolone and prokineticin receptor 2 reinforces the ability of this method to provide new molecular insights underlying drug treatment. Thus, this approach may aid in the proposal of novel and personalized treatments.

  12. Violation of self-similarity in the expansion of a one-dimensional Bose gas

    International Nuclear Information System (INIS)

    Pedri, P.; Santos, L.; Oehberg, P.; Stringari, S.

    2003-01-01

    The expansion of a one-dimensional Bose gas after releasing its initial harmonic confinement is investigated employing the Lieb-Liniger equation of state within the local-density approximation. We show that during the expansion the density profile of the gas does not follow a self-similar solution, as one would expect from a simple scaling ansatz. We carry out a variational calculation, which recovers the numerical results for the expansion, the equilibrium properties of the density profile, and the frequency of the lowest compressional mode. The variational approach allows for the analysis of the expansion in all interaction regimes between the mean-field and the Tonks-Girardeau limits, and in particular shows the range of parameters for which the expansion violates self-similarity

  13. Comparison of PubMed and Google Scholar literature searches.

    Science.gov (United States)

    Anders, Michael E; Evans, Dennis P

    2010-05-01

    Literature searches are essential to evidence-based respiratory care. To conduct literature searches, respiratory therapists rely on search engines to retrieve information, but there is a dearth of literature on the comparative efficiencies of search engines for researching clinical questions in respiratory care. To compare PubMed and Google Scholar search results for clinical topics in respiratory care to that of a benchmark. We performed literature searches with PubMed and Google Scholar, on 3 clinical topics. In PubMed we used the Clinical Queries search filter. In Google Scholar we used the search filters in the Advanced Scholar Search option. We used the reference list of a related Cochrane Collaboration evidence-based systematic review as the benchmark for each of the search results. We calculated recall (sensitivity) and precision (positive predictive value) with 2 x 2 contingency tables. We compared the results with the chi-square test of independence and Fisher's exact test. PubMed and Google Scholar had similar recall for both overall search results (71% vs 69%) and full-text results (43% vs 51%). PubMed had better precision than Google Scholar for both overall search results (13% vs 0.07%, P PubMed searches with the Clinical Queries filter are more precise than with the Advanced Scholar Search in Google Scholar for respiratory care topics. PubMed appears to be more practical to conduct efficient, valid searches for informing evidence-based patient-care protocols, for guiding the care of individual patients, and for educational purposes.

  14. A fuzzy-match search engine for physician directories.

    Science.gov (United States)

    Rastegar-Mojarad, Majid; Kadolph, Christopher; Ye, Zhan; Wall, Daniel; Murali, Narayana; Lin, Simon

    2014-11-04

    A search engine to find physicians' information is a basic but crucial function of a health care provider's website. Inefficient search engines, which return no results or incorrect results, can lead to patient frustration and potential customer loss. A search engine that can handle misspellings and spelling variations of names is needed, as the United States (US) has culturally, racially, and ethnically diverse names. The Marshfield Clinic website provides a search engine for users to search for physicians' names. The current search engine provides an auto-completion function, but it requires an exact match. We observed that 26% of all searches yielded no results. The goal was to design a fuzzy-match algorithm to aid users in finding physicians easier and faster. Instead of an exact match search, we used a fuzzy algorithm to find similar matches for searched terms. In the algorithm, we solved three types of search engine failures: "Typographic", "Phonetic spelling variation", and "Nickname". To solve these mismatches, we used a customized Levenshtein distance calculation that incorporated Soundex coding and a lookup table of nicknames derived from US census data. Using the "Challenge Data Set of Marshfield Physician Names," we evaluated the accuracy of fuzzy-match engine-top ten (90%) and compared it with exact match (0%), Soundex (24%), Levenshtein distance (59%), and fuzzy-match engine-top one (71%). We designed, created a reference implementation, and evaluated a fuzzy-match search engine for physician directories. The open-source code is available at the codeplex website and a reference implementation is available for demonstration at the datamarsh website.

  15. Qualitative Value Profiling

    DEFF Research Database (Denmark)

    Duus, Henrik Johannsen; Bjerre, Mogens

    2015-01-01

    allows the development of 1) profiles of the target country in which operations are to take place, 2) profiles of the buying center (i.e. the group of decision makers) in the partner company, and 3) profiles of the product/service offering. It also allows the development of a semantic scaling method...... for deeper analysis of all involved factors. This paper presents the method and compares and contrasts it with other similar methods like the PESTELE method known from corporate strategy, the STEEPAL method known from scenario analysis, and the Politics-Institutions-Economy (PIE) framework known from...... International Business. This comparison suggests that QVP on most accounts provides deeper insights than alternative methods and thus lays the foundation for better strategic planning in international business-to-business markets. Hence, it is a valuable addition to the toolbox of business strategists...

  16. Real-time earthquake monitoring using a search engine method.

    Science.gov (United States)

    Zhang, Jie; Zhang, Haijiang; Chen, Enhong; Zheng, Yi; Kuang, Wenhuan; Zhang, Xiong

    2014-12-04

    When an earthquake occurs, seismologists want to use recorded seismograms to infer its location, magnitude and source-focal mechanism as quickly as possible. If such information could be determined immediately, timely evacuations and emergency actions could be undertaken to mitigate earthquake damage. Current advanced methods can report the initial location and magnitude of an earthquake within a few seconds, but estimating the source-focal mechanism may require minutes to hours. Here we present an earthquake search engine, similar to a web search engine, that we developed by applying a computer fast search method to a large seismogram database to find waveforms that best fit the input data. Our method is several thousand times faster than an exact search. For an Mw 5.9 earthquake on 8 March 2012 in Xinjiang, China, the search engine can infer the earthquake's parameters in <1 s after receiving the long-period surface wave data.

  17. A product feature-based user-centric product search model

    OpenAIRE

    Ben Jabeur, Lamjed; Soulier, Laure; Tamine, Lynda; Mousset, Paul

    2016-01-01

    During the online shopping process, users would search for interesting products and quickly access those that fit with their needs among a long tail of similar or closely related products. Our contribution addresses head queries that are frequently submitted on e-commerce Web sites. Head queries usually target featured products with several variations, accessories, and complementary products. We present in this paper a product feature-based user-centric model for product search involving in a...

  18. Protein structure database search and evolutionary classification.

    Science.gov (United States)

    Yang, Jinn-Moon; Tung, Chi-Hua

    2006-01-01

    As more protein structures become available and structural genomics efforts provide structural models in a genome-wide strategy, there is a growing need for fast and accurate methods for discovering homologous proteins and evolutionary classifications of newly determined structures. We have developed 3D-BLAST, in part, to address these issues. 3D-BLAST is as fast as BLAST and calculates the statistical significance (E-value) of an alignment to indicate the reliability of the prediction. Using this method, we first identified 23 states of the structural alphabet that represent pattern profiles of the backbone fragments and then used them to represent protein structure databases as structural alphabet sequence databases (SADB). Our method enhanced BLAST as a search method, using a new structural alphabet substitution matrix (SASM) to find the longest common substructures with high-scoring structured segment pairs from an SADB database. Using personal computers with Intel Pentium4 (2.8 GHz) processors, our method searched more than 10 000 protein structures in 1.3 s and achieved a good agreement with search results from detailed structure alignment methods. [3D-BLAST is available at http://3d-blast.life.nctu.edu.tw].

  19. Experimentally determined profiles of fast wave current drive on DIII-D

    International Nuclear Information System (INIS)

    Forest, C.B.; Petty, C.C.; Baity, F.W.; Chiu, S.C.; deGrassie, J.S.; Groebner, R.J.; Ikezi, H.; Jaeger, E.F.; Kupfer, K.; Murakami, M.; Pinsker, R.I.; Prater, R.; Rice, B.W.; Wade, M.R.; Whyte, D.G.

    1996-01-01

    Profiles of non-inductive current driven by fast waves have been determined for reversed-shear DIII-D discharges. Both the current profile and toroidal electric field profile are determined from time sequences of equilibrium reconstructions [C. B. Forest et al., Phys. Rev. Lett. 73, 2224 (1994)]. Using this information, the measured current profile has been separated into inductive and non-inductive portions. By comparing similar discharges with co and counter antenna phasings and similar fast wave power, the portion of the total non-inductive current driven by fast waves was determined. The experimentally determined profiles of FWCD are in general agreement with theoretical predictions. Specifically, 135 kA was driven by 1.4 MW of rf power with a profile peaked inside ρ=2. copyright 1996 American Institute of Physics

  20. Categorization and Searching of Color Images Using Mean Shift Algorithm

    Directory of Open Access Journals (Sweden)

    Prakash PANDEY

    2009-07-01

    Full Text Available Now a day’s Image Searching is still a challenging problem in content based image retrieval (CBIR system. Most CBIR system operates on all images without pre-sorting the images. The image search result contains many unrelated image. The aim of this research is to propose a new object based indexing system Based on extracting salient region representative from the image, categorizing the image into different types and search images that are similar to given query images.In our approach, the color features are extracted using the mean shift algorithm, a robust clustering technique, Dominant objects are obtained by performing region grouping of segmented thumbnails. The category for an image is generated automatically by analyzing the image for the presence of a dominant object. The images in the database are clustered based on region feature similarity using Euclidian distance. Placing an image into a category can help the user to navigate retrieval results more effectively. Extensive experimental results illustrate excellent performance.

  1. A 'snapshot' of the visual search behaviours of medical sonographers.

    Science.gov (United States)

    Carrigan, Ann J; Brennan, Patrick C; Pietrzyk, Mariusz; Clarke, Jillian; Chekaluk, Eugene

    2015-05-01

    Introduction : Visual search is a task that humans perform in everyday life. Whether it involves looking for a pen on a desk or a mass in a mammogram, the cognitive and perceptual processes that underpin these tasks are identical. Radiologists are experts in visual search of medical images and studies on their visual search behaviours have revealed some interesting findings with regard to diagnostic errors. In Australia, within the modality of ultrasound, sonographers perform the diagnostic scan, select images and present to the radiologist for reporting. Therefore the visual task and potential for errors is similar to a radiologist. Our aim was to explore and understand the detection, localisation and eye-gaze behaviours of a group of qualified sonographers. Method : We measured clinical performance and analysed diagnostic errors by presenting fifty sonographic breast images that varied on cancer present and degree of difficulty to a group of sonographers in their clinical workplace. For a sub-set of sonographers we obtained eye-tracking metrics such as time-to-first fixation, total visit duration and cumulative dwell time heat maps. Results : The results indicate that the sonographers' clinical performance was high and the eye-tracking metrics showed diagnostic error types similar to those found in studies on radiologist visual search. Conclusion : This study informs us about sonographer visual search patterns and highlights possible ways to improve diagnostic performance via targeted education.

  2. Evaluation of GO-based functional similarity measures using S. cerevisiae protein interaction and expression profile data

    Directory of Open Access Journals (Sweden)

    Du LinFang

    2008-11-01

    Full Text Available Abstract Background Researchers interested in analysing the expression patterns of functionally related genes usually hope to improve the accuracy of their results beyond the boundaries of currently available experimental data. Gene ontology (GO data provides a novel way to measure the functional relationship between gene products. Many approaches have been reported for calculating the similarities between two GO terms, known as semantic similarities. However, biologists are more interested in the relationship between gene products than in the scores linking the GO terms. To highlight the relationships among genes, recent studies have focused on functional similarities. Results In this study, we evaluated five functional similarity methods using both protein-protein interaction (PPI and expression data of S. cerevisiae. The receiver operating characteristics (ROC and correlation coefficient analysis of these methods showed that the maximum method outperformed the other methods. Statistical comparison of multiple- and single-term annotated proteins in biological process ontology indicated that genes with multiple GO terms may be more reliable for separating true positives from noise. Conclusion This study demonstrated the reliability of current approaches that elevate the similarity of GO terms to the similarity of proteins. Suggestions for further improvements in functional similarity analysis are also provided.

  3. The Search Performance Evaluation and Prediction in Exploratory Search

    OpenAIRE

    LIU, FEI

    2016-01-01

    The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...

  4. Future prospects for neutron→antineutron transition searches

    International Nuclear Information System (INIS)

    Kamyshkov, Yu.A.; Bugg, W.M.; Cohn, H.O.; Condo, G.T.; Efremenko, Yu.V.; Lamoreaux, S.K.; Lillie, R.A.; Plasil, F.; Raman, S.; Rennich, M.J.; Shmakov, K.D.; Wilson, R.; Young, G.R.

    1996-01-01

    An ORNL-UTK-UW-Harvard group is exploring the possibility of performing a new experiment to search for neutron-antineutron transitions either at the ORNL HFIR reactor or at a new proposed neutron spallation source. The advanced layout, based on a large mirror focusing reflector proposed for this experiment, should allow improving the discovery potential of searches for an n→n-bar transition by 3 to 4 orders of magnitude in relation to the most recent similar experiment at ILL-Grenoble. It should be possible to establish a limit on the characteristic transition time of τnn-bar > or approx. 1010 s

  5. Acceptance threshold hypothesis is supported by chemical similarity of cuticular hydrocarbons in a stingless bee, Melipona asilvai.

    Science.gov (United States)

    Nascimento, D L; Nascimento, F S

    2012-11-01

    The ability to discriminate nestmates from non-nestmates in insect societies is essential to protect colonies from conspecific invaders. The acceptance threshold hypothesis predicts that organisms whose recognition systems classify recipients without errors should optimize the balance between acceptance and rejection. In this process, cuticular hydrocarbons play an important role as cues of recognition in social insects. The aims of this study were to determine whether guards exhibit a restrictive level of rejection towards chemically distinct individuals, becoming more permissive during the encounters with either nestmate or non-nestmate individuals bearing chemically similar profiles. The study demonstrates that Melipona asilvai (Hymenoptera: Apidae: Meliponini) guards exhibit a flexible system of nestmate recognition according to the degree of chemical similarity between the incoming forager and its own cuticular hydrocarbons profile. Guards became less restrictive in their acceptance rates when they encounter non-nestmates with highly similar chemical profiles, which they probably mistake for nestmates, hence broadening their acceptance level.

  6. Exudate Chemical Profiles Derived from Lespedeza and Other Tallgrass Prairie Plant Species

    Science.gov (United States)

    2017-05-01

    Chemical Profiles Derived from Lespedeza and Other Tall- grass Prairie Plant Species. ERDC TN-17-1. Vicksburg, MS: U.S. Army Engineer Re- search and...200-1-52. Washington, DC: U.S. Army Corps of Engineers Headquarters, Civil Works. https://www.wbdg.org/ffc/army-coe/public-works-technical-bulletins...ERDC TN-17-1 May 2017 Approved for public release; distribution is unlimited. Exudate Chemical Profiles Derived from Lespedeza and Other

  7. One visual search, many memory searches: An eye-tracking investigation of hybrid search.

    Science.gov (United States)

    Drew, Trafton; Boettcher, Sage E P; Wolfe, Jeremy M

    2017-09-01

    Suppose you go to the supermarket with a shopping list of 10 items held in memory. Your shopping expedition can be seen as a combination of visual search and memory search. This is known as "hybrid search." There is a growing interest in understanding how hybrid search tasks are accomplished. We used eye tracking to examine how manipulating the number of possible targets (the memory set size [MSS]) changes how observers (Os) search. We found that dwell time on each distractor increased with MSS, suggesting a memory search was being executed each time a new distractor was fixated. Meanwhile, although the rate of refixation increased with MSS, it was not nearly enough to suggest a strategy that involves repeatedly searching visual space for subgroups of the target set. These data provide a clear demonstration that hybrid search tasks are carried out via a "one visual search, many memory searches" heuristic in which Os examine items in the visual array once with a very low rate of refixations. For each item selected, Os activate a memory search that produces logarithmic response time increases with increased MSS. Furthermore, the percentage of distractors fixated was strongly modulated by the MSS: More items in the MSS led to a higher percentage of fixated distractors. Searching for more potential targets appears to significantly alter how Os approach the task, ultimately resulting in more eye movements and longer response times.

  8. Intrinsic position uncertainty impairs overt search performance.

    Science.gov (United States)

    Semizer, Yelda; Michel, Melchi M

    2017-08-01

    Uncertainty regarding the position of the search target is a fundamental component of visual search. However, due to perceptual limitations of the human visual system, this uncertainty can arise from intrinsic, as well as extrinsic, sources. The current study sought to characterize the role of intrinsic position uncertainty (IPU) in overt visual search and to determine whether it significantly limits human search performance. After completing a preliminary detection experiment to characterize sensitivity as a function of visual field position, observers completed a search task that required localizing a Gabor target within a field of synthetic luminance noise. The search experiment included two clutter conditions designed to modulate the effect of IPU across search displays of varying set size. In the Cluttered condition, the display was tiled uniformly with feature clutter to maximize the effects of IPU. In the Uncluttered condition, the clutter at irrelevant locations was removed to attenuate the effects of IPU. Finally, we derived an IPU-constrained ideal searcher model, limited by the IPU measured in human observers. Ideal searchers were simulated based on the detection sensitivity and fixation sequences measured for individual human observers. The IPU-constrained ideal searcher predicted performance trends similar to those exhibited by the human observers. In the Uncluttered condition, performance decreased steeply as a function of increasing set size. However, in the Cluttered condition, the effect of IPU dominated and performance was approximately constant as a function of set size. Our findings suggest that IPU substantially limits overt search performance, especially in crowded displays.

  9. A semantics-based method for clustering of Chinese web search results

    Science.gov (United States)

    Zhang, Hui; Wang, Deqing; Wang, Li; Bi, Zhuming; Chen, Yong

    2014-01-01

    Information explosion is a critical challenge to the development of modern information systems. In particular, when the application of an information system is over the Internet, the amount of information over the web has been increasing exponentially and rapidly. Search engines, such as Google and Baidu, are essential tools for people to find the information from the Internet. Valuable information, however, is still likely submerged in the ocean of search results from those tools. By clustering the results into different groups based on subjects automatically, a search engine with the clustering feature allows users to select most relevant results quickly. In this paper, we propose an online semantics-based method to cluster Chinese web search results. First, we employ the generalised suffix tree to extract the longest common substrings (LCSs) from search snippets. Second, we use the HowNet to calculate the similarities of the words derived from the LCSs, and extract the most representative features by constructing the vocabulary chain. Third, we construct a vector of text features and calculate snippets' semantic similarities. Finally, we improve the Chameleon algorithm to cluster snippets. Extensive experimental results have shown that the proposed algorithm has outperformed over the suffix tree clustering method and other traditional clustering methods.

  10. External Differences and Internal Similarities

    DEFF Research Database (Denmark)

    Katz-Gerro, Tally; Jæger, Mads Meier

    This paper analyzes change in cultural consumption profiles in Denmark over the period 1975-2004 along three dimensions: number of profiles; between-profile socioeconomic heterogeneity; and within-profile socioeconomic heterogeneity. Previous studies have considered the first and second aforement......This paper analyzes change in cultural consumption profiles in Denmark over the period 1975-2004 along three dimensions: number of profiles; between-profile socioeconomic heterogeneity; and within-profile socioeconomic heterogeneity. Previous studies have considered the first and second...

  11. Simrank: Rapid and sensitive general-purpose k-mer search tool

    Energy Technology Data Exchange (ETDEWEB)

    DeSantis, T.Z.; Keller, K.; Karaoz, U.; Alekseyenko, A.V; Singh, N.N.S.; Brodie, E.L; Pei, Z.; Andersen, G.L; Larsen, N.

    2011-04-01

    Terabyte-scale collections of string-encoded data are expected from consortia efforts such as the Human Microbiome Project (http://nihroadmap.nih.gov/hmp). Intra- and inter-project data similarity searches are enabled by rapid k-mer matching strategies. Software applications for sequence database partitioning, guide tree estimation, molecular classification and alignment acceleration have benefited from embedded k-mer searches as sub-routines. However, a rapid, general-purpose, open-source, flexible, stand-alone k-mer tool has not been available. Here we present a stand-alone utility, Simrank, which allows users to rapidly identify database strings the most similar to query strings. Performance testing of Simrank and related tools against DNA, RNA, protein and human-languages found Simrank 10X to 928X faster depending on the dataset. Simrank provides molecular ecologists with a high-throughput, open source choice for comparing large sequence sets to find similarity.

  12. SearchResultFinder: federated search made easy

    NARCIS (Netherlands)

    Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

    Building a federated search engine based on a large number existing web search engines is a challenge: implementing the programming interface (API) for each search engine is an exacting and time-consuming job. In this demonstration we present SearchResultFinder, a browser plugin which speeds up

  13. Searching for confining hidden valleys at LHCb, ATLAS, and CMS

    Science.gov (United States)

    Pierce, Aaron; Shakya, Bibhushan; Tsai, Yuhsin; Zhao, Yue

    2018-05-01

    We explore strategies for probing hidden valley scenarios exhibiting confinement. Such scenarios lead to a moderate multiplicity of light hidden hadrons for generic showering and hadronization similar to QCD. Their decays are typically soft and displaced, making them challenging to probe with traditional LHC searches. We show that the low trigger requirements and excellent track and vertex reconstruction at LHCb provide a favorable environment to search for such signals. We propose novel search strategies in both muonic and hadronic channels. We also study existing ATLAS and CMS searches and compare them with our proposals at LHCb. We find that the reach at LHCb is generically better in the parameter space we consider here, even with optimistic background estimations for ATLAS and CMS searches. We discuss potential modifications at ATLAS and CMS that might make these experiments competitive with the LHCb reach. Our proposed searches can be applied to general hidden valley models as well as exotic Higgs boson decays, such as in twin Higgs models.

  14. Reproducibility of Automated Voice Range Profiles, a Systematic Literature Review

    DEFF Research Database (Denmark)

    Printz, Trine; Rosenberg, Tine; Godballe, Christian

    2018-01-01

    literature on test-retest accuracy of the automated voice range profile assessment. Study design: Systematic review. Data sources: PubMed, Scopus, Cochrane Library, ComDisDome, Embase, and CINAHL (EBSCO). Methods: We conducted a systematic literature search of six databases from 1983 to 2016. The following...

  15. A new k-epsilon model consistent with Monin-Obukhov similarity theory

    DEFF Research Database (Denmark)

    van der Laan, Paul; Kelly, Mark C.; Sørensen, Niels N.

    2017-01-01

    A new k-" model is introduced that is consistent with Monin–Obukhov similarity theory (MOST). The proposed k-" model is compared with another k-" model that was developed in an attempt to maintain inlet profiles compatible with MOST. It is shown that the previous k-" model is not consistent with ...

  16. SURFACE BRIGHTNESS PROFILES OF DWARF GALAXIES. I. PROFILES AND STATISTICS

    International Nuclear Information System (INIS)

    Herrmann, Kimberly A.; Hunter, Deidre A.; Elmegreen, Bruce G.

    2013-01-01

    Radial surface brightness profiles of spiral galaxies are classified into three types: (I) single exponential, or the light falls off with one exponential to a break before falling off (II) more steeply, or (III) less steeply. Profile breaks are also found in dwarf disks, but some dwarf Type IIs are flat or increasing out to a break before falling off. Here we re-examine the stellar disk profiles of 141 dwarfs: 96 dwarf irregulars (dIms), 26 Blue Compact Dwarfs (BCDs), and 19 Magellanic-type spirals (Sms). We fit single, double, or even triple exponential profiles in up to 11 passbands: GALEX FUV and NUV, ground-based UBVJHK and Hα, and Spitzer 3.6 and 4.5 μm. We find that more luminous galaxies have brighter centers, larger inner and outer scale lengths, and breaks at larger radii; dwarf trends with M B extend to spirals. However, the V-band break surface brightness is independent of break type, M B , and Hubble type. Dwarf Type II and III profiles fall off similarly beyond the breaks but have different interiors and IIs break ∼twice as far as IIIs. Outer Type II and III scale lengths may have weak trends with wavelength, but pure Type II inner scale lengths clearly decrease from the FUV to visible bands whereas Type III inner scale lengths increase with redder bands. This suggests the influence of different star formation histories on profile type, but nonetheless the break location is approximately the same in all passbands. Dwarfs continue trends between profile and Hubble types such that later-type galaxies have more Type II but fewer Type I and III profiles than early-type spirals. BCDs and Sms are over-represented as Types III and II, respectively, compared to dIms

  17. Mobile Visual Search Based on Histogram Matching and Zone Weight Learning

    Science.gov (United States)

    Zhu, Chuang; Tao, Li; Yang, Fan; Lu, Tao; Jia, Huizhu; Xie, Xiaodong

    2018-01-01

    In this paper, we propose a novel image retrieval algorithm for mobile visual search. At first, a short visual codebook is generated based on the descriptor database to represent the statistical information of the dataset. Then, an accurate local descriptor similarity score is computed by merging the tf-idf weighted histogram matching and the weighting strategy in compact descriptors for visual search (CDVS). At last, both the global descriptor matching score and the local descriptor similarity score are summed up to rerank the retrieval results according to the learned zone weights. The results show that the proposed approach outperforms the state-of-the-art image retrieval method in CDVS.

  18. A Full-Text-Based Search Engine for Finding Highly Matched Documents Across Multiple Categories

    Science.gov (United States)

    Nguyen, Hung D.; Steele, Gynelle C.

    2016-01-01

    This report demonstrates the full-text-based search engine that works on any Web-based mobile application. The engine has the capability to search databases across multiple categories based on a user's queries and identify the most relevant or similar. The search results presented here were found using an Android (Google Co.) mobile device; however, it is also compatible with other mobile phones.

  19. Identifying Potential Protein Targets for Toluene Using a Molecular Similarity Search, in Silico Docking and in Vitro Validation

    Science.gov (United States)

    2015-01-01

    performed under standard conditions. Ana- lysis of purified hemoglobin using SDS and native polyacryl - amide gel electrophoresis (PAGE) indicated that the...search of T3DB. They represent several families of proteins (calcium-transporting ATPases, sodium/ potassium -transporting ATPase, cytochrome P450...REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-0188 Public reporting burden for this collection of information is estimated to average 1

  20. [Safety profile of dolutegravir].

    Science.gov (United States)

    Rivero, Antonio; Domingo, Pere

    2015-03-01

    Integrase inhibitors are the latest drug family to be added to the therapeutic arsenal against human immunodeficiency virus infection. Drugs in this family that do not require pharmacological boosting are characterized by a very good safety profile. The latest integrase inhibitor to be approved for use is dolutegravir. In clinical trials, dolutegravir has shown an excellent tolerability profile, both in antiretroviral-naïve and previously treated patients. Discontinuation rates due to adverse effects were 2% and 3%, respectively. The most frequent adverse effects were nausea, headache, diarrhea and sleep disturbance. A severe hypersensitivity reaction has been reported in only one patient. In patients coinfected with hepatropic viruses, the safety profile is similar to that in patients without coinfection. The lipid profile of dolutegravir is similar to that of raltegravir and superior to those of Atripla® and darunavir/ritonavir. Dolutegravir induces an early, predictable and non-progressive increase in serum creatinine of around 10% of baseline values in treatment-naïve patients and of 14% in treatment-experienced patients. This increase is due to inhibition of tubular creatinine secretion through the OCT2 receptor and does not lead to a real decrease in estimated glomerular filtration rate with algorithms that include serum creatinine. The effect of the combination of dolutegravir plus Kivexa(®) on biomarkers of bone remodeling is lower than that of Atripla(®). Dolutegravir has an excellent tolerability profile with no current evidence of long-term adverse effects. Its use is accompanied by an early and non-progressive increase in serum creatinine due to OCT2 receptor inhibition. In combination with abacavir/lamivudine, dolutegravir has a lower impact than enofovir/emtricitabine/efavirenz on bone remodelling markers. Copyright © 2015 Elsevier España, S.L.U. All rights reserved.

  1. User Profile Analysis Using an Online Social Network Integrated Quiz Game

    Directory of Open Access Journals (Sweden)

    Yusuf YASLAN

    2017-09-01

    Full Text Available User interest profiling is important for personalized web search, recommendation and retrieval systems. In order to develop a good personalized application one needs to have accurate representation of user profiles. Most of the personalized systems generate interest profiles from user declarations or inferred from cookies or visited web pages. But to achieve a certain result that satisfies the user needs, explicit definition of the user interests is needed. In this paper we propose to obtain interest profiles from a quiz game played by the user where at each play he/she is asked 10 questions from different categories with different difficulty levels. The developed quiz game is integrated to Facebook online social network. By doing so, we had the chance to extract each user’s both explicit Facebook interest profiles and implicit interest profiles from quiz game answers. These profiles are used to extract different features for each user. Both implicit interest profile and explicit interest profile features are evaluated for clustering and interest ranking tasks separately. The experimental results show that the implicit interest profile features have promising results on personalized systems.

  2. IN SEARCH OF THE MISSING LINK: SERUM LIPID PROFILE, TROPONIN T AND ACUTE CORONARY SYNDROME.

    OpenAIRE

    Basabdatta Samanta; Bharti Kawatra; Sandip

    2014-01-01

    Acute coronary syndrome is one of the leading causes of morbidity and mortality worldwide , hyperlipidemias being a major predisposing factor. Cardiac Troponin T (cTnT) is one of the most sensitive and specific biomarkers of myocardial injury. The aim of the study was to evaluate the relationship among TnT levels and lipid profiles of different age groups of patients with ACS , and to determine if any the association of age with lipid profile and TnT levels. The ...

  3. User Oriented Trajectory Search for Trip Recommendation

    KAUST Repository

    Ding, Ruogu

    2012-07-08

    Trajectory sharing and searching have received significant attention in recent years. In this thesis, we propose and investigate the methods to find and recommend the best trajectory to the traveler, and mainly focus on a novel technique named User Oriented Trajectory Search (UOTS) query processing. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler’s preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler’s preference, it will be recommended to the traveler. This type of queries can enable many popular applications such as trip planning and recommendation. There are two challenges in UOTS query processing, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. Extensive experiments are conducted on both real and synthetic trajectory data in road networks. Our approach is verified to be effective in reducing both CPU time and disk I/O time.

  4. User oriented trajectory search for trip recommendation

    KAUST Repository

    Shang, Shuo

    2012-01-01

    Trajectory sharing and searching have received significant attentions in recent years. In this paper, we propose and investigate a novel problem called User Oriented Trajectory Search (UOTS) for trip recommendation. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler\\'s preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler\\'e preference, it will be recommended to the traveler for reference. This type of queries can bring significant benefits to travelers in many popular applications such as trip planning and recommendation. There are two challenges in the UOTS problem, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. The performance of the proposed UOTS query is verified by extensive experiments based on real and synthetic trajectory data in road networks. © 2012 ACM.

  5. Optimal search filters for renal information in EMBASE.

    Science.gov (United States)

    Iansavichus, Arthur V; Haynes, R Brian; Shariff, Salimah Z; Weir, Matthew; Wilczynski, Nancy L; McKibbon, Ann; Rehman, Faisal; Garg, Amit X

    2010-07-01

    EMBASE is a popular database used to retrieve biomedical information. Our objective was to develop and test search filters to help clinicians and researchers efficiently retrieve articles with renal information in EMBASE. We used a diagnostic test assessment framework because filters operate similarly to screening tests. We divided a sample of 5,302 articles from 39 journals into development and validation sets of articles. Information retrieval properties were assessed by treating each search filter as a "diagnostic test" or screening procedure for the detection of relevant articles. We tested the performance of 1,936,799 search filters made of unique renal terms and their combinations. REFERENCE STANDARD & OUTCOME: The reference standard was manual review of each article. We calculated the sensitivity and specificity of each filter to identify articles with renal information. The best renal filters consisted of multiple search terms, such as "renal replacement therapy," "renal," "kidney disease," and "proteinuria," and the truncated terms "kidney," "dialy," "neph," "glomerul," and "hemodial." These filters achieved peak sensitivities of 98.7% (95% CI, 97.9-99.6) and specificities of 98.5% (95% CI, 98.0-99.0). The retrieval performance of these filters remained excellent in the validation set of independent articles. The retrieval performance of any search will vary depending on the quality of all search concepts used, not just renal terms. We empirically developed and validated high-performance renal search filters for EMBASE. These filters can be programmed into the search engine or used on their own to improve the efficiency of searching.

  6. The LAILAPS Search Engine: Relevance Ranking in Life Science Databases

    Directory of Open Access Journals (Sweden)

    Lange Matthias

    2010-06-01

    Full Text Available Search engines and retrieval systems are popular tools at a life science desktop. The manual inspection of hundreds of database entries, that reflect a life science concept or fact, is a time intensive daily work. Hereby, not the number of query results matters, but the relevance does. In this paper, we present the LAILAPS search engine for life science databases. The concept is to combine a novel feature model for relevance ranking, a machine learning approach to model user relevance profiles, ranking improvement by user feedback tracking and an intuitive and slim web user interface, that estimates relevance rank by tracking user interactions. Queries are formulated as simple keyword lists and will be expanded by synonyms. Supporting a flexible text index and a simple data import format, LAILAPS can easily be used both as search engine for comprehensive integrated life science databases and for small in-house project databases.

  7. Data description and quality assessment of ionospheric electron density profiles for ARPA modeling project. Technical report

    International Nuclear Information System (INIS)

    Conkright, R.O.

    1977-03-01

    This report presents a description of the automated method used to produce electron density (N(h)) profiles from ionograms recorded on 35mm film and an assessment of the resulting data base. A large data base of about 30,000 profiles was required for an ionospheric modeling project. This motivated a search for an automated method of producing profiles. The automated method used is fully described, the resulting data are given a quality grade, and the noon and midnight profiles are presented. Selected portions of this data base are compared with profiles produced by the standard profiling method in use by the Environmental Data Service at Boulder, Colorado

  8. Open meta-search with OpenSearch: a case study

    OpenAIRE

    O'Riordan, Adrian P.

    2007-01-01

    The goal of this project was to demonstrate the possibilities of open source search engine and aggregation technology in a Web environment by building a meta-search engine which employs free open search engines and open protocols. In contrast many meta-search engines on the Internet use proprietary search systems. The search engines employed in this case study are all based on the OpenSearch protocol. OpenSearch-compliant systems support XML technologies such as RSS and Atom for aggregation a...

  9. Semantic search during divergent thinking.

    Science.gov (United States)

    Hass, Richard W

    2017-09-01

    Divergent thinking, as a method of examining creative cognition, has not been adequately analyzed in the context of modern cognitive theories. This article casts divergent thinking responding in the context of theories of memory search. First, it was argued that divergent thinking tasks are similar to semantic fluency tasks, but are more constrained, and less well structured. Next, response time distributions from 54 participants were analyzed for temporal and semantic clustering. Participants responded to two prompts from the alternative uses test: uses for a brick and uses for a bottle, for two minutes each. Participants' cumulative response curves were negatively accelerating, in line with theories of search of associative memory. However, results of analyses of semantic and temporal clustering suggested that clustering is less evident in alternative uses responding compared to semantic fluency tasks. This suggests either that divergent thinking responding does not involve an exhaustive search through a clustered memory trace, but rather that the process is more exploratory, yielding fewer overall responses that tend to drift away from close associates of the divergent thinking prompt. Copyright © 2017 Elsevier B.V. All rights reserved.

  10. Searching for displaced Higgs boson decays

    Science.gov (United States)

    Csáki, Csaba; Kuflik, Eric; Lombardo, Salvator; Slone, Oren

    2015-10-01

    We study a simplified model of the Standard Model (SM) Higgs boson decaying to a degenerate pair of scalars which travel a macroscopic distance before decaying to SM particles. This is the leading signal for many well-motivated solutions to the hierarchy problem that do not propose additional light colored particles. Bounds for displaced Higgs boson decays below 10 cm are found by recasting existing tracker searches from Run I. New tracker search strategies, sensitive to the characteristics of these models and similar decays, are proposed with sensitivities projected for Run II at √{s }=13 TeV . With 20 fb-1 of data, we find that Higgs branching ratios down to 2 ×1 0-4 can be probed for centimeter decay lengths.

  11. Anterior corneal profile with variable asphericity.

    Science.gov (United States)

    Rosales, Marco A; Juárez-Aubry, Montserrat; López-Olazagasti, Estela; Ibarra, Jorge; Tepichín, Eduardo

    2009-12-10

    We present a corneal profile in which the eccentricity, e(Q=-e(2)), has a nonlinear continuous variation from the center outwards. This nonlinear variation is intended to fit and reproduce our current experimental data in which the anterior corneal surface of the human eye exhibits different values of e at different diameters. According to our clinical data, the variation is similar to an exponential decay. We propose a linear combination of two exponential functions to describe the variation of e. We then calculate the corneal sagittal height by substituting e in the first-order aspherical surface equation to obtain the corneal profile. This corneal profile will be used as a reference to analyze the resultant profiles of the customized corneal ablation in refractive surgery.

  12. Searching for the right word: Hybrid visual and memory search for words.

    Science.gov (United States)

    Boettcher, Sage E P; Wolfe, Jeremy M

    2015-05-01

    In "hybrid search" (Wolfe Psychological Science, 23(7), 698-703, 2012), observers search through visual space for any of multiple targets held in memory. With photorealistic objects as the stimuli, response times (RTs) increase linearly with the visual set size and logarithmically with the memory set size, even when over 100 items are committed to memory. It is well-established that pictures of objects are particularly easy to memorize (Brady, Konkle, Alvarez, & Oliva Proceedings of the National Academy of Sciences, 105, 14325-14329, 2008). Would hybrid-search performance be similar if the targets were words or phrases, in which word order can be important, so that the processes of memorization might be different? In Experiment 1, observers memorized 2, 4, 8, or 16 words in four different blocks. After passing a memory test, confirming their memorization of the list, the observers searched for these words in visual displays containing two to 16 words. Replicating Wolfe (Psychological Science, 23(7), 698-703, 2012), the RTs increased linearly with the visual set size and logarithmically with the length of the word list. The word lists of Experiment 1 were random. In Experiment 2, words were drawn from phrases that observers reported knowing by heart (e.g., "London Bridge is falling down"). Observers were asked to provide four phrases, ranging in length from two words to no less than 20 words (range 21-86). All words longer than two characters from the phrase, constituted the target list. Distractor words were matched for length and frequency. Even with these strongly ordered lists, the results again replicated the curvilinear function of memory set size seen in hybrid search. One might expect to find serial position effects, perhaps reducing the RTs for the first (primacy) and/or the last (recency) members of a list (Atkinson & Shiffrin, 1968; Murdock Journal of Experimental Psychology, 64, 482-488, 1962). Surprisingly, we showed no reliable effects of word order

  13. Missing Links in Middle School: Developing Use of Disciplinary Relatedness in Evaluating Internet Search Results.

    Directory of Open Access Journals (Sweden)

    Frank C Keil

    Full Text Available In the "digital native" generation, internet search engines are a commonly used source of information. However, adolescents may fail to recognize relevant search results when they are related in discipline to the search topic but lack other cues. Middle school students, high school students, and adults rated simulated search results for relevance to the search topic. The search results were designed to contrast deep discipline-based relationships with lexical similarity to the search topic. Results suggest that the ability to recognize disciplinary relatedness without supporting cues may continue to develop into high school. Despite frequent search engine usage, younger adolescents may require additional support to make the most of the information available to them.

  14. The Heavy Photon Search beamline and its performance

    Energy Technology Data Exchange (ETDEWEB)

    Baltzell, N.; Egiyan, H.; Ehrhart, M.; Field, C.; Freyberger, A.; Girod, F.-X.; Holtrop, M.; Jaros, J.; Kalicy, G.; Maruyama, T.; McKinnon, B.; Moffeit, K.; Nelson, T.; Odian, A.; Oriunno, M.; Paremuzyan, R.; Stepanyan, S.; Tiefenback, M.; Uemura, S.; Ungaro, M.; Vance, H.

    2017-04-04

    The Heavy Photon Search (HPS) is an experiment to search for a hidden sector photon, aka a heavy photon or dark photon, in fixed target electroproduction at the Thomas Jefferson National Accelerator Facility (JLab). The HPS experiment searches for the e+e- decay of the heavy photon with bump hunt and detached vertex strategies using a compact, large acceptance forward spectrometer, consisting of a silicon microstrip detector (SVT) for tracking and vertexing, and a PbWO4 electromagnetic calorimeter for energy measurement and fast triggering. To achieve large acceptance and good vertexing resolution, the first layer of silicon detectors is placed just 10 cm downstream of the target with the sensor edges only 500 μm above and below the beam. Placing the SVT in such close proximity to the beam puts stringent requirements on the beam profile and beam position stability. As part of an approved engineering run, HPS took data in 2015 and 2016 at 1.05 GeV and 2.3 GeV beam energies, respectively. This paper describes the beam line and its performance during that data taking.

  15. Searching for a neurologic injury's Wechsler Adult Intelligence Scale-Third Edition profile.

    Science.gov (United States)

    Gonçalves, Marta A; Moura, Octávio; Castro-Caldas, Alexandre; Simões, Mário R

    2017-01-01

    This study aimed to investigate the presence of a Wechsler Adult Intelligence Scale-Third Edition (WAIS-III) cognitive profile in a Portuguese neurologic injured sample. The Portuguese WAIS-III was administered to 81 mixed neurologic patients and 81 healthy matched controls selected from the Portuguese standardization sample. Although the mixed neurologic injury group performed significantly lower than the healthy controls for the majority of the WAIS-III scores (i.e., composite measures, discrepancies, and subtests), the mean scores were within the normal range and, therefore, at risk of being unobserved in a clinical evaluation. ROC curves analysis showed poor to acceptable diagnostic accuracy for the WAIS-III composite measures and subtests (Working Memory Index and Digit Span revealed the highest accuracy for discriminating between participants, respectively). Multiple regression analysis showed that both literacy and the presence of brain injury were significant predictors for all of the composite measures. In addition, multiple regression analysis also showed that literacy, age of injury onset, and years of survival predicted all seven composite measures for the mixed neurologic injured group. Despite the failure to find a WAIS-III cognitive profile for mixed neurologic patients, the results showed a significant influence of brain lesion and literacy in the performance of the WAIS-III.

  16. Impact of Glaucoma and Dry Eye on Text-Based Searching

    Science.gov (United States)

    Sun, Michelle J.; Rubin, Gary S.; Akpek, Esen K.; Ramulu, Pradeep Y.

    2017-01-01

    Purpose We determine if visual field loss from glaucoma and/or measures of dry eye severity are associated with difficulty searching, as judged by slower search times on a text-based search task. Methods Glaucoma patients with bilateral visual field (VF) loss, patients with clinically significant dry eye, and normally-sighted controls were enrolled from the Wilmer Eye Institute clinics. Subjects searched three Yellow Pages excerpts for a specific phone number, and search time was recorded. Results A total of 50 glaucoma subjects, 40 dry eye subjects, and 45 controls completed study procedures. On average, glaucoma patients exhibited 57% longer search times compared to controls (95% confidence interval [CI], 26%–96%, P Dry eye subjects demonstrated similar search times compared to controls, though worse Ocular Surface Disease Index (OSDI) vision-related subscores were associated with longer search times (P dry eye (P > 0.08 for Schirmer's testing without anesthesia, corneal fluorescein staining, and tear film breakup time). Conclusions Text-based visual search is slower for glaucoma patients with greater levels of VF loss and dry eye patients with greater self-reported visual difficulty, and these difficulties may contribute to decreased quality of life in these groups. Translational Relevance Visual search is impaired in glaucoma and dry eye groups compared to controls, highlighting the need for compensatory strategies and tools to assist individuals in overcoming their deficiencies. PMID:28670502

  17. Query transformations and their role in Web searching by the members of the general public

    Directory of Open Access Journals (Sweden)

    Martin Whittle

    2006-01-01

    Full Text Available Introduction. This paper reports preliminary research in a primarily experimental study of how the general public search for information on the Web. The focus is on the query transformation patterns that characterise searching. Method. In this work, we have used transaction logs from the Excite search engine to develop methods for analysing query transformations that should aid the analysis of our ongoing experimental work. Our methods involve the use of similarity techniques to link queries with the most similar previous query in a train. The resulting query transformations are represented as a list of codes representing a whole search. Analysis. It is shown how query transformation sequences can be represented as graphical networks and some basic statistical results are shown. A correlation analysis is performed to examine the co-occurrence of Boolean and quotation mark changes with the syntactic changes. Results. A frequency analysis of the occurrence of query transformation codes is presented. The connectivity of graphs obtained from the query transformation is investigated and found to follow an exponential scaling law. The correlation analysis reveals a number of patterns that provide some interesting insights into Web searching by the general public. Conclusion. We have developed analytical methods based on query similarity that can be applied to our current experimental work with volunteer subjects. The results of these will form part of a database with the aim of developing an improved understanding of how the public search the Web.

  18. Fashionista: A Fashion-aware Graphical System for Exploring Visually Similar Items

    OpenAIRE

    He, Ruining; Lin, Chunbin; McAuley, Julian

    2016-01-01

    To build a fashion recommendation system, we need to help users retrieve fashionable items that are visually similar to a particular query, for reasons ranging from searching alternatives (i.e., substitutes), to generating stylish outfits that are visually consistent, among other applications. In domains like clothing and accessories, such considerations are particularly paramount as the visual appearance of items is a critical feature that guides users' decisions. However, existing systems l...

  19. Surface-Level Diversity and Decision-Making in Groups: When Does Deep-Level Similarity Help?

    OpenAIRE

    2006-01-01

    Abstract We examined how surface-level diversity (based on race) and deep-level similarities influenced three-person decision-making groups on a hidden-profile task. Surface-level homogeneous groups perceived their information to be less unique and spent less time on the task than surface-level diverse groups. When the groups were given the opportunity to learn about their deep-level similarities prior to t...

  20. Explicit awareness supports conditional visual search in the retrieval guidance paradigm.

    Science.gov (United States)

    Buttaccio, Daniel R; Lange, Nicholas D; Hahn, Sowon; Thomas, Rick P

    2014-01-01

    In four experiments we explored whether participants would be able to use probabilistic prompts to simplify perceptually demanding visual search in a task we call the retrieval guidance paradigm. On each trial a memory prompt appeared prior to (and during) the search task and the diagnosticity of the prompt(s) was manipulated to provide complete, partial, or non-diagnostic information regarding the target's color on each trial (Experiments 1-3). In Experiment 1 we found that the more diagnostic prompts was associated with faster visual search performance. However, similar visual search behavior was observed in Experiment 2 when the diagnosticity of the prompts was eliminated, suggesting that participants in Experiment 1 were merely relying on base rate information to guide search and were not utilizing the prompts. In Experiment 3 participants were informed of the relationship between the prompts and the color of the target and this was associated with faster search performance relative to Experiment 1, suggesting that the participants were using the prompts to guide search. Additionally, in Experiment 3 a knowledge test was implemented and performance in this task was associated with qualitative differences in search behavior such that participants that were able to name the color(s) most associated with the prompts were faster to find the target than participants who were unable to do so. However, in Experiments 1-3 diagnosticity of the memory prompt was manipulated via base rate information, making it possible that participants were merely relying on base rate information to inform search in Experiment 3. In Experiment 4 we manipulated diagnosticity of the prompts without manipulating base rate information and found a similar pattern of results as Experiment 3. Together, the results emphasize the importance of base rate and diagnosticity information in visual search behavior. In the General discussion section we explore how a recent computational model of

  1. Differences and similarities in double special educational needs: high abilities/giftedness x Asperger’s Syndrome

    Directory of Open Access Journals (Sweden)

    Nara Joyce Wellausen Vieira

    2012-08-01

    Full Text Available The study was developed from a literature search in books, articles and theses that have been published since the year 2000 on the theme High Abilities / Giftedness and Asperger’s Syndrome. The objectives of this research were to conduct a search on publications from 2000 to 2011, about the common and different features to the person with Asperger syndrome and high ability gifted, and also relate the number of publications found in Education and Special Education. At theoretical we present the conception of High Abilities / Giftedness of Renzulli (2004 and Gardner (2000 and in the conception of Asperger Syndrome, Mello (2007 and Klin (2006. When analyzing the data, were perceived similarities and differences between the behavioral characteristics of individuals with High Abilities / Giftedness and those with Asperger’s Syndrome. It’s possible point out that there is much evidence that separate these two special educational needs and few similarities between them. But do not neglect that there may be a dual disability between these two particular special educational needs, because there are still few studies that verify theoretically the differences and similarities of these subjects, much less those that investigate these similarities and distinctions in the subjects themselves.

  2. A Visual lexicon to Handle Semantic Similarity in Design precedents

    DEFF Research Database (Denmark)

    Restrepo-Giraldo, John Dairo

    2007-01-01

    The adequate use of existing knowledge, and not only the creation of completely new solutions, is also an important part of creative thinking. When conceiving a solution, designers oftentimes report having a vague image of the form that will embody the final solution to the design task at hand...... recognition techniques to index and retrieve visual information called Content Based Image Retrieval (CBIR). In this approach, the designer gives the computer tool an image and the computer searches for images that are similar to the example given. For this, the computer looks for geometrical features...... for visual information. The reason is that the algorithms available cannot recognize what the image contains (in semantic terms) but humans can, and with great facility. This ability was reflected in the searching process of the designers in our studies. It is very natural for them to expect living room...

  3. Prospects of hydrocarbon deposits exploration using the method of induced polarization during geomagnetic-variation profiling

    Directory of Open Access Journals (Sweden)

    К. М. Ермохин

    2017-10-01

    Full Text Available Traditionally it is believed that the effect of induced polarization is an interfering factor for the measurement of electromagnetic fields and their interpretation during conducting works using magnetotelluric sounding and geomag-netic-variation profiling methods. A new method is proposed for isolating the effects of induced polarization during geomagnetic-variation profiling aimed at searching for hydrocarbon deposits on the basis of phase measurements during the conduct of geomagnetic-variation profiling. The phenomenon of induced polarization is proposed to be used as a special exploration mark for deep-lying hydrocarbon deposits. The traditional method of induced polarization uses artificial field sources, the powers of which are principally insufficient to reach depths of 3-5 km, which leads to the need to search for alternative - natural sources in the form of telluric and magnetotelluric fields. The proposed method makes it possible to detect and interpret the effects of induced polarization from deep-seated oil and gas reservoirs directly, without relying on indirect signs.

  4. Search for Radions at LEP2

    CERN Document Server

    Abbiendi, G.; Akesson, P.F.; Alexander, G.; Allison, John; Amaral, P.; Anagnostou, G.; Anderson, K.J.; Asai, S.; Axen, D.; Bailey, I.; Barberio, E.; Barillari, T.; Barlow, R.J.; Batley, R.J.; Bechtle, P.; Behnke, T.; Bell, Kenneth Watson; Bell, P.J.; Bella, G.; Bellerive, A.; Benelli, G.; Bethke, S.; Biebel, O.; Boeriu, O.; Bock, P.; Boutemeur, M.; Braibant, S.; Brown, Robert M.; Burckhart, H.J.; Campana, S.; Capiluppi, P.; Carnegie, R.K.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, D.G.; Ciocca, C.; Csilling, A.; Cuffiani, M.; Dado, S.; De Roeck, A.; De Wolf, E.A.; Desch, K.; Dienes, B.; Donkers, M.; Dubbert, J.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Etzion, E.; Fabbri, F.; Ferrari, P.; Fiedler, F.; Fleck, I.; Ford, M.; Frey, A.; Gagnon, P.; Gary, John William; Geich-Gimbel, C.; Giacomelli, G.; Giacomelli, P.; Giunta, Marina; Goldberg, J.; Gross, E.; Grunhaus, J.; Gruwe, M.; Gunther, P.O.; Gupta, A.; Hajdu, C.; Hamann, M.; Hanson, G.G.; Harel, A.; Hauschild, M.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Herten, G.; Heuer, R.D.; Hill, J.C.; Hoffman, Kara Dion; Horvath, D.; Igo-Kemenes, P.; Ishii, K.; Jeremie, H.; Jovanovic, P.; Junk, T.R.; Kanzaki, J.; Karlen, D.; Kawagoe, K.; Kawamoto, T.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kluth, S.; Kobayashi, T.; Kobel, M.; Komamiya, S.; Kramer, T.; Krieger, P.; von Krogh, J.; Kuhl, T.; Kupper, M.; Lafferty, G.D.; Landsman, H.; Lanske, D.; Lellouch, D.; Lettso, J.; Levinson, L.; Lillich, J.; Lloyd, S.L.; Loebinger, F.K.; Lu, J.; Ludwig, A.; Ludwig, J.; Mader, W.; Marcellini, S.; Martin, A.J.; Masetti, G.; Mashimo, T.; Mattig, Peter; McKenna, J.; McPherson, R.A.; Meijers, F.; Menges, W.; Merritt, F.S.; Mes, H.; Meyer, Niels T.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Mohr, W.; Mori, T.; Mutter, A.; Nagai, K.; Nakamura, I.; Nanjo, H.; Neal, H.A.; Nisius, R.; O'Neale, S.W.; Oh, A.; Oreglia, M.J.; Orito, S.; Pahl, C.; Pasztor, G.; Pater, J.R.; Pilcher, J.E.; Pinfold, J.; Plane, David E.; Pooth, O.; Przybycien, M.; Quadt, A.; Rabbertz, K.; Rembser, C.; Renkel, P.; Roney, J.M.; Rossi, A.M.; Rozen, Y.; Runge, K.; Sachs, K.; Saeki, T.; Sarkisyan, E.K.G.; Schaile, A.D.; Schaile, O.; Scharff-Hansen, P.; Schieck, J.; Schorner-Sadenius, T.; Schroder, Matthias; Schumacher, M.; Seuster, R.; Shears, T.G.; Shen, B.C.; Sherwood, P.; Skuja, A.; Smith, A.M.; Sobie, R.; Soldner-Rembold, S.; Spano, F.; Stahl, A.; Strom, David M.; Strohmer, R.; Tarem, S.; Tasevsky, M.; Teuscher, R.; Thomson, M.A.; Torrence, E.; Toya, D.; Tran, P.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turner-Watson, M.F.; Ueda, I.; Ujvari, B.; Vollmer, C.F.; Vannerem, P.; Vertesi, R.; Verzocchi, M.; Voss, H.; Vossebeld, J.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wengler, T.; Wermes, N.; Wilson, G.W.; Wilson, J.A.; Wolf, G.; Wyatt, T.R.; Yamashita, S.; Zer-Zion, D.; Zivkovic, Lidija

    2005-01-01

    A new scalar resonance, called the radion, with couplings to fermions and bosons similar to those of the Higgs boson, is predicted in the framework of Randall-Sundrum models, proposed solutions to the hierarchy problem with one extra dimension. An important distinction between the radion and the Higgs boson is that the radion would couple directly to gluon pairs, and in particular its decay products would include a significant fraction of gluon jets. The radion had the same quantum numbers as the Standard Model (SM) Higgs boson, and therefore they can mix, with the resulting mass eigenstates having properties different from those of the SM Higgs boson. Existing searches for the Higgs boson are sensitive to the possible production and decay of radions and Higgs bosons in these models. For the first time, searches for the SM Higgs boson and flavour-independent and decay-mode independent searches for a neutral Higgs boson are used in combination to explore the parameter space of the Randall-Sundrum model. In the...

  5. Visual search elicits the electrophysiological marker of visual working memory.

    Directory of Open Access Journals (Sweden)

    Stephen M Emrich

    Full Text Available BACKGROUND: Although limited in capacity, visual working memory (VWM plays an important role in many aspects of visually-guided behavior. Recent experiments have demonstrated an electrophysiological marker of VWM encoding and maintenance, the contralateral delay activity (CDA, which has been shown in multiple tasks that have both explicit and implicit memory demands. Here, we investigate whether the CDA is evident during visual search, a thoroughly-researched task that is a hallmark of visual attention but has no explicit memory requirements. METHODOLOGY/PRINCIPAL FINDINGS: The results demonstrate that the CDA is present during a lateralized search task, and that it is similar in amplitude to the CDA observed in a change-detection task, but peaks slightly later. The changes in CDA amplitude during search were strongly correlated with VWM capacity, as well as with search efficiency. These results were paralleled by behavioral findings showing a strong correlation between VWM capacity and search efficiency. CONCLUSIONS/SIGNIFICANCE: We conclude that the activity observed during visual search was generated by the same neural resources that subserve VWM, and that this activity reflects the maintenance of previously searched distractors.

  6. Fast and accurate protein substructure searching with simulated annealing and GPUs

    Directory of Open Access Journals (Sweden)

    Stivala Alex D

    2010-09-01

    Full Text Available Abstract Background Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioinformatics. While there are many existing methods for structural similarity searching, faster and more accurate approaches are still required, and few current methods are capable of substructure (motif searching. Results We developed an improved heuristic for tableau-based protein structure and substructure searching using simulated annealing, that is as fast or faster and comparable in accuracy, with some widely used existing methods. Furthermore, we created a parallel implementation on a modern graphics processing unit (GPU. Conclusions The GPU implementation achieves up to 34 times speedup over the CPU implementation of tableau-based structure search with simulated annealing, making it one of the fastest available methods. To the best of our knowledge, this is the first application of a GPU to the protein structural search problem.

  7. Search Patterns

    CERN Document Server

    Morville, Peter

    2010-01-01

    What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

  8. Search for rapid spectral variability in Psi(9) Aurigae

    International Nuclear Information System (INIS)

    Ghosh, K.K.

    1989-01-01

    Observations of Psi(9) Aur on five nights between January 29 and February 3, 1988 were conducted as part of a search for rapid spectral variability in Be stars. In addition, a series of H-alpha profiles with a time resolution of about 45 s was obtained for the star. A method for obtaining the standard deviation in continuum counts measurements is proposed. The estimated value of the standard deviation of the measured equivalent widths of the H-alpha profiles was obtained using the method of Chalabaev and Maillard (1983). Rapid variations of the standard deviations of continuum counts and H-alpha equivalent widths were not observed. For the continuum counts measurement standard deviations a few hourly variations and two night-to-night variations were found. 16 refs

  9. Mastering Search Analytics Measuring SEO, SEM and Site Search

    CERN Document Server

    Chaters, Brent

    2011-01-01

    Many companies still approach Search Engine Optimization (SEO) and paid search as separate initiatives. This in-depth guide shows you how to use these programs as part of a comprehensive strategy-not just to improve your site's search rankings, but to attract the right people and increase your conversion rate. Learn how to measure, test, analyze, and interpret all of your search data with a wide array of analytic tools. Gain the knowledge you need to determine the strategy's return on investment. Ideal for search specialists, webmasters, and search marketing managers, Mastering Search Analyt

  10. Strong profiling is not mathematically optimal for discovering rare malfeasors

    Energy Technology Data Exchange (ETDEWEB)

    Press, William H [Los Alamos National Laboratory

    2008-01-01

    In a large population of individuals labeled j = 1,2,...,N, governments attempt to find the rare malfeasor j = j, (terrorist, for example) by making use of priors p{sub j} that estimate the probability of individual j being a malfeasor. Societal resources for secondary random screening such as airport search or police investigation are concentrated against individuals with the largest priors. They may call this 'strong profiling' if the concentration is at least proportional to p{sub j} for the largest values. Strong profiling often results in higher probability, but otherwise innocent, individuals being repeatedly subjected to screening. They show here that, entirely apart from considerations of social policy, strong profiling is not mathematically optimal at finding malfeasors. Even if prior probabilities were accurate, their optimal use would be only as roughly the geometric mean between a strong profiling and a completely uniform sampling of the population.

  11. Advertising and Consumer Search in a Duopoly Model

    NARCIS (Netherlands)

    M.C.W. Janssen (Maarten); M.C. Non (Marielle)

    2005-01-01

    textabstractWe consider a duopoly in a homogenous goods market where part of the consumers are ex ante uninformed about prices. Information can come through two different channels: advertising and sequential consumer search. The model is similar to that of Robert and Stahl (1993) with two major (and

  12. High-Specificity Targeted Functional Profiling in Microbial Communities with ShortBRED.

    Directory of Open Access Journals (Sweden)

    James Kaminski

    2015-12-01

    Full Text Available Profiling microbial community function from metagenomic sequencing data remains a computationally challenging problem. Mapping millions of DNA reads from such samples to reference protein databases requires long run-times, and short read lengths can result in spurious hits to unrelated proteins (loss of specificity. We developed ShortBRED (Short, Better Representative Extract Dataset to address these challenges, facilitating fast, accurate functional profiling of metagenomic samples. ShortBRED consists of two components: (i a method that reduces reference proteins of interest to short, highly representative amino acid sequences ("markers" and (ii a search step that maps reads to these markers to quantify the relative abundance of their associated proteins. After evaluating ShortBRED on synthetic data, we applied it to profile antibiotic resistance protein families in the gut microbiomes of individuals from the United States, China, Malawi, and Venezuela. Our results support antibiotic resistance as a core function in the human gut microbiome, with tetracycline-resistant ribosomal protection proteins and Class A beta-lactamases being the most widely distributed resistance mechanisms worldwide. ShortBRED markers are applicable to other homology-based search tasks, which we demonstrate here by identifying phylogenetic signatures of antibiotic resistance across more than 3,000 microbial isolate genomes. ShortBRED can be applied to profile a wide variety of protein families of interest; the software, source code, and documentation are available for download at http://huttenhower.sph.harvard.edu/shortbred.

  13. HBLAST: Parallelised sequence similarity--A Hadoop MapReducable basic local alignment search tool.

    Science.gov (United States)

    O'Driscoll, Aisling; Belogrudov, Vladislav; Carroll, John; Kropp, Kai; Walsh, Paul; Ghazal, Peter; Sleator, Roy D

    2015-04-01

    The recent exponential growth of genomic databases has resulted in the common task of sequence alignment becoming one of the major bottlenecks in the field of computational biology. It is typical for these large datasets and complex computations to require cost prohibitive High Performance Computing (HPC) to function. As such, parallelised solutions have been proposed but many exhibit scalability limitations and are incapable of effectively processing "Big Data" - the name attributed to datasets that are extremely large, complex and require rapid processing. The Hadoop framework, comprised of distributed storage and a parallelised programming framework known as MapReduce, is specifically designed to work with such datasets but it is not trivial to efficiently redesign and implement bioinformatics algorithms according to this paradigm. The parallelisation strategy of "divide and conquer" for alignment algorithms can be applied to both data sets and input query sequences. However, scalability is still an issue due to memory constraints or large databases, with very large database segmentation leading to additional performance decline. Herein, we present Hadoop Blast (HBlast), a parallelised BLAST algorithm that proposes a flexible method to partition both databases and input query sequences using "virtual partitioning". HBlast presents improved scalability over existing solutions and well balanced computational work load while keeping database segmentation and recompilation to a minimum. Enhanced BLAST search performance on cheap memory constrained hardware has significant implications for in field clinical diagnostic testing; enabling faster and more accurate identification of pathogenic DNA in human blood or tissue samples. Copyright © 2015 Elsevier Inc. All rights reserved.

  14. Fast, Inclusive Searches for Geographic Names Using Digraphs

    Science.gov (United States)

    Donato, David I.

    2008-01-01

    An algorithm specifies how to quickly identify names that approximately match any specified name when searching a list or database of geographic names. Based on comparisons of the digraphs (ordered letter pairs) contained in geographic names, this algorithmic technique identifies approximately matching names by applying an artificial but useful measure of name similarity. A digraph index enables computer name searches that are carried out using this technique to be fast enough for deployment in a Web application. This technique, which is a member of the class of n-gram algorithms, is related to, but distinct from, the soundex, PHONIX, and metaphone phonetic algorithms. Despite this technique's tendency to return some counterintuitive approximate matches, it is an effective aid for fast, inclusive searches for geographic names when the exact name sought, or its correct spelling, is unknown.

  15. Modeling guidance and recognition in categorical search: bridging human and computer object detection.

    Science.gov (United States)

    Zelinsky, Gregory J; Peng, Yifan; Berg, Alexander C; Samaras, Dimitris

    2013-10-08

    Search is commonly described as a repeating cycle of guidance to target-like objects, followed by the recognition of these objects as targets or distractors. Are these indeed separate processes using different visual features? We addressed this question by comparing observer behavior to that of support vector machine (SVM) models trained on guidance and recognition tasks. Observers searched for a categorically defined teddy bear target in four-object arrays. Target-absent trials consisted of random category distractors rated in their visual similarity to teddy bears. Guidance, quantified as first-fixated objects during search, was strongest for targets, followed by target-similar, medium-similarity, and target-dissimilar distractors. False positive errors to first-fixated distractors also decreased with increasing dissimilarity to the target category. To model guidance, nine teddy bear detectors, using features ranging in biological plausibility, were trained on unblurred bears then tested on blurred versions of the same objects appearing in each search display. Guidance estimates were based on target probabilities obtained from these detectors. To model recognition, nine bear/nonbear classifiers, trained and tested on unblurred objects, were used to classify the object that would be fixated first (based on the detector estimates) as a teddy bear or a distractor. Patterns of categorical guidance and recognition accuracy were modeled almost perfectly by an HMAX model in combination with a color histogram feature. We conclude that guidance and recognition in the context of search are not separate processes mediated by different features, and that what the literature knows as guidance is really recognition performed on blurred objects viewed in the visual periphery.

  16. Passage-Based Bibliographic Coupling: An Inter-Article Similarity Measure for Biomedical Articles

    Science.gov (United States)

    Liu, Rey-Long

    2015-01-01

    Biomedical literature is an essential source of biomedical evidence. To translate the evidence for biomedicine study, researchers often need to carefully read multiple articles about specific biomedical issues. These articles thus need to be highly related to each other. They should share similar core contents, including research goals, methods, and findings. However, given an article r, it is challenging for search engines to retrieve highly related articles for r. In this paper, we present a technique PBC (Passage-based Bibliographic Coupling) that estimates inter-article similarity by seamlessly integrating bibliographic coupling with the information collected from context passages around important out-link citations (references) in each article. Empirical evaluation shows that PBC can significantly improve the retrieval of those articles that biomedical experts believe to be highly related to specific articles about gene-disease associations. PBC can thus be used to improve search engines in retrieving the highly related articles for any given article r, even when r is cited by very few (or even no) articles. The contribution is essential for those researchers and text mining systems that aim at cross-validating the evidence about specific gene-disease associations. PMID:26440794

  17. Passage-Based Bibliographic Coupling: An Inter-Article Similarity Measure for Biomedical Articles.

    Directory of Open Access Journals (Sweden)

    Rey-Long Liu

    Full Text Available Biomedical literature is an essential source of biomedical evidence. To translate the evidence for biomedicine study, researchers often need to carefully read multiple articles about specific biomedical issues. These articles thus need to be highly related to each other. They should share similar core contents, including research goals, methods, and findings. However, given an article r, it is challenging for search engines to retrieve highly related articles for r. In this paper, we present a technique PBC (Passage-based Bibliographic Coupling that estimates inter-article similarity by seamlessly integrating bibliographic coupling with the information collected from context passages around important out-link citations (references in each article. Empirical evaluation shows that PBC can significantly improve the retrieval of those articles that biomedical experts believe to be highly related to specific articles about gene-disease associations. PBC can thus be used to improve search engines in retrieving the highly related articles for any given article r, even when r is cited by very few (or even no articles. The contribution is essential for those researchers and text mining systems that aim at cross-validating the evidence about specific gene-disease associations.

  18. Dual-target cost in visual search for multiple unfamiliar faces.

    Science.gov (United States)

    Mestry, Natalie; Menneer, Tamaryn; Cave, Kyle R; Godwin, Hayward J; Donnelly, Nick

    2017-08-01

    The efficiency of visual search for one (single-target) and either of two (dual-target) unfamiliar faces was explored to understand the manifestations of capacity and guidance limitations in face search. The visual similarity of distractor faces to target faces was manipulated using morphing (Experiments 1 and 2) and multidimensional scaling (Experiment 3). A dual-target cost was found in all experiments, evidenced by slower and less accurate search in dual- than single-target conditions. The dual-target cost was unequal across the targets, with performance being maintained on one target and reduced on the other, which we label "preferred" and "non-preferred" respectively. We calculated the capacity for each target face and show reduced capacity for representing the non-preferred target face. However, results show that the capacity for the non-preferred target can be increased when the dual-target condition is conducted after participants complete the single-target conditions. Analyses of eye movements revealed evidence for weak guidance of fixations in single-target search, and when searching for the preferred target in dual-target search. Overall, the experiments show dual-target search for faces is capacity- and guidance-limited, leading to superior search for 1 face over the other in dual-target search. However, learning faces individually may improve capacity with the second face. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

  19. Search Help

    Science.gov (United States)

    Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

  20. An assessment of professionalism on students' Facebook profiles.

    Science.gov (United States)

    Nason, K N; Byrne, H; Nason, G J; O'Connell, B

    2018-02-01

    With the advent of social media, healthcare professionals not only need to be conscious of professionalism in their face-to-face interactions but also in the electronic environment. The aim of this study was to assess the level of online professionalism on Facebook profiles available for public viewing of students from a dental school. A search was performed via a new Facebook account of all students in the University Dental School (dental hygiene, dental nursing, dental science and dental technology). Profiles were categorised as 'private' or 'public'. Demographic details and photographs/comments of unprofessional behaviour were recorded for each individual Facebook profile. Each profile was subsequently scored with regard to professionalism based on a previously published score. There are a total of 287 students in the dental school. Of these, 62% (n = 177) had a Facebook account. Three per cent (n = 6) had a public account (fully accessible) whilst 97% (n = 171) had a private account (limited access); 36% (n = 63) of students mentioned the dental school/hospital on their profile; 34% (n = 60) had questionable content on their profile whilst 3% (n = 6) had definite violations of professionalism on their profile; and 25% (n = 44) had unprofessional photographs on their profile. Of those with unprofessional content, 52% (n = 23) of these had a documented affiliation with the dental school also visible on their profile. There was a concerning level of unprofessional content visible on students' Facebook profiles. Students need to be fully aware of their professional responsibility in the setting of social media. © 2016 The Authors. European Journal of Dental Education Published by John Wiley & Sons Ltd.

  1. MinHash-Based Fuzzy Keyword Search of Encrypted Data across Multiple Cloud Servers

    Directory of Open Access Journals (Sweden)

    Jingsha He

    2018-05-01

    Full Text Available To enhance the efficiency of data searching, most data owners store their data files in different cloud servers in the form of cipher-text. Thus, efficient search using fuzzy keywords becomes a critical issue in such a cloud computing environment. This paper proposes a method that aims at improving the efficiency of cipher-text retrieval and lowering storage overhead for fuzzy keyword search. In contrast to traditional approaches, the proposed method can reduce the complexity of Min-Hash-based fuzzy keyword search by using Min-Hash fingerprints to avoid the need to construct the fuzzy keyword set. The method will utilize Jaccard similarity to rank the results of retrieval, thus reducing the amount of calculation for similarity and saving a lot of time and space overhead. The method will also take consideration of multiple user queries through re-encryption technology and update user permissions dynamically. Security analysis demonstrates that the method can provide better privacy preservation and experimental results show that efficiency of cipher-text using the proposed method can improve the retrieval time and lower storage overhead as well.

  2. Pain sensitivity profiles in patients with advanced knee osteoarthritis

    Science.gov (United States)

    Frey-Law, Laura A.; Bohr, Nicole L.; Sluka, Kathleen A.; Herr, Keela; Clark, Charles R.; Noiseux, Nicolas O.; Callaghan, John J; Zimmerman, M Bridget; Rakel, Barbara A.

    2016-01-01

    The development of patient profiles to subgroup individuals on a variety of variables has gained attention as a potential means to better inform clinical decision-making. Patterns of pain sensitivity response specific to quantitative sensory testing (QST) modality have been demonstrated in healthy subjects. It has not been determined if these patterns persist in a knee osteoarthritis population. In a sample of 218 participants, 19 QST measures along with pain, psychological factors, self-reported function, and quality of life were assessed prior to total knee arthroplasty. Component analysis was used to identify commonalities across the 19 QST assessments to produce standardized pain sensitivity factors. Cluster analysis then grouped individuals that exhibited similar patterns of standardized pain sensitivity component scores. The QST resulted in four pain sensitivity components: heat, punctate, temporal summation, and pressure. Cluster analysis resulted in five pain sensitivity profiles: a “low pressure pain” group, an “average pain” group, and three “high pain” sensitivity groups who were sensitive to different modalities (punctate, heat, and temporal summation). Pain and function differed between pain sensitivity profiles, along with sex distribution; however no differences in OA grade, medication use, or psychological traits were found. Residualizing QST data by age and sex resulted in similar components and pain sensitivity profiles. Further, these profiles are surprisingly similar to those reported in healthy populations suggesting that individual differences in pain sensitivity are a robust finding even in an older population with significant disease. PMID:27152688

  3. Tales from the Field: Search Strategies Applied in Web Searching

    Directory of Open Access Journals (Sweden)

    Soohyung Joo

    2010-08-01

    Full Text Available In their web search processes users apply multiple types of search strategies, which consist of different search tactics. This paper identifies eight types of information search strategies with associated cases based on sequences of search tactics during the information search process. Thirty-one participants representing the general public were recruited for this study. Search logs and verbal protocols offered rich data for the identification of different types of search strategies. Based on the findings, the authors further discuss how to enhance web-based information retrieval (IR systems to support each type of search strategy.

  4. Subgroup-specific intrinsic disorder profiles of arabidopsis NAC transcription factors

    DEFF Research Database (Denmark)

    Stender, Emil G.; O'Shea, Charlotte; Skriver, Karen

    2015-01-01

    disordered but contain short, functionally important regions with structure propensities known as molecular recognition features. Here, we analyze for NAC subgroup-specific ID patterns. Some subgroups, such as the VND subgroup implicated in secondary cell wall biosynthesis, and the NAP/SHYG subgroup have...... highly conserved ID profiles. For the stress-associated ATAF1 subgroup and the CUC/ORE1 subgroup involved in development, only sub clades have similar ID patterns. For similar ID profiles, conserved molecular recognition features and sequence motifs represent likely functional determinants of e.......g. transcriptional activation and interactions. Based on our analysis, we suggest that ID profiling of regulatory proteins in general can be used to guide identification of interaction partners of network proteins....

  5. MEGGASENSE - The Metagenome/Genome Annotated Sequence Natural Language Search Engine: A Platform for 
the Construction of Sequence Data Warehouses.

    Science.gov (United States)

    Gacesa, Ranko; Zucko, Jurica; Petursdottir, Solveig K; Gudmundsdottir, Elisabet Eik; Fridjonsson, Olafur H; Diminic, Janko; Long, Paul F; Cullum, John; Hranueli, Daslav; Hreggvidsson, Gudmundur O; Starcevic, Antonio

    2017-06-01

    The MEGGASENSE platform constructs relational databases of DNA or protein sequences. The default functional analysis uses 14 106 hidden Markov model (HMM) profiles based on sequences in the KEGG database. The Solr search engine allows sophisticated queries and a BLAST search function is also incorporated. These standard capabilities were used to generate the SCATT database from the predicted proteome of Streptomyces cattleya . The implementation of a specialised metagenome database (AMYLOMICS) for bioprospecting of carbohydrate-modifying enzymes is described. In addition to standard assembly of reads, a novel 'functional' assembly was developed, in which screening of reads with the HMM profiles occurs before the assembly. The AMYLOMICS database incorporates additional HMM profiles for carbohydrate-modifying enzymes and it is illustrated how the combination of HMM and BLAST analyses helps identify interesting genes. A variety of different proteome and metagenome databases have been generated by MEGGASENSE.

  6. Characterisation of nutrient profile of quinoa (Chenopodium quinoa), amaranth (Amaranthus caudatus), and purple corn (Zea mays L.) consumed in the North of Argentina: proximates, minerals and trace elements.

    Science.gov (United States)

    Nascimento, Ana Cláudia; Mota, Carla; Coelho, Inês; Gueifão, Sandra; Santos, Mariana; Matos, Ana Sofia; Gimenez, Alejandra; Lobo, Manuel; Samman, Norma; Castanheira, Isabel

    2014-04-01

    Quinoa, amaranth and purple corn are Andean cereals largely consumed in North of Argentina. Nutrient analysis with the purpose of inclusion in the Argentinean FCDB and e-search EuroFIR has become urgent matter. In this work proximate and mineral profile of Andean cereals cultivated in the North of Argentina were determined and compared with rice. Proximate analysis showed that Andean cereals have similar profile but significantly higher (pquinoa content could contribute up to 55% of consumers DRI. Andean cereals and rice are poor sources of potassium. To guarantee the interchange of data among users and producers of FCDB component values were obtained in compliance with EuroFIR guidelines for compilation process. Present work provides necessary information to FCDB users who wish to have access to food reference analytical parameters. Copyright © 2013 Elsevier Ltd. All rights reserved.

  7. Comprehensive genomic profiling reveals inactivating SMARCA4 mutations and low tumor mutational burden in small cell carcinoma of the ovary, hypercalcemic-type.

    Science.gov (United States)

    Lin, Douglas I; Chudnovsky, Yakov; Duggan, Bridget; Zajchowski, Deborah; Greenbowe, Joel; Ross, Jeffrey S; Gay, Laurie M; Ali, Siraj M; Elvin, Julia A

    2017-12-01

    Small cell carcinoma of the ovary, hypercalcemic-type (SCCOHT) is a rare, extremely aggressive neoplasm that usually occurs in young women and is characterized by deleterious germline or somatic SMARCA4 mutations. We performed comprehensive genomic profiling (CGP) to potentially identify additional clinically and pathophysiologically relevant genomic alterations in SCCOHT. CGP assessment of all classes of coding alterations in up to 406 genes commonly altered in cancer and intronic regions for up to 31 genes commonly rearranged in cancer was performed on 18 SCCOHT cases (16 exhibiting classic morphology and 2 cases exhibiting exclusive a large cell variant morphology). In addition, a retrospective database search for clinically advanced ovarian tumors with genomic profiles similar to SCCOHT yielded 3 additional cases originally diagnosed as non-SCCOHT. CGP revealed inactivating SMARCA4 alterations and low tumor mutational burden (TMB) (<6mutations/Mb) in 94% (15/16) of SCCOHT with classic morphology. In contrast, both (2/2) cases exhibiting only large cell variant morphology were hypermutated (TMB scores of 90 and 360mut/Mb) and were wildtype for SMARCA4. In our retrospective search, an index ovarian cancer patient harboring inactivating SMARCA4 alterations, initially diagnosed as endometrioid carcinoma, was re-classified as SCCOHT and responded to an SCCOHT chemotherapy regimen. The vast majority of SCCOHT demonstrate genomic SMARCA4 loss with only rare co-occurring alterations. Our data support a role for CGP in the diagnosis and management of SCCOHT and of other lesions with overlapping histological and clinical features, since identifying the former by genomic profile suggests benefit from an appropriate regimen and treatment decisions, as illustrated by an index patient. Copyright © 2017 Elsevier Inc. All rights reserved.

  8. Internet Search Engines

    OpenAIRE

    Fatmaa El Zahraa Mohamed Abdou

    2004-01-01

    A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

  9. University Students' Online Information Searching Strategies in Different Search Contexts

    Science.gov (United States)

    Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung

    2012-01-01

    This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…

  10. Routine development of objectively derived search strategies

    Directory of Open Access Journals (Sweden)

    Hausner Elke

    2012-02-01

    Full Text Available Abstract Background Over the past few years, information retrieval has become more and more professionalized, and information specialists are considered full members of a research team conducting systematic reviews. Research groups preparing systematic reviews and clinical practice guidelines have been the driving force in the development of search strategies, but open questions remain regarding the transparency of the development process and the available resources. An empirically guided approach to the development of a search strategy provides a way to increase transparency and efficiency. Methods Our aim in this paper is to describe the empirically guided development process for search strategies as applied by the German Institute for Quality and Efficiency in Health Care (Institut für Qualität und Wirtschaftlichkeit im Gesundheitswesen, or "IQWiG". This strategy consists of the following steps: generation of a test set, as well as the development, validation and standardized documentation of the search strategy. Results We illustrate our approach by means of an example, that is, a search for literature on brachytherapy in patients with prostate cancer. For this purpose, a test set was generated, including a total of 38 references from 3 systematic reviews. The development set for the generation of the strategy included 25 references. After application of textual analytic procedures, a strategy was developed that included all references in the development set. To test the search strategy on an independent set of references, the remaining 13 references in the test set (the validation set were used. The validation set was also completely identified. Discussion Our conclusion is that an objectively derived approach similar to that used in search filter development is a feasible way to develop and validate reliable search strategies. Besides creating high-quality strategies, the widespread application of this approach will result in a

  11. In Search of the Right Questions: Language Background Profiling at Ontario Public Schools

    Directory of Open Access Journals (Sweden)

    Nikolay Slavkov

    2016-06-01

    Full Text Available Abstract This article examines some of the challenges that the notion of a (monolingual native speaker faces in a global context of increasing awareness that bilingualism and multilingualism are the norm rather than the exception. It also discusses the distinction between two child language acquisition environments, bilingual first language acquisition and early second language acquisition, which can lead to bilingual or multilingual outcomes early on in life. This serves as a backdrop for a study of language profiling practices in public schools across the province of Ontario. Student registration forms from 44 district school boards were analysed with regard to the number, type and combination patterns of language background questions. The findings indicate that school boards are aware of the potentially diverse linguistic backgrounds of incoming students, but may not be conceptually or methodologically equipped to recognize the full spectrum of linguistic complexity involved. Some degree of standardization of language background profiling across different districts is recommended as a measure that may benefit the province. Résumé Cet article examine certains défis auxquels la notion d’un locuteur natif (monolingue fait face dans un contexte mondial où il existe une reconnaissance croissante que le bilinguisme et le multilinguisme représentent la norme plutôt que l’exception. L’article aborde également la distinction entre deux contextes d’acquisition de la langue chez les enfants, ceux-ci étant l'acquisition bilingue de la langue première et l’acquisition précoce de la langue seconde, qui peuvent mener à des résultats bilingues ou multilingues tôt dans la vie. Ceci sert de toile de fond pour une étude des pratiques de profilage linguistique dans des écoles publiques à travers la province de l’Ontario. Des formulaires d’inscription d’élèves provenant de 44 conseils scolaires ont été analysés en termes du

  12. Crescendo: A Protein Sequence Database Search Engine for Tandem Mass Spectra.

    Science.gov (United States)

    Wang, Jianqi; Zhang, Yajie; Yu, Yonghao

    2015-07-01

    A search engine that discovers more peptides reliably is essential to the progress of the computational proteomics. We propose two new scoring functions (L- and P-scores), which aim to capture similar characteristics of a peptide-spectrum match (PSM) as Sequest and Comet do. Crescendo, introduced here, is a software program that implements these two scores for peptide identification. We applied Crescendo to test datasets and compared its performance with widely used search engines, including Mascot, Sequest, and Comet. The results indicate that Crescendo identifies a similar or larger number of peptides at various predefined false discovery rates (FDR). Importantly, it also provides a better separation between the true and decoy PSMs, warranting the future development of a companion post-processing filtering algorithm.

  13. Further investigation on adaptive search

    Directory of Open Access Journals (Sweden)

    Ming Hong Pi

    2014-05-01

    Full Text Available Adaptive search is one of the fastest fractal compression algorithms and has gained great success in many industrial applications. By substituting the luminance offset by the range block mean, the authors create a completely new version for both the encoding and decoding algorithms. In this paper, theoretically, they prove that the proposed decoding algorithm converges at least as fast as the existing decoding algorithms using the luminance offset. In addition, they prove that the attractor of the decoding algorithm can be represented by a linear combination of range-averaged images. These theorems are very important contributions to the theory and applications of fractal image compression. As a result, the decoding image can be represented as the sum of the DC and AC component images, which is similar with discrete cosine transform or wavelet transform. To further speed up this algorithm and reduce the complexity of range and domain blocks matching, they propose two improvements in this paper, that is, employing the post-quantisation and geometric neighbouring local search to replace the currently used pre-quantisation and the global search, respectively. The corresponding experimental results show the proposed encoding and decoding algorithms can provide a better performance compared with the existing algorithms.

  14. Treatment of periodontitis improves the atherosclerotic profile : a systematic review and meta-analysis

    NARCIS (Netherlands)

    Teeuw, Wijnand J.; Slot, Dagmar E.; Susanto, Hendri; Gerdes, Victor E. A.; Abbas, Frank; D'Aiuto, Francesco; Kastelein, John J. P.; Loos, Bruno G.

    AimSystematic review and meta-analyses to study the robustness of observations that treatment of periodontitis improves the atherosclerotic profile. Material and MethodsLiterature was searched in Medline-PubMed, Cochrane CENTRAL and EMBASE, based on controlled periodontal intervention trials,

  15. Treatment of periodontitis improves the atherosclerotic profile: a systematic review and meta-analysis

    NARCIS (Netherlands)

    Teeuw, W.J.; Slot, D.E.; Susanto, H.; Gerdes, V.E.A.; Abbas, F.; D'Aiuto, F.; Kastelein, J.J.P.; Loos, B.G.

    2014-01-01

    Aim Systematic review and meta-analyses to study the robustness of observations that treatment of periodontitis improves the atherosclerotic profile. Material and Methods Literature was searched in Medline-PubMed, Cochrane CENTRAL and EMBASE, based on controlled periodontal intervention trials,

  16. Treatment of periodontitis improves the atherosclerotic profile: a systematic review and meta-analysis

    NARCIS (Netherlands)

    Teeuw, Wijnand J.; Slot, Dagmar E.; Susanto, Hendri; Gerdes, Victor E. A.; Abbas, Frank; D'Aiuto, Francesco; Kastelein, John J. P.; Loos, Bruno G.

    2014-01-01

    AimSystematic review and meta-analyses to study the robustness of observations that treatment of periodontitis improves the atherosclerotic profile. Material and MethodsLiterature was searched in Medline-PubMed, Cochrane CENTRAL and EMBASE, based on controlled periodontal intervention trials,

  17. D-score: a search engine independent MD-score.

    Science.gov (United States)

    Vaudel, Marc; Breiter, Daniela; Beck, Florian; Rahnenführer, Jörg; Martens, Lennart; Zahedi, René P

    2013-03-01

    While peptides carrying PTMs are routinely identified in gel-free MS, the localization of the PTMs onto the peptide sequences remains challenging. Search engine scores of secondary peptide matches have been used in different approaches in order to infer the quality of site inference, by penalizing the localization whenever the search engine similarly scored two candidate peptides with different site assignments. In the present work, we show how the estimation of posterior error probabilities for peptide candidates allows the estimation of a PTM score called the D-score, for multiple search engine studies. We demonstrate the applicability of this score to three popular search engines: Mascot, OMSSA, and X!Tandem, and evaluate its performance using an already published high resolution data set of synthetic phosphopeptides. For those peptides with phosphorylation site inference uncertainty, the number of spectrum matches with correctly localized phosphorylation increased by up to 25.7% when compared to using Mascot alone, although the actual increase depended on the fragmentation method used. Since this method relies only on search engine scores, it can be readily applied to the scoring of the localization of virtually any modification at no additional experimental or in silico cost. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  18. Visual reinforcement shapes eye movements in visual search.

    Science.gov (United States)

    Paeye, Céline; Schütz, Alexander C; Gegenfurtner, Karl R

    2016-08-01

    We use eye movements to gain information about our visual environment; this information can indirectly be used to affect the environment. Whereas eye movements are affected by explicit rewards such as points or money, it is not clear whether the information gained by finding a hidden target has a similar reward value. Here we tested whether finding a visual target can reinforce eye movements in visual search performed in a noise background, which conforms to natural scene statistics and contains a large number of possible target locations. First we tested whether presenting the target more often in one specific quadrant would modify eye movement search behavior. Surprisingly, participants did not learn to search for the target more often in high probability areas. Presumably, participants could not learn the reward structure of the environment. In two subsequent experiments we used a gaze-contingent display to gain full control over the reinforcement schedule. The target was presented more often after saccades into a specific quadrant or a specific direction. The proportions of saccades meeting the reinforcement criteria increased considerably, and participants matched their search behavior to the relative reinforcement rates of targets. Reinforcement learning seems to serve as the mechanism to optimize search behavior with respect to the statistics of the task.

  19. Reproducibility of Automated Voice Range Profiles, a Systematic Literature Review

    DEFF Research Database (Denmark)

    Printz, Trine; Rosenberg, Tine; Godballe, Christian

    2018-01-01

    literature on test-retest accuracy of the automated voice range profile assessment. Study design: Systematic review. Data sources: PubMed, Scopus, Cochrane Library, ComDisDome, Embase, and CINAHL (EBSCO). Methods: We conducted a systematic literature search of six databases from 1983 to 2016. The following......Objective: Reliable voice range profiles are of great importance when measuring effects and side effects from surgery affecting voice capacity. Automated recording systems are increasingly used, but the reproducibility of results is uncertain. Our objective was to identify and review the existing...... keywords were used: phonetogram, voice range profile, and acoustic voice analysis. Inclusion criteria were automated recording procedure, healthy voices, and no intervention between test and retest. Test-retest values concerning fundamental frequency and voice intensity were reviewed. Results: Of 483...

  20. PLAST: parallel local alignment search tool for database comparison

    Directory of Open Access Journals (Sweden)

    Lavenier Dominique

    2009-10-01

    Full Text Available Abstract Background Sequence similarity searching is an important and challenging task in molecular biology and next-generation sequencing should further strengthen the need for faster algorithms to process such vast amounts of data. At the same time, the internal architecture of current microprocessors is tending towards more parallelism, leading to the use of chips with two, four and more cores integrated on the same die. The main purpose of this work was to design an effective algorithm to fit with the parallel capabilities of modern microprocessors. Results A parallel algorithm for comparing large genomic banks and targeting middle-range computers has been developed and implemented in PLAST software. The algorithm exploits two key parallel features of existing and future microprocessors: the SIMD programming model (SSE instruction set and the multithreading concept (multicore. Compared to multithreaded BLAST software, tests performed on an 8-processor server have shown speedup ranging from 3 to 6 with a similar level of accuracy. Conclusion A parallel algorithmic approach driven by the knowledge of the internal microprocessor architecture allows significant speedup to be obtained while preserving standard sensitivity for similarity search problems.

  1. Identification of kin structure among Guam rail founders: a comparison of pedigrees and DNA profiles

    Science.gov (United States)

    Haig, Susan M.; Ballou, J.D.; Casna, N.J.

    1994-01-01

    Kin structure among founders can have a significant effect on subsequent population structure. Here we use the correlation between DNA profile similarity and relatedness calculated from pedigrees to test hypotheses regarding kin structure among founders to the captive Guam rail (Rallus owstoni) population. Five different pedigrees were generated under the following hypotheses: (i) founders are unrelated; (ii) founders are unrelated except for same-nest chicks; (iii) founders from the same major site are siblings; (iv) founders from the same local site are siblings; and (v) founders are related as defined by a UPGMA cluster analysis of DNA similarity data. Relatedness values from pedigrees 1, 2 and 5 had the highest correlation with DNA similarity but the correlation between relatedness and similarity were not significantly different among pedigrees. Pedigree 5 resulted in the highest correlation overall when using only relatedness values that changed as a result of different founder hypotheses. Thus, founders were assigned relatedness based on pedigree 5 because it had the highest correlations with DNA similarity, was the most conservative approach, and incorporated all field data. The analyses indicated that estimating relatedness using DNA profiles remains problematic, therefore we compared mean kinship, a measure of genetic importance, with mean DNA profile similarity to determine if genetic importance among individuals could be determined via use of DNA profiles alone. The significant correlation suggests this method may provide more information about population structure than was previously thought. Thus, DNA profiles can provide a reasonable explanation for founder relatedness and mean DNA profile similarity may be helpful in determining relative genetic importance of individuals when detailed pedigrees are absent.

  2. Similar profile of cognitive impairment and recovery for Aboriginal Australians in treatment for episodic or chronic alcohol use.

    Science.gov (United States)

    Dingwall, Kylie M; Maruff, Paul; Cairney, Sheree

    2011-08-01

    The cognitive impairment and recovery associated with chronic alcohol abuse and subsequent abstinence is well understood. However, the recovery profile following heavy episodic or 'binge' use, which is common among some Australian Aboriginal users, has not been investigated thoroughly and no empirical studies have examined chronic use in this population. The aim of this study was to identify and compare cognitive impairment and recovery associated with chronic and episodic alcohol use among Aboriginal Australians. Longitudinal case-control design. Residential alcohol treatment programmes in northern Australia. Forty chronic alcohol users, 24 episodic users and 41 healthy controls [mean age = 34.24; standard deviation (SD) = 9.73]. Cognitive assessments of visual motor, attention, memory, learning and executive functions at baseline (start of treatment), then 4 weeks and 8 weeks later. Reassessment of 31% of participants an average of 11 months later (SD = 4.4) comparing those who remained abstinent (n = 5), those who relapsed (n = 11) and healthy controls (n = 19). At baseline, chronic and episodic alcohol users showed impaired visual motor, learning, memory and executive functions. With the exception of visual motor impairment, all deficits had improved to normal levels within 4 weeks. Visual motor deficits had normalized within 11 months. Performances did not differ at any time between chronic and episodic alcohol groups. In Aboriginal Australians, episodic drinking is associated with similar patterns of impairment and recovery as chronic alcohol use. Most cognitive deficits appear to recover within the first month of abstinence, while persisting visual motor problems recover within 1 year. © 2011 The Authors, Addiction © 2011 Society for the Study of Addiction.

  3. INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

    OpenAIRE

    Fadhilah Mat Yamin; T. Ramayah

    2013-01-01

    The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utili...

  4. Dermatological image search engines on the Internet: do they work?

    Science.gov (United States)

    Cutrone, M; Grimalt, R

    2007-02-01

    Atlases on CD-ROM first substituted the use of paediatric dermatology atlases printed on paper. This permitted a faster search and a practical comparison of differential diagnoses. The third step in the evolution of clinical atlases was the onset of the online atlas. Many doctors now use the Internet image search engines to obtain clinical images directly. The aim of this study was to test the reliability of the image search engines compared to the online atlases. We tested seven Internet image search engines with three paediatric dermatology diseases. In general, the service offered by the search engines is good, and continues to be free of charge. The coincidence between what we searched for and what we found was generally excellent, and contained no advertisements. Most Internet search engines provided similar results but some were more user friendly than others. It is not necessary to repeat the same research with Picsearch, Lycos and MSN, as the response would be the same; there is a possibility that they might share software. Image search engines are a useful, free and precise method to obtain paediatric dermatology images for teaching purposes. There is still the matter of copyright to be resolved. What are the legal uses of these 'free' images? How do we define 'teaching purposes'? New watermark methods and encrypted electronic signatures might solve these problems and answer these questions.

  5. The Actor, Partner, Similarity Effects of Personality, and Interactions with Gender and Relationship Duration among Chinese Emerging Adults

    Directory of Open Access Journals (Sweden)

    Yixin Zhou

    2017-09-01

    Full Text Available Understanding personality effects and their role in influencing relationship quality, varied according to gender and relationship duration, could help us better understand close relationships. Participants were Chinese dating dyads and were asked to complete both the Big Five Inventory and Perceived Relationship Quality Component scales. Males and those who had a long-term relationship perceived better relationship quality; individuals who scored higher on agreeableness, conscientiousness, openness, and emotional stability enjoyed better relationship quality; gender and/or relationship duration moderated the actor effect of extraversion and the partner effects of conscientiousness, emotional stability, and openness on relationship quality. Regarding the profile similarity, those couples who were more dissimilar in their profile personality had better relationship quality, especially when they were in a relatively long-term relationship. Meanwhile, with an increase in profile similarity, the males' perceived relationship quality decreased.

  6. [Advanced online search techniques and dedicated search engines for physicians].

    Science.gov (United States)

    Nahum, Yoav

    2008-02-01

    In recent years search engines have become an essential tool in the work of physicians. This article will review advanced search techniques from the world of information specialists, as well as some advanced search engine operators that may help physicians improve their online search capabilities, and maximize the yield of their searches. This article also reviews popular dedicated scientific and biomedical literature search engines.

  7. THE LUMINOSITY PROFILES OF BRIGHTEST CLUSTER GALAXIES

    International Nuclear Information System (INIS)

    Donzelli, C. J.; Muriel, H.; Madrid, J. P.

    2011-01-01

    We have derived detailed R-band luminosity profiles and structural parameters for a total of 430 brightest cluster galaxies (BCGs), down to a limiting surface brightness of 24.5 mag arcsec -2 . Light profiles were initially fitted with a Sersic's R 1/n model, but we found that 205 (∼48%) BCGs require a double component model to accurately match their light profiles. The best fit for these 205 galaxies is an inner Sersic model, with indices n ∼ 1-7, plus an outer exponential component. Thus, we establish the existence of two categories of the BCG luminosity profiles: single and double component profiles. We found that double profile BCGs are brighter (∼0.2 mag) than single profile BCGs. In fact, the Kolmogorov-Smirnov test applied to these subsamples indicates that they have different total magnitude distributions, with mean values M R = -23.8 ± 0.6 mag for single profile BCGs and M R = -24.0 ± 0.5 mag for double profile BCGs. We find that partial luminosities for both subsamples are indistinguishable up to r = 15 kpc, while for r > 20 kpc the luminosities we obtain are on average 0.2 mag brighter for double profile BCGs. This result indicates that extra-light for double profile BCGs does not come from the inner region but from the outer regions of these galaxies. The best-fit slope of the Kormendy relation for the whole sample is a = 3.13 ± 0.04. However, when fitted separately, single and double profile BCGs show different slopes: a single = 3.29 ± 0.06 and a double = 2.79 ± 0.08. Also, the logarithmic slope of the metric luminosity α is higher in double profile BCGs (α double = 0.65 ± 0.12) than in single profile BCGs (α single = 0.59 ± 0.14). The mean isophote outer ellipticity (calculated at μ ∼ 24 mag arcsec -2 ) is higher in double profile BCGs (e double = 0.30 ± 0.10) than in single profile BCGs (e single = 0.26 ± 0.11). Similarly, the mean absolute value of inner minus outer ellipticity is also higher in double profile BCGs. From a

  8. Analysis of semantic search within the domains of uncertainty: using Keyword Effectiveness Indexing as an evaluation tool.

    Science.gov (United States)

    Lorence, Daniel; Abraham, Joanna

    2006-01-01

    Medical and health-related searches pose a special case of risk when using the web as an information resource. Uninsured consumers, lacking access to a trained provider, will often rely on information from the internet for self-diagnosis and treatment. In areas where treatments are uncertain or controversial, most consumers lack the knowledge to make an informed decision. This exploratory technology assessment examines the use of Keyword Effectiveness Indexing (KEI) analysis as a potential tool for profiling information search and keyword retrieval patterns. Results demonstrate that the KEI methodology can be useful in identifying e-health search patterns, but is limited by semantic or text-based web environments.

  9. Diverse Food Items Are Similarly Categorized by 8- to 13-Year-Old Children

    Science.gov (United States)

    Beltran, Alicia; Knight Sepulveda, Karina; Watson, Kathy; Baranowski, Tom; Baranowski, Janice; Islam, Noemi; Missaghian, Mariam

    2008-01-01

    Objective: Assess how 8- to 13-year-old children categorized and labeled food items for possible use as part of a food search strategy in a computerized 24-hour dietary recall. Design: A set of 62 cards with pictures and names of food items from 18 professionally defined food groups was sorted by each child into piles of similar food items.…

  10. Taking Conjunction Search to a Higher Dimension

    Directory of Open Access Journals (Sweden)

    Jeremy M. Wolfe

    2011-05-01

    Full Text Available In visual search for conjunctions, targets are defined by combinations of features. Thus, targets might be RED VERTICAL items among RED horizontal and green VERTICAL distractors. Guided Search and similar models argue that features are conjoined only once an object is attended. However, efficient conjunction search is possible because observers can guide attention toward red and toward vertical. Real-world objects may be defined by the conjunction of many features, with no one feature defining the target. Can attention be guided to higher order conjunctions? We created 6D conjunction stimuli and varied the number of features shared between targets and distractors and the number of distractor types. RT x set size slopes range from 1.4 msec/item when two distractor types each share three features with the target to 66 msec/item when six distractor types each share five features with the target. Using different 3D conjunctions, we held distributions of features constant (1/3 of each of three colors, shapes, and orientations. We varied the grouping of distractors in order to look for evidence of simultaneous guidance by multiple attributes versus sequential grouping of subsets (Find the odd orientation in this color subset. We find that guidance and grouping may both contribute to efficient conjunction search.

  11. GAUSSIAN RANDOM FIELD: PHYSICAL ORIGIN OF SERSIC PROFILES

    International Nuclear Information System (INIS)

    Cen, Renyue

    2014-01-01

    While the Sersic profile family provides adequate fits for the surface brightness profiles of observed galaxies, its physical origin is unknown. We show that if the cosmological density field is seeded by random Gaussian fluctuations, as in the standard cold dark matter model, galaxies with steep central profiles have simultaneously extended envelopes of shallow profiles in the outskirts, whereas galaxies with shallow central profiles are accompanied by steep density profiles in the outskirts. These properties are in accord with those of the Sersic profile family. Moreover, galaxies with steep central profiles form their central regions in smaller denser subunits that possibly merge subsequently, which naturally leads to the formation of bulges. In contrast, galaxies with shallow central profiles form their central regions in a coherent fashion without significant substructure, a necessary condition for disk galaxy formation. Thus, the scenario is self-consistent with respect to the correlation between observed galaxy morphology and the Sersic index. We further predict that clusters of galaxies should display a similar trend, which should be verifiable observationally

  12. Searching Fragment Spaces with feature trees.

    Science.gov (United States)

    Lessel, Uta; Wellenzohn, Bernd; Lilienthal, Markus; Claussen, Holger

    2009-02-01

    Virtual combinatorial chemistry easily produces billions of compounds, for which conventional virtual screening cannot be performed even with the fastest methods available. An efficient solution for such a scenario is the generation of Fragment Spaces, which encode huge numbers of virtual compounds by their fragments/reagents and rules of how to combine them. Similarity-based searches can be performed in such spaces without ever fully enumerating all virtual products. Here we describe the generation of a huge Fragment Space encoding about 5 * 10(11) compounds based on established in-house synthesis protocols for combinatorial libraries, i.e., we encode practically evaluated combinatorial chemistry protocols in a machine readable form, rendering them accessible to in silico search methods. We show how such searches in this Fragment Space can be integrated as a first step in an overall workflow. It reduces the extremely huge number of virtual products by several orders of magnitude so that the resulting list of molecules becomes more manageable for further more elaborated and time-consuming analysis steps. Results of a case study are presented and discussed, which lead to some general conclusions for an efficient expansion of the chemical space to be screened in pharmaceutical companies.

  13. Citrus plastid-related gene profiling based on expressed sequence tag analyses

    Directory of Open Access Journals (Sweden)

    Tercilio Calsa Jr.

    2007-01-01

    Full Text Available Plastid-related sequences, derived from putative nuclear or plastome genes, were searched in a large collection of expressed sequence tags (ESTs and genomic sequences from the Citrus Biotechnology initiative in Brazil. The identified putative Citrus chloroplast gene sequences were compared to those from Arabidopsis, Eucalyptus and Pinus. Differential expression profiling for plastid-directed nuclear-encoded proteins and photosynthesis-related gene expression variation between Citrus sinensis and Citrus reticulata, when inoculated or not with Xylella fastidiosa, were also analyzed. Presumed Citrus plastome regions were more similar to Eucalyptus. Some putative genes appeared to be preferentially expressed in vegetative tissues (leaves and bark or in reproductive organs (flowers and fruits. Genes preferentially expressed in fruit and flower may be associated with hypothetical physiological functions. Expression pattern clustering analysis suggested that photosynthesis- and carbon fixation-related genes appeared to be up- or down-regulated in a resistant or susceptible Citrus species after Xylella inoculation in comparison to non-infected controls, generating novel information which may be helpful to develop novel genetic manipulation strategies to control Citrus variegated chlorosis (CVC.

  14. How Users Search the Library from a Single Search Box

    Science.gov (United States)

    Lown, Cory; Sierra, Tito; Boyer, Josh

    2013-01-01

    Academic libraries are turning increasingly to unified search solutions to simplify search and discovery of library resources. Unfortunately, very little research has been published on library user search behavior in single search box environments. This study examines how users search a large public university library using a prominent, single…

  15. Random searching

    International Nuclear Information System (INIS)

    Shlesinger, Michael F

    2009-01-01

    There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.

  16. Seasonal variation in internet keyword searches: a proxy assessment of sex mating behaviors.

    Science.gov (United States)

    Markey, Patrick M; Markey, Charlotte N

    2013-05-01

    The current study investigated seasonal variation in internet searches regarding sex and mating behaviors. Harmonic analyses were used to examine the seasonal trends of Google keyword searches during the past 5 years for topics related to pornography, prostitution, and mate-seeking. Results indicated a consistent 6-month harmonic cycle with the peaks of keyword searches related to sex and mating behaviors occurring most frequently during winter and early summer. Such results compliment past research that has found similar seasonal trends of births, sexually transmitted infections, condom sales, and abortions.

  17. CP-ABE Based Privacy-Preserving User Profile Matching in Mobile Social Networks.

    Directory of Open Access Journals (Sweden)

    Weirong Cui

    Full Text Available Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference-profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched, and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of-the-art schemes.

  18. CP-ABE Based Privacy-Preserving User Profile Matching in Mobile Social Networks.

    Science.gov (United States)

    Cui, Weirong; Du, Chenglie; Chen, Jinchao

    2016-01-01

    Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference-profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched), and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of-the-art schemes.

  19. Molecular diversity of Clostridium botulinum and phenotypically similar strains.

    Science.gov (United States)

    Grenda, T; Kukier, E; Sieradzki, Z; Goldsztejn, M; Kwiatek, K

    2016-12-01

    This study was undertaken to examine phenotypic and genetic features of strains preliminary classified as Clostridium botulinum species. The phenotypic characteristics were assessed with different culture media and biochemical tests. The genetic characterization included detection of botulinum toxin genes by PCR and macrorestriction analysis with SmaI, XhoI and SacII by PFGE (Pulsed-field Gel Electrophoresis). Despite similar biochemical properties of all analysed strains, only 47% of them contained genes determining toxicity specific to C. botulinum species. The most valuable differentiation of C. botulinum and C. botulinum-like strains was obtained after SmaI digestion. The highest affinity was observed among C. botulinum type B profiles which was even up to 100%. It was found 100% of affinity between C. botulinum and C. botulinum-like strains, however, the similarity among C. botulinum and C. botulinum-like was generally lower than 80%.

  20. A proposed heuristic methodology for searching reloading pattern

    International Nuclear Information System (INIS)

    Choi, K. Y.; Yoon, Y. K.

    1993-01-01

    A new heuristic method for loading pattern search has been developed to overcome shortcomings of the algorithmic approach. To reduce the size of vast solution space, general shuffling rules, a regionwise shuffling method, and a pattern grouping method were introduced. The entropy theory was applied to classify possible loading patterns into groups with similarity between them. The pattern search program was implemented with use of the PROLOG language. A two-group nodal code MEDIUM-2D was used for analysis of power distribution in the core. The above mentioned methodology has been tested to show effectiveness in reducing of solution space down to a few hundred pattern groups. Burnable poison rods were then arranged in each pattern group in accordance with burnable poison distribution rules, which led to further reduction of the solution space to several scores of acceptable pattern groups. The method of maximizing cycle length (MCL) and minimizing power-peaking factor (MPF) were applied to search for specific useful loading patterns from the acceptable pattern groups. Thus, several specific loading patterns that have low power-peaking factor and large cycle length were successfully searched from the selected pattern groups. (Author)

  1. ClinicalKey: a point-of-care search engine.

    Science.gov (United States)

    Vardell, Emily

    2013-01-01

    ClinicalKey is a new point-of-care resource for health care professionals. Through controlled vocabulary, ClinicalKey offers a cross section of resources on diseases and procedures, from journals to e-books and practice guidelines to patient education. A sample search was conducted to demonstrate the features of the database, and a comparison with similar tools is presented.

  2. Fractal Analysis of Rock Joint Profiles

    Science.gov (United States)

    Audy, Ondřej; Ficker, Tomáš

    2017-10-01

    Surface reliefs of rock joints are analyzed in geotechnics when shear strength of rocky slopes is estimated. The rock joint profiles actually are self-affine fractal curves and computations of their fractal dimensions require special methods. Many papers devoted to the fractal properties of these profiles were published in the past but only a few of those papers employed a convenient computational method that would have guaranteed a sound value of that dimension. As a consequence, anomalously low dimensions were presented. This contribution deals with two computational modifications that lead to sound fractal dimensions of the self-affine rock joint profiles. These are the modified box-counting method and the modified yard-stick method sometimes called the compass method. Both these methods are frequently applied to self-similar fractal curves but the self-affine profile curves due to their self-affine nature require modified computational procedures implemented in computer programs.

  3. Profiles and Pauses: Two Practical Activities for the Writing Class

    Directory of Open Access Journals (Sweden)

    Ernest Hall

    1998-01-01

    Full Text Available Abstract : This article describes two classroom activities, "Profiling" and "Pause Analysis", that can be successfully used in ESL writing classes. "Profiling" addresses such problems as poor development of ideas, simplistic ideas, and lack of coherence in written texts. "Pause Analysis" focusses on the thinking processes that students engage in while drafting text, processes such as searching for ideas, evaluat­ing ideas, and postponing ideas. Both activities enable the instructor to assume the role of intervener in the students' writing processes, rather than evaluator of the text produced. In drawing The attention of the student write to both product and process, "Profiling" and "Pause Analysis" help them develop an awareness of the relation-ship between ideas in English expository text and the thinking pro­cesses that writers engage in while drafting such text.

  4. Search times and probability of detection in time-limited search

    Science.gov (United States)

    Wilson, David; Devitt, Nicole; Maurer, Tana

    2005-05-01

    When modeling the search and target acquisition process, probability of detection as a function of time is important to war games and physical entity simulations. Recent US Army RDECOM CERDEC Night Vision and Electronics Sensor Directorate modeling of search and detection has focused on time-limited search. Developing the relationship between detection probability and time of search as a differential equation is explored. One of the parameters in the current formula for probability of detection in time-limited search corresponds to the mean time to detect in time-unlimited search. However, the mean time to detect in time-limited search is shorter than the mean time to detect in time-unlimited search and the relationship between them is a mathematical relationship between these two mean times. This simple relationship is derived.

  5. Open Search Environments: The Free Alternative to Commercial Search Services

    Directory of Open Access Journals (Sweden)

    Adrian O'Riordan

    2014-06-01

    Full Text Available Open search systems present a free and less restricted alternative to commercial search services. This paper explores the space of open search technology looking in particular at the issue of interoperability. A description of current protocols and formats for engineering open search applications is presented. The suitability of these technologies and issues around their adoption and operation are discussed. This open search approach is especially proving a fitting choice in applications involving the harvesting of resources and information integration. Principal among the technological solutions are OpenSearch and SRU. OpenSearch and SRU implement a federated model to enable existing and new search engines and search clients communicate. Applications and instances where Opensearch and SRU can be combined are presented. Other relevant technologies such as OpenURL, Apache Solr, and OAI-PMH are also discussed. The deployment of these freely licensed open standards in digital library applications is now a genuine alternative to commercial or proprietary systems.

  6. Search for radions at LEP2

    International Nuclear Information System (INIS)

    Abbiendi, G.; Ainsley, C.; Akesson, P.F.

    2005-01-01

    A new scalar resonance, called the radion, with couplings to fermions and bosons similar to those of the Higgs boson, is predicted in the framework of Randall-Sundrum models, proposed solutions to the hierarchy problem with one extra dimension. An important distinction between the radion and the Higgs boson is that the radion would couple directly to gluon pairs, and in particular its decay products would include a significant fraction of gluon jets. The radion has the same quantum numbers as the Standard Model (SM) Higgs boson, and therefore they can mix, with the resulting mass eigenstates having properties different from those of the SM Higgs boson. Existing searches for the Higgs bosons are sensitive to the possible production and decay of radions and Higgs bosons in these models. For the first time, searches for the SM Higgs boson and flavour-independent and decay-mode independent searches for a neutral Higgs boson are used in combination to explore the parameter space of the Randall-Sundrum model. In the dataset recorded by the OPAL experiment at LEP, no evidence for radion or Higgs particle production was observed in any of those searches at centre-of-mass energies up to 209 GeV. The results are used to set limits on the radion and Higgs boson masses. For all parameters of the Randall-Sundrum model, the data exclude masses below 58 GeV for the mass eigenstate which becomes the Higgs boson in the no-mixing limit

  7. Search Parameter Optimization for Discrete, Bayesian, and Continuous Search Algorithms

    Science.gov (United States)

    2017-09-01

    NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CONTINUOUS SEARCH ALGORITHMS by...to 09-22-2017 4. TITLE AND SUBTITLE SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CON- TINUOUS SEARCH ALGORITHMS 5. FUNDING NUMBERS 6...simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and

  8. Comparison of multiobjective harmony search, cuckoo search and bat-inspired algorithms for renewable distributed generation placement

    Directory of Open Access Journals (Sweden)

    John E. Candelo-Becerra

    2015-07-01

    Full Text Available Electric power losses have a significant impact on the total costs of distribution networks. The use of renewable energy sources is a major alternative to improve power losses and costs, although other important issues are also enhanced such as voltage magnitudes and network congestion. However, determining the best location and size of renewable energy generators can be sometimes a challenging task due to a large number of possible combinations in the search space. Furthermore, the multiobjective functions increase the complexity of the problem and metaheuristics are preferred to find solutions in a relatively short time. This paper evaluates the performance of the cuckoo search (CS, harmony search (HS, and bat-inspired (BA algorithms for the location and size of renewable distributed generation (RDG in radial distribution networks using a multiobjective function defined as minimizing the energy losses and the RDG costs. The metaheuristic algorithms were programmed in Matlab and tested using the 33-node radial distribution network. The three algorithms obtained similar results for the two objectives evaluated, finding points close to the best solutions in the Pareto front. Comparisons showed that the CS obtained the minimum results for most points evaluated, but the BA and the HS were close to the best solution.

  9. Analytical and functional similarity of Amgen biosimilar ABP 215 to bevacizumab.

    Science.gov (United States)

    Seo, Neungseon; Polozova, Alla; Zhang, Mingxuan; Yates, Zachary; Cao, Shawn; Li, Huimin; Kuhns, Scott; Maher, Gwendolyn; McBride, Helen J; Liu, Jennifer

    ABP 215 is a biosimilar product to bevacizumab. Bevacizumab acts by binding to vascular endothelial growth factor A, inhibiting endothelial cell proliferation and new blood vessel formation, thereby leading to tumor vasculature normalization. The ABP 215 analytical similarity assessment was designed to assess the structural and functional similarity of ABP 215 and bevacizumab sourced from both the United States (US) and the European Union (EU). Similarity assessment was also made between the US- and EU-sourced bevacizumab to assess the similarity between the two products. The physicochemical properties and structural similarity of ABP 215 and bevacizumab were characterized using sensitive state-of-the-art analytical techniques capable of detecting small differences in product attributes. ABP 215 has the same amino acid sequence and exhibits similar post-translational modification profiles compared to bevacizumab. The functional similarity assessment employed orthogonal assays designed to interrogate all expected biological activities, including those known to affect the mechanisms of action for ABP 215 and bevacizumab. More than 20 batches of bevacizumab (US) and bevacizumab (EU), and 13 batches of ABP 215 representing unique drug substance lots were assessed for similarity. The large dataset allows meaningful comparisons and garners confidence in the overall conclusion for the analytical similarity assessment of ABP 215 to both US- and EU-sourced bevacizumab. The structural and purity attributes, and biological properties of ABP 215 are demonstrated to be highly similar to those of bevacizumab.

  10. Evaluating the accuracy and effectiveness of criminal geographic profiling methods: The case of Dandora, Kenya

    NARCIS (Netherlands)

    Mburu, L; Helbich, M

    2015-01-01

    Criminal geographic profiling (CGP) prioritizes offender search, extensively reducing the resources expended in criminal investigations. The utility of CGP has, however, remained unclear when variations in environmental characteristics and offense type are introduced. This study evaluates several

  11. Evidence-based Medicine Search: a customizable federated search engine.

    Science.gov (United States)

    Bracke, Paul J; Howse, David K; Keim, Samuel M

    2008-04-01

    This paper reports on the development of a tool by the Arizona Health Sciences Library (AHSL) for searching clinical evidence that can be customized for different user groups. The AHSL provides services to the University of Arizona's (UA's) health sciences programs and to the University Medical Center. Librarians at AHSL collaborated with UA College of Medicine faculty to create an innovative search engine, Evidence-based Medicine (EBM) Search, that provides users with a simple search interface to EBM resources and presents results organized according to an evidence pyramid. EBM Search was developed with a web-based configuration component that allows the tool to be customized for different specialties. Informal and anecdotal feedback from physicians indicates that EBM Search is a useful tool with potential in teaching evidence-based decision making. While formal evaluation is still being planned, a tool such as EBM Search, which can be configured for specific user populations, may help lower barriers to information resources in an academic health sciences center.

  12. Proteome Profiling Outperforms Transcriptome Profiling for Coexpression Based Gene Function Prediction

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Jing; Ma, Zihao; Carr, Steven A.; Mertins, Philipp; Zhang, Hui; Zhang, Zhen; Chan, Daniel W.; Ellis, Matthew J. C.; Townsend, R. Reid; Smith, Richard D.; McDermott, Jason E.; Chen, Xian; Paulovich, Amanda G.; Boja, Emily S.; Mesri, Mehdi; Kinsinger, Christopher R.; Rodriguez, Henry; Rodland, Karin D.; Liebler, Daniel C.; Zhang, Bing

    2016-11-11

    Coexpression of mRNAs under multiple conditions is commonly used to infer cofunctionality of their gene products despite well-known limitations of this “guilt-by-association” (GBA) approach. Recent advancements in mass spectrometry-based proteomic technologies have enabled global expression profiling at the protein level; however, whether proteome profiling data can outperform transcriptome profiling data for coexpression based gene function prediction has not been systematically investigated. Here, we address this question by constructing and analyzing mRNA and protein coexpression networks for three cancer types with matched mRNA and protein profiling data from The Cancer Genome Atlas (TCGA) and the Clinical Proteomic Tumor Analysis Consortium (CPTAC). Our analyses revealed a marked difference in wiring between the mRNA and protein coexpression networks. Whereas protein coexpression was driven primarily by functional similarity between coexpressed genes, mRNA coexpression was driven by both cofunction and chromosomal colocalization of the genes. Functionally coherent mRNA modules were more likely to have their edges preserved in corresponding protein networks than functionally incoherent mRNA modules. Proteomic data strengthened the link between gene expression and function for at least 75% of Gene Ontology (GO) biological processes and 90% of KEGG pathways. A web application Gene2Net (http://cptac.gene2net.org) developed based on the three protein coexpression networks revealed novel gene-function relationships, such as linking ERBB2 (HER2) to lipid biosynthetic process in breast cancer, identifying PLG as a new gene involved in complement activation, and identifying AEBP1 as a new epithelial-mesenchymal transition (EMT) marker. Our results demonstrate that proteome profiling outperforms transcriptome profiling for coexpression based gene function prediction. Proteomics should be integrated if not preferred in gene function and human disease studies

  13. Computational assessment of visual search strategies in volumetric medical images.

    Science.gov (United States)

    Wen, Gezheng; Aizenman, Avigael; Drew, Trafton; Wolfe, Jeremy M; Haygood, Tamara Miner; Markey, Mia K

    2016-01-01

    When searching through volumetric images [e.g., computed tomography (CT)], radiologists appear to use two different search strategies: "drilling" (restrict eye movements to a small region of the image while quickly scrolling through slices), or "scanning" (search over large areas at a given depth before moving on to the next slice). To computationally identify the type of image information that is used in these two strategies, 23 naïve observers were instructed with either "drilling" or "scanning" when searching for target T's in 20 volumes of faux lung CTs. We computed saliency maps using both classical two-dimensional (2-D) saliency, and a three-dimensional (3-D) dynamic saliency that captures the characteristics of scrolling through slices. Comparing observers' gaze distributions with the saliency maps showed that search strategy alters the type of saliency that attracts fixations. Drillers' fixations aligned better with dynamic saliency and scanners with 2-D saliency. The computed saliency was greater for detected targets than for missed targets. Similar results were observed in data from 19 radiologists who searched five stacks of clinical chest CTs for lung nodules. Dynamic saliency may be superior to the 2-D saliency for detecting targets embedded in volumetric images, and thus "drilling" may be more efficient than "scanning."

  14. First Dark Matter Search Results from the XENON1T Experiment

    Science.gov (United States)

    Aprile, E.; Aalbers, J.; Agostini, F.; Alfonsi, M.; Amaro, F. D.; Anthony, M.; Arneodo, F.; Barrow, P.; Baudis, L.; Bauermeister, B.; Benabderrahmane, M. L.; Berger, T.; Breur, P. A.; Brown, A.; Brown, A.; Brown, E.; Bruenner, S.; Bruno, G.; Budnik, R.; Bütikofer, L.; Calvén, J.; Cardoso, J. M. R.; Cervantes, M.; Cichon, D.; Coderre, D.; Colijn, A. P.; Conrad, J.; Cussonneau, J. P.; Decowski, M. P.; de Perio, P.; di Gangi, P.; di Giovanni, A.; Diglio, S.; Eurin, G.; Fei, J.; Ferella, A. D.; Fieguth, A.; Fulgione, W.; Gallo Rosso, A.; Galloway, M.; Gao, F.; Garbini, M.; Gardner, R.; Geis, C.; Goetzke, L. W.; Grandi, L.; Greene, Z.; Grignon, C.; Hasterok, C.; Hogenbirk, E.; Howlett, J.; Itay, R.; Kaminsky, B.; Kazama, S.; Kessler, G.; Kish, A.; Landsman, H.; Lang, R. F.; Lellouch, D.; Levinson, L.; Lin, Q.; Lindemann, S.; Lindner, M.; Lombardi, F.; Lopes, J. A. M.; Manfredini, A.; Mariş, I.; Marrodán Undagoitia, T.; Masbou, J.; Massoli, F. V.; Masson, D.; Mayani, D.; Messina, M.; Micheneau, K.; Molinario, A.; Morâ, K.; Murra, M.; Naganoma, J.; Ni, K.; Oberlack, U.; Pakarha, P.; Pelssers, B.; Persiani, R.; Piastra, F.; Pienaar, J.; Pizzella, V.; Piro, M.-C.; Plante, G.; Priel, N.; Rauch, L.; Reichard, S.; Reuter, C.; Riedel, B.; Rizzo, A.; Rosendahl, S.; Rupp, N.; Saldanha, R.; Dos Santos, J. M. F.; Sartorelli, G.; Scheibelhut, M.; Schindler, S.; Schreiner, J.; Schumann, M.; Scotto Lavina, L.; Selvi, M.; Shagin, P.; Shockley, E.; Silva, M.; Simgen, H.; Sivers, M. V.; Stein, A.; Thapa, S.; Thers, D.; Tiseni, A.; Trinchero, G.; Tunnell, C.; Vargas, M.; Upole, N.; Wang, H.; Wang, Z.; Wei, Y.; Weinheimer, C.; Wulf, J.; Ye, J.; Zhang, Y.; Zhu, T.; Xenon Collaboration

    2017-11-01

    We report the first dark matter search results from XENON1T, a ˜2000 -kg -target-mass dual-phase (liquid-gas) xenon time projection chamber in operation at the Laboratori Nazionali del Gran Sasso in Italy and the first ton-scale detector of this kind. The blinded search used 34.2 live days of data acquired between November 2016 and January 2017. Inside the (1042 ±12 )-kg fiducial mass and in the [5 ,40 ] keVnr energy range of interest for weakly interacting massive particle (WIMP) dark matter searches, the electronic recoil background was (1.93 ±0.25 )×10-4 events /(kg ×day ×keVee) , the lowest ever achieved in such a dark matter detector. A profile likelihood analysis shows that the data are consistent with the background-only hypothesis. We derive the most stringent exclusion limits on the spin-independent WIMP-nucleon interaction cross section for WIMP masses above 10 GeV /c2 , with a minimum of 7.7 ×10-47 cm2 for 35 -GeV /c2 WIMPs at 90% C.L.

  15. Sagace: A web-based search engine for biomedical databases in Japan

    Directory of Open Access Journals (Sweden)

    Morita Mizuki

    2012-10-01

    Full Text Available Abstract Background In the big data era, biomedical research continues to generate a large amount of data, and the generated information is often stored in a database and made publicly available. Although combining data from multiple databases should accelerate further studies, the current number of life sciences databases is too large to grasp features and contents of each database. Findings We have developed Sagace, a web-based search engine that enables users to retrieve information from a range of biological databases (such as gene expression profiles and proteomics data and biological resource banks (such as mouse models of disease and cell lines. With Sagace, users can search more than 300 databases in Japan. Sagace offers features tailored to biomedical research, including manually tuned ranking, a faceted navigation to refine search results, and rich snippets constructed with retrieved metadata for each database entry. Conclusions Sagace will be valuable for experts who are involved in biomedical research and drug development in both academia and industry. Sagace is freely available at http://sagace.nibio.go.jp/en/.

  16. Al Hirschfeld's NINA as a prototype search task for studying perceptual error in radiology

    Science.gov (United States)

    Nodine, Calvin F.; Kundel, Harold L.

    1997-04-01

    Artist Al Hirschfeld has been hiding the word NINA (his daughter's name) in line drawings of theatrical scenes that have appeared in the New York Times for over 50 years. This paper shows how Hirschfeld's search task of finding the name NINA in his drawings illustrates basic perceptual principles of detection, discrimination and decision-making commonly encountered in radiology search tasks. Hirschfeld's hiding of NINA is typically accomplished by camouflaging the letters of the name and blending them into scenic background details such as wisps of hair and folds of clothing. In a similar way, pulmonary nodules and breast lesions are camouflaged by anatomic features of the chest or breast image. Hirschfeld's hidden NINAs are sometimes missed because they are integrated into a Gestalt overview rather than differentiated from background features during focal scanning. This may be similar to overlooking an obvious nodule behind the heart in a chest x-ray image. Because it is a search game, Hirschfeld assigns a number to each drawing to indicate how many NINAs he has hidden so as not to frustrate his viewers. In the radiologists' task, the number of targets detected in a medical image is determined by combining perceptual input with probabilities generated from clinical history and viewing experience. Thus, in the absence of truth, searching for abnormalities in x-ray images creates opportunities for recognition and decision errors (e.g. false positives and false negatives). We illustrate how camouflage decreases the conspicuity of both artistic and radiographic targets, compare detection performance of radiologists with lay persons searching for NINAs, and, show similarities and differences between scanning strategies of the two groups based on eye-position data.

  17. Searching the ASRS Database Using QUORUM Keyword Search, Phrase Search, Phrase Generation, and Phrase Discovery

    Science.gov (United States)

    McGreevy, Michael W.; Connors, Mary M. (Technical Monitor)

    2001-01-01

    To support Search Requests and Quick Responses at the Aviation Safety Reporting System (ASRS), four new QUORUM methods have been developed: keyword search, phrase search, phrase generation, and phrase discovery. These methods build upon the core QUORUM methods of text analysis, modeling, and relevance-ranking. QUORUM keyword search retrieves ASRS incident narratives that contain one or more user-specified keywords in typical or selected contexts, and ranks the narratives on their relevance to the keywords in context. QUORUM phrase search retrieves narratives that contain one or more user-specified phrases, and ranks the narratives on their relevance to the phrases. QUORUM phrase generation produces a list of phrases from the ASRS database that contain a user-specified word or phrase. QUORUM phrase discovery finds phrases that are related to topics of interest. Phrase generation and phrase discovery are particularly useful for finding query phrases for input to QUORUM phrase search. The presentation of the new QUORUM methods includes: a brief review of the underlying core QUORUM methods; an overview of the new methods; numerous, concrete examples of ASRS database searches using the new methods; discussion of related methods; and, in the appendices, detailed descriptions of the new methods.

  18. A hybrid search algorithm for swarm robots searching in an unknown environment.

    Science.gov (United States)

    Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

    2014-01-01

    This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.

  19. Chemoinformatics Profiling of the Chromone Nucleus as a MAO-B/A2AAR Dual Binding Scaffold.

    Science.gov (United States)

    Cruz-Monteagudo, Maykel; Borges, Fernanda; Cordeiro, M Natalia D S; Helguera, Aliuska Morales; Tejera, Eduardo; Paz-Y-Mino, Cesar; Sanchez-Rodriguez, Aminael; Perera-Sardina, Yunier; Perez-Castillo, Yunierkis

    2017-11-14

    In the context of the current drug discovery efforts to find disease modifying therapies for Parkinson's disease (PD) the current single target strategy has proved inefficient. Consequently, the search for multi-potent agents is attracting more and more attention due to the multiple pathogenetic factors implicated in PD. Multiple evidences points to the dual inhibition of the monoamine oxidase B (MAO-B), as well as adenosine A2A receptor (A2AAR) blockade, as a promising approach to prevent the neurodegeneration involved in PD. Currently, only two chemical scaffolds has been proposed as potential dual MAO-B inhibitors/A2AAR antagonists (caffeine derivatives and benzothiazinones). In this study, we conduct a series of chemoinformatics analysis in order to evaluate and advance the potential of the chromone nucleus as a MAO-B/A2AAR dual binding scaffold. The information provided by SAR data mining analysis based on network similarity graphs and molecular docking studies support the suitability of the chromone nucleus as a potential MAOB/ A2AAR dual binding scaffold. Additionally, a virtual screening tool based on a group fusion similarity search approach was developed for the prioritization of potential MAO-B/A2AAR dual binder candidates. Among several data fusion schemes evaluated, the MEAN-SIM and MIN-RANK GFSS approaches demonstrated to be efficient virtual screening tools. Then, a combinatorial library potentially enriched with MAO-B/A2AAR dual binding chromone derivatives was assembled and sorted by using the MIN-RANK and then the MEAN-SIM GFSS VS approaches. The information and tools provided in this work represent valuable decision making elements in the search of novel chromone derivatives with a favorable dual binding profile as MAOB inhibitors and A2AAR antagonists with the potential to act as a disease-modifying therapeutic for Parkinson's disease. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

  20. Measurement and modeling of nitrogen resonance line profiles from an electrodeless discharge lamp

    International Nuclear Information System (INIS)

    Wood, D.R.; Skinner, G.B.; Lifshitz, A.

    1987-01-01

    Experimental profiles of the 1200 A resonance triplet of atomic nitrogen were measured for a variety of operating conditions of an end-on electrodeless lamp, and corresponding absorption curves were calculated. Each source profile was determined by fitting parameters to an empirical two-layer model, then convoluting with the instrumental function for comparison with experimental data. Each three-component profile was fitted with three adjustable parameters: an absorption parameter for each of the two layers and a third absorption parameter to adjust for radiation trapping. Curves of absorption as a function of atom concentration, calculated from these profiles, are very similar to the shock tube calibrations of Thielen and Roth in which a source of similar design has been used

  1. Attention-based image similarity measure with application to content-based information retrieval

    Science.gov (United States)

    Stentiford, Fred W. M.

    2003-01-01

    Whilst storage and capture technologies are able to cope with huge numbers of images, image retrieval is in danger of rendering many repositories valueless because of the difficulty of access. This paper proposes a similarity measure that imposes only very weak assumptions on the nature of the features used in the recognition process. This approach does not make use of a pre-defined set of feature measurements which are extracted from a query image and used to match those from database images, but instead generates features on a trial and error basis during the calculation of the similarity measure. This has the significant advantage that features that determine similarity can match whatever image property is important in a particular region whether it be a shape, a texture, a colour or a combination of all three. It means that effort is expended searching for the best feature for the region rather than expecting that a fixed feature set will perform optimally over the whole area of an image and over every image in a database. The similarity measure is evaluated on a problem of distinguishing similar shapes in sets of black and white symbols.

  2. Top-k Keyword Search Over Graphs Based On Backward Search

    Directory of Open Access Journals (Sweden)

    Zeng Jia-Hui

    2017-01-01

    Full Text Available Keyword search is one of the most friendly and intuitive information retrieval methods. Using the keyword search to get the connected subgraph has a lot of application in the graph-based cognitive computation, and it is a basic technology. This paper focuses on the top-k keyword searching over graphs. We implemented a keyword search algorithm which applies the backward search idea. The algorithm locates the keyword vertices firstly, and then applies backward search to find rooted trees that contain query keywords. The experiment shows that query time is affected by the iteration number of the algorithm.

  3. USGIN ISO metadata profile

    Science.gov (United States)

    Richard, S. M.

    2011-12-01

    The USGIN project has drafted and is using a specification for use of ISO 19115/19/39 metadata, recommendations for simple metadata content, and a proposal for a URI scheme to identify resources using resolvable http URI's(see http://lab.usgin.org/usgin-profiles). The principal target use case is a catalog in which resources can be registered and described by data providers for discovery by users. We are currently using the ESRI Geoportal (Open Source), with configuration files for the USGIN profile. The metadata offered by the catalog must provide sufficient content to guide search engines to locate requested resources, to describe the resource content, provenance, and quality so users can determine if the resource will serve for intended usage, and finally to enable human users and sofware clients to obtain or access the resource. In order to achieve an operational federated catalog system, provisions in the ISO specification must be restricted and usage clarified to reduce the heterogeneity of 'standard' metadata and service implementations such that a single client can search against different catalogs, and the metadata returned by catalogs can be parsed reliably to locate required information. Usage of the complex ISO 19139 XML schema allows for a great deal of structured metadata content, but the heterogenity in approaches to content encoding has hampered development of sophisticated client software that can take advantage of the rich metadata; the lack of such clients in turn reduces motivation for metadata producers to produce content-rich metadata. If the only significant use of the detailed, structured metadata is to format into text for people to read, then the detailed information could be put in free text elements and be just as useful. In order for complex metadata encoding and content to be useful, there must be clear and unambiguous conventions on the encoding that are utilized by the community that wishes to take advantage of advanced metadata

  4. People searching for people: analysis of a people search engine log

    NARCIS (Netherlands)

    Weerkamp, W.; Berendsen, R.; Kovachev, B.; Meij, E.; Balog, K.; de Rijke, M.

    2011-01-01

    Recent years show an increasing interest in vertical search: searching within a particular type of information. Understanding what people search for in these "verticals" gives direction to research and provides pointers for the search engines themselves. In this paper we analyze the search logs of

  5. P. aeruginosa in the paranasal sinuses and transplanted lungs have similar adaptive mutations as isolates from chronically infected CF lungs

    DEFF Research Database (Denmark)

    Ciofu, Oana; Johansen, Helle Krogh; Aanaes, Kasper

    2013-01-01

    BACKGROUND: Pseudomonas aeruginosa cells are present as biofilms in the paranasal sinuses and the lungs of chronically infected cystic fibrosis (CF) patients. Since different inflammatory responses and selective antibiotic pressures are acting in the sinuses compared with the lungs, we compared...... the adaptive profiles of mucoid and non-mucoid isolates from the two locations. METHODS: We studied the genetic basis of phenotypic diversification and gene expression profiles in sequential lung and sinus P. aeruginosa isolates from four chronically infected CF patients, including pre- and post-lung...... transplantation isolates. RESULTS: The same phenotypes caused by similar mutations and similar gene expression profiles were found in mucoid and non-mucoid isolates from the paranasal sinuses and from the lungs before and after transplantation. CONCLUSION: Bilateral exchange of P. aeruginosa isolates between...

  6. Self-Protection Profiles of Worth and Academic Goals in University Students

    Science.gov (United States)

    Ferradás, María del Mar; Freire, Carlos; Núñez, José Carlos

    2017-01-01

    This work analyzes the possible existence of self-protection profiles based on a combination of self-handicapping (behavioral and claimed) strategies and defensive pessimism in university students. Similarly, the relationship between these profiles and academic goals (learning, performance-approach, performance-avoidance, and work-avoidance) is…

  7. Other Earths: Search for Life and the Constant Curvature

    Directory of Open Access Journals (Sweden)

    Khoshyaran M. M.

    2015-07-01

    Full Text Available The objective of this paper is to propose a search methodology for finding other exactly similar earth like planets (or sister earths. The theory is based on space consisting of Riemann curves or highways. A mathematical model based on constant curvature, a moving frame bundle, and gravitational dynamics is introduced.

  8. Visual search performance among persons with schizophrenia as a function of target eccentricity.

    Science.gov (United States)

    Elahipanah, Ava; Christensen, Bruce K; Reingold, Eyal M

    2010-03-01

    The current study investigated one possible mechanism of impaired visual attention among patients with schizophrenia: a reduced visual span. Visual span is the region of the visual field from which one can extract information during a single eye fixation. This study hypothesized that schizophrenia-related visual search impairment is mediated, in part, by a smaller visual span. To test this hypothesis, 23 patients with schizophrenia and 22 healthy controls completed a visual search task where the target was pseudorandomly presented at different distances from the center of the display. Response times were analyzed as a function of search condition (feature vs. conjunctive), display size, and target eccentricity. Consistent with previous reports, patient search times were more adversely affected as the number of search items increased in the conjunctive search condition. It was important however, that patients' conjunctive search times were also impacted to a greater degree by target eccentricity. Moreover, a significant impairment in patients' visual search performance was only evident when targets were more eccentric and their performance was more similar to healthy controls when the target was located closer to the center of the search display. These results support the hypothesis that a narrower visual span may underlie impaired visual search performance among patients with schizophrenia. Copyright 2010 APA, all rights reserved

  9. Search for Transient Gravitational Waves in Coincidence with Short-Duration Radio Transients During 2007-2013

    Science.gov (United States)

    Abbott, B. P.; Hughey, Brennan; Zanolin, Michele; Szczepanczyk, Marek; Gill, Kiranjyot; Abbott, R.; Abbott, T. D.; Abernathy, M. R.; Acernese, F.; Ackley, K.; hide

    2016-01-01

    We present an archival search for transient gravitational-wave bursts in coincidence with 27 single-pulse triggers from Green Bank Telescope pulsar surveys, using the LIGO (Laser Interferometer Gravitational Wave Observatory), Virgo (Variability of Solar Irradiance and Gravity Oscillations) and GEO (German-UK Interferometric Detector) interferometer network. We also discuss a check for gravitational-wave signals in coincidence with Parkes fast radio bursts using similar methods. Data analyzed in these searches were collected between 2007 and 2013. Possible sources of emission of both short-duration radio signals and transient gravitational-wave emission include star quakes on neutron stars, binary coalescence of neutron stars, and cosmic string cusps. While no evidence for gravitational-wave emission in coincidence with these radio transients was found, the current analysis serves as a prototype for similar future searches using more sensitive second-generation interferometers.

  10. Photovoltaic and Wind Turbine Integration Applying Cuckoo Search for Probabilistic Reliable Optimal Placement

    Directory of Open Access Journals (Sweden)

    R. A. Swief

    2018-01-01

    Full Text Available This paper presents an efficient Cuckoo Search Optimization technique to improve the reliability of electrical power systems. Various reliability objective indices such as Energy Not Supplied, System Average Interruption Frequency Index, System Average Interruption, and Duration Index are the main indices indicating reliability. The Cuckoo Search Optimization (CSO technique is applied to optimally place the protection devices, install the distributed generators, and to determine the size of distributed generators in radial feeders for reliability improvement. Distributed generator affects reliability and system power losses and voltage profile. The volatility behaviour for both photovoltaic cells and the wind turbine farms affect the values and the selection of protection devices and distributed generators allocation. To improve reliability, the reconfiguration will take place before installing both protection devices and distributed generators. Assessment of consumer power system reliability is a vital part of distribution system behaviour and development. Distribution system reliability calculation will be relayed on probabilistic reliability indices, which can expect the disruption profile of a distribution system based on the volatility behaviour of added generators and load behaviour. The validity of the anticipated algorithm has been tested using a standard IEEE 69 bus system.

  11. I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis

    DEFF Research Database (Denmark)

    Lauritsen, Thomas; Kolenda, Thomas

    2002-01-01

    We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....

  12. Emerging Profiles for Cultured Meat; Ethics through and as Design

    Science.gov (United States)

    van der Weele, Cor; Driessen, Clemens

    2013-01-01

    Simple Summary The idea of cultured meat is to grow meat from animal cells with tissue engineering techniques. Cultured meat is an idea under investigation that will not be ready for the market for several years. It is also still open what it could or should be like. We argue that this openness offers the opportunity to explore different directions in which this idea could be developed. Feelings, critical thinking and the imagination all have important roles to play in this exploration. Abstract The development of cultured meat has gained urgency through the increasing problems associated with meat, but what it might become is still open in many respects. In existing debates, two main moral profiles can be distinguished. Vegetarians and vegans who embrace cultured meat emphasize how it could contribute to the diminishment of animal suffering and exploitation, while in a more mainstream profile cultured meat helps to keep meat eating sustainable and affordable. In this paper we argue that these profiles do not exhaust the options and that (gut) feelings as well as imagination are needed to explore possible future options. On the basis of workshops, we present a third moral profile, “the pig in the backyard”. Here cultured meat is imagined as an element of a hybrid community of humans and animals that would allow for both the consumption of animal protein and meaningful relations with domestic (farm) animals. Experience in the workshops and elsewhere also illustrates that thinking about cultured meat inspires new thoughts on “normal” meat. In short, the idea of cultured meat opens up new search space in various ways. We suggest that ethics can take an active part in these searches, by fostering a process that integrates (gut) feelings, imagination and rational thought and that expands the range of our moral identities. PMID:26479525

  13. Market Dominance and Search Quality in the Search Engine Market

    NARCIS (Netherlands)

    Lianos, I.; Motchenkova, E.I.

    2013-01-01

    We analyze a search engine market from a law and economics perspective and incorporate the choice of quality-improving innovations by a search engine platform in a two-sided model of Internet search engine. In the proposed framework, we first discuss the legal issues the search engine market raises

  14. A search for magnetic fields in Lambda Bootis stars

    International Nuclear Information System (INIS)

    Bohlender, D.A.; Landstreet, J.D.

    1990-01-01

    We have searched a sample of λ Boo stars for magnetic fields similar to those observed in the magnetic Ap and Bp stars, using a Balmer-line Zeeman analyser. Apart from one dubious measurement, no fields are detected in our sample. It appears that magnetic fields of the λ Boo stars, if they exist, are significantly smaller than those found in magnetic upper main-sequence stars of similar spectral type; this conclusion is supported at about the 90 or 95 per cent confidence level by the present data. (author)

  15. Experimental implementation of a quantum random-walk search algorithm using strongly dipolar coupled spins

    International Nuclear Information System (INIS)

    Lu Dawei; Peng Xinhua; Du Jiangfeng; Zhu Jing; Zou Ping; Yu Yihua; Zhang Shanmin; Chen Qun

    2010-01-01

    An important quantum search algorithm based on the quantum random walk performs an oracle search on a database of N items with O(√(phN)) calls, yielding a speedup similar to the Grover quantum search algorithm. The algorithm was implemented on a quantum information processor of three-qubit liquid-crystal nuclear magnetic resonance (NMR) in the case of finding 1 out of 4, and the diagonal elements' tomography of all the final density matrices was completed with comprehensible one-dimensional NMR spectra. The experimental results agree well with the theoretical predictions.

  16. The epidiemiologic profile of HCV infected Hispanic patients from the southern area of Puerto Rico since 2005.

    Science.gov (United States)

    Colón-Ruiz, David; Rosado Carrión, Bárbara; Bredy, Rafael

    2012-01-01

    Seroprevalence studies in adults done in San Juan and Puerto Rico have showed 6.3% and 2.2% of the population respectively, are positive for antibodies to Hepatitis C Virus (anti-HCV). It is been suggested that Hispanics have a lower sustained virological response to current therapy. The epidemiologic profile, the response to treatment and the risk factors to the poor response to treatment of HCV patients have not been studied in the southern area of Puerto Rico. This is a cross-sectional analysis of data from 46 medical records from January 2005 to March 2011. We search for sociodemographic variables, comorbidities, the HCV genotype, the human immunodeficiency virus profile, history of alcoholism and the patients who were treated with peginterferon alpha 2b and ribavirin, and their response to treatment. Our HCV infected population is male predominant (63%), and the most common route of transmission were intravenous drug abuse (37%) and blood transfusions (33%). Only 37% reported alcoholism. The most common comorbidities found in our population were hypertension (35%), diabetes mellitus (20%), hypothyroidism (7%) and dyslipidemia (7%). Most common genotype found in our population was type 1 (61%). From the 46 patients, 10 patients were treated, being genotype 1 the most common. Overall, our population showed an epidemiological profile similar to other Hispanic groups in the literature, which should motivate us to continue exploring these associations, in an effort to improve the management of these patients.

  17. The recent similarity hypotheses to describe water infiltration into homogeneous soils

    OpenAIRE

    Reichardt,Klaus; Timm,Luís Carlos; Dourado-Neto,Durval

    2016-01-01

    ABSTRACT A similarity hypothesis recently presented to describe horizontal infiltration into homogeneous soils, developed for coarse-textured soils like sieved marine sand, implies that the soil water retention function θ(h) is the mirror image of an extended Boltzmann transform function θ(λ2). A second hypothesis applicable to vertical infiltration suggests that the soil water retention function θ(h) is also the mirror image of the soil water profile θ(z). Using prev...

  18. Analysis of Multivariate Experimental Data Using A Simplified Regression Model Search Algorithm

    Science.gov (United States)

    Ulbrich, Norbert Manfred

    2013-01-01

    A new regression model search algorithm was developed in 2011 that may be used to analyze both general multivariate experimental data sets and wind tunnel strain-gage balance calibration data. The new algorithm is a simplified version of a more complex search algorithm that was originally developed at the NASA Ames Balance Calibration Laboratory. The new algorithm has the advantage that it needs only about one tenth of the original algorithm's CPU time for the completion of a search. In addition, extensive testing showed that the prediction accuracy of math models obtained from the simplified algorithm is similar to the prediction accuracy of math models obtained from the original algorithm. The simplified algorithm, however, cannot guarantee that search constraints related to a set of statistical quality requirements are always satisfied in the optimized regression models. Therefore, the simplified search algorithm is not intended to replace the original search algorithm. Instead, it may be used to generate an alternate optimized regression model of experimental data whenever the application of the original search algorithm either fails or requires too much CPU time. Data from a machine calibration of NASA's MK40 force balance is used to illustrate the application of the new regression model search algorithm.

  19. Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

    Energy Technology Data Exchange (ETDEWEB)

    Gonzales, Antonio [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Blazier, Nicholas Paul [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2017-02-01

    Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

  20. Neural circuits of eye movements during performance of the visual exploration task, which is similar to the responsive search score task, in schizophrenia patients and normal subjects

    International Nuclear Information System (INIS)

    Nemoto, Yasundo; Matsuda, Tetsuya; Matsuura, Masato

    2004-01-01

    Abnormal exploratory eye movements have been studied as a biological marker for schizophrenia. Using functional MRI (fMRI), we investigated brain activations of 12 healthy and 8 schizophrenic subjects during performance of a visual exploration task that is similar to the responsive search score task to clarify the neural basis of the abnormal exploratory eye movement. Performance data, such as the number of eye movements, the reaction time, and the percentage of correct answers showed no significant differences between the two groups. Only the normal subjects showed activations at the bilateral thalamus and the left anterior medial frontal cortex during the visual exploration tasks. In contrast, only the schizophrenic subjects showed activations at the right anterior cingulate gyms during the same tasks. The activation at the different locations between the two groups, the left anterior medial frontal cortex in normal subjects and the right anterior cingulate gyrus in schizophrenia subjects, was explained by the feature of the visual tasks. Hypoactivation at the bilateral thalamus supports a dysfunctional filtering theory of schizophrenia. (author)

  1. Tag-Based Social Image Search: Toward Relevant and Diverse Results

    Science.gov (United States)

    Yang, Kuiyuan; Wang, Meng; Hua, Xian-Sheng; Zhang, Hong-Jiang

    Recent years have witnessed a great success of social media websites. Tag-based image search is an important approach to access the image content of interest on these websites. However, the existing ranking methods for tag-based image search frequently return results that are irrelevant or lack of diversity. This chapter presents a diverse relevance ranking scheme which simultaneously takes relevance and diversity into account by exploring the content of images and their associated tags. First, it estimates the relevance scores of images with respect to the query term based on both visual information of images and semantic information of associated tags. Then semantic similarities of social images are estimated based on their tags. Based on the relevance scores and the similarities, the ranking list is generated by a greedy ordering algorithm which optimizes Average Diverse Precision (ADP), a novel measure that is extended from the conventional Average Precision (AP). Comprehensive experiments and user studies demonstrate the effectiveness of the approach.

  2. Motor and Executive Function Profiles in Adult Residents ...

    Science.gov (United States)

    Objective: Exposure to elevated levels of manganese (Mn) may be associated with tremor, motor and executive dysfunction (EF), clinically resembling Parkinson’s disease (PD). PD research has identified tremor-dominant (TD) and non-tremor dominant (NTD) profiles. NTD PD presents with bradykinesia, rigidity, and postural sway, and is associated with EF impairment with lower quality of life (QoL). Presence and impact of tremor, motor, and executive dysfunction profiles on health-related QoL and life satisfaction were examined in air-Mn exposed residents of two Ohio, USA towns. Participants and Methods: From two Ohio towns exposed to air-Mn, 186 residents (76 males) aged 30-75 years were administered measures of EF (Animal Naming, ACT, Rey-O Copy, Stroop Color-Word, and Trails B), motor and tremor symptoms (UPDRS), QoL (BRFSS), life satisfaction (SWLS), and positive symptom distress (SCL-90-R). Air-Mn exposure in the two towns was modeled with 10 years of air-monitoring data. Cluster analyses detected the presence of symptom profiles by grouping together residents with similar scores on these measures. Results: Overall, mean air-Mn concentration for the two towns was 0.53 µg/m3 (SD=.92). Two-step cluster analyses identified TD and NTD symptom profiles. Residents in the NTD group lacked EF impairment; EF impairment represented a separate profile. An unimpaired group also emerged. The NTD and EF impairment groups were qualitatively similar, with relatively lo

  3. Profiling Patients’ Healthcare Needs to Support Integrated, Person-Centered Models for Long-Term Disease Management (Profile: Research Design

    Directory of Open Access Journals (Sweden)

    Arianne MJ Elissen

    2016-04-01

    Full Text Available Background: This article presents the design of PROFILe, a study investigating which (biomedical and non-(biomedical patient characteristics should guide more tailored chronic care. Based on this insight, the project aims to develop and validate ‘patient profiles’ that can be used in practice to determine optimal treatment strategies for subgroups of chronically ill with similar healthcare needs and preferences. Methods/Design: PROFILe is a practice-based research comprising four phases. The project focuses on patients with type 2 diabetes. During the first study phase, patient profiles are drafted based on a systematic literature research, latent class growth modeling, and expert collaboration. In phase 2, the profiles are validated from a clinical, patient-related and statistical perspective. Phase 3 involves a discrete choice experiment to gain insight into the patient preferences that exist per profile. In phase 4, the results from all analyses are integrated and recommendations formulated on which patient characteristics should guide tailored chronic care. Discussion: PROFILe is an innovative study which uses a uniquely holistic approach to assess the healthcare needs and preferences of chronically ill. The patient profiles resulting from this project must be tested in practice to investigate the effects of tailored management on patient experience, population health and costs.

  4. Large Neighborhood Search

    DEFF Research Database (Denmark)

    Pisinger, David; Røpke, Stefan

    2010-01-01

    Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...

  5. Prospects for dark matter searches in the pMSSM

    International Nuclear Information System (INIS)

    Roszkowski, Leszek; Sessolo, Enrico Maria; Williams, Andrew J.

    2015-01-01

    We investigate the prospects for detection of neutralino dark matter in the 19-parameter phenomenological MSSM (pMSSM). We explore very wide ranges of the pMSSM parameters but pay particular attention to the higgsino-like neutralino at the ∼1 TeV scale, which has been shown to be a well motivated solution in many constrained supersymmetric models, as well as to a wino-dominated solution with the mass in the range of 2–3 TeV. After summarising the present bounds on the parameter space from direct and indirect detection experiments, we focus on prospects for detection of the Cherenkov Telescope Array (CTA). To this end, we derive a realistic assessment of the sensitivity of CTA to photon fluxes from dark matter annihilation by means of a binned likelihood analysis for the Einasto and Navarro-Frenk-White halo profiles. We use the most up to date instrument response functions and background simulation model provided by the CTA Collaboration. We find that, with 500 hours of observation, under the Einasto profile CTA is bound to exclude at the 95% C.L. almost all of the ∼1 TeV higgsino region of the pMSSM, effectively closing the window for heavy supersymmetric dark matter in many realistic models. CTA will be able to probe the vast majority of cases corresponding to a spin-independent scattering cross section below the reach of 1-tonne underground detector searches for dark matter, in fact even well below the irreducible neutrino background for direct detection. On the other hand, many points lying beyond the sensitivity of CTA will be within the reach of 1-tonne detectors, and some within collider reach. Altogether, CTA will provide a highly sensitive way of searching for dark matter that will be partially overlapping and partially complementary with 1-tonne detector and collider searches, thus being instrumental to effectively explore the nearly full parameter space of the pMSSM.

  6. Dyniqx: a novel meta-search engine for metadata based cross search

    OpenAIRE

    Zhu, Jianhan; Song, Dawei; Eisenstadt, Marc; Barladeanu, Cristi; Rüger, Stefan

    2008-01-01

    The effect of metadata in collection fusion has not been sufficiently studied. In response to this, we present a novel meta-search engine called Dyniqx for metadata based cross search. Dyniqx exploits the availability of metadata in academic search services such as PubMed and Google Scholar etc for fusing search results from heterogeneous search engines. In addition, metadata from these search engines are used for generating dynamic query controls such as sliders and tick boxes etc which are ...

  7. Secure Multi-Keyword Search with User/Owner-side Efficiency in the Cloud

    Directory of Open Access Journals (Sweden)

    LEE, Y.

    2016-05-01

    Full Text Available As the amount of data in the cloud grows, ranked search system, the similarity of a query to data is ranked, are of significant importance. on the other hand, to protect privacy, searchable encryption system are being actively studied. In this paper, we present a new similarity-based multi-keyword search scheme for encrypted data. This scheme provides high flexibility in the pre- and post-processing of encrypted data, including splitting stem/suffix and computing from the encrypted index-term matrix, demonstrated to support Latent Semantic Indexing(LSI. On the client side, the computation and communication costs are one to two orders of magnitude lower than those of previous methods, as demonstrated in the experimental results. we also provide a security analysis of the proposed scheme.

  8. Fast comparison of IS radar code sequences for lag profile inversion

    Directory of Open Access Journals (Sweden)

    M. S. Lehtinen

    2008-08-01

    Full Text Available A fast method for theoretically comparing the posteriori variances produced by different phase code sequences in incoherent scatter radar (ISR experiments is introduced. Alternating codes of types 1 and 2 are known to be optimal for selected range resolutions, but the code sets are inconveniently long for many purposes like ground clutter estimation and in cases where coherent echoes from lower ionospheric layers are to be analyzed in addition to standard F-layer spectra.

    The method is used in practice for searching binary code quads that have estimation accuracy almost equal to that of much longer alternating code sets. Though the code sequences can consist of as few as four different transmission envelopes, the lag profile estimation variances are near to the theoretical minimum. Thus the short code sequence is equally good as a full cycle of alternating codes with the same pulse length and bit length. The short code groups cannot be directly decoded, but the decoding is done in connection with more computationally expensive lag profile inversion in data analysis.

    The actual code searches as well as the analysis and real data results from the found short code searches are explained in other papers sent to the same issue of this journal. We also discuss interesting subtle differences found between the different alternating codes by this method. We assume that thermal noise dominates the incoherent scatter signal.

  9. 137Cs profiles in erosion plots with different soil cultivation

    International Nuclear Information System (INIS)

    Andrello, A.C.; Appoloni, C.R.; Cassol, E.A.; Melquiades, F.L.

    2006-01-01

    Cesium-137 methodology has been successfully used to assess soil erosion. Seven erosion plots were sampled to determine the 137 Cs profile and to assess the erosion rates. Cesium-137 profile for native pasture plot showed an exponential decline below 5 cm depth, with little 137 Cs activity in the superficial layer (0-5 cm). Cesium-137 profile for wheat-soybean rotation plot in conventional tillage showed a uniform distribution with depth. For this plot, the soil loss occurs more in middle than upper and lower level. Cesium-137 profile for wheat-soybean rotation and wheat-maize rotation plots in no-tillage showed a similar result to the native pasture, with a minimum soil loss in the superficial layer. Cesium-137 profile for bare soil and cultivated pasture plots are similar, with a soil erosion rate of 229 t ha -1 year -1 . In the plots with a conventional tillage a greater soil loss occur in middle than upper and lower level. In no-tillage cultivation plots occurs soil loss in lower level, but no sign of soil loss neither gain in the upper level is observed. Cesium-137 methodology is a good tool to assess soil erosion and the 137 Cs profile gives a possibility to understand the soil erosion behavior in erosion plots. (author)

  10. Searching for Cost-Optimized Interstellar Beacons

    Science.gov (United States)

    Benford, Gregory; Benford, James; Benford, Dominic

    2010-06-01

    What would SETI beacon transmitters be like if built by civilizations that had a variety of motives but cared about cost? In a companion paper, we presented how, for fixed power density in the far field, a cost-optimum interstellar beacon system could be built. Here, we consider how we should search for a beacon if it were produced by a civilization similar to ours. High-power transmitters could be built for a wide variety of motives other than the need for two-way communication; this would include beacons built to be seen over thousands of light-years. Extraterrestrial beacon builders would likely have to contend with economic pressures just as their terrestrial counterparts do. Cost, spectral lines near 1 GHz, and interstellar scintillation favor radiating frequencies substantially above the classic "water hole." Therefore, the transmission strategy for a distant, cost-conscious beacon would be a rapid scan of the galactic plane with the intent to cover the angular space. Such pulses would be infrequent events for the receiver. Such beacons built by distant, advanced, wealthy societies would have very different characteristics from what SETI researchers seek. Future searches should pay special attention to areas along the galactic disk where SETI searches have seen coherent signals that have not recurred on the limited listening time intervals we have used. We will need to wait for recurring events that may arriarrive in intermittent bursts. Several new SETI search strategies have emerged from these ideas. We propose a new test for beacons that is based on the Life Plane hypotheses.

  11. Similarity analyses of chromatographic herbal fingerprints: A review

    International Nuclear Information System (INIS)

    Goodarzi, Mohammad; Russell, Paul J.; Vander Heyden, Yvan

    2013-01-01

    Graphical abstract: -- Highlights: •Similarity analyses of herbal fingerprints are reviewed. •Different (dis)similarity approaches are discussed. •(Dis)similarity-metrics and exploratory-analysis approaches are illustrated. •Correlation and distance-based measures are overviewed. •Similarity analyses illustrated by several case studies. -- Abstract: Herbal medicines are becoming again more popular in the developed countries because being “natural” and people thus often assume that they are inherently safe. Herbs have also been used worldwide for many centuries in the traditional medicines. The concern of their safety and efficacy has grown since increasing western interest. Herbal materials and their extracts are very complex, often including hundreds of compounds. A thorough understanding of their chemical composition is essential for conducting a safety risk assessment. However, herbal material can show considerable variability. The chemical constituents and their amounts in a herb can be different, due to growing conditions, such as climate and soil, the drying process, the harvest season, etc. Among the analytical methods, chromatographic fingerprinting has been recommended as a potential and reliable methodology for the identification and quality control of herbal medicines. Identification is needed to avoid fraud and adulteration. Currently, analyzing chromatographic herbal fingerprint data sets has become one of the most applied tools in quality assessment of herbal materials. Mostly, the entire chromatographic profiles are used to identify or to evaluate the quality of the herbs investigated. Occasionally only a limited number of compounds are considered. One approach to the safety risk assessment is to determine whether the herbal material is substantially equivalent to that which is either readily consumed in the diet, has a history of application or has earlier been commercialized i.e. to what is considered as reference material. In order

  12. Similarity analyses of chromatographic herbal fingerprints: A review

    Energy Technology Data Exchange (ETDEWEB)

    Goodarzi, Mohammad [Department of Analytical Chemistry and Pharmaceutical Technology, Center for Pharmaceutical Research, Vrije Universiteit Brussel, Laarbeeklaan 103, B-1090 Brussels (Belgium); Russell, Paul J. [Safety and Environmental Assurance Centre, Unilever, Colworth Science Park, Sharnbrook, Bedfordshire MK44 1LQ (United Kingdom); Vander Heyden, Yvan, E-mail: yvanvdh@vub.ac.be [Department of Analytical Chemistry and Pharmaceutical Technology, Center for Pharmaceutical Research, Vrije Universiteit Brussel, Laarbeeklaan 103, B-1090 Brussels (Belgium)

    2013-12-04

    Graphical abstract: -- Highlights: •Similarity analyses of herbal fingerprints are reviewed. •Different (dis)similarity approaches are discussed. •(Dis)similarity-metrics and exploratory-analysis approaches are illustrated. •Correlation and distance-based measures are overviewed. •Similarity analyses illustrated by several case studies. -- Abstract: Herbal medicines are becoming again more popular in the developed countries because being “natural” and people thus often assume that they are inherently safe. Herbs have also been used worldwide for many centuries in the traditional medicines. The concern of their safety and efficacy has grown since increasing western interest. Herbal materials and their extracts are very complex, often including hundreds of compounds. A thorough understanding of their chemical composition is essential for conducting a safety risk assessment. However, herbal material can show considerable variability. The chemical constituents and their amounts in a herb can be different, due to growing conditions, such as climate and soil, the drying process, the harvest season, etc. Among the analytical methods, chromatographic fingerprinting has been recommended as a potential and reliable methodology for the identification and quality control of herbal medicines. Identification is needed to avoid fraud and adulteration. Currently, analyzing chromatographic herbal fingerprint data sets has become one of the most applied tools in quality assessment of herbal materials. Mostly, the entire chromatographic profiles are used to identify or to evaluate the quality of the herbs investigated. Occasionally only a limited number of compounds are considered. One approach to the safety risk assessment is to determine whether the herbal material is substantially equivalent to that which is either readily consumed in the diet, has a history of application or has earlier been commercialized i.e. to what is considered as reference material. In order

  13. Visual search in the real world: Color vision deficiency affects peripheral guidance, but leaves foveal verification largely unaffected

    Directory of Open Access Journals (Sweden)

    Günter eKugler

    2015-12-01

    Full Text Available Background: People with color vision deficiencies report numerous limitations in daily life. However, they use basic color terms systematically and in a similar manner as people with people with normal color vision. We hypothesize that a possible explanation for this discrepancy between color perception and behavioral consequences might be found in the gaze behavior of people with color vision deficiency.Methods: A group of participants with color vision deficiencies and a control group performed several search tasks in a naturalistic setting on a lawn.Results: Search performance was similar in both groups in a color-unrelated search task as well as in a search for yellow targets. While searching for red targets, color vision deficient participants exhibited a strongly degraded performance. This was closely matched by the number of fixations on red objects shown by the two groups. Importantly, once they fixated a target, participants with color vision deficiencies exhibited only few identification errors. Conclusions: Participants with color vision deficiencies are not able to enhance their search for red targets on a (green lawn by an efficient guiding mechanism. The data indicate that the impaired guiding is the main influence on search performance, while foveal identification (verification largely unaffected.

  14. muBLASTP: database-indexed protein sequence search on multicore CPUs.

    Science.gov (United States)

    Zhang, Jing; Misra, Sanchit; Wang, Hao; Feng, Wu-Chun

    2016-11-04

    The Basic Local Alignment Search Tool (BLAST) is a fundamental program in the life sciences that searches databases for sequences that are most similar to a query sequence. Currently, the BLAST algorithm utilizes a query-indexed approach. Although many approaches suggest that sequence search with a database index can achieve much higher throughput (e.g., BLAT, SSAHA, and CAFE), they cannot deliver the same level of sensitivity as the query-indexed BLAST, i.e., NCBI BLAST, or they can only support nucleotide sequence search, e.g., MegaBLAST. Due to different challenges and characteristics between query indexing and database indexing, the existing techniques for query-indexed search cannot be used into database indexed search. muBLASTP, a novel database-indexed BLAST for protein sequence search, delivers identical hits returned to NCBI BLAST. On Intel Haswell multicore CPUs, for a single query, the single-threaded muBLASTP achieves up to a 4.41-fold speedup for alignment stages, and up to a 1.75-fold end-to-end speedup over single-threaded NCBI BLAST. For a batch of queries, the multithreaded muBLASTP achieves up to a 5.7-fold speedups for alignment stages, and up to a 4.56-fold end-to-end speedup over multithreaded NCBI BLAST. With a newly designed index structure for protein database and associated optimizations in BLASTP algorithm, we re-factored BLASTP algorithm for modern multicore processors that achieves much higher throughput with acceptable memory footprint for the database index.

  15. Meta Search Engines.

    Science.gov (United States)

    Garman, Nancy

    1999-01-01

    Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)

  16. The "common good" phenomenon: Why similarities are positive and differences are negative.

    Science.gov (United States)

    Alves, Hans; Koch, Alex; Unkelbach, Christian

    2017-04-01

    Positive attributes are more prevalent than negative attributes in the social environment. From this basic assumption, 2 implications that have been overlooked thus far: Positive compared with negative attributes are more likely to be shared by individuals, and people's shared attributes (similarities) are more positive than their unshared attributes (differences). Consequently, similarity-based comparisons should lead to more positive evaluations than difference-based comparisons. We formalized our probabilistic reasoning in a model and tested its predictions in a simulation and 8 experiments (N = 1,181). When participants generated traits about 2 target persons, positive compared with negative traits were more likely to be shared by the targets (Experiment 1a) and by other participants' targets (Experiment 1b). Conversely, searching for targets' shared traits resulted in more positive traits than searching for unshared traits (Experiments 2, 4a, and 4b). In addition, positive traits were more accessible than negative traits among shared traits but not among unshared traits (Experiment 3). Finally, shared traits were only more positive when positive traits were indeed prevalent (Experiments 5 and 6). The current framework has a number of implications for comparison processes and provides a new interpretation of well-known evaluative asymmetries such as intergroup bias and self-superiority effects. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

  17. PhAST: pharmacophore alignment search tool.

    Science.gov (United States)

    Hähnke, Volker; Hofmann, Bettina; Grgat, Tomislav; Proschak, Ewgenij; Steinhilber, Dieter; Schneider, Gisbert

    2009-04-15

    We present a ligand-based virtual screening technique (PhAST) for rapid hit and lead structure searching in large compound databases. Molecules are represented as strings encoding the distribution of pharmacophoric features on the molecular graph. In contrast to other text-based methods using SMILES strings, we introduce a new form of text representation that describes the pharmacophore of molecules. This string representation opens the opportunity for revealing functional similarity between molecules by sequence alignment techniques in analogy to homology searching in protein or nucleic acid sequence databases. We favorably compared PhAST with other current ligand-based virtual screening methods in a retrospective analysis using the BEDROC metric. In a prospective application, PhAST identified two novel inhibitors of 5-lipoxygenase product formation with minimal experimental effort. This outcome demonstrates the applicability of PhAST to drug discovery projects and provides an innovative concept of sequence-based compound screening with substantial scaffold hopping potential. 2008 Wiley Periodicals, Inc.

  18. Optimization of interactive visual-similarity-based search

    NARCIS (Netherlands)

    Nguyen, G.P.; Worring, M.

    2008-01-01

    At one end of the spectrum, research in interactive content-based retrieval concentrates on machine learning methods for effective use of relevance feedback. On the other end, the information visualization community focuses on effective methods for conveying information to the user. What is lacking

  19. Faceted Search

    CERN Document Server

    Tunkelang, Daniel

    2009-01-01

    We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

  20. Usefulness of computerized method for lung nodule detection on digital chest radiographs using similar subtraction images from different patients

    International Nuclear Information System (INIS)

    Aoki, Takatoshi; Oda, Nobuhiro; Yamashita, Yoshiko; Yamamoto, Keiji; Korogi, Yukunori

    2012-01-01

    Purpose: The purpose of this study is to evaluate the usefulness of a novel computerized method to select automatically the similar chest radiograph for image subtraction in the patients who have no previous chest radiographs and to assist the radiologists’ interpretation by presenting the “similar subtraction image” from different patients. Materials and methods: Institutional review board approval was obtained, and the requirement for informed patient consent was waived. A large database of approximately 15,000 normal chest radiographs was used for searching similar images of different patients. One hundred images of candidates were selected according to two clinical parameters and similarity of the lung field in the target image. We used the correlation value of chest region in the 100 images for searching the most similar image. The similar subtraction images were obtained by subtracting the similar image selected from the target image. Thirty cases with lung nodules and 30 cases without lung nodules were used for an observer performance test. Four attending radiologists and four radiology residents participated in this observer performance test. Results: The AUC for all radiologists increased significantly from 0.925 to 0.974 with the CAD (P = .004). When the computer output images were available, the average AUC for the residents was more improved (0.960 vs. 0.890) than for the attending radiologists (0.987 vs. 0.960). Conclusion: The novel computerized method for lung nodule detection using similar subtraction images from different patients would be useful to detect lung nodules on digital chest radiographs, especially for less experienced readers.

  1. Fuzzy Search Method for Hi Education Information Security

    Directory of Open Access Journals (Sweden)

    Grigory Grigorevich Novikov

    2016-03-01

    Full Text Available The main reason of the research is how to use fuzzy search method for information security of Hi Education or some similar purposes. So many sensitive information leaks are through non SUMMARY 149 classified documents legal publishing. That’s why many intelligence services so love to use the «mosaic» information collection method. This article is about how to prevent it.

  2. MetalS(3), a database-mining tool for the identification of structurally similar metal sites.

    Science.gov (United States)

    Valasatava, Yana; Rosato, Antonio; Cavallaro, Gabriele; Andreini, Claudia

    2014-08-01

    We have developed a database search tool to identify metal sites having structural similarity to a query metal site structure within the MetalPDB database of minimal functional sites (MFSs) contained in metal-binding biological macromolecules. MFSs describe the local environment around the metal(s) independently of the larger context of the macromolecular structure. Such a local environment has a determinant role in tuning the chemical reactivity of the metal, ultimately contributing to the functional properties of the whole system. The database search tool, which we called MetalS(3) (Metal Sites Similarity Search), can be accessed through a Web interface at http://metalweb.cerm.unifi.it/tools/metals3/ . MetalS(3) uses a suitably adapted version of an algorithm that we previously developed to systematically compare the structure of the query metal site with each MFS in MetalPDB. For each MFS, the best superposition is kept. All these superpositions are then ranked according to the MetalS(3) scoring function and are presented to the user in tabular form. The user can interact with the output Web page to visualize the structural alignment or the sequence alignment derived from it. Options to filter the results are available. Test calculations show that the MetalS(3) output correlates well with expectations from protein homology considerations. Furthermore, we describe some usage scenarios that highlight the usefulness of MetalS(3) to obtain mechanistic and functional hints regardless of homology.

  3. Search costs and efficiency : Do unemployed workers search enough?

    NARCIS (Netherlands)

    Gautier, Pieter A.; Moraga González, José; Wolthoff, Ronald P.

    Many labor market policies affect the marginal benefits and costs of job search. The impact and desirability of such policies depend on the distribution of search costs. In this paper, we provide an equilibrium framework for identifying the distribution of search costs and we apply it to the Dutch

  4. Partial dust obscuration in active galactic nuclei as a cause of broad-line profile and lag variability, and apparent accretion disc inhomogeneities

    Science.gov (United States)

    Gaskell, C. Martin; Harrington, Peter Z.

    2018-04-01

    The profiles of the broad emission lines of active galactic nuclei (AGNs) and the time delays in their response to changes in the ionizing continuum ("lags") give information about the structure and kinematics of the inner regions of AGNs. Line profiles are also our main way of estimating the masses of the supermassive black holes (SMBHs). However, the profiles often show ill-understood, asymmetric structure and velocity-dependent lags vary with time. Here we show that partial obscuration of the broad-line region (BLR) by outflowing, compact, dusty clumps produces asymmetries and velocity-dependent lags similar to those observed. Our model explains previously inexplicable changes in the ratios of the hydrogen lines with time and velocity, the lack of correlation of changes in line profiles with variability of the central engine, the velocity dependence of lags, and the change of lags with time. We propose that changes on timescales longer than the light-crossing time do not come from dynamical changes in the BLR, but are a natural result of the effect of outflowing dusty clumps driven by radiation pressure acting on the dust. The motion of these clumps offers an explanation of long-term changes in polarization. The effects of the dust complicate the study of the structure and kinematics of the BLR and the search for sub-parsec SMBH binaries. Partial obscuration of the accretion disc can also provide the local fluctuations in luminosity that can explain sizes deduced from microlensing.

  5. CLOUD TECHNOLOGIES OF MONITORING OF THE QUALITY OF TRAINING OF WORKERS OF RAILWAY PROFILE

    Directory of Open Access Journals (Sweden)

    Tetyana Bondarenko

    2016-06-01

    Full Text Available With the purpose of creating the system of monitoring of the quality of professional training of future workers of railway profile, the author puts forward a technology of using cloud services of the search system of Google. The article proves that the system provides a complex support of monitoring, from creating appropriate forms and storing of the results in cloud storage to the\\processing of results of the monitoring and management of the system of testing on the basis of using the service of Google-Calendar. In the article there has been considered the usage of the concept of BYOD for testing of students’ achievement. The article demonstrates the advantages of  the proposed approach to monitoring the quality of training of future workers of railway profile highlighting  the usage of the cloud services of the search system of Google as a means of  expanding the boundaries of research in space and time and making the procedure more flexible and systematic.

  6. Branch length similarity entropy-based descriptors for shape representation

    Science.gov (United States)

    Kwon, Ohsung; Lee, Sang-Hee

    2017-11-01

    In previous studies, we showed that the branch length similarity (BLS) entropy profile could be successfully used for the shape recognition such as battle tanks, facial expressions, and butterflies. In the present study, we proposed new descriptors, roundness, symmetry, and surface roughness, for the recognition, which are more accurate and fast in the computation than the previous descriptors. The roundness represents how closely a shape resembles to a circle, the symmetry characterizes how much one shape is similar with another when the shape is moved in flip, and the surface roughness quantifies the degree of vertical deviations of a shape boundary. To evaluate the performance of the descriptors, we used the database of leaf images with 12 species. Each species consisted of 10 - 20 leaf images and the total number of images were 160. The evaluation showed that the new descriptors successfully discriminated the leaf species. We believe that the descriptors can be a useful tool in the field of pattern recognition.

  7. Searching for degenerate Higgs bosons using a profile likelihood ratio method

    CERN Document Server

    Heikkilä, Jaana

    ATLAS and CMS collaborations at the Large Hadron Collider have observed a new resonance con- sistent with the standard model Higgs boson. However, it has been suggested that the observed signal could also be produced by multiple nearly mass-degenerate states that couple differently to the standard model particles. In this work, a method to discriminate between the hypothesis of a single Higgs boson and that of multiple mass-degenerate Higgs bosons was developed. Using the matrix of measured signal strengths in different production and decay modes, parametrizations for the two hypotheses were constructed as a general rank 1 matrix and the most general $5 \\times 4$ matrix, respectively. The test statistic was defined as a ratio of profile likelihoods for the two hypotheses. The method was applied to the CMS measurements. The expected test statistic distribution was estimated twice by generating pseudo-experiments according to both the standard model hypothesis and the single Higgs boson hypothesis best fitting...

  8. How doctors search

    DEFF Research Database (Denmark)

    Lykke, Marianne; Price, Susan; Delcambre, Lois

    2012-01-01

    Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...

  9. Web Search Engines

    OpenAIRE

    Rajashekar, TB

    1998-01-01

    The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.

  10. Tree decomposition based fast search of RNA structures including pseudoknots in genomes.

    Science.gov (United States)

    Song, Yinglei; Liu, Chunmei; Malmberg, Russell; Pan, Fangfang; Cai, Liming

    2005-01-01

    Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of efficient algorithms for accurate RNA structure-sequence alignment, computer programs capable of fast and effectively searching genomes for RNA secondary structures have not been available. In this paper, a novel RNA structure profiling model is introduced based on the notion of a conformational graph to specify the consensus structure of an RNA family. Tree decomposition yields a small tree width t for such conformation graphs (e.g., t = 2 for stem loops and only a slight increase for pseudo-knots). Within this modelling framework, the optimal alignment of a sequence to the structure model corresponds to finding a maximum valued isomorphic subgraph and consequently can be accomplished through dynamic programming on the tree decomposition of the conformational graph in time O(k(t)N(2)), where k is a small parameter; and N is the size of the projiled RNA structure. Experiments show that the application of the alignment algorithm to search in genomes yields the same search accuracy as methods based on a Covariance model with a significant reduction in computation time. In particular; very accurate searches of tmRNAs in bacteria genomes and of telomerase RNAs in yeast genomes can be accomplished in days, as opposed to months required by other methods. The tree decomposition based searching tool is free upon request and can be downloaded at our site h t t p ://w.uga.edu/RNA-informatics/software/index.php.

  11. Alterations in endo-lysosomal function induce similar hepatic lipid profiles in rodent models of drug-induced phospholipidosis and Sandhoff disease.

    Science.gov (United States)

    Lecommandeur, Emmanuelle; Baker, David; Cox, Timothy M; Nicholls, Andrew W; Griffin, Julian L

    2017-07-01

    Drug-induced phospholipidosis (DIPL) is characterized by an increase in the phospholipid content of the cell and the accumulation of drugs and lipids inside the lysosomes of affected tissues, including in the liver. Although of uncertain pathological significance for patients, the condition remains a major impediment for the clinical development of new drugs. Human Sandhoff disease (SD) is caused by inherited defects of the β subunit of lysosomal β-hexosaminidases (Hex) A and B, leading to a large array of symptoms, including neurodegeneration and ultimately death by the age of 4 in its most common form. The substrates of Hex A and B, gangliosides GM2 and GA2, accumulate inside the lysosomes of the CNS and in peripheral organs. Given that both DIPL and SD are associated with lysosomes and lipid metabolism in general, we measured the hepatic lipid profiles in rodent models of these two conditions using untargeted LC/MS to examine potential commonalities. Both model systems shared a number of perturbed lipid pathways, notably those involving metabolism of cholesteryl esters, lysophosphatidylcholines, bis(monoacylglycero)phosphates, and ceramides. We report here profound alterations in lipid metabolism in the SD liver. In addition, DIPL induced a wide range of lipid changes not previously observed in the liver, highlighting similarities with those detected in the model of SD and raising concerns that these lipid changes may be associated with underlying pathology associated with lysosomal storage disorders. Copyright © 2017 by the American Society for Biochemistry and Molecular Biology, Inc.

  12. XSemantic: An Extension of LCA Based XML Semantic Search

    Science.gov (United States)

    Supasitthimethee, Umaporn; Shimizu, Toshiyuki; Yoshikawa, Masatoshi; Porkaew, Kriengkrai

    One of the most convenient ways to query XML data is a keyword search because it does not require any knowledge of XML structure or learning a new user interface. However, the keyword search is ambiguous. The users may use different terms to search for the same information. Furthermore, it is difficult for a system to decide which node is likely to be chosen as a return node and how much information should be included in the result. To address these challenges, we propose an XML semantic search based on keywords called XSemantic. On the one hand, we give three definitions to complete in terms of semantics. Firstly, the semantic term expansion, our system is robust from the ambiguous keywords by using the domain ontology. Secondly, to return semantic meaningful answers, we automatically infer the return information from the user queries and take advantage of the shortest path to return meaningful connections between keywords. Thirdly, we present the semantic ranking that reflects the degree of similarity as well as the semantic relationship so that the search results with the higher relevance are presented to the users first. On the other hand, in the LCA and the proximity search approaches, we investigated the problem of information included in the search results. Therefore, we introduce the notion of the Lowest Common Element Ancestor (LCEA) and define our simple rule without any requirement on the schema information such as the DTD or XML Schema. The first experiment indicated that XSemantic not only properly infers the return information but also generates compact meaningful results. Additionally, the benefits of our proposed semantics are demonstrated by the second experiment.

  13. Different Moves, Similar Outcomes: A Comparison of Chinese and Swedish Preschool Teacher Education Programmes and the Revisions

    Science.gov (United States)

    Vong, Keang-ieng Peggy; Hu, Bi Ying; Xia, Yan-ping

    2015-01-01

    A Chinese and a Swedish preschool teacher education programme were examined in search for commonalities and differences of the curriculum decision-making considerations involved in the respective programme revision process. Findings include: (1) the two programmes have shifted orientations and become similar, yet there was no fundamental…

  14. Search for supersymmetry in tau lepton final states with the ATLAS detector

    International Nuclear Information System (INIS)

    Schaepe, Steffen

    2016-01-01

    In the search for signs of possible physics beyond the Standard Model, signatures with multiple tau leptons, jets and missing transverse momentum are promising candidates for a discovery. A search in this final state has been performed using 20.3 fb"-"1 integrated luminosity of 8 TeV proton-proton collision data recorded with the ATLAS detector at the LHC in 2012. Five search regions are considered. The expected backgrounds are estimated either from data alone or from Monte Carlo simulation normalized in control regions. In the end, an excellent agreement between the predictions and the observed data is achieved. The lack of any excess above the predicted backgrounds is translated into model independent exclusions of event numbers from any possible new physics scenario in the range from 3.5 to 6.2 events at 95% confidence level. At the same time, exclusions are computed in various hypothetical scenarios of SUSY breaking. In GMSB, e.g., values of Λ or similar 30 corresponding to gluino masses of m_g< or similar 1.6 TeV, respectively, making this analysis competitive to the strongest ATLAS SUSY limits published to date.

  15. Self-similar solutions for poloidal magnetic field in turbulent jet

    International Nuclear Information System (INIS)

    Komissarov, S.S.; Ovchinnikov, I.L.

    1990-01-01

    Evolution of a large-scale magnetic field in a turbulent extragalactic source radio jets is considered. Self-similar solutions for a weak poloidal magnetic field transported by turbulent jet of incompressible fluid are found. It is shown that the radial profiles of the solutions are the eigenfunctions of a linear differential operator. In all the solutions, the strength of a large-scale field decreases more rapidly than that of a small-scale turbulent field. This can be understood as a decay of a large-scale field in the turbulent jet

  16. Searching and Extracting Data from the EMBL-EBI Complex Portal.

    Science.gov (United States)

    Meldal, Birgit H M; Orchard, Sandra

    2018-01-01

    The Complex Portal ( www.ebi.ac.uk/complexportal ) is an encyclopedia of macromolecular complexes. Complexes are assigned unique, stable IDs, are species specific, and list all participating members with links to an appropriate reference database (UniProtKB, ChEBI, RNAcentral). Each complex is annotated extensively with its functions, properties, structure, stoichiometry, tissue expression profile, and subcellular location. Links to domain-specific databases allow the user to access additional information and enable data searching and filtering. Complexes can be saved and downloaded in PSI-MI XML, MI-JSON, and tab-delimited formats.

  17. Ordered Consumer Search

    OpenAIRE

    Armstrong, Mark

    2016-01-01

    The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...

  18. Is searching full text more effective than searching abstracts?

    Science.gov (United States)

    Lin, Jimmy

    2009-02-03

    With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata) to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE abstracts, full-text articles, and spans (paragraphs) within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

  19. Is searching full text more effective than searching abstracts?

    Directory of Open Access Journals (Sweden)

    Lin Jimmy

    2009-02-01

    Full Text Available Abstract Background With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE® abstracts, full-text articles, and spans (paragraphs within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Results Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Conclusion Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

  20. VisualRank: applying PageRank to large-scale image search.

    Science.gov (United States)

    Jing, Yushi; Baluja, Shumeet

    2008-11-01

    Because of the relative ease in understanding and processing text, commercial image-search systems often rely on techniques that are largely indistinguishable from text-search. Recently, academic studies have demonstrated the effectiveness of employing image-based features to provide alternative or additional signals. However, it remains uncertain whether such techniques will generalize to a large number of popular web queries, and whether the potential improvement to search quality warrants the additional computational cost. In this work, we cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and propose VisualRank to analyze the visual link structures among images. The images found to be "authorities" are chosen as those that answer the image-queries well. To understand the performance of such an approach in a real system, we conducted a series of large-scale experiments based on the task of retrieving images for 2000 of the most popular products queries. Our experimental results show significant improvement, in terms of user satisfaction and relevancy, in comparison to the most recent Google Image Search results. Maintaining modest computational cost is vital to ensuring that this procedure can be used in practice; we describe the techniques required to make this system practical for large scale deployment in commercial search engines.