An Investigation on the Use of Different Centroiding Algorithms and Star Catalogs in Astro-Geodetic Observations

Science.gov (United States)

Basoglu, Burak; Halicioglu, Kerem; Albayrak, Muge; Ulug, Rasit; Tevfik Ozludemir, M.; Deniz, Rasim

2017-04-01

In the last decade, the importance of high-precise geoid determination at local or national level has been pointed out by Turkish National Geodesy Commission. The Commission has also put objective of modernization of national height system of Turkey to the agenda. Meanwhile several projects have been realized in recent years. In Istanbul city, a GNSS/Levelling geoid was defined in 2005 for the metropolitan area of the city with an accuracy of ±3.5cm. In order to achieve a better accuracy in this area, "Local Geoid Determination with Integration of GNSS/Levelling and Astro-Geodetic Data" project has been conducted in Istanbul Technical University and Bogazici University KOERI since January 2016. The project is funded by The Scientific and Technological Research Council of Turkey. With the scope of the project, modernization studies of Digital Zenith Camera System are being carried on in terms of hardware components and software development. Accentuated subjects are the star catalogues, and centroiding algorithm used to identify the stars on the zenithal star field. During the test observations of Digital Zenith Camera System performed between 2013-2016, final results were calculated using the PSF method for star centroiding, and the second USNO CCD Astrograph Catalogue (UCAC2) for the reference star positions. This study aims to investigate the position accuracy of the star images by comparing different centroiding algorithms and available star catalogs used in astro-geodetic observations conducted with the digital zenith camera system.

Hybridized centroid technique for 3D Molodensky-Badekas ...

African Journals Online (AJOL)

In view of this, the present study developed and tested two new hybrid centroid techniques known as the harmonic-quadratic mean and arithmetic-quadratic mean centroids. The proposed hybrid approaches were compared with the geometric mean, harmonic mean, median, quadratic mean and arithmetic mean. In addition ...

Optimisation of centroiding algorithms for photon event counting imaging

International Nuclear Information System (INIS)

Suhling, K.; Airey, R.W.; Morgan, B.L.

1999-01-01

Approaches to photon event counting imaging in which the output events of an image intensifier are located using a centroiding technique have long been plagued by fixed pattern noise in which a grid of dimensions similar to those of the CCD pixels is superimposed on the image. This is caused by a mismatch between the photon event shape and the centroiding algorithm. We have used hyperbolic cosine, Gaussian, Lorentzian, parabolic as well as 3-, 5-, and 7-point centre of gravity algorithms, and hybrids thereof, to assess means of minimising this fixed pattern noise. We show that fixed pattern noise generated by the widely used centre of gravity centroiding is due to intrinsic features of the algorithm. Our results confirm that the recently proposed use of Gaussian centroiding does indeed show a significant reduction of fixed pattern noise compared to centre of gravity centroiding (Michel et al., Mon. Not. R. Astron. Soc. 292 (1997) 611-620). However, the disadvantage of a Gaussian algorithm is a centroiding failure for small pulses, caused by a division by zero, which leads to a loss of detective quantum efficiency (DQE) and to small amounts of residual fixed pattern noise. Using both real data from an image intensifier system employing a progressive scan camera, framegrabber and PC, and also synthetic data from Monte-Carlo simulations, we find that hybrid centroiding algorithms can reduce the fixed pattern noise without loss of resolution or loss of DQE. Imaging a test pattern to assess the features of the different algorithms shows that a hybrid of Gaussian and 3-point centre of gravity centroiding algorithms results in an optimum combination of low fixed pattern noise (lower than a simple Gaussian), high DQE, and high resolution. The Lorentzian algorithm gives the worst results in terms of high fixed pattern noise and low resolution, and the Gaussian and hyperbolic cosine algorithms have the lowest DQEs

Method ranks competing projects by priorities, risk

International Nuclear Information System (INIS)

Moeckel, D.R.

1993-01-01

A practical, objective guide for ranking projects based on risk-based priorities has been developed by Sun Pipe Line Co. The deliberately simple system guides decisions on how to allocate scarce company resources because all managers employ the same criteria in weighing potential risks to the company versus benefits. Managers at all levels are continuously having to comply with an ever growing amount of legislative and regulatory requirements while at the same time trying to run their businesses effectively. The system primarily is designed for use as a compliance oversight and tracking process to document, categorize, and follow-up on work concerning various issues or projects. That is, the system consists of an electronic database which is updated periodically, and is used by various levels of management to monitor progress of health, safety, environmental and compliance-related projects. Criteria used in determining a risk factor and assigning a priority also have been adapted and found useful for evaluating other types of projects. The process enables management to better define potential risks and/or loss of benefits that are being accepted when a project is rejected from an immediate work plan or budget. In times of financial austerity, it is extremely important that the right decisions are made at the right time

A Hybridized Centroid Technique for 3D Molodensky-Badekas ...

African Journals Online (AJOL)

Richannan

the same point in a second reference frame (Ghilani, 2010). ... widely used approach by most researchers to compute values of centroid coordinates in the ... choice of centroid method on the Veis model has been investigated by Ziggah et al.

Noise in position measurement by centroid calculation

International Nuclear Information System (INIS)

Volkov, P.

1996-01-01

The position of a particle trajectory in a gaseous (or semiconductor) detector can be measured by calculating the centroid of the induced charge on the cathode plane. The charge amplifiers attached to each cathode strip introduce noise which is added to the signal. This noise broadens the position resolution line. Our article gives an analytical tool to estimate the resolution broadening due to the noise per strip and the number of strips involved in the centroid calculation. It is shown that the position resolution increases faster than the square root of the number of strips involved. We also consider the consequence of added interstrip capacitors, intended to diminish the differential nonlinearity. It is shown that the position error increases slower than linearly with the interstrip capacities, due to the cancellation of correlated noise. The estimation we give, can be applied to calculations of position broadening other than the centroid finding. (orig.)

Customer Ranking Model for Project Businesses: A Case Study from the Automotive Industry

Directory of Open Access Journals (Sweden)

Bernd Markus Zunk

2014-03-01

Full Text Available For technology-orientated enterprises that operate project-based businesses, the goal-oriented allocation of scarce marketing resources has great potential to help consolidate their competitive position. An important precondition for goal-oriented management is the identification of the most valuable customers. This enables technology-orientated enterprises to segment markets in order to make tactical marketing decisions. This theorybased paper aims to develop and test a holistic customer ranking model. By deploying the five steps presented in this paper, customer relationship managers are better able to identify and to rank their customers in project-based businesses. A case study provides an example of the application of the method from the automotive industry in Austria. The experiences derived from this case study show that using a customer ranking framework is a crucial factor for enterprises in narrow technology markets to be successful and to achieve their corporate goals.

A focal plane metrology system and PSF centroiding experiment

Science.gov (United States)

Li, Haitao; Li, Baoquan; Cao, Yang; Li, Ligang

2016-10-01

In this paper, we present an overview of a detector array equipment metrology testbed and a micro-pixel centroiding experiment currently under development at the National Space Science Center, Chinese Academy of Sciences. We discuss on-going development efforts aimed at calibrating the intra-/inter-pixel quantum efficiency and pixel positions for scientific grade CMOS detector, and review significant progress in achieving higher precision differential centroiding for pseudo star images in large area back-illuminated CMOS detector. Without calibration of pixel positions and intrapixel response, we have demonstrated that the standard deviation of differential centroiding is below 2.0e-3 pixels.

Accurate Alignment of Plasma Channels Based on Laser Centroid Oscillations

International Nuclear Information System (INIS)

Gonsalves, Anthony; Nakamura, Kei; Lin, Chen; Osterhoff, Jens; Shiraishi, Satomi; Schroeder, Carl; Geddes, Cameron; Toth, Csaba; Esarey, Eric; Leemans, Wim

2011-01-01

A technique has been developed to accurately align a laser beam through a plasma channel by minimizing the shift in laser centroid and angle at the channel outptut. If only the shift in centroid or angle is measured, then accurate alignment is provided by minimizing laser centroid motion at the channel exit as the channel properties are scanned. The improvement in alignment accuracy provided by this technique is important for minimizing electron beam pointing errors in laser plasma accelerators.

Decision-Oriented Project Ranking for Asset Management System: Rail Net Denmark

DEFF Research Database (Denmark)

Salling, Kim Bang; Moshøj, Claus Rehfeld; Timm, Henrik

2007-01-01

is to apply a modified project ranking methodology: Asset Management System Priority Module (AMS-PM), which is a practical tool for assessing and ranking various project proposals in a straightforward manner. The methodology is set-out by a multi-criteria approach where weights are applied ultimately...... resulting in priority indices for the state-of-repair data. This paper is disposed as follows; firstly, a description of the Asset Management system is set-up including an overview of the state-of-repair data and the case study. Secondly, is the AMS-PM software model implemented through an exploratory case......The Danish rail net operator, Rail Net Denmark, has through the past years built up an Asset Management system, containing a certain percentile of all the company’s assets. This paper contains an elaborate overview on how to strengthen the system seen from a decision-support perspective. The focus...

Selection of suitable e-learning approach using TOPSIS technique with best ranked criteria weights

Science.gov (United States)

Mohammed, Husam Jasim; Kasim, Maznah Mat; Shaharanee, Izwan Nizal Mohd

2017-11-01

This paper compares the performances of four rank-based weighting assessment techniques, Rank Sum (RS), Rank Reciprocal (RR), Rank Exponent (RE), and Rank Order Centroid (ROC) on five identified e-learning criteria to select the best weights method. A total of 35 experts in a public university in Malaysia were asked to rank the criteria and to evaluate five e-learning approaches which include blended learning, flipped classroom, ICT supported face to face learning, synchronous learning, and asynchronous learning. The best ranked criteria weights are defined as weights that have the least total absolute differences with the geometric mean of all weights, were then used to select the most suitable e-learning approach by using TOPSIS method. The results show that RR weights are the best, while flipped classroom approach implementation is the most suitable approach. This paper has developed a decision framework to aid decision makers (DMs) in choosing the most suitable weighting method for solving MCDM problems.

Comparison of performance of some common Hartmann-Shack centroid estimation methods

Science.gov (United States)

Thatiparthi, C.; Ommani, A.; Burman, R.; Thapa, D.; Hutchings, N.; Lakshminarayanan, V.

2016-03-01

The accuracy of the estimation of optical aberrations by measuring the distorted wave front using a Hartmann-Shack wave front sensor (HSWS) is mainly dependent upon the measurement accuracy of the centroid of the focal spot. The most commonly used methods for centroid estimation such as the brightest spot centroid; first moment centroid; weighted center of gravity and intensity weighted center of gravity, are generally applied on the entire individual sub-apertures of the lens let array. However, these processes of centroid estimation are sensitive to the influence of reflections, scattered light, and noise; especially in the case where the signal spot area is smaller compared to the whole sub-aperture area. In this paper, we give a comparison of performance of the commonly used centroiding methods on estimation of optical aberrations, with and without the use of some pre-processing steps (thresholding, Gaussian smoothing and adaptive windowing). As an example we use the aberrations of the human eye model. This is done using the raw data collected from a custom made ophthalmic aberrometer and a model eye to emulate myopic and hyper-metropic defocus values up to 2 Diopters. We show that the use of any simple centroiding algorithm is sufficient in the case of ophthalmic applications for estimating aberrations within the typical clinically acceptable limits of a quarter Diopter margins, when certain pre-processing steps to reduce the impact of external factors are used.

Statistical analysis of x-ray stress measurement by centroid method

International Nuclear Information System (INIS)

Kurita, Masanori; Amano, Jun; Sakamoto, Isao

1982-01-01

The X-ray technique allows a nondestructive and rapid measurement of residual stresses in metallic materials. The centroid method has an advantage over other X-ray methods in that it can determine the angular position of a diffraction line, from which the stress is calculated, even with an asymmetrical line profile. An equation for the standard deviation of the angular position of a diffraction line, σsub(p), caused by statistical fluctuation was derived, which is a fundamental source of scatter in X-ray stress measurements. This equation shows that an increase of X-ray counts by a factor of k results in a decrease of σsub(p) by a factor of 1/√k. It also shows that σsub(p) increases rapidly as the angular range used in calculating the centroid increases. It is therefore important to calculate the centroid using the narrow angular range between the two ends of the diffraction line where it starts to deviate from the straight background line. By using quenched structural steels JIS S35C and S45C, the residual stresses and their standard deviations were calculated by the centroid, parabola, Gaussian curve, and half-width methods, and the results were compared. The centroid of a diffraction line was affected greatly by the background line used. The standard deviation of the stress measured by the centroid method was found to be the largest among the four methods. (author)

Plasma Channel Diagnostic Based on Laser Centroid Oscillations

International Nuclear Information System (INIS)

Gonsalves, Anthony; Nakamura, Kei; Lin, Chen; Osterhoff, Jens; Shiraishi, Satomi; Schroeder, Carl; Geddes, Cameron; Toth, Csaba; Esarey, Eric; Leemans, Wim

2010-01-01

A technique has been developed for measuring the properties of discharge-based plasma channels by monitoring the centroid location of a laser beam exiting the channel as a function of input alignment offset between the laser and the channel. The centroid position of low-intensity ( 14 Wcm -2 ) laser pulses focused at the input of a hydrogen-filled capillary discharge waveguide was scanned and the exit positions recorded to determine the channel shape and depth with an accuracy of a few %. In addition, accurate alignment of the laser beam through the plasma channel can be provided by minimizing laser centroid motion at the channel exit as the channel depth is scanned either by scanning the plasma density or the discharge timing. The improvement in alignment accuracy provided by this technique will be crucial for minimizing electron beam pointing errors in laser plasma accelerators.

Centroids of effective interactions from measured single-particle energies: An application

International Nuclear Information System (INIS)

Cole, B.J.

1990-01-01

Centroids of the effective nucleon-nucleon interaction for the mass region A=28--64 are extracted directly from experimental single-particle spectra, by comparing single-particle energies relative to different cores. Uncertainties in the centroids are estimated at approximately 100 keV, except in cases of exceptional fragmentation of the single-particle strength. The use of a large number of inert cores allows the dependence of the interaction on mass or model space to be investigated. The method permits accurate empirical modifications to be made to realistic interactions calculated from bare nucleon-nucleon potentials, which are known to possess defective centroids in many cases. In addition, the centroids can be used as input to the more sophisticated fitting procedures that are employed to produce matrix elements of the effective interaction

Risk-informed ranking of engineering projects

International Nuclear Information System (INIS)

Jyrkama, M.; Pandey, M.

2011-01-01

Refurbishment planning requires prudent investment decisions with respect to the various systems and components at the station. These decisions are influenced by many factors, including engineering, safety, regulatory, economic, and political constraints. From an engineering perspective, the concept of cost-benefit analysis is a common way to allocate capital among various projects. Naturally, the 'best' or optimal project should have the lowest cost and the highest benefit. In the context of risk-informed decision making (RIDM), a process that has been widely embraced by the global nuclear community, the costs and benefits must further be 'weighted' by probabilities to estimate the underlying risk associated with the various planning alternatives. The main purpose of this study is to illustrate how risk and reliability information can be integrated into the refurbishment planning process to facilitate more objective and transparent investment decisions. The methodology is based on the concept of generation risk assessment (GRA) which provides a systematic approach for balancing investment costs with the reduction in overall financial risk. In addition to reliability predictions, the model provides estimates for the level of risk reduction associated with each system/project and also the break-even point for investment. This information is vital for project ranking, and helps to address the key question of whether capital investment should be made in the most risk critical systems, or in systems that reduce the overall risk the most. The application of the proposed methodology requires only basic information regarding the current reliability of each engineering system, which should be readily available from plant records and routine condition assessments. Because the methodology can be readily implemented in a Microsoft Excel spreadsheet, all plausible (e.g., bounding) planning scenarios, with or without investment, can also be generated quickly and easily, while

A quantum generalization of intrinsic reaction coordinate using path integral centroid coordinates

International Nuclear Information System (INIS)

Shiga, Motoyuki; Fujisaki, Hiroshi

2012-01-01

We propose a generalization of the intrinsic reaction coordinate (IRC) for quantum many-body systems described in terms of the mass-weighted ring polymer centroids in the imaginary-time path integral theory. This novel kind of reaction coordinate, which may be called the ''centroid IRC,'' corresponds to the minimum free energy path connecting reactant and product states with a least amount of reversible work applied to the center of masses of the quantum nuclei, i.e., the centroids. We provide a numerical procedure to obtain the centroid IRC based on first principles by combining ab initio path integral simulation with the string method. This approach is applied to NH 3 molecule and N 2 H 5 - ion as well as their deuterated isotopomers to study the importance of nuclear quantum effects in the intramolecular and intermolecular proton transfer reactions. We find that, in the intramolecular proton transfer (inversion) of NH 3 , the free energy barrier for the centroid variables decreases with an amount of about 20% compared to the classical one at the room temperature. In the intermolecular proton transfer of N 2 H 5 - , the centroid IRC is largely deviated from the ''classical'' IRC, and the free energy barrier is reduced by the quantum effects even more drastically.

AN EXCEL-BASED DECISION SUPPORT SYSTEM FOR SCORING AND RANKING PROPOSED R&D PROJECTS

OpenAIRE

ANNE DE PIANTE HENRIKSEN; SUSAN W. PALOCSAY

2008-01-01

One of the most challenging aspects of technology management is the selection of research and development (R&D) projects from among a group of proposals. This paper introduces an interactive, user-friendly decision support system for evaluating and ranking R&D projects and demonstrates its application on an example R&D program. It employs the scoring methodology developed by Henriksen and Traynor to provide a practical technique that considers both project merit and project cost in the evalua...

Implementation of the Centroid Method for the Correction of Turbulence

Directory of Open Access Journals (Sweden)

Enric Meinhardt-Llopis

2014-07-01

Full Text Available The centroid method for the correction of turbulence consists in computing the Karcher-Fréchet mean of the sequence of input images. The direction of deformation between a pair of images is determined by the optical flow. A distinguishing feature of the centroid method is that it can produce useful results from an arbitrarily small set of input images.

Radiographic measures of thoracic kyphosis in osteoporosis: Cobb and vertebral centroid angles

International Nuclear Information System (INIS)

Briggs, A.M.; Greig, A.M.; Wrigley, T.V.; Tully, E.A.; Adams, P.E.; Bennell, K.L.

2007-01-01

Several measures can quantify thoracic kyphosis from radiographs, yet their suitability for people with osteoporosis remains uncertain. The aim of this study was to examine the validity and reliability of the vertebral centroid and Cobb angles in people with osteoporosis. Lateral radiographs of the thoracic spine were captured in 31 elderly women with osteoporosis. Thoracic kyphosis was measured globally (T1-T12) and regionally (T4-T9) using Cobb and vertebral centroid angles. Multisegmental curvature was also measured by fitting polynomial functions to the thoracic curvature profile. Canonical and Pearson correlations were used to examine correspondence; agreement between measures was examined with linear regression. Moderate to high intra- and inter-rater reliability was achieved (SEM = 0.9-4.0 ). Concurrent validity of the simple measures was established against multisegmental curvature (r = 0.88-0.98). Strong association was observed between the Cobb and centroid angles globally (r = 0.84) and regionally (r 0.83). Correspondence between measures was moderate for the Cobb method (r 0.72), yet stronger for the centroid method (r = 0.80). The Cobb angle was 20% greater for regional measures due to the influence of endplate tilt. Regional Cobb and centroid angles are valid and reliable measures of thoracic kyphosis in people with osteoporosis. However, the Cobb angle is biased by endplate tilt, suggesting that the centroid angle is more appropriate for this population. (orig.)

Radiographic measures of thoracic kyphosis in osteoporosis: Cobb and vertebral centroid angles

Energy Technology Data Exchange (ETDEWEB)

