The BiPublishers ranking: Main results and methodological problems when constructing rankings of academic publishers

Directory of Open Access Journals (Sweden)

Torres-Salinas, Daniel

2015-12-01

Full Text Available We present the results of the Bibliometric Indicators for Publishers project (also known as BiPublishers. This project represents the first attempt to systematically develop bibliometric publisher rankings. The data for this project was derived from the Book Citation Index and the study time period was 2009-2013. We have developed 42 rankings: 4 by fields and 38 by disciplines. We display six indicators for publishers divided into three types: output, impact and publisher’s profile. The aim is to capture different characteristics of the research performance of publishers. 254 publishers were processed and classified according to publisher type: commercial publishers and university presses. We present the main publishers by field and then discuss the principal challenges presented when developing this type of tool. The BiPublishers ranking is an on-going project which aims to develop and explore new data sources and indicators to better capture and define the research impact of publishers.Presentamos los resultados del proyecto Bibliometric Indicators for Publishers (BiPublishers. Es el primer proyecto que desarrolla de manera sistemática rankings bibliométricos de editoriales. La fuente de datos empleada es el Book Citation Index y el periodo de análisis 2009-2013. Se presentan 42 rankings: 4 por áreas y 38 por disciplinas. Mostramos seis indicadores por editorial divididos según su tipología: producción, impacto y características editoriales. Se procesaron 254 editoriales y se clasificaron según el tipo: comerciales y universitarias. Se presentan las principales editoriales por áreas. Después, se discuten los principales retos a superar en el desarrollo de este tipo de herramientas. El ranking Bipublishers es un proyecto en desarrollo que persigue analizar y explorar nuevas fuentes de datos e indicadores para captar y definir el impacto de las editoriales académicas.

Result Diversification Based on Query-Specific Cluster Ranking

NARCIS (Netherlands)

J. He (Jiyin); E. Meij; M. de Rijke (Maarten)

2011-01-01

htmlabstractResult diversification is a retrieval strategy for dealing with ambiguous or multi-faceted queries by providing documents that cover as many facets of the query as possible. We propose a result diversification framework based on query-specific clustering and cluster ranking,

Ranking Accounting Authors and Departments in Accounting Education: Different Methodologies--Significantly Different Results

Science.gov (United States)

Bernardi, Richard A.; Zamojcin, Kimberly A.; Delande, Taylor L.

2016-01-01

This research tests whether Holderness Jr., D. K., Myers, N., Summers, S. L., & Wood, D. A. [(2014). "Accounting education research: Ranking institutions and individual scholars." "Issues in Accounting Education," 29(1), 87-115] accounting-education rankings are sensitive to a change in the set of journals used. It provides…

Three results on the PageRank vector: eigenstructure, sensitivity, and the derivative

OpenAIRE

Gleich, David; Glynn, Peter; Golub, Gene; Greif, Chen

2007-01-01

The three results on the PageRank vector are preliminary but shed light on the eigenstructure of a PageRank modified Markov chain and what happens when changing the teleportation parameter in the PageRank model. Computations with the derivative of the PageRank vector with respect to the teleportation parameter show predictive ability and identify an interesting set of pages from Wikipedia.

Result diversification based on query-specific cluster ranking

NARCIS (Netherlands)

He, J.; Meij, E.; de Rijke, M.

2011-01-01

Result diversification is a retrieval strategy for dealing with ambiguous or multi-faceted queries by providing documents that cover as many facets of the query as possible. We propose a result diversification framework based on query-specific clustering and cluster ranking, in which diversification

Generating pseudo test collections for learning to rank scientific articles

NARCIS (Netherlands)

Berendsen, R.; Tsagkias, M.; de Rijke, M.; Meij, E.

2012-01-01

Pseudo test collections are automatically generated to provide training material for learning to rank methods. We propose a method for generating pseudo test collections in the domain of digital libraries, where data is relatively sparse, but comes with rich annotations. Our intuition is that

On Locally Most Powerful Sequential Rank Tests

Czech Academy of Sciences Publication Activity Database

Kalina, Jan

2017-01-01

Roč. 36, č. 1 (2017), s. 111-125 ISSN 0747-4946 R&D Projects: GA ČR GA17-07384S Grant - others:Nadační fond na podporu vědy(CZ) Neuron Institutional support: RVO:67985556 Keywords : nonparametric test s * sequential ranks * stopping variable Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.339, year: 2016 http://library.utia.cas.cz/separaty/2017/SI/kalina-0474065.pdf

Irritancy ranking of anionic detergents using one-time occlusive, repeated occlusive and repeated open tests

NARCIS (Netherlands)

Tupker, RA; Bunte, EE; Fidler, [No Value; Wiechers, JW; Coenraads, PJ

Discrepancies between the one-time patch test and the wash test regarding the ranking of irritancy of detergents have been found in the literature. The aim of the present study was to investigate the concordance of irritancy rank order of 4 anionic detergents tested by 3 different exposure methods,

Pearson's chi-square test and rank correlation inferences for clustered data.

Science.gov (United States)

Shih, Joanna H; Fay, Michael P

2017-09-01

Pearson's chi-square test has been widely used in testing for association between two categorical responses. Spearman rank correlation and Kendall's tau are often used for measuring and testing association between two continuous or ordered categorical responses. However, the established statistical properties of these tests are only valid when each pair of responses are independent, where each sampling unit has only one pair of responses. When each sampling unit consists of a cluster of paired responses, the assumption of independent pairs is violated. In this article, we apply the within-cluster resampling technique to U-statistics to form new tests and rank-based correlation estimators for possibly tied clustered data. We develop large sample properties of the new proposed tests and estimators and evaluate their performance by simulations. The proposed methods are applied to a data set collected from a PET/CT imaging study for illustration. Published 2017. This article is a U.S. Government work and is in the public domain in the USA.

Another Argument in Favour of Wilcoxon's Signed Rank Test

OpenAIRE

Rosenblatt, Jonathan; Benjamini, Yoav

2013-01-01

The Wilcoxon Signed Rank test is typically called upon when testing whether a symmetric distribution has a specified centre and the Gaussianity is in question. As with all insurance policies it comes with a cost, even if small, in terms of power versus a t-test, when the distribution is indeed Gaussian. In this note we further show that even when the distribution tested is Gaussian there need not be power loss at all, if the alternative is of a mixture type rather than a shift. The signed ran...

Power and sample size evaluation for the Cochran-Mantel-Haenszel mean score (Wilcoxon rank sum) test and the Cochran-Armitage test for trend.

Science.gov (United States)

Lachin, John M

2011-11-10

The power of a chi-square test, and thus the required sample size, are a function of the noncentrality parameter that can be obtained as the limiting expectation of the test statistic under an alternative hypothesis specification. Herein, we apply this principle to derive simple expressions for two tests that are commonly applied to discrete ordinal data. The Wilcoxon rank sum test for the equality of distributions in two groups is algebraically equivalent to the Mann-Whitney test. The Kruskal-Wallis test applies to multiple groups. These tests are equivalent to a Cochran-Mantel-Haenszel mean score test using rank scores for a set of C-discrete categories. Although various authors have assessed the power function of the Wilcoxon and Mann-Whitney tests, herein it is shown that the power of these tests with discrete observations, that is, with tied ranks, is readily provided by the power function of the corresponding Cochran-Mantel-Haenszel mean scores test for two and R > 2 groups. These expressions yield results virtually identical to those derived previously for rank scores and also apply to other score functions. The Cochran-Armitage test for trend assesses whether there is an monotonically increasing or decreasing trend in the proportions with a positive outcome or response over the C-ordered categories of an ordinal independent variable, for example, dose. Herein, it is shown that the power of the test is a function of the slope of the response probabilities over the ordinal scores assigned to the groups that yields simple expressions for the power of the test. Copyright © 2011 John Wiley & Sons, Ltd.

Faculty Rank System, Research Motivation, and Faculty Research Productivity: Measure Refinement and Theory Testing.

Science.gov (United States)

Tien, Flora F.; Blackburn, Robert T.

1996-01-01

A study explored the relationship between the traditional system of college faculty rank and faculty research productivity from the perspectives of behavioral reinforcement theory and selection function. Six hypotheses were generated and tested, using data from a 1989 national faculty survey. Results failed to support completely either the…

[Computerized ranking test in three French universities: Staff experience and students' feedback].

Science.gov (United States)

Roux, D; Meyer, G; Cymbalista, F; Bouaziz, J-D; Falgarone, G; Tesniere, A; Gervais, J; Cariou, A; Peffault de Latour, R; Marat, M; Moenaert, E; Guebli, T; Rodriguez, O; Lefort, A; Dreyfuss, D; Hajage, D; Ricard, J-D

2016-03-01

The year 2016 will be pivotal for the evaluation of French medical students with the introduction of the first computerized National Ranking Test (ECNi). The SIDES, online electronic system for medical student evaluation, was created for this purpose. All the universities have already organized faculty exams but few a joint computerized ranking test at several universities simultaneously. We report our experience on the organization of a mock ECNi by universities Paris Descartes, Paris Diderot and Paris 13. Docimological, administrative and technical working groups were created to organize this ECNi. Students in their fifth year of medical studies, who will be the first students to sit for the official ECNi in 2016, were invited to attend this mock exam that represented more than 50% of what will be proposed in 2016. A final electronic questionnaire allowed a docimological and organizational evaluation by students. An analysis of ratings and rankings and their distribution on a 1000-point scale were performed. Sixty-four percent of enrolled students (i.e., 654) attended the three half-day exams. No difference in total score and ranking between the three universities was observed. Students' feedback was extremely positive. Normalized over 1000 points, 99% of students were scored on 300 points only. Progressive clinical cases were the most discriminating test. The organization of a mock ECNi involving multiple universities was a docimological and technical success but required an important administrative, technical and teaching investment. Copyright © 2016 Société nationale française de médecine interne (SNFMI). Published by Elsevier SAS. All rights reserved.

VaRank: a simple and powerful tool for ranking genetic variants

Directory of Open Access Journals (Sweden)

Véronique Geoffroy

2015-03-01

Full Text Available Background. Most genetic disorders are caused by single nucleotide variations (SNVs or small insertion/deletions (indels. High throughput sequencing has broadened the catalogue of human variation, including common polymorphisms, rare variations or disease causing mutations. However, identifying one variation among hundreds or thousands of others is still a complex task for biologists, geneticists and clinicians.Results. We have developed VaRank, a command-line tool for the ranking of genetic variants detected by high-throughput sequencing. VaRank scores and prioritizes variants annotated either by Alamut Batch or SnpEff. A barcode allows users to quickly view the presence/absence of variants (with homozygote/heterozygote status in analyzed samples. VaRank supports the commonly used VCF input format for variants analysis thus allowing it to be easily integrated into NGS bioinformatics analysis pipelines. VaRank has been successfully applied to disease-gene identification as well as to molecular diagnostics setup for several hundred patients.Conclusions. VaRank is implemented in Tcl/Tk, a scripting language which is platform-independent but has been tested only on Unix environment. The source code is available under the GNU GPL, and together with sample data and detailed documentation can be downloaded from http://www.lbgi.fr/VaRank/.

Inflation of type I error rates by unequal variances associated with parametric, nonparametric, and Rank-Transformation Tests

Directory of Open Access Journals (Sweden)

Donald W. Zimmerman

2004-01-01

Full Text Available It is well known that the two-sample Student t test fails to maintain its significance level when the variances of treatment groups are unequal, and, at the same time, sample sizes are unequal. However, introductory textbooks in psychology and education often maintain that the test is robust to variance heterogeneity when sample sizes are equal. The present study discloses that, for a wide variety of non-normal distributions, especially skewed distributions, the Type I error probabilities of both the t test and the Wilcoxon-Mann-Whitney test are substantially inflated by heterogeneous variances, even when sample sizes are equal. The Type I error rate of the t test performed on ranks replacing the scores (rank-transformed data is inflated in the same way and always corresponds closely to that of the Wilcoxon-Mann-Whitney test. For many probability densities, the distortion of the significance level is far greater after transformation to ranks and, contrary to known asymptotic properties, the magnitude of the inflation is an increasing function of sample size. Although nonparametric tests of location also can be sensitive to differences in the shape of distributions apart from location, the Wilcoxon-Mann-Whitney test and rank-transformation tests apparently are influenced mainly by skewness that is accompanied by specious differences in the means of ranks.

A multivariate rank test for comparing mass size distributions

KAUST Repository

Lombard, F.

2012-04-01

Particle size analyses of a raw material are commonplace in the mineral processing industry. Knowledge of particle size distributions is crucial in planning milling operations to enable an optimum degree of liberation of valuable mineral phases, to minimize plant losses due to an excess of oversize or undersize material or to attain a size distribution that fits a contractual specification. The problem addressed in the present paper is how to test the equality of two or more underlying size distributions. A distinguishing feature of these size distributions is that they are not based on counts of individual particles. Rather, they are mass size distributions giving the fractions of the total mass of a sampled material lying in each of a number of size intervals. As such, the data are compositional in nature, using the terminology of Aitchison [1] that is, multivariate vectors the components of which add to 100%. In the literature, various versions of Hotelling\\'s T 2 have been used to compare matched pairs of such compositional data. In this paper, we propose a robust test procedure based on ranks as a competitor to Hotelling\\'s T 2. In contrast to the latter statistic, the power of the rank test is not unduly affected by the presence of outliers or of zeros among the data. © 2012 Copyright Taylor and Francis Group, LLC.

Testing rank-dependent utility theory for health outcomes.

Science.gov (United States)

Oliver, Adam

2003-10-01

Systematic violations of expected utility theory (EU) have been reported in the context of both money and health outcomes. Rank-dependent utility theory (RDU) is currently the most popular and influential alternative theory of choice under circumstances of risk. This paper reports a test of the descriptive performance of RDU compared to EU in the context of health. When one of the options is certain, violations of EU that can be explained by RDU are found. When both options are risky, no evidence that RDU is a descriptive improvement over EU is found, though this finding may be due to the low power of the tests. Copyright 2002 John Wiley & Sons, Ltd.

Small Sample Properties of the Wilcoxon Signed Rank Test with Discontinuous and Dependent Observations

OpenAIRE

Nadine Chlass; Jens J. Krueger

2007-01-01

This Monte-Carlo study investigates sensitivity of the Wilcoxon signed rank test to certain assumption violations in small samples. Emphasis is put on within-sample-dependence, between-sample dependence, and the presence of ties. Our results show that both assumption violations induce severe size distortions and entail power losses. Surprisingly, these consequences do vary substantially with other properties the data may display. Results provided are particularly relevant for experimental set...

A result-driven minimum blocking method for PageRank parallel computing

Science.gov (United States)

Tao, Wan; Liu, Tao; Yu, Wei; Huang, Gan

2017-01-01

Matrix blocking is a common method for improving computational efficiency of PageRank, but the blocking rules are hard to be determined, and the following calculation is complicated. In tackling these problems, we propose a minimum blocking method driven by result needs to accomplish a parallel implementation of PageRank algorithm. The minimum blocking just stores the element which is necessary for the result matrix. In return, the following calculation becomes simple and the consumption of the I/O transmission is cut down. We do experiments on several matrixes of different data size and different sparsity degree. The results show that the proposed method has better computational efficiency than traditional blocking methods.

Standard test method for ranking resistance of materials to sliding wear using block-on-ring wear test

CERN Document Server

American Society for Testing and Materials. Philadelphia

2005-01-01

1.1 This test method covers laboratory procedures for determining the resistance of materials to sliding wear. The test utilizes a block-on-ring friction and wear testing machine to rank pairs of materials according to their sliding wear characteristics under various conditions. 1.2 An important attribute of this test is that it is very flexible. Any material that can be fabricated into, or applied to, blocks and rings can be tested. Thus, the potential materials combinations are endless. However, the interlaboratory testing has been limited to metals. In addition, the test can be run with various lubricants, liquids, or gaseous atmospheres, as desired, to simulate service conditions. Rotational speed and load can also be varied to better correspond to service requirements. 1.3 The values stated in SI units are to be regarded as the standard. The values given in parentheses are for information only. Wear test results are reported as the volume loss in cubic millimetres for both the block and ring. Materials...

Different goodness of fit tests for Rayleigh distribution in ranked set sampling

Directory of Open Access Journals (Sweden)

Amer Al-Omari

2016-03-01

Full Text Available In this paper, different goodness of fit tests for the Rayleigh distribution are considered based on simple random sampling (SRS and ranked set sampling (RSS techniques. The performance of the suggested estimators is evaluated in terms of the power of the tests by using Monte Carlo simulation. It is found that the suggested RSS tests perform better than their counterparts  in SRS.

A cross-benchmark comparison of 87 learning to rank methods

NARCIS (Netherlands)

Tax, N.; Bockting, S.; Hiemstra, D.

2015-01-01

Learning to rank is an increasingly important scientific field that comprises the use of machine learning for the ranking task. New learning to rank methods are generally evaluated on benchmark test collections. However, comparison of learning to rank methods based on evaluation results is hindered

Linear-rank testing of a non-binary, responder-analysis, efficacy score to evaluate pharmacotherapies for substance use disorders.

Science.gov (United States)

Holmes, Tyson H; Li, Shou-Hua; McCann, David J

2016-11-23

The design of pharmacological trials for management of substance use disorders is shifting toward outcomes of successful individual-level behavior (abstinence or no heavy use). While binary success/failure analyses are common, McCann and Li (CNS Neurosci Ther 2012; 18: 414-418) introduced "number of beyond-threshold weeks of success" (NOBWOS) scores to avoid dichotomized outcomes. NOBWOS scoring employs an efficacy "hurdle" with values reflecting duration of success. Here, we evaluate NOBWOS scores rigorously. Formal analysis of mathematical structure of NOBWOS scores is followed by simulation studies spanning diverse conditions to assess operating characteristics of five linear-rank tests on NOBWOS scores. Simulations include assessment of Fisher's exact test applied to hurdle component. On average, statistical power was approximately equal for five linear-rank tests. Under none of conditions examined did Fisher's exact test exhibit greater statistical power than any of the linear-rank tests. These linear-rank tests provide good Type I and Type II error control for comparing distributions of NOBWOS scores between groups (e.g. active vs. placebo). All methods were applied to re-analyses of data from four clinical trials of differing lengths and substances of abuse. These linear-rank tests agreed across all trials in rejecting (or not) their null (equality of distributions) at ≤ 0.05. © The Author(s) 2016.

Ranking nano-enabled hybrid media for simultaneous removal of contaminants with different chemistries: Pseudo-equilibrium sorption tests versus column tests.

Science.gov (United States)

Custodio, Tomas; Garcia, Jose; Markovski, Jasmina; McKay Gifford, James; Hristovski, Kiril D; Olson, Larry W

2017-12-15

The underlying hypothesis of this study was that pseudo-equilibrium and column testing conditions would provide the same sorbent ranking trends although the values of sorbents' performance descriptors (e.g. sorption capacity) may vary because of different kinetics and competition effects induced by the two testing approaches. To address this hypothesis, nano-enabled hybrid media were fabricated and its removal performances were assessed for two model contaminants under multi-point batch pseudo-equilibrium and continuous-flow conditions. Calculation of simultaneous removal capacity indices (SRC) demonstrated that the more resource demanding continuous-flow tests are able to generate the same performance rankings as the ones obtained by conducing the simpler pseudo-equilibrium tests. Furthermore, continuous overlap between the 98% confidence boundaries for each SRC index trend, not only validated the hypothesis that both testing conditions provide the same ranking trends, but also pointed that SRC indices are statistically the same for each media, regardless of employed method. In scenarios where rapid screening of new media is required to obtain the best performing synthesis formulation, use of pseudo-equilibrium tests proved to be reliable. Considering that kinetics induced effects on sorption capacity must not be neglected, more resource demanding column test could be conducted only with the top performing media that exhibit the highest sorption capacity. Copyright © 2017 Elsevier B.V. All rights reserved.

Finding differentially expressed genes in high dimensional data: Rank based test statistic via a distance measure.

Science.gov (United States)

Mathur, Sunil; Sadana, Ajit

2015-12-01

We present a rank-based test statistic for the identification of differentially expressed genes using a distance measure. The proposed test statistic is highly robust against extreme values and does not assume the distribution of parent population. Simulation studies show that the proposed test is more powerful than some of the commonly used methods, such as paired t-test, Wilcoxon signed rank test, and significance analysis of microarray (SAM) under certain non-normal distributions. The asymptotic distribution of the test statistic, and the p-value function are discussed. The application of proposed method is shown using a real-life data set. © The Author(s) 2011.

A simple surrogate test method to rank the wear performance of prospective ceramic materials under hip prosthesis edge-loading conditions.

Science.gov (United States)

Sanders, Anthony P; Brannon, Rebecca M

2014-02-01

This research has developed a novel test method for evaluating the wear resistance of ceramic materials under severe contact stresses simulating edge loading in prosthetic hip bearings. Simply shaped test specimens - a cylinder and a spheroid - were designed as surrogates for an edge-loaded, head/liner implant pair. Equivalency of the simpler specimens was assured in the sense that their theoretical contact dimensions and pressures were identical, according to Hertzian contact theory, to those of the head/liner pair. The surrogates were fabricated in three ceramic materials: Al2 O3 , zirconia-toughened alumina (ZTA), and ZrO2 . They were mated in three different material pairs and reciprocated under a 200 N normal contact force for 1000-2000 cycles, which created small (material pairs were ranked by their wear resistance, quantified by the volume of abraded material measured using an interferometer. Similar tests were performed on edge-loaded hip implants in the same material pairs. The surrogates replicated the wear rankings of their full-scale implant counterparts and mimicked their friction force trends. The results show that a proxy test using simple test specimens can validly rank the wear performance of ceramic materials under severe, edge-loading contact stresses, while replicating the beginning stage of edge-loading wear. This simple wear test is therefore potentially useful for screening and ranking new, prospective materials early in their development, to produce optimized candidates for more complicated full-scale hip simulator wear tests. Copyright © 2013 Wiley Periodicals, Inc.

RankProdIt: A web-interactive Rank Products analysis tool

Directory of Open Access Journals (Sweden)

Laing Emma

2010-08-01

Full Text Available Abstract Background The first objective of a DNA microarray experiment is typically to generate a list of genes or probes that are found to be differentially expressed or represented (in the case of comparative genomic hybridizations and/or copy number variation between two conditions or strains. Rank Products analysis comprises a robust algorithm for deriving such lists from microarray experiments that comprise small numbers of replicates, for example, less than the number required for the commonly used t-test. Currently, users wishing to apply Rank Products analysis to their own microarray data sets have been restricted to the use of command line-based software which can limit its usage within the biological community. Findings Here we have developed a web interface to existing Rank Products analysis tools allowing users to quickly process their data in an intuitive and step-wise manner to obtain the respective Rank Product or Rank Sum, probability of false prediction and p-values in a downloadable file. Conclusions The online interactive Rank Products analysis tool RankProdIt, for analysis of any data set containing measurements for multiple replicated conditions, is available at: http://strep-microarray.sbs.surrey.ac.uk/RankProducts

The Distribution of the Sum of Signed Ranks

Science.gov (United States)

Albright, Brian

2012-01-01

We describe the calculation of the distribution of the sum of signed ranks and develop an exact recursive algorithm for the distribution as well as an approximation of the distribution using the normal. The results have applications to the non-parametric Wilcoxon signed-rank test.

Testing the encoding elaboration hypothesis: The effects of exemplar ranking on recognition and recall.

Science.gov (United States)

Schnur, P

1977-11-01

Two experiments investigated the effects of exemplar ranking on retention. High-ranking exemplars are words judged to be prototypical of a given category; low-ranking exemplars are words judged to be atypical of a given category. In Experiment 1, an incidental learning paradigm was used to measure reaction time to answer an encoding question as well as subsequent recognition. It was found that low-ranking exemplars were classified more slowly but recognized better than high-ranking exemplars. Other comparisons of the effects of category encoding, rhyme encoding, and typescript encoding on response latency and recognition replicated the results of Craik and Tulving (1975). In Experiment 2, unanticipated free recall of live previously learned paired associate lists revealed that a list composed of low-ranking exemplars was better recalled than a comparable list composed of high-ranking exemplars. Moreover, this was true only when the lists were studied in the context of appropriate category cues. These findings are discussed in terms of the encoding elaboration hypothesis.

Ranking metrics in gene set enrichment analysis: do they matter?

Science.gov (United States)

Zyla, Joanna; Marczyk, Michal; Weiner, January; Polanska, Joanna

2017-05-12

There exist many methods for describing the complex relation between changes of gene expression in molecular pathways or gene ontologies under different experimental conditions. Among them, Gene Set Enrichment Analysis seems to be one of the most commonly used (over 10,000 citations). An important parameter, which could affect the final result, is the choice of a metric for the ranking of genes. Applying a default ranking metric may lead to poor results. In this work 28 benchmark data sets were used to evaluate the sensitivity and false positive rate of gene set analysis for 16 different ranking metrics including new proposals. Furthermore, the robustness of the chosen methods to sample size was tested. Using k-means clustering algorithm a group of four metrics with the highest performance in terms of overall sensitivity, overall false positive rate and computational load was established i.e. absolute value of Moderated Welch Test statistic, Minimum Significant Difference, absolute value of Signal-To-Noise ratio and Baumgartner-Weiss-Schindler test statistic. In case of false positive rate estimation, all selected ranking metrics were robust with respect to sample size. In case of sensitivity, the absolute value of Moderated Welch Test statistic and absolute value of Signal-To-Noise ratio gave stable results, while Baumgartner-Weiss-Schindler and Minimum Significant Difference showed better results for larger sample size. Finally, the Gene Set Enrichment Analysis method with all tested ranking metrics was parallelised and implemented in MATLAB, and is available at https://github.com/ZAEDPolSl/MrGSEA . Choosing a ranking metric in Gene Set Enrichment Analysis has critical impact on results of pathway enrichment analysis. The absolute value of Moderated Welch Test has the best overall sensitivity and Minimum Significant Difference has the best overall specificity of gene set analysis. When the number of non-normally distributed genes is high, using Baumgartner

Low ranks make the difference : How achievement goals and ranking information affect cooperation intentions

NARCIS (Netherlands)

Poortvliet, P. Marijn; Janssen, Onne; Van Yperen, N.W.; Van de Vliert, E.

This investigation tested the joint effect of achievement goals and ranking information on information exchange intentions with a commensurate exchange partner. Results showed that individuals with performance goals were less inclined to cooperate with an exchange partner when they had low or high

Analysis of Survey Results in Terms of Selection of Characteristics of the Mining Rescuer to the Ranks of Rapid Response

Science.gov (United States)

Grodzicka, Aneta; Szlązak, Jan

2016-06-01

The authors of the current study undertook the subject of the analysis features of the mining rescuer as a member of the ranks of the rescue, with particular emphasis on the following parameters: heart rate, body weight, height, BMI, age and seniority in the mining and rescue. This publication concerns the analysis of the test results of these characteristics rescuer as a potential member of the ranks of the rescue, taking into account its risk appetite, stress resistance, attitude towards life, the role of the team, teamwork, attitude to work, motivation to work and physical fitness.

ANALYSIS OF SURVEY RESULTS IN TERMS OF SELECTION OF CHARACTERISTICS OF THE MINING RESCUER TO THE RANKS OF RAPID RESPONSE

Directory of Open Access Journals (Sweden)

Aneta GRODZICKA

2016-04-01

Full Text Available The authors of the current study undertook the subject of the analysis features of the mining rescuer as a member of the ranks of the rescue, with particular emphasis on the following parameters: heart rate, body weight, height, BMI, age and seniority in the mining and rescue. This publication concerns the analysis of the test results of these characteristics rescuer as a potential member of the ranks of the rescue, taking into account its risk appetite, stress resistance, attitude towards life, the role of the team, teamwork, attitude to work, motivation to work and physical fitness.

Variants of the Borda count method for combining ranked classifier hypotheses

NARCIS (Netherlands)

van Erp, Merijn; Schomaker, Lambert; Schomaker, Lambert; Vuurpijl, Louis

2000-01-01

The Borda count is a simple yet effective method of combining rankings. In pattern recognition, classifiers are often able to return a ranked set of results. Several experiments have been conducted to test the ability of the Borda count and two variant methods to combine these ranked classifier

Sensitivity ranking for freshwater invertebrates towards hydrocarbon contaminants.

Science.gov (United States)

Gerner, Nadine V; Cailleaud, Kevin; Bassères, Anne; Liess, Matthias; Beketov, Mikhail A

2017-11-01

Hydrocarbons have an utmost economical importance but may also cause substantial ecological impacts due to accidents or inadequate transportation and use. Currently, freshwater biomonitoring methods lack an indicator that can unequivocally reflect the impacts caused by hydrocarbons while being independent from effects of other stressors. The aim of the present study was to develop a sensitivity ranking for freshwater invertebrates towards hydrocarbon contaminants, which can be used in hydrocarbon-specific bioindicators. We employed the Relative Sensitivity method and developed the sensitivity ranking S hydrocarbons based on literature ecotoxicological data supplemented with rapid and mesocosm test results. A first validation of the sensitivity ranking based on an earlier field study has been conducted and revealed the S hydrocarbons ranking to be promising for application in sensitivity based indicators. Thus, the first results indicate that the ranking can serve as the core component of future hydrocarbon-specific and sensitivity trait based bioindicators.

Aspects of analysis of small-sample right censored data using generalized Wilcoxon rank tests

OpenAIRE

Öhman, Marie-Louise

1994-01-01

The estimated bias and variance of commonly applied and jackknife variance estimators and observed significance level and power of standardised generalized Wilcoxon linear rank sum test statistics and tests, respectively, of Gehan and Prentice are compared in a Monte Carlo simulation study. The variance estimators are the permutational-, the conditional permutational- and the jackknife variance estimators of the test statistic of Gehan, and the asymptotic- and the jackknife variance estimator...

Strategic alternatives ranking methodology: Multiple RCRA incinerator evaluation test case

International Nuclear Information System (INIS)

Baker, G.; Thomson, R.D.; Reece, J.; Springer, L.; Main, D.

1988-01-01

This paper presents an important process approach to permit quantification and ranking of multiple alternatives being considered in remedial actions or hazardous waste strategies. This process is a methodology for evaluating programmatic options in support of site selection or environmental analyses. Political or other less tangible motivations for alternatives may be quantified by means of establishing the range of significant variables, weighting their importance, and by establishing specific criteria for scoring individual alternatives. An application of the process to a recent AFLC program permitted ranking incineration alternatives from a list of over 130 options. The process forced participation by the organizations to be effected, allowed a consensus of opinion to be achieved, allowed complete flexibility to evaluate factor sensitivity, and resulted in strong, quantifiable support for any subsequent site-selection action NEPA documents

Ranking nodes in growing networks: When PageRank fails.

Science.gov (United States)

Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

2015-11-10

PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm's efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank's performance on a network model supported by real data, and show that realistic temporal effects make PageRank fail in individuating the most valuable nodes for a broad range of model parameters. Results on real data are in qualitative agreement with our model-based findings. This failure of PageRank reveals that the static approach to information filtering is inappropriate for a broad class of growing systems, and suggest that time-dependent algorithms that are based on the temporal linking patterns of these systems are needed to better rank the nodes.

Uniform approximation is more appropriate for Wilcoxon Rank-Sum Test in gene set analysis.

Directory of Open Access Journals (Sweden)

Zhide Fang

Full Text Available Gene set analysis is widely used to facilitate biological interpretations in the analyses of differential expression from high throughput profiling data. Wilcoxon Rank-Sum (WRS test is one of the commonly used methods in gene set enrichment analysis. It compares the ranks of genes in a gene set against those of genes outside the gene set. This method is easy to implement and it eliminates the dichotomization of genes into significant and non-significant in a competitive hypothesis testing. Due to the large number of genes being examined, it is impractical to calculate the exact null distribution for the WRS test. Therefore, the normal distribution is commonly used as an approximation. However, as we demonstrate in this paper, the normal approximation is problematic when a gene set with relative small number of genes is tested against the large number of genes in the complementary set. In this situation, a uniform approximation is substantially more powerful, more accurate, and less intensive in computation. We demonstrate the advantage of the uniform approximations in Gene Ontology (GO term analysis using simulations and real data sets.

Evaluation of Term Ranking Algorithms for Pseudo-Relevance Feedback in MEDLINE Retrieval.

Science.gov (United States)

Yoo, Sooyoung; Choi, Jinwook

2011-06-01

The purpose of this study was to investigate the effects of query expansion algorithms for MEDLINE retrieval within a pseudo-relevance feedback framework. A number of query expansion algorithms were tested using various term ranking formulas, focusing on query expansion based on pseudo-relevance feedback. The OHSUMED test collection, which is a subset of the MEDLINE database, was used as a test corpus. Various ranking algorithms were tested in combination with different term re-weighting algorithms. Our comprehensive evaluation showed that the local context analysis ranking algorithm, when used in combination with one of the reweighting algorithms - Rocchio, the probabilistic model, and our variants - significantly outperformed other algorithm combinations by up to 12% (paired t-test; p algorithm pairs, at least in the context of the OHSUMED corpus. Comparative experiments on term ranking algorithms were performed in the context of a subset of MEDLINE documents. With medical documents, local context analysis, which uses co-occurrence with all query terms, significantly outperformed various term ranking methods based on both frequency and distribution analyses. Furthermore, the results of the experiments demonstrated that the term rank-based re-weighting method contributed to a remarkable improvement in mean average precision.

A Case-Based Reasoning Method with Rank Aggregation

Science.gov (United States)

Sun, Jinhua; Du, Jiao; Hu, Jian

2018-03-01

In order to improve the accuracy of case-based reasoning (CBR), this paper addresses a new CBR framework with the basic principle of rank aggregation. First, the ranking methods are put forward in each attribute subspace of case. The ordering relation between cases on each attribute is got between cases. Then, a sorting matrix is got. Second, the similar case retrieval process from ranking matrix is transformed into a rank aggregation optimal problem, which uses the Kemeny optimal. On the basis, a rank aggregation case-based reasoning algorithm, named RA-CBR, is designed. The experiment result on UCI data sets shows that case retrieval accuracy of RA-CBR algorithm is higher than euclidean distance CBR and mahalanobis distance CBR testing.So we can get the conclusion that RA-CBR method can increase the performance and efficiency of CBR.

Weighted Discriminative Dictionary Learning based on Low-rank Representation

International Nuclear Information System (INIS)

Chang, Heyou; Zheng, Hao

2017-01-01

Low-rank representation has been widely used in the field of pattern classification, especially when both training and testing images are corrupted with large noise. Dictionary plays an important role in low-rank representation. With respect to the semantic dictionary, the optimal representation matrix should be block-diagonal. However, traditional low-rank representation based dictionary learning methods cannot effectively exploit the discriminative information between data and dictionary. To address this problem, this paper proposed weighted discriminative dictionary learning based on low-rank representation, where a weighted representation regularization term is constructed. The regularization associates label information of both training samples and dictionary atoms, and encourages to generate a discriminative representation with class-wise block-diagonal structure, which can further improve the classification performance where both training and testing images are corrupted with large noise. Experimental results demonstrate advantages of the proposed method over the state-of-the-art methods. (paper)

RANK and RANK ligand expression in primary human osteosarcoma

Directory of Open Access Journals (Sweden)

Daniel Branstetter

2015-09-01

Our results demonstrate RANKL expression was observed in the tumor element in 68% of human OS using IHC. However, the staining intensity was relatively low and only 37% (29/79 of samples exhibited≥10% RANKL positive tumor cells. RANK expression was not observed in OS tumor cells. In contrast, RANK expression was clearly observed in other cells within OS samples, including the myeloid osteoclast precursor compartment, osteoclasts and in giant osteoclast cells. The intensity and frequency of RANKL and RANK staining in OS samples were substantially less than that observed in GCTB samples. The observation that RANKL is expressed in OS cells themselves suggests that these tumors may mediate an osteoclastic response, and anti-RANKL therapy may potentially be protective against bone pathologies in OS. However, the absence of RANK expression in primary human OS cells suggests that any autocrine RANKL/RANK signaling in human OS tumor cells is not operative, and anti-RANKL therapy would not directly affect the tumor.

Ranking nodes in growing networks: When PageRank fails

Science.gov (United States)

Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

2015-11-01

PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm’s efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank’s performance on a network model supported by real data, and show that realistic temporal effects make PageRank fail in individuating the most valuable nodes for a broad range of model parameters. Results on real data are in qualitative agreement with our model-based findings. This failure of PageRank reveals that the static approach to information filtering is inappropriate for a broad class of growing systems, and suggest that time-dependent algorithms that are based on the temporal linking patterns of these systems are needed to better rank the nodes.

Research of Subgraph Estimation Page Rank Algorithm for Web Page Rank

Directory of Open Access Journals (Sweden)

LI Lan-yin

2017-04-01

Full Text Available The traditional PageRank algorithm can not efficiently perform large data Webpage scheduling problem. This paper proposes an accelerated algorithm named topK-Rank，which is based on PageRank on the MapReduce platform. It can find top k nodes efficiently for a given graph without sacrificing accuracy. In order to identify top k nodes，topK-Rank algorithm prunes unnecessary nodes and edges in each iteration to dynamically construct subgraphs，and iteratively estimates lower/upper bounds of PageRank scores through subgraphs. Theoretical analysis shows that this method guarantees result exactness. Experiments show that topK-Rank algorithm can find k nodes much faster than the existing approaches.

Specific Features of Executive Dysfunction in Alzheimer-Type Mild Dementia Based on Computerized Cambridge Neuropsychological Test Automated Battery (CANTAB) Test Results.

Science.gov (United States)

Kuzmickienė, Jurgita; Kaubrys, Gintaras

2016-10-08

BACKGROUND The primary manifestation of Alzheimer's disease (AD) is decline in memory. Dysexecutive symptoms have tremendous impact on functional activities and quality of life. Data regarding frontal-executive dysfunction in mild AD are controversial. The aim of this study was to assess the presence and specific features of executive dysfunction in mild AD based on Cambridge Neuropsychological Test Automated Battery (CANTAB) results. MATERIAL AND METHODS Fifty newly diagnosed, treatment-naïve, mild, late-onset AD patients (MMSE ≥20, AD group) and 25 control subjects (CG group) were recruited in this prospective, cross-sectional study. The CANTAB tests CRT, SOC, PAL, SWM were used for in-depth cognitive assessment. Comparisons were performed using the t test or Mann-Whitney U test, as appropriate. Correlations were evaluated by Pearson r or Spearman R. Statistical significance was set at p<0.05. RESULTS AD and CG groups did not differ according to age, education, gender, or depression. Few differences were found between groups in the SOC test for performance measures: Mean moves (minimum 3 moves): AD (Rank Sum=2227), CG (Rank Sum=623), p<0.001. However, all SOC test time measures differed significantly between groups: SOC Mean subsequent thinking time (4 moves): AD (Rank Sum=2406), CG (Rank Sum=444), p<0.001. Correlations were weak between executive function (SOC) and episodic/working memory (PAL, SWM) (R=0.01-0.38) or attention/psychomotor speed (CRT) (R=0.02-0.37). CONCLUSIONS Frontal-executive functions are impaired in mild AD patients. Executive dysfunction is highly prominent in time measures, but minimal in performance measures. Executive disorders do not correlate with a decline in episodic and working memory or psychomotor speed in mild AD.

Correlation of Cognitive Abilities Level, Age and Ranks in Judo

Directory of Open Access Journals (Sweden)

Kraček Stanislav

2016-11-01

Full Text Available The aim of this paper is to ascertain the correlation between selected cognitive abilities, age and performance of judokas according to ranking. The study group consisted of judokas in the age group 18 ± 2.4 years. The Stroop Color-Word Test - Victoria Version (VST was the instrument used to determine the level of cognitive abilities. The data obtained were measured by the Pearson Correlation (r correlation test. The results of the study show an associative relationship of indirect correlation (p < 0.01 between age and all of the three categories of the Stroop test. This is an indirect correlation, so the higher the age, the lower the time (better performance of the probands in the Stroop test. There was no statistically significant correlation between performance in the categories of the Stroop test and rankings. The outcomes show that the level of selected cognitive abilities depends on age, but the level of the selected cognitive abilities does not affect the ranking of the judokas.

Statistical methods for ranking data

CERN Document Server

Alvo, Mayer

2014-01-01

This book introduces advanced undergraduate, graduate students and practitioners to statistical methods for ranking data. An important aspect of nonparametric statistics is oriented towards the use of ranking data. Rank correlation is defined through the notion of distance functions and the notion of compatibility is introduced to deal with incomplete data. Ranking data are also modeled using a variety of modern tools such as CART, MCMC, EM algorithm and factor analysis. This book deals with statistical methods used for analyzing such data and provides a novel and unifying approach for hypotheses testing. The techniques described in the book are illustrated with examples and the statistical software is provided on the authors’ website.

Rank-based testing of equal survivorship based on cross-sectional survival data with or without prospective follow-up.

Science.gov (United States)

Chan, Kwun Chuen Gary; Qin, Jing

2015-10-01

Existing linear rank statistics cannot be applied to cross-sectional survival data without follow-up since all subjects are essentially censored. However, partial survival information are available from backward recurrence times and are frequently collected from health surveys without prospective follow-up. Under length-biased sampling, a class of linear rank statistics is proposed based only on backward recurrence times without any prospective follow-up. When follow-up data are available, the proposed rank statistic and a conventional rank statistic that utilizes follow-up information from the same sample are shown to be asymptotically independent. We discuss four ways to combine these two statistics when follow-up is present. Simulations show that all combined statistics have substantially improved power compared with conventional rank statistics, and a Mantel-Haenszel test performed the best among the proposal statistics. The method is applied to a cross-sectional health survey without follow-up and a study of Alzheimer's disease with prospective follow-up. © The Author 2015. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

ArrayVigil: a methodology for statistical comparison of gene signatures using segregated-one-tailed (SOT) Wilcoxon's signed-rank test.

Science.gov (United States)

Khan, Haseeb Ahmad

2005-01-28

Due to versatile diagnostic and prognostic fidelity molecular signatures or fingerprints are anticipated as the most powerful tools for cancer management in the near future. Notwithstanding the experimental advancements in microarray technology, methods for analyzing either whole arrays or gene signatures have not been firmly established. Recently, an algorithm, ArraySolver has been reported by Khan for two-group comparison of microarray gene expression data using two-tailed Wilcoxon signed-rank test. Most of the molecular signatures are composed of two sets of genes (hybrid signatures) wherein up-regulation of one set and down-regulation of the other set collectively define the purpose of a gene signature. Since the direction of a selected gene's expression (positive or negative) with respect to a particular disease condition is known, application of one-tailed statistics could be a more relevant choice. A novel method, ArrayVigil, is described for comparing hybrid signatures using segregated-one-tailed (SOT) Wilcoxon signed-rank test and the results compared with integrated-two-tailed (ITT) procedures (SPSS and ArraySolver). ArrayVigil resulted in lower P values than those obtained from ITT statistics while comparing real data from four signatures.

How to Rank Journals.

Science.gov (United States)

Bradshaw, Corey J A; Brook, Barry W

2016-01-01

There are now many methods available to assess the relative citation performance of peer-reviewed journals. Regardless of their individual faults and advantages, citation-based metrics are used by researchers to maximize the citation potential of their articles, and by employers to rank academic track records. The absolute value of any particular index is arguably meaningless unless compared to other journals, and different metrics result in divergent rankings. To provide a simple yet more objective way to rank journals within and among disciplines, we developed a κ-resampled composite journal rank incorporating five popular citation indices: Impact Factor, Immediacy Index, Source-Normalized Impact Per Paper, SCImago Journal Rank and Google 5-year h-index; this approach provides an index of relative rank uncertainty. We applied the approach to six sample sets of scientific journals from Ecology (n = 100 journals), Medicine (n = 100), Multidisciplinary (n = 50); Ecology + Multidisciplinary (n = 25), Obstetrics & Gynaecology (n = 25) and Marine Biology & Fisheries (n = 25). We then cross-compared the κ-resampled ranking for the Ecology + Multidisciplinary journal set to the results of a survey of 188 publishing ecologists who were asked to rank the same journals, and found a 0.68-0.84 Spearman's ρ correlation between the two rankings datasets. Our composite index approach therefore approximates relative journal reputation, at least for that discipline. Agglomerative and divisive clustering and multi-dimensional scaling techniques applied to the Ecology + Multidisciplinary journal set identified specific clusters of similarly ranked journals, with only Nature & Science separating out from the others. When comparing a selection of journals within or among disciplines, we recommend collecting multiple citation-based metrics for a sample of relevant and realistic journals to calculate the composite rankings and their relative uncertainty windows.

[The relationship between Ridit analysis and rank sum test for one-way ordinal contingency table in medical research].

Science.gov (United States)

Wang, Ling; Xia, Jie-lai; Yu, Li-li; Li, Chan-juan; Wang, Su-zhen

2008-06-01

To explore several numerical methods of ordinal variable in one-way ordinal contingency table and their interrelationship, and to compare corresponding statistical analysis methods such as Ridit analysis and rank sum test. Formula deduction was based on five simplified grading approaches including rank_r(i), ridit_r(i), ridit_r(ci), ridit_r(mi), and table scores. Practical data set was verified by SAS8.2 in clinical practice (to test the effect of Shiwei solution in treatment for chronic tracheitis). Because of the linear relationship of rank_r(i) = N ridit_r(i) + 1/2 = N ridit_r(ci) = (N + 1) ridit_r(mi), the exact chi2 values in Ridit analysis based on ridit_r(i), ridit_r(ci), and ridit_r(mi), were completely the same, and they were equivalent to the Kruskal-Wallis H test. Traditional Ridit analysis was based on ridit_r(i), and its corresponding chi2 value calculated with an approximate variance (1/12) was conservative. The exact chi2 test of Ridit analysis should be used when comparing multiple groups in the clinical researches because of its special merits such as distribution of mean ridit value on (0,1) and clear graph expression. The exact chi2 test of Ridit analysis can be output directly by proc freq of SAS8.2 with ridit and modridit option (SCORES =). The exact chi2 test of Ridit analysis is equivalent to the Kruskal-Wallis H test, and should be used when comparing multiple groups in the clinical researches.

Rank Dynamics

Science.gov (United States)

Gershenson, Carlos

Studies of rank distributions have been popular for decades, especially since the work of Zipf. For example, if we rank words of a given language by use frequency (most used word in English is 'the', rank 1; second most common word is 'of', rank 2), the distribution can be approximated roughly with a power law. The same applies for cities (most populated city in a country ranks first), earthquakes, metabolism, the Internet, and dozens of other phenomena. We recently proposed ``rank diversity'' to measure how ranks change in time, using the Google Books Ngram dataset. Studying six languages between 1800 and 2009, we found that the rank diversity curves of languages are universal, adjusted with a sigmoid on log-normal scale. We are studying several other datasets (sports, economies, social systems, urban systems, earthquakes, artificial life). Rank diversity seems to be universal, independently of the shape of the rank distribution. I will present our work in progress towards a general description of the features of rank change in time, along with simple models which reproduce it

Low-ranking female Japanese macaques make efforts for social grooming.

Science.gov (United States)

Kurihara, Yosuke

2016-04-01

Grooming is essential to build social relationships in primates. Its importance is universal among animals from different ranks; however, rank-related differences in feeding patterns can lead to conflicts between feeding and grooming in low-ranking animals. Unifying the effects of dominance rank on feeding and grooming behaviors contributes to revealing the importance of grooming. Here, I tested whether the grooming behavior of low-ranking females were similar to that of high-ranking females despite differences in their feeding patterns. I followed 9 Japanese macaques Macaca fuscata fuscata adult females from the Arashiyama group, and analyzed the feeding patterns and grooming behaviors of low- and high-ranking females. Low-ranking females fed on natural foods away from the provisioning site, whereas high-ranking females obtained more provisioned food at the site. Due to these differences in feeding patterns, low-ranking females spent less time grooming than high-ranking females. However, both low- and high-ranking females performed grooming around the provisioning site, which was linked to the number of neighboring individuals for low-ranking females and feeding on provisioned foods at the site for high-ranking females. The similarity in grooming area led to a range and diversity of grooming partners that did not differ with rank. Thus, low-ranking females can obtain small amounts of provisioned foods and perform grooming with as many partners around the provisioning site as high-ranking females. These results highlight the efforts made by low-ranking females to perform grooming and suggest the importance of grooming behavior in group-living primates.

Low-ranking female Japanese macaques make efforts for social grooming

Science.gov (United States)

Kurihara, Yosuke

2016-01-01

Abstract Grooming is essential to build social relationships in primates. Its importance is universal among animals from different ranks; however, rank-related differences in feeding patterns can lead to conflicts between feeding and grooming in low-ranking animals. Unifying the effects of dominance rank on feeding and grooming behaviors contributes to revealing the importance of grooming. Here, I tested whether the grooming behavior of low-ranking females were similar to that of high-ranking females despite differences in their feeding patterns. I followed 9 Japanese macaques Macaca fuscata fuscata adult females from the Arashiyama group, and analyzed the feeding patterns and grooming behaviors of low- and high-ranking females. Low-ranking females fed on natural foods away from the provisioning site, whereas high-ranking females obtained more provisioned food at the site. Due to these differences in feeding patterns, low-ranking females spent less time grooming than high-ranking females. However, both low- and high-ranking females performed grooming around the provisioning site, which was linked to the number of neighboring individuals for low-ranking females and feeding on provisioned foods at the site for high-ranking females. The similarity in grooming area led to a range and diversity of grooming partners that did not differ with rank. Thus, low-ranking females can obtain small amounts of provisioned foods and perform grooming with as many partners around the provisioning site as high-ranking females. These results highlight the efforts made by low-ranking females to perform grooming and suggest the importance of grooming behavior in group-living primates. PMID:29491896

PageRank tracker: from ranking to tracking.

Science.gov (United States)

Gong, Chen; Fu, Keren; Loza, Artur; Wu, Qiang; Liu, Jia; Yang, Jie

2014-06-01

Video object tracking is widely used in many real-world applications, and it has been extensively studied for over two decades. However, tracking robustness is still an issue in most existing methods, due to the difficulties with adaptation to environmental or target changes. In order to improve adaptability, this paper formulates the tracking process as a ranking problem, and the PageRank algorithm, which is a well-known webpage ranking algorithm used by Google, is applied. Labeled and unlabeled samples in tracking application are analogous to query webpages and the webpages to be ranked, respectively. Therefore, determining the target is equivalent to finding the unlabeled sample that is the most associated with existing labeled set. We modify the conventional PageRank algorithm in three aspects for tracking application, including graph construction, PageRank vector acquisition and target filtering. Our simulations with the use of various challenging public-domain video sequences reveal that the proposed PageRank tracker outperforms mean-shift tracker, co-tracker, semiboosting and beyond semiboosting trackers in terms of accuracy, robustness and stability.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan

2012-11-19

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-01-01

Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

Multiple graph regularized protein domain ranking

Directory of Open Access Journals (Sweden)

Wang Jim

2012-11-01

Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Website visibility the theory and practice of improving rankings

CERN Document Server

Weideman, Melius

2009-01-01

The quest to achieve high website rankings in search engine results is a prominent subject for both academics and website owners/coders. Website Visibility marries academic research results to the world of the information practitioner and contains a focused look at the elements which contribute to website visibility, providing support for the application of each element with relevant research. A series of real-world case studies with tested examples of research on website visibility elements and their effect on rankings are reviewed.Written by a well-respected academic and practitioner in the

Wilcoxon's signed-rank statistic: what null hypothesis and why it matters.

Science.gov (United States)

Li, Heng; Johnson, Terri

2014-01-01

In statistical literature, the term 'signed-rank test' (or 'Wilcoxon signed-rank test') has been used to refer to two distinct tests: a test for symmetry of distribution and a test for the median of a symmetric distribution, sharing a common test statistic. To avoid potential ambiguity, we propose to refer to those two tests by different names, as 'test for symmetry based on signed-rank statistic' and 'test for median based on signed-rank statistic', respectively. The utility of such terminological differentiation should become evident through our discussion of how those tests connect and contrast with sign test and one-sample t-test. Published 2014. This article is a U.S. Government work and is in the public domain in the USA. Published 2014. This article is a U.S. Government work and is in the public domain in the USA.

Learning to rank figures within a biomedical article.

Directory of Open Access Journals (Sweden)

Feifan Liu

Full Text Available Hundreds of millions of figures are available in biomedical literature, representing important biomedical experimental evidence. This ever-increasing sheer volume has made it difficult for scientists to effectively and accurately access figures of their interest, the process of which is crucial for validating research facts and for formulating or testing novel research hypotheses. Current figure search applications can't fully meet this challenge as the "bag of figures" assumption doesn't take into account the relationship among figures. In our previous study, hundreds of biomedical researchers have annotated articles in which they serve as corresponding authors. They ranked each figure in their paper based on a figure's importance at their discretion, referred to as "figure ranking". Using this collection of annotated data, we investigated computational approaches to automatically rank figures. We exploited and extended the state-of-the-art listwise learning-to-rank algorithms and developed a new supervised-learning model BioFigRank. The cross-validation results show that BioFigRank yielded the best performance compared with other state-of-the-art computational models, and the greedy feature selection can further boost the ranking performance significantly. Furthermore, we carry out the evaluation by comparing BioFigRank with three-level competitive domain-specific human experts: (1 First Author, (2 Non-Author-In-Domain-Expert who is not the author nor co-author of an article but who works in the same field of the corresponding author of the article, and (3 Non-Author-Out-Domain-Expert who is not the author nor co-author of an article and who may or may not work in the same field of the corresponding author of an article. Our results show that BioFigRank outperforms Non-Author-Out-Domain-Expert and performs as well as Non-Author-In-Domain-Expert. Although BioFigRank underperforms First Author, since most biomedical researchers are either in- or

Learning to rank figures within a biomedical article.

Science.gov (United States)

Liu, Feifan; Yu, Hong

2014-01-01

Hundreds of millions of figures are available in biomedical literature, representing important biomedical experimental evidence. This ever-increasing sheer volume has made it difficult for scientists to effectively and accurately access figures of their interest, the process of which is crucial for validating research facts and for formulating or testing novel research hypotheses. Current figure search applications can't fully meet this challenge as the "bag of figures" assumption doesn't take into account the relationship among figures. In our previous study, hundreds of biomedical researchers have annotated articles in which they serve as corresponding authors. They ranked each figure in their paper based on a figure's importance at their discretion, referred to as "figure ranking". Using this collection of annotated data, we investigated computational approaches to automatically rank figures. We exploited and extended the state-of-the-art listwise learning-to-rank algorithms and developed a new supervised-learning model BioFigRank. The cross-validation results show that BioFigRank yielded the best performance compared with other state-of-the-art computational models, and the greedy feature selection can further boost the ranking performance significantly. Furthermore, we carry out the evaluation by comparing BioFigRank with three-level competitive domain-specific human experts: (1) First Author, (2) Non-Author-In-Domain-Expert who is not the author nor co-author of an article but who works in the same field of the corresponding author of the article, and (3) Non-Author-Out-Domain-Expert who is not the author nor co-author of an article and who may or may not work in the same field of the corresponding author of an article. Our results show that BioFigRank outperforms Non-Author-Out-Domain-Expert and performs as well as Non-Author-In-Domain-Expert. Although BioFigRank underperforms First Author, since most biomedical researchers are either in- or out

Spectral-based features ranking for gamelan instruments identification using filter techniques

Directory of Open Access Journals (Sweden)

Diah P Wulandari

2013-03-01

Full Text Available In this paper, we describe an approach of spectral-based features ranking for Javanese gamelaninstruments identification using filter techniques. The model extracted spectral-based features set of thesignal using Short Time Fourier Transform (STFT. The rank of the features was determined using the fivealgorithms; namely ReliefF, Chi-Squared, Information Gain, Gain Ratio, and Symmetric Uncertainty. Then,we tested the ranked features by cross validation using Support Vector Machine (SVM. The experimentshowed that Gain Ratio algorithm gave the best result, it yielded accuracy of 98.93%.

Discovering author impact: A PageRank perspective

OpenAIRE

Yan, Erjia; Ding, Ying

2010-01-01

This article provides an alternative perspective for measuring author impact by applying PageRank algorithm to a coauthorship network. A weighted PageRank algorithm considering citation and coauthorship network topology is proposed. We test this algorithm under different damping factors by evaluating author impact in the informetrics research community. In addition, we also compare this weighted PageRank with the h-index, citation, and program committee (PC) membership of the International So...

Adiabatic quantum algorithm for search engine ranking.

Science.gov (United States)

Garnerone, Silvano; Zanardi, Paolo; Lidar, Daniel A

2012-06-08

We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web pages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top-ranked log(n) entries of the quantum PageRank state can then be estimated with a polynomial quantum speed-up. Moreover, the quantum PageRank state can be used in "q-sampling" protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.

The rank-heat plot is a novel way to present the results from a network meta-analysis including multiple outcomes.

Science.gov (United States)

Veroniki, Areti Angeliki; Straus, Sharon E; Fyraridis, Alexandros; Tricco, Andrea C

2016-08-01

To present a novel and simple graphical approach to improve the presentation of the treatment ranking in a network meta-analysis (NMA) including multiple outcomes. NMA simultaneously compares many relevant interventions for a clinical condition from a network of trials, and allows ranking of the effectiveness and/or safety of each intervention. There are numerous ways to present the NMA results, which can challenge their interpretation by research users. The rank-heat plot is a novel graph that can be used to quickly recognize which interventions are most likely the best or worst interventions with respect to their effectiveness and/or safety for a single or multiple outcome(s) and may increase interpretability. Using empirical NMAs, we show that the need for a concise and informative presentation of results is imperative, particularly as the number of competing treatments and outcomes in an NMA increases. The rank-heat plot is an efficient way to present the results of ranking statistics, particularly when a large amount of data is available, and it is targeted to users from various backgrounds. Copyright © 2016 Elsevier Inc. All rights reserved.

VHB-JOURQUAL2: Method, Results, and Implications of the German Academic Association for Business Research's Journal Ranking

OpenAIRE

Schrader, Ulf; Hennig-Thurau, Thorsten

2009-01-01

VHB-JOURQUAL represents the official journal ranking of the German Academic Association for Business Research. Since its introduction in 2003, the ranking has become the most influential journal evaluation approach in German-speaking countries, impacting several key managerial decisions of German, Austrian, and Swiss business schools. This article reports the methodological approach of the ranking’s second edition. It also presents the main results and additional analyses on the validity of t...

Endogenous Versus Exogenous Shocks in Complex Networks: An Empirical Test Using Book Sale Rankings

Science.gov (United States)

Sornette, D.; Deschâtres, F.; Gilbert, T.; Ageon, Y.

2004-11-01

We study the precursory and recovery signatures accompanying shocks in complex networks, that we test on a unique database of the Amazon.com ranking of book sales. We find clear distinguishing signatures classifying two types of sales peaks. Exogenous peaks occur abruptly and are followed by a power law relaxation, while endogenous peaks occur after a progressively accelerating power law growth followed by an approximately symmetrical power law relaxation which is slower than for exogenous peaks. These results are rationalized quantitatively by a simple model of epidemic propagation of interactions with long memory within a network of acquaintances. The observed relaxation of sales implies that the sales dynamics is dominated by cascades rather than by the direct effects of news or advertisements, indicating that the social network is close to critical.

Maximising information recovery from rank-order codes

Science.gov (United States)

Sen, B.; Furber, S.

2007-04-01

The central nervous system encodes information in sequences of asynchronously generated voltage spikes, but the precise details of this encoding are not well understood. Thorpe proposed rank-order codes as an explanation of the observed speed of information processing in the human visual system. The work described in this paper is inspired by the performance of SpikeNET, a biologically inspired neural architecture using rank-order codes for information processing, and is based on the retinal model developed by VanRullen and Thorpe. This model mimics retinal information processing by passing an input image through a bank of Difference of Gaussian (DoG) filters and then encoding the resulting coefficients in rank-order. To test the effectiveness of this encoding in capturing the information content of an image, the rank-order representation is decoded to reconstruct an image that can be compared with the original. The reconstruction uses a look-up table to infer the filter coefficients from their rank in the encoded image. Since the DoG filters are approximately orthogonal functions, they are treated as their own inverses in the reconstruction process. We obtained a quantitative measure of the perceptually important information retained in the reconstructed image relative to the original using a slightly modified version of an objective metric proposed by Petrovic. It is observed that around 75% of the perceptually important information is retained in the reconstruction. In the present work we reconstruct the input using a pseudo-inverse of the DoG filter-bank with the aim of improving the reconstruction and thereby extracting more information from the rank-order encoded stimulus. We observe that there is an increase of 10 - 15% in the information retrieved from a reconstructed stimulus as a result of inverting the filter-bank.

PageRank and rank-reversal dependence on the damping factor

Science.gov (United States)

Son, S.-W.; Christensen, C.; Grassberger, P.; Paczuski, M.

2012-12-01

PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank reversal as d changes, and we show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, d0=0.85. Rank reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank reversal happens not only in directed networks containing rank sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank reversals to rank pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around d=0.65 than at d=d0.

PageRank and rank-reversal dependence on the damping factor.

Science.gov (United States)

Son, S-W; Christensen, C; Grassberger, P; Paczuski, M

2012-12-01

PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank reversal as d changes, and we show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, d_{0}=0.85. Rank reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank reversal happens not only in directed networks containing rank sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank reversals to rank pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around d=0.65 than at d=d_{0}.

Automatic figure ranking and user interfacing for intelligent figure search.

Directory of Open Access Journals (Sweden)

Hong Yu

2010-10-01

Full Text Available Figures are important experimental results that are typically reported in full-text bioscience articles. Bioscience researchers need to access figures to validate research facts and to formulate or to test novel research hypotheses. On the other hand, the sheer volume of bioscience literature has made it difficult to access figures. Therefore, we are developing an intelligent figure search engine (http://figuresearch.askhermes.org. Existing research in figure search treats each figure equally, but we introduce a novel concept of "figure ranking": figures appearing in a full-text biomedical article can be ranked by their contribution to the knowledge discovery.We empirically validated the hypothesis of figure ranking with over 100 bioscience researchers, and then developed unsupervised natural language processing (NLP approaches to automatically rank figures. Evaluating on a collection of 202 full-text articles in which authors have ranked the figures based on importance, our best system achieved a weighted error rate of 0.2, which is significantly better than several other baseline systems we explored. We further explored a user interfacing application in which we built novel user interfaces (UIs incorporating figure ranking, allowing bioscience researchers to efficiently access important figures. Our evaluation results show that 92% of the bioscience researchers prefer as the top two choices the user interfaces in which the most important figures are enlarged. With our automatic figure ranking NLP system, bioscience researchers preferred the UIs in which the most important figures were predicted by our NLP system than the UIs in which the most important figures were randomly assigned. In addition, our results show that there was no statistical difference in bioscience researchers' preference in the UIs generated by automatic figure ranking and UIs by human ranking annotation.The evaluation results conclude that automatic figure ranking and user

Jackknife Variance Estimator for Two Sample Linear Rank Statistics

Science.gov (United States)

1988-11-01

Accesion For - - ,NTIS GPA&I "TIC TAB Unann c, nc .. [d Keywords: strong consistency; linear rank test’ influence function . i , at L By S- )Distribut...reverse if necessary and identify by block number) FIELD IGROUP SUB-GROUP Strong consistency; linear rank test; influence function . 19. ABSTRACT

Multiple graph regularized protein domain ranking.

Science.gov (United States)

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Evaluation of the osteoclastogenic process associated with RANK / RANK-L / OPG in odontogenic myxomas

Science.gov (United States)

González-Galván, María del Carmen; Mosqueda-Taylor, Adalberto; Bologna-Molina, Ronell; Setien-Olarra, Amaia; Marichalar-Mendia, Xabier; Aguirre-Urizar, José-Manuel

2018-01-01

Background Odontogenic myxoma (OM) is a benign intraosseous neoplasm that exhibits local aggressiveness and high recurrence rates. Osteoclastogenesis is an important phenomenon in the tumor growth of maxillary neoplasms. RANK (Receptor Activator of Nuclear Factor κappa B) is the signaling receptor of RANK-L (Receptor activator of nuclear factor kappa-Β ligand) that activates the osteoclasts. OPG (osteoprotegerin) is a decoy receptor for RANK-L that inhibits pro-osteoclastogenesis. The RANK / RANKL / OPG system participates in the regulation of osteolytic activity under normal conditions, and its alteration has been associated with greater bone destruction, and also with tumor growth. Objectives To analyze the immunohistochemical expression of OPG, RANK and RANK-L proteins in odontogenic myxomas (OMs) and their relationship with the tumor size. Material and Methods Eighteen OMs, 4 small ( 3cm) and 18 dental follicles (DF) that were included as control were studied by means of standard immunohistochemical procedure with RANK, RANKL and OPG antibodies. For the evaluation, 5 fields (40x) of representative areas of OM and DF were selected where the expression of each antibody was determined. Descriptive and comparative statistical analyses were performed with the obtained data. Results There are significant differences in the expression of RANK in OM samples as compared to DF (p = 0.022) and among the OMSs and OMLs (p = 0.032). Also a strong association is recognized in the expression of RANK-L and OPG in OM samples. Conclusions Activation of the RANK / RANK-L / OPG triad seems to be involved in the mechanisms of bone balance and destruction, as well as associated with tumor growth in odontogenic myxomas. Key words:Odontogenic myxoma, dental follicle, RANK, RANK-L, OPG, osteoclastogenesis. PMID:29680857

Ranking structures and rank-rank correlations of countries: The FIFA and UEFA cases

Science.gov (United States)

Ausloos, Marcel; Cloots, Rudi; Gadomski, Adam; Vitanov, Nikolay K.

2014-04-01

Ranking of agents competing with each other in complex systems may lead to paradoxes according to the pre-chosen different measures. A discussion is presented on such rank-rank, similar or not, correlations based on the case of European countries ranked by UEFA and FIFA from different soccer competitions. The first question to be answered is whether an empirical and simple law is obtained for such (self-) organizations of complex sociological systems with such different measuring schemes. It is found that the power law form is not the best description contrary to many modern expectations. The stretched exponential is much more adequate. Moreover, it is found that the measuring rules lead to some inner structures in both cases.

Recurrent fuzzy ranking methods

Science.gov (United States)

Hajjari, Tayebeh

2012-11-01

With the increasing development of fuzzy set theory in various scientific fields and the need to compare fuzzy numbers in different areas. Therefore, Ranking of fuzzy numbers plays a very important role in linguistic decision-making, engineering, business and some other fuzzy application systems. Several strategies have been proposed for ranking of fuzzy numbers. Each of these techniques has been shown to produce non-intuitive results in certain case. In this paper, we reviewed some recent ranking methods, which will be useful for the researchers who are interested in this area.

Citation graph based ranking in Invenio

CERN Document Server

Marian, Ludmila; Rajman, Martin; Vesely, Martin

2010-01-01

Invenio is the web-based integrated digital library system developed at CERN. Within this framework, we present four types of ranking models based on the citation graph that complement the simple approach based on citation counts: time-dependent citation counts, a relevancy ranking which extends the PageRank model, a time-dependent ranking which combines the freshness of citations with PageRank and a ranking that takes into consideration the external citations. We present our analysis and results obtained on two main data sets: Inspire and CERN Document Server. Our main contributions are: (i) a study of the currently available ranking methods based on the citation graph; (ii) the development of new ranking methods that correct some of the identified limitations of the current methods such as treating all citations of equal importance, not taking time into account or considering the citation graph complete; (iii) a detailed study of the key parameters for these ranking methods. (The original publication is ava...

Multiplex PageRank.

Directory of Open Access Journals (Sweden)

Arda Halu

Full Text Available Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

Multiplex PageRank.

Science.gov (United States)

Halu, Arda; Mondragón, Raúl J; Panzarasa, Pietro; Bianconi, Ginestra

2013-01-01

Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking

Science.gov (United States)

Shams, Bita; Haratizadeh, Saman

2016-09-01

Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks.

Permutational distribution of the log-rank statistic under random censorship with applications to carcinogenicity assays.

Science.gov (United States)

Heimann, G; Neuhaus, G

1998-03-01

In the random censorship model, the log-rank test is often used for comparing a control group with different dose groups. If the number of tumors is small, so-called exact methods are often applied for computing critical values from a permutational distribution. Two of these exact methods are discussed and shown to be incorrect. The correct permutational distribution is derived and studied with respect to its behavior under unequal censoring in the light of recent results proving that the permutational version and the unconditional version of the log-rank test are asymptotically equivalent even under unequal censoring. The log-rank test is studied by simulations of a realistic scenario from a bioassay with small numbers of tumors.

Reduced Rank Regression

DEFF Research Database (Denmark)

Johansen, Søren

2008-01-01

The reduced rank regression model is a multivariate regression model with a coefficient matrix with reduced rank. The reduced rank regression algorithm is an estimation procedure, which estimates the reduced rank regression model. It is related to canonical correlations and involves calculating...

Ranking Support Vector Machine with Kernel Approximation.

Science.gov (United States)

Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi

2017-01-01

Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

Ranking Support Vector Machine with Kernel Approximation

Directory of Open Access Journals (Sweden)

Kai Chen

2017-01-01

Full Text Available Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels can give higher accuracy than linear RankSVM (RankSVM with a linear kernel for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

RankExplorer: Visualization of Ranking Changes in Large Time Series Data.

Science.gov (United States)

Shi, Conglei; Cui, Weiwei; Liu, Shixia; Xu, Panpan; Chen, Wei; Qu, Huamin

2012-12-01

For many applications involving time series data, people are often interested in the changes of item values over time as well as their ranking changes. For example, people search many words via search engines like Google and Bing every day. Analysts are interested in both the absolute searching number for each word as well as their relative rankings. Both sets of statistics may change over time. For very large time series data with thousands of items, how to visually present ranking changes is an interesting challenge. In this paper, we propose RankExplorer, a novel visualization method based on ThemeRiver to reveal the ranking changes. Our method consists of four major components: 1) a segmentation method which partitions a large set of time series curves into a manageable number of ranking categories; 2) an extended ThemeRiver view with embedded color bars and changing glyphs to show the evolution of aggregation values related to each ranking category over time as well as the content changes in each ranking category; 3) a trend curve to show the degree of ranking changes over time; 4) rich user interactions to support interactive exploration of ranking changes. We have applied our method to some real time series data and the case studies demonstrate that our method can reveal the underlying patterns related to ranking changes which might otherwise be obscured in traditional visualizations.

Development and first application of an operating events ranking tool

International Nuclear Information System (INIS)

Šimić, Zdenko; Zerger, Benoit; Banov, Reni

2015-01-01

Highlights: • A method using analitycal hierarchy process for ranking operating events is developed and tested. • The method is applied for 5 years of U.S. NRC Licensee Event Reports (1453 events). • Uncertainty and sensitivity of the ranking results are evaluated. • Real events assessment shows potential of the method for operating experience feedback. - Abstract: The operating experience feedback is important for maintaining and improving safety and availability in nuclear power plants. Detailed investigation of all events is challenging since it requires excessive resources, especially in case of large event databases. This paper presents an event groups ranking method to complement the analysis of individual operating events. The basis for the method is the use of an internationally accepted events characterization scheme that allows different ways of events grouping and ranking. The ranking method itself consists of implementing the analytical hierarchy process (AHP) by means of a custom developed tool which allows events ranking based on ranking indexes pre-determined by expert judgment. Following the development phase, the tool was applied to analyze a complete set of 5 years of real nuclear power plants operating events (1453 events). The paper presents the potential of this ranking method to identify possible patterns throughout the event database and therefore to give additional insights into the events as well as to give quantitative input for the prioritization of further more detailed investigation of selected event groups

AP600 passive containment cooling system phenomena identification and ranking table

International Nuclear Information System (INIS)

Spencer, D.R.; Woodcock, Joel

1999-01-01

This paper presents the Phenomena Identification and Ranking Table (PIRT) used in the containment Design Basis Analysis (DBA) for the AP600 nuclear power plant. The PIRT is a tool generally applied to best estimate thermal hydraulic analyses. In the conservative analytical modeling approach used for the AP600 DBA containment pressure response, the PIRT was a tool used to show completeness and relevance of the test database in accordance with the Code of Federal Regulations for advanced plant design. Additionally, the ranking of phenomena by relative importance in a PIRT allows appropriate focusing of resources during model development and licensing review. The focus of the paper is on the organization and structure of the PIRT to show level of detail and format accepted for the AP600, for potential application to other containment designs or accident scenarios. Conclusions of general interest are discussed regarding table organization and structure, the process for developing relative ranking and incorporating expert opinion, and the definition and usage of the relative ranking in support of the conservative evaluation model. The AP600 containment evaluation model approach, as influenced by the relative rankings, is briefly described to put into context this unique application of the PIRT to a conservative methodology. The bases for relative ranking of each phenomenon, which included expert opinion, and quantitative results of scaling and testing, was submitted to the NRC as part of AP600-specific evaluations. Since a PIRT supports the sufficiency of both a testing program and analytical modeling, the process followed to generate and confirm the PIRT, an important part of the licensing acceptance, was a focus of extensive NRC review. General descriptions of key phenomena are provided to aid in understanding the containment PIRT for more general applications for containment evaluations of other PWR designs or for other scenarios. (author)

Virtual drug screen schema based on multiview similarity integration and ranking aggregation.

Science.gov (United States)

Kang, Hong; Sheng, Zhen; Zhu, Ruixin; Huang, Qi; Liu, Qi; Cao, Zhiwei

2012-03-26

The current drug virtual screen (VS) methods mainly include two categories. i.e., ligand/target structure-based virtual screen and that, utilizing protein-ligand interaction fingerprint information based on the large number of complex structures. Since the former one focuses on the one-side information while the later one focuses on the whole complex structure, they are thus complementary and can be boosted by each other. However, a common problem faced here is how to present a comprehensive understanding and evaluation of the various virtual screen results derived from various VS methods. Furthermore, there is still an urgent need for developing an efficient approach to fully integrate various VS methods from a comprehensive multiview perspective. In this study, our virtual screen schema based on multiview similarity integration and ranking aggregation was tested comprehensively with statistical evaluations, providing several novel and useful clues on how to perform drug VS from multiple heterogeneous data sources. (1) 18 complex structures of HIV-1 protease with ligands from the PDB were curated as a test data set and the VS was performed with five different drug representations. Ritonavir ( 1HXW ) was selected as the query in VS and the weighted ranks of the query results were aggregated from multiple views through four similarity integration approaches. (2) Further, one of the ranking aggregation methods was used to integrate the similarity ranks calculated by gene ontology (GO) fingerprint and structural fingerprint on the data set from connectivity map, and two typical HDAC and HSP90 inhibitors were chosen as the queries. The results show that rank aggregation can enhance the result of similarity searching in VS when two or more descriptions are involved and provide a more reasonable similarity rank result. Our study shows that integrated VS based on multiple data fusion can achieve a remarkable better performance compared to that from individual ones and

PageRank as a method to rank biomedical literature by importance.

Science.gov (United States)

Yates, Elliot J; Dixon, Louise C

2015-01-01

Optimal ranking of literature importance is vital in overcoming article overload. Existing ranking methods are typically based on raw citation counts, giving a sum of 'inbound' links with no consideration of citation importance. PageRank, an algorithm originally developed for ranking webpages at the search engine, Google, could potentially be adapted to bibliometrics to quantify the relative importance weightings of a citation network. This article seeks to validate such an approach on the freely available, PubMed Central open access subset (PMC-OAS) of biomedical literature. On-demand cloud computing infrastructure was used to extract a citation network from over 600,000 full-text PMC-OAS articles. PageRanks and citation counts were calculated for each node in this network. PageRank is highly correlated with citation count (R = 0.905, P PageRank can be trivially computed on commodity cluster hardware and is linearly correlated with citation count. Given its putative benefits in quantifying relative importance, we suggest it may enrich the citation network, thereby overcoming the existing inadequacy of citation counts alone. We thus suggest PageRank as a feasible supplement to, or replacement of, existing bibliometric ranking methods.

A ring test of in vitro neutral detergent fiber digestibility: analytical variability and sample ranking.

Science.gov (United States)

Hall, M B; Mertens, D R

2012-04-01

In vitro neutral detergent fiber (NDF) digestibility (NDFD) is an empirical measurement of fiber fermentability by rumen microbes. Variation is inherent in all assays and may be increased as multiple steps or differing procedures are used to assess an empirical measure. The main objective of this study was to evaluate variability within and among laboratories of 30-h NDFD values analyzed in repeated runs. Subsamples of alfalfa (n=4), corn forage (n=5), and grass (n=5) ground to pass a 6-mm screen passed a test for homogeneity. The 14 samples were sent to 10 laboratories on 3 occasions over 12 mo. Laboratories ground the samples and ran 1 to 3 replicates of each sample within fermentation run and analyzed 2 or 3 sets of samples. Laboratories used 1 of 2 NDFD procedures: 8 labs used procedures related to the 1970 Goering and Van Soest (GVS) procedure using fermentation vessels or filter bags, and 2 used a procedure with preincubated inoculum (PInc). Means and standard deviations (SD) of sample replicates within run within laboratory (lab) were evaluated with a statistical model that included lab, run within lab, sample, and lab × sample interaction as factors. All factors affected mean values for 30-h NDFD. The lab × sample effect suggests against a simple lab bias in mean values. The SD ranged from 0.49 to 3.37% NDFD and were influenced by lab and run within lab. The GVS procedure gave greater NDFD values than PInc, with an average difference across all samples of 17% NDFD. Because of the differences between GVS and PInc, we recommend using results in contexts appropriate to each procedure. The 95% probability limits for within-lab repeatability and among-lab reproducibility for GVS mean values were 10.2 and 13.4%, respectively. These percentages describe the span of the range around the mean into which 95% of analytical results for a sample fall for values generated within a lab and among labs. This degree of precision was supported in that the average maximum

Predicting Rank Attainment in Political Science: What Else besides Publications Affects Promotion?

Science.gov (United States)

Hesli, Vicki L.; Lee, Jae Mook; Mitchell, Sara McLaughlin

2012-01-01

We report the results of hypotheses tests about the effects of several measures of research, teaching, and service on the likelihood of achieving the ranks of associate and full professor. In conducting these tests, we control for institutional and individual background characteristics. We focus our tests on the link between productivity and…

Universal scaling in sports ranking

International Nuclear Information System (INIS)

Deng Weibing; Li Wei; Cai Xu; Bulou, Alain; Wang Qiuping A

2012-01-01

Ranking is a ubiquitous phenomenon in human society. On the web pages of Forbes, one may find all kinds of rankings, such as the world's most powerful people, the world's richest people, the highest-earning tennis players, and so on and so forth. Herewith, we study a specific kind—sports ranking systems in which players' scores and/or prize money are accrued based on their performances in different matches. By investigating 40 data samples which span 12 different sports, we find that the distributions of scores and/or prize money follow universal power laws, with exponents nearly identical for most sports. In order to understand the origin of this universal scaling we focus on the tennis ranking systems. By checking the data we find that, for any pair of players, the probability that the higher-ranked player tops the lower-ranked opponent is proportional to the rank difference between the pair. Such a dependence can be well fitted to a sigmoidal function. By using this feature, we propose a simple toy model which can simulate the competition of players in different matches. The simulations yield results consistent with the empirical findings. Extensive simulation studies indicate that the model is quite robust with respect to the modifications of some parameters. (paper)

[Lack of interest in general practice during the National Ranking Examination in 2005].

Science.gov (United States)

Lanson, Yves

2006-03-01

The second national ranking test took place in 2005 in the same conditions as the year before. Analysis of the results permits us to assess whether the objectives of this reform have been met so far. Data crossing of the results provided by the national testing center allowed us to rank: 1) the appeal of specializations for each geographic subdivision, 2) the candidates by medical school, and 3) the appeal of each subdivision by candidate rank. 66% of the students were classified high enough to be able to choose any specialization. Trends observed from the first examination, in 2004, were confirmed, with the clear desirability of medical specializations and a certain lack of interest in occupational medicine and public health. All the surgery posts were filled, even though the number of posts had increased enormously since the first examination. After adjustment for the number of posts available, the specializations in decreasing order of popularity were: medical, surgical, pediatrics, anesthesiology, gynecology-obstetrics, general medicine, psychiatry, and biology. Approximately 1000 posts in general medicine were not filled. The medical schools whose students ranked highest were Paris Pitié, Paris V, Paris West, Lyon North, Grenoble, and Aix-Marseille. Some medical schools did less well than previously: Marseille very slightly and Angers substantially. Strasbourg, Nancy Amiens and Bobigny were at the bottom of the list. The cities most desired for internships were Paris, Toulouse, Lyon, and Aix-Marseille, while Brest, Nancy, Limoges and the West Indies were ranked lowest, although each was chosen by highly ranked candidate. Two thirds of the students were ranked high enough to allow them a free choice of specializations. All the specializations except public health and occupational medicine had very highly ranked students. Medical specializations are the most desired, but surgery remains highly demanded, despite a substantial increase in the number of posts. All

Dynamic programming re-ranking for PPI interactor and pair extraction in full-text articles

Science.gov (United States)

2011-01-01

Background Experimentally verified protein-protein interactions (PPIs) cannot be easily retrieved by researchers unless they are stored in PPI databases. The curation of such databases can be facilitated by employing text-mining systems to identify genes which play the interactor role in PPIs and to map these genes to unique database identifiers (interactor normalization task or INT) and then to return a list of interaction pairs for each article (interaction pair task or IPT). These two tasks are evaluated in terms of the area under curve of the interpolated precision/recall (AUC iP/R) score because the order of identifiers in the output list is important for ease of curation. Results Our INT system developed for the BioCreAtIvE II.5 INT challenge achieved a promising AUC iP/R of 43.5% by using a support vector machine (SVM)-based ranking procedure. Using our new re-ranking algorithm, we have been able to improve system performance (AUC iP/R) by 1.84%. Our experimental results also show that with the re-ranked INT results, our unsupervised IPT system can achieve a competitive AUC iP/R of 23.86%, which outperforms the best BC II.5 INT system by 1.64%. Compared to using only SVM ranked INT results, using re-ranked INT results boosts AUC iP/R by 7.84%. Statistical significance t-test results show that our INT/IPT system with re-ranking outperforms that without re-ranking by a statistically significant difference. Conclusions In this paper, we present a new re-ranking algorithm that considers co-occurrence among identifiers in an article to improve INT and IPT ranking results. Combining the re-ranked INT results with an unsupervised approach to find associations among interactors, the proposed method can boost the IPT performance. We also implement score computation using dynamic programming, which is faster and more efficient than traditional approaches. PMID:21342534

Model of Decision Making through Consensus in Ranking Case

Science.gov (United States)

Tarigan, Gim; Darnius, Open

2018-01-01

The basic problem to determine ranking consensus is a problem to combine some rankings those are decided by two or more Decision Maker (DM) into ranking consensus. DM is frequently asked to present their preferences over a group of objects in terms of ranks, for example to determine a new project, new product, a candidate in a election, and so on. The problem in ranking can be classified into two major categories; namely, cardinal and ordinal rankings. The objective of the study is to obtin the ranking consensus by appying some algorithms and methods. The algorithms and methods used in this study were partial algorithm, optimal ranking consensus, BAK (Borde-Kendal)Model. A method proposed as an alternative in ranking conssensus is a Weighted Distance Forward-Backward (WDFB) method, which gave a little difference i ranking consensus result compare to the result oethe example solved by Cook, et.al (2005).

Ranking the Online Documents Based on Relative Credibility Measures

Directory of Open Access Journals (Sweden)

Ahmad Dahlan

2013-09-01

Full Text Available Information searching is the most popular activity in Internet. Usually the search engine provides the search results ranked by the relevance. However, for a certain purpose that concerns with information credibility, particularly citing information for scientific works, another approach of ranking the search engine results is required. This paper presents a study on developing a new ranking method based on the credibility of information. The method is built up upon two well-known algorithms, PageRank and Citation Analysis. The result of the experiment that used Spearman Rank Correlation Coefficient to compare the proposed rank (generated by the method with the standard rank (generated manually by a group of experts showed that the average Spearman 0 < rS < critical value. It means that the correlation was proven but it was not significant. Hence the proposed rank does not satisfy the standard but the performance could be improved.

Ranking the Online Documents Based on Relative Credibility Measures

Directory of Open Access Journals (Sweden)

Ahmad Dahlan

2009-05-01

Full Text Available Information searching is the most popular activity in Internet. Usually the search engine provides the search results ranked by the relevance. However, for a certain purpose that concerns with information credibility, particularly citing information for scientific works, another approach of ranking the search engine results is required. This paper presents a study on developing a new ranking method based on the credibility of information. The method is built up upon two well-known algorithms, PageRank and Citation Analysis. The result of the experiment that used Spearman Rank Correlation Coefficient to compare the proposed rank (generated by the method with the standard rank (generated manually by a group of experts showed that the average Spearman 0 < rS < critical value. It means that the correlation was proven but it was not significant. Hence the proposed rank does not satisfy the standard but the performance could be improved.

Social class rank, essentialism, and punitive judgment.

Science.gov (United States)

Kraus, Michael W; Keltner, Dacher

2013-08-01

Recent evidence suggests that perceptions of social class rank influence a variety of social cognitive tendencies, from patterns of causal attribution to moral judgment. In the present studies we tested the hypotheses that upper-class rank individuals would be more likely to endorse essentialist lay theories of social class categories (i.e., that social class is founded in genetically based, biological differences) than would lower-class rank individuals and that these beliefs would decrease support for restorative justice--which seeks to rehabilitate offenders, rather than punish unlawful action. Across studies, higher social class rank was associated with increased essentialism of social class categories (Studies 1, 2, and 4) and decreased support for restorative justice (Study 4). Moreover, manipulated essentialist beliefs decreased preferences for restorative justice (Study 3), and the association between social class rank and class-based essentialist theories was explained by the tendency to endorse beliefs in a just world (Study 2). Implications for how class-based essentialist beliefs potentially constrain social opportunity and mobility are discussed.

Importance of intrinsic and non-network contribution in PageRank centrality and its effect on PageRank localization

OpenAIRE

Deyasi, Krishanu

2016-01-01

PageRank centrality is used by Google for ranking web-pages to present search result for a user query. Here, we have shown that PageRank value of a vertex also depends on its intrinsic, non-network contribution. If the intrinsic, non-network contributions of the vertices are proportional to their degrees or zeros, then their PageRank centralities become proportion to their degrees. Some simulations and empirical data are used to support our study. In addition, we have shown that localization ...

RANK/RANK-Ligand/OPG: Ein neuer Therapieansatz in der Osteoporosebehandlung

Directory of Open Access Journals (Sweden)

Preisinger E

2007-01-01

Full Text Available Die Erforschung der Kopplungsmechanismen zur Osteoklastogenese, Knochenresorption und Remodellierung eröffnete neue mögliche Therapieansätze in der Behandlung der Osteoporose. Eine Schlüsselrolle beim Knochenabbau spielt der RANK- ("receptor activator of nuclear factor (NF- κB"- Ligand (RANKL. Durch die Bindung von RANKL an den Rezeptor RANK wird die Knochenresorption eingeleitet. OPG (Osteoprotegerin sowie der für den klinischen Gebrauch entwickelte humane monoklonale Antikörper (IgG2 Denosumab blockieren die Bindung von RANK-Ligand an RANK und verhindern den Knochenabbau.

Statistical Optimality in Multipartite Ranking and Ordinal Regression.

Science.gov (United States)

Uematsu, Kazuki; Lee, Yoonkyung

2015-05-01

Statistical optimality in multipartite ranking is investigated as an extension of bipartite ranking. We consider the optimality of ranking algorithms through minimization of the theoretical risk which combines pairwise ranking errors of ordinal categories with differential ranking costs. The extension shows that for a certain class of convex loss functions including exponential loss, the optimal ranking function can be represented as a ratio of weighted conditional probability of upper categories to lower categories, where the weights are given by the misranking costs. This result also bridges traditional ranking methods such as proportional odds model in statistics with various ranking algorithms in machine learning. Further, the analysis of multipartite ranking with different costs provides a new perspective on non-smooth list-wise ranking measures such as the discounted cumulative gain and preference learning. We illustrate our findings with simulation study and real data analysis.

Ranking economic history journals

DEFF Research Database (Denmark)

Di Vaio, Gianfranco; Weisdorf, Jacob Louis

2010-01-01

This study ranks-for the first time-12 international academic journals that have economic history as their main topic. The ranking is based on data collected for the year 2007. Journals are ranked using standard citation analysis where we adjust for age, size and self-citation of journals. We also...... compare the leading economic history journals with the leading journals in economics in order to measure the influence on economics of economic history, and vice versa. With a few exceptions, our results confirm the general idea about what economic history journals are the most influential for economic...... history, and that, although economic history is quite independent from economics as a whole, knowledge exchange between the two fields is indeed going on....

Ranking Economic History Journals

DEFF Research Database (Denmark)

Di Vaio, Gianfranco; Weisdorf, Jacob Louis

This study ranks - for the first time - 12 international academic journals that have economic history as their main topic. The ranking is based on data collected for the year 2007. Journals are ranked using standard citation analysis where we adjust for age, size and self-citation of journals. We...... also compare the leading economic history journals with the leading journals in economics in order to measure the influence on economics of economic history, and vice versa. With a few exceptions, our results confirm the general idea about what economic history journals are the most influential...... for economic history, and that, although economic history is quite independent from economics as a whole, knowledge exchange between the two fields is indeed going on....

Ranking scientific publications: the effect of nonlinearity

Science.gov (United States)

Yao, Liyang; Wei, Tian; Zeng, An; Fan, Ying; di, Zengru

2014-10-01

Ranking the significance of scientific publications is a long-standing challenge. The network-based analysis is a natural and common approach for evaluating the scientific credit of papers. Although the number of citations has been widely used as a metric to rank papers, recently some iterative processes such as the well-known PageRank algorithm have been applied to the citation networks to address this problem. In this paper, we introduce nonlinearity to the PageRank algorithm when aggregating resources from different nodes to further enhance the effect of important papers. The validation of our method is performed on the data of American Physical Society (APS) journals. The results indicate that the nonlinearity improves the performance of the PageRank algorithm in terms of ranking effectiveness, as well as robustness against malicious manipulations. Although the nonlinearity analysis is based on the PageRank algorithm, it can be easily extended to other iterative ranking algorithms and similar improvements are expected.

Ranking scientific publications: the effect of nonlinearity.

Science.gov (United States)

Yao, Liyang; Wei, Tian; Zeng, An; Fan, Ying; Di, Zengru

2014-10-17

Ranking the significance of scientific publications is a long-standing challenge. The network-based analysis is a natural and common approach for evaluating the scientific credit of papers. Although the number of citations has been widely used as a metric to rank papers, recently some iterative processes such as the well-known PageRank algorithm have been applied to the citation networks to address this problem. In this paper, we introduce nonlinearity to the PageRank algorithm when aggregating resources from different nodes to further enhance the effect of important papers. The validation of our method is performed on the data of American Physical Society (APS) journals. The results indicate that the nonlinearity improves the performance of the PageRank algorithm in terms of ranking effectiveness, as well as robustness against malicious manipulations. Although the nonlinearity analysis is based on the PageRank algorithm, it can be easily extended to other iterative ranking algorithms and similar improvements are expected.

A folk-psychological ranking of personality facets

Directory of Open Access Journals (Sweden)

Eka Roivainen

2016-10-01

Full Text Available Background Which personality facets should a general personality test measure? No consensus exists on the facet structure of personality, the nature of facets, or the correct method of identifying the most significant facets. However, it can be hypothesized (the lexical hypothesis that high frequency personality describing words more likely represent important personality facets and rarely used words refer to less significant aspects of personality. Participants and procedure A ranking of personality facets was performed by studying the frequency of the use of popular personality adjectives in causal clauses (because he is a kind person on the Internet and in books as attributes of the word person (kind person. Results In Study 1, the 40 most frequently used adjectives had a cumulative usage frequency equal to that of the rest of the 295 terms studied. When terms with a higher-ranking dictionary synonym or antonym were eliminated, 23 terms remained, which represent 23 different facets. In Study 2, clusters of synonymous terms were examined. Within the top 30 clusters, personality terms were used 855 times compared to 240 for the 70 lower-ranking clusters. Conclusions It is hypothesized that personality facets represented by the top-ranking terms and clusters of terms are important and impactful independent of their correlation with abstract underlying personality factors (five/six factor models. Compared to hierarchical personality models, lists of important facets probably better cover those aspects of personality that are situated between the five or six major domains.

Group social rank is associated with performance on a spatial learning task.

Science.gov (United States)

Langley, Ellis J G; van Horik, Jayden O; Whiteside, Mark A; Madden, Joah R

2018-02-01

Dominant individuals differ from subordinates in their performances on cognitive tasks across a suite of taxa. Previous studies often only consider dyadic relationships, rather than the more ecologically relevant social hierarchies or networks, hence failing to account for how dyadic relationships may be adjusted within larger social groups. We used a novel statistical method: randomized Elo-ratings, to infer the social hierarchy of 18 male pheasants, Phasianus colchicus , while in a captive, mixed-sex group with a linear hierarchy. We assayed individual learning performance of these males on a binary spatial discrimination task to investigate whether inter-individual variation in performance is associated with group social rank. Task performance improved with increasing trial number and was positively related to social rank, with higher ranking males showing greater levels of success. Motivation to participate in the task was not related to social rank or task performance, thus indicating that these rank-related differences are not a consequence of differences in motivation to complete the task. Our results provide important information about how variation in cognitive performance relates to an individual's social rank within a group. Whether the social environment causes differences in learning performance or instead, inherent differences in learning ability predetermine rank remains to be tested.

Ranking Adverse Drug Reactions With Crowdsourcing

KAUST Repository

Gottlieb, Assaf

2015-03-23

Background: There is no publicly available resource that provides the relative severity of adverse drug reactions (ADRs). Such a resource would be useful for several applications, including assessment of the risks and benefits of drugs and improvement of patient-centered care. It could also be used to triage predictions of drug adverse events. Objective: The intent of the study was to rank ADRs according to severity. Methods: We used Internet-based crowdsourcing to rank ADRs according to severity. We assigned 126,512 pairwise comparisons of ADRs to 2589 Amazon Mechanical Turk workers and used these comparisons to rank order 2929 ADRs. Results: There is good correlation (rho=.53) between the mortality rates associated with ADRs and their rank. Our ranking highlights severe drug-ADR predictions, such as cardiovascular ADRs for raloxifene and celecoxib. It also triages genes associated with severe ADRs such as epidermal growth-factor receptor (EGFR), associated with glioblastoma multiforme, and SCN1A, associated with epilepsy. Conclusions: ADR ranking lays a first stepping stone in personalized drug risk assessment. Ranking of ADRs using crowdsourcing may have useful clinical and financial implications, and should be further investigated in the context of health care decision making.

Validating rankings in soccer championships

Directory of Open Access Journals (Sweden)

Annibal Parracho Sant'Anna

2012-08-01

Full Text Available The final ranking of a championship is determined by quality attributes combined with other factors which should be filtered out of any decision on relegation or draft for upper level tournaments. Factors like referees' mistakes and difficulty of certain matches due to its accidental importance to the opponents should have their influence reduced. This work tests approaches to combine classification rules considering the imprecision of the number of points as a measure of quality and of the variables that provide reliable explanation for it. Two home-advantage variables are tested and shown to be apt to enter as explanatory variables. Independence between the criteria is checked against the hypothesis of maximal correlation. The importance of factors and of composition rules is evaluated on the basis of correlation between rank vectors, number of classes and number of clubs in tail classes. Data from five years of the Brazilian Soccer Championship are analyzed.

Image Re-Ranking Based on Topic Diversity.

Science.gov (United States)

Qian, Xueming; Lu, Dan; Wang, Yaxiong; Zhu, Li; Tang, Yuan Yan; Wang, Meng

2017-08-01

Social media sharing Websites allow users to annotate images with free tags, which significantly contribute to the development of the web image retrieval. Tag-based image search is an important method to find images shared by users in social networks. However, how to make the top ranked result relevant and with diversity is challenging. In this paper, we propose a topic diverse ranking approach for tag-based image retrieval with the consideration of promoting the topic coverage performance. First, we construct a tag graph based on the similarity between each tag. Then, the community detection method is conducted to mine the topic community of each tag. After that, inter-community and intra-community ranking are introduced to obtain the final retrieved results. In the inter-community ranking process, an adaptive random walk model is employed to rank the community based on the multi-information of each topic community. Besides, we build an inverted index structure for images to accelerate the searching process. Experimental results on Flickr data set and NUS-Wide data sets show the effectiveness of the proposed approach.

Error analysis of stochastic gradient descent ranking.

Science.gov (United States)

Chen, Hong; Tang, Yi; Li, Luoqing; Yuan, Yuan; Li, Xuelong; Tang, Yuanyan

2013-06-01

Ranking is always an important task in machine learning and information retrieval, e.g., collaborative filtering, recommender systems, drug discovery, etc. A kernel-based stochastic gradient descent algorithm with the least squares loss is proposed for ranking in this paper. The implementation of this algorithm is simple, and an expression of the solution is derived via a sampling operator and an integral operator. An explicit convergence rate for leaning a ranking function is given in terms of the suitable choices of the step size and the regularization parameter. The analysis technique used here is capacity independent and is novel in error analysis of ranking learning. Experimental results on real-world data have shown the effectiveness of the proposed algorithm in ranking tasks, which verifies the theoretical analysis in ranking error.

Standard test method for ranking resistance of plastics to sliding wear using block-on-ring wear test—cumulative wear method

CERN Document Server

American Society for Testing and Materials. Philadelphia

2003-01-01

1.1 This test method covers laboratory procedures for determining the resistance of plastics to sliding wear. The test utilizes a block-on-ring friction and wear testing machine to rank plastics according to their sliding wear characteristics against metals or other solids. 1.2 An important attribute of this test is that it is very flexible. Any material that can be fabricated into, or applied to, blocks and rings can be tested. Thus, the potential materials combinations are endless. In addition, the test can be run with different gaseous atmospheres and elevated temperatures, as desired, to simulate service conditions. 1.3 Wear test results are reported as the volume loss in cubic millimetres for the block and ring. Materials of higher wear resistance will have lower volume loss. 1.4 The values stated in SI units are to be regarded as the standard. The values given in parentheses are for information only. 1.5 This standard does not purport to address all of the safety concerns, if any, associated with it...

AptRank: an adaptive PageRank model for protein function prediction on   bi-relational graphs.

Science.gov (United States)

Jiang, Biaobin; Kloster, Kyle; Gleich, David F; Gribskov, Michael

2017-06-15

Diffusion-based network models are widely used for protein function prediction using protein network data and have been shown to outperform neighborhood-based and module-based methods. Recent studies have shown that integrating the hierarchical structure of the Gene Ontology (GO) data dramatically improves prediction accuracy. However, previous methods usually either used the GO hierarchy to refine the prediction results of multiple classifiers, or flattened the hierarchy into a function-function similarity kernel. No study has taken the GO hierarchy into account together with the protein network as a two-layer network model. We first construct a Bi-relational graph (Birg) model comprised of both protein-protein association and function-function hierarchical networks. We then propose two diffusion-based methods, BirgRank and AptRank, both of which use PageRank to diffuse information on this two-layer graph model. BirgRank is a direct application of traditional PageRank with fixed decay parameters. In contrast, AptRank utilizes an adaptive diffusion mechanism to improve the performance of BirgRank. We evaluate the ability of both methods to predict protein function on yeast, fly and human protein datasets, and compare with four previous methods: GeneMANIA, TMC, ProteinRank and clusDCA. We design four different validation strategies: missing function prediction, de novo function prediction, guided function prediction and newly discovered function prediction to comprehensively evaluate predictability of all six methods. We find that both BirgRank and AptRank outperform the previous methods, especially in missing function prediction when using only 10% of the data for training. The MATLAB code is available at https://github.rcac.purdue.edu/mgribsko/aptrank . gribskov@purdue.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

A new concept for stainless steels ranking upon the resistance to cavitation erosion

Science.gov (United States)

Bordeasu, I.; Popoviciu, M. O.; Salcianu, L. C.; Ghera, C.; Micu, L. M.; Badarau, R.; Iosif, A.; Pirvulescu, L. D.; Podoleanu, C. E.

2017-01-01

In present, the ranking of materials as their resistance to cavitation erosion is obtained by using laboratory tests finalized with the characteristic curves mean depth erosion against time MDE(t) and mean depth erosion rate against time MDER(t). In some previous papers, Bordeasu and co-workers give procedures to establish exponential equation representing the curves, with minimum scatter of the experimental obtained results. For a given material, both exponential equations MDE(t) and MDER(t) have the same values for the parameters of scale and for the shape one. For the ranking of materials is sometimes important to establish single figure. Till now in Timisoara Polytechnic University Cavitation Laboratory were used three such numbers: the stable value of the curve MDER(t), the resistance to cavitation erosion (Rcav ≡ 1/MDERstable) and the normalized cavitation resistance Rns which is the rate between vs = MDERstable for the analyzed material and vse= MDERse the mean depth erosion rate for the steel OH12NDL (Rns = vs/vse ). OH12NDL is a material used for manufacturing the blades of numerous Kaplan turbines in Romania for which both cavitation erosion laboratory tests and field measurements of cavitation erosions are available. In the present paper we recommend a new method for ranking the materials upon cavitation erosion resistance. This method uses the scale and shape parameters of the exponential equations which represents the characteristic cavitation erosion curves. Till now the method was applied only for stainless steels. The experimental results show that the scale parameter represents an excellent method for ranking the stainless steels. In the future this kind of ranking will be tested also for other materials especially for bronzes used for manufacturing ship propellers.

A Ranking Approach to Genomic Selection.

Science.gov (United States)

Blondel, Mathieu; Onogi, Akio; Iwata, Hiroyoshi; Ueda, Naonori

2015-01-01

Genomic selection (GS) is a recent selective breeding method which uses predictive models based on whole-genome molecular markers. Until now, existing studies formulated GS as the problem of modeling an individual's breeding value for a particular trait of interest, i.e., as a regression problem. To assess predictive accuracy of the model, the Pearson correlation between observed and predicted trait values was used. In this paper, we propose to formulate GS as the problem of ranking individuals according to their breeding value. Our proposed framework allows us to employ machine learning methods for ranking which had previously not been considered in the GS literature. To assess ranking accuracy of a model, we introduce a new measure originating from the information retrieval literature called normalized discounted cumulative gain (NDCG). NDCG rewards more strongly models which assign a high rank to individuals with high breeding value. Therefore, NDCG reflects a prerequisite objective in selective breeding: accurate selection of individuals with high breeding value. We conducted a comparison of 10 existing regression methods and 3 new ranking methods on 6 datasets, consisting of 4 plant species and 25 traits. Our experimental results suggest that tree-based ensemble methods including McRank, Random Forests and Gradient Boosting Regression Trees achieve excellent ranking accuracy. RKHS regression and RankSVM also achieve good accuracy when used with an RBF kernel. Traditional regression methods such as Bayesian lasso, wBSR and BayesC were found less suitable for ranking. Pearson correlation was found to correlate poorly with NDCG. Our study suggests two important messages. First, ranking methods are a promising research direction in GS. Second, NDCG can be a useful evaluation measure for GS.

Communities in Large Networks: Identification and Ranking

DEFF Research Database (Denmark)

Olsen, Martin

2008-01-01

We study the problem of identifying and ranking the members of a community in a very large network with link analysis only, given a set of representatives of the community. We define the concept of a community justified by a formal analysis of a simple model of the evolution of a directed graph. ...... and its immediate surroundings. The members are ranked with a “local” variant of the PageRank algorithm. Results are reported from successful experiments on identifying and ranking Danish Computer Science sites and Danish Chess pages using only a few representatives....

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan

2014-04-17

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.

Low-rank coal research

Energy Technology Data Exchange (ETDEWEB)

Weber, G. F.; Laudal, D. L.

1989-01-01

This work is a compilation of reports on ongoing research at the University of North Dakota. Topics include: Control Technology and Coal Preparation Research (SO{sub x}/NO{sub x} control, waste management), Advanced Research and Technology Development (turbine combustion phenomena, combustion inorganic transformation, coal/char reactivity, liquefaction reactivity of low-rank coals, gasification ash and slag characterization, fine particulate emissions), Combustion Research (fluidized bed combustion, beneficiation of low-rank coals, combustion characterization of low-rank coal fuels, diesel utilization of low-rank coals), Liquefaction Research (low-rank coal direct liquefaction), and Gasification Research (hydrogen production from low-rank coals, advanced wastewater treatment, mild gasification, color and residual COD removal from Synfuel wastewaters, Great Plains Gasification Plant, gasifier optimization).

Implementation of Chaotic Gaussian Particle Swarm Optimization for Optimize Learning-to-Rank Software Defect Prediction Model Construction

Science.gov (United States)

Buchari, M. A.; Mardiyanto, S.; Hendradjaya, B.

2018-03-01

Finding the existence of software defect as early as possible is the purpose of research about software defect prediction. Software defect prediction activity is required to not only state the existence of defects, but also to be able to give a list of priorities which modules require a more intensive test. Therefore, the allocation of test resources can be managed efficiently. Learning to rank is one of the approach that can provide defect module ranking data for the purposes of software testing. In this study, we propose a meta-heuristic chaotic Gaussian particle swarm optimization to improve the accuracy of learning to rank software defect prediction approach. We have used 11 public benchmark data sets as experimental data. Our overall results has demonstrated that the prediction models construct using Chaotic Gaussian Particle Swarm Optimization gets better accuracy on 5 data sets, ties in 5 data sets and gets worse in 1 data sets. Thus, we conclude that the application of Chaotic Gaussian Particle Swarm Optimization in Learning-to-Rank approach can improve the accuracy of the defect module ranking in data sets that have high-dimensional features.

Social class rank, threat vigilance, and hostile reactivity.

Science.gov (United States)

Kraus, Michael W; Horberg, E J; Goetz, Jennifer L; Keltner, Dacher

2011-10-01

Lower-class individuals, because of their lower rank in society, are theorized to be more vigilant to social threats relative to their high-ranking upper-class counterparts. This class-related vigilance to threat, the authors predicted, would shape the emotional content of social interactions in systematic ways. In Study 1, participants engaged in a teasing interaction with a close friend. Lower-class participants--measured in terms of social class rank in society and within the friendship--more accurately tracked the hostile emotions of their friend. As a result, lower-class individuals experienced more hostile emotion contagion relative to upper-class participants. In Study 2, lower-class participants manipulated to experience lower subjective socioeconomic rank showed more hostile reactivity to ambiguous social scenarios relative to upper-class participants and to lower-class participants experiencing elevated socioeconomic rank. The results suggest that class affects expectations, perception, and experience of hostile emotion, particularly in situations in which lower-class individuals perceive their subordinate rank.

Motion in fourth-rank gravity

International Nuclear Information System (INIS)

Tapia, V.

1992-04-01

Recently we have explored the consequences of describing the metric properties of our universe through a quartic line element. In this geometry the natural object is a fourth-rank metric, i.e., a tensor with four indices. Based on this geometry we constructed a simple field theory for the gravitational field. The field equations coincide with the Einstein field equations in the vacuum case. This fact, however, does not guarantee the observational equivalence of both theories since one must still verify that, as a consequence of the field equations, test particles move along geodesics. This letter is aimed at establishing this result. (author). 7 refs

Groundwater contaminant plume ranking

International Nuclear Information System (INIS)

1988-08-01

Containment plumes at Uranium Mill Tailings Remedial Action (UMTRA) Project sites were ranked to assist in Subpart B (i.e., restoration requirements of 40 CFR Part 192) compliance strategies for each site, to prioritize aquifer restoration, and to budget future requests and allocations. The rankings roughly estimate hazards to the environment and human health, and thus assist in determining for which sites cleanup, if appropriate, will provide the greatest benefits for funds available. The rankings are based on the scores that were obtained using the US Department of Energy's (DOE) Modified Hazard Ranking System (MHRS). The MHRS and HRS consider and score three hazard modes for a site: migration, fire and explosion, and direct contact. The migration hazard mode score reflects the potential for harm to humans or the environment from migration of a hazardous substance off a site by groundwater, surface water, and air; it is a composite of separate scores for each of these routes. For ranking the containment plumes at UMTRA Project sites, it was assumed that each site had been remediated in compliance with the EPA standards and that relict contaminant plumes were present. Therefore, only the groundwater route was scored, and the surface water and air routes were not considered. Section 2.0 of this document describes the assumptions and procedures used to score the groundwater route, and Section 3.0 provides the resulting scores for each site. 40 tabs

Efficient Rank Reduction of Correlation Matrices

NARCIS (Netherlands)

I. Grubisic (Igor); R. Pietersz (Raoul)

2005-01-01

textabstractGeometric optimisation algorithms are developed that efficiently find the nearest low-rank correlation matrix. We show, in numerical tests, that our methods compare favourably to the existing methods in the literature. The connection with the Lagrange multiplier method is established,

A tilting approach to ranking influence

KAUST Repository

Genton, Marc G.

2014-12-01

We suggest a new approach, which is applicable for general statistics computed from random samples of univariate or vector-valued or functional data, to assessing the influence that individual data have on the value of a statistic, and to ranking the data in terms of that influence. Our method is based on, first, perturbing the value of the statistic by ‘tilting’, or reweighting, each data value, where the total amount of tilt is constrained to be the least possible, subject to achieving a given small perturbation of the statistic, and, then, taking the ranking of the influence of data values to be that which corresponds to ranking the changes in data weights. It is shown, both theoretically and numerically, that this ranking does not depend on the size of the perturbation, provided that the perturbation is sufficiently small. That simple result leads directly to an elegant geometric interpretation of the ranks; they are the ranks of the lengths of projections of the weights onto a ‘line’ determined by the first empirical principal component function in a generalized measure of covariance. To illustrate the generality of the method we introduce and explore it in the case of functional data, where (for example) it leads to generalized boxplots. The method has the advantage of providing an interpretable ranking that depends on the statistic under consideration. For example, the ranking of data, in terms of their influence on the value of a statistic, is different for a measure of location and for a measure of scale. This is as it should be; a ranking of data in terms of their influence should depend on the manner in which the data are used. Additionally, the ranking recognizes, rather than ignores, sign, and in particular can identify left- and right-hand ‘tails’ of the distribution of a random function or vector.

Inhibition of osteoclastogenesis by RNA interference targeting RANK

Directory of Open Access Journals (Sweden)

Ma Ruofan

2012-08-01

Full Text Available Abstract Background Osteoclasts and osteoblasts regulate bone resorption and formation to allow bone remodeling and homeostasis. The balance between bone resorption and formation is disturbed by abnormal recruitment of osteoclasts. Osteoclast differentiation is dependent on the receptor activator of nuclear factor NF-kappa B (RANK ligand (RANKL as well as the macrophage colony-stimulating factor (M-CSF. The RANKL/RANK system and RANK signaling induce osteoclast formation mediated by various cytokines. The RANK/RANKL pathway has been primarily implicated in metabolic, degenerative and neoplastic bone disorders or osteolysis. The central role of RANK/RANKL interaction in osteoclastogenesis makes RANK an attractive target for potential therapies in treatment of osteolysis. The purpose of this study was to assess the effect of inhibition of RANK expression in mouse bone marrow macrophages on osteoclast differentiation and bone resorption. Methods Three pairs of short hairpin RNAs (shRNA targeting RANK were designed and synthesized. The optimal shRNA was selected among three pairs of shRNAs by RANK expression analyzed by Western blot and Real-time PCR. We investigated suppression of osteoclastogenesis of mouse bone marrow macrophages (BMMs using the optimal shRNA by targeting RANK. Results Among the three shRANKs examined, shRANK-3 significantly suppressed [88.3%] the RANK expression (p Conclusions These findings suggest that retrovirus-mediated shRNA targeting RANK inhibits osteoclast differentiation and osteolysis. It may appear an attractive target for preventing osteolysis in humans with a potential clinical application.

Use of the dry-weight-rank method of botanical analysis in the ...

African Journals Online (AJOL)

The dry-weight-rank method of botanical analysis was tested in the highveld of the Eastern Transvaal and was found to be an efficient and accurate means of determining the botanical composition of veld herbage. Accuracy was increased by weighting ranks on the basis of quadrat yield, and by allocation of equal ranks to ...

Prototyping a Distributed Information Retrieval System That Uses Statistical Ranking.

Science.gov (United States)

Harman, Donna; And Others

1991-01-01

Built using a distributed architecture, this prototype distributed information retrieval system uses statistical ranking techniques to provide better service to the end user. Distributed architecture was shown to be a feasible alternative to centralized or CD-ROM information retrieval, and user testing of the ranking methodology showed both…

Low-Rank Matrix Factorization With Adaptive Graph Regularizer.

Science.gov (United States)

Lu, Gui-Fu; Wang, Yong; Zou, Jian

2016-05-01

In this paper, we present a novel low-rank matrix factorization algorithm with adaptive graph regularizer (LMFAGR). We extend the recently proposed low-rank matrix with manifold regularization (MMF) method with an adaptive regularizer. Different from MMF, which constructs an affinity graph in advance, LMFAGR can simultaneously seek graph weight matrix and low-dimensional representations of data. That is, graph construction and low-rank matrix factorization are incorporated into a unified framework, which results in an automatically updated graph rather than a predefined one. The experimental results on some data sets demonstrate that the proposed algorithm outperforms the state-of-the-art low-rank matrix factorization methods.

The BACON Approach for Rank-Deficient Data

Directory of Open Access Journals (Sweden)

Athanassios Kondylis

2012-07-01

Full Text Available Normal 0 false false false EN-US X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} Rank-deficient data are not uncommon in practice. They result from highly collinear variables and/or high-dimensional data. A special case of the latter occurs when the number of recorded variables exceeds the number of observations. The use of the BACON algorithm for outlier detection in multivariate data is extended here to include rank-deficient data. We present two approaches to identifying outliers in rank-deficient data based on the original BACON algorithm. The first algorithm projects the data onto a robust subspace of reduced dimension, while the second employs a ridge type regularization on the covariance matrix. Both algorithms are tested on real as well as simulated data sets with good results in terms of their effectiveness in outlier detection. They are also examined in terms of computational efficiency and found to be very fast, with particularly good scaling properties for increasing dimension.

PageRank, HITS and a unified framework for link analysis

Energy Technology Data Exchange (ETDEWEB)

Ding, Chris; He, Xiaofeng; Husbands, Parry; Zha, Hongyuan; Simon, Horst

2001-10-01

Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight normalization and web surfing based on random walk models. We systematically generalize/combine these concepts into a unified framework. The ranking framework contains a large algorithm space; HITS and PageRank are two extreme ends in this space. We study several normalized ranking algorithms which are intermediate between HITS and PageRank, and obtain closed-form solutions. We show that, to first order approximation, all ranking algorithms in this framework, including PageRank and HITS, lead to same ranking which is highly correlated with ranking by indegree. These results support the notion that in web resource ranking indegree and outdegree are of fundamental importance. Rankings of webgraphs of different sizes and queries are presented to illustrate our analysis.

Differential invariants for higher-rank tensors. A progress report

International Nuclear Information System (INIS)

Tapial, V.

2004-07-01

We outline the construction of differential invariants for higher-rank tensors. In section 2 we outline the general method for the construction of differential invariants. A first result is that the simplest tensor differential invariant contains derivatives of the same order as the rank of the tensor. In section 3 we review the construction for the first-rank tensors (vectors) and second-rank tensors (metrics). In section 4 we outline the same construction for higher-rank tensors. (author)

Heuristics for Relevancy Ranking of Earth Dataset Search Results

Science.gov (United States)

Lynnes, Christopher; Quinn, Patrick; Norton, James

2016-01-01

As the Variety of Earth science datasets increases, science researchers find it more challenging to discover and select the datasets that best fit their needs. The most common way of search providers to address this problem is to rank the datasets returned for a query by their likely relevance to the user. Large web page search engines typically use text matching supplemented with reverse link counts, semantic annotations and user intent modeling. However, this produces uneven results when applied to dataset metadata records simply externalized as a web page. Fortunately, data and search provides have decades of experience in serving data user communities, allowing them to form heuristics that leverage the structure in the metadata together with knowledge about the user community. Some of these heuristics include specific ways of matching the user input to the essential measurements in the dataset and determining overlaps of time range and spatial areas. Heuristics based on the novelty of the datasets can prioritize later, better versions of data over similar predecessors. And knowledge of how different user types and communities use data can be brought to bear in cases where characteristics of the user (discipline, expertise) or their intent (applications, research) can be divined. The Earth Observing System Data and Information System has begun implementing some of these heuristics in the relevancy algorithm of its Common Metadata Repository search engine.

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan; Sun, Yijun; Gao, Xin

2014-01-01

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse

Diversifying customer review rankings.

Science.gov (United States)

Krestel, Ralf; Dokoohaki, Nima

2015-06-01

E-commerce Web sites owe much of their popularity to consumer reviews accompanying product descriptions. On-line customers spend hours and hours going through heaps of textual reviews to decide which products to buy. At the same time, each popular product has thousands of user-generated reviews, making it impossible for a buyer to read everything. Current approaches to display reviews to users or recommend an individual review for a product are based on the recency or helpfulness of each review. In this paper, we present a framework to rank product reviews by optimizing the coverage of the ranking with respect to sentiment or aspects, or by summarizing all reviews with the top-K reviews in the ranking. To accomplish this, we make use of the assigned star rating for a product as an indicator for a review's sentiment polarity and compare bag-of-words (language model) with topic models (latent Dirichlet allocation) as a mean to represent aspects. Our evaluation on manually annotated review data from a commercial review Web site demonstrates the effectiveness of our approach, outperforming plain recency ranking by 30% and obtaining best results by combining language and topic model representations. Copyright © 2015 Elsevier Ltd. All rights reserved.

Ranking accounting, banking and finance journals: A note

OpenAIRE

Halkos, George; Tzeremes, Nickolaos

2012-01-01

This paper by applying Data Envelopment Analysis (DEA) ranks Economics journals in the field of Accounting, Banking and Finance. By using one composite input and one composite output the paper ranks 57 journals. In addition for the first time three different quality ranking reports have been incorporated to the DEA modelling problem in order to classify the journals into four categories (‘A’ to ‘D’). The results reveal that the journals with the highest rankings in the field are Journal of Fi...

Rank Two Affine Manifolds in Genus 3

OpenAIRE

Aulicino, David; Nguyen, Duc-Manh

2016-01-01

We complete the classification of rank two affine manifolds in the moduli space of translation surfaces in genus three. Combined with a recent result of Mirzakhani and Wright, this completes the classification of higher rank affine manifolds in genus three.

The Health Professions Admission Test (HPAT) score and leaving certificate results can independently predict academic performance in medical school: do we need both tests?

LENUS (Irish Health Repository)

Halpenny, D

2010-11-01

A recent study raised concerns regarding the ability of the health professions admission test (HPAT) Ireland to improve the selection process in Irish medical schools. We aimed to establish whether performance in a mock HPAT correlated with academic success in medicine. A modified HPAT examination and a questionnaire were administered to a group of doctors and medical students. There was a significant correlation between HPAT score and college results (r2: 0.314, P = 0.018, Spearman Rank) and between leaving cert score and college results (r2: 0.306, P = 0.049, Spearman Rank). There was no correlation between leaving cert points score and HPAT score. There was no difference in HPAT score across a number of other variables including gender, age and medical speciality. Our results suggest that both the HPAT Ireland and the leaving certificate examination could act as independent predictors of academic achievement in medicine.

Comparative Case Studies on Indonesian Higher Education Rankings

Science.gov (United States)

Kurniasih, Nuning; Hasyim, C.; Wulandari, A.; Setiawan, M. I.; Ahmar, A. S.

2018-01-01

The quality of the higher education is the result of a continuous process. There are many indicators that can be used to assess the quality of a higher education. The existence of different indicators makes the different result of university rankings. This research aims to find variables that can connect ranking indicators that are used by Indonesian Ministry of Research, Technology, and Higher Education with indicators that are used by international rankings by taking two kind of ranking systems i.e. Webometrics and 4icu. This research uses qualitative research method with comparative case studies approach. The result of the research shows that to bridge the indicators that are used by Indonesian Ministry or Research, Technology, and Higher Education with web-based ranking system like Webometrics and 4icu so that the Indonesian higher education institutions need to open access towards either scientific or non-scientific that are publicly used into web-based environment. One of the strategies that can be used to improve the openness and access towards scientific work of a university is by involving in open science and collaboration.

Health Risk Ranking of Lead Contaminated Sites in Bagega Community, Zamfara State, Nigeria

Directory of Open Access Journals (Sweden)

Alaba Olanreaju Clement

2017-09-01

Full Text Available Background: The release of lead dust during the processing of lead-gold ore has become an environmental threat. Therefore the protection of miners’ health and their environment required remediation which can be achieved by ranking the risk posed by lead in order to prioritize the allocation of resources during remediation. Methods: Soil and water samples were collected at BRC, BRG, BVC, BPA and BFA; BWE, BBH and BPO using stratified random and grab sampling methods. Lead concentrations in the samples were determined using AAS while health risk index (HRI via ingestion was estimated using USEPA equations. The ranking of HRI was done using Detailed Quantitative Risk Assessment while the difference between the HRI and USEPA standard were determined using one sample t test. Results: The result showed that BRC/10, BRG/03, BVC/11, BPA/02 and BFA/08 were ranked highest in soil samples, while BWE/02, BBH/09 and BPO/04 were ranked highest in water samples as they posed elevated health risk effects to miners. One sample t test established that the BRC, BPA, BFA and BPO were significantly different from United States Environmental Protection Agency (US EPA standard. Conclusion: The study discovered that the users of both the lead contaminated soil and water were seriously exposed to potential health risk. It therefore suggested that decision makers should give priority in allocating resources to those sites with elevated lead concentrations during the remediation.

The effect of uncertainties in distance-based ranking methods for multi-criteria decision making

Science.gov (United States)

Jaini, Nor I.; Utyuzhnikov, Sergei V.

2017-08-01

Data in the multi-criteria decision making are often imprecise and changeable. Therefore, it is important to carry out sensitivity analysis test for the multi-criteria decision making problem. The paper aims to present a sensitivity analysis for some ranking techniques based on the distance measures in multi-criteria decision making. Two types of uncertainties are considered for the sensitivity analysis test. The first uncertainty is related to the input data, while the second uncertainty is towards the Decision Maker preferences (weights). The ranking techniques considered in this study are TOPSIS, the relative distance and trade-off ranking methods. TOPSIS and the relative distance method measure a distance from an alternative to the ideal and antiideal solutions. In turn, the trade-off ranking calculates a distance of an alternative to the extreme solutions and other alternatives. Several test cases are considered to study the performance of each ranking technique in both types of uncertainties.

Time evolution of Wikipedia network ranking

Science.gov (United States)

Eom, Young-Ho; Frahm, Klaus M.; Benczúr, András; Shepelyansky, Dima L.

2013-12-01

We study the time evolution of ranking and spectral properties of the Google matrix of English Wikipedia hyperlink network during years 2003-2011. The statistical properties of ranking of Wikipedia articles via PageRank and CheiRank probabilities, as well as the matrix spectrum, are shown to be stabilized for 2007-2011. A special emphasis is done on ranking of Wikipedia personalities and universities. We show that PageRank selection is dominated by politicians while 2DRank, which combines PageRank and CheiRank, gives more accent on personalities of arts. The Wikipedia PageRank of universities recovers 80% of top universities of Shanghai ranking during the considered time period.

Ranking of Prokaryotic Genomes Based on Maximization of Sortedness of Gene Lengths.

Science.gov (United States)

Bolshoy, A; Salih, B; Cohen, I; Tatarinova, T

How variations of gene lengths (some genes become longer than their predecessors, while other genes become shorter and the sizes of these factions are randomly different from organism to organism) depend on organismal evolution and adaptation is still an open question. We propose to rank the genomes according to lengths of their genes, and then find association between the genome rank and variousproperties, such as growth temperature, nucleotide composition, and pathogenicity. This approach reveals evolutionary driving factors. The main purpose of this study is to test effectiveness and robustness of several ranking methods. The selected method of evaluation is measuring of overall sortedness of the data. We have demonstrated that all considered methods give consistent results and Bubble Sort and Simulated Annealing achieve the highest sortedness. Also, Bubble Sort is considerably faster than the Simulated Annealing method.

Individual recognition of social rank and social memory performance depends on a functional circadian system.

Science.gov (United States)

Müller, L; Weinert, D

2016-11-01

system result in an impaired individual recognition of social rank. A social recognition/discrimination task was used in Experiment 2 to quantify social memory performance. In a training session, the hamsters were confronted with two unfamiliar stimulus animals. In the test session, one of the two animals was replaced. The training-test interval was 2min or 24h. The times animals did explore the novel and the familiar stimulus animal were recorded, and the discrimination index as a measure of cognitive performance was calculated. Behavioral tests revealed that after 2min both subordinate and dominant WT hamsters were able to discriminate between familiar and novel stimulus animals but after 24h only the subordinate animals. On contrary in AR hamsters, only subordinates were able to perform the social recognition/discrimination task and only after a training-test interval of 2min. The results show that the social rank and the circadian system have an impact on the cognitive abilities of Djungarian hamsters. Disruptions of circadian rhythms impair individual recognition and social memory performance. Copyright © 2016 Elsevier B.V. All rights reserved.

LogDet Rank Minimization with Application to Subspace Clustering

Directory of Open Access Journals (Sweden)

Zhao Kang

2015-01-01

Full Text Available Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent studies use the nuclear norm as a convex surrogate of the rank operator. However, all singular values are simply added together by the nuclear norm, and thus the rank may not be well approximated in practical problems. In this paper, we propose using a log-determinant (LogDet function as a smooth and closer, though nonconvex, approximation to rank for obtaining a low-rank representation in subspace clustering. Augmented Lagrange multipliers strategy is applied to iteratively optimize the LogDet-based nonconvex objective function on potentially large-scale data. By making use of the angular information of principal directions of the resultant low-rank representation, an affinity graph matrix is constructed for spectral clustering. Experimental results on motion segmentation and face clustering data demonstrate that the proposed method often outperforms state-of-the-art subspace clustering algorithms.

Extracting Rankings for Spatial Keyword Queries from GPS Data

DEFF Research Database (Denmark)

Keles, Ilkcan; Jensen, Christian Søndergaard; Saltenis, Simonas

2018-01-01

Studies suggest that many search engine queries have local intent. We consider the evaluation of ranking functions important for such queries. The key challenge is to be able to determine the “best” ranking for a query, as this enables evaluation of the results of ranking functions. We propose...

Improving Ranking Using Quantum Probability

OpenAIRE

Melucci, Massimo

2011-01-01

The paper shows that ranking information units by quantum probability differs from ranking them by classical probability provided the same data used for parameter estimation. As probability of detection (also known as recall or power) and probability of false alarm (also known as fallout or size) measure the quality of ranking, we point out and show that ranking by quantum probability yields higher probability of detection than ranking by classical probability provided a given probability of ...

How Many Alternatives Can Be Ranked? A Comparison of the Paired Comparison and Ranking Methods.

Science.gov (United States)

Ock, Minsu; Yi, Nari; Ahn, Jeonghoon; Jo, Min-Woo

2016-01-01

To determine the feasibility of converting ranking data into paired comparison (PC) data and suggest the number of alternatives that can be ranked by comparing a PC and a ranking method. Using a total of 222 health states, a household survey was conducted in a sample of 300 individuals from the general population. Each respondent performed a PC 15 times and a ranking method 6 times (two attempts of ranking three, four, and five health states, respectively). The health states of the PC and the ranking method were constructed to overlap each other. We converted the ranked data into PC data and examined the consistency of the response rate. Applying probit regression, we obtained the predicted probability of each method. Pearson correlation coefficients were determined between the predicted probabilities of those methods. The mean absolute error was also assessed between the observed and the predicted values. The overall consistency of the response rate was 82.8%. The Pearson correlation coefficients were 0.789, 0.852, and 0.893 for ranking three, four, and five health states, respectively. The lowest mean absolute error was 0.082 (95% confidence interval [CI] 0.074-0.090) in ranking five health states, followed by 0.123 (95% CI 0.111-0.135) in ranking four health states and 0.126 (95% CI 0.113-0.138) in ranking three health states. After empirically examining the consistency of the response rate between a PC and a ranking method, we suggest that using five alternatives in the ranking method may be superior to using three or four alternatives. Copyright © 2016 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by Elsevier Inc. All rights reserved.

Citation ranking versus peer evaluation of senior faculty research performance

DEFF Research Database (Denmark)

Meho, Lokman I.; Sonnenwald, Diane H.

2000-01-01

The purpose of this study is to analyze the relationship between citation ranking and peer evaluation in assessing senior faculty research performance. Other studies typically derive their peer evaluation data directly from referees, often in the form of ranking. This study uses two additional...... indicator of research performance of senior faculty members? Citation data, book reviews, and peer ranking were compiled and examined for faculty members specializing in Kurdish studies. Analysis shows that normalized citation ranking and citation content analysis data yield identical ranking results....... Analysis also shows that normalized citation ranking and citation content analysis, book reviews, and peer ranking perform similarly (i.e., are highly correlated) for high-ranked and low-ranked senior scholars. Additional evaluation methods and measures that take into account the context and content...

A generalization of Friedman's rank statistic

NARCIS (Netherlands)

Kroon, de J.; Laan, van der P.

1983-01-01

In this paper a very natural generalization of the two·way analysis of variance rank statistic of FRIEDMAN is given. The general distribution-free test procedure based on this statistic for the effect of J treatments in a random block design can be applied in general two-way layouts without

MRI reconstruction of multi-image acquisitions using a rank regularizer with data reordering

Energy Technology Data Exchange (ETDEWEB)

Adluru, Ganesh, E-mail: gadluru@gmail.com; Anderson, Jeffrey [UCAIR, Department of Radiology, University of Utah, Salt Lake City, Utah 84108 (United States); Gur, Yaniv [IBM Almaden Research Center, San Jose, California 95120 (United States); Chen, Liyong; Feinberg, David [Advanced MRI Technologies, Sebastpool, California, 95472 (United States); DiBella, Edward V. R. [UCAIR, Department of Radiology, University of Utah, Salt Lake City, Utah 84108 and Department of Bioengineering, University of Utah, Salt Lake City, Utah 84112 (United States)

2015-08-15

Purpose: To improve rank constrained reconstructions for undersampled multi-image MRI acquisitions. Methods: Motivated by the recent developments in low-rank matrix completion theory and its applicability to rapid dynamic MRI, a new reordering-based rank constrained reconstruction of undersampled multi-image data that uses prior image information is proposed. Instead of directly minimizing the nuclear norm of a matrix of estimated images, the nuclear norm of reordered matrix values is minimized. The reordering is based on the prior image estimates. The method is tested on brain diffusion imaging data and dynamic contrast enhanced myocardial perfusion data. Results: Good quality images from data undersampled by a factor of three for diffusion imaging and by a factor of 3.5 for dynamic cardiac perfusion imaging with respiratory motion were obtained. Reordering gave visually improved image quality over standard nuclear norm minimization reconstructions. Root mean squared errors with respect to ground truth images were improved by ∼18% and ∼16% with reordering for diffusion and perfusion applications, respectively. Conclusions: The reordered low-rank constraint is a way to inject prior image information that offers improvements over a standard low-rank constraint for undersampled multi-image MRI reconstructions.

MRI reconstruction of multi-image acquisitions using a rank regularizer with data reordering

International Nuclear Information System (INIS)

Adluru, Ganesh; Anderson, Jeffrey; Gur, Yaniv; Chen, Liyong; Feinberg, David; DiBella, Edward V. R.

2015-01-01

Purpose: To improve rank constrained reconstructions for undersampled multi-image MRI acquisitions. Methods: Motivated by the recent developments in low-rank matrix completion theory and its applicability to rapid dynamic MRI, a new reordering-based rank constrained reconstruction of undersampled multi-image data that uses prior image information is proposed. Instead of directly minimizing the nuclear norm of a matrix of estimated images, the nuclear norm of reordered matrix values is minimized. The reordering is based on the prior image estimates. The method is tested on brain diffusion imaging data and dynamic contrast enhanced myocardial perfusion data. Results: Good quality images from data undersampled by a factor of three for diffusion imaging and by a factor of 3.5 for dynamic cardiac perfusion imaging with respiratory motion were obtained. Reordering gave visually improved image quality over standard nuclear norm minimization reconstructions. Root mean squared errors with respect to ground truth images were improved by ∼18% and ∼16% with reordering for diffusion and perfusion applications, respectively. Conclusions: The reordered low-rank constraint is a way to inject prior image information that offers improvements over a standard low-rank constraint for undersampled multi-image MRI reconstructions

Neophilia Ranking of Scientific Journals.

Science.gov (United States)

Packalen, Mikko; Bhattacharya, Jay

2017-01-01

The ranking of scientific journals is important because of the signal it sends to scientists about what is considered most vital for scientific progress. Existing ranking systems focus on measuring the influence of a scientific paper (citations)-these rankings do not reward journals for publishing innovative work that builds on new ideas. We propose an alternative ranking based on the proclivity of journals to publish papers that build on new ideas, and we implement this ranking via a text-based analysis of all published biomedical papers dating back to 1946. In addition, we compare our neophilia ranking to citation-based (impact factor) rankings; this comparison shows that the two ranking approaches are distinct. Prior theoretical work suggests an active role for our neophilia index in science policy. Absent an explicit incentive to pursue novel science, scientists underinvest in innovative work because of a coordination problem: for work on a new idea to flourish, many scientists must decide to adopt it in their work. Rankings that are based purely on influence thus do not provide sufficient incentives for publishing innovative work. By contrast, adoption of the neophilia index as part of journal-ranking procedures by funding agencies and university administrators would provide an explicit incentive for journals to publish innovative work and thus help solve the coordination problem by increasing scientists' incentives to pursue innovative work.

Population models and simulation methods: The case of the Spearman rank correlation.

Science.gov (United States)

Astivia, Oscar L Olvera; Zumbo, Bruno D

2017-11-01

The purpose of this paper is to highlight the importance of a population model in guiding the design and interpretation of simulation studies used to investigate the Spearman rank correlation. The Spearman rank correlation has been known for over a hundred years to applied researchers and methodologists alike and is one of the most widely used non-parametric statistics. Still, certain misconceptions can be found, either explicitly or implicitly, in the published literature because a population definition for this statistic is rarely discussed within the social and behavioural sciences. By relying on copula distribution theory, a population model is presented for the Spearman rank correlation, and its properties are explored both theoretically and in a simulation study. Through the use of the Iman-Conover algorithm (which allows the user to specify the rank correlation as a population parameter), simulation studies from previously published articles are explored, and it is found that many of the conclusions purported in them regarding the nature of the Spearman correlation would change if the data-generation mechanism better matched the simulation design. More specifically, issues such as small sample bias and lack of power of the t-test and r-to-z Fisher transformation disappear when the rank correlation is calculated from data sampled where the rank correlation is the population parameter. A proof for the consistency of the sample estimate of the rank correlation is shown as well as the flexibility of the copula model to encompass results previously published in the mathematical literature. © 2017 The British Psychological Society.

The ranking of negative-cost emissions reduction measures

International Nuclear Information System (INIS)

Taylor, Simon

2012-01-01

A flaw has been identified in the calculation of the cost-effectiveness in marginal abatement cost curves (MACCs). The problem affects “negative-cost” emissions reduction measures—those that produce a return on investment. The resulting ranking sometimes favours measures that produce low emissions savings and is therefore unreliable. The issue is important because incorrect ranking means a potential failure to achieve the best-value outcome. A simple mathematical analysis shows that not only is the standard cost-effectiveness calculation inadequate for ranking negative-cost measures, but there is no possible replacement that satisfies reasonable requirements. Furthermore, the concept of negative cost-effectiveness is found to be unsound and its use should be avoided. Among other things, this means that MACCs are unsuitable for ranking negative-cost measures. As a result, MACCs produced by a range of organizations including UK government departments may need to be revised. An alternative partial ranking method has been devised by making use of Pareto optimization. The outcome can be presented as a stacked bar chart that indicates both the preferred ordering and the total emissions saving available for each measure without specifying a cost-effectiveness. - Highlights: ► Marginal abatement cost curves (MACCs) are used to rank emission reduction measures. ► There is a flaw in the standard ranking method for negative-cost measures. ► Negative values of cost-effectiveness (in £/tC or equivalent) are invalid. ► There may be errors in published MACCs. ► A method based on Pareto principles provides an alternative ranking method.

Distance-Ranked Fault Identification of Reconfigurable Hardware Bitstreams via Functional Input

Directory of Open Access Journals (Sweden)

Naveed Imran

2014-01-01

Full Text Available Distance-Ranked Fault Identification (DRFI is a dynamic reconfiguration technique which employs runtime inputs to conduct online functional testing of fielded FPGA logic and interconnect resources without test vectors. At design time, a diverse set of functionally identical bitstream configurations are created which utilize alternate hardware resources in the FPGA fabric. An ordering is imposed on the configuration pool as updated by the PageRank indexing precedence. The configurations which utilize permanently damaged resources and hence manifest discrepant outputs, receive lower rank are thus less preferred for instantiation on the FPGA. Results indicate accurate identification of fault-free configurations in a pool of pregenerated bitstreams with a low number of reconfigurations and input evaluations. For MCNC benchmark circuits, the observed reduction in input evaluations is up to 75% when comparing the DRFI technique to unguided evaluation. The DRFI diagnosis method is seen to isolate all 14 healthy configurations from a pool of 100 pregenerated configurations, and thereby offering a 100% isolation accuracy provided the fault-free configurations exist in the design pool. When a complete recovery is not feasible, graceful degradation may be realized which is demonstrated by the PSNR improvement of images processed in a video encoder case study.

Hierarchical partial order ranking

International Nuclear Information System (INIS)

Carlsen, Lars

2008-01-01

Assessing the potential impact on environmental and human health from the production and use of chemicals or from polluted sites involves a multi-criteria evaluation scheme. A priori several parameters are to address, e.g., production tonnage, specific release scenarios, geographical and site-specific factors in addition to various substance dependent parameters. Further socio-economic factors may be taken into consideration. The number of parameters to be included may well appear to be prohibitive for developing a sensible model. The study introduces hierarchical partial order ranking (HPOR) that remedies this problem. By HPOR the original parameters are initially grouped based on their mutual connection and a set of meta-descriptors is derived representing the ranking corresponding to the single groups of descriptors, respectively. A second partial order ranking is carried out based on the meta-descriptors, the final ranking being disclosed though average ranks. An illustrative example on the prioritisation of polluted sites is given. - Hierarchical partial order ranking of polluted sites has been developed for prioritization based on a large number of parameters

Improved efficacy of soluble human receptor activator of nuclear factor kappa B (RANK) fusion protein by site-directed mutagenesis.

Science.gov (United States)

Son, Young Jun; Han, Jihye; Lee, Jae Yeon; Kim, HaHyung; Chun, Taehoon

2015-06-01

Soluble human receptor activator of nuclear factor kappa B fusion immunoglobulin (hRANK-Ig) has been considered as one of the therapeutic agents to treat osteoporosis or diseases associated with bone destruction by blocking the interaction between RANK and the receptor activator of nuclear factor kappa B ligand (RANKL). However, no scientific record showing critical amino acid residues within the structural interface between the human RANKL and RANK complex is yet available. In this study, we produced several mutants of hRANK-Ig by replacement of amino acid residue(s) and tested whether the mutants had increased binding affinity to human RANKL. Based on the results from flow cytometry and surface plasmon resonance analyses, the replacement of E(125) with D(125), or E(125) and C(127) with D(125) and F(127) within loop 3 of cysteine-rich domain 3 of hRANK-Ig increases binding affinity to human RANKL over the wild-type hRANK-Ig. This result may provide the first example of improvement in the efficacy of hRANK-Ig by protein engineering and may give additional information to understand a more defined structural interface between hRANK and RANKL.

Reduced-Rank Adaptive Filtering Using Krylov Subspace

Directory of Open Access Journals (Sweden)

Sergueï Burykh

2003-01-01

Full Text Available A unified view of several recently introduced reduced-rank adaptive filters is presented. As all considered methods use Krylov subspace for rank reduction, the approach taken in this work is inspired from Krylov subspace methods for iterative solutions of linear systems. The alternative interpretation so obtained is used to study the properties of each considered technique and to relate one reduced-rank method to another as well as to algorithms used in computational linear algebra. Practical issues are discussed and low-complexity versions are also included in our study. It is believed that the insight developed in this paper can be further used to improve existing reduced-rank methods according to known results in the domain of Krylov subspace methods.

Rank diversity of languages: generic behavior in computational linguistics.

Science.gov (United States)

Cocho, Germinal; Flores, Jorge; Gershenson, Carlos; Pineda, Carlos; Sánchez, Sergio

2015-01-01

Statistical studies of languages have focused on the rank-frequency distribution of words. Instead, we introduce here a measure of how word ranks change in time and call this distribution rank diversity. We calculate this diversity for books published in six European languages since 1800, and find that it follows a universal lognormal distribution. Based on the mean and standard deviation associated with the lognormal distribution, we define three different word regimes of languages: "heads" consist of words which almost do not change their rank in time, "bodies" are words of general use, while "tails" are comprised by context-specific words and vary their rank considerably in time. The heads and bodies reflect the size of language cores identified by linguists for basic communication. We propose a Gaussian random walk model which reproduces the rank variation of words in time and thus the diversity. Rank diversity of words can be understood as the result of random variations in rank, where the size of the variation depends on the rank itself. We find that the core size is similar for all languages studied.

CNN-based ranking for biomedical entity normalization.

Science.gov (United States)

Li, Haodi; Chen, Qingcai; Tang, Buzhou; Wang, Xiaolong; Xu, Hua; Wang, Baohua; Huang, Dong

2017-10-03

Most state-of-the-art biomedical entity normalization systems, such as rule-based systems, merely rely on morphological information of entity mentions, but rarely consider their semantic information. In this paper, we introduce a novel convolutional neural network (CNN) architecture that regards biomedical entity normalization as a ranking problem and benefits from semantic information of biomedical entities. The CNN-based ranking method first generates candidates using handcrafted rules, and then ranks the candidates according to their semantic information modeled by CNN as well as their morphological information. Experiments on two benchmark datasets for biomedical entity normalization show that our proposed CNN-based ranking method outperforms traditional rule-based method with state-of-the-art performance. We propose a CNN architecture that regards biomedical entity normalization as a ranking problem. Comparison results show that semantic information is beneficial to biomedical entity normalization and can be well combined with morphological information in our CNN architecture for further improvement.

Communities in Large Networks: Identification and Ranking

DEFF Research Database (Denmark)

Olsen, Martin

2008-01-01

show that the problem of deciding whether a non trivial community exists is NP complete. Nevertheless, experiments show that a very simple greedy approach can identify members of a community in the Danish part of the web graph with time complexity only dependent on the size of the found community...... and its immediate surroundings. The members are ranked with a “local” variant of the PageRank algorithm. Results are reported from successful experiments on identifying and ranking Danish Computer Science sites and Danish Chess pages using only a few representatives....

A Rational Method for Ranking Engineering Programs.

Science.gov (United States)

Glower, Donald D.

1980-01-01

Compares two methods for ranking academic programs, the opinion poll v examination of career successes of the program's alumni. For the latter, "Who's Who in Engineering" and levels of research funding provided data. Tables display resulting data and compare rankings by the two methods for chemical engineering and civil engineering. (CS)

Monte Carlo methods of PageRank computation

NARCIS (Netherlands)

Litvak, Nelli

2004-01-01

We describe and analyze an on-line Monte Carlo method of PageRank computation. The PageRank is being estimated basing on results of a large number of short independent simulation runs initiated from each page that contains outgoing hyperlinks. The method does not require any storage of the hyperlink

A Survey on PageRank Computing

OpenAIRE

Berkhin, Pavel

2005-01-01

This survey reviews the research related to PageRank computing. Components of a PageRank vector serve as authority weights for web pages independent of their textual content, solely based on the hyperlink structure of the web. PageRank is typically used as a web search ranking component. This defines the importance of the model and the data structures that underly PageRank processing. Computing even a single PageRank is a difficult computational task. Computing many PageRanks is a much mor...

Scalable Faceted Ranking in Tagging Systems

Science.gov (United States)

Orlicki, José I.; Alvarez-Hamelin, J. Ignacio; Fierens, Pablo I.

Nowadays, web collaborative tagging systems which allow users to upload, comment on and recommend contents, are growing. Such systems can be represented as graphs where nodes correspond to users and tagged-links to recommendations. In this paper we analyze the problem of computing a ranking of users with respect to a facet described as a set of tags. A straightforward solution is to compute a PageRank-like algorithm on a facet-related graph, but it is not feasible for online computation. We propose an alternative: (i) a ranking for each tag is computed offline on the basis of tag-related subgraphs; (ii) a faceted order is generated online by merging rankings corresponding to all the tags in the facet. Based on the graph analysis of YouTube and Flickr, we show that step (i) is scalable. We also present efficient algorithms for step (ii), which are evaluated by comparing their results with two gold standards.

Rank-based model selection for multiple ions quantum tomography

International Nuclear Information System (INIS)

Guţă, Mădălin; Kypraios, Theodore; Dryden, Ian

2012-01-01

The statistical analysis of measurement data has become a key component of many quantum engineering experiments. As standard full state tomography becomes unfeasible for large dimensional quantum systems, one needs to exploit prior information and the ‘sparsity’ properties of the experimental state in order to reduce the dimensionality of the estimation problem. In this paper we propose model selection as a general principle for finding the simplest, or most parsimonious explanation of the data, by fitting different models and choosing the estimator with the best trade-off between likelihood fit and model complexity. We apply two well established model selection methods—the Akaike information criterion (AIC) and the Bayesian information criterion (BIC)—two models consisting of states of fixed rank and datasets such as are currently produced in multiple ions experiments. We test the performance of AIC and BIC on randomly chosen low rank states of four ions, and study the dependence of the selected rank with the number of measurement repetitions for one ion states. We then apply the methods to real data from a four ions experiment aimed at creating a Smolin state of rank 4. By applying the two methods together with the Pearson χ 2 test we conclude that the data can be suitably described with a model whose rank is between 7 and 9. Additionally we find that the mean square error of the maximum likelihood estimator for pure states is close to that of the optimal over all possible measurements. (paper)

Ranking mutual funds using Sortino method

Directory of Open Access Journals (Sweden)

Khosro Faghani Makrani

2014-04-01

Full Text Available One of the primary concerns on most business activities is to determine an efficient method for ranking mutual funds. This paper performs an empirical investigation to rank 42 mutual funds listed on Tehran Stock Exchange using Sortino method over the period 2011-2012. The results of survey have been compared with market return and the results have confirmed that there were some positive and meaningful relationships between Sortino return and market return. In addition, there were some positive and meaningful relationship between two Sortino methods.

Bootstrap Sequential Determination of the Co-integration Rank in VAR Models

DEFF Research Database (Denmark)

Guiseppe, Cavaliere; Rahbæk, Anders; Taylor, A.M. Robert

with empirical rejection frequencies often very much in excess of the nominal level. As a consequence, bootstrap versions of these tests have been developed. To be useful, however, sequential procedures for determining the co-integrating rank based on these bootstrap tests need to be consistent, in the sense...... in the literature by proposing a bootstrap sequential algorithm which we demonstrate delivers consistent cointegration rank estimation for general I(1) processes. Finite sample Monte Carlo simulations show the proposed procedure performs well in practice....

Grooming up the hierarchy: the exchange of grooming and rank-related benefits in a new world primate.

Directory of Open Access Journals (Sweden)

Barbara Tiddi

Full Text Available Seyfarth's model assumes that female primates derive rank-related benefits from higher-ranking females in exchange for grooming. As a consequence, the model predicts females prefer high-ranking females as grooming partners and compete for the opportunity to groom them. Therefore, allogrooming is expected to be directed up the dominance hierarchy and to occur more often between females with adjacent ranks. Although data from Old World primates generally support the model, studies on the relation between grooming and dominance rank in the New World genus Cebus have found conflicting results, showing considerable variability across groups and species. In this study, we investigated the pattern of grooming in wild tufted capuchin females (Cebus apella nigritus in Iguazú National Park, Argentina by testing both the assumption (i.e., that females gain rank-related return benefits from grooming and predictions (i.e., that females direct grooming up the dominance hierarchy and the majority of grooming occurs between females with adjacent ranks of Seyfarth's model. Study subjects were 9 adult females belonging to a single group. Results showed that grooming was given in return for tolerance during naturally occurring feeding, a benefit that higher-ranking females can more easily grant. Female grooming was directed up the hierarchy and was given more often to partners with similar rank. These findings provide supporting evidence for both the assumption and predictions of Seyfarth's model and represent, more generally, the first evidence of reciprocal behavioural interchanges driven by rank-related benefits in New World female primates.

Grooming up the hierarchy: the exchange of grooming and rank-related benefits in a new world primate.

Science.gov (United States)

Tiddi, Barbara; Aureli, Filippo; Schino, Gabriele

2012-01-01

Seyfarth's model assumes that female primates derive rank-related benefits from higher-ranking females in exchange for grooming. As a consequence, the model predicts females prefer high-ranking females as grooming partners and compete for the opportunity to groom them. Therefore, allogrooming is expected to be directed up the dominance hierarchy and to occur more often between females with adjacent ranks. Although data from Old World primates generally support the model, studies on the relation between grooming and dominance rank in the New World genus Cebus have found conflicting results, showing considerable variability across groups and species. In this study, we investigated the pattern of grooming in wild tufted capuchin females (Cebus apella nigritus) in Iguazú National Park, Argentina by testing both the assumption (i.e., that females gain rank-related return benefits from grooming) and predictions (i.e., that females direct grooming up the dominance hierarchy and the majority of grooming occurs between females with adjacent ranks) of Seyfarth's model. Study subjects were 9 adult females belonging to a single group. Results showed that grooming was given in return for tolerance during naturally occurring feeding, a benefit that higher-ranking females can more easily grant. Female grooming was directed up the hierarchy and was given more often to partners with similar rank. These findings provide supporting evidence for both the assumption and predictions of Seyfarth's model and represent, more generally, the first evidence of reciprocal behavioural interchanges driven by rank-related benefits in New World female primates.

Wikipedia ranking of world universities

Science.gov (United States)

Lages, José; Patt, Antoine; Shepelyansky, Dima L.

2016-03-01

We use the directed networks between articles of 24 Wikipedia language editions for producing the wikipedia ranking of world Universities (WRWU) using PageRank, 2DRank and CheiRank algorithms. This approach allows to incorporate various cultural views on world universities using the mathematical statistical analysis independent of cultural preferences. The Wikipedia ranking of top 100 universities provides about 60% overlap with the Shanghai university ranking demonstrating the reliable features of this approach. At the same time WRWU incorporates all knowledge accumulated at 24 Wikipedia editions giving stronger highlights for historically important universities leading to a different estimation of efficiency of world countries in university education. The historical development of university ranking is analyzed during ten centuries of their history.

Tensor rank of the tripartite state |W>xn

International Nuclear Information System (INIS)

Yu Nengkun; Guo Cheng; Duan Runyao; Chitambar, Eric

2010-01-01

Tensor rank refers to the number of product states needed to express a given multipartite quantum state. Its nonadditivity as an entanglement measure has recently been observed. In this Brief Report, we estimate the tensor rank of multiple copies of the tripartite state |W>=(1/√(3))(|100>+|010>+|001>). Both an upper bound and a lower bound of this rank are derived. In particular, it is proven that the rank of |W> x 2 is 7, thus resolving a previously open problem. Some implications of this result are discussed in terms of transformation rates between |W> xn and multiple copies of the state |GHZ>=(1/√(2))(|000>+|111>).

Feature ranking and rank aggregation for automatic sleep stage classification: a comparative study.

Science.gov (United States)

Najdi, Shirin; Gharbali, Ali Abdollahi; Fonseca, José Manuel

2017-08-18

Nowadays, sleep quality is one of the most important measures of healthy life, especially considering the huge number of sleep-related disorders. Identifying sleep stages using polysomnographic (PSG) signals is the traditional way of assessing sleep quality. However, the manual process of sleep stage classification is time-consuming, subjective and costly. Therefore, in order to improve the accuracy and efficiency of the sleep stage classification, researchers have been trying to develop automatic classification algorithms. Automatic sleep stage classification mainly consists of three steps: pre-processing, feature extraction and classification. Since classification accuracy is deeply affected by the extracted features, a poor feature vector will adversely affect the classifier and eventually lead to low classification accuracy. Therefore, special attention should be given to the feature extraction and selection process. In this paper the performance of seven feature selection methods, as well as two feature rank aggregation methods, were compared. Pz-Oz EEG, horizontal EOG and submental chin EMG recordings of 22 healthy males and females were used. A comprehensive feature set including 49 features was extracted from these recordings. The extracted features are among the most common and effective features used in sleep stage classification from temporal, spectral, entropy-based and nonlinear categories. The feature selection methods were evaluated and compared using three criteria: classification accuracy, stability, and similarity. Simulation results show that MRMR-MID achieves the highest classification performance while Fisher method provides the most stable ranking. In our simulations, the performance of the aggregation methods was in the average level, although they are known to generate more stable results and better accuracy. The Borda and RRA rank aggregation methods could not outperform significantly the conventional feature ranking methods. Among

Rank Diversity of Languages: Generic Behavior in Computational Linguistics

Science.gov (United States)

Cocho, Germinal; Flores, Jorge; Gershenson, Carlos; Pineda, Carlos; Sánchez, Sergio

2015-01-01

Statistical studies of languages have focused on the rank-frequency distribution of words. Instead, we introduce here a measure of how word ranks change in time and call this distribution rank diversity. We calculate this diversity for books published in six European languages since 1800, and find that it follows a universal lognormal distribution. Based on the mean and standard deviation associated with the lognormal distribution, we define three different word regimes of languages: “heads” consist of words which almost do not change their rank in time, “bodies” are words of general use, while “tails” are comprised by context-specific words and vary their rank considerably in time. The heads and bodies reflect the size of language cores identified by linguists for basic communication. We propose a Gaussian random walk model which reproduces the rank variation of words in time and thus the diversity. Rank diversity of words can be understood as the result of random variations in rank, where the size of the variation depends on the rank itself. We find that the core size is similar for all languages studied. PMID:25849150

Blind Reduced-Rank MMSE Detector for DS-CDMA Systems

Directory of Open Access Journals (Sweden)

Xiaodong Cai

2003-01-01

Full Text Available We first develop a reduced-rank minimum mean squared error (MMSE detector for direct-sequence (DS code division multiple access (CDMA by forcing the linear MMSE detector to lie in a signal subspace of a reduced dimension. While a reduced-rank MMSE detector has lower complexity, it cannot outperform the full-rank MMSE detector. We then concentrate on the blind reduced-rank MMSE detector which is obtained from an estimated covariance matrix. Our analysis and simulation results show that when the desired user′s signal is in a low-dimensional subspace, there exists an optimal subspace so that the blind reduced-rank MMSE detector lying in this subspace has the best performance. By properly choosing a subsspace, we guarantee that the optimal blind reduced-rank MMSE detector is obtained. An adaptive blind reduced-rank MMSE detector, based on a subspace tracking algorithm, is developed. The adaptive blind reduced-rank MMSE detector exhibits superior steady-state performance and fast convergence speed.

A human fecal contamination index for ranking impaired ...

Science.gov (United States)

Human fecal pollution of surface water remains a public health concern worldwide. As a result, there is a growing interest in the application of human-associated fecal source identification quantitative real-time PCR (qPCR) technologies for recreational water quality risk management. The transition from a research subject to a management tool requires the integration of standardized water sampling, laboratory, and data analysis procedures. In this study, a standardized HF183/BacR287 qPCR method was combined with a water sampling strategy and Bayesian data algorithm to establish a human fecal contamination index that can be used to rank impaired recreational water sites polluted with human waste. Stability and bias of index predictions were investigated under various parameters including siteswith different pollution levels, sampling period time range (1-15 weeks), and number of qPCR replicates per sample (2-14 replicates). Sensitivity analyses were conducted with simulated data sets (100 iterations) seeded with HF183/BacR287 qPCR laboratory measurements from water samples collected from three Southern California sites (588 qPCR measurements). Findings suggest that site ranking is feasible and that all parameters tested influence stability and bias in human fecal contamination indexscoring. Trends identified by sensitivity analyses will provide managers with the information needed to design and conduct field studies to rank impaired recreational water sites based

University Rankings and Social Science

OpenAIRE

Marginson, S.

2014-01-01

University rankings widely affect the behaviours of prospective students and their families, university executive leaders, academic faculty, governments and investors in higher education. Yet the social science foundations of global rankings receive little scrutiny. Rankings that simply recycle reputation without any necessary connection to real outputs are of no common value. It is necessary that rankings be soundly based in scientific terms if a virtuous relationship between performance and...

Google and the mind: predicting fluency with PageRank.

Science.gov (United States)

Griffiths, Thomas L; Steyvers, Mark; Firl, Alana

2007-12-01

Human memory and Internet search engines face a shared computational problem, needing to retrieve stored pieces of information in response to a query. We explored whether they employ similar solutions, testing whether we could predict human performance on a fluency task using PageRank, a component of the Google search engine. In this task, people were shown a letter of the alphabet and asked to name the first word beginning with that letter that came to mind. We show that PageRank, computed on a semantic network constructed from word-association data, outperformed word frequency and the number of words for which a word is named as an associate as a predictor of the words that people produced in this task. We identify two simple process models that could support this apparent correspondence between human memory and Internet search, and relate our results to previous rational models of memory.

24 CFR 599.401 - Ranking of applications.

Science.gov (United States)

2010-04-01

... 24 Housing and Urban Development 3 2010-04-01 2010-04-01 false Ranking of applications. 599.401... Communities § 599.401 Ranking of applications. (a) Ranking order. Rural and urban applications will be ranked... applications ranked first. (b) Separate ranking categories. After initial ranking, both rural and urban...

Diversity rankings among bacterial lineages in soil.

Science.gov (United States)

Youssef, Noha H; Elshahed, Mostafa S

2009-03-01

We used rarefaction curve analysis and diversity ordering-based approaches to rank the 11 most frequently encountered bacterial lineages in soil according to diversity in 5 previously reported 16S rRNA gene clone libraries derived from agricultural, undisturbed tall grass prairie and forest soils (n=26,140, 28 328, 31 818, 13 001 and 53 533). The Planctomycetes, Firmicutes and the delta-Proteobacteria were consistently ranked among the most diverse lineages in all data sets, whereas the Verrucomicrobia, Gemmatimonadetes and beta-Proteobacteria were consistently ranked among the least diverse. On the other hand, the rankings of alpha-Proteobacteria, Acidobacteria, Actinobacteria, Bacteroidetes and Chloroflexi varied widely in different soil clone libraries. In general, lineages exhibiting largest differences in diversity rankings also exhibited the largest difference in relative abundance in the data sets examined. Within these lineages, a positive correlation between relative abundance and diversity was observed within the Acidobacteria, Actinobacteria and Chloroflexi, and a negative diversity-abundance correlation was observed within the Bacteroidetes. The ecological and evolutionary implications of these results are discussed.

[Ranking of radionuclides and pathways according to their contribution to the dose burden to the population resulting from NPP releases].

Science.gov (United States)

Spiridonov, S I; Karpenko, E I; Sharpan, L A

2013-01-01

Approaches are described towards estimating the consequences of radioactive contamination of ecosystems by nuclear fuel cycle enterprises with the rationale for the optimal specification level for nuclear power plants (NPP) operating in the normal mode. Calculations are made based on the initial data of the IAEA project, INPRO ENV, dealing with the ranking of radionuclides escaping to the environment from the operating NPPs. Influence of various factors on rankings of radionuclides and pathways of public exposure is demon- strated. An important factor is the controlled radionuclide composition of atmospheric NPP releases. It has been found that variation in the dose coefficients for some radionuclides leads to significant changes not only in the ranking results but also in the estimates of total dose burdens. Invariability is shown of the estimation concerning the greatest contribution of the peroral route to the population dose of irradiation in the situation considered. A conclusion was drawn on the need of taking into consideration uncertainties of different factors when comparing effects on the environment from enterprises of conventional and innovative nuclear fuel cycles.

On Page Rank

NARCIS (Netherlands)

Hoede, C.

In this paper the concept of page rank for the world wide web is discussed. The possibility of describing the distribution of page rank by an exponential law is considered. It is shown that the concept is essentially equal to that of status score, a centrality measure discussed already in 1953 by

On Rank Driven Dynamical Systems

Science.gov (United States)

Veerman, J. J. P.; Prieto, F. J.

2014-08-01

We investigate a class of models related to the Bak-Sneppen (BS) model, initially proposed to study evolution. The BS model is extremely simple and yet captures some forms of "complex behavior" such as self-organized criticality that is often observed in physical and biological systems. In this model, random fitnesses in are associated to agents located at the vertices of a graph . Their fitnesses are ranked from worst (0) to best (1). At every time-step the agent with the worst fitness and some others with a priori given rank probabilities are replaced by new agents with random fitnesses. We consider two cases: The exogenous case where the new fitnesses are taken from an a priori fixed distribution, and the endogenous case where the new fitnesses are taken from the current distribution as it evolves. We approximate the dynamics by making a simplifying independence assumption. We use Order Statistics and Dynamical Systems to define a rank-driven dynamical system that approximates the evolution of the distribution of the fitnesses in these rank-driven models, as well as in the BS model. For this simplified model we can find the limiting marginal distribution as a function of the initial conditions. Agreement with experimental results of the BS model is excellent.

Exact p-values for pairwise comparison of Friedman rank sums, with application to comparing classifiers

NARCIS (Netherlands)

Eisinga, R.N.; Heskes, T.M.; Pelzer, B.J.; Grotenhuis, H.F. te

2017-01-01

Background: The Friedman rank sum test is a widely-used nonparametric method in computational biology. In addition to examining the overall null hypothesis of no significant difference among any of the rank sums, it is typically of interest to conduct pairwise comparison tests. Current approaches to

Ranking insurance firms using AHP and Factor Analysis

Directory of Open Access Journals (Sweden)

Mohammad Khodaei Valahzaghard

2013-03-01

Full Text Available Insurance industry includes a significant part of economy and it is important to learn more about the capabilities of different firms, which are active in this industry. In this paper, we present an empirical study to rank the insurance firms using analytical hierarchy process as well as factor analysis. The study considers four criteria including capital adequacy, quality of earning, quality of cash flow and quality of firms’ assets. The results of the implementation of factor analysis (FA have been verified using Kaiser-Meyer-Olkin (KMO=0.573 and Bartlett's Chi-Square (443.267 P-value=0.000 tests. According to the results FA, the first important factor, capital adequacy, represents 21.557% of total variance, the second factor, quality of income, represents 20.958% of total variance. In addition, the third factor, quality of cash flow, represents 19.417% of total variance and the last factor, quality of assets, represents 18.641% of total variance. The study has also used analytical hierarchy process (AHP to rank insurance firms. The results of our survey indicate that capital adequacy (0.559 is accounted as the most important factor followed by quality of income (0.235, quality of cash flow (0.144 and quality of assets (0.061. The results of AHP are consistent with the results of FA, which somewhat validates the overall study.

Extreme learning machine for ranking: generalization analysis and applications.

Science.gov (United States)

Chen, Hong; Peng, Jiangtao; Zhou, Yicong; Li, Luoqing; Pan, Zhibin

2014-05-01

The extreme learning machine (ELM) has attracted increasing attention recently with its successful applications in classification and regression. In this paper, we investigate the generalization performance of ELM-based ranking. A new regularized ranking algorithm is proposed based on the combinations of activation functions in ELM. The generalization analysis is established for the ELM-based ranking (ELMRank) in terms of the covering numbers of hypothesis space. Empirical results on the benchmark datasets show the competitive performance of the ELMRank over the state-of-the-art ranking methods. Copyright © 2014 Elsevier Ltd. All rights reserved.

Multidimensional ranking the design and development of U-Multirank

CERN Document Server

Ziegele, Frank

2012-01-01

During the last decades ranking has become one of the most controversial issues in higher education and research. It is widely recognized now that, although some of the current rankings can be severely criticized, they seem to be here to stay. In addition, rankings appear to have a great impact on decision-makers at all levels of higher education and research systems worldwide, including in universities. Rankings reflect a growing international competition among universities for talent and resources; at the same time they reinforce competition by their very results. Yet major concerns remain a

A semi-quantitative reasoning methodology for filtering and ranking HAZOP results in HAZOPExpert

International Nuclear Information System (INIS)

Vaidhyanathan, Ramesh; Venkatasubramanian, Venkat

1996-01-01

Hazard and Operability (HAZOP) analysis is the most widely used and recognized as the preferred Process Hazards Analysis (PHA) approach in the chemical process industry. Recently, a diagraph-model based framework and an expert system called HAZOPExpert was developed for automating this analysis. Upon testing the performance of the system on various industrial case studies. HAZOPExpert was found to successfully mimic the human expert's reasoning and identify the hazards. But, with the increasing complexity of the processes, the HAZOPExpert system generated a large number of consequences compared to those identified by a team of experts. This is mainly due to the strict qualitative reasoning approach implemented in the HAZOPExpert system. In order to filter and rank the consequences generated by the HAZOPExpert system, a semi-quantitative reasoning methodology is proposed using additional quantitative knowledge in the form of design and operating specifications of the process units, and process material property values. This filtering approach combines the qualitative digraph-based HAZOP models and the quantitative knowledge to eliminate the unrealizable consequences. Significant reduction in the number of consequences was obtained using this approach on an ethylene process plant HAZOP case study

A New Direction of Cancer Classification: Positive Effect of Low-Ranking MicroRNAs.

Science.gov (United States)

Li, Feifei; Piao, Minghao; Piao, Yongjun; Li, Meijing; Ryu, Keun Ho

2014-10-01

Many studies based on microRNA (miRNA) expression profiles showed a new aspect of cancer classification. Because one characteristic of miRNA expression data is the high dimensionality, feature selection methods have been used to facilitate dimensionality reduction. The feature selection methods have one shortcoming thus far: they just consider the problem of where feature to class is 1:1 or n:1. However, because one miRNA may influence more than one type of cancer, human miRNA is considered to be ranked low in traditional feature selection methods and are removed most of the time. In view of the limitation of the miRNA number, low-ranking miRNAs are also important to cancer classification. We considered both high- and low-ranking features to cover all problems (1:1, n:1, 1:n, and m:n) in cancer classification. First, we used the correlation-based feature selection method to select the high-ranking miRNAs, and chose the support vector machine, Bayes network, decision tree, k-nearest-neighbor, and logistic classifier to construct cancer classification. Then, we chose Chi-square test, information gain, gain ratio, and Pearson's correlation feature selection methods to build the m:n feature subset, and used the selected miRNAs to determine cancer classification. The low-ranking miRNA expression profiles achieved higher classification accuracy compared with just using high-ranking miRNAs in traditional feature selection methods. Our results demonstrate that the m:n feature subset made a positive impression of low-ranking miRNAs in cancer classification.

Reduced Rank Adaptive Filtering in Impulsive Noise Environments

KAUST Repository

Soury, Hamza

2014-01-06

An impulsive noise environment is used in this paper. A new aspect of signal truncation is deployed to reduce the harmful effect of the impulsive noise to the signal. A full rank direct solution is derived followed by an iterative solution. The reduced rank adaptive filter is presented in this environment by using two methods for rank reduction. The minimized objective function is defined using the Lp norm. The results are presented and the efficiency of each algorithm is discussed.

Reduced Rank Adaptive Filtering in Impulsive Noise Environments

KAUST Repository

Soury, Hamza; Abed-Meraim, Karim; Alouini, Mohamed-Slim

2014-01-01

An impulsive noise environment is used in this paper. A new aspect of signal truncation is deployed to reduce the harmful effect of the impulsive noise to the signal. A full rank direct solution is derived followed by an iterative solution. The reduced rank adaptive filter is presented in this environment by using two methods for rank reduction. The minimized objective function is defined using the Lp norm. The results are presented and the efficiency of each algorithm is discussed.

Evaluating ranking methods on heterogeneous digital library collections

CERN Document Server

Canévet, Olivier; Marian, Ludmila; Chonavel, Thierry

In the frame of research in particle physics, CERN has been developing its own web-based software /Invenio/ to run the digital library of all the documents related to CERN and fundamental physics. The documents (articles, photos, news, thesis, ...) can be retrieved through a search engine. The results matching the query of the user can be displayed in several ways: sorted by latest first, author, title and also ranked by word similarity. The purpose of this project is to study and implement a new ranking method in Invenio: distributed-ranking (D-Rank). This method aims at aggregating several ranking scores coming from different ranking methods into a new score. In addition to query-related scores such as word similarity, the goal of the work is to take into account non-query-related scores such as citations, journal impact factor and in particular scores related to the document access frequency in the database. The idea is that for two equally query-relevant documents, if one has been more downloaded for inst...

Bootstrap Determination of the Co-integration Rank in Heteroskedastic VAR Models

DEFF Research Database (Denmark)

Cavaliere, Giuseppe; Rahbek, Anders; Taylor, A.M.Robert

In a recent paper Cavaliere et al. (2012) develop bootstrap implementations of the (pseudo-) likelihood ratio [PLR] co-integration rank test and associated sequential rank determination procedure of Johansen (1996). The bootstrap samples are constructed using the restricted parameter estimates...... of the underlying VAR model which obtain under the reduced rank null hypothesis. They propose methods based on an i.i.d. bootstrap re-sampling scheme and establish the validity of their proposed bootstrap procedures in the context of a co-integrated VAR model with i.i.d. innovations. In this paper we investigate...... the properties of their bootstrap procedures, together with analogous procedures based on a wild bootstrap re-sampling scheme, when time-varying behaviour is present in either the conditional or unconditional variance of the innovations. We show that the bootstrap PLR tests are asymptotically correctly sized and...

Bootstrap Determination of the Co-Integration Rank in Heteroskedastic VAR Models

DEFF Research Database (Denmark)

Cavaliere, Giuseppe; Rahbek, Anders; Taylor, A. M. Robert

In a recent paper Cavaliere et al. (2012) develop bootstrap implementations of the (pseudo-) likelihood ratio [PLR] co-integration rank test and associated sequential rank determination procedure of Johansen (1996). The bootstrap samples are constructed using the restricted parameter estimates...... of the underlying VAR model which obtain under the reduced rank null hypothesis. They propose methods based on an i.i.d. bootstrap re-sampling scheme and establish the validity of their proposed bootstrap procedures in the context of a co-integrated VAR model with i.i.d. innovations. In this paper we investigate...... the properties of their bootstrap procedures, together with analogous procedures based on a wild bootstrap re-sampling scheme, when time-varying behaviour is present in either the conditional or unconditional variance of the innovations. We show that the bootstrap PLR tests are asymptotically correctly sized and...

Consistent ranking of volatility models

DEFF Research Database (Denmark)

Hansen, Peter Reinhard; Lunde, Asger

2006-01-01

We show that the empirical ranking of volatility models can be inconsistent for the true ranking if the evaluation is based on a proxy for the population measure of volatility. For example, the substitution of a squared return for the conditional variance in the evaluation of ARCH-type models can...... variance in out-of-sample evaluations rather than the squared return. We derive the theoretical results in a general framework that is not specific to the comparison of volatility models. Similar problems can arise in comparisons of forecasting models whenever the predicted variable is a latent variable....

Power-law and exponential rank distributions: A panoramic Gibbsian perspective

International Nuclear Information System (INIS)

Eliazar, Iddo

2015-01-01

Rank distributions are collections of positive sizes ordered either increasingly or decreasingly. Many decreasing rank distributions, formed by the collective collaboration of human actions, follow an inverse power-law relation between ranks and sizes. This remarkable empirical fact is termed Zipf’s law, and one of its quintessential manifestations is the demography of human settlements — which exhibits a harmonic relation between ranks and sizes. In this paper we present a comprehensive statistical-physics analysis of rank distributions, establish that power-law and exponential rank distributions stand out as optimal in various entropy-based senses, and unveil the special role of the harmonic relation between ranks and sizes. Our results extend the contemporary entropy-maximization view of Zipf’s law to a broader, panoramic, Gibbsian perspective of increasing and decreasing power-law and exponential rank distributions — of which Zipf’s law is one out of four pillars

Power-law and exponential rank distributions: A panoramic Gibbsian perspective

Energy Technology Data Exchange (ETDEWEB)

Eliazar, Iddo, E-mail: eliazar@post.tau.ac.il

2015-04-15

Rank distributions are collections of positive sizes ordered either increasingly or decreasingly. Many decreasing rank distributions, formed by the collective collaboration of human actions, follow an inverse power-law relation between ranks and sizes. This remarkable empirical fact is termed Zipf’s law, and one of its quintessential manifestations is the demography of human settlements — which exhibits a harmonic relation between ranks and sizes. In this paper we present a comprehensive statistical-physics analysis of rank distributions, establish that power-law and exponential rank distributions stand out as optimal in various entropy-based senses, and unveil the special role of the harmonic relation between ranks and sizes. Our results extend the contemporary entropy-maximization view of Zipf’s law to a broader, panoramic, Gibbsian perspective of increasing and decreasing power-law and exponential rank distributions — of which Zipf’s law is one out of four pillars.

When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

KAUST Repository

Wang, Jim Jing-Yan

2017-06-28

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.

University Rankings: The Web Ranking

Science.gov (United States)

Aguillo, Isidro F.

2012-01-01

The publication in 2003 of the Ranking of Universities by Jiao Tong University of Shanghai has revolutionized not only academic studies on Higher Education, but has also had an important impact on the national policies and the individual strategies of the sector. The work gathers the main characteristics of this and other global university…

Ranking Specific Sets of Objects.

Science.gov (United States)

Maly, Jan; Woltran, Stefan

2017-01-01

Ranking sets of objects based on an order between the single elements has been thoroughly studied in the literature. In particular, it has been shown that it is in general impossible to find a total ranking - jointly satisfying properties as dominance and independence - on the whole power set of objects. However, in many applications certain elements from the entire power set might not be required and can be neglected in the ranking process. For instance, certain sets might be ruled out due to hard constraints or are not satisfying some background theory. In this paper, we treat the computational problem whether an order on a given subset of the power set of elements satisfying different variants of dominance and independence can be found, given a ranking on the elements. We show that this problem is tractable for partial rankings and NP-complete for total rankings.

PageRank of integers

International Nuclear Information System (INIS)

Frahm, K M; Shepelyansky, D L; Chepelianskii, A D

2012-01-01

We up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is approximately inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows us to find this vector for matrices of billion size. This network provides a new PageRank order of integers. (paper)

Network meta-analysis of diagnostic test accuracy studies identifies and ranks the optimal diagnostic tests and thresholds for health care policy and decision-making.

Science.gov (United States)

Owen, Rhiannon K; Cooper, Nicola J; Quinn, Terence J; Lees, Rosalind; Sutton, Alex J

2018-07-01

Network meta-analyses (NMA) have extensively been used to compare the effectiveness of multiple interventions for health care policy and decision-making. However, methods for evaluating the performance of multiple diagnostic tests are less established. In a decision-making context, we are often interested in comparing and ranking the performance of multiple diagnostic tests, at varying levels of test thresholds, in one simultaneous analysis. Motivated by an example of cognitive impairment diagnosis following stroke, we synthesized data from 13 studies assessing the efficiency of two diagnostic tests: Mini-Mental State Examination (MMSE) and Montreal Cognitive Assessment (MoCA), at two test thresholds: MMSE accounting for the correlations between multiple test accuracy measures from the same study. We developed and successfully fitted a model comparing multiple tests/threshold combinations while imposing threshold constraints. Using this model, we found that MoCA at threshold decision making. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.

Ranking Exponential Trapezoidal Fuzzy Numbers by Median Value

Directory of Open Access Journals (Sweden)

S. Rezvani

2013-12-01

Full Text Available In this paper, we want represented a method for ranking of two exponential trapezoidal fuzzy numbers. A median value is proposed for the ranking of exponential trapezoidal fuzzy numbers. For the validation the results of the proposed approach are compared with different existing approaches.

University Rankings and Social Science

Science.gov (United States)

Marginson, Simon

2014-01-01

University rankings widely affect the behaviours of prospective students and their families, university executive leaders, academic faculty, governments and investors in higher education. Yet the social science foundations of global rankings receive little scrutiny. Rankings that simply recycle reputation without any necessary connection to real…

Two-dimensional ranking of Wikipedia articles

Science.gov (United States)

Zhirov, A. O.; Zhirov, O. V.; Shepelyansky, D. L.

2010-10-01

The Library of Babel, described by Jorge Luis Borges, stores an enormous amount of information. The Library exists ab aeterno. Wikipedia, a free online encyclopaedia, becomes a modern analogue of such a Library. Information retrieval and ranking of Wikipedia articles become the challenge of modern society. While PageRank highlights very well known nodes with many ingoing links, CheiRank highlights very communicative nodes with many outgoing links. In this way the ranking becomes two-dimensional. Using CheiRank and PageRank we analyze the properties of two-dimensional ranking of all Wikipedia English articles and show that it gives their reliable classification with rich and nontrivial features. Detailed studies are done for countries, universities, personalities, physicists, chess players, Dow-Jones companies and other categories.

Reduced rank adaptive filtering in impulsive noise environments

KAUST Repository

Soury, Hamza

2014-11-01

An impulsive noise environment is considered in this paper. A new aspect of signal truncation is deployed to reduce the harmful effect of the impulsive noise to the signal. A full rank direct solution is derived followed by an iterative solution. The reduced rank adaptive filter is presented in this environment by using two methods for rank reduction, while the minimized objective function is defined using the Lp norm. The results are presented and the efficiency of each method is discussed. © 2014 IEEE.

Global network centrality of university rankings

Science.gov (United States)

Guo, Weisi; Del Vecchio, Marco; Pogrebna, Ganna

2017-10-01

Universities and higher education institutions form an integral part of the national infrastructure and prestige. As academic research benefits increasingly from international exchange and cooperation, many universities have increased investment in improving and enabling their global connectivity. Yet, the relationship of university performance and its global physical connectedness has not been explored in detail. We conduct, to our knowledge, the first large-scale data-driven analysis into whether there is a correlation between university relative ranking performance and its global connectivity via the air transport network. The results show that local access to global hubs (as measured by air transport network betweenness) strongly and positively correlates with the ranking growth (statistical significance in different models ranges between 5% and 1% level). We also found that the local airport's aggregate flight paths (degree) and capacity (weighted degree) has no effect on university ranking, further showing that global connectivity distance is more important than the capacity of flight connections. We also examined the effect of local city economic development as a confounding variable and no effect was observed suggesting that access to global transportation hubs outweighs economic performance as a determinant of university ranking. The impact of this research is that we have determined the importance of the centrality of global connectivity and, hence, established initial evidence for further exploring potential connections between university ranking and regional investment policies on improving global connectivity.

Monte Carlo simulations guided by imaging to predict the in vitro ranking of radiosensitizing nanoparticles.

Science.gov (United States)

Retif, Paul; Reinhard, Aurélie; Paquot, Héna; Jouan-Hureaux, Valérie; Chateau, Alicia; Sancey, Lucie; Barberi-Heyob, Muriel; Pinel, Sophie; Bastogne, Thierry

This article addresses the in silico-in vitro prediction issue of organometallic nanoparticles (NPs)-based radiosensitization enhancement. The goal was to carry out computational experiments to quickly identify efficient nanostructures and then to preferentially select the most promising ones for the subsequent in vivo studies. To this aim, this interdisciplinary article introduces a new theoretical Monte Carlo computational ranking method and tests it using 3 different organometallic NPs in terms of size and composition. While the ranking predicted in a classical theoretical scenario did not fit the reference results at all, in contrast, we showed for the first time how our accelerated in silico virtual screening method, based on basic in vitro experimental data (which takes into account the NPs cell biodistribution), was able to predict a relevant ranking in accordance with in vitro clonogenic efficiency. This corroborates the pertinence of such a prior ranking method that could speed up the preclinical development of NPs in radiation therapy.

Ranking of risk significant components for the Davis-Besse Component Cooling Water System

International Nuclear Information System (INIS)

Seniuk, P.J.

1994-01-01

Utilities that run nuclear power plants are responsible for testing pumps and valves, as specified by the American Society of Mechanical Engineers (ASME) that are required for safe shutdown, mitigating the consequences of an accident, and maintaining the plant in a safe condition. These inservice components are tested according to ASME Codes, either the earlier requirements of the ASME Boiler and Pressure Vessel Code, Section XI, or the more recent requirements of the ASME Operation and Maintenance Code, Section IST. These codes dictate test techniques and frequencies regardless of the component failure rate or significance of failure consequences. A probabilistic risk assessment or probabilistic safety assessment may be used to evaluate the component importance for inservice test (IST) risk ranking, which is a combination of failure rate and failure consequences. Resources for component testing during the normal quarterly verification test or postmaintenance test are expensive. Normal quarterly testing may cause component unavailability. Outage testing may increase outage cost with no real benefit. This paper identifies the importance ranking of risk significant components in the Davis-Besse component cooling water system. Identifying the ranking of these risk significant IST components adds technical insight for developing the appropriate test technique and test frequency

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.

Ranking online quality and reputation via the user activity

Science.gov (United States)

Liu, Xiao-Lu; Guo, Qiang; Hou, Lei; Cheng, Can; Liu, Jian-Guo

2015-10-01

How to design an accurate algorithm for ranking the object quality and user reputation is of importance for online rating systems. In this paper we present an improved iterative algorithm for online ranking object quality and user reputation in terms of the user degree (IRUA), where the user's reputation is measured by his/her rating vector, the corresponding objects' quality vector and the user degree. The experimental results for the empirical networks show that the AUC values of the IRUA algorithm can reach 0.9065 and 0.8705 in Movielens and Netflix data sets, respectively, which is better than the results generated by the traditional iterative ranking methods. Meanwhile, the results for the synthetic networks indicate that user degree should be considered in real rating systems due to users' rating behaviors. Moreover, we find that enhancing or reducing the influences of the large-degree users could produce more accurate reputation ranking lists.

14 CFR 1214.1105 - Final ranking.

Science.gov (United States)

2010-01-01

... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Final ranking. 1214.1105 Section 1214.1105... Recruitment and Selection Program § 1214.1105 Final ranking. Final rankings will be based on a combination of... preference will be included in this final ranking in accordance with applicable regulations. ...

Ranking agility factors affecting hospitals in Iran

Directory of Open Access Journals (Sweden)

M. Abdi Talarposht

2017-04-01

Full Text Available Background: Agility is an effective response to the changing and unpredictable environment and using these changes as opportunities for organizational improvement. Objective: The aim of the present study was to rank the factors affecting agile supply chain of hospitals of Iran. Methods: This applied study was conducted by cross sectional-descriptive method at some point of 2015 for one year. The research population included managers, administrators, faculty members and experts were selected hospitals. A total of 260 people were selected as sample from the health centers. The construct validity of the questionnaire was approved by confirmatory factor analysis test and its reliability was approved by Cronbach's alpha (α=0.97. All data were analyzed by Kolmogorov-Smirnov, Chi-square and Friedman tests. Findings: The development of staff skills, the use of information technology, the integration of processes, appropriate planning, and customer satisfaction and product quality had a significant impact on the agility of public hospitals of Iran (P<0.001. New product introductions had earned the highest ranking and the development of staff skills earned the lowest ranking. Conclusion: The new product introduction, market responsiveness and sensitivity, reduce costs, and the integration of organizational processes, ratings better to have acquired agility hospitals in Iran. Therefore, planners and officials of hospitals have to, through the promotion quality and variety of services customer-oriented, providing a basis for investing in the hospital and etc to apply for agility supply chain public hospitals of Iran.

Data depth and rank-based tests for covariance and spectral density matrices

KAUST Repository

Chau, Joris

2017-06-26

In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.

Data depth and rank-based tests for covariance and spectral density matrices

KAUST Repository

Chau, Joris; Ombao, Hernando; Sachs, Rainer von

2017-01-01

In multivariate time series analysis, objects of primary interest to study cross-dependences in the time series are the autocovariance or spectral density matrices. Non-degenerate covariance and spectral density matrices are necessarily Hermitian and positive definite, and our primary goal is to develop new methods to analyze samples of such matrices. The main contribution of this paper is the generalization of the concept of statistical data depth for collections of covariance or spectral density matrices by exploiting the geometric properties of the space of Hermitian positive definite matrices as a Riemannian manifold. This allows one to naturally characterize most central or outlying matrices, but also provides a practical framework for rank-based hypothesis testing in the context of samples of covariance or spectral density matrices. First, the desired properties of a data depth function acting on the space of Hermitian positive definite matrices are presented. Second, we propose two computationally efficient pointwise and integrated data depth functions that satisfy each of these requirements. Several applications of the developed methodology are illustrated by the analysis of collections of spectral matrices in multivariate brain signal time series datasets.

Rank dependent expected utility models of tax evasion.

OpenAIRE

Erling Eide

2001-01-01

In this paper the rank-dependent expected utility theory is substituted for the expected utility theory in models of tax evasion. It is demonstrated that the comparative statics results of the expected utility, portfolio choice model of tax evasion carry over to the more general rank dependent expected utility model.

Testing University Rankings Statistically: Why this Perhaps is not such a Good Idea after All. Some Reflections on Statistical Power, Effect Size, Random Sampling and Imaginary Populations

DEFF Research Database (Denmark)

Schneider, Jesper Wiborg

2012-01-01

In this paper we discuss and question the use of statistical significance tests in relation to university rankings as recently suggested. We outline the assumptions behind and interpretations of statistical significance tests and relate this to examples from the recent SCImago Institutions Rankin...

Two Ranking Methods of Single Valued Triangular Neutrosophic Numbers to Rank and Evaluate Information Systems Quality

Directory of Open Access Journals (Sweden)

Samah Ibrahim Abdel Aal

2018-03-01

Full Text Available The concept of neutrosophic can provide a generalization of fuzzy set and intuitionistic fuzzy set that make it is the best fit in representing indeterminacy and uncertainty. Single Valued Triangular Numbers (SVTrN-numbers is a special case of neutrosophic set that can handle ill-known quantity very difficult problems. This work intended to introduce a framework with two types of ranking methods. The results indicated that each ranking method has its own advantage. In this perspective, the weighted value and ambiguity based method gives more attention to uncertainty in ranking and evaluating ISQ as well as it takes into account cut sets of SVTrN numbers that can reflect the information on Truth-membership-membership degree, false membership-membership degree and Indeterminacy-membership degree. The value index and ambiguity index method can reflect the decision maker's subjectivity attitude to the SVTrN- numbers.

Rank Dynamics of Word Usage at Multiple Scales

Directory of Open Access Journals (Sweden)

José A. Morales

2018-05-01

Full Text Available The recent dramatic increase in online data availability has allowed researchers to explore human culture with unprecedented detail, such as the growth and diversification of language. In particular, it provides statistical tools to explore whether word use is similar across languages, and if so, whether these generic features appear at different scales of language structure. Here we use the Google Books N-grams dataset to analyze the temporal evolution of word usage in several languages. We apply measures proposed recently to study rank dynamics, such as the diversity of N-grams in a given rank, the probability that an N-gram changes rank between successive time intervals, the rank entropy, and the rank complexity. Using different methods, results show that there are generic properties for different languages at different scales, such as a core of words necessary to minimally understand a language. We also propose a null model to explore the relevance of linguistic structure across multiple scales, concluding that N-gram statistics cannot be reduced to word statistics. We expect our results to be useful in improving text prediction algorithms, as well as in shedding light on the large-scale features of language use, beyond linguistic and cultural differences across human populations.

PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval

Directory of Open Access Journals (Sweden)

Lin Jimmy

2008-06-01

Full Text Available Abstract Background Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships from manually-created hyperlinks. We consider the application of these techniques to biomedical text retrieval. In the current PubMed® search interface, a MEDLINE® citation is connected to a number of related citations, which are in turn connected to other citations. Thus, a MEDLINE record represents a node in a vast content-similarity network. This article explores the hypothesis that these networks can be exploited for text retrieval, in the same manner as hyperlink graphs on the Web. Results We conducted a number of reranking experiments using the TREC 2005 genomics track test collection in which scores extracted from PageRank and HITS analysis were combined with scores returned by an off-the-shelf retrieval engine. Experiments demonstrate that incorporating PageRank scores yields significant improvements in terms of standard ranked-retrieval metrics. Conclusion The link structure of content-similarity networks can be exploited to improve the effectiveness of information retrieval systems. These results generalize the applicability of graph analysis algorithms to text retrieval in the biomedical domain.

Playing for First Place: An Analysis of Online Reviews and Their Impact on Local Market Rankings

Directory of Open Access Journals (Sweden)

Dipendra SINGH

2016-06-01

Full Text Available Whereas past research studied the impact of online reviews on a hotel’s image, the present study analyzes the impact of various measures of customer engagement on the local market ranking of a hotel. For these purposes, the researchers collected data on a sample of hotels including the number of reviews, absolute rating (i.e. 1-5 stars, and market ranking (i.e. 1st, 2nd, 3rd place on TripAdvisor. The authors tested the relationships between number of reviews, market ranking, overall rating and number of booking transactions. Results revealed that the absolute rating of the hotel was a significant factor in determining its market ranking, whereas other elements such as the number of reviews were not. Since the logarithm used by TripAdvisor and other review sites is of a proprietary nature, research that illuminates the relationships between overall rating, market ranking, and number of reviews, helps illuminate scholar’s and practitioner’s understanding of how to improve hotel performance and online image.

Bias and Stability of Single Variable Classifiers for Feature Ranking and Selection.

Science.gov (United States)

Fakhraei, Shobeir; Soltanian-Zadeh, Hamid; Fotouhi, Farshad

2014-11-01

Feature rankings are often used for supervised dimension reduction especially when discriminating power of each feature is of interest, dimensionality of dataset is extremely high, or computational power is limited to perform more complicated methods. In practice, it is recommended to start dimension reduction via simple methods such as feature rankings before applying more complex approaches. Single Variable Classifier (SVC) ranking is a feature ranking based on the predictive performance of a classifier built using only a single feature. While benefiting from capabilities of classifiers, this ranking method is not as computationally intensive as wrappers. In this paper, we report the results of an extensive study on the bias and stability of such feature ranking method. We study whether the classifiers influence the SVC rankings or the discriminative power of features themselves has a dominant impact on the final rankings. We show the common intuition of using the same classifier for feature ranking and final classification does not always result in the best prediction performance. We then study if heterogeneous classifiers ensemble approaches provide more unbiased rankings and if they improve final classification performance. Furthermore, we calculate an empirical prediction performance loss for using the same classifier in SVC feature ranking and final classification from the optimal choices.

Minkowski metrics in creating universal ranking algorithms

Directory of Open Access Journals (Sweden)

Andrzej Ameljańczyk

2014-06-01

Full Text Available The paper presents a general procedure for creating the rankings of a set of objects, while the relation of preference based on any ranking function. The analysis was possible to use the ranking functions began by showing the fundamental drawbacks of commonly used functions in the form of a weighted sum. As a special case of the ranking procedure in the space of a relation, the procedure based on the notion of an ideal element and generalized Minkowski distance from the element was proposed. This procedure, presented as universal ranking algorithm, eliminates most of the disadvantages of ranking functions in the form of a weighted sum.[b]Keywords[/b]: ranking functions, preference relation, ranking clusters, categories, ideal point, universal ranking algorithm

Contextual effects on the perceived health benefits of exercise: the exercise rank hypothesis.

Science.gov (United States)

Maltby, John; Wood, Alex M; Vlaev, Ivo; Taylor, Michael J; Brown, Gordon D A

2012-12-01

Many accounts of social influences on exercise participation describe how people compare their behaviors to those of others. We develop and test a novel hypothesis, the exercise rank hypothesis, of how this comparison can occur. The exercise rank hypothesis, derived from evolutionary theory and the decision by sampling model of judgment, suggests that individuals' perceptions of the health benefits of exercise are influenced by how individuals believe the amount of exercise ranks in comparison with other people's amounts of exercise. Study 1 demonstrated that individuals' perceptions of the health benefits of their own current exercise amounts were as predicted by the exercise rank hypothesis. Study 2 demonstrated that the perceptions of the health benefits of an amount of exercise can be manipulated by experimentally changing the ranked position of the amount within a comparison context. The discussion focuses on how social norm-based interventions could benefit from using rank information.

Ranking Operations Management conferences

NARCIS (Netherlands)

Steenhuis, H.J.; de Bruijn, E.J.; Gupta, Sushil; Laptaned, U

2007-01-01

Several publications have appeared in the field of Operations Management which rank Operations Management related journals. Several ranking systems exist for journals based on , for example, perceived relevance and quality, citation, and author affiliation. Many academics also publish at conferences

Low rank magnetic resonance fingerprinting.

Science.gov (United States)

Mazor, Gal; Weizman, Lior; Tal, Assaf; Eldar, Yonina C

2016-08-01

Magnetic Resonance Fingerprinting (MRF) is a relatively new approach that provides quantitative MRI using randomized acquisition. Extraction of physical quantitative tissue values is preformed off-line, based on acquisition with varying parameters and a dictionary generated according to the Bloch equations. MRF uses hundreds of radio frequency (RF) excitation pulses for acquisition, and therefore high under-sampling ratio in the sampling domain (k-space) is required. This under-sampling causes spatial artifacts that hamper the ability to accurately estimate the quantitative tissue values. In this work, we introduce a new approach for quantitative MRI using MRF, called Low Rank MRF. We exploit the low rank property of the temporal domain, on top of the well-known sparsity of the MRF signal in the generated dictionary domain. We present an iterative scheme that consists of a gradient step followed by a low rank projection using the singular value decomposition. Experiments on real MRI data demonstrate superior results compared to conventional implementation of compressed sensing for MRF at 15% sampling ratio.

Phenomena identification and ranking tables (PIRT) for LBLOCA

International Nuclear Information System (INIS)

Shaw, R.A.; Dimenna, R.A.; Larson, T.K.; Wilson, G.E.

1988-01-01

The US Nuclear Regulatory Commission is sponsoring a program to provide validated reactor safety computer codes with quantified uncertainties. The intent is to quantify the accuracy of the codes for use in best estimate licensing applications. One of the tasks required to complete this program involves the identification and ranking of thermal-hydraulic phenomena that occur during particular accidents. This paper provides detailed tables of phenomena and importance ranks for a PWR LBLOCA. The phenomena were identified and ranked according to perceived impact on peak cladding temperature. Two approaches were used to complete this task. First, a panel of experts identified the physical processes considered to be most important during LBLOCA. A second team of experienced analysts then, in parallel, assembled complete tables of all plausible LBLOCA phenomena, regardless of perceived importance. Each phenomenon was then ranked in importance against every other phenomenon associated with a given component. The results were placed in matrix format and solved for the principal eigenvector. The results as determined by each method are presented in this report

Country-specific determinants of world university rankings

OpenAIRE

Pietrucha, Jacek

2017-01-01

This paper examines country-specific factors that affect the three most influential world university rankings (the Academic Ranking of World Universities, the QS World University Ranking, and the Times Higher Education World University Ranking). We run a cross sectional regression that covers 42–71 countries (depending on the ranking and data availability). We show that the position of universities from a country in the ranking is determined by the following country-specific variables: econom...

Sign rank versus Vapnik-Chervonenkis dimension

Science.gov (United States)

Alon, N.; Moran, Sh; Yehudayoff, A.

2017-12-01

This work studies the maximum possible sign rank of sign (N × N)-matrices with a given Vapnik-Chervonenkis dimension d. For d=1, this maximum is three. For d=2, this maximum is \\widetilde{\\Theta}(N1/2). For d >2, similar but slightly less accurate statements hold. The lower bounds improve on previous ones by Ben-David et al., and the upper bounds are novel. The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given Vapnik-Chervonenkis dimension, and the number of maximum classes of a given Vapnik-Chervonenkis dimension--answering a question of Frankl from 1989, and (ii) design an efficient algorithm that provides an O(N/log(N)) multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the adjacency (N × N)-matrix of a Δ-regular graph with a second eigenvalue of absolute value λ and Δ ≤ N/2. We show that the sign rank of the signed version of this matrix is at least Δ/λ. We use this connection to prove the existence of a maximum class C\\subseteq\\{+/- 1\\}^N with Vapnik-Chervonenkis dimension 2 and sign rank \\widetilde{\\Theta}(N1/2). This answers a question of Ben-David et al. regarding the sign rank of large Vapnik-Chervonenkis classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics. Bibliography: 69 titles.

Feasibility study of component risk ranking for plant maintenance

International Nuclear Information System (INIS)

Ushijima, Koji; Yonebayashi, Kenji; Narumiya, Yoshiyuki; Sakata, Kaoru; Kumano, Tetsuji

1999-01-01

Nuclear power is the base load electricity source in Japan, and reduction of operation and maintenance cost maintaining or improving plant safety is one of the major issues. Recently, Risk Informed Management (RIM) is focused as a solution. In this paper, the outline regarding feasibility study of component risk ranking for plant maintenance for a typical Japanese PWR plant is described. A feasibility study of component risk raking for plant maintenance optimization is performed on check valves and motor-operated valves. Risk ranking is performed in two steps using probabilistic analysis (quantitative method) for risk ranking of components, and deterministic examination (qualitative method) for component review. In this study, plant components are ranked from the viewpoint of plant safety / reliability, and the applicability for maintenance is assessed. As a result, distribution of maintenance resources using risk ranking is considered effective. (author)

RANK/RANKL/OPG Signalization Implication in Periodontitis: New Evidence from a RANK Transgenic Mouse Model

Directory of Open Access Journals (Sweden)

Bouchra Sojod

2017-05-01

Full Text Available Periodontitis is based on a complex inflammatory over-response combined with possible genetic predisposition factors. The RANKL/RANK/OPG signaling pathway is implicated in bone resorption through its key function in osteoclast differentiation and activation, as well as in the inflammatory response. This central element of osteo-immunology has been suggested to be perturbed in several diseases, including periodontitis, as it is a predisposing factor for this disease. The aim of the present study was to validate this hypothesis using a transgenic mouse line, which over-expresses RANK (RTg and develops a periodontitis-like phenotype at 5 months of age. RTg mice exhibited severe alveolar bone loss, an increased number of TRAP positive cells, and disorganization of periodontal ligaments. This phenotype was more pronounced in females. We also observed dental root resorption lacunas. Hyperplasia of the gingival epithelium, including Malassez epithelial rests, was visible as early as 25 days, preceding any other symptoms. These results demonstrate that perturbations of the RANKL/RANK/OPG system constitute a core element of periodontitis, and more globally, osteo-immune diseases.

RANK/RANKL/OPG Signalization Implication in Periodontitis: New Evidence from a RANK Transgenic Mouse Model

Science.gov (United States)

Sojod, Bouchra; Chateau, Danielle; Mueller, Christopher G.; Babajko, Sylvie; Berdal, Ariane; Lézot, Frédéric; Castaneda, Beatriz

2017-01-01

Periodontitis is based on a complex inflammatory over-response combined with possible genetic predisposition factors. The RANKL/RANK/OPG signaling pathway is implicated in bone resorption through its key function in osteoclast differentiation and activation, as well as in the inflammatory response. This central element of osteo-immunology has been suggested to be perturbed in several diseases, including periodontitis, as it is a predisposing factor for this disease. The aim of the present study was to validate this hypothesis using a transgenic mouse line, which over-expresses RANK (RTg) and develops a periodontitis-like phenotype at 5 months of age. RTg mice exhibited severe alveolar bone loss, an increased number of TRAP positive cells, and disorganization of periodontal ligaments. This phenotype was more pronounced in females. We also observed dental root resorption lacunas. Hyperplasia of the gingival epithelium, including Malassez epithelial rests, was visible as early as 25 days, preceding any other symptoms. These results demonstrate that perturbations of the RANKL/RANK/OPG system constitute a core element of periodontitis, and more globally, osteo-immune diseases. PMID:28596739

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition

Science.gov (United States)

Tang, Xin; Feng, Guo-can; Li, Xiao-xin; Cai, Jia-xin

2015-01-01

Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC) achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC). Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis) of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our method achieves the

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition.

Science.gov (United States)

Tang, Xin; Feng, Guo-Can; Li, Xiao-Xin; Cai, Jia-Xin

2015-01-01

Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC) achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC). Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis) of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our method achieves the

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition.

Directory of Open Access Journals (Sweden)

Xin Tang

Full Text Available Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC. Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our

A network-based dynamical ranking system for competitive sports

Science.gov (United States)

Motegi, Shun; Masuda, Naoki

2012-12-01

From the viewpoint of networks, a ranking system for players or teams in sports is equivalent to a centrality measure for sports networks, whereby a directed link represents the result of a single game. Previously proposed network-based ranking systems are derived from static networks, i.e., aggregation of the results of games over time. However, the score of a player (or team) fluctuates over time. Defeating a renowned player in the peak performance is intuitively more rewarding than defeating the same player in other periods. To account for this factor, we propose a dynamic variant of such a network-based ranking system and apply it to professional men's tennis data. We derive a set of linear online update equations for the score of each player. The proposed ranking system predicts the outcome of the future games with a higher accuracy than the static counterparts.

Exact distributions of two-sample rank statistics and block rank statistics using computer algebra

NARCIS (Netherlands)

Wiel, van de M.A.

1998-01-01

We derive generating functions for various rank statistics and we use computer algebra to compute the exact null distribution of these statistics. We present various techniques for reducing time and memory space used by the computations. We use the results to write Mathematica notebooks for

Improving feature ranking for biomarker discovery in proteomics mass spectrometry data using genetic programming

Science.gov (United States)

Ahmed, Soha; Zhang, Mengjie; Peng, Lifeng

2014-07-01

Feature selection on mass spectrometry (MS) data is essential for improving classification performance and biomarker discovery. The number of MS samples is typically very small compared with the high dimensionality of the samples, which makes the problem of biomarker discovery very hard. In this paper, we propose the use of genetic programming for biomarker detection and classification of MS data. The proposed approach is composed of two phases: in the first phase, feature selection and ranking are performed. In the second phase, classification is performed. The results show that the proposed method can achieve better classification performance and biomarker detection rate than the information gain- (IG) based and the RELIEF feature selection methods. Meanwhile, four classifiers, Naive Bayes, J48 decision tree, random forest and support vector machines, are also used to further test the performance of the top ranked features. The results show that the four classifiers using the top ranked features from the proposed method achieve better performance than the IG and the RELIEF methods. Furthermore, GP also outperforms a genetic algorithm approach on most of the used data sets.

Ranking beta sheet topologies of proteins

DEFF Research Database (Denmark)

Fonseca, Rasmus; Helles, Glennie; Winter, Pawel

2010-01-01

One of the challenges of protein structure prediction is to identify long-range interactions between amino acids. To reliably predict such interactions, we enumerate, score and rank all beta-topologies (partitions of beta-strands into sheets, orderings of strands within sheets and orientations...... of paired strands) of a given protein. We show that the beta-topology corresponding to the native structure is, with high probability, among the top-ranked. Since full enumeration is very time-consuming, we also suggest a method to deal with proteins with many beta-strands. The results reported...... in this paper are highly relevant for ab initio protein structure prediction methods based on decoy generation. The top-ranked beta-topologies can be used to find initial conformations from which conformational searches can be started. They can also be used to filter decoys by removing those with poorly...

Universal emergence of PageRank

Energy Technology Data Exchange (ETDEWEB)

Frahm, K M; Georgeot, B; Shepelyansky, D L, E-mail: frahm@irsamc.ups-tlse.fr, E-mail: georgeot@irsamc.ups-tlse.fr, E-mail: dima@irsamc.ups-tlse.fr [Laboratoire de Physique Theorique du CNRS, IRSAMC, Universite de Toulouse, UPS, 31062 Toulouse (France)

2011-11-18

The PageRank algorithm enables us to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter {alpha} Element-Of ]0, 1[. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of the PageRank vector at its emergence when {alpha} {yields} 1. The whole network can be divided into a core part and a group of invariant subspaces. For {alpha} {yields} 1, PageRank converges to a universal power-law distribution on the invariant subspaces whose size distribution also follows a universal power law. The convergence of PageRank at {alpha} {yields} 1 is controlled by eigenvalues of the core part of the Google matrix, which are extremely close to unity, leading to large relaxation times as, for example, in spin glasses. (paper)

Universal emergence of PageRank

International Nuclear Information System (INIS)

Frahm, K M; Georgeot, B; Shepelyansky, D L

2011-01-01

The PageRank algorithm enables us to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter α ∈ ]0, 1[. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of the PageRank vector at its emergence when α → 1. The whole network can be divided into a core part and a group of invariant subspaces. For α → 1, PageRank converges to a universal power-law distribution on the invariant subspaces whose size distribution also follows a universal power law. The convergence of PageRank at α → 1 is controlled by eigenvalues of the core part of the Google matrix, which are extremely close to unity, leading to large relaxation times as, for example, in spin glasses. (paper)

Multimodal biometric system using rank-level fusion approach.

Science.gov (United States)

Monwar, Md Maruf; Gavrilova, Marina L

2009-08-01

In many real-world applications, unimodal biometric systems often face significant limitations due to sensitivity to noise, intraclass variability, data quality, nonuniversality, and other factors. Attempting to improve the performance of individual matchers in such situations may not prove to be highly effective. Multibiometric systems seek to alleviate some of these problems by providing multiple pieces of evidence of the same identity. These systems help achieve an increase in performance that may not be possible using a single-biometric indicator. This paper presents an effective fusion scheme that combines information presented by multiple domain experts based on the rank-level fusion integration method. The developed multimodal biometric system possesses a number of unique qualities, starting from utilizing principal component analysis and Fisher's linear discriminant methods for individual matchers (face, ear, and signature) identity authentication and utilizing the novel rank-level fusion method in order to consolidate the results obtained from different biometric matchers. The ranks of individual matchers are combined using the highest rank, Borda count, and logistic regression approaches. The results indicate that fusion of individual modalities can improve the overall performance of the biometric system, even in the presence of low quality data. Insights on multibiometric design using rank-level fusion and its performance on a variety of biometric databases are discussed in the concluding section.

Speaker-sensitive emotion recognition via ranking: Studies on acted and spontaneous speech☆

Science.gov (United States)

Cao, Houwei; Verma, Ragini; Nenkova, Ani

2015-01-01

We introduce a ranking approach for emotion recognition which naturally incorporates information about the general expressivity of speakers. We demonstrate that our approach leads to substantial gains in accuracy compared to conventional approaches. We train ranking SVMs for individual emotions, treating the data from each speaker as a separate query, and combine the predictions from all rankers to perform multi-class prediction. The ranking method provides two natural benefits. It captures speaker specific information even in speaker-independent training/testing conditions. It also incorporates the intuition that each utterance can express a mix of possible emotion and that considering the degree to which each emotion is expressed can be productively exploited to identify the dominant emotion. We compare the performance of the rankers and their combination to standard SVM classification approaches on two publicly available datasets of acted emotional speech, Berlin and LDC, as well as on spontaneous emotional data from the FAU Aibo dataset. On acted data, ranking approaches exhibit significantly better performance compared to SVM classification both in distinguishing a specific emotion from all others and in multi-class prediction. On the spontaneous data, which contains mostly neutral utterances with a relatively small portion of less intense emotional utterances, ranking-based classifiers again achieve much higher precision in identifying emotional utterances than conventional SVM classifiers. In addition, we discuss the complementarity of conventional SVM and ranking-based classifiers. On all three datasets we find dramatically higher accuracy for the test items on whose prediction the two methods agree compared to the accuracy of individual methods. Furthermore on the spontaneous data the ranking and standard classification are complementary and we obtain marked improvement when we combine the two classifiers by late-stage fusion.

Classification of non-simple C*-algebras of real rank zero

DEFF Research Database (Denmark)

Arklint, Sara Esther

for real rank zero graph algebras over primitive ideal spaces that admit classification. As a consequence of completeness of filtered K-theory combined with this range result, one can conclude that real rank zero extensions of stabilized Cuntz-Krieger algebras are stabilized Cuntz-Krieger algebras......This thesis deals with classification of nonsimple C-algebras of real rank zero, and whether filtered K-theory is a suitable invariant for this purpose. As a consequence of the result of E. Kirchberg for purely infinite, nuclear C-algebras with a finite primitive ideal space, it suffices to lift...... the thesis is the following: is it possible to achieve the desired classification result for arbitrary finite primitive ideal spaces by restricting to C-algebras of real rank zero that possibly satisfy further restrictions on K-theory? The thesis consists of an account of the relevant theory and the relevant...

A model-based approach to operational event groups ranking

Energy Technology Data Exchange (ETDEWEB)

Simic, Zdenko [European Commission Joint Research Centre, Petten (Netherlands). Inst. for Energy and Transport; Maqua, Michael [Gesellschaft fuer Anlagen- und Reaktorsicherheit mbH (GRS), Koeln (Germany); Wattrelos, Didier [Institut de Radioprotection et de Surete Nucleaire (IRSN), Fontenay-aux-Roses (France)

2014-04-15

The operational experience (OE) feedback provides improvements in all industrial activities. Identification of the most important and valuable groups of events within accumulated experience is important in order to focus on a detailed investigation of events. The paper describes the new ranking method and compares it with three others. Methods have been described and applied to OE events utilised by nuclear power plants in France and Germany for twenty years. The results show that different ranking methods only roughly agree on which of the event groups are the most important ones. In the new ranking method the analytical hierarchy process is applied in order to assure consistent and comprehensive weighting determination for ranking indexes. The proposed method allows a transparent and flexible event groups ranking and identification of the most important OE for further more detailed investigation in order to complete the feedback. (orig.)

Dynamic Matrix Rank

DEFF Research Database (Denmark)

Frandsen, Gudmund Skovbjerg; Frandsen, Peter Frands

2009-01-01

We consider maintaining information about the rank of a matrix under changes of the entries. For n×n matrices, we show an upper bound of O(n1.575) arithmetic operations and a lower bound of Ω(n) arithmetic operations per element change. The upper bound is valid when changing up to O(n0.575) entries...... in a single column of the matrix. We also give an algorithm that maintains the rank using O(n2) arithmetic operations per rank one update. These bounds appear to be the first nontrivial bounds for the problem. The upper bounds are valid for arbitrary fields, whereas the lower bound is valid for algebraically...... closed fields. The upper bound for element updates uses fast rectangular matrix multiplication, and the lower bound involves further development of an earlier technique for proving lower bounds for dynamic computation of rational functions....

Rankings of Economics Faculties and Representation on Editorial Boards of Top Journals.

Science.gov (United States)

Gibbons, Jean D.; Fish, Mary

1991-01-01

Presents rankings of U.S., university, economics departments. Explains the rankings are based upon representation of the departments on the editorial boards of leading economics journals. Reports that results are similar to rankings based upon other criteria. (DK)

Third-rank chromatic aberrations of electron lenses.

Science.gov (United States)

Liu, Zhixiong

2018-02-01

In this paper the third-rank chromatic aberration coefficients of round electron lenses are analytically derived and numerically calculated by Mathematica. Furthermore, the numerical results are cross-checked by the differential algebraic (DA) method, which verifies that all the formulas for the third-rank chromatic aberration coefficients are completely correct. It is hoped that this work would be helpful for further chromatic aberration correction in electron microscopy. Copyright © 2017 Elsevier B.V. All rights reserved.

Learning Preference Models from Data: On the Problem of Label Ranking and Its Variants

Science.gov (United States)

Hüllermeier, Eyke; Fürnkranz, Johannes

The term “preference learning” refers to the application of machine learning methods for inducing preference models from empirical data. In the recent literature, corresponding problems appear in various guises. After a brief overview of the field, this work focuses on a particular learning scenario called label ranking where the problem is to learn a mapping from instances to rankings over a finite number of labels. Our approach for learning such a ranking function, called ranking by pairwise comparison (RPC), first induces a binary preference relation from suitable training data, using a natural extension of pairwise classification. A ranking is then derived from this relation by means of a ranking procedure. This paper elaborates on a key advantage of such an approach, namely the fact that our learner can be adapted to different loss functions by using different ranking procedures on the same underlying order relations. In particular, the Spearman rank correlation is minimized by using a simple weighted voting procedure. Moreover, we discuss a loss function suitable for settings where candidate labels must be tested successively until a target label is found. In this context, we propose the idea of “empirical conditioning” of class probabilities. A related ranking procedure, called “ranking through iterated choice”, is investigated experimentally.

Social Rank, Stress, Fitness, and Life Expectancy in Wild Rabbits

Science.gov (United States)

von Holst, Dietrich; Hutzelmeyer, Hans; Kaetzke, Paul; Khaschei, Martin; Schönheiter, Ronald

Wild rabbits of the two sexes have separate linear rank orders, which are established and maintained by intensive fights. The social rank of individuals strongly influence their fitness: males and females that gain a high social rank, at least at the outset of their second breeding season, have a much higher lifetime fitness than subordinate individuals. This is because of two separate factors: a much higher fecundity and annual reproductive success and a 50% longer reproductive life span. These results are in contrast to the view in evolutionary biology that current reproduction can be increased only at the expense of future survival and/or fecundity. These concepts entail higher physiological costs in high-ranking mammals, which is not supported by our data: In wild rabbits the physiological costs of social positions are caused predominantly by differential psychosocial stress responses that are much lower in high-ranking than in low-ranking individuals.

Hitting the Rankings Jackpot

Science.gov (United States)

Chapman, David W.

2008-01-01

Recently, Samford University was ranked 27th in the nation in a report released by "Forbes" magazine. In this article, the author relates how the people working at Samford University were surprised at its ranking. Although Samford is the largest privately institution in Alabama, its distinguished academic achievements aren't even…

College Rankings as an Interorganizational Dependency: Establishing the Foundation for Strategic and Institutional Accounts

Science.gov (United States)

Bastedo, Michael N.; Bowman, Nicholas A.

2011-01-01

Higher education administrators believe that revenues are linked to college rankings and act accordingly, particularly those at research universities. Although rankings are clearly influential for many schools and colleges, this fundamental assumption has yet to be tested empirically. Drawing on data from multiple resource providers in higher…

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs

Science.gov (United States)

Alias, Christophe; Darte, Alain; Feautrier, Paul; Gonnord, Laure

Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a well-founded set, which strictly decreases at each program step. A standard method to automatically generate such a function is to compute invariants for each program point and to search for a ranking in a restricted class of functions that can be handled with linear programming techniques. Previous algorithms based on affine rankings either are applicable only to simple loops (i.e., single-node flowcharts) and rely on enumeration, or are not complete in the sense that they are not guaranteed to find a ranking in the class of functions they consider, if one exists. Our first contribution is to propose an efficient algorithm to compute ranking functions: It can handle flowcharts of arbitrary structure, the class of candidate rankings it explores is larger, and our method, although greedy, is provably complete. Our second contribution is to show how to use the ranking functions we generate to get upper bounds for the computational complexity (number of transitions) of the source program. This estimate is a polynomial, which means that we can handle programs with more than linear complexity. We applied the method on a collection of test cases from the literature. We also show the links and differences with previous techniques based on the insertion of counters.

The optimized expansion based low-rank method for wavefield extrapolation

KAUST Repository

Wu, Zedong

2014-03-01

Spectral methods are fast becoming an indispensable tool for wavefield extrapolation, especially in anisotropic media because it tends to be dispersion and artifact free as well as highly accurate when solving the wave equation. However, for inhomogeneous media, we face difficulties in dealing with the mixed space-wavenumber domain extrapolation operator efficiently. To solve this problem, we evaluated an optimized expansion method that can approximate this operator with a low-rank variable separation representation. The rank defines the number of inverse Fourier transforms for each time extrapolation step, and thus, the lower the rank, the faster the extrapolation. The method uses optimization instead of matrix decomposition to find the optimal wavenumbers and velocities needed to approximate the full operator with its explicit low-rank representation. As a result, we obtain lower rank representations compared with the standard low-rank method within reasonable accuracy and thus cheaper extrapolations. Additional bounds set on the range of propagated wavenumbers to adhere to the physical wave limits yield unconditionally stable extrapolations regardless of the time step. An application on the BP model provided superior results compared to those obtained using the decomposition approach. For transversely isotopic media, because we used the pure P-wave dispersion relation, we obtained solutions that were free of the shear wave artifacts, and the algorithm does not require that n > 0. In addition, the required rank for the optimization approach to obtain high accuracy in anisotropic media was lower than that obtained by the decomposition approach, and thus, it was more efficient. A reverse time migration result for the BP tilted transverse isotropy model using this method as a wave propagator demonstrated the ability of the algorithm.

Econophysics of a ranked demand and supply resource allocation problem

Science.gov (United States)

Priel, Avner; Tamir, Boaz

2018-01-01

We present a two sided resource allocation problem, between demands and supplies, where both parties are ranked. For example, in Big Data problems where a set of different computational tasks is divided between a set of computers each with its own resources, or between employees and employers where both parties are ranked, the employees by their fitness and the employers by their package benefits. The allocation process can be viewed as a repeated game where in each iteration the strategy is decided by a meta-rule, based on the ranks of both parties and the results of the previous games. We show the existence of a phase transition between an absorbing state, where all demands are satisfied, and an active one where part of the demands are always left unsatisfied. The phase transition is governed by the ratio between supplies and demand. In a job allocation problem we find positive correlation between the rank of the workers and the rank of the factories; higher rank workers are usually allocated to higher ranked factories. These all suggest global emergent properties stemming from local variables. To demonstrate the global versus local relations, we introduce a local inertial force that increases the rank of employees in proportion to their persistence time in the same factory. We show that such a local force induces non trivial global effects, mostly to benefit the lower ranked employees.

Sparse Contextual Activation for Efficient Visual Re-Ranking.

Science.gov (United States)

Bai, Song; Bai, Xiang

2016-03-01

In this paper, we propose an extremely efficient algorithm for visual re-ranking. By considering the original pairwise distance in the contextual space, we develop a feature vector called sparse contextual activation (SCA) that encodes the local distribution of an image. Hence, re-ranking task can be simply accomplished by vector comparison under the generalized Jaccard metric, which has its theoretical meaning in the fuzzy set theory. In order to improve the time efficiency of re-ranking procedure, inverted index is successfully introduced to speed up the computation of generalized Jaccard metric. As a result, the average time cost of re-ranking for a certain query can be controlled within 1 ms. Furthermore, inspired by query expansion, we also develop an additional method called local consistency enhancement on the proposed SCA to improve the retrieval performance in an unsupervised manner. On the other hand, the retrieval performance using a single feature may not be satisfactory enough, which inspires us to fuse multiple complementary features for accurate retrieval. Based on SCA, a robust feature fusion algorithm is exploited that also preserves the characteristic of high time efficiency. We assess our proposed method in various visual re-ranking tasks. Experimental results on Princeton shape benchmark (3D object), WM-SRHEC07 (3D competition), YAEL data set B (face), MPEG-7 data set (shape), and Ukbench data set (image) manifest the effectiveness and efficiency of SCA.

Tensor rank is not multiplicative under the tensor product

OpenAIRE

Christandl, Matthias; Jensen, Asger Kjærulff; Zuiddam, Jeroen

2017-01-01

The tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r simple tensors. Let s be a k-tensor and let t be an l-tensor. The tensor product of s and t is a (k + l)-tensor. Tensor rank is sub-multiplicative under the tensor product. We revisit the connection between restrictions and degenerations. A result of our study is that tensor rank is not in general multiplicative under the tensor product. This answers a question of Draisma and Saptharishi. Specif...

Ranking adverse drug reactions with crowdsourcing.

Science.gov (United States)

Gottlieb, Assaf; Hoehndorf, Robert; Dumontier, Michel; Altman, Russ B

2015-03-23

There is no publicly available resource that provides the relative severity of adverse drug reactions (ADRs). Such a resource would be useful for several applications, including assessment of the risks and benefits of drugs and improvement of patient-centered care. It could also be used to triage predictions of drug adverse events. The intent of the study was to rank ADRs according to severity. We used Internet-based crowdsourcing to rank ADRs according to severity. We assigned 126,512 pairwise comparisons of ADRs to 2589 Amazon Mechanical Turk workers and used these comparisons to rank order 2929 ADRs. There is good correlation (rho=.53) between the mortality rates associated with ADRs and their rank. Our ranking highlights severe drug-ADR predictions, such as cardiovascular ADRs for raloxifene and celecoxib. It also triages genes associated with severe ADRs such as epidermal growth-factor receptor (EGFR), associated with glioblastoma multiforme, and SCN1A, associated with epilepsy. ADR ranking lays a first stepping stone in personalized drug risk assessment. Ranking of ADRs using crowdsourcing may have useful clinical and financial implications, and should be further investigated in the context of health care decision making.

Advanced Acid Gas Separation Technology for the Utilization of Low Rank Coals

Energy Technology Data Exchange (ETDEWEB)

Kloosterman, Jeff

2012-12-31

Air Products has developed a potentially ground-breaking technology – Sour Pressure Swing Adsorption (PSA) – to replace the solvent-based acid gas removal (AGR) systems currently employed to separate sulfur containing species, along with CO{sub 2} and other impurities, from gasifier syngas streams. The Sour PSA technology is based on adsorption processes that utilize pressure swing or temperature swing regeneration methods. Sour PSA technology has already been shown with higher rank coals to provide a significant reduction in the cost of CO{sub 2} capture for power generation, which should translate to a reduction in cost of electricity (COE), compared to baseline CO{sub 2} capture plant design. The objective of this project is to test the performance and capability of the adsorbents in handling tar and other impurities using a gaseous mixture generated from the gasification of lower rank, lignite coal. The results of this testing are used to generate a high-level pilot process design, and to prepare a techno-economic assessment evaluating the applicability of the technology to plants utilizing these coals.

GeneRank: Using search engine technology for the analysis of microarray experiments

Directory of Open Access Journals (Sweden)

Breitling Rainer

2005-09-01

Full Text Available Abstract Background Interpretation of simple microarray experiments is usually based on the fold-change of gene expression between a reference and a "treated" sample where the treatment can be of many types from drug exposure to genetic variation. Interpretation of the results usually combines lists of differentially expressed genes with previous knowledge about their biological function. Here we evaluate a method – based on the PageRank algorithm employed by the popular search engine Google – that tries to automate some of this procedure to generate prioritized gene lists by exploiting biological background information. Results GeneRank is an intuitive modification of PageRank that maintains many of its mathematical properties. It combines gene expression information with a network structure derived from gene annotations (gene ontologies or expression profile correlations. Using both simulated and real data we find that the algorithm offers an improved ranking of genes compared to pure expression change rankings. Conclusion Our modification of the PageRank algorithm provides an alternative method of evaluating microarray experimental results which combines prior knowledge about the underlying network. GeneRank offers an improvement compared to assessing the importance of a gene based on its experimentally observed fold-change alone and may be used as a basis for further analytical developments.

Country-specific determinants of world university rankings.

Science.gov (United States)

Pietrucha, Jacek

2018-01-01

This paper examines country-specific factors that affect the three most influential world university rankings (the Academic Ranking of World Universities, the QS World University Ranking, and the Times Higher Education World University Ranking). We run a cross sectional regression that covers 42-71 countries (depending on the ranking and data availability). We show that the position of universities from a country in the ranking is determined by the following country-specific variables: economic potential of the country, research and development expenditure, long-term political stability (freedom from war, occupation, coups and major changes in the political system), and institutional variables, including government effectiveness.

Ranking in evolving complex networks

Science.gov (United States)

Liao, Hao; Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng; Zhou, Ming-Yang

2017-05-01

Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world problems because it affects how we access online information and products, how success and talent are evaluated in human activities, and how scarce resources are allocated by companies and policymakers, among others. This calls for a deep understanding of how existing ranking algorithms perform, and which are their possible biases that may impair their effectiveness. Many popular ranking algorithms (such as Google's PageRank) are static in nature and, as a consequence, they exhibit important shortcomings when applied to real networks that rapidly evolve in time. At the same time, recent advances in the understanding and modeling of evolving networks have enabled the development of a wide and diverse range of ranking algorithms that take the temporal dimension into account. The aim of this review is to survey the existing ranking algorithms, both static and time-aware, and their applications to evolving networks. We emphasize both the impact of network evolution on well-established static algorithms and the benefits from including the temporal dimension for tasks such as prediction of network traffic, prediction of future links, and identification of significant nodes.

Charting taxonomic knowledge through ontologies and ranking algorithms

Science.gov (United States)

Huber, Robert; Klump, Jens

2009-04-01

Since the inception of geology as a modern science, paleontologists have described a large number of fossil species. This makes fossilized organisms an important tool in the study of stratigraphy and past environments. Since taxonomic classifications of organisms, and thereby their names, change frequently, the correct application of this tool requires taxonomic expertise in finding correct synonyms for a given species name. Much of this taxonomic information has already been published in journals and books where it is compiled in carefully prepared synonymy lists. Because this information is scattered throughout the paleontological literature, it is difficult to find and sometimes not accessible. Also, taxonomic information in the literature is often difficult to interpret for non-taxonomists looking for taxonomic synonymies as part of their research. The highly formalized structure makes Open Nomenclature synonymy lists ideally suited for computer aided identification of taxonomic synonyms. Because a synonymy list is a list of citations related to a taxon name, its bibliographic nature allows the application of bibliometric techniques to calculate the impact of synonymies and taxonomic concepts. TaxonRank is a ranking algorithm based on bibliometric analysis and Internet page ranking algorithms. TaxonRank uses published synonymy list data stored in TaxonConcept, a taxonomic information system. The basic ranking algorithm has been modified to include a measure of confidence on species identification based on the Open Nomenclature notation used in synonymy list, as well as other synonymy specific criteria. The results of our experiments show that the output of the proposed ranking algorithm gives a good estimate of the impact a published taxonomic concept has on the taxonomic opinions in the geological community. Also, our results show that treating taxonomic synonymies as part of on an ontology is a way to record and manage taxonomic knowledge, and thus contribute

A method for generating permutation distribution of ranks in a k ...

African Journals Online (AJOL)

... in a combinatorial sense the distribution of the ranks is obtained via its generating function. The formulas are defined recursively to speed up computations using the computer algebra system Mathematica. Key words: Partitions, generating functions, combinatorics, permutation test, exact tests, computer algebra, k-sample, ...

Support vector methods for survival analysis: a comparison between ranking and regression approaches.

Science.gov (United States)

Van Belle, Vanya; Pelckmans, Kristiaan; Van Huffel, Sabine; Suykens, Johan A K

2011-10-01

To compare and evaluate ranking, regression and combined machine learning approaches for the analysis of survival data. The literature describes two approaches based on support vector machines to deal with censored observations. In the first approach the key idea is to rephrase the task as a ranking problem via the concordance index, a problem which can be solved efficiently in a context of structural risk minimization and convex optimization techniques. In a second approach, one uses a regression approach, dealing with censoring by means of inequality constraints. The goal of this paper is then twofold: (i) introducing a new model combining the ranking and regression strategy, which retains the link with existing survival models such as the proportional hazards model via transformation models; and (ii) comparison of the three techniques on 6 clinical and 3 high-dimensional datasets and discussing the relevance of these techniques over classical approaches fur survival data. We compare svm-based survival models based on ranking constraints, based on regression constraints and models based on both ranking and regression constraints. The performance of the models is compared by means of three different measures: (i) the concordance index, measuring the model's discriminating ability; (ii) the logrank test statistic, indicating whether patients with a prognostic index lower than the median prognostic index have a significant different survival than patients with a prognostic index higher than the median; and (iii) the hazard ratio after normalization to restrict the prognostic index between 0 and 1. Our results indicate a significantly better performance for models including regression constraints above models only based on ranking constraints. This work gives empirical evidence that svm-based models using regression constraints perform significantly better than svm-based models based on ranking constraints. Our experiments show a comparable performance for methods

Some relations between rank, chromatic number and energy of graphs

International Nuclear Information System (INIS)

Akbari, S.; Ghorbani, E.; Zare, S.

2006-08-01

The energy of a graph G is defined as the sum of the absolute values of all eigenvalues of G and denoted by E(G). Let G be a graph and rank(G) be the rank of the adjacency matrix of G. In this paper we characterize all the graphs with E(G) = rank(G). Among other results we show that apart from a few families of graphs, E(G) ≥ 2max(χ(G), n - χ(G--bar)), where G-bar and χ(G) are the complement and the chromatic number of G, respectively. Moreover some new lower bounds for E(G) in terms of rank(G) are given. (author)

Ranking of Cylinder Liner Materials in Two Stroke Marine Diesel Engines

DEFF Research Database (Denmark)

Pedersen, Michael Torben; Imran, Tajammal; Klit, Peder

2009-01-01

is made into a ring and the piston ring into a block. A short introduction of the test apparatus and its abilities is presented and discussed. Results from comparison and characterisation of five different cylinder liner materials run with a fixed piston ring material are presented. A preliminary ranking...... of the materials is given based on the materials tribological performance. The materials are evaluated on basis of friction force, oil film thickness variation, temperature variation and rotational speed....

On the Effect of Group Structures on Ranking Strategies in Folksonomies

Science.gov (United States)

Abel, Fabian; Henze, Nicola; Krause, Daniel; Kriesell, Matthias

Folksonomies have shown interesting potential for improving information discovery and exploration. Recent folksonomy systems explore the use of tag assignments, which combine Web resources with annotations (tags), and the users that have created the annotations. This article investigates on the effect of grouping resources in folksonomies, i.e. creating sets of resources, and using this additional structure for the tasks of search & ranking, and for tag recommendations. We propose several group-sensitive extensions of graph-based search and recommendation algorithms, and compare them with non group-sensitive versions. Our experiments show that the quality of search result ranking can be significantly improved by introducing and exploiting the grouping of resources (one-tailed t-Test, level of significance α=0.05). Furthermore, tag recommendations profit from the group context, and it is possible to make very good recommendations even for untagged resources- which currently known tag recommendation algorithms cannot fulfill.

In Search of a Better Mousetrap: A Look at Higher Education Ranking Systems

Science.gov (United States)

Swail, Watson Scott

2011-01-01

College rankings create much talk and discussion in the higher education arena. This love/hate relationship has not necessarily resulted in better rankings, but rather, more rankings. This paper looks at some of the measures and pitfalls of the current rankings systems, and proposes areas for improvement through a better focus on teaching and…

SRS: Site ranking system for hazardous chemical and radioactive waste

International Nuclear Information System (INIS)

Rechard, R.P.; Chu, M.S.Y.; Brown, S.L.

1988-05-01

This report describes the rationale and presents instructions for a site ranking system (SRS). SRS ranks hazardous chemical and radioactive waste sites by scoring important and readily available factors that influence risk to human health. Using SRS, sites can be ranked for purposes of detailed site investigations. SRS evaluates the relative risk as a combination of potentially exposed population, chemical toxicity, and potential exposure of release from a waste site; hence, SRS uses the same concepts found in a detailed assessment of health risk. Basing SRS on the concepts of risk assessment tends to reduce the distortion of results found in other ranking schemes. More importantly, a clear logic helps ensure the successful application of the ranking procedure and increases its versatility when modifications are necessary for unique situations. Although one can rank sites using a detailed risk assessment, it is potentially costly because of data and resources required. SRS is an efficient approach to provide an order-of-magnitude ranking, requiring only readily available data (often only descriptive) and hand calculations. Worksheets are included to make the system easier to understand and use. 88 refs., 19 figs., 58 tabs

Predicting disease risk using bootstrap ranking and classification algorithms.

Directory of Open Access Journals (Sweden)

Ohad Manor

Full Text Available Genome-wide association studies (GWAS are widely used to search for genetic loci that underlie human disease. Another goal is to predict disease risk for different individuals given their genetic sequence. Such predictions could either be used as a "black box" in order to promote changes in life-style and screening for early diagnosis, or as a model that can be studied to better understand the mechanism of the disease. Current methods for risk prediction typically rank single nucleotide polymorphisms (SNPs by the p-value of their association with the disease, and use the top-associated SNPs as input to a classification algorithm. However, the predictive power of such methods is relatively poor. To improve the predictive power, we devised BootRank, which uses bootstrapping in order to obtain a robust prioritization of SNPs for use in predictive models. We show that BootRank improves the ability to predict disease risk of unseen individuals in the Wellcome Trust Case Control Consortium (WTCCC data and results in a more robust set of SNPs and a larger number of enriched pathways being associated with the different diseases. Finally, we show that combining BootRank with seven different classification algorithms improves performance compared to previous studies that used the WTCCC data. Notably, diseases for which BootRank results in the largest improvements were recently shown to have more heritability than previously thought, likely due to contributions from variants with low minimum allele frequency (MAF, suggesting that BootRank can be beneficial in cases where SNPs affecting the disease are poorly tagged or have low MAF. Overall, our results show that improving disease risk prediction from genotypic information may be a tangible goal, with potential implications for personalized disease screening and treatment.

Discriminative Multi-View Interactive Image Re-Ranking.

Science.gov (United States)

Li, Jun; Xu, Chang; Yang, Wankou; Sun, Changyin; Tao, Dacheng

2017-07-01

Given an unreliable visual patterns and insufficient query information, content-based image retrieval is often suboptimal and requires image re-ranking using auxiliary information. In this paper, we propose a discriminative multi-view interactive image re-ranking (DMINTIR), which integrates user relevance feedback capturing users' intentions and multiple features that sufficiently describe the images. In DMINTIR, heterogeneous property features are incorporated in the multi-view learning scheme to exploit their complementarities. In addition, a discriminatively learned weight vector is obtained to reassign updated scores and target images for re-ranking. Compared with other multi-view learning techniques, our scheme not only generates a compact representation in the latent space from the redundant multi-view features but also maximally preserves the discriminative information in feature encoding by the large-margin principle. Furthermore, the generalization error bound of the proposed algorithm is theoretically analyzed and shown to be improved by the interactions between the latent space and discriminant function learning. Experimental results on two benchmark data sets demonstrate that our approach boosts baseline retrieval quality and is competitive with the other state-of-the-art re-ranking strategies.

Pathways of topological rank analysis (PoTRA): a novel method to detect pathways involved in hepatocellular carcinoma.

Science.gov (United States)

Li, Chaoxing; Liu, Li; Dinu, Valentin

2018-01-01

Complex diseases such as cancer are usually the result of a combination of environmental factors and one or several biological pathways consisting of sets of genes. Each biological pathway exerts its function by delivering signaling through the gene network. Theoretically, a pathway is supposed to have a robust topological structure under normal physiological conditions. However, the pathway's topological structure could be altered under some pathological condition. It is well known that a normal biological network includes a small number of well-connected hub nodes and a large number of nodes that are non-hubs. In addition, it is reported that the loss of connectivity is a common topological trait of cancer networks, which is an assumption of our method. Hence, from normal to cancer, the process of the network losing connectivity might be the process of disrupting the structure of the network, namely, the number of hub genes might be altered in cancer compared to that in normal or the distribution of topological ranks of genes might be altered. Based on this, we propose a new PageRank-based method called Pathways of Topological Rank Analysis (PoTRA) to detect pathways involved in cancer. We use PageRank to measure the relative topological ranks of genes in each biological pathway, then select hub genes for each pathway, and use Fisher's exact test to test if the number of hub genes in each pathway is altered from normal to cancer. Alternatively, if the distribution of topological ranks of gene in a pathway is altered between normal and cancer, this pathway might also be involved in cancer. Hence, we use the Kolmogorov-Smirnov test to detect pathways that have an altered distribution of topological ranks of genes between two phenotypes. We apply PoTRA to study hepatocellular carcinoma (HCC) and several subtypes of HCC. Very interestingly, we discover that all significant pathways in HCC are cancer-associated generally, while several significant pathways in subtypes

On Rank and Nullity

Science.gov (United States)

Dobbs, David E.

2012-01-01

This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

Ranking of patient and surgeons' perspectives for endpoints in randomized controlled trials--lessons learned from the POVATI trial [ISRCTN 60734227].

Science.gov (United States)

Fischer, Lars; Deckert, Andreas; Diener, Markus K; Zimmermann, Johannes B; Büchler, Markus W; Seiler, Christoph M

2011-10-01

Surgical trials focus mainly on mortality and morbidity rates, which may be not the most important endpoints from the patient's perspective. Evaluation of expectations and needs of patients enrolled in clinical trials can be analyzed using a procedure called ranking. Within the Postsurgical Pain Outcome of Vertical and Transverse Abdominal Incision randomized trial (POVATI), the perspectives of participating patients and surgeons were assessed as well as the influence of the surgical intervention on patients' needs. All included patients of the POVATI trial were asked preoperatively and postoperatively to rank predetermined outcome variables concerning the upcoming surgical procedure (e.g., pain, complication, cosmetic result) hierarchically according to their importance. Preoperatively, the surgeons were asked to do the same. One hundred eighty two out of 200 randomized patients (71 females, 111 males; mean age 59 years) returned the ranking questionnaire preoperatively and 152 patients (67 females, 85 males; mean age 60 years) on the day of discharge. There were no differences between the two groups with respect to the distribution of ranking variables (p > 0.05). Thirty-five surgeons (7 residents, 6 fellows, and 22 consultants) completed the same ranking questionnaire. The order of the four most important ranking variables for both patients and surgeons were death, avoiding of postoperative complications, avoiding of intraoperative complications, and pain. Surgeons ranked the variable "cosmetic result" significantly as more important compared to patients (p = 0.034, Fisher's exact test). Patients and surgeons did not differ in ranking predetermined outcomes in the POVATI trial. Only the variable "cosmetic result" is significantly more important from the surgeon's than from the patient's perspective. Ranking of outcomes might be a beneficial tool and can be a proper addition to RCTs.

A Universal Rank-Size Law

Science.gov (United States)

2016-01-01

A mere hyperbolic law, like the Zipf’s law power function, is often inadequate to describe rank-size relationships. An alternative theoretical distribution is proposed based on theoretical physics arguments starting from the Yule-Simon distribution. A modeling is proposed leading to a universal form. A theoretical suggestion for the “best (or optimal) distribution”, is provided through an entropy argument. The ranking of areas through the number of cities in various countries and some sport competition ranking serves for the present illustrations. PMID:27812192

Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination.

Science.gov (United States)

Zhao, Qibin; Zhang, Liqing; Cichocki, Andrzej

2015-09-01

CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful technique for tensor completion through explicitly capturing the multilinear latent factors. The existing CP algorithms require the tensor rank to be manually specified, however, the determination of tensor rank remains a challenging problem especially for CP rank . In addition, existing approaches do not take into account uncertainty information of latent factors, as well as missing entries. To address these issues, we formulate CP factorization using a hierarchical probabilistic model and employ a fully Bayesian treatment by incorporating a sparsity-inducing prior over multiple latent factors and the appropriate hyperpriors over all hyperparameters, resulting in automatic rank determination. To learn the model, we develop an efficient deterministic Bayesian inference algorithm, which scales linearly with data size. Our method is characterized as a tuning parameter-free approach, which can effectively infer underlying multilinear factors with a low-rank constraint, while also providing predictive distributions over missing entries. Extensive simulations on synthetic data illustrate the intrinsic capability of our method to recover the ground-truth of CP rank and prevent the overfitting problem, even when a large amount of entries are missing. Moreover, the results from real-world applications, including image inpainting and facial image synthesis, demonstrate that our method outperforms state-of-the-art approaches for both tensor factorization and tensor completion in terms of predictive performance.

On the ranking of chemicals based on their PBT characteristics: comparison of different ranking methodologies using selected POPs as an illustrative example.

Science.gov (United States)

Sailaukhanuly, Yerbolat; Zhakupbekova, Arai; Amutova, Farida; Carlsen, Lars

2013-01-01

Knowledge of the environmental behavior of chemicals is a fundamental part of the risk assessment process. The present paper discusses various methods of ranking of a series of persistent organic pollutants (POPs) according to the persistence, bioaccumulation and toxicity (PBT) characteristics. Traditionally ranking has been done as an absolute (total) ranking applying various multicriteria data analysis methods like simple additive ranking (SAR) or various utility functions (UFs) based rankings. An attractive alternative to these ranking methodologies appears to be partial order ranking (POR). The present paper compares different ranking methods like SAR, UF and POR. Significant discrepancies between the rankings are noted and it is concluded that partial order ranking, as a method without any pre-assumptions concerning possible relation between the single parameters, appears as the most attractive ranking methodology. In addition to the initial ranking partial order methodology offers a wide variety of analytical tools to elucidate the interplay between the objects to be ranked and the ranking parameters. In the present study is included an analysis of the relative importance of the single P, B and T parameters. Copyright © 2012 Elsevier Ltd. All rights reserved.

A framework for automatic information quality ranking of diabetes websites.

Science.gov (United States)

Belen Sağlam, Rahime; Taskaya Temizel, Tugba

2015-01-01

Objective: When searching for particular medical information on the internet the challenge lies in distinguishing the websites that are relevant to the topic, and contain accurate information. In this article, we propose a framework that automatically identifies and ranks diabetes websites according to their relevance and information quality based on the website content. Design: The proposed framework ranks diabetes websites according to their content quality, relevance and evidence based medicine. The framework combines information retrieval techniques with a lexical resource based on Sentiwordnet making it possible to work with biased and untrusted websites while, at the same time, ensuring the content relevance. Measurement: The evaluation measurements used were Pearson-correlation, true positives, false positives and accuracy. We tested the framework with a benchmark data set consisting of 55 websites with varying degrees of information quality problems. Results: The proposed framework gives good results that are comparable with the non-automated information quality measuring approaches in the literature. The correlation between the results of the proposed automated framework and ground-truth is 0.68 on an average with p < 0.001 which is greater than the other proposed automated methods in the literature (r score in average is 0.33).

Block models and personalized PageRank.

Science.gov (United States)

Kloumann, Isabel M; Ugander, Johan; Kleinberg, Jon

2017-01-03

Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods through the "seed set expansion problem": given a subset [Formula: see text] of nodes from a community of interest in an underlying graph, can we reliably identify the rest of the community? We start from the observation that the most widely used techniques for this problem, personalized PageRank and heat kernel methods, operate in the space of "landing probabilities" of a random walk rooted at the seed set, ranking nodes according to weighted sums of landing probabilities of different length walks. Both schemes, however, lack an a priori relationship to the seed set objective. In this work, we develop a principled framework for evaluating ranking methods by studying seed set expansion applied to the stochastic block model. We derive the optimal gradient for separating the landing probabilities of two classes in a stochastic block model and find, surprisingly, that under reasonable assumptions the gradient is asymptotically equivalent to personalized PageRank for a specific choice of the PageRank parameter [Formula: see text] that depends on the block model parameters. This connection provides a formal motivation for the success of personalized PageRank in seed set expansion and node ranking generally. We use this connection to propose more advanced techniques incorporating higher moments of landing probabilities; our advanced methods exhibit greatly improved performance, despite being simple linear classification rules, and are even competitive with belief propagation.

Fourth-rank gravity and cosmology

International Nuclear Information System (INIS)

Marrakchi, A.L.; Tapia, V.

1992-07-01

We consider the consequences of describing the metric properties of space-time through a quartic line element. The associated ''metric'' is a fourth-rank tensor G μυλπ . In order to recover a Riemannian behaviour of the geometry it is necessary to have G μυλπ = g (μυ g λπ) . We construct a theory for the gravitational field based on the fourth-rank metric G μυλπ . In the absence of matter the fourth-rank metric becomes separable and the theory coincides with General Relativity. In the presence of matter we can maintain Riemmanianicity, but now gravitation couples, as compared to General Relativity, in a different way to matter. We develop a simple cosmological model based on a FRW metric with matter described by a perfect fluid. For the present time the field equations are compatible with k OBS = O and Ω OBS t CLAS approx. 10 20 t PLANCK approx. 10 -23 s. Our final and most important result is the fact that the entropy is an increasing function of time. When interpreted at the light of General Relativity the treatment is shown to be almost equivalent to that of the standard model of cosmology combined with the inflationary scenario. (author). 16 refs, 1 fig

Ranking agricultural, environmental and natural resource economics journals: A note

OpenAIRE

Halkos, George; Tzeremes, Nickolaos

2012-01-01

This paper by applying Data Envelopment Analysis (DEA) ranks for the first time Economics journals in the field of Agricultural, Environmental and Natural Resource. Specifically, by using one composite input and one composite output the paper ranks 32 journals. In addition for the first time three different quality ranking reports have been incorporated to the DEA modelling problem in order to classify the journals into four categories (‘A’ to ‘D’). The results reveal that the journals with t...

Optimizing Search and Ranking in Folksonomy Systems by Exploiting Context Information

Science.gov (United States)

Abel, Fabian; Henze, Nicola; Krause, Daniel

Tagging systems enable users to annotate resources with freely chosen keywords. The evolving bunch of tag assignments is called folksonomy and there exist already some approaches that exploit folksonomies to improve resource retrieval. In this paper, we analyze and compare graph-based ranking algorithms: FolkRank and SocialPageRank. We enhance these algorithms by exploiting the context of tags, and evaluate the results on the GroupMe! dataset. In GroupMe!, users can organize and maintain arbitrary Web resources in self-defined groups. When users annotate resources in GroupMe!, this can be interpreted in context of a certain group. The grouping activity itself is easy for users to perform. However, it delivers valuable semantic information about resources and their context. We present GRank that uses the context information to improve and optimize the detection of relevant search results, and compare different strategies for ranking result lists in folksonomy systems.

Expanding the landscape of N=2 rank 1 SCFTs

International Nuclear Information System (INIS)

Argyres, Philip C.; Lotito, Matteo; Lü, Yongchao; Martone, Mario

2016-01-01

We refine our previous proposal http://arxiv.org/abs/1505.04814http://arxiv.org/abs/1601.00011P. Argyres, M. Lotito, Y. Lü and M. Martone, Geometric constraints on the space of N=2 SCFTs III: enhanced Coulomb branches and central charges, to appear. for systematically classifying 4d rank-1 N=2 SCFTs by constructing their possible Coulomb branch geometries. Four new recently discussed rank-1 theories http://dx.doi.org/10.1007/JHEP03(2016)083http://arxiv.org/abs/1601.02077, including novel N=3 SCFTs, sit beautifully in our refined classification framework. By arguing for the consistency of their RG flows we can make a strong case for the existence of at least four additional rank-1 SCFTs, nearly doubling the number of known rank-1 SCFTs. The refinement consists of relaxing the assumption that the flavor symmetries of the SCFTs have no discrete factors. This results in an enlarged (but finite) set of possible rank-1 SCFTs. Their existence can be further constrained using consistency of their central charges and RG flows.

Toward optimal feature selection using ranking methods and classification algorithms

Directory of Open Access Journals (Sweden)

Novaković Jasmina

2011-01-01

Full Text Available We presented a comparison between several feature ranking methods used on two real datasets. We considered six ranking methods that can be divided into two broad categories: statistical and entropy-based. Four supervised learning algorithms are adopted to build models, namely, IB1, Naive Bayes, C4.5 decision tree and the RBF network. We showed that the selection of ranking methods could be important for classification accuracy. In our experiments, ranking methods with different supervised learning algorithms give quite different results for balanced accuracy. Our cases confirm that, in order to be sure that a subset of features giving the highest accuracy has been selected, the use of many different indices is recommended.

Gene Ranking of RNA-Seq Data via Discriminant Non-Negative Matrix Factorization.

Science.gov (United States)

Jia, Zhilong; Zhang, Xiang; Guan, Naiyang; Bo, Xiaochen; Barnes, Michael R; Luo, Zhigang

2015-01-01

RNA-sequencing is rapidly becoming the method of choice for studying the full complexity of transcriptomes, however with increasing dimensionality, accurate gene ranking is becoming increasingly challenging. This paper proposes an accurate and sensitive gene ranking method that implements discriminant non-negative matrix factorization (DNMF) for RNA-seq data. To the best of our knowledge, this is the first work to explore the utility of DNMF for gene ranking. When incorporating Fisher's discriminant criteria and setting the reduced dimension as two, DNMF learns two factors to approximate the original gene expression data, abstracting the up-regulated or down-regulated metagene by using the sample label information. The first factor denotes all the genes' weights of two metagenes as the additive combination of all genes, while the second learned factor represents the expression values of two metagenes. In the gene ranking stage, all the genes are ranked as a descending sequence according to the differential values of the metagene weights. Leveraging the nature of NMF and Fisher's criterion, DNMF can robustly boost the gene ranking performance. The Area Under the Curve analysis of differential expression analysis on two benchmarking tests of four RNA-seq data sets with similar phenotypes showed that our proposed DNMF-based gene ranking method outperforms other widely used methods. Moreover, the Gene Set Enrichment Analysis also showed DNMF outweighs others. DNMF is also computationally efficient, substantially outperforming all other benchmarked methods. Consequently, we suggest DNMF is an effective method for the analysis of differential gene expression and gene ranking for RNA-seq data.

A Rank-Constrained Matrix Representation for Hypergraph-Based Subspace Clustering

Directory of Open Access Journals (Sweden)

Yubao Sun

2015-01-01

Full Text Available This paper presents a novel, rank-constrained matrix representation combined with hypergraph spectral analysis to enable the recovery of the original subspace structures of corrupted data. Real-world data are frequently corrupted with both sparse error and noise. Our matrix decomposition model separates the low-rank, sparse error, and noise components from the data in order to enhance robustness to the corruption. In order to obtain the desired rank representation of the data within a dictionary, our model directly utilizes rank constraints by restricting the upper bound of the rank range. An alternative projection algorithm is proposed to estimate the low-rank representation and separate the sparse error from the data matrix. To further capture the complex relationship between data distributed in multiple subspaces, we use hypergraph to represent the data by encapsulating multiple related samples into one hyperedge. The final clustering result is obtained by spectral decomposition of the hypergraph Laplacian matrix. Validation experiments on the Extended Yale Face Database B, AR, and Hopkins 155 datasets show that the proposed method is a promising tool for subspace clustering.

PageRank without hyperlinks: reranking with PubMed related article networks for biomedical text retrieval.

Science.gov (United States)

Lin, Jimmy

2008-06-06

Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships from manually-created hyperlinks. We consider the application of these techniques to biomedical text retrieval. In the current PubMed(R) search interface, a MEDLINE(R) citation is connected to a number of related citations, which are in turn connected to other citations. Thus, a MEDLINE record represents a node in a vast content-similarity network. This article explores the hypothesis that these networks can be exploited for text retrieval, in the same manner as hyperlink graphs on the Web. We conducted a number of reranking experiments using the TREC 2005 genomics track test collection in which scores extracted from PageRank and HITS analysis were combined with scores returned by an off-the-shelf retrieval engine. Experiments demonstrate that incorporating PageRank scores yields significant improvements in terms of standard ranked-retrieval metrics. The link structure of content-similarity networks can be exploited to improve the effectiveness of information retrieval systems. These results generalize the applicability of graph analysis algorithms to text retrieval in the biomedical domain.

Comparing classical and quantum PageRanks

Science.gov (United States)

Loke, T.; Tang, J. W.; Rodriguez, J.; Small, M.; Wang, J. B.

2017-01-01

Following recent developments in quantum PageRanking, we present a comparative analysis of discrete-time and continuous-time quantum-walk-based PageRank algorithms. Relative to classical PageRank and to different extents, the quantum measures better highlight secondary hubs and resolve ranking degeneracy among peripheral nodes for all networks we studied in this paper. For the discrete-time case, we investigated the periodic nature of the walker's probability distribution for a wide range of networks and found that the dominant period does not grow with the size of these networks. Based on this observation, we introduce a new quantum measure using the maximum probabilities of the associated walker during the first couple of periods. This is particularly important, since it leads to a quantum PageRanking scheme that is scalable with respect to network size.

Individual wealth rank, community wealth inequality, and self-reported adult poor health: a test of hypotheses with panel data (2002-2006) from native Amazonians, Bolivia.

Science.gov (United States)

Undurraga, Eduardo A; Nyberg, Colleen; Eisenberg, Dan T A; Magvanjav, Oyunbileg; Reyes-García, Victoria; Huanca, Tomás; Leonard, William R; McDade, Thomas W; Tanner, Susan; Vadez, Vincent; Godoy, Ricardo

2010-12-01

Growing evidence suggests that economic inequality in a community harms the health of a person. Using panel data from a small-scale, preindustrial rural society, we test whether individual wealth rank and village wealth inequality affects self-reported poor health in a foraging-farming native Amazonian society. A person's wealth rank was negatively but weakly associated with self-reported morbidity. Each step up/year in the village wealth hierarchy reduced total self-reported days ill by 0.4 percent. The Gini coefficient of village wealth inequality bore a positive association with self-reported poor health that was large in size, but not statistically significant. We found small village wealth inequality, and evidence that individual economic rank did not change. The modest effects may have to do with having used subjective rather than objective measures of health, having small village wealth inequality, and with the possibly true modest effect of a person's wealth rank on health in a small-scale, kin-based society. Finally, we also found that an increase in mean individual wealth by village was related to worse self-reported health. As the Tsimane' integrate into the market economy, their possibilities of wealth accumulation rise, which may affect their well-being. Our work contributes to recent efforts in biocultural anthropology to link the study of social inequalities, human biology, and human-environment interactions.

A Comparison of Three Major Academic Rankings for World Universities: From a Research Evaluation Perspective

Directory of Open Access Journals (Sweden)

Mu-hsuan Huang

2011-06-01

Full Text Available This paper introduces three current major university ranking systems. The Performance Ranking of Scientific Papers for World Universities by Higher Education Evaluation and Accreditation Council of Taiwan (HEEACT Ranking emphasizes both the quality and quantity of research and current research performance. The Academic Ranking of World Universities by Shanghai Jiao Tung University (ARWU focuses on outstanding performance of universities with indicators such as Nobel Prize winners. The QS World University Ranking (2004-2009 by Times Higher Education (THE-QS emphasizes on peer review with high weighting in evaluation. This paper compares the 2009 ranking results from the three ranking systems. Differences exist in the top 20 universities in three ranking systems except the Harvard University, which scored top one in all of the three rankings. Comparisons also revealed that the THE-QS favored UK universities. Further, obvious differences can be observed between THE-QS and the other two rankings when ranking results of some European countries (Germany, UK, Netherlands, & Switzerland and Chinese speaking regions were compared.

Adaptive Game Level Creation through Rank-based Interactive Evolution

DEFF Research Database (Denmark)

Liapis, Antonios; Martínez, Héctor Pérez; Togelius, Julian

2013-01-01

as fitness functions for the optimization of the generated content. The preference models are built via ranking-based preference learning, while the content is generated via evolutionary search. The proposed method is evaluated on the creation of strategy game maps, and its performance is tested using...

Relationship between Particle Size Distribution of Low-Rank Pulverized Coal and Power Plant Performance

Directory of Open Access Journals (Sweden)

Rajive Ganguli

2012-01-01

Full Text Available The impact of particle size distribution (PSD of pulverized, low rank high volatile content Alaska coal on combustion related power plant performance was studied in a series of field scale tests. Performance was gauged through efficiency (ratio of megawatt generated to energy consumed as coal, emissions (SO2, NOx, CO, and carbon content of ash (fly ash and bottom ash. The study revealed that the tested coal could be burned at a grind as coarse as 50% passing 76 microns, with no deleterious impact on power generation and emissions. The PSD’s tested in this study were in the range of 41 to 81 percent passing 76 microns. There was negligible correlation between PSD and the followings factors: efficiency, SO2, NOx, and CO. Additionally, two tests where stack mercury (Hg data was collected, did not demonstrate any real difference in Hg emissions with PSD. The results from the field tests positively impacts pulverized coal power plants that burn low rank high volatile content coals (such as Powder River Basin coal. These plants can potentially reduce in-plant load by grinding the coal less (without impacting plant performance on emissions and efficiency and thereby, increasing their marketability.

Modified Phenomena Identification and Ranking Table (PIRT) for Uncertainty Analysis

International Nuclear Information System (INIS)

Gol-Mohamad, Mohammad P.; Modarres, Mohammad; Mosleh, Ali

2006-01-01

This paper describes a methodology of characterizing important phenomena, which is also part of a broader research by the authors called 'Modified PIRT'. The methodology provides robust process of phenomena identification and ranking process for more precise quantification of uncertainty. It is a two-step process of identifying and ranking methodology based on thermal-hydraulics (TH) importance as well as uncertainty importance. Analytical Hierarchical Process (AHP) has been used for as a formal approach for TH identification and ranking. Formal uncertainty importance technique is used to estimate the degree of credibility of the TH model(s) used to represent the important phenomena. This part uses subjective justification by evaluating available information and data from experiments, and code predictions. The proposed methodology was demonstrated by developing a PIRT for large break loss of coolant accident LBLOCA for the LOFT integral facility with highest core power (test LB-1). (authors)

Bootstrap Determination of the Co-Integration Rank in Heteroskedastic VAR Models

DEFF Research Database (Denmark)

Cavaliere, G.; Rahbek, Anders; Taylor, A.M.R.

2014-01-01

In a recent paper Cavaliere et al. (2012) develop bootstrap implementations of the (pseudo-) likelihood ratio (PLR) co-integration rank test and associated sequential rank determination procedure of Johansen (1996). The bootstrap samples are constructed using the restricted parameter estimates...... of the underlying vector autoregressive (VAR) model which obtain under the reduced rank null hypothesis. They propose methods based on an independent and individual distributed (i.i.d.) bootstrap resampling scheme and establish the validity of their proposed bootstrap procedures in the context of a co......-integrated VAR model with i.i.d. innovations. In this paper we investigate the properties of their bootstrap procedures, together with analogous procedures based on a wild bootstrap resampling scheme, when time-varying behavior is present in either the conditional or unconditional variance of the innovations. We...

Interindividual testing of water-soluble oral contrast media in respect of diagnostic ranking, side effects and taste

International Nuclear Information System (INIS)

Staebler, A.; Fink, U.; Siuda, S.; Neville, S.

1989-01-01

Three groups of patients (n = 55, 52 and 54) were examined with the X-ray contrast media Gastrografin, Peritrast-Oral GI, and Telebrix Gastro to assess the diagnostic ranking, side effects and taste of watersoluble oral contrast media. No significant differences were seen in respect of diagnostic ranking and side effects. Side effects were exclusively abdominal symptoms; there was no difference with regard to laxative action. Telebrix Gastroas accepted significantly better in respect of taste than Gastrografin and Peritrast-Oral GI. (orig.) [de

The Influence of Wealth, Transparency, and Democracy on the Number of Top Ranked Universities

Science.gov (United States)

Jabnoun, Naceur

2015-01-01

Purpose: This paper aims to explore the influence of wealth, transparency and democracy on the number of universities per million people ranked among the top 300 and 500. The highly ranked universities in the world tend to be concentrated in a few countries. Design/Methodology/Approach: ANOVA was used to test the differences between the two groups…

Contests with rank-order spillovers

NARCIS (Netherlands)

M.R. Baye (Michael); D. Kovenock (Dan); C.G. de Vries (Casper)

2012-01-01

textabstractThis paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine "spillover" effects that depend on the rank-order of her

Rank distributions: A panoramic macroscopic outlook

Science.gov (United States)

Eliazar, Iddo I.; Cohen, Morrel H.

2014-01-01

This paper presents a panoramic macroscopic outlook of rank distributions. We establish a general framework for the analysis of rank distributions, which classifies them into five macroscopic "socioeconomic" states: monarchy, oligarchy-feudalism, criticality, socialism-capitalism, and communism. Oligarchy-feudalism is shown to be characterized by discrete macroscopic rank distributions, and socialism-capitalism is shown to be characterized by continuous macroscopic size distributions. Criticality is a transition state between oligarchy-feudalism and socialism-capitalism, which can manifest allometric scaling with multifractal spectra. Monarchy and communism are extreme forms of oligarchy-feudalism and socialism-capitalism, respectively, in which the intrinsic randomness vanishes. The general framework is applied to three different models of rank distributions—top-down, bottom-up, and global—and unveils each model's macroscopic universality and versatility. The global model yields a macroscopic classification of the generalized Zipf law, an omnipresent form of rank distributions observed across the sciences. An amalgamation of the three models establishes a universal rank-distribution explanation for the macroscopic emergence of a prevalent class of continuous size distributions, ones governed by unimodal densities with both Pareto and inverse-Pareto power-law tails.

A rank based social norms model of how people judge their levels of drunkenness whilst intoxicated

Directory of Open Access Journals (Sweden)

Simon C. Moore

2016-09-01

Full Text Available Abstract Background A rank based social norms model predicts that drinkers’ judgements about their drinking will be based on the rank of their breath alcohol level amongst that of others in the immediate environment, rather than their actual breath alcohol level, with lower relative rank associated with greater feelings of safety. This study tested this hypothesis and examined how people judge their levels of drunkenness and the health consequences of their drinking whilst they are intoxicated in social drinking environments. Methods Breath alcohol testing of 1,862 people (mean age = 26.96 years; 61.86 % male in drinking environments. A subset (N = 400 also answered four questions asking about their perceptions of their drunkenness and the health consequences of their drinking (plus background measures. Results Perceptions of drunkenness and the health consequences of drinking were regressed on: (a breath alcohol level, (b the rank of the breath alcohol level amongst that of others in the same environment, and (c covariates. Only rank of breath alcohol level predicted perceptions: How drunk they felt (b 3.78, 95 % CI 1.69 5.87, how extreme they regarded their drinking that night (b 3.7, 95 % CI 1.3 6.20, how at risk their long-term health was due to their current level of drinking (b 4.1, 95 % CI 0.2 8.0 and how likely they felt they would experience liver cirrhosis (b 4.8. 95 % CI 0.7 8.8. People were more influenced by more sober others than by more drunk others. Conclusion Whilst intoxicated and in drinking environments, people base judgements regarding their drinking on how their level of intoxication ranks relative to that of others of the same gender around them, not on their actual levels of intoxication. Thus, when in the company of others who are intoxicated, drinkers were found to be more likely to underestimate their own level of drinking, drunkenness and associated risks. The implications of these results, for example

Ranking as parameter estimation

Czech Academy of Sciences Publication Activity Database

Kárný, Miroslav; Guy, Tatiana Valentine

2009-01-01

Roč. 4, č. 2 (2009), s. 142-158 ISSN 1745-7645 R&D Projects: GA MŠk 2C06001; GA AV ČR 1ET100750401; GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : ranking * Bayesian estimation * negotiation * modelling Subject RIV: BB - Applied Statistics, Operational Research http://library.utia.cas.cz/separaty/2009/AS/karny- ranking as parameter estimation.pdf

Simpson's Paradox and Confounding Factors in University Rankings: A Demonstration Using QS 2011-12 Data

Science.gov (United States)

Soh, Kay Cheng

2012-01-01

University ranking has become ritualistic in higher education. Ranking results are taken as bona fide by rank users. Ranking systems usually use large data sets from highly heterogeneous universities of varied backgrounds. This poses the problem of Simpson's Paradox and the lurking variables causing it. Using QS 2011-2012 Ranking data, the dual…

Fractional cointegration rank estimation

DEFF Research Database (Denmark)

Lasak, Katarzyna; Velasco, Carlos

the parameters of the model under the null hypothesis of the cointegration rank r = 1, 2, ..., p-1. This step provides consistent estimates of the cointegration degree, the cointegration vectors, the speed of adjustment to the equilibrium parameters and the common trends. In the second step we carry out a sup......-likelihood ratio test of no-cointegration on the estimated p - r common trends that are not cointegrated under the null. The cointegration degree is re-estimated in the second step to allow for new cointegration relationships with different memory. We augment the error correction model in the second step...... to control for stochastic trend estimation effects from the first step. The critical values of the tests proposed depend only on the number of common trends under the null, p - r, and on the interval of the cointegration degrees b allowed, but not on the true cointegration degree b0. Hence, no additional...

Rank-Constrained Beamforming for MIMO Cognitive Interference Channel

Directory of Open Access Journals (Sweden)

Duoying Zhang

2016-01-01

Full Text Available This paper considers the spectrum sharing multiple-input multiple-output (MIMO cognitive interference channel, in which multiple primary users (PUs coexist with multiple secondary users (SUs. Interference alignment (IA approach is introduced that guarantees that secondary users access the licensed spectrum without causing harmful interference to the PUs. A rank-constrained beamforming design is proposed where the rank of the interferences and the desired signals is concerned. The standard interferences metric for the primary link, that is, interference temperature, is investigated and redesigned. The work provides a further improvement that optimizes the dimension of the interferences in the cognitive interference channel, instead of the power of the interference leakage. Due to the nonconvexity of the rank, the developed optimization problems are further approximated as convex form and are solved via choosing the transmitter precoder and receiver subspace iteratively. Numerical results show that the proposed designs can improve the achievable degree of freedom (DoF of the primary links and provide the considerable sum rate for both secondary and primary transmissions under the rank constraints.

Intensity rankings of plyometric exercises using joint power absorption.

Science.gov (United States)

Van Lieshout, Kathryn G; Anderson, Joy G; Shelburne, Kevin B; Davidson, Bradley S

2014-09-01

Athletic trainers and physical therapists often progress patients through rehabilitation by selecting plyometric exercises of increasing intensity in preparation for return to sport. The purpose of this study was to quantify the intensity of seven plyometric movements commonly used in lower-extremity rehabilitation by joint-specific peak power absorption and the sum of the peak power. Ten collegiate athletes performed submaximal plyometric exercises in a single test session: vertical jump, forward jump, backward jump, box drop, box jump up, tuck jump, and depth jump. Three-dimensional kinematics and force platform data were collected to generate joint kinetics. Peak power absorption normalized to body mass was calculated at the ankle, knee, and hip, and averaged across repetitions. Joint peak power data were pooled across athletes and summed to obtain the sum of peak power. Movements were ranked from 1 (low) to 7 (high) based on the sum of peak power and joint peak power (ankle, knee, hip). The sum of peak power did not correspond with standard low, medium, and high subjective intensity ratings or joint peak power in all joints. Mixed model analyses revealed significant variance between the sum of peak power and joint peak power ranks in the forward jump, backward jump, box drop, and depth jump (P<0.05), but not in the vertical jump, box jump up, and tuck jump. Results provide intensity rankings that can be used directly by athletic trainers and physical therapists in developing protocols for rehabilitation specific to the injured joint. Copyright © 2014 Elsevier Ltd. All rights reserved.

Predictive-property-ranked variable reduction in partial least squares modelling with final complexity adapted models: comparison of properties for ranking.

Science.gov (United States)

Andries, Jan P M; Vander Heyden, Yvan; Buydens, Lutgarde M C

2013-01-14

The calibration performance of partial least squares regression for one response (PLS1) can be improved by eliminating uninformative variables. Many variable-reduction methods are based on so-called predictor-variable properties or predictive properties, which are functions of various PLS-model parameters, and which may change during the steps of the variable-reduction process. Recently, a new predictive-property-ranked variable reduction method with final complexity adapted models, denoted as PPRVR-FCAM or simply FCAM, was introduced. It is a backward variable elimination method applied on the predictive-property-ranked variables. The variable number is first reduced, with constant PLS1 model complexity A, until A variables remain, followed by a further decrease in PLS complexity, allowing the final selection of small numbers of variables. In this study for three data sets the utility and effectiveness of six individual and nine combined predictor-variable properties are investigated, when used in the FCAM method. The individual properties include the absolute value of the PLS1 regression coefficient (REG), the significance of the PLS1 regression coefficient (SIG), the norm of the loading weight (NLW) vector, the variable importance in the projection (VIP), the selectivity ratio (SR), and the squared correlation coefficient of a predictor variable with the response y (COR). The selective and predictive performances of the models resulting from the use of these properties are statistically compared using the one-tailed Wilcoxon signed rank test. The results indicate that the models, resulting from variable reduction with the FCAM method, using individual or combined properties, have similar or better predictive abilities than the full spectrum models. After mean-centring of the data, REG and SIG, provide low numbers of informative variables, with a meaning relevant to the response, and lower than the other individual properties, while the predictive abilities are

Canonical correlation analysis of professional stress,social support,and professional burnout among low-rank army officers

Directory of Open Access Journals (Sweden)

Chuan-yun LI

2011-12-01

Full Text Available Objective The present study investigates the influence of professional stress and social support on professional burnout among low-rank army officers.Methods The professional stress,social support,and professional burnout scales among low-rank army officers were used as test tools.Moreover,the officers of established units(battalion,company,and platoon were chosen as test subjects.Out of the 260 scales sent,226 effective scales were received.The descriptive statistic and canonical correlation analysis models were used to analyze the influence of each variable.Results The scores of low-rank army officers in the professional stress,social support,and professional burnout scales were more than average,except on two factors,namely,interpersonal support and de-individualization.The canonical analysis identified three groups of canonical correlation factors,of which two were up to a significant level(P < 0.001.After further eliminating the social support variable,the canonical correlation analysis of professional stress and burnout showed that the canonical correlation coefficients P corresponding to 1 and 2 were 0.62 and 0.36,respectively,and were up to a very significant level(P < 0.001.Conclusion The low-rank army officers experience higher professional stress and burnout levels,showing a lower sense of accomplishment,emotional exhaustion,and more serious depersonalization.However,social support can reduce the onset and seriousness of professional burnout among these officers by lessening pressure factors,such as career development,work features,salary conditions,and other personal factors.

Ranking stability and super-stable nodes in complex networks.

Science.gov (United States)

Ghoshal, Gourab; Barabási, Albert-László

2011-07-19

Pagerank, a network-based diffusion algorithm, has emerged as the leading method to rank web content, ecological species and even scientists. Despite its wide use, it remains unknown how the structure of the network on which it operates affects its performance. Here we show that for random networks the ranking provided by pagerank is sensitive to perturbations in the network topology, making it unreliable for incomplete or noisy systems. In contrast, in scale-free networks we predict analytically the emergence of super-stable nodes whose ranking is exceptionally stable to perturbations. We calculate the dependence of the number of super-stable nodes on network characteristics and demonstrate their presence in real networks, in agreement with the analytical predictions. These results not only deepen our understanding of the interplay between network topology and dynamical processes but also have implications in all areas where ranking has a role, from science to marketing.

Diffusion of scientific credits and the ranking of scientists

Science.gov (United States)

Radicchi, Filippo; Fortunato, Santo; Markines, Benjamin; Vespignani, Alessandro

2009-11-01

Recently, the abundance of digital data is enabling the implementation of graph-based ranking algorithms that provide system level analysis for ranking publications and authors. Here, we take advantage of the entire Physical Review publication archive (1893-2006) to construct authors’ networks where weighted edges, as measured from opportunely normalized citation counts, define a proxy for the mechanism of scientific credit transfer. On this network, we define a ranking method based on a diffusion algorithm that mimics the spreading of scientific credits on the network. We compare the results obtained with our algorithm with those obtained by local measures such as the citation count and provide a statistical analysis of the assignment of major career awards in the area of physics. A website where the algorithm is made available to perform customized rank analysis can be found at the address http://www.physauthorsrank.org.

Optimization of the two-sample rank Neyman-Pearson detector

Science.gov (United States)

Akimov, P. S.; Barashkov, V. M.

1984-10-01

The development of optimal algorithms concerned with rank considerations in the case of finite sample sizes involves considerable mathematical difficulties. The present investigation provides results related to the design and the analysis of an optimal rank detector based on a utilization of the Neyman-Pearson criteria. The detection of a signal in the presence of background noise is considered, taking into account n observations (readings) x1, x2, ... xn in the experimental communications channel. The computation of the value of the rank of an observation is calculated on the basis of relations between x and the variable y, representing interference. Attention is given to conditions in the absence of a signal, the probability of the detection of an arriving signal, details regarding the utilization of the Neyman-Pearson criteria, the scheme of an optimal rank, multichannel, incoherent detector, and an analysis of the detector.

A practical sensitivity analysis method for ranking sources of uncertainty in thermal–hydraulics applications

Energy Technology Data Exchange (ETDEWEB)

Pourgol-Mohammad, Mohammad, E-mail: pourgolmohammad@sut.ac.ir [Department of Mechanical Engineering, Sahand University of Technology, Tabriz (Iran, Islamic Republic of); Hoseyni, Seyed Mohsen [Department of Basic Sciences, East Tehran Branch, Islamic Azad University, Tehran (Iran, Islamic Republic of); Hoseyni, Seyed Mojtaba [Building & Housing Research Center, Tehran (Iran, Islamic Republic of); Sepanloo, Kamran [Nuclear Science and Technology Research Institute, Tehran (Iran, Islamic Republic of)

2016-08-15

Highlights: • Existing uncertainty ranking methods prove inconsistent for TH applications. • Introduction of a new method for ranking sources of uncertainty in TH codes. • Modified PIRT qualitatively identifies and ranks uncertainty sources more precisely. • The importance of parameters is calculated by a limited number of TH code executions. • Methodology is applied successfully on LOFT-LB1 test facility. - Abstract: In application to thermal–hydraulic calculations by system codes, sensitivity analysis plays an important role for managing the uncertainties of code output and risk analysis. Sensitivity analysis is also used to confirm the results of qualitative Phenomena Identification and Ranking Table (PIRT). Several methodologies have been developed to address uncertainty importance assessment. Generally, uncertainty importance measures, mainly devised for the Probabilistic Risk Assessment (PRA) applications, are not affordable for computationally demanding calculations of the complex thermal–hydraulics (TH) system codes. In other words, for effective quantification of the degree of the contribution of each phenomenon to the total uncertainty of the output, a practical approach is needed by considering high computational burden of TH calculations. This study aims primarily to show the inefficiency of the existing approaches and then introduces a solution to cope with the challenges in this area by modification of variance-based uncertainty importance method. Important parameters are identified by the modified PIRT approach qualitatively then their uncertainty importance is quantified by a local derivative index. The proposed index is attractive from its practicality point of view on TH applications. It is capable of calculating the importance of parameters by a limited number of TH code executions. Application of the proposed methodology is demonstrated on LOFT-LB1 test facility.

A practical sensitivity analysis method for ranking sources of uncertainty in thermal–hydraulics applications

International Nuclear Information System (INIS)

Pourgol-Mohammad, Mohammad; Hoseyni, Seyed Mohsen; Hoseyni, Seyed Mojtaba; Sepanloo, Kamran

2016-01-01

Highlights: • Existing uncertainty ranking methods prove inconsistent for TH applications. • Introduction of a new method for ranking sources of uncertainty in TH codes. • Modified PIRT qualitatively identifies and ranks uncertainty sources more precisely. • The importance of parameters is calculated by a limited number of TH code executions. • Methodology is applied successfully on LOFT-LB1 test facility. - Abstract: In application to thermal–hydraulic calculations by system codes, sensitivity analysis plays an important role for managing the uncertainties of code output and risk analysis. Sensitivity analysis is also used to confirm the results of qualitative Phenomena Identification and Ranking Table (PIRT). Several methodologies have been developed to address uncertainty importance assessment. Generally, uncertainty importance measures, mainly devised for the Probabilistic Risk Assessment (PRA) applications, are not affordable for computationally demanding calculations of the complex thermal–hydraulics (TH) system codes. In other words, for effective quantification of the degree of the contribution of each phenomenon to the total uncertainty of the output, a practical approach is needed by considering high computational burden of TH calculations. This study aims primarily to show the inefficiency of the existing approaches and then introduces a solution to cope with the challenges in this area by modification of variance-based uncertainty importance method. Important parameters are identified by the modified PIRT approach qualitatively then their uncertainty importance is quantified by a local derivative index. The proposed index is attractive from its practicality point of view on TH applications. It is capable of calculating the importance of parameters by a limited number of TH code executions. Application of the proposed methodology is demonstrated on LOFT-LB1 test facility.

GeneRank: using search engine technology for the analysis of microarray experiments.

Science.gov (United States)

Morrison, Julie L; Breitling, Rainer; Higham, Desmond J; Gilbert, David R

2005-09-21

Interpretation of simple microarray experiments is usually based on the fold-change of gene expression between a reference and a "treated" sample where the treatment can be of many types from drug exposure to genetic variation. Interpretation of the results usually combines lists of differentially expressed genes with previous knowledge about their biological function. Here we evaluate a method--based on the PageRank algorithm employed by the popular search engine Google--that tries to automate some of this procedure to generate prioritized gene lists by exploiting biological background information. GeneRank is an intuitive modification of PageRank that maintains many of its mathematical properties. It combines gene expression information with a network structure derived from gene annotations (gene ontologies) or expression profile correlations. Using both simulated and real data we find that the algorithm offers an improved ranking of genes compared to pure expression change rankings. Our modification of the PageRank algorithm provides an alternative method of evaluating microarray experimental results which combines prior knowledge about the underlying network. GeneRank offers an improvement compared to assessing the importance of a gene based on its experimentally observed fold-change alone and may be used as a basis for further analytical developments.

Propuesta de rankings de universidades españolas en redes sociales

OpenAIRE

Zarco, Carmen (UNIR); Del-Barrio-García, Salvador; Córdon, Óscar

2016-01-01

University rankings have become popular tools to evaluate the results of academic institutions. The existing proposals of rankings of universities in Spain, based on social networking sites, show some limitations related to their lack of coverage, their specificity, and their lack of transparency in the ranking definition. The goal of this work is to introduce a general design framework for coherent classifications to analyze the impact of all Spanish universities, both public and private, in...

University Rankings: How Well Do They Measure Library Service Quality?

Science.gov (United States)

Jackson, Brian

2015-01-01

University rankings play an increasingly large role in shaping the goals of academic institutions and departments, while removing universities themselves from the evaluation process. This study compares the library-related results of two university ranking publications with scores on the LibQUAL+™ survey to identify if library service quality--as…

Journal Rankings by Health Management Faculty Members: Are There Differences by Rank, Leadership Status, or Area of Expertise?

Science.gov (United States)

Menachemi, Nir; Hogan, Tory H; DelliFraine, Jami L

2015-01-01

Health administration (HA) faculty members publish in a variety of journals, including journals focused on management, economics, policy, and information technology. HA faculty members are evaluated on the basis of the quality and quantity of their journal publications. However, it is unclear how perceptions of these journals vary by subdiscipline, department leadership role, or faculty rank. It is also not clear how perceptions of journals may have changed over the past decade since the last evaluation of journal rankings in the field was published. The purpose of the current study is to examine how respondents rank journals in the field of HA, as well as the variation in perception by academic rank, department leadership status, and area of expertise. Data were drawn from a survey of HA faculty members at U.S. universities, which was completed in 2012. Different journal ranking patterns were noted for faculty members of different subdisciplines. The health management-oriented journals (Health Care Management Review and Journal of Healthcare Management) were ranked higher than in previous research, suggesting that journal ranking perceptions may have changed over the intervening decade. Few differences in perceptions were noted by academic rank, but we found that department chairs were more likely than others to select Health Affairs in their top three most prestigious journals (β = 0.768; p journal prestige varied between a department chair and untenured faculty in different disciplines, and this perceived difference could have implications for promotion and tenure decisions.

Algebraic and computational aspects of real tensor ranks

CERN Document Server

Sakata, Toshio; Miyazaki, Mitsuhiro

2016-01-01

This book provides comprehensive summaries of theoretical (algebraic) and computational aspects of tensor ranks, maximal ranks, and typical ranks, over the real number field. Although tensor ranks have been often argued in the complex number field, it should be emphasized that this book treats real tensor ranks, which have direct applications in statistics. The book provides several interesting ideas, including determinant polynomials, determinantal ideals, absolutely nonsingular tensors, absolutely full column rank tensors, and their connection to bilinear maps and Hurwitz-Radon numbers. In addition to reviews of methods to determine real tensor ranks in details, global theories such as the Jacobian method are also reviewed in details. The book includes as well an accessible and comprehensive introduction of mathematical backgrounds, with basics of positive polynomials and calculations by using the Groebner basis. Furthermore, this book provides insights into numerical methods of finding tensor ranks through...

Cell adhesion signaling regulates RANK expression in osteoclast precursors.

Directory of Open Access Journals (Sweden)

Ayako Mochizuki

-adherent condition. These results suggest that cell adhesion signaling regulates RANK expression in osteoclast precursors.

A new mutually reinforcing network node and link ranking algorithm.

Science.gov (United States)

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E

2015-10-23

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.

A new mutually reinforcing network node and link ranking algorithm

Science.gov (United States)

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-10-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.

A new mutually reinforcing network node and link ranking algorithm

Science.gov (United States)

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-01-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity. PMID:26492958

Ranking benchmarks of top 100 players in men's professional tennis.

Science.gov (United States)

Reid, Machar; Morris, Craig

2013-01-01

In men's professional tennis, players aspire to hold the top ranking position. On the way to the top spot, reaching the top 100 can be seen as a significant career milestone. National Federations undertake extensive efforts to assist their players to reach the top 100. However, objective data considering reasonable ranking yardsticks for top 100 success in men's professional tennis are lacking. Therefore, it is difficult for National Federations and those involved in player development to give empirical programming advice to young players. By taking a closer look at the ranking history of professional male tennis players, this article tries to provide those involved in player development a more objective basis for decision-making. The 100 names, countries, birthdates and ranking histories of the top 100 players listed in the Association of Tennis Professionals (ATP) at 31 December 2009 were recorded from websites in the public domain. Descriptive statistics were reported for the ranking milestones of interest. Results confirmed the merits of the International Tennis Federation's junior tour with 91% of the top 100 professionals earning a junior ranking, the mean peak of which was 94.1, s=148.9. On average, top 100 professionals achieved their best junior rankings and earned their first ATP point at similar ages, suggesting that players compete on both the junior and professional tours during their transition. Once professionally ranked, players took an average 4.5, s=2.1 years to reach the ATP top 100 at the mean age of 21.5, s=2.6 years, which contrasts with the mean current age of the top 100 of 26.8, s=3.2. The best professional rankings of players born in 1982 or earlier were positively related to the ages at which players earned their first ATP point and then entered the top 100, suggesting that the ages associated with these ranking milestones may have some forecasting potential. Future work should focus on the change in top 100 demographics over time as well

Discrepancies between multicriteria decision analysis-based ranking and intuitive ranking for pharmaceutical benefit-risk profiles in a hypothetical setting.

Science.gov (United States)

Hoshikawa, K; Ono, S

2017-02-01

Multicriteria decision analysis (MCDA) has been generally considered a promising decision-making methodology for the assessment of drug benefit-risk profiles. There have been many discussions in both public and private sectors on its feasibility and applicability, but it has not been employed in official decision-makings. For the purpose of examining to what extent MCDA would reflect the first-hand, intuitive preference of evaluators in practical pharmaceutical assessments, we conducted a questionnaire survey involving the participation of employees of pharmaceutical companies. Showing profiles of the efficacy and safety of four hypothetical drugs, each respondent was asked to rank them following the standard MCDA process and then to rank them intuitively (i.e. without applying any analytical framework). These two approaches resulted in substantially different ranking patterns from the same individuals, and the concordance rate was surprisingly low (17%). Although many respondents intuitively showed a preference for mild, balanced risk-benefit profiles over profiles with a conspicuous advantage in either risk or benefit, the ranking orders based on MCDA scores did not reflect the intuitive preference. Observed discrepancies between the rankings seemed to be primarily attributed to the structural characteristics of MCDA, which assumes that evaluation on each benefit and risk component should have monotonic impact on final scores. It would be difficult for MCDA to reflect commonly observed non-monotonic preferences for risk and benefit profiles. Possible drawbacks of MCDA should be further investigated prior to the real-world application of its benefit-risk assessment. © 2016 John Wiley & Sons Ltd.

Linear Subspace Ranking Hashing for Cross-Modal Retrieval.

Science.gov (United States)

Li, Kai; Qi, Guo-Jun; Ye, Jun; Hua, Kien A

2017-09-01

Hashing has attracted a great deal of research in recent years due to its effectiveness for the retrieval and indexing of large-scale high-dimensional multimedia data. In this paper, we propose a novel ranking-based hashing framework that maps data from different modalities into a common Hamming space where the cross-modal similarity can be measured using Hamming distance. Unlike existing cross-modal hashing algorithms where the learned hash functions are binary space partitioning functions, such as the sign and threshold function, the proposed hashing scheme takes advantage of a new class of hash functions closely related to rank correlation measures which are known to be scale-invariant, numerically stable, and highly nonlinear. Specifically, we jointly learn two groups of linear subspaces, one for each modality, so that features' ranking orders in different linear subspaces maximally preserve the cross-modal similarities. We show that the ranking-based hash function has a natural probabilistic approximation which transforms the original highly discontinuous optimization problem into one that can be efficiently solved using simple gradient descent algorithms. The proposed hashing framework is also flexible in the sense that the optimization procedures are not tied up to any specific form of loss function, which is typical for existing cross-modal hashing methods, but rather we can flexibly accommodate different loss functions with minimal changes to the learning steps. We demonstrate through extensive experiments on four widely-used real-world multimodal datasets that the proposed cross-modal hashing method can achieve competitive performance against several state-of-the-arts with only moderate training and testing time.

About the use of rank transformation in sensitivity analysis of model output

International Nuclear Information System (INIS)

Saltelli, Andrea; Sobol', Ilya M

1995-01-01

Rank transformations are frequently employed in numerical experiments involving a computational model, especially in the context of sensitivity and uncertainty analyses. Response surface replacement and parameter screening are tasks which may benefit from a rank transformation. Ranks can cope with nonlinear (albeit monotonic) input-output distributions, allowing the use of linear regression techniques. Rank transformed statistics are more robust, and provide a useful solution in the presence of long tailed input and output distributions. As is known to practitioners, care must be employed when interpreting the results of such analyses, as any conclusion drawn using ranks does not translate easily to the original model. In the present note an heuristic approach is taken, to explore, by way of practical examples, the effect of a rank transformation on the outcome of a sensitivity analysis. An attempt is made to identify trends, and to correlate these effects to a model taxonomy. Employing sensitivity indices, whereby the total variance of the model output is decomposed into a sum of terms of increasing dimensionality, we show that the main effect of the rank transformation is to increase the relative weight of the first order terms (the 'main effects'), at the expense of the 'interactions' and 'higher order interactions'. As a result the influence of those parameters which influence the output mostly by way of interactions may be overlooked in an analysis based on the ranks. This difficulty increases with the dimensionality of the problem, and may lead to the failure of a rank based sensitivity analysis. We suggest that the models can be ranked, with respect to the complexity of their input-output relationship, by mean of an 'Association' index I y . I y may complement the usual model coefficient of determination R y 2 as a measure of model complexity for the purpose of uncertainty and sensitivity analysis

Augmenting the Deliberative Method for Ranking Risks.

Science.gov (United States)

Susel, Irving; Lasley, Trace; Montezemolo, Mark; Piper, Joel

2016-01-01

The Department of Homeland Security (DHS) characterized and prioritized the physical cross-border threats and hazards to the nation stemming from terrorism, market-driven illicit flows of people and goods (illegal immigration, narcotics, funds, counterfeits, and weaponry), and other nonmarket concerns (movement of diseases, pests, and invasive species). These threats and hazards pose a wide diversity of consequences with very different combinations of magnitudes and likelihoods, making it very challenging to prioritize them. This article presents the approach that was used at DHS to arrive at a consensus regarding the threats and hazards that stand out from the rest based on the overall risk they pose. Due to time constraints for the decision analysis, it was not feasible to apply multiattribute methodologies like multiattribute utility theory or the analytic hierarchy process. Using a holistic approach was considered, such as the deliberative method for ranking risks first published in this journal. However, an ordinal ranking alone does not indicate relative or absolute magnitude differences among the risks. Therefore, the use of the deliberative method for ranking risks is not sufficient for deciding whether there is a material difference between the top-ranked and bottom-ranked risks, let alone deciding what the stand-out risks are. To address this limitation of ordinal rankings, the deliberative method for ranking risks was augmented by adding an additional step to transform the ordinal ranking into a ratio scale ranking. This additional step enabled the selection of stand-out risks to help prioritize further analysis. © 2015 Society for Risk Analysis.

Advances in ranking and selection, multiple comparisons, and reliability methodology and applications

CERN Document Server

Balakrishnan, N; Nagaraja, HN

2007-01-01

S. Panchapakesan has made significant contributions to ranking and selection and has published in many other areas of statistics, including order statistics, reliability theory, stochastic inequalities, and inference. Written in his honor, the twenty invited articles in this volume reflect recent advances in these areas and form a tribute to Panchapakesan's influence and impact on these areas. Thematically organized, the chapters cover a broad range of topics from: Inference; Ranking and Selection; Multiple Comparisons and Tests; Agreement Assessment; Reliability; and Biostatistics. Featuring

Knockouts of high-ranking males have limited impact on baboon social networks.

Science.gov (United States)

Franz, Mathias; Altmann, Jeanne; Alberts, Susan C

Social network structures can crucially impact complex social processes such as collective behaviour or the transmission of information and diseases. However, currently it is poorly understood how social networks change over time. Previous studies on primates suggest that `knockouts' (due to death or dispersal) of high-ranking individuals might be important drivers for structural changes in animal social networks. Here we test this hypothesis using long-term data on a natural population of baboons, examining the effects of 29 natural knockouts of alpha or beta males on adult female social networks. We investigated whether and how knockouts affected (1) changes in grooming and association rates among adult females, and (2) changes in mean degree and global clustering coefficient in these networks. The only significant effect that we found was a decrease in mean degree in grooming networks in the first month after knockouts, but this decrease was rather small, and grooming networks rebounded to baseline levels by the second month after knockouts. Taken together our results indicate that the removal of high-ranking males has only limited or no lasting effects on social networks of adult female baboons. This finding calls into question the hypothesis that the removal of high-ranking individuals has a destabilizing effect on social network structures in social animals.

QV modal distance displacement - a criterion for contingency ranking

Energy Technology Data Exchange (ETDEWEB)

Rios, M.A.; Sanchez, J.L.; Zapata, C.J. [Universidad de Los Andes (Colombia). Dept. of Electrical Engineering], Emails: mrios@uniandes.edu.co, josesan@uniandes.edu.co, cjzapata@utp.edu.co

2009-07-01

This paper proposes a new methodology using concepts of fast decoupled load flow, modal analysis and ranking of contingencies, where the impact of each contingency is measured hourly taking into account the influence of each contingency over the mathematical model of the system, i.e. the Jacobian Matrix. This method computes the displacement of the reduced Jacobian Matrix eigenvalues used in voltage stability analysis, as a criterion of contingency ranking, considering the fact that the lowest eigenvalue in the normal operation condition is not the same lowest eigenvalue in N-1 contingency condition. It is made using all branches in the system and specific branches according to the IBPF index. The test system used is the IEEE 118 nodes. (author)

Pathways of topological rank analysis (PoTRA: a novel method to detect pathways involved in hepatocellular carcinoma

Directory of Open Access Journals (Sweden)

Chaoxing Li

2018-04-01

Full Text Available Complex diseases such as cancer are usually the result of a combination of environmental factors and one or several biological pathways consisting of sets of genes. Each biological pathway exerts its function by delivering signaling through the gene network. Theoretically, a pathway is supposed to have a robust topological structure under normal physiological conditions. However, the pathway’s topological structure could be altered under some pathological condition. It is well known that a normal biological network includes a small number of well-connected hub nodes and a large number of nodes that are non-hubs. In addition, it is reported that the loss of connectivity is a common topological trait of cancer networks, which is an assumption of our method. Hence, from normal to cancer, the process of the network losing connectivity might be the process of disrupting the structure of the network, namely, the number of hub genes might be altered in cancer compared to that in normal or the distribution of topological ranks of genes might be altered. Based on this, we propose a new PageRank-based method called Pathways of Topological Rank Analysis (PoTRA to detect pathways involved in cancer. We use PageRank to measure the relative topological ranks of genes in each biological pathway, then select hub genes for each pathway, and use Fisher’s exact test to test if the number of hub genes in each pathway is altered from normal to cancer. Alternatively, if the distribution of topological ranks of gene in a pathway is altered between normal and cancer, this pathway might also be involved in cancer. Hence, we use the Kolmogorov–Smirnov test to detect pathways that have an altered distribution of topological ranks of genes between two phenotypes. We apply PoTRA to study hepatocellular carcinoma (HCC and several subtypes of HCC. Very interestingly, we discover that all significant pathways in HCC are cancer-associated generally, while several

Ranking network of a captive rhesus macaque society: a sophisticated corporative kingdom.

Science.gov (United States)

Fushing, Hsieh; McAssey, Michael P; Beisner, Brianne; McCowan, Brenda

2011-03-15

We develop a three-step computing approach to explore a hierarchical ranking network for a society of captive rhesus macaques. The computed network is sufficiently informative to address the question: Is the ranking network for a rhesus macaque society more like a kingdom or a corporation? Our computations are based on a three-step approach. These steps are devised to deal with the tremendous challenges stemming from the transitivity of dominance as a necessary constraint on the ranking relations among all individual macaques, and the very high sampling heterogeneity in the behavioral conflict data. The first step simultaneously infers the ranking potentials among all network members, which requires accommodation of heterogeneous measurement error inherent in behavioral data. Our second step estimates the social rank for all individuals by minimizing the network-wide errors in the ranking potentials. The third step provides a way to compute confidence bounds for selected empirical features in the social ranking. We apply this approach to two sets of conflict data pertaining to two captive societies of adult rhesus macaques. The resultant ranking network for each society is found to be a sophisticated mixture of both a kingdom and a corporation. Also, for validation purposes, we reanalyze conflict data from twenty longhorn sheep and demonstrate that our three-step approach is capable of correctly computing a ranking network by eliminating all ranking error.

Ranking network of a captive rhesus macaque society: a sophisticated corporative kingdom.

Directory of Open Access Journals (Sweden)

Hsieh Fushing

2011-03-01

Full Text Available We develop a three-step computing approach to explore a hierarchical ranking network for a society of captive rhesus macaques. The computed network is sufficiently informative to address the question: Is the ranking network for a rhesus macaque society more like a kingdom or a corporation? Our computations are based on a three-step approach. These steps are devised to deal with the tremendous challenges stemming from the transitivity of dominance as a necessary constraint on the ranking relations among all individual macaques, and the very high sampling heterogeneity in the behavioral conflict data. The first step simultaneously infers the ranking potentials among all network members, which requires accommodation of heterogeneous measurement error inherent in behavioral data. Our second step estimates the social rank for all individuals by minimizing the network-wide errors in the ranking potentials. The third step provides a way to compute confidence bounds for selected empirical features in the social ranking. We apply this approach to two sets of conflict data pertaining to two captive societies of adult rhesus macaques. The resultant ranking network for each society is found to be a sophisticated mixture of both a kingdom and a corporation. Also, for validation purposes, we reanalyze conflict data from twenty longhorn sheep and demonstrate that our three-step approach is capable of correctly computing a ranking network by eliminating all ranking error.

The Privilege of Ranking: Google Plays Ball.

Science.gov (United States)

Wiggins, Richard

2003-01-01

Discussion of ranking systems used in various settings, including college football and academic admissions, focuses on the Google search engine. Explains the PageRank mathematical formula that scores Web pages by connecting the number of links; limitations, including authenticity and accuracy of ranked Web pages; relevancy; adjusting algorithms;…

The tensor rank of tensor product of two three-qubit W states is eight

OpenAIRE

Chen, Lin; Friedland, Shmuel

2017-01-01

We show that the tensor rank of tensor product of two three-qubit W states is not less than eight. Combining this result with the recent result of M. Christandl, A. K. Jensen, and J. Zuiddam that the tensor rank of tensor product of two three-qubit W states is at most eight, we deduce that the tensor rank of tensor product of two three-qubit W states is eight. We also construct the upper bound of the tensor rank of tensor product of many three-qubit W states.

Probabilistic relation between In-Degree and PageRank

NARCIS (Netherlands)

Litvak, Nelli; Scheinhardt, Willem R.W.; Volkovich, Y.

2008-01-01

This paper presents a novel stochastic model that explains the relation between power laws of In-Degree and PageRank. PageRank is a popularity measure designed by Google to rank Web pages. We model the relation between PageRank and In-Degree through a stochastic equation, which is inspired by the

Robust Tracking with Discriminative Ranking Middle-Level Patches

Directory of Open Access Journals (Sweden)

Hong Liu

2014-04-01

Full Text Available The appearance model has been shown to be essential for robust visual tracking since it is the basic criterion to locating targets in video sequences. Though existing tracking-by-detection algorithms have shown to be greatly promising, they still suffer from the drift problem, which is caused by updating appearance models. In this paper, we propose a new appearance model composed of ranking middle-level patches to capture more object distinctiveness than traditional tracking-by-detection models. Targets and backgrounds are represented by both low-level bottom-up features and high-level top-down patches, which can compensate each other. Bottom-up features are defined at the pixel level, and each feature gets its discrimination score through selective feature attention mechanism. In top-down feature extraction, rectangular patches are ranked according to their bottom-up discrimination scores, by which all of them are clustered into irregular patches, named ranking middle-level patches. In addition, at the stage of classifier training, the online random forests algorithm is specially refined to reduce drifting problems. Experiments on challenging public datasets and our test videos demonstrate that our approach can effectively prevent the tracker drifting problem and obtain competitive performance in visual tracking.

Google's pagerank and beyond the science of search engine rankings

CERN Document Server

Langville, Amy N

2006-01-01

Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other Web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of Web page rankings, Google's PageRank and Beyond supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other cha

CT Image Sequence Restoration Based on Sparse and Low-Rank Decomposition

Science.gov (United States)

Gou, Shuiping; Wang, Yueyue; Wang, Zhilong; Peng, Yong; Zhang, Xiaopeng; Jiao, Licheng; Wu, Jianshe

2013-01-01

Blurry organ boundaries and soft tissue structures present a major challenge in biomedical image restoration. In this paper, we propose a low-rank decomposition-based method for computed tomography (CT) image sequence restoration, where the CT image sequence is decomposed into a sparse component and a low-rank component. A new point spread function of Weiner filter is employed to efficiently remove blur in the sparse component; a wiener filtering with the Gaussian PSF is used to recover the average image of the low-rank component. And then we get the recovered CT image sequence by combining the recovery low-rank image with all recovery sparse image sequence. Our method achieves restoration results with higher contrast, sharper organ boundaries and richer soft tissue structure information, compared with existing CT image restoration methods. The robustness of our method was assessed with numerical experiments using three different low-rank models: Robust Principle Component Analysis (RPCA), Linearized Alternating Direction Method with Adaptive Penalty (LADMAP) and Go Decomposition (GoDec). Experimental results demonstrated that the RPCA model was the most suitable for the small noise CT images whereas the GoDec model was the best for the large noisy CT images. PMID:24023764

Generalized PageRank on Directed Configuration Networks

NARCIS (Netherlands)

Chen, Ningyuan; Litvak, Nelli; Olvera-Cravioto, Mariana

2017-01-01

Note: formula is not displayed correctly. This paper studies the distribution of a family of rankings, which includes Google’s PageRank, on a directed configuration model. In particular, it is shown that the distribution of the rank of a randomly chosen node in the graph converges in distribution to

Computational Methods for Large Spatio-temporal Datasets and Functional Data Ranking

KAUST Repository

Huang, Huang

2017-07-16

separability and full symmetry. We formulate test functions as functions of temporal lags for each pair of spatial locations and develop a rank-based testing procedure induced by functional data depth for assessing these properties. The method is illustrated using simulated data from widely used spatio-temporal covariance models, as well as real datasets from weather stations and climate model outputs.

An Improved Fuzzy Based Missing Value Estimation in DNA Microarray Validated by Gene Ranking

Directory of Open Access Journals (Sweden)

Sujay Saha

2016-01-01

Full Text Available Most of the gene expression data analysis algorithms require the entire gene expression matrix without any missing values. Hence, it is necessary to devise methods which would impute missing data values accurately. There exist a number of imputation algorithms to estimate those missing values. This work starts with a microarray dataset containing multiple missing values. We first apply the modified version of the fuzzy theory based existing method LRFDVImpute to impute multiple missing values of time series gene expression data and then validate the result of imputation by genetic algorithm (GA based gene ranking methodology along with some regular statistical validation techniques, like RMSE method. Gene ranking, as far as our knowledge, has not been used yet to validate the result of missing value estimation. Firstly, the proposed method has been tested on the very popular Spellman dataset and results show that error margins have been drastically reduced compared to some previous works, which indirectly validates the statistical significance of the proposed method. Then it has been applied on four other 2-class benchmark datasets, like Colorectal Cancer tumours dataset (GDS4382, Breast Cancer dataset (GSE349-350, Prostate Cancer dataset, and DLBCL-FL (Leukaemia for both missing value estimation and ranking the genes, and the results show that the proposed method can reach 100% classification accuracy with very few dominant genes, which indirectly validates the biological significance of the proposed method.

OutRank

DEFF Research Database (Denmark)

Müller, Emmanuel; Assent, Ira; Steinhausen, Uwe

2008-01-01

Outlier detection is an important data mining task for consistency checks, fraud detection, etc. Binary decision making on whether or not an object is an outlier is not appropriate in many applications and moreover hard to parametrize. Thus, recently, methods for outlier ranking have been proposed...

ASTM Committee G-4 metals flammability test program - Data and discussion

Science.gov (United States)

Stoltzfus, Joel M.; Homa, John M.; Williams, Ralph E.; Benz, Frank J.

1988-01-01

Results of metals flammability tests performed on twenty-six metals in the NASA/White Sands Test Facility are discussed together with the test systems. The promoted combustion and ignition characteristics of these metals are described, and the metals are ranked according to their suitability for use in oxygen systems. In general, alloys with high copper and nickel contents and low iron content were found to rank higher than those that had high iron content, while alloys that had high aluminum content were ranked the lowest.

Ranking Theory and Conditional Reasoning.

Science.gov (United States)

Skovgaard-Olsen, Niels

2016-05-01

Ranking theory is a formal epistemology that has been developed in over 600 pages in Spohn's recent book The Laws of Belief, which aims to provide a normative account of the dynamics of beliefs that presents an alternative to current probabilistic approaches. It has long been received in the AI community, but it has not yet found application in experimental psychology. The purpose of this paper is to derive clear, quantitative predictions by exploiting a parallel between ranking theory and a statistical model called logistic regression. This approach is illustrated by the development of a model for the conditional inference task using Spohn's (2013) ranking theoretic approach to conditionals. Copyright © 2015 Cognitive Science Society, Inc.

The structure of completely positive matrices according to their CP-rank and CP-plus-rank

NARCIS (Netherlands)

Dickinson, Peter James Clair; Bomze, Immanuel M.; Still, Georg J.

2015-01-01

We study the topological properties of the cp-rank operator $\\mathrm{cp}(A)$ and the related cp-plus-rank operator $\\mathrm{cp}^+(A)$ (which is introduced in this paper) in the set $\\mathcal{S}^n$ of symmetric $n\\times n$-matrices. For the set of completely positive matrices, $\\mathcal{CP}^n$, we

Nominal versus Attained Weights in Universitas 21 Ranking

Science.gov (United States)

Soh, Kaycheng

2014-01-01

Universitas 21 Ranking of National Higher Education Systems (U21 Ranking) is one of the three new ranking systems appearing in 2012. In contrast with the other systems, U21 Ranking uses countries as the unit of analysis. It has several features which lend it with greater trustworthiness, but it also shared some methodological issues with the other…

A Comprehensive Analysis of Marketing Journal Rankings

Science.gov (United States)

Steward, Michelle D.; Lewis, Bruce R.

2010-01-01

The purpose of this study is to offer a comprehensive assessment of journal standings in Marketing from two perspectives. The discipline perspective of rankings is obtained from a collection of published journal ranking studies during the past 15 years. The studies in the published ranking stream are assessed for reliability by examining internal…

RUSSIAN UNIVERSITIES IN THE LOOP OF THE WORLD EDUCATION RANKINGS

Directory of Open Access Journals (Sweden)

Inozemtseva Ekaterina Sergeevna

2013-02-01

Full Text Available Purpose: a research on different sociological and economic aspects of world education rankings (THE, ARWU, QS, evaluation of their role and impact on the world education market’s main consumers (i.e. students and academic staff as a subject to discussion in terms of the customers’ preferences and choice motivators. Methodology: general scientific research tools were applied throughout the research: analysis, synthesis, deduction. Results: world ranking approach and methodology was assessed, defined and systemized, a unique general ranking of the countries was developed and performed (based on the researched body – the US ranked #1, Russia #30, expert recommendations for Russian universities have been developed and concluded. Practical implications: the main statements could be used within learning courses on the internationalization of higher education and applied in sociological and economic research dedicated to macroeconomic problems and issues analysis.

Service Quality Evaluation and Ranking of Container Terminal Operators

Directory of Open Access Journals (Sweden)

Jafar Sayareh

2016-12-01

Full Text Available In the service industry, the regular assessment of service quality is considered as a means of promoting the quality of services. Container market is no exception, and the quality of providing service in a container terminal is of prime importance in attracting new customers and maintaining the existing ones. The main aim of present research is to evaluate the quality of service being offered at Shahid Rajaee Container Terminal (SRCT in Bandar Abbas port. The evaluation process uses SERVQUAL model which is an appropriate tool for measuring the service quality, identifying and analyzing available gaps between service expectations and perceptions. Target population in this research includes customers of SRCT. The standard and customized questionnaires were distributed among 165 samples, out of which 127 (77% were returned. For the purpose of data analyses, initially the reliability of SERVQUAL model was checked, and then paired sample t-test was performed to reveal any possible gap between expectations and perceptions of respondents. Finally, TOPSIS was used to rank the 9 main container service companies in the SRCT. The results indicated that there are significant gaps between customers’ expectations and perceptions in SRCT, in all five dimensions of services quality. Additionally, from weighing point of view, ‘Tangibles’ was the most important dimension, followed by ‘Reliability’, ‘Assurance’, ‘Responsiveness’ and ‘Empathy’. In addition, ‘Tangibles’ dimension had maximum gap and ‘Empathy’ dimension had minimum gap between customers’ expectations and perceptions. Finally, after ranking companies, BandarAbbas Aria Container Terminal (BACT Company was ranked first among nine companies in satisfying customers’ expectations.

PageRank in scale-free random graphs

NARCIS (Netherlands)

Chen, Ningyuan; Litvak, Nelli; Olvera-Cravioto, Mariana; Bonata, Anthony; Chung, Fan; Pralat, Paweł

2014-01-01

We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity, the PageRank of a randomly chosen node can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in

46 CFR 282.11 - Ranking of flags.

Science.gov (United States)

2010-10-01

... 46 Shipping 8 2010-10-01 2010-10-01 false Ranking of flags. 282.11 Section 282.11 Shipping... COMMERCE OF THE UNITED STATES Foreign-Flag Competition § 282.11 Ranking of flags. The operators under each... priority of costs which are representative of the flag. For liner cargo vessels, the ranking of operators...

A stable systemic risk ranking in China's banking sector: Based on principal component analysis

Science.gov (United States)

Fang, Libing; Xiao, Binqing; Yu, Honghai; You, Qixing

2018-02-01

In this paper, we compare five popular systemic risk rankings, and apply principal component analysis (PCA) model to provide a stable systemic risk ranking for the Chinese banking sector. Our empirical results indicate that five methods suggest vastly different systemic risk rankings for the same bank, while the combined systemic risk measure based on PCA provides a reliable ranking. Furthermore, according to factor loadings of the first component, PCA combined ranking is mainly based on fundamentals instead of market price data. We clearly find that price-based rankings are not as practical a method as fundamentals-based ones. This PCA combined ranking directly shows systemic risk contributions of each bank for banking supervision purpose and reminds banks to prevent and cope with the financial crisis in advance.

Improve Biomedical Information Retrieval using Modified Learning to Rank Methods.

Science.gov (United States)

Xu, Bo; Lin, Hongfei; Lin, Yuan; Ma, Yunlong; Yang, Liang; Wang, Jian; Yang, Zhihao

2016-06-14

In these years, the number of biomedical articles has increased exponentially, which becomes a problem for biologists to capture all the needed information manually. Information retrieval technologies, as the core of search engines, can deal with the problem automatically, providing users with the needed information. However, it is a great challenge to apply these technologies directly for biomedical retrieval, because of the abundance of domain specific terminologies. To enhance biomedical retrieval, we propose a novel framework based on learning to rank. Learning to rank is a series of state-of-the-art information retrieval techniques, and has been proved effective in many information retrieval tasks. In the proposed framework, we attempt to tackle the problem of the abundance of terminologies by constructing ranking models, which focus on not only retrieving the most relevant documents, but also diversifying the searching results to increase the completeness of the resulting list for a given query. In the model training, we propose two novel document labeling strategies, and combine several traditional retrieval models as learning features. Besides, we also investigate the usefulness of different learning to rank approaches in our framework. Experimental results on TREC Genomics datasets demonstrate the effectiveness of our framework for biomedical information retrieval.

Yager’s ranking method for solving the trapezoidal fuzzy number linear programming

Science.gov (United States)

Karyati; Wutsqa, D. U.; Insani, N.

2018-03-01

In the previous research, the authors have studied the fuzzy simplex method for trapezoidal fuzzy number linear programming based on the Maleki’s ranking function. We have found some theories related to the term conditions for the optimum solution of fuzzy simplex method, the fuzzy Big-M method, the fuzzy two-phase method, and the sensitivity analysis. In this research, we study about the fuzzy simplex method based on the other ranking function. It is called Yager's ranking function. In this case, we investigate the optimum term conditions. Based on the result of research, it is found that Yager’s ranking function is not like Maleki’s ranking function. Using the Yager’s function, the simplex method cannot work as well as when using the Maleki’s function. By using the Yager’s function, the value of the subtraction of two equal fuzzy numbers is not equal to zero. This condition makes the optimum table of the fuzzy simplex table is undetected. As a result, the simplified fuzzy simplex table becomes stopped and does not reach the optimum solution.

Deep Multimodal Distance Metric Learning Using Click Constraints for Image Ranking.

Science.gov (United States)

Yu, Jun; Yang, Xiaokang; Gao, Fei; Tao, Dacheng

2017-12-01

How do we retrieve images accurately? Also, how do we rank a group of images precisely and efficiently for specific queries? These problems are critical for researchers and engineers to generate a novel image searching engine. First, it is important to obtain an appropriate description that effectively represent the images. In this paper, multimodal features are considered for describing images. The images unique properties are reflected by visual features, which are correlated to each other. However, semantic gaps always exist between images visual features and semantics. Therefore, we utilize click feature to reduce the semantic gap. The second key issue is learning an appropriate distance metric to combine these multimodal features. This paper develops a novel deep multimodal distance metric learning (Deep-MDML) method. A structured ranking model is adopted to utilize both visual and click features in distance metric learning (DML). Specifically, images and their related ranking results are first collected to form the training set. Multimodal features, including click and visual features, are collected with these images. Next, a group of autoencoders is applied to obtain initially a distance metric in different visual spaces, and an MDML method is used to assign optimal weights for different modalities. Next, we conduct alternating optimization to train the ranking model, which is used for the ranking of new queries with click features. Compared with existing image ranking methods, the proposed method adopts a new ranking model to use multimodal features, including click features and visual features in DML. We operated experiments to analyze the proposed Deep-MDML in two benchmark data sets, and the results validate the effects of the method.

Ranking Entities in Networks via Lefschetz Duality

DEFF Research Database (Denmark)

Aabrandt, Andreas; Hansen, Vagn Lundsgaard; Poulsen, Bjarne

2014-01-01

then be ranked according to how essential their positions are in the network by considering the effect of their respective absences. Defining a ranking of a network which takes the individual position of each entity into account has the purpose of assigning different roles to the entities, e.g. agents......, in the network. In this paper it is shown that the topology of a given network induces a ranking of the entities in the network. Further, it is demonstrated how to calculate this ranking and thus how to identify weak sub-networks in any given network....

Social norms and rank-based nudging: Changing willingness to pay for healthy food.

Science.gov (United States)

Aldrovandi, Silvio; Brown, Gordon D A; Wood, Alex M

2015-09-01

People's evaluations in the domain of healthy eating are at least partly determined by the choice context. We systematically test reference level and rank-based models of relative comparisons against each other and explore their application to social norms nudging, an intervention that aims at influencing consumers' behavior by addressing their inaccurate beliefs about their consumption relative to the consumption of others. Study 1 finds that the rank of a product or behavior among others in the immediate comparison context, rather than its objective attributes, influences its evaluation. Study 2 finds that when a comparator is presented in isolation the same rank-based process occurs based on information retrieved from memory. Study 3 finds that telling people how their consumption ranks within a normative comparison sample increases willingness to pay for a healthy food by over 30% relative to the normal social norms intervention that tells them how they compare to the average. We conclude that social norms interventions should present rank information (e.g., "you are in the most unhealthy 10% of eaters") rather than information relative to the average (e.g., "you consume 500 calories more than the average person"). (c) 2015 APA, all rights reserved).

The hematopoietic transcription factor PU.1 regulates RANK gene expression in myeloid progenitors

International Nuclear Information System (INIS)

Kwon, Oh Hyung; Lee, Chong-Kil; Lee, Young Ik; Paik, Sang-Gi; Lee, Hyun-Jun

2005-01-01

Osteoclasts are bone resorbing cells of hematopoietic origin. The hematopoietic transcription factor PU.1 is critical for osteoclastogenesis; however, the molecular mechanisms of PU.1-regulated osteoclastogenesis have not been explored. Here, we present evidence that the receptor activator of nuclear factor κB (RANK) gene that has been shown to be crucial for osteoclastogenesis is a transcriptional target of PU.1. The PU.1 -/- progenitor cells failed to express the RANK gene and reconstitution of PU.1 in these cells induced RANK expression. Treatment of the PU.1 reconstituted cells with M-CSF and RANKL further augmented the RANK gene expression. To explore the regulatory mechanism of the RANK gene expression by PU.1, we have cloned the human RANK promoter. Transient transfection assays have revealed that the 2.2-kb RANK promoter was functional in a monocyte line RAW264.7, whereas co-transfection of PU.1 transactivated the RANK promoter in HeLa cells. Taken together, these results suggest that PU.1 regulates the RANK gene transcription and this may represent one of the key roles of PU.1 in osteoclast differentiation

A Hybrid Distance-Based Ideal-Seeking Consensus Ranking Model

Directory of Open Access Journals (Sweden)

Madjid Tavana

2007-01-01

Full Text Available Ordinal consensus ranking problems have received much attention in the management science literature. A problem arises in situations where a group of k decision makers (DMs is asked to rank order n alternatives. The question is how to combine the DM rankings into one consensus ranking. Several different approaches have been suggested to aggregate DM responses into a compromise or consensus ranking; however, the similarity of consensus rankings generated by the different algorithms is largely unknown. In this paper, we propose a new hybrid distance-based ideal-seeking consensus ranking model (DCM. The proposed hybrid model combines parts of the two commonly used consensus ranking techniques of Beck and Lin (1983 and Cook and Kress (1985 into an intuitive and computationally simple model. We illustrate our method and then run a Monte Carlo simulation across a range of k and n to compare the similarity of the consensus rankings generated by our method with the best-known method of Borda and Kendall (Kendall 1962 and the two methods proposed by Beck and Lin (1983 and Cook and Kress (1985. DCM and Beck and Lin's method yielded the most similar consensus rankings, whereas the Cook-Kress method and the Borda-Kendall method yielded the least similar consensus rankings.

On the growth of rank for subgroups of finitely generated groups

International Nuclear Information System (INIS)

Osin, D V

1999-01-01

In [1] and [2] the functions of rank growth were independently introduced and investigated for subgroups of a finitely generated free group. In the present paper the concept of growth of rank is extended to subgroups of an arbitrary finitely generated group G, and the dependence of the asymptotic behaviour of the above functions on the choice of a finite generating set in G is studied. For a broad class of groups (which includes, in particular, the free polynilpotent groups) estimates for the growth of rank for subgroups are obtained that generalize the wellknown Baumslag-Eidel'kind result on finitely generated normal subgroups. Some problems related to the realization of arbitrary functions as functions of rank growth for subgroups of soluble groups are treated

Male rank affects reproductive success and offspring performance in bank voles.

Science.gov (United States)

Kruczek, Małgorzata; Zatorska, Magdalena

2008-07-05

Laboratory studies reveal that in several rodent species the females prefer dominant males as mating partners. Here we investigate the correlation between males' social rank and their reproductive success. Similar numbers of females mating with relatively more dominant or relatively more subordinate males produced a litter, and parturition took place 19-21 days after mating. Relatively more dominant males tended to sire more pups than did relatively more subordinates, but the mean number of offspring per litter did not differ significantly between the two groups. Significantly more pups fathered by relatively more dominant males survived to weaning than those sired by relatively more subordinate fathers. Dominance had a long-term effect on the reproductive activity of the offspring: their rate of sexual maturation was increased. In pups sired by a relatively more dominant father, the uteruses of females, and the testes and accessory sex glands of males, were significantly heavier than those of offspring born to relatively more subordinate males. Our results suggest that social rank is an important determinant of the reproductive success of bank vole males.

Discovering urban mobility patterns with PageRank based traffic modeling and prediction

Science.gov (United States)

Wang, Minjie; Yang, Su; Sun, Yi; Gao, Jun

2017-11-01

Urban transportation system can be viewed as complex network with time-varying traffic flows as links to connect adjacent regions as networked nodes. By computing urban traffic evolution on such temporal complex network with PageRank, it is found that for most regions, there exists a linear relation between the traffic congestion measure at present time and the PageRank value of the last time. Since the PageRank measure of a region does result from the mutual interactions of the whole network, it implies that the traffic state of a local region does not evolve independently but is affected by the evolution of the whole network. As a result, the PageRank values can act as signatures in predicting upcoming traffic congestions. We observe the aforementioned laws experimentally based on the trajectory data of 12000 taxies in Beijing city for one month.

Analysis of high-throughput biological data using their rank values.

Science.gov (United States)

Dembélé, Doulaye

2018-01-01

High-throughput biological technologies are routinely used to generate gene expression profiling or cytogenetics data. To achieve high performance, methods available in the literature become more specialized and often require high computational resources. Here, we propose a new versatile method based on the data-ordering rank values. We use linear algebra, the Perron-Frobenius theorem and also extend a method presented earlier for searching differentially expressed genes for the detection of recurrent copy number aberration. A result derived from the proposed method is a one-sample Student's t-test based on rank values. The proposed method is to our knowledge the only that applies to gene expression profiling and to cytogenetics data sets. This new method is fast, deterministic, and requires a low computational load. Probabilities are associated with genes to allow a statistically significant subset selection in the data set. Stability scores are also introduced as quality parameters. The performance and comparative analyses were carried out using real data sets. The proposed method can be accessed through an R package available from the CRAN (Comprehensive R Archive Network) website: https://cran.r-project.org/web/packages/fcros .

Ranking environmental projects model based on multicriteria decision-making and the weight sensitivity analysis

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

With the fast growth of Chinese economic,more and more capital will be invested in environmental projects.How to select the environmental investment projects(alternatives)for obtaining the best environmental quality and economic benefits is an important problem for the decision makers.The purpose of this paper is to develop a decision-making model to rank a finite number of alternatives with several and sometimes conflicting criteria.A model for ranking the projects of municipal sewage treatment plants is proposed by using exports' information and the data of the real projects.And,the ranking result is given based on the PROMETHEE method. Furthermore,by means of the concept of the weight stability intervals(WSI),the sensitivity of the ranking results to the size of criteria values and the change of weights value of criteria are discussed.The result shows that some criteria,such as"proportion of benefit to projoct cost",will influence the ranking result of alternatives very strong while others not.The influence are not only from the value of criterion but also from the changing the weight of criterion.So,some criteria such as"proportion of benefit to projoct cost" are key critera for ranking the projects. Decision makers must be cautious to them.

Fair ranking of researchers and research teams.

Science.gov (United States)

Vavryčuk, Václav

2018-01-01

The main drawback of ranking of researchers by the number of papers, citations or by the Hirsch index is ignoring the problem of distributing authorship among authors in multi-author publications. So far, the single-author or multi-author publications contribute to the publication record of a researcher equally. This full counting scheme is apparently unfair and causes unjust disproportions, in particular, if ranked researchers have distinctly different collaboration profiles. These disproportions are removed by less common fractional or authorship-weighted counting schemes, which can distribute the authorship credit more properly and suppress a tendency to unjustified inflation of co-authors. The urgent need of widely adopting a fair ranking scheme in practise is exemplified by analysing citation profiles of several highly-cited astronomers and astrophysicists. While the full counting scheme often leads to completely incorrect and misleading ranking, the fractional or authorship-weighted schemes are more accurate and applicable to ranking of researchers as well as research teams. In addition, they suppress differences in ranking among scientific disciplines. These more appropriate schemes should urgently be adopted by scientific publication databases as the Web of Science (Thomson Reuters) or the Scopus (Elsevier).

Implementation of preference ranking organization method for enrichment evaluation (Promethee) on selection system of student’s achievement

Science.gov (United States)

Karlitasari, L.; Suhartini, D.; Nurrosikawati, L.

2018-03-01

Selection of Student Achievement is conducted every year, starting from the level of Study Program, Faculty, to University, which then rank one will be sent to Kopertis level. The criteria made for the selection are Academic and Rich Scientific, Organizational, Personality, and English. In order for the selection of Student Achievement is Objective, then in addition to the presence of the jury is expected to use methods that support the decision to be more optimal in determining the Student Achievement. One method used is the Promethee Method. Preference Ranking Organization Method for Enrichment Evaluation (Promethee) is a method of ranking in Multi Criteria Decision Making (MCDM). PROMETHEE has the advantage that there is a preference type against the criteria that can take into account alternatives with other alternatives on the same criteria. The conjecture of alternate dominance over a criterion used in PROMETHEE is the use of values in the relationships between alternative ranking values. Based on the calculation result, from 7 applicants between Manual and Promethee Matrices, rank 1, 2, and 3, did not change, only 4 to 7 positions were changed. However, after the sensitivity test, almost all criteria experience a high level of sensitivity. Although it does not affect the students who will be sent to the next level, but can bring psychological impact on prospective student’s achievement

Treatment plan ranking using physical and biological indices

International Nuclear Information System (INIS)

Ebert, M. A.; University of Western Asutralia, WA

2001-01-01

Full text: The ranking of dose distributions is of importance in several areas such as i) comparing rival treatment plans, ii) comparing iterations in an optimisation routine, and iii) dose-assessment of clinical trial data. This study aimed to investigate the influence of choice of objective function in ranking tumour dose distributions. A series of physical (mean, maximum, minimum, standard deviation of dose) dose-volume histogram (DVH) reduction indices and biologically-based (tumour-control probability - TCP; equivalent uniform dose -EUD) indices were used to rank a series of hypothetical DVHs, as well as DVHs obtained from a series of 18 prostate patients. The distribution in ranking and change in distribution with change in indice parameters were investigated. It is found that not only is the ranking of DVHs dependent on the actual model used to perform the DVH reduction, it is also found to depend on the inherent characteristics of each model (i.e., selected parameters). The adjacent figure shows an example where the 18 prostate patients are ranked (grey-scale from black to white) by EUD when an α value of 0.8 Gy -1 is used in the model. The change of ranking as α varies is evident. Conclusion: This study has shown that the characteristics of the model selected in plan optimisation or DVH ranking will have an impact on the ranking obtained. Copyright (2001) Australasian College of Physical Scientists and Engineers in Medicine

Interference Aware Inter-Cell Rank Coordination for 5G Systems

DEFF Research Database (Denmark)

Mahmood, Nurul Huda; Pedersen, Klaus I.; Mogensen, Preben Elgaard

2017-01-01

at balancing the trade-off between increasing the spatial multiplexing gain through independent streams, or improving the interference resilience property. An interference aware inter-cell rank coordination framework for the future fifth generation wireless system is proposed in this article. The proposal...... resilience trade-off. Centralized and distributed implementations of the proposed inter-cell rank coordination framework are presented, followed by exhaustive Monte Carlo simulation results demonstrating its performance. The obtained results indicate that the performance of the proposed method is up to 56...

CCTF CORE I test results

International Nuclear Information System (INIS)

Murao, Yoshio; Sudoh, Takashi; Akimoto, Hajime; Iguchi, Tadashi; Sugimoto, Jun; Fujiki, Kazuo; Hirano, Kenmei

1982-07-01

This report presents the results of the following CCTF CORE I tests conducted in FY. 1980. (1) Multi-dimensional effect test, (2) Evaluation model test, (3) FLECHT coupling test. On the first test, one-dimensional treatment of the core thermohydrodynamics was discussed. On the second and third tests, the test results were compared with the results calculated by the evaluation model codes and the results of the corresponding FLECHT-SET test (Run 2714B), respectively. The work was performed under contracts with the Atomic Energy Bureau of Science and Technology Agency of Japan. (author)

Evaluation of treatment effects by ranking

DEFF Research Database (Denmark)

Halekoh, U; Kristensen, K

2008-01-01

In crop experiments measurements are often made by a judge evaluating the crops' conditions after treatment. In the present paper an analysis is proposed for experiments where plots of crops treated differently are mutually ranked. In the experimental layout the crops are treated on consecutive...... plots usually placed side by side in one or more rows. In the proposed method a judge ranks several neighbouring plots, say three, by ranking them from best to worst. For the next observation the judge moves on by no more than two plots, such that up to two plots will be re-evaluated again...... in a comparison with the new plot(s). Data from studies using this set-up were analysed by a Thurstonian random utility model, which assumed that the judge's rankings were obtained by comparing latent continuous utilities or treatment effects. For the latent utilities a variance component model was considered...

Ranking environmental liabilities at a petroleum refinery

International Nuclear Information System (INIS)

Lupo, M.

1995-01-01

A new computer model is available to allow the management of a petroleum refinery to prioritize environmental action and construct a holistic approach to remediation. A large refinery may have numerous solid waste management units regulated by the Resource Conservation and Recovery Act (RCRA), as well as process units that emit hazardous chemicals into the environment. These sources can impact several environmental media, potentially including the air, the soil, the groundwater, the unsaturated zone water, and surface water. The number of chemicals of concern may be large. The new model is able to rank the sources by considering the impact of each chemical in each medium from each source in terms of concentration, release rate, and a weighted index based on toxicity. In addition to environmental impact, the sources can be ranked in three other ways: (1) by cost to remediate, (2) by environmental risk reduction caused by the remediation in terms of the decreases in release rate, concentration, and weighted index, and (3) by cost-benefit, which is the environmental risk reduction for each source divided by the cost of the remedy. Ranking each unit in the refinery allows management to use its limited environmental resources in a pro-active strategic manner that produces long-term results, rather than in reactive, narrowly focused, costly, regulatory-driven campaigns that produce only short-term results

Validation of models for analysis of ranks in horse breeding evaluation

Directory of Open Access Journals (Sweden)

Ricard Anne

2010-01-01

Full Text Available Abstract Background Ranks have been used as phenotypes in the genetic evaluation of horses for a long time through the use of earnings, normal score or raw ranks. A model, ("underlying model" of an unobservable underlying variable responsible for ranks exists. Recently, a full Bayesian analysis using this model was developed. In addition, in reality, competitions are structured into categories according to the technical level of difficulty linked to the technical ability of horses (horses considered to be the "best" meet their peers. The aim of this article was to validate the underlying model through simulations and to propose a more appropriate model with a mixture distribution of horses in the case of a structured competition. The simulations involved 1000 horses with 10 to 50 performances per horse and 4 to 20 horses per event with unstructured and structured competitions. Results The underlying model responsible for ranks performed well with unstructured competitions by drawing liabilities in the Gibbs sampler according to the following rule: the liability of each horse must be drawn in the interval formed by the liabilities of horses ranked before and after the particular horse. The estimated repeatability was the simulated one (0.25 and regression between estimated competing ability of horses and true ability was close to 1. Underestimations of repeatability (0.07 to 0.22 were obtained with other traditional criteria (normal score or raw ranks, but in the case of a structured competition, repeatability was underestimated (0.18 to 0.22. Our results show that the effect of an event, or category of event, is irrelevant in such a situation because ranks are independent of such an effect. The proposed mixture model pools horses according to their participation in different categories of competition during the period observed. This last model gave better results (repeatability 0.25, in particular, it provided an improved estimation of average

The highest-ranking rooster has priority to announce the break of dawn.

Science.gov (United States)

Shimmura, Tsuyoshi; Ohashi, Shosei; Yoshimura, Takashi

2015-07-23

The "cock-a-doodle-doo" crowing of roosters, which symbolizes the break of dawn in many cultures, is controlled by the circadian clock. When one rooster announces the break of dawn, others in the vicinity immediately follow. Chickens are highly social animals, and they develop a linear and fixed hierarchy in small groups. We found that when chickens were housed in small groups, the top-ranking rooster determined the timing of predawn crowing. Specifically, the top-ranking rooster always started to crow first, followed by its subordinates, in descending order of social rank. When the top-ranking rooster was physically removed from a group, the second-ranking rooster initiated crowing. The presence of a dominant rooster significantly reduced the number of predawn crows in subordinates. However, the number of crows induced by external stimuli was independent of social rank, confirming that subordinates have the ability to crow. Although the timing of subordinates' predawn crowing was strongly dependent on that of the top-ranking rooster, free-running periods of body temperature rhythms differed among individuals, and crowing rhythm did not entrain to a crowing sound stimulus. These results indicate that in a group situation, the top-ranking rooster has priority to announce the break of dawn, and that subordinate roosters are patient enough to wait for the top-ranking rooster's first crow every morning and thus compromise their circadian clock for social reasons.

Ranking of lignocellulosic biomass pellets through multicriteria modeling

Energy Technology Data Exchange (ETDEWEB)

Sultana, A.; Kumar, A. [Alberta Univ., Edmonton, AB (Canada). Dept. of Mechanical Engineering

2009-07-01

A study was conducted in which pellets from different lignocellulosic biomass sources were ranked using a multicriteria assessment model. Five different pellet alternatives were compared based on 10 criteria. The pair-wise comparison was done in order to develop preference indices for various alternatives. The methodology used in this study was the Preference Ranking Organization Method for Enrichment and Evaluation (PROMETHEE). The biomass included wood pellets, straw pellets, switchgrass pellets, alfalfa pellets and poultry pellets. The study considered both quantitative and qualitative criteria such as energy consumption to produce the pellets, production cost, bulk density, NOx emissions, SOx emissions, deposit formation, net calorific value, moisture content, maturity of technology, and quality of material. A sensitivity analysis was performed by changing weights of criteria and threshold values of the criteria. Different scenarios were developed for ranking cost and environmental impacts. According to preliminary results, the wood pellet is the best energy source, followed by switchgrass pellets, straw pellets, alfalfa pellets and poultry pellets.

Research on B Cell Algorithm for Learning to Rank Method Based on Parallel Strategy.

Science.gov (United States)

Tian, Yuling; Zhang, Hongxian

2016-01-01

For the purposes of information retrieval, users must find highly relevant documents from within a system (and often a quite large one comprised of many individual documents) based on input query. Ranking the documents according to their relevance within the system to meet user needs is a challenging endeavor, and a hot research topic-there already exist several rank-learning methods based on machine learning techniques which can generate ranking functions automatically. This paper proposes a parallel B cell algorithm, RankBCA, for rank learning which utilizes a clonal selection mechanism based on biological immunity. The novel algorithm is compared with traditional rank-learning algorithms through experimentation and shown to outperform the others in respect to accuracy, learning time, and convergence rate; taken together, the experimental results show that the proposed algorithm indeed effectively and rapidly identifies optimal ranking functions.

Systematic differences in signal emitting and receiving revealed by PageRank analysis of a human protein interactome.

Directory of Open Access Journals (Sweden)

Donglei Du

Full Text Available Most protein PageRank studies do not use signal flow direction information in protein interactions because this information was not readily available in large protein databases until recently. Therefore, four questions have yet to be answered: A What is the general difference between signal emitting and receiving in a protein interactome? B Which proteins are among the top ranked in directional ranking? C Are high ranked proteins more evolutionarily conserved than low ranked ones? D Do proteins with similar ranking tend to have similar subcellular locations? In this study, we address these questions using the forward, reverse, and non-directional PageRank approaches to rank an information-directional network of human proteins and study their evolutionary conservation. The forward ranking gives credit to information receivers, reverse ranking to information emitters, and non-directional ranking mainly to the number of interactions. The protein lists generated by the forward and non-directional rankings are highly correlated, but those by the reverse and non-directional rankings are not. The results suggest that the signal emitting/receiving system is characterized by key-emittings and relatively even receivings in the human protein interactome. Signaling pathway proteins are frequent in top ranked ones. Eight proteins are both informational top emitters and top receivers. Top ranked proteins, except a few species-related novel-function ones, are evolutionarily well conserved. Protein-subunit ranking position reflects subunit function. These results demonstrate the usefulness of different PageRank approaches in characterizing protein networks and provide insights to protein interaction in the cell.

Systematic differences in signal emitting and receiving revealed by PageRank analysis of a human protein interactome.

Science.gov (United States)

Du, Donglei; Lee, Connie F; Li, Xiu-Qing

2012-01-01

Most protein PageRank studies do not use signal flow direction information in protein interactions because this information was not readily available in large protein databases until recently. Therefore, four questions have yet to be answered: A) What is the general difference between signal emitting and receiving in a protein interactome? B) Which proteins are among the top ranked in directional ranking? C) Are high ranked proteins more evolutionarily conserved than low ranked ones? D) Do proteins with similar ranking tend to have similar subcellular locations? In this study, we address these questions using the forward, reverse, and non-directional PageRank approaches to rank an information-directional network of human proteins and study their evolutionary conservation. The forward ranking gives credit to information receivers, reverse ranking to information emitters, and non-directional ranking mainly to the number of interactions. The protein lists generated by the forward and non-directional rankings are highly correlated, but those by the reverse and non-directional rankings are not. The results suggest that the signal emitting/receiving system is characterized by key-emittings and relatively even receivings in the human protein interactome. Signaling pathway proteins are frequent in top ranked ones. Eight proteins are both informational top emitters and top receivers. Top ranked proteins, except a few species-related novel-function ones, are evolutionarily well conserved. Protein-subunit ranking position reflects subunit function. These results demonstrate the usefulness of different PageRank approaches in characterizing protein networks and provide insights to protein interaction in the cell.

Beyond Low Rank: A Data-Adaptive Tensor Completion Method

OpenAIRE

Zhang, Lei; Wei, Wei; Shi, Qinfeng; Shen, Chunhua; Hengel, Anton van den; Zhang, Yanning

2017-01-01

Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor data which only approximately fulfils the low-rank requirement. To address these two issues, we develop a data-adaptive tensor completion model which explicitly represents both the low-rank and non-low-rank structures in a latent tensor. Representing the no...

Trachomatous Scar Ranking: A Novel Outcome for Trachoma Studies.

Science.gov (United States)

Baldwin, Angela; Ryner, Alexander M; Tadesse, Zerihun; Shiferaw, Ayalew; Callahan, Kelly; Fry, Dionna M; Zhou, Zhaoxia; Lietman, Thomas M; Keenan, Jeremy D

2017-06-01

AbstractWe evaluated a new trachoma scarring ranking system with potential use in clinical research. The upper right tarsal conjunctivas of 427 individuals from Ethiopian villages with hyperendemic trachoma were photographed. An expert grader first assigned a scar grade to each photograph using the 1981 World Health Organization (WHO) grading system. Then, all photographs were ranked from least (rank = 1) to most scarring (rank = 427). Photographic grading found 79 (18.5%) conjunctivae without scarring (C0), 191 (44.7%) with minimal scarring (C1), 105 (24.6%) with moderate scarring (C2), and 52 (12.2%) with severe scarring (C3). The ranking method demonstrated good internal validity, exhibiting a monotonic increase in the median rank across the levels of the 1981 WHO grading system. Intrarater repeatability was better for the ranking method (intraclass correlation coefficient = 0.84, 95% CI = 0.74-0.94). Exhibiting better internal and external validity, this ranking method may be useful for evaluating the difference in scarring between groups of individuals.

RANK und RANKL - Vom Knochen zum Mammakarzinom

Directory of Open Access Journals (Sweden)

Sigl V

2012-01-01

Full Text Available RANK („Receptor Activator of NF-κB“ und sein Ligand RANKL sind Schlüsselmoleküle im Knochenmetabolismus und spielen eine essenzielle Rolle in der Entstehung von pathologischen Knochenveränderungen. Die Deregulation des RANK/RANKL-Systems ist zum Beispiel ein Hauptgrund für das Auftreten von postmenopausaler Osteoporose bei Frauen. Eine weitere wesentliche Funktion von RANK und RANKL liegt in der Entwicklung von milchsekretierenden Drüsen während der Schwangerschaft. Dabei regulieren Sexualhormone, wie zum Beispiel Progesteron, die Expression von RANKL und induzieren dadurch die Proliferation von epithelialen Zellen der Brust. Seit Längerem war schon bekannt, dass RANK und RANKL in der Metastasenbildung von Brustkrebszellen im Knochengewebe beteiligt sind. Wir konnten nun das RANK/RANKLSystem auch als essenziellen Mechanismus in der Entstehung von hormonellem Brustkrebs identifizieren. In diesem Beitrag werden wir daher den neuesten Erkenntnissen besondere Aufmerksamkeit schenken und diese kritisch in Bezug auf Brustkrebsentwicklung betrachten.

Are Quantitative Measures of Academic Productivity Correlated with Academic Rank in Plastic Surgery? A National Study.

Science.gov (United States)

Susarla, Srinivas M; Lopez, Joseph; Swanson, Edward W; Miller, Devin; O'Brien-Coon, Devin; Zins, James E; Serletti, Joseph M; Yaremchuk, Michael J; Manson, Paul N; Gordon, Chad R

2015-09-01

The purpose of this study was to investigate the correlation between quantitative measures of academic productivity and academic rank among full-time academic plastic surgeons. Bibliometric indices were computed for all full-time academic plastic surgeons in the United States. The primary study variable was academic rank. Bibliometric predictors included the Hirsch index, I-10 index, number of publications, number of citations, and highest number of citations for a single publication. Descriptive, bivariate, and correlation analyses were computed. Multiple comparisons testing was used to calculate adjusted associations for subgroups. For all analyses, a value of p productivity. Although academic promotion is the result of success in multiple different areas, bibliometric measures may be useful adjuncts for assessment of research productivity.

Semantic association ranking schemes for information retrieval ...

Indian Academy of Sciences (India)

retrieval applications using term association graph representation ... Department of Computer Science and Engineering, Government College of ... Introduction ... leads to poor precision, e.g., model, python, and chip. ...... The approaches proposed in this paper focuses on the query-centric re-ranking of search results.

Task 27 -- Alaskan low-rank coal-water fuel demonstration project

Energy Technology Data Exchange (ETDEWEB)

NONE

1995-10-01

Development of coal-water-fuel (CWF) technology has to-date been predicated on the use of high-rank bituminous coal only, and until now the high inherent moisture content of low-rank coal has precluded its use for CWF production. The unique feature of the Alaskan project is the integration of hot-water-drying (HWD) into CWF technology as a beneficiation process. Hot-water-drying is an EERC developed technology unavailable to the competition that allows the range of CWF feedstock to be extended to low-rank coals. The primary objective of the Alaskan Project, is to promote interest in the CWF marketplace by demonstrating the commercial viability of low-rank coal-water-fuel (LRCWF). While commercialization plans cannot be finalized until the implementation and results of the Alaskan LRCWF Project are known and evaluated, this report has been prepared to specifically address issues concerning business objectives for the project, and outline a market development plan for meeting those objectives.

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering

Directory of Open Access Journals (Sweden)

Shan Gao

2017-01-01

Full Text Available Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users’ preference by exploiting explicit feedbacks (numerical ratings, or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks. Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users’ actions, based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users’ other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app.

Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering.

Science.gov (United States)

Gao, Shan; Guo, Guibing; Li, Runzhi; Wang, Zongmin

2017-01-01

Nowadays, providing high-quality recommendation services to users is an essential component in web applications, including shopping, making friends, and healthcare. This can be regarded either as a problem of estimating users' preference by exploiting explicit feedbacks (numerical ratings), or as a problem of collaborative ranking with implicit feedback (e.g., purchases, views, and clicks). Previous works for solving this issue include pointwise regression methods and pairwise ranking methods. The emerging healthcare websites and online medical databases impose a new challenge for medical service recommendation. In this paper, we develop a model, MBPR (Medical Bayesian Personalized Ranking over multiple users' actions), based on the simple observation that users tend to assign higher ranks to some kind of healthcare services that are meanwhile preferred in users' other actions. Experimental results on the real-world datasets demonstrate that MBPR achieves more accurate recommendations than several state-of-the-art methods and shows its generality and scalability via experiments on the datasets from one mobile shopping app.

RUSSIAN UNIVERSITIES IN THE LOOP OF THE WORLD EDUCATION RANKINGS

Directory of Open Access Journals (Sweden)

Екатерина Сергеевна Иноземцева

2013-04-01

Full Text Available Purpose: a research on different sociological and economic aspects of world education rankings (THE, ARWU, QS, evaluation of their role and impact on the world education market’s main consumers (i.e. students and academic staff as a subject to discussion in terms of the customers’ preferences and choice motivators.  Methodology: general scientific research tools were applied throughout the research: analysis, synthesis, deduction.Results: world ranking approach and methodology was assessed, defined and systemized, a unique general ranking of the countries was developed and performed (based on the researched body – the US ranked #1, Russia #30, expert recommendations for Russian universities have been developed and concluded.Practical implications: the main statements could be used within learning courses on the internationalization of higher education and applied in sociological and economic research dedicated to macroeconomic problems and issues analysis.DOI: http://dx.doi.org/10.12731/2218-7405-2013-2-18

Associations of Power at V̇O2peak and Anaerobic Threshold with Rank in British High Performance Junior Surfers

Directory of Open Access Journals (Sweden)

Barlow Matthew John

2015-03-01

Full Text Available Purpose. The objective of this study was to determine the relationships of peak oxygen uptake ( V̇O2peak, power at V̇O2peak and power at the anaerobic threshold (AT with national ranking in a sample of British high performance junior surfers. Methods. Eighteen male surfers (aged 15.4 ± 1.4 years from the British Junior Surfing team were tested for V̇O2peak and AT using an adapted kayak ergometer; national ranking was used to indicate performance level. The AT was identified as the point at which V̇E/V̇O2 started to rise without a concomitant increase in V̇E/V̇CO2. Spearman’s rank (rs and partial correlations (rp controlling for age were used to identify the relationships between the physiological variables and national ranking. Results. Mean V̇O2peak was 3.1 ± 0.5 l · min-1 (47.7 ± 7.2 ml · kg-1 · min-1 and mean AT occurred at 48.1 ± 12.2 W. There were significant correlations between national ranking and power at V̇O2peak (rs = -0.549, p = 0.028, power at AT (rs = -0.646, p = 0.009, and age (rs = -0.579, p = 0.012. Significant partial correlations were established controlling for age between national ranking and power at V̇O2peak (rp = -0.839, p = 0.000 and power at AT (rp = -0.541, p < 0.046. Conclusions. The power outputs associated with V̇O2peak and AT were significantly related to surfer ranking in this sample. However, due to the low coefficient of determination associated with the AT/ranking relationship, AT does not discriminate well between the ranking of surfers. These findings support the inclusion of power at V̇O2peak in assessment batteries for junior competitive surfers.

Using centrality to rank web snippets

NARCIS (Netherlands)

Jijkoun, V.; de Rijke, M.; Peters, C.; Jijkoun, V.; Mandl, T.; Müller, H.; Oard, D.W.; Peñas, A.; Petras, V.; Santos, D.

2008-01-01

We describe our participation in the WebCLEF 2007 task, targeted at snippet retrieval from web data. Our system ranks snippets based on a simple similarity-based centrality, inspired by the web page ranking algorithms. We experimented with retrieval units (sentences and paragraphs) and with the

Neural Ranking Models with Weak Supervision

NARCIS (Netherlands)

Dehghani, M.; Zamani, H.; Severyn, A.; Kamps, J.; Croft, W.B.

2017-01-01

Despite the impressive improvements achieved by unsupervised deep neural networks in computer vision and NLP tasks, such improvements have not yet been observed in ranking for information retrieval. The reason may be the complexity of the ranking problem, as it is not obvious how to learn from

Generalization Performance of Regularized Ranking With Multiscale Kernels.

Science.gov (United States)

Zhou, Yicong; Chen, Hong; Lan, Rushi; Pan, Zhibin

2016-05-01

The regularized kernel method for the ranking problem has attracted increasing attentions in machine learning. The previous regularized ranking algorithms are usually based on reproducing kernel Hilbert spaces with a single kernel. In this paper, we go beyond this framework by investigating the generalization performance of the regularized ranking with multiscale kernels. A novel ranking algorithm with multiscale kernels is proposed and its representer theorem is proved. We establish the upper bound of the generalization error in terms of the complexity of hypothesis spaces. It shows that the multiscale ranking algorithm can achieve satisfactory learning rates under mild conditions. Experiments demonstrate the effectiveness of the proposed method for drug discovery and recommendation tasks.

Results from the Astronomy Diagnostic Test: 3 Years at MiraCosta College

Science.gov (United States)

Sirbaugh French, Rica

2007-12-01

The Astronomy Diagnostic Test 2.0 (ADT) was administered to 26 sections of ASTR 101 at MiraCosta College (MCC) from fall 2004 through summer 2007. MiraCosta is a two-year community college located in Oceanside, CA, USA (roughly 40 miles north of San Diego) with an enrollment of approximately 11,000 students. ASTR 101 is MiraCosta's introductory astronomy survey course for non-science majors and has no math prerequisite. Class sizes ranged from 10 to 38 students. Comparison with the ADT National Project results indicates similar pre- and post-course averages: 31.8% (MCC) vs. 32.4% (National) for pre-course tests and 49.3% (MCC) vs. 47.3% (National) for post-course tests. The sample sizes are 709 and 530 students for the pre- and post-tests, respectively. The normalized gain for the entire data set is 0.256 and the effect size (ES) is 1.04, meaning that approximately 85% of the post-test scores are above the average of the pre-test scores. Previous studies have shown the ADT to be a reliable indicator of pre-course misconceptions while post-course scores are useful for comparing modes of instruction and assessing student learning on a limited number of concepts. Additional analyses of the MCC data probe for trends with variables such as gender, class size, and implementation of materials designed for a more "learner-centered” approach (such as Lecture Tutorials, Ranking Tasks, and Think-Pair-Share questions), as well as gains for a particular subset of concepts.

MiRNA-TF-gene network analysis through ranking of biomolecules for multi-informative uterine leiomyoma dataset.

Science.gov (United States)

Mallik, Saurav; Maulik, Ujjwal

2015-10-01

Gene ranking is an important problem in bioinformatics. Here, we propose a new framework for ranking biomolecules (viz., miRNAs, transcription-factors/TFs and genes) in a multi-informative uterine leiomyoma dataset having both gene expression and methylation data using (statistical) eigenvector centrality based approach. At first, genes that are both differentially expressed and methylated, are identified using Limma statistical test. A network, comprising these genes, corresponding TFs from TRANSFAC and ITFP databases, and targeter miRNAs from miRWalk database, is then built. The biomolecules are then ranked based on eigenvector centrality. Our proposed method provides better average accuracy in hub gene and non-hub gene classifications than other methods. Furthermore, pre-ranked Gene set enrichment analysis is applied on the pathway database as well as GO-term databases of Molecular Signatures Database with providing a pre-ranked gene-list based on different centrality values for comparing among the ranking methods. Finally, top novel potential gene-markers for the uterine leiomyoma are provided. Copyright © 2015 Elsevier Inc. All rights reserved.

Learning of Rule Ensembles for Multiple Attribute Ranking Problems

Science.gov (United States)

Dembczyński, Krzysztof; Kotłowski, Wojciech; Słowiński, Roman; Szeląg, Marcin

In this paper, we consider the multiple attribute ranking problem from a Machine Learning perspective. We propose two approaches to statistical learning of an ensemble of decision rules from decision examples provided by the Decision Maker in terms of pairwise comparisons of some objects. The first approach consists in learning a preference function defining a binary preference relation for a pair of objects. The result of application of this function on all pairs of objects to be ranked is then exploited using the Net Flow Score procedure, giving a linear ranking of objects. The second approach consists in learning a utility function for single objects. The utility function also gives a linear ranking of objects. In both approaches, the learning is based on the boosting technique. The presented approaches to Preference Learning share good properties of the decision rule preference model and have good performance in the massive-data learning problems. As Preference Learning and Multiple Attribute Decision Aiding share many concepts and methodological issues, in the introduction, we review some aspects bridging these two fields. To illustrate the two approaches proposed in this paper, we solve with them a toy example concerning the ranking of a set of cars evaluated by multiple attributes. Then, we perform a large data experiment on real data sets. The first data set concerns credit rating. Since recent research in the field of Preference Learning is motivated by the increasing role of modeling preferences in recommender systems and information retrieval, we chose two other massive data sets from this area - one comes from movie recommender system MovieLens, and the other concerns ranking of text documents from 20 Newsgroups data set.

University rankings in computer science

DEFF Research Database (Denmark)

Ehret, Philip; Zuccala, Alesia Ann; Gipp, Bela

2017-01-01

This is a research-in-progress paper concerning two types of institutional rankings, the Leiden and QS World ranking, and their relationship to a list of universities’ ‘geo-based’ impact scores, and Computing Research and Education Conference (CORE) participation scores in the field of computer...... science. A ‘geo-based’ impact measure examines the geographical distribution of incoming citations to a particular university’s journal articles for a specific period of time. It takes into account both the number of citations and the geographical variability in these citations. The CORE participation...... score is calculated on the basis of the number of weighted proceedings papers that a university has contributed to either an A*, A, B, or C conference as ranked by the Computing Research and Education Association of Australasia. In addition to calculating the correlations between the distinct university...

Adaptive distributional extensions to DFR ranking

DEFF Research Database (Denmark)

Petersen, Casper; Simonsen, Jakob Grue; Järvelin, Kalervo

2016-01-01

-fitting distribution. We call this model Adaptive Distributional Ranking (ADR) because it adapts the ranking to the statistics of the specific dataset being processed each time. Experiments on TREC data show ADR to outperform DFR models (and their extensions) and be comparable in performance to a query likelihood...

Are university rankings useful to improve research? A systematic review.

Science.gov (United States)

Vernon, Marlo M; Balas, E Andrew; Momani, Shaher

2018-01-01

Concerns about reproducibility and impact of research urge improvement initiatives. Current university ranking systems evaluate and compare universities on measures of academic and research performance. Although often useful for marketing purposes, the value of ranking systems when examining quality and outcomes is unclear. The purpose of this study was to evaluate usefulness of ranking systems and identify opportunities to support research quality and performance improvement. A systematic review of university ranking systems was conducted to investigate research performance and academic quality measures. Eligibility requirements included: inclusion of at least 100 doctoral granting institutions, be currently produced on an ongoing basis and include both global and US universities, publish rank calculation methodology in English and independently calculate ranks. Ranking systems must also include some measures of research outcomes. Indicators were abstracted and contrasted with basic quality improvement requirements. Exploration of aggregation methods, validity of research and academic quality indicators, and suitability for quality improvement within ranking systems were also conducted. A total of 24 ranking systems were identified and 13 eligible ranking systems were evaluated. Six of the 13 rankings are 100% focused on research performance. For those reporting weighting, 76% of the total ranks are attributed to research indicators, with 24% attributed to academic or teaching quality. Seven systems rely on reputation surveys and/or faculty and alumni awards. Rankings influence academic choice yet research performance measures are the most weighted indicators. There are no generally accepted academic quality indicators in ranking systems. No single ranking system provides a comprehensive evaluation of research and academic quality. Utilizing a combined approach of the Leiden, Thomson Reuters Most Innovative Universities, and the SCImago ranking systems may provide

Freudenthal ranks: GHZ versus W

International Nuclear Information System (INIS)

Borsten, L

2013-01-01

The Hilbert space of three-qubit pure states may be identified with a Freudenthal triple system. Every state has an unique Freudenthal rank ranging from 1 to 4, which is determined by a set of automorphism group covariants. It is shown here that the optimal success rates for winning a three-player non-local game, varying over all local strategies, are strictly ordered by the Freudenthal rank of the shared three-qubit resource. (paper)

PR-Index: Using the h-Index and PageRank for Determining True Impact.

Science.gov (United States)

Gao, Chao; Wang, Zhen; Li, Xianghua; Zhang, Zili; Zeng, Wei

2016-01-01

Several technical indicators have been proposed to assess the impact of authors and institutions. Here, we combine the h-index and the PageRank algorithm to do away with some of the individual limitations of these two indices. Most importantly, we aim to take into account value differences between citations-evaluating the citation sources by defining the h-index using the PageRank score rather than with citations. The resulting PR-index is then constructed by evaluating source popularity as well as the source publication authority. Extensive tests on available collections data (i.e., Microsoft Academic Search and benchmarks on the SIGKDD innovation award) show that the PR-index provides a more balanced impact measure than many existing indices. Due to its simplicity and similarity to the popular h-index, the PR-index may thus become a welcome addition to the technical indices already in use. Moreover, growth dynamics prior to the SIGKDD innovation award indicate that the PR-index might have notable predictive power.