WorldWideScience

Sample records for ranking table pirt

  1. Next Generation Nuclear Plant Phenomena Identification and Ranking Tables (PIRTs) Volume 5: Graphite PIRTs

    Energy Technology Data Exchange (ETDEWEB)

    Burchell, Timothy D [ORNL; Bratton, Rob [Idaho National Laboratory (INL); Marsden, Barry [University of Manchester, UK; Srinivasan, Makuteswara [U.S. Nuclear Regulatory Commission; Penfield, Scott [Technology Insights; Mitchell, Mark [PBMR (Pty) Ltd.; Windes, Will [Idaho National Laboratory (INL)

    2008-03-01

    Here we report the outcome of the application of the Nuclear Regulatory Commission (NRC) Phenomena Identification and Ranking Table (PIRT) process to the issue of nuclear-grade graphite for the moderator and structural components of a next generation nuclear plant (NGNP), considering both routine (normal operation) and postulated accident conditions for the NGNP. The NGNP is assumed to be a modular high-temperature gas-cooled reactor (HTGR), either a gas-turbine modular helium reactor (GTMHR) version [a prismatic-core modular reactor (PMR)] or a pebble-bed modular reactor (PBMR) version [a pebble bed reactor (PBR)] design, with either a direct- or indirect-cycle gas turbine (Brayton cycle) system for electric power production, and an indirect-cycle component for hydrogen production. NGNP design options with a high-pressure steam generator (Rankine cycle) in the primary loop are not considered in this PIRT. This graphite PIRT was conducted in parallel with four other NRC PIRT activities, taking advantage of the relationships and overlaps in subject matter. The graphite PIRT panel identified numerous phenomena, five of which were ranked high importance-low knowledge. A further nine were ranked with high importance and medium knowledge rank. Two phenomena were ranked with medium importance and low knowledge, and a further 14 were ranked medium importance and medium knowledge rank. The last 12 phenomena were ranked with low importance and high knowledge rank (or similar combinations suggesting they have low priority). The ranking/scoring rationale for the reported graphite phenomena is discussed. Much has been learned about the behavior of graphite in reactor environments in the 60-plus years since the first graphite rectors went into service. The extensive list of references in the Bibliography is plainly testament to this fact. Our current knowledge base is well developed. Although data are lacking for the specific grades being considered for Generation IV (Gen IV

  2. Next Generation Nuclear Plant Phenomena Identification and Ranking Tables (PIRTs) Volume 3: Fission-Product Transport and Dose PIRTs

    Energy Technology Data Exchange (ETDEWEB)

    Morris, Robert Noel [ORNL

    2008-03-01

    This Fission Product Transport (FPT) Phenomena Identification and Ranking Technique (PIRT) report briefly reviews the high-temperature gas-cooled reactor (HTGR) FPT mechanisms and then documents the step-by-step PIRT process for FPT. The panel examined three FPT modes of operation: (1) Normal operation which, for the purposes of the FPT PIRT, established the fission product circuit loading and distribution for the accident phase. (2) Anticipated transients which were of less importance to the panel because a break in the pressure circuit boundary is generally necessary for the release of fission products. The transients can change the fission product distribution within the circuit, however, because temperature changes, flow perturbations, and mechanical vibrations or shocks can result in fission product movement. (3) Postulated accidents drew the majority of the panel's time because a breach in the pressure boundary is necessary to release fission products to the confinement. The accidents of interest involved a vessel or pipe break, a safety valve opening with or without sticking, or leak of some kind. Two generic scenarios were selected as postulated accidents: (1) the pressurized loss-of-forced circulation (P-LOFC) accident, and (2) the depressurized loss-of-forced circulation (D-LOFC) accidents. FPT is not an accident driver; it is the result of an accident, and the PIRT was broken down into a two-part task. First, normal operation was seen as the initial starting point for the analysis. Fission products will be released by the fuel and distributed throughout the reactor circuit in some fashion. Second, a primary circuit breach can then lead to their release. It is the magnitude of the release into and out of the confinement that is of interest. Depending on the design of a confinement or containment, the impact of a pressure boundary breach can be minimized if a modest, but not excessively large, fission product attenuation factor can be introduced into

  3. Development of a preliminary PIRT (Phenomena Identification and Ranking Table) of thermal-hydraulic phenomena for SMART

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Bub Dong; Lee, Won Jae; Kim, Hee Cheol; Song, Jin Ho; Sim, Suk Ku [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1997-12-31

    The work reported in this paper identifies the thermal-hydraulic phenomena that are expected to occur during a number of key transients in SMART (System-integrated Modular Advanced ReacTor) which is under development at KAERI. The result of this effort is based on the current design concept of SMART integral reactor. Although the design is still evolving, the preliminary Phenomena Identification and Ranking Table (PIRT) has been developed based on the experts` knowledge and experience. The preliminary PIRT has been developed by consensus of KAERI expert panelists and AHP (Analytical Hierarchy Process). Preliminary PIRT developed in this paper is intended to be used to identify and integrate development areas of further experimental tests needed, thermal hydraulic models and correlations and code improvements for the safety analysis of the SMART. 8 refs., 4 tabs (Author)

  4. Next Generation Nuclear Plant Phenomena Identification and Ranking Tables (PIRTs) Volume 1: Main Report

    Energy Technology Data Exchange (ETDEWEB)

    Ball, Sydney J [ORNL

    2008-03-01

    A phenomena identification and ranking table (PIRT) process was conducted for the Next Generation Nuclear Plant (NGNP) design. This design (in the conceptual stage) is a modular high-temperature gas-cooled reactor (HTGR) that generates both electricity and process heat for hydrogen production. Expert panels identified safety-relevant phenomena, ranked their importance, and assessed the knowledge levels in the areas of accidents and thermal fluids, fission-product transport and dose, high-temperature materials, graphite, and process heat for hydrogen production. This main report summarizes and documents the process and scope of the reviews, noting the major activities and conclusions. The identified phenomena, analyses, rationales, and associated ratings of the phenomena, plus a summary of each panel's findings, are presented. Individual panel reports for these areas are provided as attached volumes to this main report and provide considerably more detail about each panel's deliberations as well as a more complete listing of the phenomena that were evaluated.

  5. Large-break loss-of-coolant accident phenomena identification and ranking table (PIRT) for the advanced Candu reactor

    Energy Technology Data Exchange (ETDEWEB)

    Popov, N.; Snell, V.G.; Sills, H.E.; Langman, V.J.; Boyack, B. [Atomic Energy of Canada Ltd (Canada)

    2004-07-01

    The Advanced Candu Reactor (ACR) is an evolutionary advancement of the current Candu-6 reactor, aimed at producing electrical power for a capital cost and unit-energy cost significantly less than that of current reactor designs. The ACR retains the modular concept of horizontal fuel channels surrounded by heavy water moderator, as with all Candu reactors. However, ACR uses slightly enriched uranium (SEU) fuel, compared to the natural uranium used in Candu 6. This achieves the twin goals of improved economics (e.g., via reductions in the heavy water requirements and the use of a light water coolant), as well as improved safety. This paper is focused on the double-ended guillotine critical inlet header break (CRIHB) loss-of-coolant accident (LOCA) in an ACR reactor, which is considered as a large break LOCA. Large Break LOCA in water-cooled reactors has been used historically as a design basis event by regulators, and it has attracted a very large share of safety analysis and regulatory review. The LBLOCA event covers a wide range of system behaviours and fundamental phenomena. The Phenomena Identification and Ranking Table (PIRT) for LBLOCA therefore provides a good understanding of many of the safety characteristics of the ACR design. The paper outlines the design characteristics of the ACR reactor that impact the PIRT process and computer code applicability. It also describes the LOCA phenomena, lists all components and systems that have an important role during the event, discusses the PIRT process and results, and presents the final PIRT summary table. (authors)

  6. Next Generation Nuclear Plant Phenomena Identification and Ranking Tables (PIRTs) Volume 2: Accident and Thermal Fluids Analysis PIRTs

    Energy Technology Data Exchange (ETDEWEB)

    Ball, Sydney J [ORNL; Corradini, M. [University of Wisconsin; Fisher, Stephen Eugene [ORNL; Gauntt, R. [Sandia National Laboratories (SNL); Geffraye, G. [CEA, France; Gehin, Jess C [ORNL; Hassan, Y. [Texas A& M University; Moses, David Lewis [ORNL; Renier, John-Paul [ORNL; Schultz, R. [Idaho National Laboratory (INL); Wei, T. [Argonne National Laboratory (ANL)

    2008-03-01

    An accident, thermal fluids, and reactor physics phenomena identification and ranking process was conducted by a panel of experts on the next generation nuclear plant (NGNP) design (consideration given to both pebble-bed and prismatic gas-cooled reactor configurations). Safety-relevant phenomena, importance, and knowledge base were assessed for the following event classes: (1) normal operation (including some reactor physics aspects), (2) general loss of forced circulation (G-LOFC), (3) pressurized loss-of-forced circulation (P-LOFC), (4) depressurized loss-of-forced circulation (D-LOFC), (5) air ingress (following D-LOFC), (6) reactivity transients - including anticipated transients without scram (ATWS), (7) processes coupled via intermediate heat exchanger (IHX) (IHX failure with molten salt), and (8) steam/water ingress. The panel's judgment of the importance ranking of a given phenomenon (or process) was based on the effect it had on one or more figures of merit or evaluation criteria. These included public and worker dose, fuel failure, and primary (and other safety) system integrity. The major phenomena of concern that were identified and categorized as high importance combined with medium to low knowledge follow: (1) core coolant bypass flows (normal operation), (2) power/flux profiles (normal operation), (3) outlet plenum flows (normal operation), (4) reactivity-temperature feedback coefficients for high-plutonium-content cores (normal operation and accidents), (5) fission product release related to the transport of silver (normal operation), (6)emissivity aspects for the vessel and reactor cavity cooling system (G-LOFC), (7) reactor vessel cavity air circulation and heat transfer (G-LOFC), and (8)convection/radiation heating of upper vessel area (P-LOFC).

  7. Development of a preliminary PIRT (Phenomena Identification and Ranking Table) of thermal-hydraulic phenomena for 330MWt SMART integral reactor

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B. D.; Lee, W. J.; Sim, S. K.; Song, J. H.; Kim, H. C.

    1997-09-01

    The work reported in this document identifies the thermal-hydraulic phenomena that are expected to occur during a number of key transients in a 330 MWt SMART integral reactor which is under development at KAERI. The result of this efforts is based on the current design concept of SMART integral reactor. Although the design is still evolving, the preliminary Phenomena Identification and Ranking Table (PIRT) has been developed based on the experts` knowledge and experience. The preliminary PIRT has been developed by the consensus of KAERI expert panelists and AHP (Analytical Hierarchy Process). Preliminary PIRT developed in this report is intended for use to identify and integrate development areas of further experimental tests needed and thermal-hydraulic models and correlations and code improvements for the safety analysis of the SMART integral reactor. (author). 7 refs., 21 tabs., 22 figs.

  8. Preliminary phenomena identification and ranking tables for simplified boiling water reactor Loss-of-Coolant Accident scenarios

    Energy Technology Data Exchange (ETDEWEB)

    Kroeger, P.G.; Rohatgi, U.S.; Jo, J.H.; Slovik, G.C.

    1998-04-01

    For three potential Loss-of-Coolant Accident (LOCA) scenarios in the General Electric Simplified Boiling Water Reactors (SBWR) a set of Phenomena Identification and Ranking Tables (PIRT) is presented. The selected LOCA scenarios are typical for the class of small and large breaks generally considered in Safety Analysis Reports. The method used to develop the PIRTs is described. Following is a discussion of the transient scenarios, the PIRTs are presented and discussed in detailed and in summarized form. A procedure for future validation of the PIRTs, to enhance their value, is outlined. 26 refs., 25 figs., 44 tabs.

  9. A Preliminary PIRT Development Related to SWR Accidents from an SG Tube Failure

    Energy Technology Data Exchange (ETDEWEB)

    So, Dongsup; Jeong, Ji Young; Lee, Yong Bum [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

    2013-10-15

    The results of the PIRT, the uncertainties of the phenomena ranked as high priority can be reduced by an investigation or/and theoretical evaluation. The PIRT for IHTS due to SG tube rupture of Prototype GEN-IV Sodium cooled Fast Reactor (PGSFR) is on developing stage by the KAERI-ANL experts. These plausible phenomena can be applicable to the PIRT development of PGSFR having the similar concept of KALIMER-600. The Phenomena Identification and Ranking Table (PIRT) process was created as a systematic and documented means of completing a U. S. NRC's Code Scaling, Applicability, and Uncertainty exercise with a limited amount of resources. This paper describes a preliminary PIRT development for a Sodium-Water Reaction (SWR) accident with regard to a Steam Generator (SG) tube failure of the KALIMER-600 (Korea Advanced Liquid Metal Reactor). The plausible phenomena related to SWR accidents were developed.

  10. Development of the source term PIRT based on findings during Fukushima Daiichi NPPs accident

    Energy Technology Data Exchange (ETDEWEB)

    Suehiro, Shoichi, E-mail: suehiro-shouichi@tepsys.co.jp [TEPCO SYSTEMS Co., 2-37-28 Eitai, Koto-Ku, Tokyo 135-0034 (Japan); Sugimoto, Jun [Kyoto University, Yoshida Sakyo, Kyoto 606-8501 (Japan); Hidaka, Akihide [Japan Atomic Energy Agency, Tokai-mura, Naka-gun, Ibaraki 319-1195 (Japan); Okada, Hidetoshi [The Institute of Applied Energy, 14-2 Nishi-Shimbashi 1-Chome, Minato-ku, Tokyo 105-0003 (Japan); Mizokami, Shinya [Tokyo Electric Power Company, 1-3 Uchisaiwai-cho 1-Chome, Chiyoda-ku, Tokyo 100-8560 (Japan); Okamoto, Koji [The University of Tokyo, 2-22 Shirakata, Tokai-mura, Ibaraki 319-1188 (Japan)

    2015-05-15

    Highlights: • We developed the source term PIRT based on findings during the Fukushima accident. • The FoM is the masses or fractions of radionuclides released into the environment. • 68 phenomena were identified as influencing to the FoM. • Radionuclide release from molten fuel had the highest score in the early phase. • MCCI, iodine chemistry, and chemical form had the highest score in the later phase. - Abstract: Research Expert Committee on Evaluation of Severe Accident of AESJ (Atomic Energy Society of Japan) has developed thermal hydraulic PIRT (Phenomena Identification and Ranking Table) and source term (ST) PIRT based on findings during the Fukushima Daiichi NPPs accident. These PIRTs aim to explore the debris distribution and the current condition in the NPPs with high accuracy and to extract higher priority from the aspect of the sophistication of the analytical technology to predict the severe accident phenomena by the analytical codes. The ST PIRT is divided into 3 phases for time domain and 9 categories for spatial domain. The 68 phenomena have been extracted and the importance from the viewpoint of the source term has been ranked through brainstorming and discussions among experts. The present paper describes the developed ST PIRT list and summarizes the high ranked phenomena in each phase.

  11. Phenomena identification and ranking tables for Westinghouse AP600 small break loss-of-coolant accident, main steam line break, and steam generator tube rupture scenarios

    Energy Technology Data Exchange (ETDEWEB)

    Wilson, G.E.; Fletcher, C.D.; Davis, C.B. [and others

    1997-06-01

    This report revision incorporates new experimental evidence regarding AP600 behavior during small break loss-of-coolant accidents. This report documents the results of Phenomena Identification and Ranking Table (PIRT) efforts for the Westinghouse AP600 reactor. The purpose of this PIRT is to identify important phenomena so that they may be addressed in both the experimental programs and the RELAP5/MOD3 systems analysis computer code. In Revision of this report, the responses of AP600 during small break loss-of-coolant accident, main steam line break, and steam generator tube rupture accident scenarios were evaluated by a committee of thermal-hydraulic experts. Committee membership included Idaho National Engineering and Environmental Laboratory staff and recognized thermal-hydraulic experts from outside of the laboratory. Each of the accident scenarios was subdivided into separate, sequential periods or phases. Within each phase, the plant behavior is controlled by, at most, a few thermal-hydraulic processes. The committee identified the phenomena influencing those processes, and ranked & influences as being of high, medium, low, or insignificant importance. The primary product of this effort is a series of tables, one for each phase of each accident scenario, describing the thermal-hydraulic phenomena judged by the committee to be important, and the relative ranking of that importance. The rationales for the phenomena selected and their rankings are provided. This document issue incorporates an update of the small break loss-of-coolant accident portion of the report. This revision is the result of the release of experimental evidence from AP600-related integral test facilities (ROSA/AP600, OSU, and SPES) and thermal-hydraulic expert review. The activities associated with this update were performed during the period from June 1995 through November 1996. 8 refs., 26 figs., 42 tabs.

  12. Development of PIRT and Assessment Matrix for Verification and Validation of Sodium Fire Analysis Codes

    Science.gov (United States)

    Ohno, Shuji; Ohshima, Hiroyuki; Tajima, Yuji; Ohki, Hiroshi

    Thermodynamic consequence in liquid sodium leak and fire accident is one of the important issues to be evaluated when considering the safety aspect of fast reactor plant building. The authors are therefore initiating systematic verification and validation (V&V) activity to assure and demonstrate the reliability of numerical simulation tool for sodium fire analysis. The V&V activity is in progress with the main focuses on already developed sodium fire analysis codes SPHINCS and AQUA-SF. The events to be evaluated are hypothetical sodium spray, pool, or combined fire accidents followed by thermodynamic behaviors postulated in a plant building. The present paper describes that the ‘Phenomena Identification and Ranking Table (PIRT)’ is developed at first for clarifying the important validation points in the sodium fire analysis codes, and that an ‘Assessment Matrix’ is proposed which summarizes both separate effect tests and integral effect tests for validating the computational models or whole code for important phenomena. Furthermore, the paper shows a practical validation with a separate effect test in which the spray droplet combustion model of SPHINCS and AQUA-SF predicts the burned amount of a falling sodium droplet with the error mostly less than 30%.

  13. A ranking system for prescribed burn prioritization in Table Mountain National Park, South Africa.

    Science.gov (United States)

    Cowell, Carly Ruth; Cheney, Chad

    2017-04-01

    To aid prescribed burn decision making in Table Mountain National Park, in South Africa a priority ranking system was tested. Historically a wildfire suppression strategy was adopted due to wildfires threatening urban areas close to the park, with few prescribed burns conducted. A large percentage of vegetation across the park exceeded the ecological threshold of 15 years. We held a multidisciplinary workshop, to prioritize areas for prescribed burning. Fire Management Blocks were mapped and assessed using the following seven categories: (1) ecological, (2) management, (3) tourism, (4) infrastructure, (5) invasive alien vegetation, (6) wildland-urban interface and (7) heritage. A priority ranking system was used to score each block. The oldest or most threatened vegetation types were not necessarily the top priority blocks. Selected blocks were burnt and burning fewer large blocks proved more effective economically, ecologically and practically due to the limited burning days permitted. The prioritization process was efficient as it could be updated annually following prescribed burns and wildfire incidents. Integration of prescribed burn planning and wildfire suppression strategies resulted in a reduction in operational costs. We recommend protected areas make use of a priority ranking system developed with expert knowledge and stakeholder engagement to determine objective prescribed burn plans.

  14. Ranking of severe accident research priorities

    Energy Technology Data Exchange (ETDEWEB)

    Schwinges, B. [Gesell Anlagen and Reaktorsicherheit GRS mbH, D-50667 Cologne (Germany); Journeau, C. [CEA Cadarache, DEN STRI LMA, F-13115 St Paul Les Durance (France); Haste, T. [Paul Scherrer Inst, NES LTH, OVGA 312, CH-5232 Villigen (Switzerland); Meyer, L.; Tromm, W. [Forschungszentrum Karlsruhe, D-76021 Karlsruhe (Germany); Trambauer, K. [GRS mbH, Forschungsgelande, D-85748 Garching (Germany)

    2010-07-01

    The objectives of the SARNET network are to define common research programmes in the field of severe accidents and to develop common computer tools and methodologies for safety assessment in this field. To reach these objectives, one of the work packages, named 'Severe Accident Research Priorities' (SARP), aimed at reviewing and reassessing the priorities of research issues as a basis to harmonize and to re-orient research programmes, to define new ones, and to close - if possible - resolved issues on a common basis. The work was performed in close collaboration with 8 participating institutions, led by GRS, representing technical safety organisations, industry and utilities (IRSN, CEA, EDF, FZK, GRS, KTH, TUS, VTT). This action made use notably of (1) the outcomes of the EURSAFE project in the 5. Framework Programme, i. e. the Phenomena Identification and Ranking Tables (PIRT) on severe accidents, (2) the results of the validation and benchmarking activities on ASTEC, (3) the results of reactor calculations carried out in the other SARNET tasks, and (4) the outcome of the research performed in the three thematic sub-domains of SARNET (corium, containment and source term). The main outcome of EURSAFE was a list of 21 topics which included recommendations for experimental programmes and code developments. This list formed the basis of the work in SARP. Also the methodology applied in EURSAFE to consider both the risk potential and the severe accident issues where large uncertainties still subsist was adopted. The analyses of the progress of research and development activities considered whether (1) any research issue was resolved due to reduction of uncertainties or gain of scientific insights, (2) any new issue had to be added to the list of needed research, (3) any new process or phenomenon had to be included in the general PIRT list taking into account the safety relevance and the lack of knowledge, and (4) any new accident management program has to be

  15. The role of the PIRT process in identifying code improvements and executing code development

    Energy Technology Data Exchange (ETDEWEB)

    Wilson, G.E. [Idaho National Engineering Lab., Idaho Falls, ID (United States); Boyack, B.E. [Los Alamos National Lab., NM (United States)

    1997-07-01

    In September 1988, the USNRC issued a revised ECCS rule for light water reactors that allows, as an option, the use of best estimate (BE) plus uncertainty methods in safety analysis. The key feature of this licensing option relates to quantification of the uncertainty in the determination that an NPP has a {open_quotes}low{close_quotes} probability of violating the safety criteria specified in 10 CFR 50. To support the 1988 licensing revision, the USNRC and its contractors developed the CSAU evaluation methodology to demonstrate the feasibility of the BE plus uncertainty approach. The PIRT process, Step 3 in the CSAU methodology, was originally formulated to support the BE plus uncertainty licensing option as executed in the CSAU approach to safety analysis. Subsequent work has shown the PIRT process to be a much more powerful tool than conceived in its original form. Through further development and application, the PIRT process has shown itself to be a robust means to establish safety analysis computer code phenomenological requirements in their order of importance to such analyses. Used early in research directed toward these objectives, PIRT results also provide the technical basis and cost effective organization for new experimental programs needed to improve the safety analysis codes for new applications. The primary purpose of this paper is to describe the generic PIRT process, including typical and common illustrations from prior applications. The secondary objective is to provide guidance to future applications of the process to help them focus, in a graded approach, on systems, components, processes and phenomena that have been common in several prior applications.

  16. A comparison of hierarchical cluster analysis and league table rankings as methods for analysis and presentation of district health system performance data in Uganda.

    Science.gov (United States)

    Tashobya, Christine K; Dubourg, Dominique; Ssengooba, Freddie; Speybroeck, Niko; Macq, Jean; Criel, Bart

    2016-03-01

    In 2003, the Uganda Ministry of Health introduced the district league table for district health system performance assessment. The league table presents district performance against a number of input, process and output indicators and a composite index to rank districts. This study explores the use of hierarchical cluster analysis for analysing and presenting district health systems performance data and compares this approach with the use of the league table in Uganda. Ministry of Health and district plans and reports, and published documents were used to provide information on the development and utilization of the Uganda district league table. Quantitative data were accessed from the Ministry of Health databases. Statistical analysis using SPSS version 20 and hierarchical cluster analysis, utilizing Wards' method was used. The hierarchical cluster analysis was conducted on the basis of seven clusters determined for each year from 2003 to 2010, ranging from a cluster of good through moderate-to-poor performers. The characteristics and membership of clusters varied from year to year and were determined by the identity and magnitude of performance of the individual variables. Criticisms of the league table include: perceived unfairness, as it did not take into consideration district peculiarities; and being oversummarized and not adequately informative. Clustering organizes the many data points into clusters of similar entities according to an agreed set of indicators and can provide the beginning point for identifying factors behind the observed performance of districts. Although league table ranking emphasize summation and external control, clustering has the potential to encourage a formative, learning approach. More research is required to shed more light on factors behind observed performance of the different clusters. Other countries especially low-income countries that share many similarities with Uganda can learn from these experiences. © The Author 2015

  17. Making the Best of a World Dominated by League Tables? New Developments in the International Ranking of Universities

    Science.gov (United States)

    Observatory on Borderless Higher Education, 2010

    2010-01-01

    Two interesting initiatives have started to develop more balanced international league tables of universities. The first initiative is being taken by UK magazine the Times Higher Education (THE), which recently entered into a collaboration with both the international academic community and research-metrics company Thomsons Reuters to create an…

  18. 基于秩方法的列联表数据独立性检验%Test of the Independence of Contingency Tables Based on Rank Method

    Institute of Scientific and Technical Information of China (English)

    黄基廷

    2015-01-01

    Contingency table test is an important part of the independence of the inspection, the χ2 test is commonly used in elementary textbooks, which is relatively conservative.This paper addresses two different alter-native hypothesis, taking different methods of construction rank statistics to test, and illustrates that under the con-dition of adequate priori knowledge, the test is more effective thanχ2 .%列联表检验是独立性检验的一个重要内容,在初等教材中常用的是χ2检验,这是一种比较保守的检验法。针对有序和无序两个不同的对立假设,用秩方法构造不同的统计量进行检验,并通过实际例子说明了在先验知识比较充足的条件下,该检验法比χ2检验法有效。

  19. Accounting for beta-particle energy loss to cortical bone via paired-image radiation transport (PIRT).

    Science.gov (United States)

    Shah, Amish P; Rajon, Didier A; Patton, Phillip W; Jokisch, Derek W; Bolch, Wesley E

    2005-05-01

    Current methods of skeletal dose assessment in both medical physics (radionuclide therapy) and health physics (dose reconstruction and risk assessment) rely heavily on a single set of bone and marrow cavity chord-length distributions in which particle energy deposition is tracked within an infinite extent of trabecular spongiosa, with no allowance for particle escape to cortical bone. In the present study, we introduce a paired-image radiation transport (PIRT) model which provides a more realistic three-dimensional (3D) geometry for particle transport in the skeletal site at both microscopic and macroscopic levels of its histology. Ex vivo CT scans were acquired of the pelvis, cranial cap, and individual ribs excised from a 66-year male cadaver (BMI of 22.7 kg m(-2)). For the three skeletal sites, regions of trabecular spongiosa and cortical bone were identified and segmented. Physical sections of interior spongiosa were taken and subjected to microCT imaging. Voxels within the resulting microCT images were then segmented and labeled as regions of bone trabeculae, endosteum, active marrow, and inactive marrow through application of image processing algorithms. The PIRT methodology was then implemented within the EGSNRC radiation transport code whereby electrons of various initial energies are simultaneously tracked within both the ex vivo CT macroimage and the CT microimage of the skeletal site. At initial electron energies greater than 50-200 keV, a divergence in absorbed fractions to active marrow are noted between PIRT model simulations and those estimated under existing techniques of infinite spongiosa transport. Calculations of radionuclide S values under both methodologies imply that current chord-based models may overestimate the absorbed dose to active bone marrow in these skeletal sites by 0% to 27% for low-energy beta emitters (33P, 169Er, and 177Lu), by approximately 4% to 49% for intermediate-energy beta emitters (153Sm, 186Re, and 89Sr), and by

  20. Ranking the rankings

    NARCIS (Netherlands)

    Sikkema, A.; Ruitenbeek, van H.C.G.; Gerritsma, W.; Wouters, P.

    2014-01-01

    In een academische wereld die steeds competitiever wordt, willen we graag weten wat ‘de beste’ universiteit is. Verschillende rankings bedienen ons op onze wenken, waaronder Times Higher Education, Sjanghai, QS en Leiden. De kritiek op die lijsten is echter niet mals, ook omdat universiteiten graag

  1. University Rankings in Critical Perspective

    Science.gov (United States)

    Pusser, Brian; Marginson, Simon

    2013-01-01

    This article addresses global postsecondary ranking systems by using critical-theoretical perspectives on power. This research suggests rankings are at once a useful lens for studying power in higher education and an important instrument for the exercise of power in service of dominant norms in global higher education. (Contains 1 table and 1…

  2. Tangled Rankings

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    Declining recognition of top university lists prompts China to look for new ways to evaluate its higher learning institutions Zhejiang University for the first time has overtaken Peking University and Tsinghua University to rank No.1 on the latest list of Chinese college rankings.The rankings are an important part of the book Picking Your University and

  3. To rank or to be ranked: the impact of global rankings in higher education

    NARCIS (Netherlands)

    Marginson, Simon; Wende, van der Marijk

    2007-01-01

    Global university rankings have cemented the notion of a world university market arranged in a single "league table" for comparative purposes and have given a powerful impetus to intranational and international competitive pressures in the sector. Both the research rankings by Shanghai Jiao Tong Uni

  4. Ranking scientists

    CERN Document Server

    Dorogovtsev, S N

    2015-01-01

    Currently the ranking of scientists is based on the $h$-index, which is widely perceived as an imprecise and simplistic though still useful metric. We find that the $h$-index actually favours modestly performing researchers and propose a simple criterion for proper ranking.

  5. University rankings: The web ranking

    Directory of Open Access Journals (Sweden)

    Isidro F. Aguillo

    2012-03-01

    Full Text Available 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 rankings, paying special attention to their potential benefits and limitations. The Web Ranking is analyzed in depth, presenting the model on which its compound indicator is based and analyzing its different variables. ------- Rankings de universidades: El ranking web Resumen La publicación en 2003 del Ranking de Universidades de la Universidad Jiao Tong de Shanghai ha revolucionado no sólo los estudios académicos sobre la Educación Superior, sino que también ha tenido un importante impacto sobre las políticas nacionales y las estrategias individuales del sector. El trabajo recoge las principales características de este y otros rankings mundiales de universidades, prestando especial atención a sus potencialidades y limitaciones. Se analiza en profundidad el Ranking Web, presentando el modelo en el que se basa su indicador compuesto y analizando sus diferentes variables y principales resultados. DOI: 10.18870/hlrc.v2i1.56   PDF document contains both the original in Spanish and an English translation.

  6. Spectral Ranking

    CERN Document Server

    Vigna, Sebastiano

    2009-01-01

    This note tries to attempt a sketch of the history of spectral ranking, a general umbrella name for techniques that apply the theory of linear maps (in particular, eigenvalues and eigenvectors) to matrices that do not represent geometric transformations, but rather some kind of relationship between entities. Albeit recently made famous by the ample press coverage of Google's PageRank algorithm, spectral ranking was devised more than fifty years ago, almost exactly in the same terms, and has been studied in psychology and social sciences. I will try to describe it in precise and modern mathematical terms, highlighting along the way the contributions given by previous scholars.

  7. League tables for orthodontists

    Science.gov (United States)

    Richmond, Stephen; Phillips, Ceri; Durning, Peter

    2008-01-01

    The aim of this study was to explore the complexities in constructing league tables purporting to measure orthodontic clinical outcomes. Eighteen orthodontists were invited to participate in a cost-effectiveness study. Each orthodontist was asked to provide information on 100 consecutively treated patients. The Index of Complexity, Outcome, and Need (ICON) was used to assess treatment need, complexity, and outcome prior to, and on completion of, orthodontic treatment. The 18 orthodontists were ranked based on achieving a successful orthodontic outcome (ICON score less than or equal to 30) and the uncertainty in both the success rates and rankings was also quantified using confidence intervals. Successful outcomes were achieved in 62 per cent of the sample (range 19–94 per cent); four of the 18 orthodontists failed to achieve more than a 50 per cent success rate. In developing league tables, it is imperative that factors such as case mix are identified and accounted for in producing rankings. Bayesian hierarchical modelling was used to achieve this and to quantify uncertainty in the rankings produced. When case mix was taken into account, the four with low success rates were clearly not as good as the top four performing orthodontists. League tables can be valuable for the individual orthodontist, groups of orthodontists, payment/insurance agencies, and the public to enable informed choice for orthodontic provision but must be correctly constructed so that users can have confidence in them. PMID:18687990

  8. 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 e...

  9. Ranking production units according to marginal efficiency contribution

    DEFF Research Database (Denmark)

    Ghiyasi, Mojtaba; Hougaard, Jens Leth

    League tables associated with various forms of service activities from schools to hospitals illustrate the public need for ranking institutions by their productive performance. We present a new method for ranking production units which is based on each units marginal contribution to the technical...

  10. Ranking Operations Management Conferences

    NARCIS (Netherlands)

    Steenhuis, Harm-Jan; Bruijn, de Erik Joost; 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

  11. Table Manners

    Institute of Scientific and Technical Information of China (English)

    2004-01-01

    Good table manners are more than about proper eating,it’s about being kind and considerate of others.Although table manners are different from country to country,they still share some similarities both in good and bad table manners.

  12. 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.

  13. 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.

  14. Introduction: towards a new ranking approach in higher education and research

    NARCIS (Netherlands)

    Westerheijden, Donald F.; Ziegele, Frank; van Vught, Franciscus A.; Ziegele, Frank

    2012-01-01

    This chapter introduces the subject of league tables and rankings and questions the conceptual framework underpinning what are seen as the most credible and prestigious ranking systems in higher education. The authors present their arguments for defining and ranking excellence in higher education

  15. Ranking Dutch Economists

    NARCIS (Netherlands)

    van Ours, J.C.; Vermeulen, F.M.P.

    2007-01-01

    This paper ranks Dutch economists using information about publications and citations. Rankings involve the aggregation of several performance dimensions. Instead of using a cardinal approach, where each dimension is weighted based on impact factors of journals for example, we use an ordinal approach

  16. On Page Rank

    NARCIS (Netherlands)

    Hoede, C.

    2008-01-01

    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 Ka

  17. 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.

  18. Hierarchical partial order ranking.

    Science.gov (United States)

    Carlsen, Lars

    2008-09-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 prioritization of polluted sites is given.

  19. 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...

  20. 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...

  1. In TripAdvisor we trust: Rankings, calculative regimes and systems trust

    OpenAIRE

    Jeacle, I.; Carter, Chris

    2011-01-01

    A proliferation of rankings and league tables increasingly permeate everyday life. An objective of this paper is to explain the profusion of such rankings, in particular on-line user review rankings, in contemporary society and what this means for our understanding of the role of accounting. The online travel website TripAdvisor and its hotel ranking system is a prominent example of this new phenomenon. The site increasingly appears to play the role of trusted intermediary for the ‘independen...

  2. DESIGN AND IMPLEMENTATION OF NATIONAL COMPUTER RANK I EXAMINATION SYSTEM PROCESS EVALUATION BASED ON FEATURE TABLE%基于特征表的过程测评计算机一级考试系统的设计与实现

    Institute of Scientific and Technical Information of China (English)

    罗叶飞; 刘建勋

    2011-01-01

    HOOK API is an advanced programming technology under Windows development environment, while BHO is an industrial standard of MSIE public interactive interface for third-party programmers. Trie thesis tries to solve such problems in present national computer rank I examination executed on the computer as failures in automatic marking, process-based step-by-step scoring and coping with new questions in the examination system etc. By introducing feature table based process evaluation approach.%HOOK API是Windows开发环境下一种高级编程技术,而BHO(Browser Helper Object)是微软浏览器对第三方程序员开放交互接口的业界标准.提出通过HOOK函数重定向和BHO浏览器拦截,运用基于特征表的过程解析方法来解决现今计算机等级考试系统(一级)机试中不能自动阅卷、基于过程的分步骤记分和考试系统中对新题目的适应性等问题.

  3. 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....

  4. 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.

  5. 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...

  6. 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...

  7. 2006 China Retail Ranking

    Institute of Scientific and Technical Information of China (English)

    LEO LIU; JIANG TAO

    2006-01-01

    @@ The rankings of China's leading retailers for fastmoving consumer goods,a collaboration between Beijingbased CTR Market Research and CIB, comes into its third term. According to our findings,with the competitive advantages such as better shopping environments and cheaper prices,the large-scale retailers, or hypermarkets, are continuing to increase their market shares.

  8. 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) entri...... 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.......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...

  9. 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 ...

  10. Interference Alignment as a Rank Constrained Rank Minimization

    CERN Document Server

    Papailiopoulos, Dimitris S

    2010-01-01

    We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel is equivalent to a rank constrained rank minimization problem, when the signal spaces span all available dimensions. The rank minimization corresponds to maximizing interference alignment (IA) such that interference spans the lowest dimensional subspace possible. The rank constraints account for the useful signal spaces spanning all available spatial dimensions. That way, we reformulate all IA requirements to requirements involving ranks. Then, we present a convex relaxation of the RCRM problem inspired by recent results in compressed sensing and low-rank matrix completion theory that rely on approximating rank with the nuclear norm. We show that the convex envelope of the sum of ranks of the interference matrices is the sum of their corresponding nuclear norms and introduce tractable constraints that are asymptotically equivalent to the rank constraints for the ini...

  11. Low rank Multivariate regression

    CERN Document Server

    Giraud, Christophe

    2010-01-01

    We consider in this paper the multivariate regression problem, when the target regression matrix $A$ is close to a low rank matrix. Our primary interest in on the practical case where the variance of the noise is unknown. Our main contribution is to propose in this setting a criterion to select among a family of low rank estimators and prove a non-asymptotic oracle inequality for the resulting estimator. We also investigate the easier case where the variance of the noise is known and outline that the penalties appearing in our criterions are minimal (in some sense). These penalties involve the expected value of the Ky-Fan quasi-norm of some random matrices. These quantities can be evaluated easily in practice and upper-bounds can be derived from recent results in random matrix theory.

  12. Den ranke ryg

    DEFF Research Database (Denmark)

    Bonde, Hans

    2016-01-01

    Om dengang en gymnastikpædagog og højskoleforstander fik en hel generation af bondekarle til at ranke ryggen, løfte blikket og se de andre klasser i øjnene. Og om hvordan samme forstander fattede stærk sympati for nazismen og sågar fik lejlighed til at veksle ord med Hitler.......Om dengang en gymnastikpædagog og højskoleforstander fik en hel generation af bondekarle til at ranke ryggen, løfte blikket og se de andre klasser i øjnene. Og om hvordan samme forstander fattede stærk sympati for nazismen og sågar fik lejlighed til at veksle ord med Hitler....

  13. Sync-rank: Robust Ranking, Constrained Ranking and Rank Aggregation via Eigenvector and SDP Synchronization

    Science.gov (United States)

    2015-04-28

    Netflix [15], the Cite-Seer network of citations [29], or for ranking of college football teams [31]. Another setting which can be reduced to the...centrality measures have been proposed for the analysis of temporal network data in neuroscience , for studying the functional activity in the human brain using...given the score sheet of all soccer games in the England Football Premier League, recording the goal difference for each game, but without disclosing who

  14. Multiplex PageRank

    CERN Document Server

    Halu, Arda; Pansaraza, 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 in...

  15. On the 3-rank of tame kernels of certain pure cubic number fields

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    In this paper,we present some explicit formulas for the 3-rank of the tame kernels of certain pure cubic number fields,and give the density results concerning the 3-rank of the tame kernels.Numerical examples are given in Tables 1 and 2.

  16. Solving the Ranking and Selection Indifference-Zone Formulation for Normal Distributions Using Computer Software

    Science.gov (United States)

    1993-12-01

    solutions to the integral expression for various ranking and selecting problems but these tables are dispersed throughout the literature; They are not...Distributions," Trabajos De Estadistica , 15 - 31 (1966). 3. Bechhofer, Robert E. "A Single-Sample Multiple Decision Procedure For Rank- ing Means of

  17. Rankings from Fuzzy Pairwise Comparisons

    NARCIS (Netherlands)

    Broek, van den Pim; Noppen, Joost; Mohammadian, M.

    2006-01-01

    We propose a new method for deriving rankings from fuzzy pairwise comparisons. It is based on the observation that quantification of the uncertainty of the pairwise comparisons should be used to obtain a better crisp ranking, instead of a fuzzified version of the ranking obtained from crisp pairwise

  18. 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…

  19. 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…

  20. Fractional cointegration rank estimation

    DEFF Research Database (Denmark)

    Lasak, Katarzyna; Velasco, Carlos

    We consider cointegration rank estimation for a p-dimensional Fractional Vector Error Correction Model. We propose a new two-step procedure which allows testing for further long-run equilibrium relations with possibly different persistence levels. The fi…rst step consists in estimating......-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...

  1. Ranking environmental liabilities in the petroleum industry

    Energy Technology Data Exchange (ETDEWEB)

    Lupo, M.J.

    1996-12-31

    An exploration, production, transportation, or refining company may have numerous discontinued operations, as well as active process units that may emit potentially hazardous chemicals into the environment. These sources can impact different environmental media including air, soil, groundwater, the unsaturated zone above the water table, and surface water. The number of chemicals of concern may be large. A procedure is put forth for ranking 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, and (3) by cost benefit. Ranking each remediation project enables management to realize the maximum benefit from environmental remediation projects by strategically planning the investment of limited resources. An example is presented in which a subset of the remediation projects is chosen for funding. If the sources were chosen for remediation based on their risk, one would achieve more than 95% of the planned risk reduction at nearly 75% of the total cost of all of the projects. On the other hand, if the projects were selected based on the cost-benefit analysis, 85% of the planned risk reduction could be attained with only 15.5% of the planned budget.

  2. Rankings, creatividad y urbanismo

    Directory of Open Access Journals (Sweden)

    JOAQUÍN SABATÉ

    2008-08-01

    Full Text Available La competencia entre ciudades constituye uno de los factores impulsores de procesos de renovación urbana y los rankings han devenido instrumentos de medida de la calidad de las ciudades. Nos detendremos en el caso de un antiguo barrio industrial hoy en vías de transformación en distrito "creativo" por medio de una intervención urbanística de gran escala. Su análisis nos descubre tres claves críticas. En primer lugar, nos obliga a plantearnos la definición de innovación urbana y cómo se integran el pasado, la identidad y la memoria en la construcción del futuro. Nos lleva a comprender que la innovación y el conocimiento no se "dan" casualmente, sino que son el fruto de una larga y compleja red en la que participan saberes, espacios, actores e instituciones diversas en naturaleza, escala y magnitud. Por último nos obliga a reflexionar sobre el valor que se le otorga a lo local en los procesos de renovación urbana.Competition among cities constitutes one ofthe main factors o furban renewal, and rankings have become instruments to indícate cities quality. Studying the transformation of an old industrial quarter into a "creative district" by the means ofa large scale urban project we highlight three main conclusions. First, itasks us to reconsider the notion ofurban innovation and hoto past, identity and memory should intégrate the future development. Second, it shows that innovation and knowledge doesn't yield per chance, but are the result ofa large and complex grid of diverse knowledges, spaces, agents and institutions. Finally itforces us to reflect about the valué attributed to the "local" in urban renewalprocesses.

  3. 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.

  4. 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).

  5. Podium: Ranking Data Using Mixed-Initiative Visual Analytics.

    Science.gov (United States)

    Wall, Emily; Das, Subhajit; Chawla, Ravish; Kalidindi, Bharath; Brown, Eli T; Endert, Alex

    2017-08-29

    People often rank and order data points as a vital part of making decisions. Multi-attribute ranking systems are a common tool used to make these data-driven decisions. Such systems often take the form of a table-based visualization in which users assign weights to the attributes representing the quantifiable importance of each attribute to a decision, which the system then uses to compute a ranking of the data. However, these systems assume that users are able to quantify their conceptual understanding of how important particular attributes are to a decision. This is not always easy or even possible for users to do. Rather, people often have a more holistic understanding of the data. They form opinions that data point A is better than data point B but do not necessarily know which attributes are important. To address these challenges, we present a visual analytic application to help people rank multi-variate data points. We developed a prototype system, Podium, that allows users to drag rows in the table to rank order data points based on their perception of the relative value of the data. Podium then infers a weighting model using Ranking SVM that satisfies the user's data preferences as closely as possible. Whereas past systems help users understand the relationships between data points based on changes to attribute weights, our approach helps users to understand the attributes that might inform their understanding of the data. We present two usage scenarios to describe some of the potential uses of our proposed technique: (1) understanding which attributes contribute to a user's subjective preferences for data, and (2) deconstructing attributes of importance for existing rankings.Our proposed approach makes powerful machine learning techniques more usable to those who may not have expertise in these areas.

  6. 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.

  7. Les Tables de salon (Coffee Tables)

    Science.gov (United States)

    Rondina, Marisa; Gilbert, Rodrigue

    1977-01-01

    Terms for such things as furniture in English reflect function and are specific, not generic in nature. French equivalents are based on linguistic criteria. "Tables basses" or "tables de salon" are equivalents of "coffee tables"; they illustrate the tendency toward the generic of the French language. (Text is in French.) (AMH)

  8. Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search.

    Science.gov (United States)

    Liu, Xianglong; Deng, Cheng; Lang, Bo; Tao, Dacheng; Li, Xuelong

    2016-02-01

    Recent years have witnessed the success of binary hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually built using hashing to cover more desired results in the hit buckets of each table. However, rare work studies the unified approach to constructing multiple informative hash tables using any type of hashing algorithms. Meanwhile, for multiple table search, it also lacks of a generic query-adaptive and fine-grained ranking scheme that can alleviate the binary quantization loss suffered in the standard hashing techniques. To solve the above problems, in this paper, we first regard the table construction as a selection problem over a set of candidate hash functions. With the graph representation of the function set, we propose an efficient solution that sequentially applies normalized dominant set to finding the most informative and independent hash functions for each table. To further reduce the redundancy between tables, we explore the reciprocal hash tables in a boosting manner, where the hash function graph is updated with high weights emphasized on the misclassified neighbor pairs of previous hash tables. To refine the ranking of the retrieved buckets within a certain Hamming radius from the query, we propose a query-adaptive bitwise weighting scheme to enable fine-grained bucket ranking in each hash table, exploiting the discriminative power of its hash functions and their complement for nearest neighbor search. Moreover, we integrate such scheme into the multiple table search using a fast, yet reciprocal table lookup algorithm within the adaptive weighted Hamming radius. In this paper, both the construction method and the query-adaptive search method are general and compatible with different types of hashing algorithms using different feature spaces and/or parameter settings. Our extensive experiments on several large-scale benchmarks demonstrate that the proposed techniques can significantly outperform both

  9. Ranking Models in Conjoint Analysis

    NARCIS (Netherlands)

    K.Y. Lam (Kar Yin); A.J. Koning (Alex); Ph.H.B.F. Franses (Philip Hans)

    2010-01-01

    textabstractIn this paper we consider the estimation of probabilistic ranking models in the context of conjoint experiments. By using approximate rather than exact ranking probabilities, we do not need to compute high-dimensional integrals. We extend the approximation technique proposed by

  10. Active Ranking using Pairwise Comparisons

    CERN Document Server

    Jamieson, Kevin G

    2011-01-01

    This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of $n$ objects can be identified by standard sorting methods using $n log_2 n$ pairwise comparisons. We are interested in natural situations in which relationships among the objects may allow for ranking using far fewer pairwise comparisons. Specifically, we assume that the objects can be embedded into a $d$-dimensional Euclidean space and that the rankings reflect their relative distances from a common reference point in $R^d$. We show that under this assumption the number of possible rankings grows like $n^{2d}$ and demonstrate an algorithm that can identify a randomly selected ranking using just slightly more than $d log n$ adaptively selected pairwise comparisons, on average. If instead the comparisons are chosen at random, then almost all pairwise comparisons must be made in order to identify any ranking. In addition, we propose a robust, error-tolerant algorith...

  11. 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...

  12. University Ranking as Social Exclusion

    Science.gov (United States)

    Amsler, Sarah S.; Bolsmann, Chris

    2012-01-01

    In this article we explore the dual role of global university rankings in the creation of a new, knowledge-identified, transnational capitalist class and in facilitating new forms of social exclusion. We examine how and why the practice of ranking universities has become widely defined by national and international organisations as an important…

  13. The Asymptotics of Ranking Algorithms

    CERN Document Server

    Duchi, John C; Jordan, Michael I

    2012-01-01

    We consider the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all items, which is rarely feasible in practice. Instead, individuals routinely provide partial preference information, such as pairwise comparisons of items, and more practical approaches to ranking have aimed at modeling this partial preference data directly. As we show, however, such an approach has serious theoretical shortcomings. Indeed, we demonstrate that many commonly used surrogate losses for pairwise comparison data do not yield consistency; surprisingly, we show inconsistency even in low-noise settings. With these negative results as motivation, we present a new approach to supervised ranking based on aggregation of partial preferences and develop $U$-statistic-based empirical risk minimi...

  14. Improving Ranking Using Quantum Probability

    CERN Document Server

    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 false alarm and the same parameter estimation data. As quantum probability provided more effective detectors than classical probability within other domains that data management, we conjecture that, the system that can implement subspace-based detectors shall be more effective than a system which implements a set-based detectors, the effectiveness being calculated as expected recall estimated over the probability of detection and expected fallout estimated over the probability of false alarm.

  15. Joint Sport Classification of Ukraine and ranking standards in powerlifting

    Directory of Open Access Journals (Sweden)

    Stetsenko A.I.

    2010-01-01

    Full Text Available Realization of motion potential of a human happens more often in the process of his competitive activity. Criteria for the assessment of such activity's success are sport trophies (medals, cups, certificates, diplomas and correspondence of competitive results to sport ranks and categories. Joint sport classification of Ukraine is an important regulatory enactment of the physical education and sports sphere of country's life activity, that's why requirements and regulations of sport ranks and categories conferment require scientific-pragmatic approach. Performance of powerlifters, who are divided into weight categories, has progressive and advanced character. These and other factories complicate solving of the problem according the definition of logical algorithm of the table forming of ranking standards.

  16. Universal scaling in sports ranking

    CERN Document Server

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

    2011-01-01

    Ranking is a ubiquitous phenomenon in the human society. By clicking the web pages of Forbes, you may find all kinds of rankings, such as world's most powerful people, world's richest people, top-paid tennis stars, and so on and so forth. Herewith, we study a specific kind, sports ranking systems in which players' scores and prize money are calculated based on their performances in attending various tournaments. A typical example is tennis. It is found that the distributions of both scores and prize money follow universal power laws, with exponents nearly identical for most sports fields. 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 will top 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 simul...

  17. 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.

  18. On rank 5 projective planes

    Directory of Open Access Journals (Sweden)

    Otto Bachmann

    1984-01-01

    Full Text Available In this paper we continue the study of projective planes which admit collineation groups of low rank (Kallaher [1] and Bachmann [2,3]. A rank 5 collineation group of a projective plane ℙ of order n≠3 is proved to be flag-transitive. As in the rank 3 and rank 4 case this implies that is ℙ not desarguesian and that n is (a prime power of the form m4 if m is odd and n=m2 with m≡0mod4 if n is even. Our proof relies on the classification of all doubly transitive groups of finite degree (which follows from the classification of all finite simple groups.

  19. PageRank of integers

    CERN Document Server

    Frahm, K M; Shepelyansky, D L

    2012-01-01

    We build 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 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 to find this vector for matrices of billion size. This network provides a new PageRank order of integers.

  20. Rank of Stably Dissipative Graphs

    CERN Document Server

    Duarte, Pedro

    2011-01-01

    For the class of stably dissipative Lotka-Volterra systems we prove that the rank of its defining matrix, which is the dimension of the associated invariant foliation, is completely determined by the system's graph.

  1. Ranking Queries on Uncertain Data

    CERN Document Server

    Hua, Ming

    2011-01-01

    Uncertain data is inherent in many important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of those applications and rapidly increasing amounts of uncertain data collected and accumulated, analyzing large collections of uncertain data has become an important task. Ranking queries (also known as top-k queries) are often natural and useful in analyzing uncertain data. Ranking Queries on Uncertain Data discusses the motivations/applications, challenging problems, the fundamental principles, and the evaluation algorith

  2. Rank Pooling for Action Recognition.

    Science.gov (United States)

    Fernando, Basura; Gavves, Efstratios; Oramas M, Jose Oramas; Ghodrati, Amir; Tuytelaars, Tinne

    2017-04-01

    We propose a function-based temporal pooling method that captures the latent structure of the video sequence data - e.g., how frame-level features evolve over time in a video. We show how the parameters of a function that has been fit to the video data can serve as a robust new video representation. As a specific example, we learn a pooling function via ranking machines. By learning to rank the frame-level features of a video in chronological order, we obtain a new representation that captures the video-wide temporal dynamics of a video, suitable for action recognition. Other than ranking functions, we explore different parametric models that could also explain the temporal changes in videos. The proposed functional pooling methods, and rank pooling in particular, is easy to interpret and implement, fast to compute and effective in recognizing a wide variety of actions. We evaluate our method on various benchmarks for generic action, fine-grained action and gesture recognition. Results show that rank pooling brings an absolute improvement of 7-10 average pooling baseline. At the same time, rank pooling is compatible with and complementary to several appearance and local motion based methods and features, such as improved trajectories and deep learning features.

  3. 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.

  4. 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.

  5. 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.

  6. Ranking structures and Rank-Rank Correlations of Countries. The FIFA and UEFA cases

    CERN Document Server

    Ausloos, Marcel; Gadomski, Adam; Vitanov, Nikolay K

    2014-01-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.

  7. Re-ranking via User Feedback: Georgetown University at TREC 2015 DD Track

    Science.gov (United States)

    2015-11-20

    passages in the feedbacks to re-rank documents in the original list. The new relevance score of a document d in the original list becomes: ! ! ! = 1...metadata. It talks about how illicit and fake goods such as fake Viagra are made, advertised, and sold on the Internet. All documents are in the HTML... news dataset. This corpus is a subset of the original TREC 2014 KBA Stream Corpus. Table 2 shows the statistics of these three datasets. Table 2

  8. Sequential rank agreement methods for comparison of ranked lists

    DEFF Research Database (Denmark)

    Ekstrøm, Claus Thorn; Gerds, Thomas Alexander; Jensen, Andreas Kryger;

    2015-01-01

    rank genes according to their difference in gene expression levels. This article constructs measures of the agreement of two or more ordered lists. We use the standard deviation of the ranks to define a measure of agreement that both provides an intuitive interpretation and can be applied to any number...... of lists even if some or all are incomplete or censored. The approach can identify change-points in the agreement of the lists and the sequential changes of agreement as a function of the depth of the lists can be compared graphically to a permutation based reference set. The usefulness of these tools...

  9. NNDSS - Table II. Vibriosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Vibriosis - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding year), and...

  10. NNDSS - Table IV. Tuberculosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table IV. Tuberculosis - 2014.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

  11. NNDSS - Table IV. Tuberculosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table IV. Tuberculosis - 2016.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

  12. NNDSS - Table IV. Tuberculosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table IV. Tuberculosis - 2015.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

  13. Pension Insurance Data Tables

    Data.gov (United States)

    Pension Benefit Guaranty Corporation — Find out about retirement trends in PBGC's data tables. The tables include statistics on the people and pensions that PBGC protects, including how many Americans are...

  14. Tabled Execution in Scheme

    Energy Technology Data Exchange (ETDEWEB)

    Willcock, J J; Lumsdaine, A; Quinlan, D J

    2008-08-19

    Tabled execution is a generalization of memorization developed by the logic programming community. It not only saves results from tabled predicates, but also stores the set of currently active calls to them; tabled execution can thus provide meaningful semantics for programs that seemingly contain infinite recursions with the same arguments. In logic programming, tabled execution is used for many purposes, both for improving the efficiency of programs, and making tasks simpler and more direct to express than with normal logic programs. However, tabled execution is only infrequently applied in mainstream functional languages such as Scheme. We demonstrate an elegant implementation of tabled execution in Scheme, using a mix of continuation-passing style and mutable data. We also show the use of tabled execution in Scheme for a problem in formal language and automata theory, demonstrating that tabled execution can be a valuable tool for Scheme users.

  15. Loss Function Based Ranking in Two-Stage, Hierarchical Models

    Science.gov (United States)

    Lin, Rongheng; Louis, Thomas A.; Paddock, Susan M.; Ridgeway, Greg

    2009-01-01

    Performance evaluations of health services providers burgeons. Similarly, analyzing spatially related health information, ranking teachers and schools, and identification of differentially expressed genes are increasing in prevalence and importance. Goals include valid and efficient ranking of units for profiling and league tables, identification of excellent and poor performers, the most differentially expressed genes, and determining “exceedances” (how many and which unit-specific true parameters exceed a threshold). These data and inferential goals require a hierarchical, Bayesian model that accounts for nesting relations and identifies both population values and random effects for unit-specific parameters. Furthermore, the Bayesian approach coupled with optimizing a loss function provides a framework for computing non-standard inferences such as ranks and histograms. Estimated ranks that minimize Squared Error Loss (SEL) between the true and estimated ranks have been investigated. The posterior mean ranks minimize SEL and are “general purpose,” relevant to a broad spectrum of ranking goals. However, other loss functions and optimizing ranks that are tuned to application-specific goals require identification and evaluation. For example, when the goal is to identify the relatively good (e.g., in the upper 10%) or relatively poor performers, a loss function that penalizes classification errors produces estimates that minimize the error rate. We construct loss functions that address this and other goals, developing a unified framework that facilitates generating candidate estimates, comparing approaches and producing data analytic performance summaries. We compare performance for a fully parametric, hierarchical model with Gaussian sampling distribution under Gaussian and a mixture of Gaussians prior distributions. We illustrate approaches via analysis of standardized mortality ratio data from the United States Renal Data System. Results show that SEL

  16. Periodic Table of Students.

    Science.gov (United States)

    Johnson, Mike

    1998-01-01

    Presents an exercise in which an eighth-grade science teacher decorated the classroom with a periodic table of students. Student photographs were arranged according to similarities into vertical columns. Students were each assigned an atomic number according to their placement in the table. The table is then used to teach students about…

  17. Periodic Table of Students.

    Science.gov (United States)

    Johnson, Mike

    1998-01-01

    Presents an exercise in which an eighth-grade science teacher decorated the classroom with a periodic table of students. Student photographs were arranged according to similarities into vertical columns. Students were each assigned an atomic number according to their placement in the table. The table is then used to teach students about…

  18. Table Tennis Club

    CERN Multimedia

    Table Tennis Club

    2013-01-01

    Apparently table tennis plays an important role in physics, not so much because physicists are interested in the theory of table tennis ball scattering, but probably because it provides useful breaks from their deep intellectual occupation. It seems that many of the greatest physicists took table tennis very seriously. For instance, Heisenberg could not even bear to lose a game of table tennis, Otto Frisch played a lot of table tennis, and had a table set up in his library, and Niels Bohr apparently beat everybody at table tennis. Therefore, as the CERN Table Tennis Club advertises on a poster for the next CERN Table Tennis Tournament: “if you want to be a great physicist, perhaps you should play table tennis”. Outdoor table at restaurant n° 1 For this reason, and also as part of the campaign launched by the CERN medical service “Move! & Eat better”, to encourage everyone at CERN to take regular exercise, the CERN Table Tennis Club, with the supp...

  19. Rank-Based Analysis of Unbalanced Repeated Measures Data

    Directory of Open Access Journals (Sweden)

    M. Mushfiqur Rashid

    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";} In this article, we have developed a rank (intra-subject based analysis of clinical trials with unbalanced repeated measures data. We assume that the errors within each patient are exchangeable and continuous random variables. This rank-based inference is valid when the unbalanced data are missing either completely at random or by design. A drop in dispersion test is developed for general linear hypotheses. A numerical example is given to illustrate the procedure.

  20. 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.

  1. 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....

  2. The Globalization of College and University Rankings

    Science.gov (United States)

    Altbach, Philip G.

    2012-01-01

    In the era of globalization, accountability, and benchmarking, university rankings have achieved a kind of iconic status. The major ones--the Academic Ranking of World Universities (ARWU, or the "Shanghai rankings"), the QS (Quacquarelli Symonds Limited) World University Rankings, and the "Times Higher Education" World…

  3. Higher rank case of Dwork's conjecture

    CERN Document Server

    Wan, D

    2000-01-01

    This is the final version of ANT-0142 ("An embedding approach to Dwork's conjecture"). It reduces the higher rank case of the conjecture over a general base variety to the rank one case over the affine space. The general rank one case is completed in ANT-0235 "Rank one case of Dwork's conjecture". Both papers will appear in JAMS.

  4. CERN Table Tennis Club

    CERN Multimedia

    CERN Table Tennis Club

    2014-01-01

    CERN Table Tennis Club Announcing CERN 60th Anniversary Table Tennis Tournament to take place at CERN, from July 1 to July 15, 2014   The CERN Table Tennis Club, reborn in 2008, is encouraging people at CERN to take more regular exercise. This is why the Club, thanks to the strong support of the CERN Staff Association, installed last season a first outdoor table on the terrace of restaurant # 1, and will install another one this season on the terrace of Restaurant # 2. Table tennis provides both physical exercise and friendly social interactions. The CERN Table Tennis club is happy to use the unique opportunity of the 60th CERN anniversary to promote table tennis at CERN, as it is a game that everybody can easily play, regardless of level. Table tennis is particularly well suited for CERN, as many great physicists play table tennis, as you might already know: “Heisenberg could not even bear to lose a game of table tennis”; “Otto Frisch played a lot of table tennis;...

  5. Mortality table construction

    Science.gov (United States)

    Sutawanir

    2015-12-01

    Mortality tables play important role in actuarial studies such as life annuities, premium determination, premium reserve, valuation pension plan, pension funding. Some known mortality tables are CSO mortality table, Indonesian Mortality Table, Bowers mortality table, Japan Mortality table. For actuary applications some tables are constructed with different environment such as single decrement, double decrement, and multiple decrement. There exist two approaches in mortality table construction : mathematics approach and statistical approach. Distribution model and estimation theory are the statistical concepts that are used in mortality table construction. This article aims to discuss the statistical approach in mortality table construction. The distributional assumptions are uniform death distribution (UDD) and constant force (exponential). Moment estimation and maximum likelihood are used to estimate the mortality parameter. Moment estimation methods are easier to manipulate compared to maximum likelihood estimation (mle). However, the complete mortality data are not used in moment estimation method. Maximum likelihood exploited all available information in mortality estimation. Some mle equations are complicated and solved using numerical methods. The article focus on single decrement estimation using moment and maximum likelihood estimation. Some extension to double decrement will introduced. Simple dataset will be used to illustrated the mortality estimation, and mortality table.

  6. 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.

  7. Time evolution of Wikipedia network ranking

    CERN Document Server

    Eom, Young-Ho; Benczúr, András; Shepelyansky, Dima L

    2013-01-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 percents of top universities of Shanghai ranking during the considered time period.

  8. 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.

  9. Let Us Rank Journalism Programs

    Science.gov (United States)

    Weber, Joseph

    2014-01-01

    Unlike law, business, and medical schools, as well as universities in general, journalism schools and journalism programs have rarely been ranked. Publishers such as "U.S. News & World Report," "Forbes," "Bloomberg Businessweek," and "Washington Monthly" do not pay them much mind. What is the best…

  10. Measuring and Ranking Value Drivers

    NARCIS (Netherlands)

    M.M. Akalu

    2002-01-01

    textabstractAnalysis of the strength of value drivers is crucial to understand their influence in the process of free cash flow generation. The paper addresses the issue of value driver measurement and ranking. The research reveals that, value drivers have similar pattern across industries.

  11. Charter School Laws: Ranking Scorecard.

    Science.gov (United States)

    Center for Education Reform, Washington, DC.

    This is the fifth report prepared by the Center for Education Reform (CER) evaluating the capacity and flexibility of state laws promoting charter schools. Three primary factors were evaluated in preparing charter-school quality rankings by state. The center finds that the establishment of multiple sponsoring authorities, in addition to local…

  12. Measuring and Ranking Value Drivers

    NARCIS (Netherlands)

    M.M. Akalu

    2002-01-01

    textabstractAnalysis of the strength of value drivers is crucial to understand their influence in the process of free cash flow generation. The paper addresses the issue of value driver measurement and ranking. The research reveals that, value drivers have similar pattern across industries. Furtherm

  13. TABLE TENNIS CLUB

    CERN Multimedia

    TABLE TENNIS CLUB

    2010-01-01

    2010 CERN Table Tennis Tournament The CERN Table Tennis Club organizes its traditional CERN Table Tennis Tournament, at the Meyrin club, 2 rue de livron, in Meyrin, Saturday August 21st, in the afternoon. The tournament is open to all CERN staff, users, visitors and families, including of course summer students. See below for details. In order to register, simply send an E-mail to Jean-Pierre Revol (jean-pierre.revol@cern.ch). You can also download the registration form from the Club Web page (http://www.cern.ch/tabletennis), and send it via internal mail. Photo taken on August 22, 2009 showing some of the participants in the 2nd CERN Table Tennis tournament. INFORMATION ON CERN TABLE TENNIS CLUB CERN used to have a tradition of table tennis activities at CERN. For some reason, at the beginning of the 1980’s, the CERN Table Tennis club merged with the Meyrin Table Tennis club, a member of the Association Genevoise de Tennis de Table (AGTT). Therefore, if you want to practice table tennis, you...

  14. Aggregate ranking of the world's leading universities

    Directory of Open Access Journals (Sweden)

    Vladimir M. Moskovkin

    2015-06-01

    Full Text Available The paper presents a methodology for calculating the aggregate global university ranking (Aggregated Global University Ranking, or AGUR, which consists of an automated presentation of the comparable lists of names for different universities from particular global university rankings (using Machine Learning and Mining Data algorithms and a simple procedure of aggregating particular global university rankings (summing up the university ranking positions from different particular rankings and their subsequent ranking. The second procedure makes it possible to bring lists of universities from particular rankings, which are nonidentical by length, to one size. The paper includes a sample AGUR for six particular global university rankings as of 2013, as well as cross-correlation matrices and intersection matrices for AGUR for 2011-2013, all created by means of using the Python-based software.

  15. Relevance ranking for vertical search engines

    CERN Document Server

    Chang, Yi

    2014-01-01

    In plain, uncomplicated language, and using detailed examples to explain the key concepts, models, and algorithms in vertical search ranking, Relevance Ranking for Vertical Search Engines teaches readers how to manipulate ranking algorithms to achieve better results in real-world applications. This reference book for professionals covers concepts and theories from the fundamental to the advanced, such as relevance, query intention, location-based relevance ranking, and cross-property ranking. It covers the most recent developments in vertical search ranking applications, such as freshness-based relevance theory for new search applications, location-based relevance theory for local search applications, and cross-property ranking theory for applications involving multiple verticals. It introduces ranking algorithms and teaches readers how to manipulate ranking algorithms for the best results. It covers concepts and theories from the fundamental to the advanced. It discusses the state of the art: development of ...

  16. 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.

  17. Compressed Encoding for Rank Modulation

    CERN Document Server

    Gad, Eyal En; Jiang,; Bruck, Jehoshua

    2011-01-01

    Rank modulation has been recently proposed as a scheme for storing information in flash memories. While rank modulation has advantages in improving write speed and endurance, the current encoding approach is based on the "push to the top" operation that is not efficient in the general case. We propose a new encoding procedure where a cell level is raised to be higher than the minimal necessary subset - instead of all - of the other cell levels. This new procedure leads to a significantly more compressed (lower charge levels) encoding. We derive an upper bound for a family of codes that utilize the proposed encoding procedure, and consider code constructions that achieve that bound for several special cases.

  18. Consistent ranking of volatility models

    DEFF Research Database (Denmark)

    Hansen, Peter Reinhard; Lunde, Asger

    2006-01-01

    result in an inferior model being chosen as "best" with a probability that converges to one as the sample size increases. We document the practical relevance of this problem in an empirical application and by simulation experiments. Our results provide an additional argument for using the realized...... 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.......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...

  19. Functional Multiplex PageRank

    CERN Document Server

    Iacovacci, Jacopo; Arenas, Alex; Bianconi, Ginestra

    2016-01-01

    Recently it has been recognized that many complex social, technological and biological networks have a multilayer nature and can be described by multiplex networks. Multiplex networks are formed by a set of nodes connected by links having different connotations forming the different layers of the multiplex. Characterizing the centrality of the nodes in a multiplex network is a challenging task since the centrality of the node naturally depends on the importance associated to links of a certain type. Here we propose to assign to each node of a multiplex network a centrality called Functional Multiplex PageRank that is a function of the weights given to every different pattern of connections (multilinks) existent in the multiplex network between any two nodes. Since multilinks distinguish all the possible ways in which the links in different layers can overlap, the Functional Multiplex PageRank can describe important non-linear effects when large relevance or small relevance is assigned to multilinks with overl...

  20. 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.

  1. Standard Reference Tables -

    Data.gov (United States)

    Department of Transportation — The Standard Reference Tables (SRT) provide consistent reference data for the various applications that support Flight Standards Service (AFS) business processes and...

  2. Combined Reduced-Rank Transform

    Directory of Open Access Journals (Sweden)

    Anatoli Torokhti

    2006-04-01

    Full Text Available We propose and justify a new approach to constructing optimal nonlinear transforms of random vectors. We show that the proposed transform improves such characteristics of {rank-reduced} transforms as compression ratio, accuracy of decompression and reduces required computational work. The proposed transform ${mathcal T}_p$ is presented in the form of a sum with $p$ terms where each term is interpreted as a particular rank-reduced transform. Moreover, terms in ${mathcal T}_p$ are represented as a combination of three operations ${mathcal F}_k$, ${mathcal Q}_k$ and ${oldsymbol{varphi}}_k$ with $k=1,ldots,p$. The prime idea is to determine ${mathcal F}_k$ separately, for each $k=1,ldots,p$, from an associated rank-constrained minimization problem similar to that used in the Karhunen--Lo`{e}ve transform. The operations ${mathcal Q}_k$ and ${oldsymbol{varphi}}_k$ are auxiliary for f/inding ${mathcal F}_k$. The contribution of each term in ${mathcal T}_p$ improves the entire transform performance. A corresponding unconstrained nonlinear optimal transform is also considered. Such a transform is important in its own right because it is treated as an optimal filter without signal compression. A rigorous analysis of errors associated with the proposed transforms is given.

  3. Functional Multiplex PageRank

    Science.gov (United States)

    Iacovacci, Jacopo; Rahmede, Christoph; Arenas, Alex; Bianconi, Ginestra

    2016-10-01

    Recently it has been recognized that many complex social, technological and biological networks have a multilayer nature and can be described by multiplex networks. Multiplex networks are formed by a set of nodes connected by links having different connotations forming the different layers of the multiplex. Characterizing the centrality of the nodes in a multiplex network is a challenging task since the centrality of the node naturally depends on the importance associated to links of a certain type. Here we propose to assign to each node of a multiplex network a centrality called Functional Multiplex PageRank that is a function of the weights given to every different pattern of connections (multilinks) existent in the multiplex network between any two nodes. Since multilinks distinguish all the possible ways in which the links in different layers can overlap, the Functional Multiplex PageRank can describe important non-linear effects when large relevance or small relevance is assigned to multilinks with overlap. Here we apply the Functional Page Rank to the multiplex airport networks, to the neuronal network of the nematode C. elegans, and to social collaboration and citation networks between scientists. This analysis reveals important differences existing between the most central nodes of these networks, and the correlations between their so-called pattern to success.

  4. Ensemble Enabled Weighted PageRank

    CERN Document Server

    Luo, Dongsheng; Hu, Renjun; Duan, Liang; Ma, Shuai

    2016-01-01

    This paper describes our solution for WSDM Cup 2016. Ranking the query independent importance of scholarly articles is a critical and challenging task, due to the heterogeneity and dynamism of entities involved. Our approach is called Ensemble enabled Weighted PageRank (EWPR). To do this, we first propose Time-Weighted PageRank that extends PageRank by introducing a time decaying factor. We then develop an ensemble method to assemble the authorities of the heterogeneous entities involved in scholarly articles. We finally propose to use external data sources to further improve the ranking accuracy. Our experimental study shows that our EWPR is a good choice for ranking scholarly articles.

  5. Evaluating and Ranking Businesses’ Branches, Based on Clients’ Perception, a Study in Insurance Industry

    Directory of Open Access Journals (Sweden)

    Mohammad Ali Abdolvand

    2013-02-01

    Full Text Available Both financial and non financial information is needed for decision making by many businesses. Accurate ranks of business branches, is very important information for management and many outsiders as owners, potential investors, labor union, government agencies, bankers, other creditors and the public, because all these groups have some interest in the business that will be served by information about its position and ranks. MCDM method is useful to rank businesses’ branches and 3-stage procedure (S.E.T can be used to rank service organizations such as insurance firms, travel agencies and banking. The present study aims to evaluate and rank a business’ branches based on the clients’ perception of their shopping experience. For this purpose, a sample of 270 clients who has had the experience of shopping from XYZ insurance firm in Shiraz-Iran was used in order to collect data and 240 questionnaires were returned and used in this study. So service quality based on the clients’ perception by SERVPERF was evaluated, then for calculating the criteria weights Entropy method was applied and finally, Technique for Order Preference by Similarity to Ideal Solution (TOPSIS used to achieve the final ranking results. Branches final ranks are: C, A, B. full results of ranking branches are shown in Table 7 and 8.

  6. 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.

  7. The Living Periodic Table

    Science.gov (United States)

    Nahlik, Mary Schrodt

    2005-01-01

    To help make the abstract world of chemistry more concrete eighth-grade students, the author has them create a living periodic table that can be displayed in the classroom or hallway. This display includes information about the elements arranged in the traditional periodic table format, but also includes visual real-world representations of the…

  8. Table Tennis Club

    CERN Multimedia

    Table Tennis Club

    2011-01-01

    CERN Table Tennis Tournament Saturday 20th August 2011 at 13.30 at the CERN/Meyrin TT club (underneath the Piscine de Livron, rue de Livron 2, 1217 Meyrin) Details: http://cern.ch/club-TableTennis Registration: jean-pierre.revol@cern.ch Open to all CERN staff, visitors, summer students, and families

  9. The Living Periodic Table

    Science.gov (United States)

    Nahlik, Mary Schrodt

    2005-01-01

    To help make the abstract world of chemistry more concrete eighth-grade students, the author has them create a living periodic table that can be displayed in the classroom or hallway. This display includes information about the elements arranged in the traditional periodic table format, but also includes visual real-world representations of the…

  10. Table Tennis Club

    CERN Multimedia

    Table Tennis Club

    2011-01-01

    CERN Table Tennis Tournament Saturday 20th August 2011 at 13.30 at the CERN/Meyrin TT club (underneath the Piscine de Livron, rue de Livron 2, 1217 Meyrin) Details: http://cern.ch/club-TableTennis Registration: jean-pierre.revol@cern.ch Open to all CERN staff, visitors, summer students, and families

  11. Rank and genus of 3-manifolds

    CERN Document Server

    Li, Tao

    2011-01-01

    We construct a counterexample to the Rank versus Genus Conjecture, i.e. a closed orientable hyperbolic 3-manifold with rank of its fundamental group smaller than its Heegaard genus. Moreover, we show that the discrepancy between rank and Heegaard genus can be arbitrarily large for hyperbolic 3-manifolds. We also construct toroidal such examples containing hyperbolic JSJ pieces.

  12. 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…

  13. 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…

  14. Using Mathematica to build Non-parametric Statistical Tables

    Directory of Open Access Journals (Sweden)

    Gloria Perez Sainz de Rozas

    2003-01-01

    Full Text Available In this paper, I present computational procedures to obtian statistical tables. The tables of the asymptotic distribution and the exact distribution of Kolmogorov-Smirnov statistic Dn for one population, the table of the distribution of the runs R, the table of the distribution of Wilcoxon signed-rank statistic W+ and the table of the distribution of Mann-Whitney statistic Ux using Mathematica, Version 3.9 under Window98. I think that it is an interesting cuestion because many statistical packages give the asymptotic significance level in the statistical tests and with these porcedures one can easily calculate the exact significance levels and the left-tail and right-tail probabilities with non-parametric distributions. I have used mathematica to make these calculations because one can use symbolic language to solve recursion relations. It's very easy to generate the format of the tables, and it's possible to obtain any table of the mentioned non-parametric distributions with any precision, not only with the standard parameters more used in Statistics, and without transcription mistakes. Furthermore, using similar procedures, we can generate tables for the following distribution functions: Binomial, Poisson, Hypergeometric, Normal, x2 Chi-Square, T-Student, F-Snedecor, Geometric, Gamma and Beta.

  15. Probability Ranking in Vector Spaces

    CERN Document Server

    Melucci, Massimo

    2011-01-01

    The Probability Ranking Principle states that the document set with the highest values of probability of relevance optimizes information retrieval effectiveness given the probabilities are estimated as accurately as possible. The key point of the principle is the separation of the document set into two subsets with a given level of fallout and with the highest recall. The paper introduces the separation between two vector subspaces and shows that the separation yields a more effective performance than the optimal separation into subsets with the same available evidence, the performance being measured with recall and fallout. The result is proved mathematically and exemplified experimentally.

  16. RANKING OF MANUFACTURING SYSTEM CRITERIA

    Directory of Open Access Journals (Sweden)

    SHARFUDDIN AHMED KHAN

    2012-06-01

    Full Text Available A high-quality manufacturing system should be capable to meet the company goals. Moreover, it is essential for any organization that its manufacturing system should be aligned with company’s strategy. There is always a potential for improvement in components of manufacturing systems but it is also essential to identify theparticular areas of the components that need improvement. In this paper, we have discussed the most appropriate criterion for good manufacturing systems with the help of a survey that indentified the importance of seven different criteria according to the experts experience and we ranked them accordingly.

  17. Issue Management Risk Ranking Systems

    Energy Technology Data Exchange (ETDEWEB)

    Novack, Steven David; Marshall, Frances Mc Clellan; Stromberg, Howard Merion; Grant, Gary Michael

    1999-06-01

    Thousands of safety issues have been collected on-line at the Idaho National Engineering and Environmental Laboratory (INEEL) as part of the Issue Management Plan. However, there has been no established approach to prioritize collected and future issues. The authors developed a methodology, based on hazards assessment, to identify and risk rank over 5000 safety issues collected at INEEL. This approach required that it was easily applied and understandable for site adaptation and commensurate with the Integrated Safety Plan. High-risk issues were investigated and mitigative/preventive measures were suggested and ranked based on a cost-benefit scheme to provide risk-informed safety measures. This methodology was consistent with other integrated safety management goals and tasks providing a site-wide risk informed decision tool to reduce hazardous conditions and focus resources on high-risk safety issues. As part of the issue management plan, this methodology was incorporated at the issue collection level and training was provided to management to better familiarize decision-makers with concepts of safety and risk. This prioritization methodology and issue dissemination procedure will be discussed. Results of issue prioritization and training efforts will be summarized. Difficulties and advantages of the process will be reported. Development and incorporation of this process into INEELs lessons learned reporting and the site-wide integrated safety management program will be shown with an emphasis on establishing self reliance and ownership of safety issues.

  18. Issue Management Risk Ranking Systems

    Energy Technology Data Exchange (ETDEWEB)

    F. M. Marshall; G. M. Grant; H. M. Stromberg; S. D. Novack

    1999-06-01

    Thousands of safety issues have been collected on-line at the Idaho National Engineering and Environmental Laboratory (INEEL) as part of the Issue Management Plan. However, there has been no established approach to prioritize collected and future issues. The authors developed a methodology, based on hazards assessment, to identify and risk rank over 5000 safety issues collected at INEEL. This approach required that it was easily applied and understandable for site adaptation and commensurate with the Integrated Safety Plan. High-risk issues were investigated and mitigative/preventive measures were suggested and ranked based on a cost-benefit scheme to provide risk-informed safety measures. This methodology was consistent with other integrated safety management goals and tasks providing a site-wide risk-informed decision tool to reduce hazardous conditions and focus resources on high-risk safety issues. As part of the issue management plan, this methodology was incorporated at the issue collection level and training was provided to management to better familiarize decision-makers with concepts of safety and risk. This prioritization methodology and issue dissemination procedure will be discussed. Results of issue prioritization and training efforts will be summarized. Difficulties and advantages of the process will be reported. Development and incorporation of this process into INEEL's lessons learned reporting and the site-wide integrated safety management program will be shown with an emphasis on establishing self reliance and ownership of safety issues.

  19. Constructions of Rank Modulation Codes

    CERN Document Server

    Mazumdar, Arya; Zémor, Gilles

    2011-01-01

    Rank modulation is a way of encoding information to correct errors in flash memory devices as well as impulse noise in transmission lines. Modeling rank modulation involves construction of packings of the space of permutations equipped with the Kendall tau distance. We present several general constructions of codes in permutations that cover a broad range of code parameters. In particular, we show a number of ways in which conventional error-correcting codes can be modified to correct errors in the Kendall space. Codes that we construct afford simple encoding and decoding algorithms of essentially the same complexity as required to correct errors in the Hamming metric. For instance, from binary BCH codes we obtain codes correcting $t$ Kendall errors in $n$ memory cells that support the order of $n!/(\\log_2n!)^t$ messages, for any constant $t= 1,2,...$ We also construct families of codes that correct a number of errors that grows with $n$ at varying rates, from $\\Theta(n)$ to $\\Theta(n^{2})$. One of our constr...

  20. Adiabatic quantum algorithm for search engine ranking

    CERN Document Server

    Garnerone, Silvano; Lidar, Daniel A

    2011-01-01

    We propose an adiabatic quantum algorithm to evaluate 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 quantum algorithm outputs any component of the PageRank vector-and thus the ranking of the corresponding webpage-in a time which scales polylogarithmically in the number of webpages. This would constitute an exponential speed-up with respect to all known classical algorithms designed to evaluate the PageRank.

  1. The Rank of Integral Circulant Graphs

    Institute of Scientific and Technical Information of China (English)

    ZHOU Hou-qing

    2014-01-01

    A graph is called an integral graph if it has an integral spectrum i.e., all eigen-values are integers. A graph is called circulant graph if it is Cayley graph on the circulant group, i.e., its adjacency matrix is circulant. The rank of a graph is defined to be the rank of its adjacency matrix. This importance of the rank, due to applications in physics, chemistry and combinatorics. In this paper, using Ramanujan sums, we study the rank of integral circulant graphs and gave some simple computational formulas for the rank and provide an example which shows the formula is sharp.

  2. 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...

  3. Decision table languages and systems

    CERN Document Server

    Metzner, John R

    1977-01-01

    ACM Monograph Series: Decision Table Languages and Systems focuses on linguistic examination of decision tables and survey of the features of existing decision table languages and systems. The book first offers information on semiotics, programming language features, and generalization. Discussions focus on semantic broadening, outer language enrichments, generalization of syntax, limitations, implementation improvements, syntactic and semantic features, decision table syntax, semantics of decision table languages, and decision table programming languages. The text then elaborates on design im

  4. Elementary Statistics Tables

    CERN Document Server

    Neave, Henry R

    2012-01-01

    This book, designed for students taking a basic introductory course in statistical analysis, is far more than just a book of tables. Each table is accompanied by a careful but concise explanation and useful worked examples. Requiring little mathematical background, Elementary Statistics Tables is thus not just a reference book but a positive and user-friendly teaching and learning aid. The new edition contains a new and comprehensive "teach-yourself" section on a simple but powerful approach, now well-known in parts of industry but less so in academia, to analysing and interpreting process dat

  5. 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.

  6. Setting the Periodic Table.

    Science.gov (United States)

    Saturnelli, Annette

    1985-01-01

    Examines problems resulting from different forms of the periodic table, indicating that New York State schools use a form reflecting the International Union of Pure and Applied Chemistry's 1984 recommendations. Other formats used and reasons for standardization are discussed. (DH)

  7. The Periodic Table CD.

    Science.gov (United States)

    Banks, Alton J.; Holmes, Jon L.

    1995-01-01

    Describes the characteristics of the digitized version of The Periodic Table Videodisc. Provides details about the organization of information and access to the data via Macintosh and Windows computers. (DDR)

  8. VMS forms Output Tables

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — These output tables contain parsed and format validated data from the various VMS forms that are sent from any given vessel, while at sea, from the VMS devices on...

  9. Setting the Periodic Table.

    Science.gov (United States)

    Saturnelli, Annette

    1985-01-01

    Examines problems resulting from different forms of the periodic table, indicating that New York State schools use a form reflecting the International Union of Pure and Applied Chemistry's 1984 recommendations. Other formats used and reasons for standardization are discussed. (DH)

  10. The Periodic Table CD.

    Science.gov (United States)

    Banks, Alton J.; Holmes, Jon L.

    1995-01-01

    Describes the characteristics of the digitized version of The Periodic Table Videodisc. Provides details about the organization of information and access to the data via Macintosh and Windows computers. (DDR)

  11. Permit.LOA table

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — This table includes the effective dates by vessel and permit number for each issued letter of authorization (LOA) by the Permit Office (APSD)

  12. Methodology for ranking restoration options

    DEFF Research Database (Denmark)

    Jensen, Per Hedemann

    1999-01-01

    The work described in this report has been performed as a part of the RESTRAT Project FI4P-CT95-0021a (PL 950128) co-funded by the Nuclear Fission Safety Programme of the European Commission. The RESTRAT project has the overall objective of developinggeneric methodologies for ranking restoration...... techniques as a function of contamination and site characteristics. The project includes analyses of existing remediation methodologies and contaminated sites, and is structured in the following steps:-characterisation of relevant contaminated sites -identication and characterisation of relevant restoration...... techniques -assessment of the radiological impact -development and application of a selection methodology for restoration options -formulation ofgeneric conclusions and development of a manual The project is intended to apply to situations in which sites with nuclear installations have been contaminated...

  13. Modified Hazard Ranking System/Hazard Ranking System for sites with mixed radioactive and hazardous wastes: Software documentation

    Energy Technology Data Exchange (ETDEWEB)

    Stenner, R.D.; Peloquin, R.A.; Hawley, K.A.

    1986-11-01

    The mHRS/HRS software package was developed by the Pacific Northwest Laboratory (PNL) under contract with the Department of Energy (DOE) to provide a uniform method for DOE facilities to use in performing their Conservation Environmental Response Compensation and Liability Act (CERCLA) Phase I Modified Hazard Ranking System or Hazard Ranking System evaluations. The program is designed to remove the tedium and potential for error associated with the performing of hand calculations and the interpreting of information on tables and in reference books when performing an evaluation. The software package is designed to operate on a microcomputer (IBM PC, PC/XT, or PC/AT, or a compatible system) using either a dual floppy disk drive or a hard disk storage system. It is written in the dBASE III language and operates using the dBASE III system. Although the mHRS/HRS software package was developed for use at DOE facilities, it has direct applicability to the performing of CERCLA Phase I evaluations for any facility contaminated by hazardous waste. The software can perform evaluations using either the modified hazard ranking system methodology developed by DOE/PNL, the hazard ranking system methodology developed by EPA/MITRE Corp., or a combination of the two. This document is a companion manual to the mHRS/HRS user manual. It is intended for the programmer who must maintain the software package and for those interested in the computer implementation. This manual documents the system logic, computer programs, and data files that comprise the package. Hardware and software implementation requirements are discussed. In addition, hand calculations of three sample situations (problems) with associated computer runs used for the verification of program calculations are included.

  14. Comparing classical and quantum PageRanks

    CERN Document Server

    Loke, T; Rodriguez, J; Small, M; Wang, J B

    2015-01-01

    Following recent developments in quantum PageRanking, we present a comparative analysis of discrete-time and continuous-time quantum-walk-based PageRank algorithms. For the discrete-time case, we introduce an alternative PageRank measure based on the maximum probabilities achieved by the walker on the nodes. We demonstrate that the required time of evolution does not scale significantly with increasing network size. We affirm that all three quantum PageRank measures considered here distinguish clearly between outerplanar hierarchical, scale-free, and Erd\\"os-R\\'enyi network types. Relative to classical PageRank and to different extents, the quantum measures better highlight secondary hubs and resolve ranking degeneracy among peripheral nodes for the networks we studied in this paper.

  15. Dynamics of ranking processes in complex systems.

    Science.gov (United States)

    Blumm, Nicholas; Ghoshal, Gourab; Forró, Zalán; Schich, Maximilian; Bianconi, Ginestra; Bouchaud, Jean-Philippe; Barabási, Albert-László

    2012-09-21

    The world is addicted to ranking: everything, from the reputation of scientists, journals, and universities to purchasing decisions is driven by measured or perceived differences between them. Here, we analyze empirical data capturing real time ranking in a number of systems, helping to identify the universal characteristics of ranking dynamics. We develop a continuum theory that not only predicts the stability of the ranking process, but shows that a noise-induced phase transition is at the heart of the observed differences in ranking regimes. The key parameters of the continuum theory can be explicitly measured from data, allowing us to predict and experimentally document the existence of three phases that govern ranking stability.

  16. 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.

  17. Rank Modulation for Translocation Error Correction

    CERN Document Server

    Farnoud, Farzad; Milenkovic, Olgica

    2012-01-01

    We consider rank modulation codes for flash memories that allow for handling arbitrary charge drop errors. Unlike classical rank modulation codes used for correcting errors that manifest themselves as swaps of two adjacently ranked elements, the proposed \\emph{translocation rank codes} account for more general forms of errors that arise in storage systems. Translocations represent a natural extension of the notion of adjacent transpositions and as such may be analyzed using related concepts in combinatorics and rank modulation coding. Our results include tight bounds on the capacity of translocation rank codes, construction techniques for asymptotically good codes, as well as simple decoding methods for one class of structured codes. As part of our exposition, we also highlight the close connections between the new code family and permutations with short common subsequences, deletion and insertion error-correcting codes for permutations and permutation arrays.

  18. Efficient Probabilistic Inference with Partial Ranking Queries

    CERN Document Server

    Huang, Jonathan; Guestrin, Carlos E

    2012-01-01

    Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distributions. We approach the modeling problem from the computational principle that one should make structural assumptions which allow for efficient calculation of typical probabilistic queries. For ranking models, "typical" queries predominantly take the form of partial ranking queries (e.g., given a user's top-k favorite movies, what are his preferences over remaining movies?). In this paper, we argue that riffled independence factorizations proposed in recent literature [7, 8] are a natural structural assumption for ranking distributions, allowing for particularly efficient processing of partial ranking queries.

  19. Conditionally bounding analytic ranks of elliptic curves

    CERN Document Server

    Bober, Jonathan W

    2011-01-01

    We describe a method for bounding the rank of an elliptic curve under the assumptions of the Birch and Swinnerton-Dyer conjecture and the generalized Riemann hypothesis. As an example, we compute, under these conjectures, exact upper bounds for curves which are known to have rank at least as large as 20, 21, 22, 23, and 24. For the known curve of rank at least 28, we get a bound of 30.

  20. The rank product method with two samples.

    Science.gov (United States)

    Koziol, James A

    2010-11-05

    Breitling et al. (2004) introduced a statistical technique, the rank product method, for detecting differentially regulated genes in replicated microarray experiments. The technique has achieved widespread acceptance and is now used more broadly, in such diverse fields as RNAi analysis, proteomics, and machine learning. In this note, we extend the rank product method to the two sample setting, provide distribution theory attending the rank product method in this setting, and give numerical details for implementing the method.

  1. On Boolean matrices with full factor rank

    Energy Technology Data Exchange (ETDEWEB)

    Shitov, Ya [National Research University " Higher School of Economics" , Moscow (Russian Federation)

    2013-11-30

    It is demonstrated that every (0,1)-matrix of size n×m having Boolean rank n contains a column with at least √n/2−1 zero entries. This bound is shown to be asymptotically optimal. As a corollary, it is established that the size of a full-rank Boolean matrix is bounded from above by a function of its tropical and determinantal ranks. Bibliography: 16 titles.

  2. Constructions of Chiral Polytopes of Small Rank

    CERN Document Server

    D'Azevedo, Antonio Breda; Schulte, Egon

    2010-01-01

    An abstract polytope of rank n is said to be chiral if its automorphism group has precisely two orbits on the flags, such that adjacent flags belong to distinct orbits. The present paper describes a general method for deriving new finite chiral polytopes from old finite chiral polytopes of the same rank. In particular, the technique is used to construct many new examples in ranks 3, 4 and 5.

  3. Rank of K2 of elliptic curves

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    We prove that (i) rank(K2(E)) 1 for all elliptic curves E defined over Q with a rational torsion point of exact order N 4; (ii) rank(K2(E)) 1 for all but at most one R-isomorphism class of elliptic curves E defined over Q with a rational torsion point of exact order 3. We give some sufficient conditions for rank(K2(EZ)) 1.

  4. A universal rank-size law

    CERN Document Server

    Ausloos, Marcel

    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.

  5. Rank of K2 of elliptic curves

    Institute of Scientific and Technical Information of China (English)

    JI QingZhong; QIN HouRong

    2009-01-01

    We prove that (i) rank(K2(E))≥1 for all elliptic curves E defined over Q with a rational torsion point of exact order N≥ 4;(ii) rank(K2(E))≥1 for all but at most one R-isomorphism class of elliptic curves E defined over Q with a rational torsion point of exact order 3.We give some sufficient conditions for rank(K2(Ez))≥1.

  6. The exponential rank of nonarchimedean exponential fields

    OpenAIRE

    Kuhlmann, Franz-Viktor; Kuhlmann, Salma

    2000-01-01

    For an exponential on a nonarchimedean ordered field, we introduce the notion of the exponential rank, in analogy to the rank of the field. This gives information about the growth rate of the exponential, and about the convex valuations on the field which are compatible with the exponential. We give several characterizations of these valuations, using maps induced by the exponential on the value group of the natural valuation and on the rank of the field. Finally, we construct exponential fie...

  7. Otto Rank: beginnings, endings, and current experience.

    Science.gov (United States)

    Novey, R

    1983-01-01

    I have traced the theories of Otto Rank as they appeared in his major technical writings. Against this background, I have discussed references to Rank in past and contemporary psychoanalytic literature. This paper describes three important contributions of Rank--his birth trauma theory, leading to his theory of the birth of the self; his emphasis on present experience (forerunner of the current "here-and-now" theory); and his writings about the creative potential of the termination process.

  8. 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...

  9. Rank-based decompositions of morphological templates.

    Science.gov (United States)

    Sussner, P; Ritter, G X

    2000-01-01

    Methods for matrix decomposition have found numerous applications in image processing, in particular for the problem of template decomposition. Since existing matrix decomposition techniques are mainly concerned with the linear domain, we consider it timely to investigate matrix decomposition techniques in the nonlinear domain with applications in image processing. The mathematical basis for these investigations is the new theory of rank within minimax algebra. Thus far, only minimax decompositions of rank 1 and rank 2 matrices into outer product expansions are known to the image processing community. We derive a heuristic algorithm for the decomposition of matrices having arbitrary rank.

  10. 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.

  11. Methodology for ranking restoration options

    Energy Technology Data Exchange (ETDEWEB)

    Hedemann Jensen, Per

    1999-04-01

    The work described in this report has been performed as a part of the RESTRAT Project FI4P-CT95-0021a (PL 950128) co-funded by the Nuclear Fission Safety Programme of the European Commission. The RESTRAT project has the overall objective of developing generic methodologies for ranking restoration techniques as a function of contamination and site characteristics. The project includes analyses of existing remediation methodologies and contaminated sites, and is structured in the following steps: characterisation of relevant contaminated sites; identification and characterisation of relevant restoration techniques; assessment of the radiological impact; development and application of a selection methodology for restoration options; formulation of generic conclusions and development of a manual. The project is intended to apply to situations in which sites with nuclear installations have been contaminated with radioactive materials as a result of the operation of these installations. The areas considered for remedial measures include contaminated land areas, rivers and sediments in rivers, lakes, and sea areas. Five contaminated European sites have been studied. Various remedial measures have been envisaged with respect to the optimisation of the protection of the populations being exposed to the radionuclides at the sites. Cost-benefit analysis and multi-attribute utility analysis have been applied for optimisation. Health, economic and social attributes have been included and weighting factors for the different attributes have been determined by the use of scaling constants. (au)

  12. Quaternary: status, rank, definition, survival

    Institute of Scientific and Technical Information of China (English)

    Marie-PierreAubry; WilliamA.Berggren; JohnVanCouvering; BrianMcGowran; BradPillans; FritsHilgen

    2005-01-01

    The long controversy over the term ‘Quaternary' as a chronostratigraphic unit may be reaching an apotheosis, judging from recent papers (Pillans and Naish, 2004; Gibbard et al., 2005; and referencest herein). The debate is no longer centered on whether there should be a place in the geological time scale for a unit termed ‘Quaternary'-despite its dubious past, it cannot be denied that a large body of earth-historical research is strongly identified with this term. The challenge now concerns an appropriate rank and definition of Quaternary with regard to other chronostratigraphic units. Several options have been proposed (Pillans and Naish, 2004), and Gibbard et al. (2005) encourage a debate on these before decision is reached. In this brief note, we describe an arrangement not previously considered that seems advantageous. It is instructive, however, to first review the Pleistocene Series and Neogene System, the two units that are directly affected by introduction of the Quaternary into the chronostratigraphic hierarchy.

  13. Table Tennis Club

    CERN Multimedia

    Table Tennis Club

    2012-01-01

    The CERN Table Tennis club and the Meyrin CTT are organizing two Table Tennis workshops from 2 to 6 July and from 20 to 24 August 2012 inclusive in Meyrin. A professional would be with your children from 14.00 pm to 18.00 pm: an instructor J + S category A. Training courses with specific themes, individual courses would be given depending on the level of the child’s game, “discoveries –table tennis games” courses and games with the robot. Other activities (stretching, relaxation). Afternoons (from 18 to 20 children): 40 CHF per workshop and per child. Evenings (from 18 to 20 adults): 60 CHF per workshop and per adult. For further information, please contact Mr. Monteil : Mobile: (+33) 06 61 31 70 47 E-mail: wilfried.monteil@free.fr.

  14. Priority Based Prediction Mechanism for Ranking Providers in Federated Cloud Architecture

    Directory of Open Access Journals (Sweden)

    G.Vadivel

    2017-01-01

    Full Text Available In Current trends the Cloud computing has a lot of potential to help hospitals cut costs, a new report says. Here‟s some help overcoming some of the challenges hiding in the cloud. Previously there several methods are available for this like Broker based trust architecture and etc. Health care framework which are patient, doctor, symptom and disease. In this paper we are going to discuss the broker based architecture for federated cloud and its Service Measurement Index considered for evaluating the providers,construction of Grade Distribution Table(GDT,concept of ranking the providers based on prediction weights comparison, optimal service provider selection and results discussion compared with existing techniques available for ranking the providers. In this paper we are going to propose, two different ranking mechanisms to sort the providers and select the optimal provider automatically. Grade distribution ranking model is proposed by assigning the grade for the providers based on the values of SMI attributes, based on the total grade value, providers falls on either Gold, Silver or Bronze. Each category applies the quick sort to sort the providers and find the provider at the top is optimal. If there is more than one provider at the top, apply priority feedback based decision tree and find the optimal provider for the request. In the second ranking mechanism, joint probability distribution mechanism is used to rank the providers, two providers having same score, apply priority feedback based decision tree and find the optimal provider for the request.

  15. Ranked Conservation Opportunity Areas for Region 7 (ECO_RES.RANKED_OAS)

    Data.gov (United States)

    U.S. Environmental Protection Agency — The RANKED_OAS are all the Conservation Opportunity Areas identified by MoRAP that have subsequently been ranked by patch size, landform representation, and the...

  16. Disseminating the Right Information to the Right Audience: Cultural Determinants in the Use (and Misuse) of Rankings

    Science.gov (United States)

    Cremonini, Leon; Westerheijden, Don; Enders, Jurgen

    2008-01-01

    Rankings and league tables, or Report Cards (RCs), of Higher Education Institutions have become a global phenomenon. Their purpose, it is claimed, is to help "student-consumers" make informed decisions. Yet the degree to which RCs succeed in helping students in their college choice is disputed. Even though RCs are intended for all, which…

  17. Generating and ranking of Dyck words

    CERN Document Server

    Kasa, Zoltan

    2010-01-01

    A new algorithm to generate all Dyck words is presented, which is used in ranking and unranking Dyck words. We emphasize the importance of using Dyck words in encoding objects related to Catalan numbers. As a consequence of formulas used in the ranking algorithm we can obtain a recursive formula for the nth Catalan number.

  18. Mining Feedback in Ranking and Recommendation Systems

    Science.gov (United States)

    Zhuang, Ziming

    2009-01-01

    The amount of online information has grown exponentially over the past few decades, and users become more and more dependent on ranking and recommendation systems to address their information seeking needs. The advance in information technologies has enabled users to provide feedback on the utilities of the underlying ranking and recommendation…

  19. Classification of rank 2 cluster varieties

    DEFF Research Database (Denmark)

    Mandel, Travis

    We classify rank 2 cluster varieties (those whose corresponding skew-form has rank 2) according to the deformation type of a generic fiber U of their X-spaces, as defined by Fock and Goncharov. Our approach is based on the work of Gross, Hacking, and Keel for cluster varieties and log Calabi...

  20. Biplots in Reduced-Rank Regression

    NARCIS (Netherlands)

    Braak, ter C.J.F.; Looman, C.W.N.

    1994-01-01

    Regression problems with a number of related response variables are typically analyzed by separate multiple regressions. This paper shows how these regressions can be visualized jointly in a biplot based on reduced-rank regression. Reduced-rank regression combines multiple regression and principal c

  1. A Ranking Method for Evaluating Constructed Responses

    Science.gov (United States)

    Attali, Yigal

    2014-01-01

    This article presents a comparative judgment approach for holistically scored constructed response tasks. In this approach, the grader rank orders (rather than rate) the quality of a small set of responses. A prior automated evaluation of responses guides both set formation and scaling of rankings. Sets are formed to have similar prior scores and…

  2. Public Perception of Cancer Survival Rankings

    Science.gov (United States)

    Jensen, Jakob D.; Scherr, Courtney L.; Brown, Natasha; Jones, Christina; Christy, Katheryn

    2013-01-01

    Past research has observed that certain subgroups (e.g., individuals who are overweight/obese) have inaccurate estimates of survival rates for particular cancers (e.g., colon cancer). However, no study has examined whether the lay public can accurately rank cancer survival rates in comparison with one another (i.e., rank cancers from most deadly…

  3. Classification of rank 2 cluster varieties

    DEFF Research Database (Denmark)

    Mandel, Travis

    We classify rank 2 cluster varieties (those whose corresponding skew-form has rank 2) according to the deformation type of a generic fiber U of their X-spaces, as defined by Fock and Goncharov. Our approach is based on the work of Gross, Hacking, and Keel for cluster varieties and log Calabi-Yau ...

  4. 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

  5. University Ranking Systems; Criteria and Critiques

    Directory of Open Access Journals (Sweden)

    Yavuz SAKA

    2011-01-01

    Full Text Available The purpose of this paper is to explore international university ranking systems. As a compilation study this paper provides specific criteria that each ranking system uses and main critiques regarding these ranking systems. Since there are many ranking systems in this area of research, this study focused on only most cited and referred ranking systems. As there is no consensus in terms of the criteria that these systems use, this paper has no intention of identifying the best ranking system based on a comparative analysis. Rather, this paper may inform relevant interest groups in higher education about the ranking systems and their decisive factors as universities attempt to place their names on the most known ranking systems. This study may provide brief but extensive information to Turkish Higher Education researchers and universities as they participate in Erasmus and Mevlana to open their doors to international higher education world. To become one of the top universities, this paper suggests that universities should know and understand the realities of international competitiveness in higher education and based on such understanding they can mold their physical, structural and academic futures toward achieving their visions and foundational missions.

  6. Entity ranking using Wikipedia as a pivot

    NARCIS (Netherlands)

    Kaptein, R.; Serdyukov, P.; de Vries, A.; Kamps, J.; Huang, X.J.; Jones, G.; Koudas, N.; Wu, X.; Collins-Thompson, K.

    2010-01-01

    In this paper we investigate the task of Entity Ranking on the Web. Searchers looking for entities are arguably better served by presenting a ranked list of entities directly, rather than a list of web pages with relevant but also potentially redundant information about these entities. Since entitie

  7. Rankings and the Global Reputation Race

    Science.gov (United States)

    Hazelkorn, Ellen

    2014-01-01

    This chapter delves into the growing influence and impact of rankings on higher education, as a lens through which to view how the race for reputation and status is changing the higher education landscape, both globally and nationally. The author considers the extent to which rankings are driving policy choices and institutional decisions and the…

  8. On higher rank Donaldson-Thomas invariants

    CERN Document Server

    Nagao, Kentaro

    2010-01-01

    We study higher rank Donaldson-Thomas invariants of a Calabi-Yau 3-fold using Joyce-Song's wall-crossing formula. We construct quivers whose counting invariants coincide with the Donaldson-Thomas invariants. As a corollary, we prove the integrality and a certain symmetry for the higher rank invariants.

  9. Adaptive Rank Penalized Estimators in Multivariate Regression

    CERN Document Server

    Bunea, Florentina; Wegkamp, Marten

    2010-01-01

    We introduce a new criterion, the Rank Selection Criterion (RSC), for selecting the optimal reduced rank estimator of the coefficient matrix in multivariate response regression models. The corresponding RSC estimator minimizes the Frobenius norm of the fit plus a regularization term proportional to the number of parameters in the reduced rank model. The rank of the RSC estimator provides a consistent estimator of the rank of the coefficient matrix. The consistency results are valid not only in the classic asymptotic regime, when the number of responses $n$ and predictors $p$ stays bounded, and the number of observations $m$ grows, but also when either, or both, $n$ and $p$ grow, possibly much faster than $m$. Our finite sample prediction and estimation performance bounds show that the RSC estimator achieves the optimal balance between the approximation error and the penalty term. Furthermore, our procedure has very low computational complexity, linear in the number of candidate models, making it particularly ...

  10. Generalized Gray Codes for Local Rank Modulation

    CERN Document Server

    Gad, Eyal En; Schwartz, Moshe; Bruck, Jehoshua

    2011-01-01

    We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study Gray codes for the local rank-modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. Unlike the limited scope of previous works, we consider code constructions for the entire range of parameters including the code length, sliding window size, and overlap between adjacent windows. We show our constructed codes have asymptotically-optimal rate. We also provide efficient encoding, decoding, and next-state algorithms.

  11. Universal Emergence of PageRank

    CERN Document Server

    Frahm, K M; Shepelyansky, D L

    2011-01-01

    The PageRank algorithm enables to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter $\\alpha \\in ]0,1[$. Using extensive numerical simulations of large web networks, we determine numerically and analytically the universal features of PageRank vector at its emergence when $\\alpha \\rightarrow 1$. The whole network can be divided into a core part and a group of invariant subspaces. For $ \\alpha \\rightarrow 1$ the 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 \\rightarrow 1$ is controlled by eigenvalues of the core part of the Google matrix which are exponentially close to unity leading to large relaxation times as for example in spin glasses.

  12. 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)

  13. A New Email Retrieval Ranking Approach

    CERN Document Server

    AbdelRahman, Samir; Bahgat, Reem; 10.5121/ijcsit.2010.2504

    2010-01-01

    Email Retrieval task has recently taken much attention to help the user retrieve the email(s) related to the submitted query. Up to our knowledge, existing email retrieval ranking approaches sort the retrieved emails based on some heuristic rules, which are either search clues or some predefined user criteria rooted in email fields. Unfortunately, the user usually does not know the effective rule that acquires best ranking related to his query. This paper presents a new email retrieval ranking approach to tackle this problem. It ranks the retrieved emails based on a scoring function that depends on crucial email fields, namely subject, content, and sender. The paper also proposes an architecture to allow every user in a network/group of users to be able, if permissible, to know the most important network senders who are interested in his submitted query words. The experimental evaluation on Enron corpus prove that our approach outperforms known email retrieval ranking approaches.

  14. A New Email Retrieval Ranking Approach

    CERN Document Server

    AbdelRahman, Samir; Bahgat, Reem; 10.5121/ijcsit.2010.2504

    2010-01-01

    Email Retrieval task has recently taken much attention to help the user retrieve the email(s) related to the submitted query. Up to our knowledge, existing email retrieval ranking approaches sort the retrieved emails based on some heuristic rules, which are either search clues or some predefined user criteria rooted in email fields. Unfortunately, the user usually does not know the effective rule that acquires best ranking related to his query. This paper presents a new email retrieval ranking approach to tackle this problem. It ranks the retrieved emails based on a scoring function that depends on crucial email fields, namely subject, content, and sender. The paper also proposes an architecture to allow every user in a network/group of users to be able, if permissible, to know the most important network senders who are interested in his submitted query words. The experimental evaluation on Enron corpus prove that our approach outperforms known email retrieval ranking approaches

  15. Reliability of journal impact factor rankings

    Directory of Open Access Journals (Sweden)

    Greenwood Darren C

    2007-11-01

    Full Text Available Abstract Background Journal impact factors and their ranks are used widely by journals, researchers, and research assessment exercises. Methods Based on citations to journals in research and experimental medicine in 2005, Bayesian Markov chain Monte Carlo methods were used to estimate the uncertainty associated with these journal performance indicators. Results Intervals representing plausible ranges of values for journal impact factor ranks indicated that most journals cannot be ranked with great precision. Only the top and bottom few journals could place any confidence in their rank position. Intervals were wider and overlapping for most journals. Conclusion Decisions placed on journal impact factors are potentially misleading where the uncertainty associated with the measure is ignored. This article proposes that caution should be exercised in the interpretation of journal impact factors and their ranks, and specifically that a measure of uncertainty should be routinely presented alongside the point estimate.

  16. One Table Restaurant

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    There are times when you want to celebrate, hold a formal business meeting or simply gather together with a few friends to eat and have a good time. One Table Restaurant offers you and your guests the perfect setting for every occasion,

  17. The Aerodynamic Plane Table

    Science.gov (United States)

    Zahm, A F

    1924-01-01

    This report gives the description and the use of a specially designed aerodynamic plane table. For the accurate and expeditious geometrical measurement of models in an aerodynamic laboratory, and for miscellaneous truing operations, there is frequent need for a specially equipped plan table. For example, one may have to measure truly to 0.001 inch the offsets of an airfoil at many parts of its surface. Or the offsets of a strut, airship hull, or other carefully formed figure may require exact calipering. Again, a complete airplane model may have to be adjusted for correct incidence at all parts of its surfaces or verified in those parts for conformance to specifications. Such work, if but occasional, may be done on a planing or milling machine; but if frequent, justifies the provision of a special table. For this reason it was found desirable in 1918 to make the table described in this report and to equip it with such gauges and measures as the work should require.

  18. A Modern Periodic Table.

    Science.gov (United States)

    Herrenden-Harker, B. D.

    1997-01-01

    Presents a modern Periodic Table based on the electron distribution in the outermost shell and the order of filling of the sublevels within the shells. Enables a student to read off directly the electronic configuration of the element and the order in which filling occurs. (JRH)

  19. The MSSA consequence tables

    Energy Technology Data Exchange (ETDEWEB)

    Sacks, I.J.

    1988-01-01

    The Master Safeguards and Security Agreement (MSSA) is the mechanism through which the U.S. Department of Energy is implementing a policy of graded safeguards. Under this concept, the level of protection provided to a target is proportional to the ''cost'' of the loss of the target. Cost is measured by use of the conditional risk equation in which the protection system ineffectiveness is multiplied by the consequence to society of a successful adversary attempt. The consequences which are used in the MSSA process were developed in the summer of the 1986 by a consensus of DOE personnel and contractors. There are separate consequence tables for theft of SNM, radiological sabotage. The consequence values in the tables were deliberately not cross-normalized. The consequence values in each table correspond to a societal or DOE cost, for example, the consequence values for SNM theft compared to a normalized estimate of the expected number of fatalities from a successful use of the stolen material times an estimate of the likelihood of successfully using the material. Consequence values for radiological sabotage correspond very roughly to a similar expected fatality level. Values for industrial sabotage are an estimate of the impact on DOE weapons production or impact on the nuclear weapons stockpile. Problems have arisen in the use of these tables and are discussed in the paper.

  20. A Modern Periodic Table.

    Science.gov (United States)

    Herrenden-Harker, B. D.

    1997-01-01

    Presents a modern Periodic Table based on the electron distribution in the outermost shell and the order of filling of the sublevels within the shells. Enables a student to read off directly the electronic configuration of the element and the order in which filling occurs. (JRH)

  1. LOCKE Detailed Specification Tables

    CERN Document Server

    Menezo, Lucia G; Gregorio, Jose-Angel

    2012-01-01

    This document shows the detailed specification of LOCKE coherence protocol for each cache controller, using a table-based technique. This representation provides clear, concise visual information yet includes sufficient detail (e.g., transient states) arguably lacking in the traditional, graphical form of state diagrams.

  2. 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.

  3. Academic rankings: an approach to rank portuguese universities Rankings académicos: un abordaje para clasificar las universidades portuguesas Rankings acadêmicos: uma abordagem ao ranking das universidades portuguesas

    Directory of Open Access Journals (Sweden)

    Pedro Bernardino

    2010-03-01

    Full Text Available The academic rankings are a controversial subject in higher education. However, despite all the criticism, academic rankings are here to stay and more and more different stakeholders use rankings to obtain information about the institutions' performance. The two most well-known rankings, The Times and the Shanghai Jiao Tong University rankings have different methodologies. The Times ranking is based on peer review, whereas the Shanghai ranking has only quantitative indicators and is mainly based on research outputs. In Germany, the CHE ranking uses a different methodology from the traditional rankings, allowing the users to choose criteria and weights. The Portuguese higher education institutions are performing below their European peers, and the Government believes that an academic ranking could improve both performance and competitiveness between institutions. The purpose of this paper is to analyse the advantages and problems of academic rankings and provide guidance to a new Portuguese ranking.Los rankings académicos son un tema muy contradictorio en la enseñanza superior. Todavía, además de todas las críticas los rankings están para quedarse entre nosotros. Y cada vez más, diferentes stakeholders utilizan los rankings para obtener información sobre el desempeño de las instituciones. Dos de los rankings más conocidos, el The Times y el ranking de la universidad de Shangai Jiao Tong tienen métodos distintos. El The Times se basa en la opinión de expertos mientras el ranking de la universidad de Shangai presenta solamente indicadores cuantitativos y mayoritariamente basados en los resultados de actividades de investigación. En Alemania el ranking CHE usa un método distinto permitiendo al utilizador elegir los criterios y su importancia. Las instituciones de enseñanza superior portuguesas tienen un desempeño abajo de las europeas y el gobierno cree que un ranking académico podría contribuir para mejorar su desempeño y

  4. 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.

  5. 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.

  6. Adiabatic Quantum Algorithm for Search Engine Ranking

    Science.gov (United States)

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

    2012-06-01

    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.

  7. 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.

  8. Correlation of Expert and Search Engine Rankings

    CERN Document Server

    Nelson, Michael L; Magudamudi, Manoranjan

    2008-01-01

    In previous research it has been shown that link-based web page metrics can be used to predict experts' assessment of quality. We are interested in a related question: do expert rankings of real-world entities correlate with search engine rankings of corresponding web resources? For example, each year US News & World Report publishes a list of (among others) top 50 graduate business schools. Does their expert ranking correlate with the search engine ranking of the URLs of those business schools? To answer this question we conducted 9 experiments using 8 expert rankings on a range of academic, athletic, financial and popular culture topics. We compared the expert rankings with the rankings in Google, Live Search (formerly MSN) and Yahoo (with list lengths of 10, 25, and 50). In 57 search engine vs. expert comparisons, only 1 strong and 4 moderate correlations were statistically significant. In 42 inter-search engine comparisons, only 2 strong and 4 moderate correlations were statistically significant. The ...

  9. Heuristic Ranking and Diversification of Web Documents

    Science.gov (United States)

    2009-11-01

    with a minimum number of occurrences of 5. An example is given in Table 1. Topic AOL query Frequency dinosaurs remote control dinosaurs 30 dinosaurs jim...henson dinosaurs 25 dinosaurs allosaurus dinosaurs 24 dinosaurs flying dinosaurs 21 dinosaurs walking with dinosaurs 16 Table 1: Example of using the

  10. Global Reference Tables Services Architecture

    Data.gov (United States)

    Social Security Administration — This database stores the reference and transactional data used to provide a data-driven service access method to certain Global Reference Table (GRT) service tables.

  11. A Semantic Matchmaker for Ranking Web Services

    Institute of Scientific and Technical Information of China (English)

    Bin Xu; Po Zhang; Juan-Zi Li; Wen-Jun Yang

    2006-01-01

    This paper is concerned with the matchmaker for ranking web services by using semantics. So far several methods of semantic matchmaker have been proposed. Most of them, however, focus on classifying the services into predefined categories rather than providing a ranking result. In this paper, a new method of semantic matchmaker is proposed for ranking web services. It is proposed to use the semantic distance for estimating the matching degree between a service and a user request. Four types of semantic distances are defined and four algorithms are implemented respectively to calculate them. Experimental results show that the proposed semantic matchmaker significantly outperforms the keywordbased baseline method.

  12. 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....

  13. Otto Rank and man's urge to immortality.

    Science.gov (United States)

    Goldwert, M

    1985-04-01

    Otto Rank, one of Sigmund Freud's original followers, posited the existence of an "urge to immortality" as man's deepest drive. In his Psychology and the Soul, Rank traced the desire for immortality through four historical eras, with particular emphasis on the creativity of the hero and the artist. By the end of his life, Rank had not only repudiated orthodox psychoanalysis and developed then abandoned a psychology of the will, he had moved "beyond psychology" to a religious view of history and the nature of man.

  14. Rank Distance Bicodes and their Generalization

    CERN Document Server

    Kandasamy, W B Vasantha; Babu, N Suresh; Selvaraj, R S

    2010-01-01

    This book has four chapters. In chapter one we just recall the notion of RD codes, MRD codes, circulant rank codes and constant rank codes and describe their properties. In chapter two we introduce few new classes of codes and study some of their properties. In this chapter we introduce the notion of fuzzy RD codes and fuzzy RD bicodes. Rank distance m-codes are introduced in chapter three and the property of m-covering radius is analysed. Chapter four indicates some applications of these new classes of codes.

  15. Table Tennis Club

    CERN Multimedia

    Table Tennis Club

    2012-01-01

    2012 CERN Table Tennis Tournament As the campaign launched by the CERN medical service “Move! & Eat better” is designed in particular to encourage people at CERN to take more regular exercise, the CERN Table Tennis Club, with its traditional CERN Table Tennis Tournament is providing an excellent opportunity to practice moving. The tournament will take place at the Meyrin CTT, 2 rue de Livron, Saturday August 25, 2012, in the afternoon (starting at 13:30). It is open to all CERN staff, users, visitors and families, including of course summer students, who are strongly encouraged to participate. In order to register, simply send an E-mail to Jean-Pierre Revol (jean-pierre.revol@cern.ch). You may also find useful information on the Club Web page http://www.cern.ch/tabletennis CERN 2011 champion Savitha Flaecher, between the finalist Bertrand Mouches on her left, the winner of the consolation draw on her right (Sudarshan Paramesvaran), and far left, Denis Moriaud (semi-finalist a...

  16. Quantum Navigation and Ranking in Complex Networks

    Science.gov (United States)

    Sánchez-Burillo, Eduardo; Duch, Jordi; Gómez-Gardeñes, Jesús; Zueco, David

    2012-08-01

    Complex networks are formal frameworks capturing the interdependencies between the elements of large systems and databases. This formalism allows to use network navigation methods to rank the importance that each constituent has on the global organization of the system. A key example is Pagerank navigation which is at the core of the most used search engine of the World Wide Web. Inspired in this classical algorithm, we define a quantum navigation method providing a unique ranking of the elements of a network. We analyze the convergence of quantum navigation to the stationary rank of networks and show that quantumness decreases the number of navigation steps before convergence. In addition, we show that quantum navigation allows to solve degeneracies found in classical ranks. By implementing the quantum algorithm in real networks, we confirm these improvements and show that quantum coherence unveils new hierarchical features about the global organization of complex systems.

  17. 131 Productivity Strategies Ranking of Knowledge Workers ...

    African Journals Online (AJOL)

    Michael Horsfall

    J. Appl. Sci. Environ. ... Knowledge Workers' characteristics, in this paper, we seek to identify factors influencing the Productivity of ... cost, time and performance (Afrazeh et al., 2003). ... ranking tools and the theoretical framework used to.

  18. Rank Aggregation via Nuclear Norm Minimization

    CERN Document Server

    Gleich, David F

    2011-01-01

    The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion to skew-symmetric matrices. This combination of ideas produces a new method for ranking a set of items. The essence of our idea is that a rank aggregation describes a partially filled skew-symmetric matrix. We extend an algorithm for matrix completion to handle skew-symmetric data and use that to extract ranks for each item. Our algorithm applies to both pairwise comparison and rating data. Because it is based on matrix completion, it is robust to both noise and incomplete data. We show a formal recovery result for the noiseless case and present a detailed study of the algorithm on synthetic data and Netflix ratings.

  19. Texas Students Rank Prestige of Careers.

    Science.gov (United States)

    Hale, Dennis

    1979-01-01

    A survey of 701 Texas high school students revealed that they ranked the prestige of six careers in the following order: (1) minister, (2) television reporter, (3) accountant, (4) policeman, (5) high school teacher, (6) newspaper reporter. (GT)

  20. Low-Rank Representation for Incomplete Data

    Directory of Open Access Journals (Sweden)

    Jiarong Shi

    2014-01-01

    Full Text Available Low-rank matrix recovery (LRMR has been becoming an increasingly popular technique for analyzing data with missing entries, gross corruptions, and outliers. As a significant component of LRMR, the model of low-rank representation (LRR seeks the lowest-rank representation among all samples and it is robust for recovering subspace structures. This paper attempts to solve the problem of LRR with partially observed entries. Firstly, we construct a nonconvex minimization by taking the low rankness, robustness, and incompletion into consideration. Then we employ the technique of augmented Lagrange multipliers to solve the proposed program. Finally, experimental results on synthetic and real-world datasets validate the feasibility and effectiveness of the proposed method.

  1. Partial Transfer Entropy on Rank Vectors

    CERN Document Server

    Kugiumtzis, Dimitris

    2013-01-01

    For the evaluation of information flow in bivariate time series, information measures have been employed, such as the transfer entropy (TE), the symbolic transfer entropy (STE), defined similarly to TE but on the ranks of the components of the reconstructed vectors, and the transfer entropy on rank vectors (TERV), similar to STE but forming the ranks for the future samples of the response system with regard to the current reconstructed vector. Here we extend TERV for multivariate time series, and account for the presence of confounding variables, called partial transfer entropy on ranks (PTERV). We investigate the asymptotic properties of PTERV, and also partial STE (PSTE), construct parametric significance tests under approximations with Gaussian and gamma null distributions, and show that the parametric tests cannot achieve the power of the randomization test using time-shifted surrogates. Using simulations on known coupled dynamical systems and applying parametric and randomization significance tests, we s...

  2. Rank theorems of operators between Banach spaces

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Let E and F be Banach spaces, and B( E, F) all of bounded linear operators on E into F. Let T0 ∈ B( E, F) with an outer inverse T0# ∈ B( F, E). Then a characteristic condition of S= (I + T0# ( T- T0))-1 T0# with T∈ B( E, F) and || T0# ( T- T0) || < 1, being a generalized inverse of T, is presented, and hence, a rank theorem of operators on E into F is established (which generalizes the rank theorem of matrices to Banach spaces). Consequently, an improved finite rank theorem and a new rank theorem are deduced. These results will be very useful to nonlinear functional analysis.

  3. Rank theorems of operators between Banach spaces

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Let E and F be Banach spaces, and B(E,F) all of bounded linear operators on E into F. Let T0∈B(E,F) with an outer inverse T#0∈B(F,E). Then a characteristic condition of S=(I+T#0(T-T0))-1T#0 with T∈B(E,F) and ‖T#0(T-T0)‖<1, being a generalized inverse of T, is presented, and hence, a rank theorem of operators on E into F is established (which generalizes the rank theorem of matrices to Banach spaces). Consequently, an improved finite rank theorem and a new rank theorem are deduced. These results will be very useful to nonlinear functional analysis.

  4. Who's bigger? where historical figures really rank

    CERN Document Server

    Skiena, Steven

    2014-01-01

    Is Hitler bigger than Napoleon? Washington bigger than Lincoln? Picasso bigger than Einstein? Quantitative analysts are rapidly finding homes in social and cultural domains, from finance to politics. What about history? In this fascinating book, Steve Skiena and Charles Ward bring quantitative analysis to bear on ranking and comparing historical reputations. They evaluate each person by aggregating the traces of millions of opinions, just as Google ranks webpages. The book includes a technical discussion for readers interested in the details of the methods, but no mathematical or computational background is necessary to understand the rankings or conclusions. Along the way, the authors present the rankings of more than one thousand of history's most significant people in science, politics, entertainment, and all areas of human endeavor. Anyone interested in history or biography can see where their favorite figures place in the grand scheme of things.

  5. Estonia teatrimaja uued katused / Toomas Rank

    Index Scriptorium Estoniae

    Rank, Toomas

    1999-01-01

    Kaartele toetuv katus, (harjutus)saalid. Peaprojekteerija Kolde Projekt AS, allprojekteerija EKK AS, arhitektid Peep Jänes, Toomas Rank. Sisekujundus: SAB Lember & Padar OÜ. Konsultant Karl Õiger. 5 illustratsiooni

  6. PageRank for ranking authors in co-citation networks

    CERN Document Server

    Ding, Ying; Frazho, Arthur; Caverlee, James

    2010-01-01

    Google's PageRank has created a new synergy to information retrieval for a better ranking of Web pages. It ranks documents depending on the topology of the graphs and the weights of the nodes. PageRank has significantly advanced the field of information retrieval and keeps Google ahead of competitors in the search engine market. It has been deployed in bibliometrics to evaluate research impact, yet few of these studies focus on the important impact of the damping factor (d) for ranking purposes. This paper studies how varied damping factors in the PageRank algorithm can provide additional insight into the ranking of authors in an author co-citation network. Furthermore, we propose weighted PageRank algorithms. We select 108 most highly cited authors in the information retrieval (IR) area from the 1970s to 2008 to form the author co-citation network. We calculate the ranks of these 108 authors based on PageRank with damping factor ranging from 0.05 to 0.95. In order to test the relationship between these diffe...

  7. 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.

  8. Winning the game: Brain processes in expert, young elite and amateur table tennis players

    Directory of Open Access Journals (Sweden)

    Sebastian eWolf

    2014-10-01

    Full Text Available This study tested two hypotheses: (1 compared with amateurs and young elite, expert table tennis players are characterized by enhanced cortical activation in the motor and fronto-parietal cortex during motor imagery in response to table tennis videos; (2 in elite athletes, world rank points are associated with stronger cortical activation. To this aim, electroencephalographic data were recorded in 14 expert, 15 amateur and 15 young elite right-handed table tennis players. All subjects watched videos of a serve and imagined themselves responding with a specific table tennis stroke. With reference to a baseline period, power decrease/increase of the sensorimotor rhythm (SMR during the pretask- and task period indexed the cortical activation/deactivation (event-related desynchronization/synchronization, ERD/ERS. Regarding hypothesis (1, 8–10 Hz SMR ERD was stronger in elite athletes than in amateurs with an intermediate ERD in young elite athletes over the whole scalp. Regarding hypothesis (2, there was no correlation between ERD/ERS in the motor cortex and world rank points in elite experts, but a weaker ERD in the fronto-parietal cortex was associated with higher world rank points. These results suggest that motor skill in table tennis is associated with focused excitability of the motor cortex during reaction, movement planning and execution with high attentional demands. Among elite experts, less activation of the fronto-parietal attention network may be necessary to become a world champion.

  9. Winning the game: brain processes in expert, young elite and amateur table tennis players

    Science.gov (United States)

    Wolf, Sebastian; Brölz, Ellen; Scholz, David; Ramos-Murguialday, Ander; Keune, Philipp M.; Hautzinger, Martin; Birbaumer, Niels; Strehl, Ute

    2014-01-01

    This study tested two hypotheses: (1) compared with amateurs and young elite, expert table tennis players are characterized by enhanced cortical activation in the motor and fronto-parietal cortex during motor imagery in response to table tennis videos; (2) in elite athletes, world rank points are associated with stronger cortical activation. To this aim, electroencephalographic data were recorded in 14 expert, 15 amateur and 15 young elite right-handed table tennis players. All subjects watched videos of a serve and imagined themselves responding with a specific table tennis stroke. With reference to a baseline period, power decrease/increase of the sensorimotor rhythm (SMR) during the pretask- and task period indexed the cortical activation/deactivation (event-related desynchronization/synchronization, ERD/ERS). Regarding hypothesis (1), 8–10 Hz SMR ERD was stronger in elite athletes than in amateurs with an intermediate ERD in young elite athletes in the motor cortex. Regarding hypothesis (2), there was no correlation between ERD/ERS in the motor cortex and world rank points in elite experts, but a weaker ERD in the fronto-parietal cortex was associated with higher world rank points. These results suggest that motor skill in table tennis is associated with focused excitability of the motor cortex during reaction, movement planning and execution with high attentional demands. Among elite experts, less activation of the fronto-parietal attention network may be necessary to become a world champion. PMID:25386126

  10. A Tiled-Table Convention for Compressing FITS Binary Tables

    CERN Document Server

    Pence, William; White, Richard L

    2012-01-01

    This document describes a convention for compressing FITS binary tables that is modeled after the FITS tiled-image compression method (White et al. 2009) that has been in use for about a decade. The input table is first optionally subdivided into tiles, each containing an equal number of rows, then every column of data within each tile is compressed and stored as a variable-length array of bytes in the output FITS binary table. All the header keywords from the input table are copied to the header of the output table and remain uncompressed for efficient access. The output compressed table contains the same number and order of columns as in the input uncompressed binary table. There is one row in the output table corresponding to each tile of rows in the input table. In principle, each column of data can be compressed using a different algorithm that is optimized for the type of data within that column, however in the prototype implementation described here, the gzip algorithm is used to compress every column.

  11. A new fuzzy algorithm for ecological ranking

    Directory of Open Access Journals (Sweden)

    Alessandro Ferrarini

    2011-09-01

    Full Text Available Ecological ranking is a prerequisite to many kinds of environmental decisions. It requires a set of 'objects' (e.g., competing sites for species reintroduction, or competing alternatives of environmental management to be evaluated on the basis of multiple weighted criteria, and then ranked from the best to the worst, or vice versa. The resulting ranking is then used to choose the course of an action (e.g., the optimal sites where a species can be reintroduced, or the optimal management scenario for a protected area. In this work, a new tool called FuzRnk is proposed as a modification of classic fuzzy algorithm. FuzRnk, which is freely available upon request from the author, allows for a fuzzy ranking of GIS objects (e.g., landscape patches or zones within protected areas. With respect to classic fuzzy algorithm, FuzRnk introduces two modifications: a criteria can be weighted on the basis of their importance, b not only the best performances, but also the worst ones are considered in the ranking procedure.

  12. A network-based dynamical ranking system

    CERN Document Server

    Motegi, Shun

    2012-01-01

    Ranking players or teams in sports is of practical interests. From the viewpoint of networks, a ranking system is equivalent 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 (i.e., strength) of a player, for example, depends on 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. Our ranking system, also interpreted as a centrality measure for directed temporal networks, has two parameters. One parameter represents the exponential decay rate of the past score, and the other parameter controls the effect of indirect wins on the score. We derive a set of linear online update equ...

  13. Ranking welding intensity in pyroclastic deposits

    Science.gov (United States)

    Quane, Steven L.; Russell, James K.

    2005-02-01

    Welding of pyroclastic deposits involves flattening of glassy pyroclasts under a compactional load at temperatures above the glass transition temperature. Progressive welding is recorded by changes in the petrographic (e.g., fabric) and physical (e.g., density) properties of the deposits. Mapping the intensity of welding can be integral to studies of pyroclastic deposits, but making systematic comparisons between deposits can be problematical. Here we develop a scheme for ranking welding intensity in pyroclastic deposits on the basis of petrographic textural observations (e.g., oblateness of pumice lapilli and micro-fabric orientation) and measurements of physical properties, including density, porosity, point load strength and uniaxial compressive strength. Our dataset comprises measurements on 100 samples collected from a single cooling unit of the Bandelier Tuff and parallel measurements on 8 samples of more densely welded deposits. The proposed classification comprises six ranks of welding intensity ranging from unconsolidated (Rank I) to obsidian-like vitrophyre (Rank VI) and should allow for reproducible mapping of subtle variations in welding intensity between different deposits. The application of the ranking scheme is demonstrated by using published physical property data on welded pyroclastic deposits to map the total accumulated strain and to reconstruct their pre-welding thicknesses.

  14. 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.

  15. Deriving Extensional Spatial Composition Tables

    Science.gov (United States)

    El-Geresy, Baher; Abdelmoty, Alia I.; Ware, Andrew J.

    Spatial composition tables are fundamental tools for the realisation of qualitative spatial reasoning techniques. Studying the properties of these tables in relation to the spatial calculi they are based on is essential for understanding the applicability of these calculi and how they can be extended and generalised. An extensional interpretation of a spatial composition table is an important property that has been studied in the literature and is used to determine the validity of the table for the models it is proposed for. It provides means for consistency checking of ground sets of relations and for addressing spatial constraint satisfaction problems. Furthermore, two general conditions that can be used to test for extensionality of spatial composition tables are proposed and applied to the RCC8 composition table to verify the allowable models in this calculus.

  16. Ranking spreaders by decomposing complex networks

    Energy Technology Data Exchange (ETDEWEB)

    Zeng, An, E-mail: an.zeng@unifr.ch [Department of Physics, University of Fribourg, Chemin du Musée 3, CH-1700 Fribourg (Switzerland); Institute of Information Economy, Hangzhou Normal University, Hangzhou 310036 (China); Zhang, Cheng-Jun [Department of Physics, University of Fribourg, Chemin du Musée 3, CH-1700 Fribourg (Switzerland)

    2013-06-03

    Ranking the nodes' ability of spreading in networks is crucial for designing efficient strategies to hinder spreading in the case of diseases or accelerate spreading in the case of information dissemination. In the well-known k-shell method, nodes are ranked only according to the links between the remaining nodes (residual links) while the links connecting to the removed nodes (exhausted links) are entirely ignored. In this Letter, we propose a mixed degree decomposition (MDD) procedure in which both the residual degree and the exhausted degree are considered. By simulating the epidemic spreading process on real networks, we show that the MDD method can outperform the k-shell and degree methods in ranking spreaders.

  17. Low Rank Approximation Algorithms, Implementation, Applications

    CERN Document Server

    Markovsky, Ivan

    2012-01-01

    Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequently in many different fields. Low Rank Approximation: Algorithms, Implementation, Applications is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory. Applications described include: system and control theory: approximate realization, model reduction, output error, and errors-in-variables identification; signal processing: harmonic retrieval, sum-of-damped exponentials, finite impulse response modeling, and array processing; machine learning: multidimensional scaling and recommender system; computer vision: algebraic curve fitting and fundamental matrix estimation; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; ...

  18. Data envelopment analysis of randomized ranks

    Directory of Open Access Journals (Sweden)

    Sant'Anna Annibal P.

    2002-01-01

    Full Text Available Probabilities and odds, derived from vectors of ranks, are here compared as measures of efficiency of decision-making units (DMUs. These measures are computed with the goal of providing preliminary information before starting a Data Envelopment Analysis (DEA or the application of any other evaluation or composition of preferences methodology. Preferences, quality and productivity evaluations are usually measured with errors or subject to influence of other random disturbances. Reducing evaluations to ranks and treating the ranks as estimates of location parameters of random variables, we are able to compute the probability of each DMU being classified as the best according to the consumption of each input and the production of each output. Employing the probabilities of being the best as efficiency measures, we stretch distances between the most efficient units. We combine these partial probabilities in a global efficiency score determined in terms of proximity to the efficiency frontier.

  19. Mining Wikipedia to Rank Rock Guitarists

    Directory of Open Access Journals (Sweden)

    Muazzam A. Siddiqui

    2015-11-01

    Full Text Available We present a method to find the most influential rock guitarist by applying Google PageRank algorithm to information extracted from Wikipedia articles. The influence of a guitarist was estimated by the number of guitarists citing him/her as an influence and the influence of the latter. We extracted this who-influenced-whom data from the Wikipedia biographies and converted them to a directed graph where a node represented a guitarist and an edge between two nodes indicated the influence of one guitarist over the other. Next we used Google PageRank algorithm to rank the guitarists. The results are most interesting and provide a quantitative foundation to the idea that most of the contemporary rock guitarists are influenced by early blues guitarists. Although no direct comparison exist, the list was still validated against a number of other best-of lists available online and found to be mostly compatible.

  20. 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...

  1. Ranking different barriers influencing on media privatization

    Directory of Open Access Journals (Sweden)

    Roghiyeh Jame

    2014-02-01

    Full Text Available For years, there have been growing interests on cost reduction for products and services. Privatization is considered as one of the most important techniques to increase relative efficiencies of publically held firms. In this paper, we present an empirical investigation to rank important barriers on privatization of television (TV media industry in Iran. The proposed study of this paper designs and distributes a questionnaire using a sample of 234 out of 600 graduate students who were enrolled in media communication studies. The survey considers social, cultural, economic as well as rules and regulations factors influencing privatization of TV media industry. The survey uses the ranking method presented by Cook and Kress (1990 [Cook, W. D., & Kress, M. (1990. A data envelopment model for aggregating preference rankings. Management Science, 36(11, 1302-1310.]. The results of the investigation indicate rules and regulations are the most important barriers on privatization of Iranian TV followed by cultural, social and economic factors.

  2. Thermal properties of different rank coals

    Energy Technology Data Exchange (ETDEWEB)

    Serdar Yaman; Hanzade Haykiri-Acma [Istanbul Technical University, Istanbul (Turkey). Dept. of Chemical Engineering

    2007-07-01

    Thermal properties of various coal samples which have different rank and petrography were investigated under both inert and oxidizing conditions up to 900{sup o}C in a thermal analysis system. Peat, anthracite, and bituminous coal samples from different countries and various lignites from Turkey such as Askale, Soma, and Elbistan were used. DTA (Differential Thermal Analysis) and TGA (Thermogravimetric Analysis) techniques were applied. DTG (Derivative Thermogravimetric) curves were derived and interpreted considering the physical and chemical properties, and the rank of coals. Pyrolytic chars obtained from the inert atmosphere experiments were examined applying SEM (Scanning Electron Microscopy) and XRD (X-ray Diffractometry) techniques. It was found that the thermal reactivity and the apparent thermal properties of different rank coals differ considerably under both conditions. 6 refs., 4 figs., 3 tabs.

  3. Rank-based Tests of the Cointegrating Rank in Semiparametric Error Correction Models

    NARCIS (Netherlands)

    Hallin, M.; van den Akker, R.; Werker, B.J.M.

    2012-01-01

    Abstract: This paper introduces rank-based tests for the cointegrating rank in an Error Correction Model with i.i.d. elliptical innovations. The tests are asymptotically distribution-free, and their validity does not depend on the actual distribution of the innovations. This result holds despite the

  4. Pulling Rank: A Plan to Help Students with College Choice in an Age of Rankings

    Science.gov (United States)

    Thacker, Lloyd

    2008-01-01

    Colleges and universities are "ranksteering"--driving under the influence of popular college rankings systems like "U.S. News and World Report's" Best Colleges. This article examines the criticisms of college rankings and describes how a group of education leaders is honing a plan to end the tyranny of the ratings game and better help students and…

  5. Rank-based Tests of the Cointegrating Rank in Semiparametric Error Correction Models

    NARCIS (Netherlands)

    Hallin, M.; van den Akker, R.; Werker, B.J.M.

    2012-01-01

    Abstract: This paper introduces rank-based tests for the cointegrating rank in an Error Correction Model with i.i.d. elliptical innovations. The tests are asymptotically distribution-free, and their validity does not depend on the actual distribution of the innovations. This result holds despite the

  6. 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.

  7. Rank correlation among different statistical models in ranking of winter wheat genotypes’

    Institute of Scientific and Technical Information of China (English)

    Mozaffar; Roostaei; Reza; Mohammadi; Ahmed; Amri

    2014-01-01

    Several statistical methods have been developed for analyzing genotype×environment(GE)interactions in crop breeding programs to identify genotypes with high yield and stability performances.Four statistical methods,including joint regression analysis(JRA),additive mean effects and multiplicative interaction(AMMI)analysis,genotype plus GE interaction(GGE)biplot analysis,and yield–stability(YSi)statistic were used to evaluate GE interaction in20 winter wheat genotypes grown in 24 environments in Iran.The main objective was to evaluate the rank correlations among the four statistical methods in genotype rankings for yield,stability and yield–stability.Three kinds of genotypic ranks(yield ranks,stability ranks,and yield–stability ranks)were determined with each method.The results indicated the presence of GE interaction,suggesting the need for stability analysis.With respect to yield,the genotype rankings by the GGE biplot and AMMI analysis were significantly correlated(P<0.01).For stability ranking,the rank correlations ranged from 0.53(GGE–YSi;P<0.05)to0.97(JRA–YSi;P<0.01).AMMI distance(AMMID)was highly correlated(P<0.01)with variance of regression deviation(S2di)in JRA(r=0.83)and Shukla stability variance(σ2)in YSi(r=0.86),indicating that these stability indices can be used interchangeably.No correlation was found between yield ranks and stability ranks(AMMID,S2di,σ2,and GGE stability index),indicating that they measure static stability and accordingly could be used if selection is based primarily on stability.For yield–stability,rank correlation coefficients among the statistical methods varied from 0.64(JRA–YSi;P<0.01)to 0.89(AMMI–YSi;P<0.01),indicating that AMMI and YSi were closely associated in the genotype ranking for integrating yield with stability performance.Based on the results,it can be concluded that YSi was closely correlated with(i)JRA in ranking genotypes for stability and(ii)AMMI for integrating yield and stability.

  8. Rank correlation among different statistical models in ranking of winter wheat genotypes

    Directory of Open Access Journals (Sweden)

    Mozaffar Roostaei

    2014-04-01

    Full Text Available Several statistical methods have been developed for analyzing genotype × environment (GE interactions in crop breeding programs to identify genotypes with high yield and stability performances. Four statistical methods, including joint regression analysis (JRA, additive mean effects and multiplicative interaction (AMMI analysis, genotype plus GE interaction (GGE biplot analysis, and yield–stability (YSi statistic were used to evaluate GE interaction in 20 winter wheat genotypes grown in 24 environments in Iran. The main objective was to evaluate the rank correlations among the four statistical methods in genotype rankings for yield, stability and yield–stability. Three kinds of genotypic ranks (yield ranks, stability ranks, and yield–stability ranks were determined with each method. The results indicated the presence of GE interaction, suggesting the need for stability analysis. With respect to yield, the genotype rankings by the GGE biplot and AMMI analysis were significantly correlated (P < 0.01. For stability ranking, the rank correlations ranged from 0.53 (GGE–YSi; P < 0.05 to 0.97 (JRA–YSi; P < 0.01. AMMI distance (AMMID was highly correlated (P < 0.01 with variance of regression deviation (S2di in JRA (r = 0.83 and Shukla stability variance (σ2 in YSi (r = 0.86, indicating that these stability indices can be used interchangeably. No correlation was found between yield ranks and stability ranks (AMMID, S2di, σ2, and GGE stability index, indicating that they measure static stability and accordingly could be used if selection is based primarily on stability. For yield–stability, rank correlation coefficients among the statistical methods varied from 0.64 (JRA–YSi; P < 0.01 to 0.89 (AMMI–YSi; P < 0.01, indicating that AMMI and YSi were closely associated in the genotype ranking for integrating yield with stability performance. Based on the results, it can be concluded that YSi was closely correlated with (i JRA in ranking

  9. Learning to rank for information retrieval

    CERN Document Server

    Liu, Tie-Yan

    2011-01-01

    Due to the fast growth of the Web and the difficulties in finding desired information, efficient and effective information retrieval systems have become more important than ever, and the search engine has become an essential tool for many people. The ranker, a central component in every search engine, is responsible for the matching between processed queries and indexed documents. Because of its central role, great attention has been paid to the research and development of ranking technologies. In addition, ranking is also pivotal for many other information retrieval applications, such as coll

  10. Improved Relevance Ranking in WebGather

    Institute of Scientific and Technical Information of China (English)

    LEI Ming; WANG Jianyong; CHEN Baojue; LI Xiaoming

    2001-01-01

    The amount of information on the web is growing rapidly, and search engines that rely on keyword matching usually return too many low quality matches. To improve search results, a challenging task for search engines is how to effectively calculate a relevance ranking for each web page. This paper discusses in what order a search engine should return the URLs it has produced in response to a user's query, so as to show more relevant pages first.Emphasis is given on the ranking functions adopted by WebGather that take link structure and user popularity factors into account. Experimental results are also presented to evaluate the proposed strategy.

  11. Reduced Multiplicative Tolerance Ranking and Applications

    Directory of Open Access Journals (Sweden)

    Sebastian Sitarz

    2013-02-01

    Full Text Available In this paper a reduced multiplicative tolerance - a measure of sensitivity analysis in multi-objective linear programming (MOLP is presented. By using this new measure a method for ranking the set of efficient extreme solutions is proposed. The idea is to rank these solutions by values of the reduced tolerance. This approach can be applied to many MOLP problems, where sensitivity analysis is important for a decision maker. In the paper, applications of the presented methodology are shown in the market model and the transportation problem.

  12. Two-dimensional ranking of Wikipedia articles

    CERN Document Server

    Zhirov, A O; Shepelyansky, D L

    2010-01-01

    The Library of Babel, described by Jorge Luis Borges, stores an enormous amount of information. The Library exists {\\it 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. 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.

  13. 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.

  14. Estimation of Low-Rank Covariance Function

    OpenAIRE

    Koltchinskii, Vladimir; Lounici, Karim; Tsybakov, Alexander B.

    2015-01-01

    We consider the problem of estimating a low rank covariance function $K(t,u)$ of a Gaussian process $S(t), t\\in [0,1]$ based on $n$ i.i.d. copies of $S$ observed in a white noise. We suggest a new estimation procedure adapting simultaneously to the low rank structure and the smoothness of the covariance function. The new procedure is based on nuclear norm penalization and exhibits superior performances as compared to the sample covariance function by a polynomial factor in the sample size $n$...

  15. The ranks of Maiorana-McFarland bent functions

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this paper, the ranks of a special family of Maiorana-McFarland bent functions are discussed. The upper and lower bounds of the ranks are given and those bent functions whose ranks achieve these bounds are determined. As a consequence, the inequivalence of some bent functions are derived. Furthermore, the ranks of the functions of this family are calculated when t 6.

  16. 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…

  17. Some upper and lower bounds on PSD-rank

    NARCIS (Netherlands)

    T. J. Lee (Troy); Z. Wei (Zhaohui); R. M. de Wolf (Ronald)

    2014-01-01

    textabstractPositive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All of these

  18. Some upper and lower bounds on PSD-rank

    NARCIS (Netherlands)

    Lee, T.; Wei, Z.; de Wolf, R.

    Positive semidefinite rank (PSD-rank) is a relatively new complexity measure on matrices, with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All

  19. The effect of new links on Google PageRank

    NARCIS (Netherlands)

    Avrachenkov, Konstatin; Litvak, Nelly

    2004-01-01

    PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of visiting a Web page by a random surfer and thus it reflects the popularity of a Web page. We study the effect of newly created links on Google PageRank. We discuss to wh

  20. 5 CFR 451.302 - Ranks for senior career employees.

    Science.gov (United States)

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Ranks for senior career employees. 451... AWARDS Presidential Rank Awards § 451.302 Ranks for senior career employees. (a) The circumstances under... Professional to a senior career employee are set forth in 5 U.S.C. 4507a. (b) To be eligible for a rank...

  1. On bundles of rank 3 computing Clifford indices

    CERN Document Server

    Lange, H

    2012-01-01

    Let $C$ be a smooth irreducible projective algebraic curve defined over the complex numbers. The notion of the Clifford index of $C$ was extended a few years ago to semistable bundles of any rank. Recent work has been focussed mainly on the rank-2 Clifford index, although interesting results have also been obtained for the case of rank 3. In this paper we extend this work, obtaining improved lower bounds for the rank-3 Clifford index. This allows the first computations of the rank-3 index in non-trivial cases and examples for which the rank-3 index is greater than the rank-2 index.

  2. 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.

  3. City Life: Rankings (Livability) versus Perceptions (Satisfaction)

    Science.gov (United States)

    Okulicz-Kozaryn, Adam

    2013-01-01

    I investigate the relationship between the popular Mercer city ranking (livability) and survey data (satisfactions). Livability aims to capture "objective" quality of life such as infrastructure. Survey items capture "subjective" quality of life such as satisfaction with city. The relationship between objective measures of quality of life and…

  4. Ranking Very Many Typed Entities on Wikipedia

    NARCIS (Netherlands)

    Zaragoza, Hugo; Rode, Henning; Mika, Peter; Atserias, Jordi; Ciaramita, Massimiliano; Attardi, Guiseppe

    2007-01-01

    We discuss the problem of ranking very many entities of different types. In particular we deal with a heterogeneous set of types, some being very generic and some very specific. We discuss two approaches for this problem: i) exploiting the entity containment graph and ii) using a Web search engine t

  5. Subject Gateway Sites and Search Engine Ranking.

    Science.gov (United States)

    Thelwall, Mike

    2002-01-01

    Discusses subject gateway sites and commercial search engines for the Web and presents an explanation of Google's PageRank algorithm. The principle question addressed is the conditions under which a gateway site will increase the likelihood that a target page is found in search engines. (LRW)

  6. Primate Innovation: Sex, Age and Social Rank

    NARCIS (Netherlands)

    Reader, S.M.; Laland, K.N.

    2001-01-01

    Analysis of an exhaustive survey of primate behavior collated from the published literature revealed significant variation in rates of innovation among individuals of different sex, age and social rank. We searched approximately 1,000 articles in four primatology journals, together with other releva

  7. Kinesiology Faculty Citations across Academic Rank

    Science.gov (United States)

    Knudson, Duane

    2015-01-01

    Citations to research reports are used as a measure for the influence of a scholar's research line when seeking promotion, grants, and awards. The current study documented the distributions of citations to kinesiology scholars of various academic ranks. Google Scholar Citations was searched for user profiles using five research interest areas…

  8. Ranking related entities: components and analyses

    NARCIS (Netherlands)

    Bron, M.; Balog, K.; de Rijke, M.

    2010-01-01

    Related entity finding is the task of returning a ranked list of homepages of relevant entities of a specified type that need to engage in a given relationship with a given source entity. We propose a framework for addressing this task and perform a detailed analysis of four core components; co-occu

  9. Adaptive distributional extensions to DFR ranking

    DEFF Research Database (Denmark)

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

    2016-01-01

    Divergence From Randomness (DFR) ranking models assume that informative terms are distributed in a corpus differently than non-informative terms. Different statistical models (e.g. Poisson, geometric) are used to model the distribution of non-informative terms, producing different DFR models. An ...

  10. An algorithm for ranking assignments using reoptimization

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan

    2008-01-01

    We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization...... technique. Computational results for the new algorithm are presented...

  11. Ranking Workplace Competencies: Student and Graduate Perceptions.

    Science.gov (United States)

    Rainsbury, Elizabeth; Hodges, Dave; Burchell, Noel; Lay, Mark

    2002-01-01

    New Zealand business students and graduates made similar rankings of the five most important workplace competencies: computer literacy, customer service orientation, teamwork and cooperation, self-confidence, and willingness to learn. Graduates placed greater importance on most of the 24 competencies, resulting in a statistically significant…

  12. Texture Repairing by Unified Low Rank Optimization

    Institute of Scientific and Technical Information of China (English)

    Xiao Liang; Xiang Ren; Zhengdong Zhang; Yi Ma

    2016-01-01

    In this paper, we show how to harness both low-rank and sparse structures in regular or near-regular textures for image completion. Our method is based on a unified formulation for both random and contiguous corruption. In addition to the low rank property of texture, the algorithm also uses the sparse assumption of the natural image: because the natural image is piecewise smooth, it is sparse in certain transformed domain (such as Fourier or wavelet transform). We combine low-rank and sparsity properties of the texture image together in the proposed algorithm. Our algorithm based on convex optimization can automatically and correctly repair the global structure of a corrupted texture, even without precise information about the regions to be completed. This algorithm integrates texture rectification and repairing into one optimization problem. Through extensive simulations, we show our method can complete and repair textures corrupted by errors with both random and contiguous supports better than existing low-rank matrix recovery methods. Our method demonstrates significant advantage over local patch based texture synthesis techniques in dealing with large corruption, non-uniform texture, and large perspective deformation.

  13. Block Models and Personalized PageRank

    CERN Document Server

    Kloumann, Isabel; Kleinberg, Jon

    2016-01-01

    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 though the seed set expansion problem: given a subset $S$ 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, ...

  14. BPR: Bayesian Personalized Ranking from Implicit Feedback

    CERN Document Server

    Rendle, Steffen; Gantner, Zeno; Schmidt-Thieme, Lars

    2012-01-01

    Item recommendation is the task of predicting a personalized ranking on a set of items (e.g. websites, movies, products). In this paper, we investigate the most common scenario with implicit feedback (e.g. clicks, purchases). There are many methods for item recommendation from implicit feedback like matrix factorization (MF) or adaptive knearest-neighbor (kNN). Even though these methods are designed for the item prediction task of personalized ranking, none of them is directly optimized for ranking. In this paper we present a generic optimization criterion BPR-Opt for personalized ranking that is the maximum posterior estimator derived from a Bayesian analysis of the problem. We also provide a generic learning algorithm for optimizing models with respect to BPR-Opt. The learning method is based on stochastic gradient descent with bootstrap sampling. We show how to apply our method to two state-of-the-art recommender models: matrix factorization and adaptive kNN. Our experiments indicate that for the task of p...

  15. Cointegration rank testing under conditional heteroskedasticity

    DEFF Research Database (Denmark)

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

    2010-01-01

    We analyze the properties of the conventional Gaussian-based cointegrating rank tests of Johansen (1996, Likelihood-Based Inference in Cointegrated Vector Autoregressive Models) in the case where the vector of series under test is driven by globally stationary, conditionally heteroskedastic...

  16. An Application of Sylvester's Rank Inequality

    Science.gov (United States)

    Kung, Sidney H.

    2011-01-01

    Using two well known criteria for the diagonalizability of a square matrix plus an extended form of Sylvester's Rank Inequality, the author presents a new condition for the diagonalization of a real matrix from which one can obtain the eigenvectors by simply multiplying some associated matrices without solving a linear system of simultaneous…

  17. Statistical inference of Minimum Rank Factor Analysis

    NARCIS (Netherlands)

    Shapiro, A; Ten Berge, JMF

    2002-01-01

    For any given number of factors, Minimum Rank Factor Analysis yields optimal communalities for an observed covariance matrix in the sense that the unexplained common variance with that number of factors is minimized, subject to the constraint that both the diagonal matrix of unique variances and the

  18. Global Rank Axioms for Poset Matroids

    Institute of Scientific and Technical Information of China (English)

    Shu Chao LI; Yan Qin FENG

    2004-01-01

    An excellent introduction to the topic of poset matroids is due to Barnabei, Nicoletti and Pezzoli. In this paper, we investigate the rank axioms for poset matroids; thereby we can characterize poset matroids in a "global" version and a "pseudo-global" version. Some corresponding properties of combinatorial schemes are also obtained.

  19. Ranking Workplace Competencies: Student and Graduate Perceptions.

    Science.gov (United States)

    Rainsbury, Elizabeth; Hodges, Dave; Burchell, Noel; Lay, Mark

    2002-01-01

    New Zealand business students and graduates made similar rankings of the five most important workplace competencies: computer literacy, customer service orientation, teamwork and cooperation, self-confidence, and willingness to learn. Graduates placed greater importance on most of the 24 competencies, resulting in a statistically significant…

  20. Primate Innovation: Sex, Age and Social Rank

    NARCIS (Netherlands)

    Reader, S.M.; Laland, K.N.

    2001-01-01

    Analysis of an exhaustive survey of primate behavior collated from the published literature revealed significant variation in rates of innovation among individuals of different sex, age and social rank. We searched approximately 1,000 articles in four primatology journals, together with other releva

  1. A note on ranking assignments using reoptimization

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, L.R.; Andersen, K.A.

    2005-01-01

    We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization...

  2. Statistical inference of Minimum Rank Factor Analysis

    NARCIS (Netherlands)

    Shapiro, A; Ten Berge, JMF

    For any given number of factors, Minimum Rank Factor Analysis yields optimal communalities for an observed covariance matrix in the sense that the unexplained common variance with that number of factors is minimized, subject to the constraint that both the diagonal matrix of unique variances and the

  3. Alternative Class Ranks Using Z-Scores

    Science.gov (United States)

    Brown, Philip H.; Van Niel, Nicholas

    2012-01-01

    Grades at US colleges and universities have increased precipitously over the last 50 years, suggesting that their signalling power has become attenuated. Moreover, average grades have risen disproportionately in some departments, implying that weak students in departments with high grades may obtain better class ranks than strong students in…

  4. Ranking health between countries in international comparisons

    DEFF Research Database (Denmark)

    Brønnum-Hansen, Henrik

    2014-01-01

    Cross-national comparisons and ranking of summary measures of population health sometimes give rise to inconsistent and diverging conclusions. In order to minimise confusion, international comparative studies ought to be based on well-harmonised data with common standards of definitions...

  5. Suppression pheromone and cockroach rank formation

    Science.gov (United States)

    Kou, Rong; Chang, Huan-Wen; Chen, Shu-Chun; Ho, Hsiao-Yung

    2009-06-01

    Although agonistic behaviors in the male lobster cockroach ( Nauphoeta cinerea) are well known, the formation of an unstable hierarchy has long been a puzzle. In this study, we investigate how the unstable dominance hierarchy in N. cinerea is maintained via a pheromone signaling system. In agonistic interactions, aggressive posture (AP) is an important behavioral index of aggression. This study showed that, during the formation of a governing hierarchy, thousands of nanograms of 3-hydroxy-2-butanone (3H-2B) were released by the AP-adopting dominant in the first encounter fight, then during the early domination period and that this release of 3H-2B was related to rank maintenance, but not to rank establishment. For rank maintenance, 3H-2B functioned as a suppression pheromone, which suppressed the fighting capability of rivals and kept them in a submissive state. During the period of rank maintenance, as the dominant male gradually decreased his 3H-2B release, the fighting ability of the subordinate gradually developed, as shown by the increasing odds of a subordinate adopting an AP (OSAP). The OSAP was negatively correlated with the amount of 3H-2B released by the dominant and positively correlated with the number of domination days. The same OSAP could be achieved earlier by reducing the amount of 3H-2B released by the dominant indicates that whether the subordinate adopts an offensive strategy depends on what the dominant is doing.

  6. George Wilbur: Otto Rank and Hanns Sachs.

    Science.gov (United States)

    Roazen, Paul

    2006-01-01

    George Wilbur, a pioneering Cape Cod psychoanalytic psychiatrist, was a long-standing editor of the journal "American Imago," and an excellent source of information about the Viennese analysts Otto Rank and Hanns Sachs. Wilbur was also knowledgeable about the early reception of psychoanalysis in the Boston community.

  7. Rank-frequency relation for Chinese characters

    CERN Document Server

    Deng, W B; Li, B; Wang, Q A

    2013-01-01

    The Zipf's law states that the ordered frequencies $f_1>f_2> ...$ of different words in a text hold $f_r\\propto r^{-\\gamma}$ with $\\gamma\\approx 1$ and rank $r$. The law applies to many languages with alphabetical writing systems, but was so far found to be absent for the rank-frequency relation of the Chinese characters, the main (and oldest) example of the logographic writing system. Here we show that the Zipf's law for Chinese characters perfectly holds for sufficiently short texts (few thousand different characters). The scenario of its validity is similar to the Zipf's law for words in short English texts. We focus on short texts, since for the sake of the rank-frequency analysis, long texts are just mixtures of shorter, thematically homogenous pieces. For long texts (or for mixtures of short texts), the Zipf's law holds for a relatively small range of ranks, but it is still important, since for all Chinese texts (we studied) it carries out $simeq 40%$ of the overall frequency. The previous results on th...

  8. The cactus rank of cubic forms

    CERN Document Server

    Bernardi, Alessandra

    2011-01-01

    We prove that the smallest degree of an apolar 0-dimensional scheme to a general cubic form in $n+1$ variables is at most $2n+2$, when $n\\geq 8$, and therefore smaller than the rank of the form. When n=8 we show that the bound is sharp, i.e. the smallest degree of an apolar subscheme is 18.

  9. Rank-one LMIs and Lyapunov's inequality

    NARCIS (Netherlands)

    Henrion, D.; Meinsma, G.

    2001-01-01

    We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix in some region of the complex plane. The proof makes use of standard facts from quadratic and semi-definite programming. Links are established between the Lyapunov matrix, rank-on

  10. Kinesiology Faculty Citations across Academic Rank

    Science.gov (United States)

    Knudson, Duane

    2015-01-01

    Citations to research reports are used as a measure for the influence of a scholar's research line when seeking promotion, grants, and awards. The current study documented the distributions of citations to kinesiology scholars of various academic ranks. Google Scholar Citations was searched for user profiles using five research interest areas…

  11. To Overcome HITS Rank Similarity Confliction of Web Pages using Weight Calculation and Rank Improvement

    Science.gov (United States)

    Nath, Rajender; Kumar, Naresh

    2011-12-01

    Search Engine gives an ordered list of web search results in response to a user query, wherein the important pages are usually displayed at the top with less important ones afterwards. It may be possible that the user may have to look for many screen results to get the required documents. In literatures, many page ranking algorithms has been given to find the page rank of a page. For example PageRank is considered in this work. This algorithm treats all the links equally when distributing rank scores. That's why this algorithm some time gives equal importance to all the pages. But in real this can not be happen because, if two pages have same rank then how we can judge which page is more important then other. So this paper proposes another idea to organize the search results and describe which page is more important when confliction of same rank is produced by the PageRank. So that the user can get more relevant and important results easily and in a short span of time.

  12. 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/.

  13. VaRank: a simple and powerful tool for ranking genetic variants.

    Science.gov (United States)

    Geoffroy, Véronique; Pizot, Cécile; Redin, Claire; Piton, Amélie; Vasli, Nasim; Stoetzel, Corinne; Blavier, André; Laporte, Jocelyn; Muller, Jean

    2015-01-01

    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/.

  14. Rank correlation plots for use with correlated input variables in simulation studies

    Energy Technology Data Exchange (ETDEWEB)

    Iman, R.L.; Davenport, J.M.

    1980-11-01

    A method for inducing a desired rank correlation matrix on multivariate input vectors for simulation studies has recently been developed by Iman and Conover (SAND 80-0157). The primary intention of this procedure is to produce correlated input variables for use with computer models. Since this procedure is distribution free and allows the exact marginal distributions to remain intact, it can be used with any marginal distributions for which it is reasonable to think in terms of correlation. A series of rank correlation plots based on this procedure when the marginal distributions are normal, lognormal, uniform, and loguniform is presented. These plots provide a convenient tool for both aiding the modeler in determining the degree of dependence among variables (rather than guessing) and communicating with the modeler the effect of different correlation assumptions. 12 figures, 10 tables.

  15. Information content of partially rank-ordered set samples

    OpenAIRE

    Hatefi, Armin; Jozani, Mohammad Jafari

    2015-01-01

    Partially rank-ordered set (PROS) sampling is a generalization of ranked set sampling in which rankers are not required to fully rank the sampling units in each set, hence having more flexibility to perform the necessary judgemental ranking process. The PROS sampling has a wide range of applications in different fields ranging from environmental and ecological studies to medical research and it has been shown to be superior over ranked set sampling and simple random sampling for estimating th...

  16. Rank-based camera spectral sensitivity estimation.

    Science.gov (United States)

    Finlayson, Graham; Darrodi, Maryam Mohammadzadeh; Mackiewicz, Michal

    2016-04-01

    In order to accurately predict a digital camera response to spectral stimuli, the spectral sensitivity functions of its sensor need to be known. These functions can be determined by direct measurement in the lab-a difficult and lengthy procedure-or through simple statistical inference. Statistical inference methods are based on the observation that when a camera responds linearly to spectral stimuli, the device spectral sensitivities are linearly related to the camera rgb response values, and so can be found through regression. However, for rendered images, such as the JPEG images taken by a mobile phone, this assumption of linearity is violated. Even small departures from linearity can negatively impact the accuracy of the recovered spectral sensitivities, when a regression method is used. In our work, we develop a novel camera spectral sensitivity estimation technique that can recover the linear device spectral sensitivities from linear images and the effective linear sensitivities from rendered images. According to our method, the rank order of a pair of responses imposes a constraint on the shape of the underlying spectral sensitivity curve (of the sensor). Technically, each rank-pair splits the space where the underlying sensor might lie in two parts (a feasible region and an infeasible region). By intersecting the feasible regions from all the ranked-pairs, we can find a feasible region of sensor space. Experiments demonstrate that using rank orders delivers equal estimation to the prior art. However, the Rank-based method delivers a step-change in estimation performance when the data is not linear and, for the first time, allows for the estimation of the effective sensitivities of devices that may not even have "raw mode." Experiments validate our method.

  17. On isomorphisms of integral table algebras

    Institute of Scientific and Technical Information of China (English)

    FAN; Yun(樊恽); SUN; Daying(孙大英)

    2002-01-01

    For integral table algebras with integral table basis T, we can consider integral R-algebra RT over a subring R of the ring of the algebraic integers. It is proved that an R-algebra isomorphism between two integral table algebras must be an integral table algebra isomorphism if it is compatible with the so-called normalizings of the integral table algebras.

  18. MCNPX Model/Table Comparison

    Energy Technology Data Exchange (ETDEWEB)

    J.S. Hendricks

    2003-03-03

    MCNPX is a Monte Carlo N-Particle radiation transport code extending the capabilities of MCNP4C. As with MCNP, MCNPX uses nuclear data tables to transport neutrons, photons, and electrons. Unlike MCNP, MCNPX also uses (1) nuclear data tables to transport protons; (2) physics models to transport 30 additional particle types (deuterons, tritons, alphas, pions, muons, etc.); and (3) physics models to transport neutrons and protons when no tabular data are available or when the data are above the energy range (20 to 150 MeV) where the data tables end. MCNPX can mix and match data tables and physics models throughout a problem. For example, MCNPX can model neutron transport in a bismuth germinate (BGO) particle detector by using data tables for bismuth and oxygen and using physics models for germanium. Also, MCNPX can model neutron transport in UO{sub 2}, making the best use of physics models and data tables: below 20 MeV, data tables are used; above 150 MeV, physics models are used; between 20 and 150 MeV, data tables are used for oxygen and models are used for uranium. The mix-and-match capability became available with MCNPX2.5.b (November 2002). For the first time, we present here comparisons that calculate radiation transport in materials with various combinations of data charts and model physics. The physics models are poor at low energies (<150 MeV); thus, data tables should be used when available. Our comparisons demonstrate the importance of the mix-and-match capability and indicate how well physics models work in the absence of data tables.

  19. Weighted Page Content Rank for Ordering Web Search Result

    Directory of Open Access Journals (Sweden)

    POOJA SHARMA,

    2010-12-01

    Full Text Available With the explosive growth of information sources available on the World Wide Web, it has become increasingly necessary for user’s to utilize automated tools in order to find, extract, filter and evaluate the desired information and resources. Web structure mining and content mining plays an effective role in this approach. There are two Ranking algorithms PageRank and Weighted PageRank. PageRank is a commonly used algorithm in Web Structure Mining. Weighted Page Rank also takes the importance of the inlinks and outlinks of the pages but the rank score to all links is not equally distributed. i.e. unequal distribution is performed. In this paper we proposed a new algorithm, Weighted Page Content Rank (WPCRbased on web content mining and structure mining that shows the relevancy of the pages to a given query is better determined, as compared to the existing PageRank and Weighted PageRank algorithms.

  20. A Review of Outcomes of Seven World University Ranking Systems

    Directory of Open Access Journals (Sweden)

    Mahmood Khosrowjerdi

    2012-12-01

    Full Text Available There are many national and international ranking systems rank the universities and higher education institutions of the world, nationally or internationally, based on the same or different criteria. The question is whether we need all these ranking systems? Are the outcomes of these ranking systems as different as they claim? This study collected data from the results of seven major ranking systems including Shanghai, QS, 4International, Webometrics, HEEACT, and Leiden University ranking and analyzed them. Results showed a significant correlation among the outcomes of these international ranking systems in ranking and rating the world's top 50 universities. The highest correlation was between Shanghai - THE (Spearman's Rho = 0.85; Shanghai - Webometrics (Spearman's Rho = 0.81 and Shanghai - Leiden (Spearman's Rho = 0.80. Finally, some suggestions for improving current ranking systems have been investigated.

  1. MCNPX Model/Table Comparison

    CERN Document Server

    Hendricks, J S

    2003-01-01

    MCNPX is a Monte Carlo N-Particle radiation transport code extending the capabilities of MCNP4C. As with MCNP, MCNPX uses nuclear data tables to transport neutrons, photons, and electrons. Unlike MCNP, MCNPX also uses (1) nuclear data tables to transport protons; (2) physics models to transport 30 additional particle types (deuterons, tritons, alphas, pions, muons, etc.); and (3) physics models to transport neutrons and protons when no tabular data are available or when the data are above the energy range (20 to 150 MeV) where the data tables end. MCNPX can mix and match data tables and physics models throughout a problem. For example, MCNPX can model neutron transport in a bismuth germinate (BGO) particle detector by using data tables for bismuth and oxygen and using physics models for germanium. Also, MCNPX can model neutron transport in UO sub 2 , making the best use of physics models and data tables: below 20 MeV, data tables are used; above 150 MeV, physics models are used; between 20 and 150 MeV, data t...

  2. Low-rank quadratic semidefinite programming

    KAUST Repository

    Yuan, Ganzhao

    2013-04-01

    Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.

  3. Correlated Topic Model for Web Services Ranking

    Directory of Open Access Journals (Sweden)

    Mustapha AZNAG

    2013-07-01

    Full Text Available With the increasing number of published Web services providing similar functionalities, it’s very tedious for a service consumer to make decision to select the appropriate one according to her/his needs. In this paper, we explore several probabilistic topic models: Probabilistic Latent Semantic Analysis (PLSA, Latent Dirichlet Allocation (LDA and Correlated Topic Model (CTM to extract latent factors from web service descriptions. In our approach, topic models are used as efficient dimension reduction techniques, which are able to capture semantic relationships between word-topic and topic-service interpreted in terms of probability distributions. To address the limitation of keywords-based queries, we represent web service description as a vector space and we introduce a new approach for discovering and ranking web services using latent factors. In our experiment, we evaluated our Service Discovery and Ranking approach by calculating the precision (P@n and normalized discounted cumulative gain (NDCGn.

  4. Compressed Sensing with Rank Deficient Dictionaries

    DEFF Research Database (Denmark)

    Hansen, Thomas Lundgaard; Johansen, Daniel Højrup; Jørgensen, Peter Bjørn

    2012-01-01

    In compressed sensing it is generally assumed that the dictionary matrix constitutes a (possibly overcomplete) basis of the signal space. In this paper we consider dictionaries that do not span the signal space, i.e. rank deficient dictionaries. We show that in this case the signal-to-noise ratio...... (SNR) in the compressed samples can be increased by selecting the rows of the measurement matrix from the column space of the dictionary. As an example application of compressed sensing with a rank deficient dictionary, we present a case study of compressed sensing applied to the Coarse Acquisition (C....../A) step in a GPS receiver. Simulations show that for this application the proposed choice of measurement matrix yields an increase in SNR performance of up to 5 − 10 dB, compared to the conventional choice of a fully random measurement matrix. Furthermore, the compressed sensing based C/A step is compared...

  5. A linear functional strategy for regularized ranking.

    Science.gov (United States)

    Kriukova, Galyna; Panasiuk, Oleksandra; Pereverzyev, Sergei V; Tkachenko, Pavlo

    2016-01-01

    Regularization schemes are frequently used for performing ranking tasks. This topic has been intensively studied in recent years. However, to be effective a regularization scheme should be equipped with a suitable strategy for choosing a regularization parameter. In the present study we discuss an approach, which is based on the idea of a linear combination of regularized rankers corresponding to different values of the regularization parameter. The coefficients of the linear combination are estimated by means of the so-called linear functional strategy. We provide a theoretical justification of the proposed approach and illustrate them by numerical experiments. Some of them are related with ranking the risk of nocturnal hypoglycemia of diabetes patients.

  6. Deep Impact: Unintended consequences of journal rank

    CERN Document Server

    Brembs, Björn

    2013-01-01

    Much has been said about the increasing bureaucracy in science, stifling innovation, hampering the creativity of researchers and incentivizing misconduct, even outright fraud. Many anecdotes have been recounted, observations described and conclusions drawn about the negative impact of impact assessment on scientists and science. However, few of these accounts have drawn their conclusions from data, and those that have typically relied on a few studies. In this review, we present the most recent and pertinent data on the consequences that our current scholarly communication system has had on various measures of scientific quality (such as utility/citations, methodological soundness, expert ratings and retractions). These data confirm previous suspicions: using journal rank as an assessment tool is bad scientific practice. Moreover, the data lead us to argue that any journal rank (not only the currently-favored Impact Factor) would have this negative impact. Therefore, we suggest that abandoning journals altoge...

  7. Detectability of ranking hierarchies in directed networks

    CERN Document Server

    Letizia, Elisa; Lillo, Fabrizio

    2016-01-01

    Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications such as social network analysis, biology, economics, and finance. A recently proposed method identifies the hierarchy by finding the ordered partition of nodes which minimizes a score function, termed agony. This function penalizes the links violating the hierarchy in a way depending on the strength of the violation. To investigate the detectability of ranking hierarchies we introduce an ensemble of random graphs, the Hierarchical Stochastic Block Model. We find that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network. We analytically characterize the detectability threshold and we show that an iterated version of agony can partly overcome this resolution limit.

  8. The Periodic Table in Croatia

    Directory of Open Access Journals (Sweden)

    Raos, N.

    2011-12-01

    Full Text Available The Croatian (Yugoslav Academy of Sciences and Arts was the first academy to elect D. I. Mendeleev as its honorary member (1882, whereas the periodic table of the elements has been taught regularly at the Zagreb University since 1888. The early interest of Croatian chemists in the periodic table should be attributed primarily to their pan-Slavic attitude, particularly as proof that Slavic people were able to produce "their own Newtons" (M. V. Lomonosov and D. I. Mendeleev. Such enthusiastic views, however, did not help in analyzing the contribution of Mendeleev and other scientists to the discovery and development of the periodic table of the elements.

  9. Table Tennis Mother”

    Institute of Scientific and Technical Information of China (English)

    1995-01-01

    GUAN Yan sat on the blue stand at Tianjin Stadium. Beside her were the members of China’ s National Table Tennis Team in purple sportswear. Looking at her, no one would associate this small, amiable, grey-haired old mother with the brave sportswomen and sportsmen, yet she is physician to China’s National Table Tennis Team. She has worked with them for 34 years, ever since the 26th World Table Tennis Championships. At that time she was 24 years old and a new graduate of Zhejiang

  10. Bronze Dragons and Phoenix Table

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    The table is one of the oldest kinds of furniture in China.Most, however, haven’t survived as they were made ofbamboo or wood, The discovery of this bronze table gives usa chance to see a real object from the Warring States Periodfor the first time. This bronze table was unearthed from the tomb of a kingof the Zhongshan Kingdom during the Warring States Periodat today’s Pingshan County, Hebei Province. The stand isformed from four two-winged dragons and four phoenixes

  11. BRICS countries in international innovation rankings

    OpenAIRE

    RODIONOVA I.; MASSAROVA A.; EPIFANTSEVA A.

    2015-01-01

    The BRICS countries (China, Russia, Brazil, India and South Africa) are the largest emerging markets which are undergoing the processes of economic modernization and restructuring and taking the leading positions on many indicators on the global arena, extending beyond the regional scale. In the article, the positions of the BRICS countries in the international rankings of innovation capabilities will be considered in comparison with the leaders of the global economy. The recommendations for ...

  12. Fuzzy Logic Based Power System Contingency Ranking

    Directory of Open Access Journals (Sweden)

    A. Y. Abdelaziz

    2013-02-01

    Full Text Available Voltage stability is a major concern in planning and operations of power systems. It is well known that voltage instability and collapse have led to major system failures. Modern transmission networks are more heavily loaded than ever before to meet the growing demand. One of the major consequences resulted from such a stressed system is voltage collapse or instability. This paper presents maximum loadability identification of a load bus in a power transmission network. In this study, Fast Voltage Stability Index (FVSI is utilized as the indicator of the maximum loadability termed as Qmax. In this technique, reactive power loading will be increased gradually at particular load bus until the FVSI reaches close to unity. Therefore, a critical value of FVSI was set as the maximum loadability point. This value ensures the system from entering voltage-collapse region. The main purpose in the maximum loadability assessment is to plan for the maximum allowable load value to avoid voltage collapse; which is important in power system planning risk assessment.The most important task in security analysis is the problem of identifying the critical contingencies from a large list of credible contingencies and ranks them according to their severity. The condition of voltage stability in a power system can be characterized by the use of voltage stability indices. This paper presents fuzzy approach for ranking the contingencies using composite-index based on parallel operated fuzzy inference engine. The Line Flow index (L.F and bus Voltage Magnitude (VM of the load buses are expressed in fuzzy set notation. Further, they are evaluated using Fuzzy rules to obtain overall Criticality Index. Contingencies are ranked based on decreasing order of Criticality Index and then provides the comparison of ranking obtained with FVSI method.

  13. Ranking hubs and authorities using matrix functions

    OpenAIRE

    2012-01-01

    The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of undirected networks. In this paper we propose an extension of these measures to directed networks, and we apply them to the problem of ranking hubs and authorities. The extension is achieved by bipartization, i.e., the directed network is mapped onto a bipartite undirected network with twice as many nodes in order to ob...

  14. Wage sensitivity rankings and temporal convergence

    OpenAIRE

    Jones, Ronald W.; Neary, J. Peter

    1988-01-01

    This paper examines the two-sector general equilibrium model under a variety of labor-market distortions, including minimum wages and factor price differentials (both absolute and proportional). We introduce a new concept - the "wage sensitivity" ranking between sectors - and show that a necessary and sufficient condition for temporal convergence locally is that the physically labor-intensive sector be the wage-sensitive sector.

  15. Rank one case of Dwork's conjecture

    CERN Document Server

    Wan, D

    2000-01-01

    This paper proves the general rank one case of Dwork's conjecture over the affine space. It generalizes and improves the method of ANT-0141 "Dwork's conjecture on unit root zeta functions" (Ann. Math., 150(1999), 867-929). In addition, explicit information about the zeros and poles (along the Gouv\\^ea-Mazur conjecture direction) for the unit root zeta function is obtained. The paper is to appear in JAMS.

  16. Biodepolymerization studies of low rank Indian coals

    Energy Technology Data Exchange (ETDEWEB)

    Selvi, V.A.; Banerjee, R.; Ram, L.C.; Singh, G. [FRI, Dhanbad (India). Environmental Management Division

    2009-10-15

    Biodepolymerization of some of the lower rank Indian coals by Pleurotus djamor, Pleurotus citrinopileatus and Aspergillus species were studied in a batch system. The main disadvantage in burning low rank coals is the low calorific values. To get the maximum benefit from the low rank coals, the non fuel uses of coals needs to be explored. The liquefaction of coals is the preliminary processes for such approaches. The present study is undertaken specifically to investigate the optimization of bio depolymerization of Neyveli lignite by P. djmor. The pH of the media reached a constant value of about 7.8 by microbial action. The effect of different carbon and nitrogen sources and influence of chelators and metal ions on depolymerization of lignite were also studied. Lignite was solubilized by P. djamor only to a limited extent without the addition of carbon and nitrogen sources. Sucrose was the best suitable carbon source for coal depolymerization by P. djamor and sodium nitrate followed by urea was the best nitrogen source. The Chelators like salicylic acid, TEA and metal ions Mg{sup 2+}, Fe{sup 3+}, Ca{sup 2+}, Cu{sup 2+}, Mn{sup 2+} has enhanced the lignite solubilization process. The finding of the study showed that, compared to sub-bituminous and bituminous coal, the lignite has higher rate of solubilization activity.

  17. Reduced-Rank Hidden Markov Models

    CERN Document Server

    Siddiqi, Sajid M; Gordon, Geoffrey J

    2009-01-01

    We introduce the Reduced-Rank Hidden Markov Model (RR-HMM), a generalization of HMMs that can model smooth state evolution as in Linear Dynamical Systems (LDSs) as well as non-log-concave predictive distributions as in continuous-observation HMMs. RR-HMMs assume an m-dimensional latent state and n discrete observations, with a transition matrix of rank k <= m. This implies the dynamics evolve in a k-dimensional subspace, while the shape of the set of predictive distributions is determined by m. Latent state belief is represented with a k-dimensional state vector and inference is carried out entirely in R^k, making RR-HMMs as computationally efficient as k-state HMMs yet more expressive. To learn RR-HMMs, we relax the assumptions of a recently proposed spectral learning algorithm for HMMs (Hsu, Kakade and Zhang 2009) and apply it to learn k-dimensional observable representations of rank-k RR-HMMs. The algorithm is consistent and free of local optima, and we extend its performance guarantees to cover the RR-...

  18. Ranking environmental liabilities at a petroleum refinery

    Energy Technology Data Exchange (ETDEWEB)

    Lupo, M. [K. W. Brown Environmental Services, College Station, TX (United States)

    1995-12-31

    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.

  19. Web Mining Using PageRank Algorithm

    Directory of Open Access Journals (Sweden)

    Vignesh. V

    2013-11-01

    Full Text Available Data mining is extracting and automatic discovering the web based information has been used as web mining. It is one of the most universal and a dominant application on the Internet and it becomes increasing in size and search tools that combine the results of multiple search engines are becoming more valuable. But, almost none of these studies deals with genetic relation algorithm (GRA, where GRA is one of the evolutionary methods with graph structure. GRA was designed to both increase the effectiveness of search engine and improve their efficiency. GRA considers the correlation coefficient between stock brands as strength, which indicates the relation between nodes in each individual of GRA. The reduced number of hyperlinks provided by GRA in the final generation consists of only the most similar hyperlinks with respect to the query. But, the end user’s not satisfied fully. To improve the satisfaction of user by using Page rank algorithm to measure the importance of a page and to prioritize pages returned from a GRA. It will reduce the user’s searching time. PageRank algorithm works to allocate rank for filtered links based on number of keyword occurred in the content.

  20. Ranking with uncertain labels and its applications

    Institute of Scientific and Technical Information of China (English)

    YAN Shuicheng; WANG Huan; LIU Jianzhuang; TANG Xiao'ou; Thomas S.Huang

    2007-01-01

    The techniques for image analysis and classification generally consider the image sample labels fixed and without uncertainties.The rank regression problem studied in this paper is based on the training samples with uncertain labels,which often is the case for the manual estimated image labels.A core ranking model is designed first as the bilinear fusing of multiple candidate kernels.Then,the parameters for feature selection and kernel selection are learned simultaneously by maximum a posteriori for given samples and uncertain labels.The provable convergency Expectation Maximization(EM)method is used for inferring these parameters in an iterative manner.The effectiveness of the proposed algorithm is finally validated by the extensive experiments on age ranking task and human trackingtask.The popular FG-NET and the large scale Yamaha aging database are used for the age estimation experiments,and our algorithm outperforms those state-of-the-art algorithms ever reported by other interrelated literatures significantly.The experiment result of human tracking task also validates its advantage over conventional linear regression algorithm.

  1. Rank Awareness in Joint Sparse Recovery

    CERN Document Server

    Davies, Mike E

    2010-01-01

    In this paper we revisit the sparse multiple measurement vector (MMV) problem where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurements. This problem has received increasing interest as an extension of the single channel sparse recovery problem which lies at the heart of the emerging field of compressed sensing. However the sparse approximation problem has origins which include links to the field of array signal processing where we find the inspiration for a new family of MMV algorithms based on the MUSIC algorithm. We highlight the role of the rank of the coefficient matrix X in determining the difficulty of the recovery problem. We derive the necessary and sufficient conditions for the uniqueness of the sparse MMV solution, which indicates that the larger the rank of X the less sparse X needs to be to ensure uniqueness. We also show that the larger the rank of X the less the computational effort required to solve the MMV problem through a combinatorial search. In ...

  2. 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.

  3. Subspace Expanders and Matrix Rank Minimization

    CERN Document Server

    Khajehnejad, Amin; Hassibi, Babak

    2011-01-01

    Matrix rank minimization (RM) problems recently gained extensive attention due to numerous applications in machine learning, system identification and graphical models. In RM problem, one aims to find the matrix with the lowest rank that satisfies a set of linear constraints. The existing algorithms include nuclear norm minimization (NNM) and singular value thresholding. Thus far, most of the attention has been on i.i.d. Gaussian measurement operators. In this work, we introduce a new class of measurement operators, and a novel recovery algorithm, which is notably faster than NNM. The proposed operators are based on what we refer to as subspace expanders, which are inspired by the well known expander graphs based measurement matrices in compressed sensing. We show that given an $n\\times n$ PSD matrix of rank $r$, it can be uniquely recovered from a minimal sampling of $O(nr)$ measurements using the proposed structures, and the recovery algorithm can be cast as matrix inversion after a few initial processing s...

  4. The matrix method to calculate page rank

    Directory of Open Access Journals (Sweden)

    H. Barboucha, M. Nasri

    2014-06-01

    Full Text Available Choosing the right keywords is relatively easy, whereas getting a high PageRank is more complicated. The index Page Rank is what defines the position in the result pages of search engines (for Google of course, but the other engines are now using more or less the same kind of algorithm. It is therefore very important to understand how this type of algorithm functions to hope to appear on the first page of results (the only page read in 95 % of cases or at least be among the first. We propose in this paper to clarify the operation of this algorithm using a matrix method and a JavaScript program enabling to experience this type of analysis. It is of course a simplified version, but it can add value to the website and achieve a high ranking in the search results and reach a larger customer base. The interest is to disclose an algorithm to calculate the relevance of each page. This is in fact a mathematical algorithm based on a web graph. This graph is formed of all the web pages that are modeled by nodes, and hyperlinks that are modeled by arcs.

  5. Rank-dependant factorization of entanglement evolution

    Energy Technology Data Exchange (ETDEWEB)

    Siomau, Michael, E-mail: siomau@nld.ds.mpg.de [Physics Department, Jazan University, P.O. Box 114, 45142 Jazan (Saudi Arabia); Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany)

    2016-05-20

    Highlights: • In some cases the complex entanglement evolution can be factorized on simple terms. • We suggest factorization equations for multiqubit entanglement evolution. • The factorization is solely defined by the rank of the final state density matrices. • The factorization is independent on the local noisy channels and initial pure states. - Abstract: The description of the entanglement evolution of a complex quantum system can be significantly simplified due to the symmetries of the initial state and the quantum channels, which simultaneously affect parts of the system. Using concurrence as the entanglement measure, we study the entanglement evolution of few qubit systems, when each of the qubits is affected by a local unital channel independently on the others. We found that for low-rank density matrices of the final quantum state, such complex entanglement dynamics can be completely described by a combination of independent factors representing the evolution of entanglement of the initial state, when just one of the qubits is affected by a local channel. We suggest necessary conditions for the rank of the density matrices to represent the entanglement evolution through the factors. Our finding is supported with analytical examples and numerical simulations.

  6. Estimation of rank correlation for clustered data.

    Science.gov (United States)

    Rosner, Bernard; Glynn, Robert J

    2017-06-30

    It is well known that the sample correlation coefficient (Rxy ) is the maximum likelihood estimator of the Pearson correlation (ρxy ) for independent and identically distributed (i.i.d.) bivariate normal data. However, this is not true for ophthalmologic data where X (e.g., visual acuity) and Y (e.g., visual field) are available for each eye and there is positive intraclass correlation for both X and Y in fellow eyes. In this paper, we provide a regression-based approach for obtaining the maximum likelihood estimator of ρxy for clustered data, which can be implemented using standard mixed effects model software. This method is also extended to allow for estimation of partial correlation by controlling both X and Y for a vector U_ of other covariates. In addition, these methods can be extended to allow for estimation of rank correlation for clustered data by (i) converting ranks of both X and Y to the probit scale, (ii) estimating the Pearson correlation between probit scores for X and Y, and (iii) using the relationship between Pearson and rank correlation for bivariate normally distributed data. The validity of the methods in finite-sized samples is supported by simulation studies. Finally, two examples from ophthalmology and analgesic abuse are used to illustrate the methods. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

  7. Table of tables: A database design tool for SYBASE

    Energy Technology Data Exchange (ETDEWEB)

    Brown, B.C.; Coulter, K.; Glass, H.D.; Glosson, R.; Hanft, R.W.; Harding, D.J.; Trombly-Freytag, K.; Walbridge, D.G.C.; Wallis, D.B. (Fermi National Accelerator Lab., Batavia, IL (USA)); Allen, M.E. (Superconducting Super Collider Lab., Dallas, TX (USA))

    1991-01-04

    The Table of Tables' application system captures in a set of SYBASE tables the basic design specification for a database schema. Specification of tables, columns (including the related defaults and rules for the stored values) and keys is provided. The feature which makes this application specifically useful for SYBASE is the ability to automatically generate SYBASE triggers. A description field is provided for each database object. Based on the data stored, SQL scripts for creating complete schema including the tables, their defaults and rules, their indexes, and their SYBASE triggers, are written by TOT. Insert, update and delete triggers are generated from TOT to guarantee integrity of data relations when tables are connected by single column foreign keys. The application is written in SYBASE's APT-SQL and includes a forms based data entry system. Using the features of TOT we can create a complete database schema for which the data integrity specified by our design is guaranteed by the SYBASE triggers generated by TOT. 3 refs.

  8. Ranking welding intensity in pyroclastic deposits

    Science.gov (United States)

    Quane, S. L.; Russell, J. K.

    2003-04-01

    Pyroclastic deposits emplaced at high temperatures and having sufficient thickness become welded. The welding process involves sintering, compaction and flattening of hot glassy pyroclastic material and is attended by systematic changes in physical properties. Historically, the terms nonwelded, incipiently welded, partially welded with pumice, partially welded with fiamme, moderately welded and densely welded have been used as field descriptors for welding intensity (e.g., Smith &Bailey, 1966; Smith, 1979; Ross &Smith, 1980; Streck &Grunder, 1995). While using these descriptive words is often effective for delineating variations of welding intensity within a single deposit, their qualitative character does not provide for consistency between field areas or workers, and inhibits accurate comparison between deposits. Hence, there is a need for a universal classification of welding intensity in pyroclastic deposits. Here we develop an objective ranking system. The system recognizes 8 ranks (I to VIII) based on measurements of physical properties and petrographic characteristics. The physical property measurements include both lab and field observations: density, porosity, uniaxial compressive strength, point load strength, fiamme elongation, and foliation/fabric. The values are normalized in order to make the system universal. The rank divisions are adaptations of a rock mass-rating scheme based on rock strength (Hoek &Brown, 1980) and previous divisions of welding degree based on physical properties (e.g., density: Ragan &Sheridan, 1972, Streck &Grunder, 1995; fiamme elongation: Peterson, 1979). Each rank comprises a range of normalized values for each of the physical properties and a corresponding set of petrographic characteristics. Our new ranking system provides a consistent, objective means by which each sample or section of welded tuff can be evaluated, thus providing a much needed uniformity in nomenclature for degree of welding. References: Hoek, E. &Brown, E

  9. Asian top universities in six world university ranking systems

    Directory of Open Access Journals (Sweden)

    Mahmood Khosrowjerdi

    2013-12-01

    Full Text Available There are a variety of ranking systems for universities throughout the different continents of the world. The majority of the world ranking systems have paid special attention toward evaluation of universities and higher education institutions at the national and international level. This paper tries to study the similarities and status of top Asian universities in the list of top 200 universities by these world ranking systems. Findings show that there are some parallelisms among these international rankings. For example it was found some correlations between QS-Webometrics rankings (R= 0.78; QS-THE rankings (R= 0.53; and Shanghai-HEEACT rankings (R= 0.58. The highest correlation rate belongs to QS-Webometrics (R=0.78. The findings show no evidence to prove that the origin country of ranking system has any bias toward the rank of universities of its own country among other countries. For instance QS ranking of the United States classifies many universities of China and Japan as top Asian universities. HEEACT Ranking System of Taiwan includes just one university of Taiwan in the high ranking category (as other rankings do. Shanghai Ranking of China assigns a lower grade to universities of China and Hong Kong in comparison with QS ranking of the USA. Finally, some suggestions are made to improve the benefits of the ranking systems in order to promote the situation of higher education in the world, and recommendations for combining the indicators of these ranking systems to have a more comprehensive one for the world.

  10. Round Table on Chicano Literature

    Science.gov (United States)

    Bruce-Novoa, Juan

    1975-01-01

    Themes covered by this round table include the genres in Chicano literature, publication problems for Chicanos; the social role of the Chicano author; the Chicano-Mexican relationship, and the theater festival in Mexico City in 1974. (Author/AM)

  11. The redoubtable ecological periodic table

    Science.gov (United States)

    Ecological periodic tables are repositories of reliable information on quantitative, predictably recurring (periodic) habitat–community patterns and their uncertainty, scaling and transferability. Their reliability derives from their grounding in sound ecological principle...

  12. The Table Mountain Field Site

    Data.gov (United States)

    Federal Laboratory Consortium — The Table Mountain Field Site, located north of Boulder, Colorado, is designated as an area where the magnitude of strong, external signals is restricted (by State...

  13. The redoubtable ecological periodic table

    Science.gov (United States)

    Ecological periodic tables are repositories of reliable information on quantitative, predictably recurring (periodic) habitat–community patterns and their uncertainty, scaling and transferability. Their reliability derives from their grounding in sound ecological principle...

  14. Anthropometric Characteristics, Body Composition and Somatotype of 9-12 Years Old Table Tennis Players

    Directory of Open Access Journals (Sweden)

    Reza Behdari

    2016-04-01

    Full Text Available The aims of this study were to describe the anthropometric characteristics, body composition and somatotype of top-level male table tennis players, to compare the first 12 top-level table tennis players with the lower ranked players, and to establish profile chart for total of 112 top-level table tennis players. A total of 112 top-level table tennis players, aged between 9 and 12 years participated in this study. The athletes were divided into three groups, the first 12 (Group A, n=12 and the lower ranked players (Group B, n=47 and (Group C, n=53. In the analysis and comment of the data, One Way Variance Analysis (ANOVA Test were used. There were no significant differences in anthropometric characteristics, body composition and somatotype among the groups. A mesomorph – endomorph somatotype was registered for total of 112 top-level table tennis players. But analysis, taking into account, revealed a balanced ectomorph somatotype for the first 12 players, and a mesomorph - ectomorph somatotype for B group and a mesomorph - endomorph somatotype for C group. Although the influence of anthropometric characteristics on table tennis performance is not clear yet, it seems obvious that a mesomorph - ectomorph predominance can play a decisive role in any sport, On the other hand, high levels of body fat could have a negative effect on sport performance. Regarding to somatotype assessment, balanced ectomorph was the most important component in the first 12 players. In the present study, a greater body fat mass were observed lower ranked players than first 12 players

  15. Theoretical analysis on convergence behavior of rank filters

    Institute of Scientific and Technical Information of China (English)

    YE; Wanzhou

    2004-01-01

    This paper systematically studies the convergence behavior of rank filters. The problem of convergence behavior of rank filters has been solved completely for bounded sequences. Moreover, some properties of its limiting sequences and recurrent sequences are obtained.

  16. 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...

  17. Ranking U-Sapiens 2010-2

    Directory of Open Access Journals (Sweden)

    Carlos-Roberto Peña-Barrera

    2011-08-01

    Full Text Available Los principales objetivos de esta investigación son los siguientes: (1 que la comunidad científica nacional e internacional y la sociedad en general co-nozcan los resultados del Ranking U-Sapiens Colombia 2010_2, el cual clasifica a cada institución de educación superior colombiana según puntaje, posición y cuartil; (2 destacar los movimientos más importantes al comparar los resultados del ranking 2010_1 con los del 2010_2; (3 publicar las respuestas de algunos actores de la academia nacional con respecto a la dinámica de la investigación en el país; (4 reconocer algunas instituciones, medios de comunicación e investigadores que se han interesado a modo de reflexión, referenciación o citación por esta investigación; y (5 dar a conocer el «Sello Ranking U-Sapiens Colombia» para las IES clasificadas. El alcance de este estudio en cuanto a actores abordó todas y cada una de las IES nacionales (aunque solo algunas lograran entrar al ranking y en cuanto a tiempo, un periodo referido al primer semestre de 2010 con respecto a: (1 los resultados 2010-1 de revistas indexadas en Publindex, (2 los programas de maestrías y doctorados activos durante 2010-1 según el Ministerio de Educación Nacional, y (3 los resultados de grupos de investigación clasificados para 2010 según Colciencias. El método empleado para esta investigación es el mismo que para el ranking 2010_1, salvo por una especificación aún más detallada en uno de los pasos del modelo (las variables α, β, γ; es completamente cuantitativo y los datos de las variables que fundamentan sus resultados provienen de Colciencias y el Ministerio de Educación Nacional; y en esta ocasión se darán a conocer los resultados por variable para 2010_1 y 2010_2. Los resultados más relevantes son estos: (1 entraron 8 IES al ranking y salieron 3; (2 las 3 primeras IES son públicas; (3 en total hay 6 instituciones universitarias en el ranking; (4 7 de las 10 primeras IES son

  18. Sum of ranking differences to rank stationary phases used in packed column supercritical fluid chromatography.

    Science.gov (United States)

    West, Caroline; Khalikova, Maria A; Lesellier, Eric; Héberger, Károly

    2015-08-28

    The identification of a suitable stationary phase in supercritical fluid chromatography (SFC) is a major source of difficulty for those with little experience in this technique. Several protocols have been suggested for column classification in high-performance liquid chromatography (HPLC), gas chromatography (GC), and SFC. However, none of the proposed classification schemes received general acceptance. A fair way to compare columns was proposed with the sum of ranking differences (SRD). In this project, we used the retention data obtained for 86 test compounds with varied polarity and structure, analyzed on 71 different stationary phases encompassing the full range in polarity of commercial packed columns currently available to the SFC chromatographer, with a single set of mobile phase and operating conditions (carbon dioxide-methanol mobile phase, 25°C, 150bar outlet pressure, 3ml/min). First, a reference column was selected and the 70 remaining columns were ranked based on this reference column and the retention data obtained on the 86 analytes. As these analytes previously served for the calculation of linear solvation energy relationships (LSER) on the 71 columns, SRD ranks were compared to LSER methodology. Finally, an external comparison based on the analysis of 10 other analytes (UV filters) related the observed selectivity to SRD ranking. Comparison of elution orders of the UV filters to the SRD rankings is highly supportive of the adequacy of SRD methodology to select similar and dissimilar columns.

  19. A Comparison of Educational "Value-Added" Methodologies for Classifying Teacher Effectiveness: Value Tables vs. Covariate Regression

    Science.gov (United States)

    Dwyer, Theodore J.

    2016-01-01

    There is a great deal of concern regarding teacher impacts on student achievement being used as a substantial portion of a teacher's performance evaluation. This study investigated the degree of concordance and discordance between mathematics teacher ranking using value tables and covariate regression, which have both been used as measures for…

  20. A study of serial ranks via random graphs

    OpenAIRE

    Haeusler, Erich; Mason, David M.; Turova, Tatyana S.

    2000-01-01

    Serial ranks have long been used as the basis for nonparametric tests of independence in time series analysis. We shall study the underlying graph structure of serial ranks. This will lead us to a basic martingale which will allow us to construct a weighted approximation to a serial rank process. To show the applicability of this approximation, we will use it to prove two very general central limit theorems for Wald-Wolfowitz-type serial rank statistics.

  1. Comments on the rank product method for analyzing replicated experiments.

    Science.gov (United States)

    Koziol, James A

    2010-03-05

    Breitling et al. introduced a statistical technique, the rank product method, for detecting differentially regulated genes in replicated microarray experiments. The technique has achieved widespread acceptance and is now used more broadly, in such diverse fields as RNAi analysis, proteomics, and machine learning. In this note, we relate the rank product method to linear rank statistics and provide an alternative derivation of distribution theory attending the rank product method.

  2. Ranking of States and Commodities by Cash Receipts, 1992

    OpenAIRE

    Strickland, Roger P.; Steele, Cheryl J.; Williams, Robert P.

    1993-01-01

    This publication presents two types of ranking information derived from the U.S. Department of Agriculture's cash receipts statistics for the marketing of agricultural commodities within States. One type is the 25 leading commodities for each State and the Nation, ranked according to the estimated value of receipts. The second is the ranking of States by receipts from each of the 25 leading U.S. commodities and by several major commodity groups. The ranking of commodities produced in a State ...

  3. Irreducible Killing Tensors from Third Rank Killing-Yano Tensors

    OpenAIRE

    Popa, Florian Catalin; Tintareanu-Mircea, Ovidiu

    2006-01-01

    We investigate higher rank Killing-Yano tensors showing that third rank Killing-Yano tensors are not always trivial objects being possible to construct irreducible Killing tensors from them. We give as an example the Kimura IIC metric were from two rank Killing-Yano tensors we obtain a reducible Killing tensor and from third rank Killing-Yano tensors we obtain three Killing tensors, one reducible and two irreducible.

  4. The ranks of Maiorana-McFarland bent functions

    Institute of Scientific and Technical Information of China (English)

    WENG GuoBiao; FENG RongQuan; QIU WeiSheng; ZHENG ZhiMing

    2008-01-01

    In this paper,the ranks of a special family of Maiorana-McFarland bent functions are discussed.The upper and lower bounds of the ranks are given and those bent functions whose ranks achieve these bounds are determined.As a consequence,the inequivalence of some bent functions are derived.Furthermore,the ranks of the functions of this family are calculated when t≤6.

  5. Tutorial: Calculating Percentile Rank and Percentile Norms Using SPSS

    Science.gov (United States)

    Baumgartner, Ted A.

    2009-01-01

    Practitioners can benefit from using norms, but they often have to develop their own percentile rank and percentile norms. This article is a tutorial on how to quickly and easily calculate percentile rank and percentile norms using SPSS, and this information is presented for a data set. Some issues in calculating percentile rank and percentile…

  6. Synthesis of Partial Rankings of Points of Interest Using Crowdsourcing

    DEFF Research Database (Denmark)

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

    2015-01-01

    to the query keywords and the query location. A key challenge in being able to make progress on the design of ranking functions is to be able to assess the quality of the results returned by ranking functions. We propose a model that synthesizes a ranking of points of interest from answers to crowdsourced...

  7. Variation in rank abundance replicate samples and impact of clustering

    NARCIS (Netherlands)

    Neuteboom, J.H.; Struik, P.C.

    2005-01-01

    Calculating a single-sample rank abundance curve by using the negative-binomial distribution provides a way to investigate the variability within rank abundance replicate samples and yields a measure of the degree of heterogeneity of the sampled community. The calculation of the single-sample rank a

  8. Tutorial: Calculating Percentile Rank and Percentile Norms Using SPSS

    Science.gov (United States)

    Baumgartner, Ted A.

    2009-01-01

    Practitioners can benefit from using norms, but they often have to develop their own percentile rank and percentile norms. This article is a tutorial on how to quickly and easily calculate percentile rank and percentile norms using SPSS, and this information is presented for a data set. Some issues in calculating percentile rank and percentile…

  9. Paired comparisons analysis: an axiomatic approach to ranking methods

    NARCIS (Netherlands)

    Gonzalez-Diaz, J.; Hendrickx, Ruud; Lohmann, E.R.M.A.

    2014-01-01

    In this paper we present an axiomatic analysis of several ranking methods for general tournaments. We find that the ranking method obtained by applying maximum likelihood to the (Zermelo-)Bradley-Terry model, the most common method in statistics and psychology, is one of the ranking methods that per

  10. Amalgams of Rank 2 and Characteristic 3 Involving M11

    Institute of Scientific and Technical Information of China (English)

    黄建华; 李慧陵

    1994-01-01

    In this paper we investigate the amalgams (M11,X) of rank 2 and characteristic 3,where X is a group of Lie type of rank 1 or permutation group of low rank,and give a characterization of the 3 local subgroups of the finite sporadic groups Co3 of Ly and Suz.

  11. 10 CFR 455.131 - State ranking of grant applications.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 3 2010-01-01 2010-01-01 false State ranking of grant applications. 455.131 Section 455... State ranking of grant applications. (a) Except as provided by § 455.92 of this part, all eligible... audit or energy use evaluation pursuant to § 455.20(k). Each State shall develop separate rankings...

  12. 25 CFR 1001.3 - Priority ranking for negotiations.

    Science.gov (United States)

    2010-04-01

    ... 25 Indians 2 2010-04-01 2010-04-01 false Priority ranking for negotiations. 1001.3 Section 1001.3... PROGRAM § 1001.3 Priority ranking for negotiations. In addition to the eligibility criteria identified above, a tribe or consortium of tribes seeking priority ranking for negotiations must submit...

  13. Academic Ranking--From Its Genesis to Its International Expansion

    Science.gov (United States)

    Vieira, Rosilene C.; Lima, Manolita C.

    2015-01-01

    Given the visibility and popularity of rankings that encompass the measurement of quality of post-graduate courses, for instance, the MBA (Master of Business Administration) or graduate studies program (MSc and PhD) as do global academic rankings--Academic Ranking of World Universities-ARWU, Times Higher/Thomson Reuters World University Ranking…

  14. Ranking Quality in Higher Education: Guiding or Misleading?

    Science.gov (United States)

    Bergseth, Brita; Petocz, Peter; Abrandt Dahlgren, Madeleine

    2014-01-01

    The study examines two different models of measuring, assessing and ranking quality in higher education. Do different systems of quality assessment lead to equivalent conclusions about the quality of education? This comparative study is based on the rankings of 24 Swedish higher education institutions. Two ranking actors have independently…

  15. THE RANK AND COEXPONENT OF A FINITE P-GROUP

    Institute of Scientific and Technical Information of China (English)

    Yujie MA

    2006-01-01

    In this paper, we present a sharp bound for the rank of a finite p-group in terms of its coexponent. As to finite p-groups with p odd, we also give a sufficient condition for which the normal rank is equal to its rank.

  16. Control by Numbers: New Managerialism and Ranking in Higher Education

    Science.gov (United States)

    Lynch, Kathleen

    2015-01-01

    This paper analyses the role of rankings as an instrument of new managerialism. It shows how rankings are reconstituting the purpose of universities, the role of academics and the definition of what it is to be a student. The paper opens by examining the forces that have facilitated the emergence of the ranking industry and the ideologies…

  17. Ranking Scholarly Publishers in Political Science: An Alternative Approach

    Science.gov (United States)

    Garand, James C.; Giles, Micheal W.

    2011-01-01

    Previous research has documented how political scientists evaluate and rank scholarly journals, but the evaluation and ranking of scholarly book publishers has drawn less attention. In this article, we use data from a survey of 603 American political scientists to generate a ranking of scholarly publishers in political science. We used open-ended…

  18. An Improved Technique for Ranking Semantic Associations

    Directory of Open Access Journals (Sweden)

    S Narayana

    2013-10-01

    Full Text Available The primary focus of the search techniques in the first generation of the Web is accessing relevant documents from the Web. Though it satisfies user requirements, but it is insufficient as the user sometimes wishes to access actionable information involving complex relationships between two given entities. Finding such complex relationships (also known as semantic associations is especially useful in applications such as National Security, Pharmacy, Business Intelligence etc. Therefore the next frontier is discovering relevant semantic associations between two entities present in large semantic metadata repositories. Given two entities, there exist a huge number of semantic associations between two entities. Hence ranking of these associations is required in order to find more relevant associations. For this Aleman Meza et al. proposed a method involving six metrics viz. context, subsumption, rarity, popularity, association length and trust. To compute the overall rank of the associations this method computes context, subsumption, rarity and popularity values for each component of the association and for all the associations. However it is obvious that, many components appears repeatedly in many associations therefore it is not necessary to compute context, subsumption, rarity, popularity, and trust values of the components every time for each association rather the previously computed values may be used while computing the overall rank of the associations. This paper proposes a method to reuse the previously computed values using a hash data structure thus reduce the execution time. To demonstrate the effectiveness of the proposed method, experiments were conducted on SWETO ontology. Results show that the proposed method is more efficient than the other existing methods.

  19. Robust Generalized Low Rank Approximations of Matrices.

    Directory of Open Access Journals (Sweden)

    Jiarong Shi

    Full Text Available In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM. We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods.

  20. Robust Generalized Low Rank Approximations of Matrices.

    Science.gov (United States)

    Shi, Jiarong; Yang, Wei; Zheng, Xiuyun

    2015-01-01

    In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM) claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM). We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM) to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods.

  1. Prioritization and Ranking Problems Exporting Iranian Saffron

    Directory of Open Access Journals (Sweden)

    Reza Askandari

    2013-10-01

    Full Text Available The main objective of this study is to prioritize and rank problems exporting Iranian saffron. Based on a comprehensive review of the literature on issues related to data and information collected from questionnaires, with 816% reliability is used. In this study, the sample of managers and sales and marketing company is exporting Iranian saffron is the sample size of 231 subjects. The results of this study are positive and significant relationship between the dependent variable and the independent variables of export performance of export barriers exist.

  2. Tecer sobe no ranking da Capes

    Directory of Open Access Journals (Sweden)

    José Aparecido

    2013-11-01

    Full Text Available Surpresa ainda maior foi verificar que prosseguimos no rumo da consolidação, crescendo no ranking – chegando a B3 em alguns campos, como pode ser visto no portal de buscas do Qualis Capes http://qualis.capes.gov.br/webqualis/principal.seamhttp://qualis.capes.gov, que apresenta nossa classificação abaixo:   B3 ADMINISTRAÇÃO, CIÊNCIAS CONTÁBEIS E TURISMO B4 CIÊNCIAS SOCIAIS APLICADAS I B4 EDUCAÇÃO B4 INTERDISCIPLINAR B5 DIREITO B5 HISTÓRIA C CIÊNCIA DA COMPUTAÇÃO

  3. Simple approach for ranking structure determining residues.

    Science.gov (United States)

    Luna-Martínez, Oscar D; Vidal-Limón, Abraham; Villalba-Velázquez, Miryam I; Sánchez-Alcalá, Rosalba; Garduño-Juárez, Ramón; Uversky, Vladimir N; Becerril, Baltazar

    2016-01-01

    Mutating residues has been a common task in order to study structural properties of the protein of interest. Here, we propose and validate a simple method that allows the identification of structural determinants; i.e., residues essential for preservation of the stability of global structure, regardless of the protein topology. This method evaluates all of the residues in a 3D structure of a given globular protein by ranking them according to their connectivity and movement restrictions without topology constraints. Our results matched up with sequence-based predictors that look up for intrinsically disordered segments, suggesting that protein disorder can also be described with the proposed methodology.

  4. Dissipative homoclinic loops and rank one chaos

    OpenAIRE

    Wang, Qiudong; Ott, William

    2008-01-01

    We prove that when subjected to periodic forcing of the form $p_{\\mu, \\rh, \\om} (t) = \\mu (\\rh h(x,y) + \\sin (\\om t))$, certain second order systems of differential equations with dissipative homoclinic loops admit strange attractors with SRB measures for a set of forcing parameters $(\\mu, \\rh, \\om)$ of positive measure. Our proof applies the recent theory of rank one maps, developed by Wang and Young based on the analysis of strongly dissipative H\\'enon maps by Benedicks and Carleson.

  5. Compressive Sensing via Nonlocal Smoothed Rank Function.

    Science.gov (United States)

    Fan, Ya-Ru; Huang, Ting-Zhu; Liu, Jun; Zhao, Xi-Le

    2016-01-01

    Compressive sensing (CS) theory asserts that we can reconstruct signals and images with only a small number of samples or measurements. Recent works exploiting the nonlocal similarity have led to better results in various CS studies. To better exploit the nonlocal similarity, in this paper, we propose a non-convex smoothed rank function based model for CS image reconstruction. We also propose an efficient alternating minimization method to solve the proposed model, which reduces a difficult and coupled problem to two tractable subproblems. Experimental results have shown that the proposed method performs better than several existing state-of-the-art CS methods for image reconstruction.

  6. Tecer sobe no ranking da Capes

    OpenAIRE

    José Aparecido

    2013-01-01

    Surpresa ainda maior foi verificar que prosseguimos no rumo da consolidação, crescendo no ranking – chegando a B3 em alguns campos, como pode ser visto no portal de buscas do Qualis Capes http://qualis.capes.gov.br/webqualis/principal.seamhttp://qualis.capes.gov, que apresenta nossa classificação abaixo:   B3 ADMINISTRAÇÃO, CIÊNCIAS CONTÁBEIS E TURISMO B4 CIÊNCIAS SOCIAIS APLICADAS I B4 EDUCAÇÃO B4 INTERDISC...

  7. Simple approach for ranking structure determining residues

    Directory of Open Access Journals (Sweden)

    Oscar D. Luna-Martínez

    2016-06-01

    Full Text Available Mutating residues has been a common task in order to study structural properties of the protein of interest. Here, we propose and validate a simple method that allows the identification of structural determinants; i.e., residues essential for preservation of the stability of global structure, regardless of the protein topology. This method evaluates all of the residues in a 3D structure of a given globular protein by ranking them according to their connectivity and movement restrictions without topology constraints. Our results matched up with sequence-based predictors that look up for intrinsically disordered segments, suggesting that protein disorder can also be described with the proposed methodology.

  8. Spiders for rank 2 Lie algebras

    CERN Document Server

    Kuperberg, G

    1996-01-01

    A spider is an axiomatization of the representation theory of a group, quantum group, Lie algebra, or other group or group-like object. We define certain combinatorial spiders by generators and relations that are isomorphic to the representation theories of the three rank two simple Lie algebras, namely A2, B2, and G2. They generalize the widely-used Temperley-Lieb spider for A1. Among other things, they yield bases for invariant spaces which are probably related to Lusztig's canonical bases, and they are useful for computing quantities such as generalized 6j-symbols and quantum link invariants.

  9. Do PageRank-based author rankings outperform simple citation counts?

    CERN Document Server

    Fiala, Dalibor; Žitnik, Slavko; Bajec, Marko

    2015-01-01

    The basic indicators of a researcher's productivity and impact are still the number of publications and their citation counts. These metrics are clear, straightforward, and easy to obtain. When a ranking of scholars is needed, for instance in grant, award, or promotion procedures, their use is the fastest and cheapest way of prioritizing some scientists over others. However, due to their nature, there is a danger of oversimplifying scientific achievements. Therefore, many other indicators have been proposed including the usage of the PageRank algorithm known for the ranking of webpages and its modifications suited to citation networks. Nevertheless, this recursive method is computationally expensive and even if it has the advantage of favouring prestige over popularity, its application should be well justified, particularly when compared to the standard citation counts. In this study, we analyze three large datasets of computer science papers in the categories of artificial intelligence, software engineering,...

  10. 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.

  11. Stable Rank One and Real Rank Zero for Crossed Products by Finite Group Actions with the Tracial Rokhlin Property

    Institute of Scientific and Technical Information of China (English)

    Qingzhai FAN; Xiaochun FANG

    2009-01-01

    The authors prove that the crossed product of an infinite dimensional simple separable unital C*-algebra with stable rank one by an action of a finite group with the tracial Rokhlin property has again stable rank one.It iS also proved that the crossedproduct of an infinite dimensional simple separable unital C*-algebra with real rank zero by an action of a finite group with the tracial Rokhlin property has again real rank zero.

  12. RANKING THE SPECTATORS’ DIFFICULTIES IN PURCHASING ELECTRONIC TICKETS OF FOOTBALL PREMIER LEAGUE

    Directory of Open Access Journals (Sweden)

    Ahmad Narimani

    2017-04-01

    Full Text Available This study aimed to rank the spectators’ difficulties in buying electronic tickets of football premier league matches at Azadi stadium. The population consisted of all spectators of Esteghlal-Persepolis match in the fifteenth league at Azadi stadium (N= 100000. According to Morgan table and using simple random sampling method, 500 participants were selected as sample. A researcher-made questionnaire was used for collecting the data; its face validity was confirmed by 15 experts and performing a pilot study on 30 subjects, its Cronbach’s alpha was calculated to be 0.86. Using SPSS 22, the descriptive and inferential (including Friedman test statistics was applied for analyzing the data. The findings showed that there was a significant difference between rankings of difficulties in buying electronic tickets of Football premier league matches at Azadi Stadium. The difficulties were ranked as: problem in ticket systems, early selling out of electronic tickets, lack of confidence to electronic ticket sale, lack of skill to work with the internet, low speed of internet, and lack of access to the internet

  13. Local Rank Inference for Varying Coefficient Models.

    Science.gov (United States)

    Wang, Lan; Kai, Bo; Li, Runze

    2009-12-01

    By allowing the regression coefficients to change with certain covariates, the class of varying coefficient models offers a flexible approach to modeling nonlinearity and interactions between covariates. This paper proposes a novel estimation procedure for the varying coefficient models based on local ranks. The new procedure provides a highly efficient and robust alternative to the local linear least squares method, and can be conveniently implemented using existing R software package. Theoretical analysis and numerical simulations both reveal that the gain of the local rank estimator over the local linear least squares estimator, measured by the asymptotic mean squared error or the asymptotic mean integrated squared error, can be substantial. In the normal error case, the asymptotic relative efficiency for estimating both the coefficient functions and the derivative of the coefficient functions is above 96%; even in the worst case scenarios, the asymptotic relative efficiency has a lower bound 88.96% for estimating the coefficient functions, and a lower bound 89.91% for estimating their derivatives. The new estimator may achieve the nonparametric convergence rate even when the local linear least squares method fails due to infinite random error variance. We establish the large sample theory of the proposed procedure by utilizing results from generalized U-statistics, whose kernel function may depend on the sample size. We also extend a resampling approach, which perturbs the objective function repeatedly, to the generalized U-statistics setting; and demonstrate that it can accurately estimate the asymptotic covariance matrix.

  14. Rank hypocrisies the insult of the REF

    CERN Document Server

    Sayer, Derek

    2015-01-01

    "The REF is right out of Havel's and Kundera's Eastern Europe: a state-administered exercise to rank academic research like hotel chains dependent on the active collaboration of the UK professoriate. In crystalline text steeped in cold rage, Sayer takes aim at the REF's central claim, that it is a legitimate process of expert peer review. He critiques university and national-level REF processes against actual practices of scholarly review as found in academic journals, university presses, and North American tenure procedures. His analysis is damning. If the REF fails as scholarly review, how can academics and universities continue to participate? And how can government use its rankings as a basis for public policy?" - Tarak Barkawi, Reader in the Department of International Relations, London School of Economics "Many academics across the world have come to see the REF as an arrogant attempt to raise national research standards that has resulted in a variety of self-inflicted wounds to UK higher education. Der...

  15. Rational and real positive semidefinite rank can be different

    OpenAIRE

    Gouveia, João; Fawzi, Hamza; Robinson, Richard Z.

    2014-01-01

    Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank, where the matrix factors are required to be rational symmetric psd matrices. It is clear that the rational-restricted psd rank is always an upper bound to the usual psd rank. We show that this inequality may be strict by exhibiting a matrix with psd rank fo...

  16. 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.

  17. Fitting Ranked Linguistic Data with Two-Parameter Functions

    Directory of Open Access Journals (Sweden)

    Wentian Li

    2010-07-01

    Full Text Available It is well known that many ranked linguistic data can fit well with one-parameter models such as Zipf’s law for ranked word frequencies. However, in cases where discrepancies from the one-parameter model occur (these will come at the two extremes of the rank, it is natural to use one more parameter in the fitting model. In this paper, we compare several two-parameter models, including Beta function, Yule function, Weibull function—all can be framed as a multiple regression in the logarithmic scale—in their fitting performance of several ranked linguistic data, such as letter frequencies, word-spacings, and word frequencies. We observed that Beta function fits the ranked letter frequency the best, Yule function fits the ranked word-spacing distribution the best, and Altmann, Beta, Yule functions all slightly outperform the Zipf’s power-law function in word ranked- frequency distribution.

  18. Ranking de universidades chilenas: un análisis multivariado

    Directory of Open Access Journals (Sweden)

    Firinguetti Limone, Luis

    2015-06-01

    Full Text Available In this work a ranking of Chilean universities on the basis of publicly available information is developed. This ranking takes into account the multivariate character of these institutions. Also, it is noted that the results are consistent with those of a well-known international ranking that uses a different set of data, as well as with several multivariate analyses of the data considered in this study.En este trabajo se elabora un ranking de las universidades chilenas en base a información pública disponible. Dicho ranking toma en cuenta el carácter multivariado de estas instituciones. Además, se ha comprobado que los resultados del ranking son consistentes con un conocido ranking internacional construido a partir de un conjunto diferente de datos y con varios análisis multivariados realizados de la información tratada en este estudio.

  19. EU Country Rankings' Sensitivity to the Choice of Welfare Indicators

    DEFF Research Database (Denmark)

    Hussain, M. Azhar

    2016-01-01

    are particularly volatile for countries in the middle of the ranking distribution, while countries with either high or low welfare generally have lower volatility. A multidimensional poverty index has the highest correlation with the latent welfare measure. It is concluded that the observed rankings do not tell......Ranking of countries with respect to some welfare measure is highly popular and takes places with high frequency. Ranking of a country can change over time given the same welfare measure is applied. Rankings can also change depending on which welfare measure is applied in a given year. To what...... extent do we see ranking changes and which existing welfare measures best captures an unobserved, yet existing, notion of welfare in society? To investigate this we apply seven welfare indicators for fifteen EU countries covering the years from 2005 until 2011. The results indicate that rankings...

  20. Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States

    CERN Document Server

    Chen, Lin; Duan, Runyao; Ji, Zhengfeng; Winter, Andreas

    2010-01-01

    The tensor rank (aka generalized Schmidt rank) of multipartite pure states plays an important role in the study of entanglement classifications and transformations. We employ powerful tools from the theory of homogeneous polynomials to investigate the tensor rank of symmetric states such as the tripartite state $\\ket{W_3}=\\tfrac{1}{\\sqrt{3}}(\\ket{100}+\\ket{010}+\\ket{001})$ and its $N$-partite generalization $\\ket{W_N}$. Previous tensor rank estimates are dramatically improved and we show that (i) three copies of $\\ket{W_3}$ has rank either 15 or 16, (ii) two copies of $\\ket{W_N}$ has rank $3N-2$, and (iii) $n$ copies of $\\ket{W_N}$ has rank O(N). A remarkable consequence of these results is that certain multipartite transformations, impossible even probabilistically, can become possible when performed in multiple copy bunches or when assisted by some catalyzing state. This novel effect is impossible for bipartite pure states.

  1. Linear Tabling Strategies and Optimizations

    CERN Document Server

    Zhou, Neng-Fa; Shen, Yi-Dong

    2007-01-01

    Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the strategies used in handling looping subgoals. One decision concerns when answers are consumed and returned. This paper describes two strategies, namely, {\\it lazy} and {\\it eager} strategies, and compares them both qualitatively and quantitatively. The results indicate that, while the lazy strategy has good locality and is well suited for finding all solutions, the eager strategy is comparable in speed with the lazy strategy and is well suited for programs with cuts. Linear tabling relies on depth-first iterative deepening rather than suspension to compute fixpoints. Each cluster of inter-dependent subgoals as represented by a top-most looping subgoal is iteratively evaluated until no subgoal in it can produce any new answers. Naive re-evaluation of all loopi...

  2. The Alfonsine tables of Toledo

    CERN Document Server

    Chabás, José

    2003-01-01

    The Alfonsine Tables of Toledo is for historians working in the fields of astronomy, science, the Middle Ages, Spanish and other Romance languages. It is also of interest to scholars interested in the history of Castile, in Castilian-French relations in the Middle Ages and in the history of patronage. It explores the Castilian canons of the Alfonsine Tables and offers a study of their context, language, astronomical content, and diffusion. The Alfonsine Tables of Toledo is unique in that it: includes an edition of a crucial text in history of science; provides an explanation of astronomy as it was practiced in the Middle Ages; presents abundant material on early scientific language in Castilian; presents new material on the diffusion of Alfonsine astronomy in Europe; describes the role of royal patronage of science in a medieval context.

  3. Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements

    Science.gov (United States)

    Li, Yuanxin; Sun, Yue; Chi, Yuejie

    2017-01-01

    We study the problem of estimating a low-rank positive semidefinite (PSD) matrix from a set of rank-one measurements using sensing vectors composed of i.i.d. standard Gaussian entries, which are possibly corrupted by arbitrary outliers. This problem arises from applications such as phase retrieval, covariance sketching, quantum space tomography, and power spectrum estimation. We first propose a convex optimization algorithm that seeks the PSD matrix with the minimum $\\ell_1$-norm of the observation residual. The advantage of our algorithm is that it is free of parameters, therefore eliminating the need for tuning parameters and allowing easy implementations. We establish that with high probability, a low-rank PSD matrix can be exactly recovered as soon as the number of measurements is large enough, even when a fraction of the measurements are corrupted by outliers with arbitrary magnitudes. Moreover, the recovery is also stable against bounded noise. With the additional information of an upper bound of the rank of the PSD matrix, we propose another non-convex algorithm based on subgradient descent that demonstrates excellent empirical performance in terms of computational efficiency and accuracy.

  4. Rankings & Estimates: Rankings of the States 2015 and Estimates of School Statistics 2016

    Science.gov (United States)

    National Education Association, 2016

    2016-01-01

    The data presented in this combined report--"Rankings & Estimates"--provide facts about the extent to which local, state, and national governments commit resources to public education. As one might expect in a nation as diverse as the United States--with respect to economics, geography, and politics--the level of commitment to…

  5. General purpose steam table library :

    Energy Technology Data Exchange (ETDEWEB)

    Carpenter, John H.; Belcourt, Kenneth Noel; Nourgaliev, Robert

    2013-08-01

    Completion of the CASL L3 milestone THM.CFD.P7.04 provides a general purpose tabular interpolation library for material properties to support, in particular, standardized models for steam properties. The software consists of three parts, implementations of analytic steam models, a code to generate tables from those models, and an interpolation package to interface the tables to CFD codes such as Hydra-TH. Verification of the standard model is maintained through the entire train of routines. The performance of interpolation package exceeds that of freely available analytic implementation of the steam properties by over an order of magnitude.

  6. Classifying and ranking DMUs in interval DEA

    Institute of Scientific and Technical Information of China (English)

    GUO Jun-peng; WU Yu-hua; LI Wen-hua

    2005-01-01

    During efficiency evaluating by DEA, the inputs and outputs of DMUs may be intervals because of insufficient information or measure error. For this reason, interval DEA is proposed. To make the efficiency scores more discriminative, this paper builds an Interval Modified DEA (IMDEA) model based on MDEA.Furthermore, models of obtaining upper and lower bounds of the efficiency scores for each DMU are set up.Based on this, the DMUs are classified into three types. Next, a new order relation between intervals which can express the DM' s preference to the three types is proposed. As a result, a full and more eonvietive ranking is made on all the DMUs. Finally an example is given.

  7. PSPACE Bounds for Rank-1 Modal Logics

    CERN Document Server

    Schröder, Lutz

    2007-01-01

    For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank-1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACE-bounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant proof-theoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way.

  8. Ultrasonic ranking of toughness of tungsten carbide

    Science.gov (United States)

    Vary, A.; Hull, D. R.

    1983-01-01

    The feasibility of using ultrasonic attenuation measurements to rank tungsten carbide alloys according to their fracture toughness was demonstrated. Six samples of cobalt-cemented tungsten carbide (WC-Co) were examined. These varied in cobalt content from approximately 2 to 16 weight percent. The toughness generally increased with increasing cobalt content. Toughness was first determined by the Palmqvist and short rod fracture toughness tests. Subsequently, ultrasonic attenuation measurements were correlated with both these mechanical test methods. It is shown that there is a strong increase in ultrasonic attenuation corresponding to increased toughness of the WC-Co alloys. A correlation between attenuation and toughness exists for a wide range of ultrasonic frequencies. However, the best correlation for the WC-Co alloys occurs when the attenuation coefficient measured in the vicinity of 100 megahertz is compared with toughness as determined by the Palmqvist technique.

  9. Query Specific Rank Fusion for Image Retrieval.

    Science.gov (United States)

    Zhang, Shaoting; Yang, Ming; Cour, Timothee; Yu, Kai; Metaxas, Dimitris N

    2015-04-01

    Recently two lines of image retrieval algorithms demonstrate excellent scalability: 1) local features indexed by a vocabulary tree, and 2) holistic features indexed by compact hashing codes. Although both of them are able to search visually similar images effectively, their retrieval precision may vary dramatically among queries. Therefore, combining these two types of methods is expected to further enhance the retrieval precision. However, the feature characteristics and the algorithmic procedures of these methods are dramatically different, which is very challenging for the feature-level fusion. This motivates us to investigate how to fuse the ordered retrieval sets, i.e., the ranks of images, given by multiple retrieval methods, to boost the retrieval precision without sacrificing their scalability. In this paper, we model retrieval ranks as graphs of candidate images and propose a graph-based query specific fusion approach, where multiple graphs are merged and reranked by conducting a link analysis on a fused graph. The retrieval quality of an individual method is measured on-the-fly by assessing the consistency of the top candidates' nearest neighborhoods. Hence, it is capable of adaptively integrating the strengths of the retrieval methods using local or holistic features for different query images. This proposed method does not need any supervision, has few parameters, and is easy to implement. Extensive and thorough experiments have been conducted on four public datasets, i.e., the UKbench, Corel-5K, Holidays and the large-scale San Francisco Landmarks datasets. Our proposed method has achieved very competitive performance, including state-of-the-art results on several data sets, e.g., the N-S score 3.83 for UKbench.

  10. Safety studies on Korean fusion DEMO plant using Integrated Safety Assessment Methodology: Part 2

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Kyemin; Kang, Myoung-suk [Kyung Hee University, Yongin-si, Gyeonggi-do 446-701 (Korea, Republic of); Heo, Gyunyoung, E-mail: gheo@khu.ac.kr [Kyung Hee University, Yongin-si, Gyeonggi-do 446-701 (Korea, Republic of); Kim, Hyoung-chan [National Fusion Research Institute, Daejeon-si 305-333 (Korea, Republic of)

    2015-10-15

    Highlights: • The purpose of this paper is to suggest methodology that can investigate safety issues and provides a case study for Korean fusion DEMO plant. • The concepts of Integrated Safety Assessment Methodology (ISAM) that can be applied in addressing regulatory requirements and recognizing safety issues for K-DEMO were emphasized. • Phenomena Identification Ranking Table (PIRT) and Objective Provision Tree (OPT) were performed and updated. • This work is expected to contribute on the conceptual design of safety features for K-DEMO to design engineers and the guidance for regulatory requirements to licensers. - Abstract: The purpose of this paper is to investigate safety issues using Integrated Safety Assessment Methodology (ISAM) proposed by Generation IV Forum Risk and Safety Working Group (RSWG) for Korean fusion DEMO plant (K-DEMO). In ongoing nuclear energy research such as Generation IV fission power plant (GEN-IV), new methodology based on Technology-Neutral Framework (TNF) has been applied for safety assessment. In this methodology, design and regulatory requirements for safety of nuclear power plants are considered simultaneously. The design based on regulatory requirements can save resource, time, and manpower while maintaining high level safety. ISAM is one of the options to apply TNF in K-DEMO. We have performed safety studies for K-DEMO using Phenomena Identification and Ranking Table (PIRT) and Objective Provision Tree (OPT) which are constitutive part of ISAM. Considering the design phase of K-DEMO, the current study focused on PIRT and OPT for K-DEMO. Results have been reviewed and updated by Korean fusion advisory group after considering the views of specialists from domestic universities, industries, and national institutes in South Korea.

  11. Sand and Water Table Play

    Science.gov (United States)

    Wallace, Ann H.; White, Mary J.; Stone, Ryan

    2010-01-01

    The authors observed preschoolers engaged at the sand and water table to determine if math could be found within their play. Wanting to understand how children interact with provided materials and what kinds of math ideas they explore during these interactions, the authors offer practical examples of how such play can promote mathematical…

  12. Sand and Water Table Play

    Science.gov (United States)

    Wallace, Ann H.; White, Mary J.; Stone, Ryan

    2010-01-01

    The authors observed preschoolers engaged at the sand and water table to determine if math could be found within their play. Wanting to understand how children interact with provided materials and what kinds of math ideas they explore during these interactions, the authors offer practical examples of how such play can promote mathematical…

  13. table tennis的来历

    Institute of Scientific and Technical Information of China (English)

    王淑清

    2006-01-01

    乒乓球运动在运动史上是一项年轻的体育运动,只有100多年的历史,乒乓球的英文名称有table tennis和ping-pong两种。Table tennis出现不久,便成了一种风靡一时的热门运动。20世纪初,美国开始成套地生产乒乓球的比赛用具。最初,table tennis有其他名称 ,如Indoor tennis。后来,一位美国制造商以乒乓球撞击时所发出的声音创造出ping-pong这个新词,作为他们制造的“乒乓球”专利注册商标。Ping-pong后来成了table tennis的另一个正式名。当它传到中国后,人们又创造出“乒乓球”这个新的词语。

  14. Putting food on the table

    NARCIS (Netherlands)

    Candel, J.J.L.

    2016-01-01

    Putting food on the table: the European Union governance of the wicked problem of food security Jeroen Candel Food security concerns and arguments have made a revival in European Union (EU) governance since the 2007-8 and 2010 global food price crises. This renaissa

  15. Co-integration Rank Testing under Conditional Heteroskedasticity

    DEFF Research Database (Denmark)

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

    null distributions of the rank statistics coincide with those derived by previous authors who assume either i.i.d. or (strict and covariance) stationary martingale difference innovations. We then propose wild bootstrap implementations of the co-integrating rank tests and demonstrate that the associated...... bootstrap rank statistics replicate the first-order asymptotic null distributions of the rank statistics. We show the same is also true of the corresponding rank tests based on the i.i.d. bootstrap of Swensen (2006). The wild bootstrap, however, has the important property that, unlike the i.i.d. bootstrap......, it preserves in the re-sampled data the pattern of heteroskedasticity present in the original shocks. Consistent with this, numerical evidence sug- gests that, relative to tests based on the asymptotic critical values or the i.i.d. bootstrap, the wild bootstrap rank tests perform very well in small samples un...

  16. Applying weighted PageRank to author citation networks

    CERN Document Server

    Ding, Ying

    2011-01-01

    This paper aims to identify whether different weighted PageRank algorithms can be applied to author citation networks to measure the popularity and prestige of a scholar from a citation perspective. Information Retrieval (IR) was selected as a test field and data from 1956-2008 were collected from Web of Science (WOS). Weighted PageRank with citation and publication as weighted vectors were calculated on author citation networks. The results indicate that both popularity rank and prestige rank were highly correlated with the weighted PageRank. Principal Component Analysis (PCA) was conducted to detect relationships among these different measures. For capturing prize winners within the IR field, prestige rank outperformed all the other measures.

  17. Random Walker Ranking for NCAA Division I-A Football

    CERN Document Server

    Callaghan, T; Mucha, P J; Callaghan, Thomas; Porter, Mason A.; Mucha, Peter J.

    2003-01-01

    We develop a one-parameter family of ranking systems for NCAA Division I-A football teams based on a collection of voters, each with a single vote, executing independent random walks on a network defined by the teams (vertices) and the games played (edges). The virtue of this class of ranking systems lies in the simplicity of its explanation. We discuss the statistical properties of the randomly walking voters and relate them to the community structure of the underlying network. We compare the results of these rankings for recent seasons with Bowl Championship Series standings and component rankings. To better understand this ranking system, we also examine the asymptotic behaviors of the aggregate of walkers. Finally, we consider possible generalizations to this ranking algorithm.

  18. 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.

  19. Bayesian Thurstonian models for ranking data using JAGS.

    Science.gov (United States)

    Johnson, Timothy R; Kuhn, Kristine M

    2013-09-01

    A Thurstonian model for ranking data assumes that observed rankings are consistent with those of a set of underlying continuous variables. This model is appealing since it renders ranking data amenable to familiar models for continuous response variables-namely, linear regression models. To date, however, the use of Thurstonian models for ranking data has been very rare in practice. One reason for this may be that inferences based on these models require specialized technical methods. These methods have been developed to address computational challenges involved in these models but are not easy to implement without considerable technical expertise and are not widely available in software packages. To address this limitation, we show that Bayesian Thurstonian models for ranking data can be very easily implemented with the JAGS software package. We provide JAGS model files for Thurstonian ranking models for general use, discuss their implementation, and illustrate their use in analyses.

  20. Improving the Incoherence of a Learned Dictionary via Rank Shrinkage.

    Science.gov (United States)

    Ubaru, Shashanka; Seghouane, Abd-Krim; Saad, Yousef

    2017-01-01

    This letter considers the problem of dictionary learning for sparse signal representation whose atoms have low mutual coherence. To learn such dictionaries, at each step, we first update the dictionary using the method of optimal directions (MOD) and then apply a dictionary rank shrinkage step to decrease its mutual coherence. In the rank shrinkage step, we first compute a rank 1 decomposition of the column-normalized least squares estimate of the dictionary obtained from the MOD step. We then shrink the rank of this learned dictionary by transforming the problem of reducing the rank to a nonnegative garrotte estimation problem and solving it using a path-wise coordinate descent approach. We establish theoretical results that show that the rank shrinkage step included will reduce the coherence of the dictionary, which is further validated by experimental results. Numerical experiments illustrating the performance of the proposed algorithm in comparison to various other well-known dictionary learning algorithms are also presented.

  1. Rank-preserving regression: a more robust rank regression model against outliers.

    Science.gov (United States)

    Chen, Tian; Kowalski, Jeanne; Chen, Rui; Wu, Pan; Zhang, Hui; Feng, Changyong; Tu, Xin M

    2016-08-30

    Mean-based semi-parametric regression models such as the popular generalized estimating equations are widely used to improve robustness of inference over parametric models. Unfortunately, such models are quite sensitive to outlying observations. The Wilcoxon-score-based rank regression (RR) provides more robust estimates over generalized estimating equations against outliers. However, the RR and its extensions do not sufficiently address missing data arising in longitudinal studies. In this paper, we propose a new approach to address outliers under a different framework based on the functional response models. This functional-response-model-based alternative not only addresses limitations of the RR and its extensions for longitudinal data, but, with its rank-preserving property, even provides more robust estimates than these alternatives. The proposed approach is illustrated with both real and simulated data. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

  2. A Modification on the Hesitant Fuzzy Set Lexicographical Ranking Method

    OpenAIRE

    Xiaodi Liu; Zengwen Wang; Shitao Zhang

    2016-01-01

    Recently, a novel hesitant fuzzy set (HFS) ranking technique based on the idea of lexicographical ordering is proposed and an example is presented to demonstrate that the proposed ranking method is invariant with multiple occurrences of any element of a hesitant fuzzy element (HFE). In this paper, we show by examples that the HFS lexicographical ordering method is sometimes invalid, and a modified ranking method is presented. In comparison with the HFS lexicographical ordering method, the mod...

  3. International ranking systems for universities and institutions: a critical appraisal

    Directory of Open Access Journals (Sweden)

    Tatsioni Athina

    2007-10-01

    Full Text Available Abstract Background Ranking of universities and institutions has attracted wide attention recently. Several systems have been proposed that attempt to rank academic institutions worldwide. Methods We review the two most publicly visible ranking systems, the Shanghai Jiao Tong University 'Academic Ranking of World Universities' and the Times Higher Education Supplement 'World University Rankings' and also briefly review other ranking systems that use different criteria. We assess the construct validity for educational and research excellence and the measurement validity of each of the proposed ranking criteria, and try to identify generic challenges in international ranking of universities and institutions. Results None of the reviewed criteria for international ranking seems to have very good construct validity for both educational and research excellence, and most don't have very good construct validity even for just one of these two aspects of excellence. Measurement error for many items is also considerable or is not possible to determine due to lack of publication of the relevant data and methodology details. The concordance between the 2006 rankings by Shanghai and Times is modest at best, with only 133 universities shared in their top 200 lists. The examination of the existing international ranking systems suggests that generic challenges include adjustment for institutional size, definition of institutions, implications of average measurements of excellence versus measurements of extremes, adjustments for scientific field, time frame of measurement and allocation of credit for excellence. Conclusion Naïve lists of international institutional rankings that do not address these fundamental challenges with transparent methods are misleading and should be abandoned. We make some suggestions on how focused and standardized evaluations of excellence could be improved and placed in proper context.

  4. Ranking of States and Commodities by Cash Receipts, 1991

    OpenAIRE

    Strickland, Roger P.; Johnson, Cheryl; Williams, Robert P.

    1992-01-01

    This publication identifies the 25 leading agricultural commodities produced in each State and the United States, ranked by the value of cash receipts. The major producing States, ranked by cash receipts, for each of the 25 leading commodities in the United States and for several major commodity groups are also identified. The information is derived from U.S. Department of Agriculture's cash receipts statistics for the marketing of agricultural commodities within States. The ranking of commod...

  5. Money counts for a Times Higher Education top-rank

    OpenAIRE

    2014-01-01

    This paper analyses the relationship between a university’s expenditure per student and its position in international university rankings. We take into account other factors that are expected to play a role, such as university mission, size, and productive inefficiency. We formalise these concepts in our theoretical model of rankings and universities, and estimate this model with data on universities classified in the top 200 by the Times Higher Education Supplement ranking of 2007. We find t...

  6. 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.

  7. Ranking forestry journals using the h-index

    CERN Document Server

    Vanclay, Jerome K

    2007-01-01

    An expert ranking of forestry journals was compared with journal impact factors and h-indices computed from ISI and internet-based data. Citations reported by Google Scholar appear to offer the most efficient way to rank all journals objectively, in a manner consistent with other indicators. A ranking of 180 forestry journals is presented, on the basis of an h-index computed from data supplied by Google Scholar.

  8. NNDSS - Table II. Salmonellosis to Shigellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Salmonellosis to Shigellosis - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  9. NNDSS - Table II. Babesiosis to Campylobacteriosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Babesiosis to Campylobacteriosis - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the...

  10. NNDSS - Table II. Invasive Pneumococcal to Legionellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Invasive Pneumococcal to Legionellosis - 2014.In this Table, all conditions with a 5-year average annual national total of more than or equals...

  11. NNDSS - Table II. Invasive Pneumococcal to Legionellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Invasive Pneumococcal to Legionellosis - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  12. NNDSS - Table II. Invasive Pneumococcal to Legionellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Invasive Pneumococcal to Legionellosis - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during...

  13. NNDSS - Table II. Salmonellosis to Shigellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Salmonellosis to Shigellosis - 2014. In this Table, all conditions with a 5-year average annual national total of more than or equals 1,000 cases...

  14. NNDSS - Table I. infrequently reported notifiable diseases

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table I. infrequently reported notifiable diseases - 2017. In this Table, provisional cases of selected infrequently reported notifiable diseases (<1,000...

  15. NNDSS - Table I. infrequently reported notifiable diseases

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table I. infrequently reported notifiable diseases - 2016. In this Table, provisional* cases of selected†infrequently reported notifiable diseases...

  16. NNDSS - Table II. West Nile virus disease

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. West Nile virus disease - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  17. NNDSS - Table II. Lyme disease to Meningococcal

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Lyme disease to Meningococcal - 2014In this Table, all conditions with a 5-year average annual national total of more than or equals 1,000 cases...

  18. NNDSS - Table II. Babesiosis to Campylobacteriosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Babesiosis to Campylobacteriosis - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  19. NNDSS - Table II. Chlamydia to Coccidioidomycosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Chlamydia to Coccidioidomycosis - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  20. NNDSS - Table II. Shiga toxin to Shigellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Shiga toxin to Shigellosis - 2015. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  1. NNDSS - Table II. Shiga toxin to Shigellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Shiga toxin to Shigellosis - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the...

  2. NNDSS - Table II. Giardiasis to Haemophilus influenza

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Giardiasis to Haemophilus influenza - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  3. NNDSS - Table II. Tetanus to Vibriosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Tetanus to Vibriosis - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the preceding...

  4. NNDSS - Table II. Tetanus to Vibriosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Tetanus to Vibriosis - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding year),...

  5. Global Reference Tables for Management Information Systems.

    Data.gov (United States)

    Social Security Administration — This database is a collection of reference tables that store common information used throughout SSA. These tables standardize code structures and code usage of SSA...

  6. NNDSS - Table II. Ehrlichiosis and Anaplasmosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Ehrlichiosis and Anaplasmosis - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  7. NNDSS - Table II. Legionellosis to Malaria

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Legionellosis to Malaria - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  8. NNDSS - Table II. Tetanus to Varicella

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Tetanus to Varicella - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding year),...

  9. NNDSS - Table II. Cryptosporidiosis to Dengue

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Cryptosporidiosis to Dengue - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  10. Water-table contours of Nevada

    Data.gov (United States)

    U.S. Geological Survey, Department of the Interior — This data set consists of water-table contours for Nevada. These data were created as part of an effort to provide statewide information on water table and depth to...

  11. NNDSS - Table II. Hepatitis (viral, acute)

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Hepatitis (viral, acute) - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  12. NNDSS - Table II. Hepatitis (viral, acute)

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Hepatitis (viral, acute) - 2014.In this Table, all conditions with a 5-year average annual national total of more than or equals 1,000 cases but...

  13. NNDSS - Table II. Hepatitis (viral, acute) C

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Hepatitis (viral, acute) C - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  14. NNDSS - Table II. West Nile virus disease

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. West Nile virus disease - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  15. NNDSS - Table I. infrequently reported notifiable diseases

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table I. infrequently reported notifiable diseases - 2014.In this Table, provisional cases of selected infrequently reported notifiable diseases (<1,000...

  16. NNDSS - Table I. infrequently reported notifiable diseases

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table I. infrequently reported notifiable diseases - 2015. In this Table, provisional cases of selected infrequently reported notifiable diseases (<1,000...

  17. Global Reference Tables for Production Systems.

    Data.gov (United States)

    Social Security Administration — This database is a collection of reference tables that store common information used throughout SSA. These tables standardized code structures and code usage of SSA...

  18. A new pattern of the periodic table

    Directory of Open Access Journals (Sweden)

    Brajendra Nath Tripathi

    1962-07-01

    Full Text Available A new pattern of the Periodic Table is described which incorporates all the points for which various models of two or three dimensional tables have been proposed from time to time.

  19. Solar cell efficiency tables (version 50)

    Energy Technology Data Exchange (ETDEWEB)

    Green, Martin A. [Australian Centre for Advanced Photovoltaics, University of New South Wales, Sydney 2052 Australia; Hishikawa, Yoshihiro [National Institute of Advanced Industrial Science and Technology (AIST), Research Center for Photovoltaics (RCPV), Central 2, Umezono 1-1-1, Ibaraki Tsukuba 305-8568 Japan; Warta, Wilhelm [Department: Characterisation and Simulation/CalLab Cells, Fraunhofer-Institute for Solar Energy Systems, Heidenhofstr. 2 Freiburg D-79110 Germany; Dunlop, Ewan D. [European Commission-Joint Research Centre, Directorate C-Energy, Transport and Climate, Via E. Fermi 2749 Ispra IT-21027 VA Italy; Levi, Dean H. [National Renewable Energy Laboratory, 15013 Denver West Parkway Golden CO 80401 USA; Hohl-Ebinger, Jochen [Department: Characterisation and Simulation/CalLab Cells, Fraunhofer-Institute for Solar Energy Systems, Heidenhofstr. 2 Freiburg D-79110 Germany; Ho-Baillie, Anita W. H. [Australian Centre for Advanced Photovoltaics, University of New South Wales, Sydney 2052 Australia

    2017-06-21

    Consolidated tables showing an extensive listing of the highest independently confirmed efficiencies for solar cells and modules are presented. Guidelines for inclusion of results into these tables are outlined, and new entries since January 2017 are reviewed.

  20. Using Generation Tables in Population Biology

    Science.gov (United States)

    Stanley, Melissa

    1974-01-01

    Discusses the use of "generation tables" to demonstrate the effect of age on the size of a population in a biology course for nonscience majors. Included are specified assumptions and conditions for table construction. (CC)

  1. NNDSS - Table II. Mumps to Rabies, animal

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Mumps to Rabies, animal - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  2. NNDSS - Table II. Mumps to Rabies, animal

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Mumps to Rabies, animal - 2014.In this Table, all conditions with a 5-year average annual national total of more than or equals 1,000 cases but...

  3. NNDSS - Table II. Chlamydia to Coccidioidomycosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Chlamydia to Coccidioidomycosis - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  4. NNDSS - Table II. Rubella to Salmonellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Rubella to Salmonellosis - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  5. NNDSS - Table II. Giardiasis to Haemophilus influenza

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Giardiasis to Haemophilus influenza - 2014. In this Table, all conditions with a 5-year average annual national total of more than or equals 1,000...

  6. NNDSS - Table II. Babesiosis to Coccidioidomycosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Babesiosis to Coccidioidomycosis - 2014.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  7. NNDSS - Table II. Babesiosis to Campylobacteriosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Babesiosis to Campylobacteriosis - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  8. NNDSS - Table II. Lyme disease to Meningococcal

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Lyme disease to Meningococcal - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  9. NNDSS - Table II. Ehrlichiosis/Anaplasmosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Ehrlichiosis/Anaplasmosis - 2014.In this Table, all conditions with a 5-year average annual national total of more than or equals 1,000 cases but...

  10. NNDSS - Table II. Cryptosporidiosis to Dengue

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Cryptosporidiosis to Dengue - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  11. NNDSS - Table II. Giardiasis to Haemophilus influenza

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Giardiasis to Haemophilus influenza - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the...

  12. NNDSS - Table II. Ehrlichiosis/Anaplasmosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Ehrlichiosis/Anaplasmosis - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  13. NNDSS - Table II. Meningococcal to Pertussis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Meningococcal to Pertussis - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

  14. NNDSS - Table II. Lyme disease to Meningococcal

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Lyme disease to Meningococcal - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the...

  15. NNDSS - Table II. Hepatitis (viral, acute)

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Hepatitis (viral, acute) - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the preceding...

  16. NNDSS - Table II. Rubella to Salmonellosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Rubella to Salmonellosis - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the preceding...

  17. NNDSS - Table II. Cryptosporidiosis to Dengue

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Cryptosporidiosis to Dengue - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the...

  18. NNDSS - Table II. Giardiasis to Haemophilus influenza

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Giardiasis to Haemophilus influenza - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the...

  19. NNDSS - Table II. Ehrlichiosis/Anaplasmosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Ehrlichiosis/Anaplasmosis - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the preceding...

  20. NNDSS - Table II. Chlamydia to Coccidioidomycosis

    Data.gov (United States)

    U.S. Department of Health & Human Services — NNDSS - Table II. Chlamydia to Coccidioidomycosis - 2016. In this Table, provisional* cases of selected†notifiable diseases (≥1,000 cases reported during the...

  1. 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.

  2. A Modification on the Hesitant Fuzzy Set Lexicographical Ranking Method

    Directory of Open Access Journals (Sweden)

    Xiaodi Liu

    2016-12-01

    Full Text Available Recently, a novel hesitant fuzzy set (HFS ranking technique based on the idea of lexicographical ordering is proposed and an example is presented to demonstrate that the proposed ranking method is invariant with multiple occurrences of any element of a hesitant fuzzy element (HFE. In this paper, we show by examples that the HFS lexicographical ordering method is sometimes invalid, and a modified ranking method is presented. In comparison with the HFS lexicographical ordering method, the modified ranking method is more reasonable in more general cases.

  3. Quantum probability ranking principle for ligand-based virtual screening

    Science.gov (United States)

    Al-Dabbagh, Mohammed Mumtaz; Salim, Naomie; Himmat, Mubarak; Ahmed, Ali; Saeed, Faisal

    2017-02-01

    Chemical libraries contain thousands of compounds that need screening, which increases the need for computational methods that can rank or prioritize compounds. The tools of virtual screening are widely exploited to enhance the cost effectiveness of lead drug discovery programs by ranking chemical compounds databases in decreasing probability of biological activity based upon probability ranking principle (PRP). In this paper, we developed a novel ranking approach for molecular compounds inspired by quantum mechanics, called quantum probability ranking principle (QPRP). The QPRP ranking criteria would make an attempt to draw an analogy between the physical experiment and molecular structure ranking process for 2D fingerprints in ligand based virtual screening (LBVS). The development of QPRP criteria in LBVS has employed the concepts of quantum at three different levels, firstly at representation level, this model makes an effort to develop a new framework of molecular representation by connecting the molecular compounds with mathematical quantum space. Secondly, estimate the similarity between chemical libraries and references based on quantum-based similarity searching method. Finally, rank the molecules using QPRP approach. Simulated virtual screening experiments with MDL drug data report (MDDR) data sets showed that QPRP outperformed the classical ranking principle (PRP) for molecular chemical compounds.

  4. Proceedings of the sixteenth biennial low-rank fuels symposium

    Energy Technology Data Exchange (ETDEWEB)

    1991-01-01

    Low-rank coals represent a major energy resource for the world. The Low-Rank Fuels Symposium, building on the traditions established by the Lignite Symposium, focuses on the key opportunities for this resource. This conference offers a forum for leaders from industry, government, and academia to gather to share current information on the opportunities represented by low-rank coals. In the United States and throughout the world, the utility industry is the primary user of low-rank coals. As such, current experiences and future opportunities for new technologies in this industry were the primary focuses of the symposium.

  5. Learning to rank for information retrieval and natural language processing

    CERN Document Server

    Li, Hang

    2014-01-01

    Learning to rank refers to machine learning techniques for training a model in a ranking task. Learning to rank is useful for many applications in information retrieval, natural language processing, and data mining. Intensive studies have been conducted on its problems recently, and significant progress has been made. This lecture gives an introduction to the area including the fundamental problems, major approaches, theories, applications, and future work.The author begins by showing that various ranking problems in information retrieval and natural language processing can be formalized as tw

  6. Quantum probability ranking principle for ligand-based virtual screening.

    Science.gov (United States)

    Al-Dabbagh, Mohammed Mumtaz; Salim, Naomie; Himmat, Mubarak; Ahmed, Ali; Saeed, Faisal

    2017-04-01

    Chemical libraries contain thousands of compounds that need screening, which increases the need for computational methods that can rank or prioritize compounds. The tools of virtual screening are widely exploited to enhance the cost effectiveness of lead drug discovery programs by ranking chemical compounds databases in decreasing probability of biological activity based upon probability ranking principle (PRP). In this paper, we developed a novel ranking approach for molecular compounds inspired by quantum mechanics, called quantum probability ranking principle (QPRP). The QPRP ranking criteria would make an attempt to draw an analogy between the physical experiment and molecular structure ranking process for 2D fingerprints in ligand based virtual screening (LBVS). The development of QPRP criteria in LBVS has employed the concepts of quantum at three different levels, firstly at representation level, this model makes an effort to develop a new framework of molecular representation by connecting the molecular compounds with mathematical quantum space. Secondly, estimate the similarity between chemical libraries and references based on quantum-based similarity searching method. Finally, rank the molecules using QPRP approach. Simulated virtual screening experiments with MDL drug data report (MDDR) data sets showed that QPRP outperformed the classical ranking principle (PRP) for molecular chemical compounds.

  7. ONTOPARK: ONTOLOGY BASED PAGE RANKING FRAMEWORK USING RESOURCE DESCRIPTION FRAMEWORK

    Directory of Open Access Journals (Sweden)

    S. Yasodha

    2014-01-01

    Full Text Available Traditional search engines like Google and Yahoo fail to rank the relevant information for users’ query. This is because such search engines rely on keywords for searching and they fail to consider the semantics of the query. More sophisticated methods that do provide the relevant information for the query is the need of the time. The Semantic Web that stores metadata as ontology could be used to solve this problem. The major drawback of the PageRank algorithm of Google is that ranking is based not only on the page ranks produced but also on the number of hits to the Web page. This paved way for illegitimate means of boosting page ranks. As a result, Web pages whose page rank is zero are also ranked in top-order. This drawback of PageRank algorithm motivated us to contribute to the Web community to provide semantic search results. So we propose ONTOPARK, an ontology based framework for ranking Web pages. The proposed framework combines the Vector Space Model of Information Retrieval with Ontology. The framework constructs semantically annotated Resource Description Framework (RDF files which form the RDF knowledgebase for each query. The proposed framework has been evaluated by two measures, precision and recall. The proposed framework improves the precision of both single-word and multi-word queries which infer that replacing Web database by semantic knowledgebase will definitely improve the quality of search. The surfing time of the surfers will also be minimized.

  8. A Project Risk Ranking Approach Based on Set Pair Analysis

    Institute of Scientific and Technical Information of China (English)

    Gao Feng; Chen Yingwu

    2006-01-01

    Set Pair Analysis (SPA) is a new methodology to describe and process system uncertainty. It is different from stochastic or fuzzy methods in reasoning and operation, and it has been applied in many areas recently. In this paper, the application of SPA in risk ranking is presented, which includes review of risk ranking, introduction of Connecting Degree (CD) that is a key role in SPA., Arithmetic and Tendency Grade (TG) of CDs, and a risk ranking approach proposed. Finally a case analysis is presented to illustrate the reasonability of this approach. It is found that this approach is very convenient to operate, while the ranking result is more comprehensible.

  9. 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

  10. 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

  11. 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.

  12. 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...

  13. PageRank optimization applied to spam detection

    CERN Document Server

    Fercoq, Olivier

    2012-01-01

    We give a new link spam detection and PageRank demotion algorithm called MaxRank. Like TrustRank and AntiTrustRank, it starts with a seed of hand-picked trusted and spam pages. We define the MaxRank of a page as the frequency of visit of this page by a random surfer minimizing an average cost per time unit. On a given page, the random surfer selects a set of hyperlinks and clicks with uniform probability on any of these hyperlinks. The cost function penalizes spam pages and hyperlink removals. The goal is to determine a hyperlink deletion policy that minimizes this score. The MaxRank is interpreted as a modified PageRank vector, used to sort web pages instead of the usual PageRank vector. The bias vector of this ergodic control problem, which is unique up to an additive constant, is a measure of the "spamicity" of each page, used to detect spam pages. We give a scalable algorithm for MaxRank computation that allowed us to perform experimental results on the WEBSPAM-UK2007 dataset. We show that our algorithm o...

  14. Structured Learning of Two-Level Dynamic Rankings

    CERN Document Server

    Raman, Karthik; Shivaswamy, Pannaga

    2011-01-01

    For ambiguous queries, conventional retrieval systems are bound by two conflicting goals. On the one hand, they should diversify and strive to present results for as many query intents as possible. On the other hand, they should provide depth for each intent by displaying more than a single result. Since both diversity and depth cannot be achieved simultaneously in the conventional static retrieval model, we propose a new dynamic ranking approach. Dynamic ranking models allow users to adapt the ranking through interaction, thus overcoming the constraints of presenting a one-size-fits-all static ranking. In particular, we propose a new two-level dynamic ranking model for presenting search results to the user. In this model, a user's interactions with the first-level ranking are used to infer this user's intent, so that second-level rankings can be inserted to provide more results relevant for this intent. Unlike for previous dynamic ranking models, we provide an algorithm to efficiently compute dynamic ranking...

  15. Discovering author impact: A PageRank perspective

    CERN Document Server

    Yan, Erjia

    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 Society for Scientometrics and Informetrics (ISSI) conferences. Findings show that this weighted PageRank algorithm provides reliable results in measuring author impact.

  16. A statistical approach to rank multiple priorities in Environmental Epidemiology: an example from high-risk areas in Sardinia, Italy

    Directory of Open Access Journals (Sweden)

    Dolores Catelan

    2008-11-01

    Full Text Available In Environmental Epidemiology, long lists of relative risk estimates from exposed populations are compared to a reference to scrutinize the dataset for extremes. Here, inference on disease profiles for given areas, or for fixed disease population signatures, are of interest and summaries can be obtained averaging over areas or diseases. We have developed a multivariate hierarchical Bayesian approach to estimate posterior rank distributions and we show how to produce league tables of ranks with credibility intervals useful to address the above mentioned inferential problems. Applying the procedure to a real dataset from the report “Environment and Health in Sardinia (Italy” we selected 18 areas characterized by high environmental pressure for industrial, mining or military activities investigated for 29 causes of deaths among male residents. Ranking diseases highlighted the increased burdens of neoplastic (cancerous, and non-neoplastic respiratory diseases in the heavily polluted area of Portoscuso. The averaged ranks by disease over areas showed lung cancer among the three highest positions.

  17. Monotone Rank and Separations in Computational Complexity

    CERN Document Server

    Li, Yang D

    2011-01-01

    In the paper, we introduce the concept of monotone rank, and using it as a powerful tool, we obtain several important and strong separation results in computational complexity. We show a super-exponential separation between monotone and non-monotone computation in the non-commutative model, and thus give the answer to a longstanding open problem posed by Nisan \\cite{Nis1991} in algebraic complexity. More specifically, we exhibit a homogeneous algebraic function $f$ of degree $d$ ($d$ even) on $n$ variables with the monotone algebraic branching program (ABP) complexity $\\Omega(n^{d/2})$ and the non-monotone ABP complexity $O(d^2)$. We propose a relaxed version of the famous Bell's theorem\\cite{Bel1964}\\cite{CHSH1969}. Bell's theorem basically states that local hidden variable theory cannot predict the correlations produced by quantum mechanics, and therefore is an impossibility result. Bell's theorem heavily relies on the diversity of the measurements. We prove that even if we fix the measurement, infinite amo...

  18. Improving CBIR Systems Using Automated Ranking

    Directory of Open Access Journals (Sweden)

    B. D. Reljin

    2012-11-01

    Full Text Available The most common way of searching images on the Internet and in private collections is based on a similarity measuring of a series of text words that are assigned to each image with users query series. This method imposes strong constraints (the number of words to describe the image, the time necessary to thoroughly describe the subjective experience of images, the level of details in the picture, language barrier, etc., and is therefore very inefficient. Modern researches in this area are focused on the contentbased searching images (CBIR. In this way, all described disadvantages are overcome and the quality of searching results is improved. This paper presents a solution for CBIR systems where the search procedure is enhanced using sophisticated extraction and ranking of extracted images. The searching procedure is based on extraction and preprocessing of a large number of low level image features. Thus, when the user defines a query image, the proposed algorithm based on artificial intelligence, shows to the user a group of images which are most similar to a query image by content. The proposed algorithm is iterative, so the user can direct the searching procedure to an expected outcome and get a set of images that are more similar to the query one.

  19. Biogasification of low-rank coal

    Energy Technology Data Exchange (ETDEWEB)

    Harding, R.; Czarnecki, S.; Isbister, J.; Barik, S. (ARCTECH, Inc., Chantilly, VA (United States))

    1993-02-01

    ARCTECH is developing a coal biogasification technology, The MicGAS Process'' for producing clean fuel forms such as methane. The overall objective of this research project was to characterize and construct an efficient coal gasifying capable of converting Texas lignite to methane. The technical feasibility for bioconversion of Texas lignite to methane, volatile fatty acids, alcohols, and other soluble organic products has been demonstrated. Several biogasification were evaluated for their ability to degrade low-rank coals to methane, and Mic-1 a mixed culture derived from a wood-eating- Zootermopsis termite species, was identified as the most active and efficient for biogasification of Texas lignite. Parameters such as pH, temperature, redox potential, coal particle size, coal solids loadings, culture age, nutrient amendments, and biomass concentration were studied to determine the optimum conditions required for efficient biogasification of coal. Analytical methods for monitoring the production of methane, degradation intermediates, and biomass were developed. Most significant achievements were: (1) development of analytical methodology to monitor coal biogasification; (2) confirmation of biogasification efficiency of Mic-1 culture; (3) ability of Mic-1 consortium to retain coal-degrading activity when grown in the absence of coal; and (4) significantly higher (ca. 26%) methane production from micronized coal (ca. 10 gm) than from larger coal particle sizes.

  20. Nonparametric multivariate rank tests and their unbiasedness

    CERN Document Server

    Jurečková, Jana; 10.3150/10-BEJ326

    2012-01-01

    Although unbiasedness is a basic property of a good test, many tests on vector parameters or scalar parameters against two-sided alternatives are not finite-sample unbiased. This was already noticed by Sugiura [Ann. Inst. Statist. Math. 17 (1965) 261--263]; he found an alternative against which the Wilcoxon test is not unbiased. The problem is even more serious in multivariate models. When testing the hypothesis against an alternative which fits well with the experiment, it should be verified whether the power of the test under this alternative cannot be smaller than the significance level. Surprisingly, this serious problem is not frequently considered in the literature. The present paper considers the two-sample multivariate testing problem. We construct several rank tests which are finite-sample unbiased against a broad class of location/scale alternatives and are finite-sample distribution-free under the hypothesis and alternatives. Each of them is locally most powerful against a specific alternative of t...

  1. Relevancy Ranking of Satellite Dataset Search Results

    Science.gov (United States)

    Lynnes, Christopher; Quinn, Patrick; Norton, James

    2017-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.

  2. Dilation Theory for Rank 2 Graph Algebras

    CERN Document Server

    Davidson, Kenneth R; Yang Di Lian

    2007-01-01

    An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\\A_\\theta$ and $\\A_u$ which are associated with the commutation relation permutation $\\theta$ of a 2 graph and, more generally, with commutation relations determined by a unitary matrix $u$ in $M_m(\\bC) \\otimes M_n(\\bC)$. We show that a defect free row contractive representation has a unique minimal dilation to a $*$-representation and we provide a new simpler proof of Solel's row isometric dilation of two $u$-commuting row contractions. Furthermore it is shown that the C*-envelope of $\\A_u$ is the generalised Cuntz algebra $\\O_{X_u}$ for the product system $X_u$ of $u$; that for $m\\geq 2 $ and $n \\geq 2 $ contractive representations of $\\Ath$ need not be completely contractive; and that the universal tensor algebra $\\T_+(X_u)$ need not be isometrically isomorphic to $\\A_u$.

  3. Grades and Ranking: When Tenure Affects Assessment

    Directory of Open Access Journals (Sweden)

    Jean Filetti

    2010-10-01

    Full Text Available This article examines how a faculty member's status-'either tenured or tenure-track-'might affect the grades assigned to students in a writing class. We begin with a brief review of the research surrounding faculty to student assessment practices and follow with specific controversies regarding faculty motivation pertaining to grading practices. We interpret the grade distributions of tenured and tenure-track faculty members teaching a sophomore-level writing course in an English Department at a small, public liberal arts university in Virginia, examine the relationship between grade distributions and faculty rank, and conclude that tenure-track faculty grade more leniently than their tenured colleagues, primarily in the number of - A- grades assigned. The results of this study suggest that tenured professors tend to award fewer - As- than tenure-track professors. We posit that at universities where emphasis is placed upon teaching, two specific patterns emerge: reciprocity may be an unspoken agreement between some faculty and students with regard to the exchange of good grades for good evaluations, or with experience comes rigor.

  4. Striations in PageRank-Ordered Matrices

    CERN Document Server

    Pennycuff, Corey

    2016-01-01

    Patterns often appear in a variety of large, real-world networks, and interesting physical phenomena are often explained by network topology as in the case of the bow-tie structure of the World Wide Web, or the small world phenomenon in social networks. The discovery and modelling of such regular patterns has a wide application from disease propagation to financial markets. In this work we describe a newly discovered regularly occurring striation pattern found in the PageRank ordering of adjacency matrices that encode real-world networks. We demonstrate that these striations are the result of well-known graph generation processes resulting in regularities that are manifest in the typical neighborhood distribution. The spectral view explored in this paper encodes a tremendous amount about the explicit and implicit topology of a given network, so we also discuss the interesting network properties, outliers and anomalies that a viewer can determine from a brief look at the re-ordered matrix.

  5. Studies on Relevance, Ranking and Results Display

    CERN Document Server

    Gelernter, Judith; Carbonell, Jaime

    2010-01-01

    This study considers the extent to which users with the same query agree as to what is relevant, and how what is considered relevant may translate into a retrieval algorithm and results display. To combine user perceptions of relevance with algorithm rank and to present results, we created a prototype digital library of scholarly literature. We confine studies to one population of scientists (paleontologists), one domain of scholarly scientific articles (paleo-related), and a prototype system (PaleoLit) that we built for the purpose. Based on the principle that users do not pre-suppose answers to a given query but that they will recognize what they want when they see it, our system uses a rules-based algorithm to cluster results into fuzzy categories with three relevance levels. Our system matches at least 1/3 of our participants' relevancy ratings 87% of the time. Our subsequent usability study found that participants trusted our uncertainty labels but did not value our color-coded horizontal results layout ...

  6. Ranking Swing Voters in Congressional Elections

    CERN Document Server

    Ambadjes, Steven

    2014-01-01

    We present a model for quantitatively identifying swing voters in congressional elections. This is achieved by predicting an individual voter's likelihood to vote and an individual voter's likelihood to vote for a given party, if he votes. We make a rough prediction of these values. We then update these predictions by incorporating information on a municipality wide basis via aggregate data to enhance our estimate under the assumption that nearby voters have similar behavior, which could be due to social interaction or common external factors. Finally, we use a ranking scheme on these predictions to identify two key types of voter: 1) Voters who are likely to vote that we can convince to vote for a given party; and, 2) Voters who are likely to vote for a given party, if they vote, that we can convince to actually turn out to vote. Once these voters have been identified, a political campaign can use this information to micro-target voters and win more votes.

  7. 21 CFR 890.3750 - Mechanical table.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Mechanical table. 890.3750 Section 890.3750 Food... DEVICES PHYSICAL MEDICINE DEVICES Physical Medicine Prosthetic Devices § 890.3750 Mechanical table. (a) Identification. A mechanical table is a device intended for medical purposes that has a flat surface that can...

  8. The Different Periodic Tables of Dmitrii Mendeleev

    Science.gov (United States)

    Laing, Michael

    2008-01-01

    Between 1869 and 1905 the Russian chemist Dmitrii Mendeleev published several tables with different arrangements of the chemical elements. Four of these are compared with periodic tables by Russian scientists from 1934 and 1969. The difficulties caused by the lanthanoid elements are clearly seen in the table of 1905, which satisfactorily includes…

  9. Cohort Working Life Tables for Older Canadians

    Directory of Open Access Journals (Sweden)

    Frank T. Denton

    2010-12-01

    those based on the period tables, for both men and women, and that is reflected in increased retirement expectancies. For example, a male aged 50 in 1976 could have expected to live three years longer and to have almost four more years in retirement, based on the male cohort table under medium assumptions, as compared with the corresponding period table.

  10. Authenticated hash tables

    DEFF Research Database (Denmark)

    Triandopoulos, Nikolaos; Papamanthou, Charalampos; Tamassia, Roberto

    2008-01-01

    Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying ...

  11. The Different Periodic Tables of Dmitrii Mendeleev

    Science.gov (United States)

    Laing, Michael

    2008-01-01

    Between 1869 and 1905 the Russian chemist Dmitrii Mendeleev published several tables with different arrangements of the chemical elements. Four of these are compared with periodic tables by Russian scientists from 1934 and 1969. The difficulties caused by the lanthanoid elements are clearly seen in the table of 1905, which satisfactorily includes…

  12. Severe Language Effect in University Rankings: Particularly Germany and France are wronged in citation-based rankings

    CERN Document Server

    van Raan, Anthony F J; Visser, Martijn S

    2010-01-01

    We applied a set of standard bibliometric indicators to monitor the scientific state-of-arte of 500 universities worldwide and constructed a ranking on the basis of these indicators (Leiden Ranking 2010). We find a dramatic and hitherto largely underestimated language effect in the bibliometric, citation-based measurement of research performance when comparing the ranking based on all Web of Science (WoS) covered publications and on only English WoS covered publications, particularly for Germany and France.

  13. Severe language effect in university rankings: particularly Germany and France are wronged in citation-based rankings.

    Science.gov (United States)

    van Raan, Anthony F J; van Leeuwen, Thed N; Visser, Martijn S

    2011-08-01

    We applied a set of standard bibliometric indicators to monitor the scientific state-of-arte of 500 universities worldwide and constructed a ranking on the basis of these indicators (Leiden Ranking 2010). We find a dramatic and hitherto largely underestimated language effect in the bibliometric, citation-based measurements of research performance when comparing the ranking based on all Web of Science (WoS) covered publications and on only English WoS covered publications, particularly for Germany and France.

  14. Managing Restaurant Tables using Constraints

    Science.gov (United States)

    Vidotto, Alfio; Brown, Kenneth N.; Beck, J. Christopher

    Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We show how to model the problem as constraint satisfaction, with extensions which generate flexible seating plans and which maintain stability when changes occur. We describe an implemented system which provides advice to users in real time. The system is currently being evaluated in a restaurant environment.

  15. Two Problems with Table Saws

    Science.gov (United States)

    Vautaw, William R.

    2008-01-01

    We solve two problems that arise when constructing picture frames using only a table saw. First, to cut a cove running the length of a board (given the width of the cove and the angle the cove makes with the face of the board) we calculate the height of the blade and the angle the board should be turned as it is passed over the blade. Second, to…

  16. Putting food on the table

    OpenAIRE

    2016-01-01

    Putting food on the table: the European Union governance of the wicked problem of food security Jeroen Candel Food security concerns and arguments have made a revival in European Union (EU) governance since the 2007-8 and 2010 global food price crises. This renaissance of food security has been accompanied by increasing awareness among scholars and policymakers about high degrees of complexity, uncertainty, controversy, and cross-scale dynamics surrounding food security as well as consequent ...

  17. Effect of Doximity Residency Rankings on Residency Applicants’ Program Choices

    Directory of Open Access Journals (Sweden)

    Aimee M. Rolston

    2015-11-01

    Full Text Available Introduction: Choosing a residency program is a stressful and important decision. Doximity released residency program rankings by specialty in September 2014. This study sought to investigate the impact of those rankings on residency application choices made by fourth year medical students. Methods: A 12-item survey was administered in October 2014 to fourth year medical students at three schools. Students indicated their specialty, awareness of and perceived accuracy of the rankings, and the rankings’ impact on the programs to which they chose to apply. Descriptive statistics were reported for all students and those applying to Emergency Medicine (EM. Results: A total of 461 (75.8% students responded, with 425 applying in one of the 20 Doximity ranked specialties. Of the 425, 247 (58% were aware of the rankings and 177 looked at them. On a 1-100 scale (100=very accurate, students reported a mean ranking accuracy rating of 56.7 (SD 20.3. Forty-five percent of students who looked at the rankings modified the number of programs to which they applied. The majority added programs. Of the 47 students applying to EM, 18 looked at the rankings and 33% changed their application list with most adding programs. Conclusion: The Doximity rankings had real effects on students applying to residencies as almost half of students who looked at the rankings modified their program list. Additionally, students found the rankings to be moderately accurate. Graduating students might benefit from emphasis on more objective characterization of programs to assess in light of their own interests and personal/career goals

  18. The pharmacological tables of Rhazes.

    Science.gov (United States)

    Kahl, Oliver

    2011-01-01

    This article deals with the 22nd volume of Muḥammad ibn Zakarīyāʾ al-Rāzīʾs (Rhazes, d. 313/925) medical encyclopedia al-Ḥāwī fī l-ṭibb. Volume twenty-two is dedicated to pharmacology and pharmacological tables, and introduced by a short treatise in which Rhazes explains his unusual choice of tabular design and terminological arrangement. Following upon a brief bio-bibliographical survey and forming the core of this article, Rhazesʾ introductory treatise is re-edited here in the original Arabic and further made accessible through an annotated English translation. Edition and translation, in turn, are followed by a detailed study of both the treatise and the tables, including explanatory diagrams, statistical evaluations, a source-critical analysis, and some observations regarding the tradition of synoptic tables in Arabic pharmaceutical literature — thus gradually emerges the conceptual originality of Rhazesʾ implementation, and new light is thrown on his broad linguistic interests and abilities. The article concludes with an excursion into the realm of Persian-Chinese intellectual exchange, suggesting the possibility of a stimulus to Rhazesʾ imagination from a remote and otherwise mostly hidden corner.

  19. The Kepler False Positive Table

    Science.gov (United States)

    Bryson, Steve; Kepler False Positive Working Group

    2015-01-01

    The Kepler Space Telescope has detected thousands of candidate exoplanets by observing transit signals in a sample of more than 190,000 stars. Many of these transit signals are false positives, defined as a transit-like signal that is not due to a planet orbiting the target star (or a bound companion if the target is a multiple-star system). Astrophysical causes of false positives include background eclipsing binaries, planetary transits not associated with the target star, and non-planetary eclipses of the target star by stellar companions. The fraction of Kepler planet candidates that are false positives ranges from about 10% at high Galactic latitudes to 40% at low Galactic latitudes. Creating a high-reliability planet candidate catalog for statistical studies such as occurrence rate calculations requires removing clearly identified false positives.The Kepler Object of Interest (KOI) catalog at the NExScI NASA Exoplanet Archive flags false positives, and will soon provide a high-level classification of false positives, but lacks detailed description of why a KOI was determined to be a false positive. The Kepler False Positive Working Group (FPWG) examines each false positive in detail to certify that it is correctly identified as a false positive, and determines the primary reason(s) a KOI is classified as a false positive. The work of the FPWG will be published as the Kepler False Positive Table, hosted at the NExScI NASA Exoplanet Archive.The Kepler False Positive Table provides detailed information on the evidence for background binaries, transits caused by stellar companions, and false alarms. In addition to providing insight into the Kepler false positive population, the false positive table gives information about the background binary population and other areas of astrophysical interest. Because a planet around a star not associated with the target star is considered a false positive, the false positive table likely contains further planet candidates

  20. Guide to mathematical tables supplement no 1

    CERN Document Server

    Burunova, N M; Fedorova, R M

    1960-01-01

    A Guide to Mathematical Tables is a supplement to the Guide to Mathematical Tables published by the U.S.S.R. Academy of Sciences in 1956. The tables contain information on subjects such as powers, rational and algebraic functions, and trigonometric functions, as well as logarithms and polynomials and Legendre functions. An index listing all functions included in both the Guide and the Supplement is included.Comprised of 15 chapters, this supplement first describes mathematical tables in the following order: the accuracy of the table (that is, the number of decimal places or significant