Briggs, A.M.; Greig, A.M. [University of Melbourne, Centre for Health, Exercise and Sports Medicine, School of Physiotherapy, Victoria (Australia); University of Melbourne, Department of Medicine, Royal Melbourne Hospital, Victoria (Australia); Wrigley, T.V.; Tully, E.A.; Adams, P.E.; Bennell, K.L. [University of Melbourne, Centre for Health, Exercise and Sports Medicine, School of Physiotherapy, Victoria (Australia)

2007-08-15

Several measures can quantify thoracic kyphosis from radiographs, yet their suitability for people with osteoporosis remains uncertain. The aim of this study was to examine the validity and reliability of the vertebral centroid and Cobb angles in people with osteoporosis. Lateral radiographs of the thoracic spine were captured in 31 elderly women with osteoporosis. Thoracic kyphosis was measured globally (T1-T12) and regionally (T4-T9) using Cobb and vertebral centroid angles. Multisegmental curvature was also measured by fitting polynomial functions to the thoracic curvature profile. Canonical and Pearson correlations were used to examine correspondence; agreement between measures was examined with linear regression. Moderate to high intra- and inter-rater reliability was achieved (SEM = 0.9-4.0 ). Concurrent validity of the simple measures was established against multisegmental curvature (r = 0.88-0.98). Strong association was observed between the Cobb and centroid angles globally (r = 0.84) and regionally (r = 0.83). Correspondence between measures was moderate for the Cobb method (r = 0.72), yet stronger for the centroid method (r = 0.80). The Cobb angle was 20% greater for regional measures due to the influence of endplate tilt. Regional Cobb and centroid angles are valid and reliable measures of thoracic kyphosis in people with osteoporosis. However, the Cobb angle is biased by endplate tilt, suggesting that the centroid angle is more appropriate for this population. (orig.)

Major shell centroids in the symplectic collective model

International Nuclear Information System (INIS)

Draayer, J.P.; Rosensteel, G.; Tulane Univ., New Orleans, LA

1983-01-01

Analytic expressions are given for the major shell centroids of the collective potential V(#betta#, #betta#) and the shape observable #betta# 2 in the Sp(3,R) symplectic model. The tools of statistical spectroscopy are shown to be useful, firstly, in translating a requirement that the underlying shell structure be preserved into constraints on the parameters of the collective potential and, secondly, in giving a reasonable estimate for a truncation of the infinite dimensional symplectic model space from experimental B(E2) transition strengths. Results based on the centroid information are shown to compare favorably with results from exact calculations in the case of 20 Ne. (orig.)

Study on Zero-Doppler Centroid Control for GEO SAR Ground Observation

Directory of Open Access Journals (Sweden)

Yicheng Jiang

2014-01-01

Full Text Available In geosynchronous Earth orbit SAR (GEO SAR, Doppler centroid compensation is a key step for imaging process, which could be performed by the attitude steering of a satellite platform. However, this zero-Doppler centroid control method does not work well when the look angle of radar is out of an expected range. This paper primarily analyzes the Doppler properties of GEO SAR in the Earth rectangular coordinate. Then, according to the actual conditions of the GEO SAR ground observation, the effective range is presented by the minimum and maximum possible look angles which are directly related to the orbital parameters. Based on the vector analysis, a new approach for zero-Doppler centroid control in GEO SAR, performing the attitude steering by a combination of pitch and roll rotation, is put forward. This approach, considering the Earth’s rotation and elliptical orbit effects, can accurately reduce the residual Doppler centroid. All the simulation results verify the correctness of the range of look angle and the proposed steering method.

The effect of event shape on centroiding in photon counting detectors

International Nuclear Information System (INIS)

Kawakami, Hajime; Bone, David; Fordham, John; Michel, Raul

1994-01-01

High resolution, CCD readout, photon counting detectors employ simple centroiding algorithms for defining the spatial position of each detected event. The accuracy of centroiding is very dependent upon a number of parameters including the profile, energy and width of the intensified event. In this paper, we provide an analysis of how the characteristics of an intensified event change as the input count rate increases and the consequent effect on centroiding. The changes in these parameters are applied in particular to the MIC photon counting detector developed at UCL for ground and space based astronomical applications. This detector has a maximum format of 3072x2304 pixels permitting its use in the highest resolution applications. Individual events, at light level from 5 to 1000k events/s over the detector area, were analysed. It was found that both the asymmetry and width of event profiles were strongly dependent upon the energy of the intensified event. The variation in profile then affected the centroiding accuracy leading to loss of resolution. These inaccuracies have been quantified for two different 3 CCD pixel centroiding algorithms and one 2 pixel algorithm. The results show that a maximum error of less than 0.05 CCD pixel occurs with the 3 pixel algorithms and 0.1 CCD pixel for the 2 pixel algorithm. An improvement is proposed by utilising straight pore MCPs in the intensifier and a 70 μm air gap in front of the CCD. ((orig.))

Automatic centroid detection and surface measurement with a digital Shack–Hartmann wavefront sensor

International Nuclear Information System (INIS)

Yin, Xiaoming; Zhao, Liping; Li, Xiang; Fang, Zhongping

2010-01-01

With the breakthrough of manufacturing technologies, the measurement of surface profiles is becoming a big issue. A Shack–Hartmann wavefront sensor (SHWS) provides a promising technology for non-contact surface measurement with a number of advantages over interferometry. The SHWS splits the incident wavefront into many subsections and transfers the distorted wavefront detection into the centroid measurement. So the accuracy of the centroid measurement determines the accuracy of the SHWS. In this paper, we have presented a new centroid measurement algorithm based on an adaptive thresholding and dynamic windowing method by utilizing image-processing techniques. Based on this centroid detection method, we have developed a digital SHWS system which can automatically detect centroids of focal spots, reconstruct the wavefront and measure the 3D profile of the surface. The system has been tested with various simulated and real surfaces such as flat surfaces, spherical and aspherical surfaces as well as deformable surfaces. The experimental results demonstrate that the system has good accuracy, repeatability and immunity to optical misalignment. The system is also suitable for on-line applications of surface measurement

Photon counting imaging and centroiding with an electron-bombarded CCD using single molecule localisation software

International Nuclear Information System (INIS)

Hirvonen, Liisa M.; Barber, Matthew J.; Suhling, Klaus

2016-01-01

Photon event centroiding in photon counting imaging and single-molecule localisation in super-resolution fluorescence microscopy share many traits. Although photon event centroiding has traditionally been performed with simple single-iteration algorithms, we recently reported that iterative fitting algorithms originally developed for single-molecule localisation fluorescence microscopy work very well when applied to centroiding photon events imaged with an MCP-intensified CMOS camera. Here, we have applied these algorithms for centroiding of photon events from an electron-bombarded CCD (EBCCD). We find that centroiding algorithms based on iterative fitting of the photon events yield excellent results and allow fitting of overlapping photon events, a feature not reported before and an important aspect to facilitate an increased count rate and shorter acquisition times.

Research on Centroid Position for Stairs Climbing Stability of Search and Rescue Robot

Directory of Open Access Journals (Sweden)

Yan Guo

2011-01-01

Full Text Available This paper represents the relationship between the stability of stairs climbing and the centroid position of the search and rescue robot. The robot system is considered as a mass point-plane model and the kinematics features are analyzed to find the relationship between centroid position and the maximal pitch angle of stairs the robot could climb up. A computable function about this relationship is given in this paper. During the stairs climbing, there is a maximal stability-keeping angle depends on the centroid position and the pitch angle of stairs, and the numerical formula is developed about the relationship between the maximal stability-keeping angle and the centroid position and pitch angle of stairs. The experiment demonstrates the trustworthy and correction of the method in the paper.

Intraoperative cyclorotation and pupil centroid shift during LASIK and PRK.

Science.gov (United States)

Narváez, Julio; Brucks, Matthew; Zimmerman, Grenith; Bekendam, Peter; Bacon, Gregory; Schmid, Kristin

2012-05-01

To determine the degree of cyclorotation and centroid shift in the x and y axis that occurs intraoperatively during LASIK and photorefractive keratectomy (PRK). Intraoperative cyclorotation and centroid shift were measured in 63 eyes from 34 patients with a mean age of 34 years (range: 20 to 56 years) undergoing either LASIK or PRK. Preoperatively, an iris image of each eye was obtained with the VISX WaveScan Wavefront System (Abbott Medical Optics Inc) with iris registration. A VISX Star S4 (Abbott Medical Optics Inc) laser was later used to measure cyclotorsion and pupil centroid shift at the beginning of the refractive procedure and after flap creation or epithelial removal. The mean change in intraoperative cyclorotation was 1.48±1.11° in LASIK eyes and 2.02±2.63° in PRK eyes. Cyclorotation direction changed by >2° in 21% of eyes after flap creation in LASIK and in 32% of eyes after epithelial removal in PRK. The respective mean intraoperative shift in the x axis and y axis was 0.13±0.15 mm and 0.17±0.14 mm, respectively, in LASIK eyes, and 0.09±0.07 mm and 0.10±0.13 mm, respectively, in PRK eyes. Intraoperative centroid shifts >100 μm in either the x axis or y axis occurred in 71% of LASIK eyes and 55% of PRK eyes. Significant changes in cyclotorsion and centroid shifts were noted prior to surgery as well as intraoperatively with both LASIK and PRK. It may be advantageous to engage iris registration immediately prior to ablation to provide a reference point representative of eye position at the initiation of laser delivery. Copyright 2012, SLACK Incorporated.

Centroid vetting of transiting planet candidates from the Next Generation Transit Survey

Science.gov (United States)

Günther, Maximilian N.; Queloz, Didier; Gillen, Edward; McCormac, James; Bayliss, Daniel; Bouchy, Francois; Walker, Simon. R.; West, Richard G.; Eigmüller, Philipp; Smith, Alexis M. S.; Armstrong, David J.; Burleigh, Matthew; Casewell, Sarah L.; Chaushev, Alexander P.; Goad, Michael R.; Grange, Andrew; Jackman, James; Jenkins, James S.; Louden, Tom; Moyano, Maximiliano; Pollacco, Don; Poppenhaeger, Katja; Rauer, Heike; Raynard, Liam; Thompson, Andrew P. G.; Udry, Stéphane; Watson, Christopher A.; Wheatley, Peter J.

2017-11-01

The Next Generation Transit Survey (NGTS), operating in Paranal since 2016, is a wide-field survey to detect Neptunes and super-Earths transiting bright stars, which are suitable for precise radial velocity follow-up and characterization. Thereby, its sub-mmag photometric precision and ability to identify false positives are crucial. Particularly, variable background objects blended in the photometric aperture frequently mimic Neptune-sized transits and are costly in follow-up time. These objects can best be identified with the centroiding technique: if the photometric flux is lost off-centre during an eclipse, the flux centroid shifts towards the centre of the target star. Although this method has successfully been employed by the Kepler mission, it has previously not been implemented from the ground. We present a fully automated centroid vetting algorithm developed for NGTS, enabled by our high-precision autoguiding. Our method allows detecting centroid shifts with an average precision of 0.75 milli-pixel (mpix), and down to 0.25 mpix for specific targets, for a pixel size of 4.97 arcsec. The algorithm is now part of the NGTS candidate vetting pipeline and automatically employed for all detected signals. Further, we develop a joint Bayesian fitting model for all photometric and centroid data, allowing to disentangle which object (target or background) is causing the signal, and what its astrophysical parameters are. We demonstrate our method on two NGTS objects of interest. These achievements make NGTS the first ground-based wide-field transit survey ever to successfully apply the centroiding technique for automated candidate vetting, enabling the production of a robust candidate list before follow-up.

Combined centroid-envelope dynamics of intense, magnetically focused charged beams surrounded by conducting walls

International Nuclear Information System (INIS)

Fiuza, K.; Rizzato, F.B.; Pakter, R.

2006-01-01

In this paper we analyze the combined envelope-centroid dynamics of magnetically focused high-intensity charged beams surrounded by conducting walls. Similar to the case where conducting walls are absent, it is shown that the envelope and centroid dynamics decouple from each other. Mismatched envelopes still decay into equilibrium with simultaneous emittance growth, but the centroid keeps oscillating with no appreciable energy loss. Some estimates are performed to analytically obtain characteristics of halo formation seen in the full simulations

Adaptive thresholding and dynamic windowing method for automatic centroid detection of digital Shack-Hartmann wavefront sensor

International Nuclear Information System (INIS)

Yin Xiaoming; Li Xiang; Zhao Liping; Fang Zhongping

2009-01-01

A Shack-Hartmann wavefront sensor (SWHS) splits the incident wavefront into many subsections and transfers the distorted wavefront detection into the centroid measurement. The accuracy of the centroid measurement determines the accuracy of the SWHS. Many methods have been presented to improve the accuracy of the wavefront centroid measurement. However, most of these methods are discussed from the point of view of optics, based on the assumption that the spot intensity of the SHWS has a Gaussian distribution, which is not applicable to the digital SHWS. In this paper, we present a centroid measurement algorithm based on the adaptive thresholding and dynamic windowing method by utilizing image processing techniques for practical application of the digital SHWS in surface profile measurement. The method can detect the centroid of each focal spot precisely and robustly by eliminating the influence of various noises, such as diffraction of the digital SHWS, unevenness and instability of the light source, as well as deviation between the centroid of the focal spot and the center of the detection area. The experimental results demonstrate that the algorithm has better precision, repeatability, and stability compared with other commonly used centroid methods, such as the statistical averaging, thresholding, and windowing algorithms.

Ambiguity Of Doppler Centroid In Synthetic-Aperture Radar

Science.gov (United States)

Chang, Chi-Yung; Curlander, John C.

1991-01-01

Paper discusses performances of two algorithms for resolution of ambiguity in estimated Doppler centroid frequency of echoes in synthetic-aperture radar. One based on range-cross-correlation technique, other based on multiple-pulse-repetition-frequency technique.

Finger vein identification using fuzzy-based k-nearest centroid neighbor classifier

Science.gov (United States)

Rosdi, Bakhtiar Affendi; Jaafar, Haryati; Ramli, Dzati Athiar

2015-02-01

In this paper, a new approach for personal identification using finger vein image is presented. Finger vein is an emerging type of biometrics that attracts attention of researchers in biometrics area. As compared to other biometric traits such as face, fingerprint and iris, finger vein is more secured and hard to counterfeit since the features are inside the human body. So far, most of the researchers focus on how to extract robust features from the captured vein images. Not much research was conducted on the classification of the extracted features. In this paper, a new classifier called fuzzy-based k-nearest centroid neighbor (FkNCN) is applied to classify the finger vein image. The proposed FkNCN employs a surrounding rule to obtain the k-nearest centroid neighbors based on the spatial distributions of the training images and their distance to the test image. Then, the fuzzy membership function is utilized to assign the test image to the class which is frequently represented by the k-nearest centroid neighbors. Experimental evaluation using our own database which was collected from 492 fingers shows that the proposed FkNCN has better performance than the k-nearest neighbor, k-nearest-centroid neighbor and fuzzy-based-k-nearest neighbor classifiers. This shows that the proposed classifier is able to identify the finger vein image effectively.

Feature Subset Selection and Instance Filtering for Cross-project Defect Prediction - Classification and Ranking

Directory of Open Access Journals (Sweden)

Faimison Porto

2016-12-01

Full Text Available The defect prediction models can be a good tool on organizing the project's test resources. The models can be constructed with two main goals: 1 to classify the software parts - defective or not; or 2 to rank the most defective parts in a decreasing order. However, not all companies maintain an appropriate set of historical defect data. In this case, a company can build an appropriate dataset from known external projects - called Cross-project Defect Prediction (CPDP. The CPDP models, however, present low prediction performances due to the heterogeneity of data. Recently, Instance Filtering methods were proposed in order to reduce this heterogeneity by selecting the most similar instances from the training dataset. Originally, the similarity is calculated based on all the available dataset features (or independent variables. We propose that using only the most relevant features on the similarity calculation can result in more accurate filtered datasets and better prediction performances. In this study we extend our previous work. We analyse both prediction goals - Classification and Ranking. We present an empirical evaluation of 41 different methods by associating Instance Filtering methods with Feature Selection methods. We used 36 versions of 11 open source projects on experiments. The results show similar evidences for both prediction goals. First, the defect prediction performance of CPDP models can be improved by associating Feature Selection and Instance Filtering. Second, no evaluated method presented general better performances. Indeed, the most appropriate method can vary according to the characteristics of the project being predicted.

The efficiency of the centroid method compared to a simple average

DEFF Research Database (Denmark)

Eskildsen, Jacob Kjær; Kristensen, Kai; Nielsen, Rikke

Based on empirical data as well as a simulation study this paper gives recommendations with respect to situations wheere a simple avarage of the manifest indicators can be used as a close proxy for the centroid method and when it cannot.......Based on empirical data as well as a simulation study this paper gives recommendations with respect to situations wheere a simple avarage of the manifest indicators can be used as a close proxy for the centroid method and when it cannot....

A study on the impact of parameter uncertainty on the emission-based ranking of transportation projects.

Science.gov (United States)

2014-01-01

With the growing concern with air quality levels and, hence, the livability of urban regions in the nation, it has become increasingly common to incorporate vehicular emission considerations in the ranking of transportation projects. Network assignme...

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.

Optimizing the calculation of point source count-centroid in pixel size measurement

International Nuclear Information System (INIS)

Zhou Luyi; Kuang Anren; Su Xianyu

2004-01-01

Purpose: Pixel size is an important parameter of gamma camera and SPECT. A number of Methods are used for its accurate measurement. In the original count-centroid method, where the image of a point source(PS) is acquired and its count-centroid calculated to represent PS position in the image, background counts are inevitable. Thus the measured count-centroid (Xm) is an approximation of the true count-centroid (Xp) of the PS, i.e. Xm=Xp+(Xb-Xp)/(1+Rp/Rb), where Rp is the net counting rate of the PS, Xb the background count-centroid and Rb the background counting rate. To get accurate measurement, Rp must be very big, which is unpractical, resulting in the variation of measured pixel size. Rp-independent calculation of PS count-centroid is desired. Methods: The proposed method attempted to eliminate the effect of the term (Xb-Xp)/(1+Rp/Rb) by bringing Xb closer to Xp and by reducing Rb. In the acquired PS image, a circular ROI was generated to enclose the PS, the pixel with the maximum count being the center of the ROI. To choose the diameter (D) of the ROI, a Gaussian count distribution was assumed for the PS, accordingly, K=I-(0.5)D/R percent of the total PS counts was in the ROI, R being the full width at half maximum of the PS count distribution. D was set to be 6*R to enclose most (K=98.4%) of the PS counts. The count-centroid of the ROI was calculated to represent Xp. The proposed method was tested in measuring the pixel size of a well-tuned SPECT, whose pixel size was estimated to be 3.02 mm according to its mechanical and electronic setting (128*128 matrix, 387 mm UFOV, ZOOM=1). For comparison, the original method, which was use in the former versions of some commercial SPECT software, was also tested. 12 PSs were prepared and their image acquired and stored. The net counting rate of the PSs increased from 10cps to 1183cps. Results: Using the proposed method, the measured pixel size (in mm) varied only between 3.00 and 3.01( mean= 3.01±0.00) as Rp increased

Networks and centroid metrics for understanding football | Gama ...

African Journals Online (AJOL)

This study aimedto verifythe network of contacts resulting from the collective behaviour of professional football teams through the centroid method and networks as well, therebyproviding detailed information about the match to coaches and sport analysts. For this purpose, 999 collective attacking actions from twoteams were ...

Automatic extraction of nuclei centroids of mouse embryonic cells from fluorescence microscopy images.

Directory of Open Access Journals (Sweden)

Md Khayrul Bashar

Full Text Available Accurate identification of cell nuclei and their tracking using three dimensional (3D microscopic images is a demanding task in many biological studies. Manual identification of nuclei centroids from images is an error-prone task, sometimes impossible to accomplish due to low contrast and the presence of noise. Nonetheless, only a few methods are available for 3D bioimaging applications, which sharply contrast with 2D analysis, where many methods already exist. In addition, most methods essentially adopt segmentation for which a reliable solution is still unknown, especially for 3D bio-images having juxtaposed cells. In this work, we propose a new method that can directly extract nuclei centroids from fluorescence microscopy images. This method involves three steps: (i Pre-processing, (ii Local enhancement, and (iii Centroid extraction. The first step includes two variations: first variation (Variant-1 uses the whole 3D pre-processed image, whereas the second one (Variant-2 modifies the preprocessed image to the candidate regions or the candidate hybrid image for further processing. At the second step, a multiscale cube filtering is employed in order to locally enhance the pre-processed image. Centroid extraction in the third step consists of three stages. In Stage-1, we compute a local characteristic ratio at every voxel and extract local maxima regions as candidate centroids using a ratio threshold. Stage-2 processing removes spurious centroids from Stage-1 results by analyzing shapes of intensity profiles from the enhanced image. An iterative procedure based on the nearest neighborhood principle is then proposed to combine if there are fragmented nuclei. Both qualitative and quantitative analyses on a set of 100 images of 3D mouse embryo are performed. Investigations reveal a promising achievement of the technique presented in terms of average sensitivity and precision (i.e., 88.04% and 91.30% for Variant-1; 86.19% and 95.00% for Variant-2

A variational centroid density procedure for the calculation of transmission coefficients for asymmetric barriers at low temperature

International Nuclear Information System (INIS)

Messina, M.; Schenter, G.K.; Garrett, B.C.

1995-01-01

The low temperature behavior of the centroid density method of Voth, Chandler, and Miller (VCM) [J. Chem. Phys. 91, 7749 (1989)] is investigated for tunneling through a one-dimensional barrier. We find that the bottleneck for a quantum activated process as defined by VCM does not correspond to the classical bottleneck for the case of an asymmetric barrier. If the centroid density is constrained to be at the classical bottleneck for an asymmetric barrier, the centroid density method can give transmission coefficients that are too large by as much as five orders of magnitude. We follow a variational procedure, as suggested by VCM, whereby the best transmission coefficient is found by varying the position of the centroid until the minimum value for this transmission coefficient is obtained. This is a procedure that is readily generalizable to multidimensional systems. We present calculations on several test systems which show that this variational procedure greatly enhances the accuracy of the centroid density method compared to when the centroid is constrained to be at the barrier top. Furthermore, the relation of this procedure to the low temperature periodic orbit or ''instanton'' approach is discussed. copyright 1995 American Institute of Physics

Robustness of regularities for energy centroids in the presence of random interactions

International Nuclear Information System (INIS)

Zhao, Y.M.; Arima, A.; Yoshida, N.; Ogawa, K.; Yoshinaga, N.; Kota, V. K. B.

2005-01-01

In this paper we study energy centroids such as those with fixed spin and isospin and those with fixed irreducible representations for both bosons and fermions, in the presence of random two-body and/or three-body interactions. Our results show that regularities of energy centroids of fixed-spin states reported in earlier works are very robust in these more complicated cases. We suggest that these behaviors might be intrinsic features of quantum many-body systems interacting by random forces

Optimizing the calculation of point source count-centroid in pixel size measurement

International Nuclear Information System (INIS)

Zhou Luyi; Kuang Anren; Su Xianyu

2004-01-01

Pixel size is an important parameter of gamma camera and SPECT. A number of methods are used for its accurate measurement. In the original count-centroid method, where the image of a point source (PS) is acquired and its count-centroid calculated to represent PS position in the image, background counts are inevitable. Thus the measured count-centroid (X m ) is an approximation of the true count-centroid (X p ) of the PS, i.e. X m =X p + (X b -X p )/(1+R p /R b ), where Rp is the net counting rate of the PS, X b the background count-centroid and Rb the background counting. To get accurate measurement, R p must be very big, which is unpractical, resulting in the variation of measured pixel size. R p -independent calculation of PS count-centroid is desired. Methods: The proposed method attempted to eliminate the effect of the term (X b -X p )/(1 + R p /R b ) by bringing X b closer to X p and by reducing R b . In the acquired PS image, a circular ROI was generated to enclose the PS, the pixel with the maximum count being the center of the ROI. To choose the diameter (D) of the ROI, a Gaussian count distribution was assumed for the PS, accordingly, K=1-(0.5) D/R percent of the total PS counts was in the ROI, R being the full width at half maximum of the PS count distribution. D was set to be 6*R to enclose most (K=98.4%) of the PS counts. The count-centroid of the ROI was calculated to represent X p . The proposed method was tested in measuring the pixel size of a well-tuned SPECT, whose pixel size was estimated to be 3.02 mm according to its mechanical and electronic setting (128 x 128 matrix, 387 mm UFOV, ZOOM=1). For comparison, the original method, which was use in the former versions of some commercial SPECT software, was also tested. 12 PSs were prepared and their image acquired and stored. The net counting rate of the PSs increased from 10 cps to 1183 cps. Results: Using the proposed method, the measured pixel size (in mm) varied only between 3.00 and 3.01 (mean

Determination of star bodies from p-centroid bodies

Indian Academy of Sciences (India)

An immediate consequence of the definition of the p-centroid body of K is that for any .... The dual mixed volume ˜V−p(K, L) of star bodies K, L can be defined by d. −p ..... [16] Lindenstrauss J and Milman V D, Local theory of normed spaces and ...

A further investigation of the centroid-to-centroid method for stereotactic lung radiotherapy: A phantom study

International Nuclear Information System (INIS)

Lu, Bo; Samant, Sanjiv; Mittauer, Kathryn; Lee, Soyoung; Huang, Yin; Li, Jonathan; Kahler, Darren; Liu, Chihray

2013-01-01

Purpose: Our previous study [B. Lu et al., “A patient alignment solution for lung SBRT setups based on a deformable registration technique,” Med. Phys. 39(12), 7379–7389 (2012)] proposed a deformable-registration-based patient setup strategy called the centroid-to-centroid (CTC) method, which can perform an accurate alignment of internal-target-volume (ITV) centroids between averaged four-dimensional computed tomography and cone-beam computed tomography (CBCT) images. Scenarios with variations between CBCT and simulation CT caused by irregular breathing and/or tumor change were not specifically considered in the patient study [B. Lu et al., “A patient alignment solution for lung SBRT setups based on a deformable registration technique,” Med. Phys. 39(12), 7379–7389 (2012)] due to the lack of both a sufficiently large patient data sample and a method of tumor tracking. The aim of this study is to thoroughly investigate and compare the impacts of breathing pattern and tumor change on both the CTC and the translation-only (T-only) gray-value mode strategies by employing a four-dimensional (4D) lung phantom.Methods: A sophisticated anthropomorphic 4D phantom (CIRS Dynamic Thorax Phantom model 008) was employed to simulate all desired respiratory variations. The variation scenarios were classified into four groups: inspiration to expiration ratio (IE ratio) change, tumor trajectory change, tumor position change, tumor size change, and the combination of these changes. For each category the authors designed several scenarios to demonstrate the effects of different levels of breathing variation on both of the T-only and the CTC methods. Each scenario utilized 4DCT and CBCT scans. The ITV centroid alignment discrepancies for CTC and T-only were evaluated. The dose-volume-histograms (DVHs) of ITVs for two extreme cases were analyzed.Results: Except for some extreme cases in the combined group, the accuracy of the CTC registration was about 2 mm for all cases for

Empirical Centroid Fictitious Play: An Approach For Distributed Learning In Multi-Agent Games

OpenAIRE

Swenson, Brian; Kar, Soummya; Xavier, Joao

2013-01-01

The paper is concerned with distributed learning in large-scale games. The well-known fictitious play (FP) algorithm is addressed, which, despite theoretical convergence results, might be impractical to implement in large-scale settings due to intense computation and communication requirements. An adaptation of the FP algorithm, designated as the empirical centroid fictitious play (ECFP), is presented. In ECFP players respond to the centroid of all players' actions rather than track and respo...

Non-obtuse Remeshing with Centroidal Voronoi Tessellation

KAUST Repository

Yan, Dongming; Wonka, Peter

2015-01-01

We present a novel remeshing algorithm that avoids triangles with small and triangles with large (obtuse) angles. Our solution is based on an extension to Centroidal Voronoi Tesselation (CVT). We augment the original CVT formulation by a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles. Our results show significant improvements of the remeshing quality over the state of the art.

Non-obtuse Remeshing with Centroidal Voronoi Tessellation

KAUST Repository

Yan, Dongming

2015-12-03

We present a novel remeshing algorithm that avoids triangles with small and triangles with large (obtuse) angles. Our solution is based on an extension to Centroidal Voronoi Tesselation (CVT). We augment the original CVT formulation by a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles. Our results show significant improvements of the remeshing quality over the state of the art.

Ranking as parameter estimation

Czech Academy of Sciences Publication Activity Database

Kárný, Miroslav; Guy, Tatiana Valentine

2009-01-01

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

Determination of star bodies from p-centroid bodies

Indian Academy of Sciences (India)

In this paper, we prove that an origin-symmetric star body is uniquely determined by its -centroid body. Furthermore, using spherical harmonics, we establish a result for non-symmetric star bodies. As an application, we show that there is a unique member of p ⟨ K ⟩ characterized by having larger volume than any other ...

Groundwater contaminant plume ranking

International Nuclear Information System (INIS)

1988-08-01

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

Systematic shifts of evaluated charge centroid for the cathode read-out multiwire proportional chamber

International Nuclear Information System (INIS)

Endo, I.; Kawamoto, T.; Mizuno, Y.; Ohsugi, T.; Taniguchi, T.; Takeshita, T.

1981-01-01

We have investigated the systematic error associtated with the charge centroid evaluation for the cathode read-out multiwire proportional chamber. Correction curves for the systematic error according to six centroid finding algorithms have been obtained by using the charge distribution calculated in a simple electrostatic mode. They have been experimentally examined and proved to be essential for the accurate determination of the irradiated position. (orig.)

Uncertainty Quantification in Earthquake Source Characterization with Probabilistic Centroid Moment Tensor Inversion

Science.gov (United States)

Dettmer, J.; Benavente, R. F.; Cummins, P. R.

2017-12-01

This work considers probabilistic, non-linear centroid moment tensor inversion of data from earthquakes at teleseismic distances. The moment tensor is treated as deviatoric and centroid location is parametrized with fully unknown latitude, longitude, depth and time delay. The inverse problem is treated as fully non-linear in a Bayesian framework and the posterior density is estimated with interacting Markov chain Monte Carlo methods which are implemented in parallel and allow for chain interaction. The source mechanism and location, including uncertainties, are fully described by the posterior probability density and complex trade-offs between various metrics are studied. These include the percent of double couple component as well as fault orientation and the probabilistic results are compared to results from earthquake catalogs. Additional focus is on the analysis of complex events which are commonly not well described by a single point source. These events are studied by jointly inverting for multiple centroid moment tensor solutions. The optimal number of sources is estimated by the Bayesian information criterion to ensure parsimonious solutions. [Supported by NSERC.

Case Study Application of the Biodiversity Security Index to Ranking Feasibility Studies for Ecosystem Restoration Projects of the U.S. Army Corps of Engineers

Science.gov (United States)

2016-04-01

ER D C/ EL C R- 16 -1 Ecosystem Management and Restoration Research Program Case Study Application of the Biodiversity Security Index... Biodiversity Security Index to Ranking Feasibility Studies for Ecosystem Restoration Projects of the U.S. Army Corps of Engineers Richard A. Cole... Biodiversity Security Index (BSI) was applied to 23 project sites ranked for restoration feasibility study annual funding by the U. S. Army Corps of

Fast centroid algorithm for determining the surface plasmon resonance angle using the fixed-boundary method

International Nuclear Information System (INIS)

Zhan, Shuyue; Wang, Xiaoping; Liu, Yuling

2011-01-01

To simplify the algorithm for determining the surface plasmon resonance (SPR) angle for special applications and development trends, a fast method for determining an SPR angle, called the fixed-boundary centroid algorithm, has been proposed. Two experiments were conducted to compare three centroid algorithms from the aspects of the operation time, sensitivity to shot noise, signal-to-noise ratio (SNR), resolution, and measurement range. Although the measurement range of this method was narrower, the other performance indices were all better than the other two centroid methods. This method has outstanding performance, high speed, good conformity, low error and a high SNR and resolution. It thus has the potential to be widely adopted

Noninvasive measurement of cardiopulmonary blood volume: evaluation of the centroid method

International Nuclear Information System (INIS)

Fouad, F.M.; MacIntyre, W.J.; Tarazi, R.C.

1981-01-01

Cardiopulmonary blood volume (CPV) and mean pulmonary transit time (MTT) determined by radionuclide measurements (Tc-99m HSA) were compared with values obtained from simultaneous dye-dilution (DD) studies (indocyanine green). The mean transit time was obtained from radionuclide curves by two methods: the peak-to-peak time and the interval between the two centroids determined from the right and left-ventricular time-concentration curves. Correlation of dye-dilution MTT and peak-to-peak time was significant (r = 0.79, p < 0.001), but its correlation with centroid-derived values was better (r = 0.86, p < 0.001). CPV values (using the centroid method for radionuclide technique) correlated significantly with values derived from dye-dilution curves (r = 0.74, p < 0.001). Discrepancies between the two were greater the more rapid the circulation (r = 0.61, p < 0.01), suggesting that minor inaccuracies of dye-dilution methods, due to positioning or delay of the system, can become magnified in hyperkinetic conditions. The radionuclide method is simple, repeatable, and noninvasive, and it provides simultaneous evaluation of pulmonary and systemic hemodynamics. Further, calculation of the ratio of cardiopulmonary to total blood volume can be used as an index of overall venous distensibility and relocation of intravascular blood volume

Doppler Centroid Estimation for Airborne SAR Supported by POS and DEM

Directory of Open Access Journals (Sweden)

CHENG Chunquan

2015-05-01

Full Text Available It is difficult to estimate the Doppler frequency and modulating rate for airborne SAR by using traditional vector method due to instable flight and complex terrain. In this paper, it is qualitatively analyzed that the impacts of POS, DEM and their errors on airborne SAR Doppler parameters. Then an innovative vector method is presented based on the range-coplanarity equation to estimate the Doppler centroid taking the POS and DEM as auxiliary data. The effectiveness of the proposed method is validated and analyzed via the simulation experiments. The theoretical analysis and experimental results show that the method can be used to estimate the Doppler centroid with high accuracy even in the cases of high relief, instable flight, and large squint SAR.

Performance Analysis of Combined Methods of Genetic Algorithm and K-Means Clustering in Determining the Value of Centroid

Science.gov (United States)

Adya Zizwan, Putra; Zarlis, Muhammad; Budhiarti Nababan, Erna

2017-12-01

The determination of Centroid on K-Means Algorithm directly affects the quality of the clustering results. Determination of centroid by using random numbers has many weaknesses. The GenClust algorithm that combines the use of Genetic Algorithms and K-Means uses a genetic algorithm to determine the centroid of each cluster. The use of the GenClust algorithm uses 50% chromosomes obtained through deterministic calculations and 50% is obtained from the generation of random numbers. This study will modify the use of the GenClust algorithm in which the chromosomes used are 100% obtained through deterministic calculations. The results of this study resulted in performance comparisons expressed in Mean Square Error influenced by centroid determination on K-Means method by using GenClust method, modified GenClust method and also classic K-Means.

Multiple centroid method to evaluate the adaptability of alfalfa genotypes

Directory of Open Access Journals (Sweden)

Moysés Nascimento

2015-02-01

Full Text Available This study aimed to evaluate the efficiency of multiple centroids to study the adaptability of alfalfa genotypes (Medicago sativa L.. In this method, the genotypes are compared with ideotypes defined by the bissegmented regression model, according to the researcher's interest. Thus, genotype classification is carried out as determined by the objective of the researcher and the proposed recommendation strategy. Despite the great potential of the method, it needs to be evaluated under the biological context (with real data. In this context, we used data on the evaluation of dry matter production of 92 alfalfa cultivars, with 20 cuttings, from an experiment in randomized blocks with two repetitions carried out from November 2004 to June 2006. The multiple centroid method proved efficient for classifying alfalfa genotypes. Moreover, it showed no unambiguous indications and provided that ideotypes were defined according to the researcher's interest, facilitating data interpretation.

Establishing the soft and hard tissue area centers (centroids) for the skull and introducing a newnon-anatomical cephalometric line

International Nuclear Information System (INIS)

AlBalkhi, Khalid M; AlShahrani, Ibrahim; AlMadi, Abdulaziz

2008-01-01

The purpose of this study was to demonstrate how to establish the area center (centroid) of both the soft and hard tissues of the outline of the lateral cephalometric skull image, and to introduce the concept of a new non-anatomical centroid line. Lateral cephalometric radiographs, size 12 x 14 inch, of fifty seven adult subjects were selected based on their pleasant, balanced profile, Class I skeletal and dental relationship and no major dental malocclusion or malrelationship. The area centers (centroids) of both soft and hard tissue skull were practically established using a customized software computer program called the m -file . Connecting the two centers introduced the concept of a new non-anatomical soft and hard centroids line. (author)

A physics-motivated Centroidal Voronoi Particle domain decomposition method

Energy Technology Data Exchange (ETDEWEB)

Fu, Lin, E-mail: lin.fu@tum.de; Hu, Xiangyu Y., E-mail: xiangyu.hu@tum.de; Adams, Nikolaus A., E-mail: nikolaus.adams@tum.de

2017-04-15

In this paper, we propose a novel domain decomposition method for large-scale simulations in continuum mechanics by merging the concepts of Centroidal Voronoi Tessellation (CVT) and Voronoi Particle dynamics (VP). The CVT is introduced to achieve a high-level compactness of the partitioning subdomains by the Lloyd algorithm which monotonically decreases the CVT energy. The number of computational elements between neighboring partitioning subdomains, which scales the communication effort for parallel simulations, is optimized implicitly as the generated partitioning subdomains are convex and simply connected with small aspect-ratios. Moreover, Voronoi Particle dynamics employing physical analogy with a tailored equation of state is developed, which relaxes the particle system towards the target partition with good load balance. Since the equilibrium is computed by an iterative approach, the partitioning subdomains exhibit locality and the incremental property. Numerical experiments reveal that the proposed Centroidal Voronoi Particle (CVP) based algorithm produces high-quality partitioning with high efficiency, independently of computational-element types. Thus it can be used for a wide range of applications in computational science and engineering.

A centroid model of species distribution with applications to the Carolina wren Thryothorus ludovicianus and house finch Haemorhous mexicanus in the United States

Science.gov (United States)

Huang, Qiongyu; Sauer, John R.; Swatantran, Anu; Dubayah, Ralph

2016-01-01

Drastic shifts in species distributions are a cause of concern for ecologists. Such shifts pose great threat to biodiversity especially under unprecedented anthropogenic and natural disturbances. Many studies have documented recent shifts in species distributions. However, most of these studies are limited to regional scales, and do not consider the abundance structure within species ranges. Developing methods to detect systematic changes in species distributions over their full ranges is critical for understanding the impact of changing environments and for successful conservation planning. Here, we demonstrate a centroid model for range-wide analysis of distribution shifts using the North American Breeding Bird Survey. The centroid model is based on a hierarchical Bayesian framework which models population change within physiographic strata while accounting for several factors affecting species detectability. Yearly abundance-weighted range centroids are estimated. As case studies, we derive annual centroids for the Carolina wren and house finch in their ranges in the U.S. We further evaluate the first-difference correlation between species’ centroid movement and changes in winter severity, total population abundance. We also examined associations of change in centroids from sub-ranges. Change in full-range centroid movements of Carolina wren significantly correlate with snow cover days (r = −0.58). For both species, the full-range centroid shifts also have strong correlation with total abundance (r = 0.65, and 0.51 respectively). The movements of the full-range centroids of the two species are correlated strongly (up to r = 0.76) with that of the sub-ranges with more drastic population changes. Our study demonstrates the usefulness of centroids for analyzing distribution changes in a two-dimensional spatial context. Particularly it highlights applications that associate the centroid with factors such as environmental stressors, population characteristics

A general centroid determination methodology, with application to multilayer dielectric structures and thermally stimulated current measurements

International Nuclear Information System (INIS)

Miller, S.L.; Fleetwood, D.M.; McWhorter, P.J.; Reber, R.A. Jr.; Murray, J.R.

1993-01-01

A general methodology is developed to experimentally characterize the spatial distribution of occupied traps in dielectric films on a semiconductor. The effects of parasitics such as leakage, charge transport through more than one interface, and interface trap charge are quantitatively addressed. Charge transport with contributions from multiple charge species is rigorously treated. The methodology is independent of the charge transport mechanism(s), and is directly applicable to multilayer dielectric structures. The centroid capacitance, rather than the centroid itself, is introduced as the fundamental quantity that permits the generic analysis of multilayer structures. In particular, the form of many equations describing stacked dielectric structures becomes independent of the number of layers comprising the stack if they are expressed in terms of the centroid capacitance and/or the flatband voltage. The experimental methodology is illustrated with an application using thermally stimulated current (TSC) measurements. The centroid of changes (via thermal emission) in the amount of trapped charge was determined for two different samples of a triple-layer dielectric structure. A direct consequence of the TSC analyses is the rigorous proof that changes in interface trap charge can contribute, though typically not significantly, to thermally stimulated current

An Adaptive Connectivity-based Centroid Algorithm for Node Positioning in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Aries Pratiarso

2015-06-01

Full Text Available In wireless sensor network applications, the position of nodes is randomly distributed following the contour of the observation area. A simple solution without any measurement tools is provided by range-free method. However, this method yields the coarse estimating position of the nodes. In this paper, we propose Adaptive Connectivity-based (ACC algorithm. This algorithm is a combination of Centroid as range-free based algorithm, and hop-based connectivity algorithm. Nodes have a possibility to estimate their own position based on the connectivity level between them and their reference nodes. Each node divides its communication range into several regions where each of them has a certain weight depends on the received signal strength. The weighted value is used to obtain the estimated position of nodes. Simulation result shows that the proposed algorithm has up to 3 meter error of estimated position on 100x100 square meter observation area, and up to 3 hop counts for 80 meters' communication range. The proposed algorithm performs an average error positioning up to 10 meters better than Weighted Centroid algorithm. Keywords: adaptive, connectivity, centroid, range-free.

Measurement of centroid trajectory of Dragon-I electron beam

International Nuclear Information System (INIS)

Jiang Xiaoguo; Wang Yuan; Zhang Wenwei; Zhang Kaizhi; Li Jing; Li Chenggang; Yang Guojun

2005-01-01

The control of the electron beam in an intense current linear induction accelerator (LIA) is very important. The center position of the electron beam and the beam profile are two important parameters which should be measured accurately. The setup of a time-resolved measurement system and a data processing method for determining the beam center position are introduced for the purpose of obtaining Dragon-I electron beam trajectory including beam profile. The actual results show that the centroid position error can be controlled in one to two pixels. the time-resolved beam centroid trajectory of Dragon-I (18.5 MeV, 2 kA, 90 ns) is obtained recently in 10 ns interval, 3 ns exposure time with a multi-frame gated camera. The results show that the screw movement of the electron beam is mainly limited in an area with a radius of 0.5 mm and the time-resolved diameters of the beam are 8.4 mm, 8.8 mm, 8.5 mm, 9.3 mm and 7.6 mm. These results have provided a very important support to several research areas such as beam trajectory tuning and beam transmission. (authors)

K-Means Algorithm Performance Analysis With Determining The Value Of Starting Centroid With Random And KD-Tree Method

Science.gov (United States)

Sirait, Kamson; Tulus; Budhiarti Nababan, Erna

2017-12-01

Clustering methods that have high accuracy and time efficiency are necessary for the filtering process. One method that has been known and applied in clustering is K-Means Clustering. In its application, the determination of the begining value of the cluster center greatly affects the results of the K-Means algorithm. This research discusses the results of K-Means Clustering with starting centroid determination with a random and KD-Tree method. The initial determination of random centroid on the data set of 1000 student academic data to classify the potentially dropout has a sse value of 952972 for the quality variable and 232.48 for the GPA, whereas the initial centroid determination by KD-Tree has a sse value of 504302 for the quality variable and 214,37 for the GPA variable. The smaller sse values indicate that the result of K-Means Clustering with initial KD-Tree centroid selection have better accuracy than K-Means Clustering method with random initial centorid selection.

On the timing properties of germanium detectors: The centroid diagrams of prompt photopeaks and Compton events

International Nuclear Information System (INIS)

Penev, I.; Andrejtscheff, W.; Protochristov, Ch.; Zhelev, Zh.

1987-01-01

In the applications of the generalized centroid shift method with germanium detectors, the energy dependence of the time centroids of prompt photopeaks (zero-time line) and of Compton background events reveal a peculiar behavior crossing each other at about 100 keV. The effect is plausibly explained as associated with the ratio of γ-quanta causing the photoeffect and Compton scattering, respectively, at the boundaries of the detector. (orig.)

Centroid and Envelope Eynamics of Charged Particle Beams in an Oscillating Wobbler and External Focusing Lattice for Heavy Ion Fusion Applications

International Nuclear Information System (INIS)

Davidson, Ronald C.; Logan, B. Grant

2011-01-01

Recent heavy ion fusion target studies show that it is possible to achieve ignition with direct drive and energy gain larger than 100 at 1MJ. To realize these advanced, high-gain schemes based on direct drive, it is necessary to develop a reliable beam smoothing technique to mitigate instabilities and facilitate uniform deposition on the target. The dynamics of the beam centroid can be explored as a possible beam smoothing technique to achieve a uniform illumination over a suitably chosen region of the target. The basic idea of this technique is to induce an oscillatory motion of the centroid for each transverse slice of the beam in such a way that the centroids of different slices strike different locations on the target. The centroid dynamics is controlled by a set of biased electrical plates called 'wobblers'. Using a model based on moments of the Vlasov-Maxwell equations, we show that the wobbler deflection force acts only on the centroid motion, and that the envelope dynamics are independent of the wobbler fields. If the conducting wall is far away from the beam, then the envelope dynamics and centroid dynamics are completely decoupled. This is a preferred situation for the beam wobbling technique, because the wobbler system can be designed to generate the desired centroid motion on the target without considering its effects on the envelope and emittance. A conceptual design of the wobbler system for a heavy ion fusion driver is briefly summarized.

A Novel Approach Based on MEMS-Gyro's Data Deep Coupling for Determining the Centroid of Star Spot

Directory of Open Access Journals (Sweden)

Xing Fei

2012-01-01

Full Text Available The traditional approach of star tracker for determining the centroid of spot requires enough energy and good shape, so a relatively long exposure time and stable three-axis state become necessary conditions to maintain high accuracy, these limit its update rate and dynamic performance. In view of these issues, this paper presents an approach for determining the centroid of star spot which based on MEMS-Gyro's data deep coupling, it achieves the deep fusion of the data of star tracker and MEMS-Gyro at star map level through the introduction of EKF. The trajectory predicted by using the angular velocity of three axes can be used to set the extraction window, this enhances the dynamic performance because of the accurate extraction when the satellite has angular speed. The optimal estimations of the centroid position and the drift in the output signal of MEMS-Gyro through this approach reduce the influence of noise of the detector on accuracy of the traditional approach for determining the centroid and effectively correct the output signal of MEMS-Gyro. At the end of this paper, feasibility of this approach is verified by simulation.

A double inequality for bounding Toader mean by the centroidal mean

Indian Academy of Sciences (India)

A double inequality for bounding Toader mean by the centroidal mean. YUN HUA1,∗ and FENG QI2. 1Department of Information Engineering, Weihai Vocational College, Weihai City,. Shandong Province 264210, China. 2College of Mathematics, Inner Mongolia University for Nationalities, Tongliao City,. Inner Mongolia ...

Model of Decision Making through Consensus in Ranking Case

Science.gov (United States)

Tarigan, Gim; Darnius, Open

2018-01-01

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

A walk-free centroid method for lifetime measutement of 207Pb 569.7 keV state

International Nuclear Information System (INIS)

Gu Jiahui; Liu Jingyi; Xiao Genlai

1988-01-01

An improvement have been made in acquiring data of delayed coincidence spectra with ND-620 data acquisition system and off-line data analysis program. The delayed and anti-delayed coincidence spectra can be obtained in one run. The difference of their centroids is the mean lifetime τ. The centroid position of a delayed coincidence spectrum is the zero time of another delayed coincidence spectrum, so the requirement of measuring prompt time spectrum is avoided. The walk of prompt and delayed coincidence spectrum coming from different run are resolved and the walk during the measurement is compensated partly. The delayed coincidence time spectra of 207 Pb 569.7 keV state are measured and the half lifetime is calculated via three different methods (slop method, convolution method, centroid shift). The final value of half lifetime is 129.5±1.4ps. THe experimental reduced transition probability is compared with theoretical values

A double inequality for bounding Toader mean by the centroidal mean

Indian Academy of Sciences (India)

Annual Meetings · Mid Year Meetings · Discussion Meetings · Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 124; Issue 4. A double inequality for bounding Toader mean by the centroidal mean. Yun Hua Feng Qi.

Performance evaluation of the spectral centroid downshift method for attenuation estimation.

Science.gov (United States)

Samimi, Kayvan; Varghese, Tomy

2015-05-01

Estimation of frequency-dependent ultrasonic attenuation is an important aspect of tissue characterization. Along with other acoustic parameters studied in quantitative ultrasound, the attenuation coefficient can be used to differentiate normal and pathological tissue. The spectral centroid downshift (CDS) method is one the most common frequencydomain approaches applied to this problem. In this study, a statistical analysis of this method's performance was carried out based on a parametric model of the signal power spectrum in the presence of electronic noise. The parametric model used for the power spectrum of received RF data assumes a Gaussian spectral profile for the transmit pulse, and incorporates effects of attenuation, windowing, and electronic noise. Spectral moments were calculated and used to estimate second-order centroid statistics. A theoretical expression for the variance of a maximum likelihood estimator of attenuation coefficient was derived in terms of the centroid statistics and other model parameters, such as transmit pulse center frequency and bandwidth, RF data window length, SNR, and number of regression points. Theoretically predicted estimation variances were compared with experimentally estimated variances on RF data sets from both computer-simulated and physical tissue-mimicking phantoms. Scan parameter ranges for this study were electronic SNR from 10 to 70 dB, transmit pulse standard deviation from 0.5 to 4.1 MHz, transmit pulse center frequency from 2 to 8 MHz, and data window length from 3 to 17 mm. Acceptable agreement was observed between theoretical predictions and experimentally estimated values with differences smaller than 0.05 dB/cm/MHz across the parameter ranges investigated. This model helps predict the best attenuation estimation variance achievable with the CDS method, in terms of said scan parameters.

Differential computation method used to calibrate the angle-centroid relationship in coaxial reverse Hartmann test

Science.gov (United States)

Li, Xinji; Hui, Mei; Zhao, Zhu; Liu, Ming; Dong, Liquan; Kong, Lingqin; Zhao, Yuejin

2018-05-01

A differential computation method is presented to improve the precision of calibration for coaxial reverse Hartmann test (RHT). In the calibration, the accuracy of the distance measurement greatly influences the surface shape test, as demonstrated in the mathematical analyses. However, high-precision absolute distance measurement is difficult in the calibration. Thus, a differential computation method that only requires the relative distance was developed. In the proposed method, a liquid crystal display screen successively displayed two regular dot matrix patterns with different dot spacing. In a special case, images on the detector exhibited similar centroid distributions during the reflector translation. Thus, the critical value of the relative displacement distance and the centroid distributions of the dots on the detector were utilized to establish the relationship between the rays at certain angles and the detector coordinates. Experiments revealed the approximately linear behavior of the centroid variation with the relative displacement distance. With the differential computation method, we increased the precision of traditional calibration 10-5 rad root mean square. The precision of the RHT was increased by approximately 100 nm.

Strategic planning at the national level: Evaluating and ranking energy projects by environmental impact

International Nuclear Information System (INIS)

Thorhallsdottir, Thora Ellen

2007-01-01

A method for evaluating and ranking energy alternatives based on impact upon the natural environment and cultural heritage was developed as part of the first phase of an Icelandic framework plan for the use of hydropower and geothermal energy. The three step procedure involved assessing i) site values and ii) development impacts within a multi-criteria analysis, and iii) ranking the alternatives from worst to best choice from an environmental-cultural heritage point of view. The natural environment was treated as four main classes (landscape + wilderness, geology + hydrology, species, and ecosystem/habitat types + soils), while cultural heritage constituted one class. Values and impacts were assessed within a common matrix with 6 agglomerated attributes: 1) diversity, richness, 2) rarity, 3) size (area), completeness, pristineness, 4) information (epistemological, typological, scientific and educational) and symbolic value, 5) international responsibility, and 6) scenic value. Standardized attribute scores were used to derive total class scores whose weighted sums yielded total site value and total impact. The final output was a one-dimensional ranking obtained by Analytical Hierarchical Process considering total predicted impacts, total site values, risks and uncertainties as well as special site values. The value/impact matrix is compact (31 cell scores) but was considered to be of sufficient resolution and has the advantage of facilitating overview and communication of the methods and results. The classes varied widely in the extent to which value assessments could be based on established scientific procedures and the project highlighted the immense advantage of an internationally accepted frame of reference, first for establishing the theoretical and scientific foundation, second as a tool for evaluation, and third for allowing a global perspective

Effect of ranking criteria on development goals in capital and manpower-limited oil and gas organizations

International Nuclear Information System (INIS)

Starzer, M.R.

1991-01-01

This paper summarizes a study to determine the effect of financial ranking criteria on development goals of oil and gas organizations. Economic analysis and ranking was applied to one hundred projects representing oil and gas investment opportunities available to an organization. Each project's after tax cash flows were subjected to four financial analysis methods for ranking. The four analysis methods used were net present value to investment ratio (NPVI), internal rate of return (IRR), payback period and profit to investment ratio (P/I). After ranking, the projects were totaled according to a particular organizational objective. Totaling of projects by ranking would continue until a limiting resource to the organization was exhausted. This study demonstrates the insensitivity of financial analysis methods for ranking whether the organization is limited by capital or manpower. It concludes that the only requirement for a ranking criterion to properly allocate resources is that the criterion quantifies the organizational goal to some degree. Decision makers charged with selecting the most attractive growth portfolio of investment opportunities will do well with any profit measuring criterion for ranking

Improvement of correlation-based centroiding methods for point source Shack-Hartmann wavefront sensor

Science.gov (United States)

Li, Xuxu; Li, Xinyang; wang, Caixia

2018-03-01

This paper proposes an efficient approach to decrease the computational costs of correlation-based centroiding methods used for point source Shack-Hartmann wavefront sensors. Four typical similarity functions have been compared, i.e. the absolute difference function (ADF), ADF square (ADF2), square difference function (SDF), and cross-correlation function (CCF) using the Gaussian spot model. By combining them with fast search algorithms, such as three-step search (TSS), two-dimensional logarithmic search (TDL), cross search (CS), and orthogonal search (OS), computational costs can be reduced drastically without affecting the accuracy of centroid detection. Specifically, OS reduces calculation consumption by 90%. A comprehensive simulation indicates that CCF exhibits a better performance than other functions under various light-level conditions. Besides, the effectiveness of fast search algorithms has been verified.

Relation between medium fluid temperature and centroid subchannel temperatures of a nuclear fuel bundle mock-up

International Nuclear Information System (INIS)

Carvalho Tofani, P. de.

1986-01-01

The subchannel method used in nuclear fuel bundle thermal-hydraulic analysis lies in the statement that subchannel fluid temperatures are taken at mixed mean values. However, the development of mixing correlations and code assessment procedures are, sometimes in the literature, based upon the assumption of identity between lumped and local (subchannel centroid) temperature values. The present paper is concerned with the presentation of an approach for correlating lumped to centroid subchannel temperatures, based upon previously formulated models by the author, applied, applied to a nine heated tube bundle experimental data set. (Author) [pt

Relation between medium fluid temperature and centroid subchannel temperatures of a nuclear fuel bundle mock-up

International Nuclear Information System (INIS)

Carvalho Tofani, P. de.

1986-01-01

The subchannel method used in nuclear fuel bundle thermal-hydraulic analysis lies in the statement that subchannel fluid temperatures are taken at mixed mean values. However, the development of mixing correlations and code assessment procedures are, sometimes in the literature, based upon the assumption of identity between lumped and local (subchannel centroid) temperature values. The present paper is concerned with the presentation of an approach for correlating lumped to centroid subchannel temperatures, based upon previously formulated models by the author, applied to a nine heated tube bundle experimental data set. (Author) [pt

Centroid and Theoretical Rotation: Justification for Their Use in Q Methodology Research

Science.gov (United States)

Ramlo, Sue

2016-01-01

This manuscript's purpose is to introduce Q as a methodology before providing clarification about the preferred factor analytical choices of centroid and theoretical (hand) rotation. Stephenson, the creator of Q, designated that only these choices allowed for scientific exploration of subjectivity while not violating assumptions associated with…

Ranking and evaluating the factors affecting the success of ...

African Journals Online (AJOL)

Ranking and evaluating the factors affecting the success of management team in construction projects. ... Journal of Fundamental and Applied Sciences. Journal Home ... The project management team is one of these important factors.

Target Centroid Position Estimation of Phase-Path Volume Kalman Filtering

Directory of Open Access Journals (Sweden)

Fengjun Hu

2016-01-01

Full Text Available For the problem of easily losing track target when obstacles appear in intelligent robot target tracking, this paper proposes a target tracking algorithm integrating reduced dimension optimal Kalman filtering algorithm based on phase-path volume integral with Camshift algorithm. After analyzing the defects of Camshift algorithm, compare the performance with the SIFT algorithm and Mean Shift algorithm, and Kalman filtering algorithm is used for fusion optimization aiming at the defects. Then aiming at the increasing amount of calculation in integrated algorithm, reduce dimension with the phase-path volume integral instead of the Gaussian integral in Kalman algorithm and reduce the number of sampling points in the filtering process without influencing the operational precision of the original algorithm. Finally set the target centroid position from the Camshift algorithm iteration as the observation value of the improved Kalman filtering algorithm to fix predictive value; thus to make optimal estimation of target centroid position and keep the target tracking so that the robot can understand the environmental scene and react in time correctly according to the changes. The experiments show that the improved algorithm proposed in this paper shows good performance in target tracking with obstructions and reduces the computational complexity of the algorithm through the dimension reduction.

Analysis of the positon resolution in centroid measurements in MWPC

International Nuclear Information System (INIS)

Gatti, E.; Longoni, A.

1981-01-01

Resolution limits in avalanche localization along the anode wires of an MWPC with cathodes connected by resistors and equally spaced amplifiers, are evaluated. A simple weighted-centroid method and a highly linear method based on a linear centroid finding filter, are considered. The contributions to the variance of the estimator of the avalanche position, due to the series noise of the amplifiers and to the thermal noise of the resistive line are separately calculated and compared. A comparison is made with the resolution of the MWPC with isolated cathodes. The calculations are performed with a distributed model of the diffusive line formed by the cathodes and the resistors. A comparison is also made with the results obtained with a simple lumped model of the diffusive line. A number of graphs useful in determining the best parameters of a MWPC, with a specified position and time resolution, are given. It has been found that, for short resolution times, an MWPC with cathodes connected by resitors presents better resolution (lower variance of the estimator of the avalanche position) than an MWPC with isolated cathodes. Conversely, for long resolution times, the variance of the estimator of the avalanche position is lower in an MWPC with isolated cathodes. (orig.)

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.

Diffeomorphic Iterative Centroid Methods for Template Estimation on Large Datasets

OpenAIRE

Cury , Claire; Glaunès , Joan Alexis; Colliot , Olivier

2014-01-01

International audience; A common approach for analysis of anatomical variability relies on the stimation of a template representative of the population. The Large Deformation Diffeomorphic Metric Mapping is an attractive framework for that purpose. However, template estimation using LDDMM is computationally expensive, which is a limitation for the study of large datasets. This paper presents an iterative method which quickly provides a centroid of the population in the shape space. This centr...

FINGERPRINT MATCHING BASED ON PORE CENTROIDS

Directory of Open Access Journals (Sweden)

S. Malathi

2011-05-01

Full Text Available In recent years there has been exponential growth in the use of bio- metrics for user authentication applications. Automated Fingerprint Identification systems have become popular tool in many security and law enforcement applications. Most of these systems rely on minutiae (ridge ending and bifurcation features. With the advancement in sensor technology, high resolution fingerprint images (1000 dpi pro- vide micro level of features (pores that have proven to be useful fea- tures for identification. In this paper, we propose a new strategy for fingerprint matching based on pores by reliably extracting the pore features The extraction of pores is done by Marker Controlled Wa- tershed segmentation method and the centroids of each pore are con- sidered as feature vectors for matching of two fingerprint images. Experimental results shows that the proposed method has better per- formance with lower false rates and higher accuracy.

360-degrees profilometry using strip-light projection coupled to Fourier phase-demodulation.

Science.gov (United States)

Servin, Manuel; Padilla, Moises; Garnica, Guillermo

2016-01-11

360 degrees (360°) digitalization of three dimensional (3D) solids using a projected light-strip is a well-established technique in academic and commercial profilometers. These profilometers project a light-strip over the digitizing solid while the solid is rotated a full revolution or 360-degrees. Then, a computer program typically extracts the centroid of this light-strip, and by triangulation one obtains the shape of the solid. Here instead of using intensity-based light-strip centroid estimation, we propose to use Fourier phase-demodulation for 360° solid digitalization. The advantage of Fourier demodulation over strip-centroid estimation is that the accuracy of phase-demodulation linearly-increases with the fringe density, while in strip-light the centroid-estimation errors are independent. Here we proposed first to construct a carrier-frequency fringe-pattern by closely adding the individual light-strip images recorded while the solid is being rotated. Next, this high-density fringe-pattern is phase-demodulated using the standard Fourier technique. To test the feasibility of this Fourier demodulation approach, we have digitized two solids with increasing topographic complexity: a Rubik's cube and a plastic model of a human-skull. According to our results, phase demodulation based on the Fourier technique is less noisy than triangulation based on centroid light-strip estimation. Moreover, Fourier demodulation also provides the amplitude of the analytic signal which is a valuable information for the visualization of surface details.

Rank Dynamics

Science.gov (United States)

Gershenson, Carlos

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

PageRank tracker: from ranking to tracking.

Science.gov (United States)

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

2014-06-01

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

Automatic localization of the left ventricular blood pool centroid in short axis cardiac cine MR images.

Science.gov (United States)

Tan, Li Kuo; Liew, Yih Miin; Lim, Einly; Abdul Aziz, Yang Faridah; Chee, Kok Han; McLaughlin, Robert A

2018-06-01

In this paper, we develop and validate an open source, fully automatic algorithm to localize the left ventricular (LV) blood pool centroid in short axis cardiac cine MR images, enabling follow-on automated LV segmentation algorithms. The algorithm comprises four steps: (i) quantify motion to determine an initial region of interest surrounding the heart, (ii) identify potential 2D objects of interest using an intensity-based segmentation, (iii) assess contraction/expansion, circularity, and proximity to lung tissue to score all objects of interest in terms of their likelihood of constituting part of the LV, and (iv) aggregate the objects into connected groups and construct the final LV blood pool volume and centroid. This algorithm was tested against 1140 datasets from the Kaggle Second Annual Data Science Bowl, as well as 45 datasets from the STACOM 2009 Cardiac MR Left Ventricle Segmentation Challenge. Correct LV localization was confirmed in 97.3% of the datasets. The mean absolute error between the gold standard and localization centroids was 2.8 to 4.7 mm, or 12 to 22% of the average endocardial radius. Graphical abstract Fully automated localization of the left ventricular blood pool in short axis cardiac cine MR images.

Lifetime measurements in {sup 170}Yb using the generalized centroid difference method

Energy Technology Data Exchange (ETDEWEB)

Karayonchev, Vasil; Regis, Jean-Marc; Jolie, Jan; Dannhoff, Moritz; Saed-Samii, Nima; Blazhev, Andrey [Institute of Nuclear Physics, University of Cologne, Cologne (Germany)

2016-07-01

An experiment using the electronic γ-γ ''fast-timing'' technique was performed at the 10 MV Tandem Van-De-Graaff accelerator of the Institute for Nuclear Physics, Cologne in order to measure lifetimes of the yrast states in {sup 170}Yb. The lifetime of the first 2{sup +} state was determined using the slope method, which means by fitting an exponential decay to the ''slope'' seen in the energy-gated time-difference spectra. The value of τ=2.201(57) ns is in good agreement with the lifetimes measured using other techniques. The lifetimes of the first 4{sup +} and the 6{sup +} states are determined for the first time. They are in the ps range and were measured using the generalized centroid difference method, an extension of the well-known centroid-shift method and developed for fast-timing arrays. The derived reduced transition probabilities B(E2) values are compared with calculations done using the confined beta soft model and show good agreement within the experimental uncertainties.

Evaluating ranking methods on heterogeneous digital library collections

CERN Document Server

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

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

The strengths and limitations of effective centroid force models explored by studying isotopic effects in liquid water

Science.gov (United States)

Yuan, Ying; Li, Jicun; Li, Xin-Zheng; Wang, Feng

2018-05-01

The development of effective centroid potentials (ECPs) is explored with both the constrained-centroid and quasi-adiabatic force matching using liquid water as a test system. A trajectory integrated with the ECP is free of statistical noises that would be introduced when the centroid potential is approximated on the fly with a finite number of beads. With the reduced cost of ECP, challenging experimental properties can be studied in the spirit of centroid molecular dynamics. The experimental number density of H2O is 0.38% higher than that of D2O. With the ECP, the H2O number density is predicted to be 0.42% higher, when the dispersion term is not refit. After correction of finite size effects, the diffusion constant of H2O is found to be 21% higher than that of D2O, which is in good agreement with the 29.9% higher diffusivity for H2O observed experimentally. Although the ECP is also able to capture the redshifts of both the OH and OD stretching modes in liquid water, there are a number of properties that a classical simulation with the ECP will not be able to recover. For example, the heat capacities of H2O and D2O are predicted to be almost identical and higher than the experimental values. Such a failure is simply a result of not properly treating quantized vibrational energy levels when the trajectory is propagated with classical mechanics. Several limitations of the ECP based approach without bead population reconstruction are discussed.

Modification of backgammon shape cathode and graded charge division readout method for a novel triple charge division centroid finding method

International Nuclear Information System (INIS)

Javanmardi, F.; Matoba, M.; Sakae, T.

1996-01-01

Triple Charge Division (TCD) centroid finding method that uses modified pattern of Backgammon Shape Cathode (MBSC) is introduced for medium range length position sensitive detectors with optimum numbers of cathode segments. MBSC pattern has three separated areas and uses saw tooth like insulator gaps for separating the areas. Side areas of the MBSC pattern are severed by a central common area. Size of the central area is twice of the size of both sides. Whereas central area is the widest area among three, both sides' areas have the main role in position sensing. With the same resolution and linearity, active region of original Backgammon pattern increases twice by using MBSC pattern, and with the same length, linearity of TCD centroid finding is much better than Backgammon charge division readout method. Linearity prediction of TCD centroid finding and experimental results conducted us to find an optimum truncation of the apices of MBCS pattern in the central area. The TCD centroid finding has an especial readout method since charges must be collected from two segments in both sides and from three segments in the central area of MBSC pattern. The so called Graded Charge Division (GCD) is the especial readout method for TCD. The GCD readout is a combination of the charge division readout and sequence grading of serial segments. Position sensing with TCD centroid finding and GCD readout were done by two sizes MBSC patterns (200mm and 80mm) and Spatial resolution about 1% of the detector length is achieved

Hough transform used on the spot-centroiding algorithm for the Shack-Hartmann wavefront sensor

Science.gov (United States)

Chia, Chou-Min; Huang, Kuang-Yuh; Chang, Elmer

2016-01-01

An approach to the spot-centroiding algorithm for the Shack-Hartmann wavefront sensor (SHWS) is presented. The SHWS has a common problem, in that while measuring high-order wavefront distortion, the spots may exceed each of the subapertures, which are used to restrict the displacement of spots. This artificial restriction may limit the dynamic range of the SHWS. When using the SHWS to measure adaptive optics or aspheric lenses, the accuracy of the traditional spot-centroiding algorithm may be uncertain because the spots leave or cross the confined area of the subapertures. The proposed algorithm combines the Hough transform with an artificial neural network, which requires no confined subapertures, to increase the dynamic range of the SHWS. This algorithm is then explored in comprehensive simulations and the results are compared with those of the existing algorithm.

CentroidFold: a web server for RNA secondary structure prediction

OpenAIRE

Sato, Kengo; Hamada, Michiaki; Asai, Kiyoshi; Mituyama, Toutai

2009-01-01

The CentroidFold web server (http://www.ncrna.org/centroidfold/) is a web application for RNA secondary structure prediction powered by one of the most accurate prediction engine. The server accepts two kinds of sequence data: a single RNA sequence and a multiple alignment of RNA sequences. It responses with a prediction result shown as a popular base-pair notation and a graph representation. PDF version of the graph representation is also available. For a multiple alignment sequence, the ser...

Prediction of RNA secondary structure using generalized centroid estimators.

Science.gov (United States)

Hamada, Michiaki; Kiryu, Hisanori; Sato, Kengo; Mituyama, Toutai; Asai, Kiyoshi

2009-02-15

Recent studies have shown that the methods for predicting secondary structures of RNAs on the basis of posterior decoding of the base-pairing probabilities has an advantage with respect to prediction accuracy over the conventionally utilized minimum free energy methods. However, there is room for improvement in the objective functions presented in previous studies, which are maximized in the posterior decoding with respect to the accuracy measures for secondary structures. We propose novel estimators which improve the accuracy of secondary structure prediction of RNAs. The proposed estimators maximize an objective function which is the weighted sum of the expected number of the true positives and that of the true negatives of the base pairs. The proposed estimators are also improved versions of the ones used in previous works, namely CONTRAfold for secondary structure prediction from a single RNA sequence and McCaskill-MEA for common secondary structure prediction from multiple alignments of RNA sequences. We clarify the relations between the proposed estimators and the estimators presented in previous works, and theoretically show that the previous estimators include additional unnecessary terms in the evaluation measures with respect to the accuracy. Furthermore, computational experiments confirm the theoretical analysis by indicating improvement in the empirical accuracy. The proposed estimators represent extensions of the centroid estimators proposed in Ding et al. and Carvalho and Lawrence, and are applicable to a wide variety of problems in bioinformatics. Supporting information and the CentroidFold software are available online at: http://www.ncrna.org/software/centroidfold/.

Performance Evaluation of the Spectral Centroid Downshift Method for Attenuation Estimation

OpenAIRE

Samimi, Kayvan; Varghese, Tomy

2015-01-01

Estimation of frequency-dependent ultrasonic attenuation is an important aspect of tissue characterization. Along with other acoustic parameters studied in quantitative ultrasound, the attenuation coefficient can be used to differentiate normal and pathological tissue. The spectral centroid downshift (CDS) method is one the most common frequency-domain approaches applied to this problem. In this study, a statistical analysis of this method’s performance was carried out based on a parametric m...

A Proposal to Speed up the Computation of the Centroid of an Interval Type-2 Fuzzy Set

Directory of Open Access Journals (Sweden)

Carlos E. Celemin

2013-01-01

Full Text Available This paper presents two new algorithms that speed up the centroid computation of an interval type-2 fuzzy set. The algorithms include precomputation of the main operations and initialization based on the concept of uncertainty bounds. Simulations over different kinds of footprints of uncertainty reveal that the new algorithms achieve computation time reductions with respect to the Enhanced-Karnik algorithm, ranging from 40 to 70%. The results suggest that the initialization used in the new algorithms effectively reduces the number of iterations to compute the extreme points of the interval centroid while precomputation reduces the computational cost of each iteration.

A method to determine the detector locations of the cone-beam projection of the balls’ centers

International Nuclear Information System (INIS)

Deng, Lin; Xi, Xiaoqi; Li, Lei; Han, Yu; Yan, Bin

2015-01-01

In geometric calibration of cone-beam computed tomography (CBCT), sphere-like objects such as balls are widely imaged, the positioning information of which is obtained to determine the unknown geometric parameters. In this process, the accuracy of the detector location of CB projection of the center of the ball, which we call the center projection, is very important, since geometric calibration is sensitive to errors in the positioning information. Currently in almost all the geometric calibration using balls, the center projection is invariably estimated by the center of the support of the projection or the centroid of the intensity values inside the support approximately. Clackdoyle’s work indicates that the center projection is not always at the center of the support or the centroid of the intensity values inside, and has given a quantitative analysis of the maximum errors in evaluating the center projection by the centroid. In this paper, an exact method is proposed to calculate the center projection, utilizing both the detector location of the ellipse center and the two axis lengths of the ellipse. Numerical simulation results have demonstrated the precision and the robustness of the proposed method. Finally there are some comments on this work with non-uniform density balls, as well as the effect by the error occurred in the evaluation for the location of the orthogonal projection of the cone vertex onto the detector. (paper)

Power centroid radar and its rise from the universal cybernetics duality

Science.gov (United States)

Feria, Erlan H.

2014-05-01

Power centroid radar (PC-Radar) is a fast and powerful adaptive radar scheme that naturally surfaced from the recent discovery of the time-dual for information theory which has been named "latency theory." Latency theory itself was born from the universal cybernetics duality (UC-Duality), first identified in the late 1970s, that has also delivered a time dual for thermodynamics that has been named "lingerdynamics" and anchors an emerging lifespan theory for biological systems. In this paper the rise of PC-Radar from the UC-Duality is described. The development of PC-Radar, US patented, started with Defense Advanced Research Projects Agency (DARPA) funded research on knowledge-aided (KA) adaptive radar of the last decade. The outstanding signal to interference plus noise ratio (SINR) performance of PC-Radar under severely taxing environmental disturbances will be established. More specifically, it will be seen that the SINR performance of PC-Radar, either KA or knowledgeunaided (KU), approximates that of an optimum KA radar scheme. The explanation for this remarkable result is that PC-Radar inherently arises from the UC-Duality, which advances a "first principles" duality guidance theory for the derivation of synergistic storage-space/computational-time compression solutions. Real-world synthetic aperture radar (SAR) images will be used as prior-knowledge to illustrate these results.

Communications: On artificial frequency shifts in infrared spectra obtained from centroid molecular dynamics: Quantum liquid water

Science.gov (United States)

Ivanov, Sergei D.; Witt, Alexander; Shiga, Motoyuki; Marx, Dominik

2010-01-01

Centroid molecular dynamics (CMD) is a popular method to extract approximate quantum dynamics from path integral simulations. Very recently we have shown that CMD gas phase infrared spectra exhibit significant artificial redshifts of stretching peaks, due to the so-called "curvature problem" imprinted by the effective centroid potential. Here we provide evidence that for condensed phases, and in particular for liquid water, CMD produces pronounced artificial redshifts for high-frequency vibrations such as the OH stretching band. This peculiar behavior intrinsic to the CMD method explains part of the unexpectedly large quantum redshifts of the stretching band of liquid water compared to classical frequencies, which is improved after applying a simple and rough "harmonic curvature correction."

Estimating the Doppler centroid of SAR data

DEFF Research Database (Denmark)

Madsen, Søren Nørvang

1989-01-01

attractive properties. An evaluation based on an existing SEASAT processor is reported. The time-domain algorithms are shown to be extremely efficient with respect to requirements on calculations and memory, and hence they are well suited to real-time systems where the Doppler estimation is based on raw SAR......After reviewing frequency-domain techniques for estimating the Doppler centroid of synthetic-aperture radar (SAR) data, the author describes a time-domain method and highlights its advantages. In particular, a nonlinear time-domain algorithm called the sign-Doppler estimator (SDE) is shown to have...... data. For offline processors where the Doppler estimation is performed on processed data, which removes the problem of partial coverage of bright targets, the ΔE estimator and the CDE (correlation Doppler estimator) algorithm give similar performance. However, for nonhomogeneous scenes it is found...

Low rank magnetic resonance fingerprinting.

Science.gov (United States)

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

2016-08-01

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

PageRank and rank-reversal dependence on the damping factor

Science.gov (United States)

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

2012-12-01

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

PageRank and rank-reversal dependence on the damping factor.

Science.gov (United States)

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

2012-12-01

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

Document Ranking in E-Extended Boolean Logic

Czech Academy of Sciences Publication Activity Database

Holub, M.; Húsek, Dušan; Pokorný, J.

1996-01-01

Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic

MOBIUS-STRIP-LIKE COLUMNAR FUNCTIONAL CONNECTIONS ARE REVEALED IN SOMATO-SENSORY RECEPTIVE FIELD CENTROIDS.

Directory of Open Access Journals (Sweden)

James Joseph Wright

2014-10-01

Full Text Available Receptive fields of neurons in the forelimb region of areas 3b and 1 of primary somatosensory cortex, in cats and monkeys, were mapped using extracellular recordings obtained sequentially from nearly radial penetrations. Locations of the field centroids indicated the presence of a functional system, in which cortical homotypic representations of the limb surfaces are entwined in three-dimensional Mobius-strip-like patterns of synaptic connections. Boundaries of somatosensory receptive field in nested groups irregularly overlie the centroid order, and are interpreted as arising from the superposition of learned connections upon the embryonic order. Since the theory of embryonic synaptic self-organisation used to model these results was devised and earlier used to explain findings in primary visual cortex, the present findings suggest the theory may be of general application throughout cortex, and may reveal a modular functional synaptic system, which, only in some parts of the cortex, and in some species, is manifest as anatomical ordering into columns.

Optimization of soy isoflavone extraction with different solvents using the simplex-centroid mixture design.

Science.gov (United States)

Yoshiara, Luciane Yuri; Madeira, Tiago Bervelieri; Delaroza, Fernanda; da Silva, Josemeyre Bonifácio; Ida, Elza Iouko

2012-12-01

The objective of this study was to optimize the extraction of different isoflavone forms (glycosidic, malonyl-glycosidic, aglycone and total) from defatted cotyledon soy flour using the simplex-centroid experimental design with four solvents of varying polarity (water, acetone, ethanol and acetonitrile). The obtained extracts were then analysed by high-performance liquid chromatography. The profile of the different soy isoflavones forms varied with different extractions solvents. Varying the solvent or mixture used, the extraction of different isoflavones was optimized using the centroid-simplex mixture design. The special cubic model best fitted to the four solvents and its combination for soy isoflavones extraction. For glycosidic isoflavones extraction, the polar ternary mixture (water, acetone and acetonitrile) achieved the best extraction; malonyl-glycosidic forms were better extracted with mixtures of water, acetone and ethanol. Aglycone isoflavones, water and acetone mixture were best extracted and total isoflavones, the best solvents were ternary mixture of water, acetone and ethanol.

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.

4fn-15d centroid shift in lanthanides and relation with anion polarizability, covalency, and cation electronegativity

International Nuclear Information System (INIS)

Dorenbos, P.; Andriessen, J.; Eijk, C.W.E. van

2003-01-01

Data collected on the centroid shift of the 5d-configuration of Ce 3+ in oxide and fluoride compounds were recently analyzed with a model involving the correlated motion between 5d-electron and ligand electrons. The correlation effects are proportional to the polarizability of the anion ligands and it leads, like covalency, to lowering of the 5d-orbital energies. By means of ab initio Hartree-Fock-LCAO calculations including configuration interaction the contribution from covalency and correlated motion to the centroid shift are determined separately for Ce 3+ in various compounds. It will be shown that in fluoride compounds, covalency provides an insignificant contribution. In oxides, polarizability appears to be of comparable importance as covalency

Ranking Scientific Publications Based on Their Citation Graph

CERN Document Server

Marian, L; Rajman, M

2009-01-01

CDS Invenio is the web-based integrated digital library system developed at CERN. It is a suite of applications which provides the framework and tools for building and managing an autonomous digital library server. Within this framework, the goal of this project is to implement new ranking methods based on the bibliographic citation graph extracted from the CDS Invenio database. As a first step, we implemented the Citation Count as a baseline ranking method. The major disadvantage of this method is that all citations are treated equally, disregarding their importance and their publication date. To overcome this drawback, we consider two different approaches: a link-based approach which extends the PageRank model to the bibliographic citation graph and a time-dependent approach which takes into account time in the citation counts. In addition, we also combined these two approaches in a hybrid model based on a time-dependent PageRank. In the present document, we describe the conceptual background behind our new...

Improved measurements of RNA structure conservation with generalized centroid estimators

Directory of Open Access Journals (Sweden)

Yohei eOkada

2011-08-01

Full Text Available Identification of non-protein-coding RNAs (ncRNAs in genomes is acrucial task for not only molecular cell biology but alsobioinformatics. Secondary structures of ncRNAs are employed as a keyfeature of ncRNA analysis since biological functions of ncRNAs aredeeply related to their secondary structures. Although the minimumfree energy (MFE structure of an RNA sequence is regarded as the moststable structure, MFE alone could not be an appropriate measure foridentifying ncRNAs since the free energy is heavily biased by thenucleotide composition. Therefore, instead of MFE itself, severalalternative measures for identifying ncRNAs have been proposed such asthe structure conservation index (SCI and the base pair distance(BPD, both of which employ MFE structures. However, thesemeasurements are unfortunately not suitable for identifying ncRNAs insome cases including the genome-wide search and incur high falsediscovery rate. In this study, we propose improved measurements basedon SCI and BPD, applying generalized centroid estimators toincorporate the robustness against low quality multiple alignments.Our experiments show that our proposed methods achieve higher accuracythan the original SCI and BPD for not only human-curated structuralalignments but also low quality alignments produced by CLUSTALW. Furthermore, the centroid-based SCI on CLUSTAL W alignments is moreaccurate than or comparable with that of the original SCI onstructural alignments generated with RAF, a high quality structuralaligner, for which two-fold expensive computational time is requiredon average. We conclude that our methods are more suitable forgenome-wide alignments which are of low quality from the point of viewon secondary structures than the original SCI and BPD.

Oscillations of centroid position and surface area of soccer teams in small-sided games

NARCIS (Netherlands)

Frencken, Wouter; Lemmink, Koen; Delleman, Nico; Visscher, Chris

2011-01-01

There is a need for a collective variable that captures the dynamics of team sports like soccer at match level. The centroid positions and surface areas of two soccer teams potentially describe the coordinated flow of attacking and defending in small-sided soccer games at team level. The aim of the

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.

Ranking nodes in growing networks: When PageRank fails.

Science.gov (United States)

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

2015-11-10

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

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

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

Directory of Open Access Journals (Sweden)

Yubao Sun

2015-01-01

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

Two tree-formation methods for fast pattern search using nearest-neighbour and nearest-centroid matching

NARCIS (Netherlands)

Schomaker, Lambertus; Mangalagiu, D.; Vuurpijl, Louis; Weinfeld, M.; Schomaker, Lambert; Vuurpijl, Louis

2000-01-01

This paper describes tree­based classification of character images, comparing two methods of tree formation and two methods of matching: nearest neighbor and nearest centroid. The first method, Preprocess Using Relative Distances (PURD) is a tree­based reorganization of a flat list of patterns,

RankProdIt: A web-interactive Rank Products analysis tool

Directory of Open Access Journals (Sweden)

Laing Emma

2010-08-01

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

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.

Alteração no método centroide de avaliação da adaptabilidade genotípica Alteration of the centroid method to evaluate genotypic adaptability

Directory of Open Access Journals (Sweden)

Moysés Nascimento

2009-03-01

Full Text Available O objetivo deste trabalho foi alterar o método centroide de avaliação da adaptabilidade e estabilidade fenotípica de genótipos, para deixá-lo com maior sentido biológico e melhorar aspectos quantitativos e qualitativos de sua análise. A alteração se deu pela adição de mais três ideótipos, definidos de acordo com valores médios dos genótipos nos ambientes. Foram utilizados dados provenientes de um experimento sobre produção de matéria seca de 92 genótipos de alfafa (Medicago sativa realizado em blocos ao acaso, com duas repetições. Os genótipos foram submetidos a 20 cortes, no período de novembro de 2004 a junho de 2006. Cada corte foi considerado um ambiente. A inclusão dos ideótipos de maior sentido biológico (valores médios nos ambientes resultou em uma dispersão gráfica em forma de uma seta voltada para a direita, na qual os genótipos mais produtivos ficaram próximos à ponta da seta. Com a alteração, apenas cinco genótipos foram classificados nas mesmas classes do método centroide original. A figura em forma de seta proporciona uma comparação direta dos genótipos, por meio da formação de um gradiente de produtividade. A alteração no método mantém a facilidade de interpretação dos resultados para a recomendação dos genótipos presente no método original e não permite duplicidade de interpretação dos resultados.ABSTRACT The objective of this work was to modify the centroid method of evaluation of phenotypic adaptability and the phenotype stability of genotypes in order for the method to make greater biological sense and improve its quantitative and qualitative performance. The method was modified by means of the inclusion of three additional ideotypes defined in accordance with the genotypes' average yield in the environments tested. The alfalfa (Medicago sativa L. forage yield of 92 genotypes was used. The trial had a randomized block design, with two replicates, and the data were used to

PageRank as a method to rank biomedical literature by importance.

Science.gov (United States)

Yates, Elliot J; Dixon, Louise C

2015-01-01

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

THE ENERGY DEPENDENCE OF THE CENTROID FREQUENCY AND PHASE LAG OF THE QUASI-PERIODIC OSCILLATIONS IN GRS 1915+105

International Nuclear Information System (INIS)

Qu, J. L.; Lu, F. J.; Lu, Y.; Song, L. M.; Zhang, S.; Wang, J. M.; Ding, G. Q.

2010-01-01

We present a study of the centroid frequencies and phase lags of quasi-periodic oscillations (QPOs) as functions of photon energy for GRS 1915+105. It is found that the centroid frequencies of the 0.5-10 Hz QPOs and their phase lags are both energy dependent, and there exists an anticorrelation between the QPO frequency and phase lag. These new results challenge the popular QPO models, because none of them can fully explain the observed properties. We suggest that the observed QPO phase lags are partially due to the variation of the QPO frequency with energy, especially for those with frequency higher than 3.5 Hz.

Composite multi-parameter ranking of real and virtual compounds for design of MC4R agonists: renaissance of the Free-Wilson methodology.

Science.gov (United States)

Nilsson, Ingemar; Polla, Magnus O

2012-10-01

Drug design is a multi-parameter task present in the analysis of experimental data for synthesized compounds and in the prediction of new compounds with desired properties. This article describes the implementation of a binned scoring and composite ranking scheme for 11 experimental parameters that were identified as key drivers in the MC4R project. The composite ranking scheme was implemented in an AstraZeneca tool for analysis of project data, thereby providing an immediate re-ranking as new experimental data was added. The automated ranking also highlighted compounds overlooked by the project team. The successful implementation of a composite ranking on experimental data led to the development of an equivalent virtual score, which was based on Free-Wilson models of the parameters from the experimental ranking. The individual Free-Wilson models showed good to high predictive power with a correlation coefficient between 0.45 and 0.97 based on the external test set. The virtual ranking adds value to the selection of compounds for synthesis but error propagation must be controlled. The experimental ranking approach adds significant value, is parameter independent and can be tuned and applied to any drug discovery project.

User Manual and Supporting Information for Library of Codes for Centroidal Voronoi Point Placement and Associated Zeroth, First, and Second Moment Determination; TOPICAL

International Nuclear Information System (INIS)

BURKARDT, JOHN; GUNZBURGER, MAX; PETERSON, JANET; BRANNON, REBECCA M.

2002-01-01

The theory, numerical algorithm, and user documentation are provided for a new ''Centroidal Voronoi Tessellation (CVT)'' method of filling a region of space (2D or 3D) with particles at any desired particle density. ''Clumping'' is entirely avoided and the boundary is optimally resolved. This particle placement capability is needed for any so-called ''mesh-free'' method in which physical fields are discretized via arbitrary-connectivity discrete points. CVT exploits efficient statistical methods to avoid expensive generation of Voronoi diagrams. Nevertheless, if a CVT particle's Voronoi cell were to be explicitly computed, then it would have a centroid that coincides with the particle itself and a minimized rotational moment. The CVT code provides each particle's volume and centroid, and also the rotational moment matrix needed to approximate a particle by an ellipsoid (instead of a simple sphere). DIATOM region specification is supported

An improved Q estimation approach: the weighted centroid frequency shift method

Science.gov (United States)

Li, Jingnan; Wang, Shangxu; Yang, Dengfeng; Dong, Chunhui; Tao, Yonghui; Zhou, Yatao

2016-06-01

Seismic wave propagation in subsurface media suffers from absorption, which can be quantified by the quality factor Q. Accurate estimation of the Q factor is of great importance for the resolution enhancement of seismic data, precise imaging and interpretation, and reservoir prediction and characterization. The centroid frequency shift method (CFS) is currently one of the most commonly used Q estimation methods. However, for seismic data that contain noise, the accuracy and stability of Q extracted using CFS depend on the choice of frequency band. In order to reduce the influence of frequency band choices and obtain Q with greater precision and robustness, we present an improved CFS Q measurement approach—the weighted CFS method (WCFS), which incorporates a Gaussian weighting coefficient into the calculation procedure of the conventional CFS. The basic idea is to enhance the proportion of advantageous frequencies in the amplitude spectrum and reduce the weight of disadvantageous frequencies. In this novel method, we first construct a Gauss function using the centroid frequency and variance of the reference wavelet. Then we employ it as the weighting coefficient for the amplitude spectrum of the original signal. Finally, the conventional CFS is adopted for the weighted amplitude spectrum to extract the Q factor. Numerical tests of noise-free synthetic data demonstrate that the WCFS is feasible and efficient, and produces more accurate results than the conventional CFS. Tests for noisy synthetic data indicate that the new method has better anti-noise capability than the CFS. The application to field vertical seismic profile (VSP) data further demonstrates its validity5.

RANK and RANK ligand expression in primary human osteosarcoma

Directory of Open Access Journals (Sweden)

Daniel Branstetter

2015-09-01

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

Ranking nodes in growing networks: When PageRank fails

Science.gov (United States)

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

2015-11-01

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

Ranking the Project Management Success Factors for Construction Project in South India

Science.gov (United States)

Aneesha, K.; Haridharan, M. K.

2017-07-01

In Today’s construction industry, to achieve a greater advantage over the firms, success of each project and efficiency is required. Effective Project Management overcomes these types of challenges. This study identifies the success factors which are important for project management in construction project success. From the literature review, 26 factors were found to be critical. Project managers, construction managers, civil engineers, contractors and site engineers were the respondents. After analyzing the data in SPSS software, the dominant factors from the regression analysis are top management support, competent project team, abilities to solve problems, realistic cost and time estimates, information/communication, competency of the project manager are the 6 factors out of 12 in 26 factors. Effective communication between stakeholders got highest priority and client involvement, good leadership, clarity of project goals got second priority. Informal communication gives better results compared to formal communications like written formats. To remove communication barrier with the stakeholders, informal communication like speaking face-to-face with the language this fits for the stakeholders.

Shack-Hartmann centroid detection method based on high dynamic range imaging and normalization techniques

International Nuclear Information System (INIS)

Vargas, Javier; Gonzalez-Fernandez, Luis; Quiroga, Juan Antonio; Belenguer, Tomas

2010-01-01

In the optical quality measuring process of an optical system, including diamond-turning components, the use of a laser light source can produce an undesirable speckle effect in a Shack-Hartmann (SH) CCD sensor. This speckle noise can deteriorate the precision and accuracy of the wavefront sensor measurement. Here we present a SH centroid detection method founded on computer-based techniques and capable of measurement in the presence of strong speckle noise. The method extends the dynamic range imaging capabilities of the SH sensor through the use of a set of different CCD integration times. The resultant extended range spot map is normalized to accurately obtain the spot centroids. The proposed method has been applied to measure the optical quality of the main optical system (MOS) of the mid-infrared instrument telescope smulator. The wavefront at the exit of this optical system is affected by speckle noise when it is illuminated by a laser source and by air turbulence because it has a long back focal length (3017 mm). Using the proposed technique, the MOS wavefront error was measured and satisfactory results were obtained.

Implementing Relative Ranking Evaluation Framework at Department of Energy (DOE) installations

International Nuclear Information System (INIS)

Sharma, S.K.; Williamson, D.; Treichel, L.C.; James, L.M.

1996-01-01

The US Department of Energy (DOE) Office of Environmental Restoration (EM-40) has developed the Relative Ranking Evaluation Framework (RREF) to help categorize release sites, facilities and buildings requiring restoration or decommissioning. Based on this framework, a computer tool, the Relative Rank Evaluation Program (RREP) has been developed to evaluate release sites, facilities and buildings, and to manage information pertaining to relative ranking evaluations. The relative ranking information is being used by both Headquarters and field project managers, and other environmental personnel responsible for planning, executing and evaluation environmental restoration activities at DOE installations. External stakeholders, such as representatives of federal and state regulatory agencies, local governments and communities in the vicinity of current and formerly used DOE installations may use this data to review proposed and planned activities

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

Directory of Open Access Journals (Sweden)

Preisinger E

2007-01-01

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

The centroid shift of the 5d levels of Ce3+ with respect to the 4f levels in ionic crystals, a theoretical investigation

International Nuclear Information System (INIS)

Andriessen, J.; Dorenbos, P.; Eijk, C.W.E van

2002-01-01

The centroid shifts of the 5d level of Ce 3+ in BaF 2 , LaAlO 3 and LaCl 3 have been calculated using the ionic cluster approach. By applying configuration interaction as extension of the basic HF-LCAO approach the dynamical polarization contribution to the centroid shift was calculated. This was found to be only successful if basis sets are used optimized for polarization of the anions

Factorization of cp-rank-3 completely positive matrices

Czech Academy of Sciences Publication Activity Database

Brandts, J.; Křížek, Michal

2016-01-01

Roč. 66, č. 3 (2016), s. 955-970 ISSN 0011-4642 R&D Projects: GA ČR GA14-02067S Institutional support: RVO:67985840 Keywords : completely positive matrix * cp-rank * factorization Subject RIV: BA - General Mathematics Impact factor: 0.364, year: 2016 http://hdl.handle.net/10338.dmlcz/145882

On Locally Most Powerful Sequential Rank Tests

Czech Academy of Sciences Publication Activity Database

Kalina, Jan

2017-01-01

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

Research of Subgraph Estimation Page Rank Algorithm for Web Page Rank

Directory of Open Access Journals (Sweden)

LI Lan-yin

2017-04-01

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

How Should Journal Quality be Ranked? An Application to Agricultural, Energy, Environment and Resource Economics

NARCIS (Netherlands)

C-L. Chang (Chia-Lin); M.J. McAleer (Michael)

2011-01-01

textabstractExperts possess knowledge and information that are not publicly available. The paper is concerned with the ranking of academic journal quality and research impact using a survey of experts from a national project on ranking academic finance journals. A comparison is made with publicly

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

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan

2014-04-17

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

Low-rank coal research

Energy Technology Data Exchange (ETDEWEB)

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

1989-01-01

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

The mirror symmetric centroid difference method for picosecond lifetime measurements via {gamma}-{gamma} coincidences using very fast LaBr{sub 3}(Ce) scintillator detectors

Energy Technology Data Exchange (ETDEWEB)

Regis, J.-M., E-mail: regis@ikp.uni-koeln.d [Institut fuer Kernphysik, Universitaet zu Koeln, Zuelpicher Str. 77, 50937 Koeln (Germany); Pascovici, G.; Jolie, J.; Rudigier, M. [Institut fuer Kernphysik, Universitaet zu Koeln, Zuelpicher Str. 77, 50937 Koeln (Germany)

2010-10-01

The ultra-fast timing technique was introduced in the 1980s and is capable of measuring picosecond lifetimes of nuclear excited states with about 3 ps accuracy. Very fast scintillator detectors are connected to an electronic timing circuit and detector vs. detector time spectra are analyzed by means of the centroid shift method. The very good 3% energy resolution of the nowadays available LaBr{sub 3}(Ce) scintillator detectors for {gamma}-rays has made possible an extension of the well-established fast timing technique. The energy dependent fast timing characteristics or the prompt curve, respectively, of the LaBr{sub 3}(Ce) scintillator detector has been measured using a standard {sup 152}Eu {gamma}-ray source. For any energy combination in the range of 200keVcentroid shift method providing very attractive features for picosecond lifetime measurements is presented. The mirror symmetric centroid difference method takes advantage of the symmetry obtained when performing {gamma}-{gamma} lifetime measurements using a pair of almost identical very fast scintillator detectors. In particular cases, the use of the mirror symmetric centroid difference method also allows the direct determination of picosecond lifetimes, hence without the need of calibrating the prompt curve.

Ranking Based Locality Sensitive Hashing Enabled Cancelable Biometrics: Index-of-Max Hashing

OpenAIRE

Jin, Zhe; Lai, Yen-Lung; Hwang, Jung-Yeon; Kim, Soohyung; Teoh, Andrew Beng Jin

2017-01-01

In this paper, we propose a ranking based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed "Index-of-Max" (IoM) hashing for biometric template protection. With externally generated random parameters, IoM hashing transforms a real-valued biometric feature vector into discrete index (max ranked) hashed code. We demonstrate two realizations from IoM hashing notion, namely Gaussian Random Projection based and Uniformly Random Permutation based hashing schemes. The disc...

What do Experts Know About Ranking Journal Quality? A Comparison with ISI Research Impact in Finance

NARCIS (Netherlands)

C-L. Chang (Chia-Lin); M.J. McAleer (Michael)

2012-01-01

textabstractExperts possess knowledge and information that are not publicly available. The paper is concerned with the ranking of academic journal quality and research impact using a survey of experts from a national project on ranking academic finance journals. A comparison is made with publicly

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.

Quantum size correction to the work function and centroid of excess charge in positively ionized simple metal clusters

International Nuclear Information System (INIS)

Payami, M.

2004-01-01

In this work, we have shown the important role of the finite-size correction to the work function in predicting the correct position of the centroid of excess charge in positively charged simple metal clusters with different r s values (2≤ r s ≥ 7). For this purpose, firstly we have calculated the self-consistent Kohn-Sham energies of neutral and singly-ionized clusters with sizes 2≤ N ≥100 in the framework of local spin-density approximation and stabilized jellium model as well as simple jellium model with rigid jellium. Secondly, we have fitted our results to the asymptotic ionization formulas both with and without the size correction to the work function. The results of fittings show that the formula containing the size correction predict a correct position of the centroid inside the jellium while the other predicts a false position, outside the jellium sphere

The use of fuzzy real option valuation method to rank Giga ...

African Journals Online (AJOL)

The use of fuzzy real option valuation method to rank Giga Investment Projects on Iran's natural gas reserves. ... Journal of Fundamental and Applied Sciences ... methodology – discounted cash flow analysis – in valuation of Giga investments.

Demonstration of biased membrane static figure mapping by optical beam subpixel centroid shift

Energy Technology Data Exchange (ETDEWEB)

Pinto, Fabrizio, E-mail: fpinto@jazanu.edu.sa [Laboratory for Quantum Vacuum Applications, Department of Physics, Faculty of Science, Jazan University, P.O. Box 114, Gizan 45142 (Saudi Arabia)

2016-06-10

The measurement of Casimir forces by means of condenser microphones has been shown to be quite promising since its early introduction almost half-a-century ago. However, unlike the remarkable progress achieved in characterizing the vibrating membrane in the dynamical case, the accurate determination of the membrane static figure under electrostatic bias remains a challenge. In this paper, we discuss our first data obtained by measuring the centroid shift of an optical beam with subpixel accuracy by charge coupled device (CCD) and by an extensive analysis of noise sources present in the experimental setup.

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

Science.gov (United States)

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

2018-01-01

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

Sparse structure regularized ranking

KAUST Repository

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

2014-01-01

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

Quantum size correction to the work function and the centroid of excess charge in positively ionized simple metal clusters

Directory of Open Access Journals (Sweden)

M. Payami

2003-12-01

Full Text Available  In this work, we have shown the important role of the finite-size correction to the work function in predicting the correct position of the centroid of excess charge in positively charged simple metal clusters with different values . For this purpose, firstly we have calculated the self-consistent Kohn-Sham energies of neutral and singly-ionized clusters with sizes in the framework of local spin-density approximation and stabilized jellium model (SJM as well as simple jellium model (JM with rigid jellium. Secondly, we have fitted our results to the asymptotic ionization formulas both with and without the size correction to the work function. The results of fittings show that the formula containing the size correction predict a correct position of the centroid inside the jellium while the other predicts a false position, outside the jellium sphere.

Modelling Perception of Structure and Affect in Music: Spectral Centroid and Wishart's Red Bird

Directory of Open Access Journals (Sweden)

Roger T. Dean

2011-12-01

Full Text Available Pearce (2011 provides a positive and interesting response to our article on time series analysis of the influences of acoustic properties on real-time perception of structure and affect in a section of Trevor Wishart’s Red Bird (Dean & Bailes, 2010. We address the following topics raised in the response and our paper. First, we analyse in depth the possible influence of spectral centroid, a timbral feature of the acoustic stream distinct from the high level general parameter we used initially, spectral flatness. We find that spectral centroid, like spectral flatness, is not a powerful predictor of real-time responses, though it does show some features that encourage its continued consideration. Second, we discuss further the issue of studying both individual responses, and as in our paper, group averaged responses. We show that a multivariate Vector Autoregression model handles the grand average series quite similarly to those of individual members of our participant groups, and we analyse this in greater detail with a wide range of approaches in work which is in press and continuing. Lastly, we discuss the nature and intent of computational modelling of cognition using acoustic and music- or information theoretic data streams as predictors, and how the music- or information theoretic approaches may be applied to electroacoustic music, which is ‘sound-based’ rather than note-centred like Western classical music.

The centroidal algorithm in molecular similarity and diversity calculations on confidential datasets

Science.gov (United States)

Trepalin, Sergey; Osadchiy, Nikolay

2005-09-01

Chemical structure provides exhaustive description of a compound, but it is often proprietary and thus an impediment in the exchange of information. For example, structure disclosure is often needed for the selection of most similar or dissimilar compounds. Authors propose a centroidal algorithm based on structural fragments (screens) that can be efficiently used for the similarity and diversity selections without disclosing structures from the reference set. For an increased security purposes, authors recommend that such set contains at least some tens of structures. Analysis of reverse engineering feasibility showed that the problem difficulty grows with decrease of the screen's radius. The algorithm is illustrated with concrete calculations on known steroidal, quinoline, and quinazoline drugs. We also investigate a problem of scaffold identification in combinatorial library dataset. The results show that relatively small screens of radius equal to 2 bond lengths perform well in the similarity sorting, while radius 4 screens yield better results in diversity sorting. The software implementation of the algorithm taking SDF file with a reference set generates screens of various radii which are subsequently used for the similarity and diversity sorting of external SDFs. Since the reverse engineering of the reference set molecules from their screens has the same difficulty as the RSA asymmetric encryption algorithm, generated screens can be stored openly without further encryption. This approach ensures an end user transfers only a set of structural fragments and no other data. Like other algorithms of encryption, the centroid algorithm cannot give 100% guarantee of protecting a chemical structure from dataset, but probability of initial structure identification is very small-order of 10-40 in typical cases.

On Locally Most Powerful Sequential Rank Tests

Czech Academy of Sciences Publication Activity Database

Kalina, Jan

2017-01-01

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

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.

Multiple graph regularized protein domain ranking.

Science.gov (United States)

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

2012-11-19

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

Multiplex PageRank.

Directory of Open Access Journals (Sweden)

Arda Halu

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

Multiplex PageRank.

Science.gov (United States)

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

2013-01-01

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

Multiple graph regularized protein domain ranking

KAUST Repository

Wang, Jim Jing-Yan

2012-11-19

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

Multiple graph regularized protein domain ranking

KAUST Repository

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

2012-01-01

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

Multiple graph regularized protein domain ranking

Directory of Open Access Journals (Sweden)

Wang Jim

2012-11-01

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

Improving Ranking Using Quantum Probability

OpenAIRE

Melucci, Massimo

2011-01-01

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

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

Science.gov (United States)

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

2016-01-01

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

Neophilia Ranking of Scientific Journals.

Science.gov (United States)

Packalen, Mikko; Bhattacharya, Jay

2017-01-01

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

Hierarchical partial order ranking

International Nuclear Information System (INIS)

Carlsen, Lars

2008-01-01

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

A Survey on PageRank Computing

OpenAIRE

Berkhin, Pavel

2005-01-01

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

The LAILAPS Search Engine: Relevance Ranking in Life Science Databases

Directory of Open Access Journals (Sweden)

Lange Matthias

2010-06-01

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

Ranking transmission projects in large scale systems using an AC power flow model; Priorizacao de obras em sistemas de grande porte usando um modelo AC da rede

Energy Technology Data Exchange (ETDEWEB)

Melo, A C.G. [Centro de Pesquisas de Energia Eletrica (CEPEL), Rio de Janeiro, RJ (Brazil); Fontoura Filho, R N [ELETROBRAS, Rio de Janeiro, RJ (Brazil); Peres, L A.P. Pecorelli [FURNAS, Rio de Janeiro, RJ (Brazil); Morozowski Filho, M [Santa Catarina Univ., Florianopolis, SC (Brazil)

1994-12-31

Initially, this paper summarizes the approach developed by the Brazilian Planning Criteria Working Group (GTCP/ELETROBRAS) for identifying which subset of transmission investments should be postponed to meet a pre-stablished budget constraint with the least possible impact on system performance. Next, this paper presents the main features of the computational model PRIO, which allows the application of the ranking process to large scale power systems (2,000 buses and 3,000 circuits), with as many as 100 projects to be ranked. In this model, the adequacy analysis of each system state is carried out through an AC power flow coupled to a successive linear programming based remedial actions model. Case studies with the IEEE-RTS system and a configuration of the Brazilian Southeastern are presented and discussed. (author) 7 refs., 6 figs., 5 tabs.

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.

Centroid and full-width at half maximum uncertainties of histogrammed data with an underlying Gaussian distribution -- The moments method

International Nuclear Information System (INIS)

Valentine, J.D.; Rana, A.E.

1996-01-01

The effect of approximating a continuous Gaussian distribution with histogrammed data are studied. The expressions for theoretical uncertainties in centroid and full-width at half maximum (FWHM), as determined by calculation of moments, are derived using the error propagation method for a histogrammed Gaussian distribution. The results are compared with the corresponding pseudo-experimental uncertainties for computer-generated histogrammed Gaussian peaks to demonstrate the effect of binning the data. It is shown that increasing the number of bins in the histogram improves the continuous distribution approximation. For example, a FWHM ≥ 9 and FWHM ≥ 12 bins are needed to reduce the pseudo-experimental standard deviation of FWHM to within ≥5% and ≥1%, respectively, of the theoretical value for a peak containing 10,000 counts. In addition, the uncertainties in the centroid and FWHM as a function of peak area are studied. Finally, Sheppard's correction is applied to partially correct for the binning effect

Forward projections of energy market competitiveness rankings

International Nuclear Information System (INIS)

2008-01-01

By July 2007, the provisions of the second Internal Market Directives for Electricity and Gas had been implemented in the majority of EU Member States. These fundamental changes in market opening, ownership structures and network access conditions, together with the increasing maturity of liberalised trading and retail markets, can be expected to affect the behaviour of existing and potential market participants, consequently affecting the energy market competitiveness of alternative countries. While the UK was the most competitive of the EU and G7 energy markets in 2006, the dynamic effect of the liberalisation programme across Continental Europe may challenge that position in the future. This report assesses how competitiveness rankings may evolve in the future, identifying changes that could take place in the UK and the rest of the EU from 2007 to 201 1. It goes on to explore the potential risk that the competitiveness of the UK's energy markets will decline relative to those of other countries in the EU and G7, to the extent that the PSA target will not be met. A detailed analysis of the potential changes in the UK markets is undertaken, including the development of upside and downside scenarios showing the positive and negative effects of changes in market structure and behaviour on the UK's competitiveness score. Changes in market structures required for energy markets in both the 2006 comparator group and the rest of the EU to become as competitive as the UK are then assessed, along with the plausibility of these changes given the current and future market, legislative and regulatory environments

Exploiting Tensor Rank-One Decomposition in Probabilistic Inference

Czech Academy of Sciences Publication Activity Database

Savický, Petr; Vomlel, Jiří

2007-01-01

Roč. 43, č. 5 (2007), s. 747-764 ISSN 0023-5954 R&D Projects: GA MŠk 1M0545; GA MŠk 1M0572; GA ČR GA201/04/0393 Institutional research plan: CEZ:AV0Z10300504; CEZ:AV0Z10750506 Keywords : graphical probabilistic models * probabilistic inference * tensor rank Subject RIV: BD - Theory of Information Impact factor: 0.552, year: 2007 http://dml.cz/handle/10338.dmlcz/135810

University Rankings and Social Science

OpenAIRE

Marginson, S.

2014-01-01

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

24 CFR 599.401 - Ranking of applications.

Science.gov (United States)

2010-04-01

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

The Single-Molecule Centroid Localization Algorithm Improves the Accuracy of Fluorescence Binding Assays.

Science.gov (United States)

Hua, Boyang; Wang, Yanbo; Park, Seongjin; Han, Kyu Young; Singh, Digvijay; Kim, Jin H; Cheng, Wei; Ha, Taekjip

2018-03-13

Here, we demonstrate that the use of the single-molecule centroid localization algorithm can improve the accuracy of fluorescence binding assays. Two major artifacts in this type of assay, i.e., nonspecific binding events and optically overlapping receptors, can be detected and corrected during analysis. The effectiveness of our method was confirmed by measuring two weak biomolecular interactions, the interaction between the B1 domain of streptococcal protein G and immunoglobulin G and the interaction between double-stranded DNA and the Cas9-RNA complex with limited sequence matches. This analysis routine requires little modification to common experimental protocols, making it readily applicable to existing data and future experiments.

Low-rank coal study: national needs for resource development. Volume 3. Technology evaluation

Energy Technology Data Exchange (ETDEWEB)

1980-11-01

Technologies applicable to the development and use of low-rank coals are analyzed in order to identify specific needs for research, development, and demonstration (RD and D). Major sections of the report address the following technologies: extraction; transportation; preparation, handling and storage; conventional combustion and environmental control technology; gasification; liquefaction; and pyrolysis. Each of these sections contains an introduction and summary of the key issues with regard to subbituminous coal and lignite; description of all relevant technology, both existing and under development; a description of related environmental control technology; an evaluation of the effects of low-rank coal properties on the technology; and summaries of current commercial status of the technology and/or current RD and D projects relevant to low-rank coals.

Person-Environment Mergence and Separation: Otto Rank's Psychology of Emotion, Personality, and Culture.

Science.gov (United States)

Sullivan, Daniel

2016-12-01

Between 1924 and 1939 Otto Rank put forward three major elements of a comprehensive theoretical edifice that has yet to be fully articulated. These are conceptually linked by the fundamental importance of person-environment mergence and separation. Rank's theory of emotions highlights anxiety as the affect of separation, and guilt as the feeling that binds the individual to others. His personality theory distinguishes between the partialist, who responds to life fear with identification, and the totalist, who responds to death fear with projection. His cultural psychology contrasts primal collectivism with contemporary individualism, which orients the person toward individual immortality striving. Individualism has produced problematic self-consciousness and neuroticism, in the face of which Rank struggled to find a new psychology.

On Page Rank

NARCIS (Netherlands)

Hoede, C.

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

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

Simplex-centroid mixture formulation for optimised composting of kitchen waste.

Science.gov (United States)

Abdullah, N; Chin, N L

2010-11-01

Composting is a good recycling method to fully utilise all the organic wastes present in kitchen waste due to its high nutritious matter within the waste. In this present study, the optimised mixture proportions of kitchen waste containing vegetable scraps (V), fish processing waste (F) and newspaper (N) or onion peels (O) were determined by applying the simplex-centroid mixture design method to achieve the desired initial moisture content and carbon-to-nitrogen (CN) ratio for effective composting process. The best mixture was at 48.5% V, 17.7% F and 33.7% N for blends with newspaper while for blends with onion peels, the mixture proportion was 44.0% V, 19.7% F and 36.2% O. The predicted responses from these mixture proportions fall in the acceptable limits of moisture content of 50% to 65% and CN ratio of 20-40 and were also validated experimentally. Copyright 2010 Elsevier Ltd. All rights reserved.

CDF End Plug calorimeter Upgrade Project

International Nuclear Information System (INIS)

Apollinari, G.; de Barbaro, P.; Mishina, M.

1994-01-01

We report on the status of the CDF End Plug Upgrade Project. In this project, the CDF calorimeters in the end plug and the forward regions will be replaced by a single scintillator based calorimeter. After an extensive R ampersand D effort on the tile/fiber calorimetry, we have now advanced to a construction phase. We review the results of the R ampersand D leading to the final design of the calorimeters and the development of tooling devised for this project. The quality control program of the production of the electromagnetic and hadronic calorimeters is described. A shower maximum detector for the measurement of the shower centroid and the shower profile of electrons, γ and π 0 has been designed. Its performance requirements, R ampersand D results and mechanical design are discussed

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

KAUST Repository

Wang, Jim Jing-Yan

2017-06-28

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

University Rankings: The Web Ranking

Science.gov (United States)

Aguillo, Isidro F.

2012-01-01

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

Ranking Specific Sets of Objects.

Science.gov (United States)

Maly, Jan; Woltran, Stefan

2017-01-01

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

PageRank of integers

International Nuclear Information System (INIS)

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

2012-01-01

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

Ranking Support Vector Machine with Kernel Approximation.

Science.gov (United States)

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

2017-01-01

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

Ranking Support Vector Machine with Kernel Approximation

Directory of Open Access Journals (Sweden)

Kai Chen

2017-01-01

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

University Rankings and Social Science

Science.gov (United States)

Marginson, Simon

2014-01-01

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

Two-dimensional ranking of Wikipedia articles

Science.gov (United States)

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

2010-10-01

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

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

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

Universal scaling in sports ranking

International Nuclear Information System (INIS)

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

2012-01-01

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

Marine Hydrokinetic Energy Site Identification and Ranking Methodology Part I: Wave Energy

Energy Technology Data Exchange (ETDEWEB)

Kilcher, Levi [National Renewable Energy Lab. (NREL), Golden, CO (United States); Thresher, Robert [National Renewable Energy Lab. (NREL), Golden, CO (United States)

2016-10-01

Marine hydrokinetic energy is a promising and growing piece of the renewable energy sector that offers high predictability and additional energy sources for a diversified energy economy. This report investigates the market opportunities for wave energy along the U.S. coastlines. It is part one of a two-part investigation into the United State's two largest marine hydrokinetic resources (wave and tidal). Wave energy technology is still an emerging form of renewable energy for which large-scale, grid-connected project costs are currently poorly defined. Ideally, device designers would like to know the resource conditions at economical project sites so they can optimize device designs. On the other hand, project developers need detailed device cost data to identify sites where projects are economical. That is, device design and siting are, to some extent, a coupled problem. This work describes a methodology for identifying likely deployment locations based on a set of criteria that wave energy experts in industry, academia, and national laboratories agree are likely to be important factors for all technology types. This work groups the data for the six criteria into 'locales' that are defined as the smaller of either the local transmission grid or a state boundary. The former applies to U.S. islands (e.g., Hawaii, American Samoa) and rural villages (e.g., in Alaska); the latter applies to states in the contiguous United States. These data are then scored from 0 to 10 according to scoring functions that were developed with input from wave energy industry and academic experts. The scores are aggregated using a simple product method that includes a weighting factor for each criterion. This work presents two weighting scenarios: a long-term scenario that does not include energy price (weighted zero) and a near term scenario that includes energy price. The aggregated scores are then used to produce ranked lists of likely deployment locales. In both scenarios

Minkowski metrics in creating universal ranking algorithms

Directory of Open Access Journals (Sweden)

Andrzej Ameljańczyk

2014-06-01

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

Methodology for ranking restoration options

International Nuclear Information System (INIS)

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)

Recurrent fuzzy ranking methods

Science.gov (United States)

Hajjari, Tayebeh

2012-11-01

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

Ce3+ 5d-centroid shift and vacuum referred 4f-electron binding energies of all lanthanide impurities in 150 different compounds

International Nuclear Information System (INIS)

Dorenbos, Pieter

2013-01-01

A review on the wavelengths of all five 4f–5d transitions for Ce 3+ in about 150 different inorganic compounds (fluorides, chlorides, bromides, iodides, oxides, sulfides, selenides, nitrides) is presented. It provides data on the centroid shift and the crystal field splitting of the 5d-configuration which are then used to estimate the Eu 2+ inter 4f-electron Coulomb repulsion energy U(6,A) in compound A. The four semi-empirical models (the redshift model, the centroid shift model, the charge transfer model, and the chemical shift model) on lanthanide levels that were developed past 12 years are briefly reviewed. It will be demonstrated how those models together with the collected data of this work and elsewhere can be united to construct schemes that contain the binding energy of electrons in the 4f and 5d states for each divalent and each trivalent lanthanide ion relative to the vacuum energy. As example the vacuum referred binding energy schemes for LaF 3 and La 2 O 3 will be constructed. - Highlights: ► An compilation on all five Ce 3+ 4f–5d energies in 150 inorganic compounds is presented. ► The relationship between the 5d centroid shift and host cation electronegativity id demonstrated. ► The electronic structure scheme of the lanthanides in La 2 O 3 and LaF 3 is presented.

Ranking Operations Management conferences

NARCIS (Netherlands)

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

2007-01-01

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

The BACON Approach for Rank-Deficient Data

Directory of Open Access Journals (Sweden)

Athanassios Kondylis

2012-07-01

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

Depth to the bottom of magnetic sources (DBMS) from aeromagnetic data of Central India using modified centroid method for fractal distribution of sources

Science.gov (United States)

Bansal, A. R.; Anand, S. P.; Rajaram, Mita; Rao, V. K.; Dimri, V. P.

2013-09-01

The depth to the bottom of the magnetic sources (DBMS) has been estimated from the aeromagnetic data of Central India. The conventional centroid method of DBMS estimation assumes random uniform uncorrelated distribution of sources and to overcome this limitation a modified centroid method based on scaling distribution has been proposed. Shallower values of the DBMS are found for the south western region. The DBMS values are found as low as 22 km in the south west Deccan trap covered regions and as deep as 43 km in the Chhattisgarh Basin. In most of the places DBMS are much shallower than the Moho depth, earlier found from the seismic study and may be representing the thermal/compositional/petrological boundaries. The large variation in the DBMS indicates the complex nature of the Indian crust.

Country-specific determinants of world university rankings

OpenAIRE

Pietrucha, Jacek

2017-01-01

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

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

Science.gov (United States)

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

2017-06-15

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

Universal emergence of PageRank

Energy Technology Data Exchange (ETDEWEB)

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

2011-11-18

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

Universal emergence of PageRank

International Nuclear Information System (INIS)

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

2011-01-01

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

Ranking of Delay Factors for Makkah’s Construction Industry

Directory of Open Access Journals (Sweden)

Al-Emad Nashwan

2017-01-01

Full Text Available This paper presents identification of significant delay factors encountered by Makkah’s construction industry using quantitative approach. A structured questionnaire developed based on literature review was verified through pilot study involved selected construction experts. Questionnaire survey was conducted amongst Makkah construction practitioners include contractors, consultants and project management consultancy. The survey managed to collect 100 valid responses which were used to rank the factors using average index approach. Results of the analysis for 10 most significant factors causing construction delay in Makkah construction industry are Difficulties in financing project by contractor, Poor coordination between parties, Shortage of manpower, Delays in producing design documents, Improper planning and scheduling of the project, Delay in progress payments, Low productivity level of labour, Poor communication between parties, Unqualified workforce and Poor contract management. This finding is helpful to Makkah construction’s community particularly projects’ stakeholders in avoiding potential delay for their future projects.

A walk-free centroid method for lifetime measurements with pulsed beams

International Nuclear Information System (INIS)

Julin, R.; Kantele, J.; Luontama, M.; Passoja, A.; Poikolainen, T.

1977-09-01

A delayed-coincidence lifetime measurement method based on a comparison of walk-free centroids of time spectra is presented. The time is measured between the cyclotron RF signal and the pulse from a plastic scintillation detector followed by a fixed energy selection. The events to be time-analyzed are selected from the associated charge-particle spectrum of a silicon detector which is operated in coincidence with the scintillator, i.e., independently of the formation of the signal containing the time information. With this technique, with the micropulse FWHM of typically 500 to 700 ps, half-lives down to the 10 ps region can be measured. The following half-lives are obtained with the new method: 160+-6 ps for the 2032 keV level in 209 Pb; 45+-10 ps and 160+-20 ps for the 1756.8 keV (0 2 + ) and 2027.3 keV (0 3 + ) levels in 116 Sn, respectively. (author)

A Ranking Approach to Genomic Selection.

Science.gov (United States)

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

2015-01-01

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

Dynamic Matrix Rank

DEFF Research Database (Denmark)

Frandsen, Gudmund Skovbjerg; Frandsen, Peter Frands

2009-01-01

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

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.

Hitting the Rankings Jackpot

Science.gov (United States)

Chapman, David W.

2008-01-01

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

Annual evaluation of routine radiological survey/monitoring frequencies for the High Ranking Facilities Deactivating Project at Oak Ridge, Tennessee

International Nuclear Information System (INIS)

1998-12-01

The Bethel Valley Watershed at the Oak Ridge National Laboratory (ORNL) has several Environmental Management (EM) facilities that are designated for deactivation and subsequent decontamination and decommissioning (D and D). The Surplus Facilities Program at ORNL provides surveillance and maintenance support for these facilities as deactivation objectives are completed to reduce the risks associated with radioactive material inventories, etc. The Bechtel Jacobs Company LLC Radiological Control (RADCON) Program has established requirements for radiological monitoring and surveying radiological conditions in these facilities. These requirements include an annual evaluation of routine radiation survey and monitoring frequencies. Radiological survey/monitoring frequencies were evaluated for two High Ranking Facilities Deactivation Project facilities, the Bulk Shielding Facility and Tower Shielding Facility. Considerable progress has been made toward accomplishing deactivation objectives, thus the routine radiological survey/monitoring frequencies are being reduced for 1999. This report identifies the survey/monitoring frequency adjustments and provides justification that the applicable RADCON Program requirements are also satisfied

Ranking adverse drug reactions with crowdsourcing.

Science.gov (United States)

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

2015-03-23

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

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.

Low-rank coal study : national needs for resource development. Volume 2. Resource characterization

Energy Technology Data Exchange (ETDEWEB)

1980-11-01

Comprehensive data are presented on the quantity, quality, and distribution of low-rank coal (subbituminous and lignite) deposits in the United States. The major lignite-bearing areas are the Fort Union Region and the Gulf Lignite Region, with the predominant strippable reserves being in the states of North Dakota, Montana, and Texas. The largest subbituminous coal deposits are in the Powder River Region of Montana and Wyoming, The San Juan Basin of New Mexico, and in Northern Alaska. For each of the low-rank coal-bearing regions, descriptions are provided of the geology; strippable reserves; active and planned mines; classification of identified resources by depth, seam thickness, sulfur content, and ash content; overburden characteristics; aquifers; and coal properties and characteristics. Low-rank coals are distinguished from bituminous coals by unique chemical and physical properties that affect their behavior in extraction, utilization, or conversion processes. The most characteristic properties of the organic fraction of low-rank coals are the high inherent moisture and oxygen contents, and the correspondingly low heating value. Mineral matter (ash) contents and compositions of all coals are highly variable; however, low-rank coals tend to have a higher proportion of the alkali components CaO, MgO, and Na/sub 2/O. About 90% of the reserve base of US low-rank coal has less than one percent sulfur. Water resources in the major low-rank coal-bearing regions tend to have highly seasonal availabilities. Some areas appear to have ample water resources to support major new coal projects; in other areas such as Texas, water supplies may be constraining factor on development.

Ranking scientific publications: the effect of nonlinearity

Science.gov (United States)

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

2014-10-01

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

Ranking scientific publications: the effect of nonlinearity.

Science.gov (United States)

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

2014-10-17

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

Text mixing shapes the anatomy of rank-frequency distributions

Science.gov (United States)

Williams, Jake Ryland; Bagrow, James P.; Danforth, Christopher M.; Dodds, Peter Sheridan

2015-05-01

Natural languages are full of rules and exceptions. One of the most famous quantitative rules is Zipf's law, which states that the frequency of occurrence of a word is approximately inversely proportional to its rank. Though this "law" of ranks has been found to hold across disparate texts and forms of data, analyses of increasingly large corpora since the late 1990s have revealed the existence of two scaling regimes. These regimes have thus far been explained by a hypothesis suggesting a separability of languages into core and noncore lexica. Here we present and defend an alternative hypothesis that the two scaling regimes result from the act of aggregating texts. We observe that text mixing leads to an effective decay of word introduction, which we show provides accurate predictions of the location and severity of breaks in scaling. Upon examining large corpora from 10 languages in the Project Gutenberg eBooks collection, we find emphatic empirical support for the universality of our claim.

Stakeholder preferences towards the sustainable development of CDM projects: Lessons from biomass (rice husk) CDM project in Thailand

International Nuclear Information System (INIS)

Parnphumeesup, Piya; Kerr, Sandy A.

2011-01-01

This research applies both quantitative and qualitative methods to investigate stakeholder preferences towards sustainable development (SD) priorities in Clean Development Mechanism (CDM) projects. The CDM's contribution to SD is explored in the context of a biomass (rice husk) case study conducted in Thailand. Quantitative analysis ranks increasing the usage of renewable energy as the highest priority, followed by employment and technology transfer. Air pollution (dust) is ranked as the most important problem. Preference weights expressed by experts and local resident are statistically different in the cases of: employment generation; emission reductions; dust; waste disposal; and noise. Qualitative results, suggest that rice husk CDM projects contribute significantly to SD in terms of employment generation, an increase in usage of renewable energy, and transfer of knowledge. However, rice husk biomass projects create a potential negative impact on air quality. In order to ensure the environmental sustainability of CDM projects, stakeholders suggest that Thailand should cancel an Environmental Impact Assessment (EIA) exemption for CDM projects with an installed capacity below 10 MW and apply it to all CDM projects. - Highlights: → Stakeholders rank increasing the usage of renewable energy as the highest priority. → Biomass (rice husk) CDM projects create a potential negative impact on air quality. → Rice husk CDM projects cannot give an extra income to farmers. → Preference weights expressed by experts and local residents are statistically different.

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.

Country-specific determinants of world university rankings.

Science.gov (United States)

Pietrucha, Jacek

2018-01-01

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

Ranking in evolving complex networks

Science.gov (United States)

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

2017-05-01

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

Projected changes of rainfall seasonality and dry spells in a high greenhouse gas emissions scenario

OpenAIRE

Pascale, Salvatore; Lucarini, Valerio; Feng, Xue; Porporato, Amilcare; ul Hasson, Shabeh

2016-01-01

In this diagnostic study we analyze changes of rainfall seasonality and dry spells by the end of the twenty-first century under the most extreme IPCC5 emission scenario (RCP8.5) as projected by twenty-four coupled climate models contributing to Coupled Model Intercomparison Project 5 (CMIP5). We use estimates of the centroid of the monthly rainfall distribution as an index of the rainfall timing and a threshold-independent, information theory-based quantity such as relative entropy (RE) to qu...

An improved Greengenes taxonomy with explicit ranks for ecological and evolutionary analyses of bacteria and archaea.

Science.gov (United States)

McDonald, Daniel; Price, Morgan N; Goodrich, Julia; Nawrocki, Eric P; DeSantis, Todd Z; Probst, Alexander; Andersen, Gary L; Knight, Rob; Hugenholtz, Philip

2012-03-01

Reference phylogenies are crucial for providing a taxonomic framework for interpretation of marker gene and metagenomic surveys, which continue to reveal novel species at a remarkable rate. Greengenes is a dedicated full-length 16S rRNA gene database that provides users with a curated taxonomy based on de novo tree inference. We developed a 'taxonomy to tree' approach for transferring group names from an existing taxonomy to a tree topology, and used it to apply the Greengenes, National Center for Biotechnology Information (NCBI) and cyanoDB (Cyanobacteria only) taxonomies to a de novo tree comprising 408,315 sequences. We also incorporated explicit rank information provided by the NCBI taxonomy to group names (by prefixing rank designations) for better user orientation and classification consistency. The resulting merged taxonomy improved the classification of 75% of the sequences by one or more ranks relative to the original NCBI taxonomy with the most pronounced improvements occurring in under-classified environmental sequences. We also assessed candidate phyla (divisions) currently defined by NCBI and present recommendations for consolidation of 34 redundantly named groups. All intermediate results from the pipeline, which includes tree inference, jackknifing and transfer of a donor taxonomy to a recipient tree (tax2tree) are available for download. The improved Greengenes taxonomy should provide important infrastructure for a wide range of megasequencing projects studying ecosystems on scales ranging from our own bodies (the Human Microbiome Project) to the entire planet (the Earth Microbiome Project). The implementation of the software can be obtained from http://sourceforge.net/projects/tax2tree/.

Acquisition and Initial Analysis of H+- and H--Beam Centroid Jitter at LANSCE

Science.gov (United States)

Gilpatrick, J. D.; Bitteker, L.; Gulley, M. S.; Kerstiens, D.; Oothoudt, M.; Pillai, C.; Power, J.; Shelley, F.

2006-11-01

During the 2005 Los Alamos Neutron Science Center (LANSCE) beam runs, beam current and centroid-jitter data were observed, acquired, analyzed, and documented for both the LANSCE H+ and H- beams. These data were acquired using three beam position monitors (BPMs) from the 100-MeV Isotope Production Facility (IPF) beam line and three BPMs from the Switchyard transport line at the end of the LANSCE 800-MeV linac. The two types of data acquired, intermacropulse and intramacropulse, were analyzed for statistical and frequency characteristics as well as various other correlations including comparing their phase-space like characteristics in a coordinate system of transverse angle versus transverse position. This paper will briefly describe the measurements required to acquire these data, the initial analysis of these jitter data, and some interesting dilemmas these data presented.

Inhibition of osteoclastogenesis by RNA interference targeting RANK

Directory of Open Access Journals (Sweden)

Ma Ruofan

2012-08-01

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

On Rank and Nullity

Science.gov (United States)

Dobbs, David E.

2012-01-01

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

Ranking economic history journals

DEFF Research Database (Denmark)

Di Vaio, Gianfranco; Weisdorf, Jacob Louis

2010-01-01

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

Ranking Economic History Journals

DEFF Research Database (Denmark)

Di Vaio, Gianfranco; Weisdorf, Jacob Louis

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

A Universal Rank-Size Law

Science.gov (United States)

2016-01-01

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

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

Science.gov (United States)

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

2013-01-01

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

Block models and personalized PageRank.

Science.gov (United States)

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

2017-01-03

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

Reconstruction of brachytherapy seed positions and orientations from cone-beam CT x-ray projections via a novel iterative forward projection matching method.

Science.gov (United States)

Pokhrel, Damodar; Murphy, Martin J; Todor, Dorin A; Weiss, Elisabeth; Williamson, Jeffrey F

2011-01-01

To generalize and experimentally validate a novel algorithm for reconstructing the 3D pose (position and orientation) of implanted brachytherapy seeds from a set of a few measured 2D cone-beam CT (CBCT) x-ray projections. The iterative forward projection matching (IFPM) algorithm was generalized to reconstruct the 3D pose, as well as the centroid, of brachytherapy seeds from three to ten measured 2D projections. The gIFPM algorithm finds the set of seed poses that minimizes the sum-of-squared-difference of the pixel-by-pixel intensities between computed and measured autosegmented radiographic projections of the implant. Numerical simulations of clinically realistic brachytherapy seed configurations were performed to demonstrate the proof of principle. An in-house machined brachytherapy phantom, which supports precise specification of seed position and orientation at known values for simulated implant geometries, was used to experimentally validate this algorithm. The phantom was scanned on an ACUITY CBCT digital simulator over a full 660 sinogram projections. Three to ten x-ray images were selected from the full set of CBCT sinogram projections and postprocessed to create binary seed-only images. In the numerical simulations, seed reconstruction position and orientation errors were approximately 0.6 mm and 5 degrees, respectively. The physical phantom measurements demonstrated an absolute positional accuracy of (0.78 +/- 0.57) mm or less. The theta and phi angle errors were found to be (5.7 +/- 4.9) degrees and (6.0 +/- 4.1) degrees, respectively, or less when using three projections; with six projections, results were slightly better. The mean registration error was better than 1 mm/6 degrees compared to the measured seed projections. Each test trial converged in 10-20 iterations with computation time of 12-18 min/iteration on a 1 GHz processor. This work describes a novel, accurate, and completely automatic method for reconstructing seed orientations, as well as

Reconstruction of brachytherapy seed positions and orientations from cone-beam CT x-ray projections via a novel iterative forward projection matching method

Energy Technology Data Exchange (ETDEWEB)

Pokhrel, Damodar; Murphy, Martin J.; Todor, Dorin A.; Weiss, Elisabeth; Williamson, Jeffrey F. [Department of Radiation Oncology, School of Medicine, Virginia Commonwealth University, Richmond, Virginia 23298 (United States)

2011-01-15

Purpose: To generalize and experimentally validate a novel algorithm for reconstructing the 3D pose (position and orientation) of implanted brachytherapy seeds from a set of a few measured 2D cone-beam CT (CBCT) x-ray projections. Methods: The iterative forward projection matching (IFPM) algorithm was generalized to reconstruct the 3D pose, as well as the centroid, of brachytherapy seeds from three to ten measured 2D projections. The gIFPM algorithm finds the set of seed poses that minimizes the sum-of-squared-difference of the pixel-by-pixel intensities between computed and measured autosegmented radiographic projections of the implant. Numerical simulations of clinically realistic brachytherapy seed configurations were performed to demonstrate the proof of principle. An in-house machined brachytherapy phantom, which supports precise specification of seed position and orientation at known values for simulated implant geometries, was used to experimentally validate this algorithm. The phantom was scanned on an ACUITY CBCT digital simulator over a full 660 sinogram projections. Three to ten x-ray images were selected from the full set of CBCT sinogram projections and postprocessed to create binary seed-only images. Results: In the numerical simulations, seed reconstruction position and orientation errors were approximately 0.6 mm and 5 deg., respectively. The physical phantom measurements demonstrated an absolute positional accuracy of (0.78{+-}0.57) mm or less. The {theta} and {phi} angle errors were found to be (5.7{+-}4.9) deg. and (6.0{+-}4.1) deg., respectively, or less when using three projections; with six projections, results were slightly better. The mean registration error was better than 1 mm/6 deg. compared to the measured seed projections. Each test trial converged in 10-20 iterations with computation time of 12-18 min/iteration on a 1 GHz processor. Conclusions: This work describes a novel, accurate, and completely automatic method for reconstructing

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.

Comparing classical and quantum PageRanks

Science.gov (United States)

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

2017-01-01

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

Simultaneous auto-calibration and gradient delays estimation (SAGE) in non-Cartesian parallel MRI using low-rank constraints.

Science.gov (United States)

Jiang, Wenwen; Larson, Peder E Z; Lustig, Michael

2018-03-09

To correct gradient timing delays in non-Cartesian MRI while simultaneously recovering corruption-free auto-calibration data for parallel imaging, without additional calibration scans. The calibration matrix constructed from multi-channel k-space data should be inherently low-rank. This property is used to construct reconstruction kernels or sensitivity maps. Delays between the gradient hardware across different axes and RF receive chain, which are relatively benign in Cartesian MRI (excluding EPI), lead to trajectory deviations and hence data inconsistencies for non-Cartesian trajectories. These in turn lead to higher rank and corrupted calibration information which hampers the reconstruction. Here, a method named Simultaneous Auto-calibration and Gradient delays Estimation (SAGE) is proposed that estimates the actual k-space trajectory while simultaneously recovering the uncorrupted auto-calibration data. This is done by estimating the gradient delays that result in the lowest rank of the calibration matrix. The Gauss-Newton method is used to solve the non-linear problem. The method is validated in simulations using center-out radial, projection reconstruction and spiral trajectories. Feasibility is demonstrated on phantom and in vivo scans with center-out radial and projection reconstruction trajectories. SAGE is able to estimate gradient timing delays with high accuracy at a signal to noise ratio level as low as 5. The method is able to effectively remove artifacts resulting from gradient timing delays and restore image quality in center-out radial, projection reconstruction, and spiral trajectories. The low-rank based method introduced simultaneously estimates gradient timing delays and provides accurate auto-calibration data for improved image quality, without any additional calibration scans. © 2018 International Society for Magnetic Resonance in Medicine.

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.

Contests with rank-order spillovers

NARCIS (Netherlands)

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

2012-01-01

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

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.

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.

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

OpenAIRE

Deyasi, Krishanu

2016-01-01

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

THE SLOAN DIGITAL SKY SURVEY REVERBERATION MAPPING PROJECT: BIASES IN z  > 1.46 REDSHIFTS DUE TO QUASAR DIVERSITY

Energy Technology Data Exchange (ETDEWEB)

Denney, K. D.; Peterson, B. M. [Department of Astronomy, The Ohio State University, 140 West 18th Avenue, Columbus, OH 43210 (United States); Horne, Keith [SUPA Physics and Astronomy, University of St. Andrews, St. Andrews KY16 9SS (United Kingdom); Brandt, W. N.; Grier, C. J.; Trump, J. R. [Department of Astronomy and Astrophysics, 525 Davey Lab, The Pennsylvania State University, University Park, PA 16802 (United States); Ho, Luis C. [Kavli Institute for Astronomy and Astrophysics, Peking University, Beijing 100871 (China); Ge, J., E-mail: denney@astronomy.ohio-state.edu [Astronomy Department University of Florida 211 Bryant Space Science Center P.O. Box 112055 Gainesville, FL 32611-2055 (United States)

2016-12-10

We use the coadded spectra of 32 epochs of Sloan Digital Sky Survey (SDSS) Reverberation Mapping Project observations of 482 quasars with z  > 1.46 to highlight systematic biases in the SDSS- and Baryon Oscillation Spectroscopic Survey (BOSS)-pipeline redshifts due to the natural diversity of quasar properties. We investigate the characteristics of this bias by comparing the BOSS-pipeline redshifts to an estimate from the centroid of He ii λ 1640. He ii has a low equivalent width but is often well-defined in high-S/N spectra, does not suffer from self-absorption, and has a narrow component which, when present (the case for about half of our sources), produces a redshift estimate that, on average, is consistent with that determined from [O ii] to within the He ii and [O ii] centroid measurement uncertainties. The large redshift differences of ∼1000 km s{sup −1}, on average, between the BOSS-pipeline and He ii-centroid redshifts, suggest there are significant biases in a portion of BOSS quasar redshift measurements. Adopting the He ii-based redshifts shows that C iv does not exhibit a ubiquitous blueshift for all quasars, given the precision probed by our measurements. Instead, we find a distribution of C iv-centroid blueshifts across our sample, with a dynamic range that (i) is wider than that previously reported for this line, and (ii) spans C iv centroids from those consistent with the systemic redshift to those with significant blueshifts of thousands of kilometers per second. These results have significant implications for measurement and use of high-redshift quasar properties and redshifts, and studies based thereon.

THE SLOAN DIGITAL SKY SURVEY REVERBERATION MAPPING PROJECT: BIASES IN z  > 1.46 REDSHIFTS DUE TO QUASAR DIVERSITY

International Nuclear Information System (INIS)

Denney, K. D.; Peterson, B. M.; Horne, Keith; Brandt, W. N.; Grier, C. J.; Trump, J. R.; Ho, Luis C.; Ge, J.

2016-01-01

We use the coadded spectra of 32 epochs of Sloan Digital Sky Survey (SDSS) Reverberation Mapping Project observations of 482 quasars with z  > 1.46 to highlight systematic biases in the SDSS- and Baryon Oscillation Spectroscopic Survey (BOSS)-pipeline redshifts due to the natural diversity of quasar properties. We investigate the characteristics of this bias by comparing the BOSS-pipeline redshifts to an estimate from the centroid of He ii λ 1640. He ii has a low equivalent width but is often well-defined in high-S/N spectra, does not suffer from self-absorption, and has a narrow component which, when present (the case for about half of our sources), produces a redshift estimate that, on average, is consistent with that determined from [O ii] to within the He ii and [O ii] centroid measurement uncertainties. The large redshift differences of ∼1000 km s −1 , on average, between the BOSS-pipeline and He ii-centroid redshifts, suggest there are significant biases in a portion of BOSS quasar redshift measurements. Adopting the He ii-based redshifts shows that C iv does not exhibit a ubiquitous blueshift for all quasars, given the precision probed by our measurements. Instead, we find a distribution of C iv-centroid blueshifts across our sample, with a dynamic range that (i) is wider than that previously reported for this line, and (ii) spans C iv centroids from those consistent with the systemic redshift to those with significant blueshifts of thousands of kilometers per second. These results have significant implications for measurement and use of high-redshift quasar properties and redshifts, and studies based thereon.

Collective centroid oscillations as an emittance preservation diagnostic in linear collider linacs

International Nuclear Information System (INIS)

Adolphsen, C.E.; Bane, K.L.F.; Spence, W.L.; Woodley, M.D.

1997-08-01

Transverse bunch centroid oscillations, induced at operating beam currents at which transverse wakefields are substantial, and observed at Beam Position Monitors, are sensitive to the actual magnetic focusing, energy gain, and rf phase profiles in a linac, and are insensitive to misalignments and jitter sources. In the pulse stealing set-up implemented at the SLC, they thus allow the frequent monitoring of the stability of the in-place emittance growth inhibiting or mitigating measures--primarily the energy scaled magnetic lattice and the rf phases necessary for BNS damping--independent of the actual emittance growth as driven by misalignments and jitter. The authors have developed a physically based analysis technique to meaningfully reduce the data. Oscillation beta-beating is a primary indicator of beam energy errors; shifts in the invariant amplitude reflect differential internal motion along the longitudinally extended bunch and thus are a sensitive indicator of the real rf phases in the machine; shifts in betatron phase advance contain corroborative information sensitive to both effects

Ranking of small scale proposals for water system repair using the Rapid Impact Assessment Matrix (RIAM)

Energy Technology Data Exchange (ETDEWEB)

Shakib-Manesh, T.E.; Hirvonen, K.O.; Jalava, K.J.; Ålander, T.; Kuitunen, M.T., E-mail: markku.kuitunen@jyu.fi

2014-11-15

Environmental impacts of small scale projects are often assessed poorly, or not assessed at all. This paper examines the usability of the Rapid Impact Assessment Matrix (RIAM) as a tool to prioritize project proposals for small scale water restoration projects in relation to proposals' potential to improve the environment. The RIAM scoring system was used to assess and rank the proposals based on their environmental impacts, the costs of the projects to repair the harmful impacts, and the size of human population living around the sites. A four-member assessment group (The expert panel) gave the RIAM-scores to the proposals. The assumed impacts of the studied projects at the Eastern Finland water systems were divided into the ecological and social impacts. The more detailed assessment categories of the ecological impacts in this study were impacts on landscape, natural state, and limnology. The social impact categories were impacts to recreational use of the area, fishing, industry, population, and economy. These impacts were scored according to their geographical and social significance, their magnitude of change, their character, permanence, reversibility, and cumulativeness. The RIAM method proved to be an appropriate and recommendable method for the small-scale assessment and prioritizing of project proposals. If the assessments are well documented, the RIAM can be a method for easy assessing and comparison of the various kinds of projects. In the studied project proposals there were no big surprises in the results: the best ranks were received by the projects, which were assumed to return watersheds toward their original state.

Ranking of small scale proposals for water system repair using the Rapid Impact Assessment Matrix (RIAM)

International Nuclear Information System (INIS)

Shakib-Manesh, T.E.; Hirvonen, K.O.; Jalava, K.J.; Ålander, T.; Kuitunen, M.T.

2014-01-01

Environmental impacts of small scale projects are often assessed poorly, or not assessed at all. This paper examines the usability of the Rapid Impact Assessment Matrix (RIAM) as a tool to prioritize project proposals for small scale water restoration projects in relation to proposals' potential to improve the environment. The RIAM scoring system was used to assess and rank the proposals based on their environmental impacts, the costs of the projects to repair the harmful impacts, and the size of human population living around the sites. A four-member assessment group (The expert panel) gave the RIAM-scores to the proposals. The assumed impacts of the studied projects at the Eastern Finland water systems were divided into the ecological and social impacts. The more detailed assessment categories of the ecological impacts in this study were impacts on landscape, natural state, and limnology. The social impact categories were impacts to recreational use of the area, fishing, industry, population, and economy. These impacts were scored according to their geographical and social significance, their magnitude of change, their character, permanence, reversibility, and cumulativeness. The RIAM method proved to be an appropriate and recommendable method for the small-scale assessment and prioritizing of project proposals. If the assessments are well documented, the RIAM can be a method for easy assessing and comparison of the various kinds of projects. In the studied project proposals there were no big surprises in the results: the best ranks were received by the projects, which were assumed to return watersheds toward their original state

NNP-LANL Utilities - Condition Assessment and Project Approach

Energy Technology Data Exchange (ETDEWEB)

Stewart, Grant Lorenz [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2017-11-21

This report is a presentation on LANL Utilities & Transportation Asset Management; Utility Assets Overview; Condition Assessment; Utilities Project Nominations & Ranking; and Utilities Project Execution.

Diversifying customer review rankings.

Science.gov (United States)

Krestel, Ralf; Dokoohaki, Nima

2015-06-01

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

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

Science.gov (United States)

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

2015-01-01

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

Algebraic and computational aspects of real tensor ranks

CERN Document Server

Sakata, Toshio; Miyazaki, Mitsuhiro

2016-01-01

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

Multi-site risk-based project planning, optimization, sequencing and budgeting process and tool for the integrated facility disposition project - 59394

International Nuclear Information System (INIS)

Nelson, Jerel; Castillo, Carlos; Huntsman, Julie; Lucek, Heather; Marks, Tim

2012-01-01

Document available in abstract form only. Full text of publication follows: Faced with the DOE Complex Transformation, NNSA was tasked with developing an integrated plan for the decommissioning of over 400 facilities and 300 environmental remediation units, as well as the many reconfiguration and modernization projects at the Oak Ridge National Laboratory (ORNL) and Y-12 Complex. Manual scheduling of remediation activities is time-consuming, labor intensive, and inherently introduces bias and unaccounted for aspects of the scheduler or organization in the process. Clearly a tool was needed to develop an objective, unbiased baseline optimized project sequence and schedule with a sound technical foundation for the Integrated Facility Disposition Project (IFDP). In generating an integrated disposition schedule, each project (including facilities, environmental sites, and remedial action units) was identified, characterized, then ranked relative to other projects. Risk matrices allowed for core project data to be extrapolated into probable contamination levels, relative risks to the public, and other technical and risk parameters to be used in the development of an overall ranking. These matrices ultimately generated a complete data set that were used in the Ranking and Sequencing Model (RSM), commonly referred to as the SUPER model, for its numerous abilities to support D and D planning, prioritization, and sequencing

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

Augmenting the Deliberative Method for Ranking Risks.

Science.gov (United States)

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

2016-01-01

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

Combining AHP and DEA Methods for Selecting a Project Manager

Directory of Open Access Journals (Sweden)

Baruch Keren

2014-07-01

Full Text Available A project manager has a major influence on the success or failure of the project. A good project manager can match between the strategy and objectives of the organization and the goals of the project. Therefore, the selection of the appropriate project manager is a key factor for the success of the project. A potential project manager is judged by his or her proven performance and personal qualifications. This paper proposes a method to calculate the weighted scores and the full rank of candidates for managing a project, and to select the best of those candidates. The proposed method combines specific methodologies: the Data Envelopment Analysis (DEA and the Analytical Hierarchical Process (AHP and uses DEA Ranking Methods to enhance selection.

Simulation of plume rise: Study the effect of stably stratified turbulence layer on the rise of a buoyant plume from a continuous source by observing the plume centroid

Science.gov (United States)

Bhimireddy, Sudheer Reddy; Bhaganagar, Kiran

2016-11-01

Buoyant plumes are common in atmosphere when there exists a difference in temperature or density between the source and its ambience. In a stratified environment, plume rise happens until the buoyancy variation exists between the plume and ambience. In a calm no wind ambience, this plume rise is purely vertical and the entrainment happens because of the relative motion of the plume with ambience and also ambient turbulence. In this study, a plume centroid is defined as the plume mass center and is calculated from the kinematic equation which relates the rate of change of centroids position to the plume rise velocity. Parameters needed to describe the plume are considered as the plume radius, plumes vertical velocity and local buoyancy of the plume. The plume rise velocity is calculated by the mass, momentum and heat conservation equations in their differential form. Our study focuses on the entrainment velocity, as it depicts the extent of plume growth. This entrainment velocity is made up as sum of fractions of plume's relative velocity and ambient turbulence. From the results, we studied the effect of turbulence on the plume growth by observing the variation in the plume radius at different heights and the centroid height reached before loosing its buoyancy.

The Privilege of Ranking: Google Plays Ball.

Science.gov (United States)

Wiggins, Richard

2003-01-01

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

Probabilistic relation between In-Degree and PageRank

NARCIS (Netherlands)

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

2008-01-01

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

PageRank, HITS and a unified framework for link analysis

Energy Technology Data Exchange (ETDEWEB)

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

2001-10-01

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

Generalized PageRank on Directed Configuration Networks

NARCIS (Netherlands)

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

2017-01-01

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

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

Ranking Theory and Conditional Reasoning.

Science.gov (United States)

Skovgaard-Olsen, Niels

2016-05-01

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

Peak-locking centroid bias in Shack-Hartmann wavefront sensing

Science.gov (United States)

Anugu, Narsireddy; Garcia, Paulo J. V.; Correia, Carlos M.

2018-05-01

Shack-Hartmann wavefront sensing relies on accurate spot centre measurement. Several algorithms were developed with this aim, mostly focused on precision, i.e. minimizing random errors. In the solar and extended scene community, the importance of the accuracy (bias error due to peak-locking, quantization, or sampling) of the centroid determination was identified and solutions proposed. But these solutions only allow partial bias corrections. To date, no systematic study of the bias error was conducted. This article bridges the gap by quantifying the bias error for different correlation peak-finding algorithms and types of sub-aperture images and by proposing a practical solution to minimize its effects. Four classes of sub-aperture images (point source, elongated laser guide star, crowded field, and solar extended scene) together with five types of peak-finding algorithms (1D parabola, the centre of gravity, Gaussian, 2D quadratic polynomial, and pyramid) are considered, in a variety of signal-to-noise conditions. The best performing peak-finding algorithm depends on the sub-aperture image type, but none is satisfactory to both bias and random errors. A practical solution is proposed that relies on the antisymmetric response of the bias to the sub-pixel position of the true centre. The solution decreases the bias by a factor of ˜7 to values of ≲ 0.02 pix. The computational cost is typically twice of current cross-correlation algorithms.

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

NARCIS (Netherlands)

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

2015-01-01

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

Communities in Large Networks: Identification and Ranking

DEFF Research Database (Denmark)

Olsen, Martin

2008-01-01

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

Risks identification and ranking using AHP and group decision making technique: Presenting “R index”

Directory of Open Access Journals (Sweden)

Safar Fazli

2013-02-01

Full Text Available One of the primary concerns in project development is to detect all sorts of risks associated with a particular project. The main objective of this article is to identify the risks in the construction project and to grade them based on their importance on the project. The designed indicator in this paper is the combinational model of the Analytical Hierarchal Process (AHP method and the group decision – making applied for risks measurement and ranking. This indicator is called "R" which includes three main steps: creating the risks broken structure (RBS, obtaining each risk weight and efficacy, and finally performing the model to rank the risks. A questionnaire is used for gathering data. Based on the results of this survey, there are important risks associated with construction projects. There we need to use some guidelines to reduce the inherent risks including recognition of the common risks beside the political risks; suggestion of a simple, understandable, and practical model; and using plenty of the experts and specialists' opinions through applying step. After analyzing data, the final result from applying R index showed that the risk “economic changes / currency rate and inflation change" has the most importance for the analysis. In the other words, if these risks occur, the project may face with the more threats and it is suggested that an organization should centralize its equipment, personnel, cost, and time on the risk more than ever. The most obvious issue in this paper is a tremendous difference between an importance of the financial risks and the other risks.

Nominal versus Attained Weights in Universitas 21 Ranking

Science.gov (United States)

Soh, Kaycheng

2014-01-01

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

A Comprehensive Analysis of Marketing Journal Rankings

Science.gov (United States)

Steward, Michelle D.; Lewis, Bruce R.

2010-01-01

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

PageRank in scale-free random graphs

NARCIS (Netherlands)

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

2014-01-01

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

46 CFR 282.11 - Ranking of flags.

Science.gov (United States)

2010-10-01

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

Observations of sensor bias dependent cluster centroid shifts in a prototype sensor for the LHCb Vertex Locator detector

CERN Document Server

Papadelis, Aras

2006-01-01

We present results from a recent beam test of a prototype sensor for the LHCb Vertex Locator detector, read out with the Beetle 1.3 front-end chip. We have studied the effect of the sensor bias voltage on the reconstructed cluster positions in a sensor placed in a 120GeV pion beam at a 10° incidence angle. We find an unexplained sysematic shift in the reconstructed cluster centroid when increasing the bias voltage on an already overdepleted sensor. The shift is independent of strip pitch and sensor thickness.

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

Science.gov (United States)

Kurihara, Yosuke

2016-04-01

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

Low-ranking female Japanese macaques make efforts for social grooming

Science.gov (United States)

Kurihara, Yosuke

2016-01-01

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

Ranking Entities in Networks via Lefschetz Duality

DEFF Research Database (Denmark)

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

2014-01-01

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

A Hybrid Distance-Based Ideal-Seeking Consensus Ranking Model

Directory of Open Access Journals (Sweden)

Madjid Tavana

2007-01-01

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

Bayesian inference and interpretation of centroid moment tensors of the 2016 Kumamoto earthquake sequence, Kyushu, Japan

Science.gov (United States)

Hallo, Miroslav; Asano, Kimiyuki; Gallovič, František

2017-09-01

On April 16, 2016, Kumamoto prefecture in Kyushu region, Japan, was devastated by a shallow M JMA7.3 earthquake. The series of foreshocks started by M JMA6.5 foreshock 28 h before the mainshock. They have originated in Hinagu fault zone intersecting the mainshock Futagawa fault zone; hence, the tectonic background for this earthquake sequence is rather complex. Here we infer centroid moment tensors (CMTs) for 11 events with M JMA between 4.8 and 6.5, using strong motion records of the K-NET, KiK-net and F-net networks. We use upgraded Bayesian full-waveform inversion code ISOLA-ObsPy, which takes into account uncertainty of the velocity model. Such an approach allows us to reliably assess uncertainty of the CMT parameters including the centroid position. The solutions show significant systematic spatial and temporal variations throughout the sequence. Foreshocks are right-lateral steeply dipping strike-slip events connected to the NE-SW shear zone. Those located close to the intersection of the Hinagu and Futagawa fault zones are dipping slightly to ESE, while those in the southern area are dipping to WNW. Contrarily, aftershocks are mostly normal dip-slip events, being related to the N-S extensional tectonic regime. Most of the deviatoric moment tensors contain only minor CLVD component, which can be attributed to the velocity model uncertainty. Nevertheless, two of the CMTs involve a significant CLVD component, which may reflect complex rupture process. Decomposition of those moment tensors into two pure shear moment tensors suggests combined right-lateral strike-slip and normal dip-slip mechanisms, consistent with the tectonic settings of the intersection of the Hinagu and Futagawa fault zones.[Figure not available: see fulltext.

Fair ranking of researchers and research teams.

Science.gov (United States)

Vavryčuk, Václav

2018-01-01

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

Treatment plan ranking using physical and biological indices

International Nuclear Information System (INIS)

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

2001-01-01

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

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.

Evaluation of treatment effects by ranking

DEFF Research Database (Denmark)

Halekoh, U; Kristensen, K

2008-01-01

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

Ranking the Online Documents Based on Relative Credibility Measures

Directory of Open Access Journals (Sweden)

Ahmad Dahlan

2013-09-01

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

Ranking the Online Documents Based on Relative Credibility Measures

Directory of Open Access Journals (Sweden)

Ahmad Dahlan

2009-05-01

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

Generalized Reduced Rank Tests using the Singular Value Decomposition

NARCIS (Netherlands)

F.R. Kleibergen (Frank); R. Paap (Richard)

2003-01-01

textabstractWe propose a novel statistic to test the rank of a matrix. The rank statistic overcomes deficiencies of existing rank statistics, like: necessity of a Kronecker covariance matrix for the canonical correlation rank statistic of Anderson (1951), sensitivity to the ordering of the variables

Beyond Low Rank: A Data-Adaptive Tensor Completion Method

OpenAIRE

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

2017-01-01

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

Generalized reduced rank tests using the singular value decomposition

NARCIS (Netherlands)

Kleibergen, F.R.; Paap, R.

2002-01-01

We propose a novel statistic to test the rank of a matrix. The rank statistic overcomes deficiencies of existing rank statistics, like: necessity of a Kronecker covariance matrix for the canonical correlation rank statistic of Anderson (1951), sensitivity to the ordering of the variables for the LDU

Trachomatous Scar Ranking: A Novel Outcome for Trachoma Studies.

Science.gov (United States)

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

2017-06-01

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

CNN-based ranking for biomedical entity normalization.

Science.gov (United States)

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

2017-10-03

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

RANK und RANKL - Vom Knochen zum Mammakarzinom

Directory of Open Access Journals (Sweden)

Sigl V

2012-01-01

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

Using incomplete citation data for MEDLINE results ranking.

Science.gov (United States)

Herskovic, Jorge R; Bernstam, Elmer V

2005-01-01

Information overload is a significant problem for modern medicine. Searching MEDLINE for common topics often retrieves more relevant documents than users can review. Therefore, we must identify documents that are not only relevant, but also important. Our system ranks articles using citation counts and the PageRank algorithm, incorporating data from the Science Citation Index. However, citation data is usually incomplete. Therefore, we explore the relationship between the quantity of citation information available to the system and the quality of the result ranking. Specifically, we test the ability of citation count and PageRank to identify "important articles" as defined by experts from large result sets with decreasing citation information. We found that PageRank performs better than simple citation counts, but both algorithms are surprisingly robust to information loss. We conclude that even an incomplete citation database is likely to be effective for importance ranking.

Using centrality to rank web snippets

NARCIS (Netherlands)

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

2008-01-01

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

Neural Ranking Models with Weak Supervision

NARCIS (Netherlands)

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

2017-01-01

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

Generalization Performance of Regularized Ranking With Multiscale Kernels.

Science.gov (United States)

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

2016-05-01

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

Scalable Faceted Ranking in Tagging Systems

Science.gov (United States)

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

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

Rank 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

Differential invariants for higher-rank tensors. A progress report

International Nuclear Information System (INIS)

Tapial, V.

2004-07-01

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

On Rank Driven Dynamical Systems

Science.gov (United States)

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

2014-08-01

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

Citation ranking versus peer evaluation of senior faculty research performance

DEFF Research Database (Denmark)

Meho, Lokman I.; Sonnenwald, Diane H.

2000-01-01

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

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

University rankings in computer science

DEFF Research Database (Denmark)

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

2017-01-01

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

Adaptive distributional extensions to DFR ranking

DEFF Research Database (Denmark)

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

2016-01-01

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

Discovering author impact: A PageRank perspective

OpenAIRE

Yan, Erjia; Ding, Ying

2010-01-01

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

Social class rank, threat vigilance, and hostile reactivity.

Science.gov (United States)

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

2011-10-01

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

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

Science.gov (United States)

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

2018-01-01

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

Freudenthal ranks: GHZ versus W

International Nuclear Information System (INIS)

Borsten, L

2013-01-01

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

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

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…

Blind Reduced-Rank MMSE Detector for DS-CDMA Systems

Directory of Open Access Journals (Sweden)

Xiaodong Cai

2003-01-01

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

An R package for analyzing and modeling ranking data.

Science.gov (United States)

Lee, Paul H; Yu, Philip L H

2013-05-14

In medical informatics, psychology, market research and many other fields, researchers often need to analyze and model ranking data. However, there is no statistical software that provides tools for the comprehensive analysis of ranking data. Here, we present pmr, an R package for analyzing and modeling ranking data with a bundle of tools. The pmr package enables descriptive statistics (mean rank, pairwise frequencies, and marginal matrix), Analytic Hierarchy Process models (with Saaty's and Koczkodaj's inconsistencies), probability models (Luce model, distance-based model, and rank-ordered logit model), and the visualization of ranking data with multidimensional preference analysis. Examples of the use of package pmr are given using a real ranking dataset from medical informatics, in which 566 Hong Kong physicians ranked the top five incentives (1: competitive pressures; 2: increased savings; 3: government regulation; 4: improved efficiency; 5: improved quality care; 6: patient demand; 7: financial incentives) to the computerization of clinical practice. The mean rank showed that item 4 is the most preferred item and item 3 is the least preferred item, and significance difference was found between physicians' preferences with respect to their monthly income. A multidimensional preference analysis identified two dimensions that explain 42% of the total variance. The first can be interpreted as the overall preference of the seven items (labeled as "internal/external"), and the second dimension can be interpreted as their overall variance of (labeled as "push/pull factors"). Various statistical models were fitted, and the best were found to be weighted distance-based models with Spearman's footrule distance. In this paper, we presented the R package pmr, the first package for analyzing and modeling ranking data. The package provides insight to users through descriptive statistics of ranking data. Users can also visualize ranking data by applying a thought

Hyper-local, directions-based ranking of places

DEFF Research Database (Denmark)

Venetis, Petros; Gonzalez, Hector; Jensen, Christian S.

2011-01-01

they are numerous and contain precise locations. Specifically, the paper proposes a framework that takes a user location and a collection of near-by places as arguments, producing a ranking of the places. The framework enables a range of aspects of directions queries to be exploited for the ranking of places......, including the frequency with which places have been referred to in directions queries. Next, the paper proposes an algorithm and accompanying data structures capable of ranking places in response to hyper-local web queries. Finally, an empirical study with very large directions query logs offers insight...... into the potential of directions queries for the ranking of places and suggests that the proposed algorithm is suitable for use in real web search engines....

Reduced-Rank Adaptive Filtering Using Krylov Subspace

Directory of Open Access Journals (Sweden)

Sergueï Burykh

2003-01-01

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

Global network centrality of university rankings

Science.gov (United States)

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

2017-10-01

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

The effect of new links on Google PageRank

NARCIS (Netherlands)

Avrachenkov, Konstatin; Litvak, Nelli

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

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.

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.

A new method for ordering triangular fuzzy numbers

Directory of Open Access Journals (Sweden)

S.H. Nasseri

2010-09-01

Full Text Available Ranking fuzzy numbers plays a very important role in linguistic decision making and other fuzzy application systems. In spite of many ranking methods, no one can rank fuzzy numbers with human intuition consistently in all cases. Shortcoming are found in some of the convenient methods for ranking triangular fuzzy numbers such as the coefficient of variation (CV index, distance between fuzzy sets, centroid point and original point, and also weighted mean value. In this paper, we introduce a new method for ranking triangular fuzzy number to overcome the shortcomings of the previous techniques. Finally, we compare our method with some convenient methods for ranking fuzzy numbers to illustrate the advantage our method.

Work plan for the High Ranking Facilities Deactivation Project at Oak Ridge National Laboratory, Oak Ridge, Tennessee

International Nuclear Information System (INIS)

1996-03-01

The High Ranking Facilities Deactivation Project (HRFDP), commissioned by the US Department of Energy Nuclear Materials and Facility Stabilization Program, is to place four primary high-risk surplus facilities with 28 associated ancillary facilities at Oak Ridge National Laboratory in a safe, stable, and environmentally sound condition as rapidly and economically as possible. The facilities will be deactivated and left in a condition suitable for an extended period of minimized surveillance and maintenance (S and M) prior to decontaminating and decommissioning (D and D). These four facilities include two reactor facilities containing spent fuel. One of these reactor facilities also contains 55 tons of sodium with approximately 34 tons containing activated sodium-22, 2.5 tons of lithium hydride, approximately 100 tons of potentially contaminated lead, and several other hazardous materials as well as bulk quantities of contaminated scrap metals. The other two facilities to be transferred include a facility with a bank of hot cells containing high levels of transferable contamination and also a facility containing significant quantities of uranyl nitrate and quantities of transferable contamination. This work plan documents the objectives, technical requirements, and detailed work plans--including preliminary schedules, milestones, and conceptual FY 1996 cost estimates--for the Oak Ridge National Laboratory (ORNL). This plan has been developed by the Environmental Restoration (ER) Program of Lockheed Martin Energy Systems (Energy Systems) for the US Department of Energy (DOE) Oak Ridge Operations Office (ORO)

Work plan for the High Ranking Facilities Deactivation Project at Oak Ridge National Laboratory, Oak Ridge, Tennessee

Energy Technology Data Exchange (ETDEWEB)

NONE

1996-03-01

The High Ranking Facilities Deactivation Project (HRFDP), commissioned by the US Department of Energy Nuclear Materials and Facility Stabilization Program, is to place four primary high-risk surplus facilities with 28 associated ancillary facilities at Oak Ridge National Laboratory in a safe, stable, and environmentally sound condition as rapidly and economically as possible. The facilities will be deactivated and left in a condition suitable for an extended period of minimized surveillance and maintenance (S and M) prior to decontaminating and decommissioning (D and D). These four facilities include two reactor facilities containing spent fuel. One of these reactor facilities also contains 55 tons of sodium with approximately 34 tons containing activated sodium-22, 2.5 tons of lithium hydride, approximately 100 tons of potentially contaminated lead, and several other hazardous materials as well as bulk quantities of contaminated scrap metals. The other two facilities to be transferred include a facility with a bank of hot cells containing high levels of transferable contamination and also a facility containing significant quantities of uranyl nitrate and quantities of transferable contamination. This work plan documents the objectives, technical requirements, and detailed work plans--including preliminary schedules, milestones, and conceptual FY 1996 cost estimates--for the Oak Ridge National Laboratory (ORNL). This plan has been developed by the Environmental Restoration (ER) Program of Lockheed Martin Energy Systems (Energy Systems) for the US Department of Energy (DOE) Oak Ridge Operations Office (ORO).

A novel three-stage distance-based consensus ranking method

Science.gov (United States)

Aghayi, Nazila; Tavana, Madjid

2018-05-01

In this study, we propose a three-stage weighted sum method for identifying the group ranks of alternatives. In the first stage, a rank matrix, similar to the cross-efficiency matrix, is obtained by computing the individual rank position of each alternative based on importance weights. In the second stage, a secondary goal is defined to limit the vector of weights since the vector of weights obtained in the first stage is not unique. Finally, in the third stage, the group rank position of alternatives is obtained based on a distance of individual rank positions. The third stage determines a consensus solution for the group so that the ranks obtained have a minimum distance from the ranks acquired by each alternative in the previous stage. A numerical example is presented to demonstrate the applicability and exhibit the efficacy of the proposed method and algorithms.

Learning to rank figures within a biomedical article.

Directory of Open Access Journals (Sweden)

Feifan Liu

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

Learning to rank figures within a biomedical article.

Science.gov (United States)

Liu, Feifan; Yu, Hong

2014-01-01

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

How Prospective Physical Medicine and Rehabilitation Trainees Rank Residency Training Programs.

Science.gov (United States)

Auriemma, Michael J; Whitehair, Curtis L

2018-03-01

Since the inception of the National Resident Matching Program, multiple studies have investigated the factors applicants consider important to ranking prospective residency programs. However, only 2 previous studies focused on prospective physical medicine and rehabilitation (PM&R) trainees, and the most recent of these studies was published in 1993. It is unknown whether these previous studies are reflective of current prospective PM&R residents. To assess various factors that contribute to prospective PM&R residents' decision making in choosing a residency program and compare these findings with previous studies. An anonymous, voluntary questionnaire. A single PM&R residency program. All applicants to a single PM&R residency program. All applicants to our PM&R residency program were invited to participate in a 44-item, 5-point Likert-based questionnaire. Applicants were asked to rate the importance of various factors as they related to constructing their residency rank list. Means and standard deviations were calculated for items included in the survey. A response rate of 26% was obtained, with the responses of 98 applicants (20%) ultimately analyzed. The highest rated factors included "perceived happiness of current residents," "opportunities for hands-on procedure training," "perceived camaraderie among current residents," "perceived camaraderie among faculty and current residents," "perceived quality of current residents," and "perceived work/life balance among current residents." Although male and female respondents demonstrated similar ranking preferences, an apparent difference was detected between how genders rated the importance of "whether the program projects a favorable environment for women" and "whether the program projects a favorable environment for minorities." As compared with previous PM&R applicants, current prospective trainees seem to place greater importance on skill acquisition over didactic teaching. Prospective PM&R residents highly value

Diversity rankings among bacterial lineages in soil.

Science.gov (United States)

Youssef, Noha H; Elshahed, Mostafa S

2009-03-01

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

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.

Low-Rank Sparse Coding for Image Classification

KAUST Repository

Zhang, Tianzhu; Ghanem, Bernard; Liu, Si; Xu, Changsheng; Ahuja, Narendra

2013-01-01

In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

Low-Rank Sparse Coding for Image Classification

KAUST Repository

Zhang, Tianzhu

2013-12-01

In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

Image Re-Ranking Based on Topic Diversity.

Science.gov (United States)

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

2017-08-01

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

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

Ranking species in mutualistic networks

Science.gov (United States)

Domínguez-García, Virginia; Muñoz, Miguel A.

2015-02-01

Understanding the architectural subtleties of ecological networks, believed to confer them enhanced stability and robustness, is a subject of outmost relevance. Mutualistic interactions have been profusely studied and their corresponding bipartite networks, such as plant-pollinator networks, have been reported to exhibit a characteristic ``nested'' structure. Assessing the importance of any given species in mutualistic networks is a key task when evaluating extinction risks and possible cascade effects. Inspired in a recently introduced algorithm -similar in spirit to Google's PageRank but with a built-in non-linearity- here we propose a method which -by exploiting their nested architecture- allows us to derive a sound ranking of species importance in mutualistic networks. This method clearly outperforms other existing ranking schemes and can become very useful for ecosystem management and biodiversity preservation, where decisions on what aspects of ecosystems to explicitly protect need to be made.

Fault Diagnosis of Rotating Machinery Based on the Multiscale Local Projection Method and Diagonal Slice Spectrum

Directory of Open Access Journals (Sweden)

Yong Lv

2018-04-01

Full Text Available The vibration signals of bearings and gears measured from rotating machinery usually have nonlinear, nonstationary characteristics. The local projection algorithm cannot only reduce the noise of the nonlinear system, but can also preserve the nonlinear deterministic structure of the signal. The influence of centroid selection on the performance of noise reduction methods is analyzed, and the multiscale local projection method of centroid was proposed in this paper. This method considers both the geometrical shape and statistical error of the signal in high dimensional phase space, which can effectively eliminate the noise and preserve the complete geometric structure of the attractors. The diagonal slice spectrum can identify the frequency components of quadratic phase coupling and enlarge the coupled frequency component in the nonlinear signal. Therefore, the proposed method based on the above two algorithms can achieve more accurate results of fault diagnosis of gears and rolling bearings. The simulated signal is used to verify its effectiveness in a numerical simulation. Then, the proposed method is conducted for fault diagnosis of gears and rolling bearings in application researches. The fault characteristics of faulty bearings and gears can be extracted successfully in the researches. The experimental results indicate the effectiveness of the novel proposed method.

The impact of the in-orbit background and the X-ray source intensity on the centroiding accuracy of the Swift X-ray telescope

CERN Document Server

Ambrosi, R M; Hill, J; Cheruvu, C; Abbey, A F; Short, A D T

2002-01-01

The optical components of the Swift Gamma Ray Burst Explorer X-ray Telescope (XRT), consisting of the JET-X spare flight mirror and a charge coupled device of the type used in the EPIC program, were used in a re-calibration study carried out at the Panter facility, which is part of the Max Planck Institute for Extraterrestrial Physics. The objective of this study was to check the focal length and the off axis performance of the mirrors and to show that the half energy width (HEW) of the on-axis point spread function (PSF) was of the order of 16 arcsec at 1.5 keV (Nucl. Instr. and Meth. A 488 (2002) 543; SPIE 4140 (2000) 64) and that a centroiding accuracy better that 1 arcsec could be achieved within the 4 arcmin sampling area designated by the Burst Alert Telescope (Nucl. Instr. and Meth. A 488 (2002) 543). The centroiding accuracy of the Swift XRT's optical components was tested as a function of distance from the focus and off axis position of the PSF (Nucl. Instr. and Meth. A 488 (2002) 543). The presence ...

Sign rank versus Vapnik-Chervonenkis dimension

Science.gov (United States)

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

2017-12-01

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

The Rankings Game: Who's Playing Whom?

Science.gov (United States)

Burness, John F.

2008-01-01

This summer, Forbes magazine published its new rankings of "America's Best Colleges," implying that it had developed a methodology that would give the public the information that it needed to choose a college wisely. "U.S. News & World Report," which in 1983 published the first annual ranking, just announced its latest ratings last week--including…

Ranking spreaders by decomposing complex networks

International Nuclear Information System (INIS)

Zeng, An; Zhang, Cheng-Jun

2013-01-01

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.

The ranking of negative-cost emissions reduction measures

International Nuclear Information System (INIS)

Taylor, Simon

2012-01-01

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

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

Subtracting a best rank-1 approximation may increase tensor rank

NARCIS (Netherlands)

Stegeman, Alwin; Comon, Pierre

2010-01-01

It has been shown that a best rank-R approximation of an order-k tensor may not exist when R >= 2 and k >= 3. This poses a serious problem to data analysts using tensor decompositions it has been observed numerically that, generally, this issue cannot be solved by consecutively computing and

Path integral centroid molecular dynamics simulations of semiinfinite slab and bulk liquid of para-hydrogen

Energy Technology Data Exchange (ETDEWEB)

Kinugawa, Kenichi [Nara Women`s Univ., Nara (Japan). Dept. of Chemistry

1998-10-01

It has been unsuccessful to solve a set of time-dependent Schroedinger equations numerically for many-body quantum systems which involve, e.g., a number of hydrogen molecules, protons, and excess electrons at a low temperature, where quantum effect evidently appears. This undesirable situation is fatal for the investigation of real low-temperature chemical systems because they are essentially composed of many quantum degrees of freedom. However, if we use a new technique called `path integral centroid molecular dynamics (CMD) simulation` proposed by Cao and Voth in 1994, the real-time semi-classical dynamics of many degrees of freedom can be computed by utilizing the techniques already developed in the traditional classical molecular dynamics (MD) simulations. Therefore, the CMD simulation is expected to be very powerful tool for the quantum dynamics studies or real substances. (J.P.N.)

Using Power-Law Degree Distribution to Accelerate PageRank

Directory of Open Access Journals (Sweden)

Zhaoyan Jin

2012-12-01

Full Text Available The PageRank vector of a network is very important, for it can reflect the importance of a Web page in the World Wide Web, or of a people in a social network. However, with the growth of the World Wide Web and social networks, it needs more and more time to compute the PageRank vector of a network. In many real-world applications, the degree and PageRank distributions of these complex networks conform to the Power-Law distribution. This paper utilizes the degree distribution of a network to initialize its PageRank vector, and presents a Power-Law degree distribution accelerating algorithm of PageRank computation. Experiments on four real-world datasets show that the proposed algorithm converges more quickly than the original PageRank algorithm.

A Case-Based Reasoning Method with Rank Aggregation

Science.gov (United States)

Sun, Jinhua; Du, Jiao; Hu, Jian

2018-03-01

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

Centroid based clustering of high throughput sequencing reads based on n-mer counts.

Science.gov (United States)

Solovyov, Alexander; Lipkin, W Ian

2013-09-08

Many problems in computational biology require alignment-free sequence comparisons. One of the common tasks involving sequence comparison is sequence clustering. Here we apply methods of alignment-free comparison (in particular, comparison using sequence composition) to the challenge of sequence clustering. We study several centroid based algorithms for clustering sequences based on word counts. Study of their performance shows that using k-means algorithm with or without the data whitening is efficient from the computational point of view. A higher clustering accuracy can be achieved using the soft expectation maximization method, whereby each sequence is attributed to each cluster with a specific probability. We implement an open source tool for alignment-free clustering. It is publicly available from github: https://github.com/luscinius/afcluster. We show the utility of alignment-free sequence clustering for high throughput sequencing analysis despite its limitations. In particular, it allows one to perform assembly with reduced resources and a minimal loss of quality. The major factor affecting performance of alignment-free read clustering is the length of the read.

Comparison of pure and 'Latinized' centroidal Voronoi tessellation against various other statistical sampling methods

International Nuclear Information System (INIS)

Romero, Vicente J.; Burkardt, John V.; Gunzburger, Max D.; Peterson, Janet S.

2006-01-01

A recently developed centroidal Voronoi tessellation (CVT) sampling method is investigated here to assess its suitability for use in statistical sampling applications. CVT efficiently generates a highly uniform distribution of sample points over arbitrarily shaped M-dimensional parameter spaces. On several 2-D test problems CVT has recently been found to provide exceedingly effective and efficient point distributions for response surface generation. Additionally, for statistical function integration and estimation of response statistics associated with uniformly distributed random-variable inputs (uncorrelated), CVT has been found in initial investigations to provide superior points sets when compared against latin-hypercube and simple-random Monte Carlo methods and Halton and Hammersley quasi-random sequence methods. In this paper, the performance of all these sampling methods and a new variant ('Latinized' CVT) are further compared for non-uniform input distributions. Specifically, given uncorrelated normal inputs in a 2-D test problem, statistical sampling efficiencies are compared for resolving various statistics of response: mean, variance, and exceedence probabilities

Pipeline for the Analysis of ChIP-seq Data and New Motif Ranking Procedure

KAUST Repository

Ashoor, Haitham

2011-06-01

This thesis presents a computational methodology for ab-initio identification of transcription factor binding sites based on ChIP-seq data. This method consists of three main steps, namely ChIP-seq data processing, motif discovery and models selection. A novel method for ranking the models of motifs identified in this process is proposed. This method combines multiple factors in order to rank the provided candidate motifs. It combines the model coverage of the ChIP-seq fragments that contain motifs from which that model is built, the suitable background data made up of shuffled ChIP-seq fragments, and the p-value that resulted from evaluating the model on actual and background data. Two ChIP-seq datasets retrieved from ENCODE project are used to evaluate and demonstrate the ability of the method to predict correct TFBSs with high precision. The first dataset relates to neuron-restrictive silencer factor, NRSF, while the second one corresponds to growth-associated binding protein, GABP. The pipeline system shows high precision prediction for both datasets, as in both cases the top ranked motif closely resembles the known motifs for the respective transcription factors.

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

Science.gov (United States)

Dembélé, Doulaye

2018-01-01

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

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

International Nuclear Information System (INIS)

Eliazar, Iddo

2015-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2015-04-15

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

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

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.

A cross-benchmark comparison of 87 learning to rank methods

NARCIS (Netherlands)

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

2015-01-01

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

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

Science.gov (United States)

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

2017-08-18

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

Rank Two Affine Manifolds in Genus 3

OpenAIRE

Aulicino, David; Nguyen, Duc-Manh

2016-01-01

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

Sensitivity ranking for freshwater invertebrates towards hydrocarbon contaminants.

Science.gov (United States)

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

2017-11-01

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

Tensor rank of the tripartite state |W>xn

International Nuclear Information System (INIS)

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

2010-01-01

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

Low-Rank Matrix Factorization With Adaptive Graph Regularizer.

Science.gov (United States)

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

2016-05-01

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

Dominance-based ranking functions for interval-valued intuitionistic fuzzy sets.

Science.gov (United States)

Chen, Liang-Hsuan; Tu, Chien-Cheng

2014-08-01

The ranking of interval-valued intuitionistic fuzzy sets (IvIFSs) is difficult since they include the interval values of membership and nonmembership. This paper proposes ranking functions for IvIFSs based on the dominance concept. The proposed ranking functions consider the degree to which an IvIFS dominates and is not dominated by other IvIFSs. Based on the bivariate framework and the dominance concept, the functions incorporate not only the boundary values of membership and nonmembership, but also the relative relations among IvIFSs in comparisons. The dominance-based ranking functions include bipolar evaluations with a parameter that allows the decision-maker to reflect his actual attitude in allocating the various kinds of dominance. The relationship for two IvIFSs that satisfy the dual couple is defined based on four proposed ranking functions. Importantly, the proposed ranking functions can achieve a full ranking for all IvIFSs. Two examples are used to demonstrate the applicability and distinctiveness of the proposed ranking functions.

Ranking of Unwarranted Variations in Healthcare Treatments

NARCIS (Netherlands)

Moes, Herry; Brekelmans, Ruud; Hamers, Herbert; Hasaart, F.

2017-01-01

In this paper, we introduce a framework designed to identify and rank possible unwarranted variation of treatments in healthcare. The innovative aspect of this framework is a ranking procedure that aims to identify healthcare institutions where unwarranted variation is most severe, and diagnosis

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.

Low-rank coal research. Quarterly report, January--March 1990

Energy Technology Data Exchange (ETDEWEB)

1990-08-01

This document contains several quarterly progress reports for low-rank coal research that was performed from January-March 1990. Reports in Control Technology and Coal Preparation Research are in Flue Gas Cleanup, Waste Management, and Regional Energy Policy Program for the Northern Great Plains. Reports in Advanced Research and Technology Development are presented in Turbine Combustion Phenomena, Combustion Inorganic Transformation (two sections), Liquefaction Reactivity of Low-Rank Coals, Gasification Ash and Slag Characterization, and Coal Science. Reports in Combustion Research cover Fluidized-Bed Combustion, Beneficiation of Low-Rank Coals, Combustion Characterization of Low-Rank Coal Fuels, Diesel Utilization of Low-Rank Coals, and Produce and Characterize HWD (hot-water drying) Fuels for Heat Engine Applications. Liquefaction Research is reported in Low-Rank Coal Direct Liquefaction. Gasification Research progress is discussed for Production of Hydrogen and By-Products from Coal and for Chemistry of Sulfur Removal in Mild Gas.

Level-rank duality of untwisted and twisted D-branes

International Nuclear Information System (INIS)

Naculich, Stephen G.; Schnitzer, Howard J.

2006-01-01

Level-rank duality of untwisted and twisted D-branes of WZW models is explored. We derive the relation between D0-brane charges of level-rank dual untwisted D-branes of su-bar (N) K and sp-bar (n) k , and of level-rank dual twisted D-branes of su-bar (2n+1) 2k+1 . The analysis of level-rank duality of twisted D-branes of su-bar (2n+1) 2k+1 is facilitated by their close relation to untwisted D-branes of sp-bar (n) k . We also demonstrate level-rank duality of the spectrum of an open string stretched between untwisted or twisted D-branes in each of these cases

UTV Expansion Pack: Special-Purpose Rank-Revealing Algorithms

DEFF Research Database (Denmark)

Fierro, Ricardo D.; Hansen, Per Christian

2005-01-01

This collection of Matlab 7.0 software supplements and complements the package UTV Tools from 1999, and includes implementations of special-purpose rank-revealing algorithms developed since the publication of the original package. We provide algorithms for computing and modifying symmetric rank-r...... values of a sparse or structured matrix. These new algorithms have applications in signal processing, optimization and LSI information retrieval.......This collection of Matlab 7.0 software supplements and complements the package UTV Tools from 1999, and includes implementations of special-purpose rank-revealing algorithms developed since the publication of the original package. We provide algorithms for computing and modifying symmetric rank......-revealing VSV decompositions, we expand the algorithms for the ULLV decomposition of a matrix pair to handle interference-type problems with a rank-deficient covariance matrix, and we provide a robust and reliable Lanczos algorithm which - despite its simplicity - is able to capture all the dominant singular...

Rank 2 fusion rings are complete intersections

DEFF Research Database (Denmark)

Andersen, Troels Bak

We give a non-constructive proof that fusion rings attached to a simple complex Lie algebra of rank 2 are complete intersections.......We give a non-constructive proof that fusion rings attached to a simple complex Lie algebra of rank 2 are complete intersections....

Entity Ranking using Wikipedia as a Pivot

NARCIS (Netherlands)

R. Kaptein; P. Serdyukov; A.P. de Vries (Arjen); J. Kamps

2010-01-01

htmlabstractIn 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

Scoping Studies to Evaluate the Benefits of an Advanced Dry Feed System on the Use of Low-Rank Coal

Energy Technology Data Exchange (ETDEWEB)

Rader, Jeff; Aguilar, Kelly; Aldred, Derek; Chadwick, Ronald; Conchieri, John; Dara, Satyadileep; Henson, Victor; Leininger, Tom; Liber, Pawel; Liber, Pawel; Lopez-Nakazono, Benito; Pan, Edward; Ramirez, Jennifer; Stevenson, John; Venkatraman, Vignesh

2012-03-30

The purpose of this project was to evaluate the ability of advanced low rank coal gasification technology to cause a significant reduction in the COE for IGCC power plants with 90% carbon capture and sequestration compared with the COE for similarly configured IGCC plants using conventional low rank coal gasification technology. GE’s advanced low rank coal gasification technology uses the Posimetric Feed System, a new dry coal feed system based on GE’s proprietary Posimetric Feeder. In order to demonstrate the performance and economic benefits of the Posimetric Feeder in lowering the cost of low rank coal-fired IGCC power with carbon capture, two case studies were completed. In the Base Case, the gasifier was fed a dilute slurry of Montana Rosebud PRB coal using GE’s conventional slurry feed system. In the Advanced Technology Case, the slurry feed system was replaced with the Posimetric Feed system. The process configurations of both cases were kept the same, to the extent possible, in order to highlight the benefit of substituting the Posimetric Feed System for the slurry feed system.

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

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

LogDet Rank Minimization with Application to Subspace Clustering

Directory of Open Access Journals (Sweden)

Zhao Kang

2015-01-01

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

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

Directory of Open Access Journals (Sweden)

Samah Ibrahim Abdel Aal

2018-03-01

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

Lerot: An Online Learning to Rank Framework

NARCIS (Netherlands)

Schuth, A.; Hofmann, K.; Whiteson, S.; de Rijke, M.

2013-01-01

Online learning to rank methods for IR allow retrieval systems to optimize their own performance directly from interactions with users via click feedback. In the software package Lerot, presented in this paper, we have bundled all ingredients needed for experimenting with online learning to rank for

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

Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix

Directory of Open Access Journals (Sweden)

Mohammed Kasim Mohammed Al-Haddad

2016-05-01

Full Text Available the encoding of long low density parity check (LDPC codes presents a challenge compared to its decoding. The Quasi Cyclic (QC LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.

7 CFR 1491.6 - Ranking considerations and proposal selection.

Science.gov (United States)

2010-01-01

... 7 Agriculture 10 2010-01-01 2010-01-01 false Ranking considerations and proposal selection. 1491.6... PROGRAM General Provisions § 1491.6 Ranking considerations and proposal selection. (a) Before the State.... The national ranking criteria will be established by the Chief and the State criteria will be...

Extracting Rankings for Spatial Keyword Queries from GPS Data

DEFF Research Database (Denmark)

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

2018-01-01

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

Revisiting the Relationship between Institutional Rank and Student Engagement

Science.gov (United States)

Zilvinskis, John; Louis Rocconi

2018-01-01

College rankings dominate the conversation regarding quality in postsecondary education. However, the criteria used to rank institutions often have nothing to do with the quality of education students receive. A decade ago, Pike (2004) demonstrated that institutional rank had little association with student involvement in educational activities.…

Rank of quantized universal enveloping algebras and modular functions

International Nuclear Information System (INIS)

Majid, S.; Soibelman, Ya.S.

1991-01-01

We compute an intrinsic rank invariant for quasitriangular Hopf algebras in the case of general quantum groups U q (g). As a function of q the rank has remarkable number theoretic properties connected with modular covariance and Galois theory. A number of examples are treated in detail, including rank (U q (su(3)) and rank (U q (e 8 )). We briefly indicate a physical interpretation as relating Chern-Simons theory with the theory of a quantum particle confined to an alcove of g. (orig.)

Ranking Music Data by Relevance and Importance

DEFF Research Database (Denmark)

Ruxanda, Maria Magdalena; Nanopoulos, Alexandros; Jensen, Christian Søndergaard

2008-01-01

Due to the rapidly increasing availability of audio files on the Web, it is relevant to augment search engines with advanced audio search functionality. In this context, the ranking of the retrieved music is an important issue. This paper proposes a music ranking method capable of flexibly fusing...

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…

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

Directory of Open Access Journals (Sweden)

Bouchra Sojod

2017-05-01

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

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

Science.gov (United States)

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

2017-01-01

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

Consistent ranking of volatility models

DEFF Research Database (Denmark)

Hansen, Peter Reinhard; Lunde, Asger

2006-01-01

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

An Adaptive Reordered Method for Computing PageRank

Directory of Open Access Journals (Sweden)

Yi-Ming Bu

2013-01-01

Full Text Available We propose an adaptive reordered method to deal with the PageRank problem. It has been shown that one can reorder the hyperlink matrix of PageRank problem to calculate a reduced system and get the full PageRank vector through forward substitutions. This method can provide a speedup for calculating the PageRank vector. We observe that in the existing reordered method, the cost of the recursively reordering procedure could offset the computational reduction brought by minimizing the dimension of linear system. With this observation, we introduce an adaptive reordered method to accelerate the total calculation, in which we terminate the reordering procedure appropriately instead of reordering to the end. Numerical experiments show the effectiveness of this adaptive reordered method.

Projective Connections and the Algebra of Densities

International Nuclear Information System (INIS)

George, Jacob

2008-01-01

Projective connections first appeared in Cartan's papers in the 1920's. Since then they have resurfaced periodically in, for example, integrable systems and perhaps most recently in the context of so called projectively equivariant quantisation. We recall the notion of projective connection and describe its relation with the algebra of densities on a manifold. In particular, we construct a Laplace-type operator on functions using a Thomas projective connection and a symmetric contravariant tensor of rank 2 ('upper metric').

A Note on the PageRank of Undirected Graphs

OpenAIRE

Grolmusz, Vince

2012-01-01

The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the literature it is widely noted that the PageRank for undirected graphs are proportional to the degrees of the vertices of the graph. We prove that statement for a particular personalization vector in the definition of the PageRank, and we also show that in gene...

Extreme learning machine for ranking: generalization analysis and applications.

Science.gov (United States)

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

2014-05-01

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

Multidimensional ranking the design and development of U-Multirank

CERN Document Server

Ziegele, Frank

2012-01-01

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

Beyond Low-Rank Representations: Orthogonal clustering basis reconstruction with optimized graph structure for multi-view spectral clustering.

Science.gov (United States)

Wang, Yang; Wu, Lin

2018-07-01

Low-Rank Representation (LRR) is arguably one of the most powerful paradigms for Multi-view spectral clustering, which elegantly encodes the multi-view local graph/manifold structures into an intrinsic low-rank self-expressive data similarity embedded in high-dimensional space, to yield a better graph partition than their single-view counterparts. In this paper we revisit it with a fundamentally different perspective by discovering LRR as essentially a latent clustered orthogonal projection based representation winged with an optimized local graph structure for spectral clustering; each column of the representation is fundamentally a cluster basis orthogonal to others to indicate its members, which intuitively projects the view-specific feature representation to be the one spanned by all orthogonal basis to characterize the cluster structures. Upon this finding, we propose our technique with the following: (1) We decompose LRR into latent clustered orthogonal representation via low-rank matrix factorization, to encode the more flexible cluster structures than LRR over primal data objects; (2) We convert the problem of LRR into that of simultaneously learning orthogonal clustered representation and optimized local graph structure for each view; (3) The learned orthogonal clustered representations and local graph structures enjoy the same magnitude for multi-view, so that the ideal multi-view consensus can be readily achieved. The experiments over multi-view datasets validate its superiority, especially over recent state-of-the-art LRR models. Copyright © 2018 Elsevier Ltd. All rights reserved.

Is there a 'Mid-Rank Trap' for Universities'

OpenAIRE

Chang Da Wan

2015-01-01

The middle-income trap is an economic phenomenon to describe economies that have stagnated at the middle-income level and failed to progress into the high-income level. Inspired by this economic concept, this paper explores a hypothesis: is there a 'mid-rank trap' for universities in the exercise to rank universities globally' Using the rankings between 2004 and 2014 that were jointly and separately developed by Times Higher Education and Quacquarelli Symonds Company, this paper argues that t...

A Citation-Based Ranking of Strategic Management Journals

OpenAIRE

Azar, Ofer H.; Brock, David M.

2007-01-01

Rankings of strategy journals are important for authors, readers, and promotion and tenure committees. We present several rankings, based either on the number of articles that cited the journal or the per-article impact. Our analyses cover various periods between 1991 and 2006, for most of which the Strategic Management Journal was in first place and Journal of Economics & Management Strategy (JEMS) second, although JEMS ranked first in certain instances. Long Range Planning and Technology An...

A Rational Method for Ranking Engineering Programs.

Science.gov (United States)

Glower, Donald D.

1980-01-01

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

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…

Monte Carlo methods of PageRank computation

NARCIS (Netherlands)

Litvak, Nelli

2004-01-01

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

Dynamic collective entity representations for entity ranking

NARCIS (Netherlands)

Graus, D.; Tsagkias, M.; Weerkamp, W.; Meij, E.; de Rijke, M.

2016-01-01

Entity ranking, i.e., successfully positioning a relevant entity at the top of the ranking for a given query, is inherently difficult due to the potential mismatch between the entity's description in a knowledge base, and the way people refer to the entity when searching for it. To counter this

Comparative Case Studies on Indonesian Higher Education Rankings

Science.gov (United States)

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

2018-01-01

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

Is there a 'Mid-Rank Trap' for Universities'

Directory of Open Access Journals (Sweden)

Chang Da Wan

2015-10-01

Full Text Available The middle-income trap is an economic phenomenon to describe economies that have stagnated at the middle-income level and failed to progress into the high-income level. Inspired by this economic concept, this paper explores a hypothesis: is there a 'mid-rank trap' for universities in the exercise to rank universities globally' Using the rankings between 2004 and 2014 that were jointly and separately developed by Times Higher Education and Quacquarelli Symonds Company, this paper argues that there is indeed a phenomenon, which I term as 'mid-rank trap' whereby universities remain stagnant for a decade in a similar band of the rankings. Having established the hypothesis for universities, the paper examines policies and interventions that have been successfully carried out to elevate economies away from the middle-income trap, and importantly, to draw out the underlying principles of these economic policies and interventions that can be incorporated into policymaking and strategic planning for universities using the Malaysian higher education system as a case study.

Prioritization of proposed waste management construction projects for the Waste Management program within the Department of Energy

International Nuclear Information System (INIS)

Johnson, J.V.

1995-01-01

A prioritization process is used to evaluate and rank proposed construction projects within the Department of Energy's Waste Management program. The process is used to determine which projects should proceed with conceptual design activities. The proposed construction projects are evaluated against a set of criteria which reflect Waste Management priorities. A management review team ranks and scores the projects thereby generating a prioritized list of projects. Despite decreasing budgets and changing political climates, the process has been a successful decision-aiding tool for selecting construction projects to carry out the Waste Management mission within the Department of Energy

Econophysics of a ranked demand and supply resource allocation problem

Science.gov (United States)

Priel, Avner; Tamir, Boaz

2018-01-01

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

Project Ranking 2

Science.gov (United States)

1986-05-01

CCI) Wq.4)O ’)0)𔃾 COND -) ( CXPWqWVD- - w 0 -M m (0 M -T ID’ig -- >0 fCV-- W IDO-C)O)C� ,,.III-I~n -- v Mori vDI 0) O)wcl-W..,ID f- to WIM4) (3O...en 0- 0000 - I-U .0J0LLAI * XU~L. - .3*fe*2-4)m Z -umeo-Z-a-In2 - ~ u w-m-391 42- 2048 % %’~4-0 --- l.0 nw w- 11 2~4..Z-4 n- -a0f~0* . am 0- X0 -U-K .4I

Refining dermatology journal impact factors using PageRank.

Science.gov (United States)

Dellavalle, Robert P; Schilling, Lisa M; Rodriguez, Marko A; Van de Sompel, Herbert; Bollen, Johan

2007-07-01

Thomson Institute for Scientific Information's journal impact factor, the most common measure of journal status, is based on crude citation counts that do not account for the quality of the journals where the citations originate. This study examines how accounting for citation origin affects the impact factor ranking of dermatology journals. The 2003 impact factors of dermatology journals were adjusted by a weighted PageRank algorithm that assigned greater weight to citations originating in more frequently cited journals. Adjusting for citation origin moved the rank of the Journal of the American Academy of Dermatology higher than that of the Archives of Dermatology (third to second) but did not affect the ranking of the highest impact dermatology journal, the Journal of Investigative Dermatology. The dermatology journals most positively affected by adjusting for citation origin were Contact Dermatitis (moving from 22nd to 7th in rankings) and Burns (21st to 10th). Dermatology journals most negatively affected were Seminars in Cutaneous Medicine and Surgery (5th to 14th), the Journal of Cutaneous Medicine and Surgery (19th to 27th), and the Journal of Investigative Dermatology Symposium Proceedings (26th to 34th). Current measures of dermatology journal status do not incorporate survey data from dermatologists regarding which journals dermatologists esteem most. Adjusting for citation origin provides a more refined measure of journal status and changes relative dermatology journal rankings.

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

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…

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

Energy Technology Data Exchange (ETDEWEB)

Kloosterman, Jeff

2012-12-31

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

A new measure of output ranking performance in automatic document retrieval systems

International Nuclear Information System (INIS)

Ebinuma, Yukio

1987-01-01

A new measure of output ranking performance is proposed on the basis of recall-precision pairs corresponding to ranks of relevant documents when documents are arranged in decreasing order of their scores given by a ranking function. This measure is constructed to take a single value in starting from the area under a recall-precision graph for a ranked output and to distinguish meaningful ranking with a positive value between 0 and 1 from meaningless ranking with a negative value. It is clarified too that the measure must be useful in practice to evaluate the ranking performance made by various ranking function models and to choose the best ranking models among them. (author)

Consequence ranking of radionuclides in Hanford tank waste

International Nuclear Information System (INIS)

Schmittroth, F.A.; De Lorenzo, T.H.

1995-09-01

Radionuclides in the Hanford tank waste are ranked relative to their consequences for the Low-Level Tank Waste program. The ranking identifies key radionuclides where further study is merited. In addition to potential consequences for intrude and drinking-water scenarios supporting low-level waste activities, a ranking based on shielding criteria is provided. The radionuclide production inventories are based on a new and independent ORIGEN2 calculation representing the operation of all Hanford single-pass reactors and the N Reactor

Reduced Rank Adaptive Filtering in Impulsive Noise Environments

KAUST Repository

Soury, Hamza

2014-01-06

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

Reduced Rank Adaptive Filtering in Impulsive Noise Environments

KAUST Repository

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

2014-01-01

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

Proceedings of the sixteenth biennial low-rank fuels symposium

International Nuclear Information System (INIS)

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

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.

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.

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…

Enhancing the Ranking of a Web Page in the Ocean of Data

Directory of Open Access Journals (Sweden)

Hitesh KUMAR SHARMA

2013-10-01

Full Text Available In today's world, web is considered as ocean of data and information (like text, videos, multimedia etc. consisting of millions and millions of web pages in which web pages are linked with each other like a tree. It is often argued that, especially considering the dynamic of the internet, too much time has passed since the scientific work on PageRank, as that it still could be the basis for the ranking methods of the Google search engine. There is no doubt that within the past years most likely many changes, adjustments and modifications regarding the ranking methods of Google have taken place, but PageRank was absolutely crucial for Google's success, so that at least the fundamental concept behind PageRank should still be constitutive. This paper describes the components which affects the ranking of the web pages and helps in increasing the popularity of web site. By adapting these factors website developers can increase their site's page rank and within the PageRank concept, considering the rank of a document is given by the rank of those documents which link to it. Their rank again is given by the rank of documents which link to them. The PageRank of a document is always determined recursively by the PageRank of other documents.

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

Feasibility study of component risk ranking for plant maintenance

International Nuclear Information System (INIS)

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

1999-01-01

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

Centroid Localization of Uncooperative Nodes in Wireless Networks Using a Relative Span Weighting Method

Directory of Open Access Journals (Sweden)

Christine Laurendeau

2010-01-01

Full Text Available Increasingly ubiquitous wireless technologies require novel localization techniques to pinpoint the position of an uncooperative node, whether the target is a malicious device engaging in a security exploit or a low-battery handset in the middle of a critical emergency. Such scenarios necessitate that a radio signal source be localized by other network nodes efficiently, using minimal information. We propose two new algorithms for estimating the position of an uncooperative transmitter, based on the received signal strength (RSS of a single target message at a set of receivers whose coordinates are known. As an extension to the concept of centroid localization, our mechanisms weigh each receiver's coordinates based on the message's relative RSS at that receiver, with respect to the span of RSS values over all receivers. The weights may decrease from the highest RSS receiver either linearly or exponentially. Our simulation results demonstrate that for all but the most sparsely populated wireless networks, our exponentially weighted mechanism localizes a target node within the regulations stipulated for emergency services location accuracy.

Reduced rank adaptive filtering in impulsive noise environments

KAUST Repository

Soury, Hamza

2014-11-01

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

National Automated Highway System Consortium: Modeling Stakeholder Preferences Project

OpenAIRE

Lathrop, John; Chen, Kan

1997-01-01

This document is the final report of the Modeling Stakeholder Preferences Project. The results of the project consist of three results: 1) evaluation framework; 2) focus group non-quantitative findings/ recommendations; and, 3) performance/impact measures, their endpoints, rankings and weights, for each stakeholder group.

Highlighting Entanglement of Cultures via Ranking of Multilingual Wikipedia Articles

Science.gov (United States)

Eom, Young-Ho; Shepelyansky, Dima L.

2013-01-01

How different cultures evaluate a person? Is an important person in one culture is also important in the other culture? We address these questions via ranking of multilingual Wikipedia articles. With three ranking algorithms based on network structure of Wikipedia, we assign ranking to all articles in 9 multilingual editions of Wikipedia and investigate general ranking structure of PageRank, CheiRank and 2DRank. In particular, we focus on articles related to persons, identify top 30 persons for each rank among different editions and analyze distinctions of their distributions over activity fields such as politics, art, science, religion, sport for each edition. We find that local heroes are dominant but also global heroes exist and create an effective network representing entanglement of cultures. The Google matrix analysis of network of cultures shows signs of the Zipf law distribution. This approach allows to examine diversity and shared characteristics of knowledge organization between cultures. The developed computational, data driven approach highlights cultural interconnections in a new perspective. Dated: June 26, 2013 PMID:24098338

Highlighting entanglement of cultures via ranking of multilingual Wikipedia articles.

Directory of Open Access Journals (Sweden)

Young-Ho Eom

Full Text Available How different cultures evaluate a person? Is an important person in one culture is also important in the other culture? We address these questions via ranking of multilingual Wikipedia articles. With three ranking algorithms based on network structure of Wikipedia, we assign ranking to all articles in 9 multilingual editions of Wikipedia and investigate general ranking structure of PageRank, CheiRank and 2DRank. In particular, we focus on articles related to persons, identify top 30 persons for each rank among different editions and analyze distinctions of their distributions over activity fields such as politics, art, science, religion, sport for each edition. We find that local heroes are dominant but also global heroes exist and create an effective network representing entanglement of cultures. The Google matrix analysis of network of cultures shows signs of the Zipf law distribution. This approach allows to examine diversity and shared characteristics of knowledge organization between cultures. The developed computational, data driven approach highlights cultural interconnections in a new perspective. Dated: June 26, 2013.

Neutron radiography with sub-15 {mu}m resolution through event centroiding

Energy Technology Data Exchange (ETDEWEB)

Tremsin, Anton S., E-mail: ast@ssl.berkeley.edu [Space Sciences Laboratory, University of California at Berkeley, Berkeley, CA 94720 (United States); McPhate, Jason B.; Vallerga, John V.; Siegmund, Oswald H.W. [Space Sciences Laboratory, University of California at Berkeley, Berkeley, CA 94720 (United States); Bruce Feller, W. [NOVA Scientific, Inc. 10 Picker Road, Sturbridge, MA 01566 (United States); Lehmann, Eberhard; Kaestner, Anders; Boillat, Pierre; Panzner, Tobias; Filges, Uwe [Spallation Neutron Source Division, Paul Scherrer Institute, CH-5232 Villigen (Switzerland)

2012-10-01

Conversion of thermal and cold neutrons into a strong {approx}1 ns electron pulse with an absolute neutron detection efficiency as high as 50-70% makes detectors with {sup 10}B-doped Microchannel Plates (MCPs) very attractive for neutron radiography and microtomography applications. The subsequent signal amplification preserves the location of the event within the MCP pore (typically 6-10 {mu}m in diameter), providing the possibility to perform neutron counting with high spatial resolution. Different event centroiding techniques of the charge landing on a patterned anode enable accurate reconstruction of the neutron position, provided the charge footprints do not overlap within the time required for event processing. The new fast 2 Multiplication-Sign 2 Timepix readout with >1.2 kHz frame rates provides the unique possibility to detect neutrons with sub-15 {mu}m resolution at several MHz/cm{sup 2} counting rates. The results of high resolution neutron radiography experiments presented in this paper, demonstrate the sub-15 {mu}m resolution capability of our detection system. The high degree of collimation and cold spectrum of ICON and BOA beamlines combined with the high spatial resolution and detection efficiency of MCP-Timepix detectors are crucial for high contrast neutron radiography and microtomography with high spatial resolution. The next generation of Timepix electronics with sparsified readout should enable counting rates in excess of 10{sup 7} n/cm{sup 2}/s taking full advantage of high beam intensity of present brightest neutron imaging facilities.

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

2018-01-01

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.

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

Science.gov (United States)

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

2013-01-14

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

Block models and personalized PageRank

OpenAIRE

Kloumann, Isabel M.; Ugander, Johan; 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...

A model-based approach to operational event groups ranking

Energy Technology Data Exchange (ETDEWEB)

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

2014-04-15

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

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.

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

Science.gov (United States)

Reid, Machar; Morris, Craig

2013-01-01

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

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.

Tensor completion and low-n-rank tensor recovery via convex optimization

International Nuclear Information System (INIS)

Gandy, Silvia; Yamada, Isao; Recht, Benjamin

2011-01-01

In this paper we consider sparsity on a tensor level, as given by the n-rank of a tensor. In an important sparse-vector approximation problem (compressed sensing) and the low-rank matrix recovery problem, using a convex relaxation technique proved to be a valuable solution strategy. Here, we will adapt these techniques to the tensor setting. We use the n-rank of a tensor as a sparsity measure and consider the low-n-rank tensor recovery problem, i.e. the problem of finding the tensor of the lowest n-rank that fulfills some linear constraints. We introduce a tractable convex relaxation of the n-rank and propose efficient algorithms to solve the low-n-rank tensor recovery problem numerically. The algorithms are based on the Douglas–Rachford splitting technique and its dual variant, the alternating direction method of multipliers

A Fast Algorithm for Generating Permutation Distribution of Ranks in ...

African Journals Online (AJOL)

... function of the distribution of the ranks. This further gives insight into the permutation distribution of a rank statistics. The algorithm is implemented with the aid of the computer algebra system Mathematica. Key words: Combinatorics, generating function, permutation distribution, rank statistics, partitions, computer algebra.

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

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......, 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 under a variety of conditionally heteroskedastic innovation processes. An empirical application to the term structure of interest rates is given....

VisualRank: applying PageRank to large-scale image search.

Science.gov (United States)

Jing, Yushi; Baluja, Shumeet

2008-11-01

Because of the relative ease in understanding and processing text, commercial image-search systems often rely on techniques that are largely indistinguishable from text-search. Recently, academic studies have demonstrated the effectiveness of employing image-based features to provide alternative or additional signals. However, it remains uncertain whether such techniques will generalize to a large number of popular web queries, and whether the potential improvement to search quality warrants the additional computational cost. In this work, we cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and propose VisualRank to analyze the visual link structures among images. The images found to be "authorities" are chosen as those that answer the image-queries well. To understand the performance of such an approach in a real system, we conducted a series of large-scale experiments based on the task of retrieving images for 2000 of the most popular products queries. Our experimental results show significant improvement, in terms of user satisfaction and relevancy, in comparison to the most recent Google Image Search results. Maintaining modest computational cost is vital to ensuring that this procedure can be used in practice; we describe the techniques required to make this system practical for large scale deployment in commercial search engines.

SRS: Site ranking system for hazardous chemical and radioactive waste

International Nuclear Information System (INIS)

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

1988-05-01

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

Cell adhesion signaling regulates RANK expression in osteoclast precursors.

Directory of Open Access Journals (Sweden)

Ayako Mochizuki

Full Text Available Cells with monocyte/macrophage lineage expressing receptor activator of NF-κB (RANK differentiate into osteoclasts following stimulation with the RANK ligand (RANKL. Cell adhesion signaling is also required for osteoclast differentiation from precursors. However, details of the mechanism by which cell adhesion signals induce osteoclast differentiation have not been fully elucidated. To investigate the participation of cell adhesion signaling in osteoclast differentiation, mouse bone marrow-derived macrophages (BMMs were used as osteoclast precursors, and cultured on either plastic cell culture dishes (adherent condition or the top surface of semisolid methylcellulose gel loaded in culture tubes (non-adherent condition. BMMs cultured under the adherent condition differentiated into osteoclasts in response to RANKL stimulation. However, under the non-adherent condition, the efficiency of osteoclast differentiation was markedly reduced even in the presence of RANKL. These BMMs retained macrophage characteristics including phagocytic function and gene expression profile. Lipopolysaccharide (LPS and tumor necrosis factor -αTNF-α activated the NF-κB-mediated signaling pathways under both the adherent and non-adherent conditions, while RANKL activated the pathways only under the adherent condition. BMMs highly expressed RANK mRNA and protein under the adherent condition as compared to the non-adherent condition. Also, BMMs transferred from the adherent to non-adherent condition showed downregulated RANK expression within 24 hours. In contrast, transferring those from the non-adherent to adherent condition significantly increased the level of RANK expression. Moreover, interruption of cell adhesion signaling by echistatin, an RGD-containing disintegrin, decreased RANK expression in BMMs, while forced expression of either RANK or TNFR-associated factor 6 (TRAF6 in BMMs induced their differentiation into osteoclasts even under the non

Discriminative Multi-View Interactive Image Re-Ranking.

Science.gov (United States)

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

2017-07-01

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

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.

A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information.

Science.gov (United States)

Wei, Wei; Gao, Bin; Liu, Tie-Yan; Wang, Taifeng; Li, Guohui; Li, Hang

2016-04-01

Graph-based ranking has been extensively studied and frequently applied in many applications, such as webpage ranking. It aims at mining potentially valuable information from the raw graph-structured data. Recently, with the proliferation of rich heterogeneous information (e.g., node/edge features and prior knowledge) available in many real-world graphs, how to effectively and efficiently leverage all information to improve the ranking performance becomes a new challenging problem. Previous methods only utilize part of such information and attempt to rank graph nodes according to link-based methods, of which the ranking performances are severely affected by several well-known issues, e.g., over-fitting or high computational complexity, especially when the scale of graph is very large. In this paper, we address the large-scale graph-based ranking problem and focus on how to effectively exploit rich heterogeneous information of the graph to improve the ranking performance. Specifically, we propose an innovative and effective semi-supervised PageRank (SSP) approach to parameterize the derived information within a unified semi-supervised learning framework (SSLF-GR), then simultaneously optimize the parameters and the ranking scores of graph nodes. Experiments on the real-world large-scale graphs demonstrate that our method significantly outperforms the algorithms that consider such graph information only partially.

The generalized centroid difference method for picosecond sensitive determination of lifetimes of nuclear excited states using large fast-timing arrays

Energy Technology Data Exchange (ETDEWEB)

Régis, J.-M., E-mail: regis@ikp.uni-koeln.de [Institut für Kernphysik der Universität zu Köln, Zülpicher Str. 77, 50937 Köln (Germany); Mach, H. [Departamento de Física Atómica y Nuclear, Universidad Complutense, 28040 Madrid (Spain); Simpson, G.S. [Laboratoire de Physique Subatomique et de Cosmologie Grenoble, 53, rue des Martyrs, 38026 Grenoble Cedex (France); Jolie, J.; Pascovici, G.; Saed-Samii, N.; Warr, N. [Institut für Kernphysik der Universität zu Köln, Zülpicher Str. 77, 50937 Köln (Germany); Bruce, A. [School of Computing, Engineering and Mathematics, University of Brighton, Lewes Road, Brighton BN2 4GJ (United Kingdom); Degenkolb, J. [Institut für Kernphysik der Universität zu Köln, Zülpicher Str. 77, 50937 Köln (Germany); Fraile, L.M. [Departamento de Física Atómica y Nuclear, Universidad Complutense, 28040 Madrid (Spain); Fransen, C. [Institut für Kernphysik der Universität zu Köln, Zülpicher Str. 77, 50937 Köln (Germany); Ghita, D.G. [Horia Hulubei National Institute for Physics and Nuclear Engineering, 77125 Bucharest (Romania); and others

2013-10-21

A novel method for direct electronic “fast-timing” lifetime measurements of nuclear excited states via γ–γ coincidences using an array equipped with N∈N equally shaped very fast high-resolution LaBr{sub 3}(Ce) scintillator detectors is presented. Analogous to the mirror symmetric centroid difference method, the generalized centroid difference method provides two independent “start” and “stop” time spectra obtained by a superposition of the N(N−1)γ–γ time difference spectra of the N detector fast-timing system. The two fast-timing array time spectra correspond to a forward and reverse gating of a specific γ–γ cascade. Provided that the energy response and the electronic time pick-off of the detectors are almost equal, a mean prompt response difference between start and stop events is calibrated and used as a single correction for lifetime determination. These combined fast-timing arrays mean γ–γ time-walk characteristics can be determined for 40keV

Fourth-rank gravity and cosmology

International Nuclear Information System (INIS)

Marrakchi, A.L.; Tapia, V.

1992-07-01

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

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

The Distribution of the Sum of Signed Ranks

Science.gov (United States)

Albright, Brian

2012-01-01

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

Who's #1? The Science of Rating and Ranking

CERN Document Server

Langville, Amy N

2012-01-01

A website's ranking on Google can spell the difference between success and failure for a new business. NCAA football ratings determine which schools get to play for the big money in postseason bowl games. Product ratings influence everything from the clothes we wear to the movies we select on Netflix. Ratings and rankings are everywhere, but how exactly do they work? Who's #1? offers an engaging and accessible account of how scientific rating and ranking methods are created and applied to a variety of uses. Amy Langville and Carl Meyer provide the first comprehensive overview of the mathemat

A cautionary note on the rank product statistic.

Science.gov (United States)

Koziol, James A

2016-06-01

The rank product method introduced by Breitling R et al. [2004, FEBS Letters 573, 83-92] has rapidly generated popularity in practical settings, in particular, detecting differential expression of genes in microarray experiments. The purpose of this note is to point out a particular property of the rank product method, namely, its differential sensitivity to over- and underexpression. It turns out that overexpression is less likely to be detected than underexpression with the rank product statistic. We have conducted both empirical and exact power studies that demonstrate this phenomenon, and summarize these findings in this note. © 2016 Federation of European Biochemical Societies.

Rank of tensors of l-out-of-k functions: an application in probabilistic inference

Czech Academy of Sciences Publication Activity Database

Vomlel, Jiří

2011-01-01

Roč. 47, č. 3 (2011), s. 317-336 ISSN 0023-5954 R&D Projects: GA MŠk 1M0572; GA ČR GA201/09/1891; GA ČR GEICC/08/E010 Grant - others:GA MŠk(CZ) 2C06019 Institutional research plan: CEZ:AV0Z10750506 Keywords : Bayesian network * probabilistic inference * tensor rank Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.454, year: 2011 http://library.utia.cas.cz/separaty/2011/MTR/vomlel-0361630.pdf

Rank Dynamics of Word Usage at Multiple Scales

Directory of Open Access Journals (Sweden)

José A. Morales

2018-05-01

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

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

Science.gov (United States)

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

2014-11-01

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

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

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.

Reducing the rank of gauge groups in orbifold compactification

International Nuclear Information System (INIS)

Sato, Hikaru

1989-01-01

The report introduces general twisted boundary conditions on fermionic string variables and shows that a non-Abelian embedding is possible when background gauge field is introduced on orbifold. This leads to reduction of the rank of the gauge group. The report presents a procedure to obtain the lower-rank gauge groups by the use of non-Abelian Wilson lines. The unbroken gauge group is essentially determined by the eigen vector which should obey the level-matching conditions. The gauge symmetry is determined by certain conditions. In a particular application, it is not necessary to introduce explicit form of the non-Abelian Wilson lines. The procedure starts with introduction of desired eigen vectors which are supposed to be obtained by diagonalization of the boundary conditions with the appropriate transformation matrix. The rank is reduced by one by using the Wilson lines which transform as 3 of SU(2) R or SU(2) in SU(4). A possible way of reducing the rank by two is to use the Wilson lines from SU(2) R x SU(2) or SU(3) in SU(4). The rank is reduced by three by means of the Wilson lines which transform as SU(4) or SU(2) R SU(3). Finally the rank is reduced by four when the Wilson lines with full symmetry of SU(2) R x SU(4) are used. The report tabulates the possible lower-rank gauge groups obtained by the proposed method. Massless fermions corresponding to the eigen vectors are also listed. (N.K.)

Resolution of ranking hierarchies in directed networks

Science.gov (United States)

Barucca, Paolo; Lillo, Fabrizio

2018-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 minimises a score function, termed agony. This function penalises the links violating the hierarchy in a way depending on the strength of the violation. To investigate the resolution of ranking hierarchies we introduce an ensemble of random graphs, the Ranked 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 characterise the resolution threshold and we show that an iterated version of agony can partly overcome this resolution limit. PMID:29394278

Development and first application of an operating events ranking tool

International Nuclear Information System (INIS)

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

2015-01-01

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

Managing obligations to society. Case of best ranked universities in social responsibility

Directory of Open Access Journals (Sweden)

Păunescu Carmen

2017-07-01

Full Text Available Universities have always been engines for the economy, in multiple roles they play, trying to adapt to the continual dynamic changes in the environment, to better align their offerings with the current expectations of the students, employers and society as a whole. Many of the jobs that are now developing on the market and still will develop, as well as the multiple roles that the graduates are asked to play in society, have never been on the agenda of the universities in the past, nor on the mind of the curriculum designers. The current paper aims to assess the university engagement with community by analyzing 27 world universities best ranked in social responsibility according to QS Stars University Ratings 2016. In the paper, we discuss the extent to which different attributes of the university social responsibility are reflected among the initiatives and projects run by the universities investigated. Also, we analyze correlations between university ranking in social responsibility and other rankings. Following the QS Stars methodology, the criteria used to evaluate social responsibility of selected universities included: community investment and development, social work and service in community, human capital development, environmental concern and impact, and other social responsibility actions. The results show that the degree of involvement of universities in social responsible initiatives varies broadly for each one of the dimensions analyzed, in terms of nature, intensity and impact of initiatives. Our research findings offer good insights for both universities’ leaders and community developers in their joint-efforts to develop and grow a prosperous community.

Ranking energy-conservation measures to establish research priorities: synopsis of a workshop

Energy Technology Data Exchange (ETDEWEB)

Moskowitz, P.D.; Le, T.Q.; Pierce, B.

1979-05-02

A workshop was convened to assist DOE's Technology Assessment Division in evaluating the need to prepare additional environmental- and social-impact assessments of different energy-conservation measures. Attendees participated in a decision-making exercise designed to rank 19 different energy-conservation measures according to their overall potential for achieving important national goals and their ease of implementation. The participants felt that the most-important ranking criteria dealt with questions concerning feasibility (economic, political/institutional, social, and technical) and economic efficiency. Other criteria, such as environmental quality and occupational health and safety received lower weights; possibly because of the widespread belief that most of the conservation measures presented would be environmentally beneficial. In the participants' view, the most-promising and feasible conservation measures include new-building-performance standards, retrofit of existing housing stock, new-appliance-performance standards and increased use of smaller cars. In contrast, conservation options which ranked rather low, such as diesel engines, coal-fired aluminum remelt furnaces, and cupola furnace modifications were expected to have some harmful environmental and health impacts. Most of these impacts are expected to be highly localized and of lesser national concern. Disagreement exists as to the efficacy of funding those projects deemed highly desirable and feasible versus those which are expected to have the greater environmental and social impacts. These differences must be taken into account in the research priorities that are eventually established. While environmental and social impacts of alternative energy-conservation measures may prove to be either harmful or beneficial, neither side should be ignored by the policy maker.

An integrated study of spatial multicriteria analysis and mathematical modelling for managed aquifer recharge site suitability mapping and site ranking at Northern Gaza coastal aquifer.

Science.gov (United States)

Rahman, Mohammad Azizur; Rusteberg, Bernd; Uddin, Mohammad Salah; Lutz, Annegret; Saada, Muath Abu; Sauter, Martin

2013-07-30

This paper describes an integrated approach of site suitability mapping and ranking of the most suitable sites, for the implementation of Managed Aquifer Recharge (MAR) projects, using spatial multicriteria decision analysis (SMCDA) techniques and mathematical modelling. The SMCDA procedure contains constraint mapping, site suitability analysis with criteria standardization and weighting, criteria overlay by analytical hierarchy process (AHP) combined with weighted linear combination (WLC) and ordered weighted averaging (OWA), and sensitivity analysis. The hydrogeological impacts of the selected most suitable sites were quantified by using groundwater flow and transport modelling techniques. Finally, ranking of the selected sites was done with the WLC method. The integrated approach is demonstrated by a case study in the coastal aquifer of North Gaza. Constraint mapping shows that 50% of the total study area is suitable for MAR implementation. About 25% of the total area is "very good" and 25% percent is "good" for MAR, according to the site suitability analysis. Six locations were selected and ranked against six representative decision criteria. Long term (year 2003 to year 2040) groundwater flow and transport simulations were performed to quantify the selected criteria under MAR project operation conditions at the selected sites. Finally, the suitability mapping and hydrogeological investigation recommends that the location of the existing infiltration ponds, constructed near the planned North Gaza Wastewater Treatment Plant (NGWWTP) is most suitable for MAR project implementation. This paper concludes that mathematical modelling should be combined with the SMCDA technique in order to select the best location for MAR project implementation. Besides MAR project implementation, the generalised approach can be applicable for any other water resources development project that deals with site selection and implementation. Copyright © 2013 Elsevier Ltd. All rights

Ranking Exponential Trapezoidal Fuzzy Numbers by Median Value

Directory of Open Access Journals (Sweden)

S. Rezvani

2013-12-01

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

Automatic figure ranking and user interfacing for intelligent figure search.

Directory of Open Access Journals (Sweden)

Hong Yu

2010-10-01

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