WorldWideScience

Sample records for ranking text compression

  1. Compressed Sensing with Rank Deficient Dictionaries

    DEFF Research Database (Denmark)

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

    2012-01-01

    In compressed sensing it is generally assumed that the dictionary matrix constitutes a (possibly overcomplete) basis of the signal space. In this paper we consider dictionaries that do not span the signal space, i.e. rank deficient dictionaries. We show that in this case the signal-to-noise ratio...... (SNR) in the compressed samples can be increased by selecting the rows of the measurement matrix from the column space of the dictionary. As an example application of compressed sensing with a rank deficient dictionary, we present a case study of compressed sensing applied to the Coarse Acquisition (C...

  2. Condensing biomedical journal texts through paragraph ranking.

    Science.gov (United States)

    Chiang, Jung-Hsien; Liu, Heng-Hui; Huang, Yi-Ting

    2011-04-15

    The growing availability of full-text scientific articles raises the important issue of how to most efficiently digest full-text content. Although article titles and abstracts provide accurate and concise information on an article's contents, their brevity inevitably entails the loss of detail. Full-text articles provide those details, but require more time to read. The primary goal of this study is to combine the advantages of concise abstracts and detail-rich full-texts to ease the burden of reading. We retrieved abstract-related paragraphs from full-text articles through shared keywords between the abstract and paragraphs from the main text. Significant paragraphs were then recommended by applying a proposed paragraph ranking approach. Finally, the user was provided with a condensed text consisting of these significant paragraphs, allowing the user to save time from perusing the whole article. We compared the performance of the proposed approach with a keyword counting approach and a PageRank-like approach. Evaluation was conducted in two aspects: the importance of each retrieved paragraph and the information coverage of a set of retrieved paragraphs. In both evaluations, the proposed approach outperformed the other approaches. jchiang@mail.ncku.edu.tw.

  3. TEXT COMPRESSION ALGORITHMS - A COMPARATIVE STUDY

    Directory of Open Access Journals (Sweden)

    S. Senthil

    2011-12-01

    Full Text Available Data Compression may be defined as the science and art of the representation of information in a crisply condensed form. For decades, Data compression has been one of the critical enabling technologies for the ongoing digital multimedia revolution. There are a lot of data compression algorithms which are available to compress files of different formats. This paper provides a survey of different basic lossless data compression algorithms. Experimental results and comparisons of the lossless compression algorithms using Statistical compression techniques and Dictionary based compression techniques were performed on text data. Among the Statistical coding techniques, the algorithms such as Shannon-Fano Coding, Huffman coding, Adaptive Huffman coding, Run Length Encoding and Arithmetic coding are considered. Lempel Ziv scheme which is a dictionary based technique is divided into two families: one derived from LZ77 (LZ77, LZSS, LZH, LZB and LZR and the other derived from LZ78 (LZ78, LZW, LZFG, LZC and LZT. A set of interesting conclusions are derived on this basis.

  4. n-Gram-Based Text Compression

    Directory of Open Access Journals (Sweden)

    Vu H. Nguyen

    2016-01-01

    Full Text Available We propose an efficient method for compressing Vietnamese text using n-gram dictionaries. It has a significant compression ratio in comparison with those of state-of-the-art methods on the same dataset. Given a text, first, the proposed method splits it into n-grams and then encodes them based on n-gram dictionaries. In the encoding phase, we use a sliding window with a size that ranges from bigram to five grams to obtain the best encoding stream. Each n-gram is encoded by two to four bytes accordingly based on its corresponding n-gram dictionary. We collected 2.5 GB text corpus from some Vietnamese news agencies to build n-gram dictionaries from unigram to five grams and achieve dictionaries with a size of 12 GB in total. In order to evaluate our method, we collected a testing set of 10 different text files with different sizes. The experimental results indicate that our method achieves compression ratio around 90% and outperforms state-of-the-art methods.

  5. Compression of Short Text on Embedded Systems

    DEFF Research Database (Denmark)

    Rein, S.; Gühmann, C.; Fitzek, Frank

    2006-01-01

    The paper details a scheme for lossless compression of a short data series larger than 50 bytes. The method uses arithmetic coding and context modelling with a low-complexity data model. A data model that takes 32 kBytes of RAM already cuts the data size in half. The compression scheme just takes...

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

  7. Fixed versus dynamic co-occurrence windows in TextRank term weights for information retrieval

    DEFF Research Database (Denmark)

    Lu, Wei; Cheng, Qikai; Lioma, Christina

    2012-01-01

    this, and considers dynamically adjusted windows of term co-occurrence that follow the document structure on a sentence- and paragraph-level. The resulting TextRank term weights are used in a ranking function that re-ranks 1000 initially returned search results in order to improve the precision...

  8. Access, Rank, and Select in Grammar-compressed Strings

    DEFF Research Database (Denmark)

    Belazzougui, Djamal; Cording, Patrick Hagge; Puglisi, Simon J.

    2015-01-01

    S[i,j]), rank c (S,i) (return the number of occurrences of symbol c before position i in S), and select c (S,i) (return the position of the ith occurrence of c in S). Our main result for access is a method that requires \\O(nlogN) bits of space and \\O(logN+m/logσN) time to extract m = j − i + 1...... consecutive symbols from S. Alternatively, we can achieve \\O(logτN+m/logσN) query time using \\O(nτlogτ(N/n)logN) bits of space, matching a lower bound stated by Verbin and Yu for strings where N is polynomially related to n when τ = log ε N. For rank and select we describe data structures of size \\O...

  9. Statistical analysis of compressive low rank tomography with random measurements

    Science.gov (United States)

    Acharya, Anirudh; Guţă, Mădălin

    2017-05-01

    We consider the statistical problem of ‘compressive’ estimation of low rank states (r\\ll d ) with random basis measurements, where r, d are the rank and dimension of the state respectively. We investigate whether for a fixed sample size N, the estimation error associated with a ‘compressive’ measurement setup is ‘close’ to that of the setting where a large number of bases are measured. We generalise and extend previous results, and show that the mean square error (MSE) associated with the Frobenius norm attains the optimal rate rd/N with only O(r log{d}) random basis measurements for all states. An important tool in the analysis is the concentration of the Fisher information matrix (FIM). We demonstrate that although a concentration of the MSE follows from a concentration of the FIM for most states, the FIM fails to concentrate for states with eigenvalues close to zero. We analyse this phenomenon in the case of a single qubit and demonstrate a concentration of the MSE about its optimal despite a lack of concentration of the FIM for states close to the boundary of the Bloch sphere. We also consider the estimation error in terms of a different metric-the quantum infidelity. We show that a concentration in the mean infidelity (MINF) does not exist uniformly over all states, highlighting the importance of loss function choice. Specifically, we show that for states that are nearly pure, the MINF scales as 1/\\sqrt{N} but the constant converges to zero as the number of settings is increased. This demonstrates a lack of ‘compressive’ recovery for nearly pure states in this metric.

  10. Comparison of Document Index Graph Using TextRank and HITS Weighting Method in Automatic Text Summarization

    Science.gov (United States)

    Hadyan, Fadhlil; Shaufiah; Arif Bijaksana, Moch.

    2017-01-01

    Automatic summarization is a system that can help someone to take the core information of a long text instantly. The system can help by summarizing text automatically. there’s Already many summarization systems that have been developed at this time but there are still many problems in those system. In this final task proposed summarization method using document index graph. This method utilizes the PageRank and HITS formula used to assess the web page, adapted to make an assessment of words in the sentences in a text document. The expected outcome of this final task is a system that can do summarization of a single document, by utilizing document index graph with TextRank and HITS to improve the quality of the summary results automatically.

  11. Comparison of vocabularies, representations and ranking algorithms for gene prioritization by text mining.

    Science.gov (United States)

    Yu, Shi; Van Vooren, Steven; Tranchevent, Leon-Charles; De Moor, Bart; Moreau, Yves

    2008-08-15

    Computational gene prioritization methods are useful to help identify susceptibility genes potentially being involved in genetic disease. Recently, text mining techniques have been applied to extract prior knowledge from text-based genomic information sources and this knowledge can be used to improve the prioritization process. However, the effect of various vocabularies, representations and ranking algorithms on text mining for gene prioritization is still an issue that requires systematic and comparative studies. Therefore, a benchmark study about the vocabularies, representations and ranking algorithms in gene prioritization by text mining is discussed in this article. We investigated 5 different domain vocabularies, 2 text representation schemes and 27 linear ranking algorithms for disease gene prioritization by text mining. We indexed 288 177 MEDLINE titles and abstracts with the TXTGate text pro.ling system and adapted the benchmark dataset of the Endeavour gene prioritization system that consists of 618 disease-causing genes. Textual gene pro.les were created and their performance for prioritization were evaluated and discussed in a comparative manner. The results show that inverse document frequency-based representation of gene term vectors performs better than the term-frequency inverse document-frequency representation. The eVOC and MESH domain vocabularies perform better than Gene Ontology, Online Mendelian Inheritance in Man's and London Dysmorphology Database. The ranking algorithms based on 1-SVM, Standard Correlation and Ward linkage method provide the best performance. The MATLAB code of the algorithm and benchmark datasets are available by request. Supplementary data are available at Bioinformatics online.

  12. Using anchor text, spam filtering and Wikipedia for web search and entity ranking

    NARCIS (Netherlands)

    Kamps, J.; Kaptein, R.; Koolen, M.; Voorhees, E.M.; Buckland, L.P.

    2010-01-01

    In this paper, we document our efforts in participating to the TREC 2010 Entity Ranking and Web Tracks. We had multiple aims: For the Web Track we wanted to compare the effectiveness of anchor text of the category A and B collections and the impact of global document quality measures such as

  13. A method for integrating and ranking the evidence for biochemical pathways by mining reactions from text

    Science.gov (United States)

    Miwa, Makoto; Ohta, Tomoko; Rak, Rafal; Rowley, Andrew; Kell, Douglas B.; Pyysalo, Sampo; Ananiadou, Sophia

    2013-01-01

    Motivation: To create, verify and maintain pathway models, curators must discover and assess knowledge distributed over the vast body of biological literature. Methods supporting these tasks must understand both the pathway model representations and the natural language in the literature. These methods should identify and order documents by relevance to any given pathway reaction. No existing system has addressed all aspects of this challenge. Method: We present novel methods for associating pathway model reactions with relevant publications. Our approach extracts the reactions directly from the models and then turns them into queries for three text mining-based MEDLINE literature search systems. These queries are executed, and the resulting documents are combined and ranked according to their relevance to the reactions of interest. We manually annotate document-reaction pairs with the relevance of the document to the reaction and use this annotation to study several ranking methods, using various heuristic and machine-learning approaches. Results: Our evaluation shows that the annotated document-reaction pairs can be used to create a rule-based document ranking system, and that machine learning can be used to rank documents by their relevance to pathway reactions. We find that a Support Vector Machine-based system outperforms several baselines and matches the performance of the rule-based system. The success of the query extraction and ranking methods are used to update our existing pathway search system, PathText. Availability: An online demonstration of PathText 2 and the annotated corpus are available for research purposes at http://www.nactem.ac.uk/pathtext2/. Contact: makoto.miwa@manchester.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. PMID:23813008

  14. The enhancement of TextRank algorithm by using word2vec and its application on topic extraction

    Science.gov (United States)

    Zuo, Xiaolei; Zhang, Silan; Xia, Jingbo

    2017-08-01

    TextRank is a traditional method for keyword matching and topic extraction, while its drawback stems from the ignoring of the semantic similarity among texts. By using word embedding technique, Word2Vec was incorporated into traditional TextRank and four simulation tests were carried on for model comparison. The results showed that the hybrid combination of Word2Vec and TextRank algorithms achieved better keyword/topic extraction towards our testing text dataset.

  15. Data Compression for the Tomo-e Gozen Using Low-rank Matrix Approximation

    Science.gov (United States)

    Morii, Mikio; Ikeda, Shiro; Sako, Shigeyuki; Ohsawa, Ryou

    2017-01-01

    Optical wide-field surveys with a high cadence are expected to create a new field of astronomy, so-called “movie astronomy,” in the near future. The amount of data from the observations will be huge, and hence efficient data compression will be indispensable. Here we propose a low-rank matrix approximation with sparse matrix decomposition as a promising solution to reduce the data size effectively while preserving sufficient scientific information. We apply one of the methods to the movie data obtained with the prototype model of the Tomo-e Gozen mounted on the 1.0 m Schmidt telescope of Kiso Observatory. Once full-scale observation with the Tomo-e Gozen commences, it will generate ˜30 TB of data per night. We demonstrate that the data are compressed by a factor of about 10 in size without losing transient events like optical short transient point sources and meteors. The intensity of point sources can be recovered from the compressed data. The processing runs sufficiently fast, compared with the expected data-acquisition rate in the actual observing runs.

  16. Texting

    Science.gov (United States)

    Tilley, Carol L.

    2009-01-01

    With the increasing ranks of cell phone ownership is an increase in text messaging, or texting. During 2008, more than 2.5 trillion text messages were sent worldwide--that's an average of more than 400 messages for every person on the planet. Although many of the messages teenagers text each day are perhaps nothing more than "how r u?" or "c u…

  17. Analysis and study on text representation to improve the accuracy of the Normalized Compression Distance

    CERN Document Server

    Granados, Ana

    2012-01-01

    The huge amount of information stored in text form makes methods that deal with texts really interesting. This thesis focuses on dealing with texts using compression distances. More specifically, the thesis takes a small step towards understanding both the nature of texts and the nature of compression distances. Broadly speaking, the way in which this is done is exploring the effects that several distortion techniques have on one of the most successful distances in the family of compression distances, the Normalized Compression Distance -NCD-.

  18. Ranking the whole MEDLINE database according to a large training set using text indexing

    Directory of Open Access Journals (Sweden)

    Andrade Miguel A

    2005-03-01

    Full Text Available Abstract Background The MEDLINE database contains over 12 million references to scientific literature, with about 3/4 of recent articles including an abstract of the publication. Retrieval of entries using queries with keywords is useful for human users that need to obtain small selections. However, particular analyses of the literature or database developments may need the complete ranking of all the references in the MEDLINE database as to their relevance to a topic of interest. This report describes a method that does this ranking using the differences in word content between MEDLINE entries related to a topic and the whole of MEDLINE, in a computational time appropriate for an article search query engine. Results We tested the capabilities of our system to retrieve MEDLINE references which are relevant to the subject of stem cells. We took advantage of the existing annotation of references with terms from the MeSH hierarchical vocabulary (Medical Subject Headings, developed at the National Library of Medicine. A training set of 81,416 references was constructed by selecting entries annotated with the MeSH term stem cells or some child in its sub tree. Frequencies of all nouns, verbs, and adjectives in the training set were computed and the ratios of word frequencies in the training set to those in the entire MEDLINE were used to score references. Self-consistency of the algorithm, benchmarked with a test set containing the training set and an equal number of references randomly selected from MEDLINE was better using nouns (79% than adjectives (73% or verbs (70%. The evaluation of the system with 6,923 references not used for training, containing 204 articles relevant to stem cells according to a human expert, indicated a recall of 65% for a precision of 65%. Conclusion This strategy appears to be useful for predicting the relevance of MEDLINE references to a given concept. The method is simple and can be used with any user-defined training

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

    Directory of Open Access Journals (Sweden)

    Lin Jimmy

    2008-06-01

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

  20. Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

    DEFF Research Database (Denmark)

    Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li

    2009-01-01

    We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...... complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck....

  1. Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

    DEFF Research Database (Denmark)

    Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li

    2007-01-01

    We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...... complexities for both problems. In particular, we significantly improve the space bounds. In practical applications the space is likely to be a bottleneck and therefore this is of crucial importance....

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

    Science.gov (United States)

    Lin, Jimmy

    2008-06-06

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

  3. 3D Forest Structure Estimation from SAR Tomography by Means of a Full Rank Polarimetric Inversion Based on Compressive Sensing

    Science.gov (United States)

    Cazcarra Bes, Victor; Tello-Alonso, Maria; Papathanassiou, Kostas

    2015-04-01

    SAR tomography (TomoSAR) techniques allow a direct 3D imaging by exploiting angular diversity with different passes of the sensor. One of the main drawbacks of SAR tomography is that the estimation of the vertical reflectivity profile has to be performed through a limited set of multibaseline acquisitions, which requires solving a highly underdetermined system of equations. In TomoSAR literature, the Capon and the Fourier beamforming spectral estimators are widely employed. As an alternative, the application of Compressive Sensing (CS) techniques to the estimation of forest profiles has been recently introduced. In this paper, a different algorithm based on CS is proposed. It performs a full rank polarimetric inversion, allowing thus an estimation of the 3D coherency matrices. To study the full rank polarimetric TomoSAR inversion, a temporal series of airborne data is used. The results of the 3D polarimetric inversion will be contrasted to in situ measurements and LIDAR data.

  4. Ranking the whole MEDLINE database according to a large training set using text indexing

    Science.gov (United States)

    Suomela, Brian P; Andrade, Miguel A

    2005-01-01

    Background The MEDLINE database contains over 12 million references to scientific literature, with about 3/4 of recent articles including an abstract of the publication. Retrieval of entries using queries with keywords is useful for human users that need to obtain small selections. However, particular analyses of the literature or database developments may need the complete ranking of all the references in the MEDLINE database as to their relevance to a topic of interest. This report describes a method that does this ranking using the differences in word content between MEDLINE entries related to a topic and the whole of MEDLINE, in a computational time appropriate for an article search query engine. Results We tested the capabilities of our system to retrieve MEDLINE references which are relevant to the subject of stem cells. We took advantage of the existing annotation of references with terms from the MeSH hierarchical vocabulary (Medical Subject Headings, developed at the National Library of Medicine). A training set of 81,416 references was constructed by selecting entries annotated with the MeSH term stem cells or some child in its sub tree. Frequencies of all nouns, verbs, and adjectives in the training set were computed and the ratios of word frequencies in the training set to those in the entire MEDLINE were used to score references. Self-consistency of the algorithm, benchmarked with a test set containing the training set and an equal number of references randomly selected from MEDLINE was better using nouns (79%) than adjectives (73%) or verbs (70%). The evaluation of the system with 6,923 references not used for training, containing 204 articles relevant to stem cells according to a human expert, indicated a recall of 65% for a precision of 65%. Conclusion This strategy appears to be useful for predicting the relevance of MEDLINE references to a given concept. The method is simple and can be used with any user-defined training set. Choice of the part of

  5. A high capacity text steganography scheme based on LZW compression and color coding

    Directory of Open Access Journals (Sweden)

    Aruna Malik

    2017-02-01

    Full Text Available In this paper, capacity and security issues of text steganography have been considered by employing LZW compression technique and color coding based approach. The proposed technique uses the forward mail platform to hide the secret data. This algorithm first compresses secret data and then hides the compressed secret data into the email addresses and also in the cover message of the email. The secret data bits are embedded in the message (or cover text by making it colored using a color coding table. Experimental results show that the proposed method not only produces a high embedding capacity but also reduces computational complexity. Moreover, the security of the proposed method is significantly improved by employing stego keys. The superiority of the proposed method has been experimentally verified by comparing with recently developed existing techniques.

  6. Compression and Combining Based on Channel Shortening and Rank Reduction Technique for Cooperative Wireless Sensor Networks

    KAUST Repository

    Ahmed, Qasim Zeeshan

    2013-12-18

    This paper investigates and compares the performance of wireless sensor networks where sensors operate on the principles of cooperative communications. We consider a scenario where the source transmits signals to the destination with the help of L sensors. As the destination has the capacity of processing only U out of these L signals, the strongest U signals are selected while the remaining (L?U) signals are suppressed. A preprocessing block similar to channel-shortening is proposed in this contribution. However, this preprocessing block employs a rank-reduction technique instead of channel-shortening. By employing this preprocessing, we are able to decrease the computational complexity of the system without affecting the bit error rate (BER) performance. From our simulations, it can be shown that these schemes outperform the channel-shortening schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared to channel-shortening schemes when sensors employ fixed gain amplification. However, for sensors which employ variable gain amplification, a tradeoff exists in terms of BER performance between the channel-shortening and these schemes. These schemes outperform channel-shortening scheme for lower signal-to-noise ratio.

  7. Text mining effectively scores and ranks the literature for improving chemical-gene-disease curation at the comparative toxicogenomics database.

    Science.gov (United States)

    Davis, Allan Peter; Wiegers, Thomas C; Johnson, Robin J; Lay, Jean M; Lennon-Hopkins, Kelley; Saraceni-Richards, Cynthia; Sciaky, Daniela; Murphy, Cynthia Grondin; Mattingly, Carolyn J

    2013-01-01

    The Comparative Toxicogenomics Database (CTD; http://ctdbase.org/) is a public resource that curates interactions between environmental chemicals and gene products, and their relationships to diseases, as a means of understanding the effects of environmental chemicals on human health. CTD provides a triad of core information in the form of chemical-gene, chemical-disease, and gene-disease interactions that are manually curated from scientific articles. To increase the efficiency, productivity, and data coverage of manual curation, we have leveraged text mining to help rank and prioritize the triaged literature. Here, we describe our text-mining process that computes and assigns each article a document relevancy score (DRS), wherein a high DRS suggests that an article is more likely to be relevant for curation at CTD. We evaluated our process by first text mining a corpus of 14,904 articles triaged for seven heavy metals (cadmium, cobalt, copper, lead, manganese, mercury, and nickel). Based upon initial analysis, a representative subset corpus of 3,583 articles was then selected from the 14,094 articles and sent to five CTD biocurators for review. The resulting curation of these 3,583 articles was analyzed for a variety of parameters, including article relevancy, novel data content, interaction yield rate, mean average precision, and biological and toxicological interpretability. We show that for all measured parameters, the DRS is an effective indicator for scoring and improving the ranking of literature for the curation of chemical-gene-disease information at CTD. Here, we demonstrate how fully incorporating text mining-based DRS scoring into our curation pipeline enhances manual curation by prioritizing more relevant articles, thereby increasing data content, productivity, and efficiency.

  8. Text Mining Effectively Scores and Ranks the Literature for Improving Chemical-Gene-Disease Curation at the Comparative Toxicogenomics Database

    Science.gov (United States)

    Johnson, Robin J.; Lay, Jean M.; Lennon-Hopkins, Kelley; Saraceni-Richards, Cynthia; Sciaky, Daniela; Murphy, Cynthia Grondin; Mattingly, Carolyn J.

    2013-01-01

    The Comparative Toxicogenomics Database (CTD; http://ctdbase.org/) is a public resource that curates interactions between environmental chemicals and gene products, and their relationships to diseases, as a means of understanding the effects of environmental chemicals on human health. CTD provides a triad of core information in the form of chemical-gene, chemical-disease, and gene-disease interactions that are manually curated from scientific articles. To increase the efficiency, productivity, and data coverage of manual curation, we have leveraged text mining to help rank and prioritize the triaged literature. Here, we describe our text-mining process that computes and assigns each article a document relevancy score (DRS), wherein a high DRS suggests that an article is more likely to be relevant for curation at CTD. We evaluated our process by first text mining a corpus of 14,904 articles triaged for seven heavy metals (cadmium, cobalt, copper, lead, manganese, mercury, and nickel). Based upon initial analysis, a representative subset corpus of 3,583 articles was then selected from the 14,094 articles and sent to five CTD biocurators for review. The resulting curation of these 3,583 articles was analyzed for a variety of parameters, including article relevancy, novel data content, interaction yield rate, mean average precision, and biological and toxicological interpretability. We show that for all measured parameters, the DRS is an effective indicator for scoring and improving the ranking of literature for the curation of chemical-gene-disease information at CTD. Here, we demonstrate how fully incorporating text mining-based DRS scoring into our curation pipeline enhances manual curation by prioritizing more relevant articles, thereby increasing data content, productivity, and efficiency. PMID:23613709

  9. Preserving color fidelity for display devices using scalable memory compression architecture for text, graphics, and video

    Science.gov (United States)

    Lebowsky, Fritz; Nicolas, Marina

    2014-01-01

    High-end monitors and TVs based on LCD technology continue to increase their native display resolution to 4k by 2k and beyond. Subsequently, uncompressed pixel amplitude processing becomes costly not only when transmitting over cable or wireless communication channels, but also when processing with array processor architectures. For motion video content, spatial preprocessing from YCbCr 444 to YCbCr 420 is widely accepted. However, due to spatial low pass filtering in horizontal and vertical direction, quality and readability of small text and graphics content is heavily compromised when color contrast is high in chrominance channels. On the other hand, straight forward YCbCr 444 compression based on mathematical error coding schemes quite often lacks optimal adaptation to visually significant image content. We present a block-based memory compression architecture for text, graphics, and video enabling multidimensional error minimization with context sensitive control of visually noticeable artifacts. As a result of analyzing image context locally, the number of operations per pixel can be significantly reduced, especially when implemented on array processor architectures. A comparative analysis based on some competitive solutions highlights the effectiveness of our approach, identifies its current limitations with regard to high quality color rendering, and illustrates remaining visual artifacts.

  10. Motion-compensated compressed sensing for dynamic contrast-enhanced MRI using regional spatiotemporal sparsity and region tracking: Block LOw-rank Sparsity with Motion-guidance (BLOSM)

    Science.gov (United States)

    Chen, Xiao; Salerno, Michael; Yang, Yang; Epstein, Frederick H.

    2014-01-01

    Purpose Dynamic contrast-enhanced MRI of the heart is well-suited for acceleration with compressed sensing (CS) due to its spatiotemporal sparsity; however, respiratory motion can degrade sparsity and lead to image artifacts. We sought to develop a motion-compensated CS method for this application. Methods A new method, Block LOw-rank Sparsity with Motion-guidance (BLOSM), was developed to accelerate first-pass cardiac MRI, even in the presence of respiratory motion. This method divides the images into regions, tracks the regions through time, and applies matrix low-rank sparsity to the tracked regions. BLOSM was evaluated using computer simulations and first-pass cardiac datasets from human subjects. Using rate-4 acceleration, BLOSM was compared to other CS methods such as k-t SLR that employs matrix low-rank sparsity applied to the whole image dataset, with and without motion tracking, and to k-t FOCUSS with motion estimation and compensation that employs spatial and temporal-frequency sparsity. Results BLOSM was qualitatively shown to reduce respiratory artifact compared to other methods. Quantitatively, using root mean squared error and the structural similarity index, BLOSM was superior to other methods. Conclusion BLOSM, which exploits regional low rank structure and uses region tracking for motion compensation, provides improved image quality for CS-accelerated first-pass cardiac MRI. PMID:24243528

  11. Block selective redaction for minimizing loss during de-identification of burned in text in irreversibly compressed JPEG medical images.

    Science.gov (United States)

    Clunie, David A; Gebow, Dan

    2015-01-01

    Deidentification of medical images requires attention to both header information as well as the pixel data itself, in which burned-in text may be present. If the pixel data to be deidentified is stored in a compressed form, traditionally it is decompressed, identifying text is redacted, and if necessary, pixel data are recompressed. Decompression without recompression may result in images of excessive or intractable size. Recompression with an irreversible scheme is undesirable because it may cause additional loss in the diagnostically relevant regions of the images. The irreversible (lossy) JPEG compression scheme works on small blocks of the image independently, hence, redaction can selectively be confined only to those blocks containing identifying text, leaving all other blocks unchanged. An open source implementation of selective redaction and a demonstration of its applicability to multiframe color ultrasound images is described. The process can be applied either to standalone JPEG images or JPEG bit streams encapsulated in other formats, which in the case of medical images, is usually DICOM.

  12. Compression in the Superintendent Ranks

    Science.gov (United States)

    Saron, Bradford G.; Birchbauer, Louis J.

    2011-01-01

    Sadly, the fiscal condition of school systems now not only is troublesome, but in some cases has surpassed all expectations for the worst-case scenario. Among the states, one common response is to drop funding for public education to inadequate levels, leading to permanent program cuts, school closures, staff layoffs, district dissolutions and…

  13. The Protein-Protein Interaction tasks of BioCreative III: classification/ranking of articles and linking bio-ontology concepts to full text

    Science.gov (United States)

    2011-01-01

    Background Determining usefulness of biomedical text mining systems requires realistic task definition and data selection criteria without artificial constraints, measuring performance aspects that go beyond traditional metrics. The BioCreative III Protein-Protein Interaction (PPI) tasks were motivated by such considerations, trying to address aspects including how the end user would oversee the generated output, for instance by providing ranked results, textual evidence for human interpretation or measuring time savings by using automated systems. Detecting articles describing complex biological events like PPIs was addressed in the Article Classification Task (ACT), where participants were asked to implement tools for detecting PPI-describing abstracts. Therefore the BCIII-ACT corpus was provided, which includes a training, development and test set of over 12,000 PPI relevant and non-relevant PubMed abstracts labeled manually by domain experts and recording also the human classification times. The Interaction Method Task (IMT) went beyond abstracts and required mining for associations between more than 3,500 full text articles and interaction detection method ontology concepts that had been applied to detect the PPIs reported in them. Results A total of 11 teams participated in at least one of the two PPI tasks (10 in ACT and 8 in the IMT) and a total of 62 persons were involved either as participants or in preparing data sets/evaluating these tasks. Per task, each team was allowed to submit five runs offline and another five online via the BioCreative Meta-Server. From the 52 runs submitted for the ACT, the highest Matthew's Correlation Coefficient (MCC) score measured was 0.55 at an accuracy of 89% and the best AUC iP/R was 68%. Most ACT teams explored machine learning methods, some of them also used lexical resources like MeSH terms, PSI-MI concepts or particular lists of verbs and nouns, some integrated NER approaches. For the IMT, a total of 42 runs were

  14. Combined Reduced-Rank Transform

    Directory of Open Access Journals (Sweden)

    Anatoli Torokhti

    2006-04-01

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

  15. Tensor Rank

    OpenAIRE

    Erdtman, Elias; Jönsson, Carl

    2012-01-01

    This master's thesis addresses numerical methods of computing the typical ranks of tensors over the real numbers and explores some properties of tensors over finite fields. We present three numerical methods to compute typical tensor rank. Two of these have already been published and can be used to calculate the lowest typical ranks of tensors and an approximate percentage of how many tensors have the lowest typical ranks (for some tensor formats), respectively. The third method was developed...

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

  17. Can College Rankings Be Believed?

    Directory of Open Access Journals (Sweden)

    Meredith Davis

    Full Text Available The article summarizes literature on college and university rankings worldwide and the strategies used by various ranking organizations, including those of government and popular media. It traces the history of national and global rankings, indicators used by ranking systems, and the effect of rankings on academic programs and their institutions. Although ranking systems employ diverse criteria and most weight certain indicators over others, there is considerable skepticism that most actually measure educational quality. At the same time, students and their families increasingly consult these evaluations when making college decisions, and sponsors of faculty research consider reputation when forming academic partnerships. While there are serious concerns regarding the validity of ranking institutions when so little data can support differences between one institution and another, college rankings appear to be here to stay.

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

  19. 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. PMID:28713181

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

  1. Ranking library materials

    OpenAIRE

    Lewandowski, Dirk

    2015-01-01

    Purpose: This paper discusses ranking factors suitable for library materials and shows that ranking in general is a complex process and that ranking for library materials requires a variety of techniques. Design/methodology/approach: The relevant literature is reviewed to provide a systematic overview of suitable ranking factors. The discussion is based on an overview of ranking factors used in Web search engines. Findings: While there are a wide variety of ranking factors appl...

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

  3. Ranking Baltic States Researchers

    Directory of Open Access Journals (Sweden)

    Gyula Mester

    2017-10-01

    Full Text Available In this article, using the h-index and the total number of citations, the best 10 Lithuanian, Latvian and Estonian researchers from several disciplines are ranked. The list may be formed based on the h-index and the total number of citations, given in Web of Science, Scopus, Publish or Perish Program and Google Scholar database. Data for the first 10 researchers are presented. Google Scholar is the most complete. Therefore, to define a single indicator, h-index calculated by Google Scholar may be a good and simple one. The author chooses the Google Scholar database as it is the broadest one.

  4. Reduced Rank Regression

    DEFF Research Database (Denmark)

    Johansen, Søren

    2008-01-01

    The reduced rank regression model is a multivariate regression model with a coefficient matrix with reduced rank. The reduced rank regression algorithm is an estimation procedure, which estimates the reduced rank regression model. It is related to canonical correlations and involves calculating e...... eigenvalues and eigenvectors. We give a number of different applications to regression and time series analysis, and show how the reduced rank regression estimator can be derived as a Gaussian maximum likelihood estimator. We briefly mention asymptotic results......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...

  5. Application of computer-aided design and 3D-printed navigation template in Locking Compression Pediatric Hip Plate[Formula: see text] placement for pediatric hip disease.

    Science.gov (United States)

    Zheng, Pengfei; Yao, Qingqiang; Xu, Peng; Wang, Liming

    2017-05-01

    To investigate the feasibility and accuracy of a drill template based on computer-aided design (CAD) and 3D printing technology for the placement of screws in Locking Compression Pediatric Hip Plate (LCP-PHP). LCP-PHP was used in 11 children [5 with femoral neck fracture and 6 with development dysplasia of hip (DDH)]. Using the CT data, the proximal femur model was created by a 3D printer. Fracture reduction and the placement of the screw in the femoral neck and the LCP-PHP were simulated by the computer. The navigation template was designed by the software to match the proximal femur. After the feasibility of the 3D model operation was demonstrated before the operation, the guide pins and the screws were inserted with the help of the navigate template in the operation. During surgery, the navigation template for each case was matched to the bony markers of the proximal femur. With the help of the template, in femoral neck fracture cases, three screws could be accurately inserted into the femoral neck to implant the LCP-PHP and stabilize the fracture. The template for DDH includes all operation parameters and steps for proximal femoral varus rotation and shortening osteotomy, which made the surgery much easier to perform. Radiographs taken after surgery showed that the postoperative results closely corresponded to the preoperative computer simulation. The average time taken for LCP-PHP placement was 26.5 min; radiography was used during surgery only for an average of 6.0 times. Postoperative radiographs showed good results. With the use of CAD and 3D printing technology, accurate placement of individualized navigation template of LCP-PHP can be achieved. This technology can reduce intraoperative damage to the femoral neck epiphysis, decrease operation time, reduce intraoperative hemorrhage, and decrease radiation exposure to patients and personnel during the surgery.

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

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

  8. Speech Compression

    Directory of Open Access Journals (Sweden)

    Jerry D. Gibson

    2016-06-01

    Full Text Available Speech compression is a key technology underlying digital cellular communications, VoIP, voicemail, and voice response systems. We trace the evolution of speech coding based on the linear prediction model, highlight the key milestones in speech coding, and outline the structures of the most important speech coding standards. Current challenges, future research directions, fundamental limits on performance, and the critical open problem of speech coding for emergency first responders are all discussed.

  9. Maximum Waring ranks of monomials

    OpenAIRE

    Holmes, Erik; Plummer, Paul; Siegert, Jeremy; Teitler, Zach

    2013-01-01

    We show that monomials and sums of pairwise coprime monomials in four or more variables have Waring rank less than the generic rank, with a short list of exceptions. We asymptotically compare their ranks with the generic rank.

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

  11. University ranking methodologies. An interview with Ben Sowter about the Quacquarelli Symonds World University Ranking

    Directory of Open Access Journals (Sweden)

    Alberto Baccini

    2015-10-01

    Full Text Available University rankings represent a controversial issue in the debate about higher education policy. One of the best known university ranking is the Quacquarelli Symonds World University Rankings (QS, published annually since 2004 by Quacquarelli Symonds ltd, a company founded in 1990 and headquartered in London. QS provides a ranking based on a score calculated by weighting six different indicators. The 2015 edition, published in October 2015, introduced major methodological innovations and, as a consequence, many universities worldwide underwent major changes of their scores and ranks. Ben Sowter, head of division of intelligence unit of Quacquarelli Symonds, responds to 15 questions about the new QS methodology.

  12. Academic rankings: an approach to a Portuguese ranking

    OpenAIRE

    Bernardino, Pedro; Marques,Rui

    2009-01-01

    The academic rankings are a controversial subject in higher education. However, despite all the criticism, academic rankings are here to stay and more and more different stakeholders use rankings to obtain information about the institutions’ performance. The two most well-known rankings, The Times and the Shanghai Jiao Tong University rankings have different methodologies. The Times ranking is based on peer review, whereas the Shanghai ranking has only quantitative indicators and is mainly ba...

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Pedro Bernardino

    2010-03-01

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

  17. Celiac Artery Compression Syndrome

    Directory of Open Access Journals (Sweden)

    Mohammed Muqeetadnan

    2013-01-01

    Full Text Available Celiac artery compression syndrome is a rare disorder characterized by episodic abdominal pain and weight loss. It is the result of external compression of celiac artery by the median arcuate ligament. We present a case of celiac artery compression syndrome in a 57-year-old male with severe postprandial abdominal pain and 30-pound weight loss. The patient eventually responded well to surgical division of the median arcuate ligament by laparoscopy.

  18. Asset ranking manager (ranking index of components)

    Energy Technology Data Exchange (ETDEWEB)

    Maloney, S.M.; Engle, A.M.; Morgan, T.A. [Applied Reliability, Maracor Software and Engineering (United States)

    2004-07-01

    The Ranking Index of Components (RIC) is an Asset Reliability Manager (ARM), which itself is a Web Enabled front end where plant database information fields from several disparate databases are combined. That information is used to create a specific weighted number (Ranking Index) relating to that components health and risk to the site. The higher the number, the higher priority that any work associated with that component receives. ARM provides site Engineering, Maintenance and Work Control personnel with a composite real time - (current condition) look at the components 'risk of not working' to the plant. Information is extracted from the existing Computerized Maintenance management System (CMMS) and specific site applications and processed nightly. ARM helps to ensure that the most important work is placed into the workweeks and the non value added work is either deferred, frequency changed or deleted. This information is on the web, updated each night, and available for all employees to use. This effort assists the work management specialist when allocating limited resources to the most important work. The use of this tool has maximized resource usage, performing the most critical work with available resources. The ARM numbers are valued inputs into work scoping for the workweek managers. System and Component Engineers are using ARM to identify the components that are at 'risk of failure' and therefore should be placed into the appropriate work week schedule.

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

  20. Ranking of Rankings: Benchmarking Twenty-Five Higher Education Ranking Systems in Europe

    Science.gov (United States)

    Stolz, Ingo; Hendel, Darwin D.; Horn, Aaron S.

    2010-01-01

    The purpose of this study is to evaluate the ranking practices of 25 European higher education ranking systems (HERSs). Ranking practices were assessed with 14 quantitative measures derived from the Berlin Principles on Ranking of Higher Education Institutions (BPs). HERSs were then ranked according to their degree of congruence with the BPs.…

  1. From rankings to mission.

    Science.gov (United States)

    Kirch, Darrell G; Prescott, John E

    2013-08-01

    Since the 1980s, school ranking systems have been a topic of discussion among leaders of higher education. Various ranking systems are based on inadequate data that fail to illustrate the complex nature and special contributions of the institutions they purport to rank, including U.S. medical schools, each of which contributes uniquely to meeting national health care needs. A study by Tancredi and colleagues in this issue of Academic Medicine illustrates the limitations of rankings specific to primary care training programs. This commentary discusses, first, how each school's mission and strengths, as well as the impact it has on the community it serves, are distinct, and, second, how these schools, which are each unique, are poorly represented by overly subjective ranking methodologies. Because academic leaders need data that are more objective to guide institutional development, the Association of American Medical Colleges (AAMC) has been developing tools to provide valid data that are applicable to each medical school. Specifically, the AAMC's Medical School Admissions Requirements and its Missions Management Tool each provide a comprehensive assessment of medical schools that leaders are using to drive institutional capacity building. This commentary affirms the importance of mission while challenging the leaders of medical schools, teaching hospitals, and universities to use reliable data to continually improve the quality of their training programs to improve the health of all.

  2. Reliability of journal impact factor rankings

    Directory of Open Access Journals (Sweden)

    Greenwood Darren C

    2007-11-01

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

  3. Validating rankings in soccer championships

    Directory of Open Access Journals (Sweden)

    Annibal Parracho Sant'Anna

    2012-08-01

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

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

  5. Text mining by Tsallis entropy

    Science.gov (United States)

    Jamaati, Maryam; Mehri, Ali

    2018-01-01

    Long-range correlations between the elements of natural languages enable them to convey very complex information. Complex structure of human language, as a manifestation of natural languages, motivates us to apply nonextensive statistical mechanics in text mining. Tsallis entropy appropriately ranks the terms' relevance to document subject, taking advantage of their spatial correlation length. We apply this statistical concept as a new powerful word ranking metric in order to extract keywords of a single document. We carry out an experimental evaluation, which shows capability of the presented method in keyword extraction. We find that, Tsallis entropy has reliable word ranking performance, at the same level of the best previous ranking methods.

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

  7. ARWU vs. Alternative ARWU Ranking: What are the Consequences for Lower Ranked Universities?

    Directory of Open Access Journals (Sweden)

    Milica Maričić

    2017-05-01

    Full Text Available The ARWU ranking has been a source of academic debate since its development in 2003, but the same does not account for the Alternative ARWU ranking. Namely, the Alternative ARWU ranking attempts to reduce the influence of the prestigious indicators Alumni and Award which are based on the number of received Nobel Prizes and Fields Medals by alumni or university staff. However, the consequences of the reduction of the two indicators have not been scrutinized in detail. Therefore, we propose a statistical approach to the comparison of the two rankings and an in-depth analysis of the Alternative ARWU groups. The obtained results, which are based on the official data, can provide new insights into the nature of the Alternative ARWU ranking. The presented approach might initiate further research on the Alternative ARWU ranking and on the impact of university ranking’s list length. JEL Classification: C10, C38, I23

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

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

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

  11. Compression embedding

    Science.gov (United States)

    Sandford, M.T. II; Handel, T.G.; Bradley, J.N.

    1998-07-07

    A method and apparatus for embedding auxiliary information into the digital representation of host data created by a lossy compression technique and a method and apparatus for constructing auxiliary data from the correspondence between values in a digital key-pair table with integer index values existing in a representation of host data created by a lossy compression technique are disclosed. The methods apply to data compressed with algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as ordered sequences of blocks containing integer indices having redundancy and uncertainty of value by one unit, allowing indices which are adjacent in value to be manipulated to encode auxiliary data. Also included is a method to improve the efficiency of lossy compression algorithms by embedding white noise into the integer indices. Lossy compression methods use loss-less compression to reduce to the final size the intermediate representation as indices. The efficiency of the loss-less compression, known also as entropy coding compression, is increased by manipulating the indices at the intermediate stage. Manipulation of the intermediate representation improves lossy compression performance by 1 to 10%. 21 figs.

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

  13. Fractional cointegration rank estimation

    DEFF Research Database (Denmark)

    Lasak, Katarzyna; Velasco, Carlos

    We consider cointegration rank estimation for a p-dimensional Fractional Vector Error Correction Model. We propose a new two-step procedure which allows testing for further long-run equilibrium relations with possibly different persistence levels. The fi…rst step consists in estimating the parame......We consider cointegration rank estimation for a p-dimensional Fractional Vector Error Correction Model. We propose a new two-step procedure which allows testing for further long-run equilibrium relations with possibly different persistence levels. The fi…rst step consists in estimating...... to control for stochastic trend estimation effects from the first step. The critical values of the tests proposed depend only on the number of common trends under the null, p - r, and on the interval of the cointegration degrees b allowed, but not on the true cointegration degree b0. Hence, no additional...

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

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

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

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

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

    Science.gov (United States)

    2015-04-28

    eigenvector of the associated Laplacian matrix (i.e., the Fiedler vector) matches that of the variables. In other words, this approach (reminiscent of...S1), i.e., Dii = ∑n j=1Gi,j is the degree of node i in the measurement graph G. 3: Compute the Fiedler vector of S (eigenvector corresponding to the...smallest nonzero eigenvalue of LS). 4: Output the ranking induced by sorting the Fiedler vector of S, with the global ordering (increasing or decreasing

  19. Rankings from Fuzzy Pairwise Comparisons

    NARCIS (Netherlands)

    van den Broek, P.M.; Noppen, J.A.R.; Mohammadian, M.

    2006-01-01

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

  20. PageRank (II): Mathematics

    African Journals Online (AJOL)

    maths/stats

    INTRODUCTION. PageRank is Google's system for ranking web pages. A page with a higher PageRank is deemed more important and is more likely to be listed above a ... Felix U. Ogban, Department of Mathematics/Statistics and Computer Science, Faculty of Science, University of ..... probability, 2004, 41, (3): 721-734.

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

  2. Sequential rank agreement methods for comparison of ranked lists

    DEFF Research Database (Denmark)

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

    2015-01-01

    The comparison of alternative rankings of a set of items is a general and prominent task in applied statistics. Predictor variables are ranked according to magnitude of association with an outcome, prediction models rank subjects according to the personalized risk of an event, and genetic studies...... are illustrated using gene rankings, and using data from two Danish ovarian cancer studies where we assess the within and between agreement of different statistical classification methods.......The comparison of alternative rankings of a set of items is a general and prominent task in applied statistics. Predictor variables are ranked according to magnitude of association with an outcome, prediction models rank subjects according to the personalized risk of an event, and genetic studies...

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

    Directory of Open Access Journals (Sweden)

    Firinguetti Limone, Luis

    2015-06-01

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

  4. Text Mining.

    Science.gov (United States)

    Trybula, Walter J.

    1999-01-01

    Reviews the state of research in text mining, focusing on newer developments. The intent is to describe the disparate investigations currently included under the term text mining and provide a cohesive structure for these efforts. A summary of research identifies key organizations responsible for pushing the development of text mining. A section…

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

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

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

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

  9. Biomechanics Scholar Citations across Academic Ranks

    Directory of Open Access Journals (Sweden)

    Knudson Duane

    2015-11-01

    Full Text Available Study aim: citations to the publications of a scholar have been used as a measure of the quality or influence of their research record. A world-wide descriptive study of the citations to the publications of biomechanics scholars of various academic ranks was conducted.

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

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

  12. Ranking schools on external knowledge tests results

    Directory of Open Access Journals (Sweden)

    Gašper Cankar

    2007-01-01

    Full Text Available The paper discusses the use of external knowledge test results for school ranking and the implicit effect of such ranking. A question of validity is raised and a review of research literature and main known problems are presented. In many western countries publication of school results is a common practice and a similar trend can be observed in Slovenia. Experiences of other countries help to predict positive and negative aspects of such publication. Results of external knowledge tests produce very limited information about school quality—if we use other sources of information our ranking of schools can be very different. Nevertheless, external knowledge tests can yield useful information. If we want to improve quality in schools, we must allow schools to use this information themselves and improve from within. Broad public scrutiny is unnecessary and problematic—it moves the focus of school efforts from real improvement of quality to mere improvement of the school public image.

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

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

  15. University Rankings in Critical Perspective

    Science.gov (United States)

    Pusser, Brian; Marginson, Simon

    2013-01-01

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

  16. University Ranking as Social Exclusion

    Science.gov (United States)

    Amsler, Sarah S.; Bolsmann, Chris

    2012-01-01

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

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

  18. Compressive beamforming

    DEFF Research Database (Denmark)

    Xenaki, Angeliki; Mosegaard, Klaus

    2014-01-01

    Sound source localization with sensor arrays involves the estimation of the direction-of-arrival (DOA) from a limited number of observations. Compressive sensing (CS) solves such underdetermined problems achieving sparsity, thus improved resolution, and can be solved efficiently with convex...

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

    Directory of Open Access Journals (Sweden)

    Xiaodi Liu

    2016-12-01

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

  20. RANK/RANK-L/OPG in Patients with Bone Metastases Treated with Anticancer Agents and Zoledronic Acid: A Prospective Study

    Directory of Open Access Journals (Sweden)

    Laura Mercatali

    2013-05-01

    Full Text Available Patients with solid cancer frequently develop bone metastases (BM. Zoledronic acid (Zometa®, ZA, routinely used to treat patients with BM, acts on osteoclasts and also has antitumor properties. We aimed to assess the effect of ZA over time in novel bone turnover markers (RANK/receptor activator of nuclear factor-k B ligand (RANK-L/ Osteoprotegerin (OPG and to correlate these with serum N-terminal telopeptide (NTX. The study prospectively evaluated levels of RANK, RANK-L and OPG transcripts by real-time PCR and NTX expression by ELISA in the peripheral blood of 49 consecutive patients with advanced breast, lung or prostate cancer. All patients received the standard ZA schedule and were monitored for 12 months. Median baseline values of RANK, RANK-L and OPG were 78.28 (range 7.34–620.64, 319.06 (21.42–1884.41 and 1.52 (0.10–58.02, respectively. At 12 months, the median RANK-L value had decreased by 22% with respect to the baseline, whereas median OPG levels had increased by about 96%. Consequently, the RANK-L/OPG ratio decreased by 56% from the baseline. Median serum NTX levels decreased over the 12-month period, reaching statistical significance (p < 0.0001. Our results would seem to indicate that ZA modulates RANK, RANK-L and OPG expression, thus decreasing osteoclast activity.

  1. Reference Information Based Remote Sensing Image Reconstruction with Generalized Nonconvex Low-Rank Approximation

    Directory of Open Access Journals (Sweden)

    Hongyang Lu

    2016-06-01

    Full Text Available Because of the contradiction between the spatial and temporal resolution of remote sensing images (RSI and quality loss in the process of acquisition, it is of great significance to reconstruct RSI in remote sensing applications. Recent studies have demonstrated that reference image-based reconstruction methods have great potential for higher reconstruction performance, while lacking accuracy and quality of reconstruction. For this application, a new compressed sensing objective function incorporating a reference image as prior information is developed. We resort to the reference prior information inherent in interior and exterior data simultaneously to build a new generalized nonconvex low-rank approximation framework for RSI reconstruction. Specifically, the innovation of this paper consists of the following three respects: (1 we propose a nonconvex low-rank approximation for reconstructing RSI; (2 we inject reference prior information to overcome over smoothed edges and texture detail losses; (3 on this basis, we combine conjugate gradient algorithms and a single-value threshold (SVT simultaneously to solve the proposed algorithm. The performance of the algorithm is evaluated both qualitatively and quantitatively. Experimental results demonstrate that the proposed algorithm improves several dBs in terms of peak signal to noise ratio (PSNR and preserves image details significantly compared to most of the current approaches without reference images as priors. In addition, the generalized nonconvex low-rank approximation of our approach is naturally robust to noise, and therefore, the proposed algorithm can handle low resolution with noisy inputs in a more unified framework.

  2. Pulling Rank: Military Rank Affects Hormone Levels and Fairness in an Allocation Experiment

    Directory of Open Access Journals (Sweden)

    Benjamin Siart

    2016-11-01

    Full Text Available Status within social hierarchies has great effects on the lives of socially organized mammals. Its effects on human behavior and related physiology however is relatively little studied. The present study investigated the impact of military rank on fairness and behavior in relation to salivary cortisol (C and testosterone (T levels in male soldiers. For this purpose 180 members of the Austrian Armed Forces belonging to two distinct rank groups participated in two variations of a computer-based guard duty allocation experiment. The rank groups were 1 warrant officers (High Rank, HR and 2 enlisted men (Low Rank, LR. One soldier from each rank group participated in every experiment. At the beginning of the experiment, one participant was assigned to start standing guard and the other participant at rest. The participant who started at rest could choose if and when to relieve his fellow soldier and therefore had control over the experiment. In order to trigger perception of unfair behavior, an additional experiment was conducted which was manipulated by the experimenter. In the manipulated version both soldiers started in the standing guard position and were never relieved, believing that their opponent was at rest, not relieving them. Our aim was to test whether unfair behavior causes a physiological reaction. Saliva samples for hormone analysis were collected at regular intervals throughout the experiment.We found that in the un-manipulated setup high-ranking soldiers spent less time standing guard than lower ranking individuals. Rank was a significant predictor for C but not for T levels during the experiment. C levels in the HR group were higher than in LR group. C levels were also elevated in the manipulated experiment compared to the un-manipulated experiment, especially in LR. We assume that the elevated C levels in HR were caused by HR feeling their status challenged by the situation of having to negotiate with an individual of lower military

  3. Universal scaling in sports ranking

    Science.gov (United States)

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

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

  4. Universal scaling in sports ranking

    CERN Document Server

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

    2011-01-01

    Ranking is a ubiquitous phenomenon in the human society. By clicking the web pages of Forbes, you may find all kinds of rankings, such as world's most powerful people, world's richest people, top-paid tennis stars, and so on and so forth. Herewith, we study a specific kind, sports ranking systems in which players' scores and prize money are calculated based on their performances in attending various tournaments. A typical example is tennis. It is found that the distributions of both scores and prize money follow universal power laws, with exponents nearly identical for most sports fields. In order to understand the origin of this universal scaling we focus on the tennis ranking systems. By checking the data we find that, for any pair of players, the probability that the higher-ranked player will top the lower-ranked opponent is proportional to the rank difference between the pair. Such a dependence can be well fitted to a sigmoidal function. By using this feature, we propose a simple toy model which can simul...

  5. Graph Compression by BFS

    Directory of Open Access Journals (Sweden)

    Alberto Apostolico

    2009-08-01

    Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.

  6. PageRank of integers

    Science.gov (United States)

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

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

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

    Directory of Open Access Journals (Sweden)

    Tatsioni Athina

    2007-10-01

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

  8. Astronomical context coder for image compression

    Science.gov (United States)

    Pata, Petr; Schindler, Jaromir

    2015-10-01

    Recent lossless still image compression formats are powerful tools for compression of all kind of common images (pictures, text, schemes, etc.). Generally, the performance of a compression algorithm depends on its ability to anticipate the image function of the processed image. In other words, a compression algorithm to be successful, it has to take perfectly the advantage of coded image properties. Astronomical data form a special class of images and they have, among general image properties, also some specific characteristics which are unique. If a new coder is able to correctly use the knowledge of these special properties it should lead to its superior performance on this specific class of images at least in terms of the compression ratio. In this work, the novel lossless astronomical image data compression method will be presented. The achievable compression ratio of this new coder will be compared to theoretical lossless compression limit and also to the recent compression standards of the astronomy and general multimedia.

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

  10. Clustered Low-Rank Tensor Format: Introduction and Application to Fast Construction of Hartree-Fock Exchange.

    Science.gov (United States)

    Lewis, Cannada A; Calvin, Justus A; Valeev, Edward F

    2016-12-13

    We describe the clustered low-rank (CLR) framework for block-sparse and block-low-rank tensor representation and computation. The CLR framework exploits the tensor structure revealed by basis clustering; computational savings arise from low-rank compression of tensor blocks and performing block arithmetic in the low-rank form whenever beneficial. The precision is rigorously controlled by two parameters, avoiding ad-hoc heuristics, such as domains: one controls the CLR block rank truncation, and the other controls screening of small contributions in arithmetic operations on CLR tensors to propagate sparsity through expressions. As these parameters approach zero, the CLR representation and arithmetic become exact. As a pilot application, we considered the use of the CLR format for the order-2 and order-3 tensors in the context of the density fitting (DF) evaluation of the Hartree-Fock (exact) exchange (DF-K). Even for small systems and realistic basis sets, CLR-DF-K becomes more efficient than the standard DF-K approach, and it has significantly reduced asymptotic storage and computational complexities relative to the standard [Formula: see text] and [Formula: see text] DF-K figures. CLR-DF-K is also significantly more efficient-all while negligibly affecting molecular energies and properties-than the conventional (non-DF) [Formula: see text] exchange algorithm for applications to medium-sized systems (on the order of 100 atoms) with diffuse Gaussian basis sets, a necessity for applications to negatively charged species, molecular properties, and high-accuracy correlated wave functions.

  11. Automatic Text Summarization for Indonesian Language Using TextTeaser

    Science.gov (United States)

    Gunawan, D.; Pasaribu, A.; Rahmat, R. F.; Budiarto, R.

    2017-04-01

    Text summarization is one of the solution for information overload. Reducing text without losing the meaning not only can save time to read, but also maintain the reader’s understanding. One of many algorithms to summarize text is TextTeaser. Originally, this algorithm is intended to be used for text in English. However, due to TextTeaser algorithm does not consider the meaning of the text, we implement this algorithm for text in Indonesian language. This algorithm calculates four elements, such as title feature, sentence length, sentence position and keyword frequency. We utilize TextRank, an unsupervised and language independent text summarization algorithm, to evaluate the summarized text yielded by TextTeaser. The result shows that the TextTeaser algorithm needs more improvement to obtain better accuracy.

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

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

    CERN Document Server

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

    2014-01-01

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

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

  15. University Ranking Systems; Criteria and Critiques

    OpenAIRE

    Saka, Yavuz; YAMAN, Süleyman

    2011-01-01

    The purpose of this paper is to explore international university ranking systems. As a compilation study this paper provides specific criteria that each ranking system uses and main critiques regarding these ranking systems. Since there are many ranking systems in this area of research, this study focused on only most cited and referred ranking systems. As there is no consensus in terms of the criteria that these systems use, this paper has no intention of identifying the best ranking system ...

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

    Directory of Open Access Journals (Sweden)

    Aimee M. Rolston

    2015-11-01

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

  17. Backpropagation Neural Network Implementation for Medical Image Compression

    Directory of Open Access Journals (Sweden)

    Kamil Dimililer

    2013-01-01

    Full Text Available Medical images require compression, before transmission or storage, due to constrained bandwidth and storage capacity. An ideal image compression system must yield high-quality compressed image with high compression ratio. In this paper, Haar wavelet transform and discrete cosine transform are considered and a neural network is trained to relate the X-ray image contents to their ideal compression method and their optimum compression ratio.

  18. Ciudad: Identidad y rankings

    Directory of Open Access Journals (Sweden)

    ELÍAS MAS SERRA

    2009-12-01

    Full Text Available A La ciudad, o a la forma de hacerla, se le han otorgado a lo largo de la historia diversos adjetivos, más o menos justificados. Hoy se habla de la ciudad del conocimiento y la innovación como factores determinantes de la evolución de la urbe. Ya se ha reconocido que muchas de estas expresiones no se quedan más que en metáforas. Pero es importante profundizar en el valor añadido que aporta una conceptuación de este tipo en el ámbito de la gestión económica y de la obtención de plusvalías. También importa reconocer que el hecho de la ciudad es algo independiente y que la mejor valoración de una ciudad, en un amplio contexto, reside en los valores que le aporta su identidad; por ello, el conocimiento o la innovación supuestos no deben pasar por la mediatización, vía globalización, o el olvido de la realidad histórica constituida y construida.For cities, and forms of constructingthem through history, diverse adjectives, some more and some less justified, have been provided. Nowadays, much is made of the city of knowledge and of innovation in the evolution of urban forms. It is recognised that many of these expressions remain metaphorical, but it is important to establish the added value generated by a conceptualization of this kind in the field of economic management and the generation of capital gains. Also important is the recognition that the city is something independent and that an improved valuation of a city, in a broad sense, is based on the values provided by its identity; as such, supposed knowledge or innovation should not be overly managed through the media, via globalization, or through forgetting its constituted and constructed historical reality.

  19. Rankings Scientists, Journals and Countries using h-Index

    Directory of Open Access Journals (Sweden)

    Gyula Mester

    2016-01-01

    Full Text Available Indexes in scientometrics are based on citations. However, in contrast to the journal impact factor, which gives only the ranking of the scientific journals, ordered by impact factor, indexes in scientometrics are suitable for ranking of scientists, scientific journals and countries. In this paper the h-index, h5-index, the World ranking the top of 25 Highly Cited Researchers (h > 100 and the ranking of 25 scientists in Hungarian Institutions according to their Google Scholar Citations public profiles are considered. These indexes (h5-index are applied for making of the list of top 20 publications (journals and proceedings in the field of Robotics. The World ranking is done of the best 50 countries according to h-index in year 2014. Data are obtained from the portal Scimago.

  20. Rank Protein Immunolabeling during Bone-Implant Interface Healing Process

    Directory of Open Access Journals (Sweden)

    Francisley Ávila Souza

    2010-01-01

    Full Text Available The purpose of this paper was to evaluate the expression of RANK protein during bone-healing process around machined surface implants. Twenty male Wistar rats, 90 days old, after having had a 2 mm diameter and 6 mm long implant inserted in their right tibias, were evaluated at 7, 14, 21, and 42 days after healing. After obtaining the histological samples, slides were subjected to RANK immunostaining reaction. Results were quantitatively evaluated. Results. Immunolabeling analysis showed expressions of RANK in osteoclast and osteoblast lineage cells. The statistical analysis showed an increase in the expression of RANK in osteoblasts at 7 postoperative days and a gradual decrease during the chronology of the healing process demonstrated by mild cellular activity in the final stage (P<.05. Conclusion. RANK immunolabeling was observed especially in osteoclast and osteoblast cells in primary bone during the initial periods of bone-healing/implant interface.

  1. Regression Estimator Using Double Ranked Set Sampling

    Directory of Open Access Journals (Sweden)

    Hani M. Samawi

    2002-06-01

    Full Text Available The performance of a regression estimator based on the double ranked set sample (DRSS scheme, introduced by Al-Saleh and Al-Kadiri (2000, is investigated when the mean of the auxiliary variable X is unknown. Our primary analysis and simulation indicates that using the DRSS regression estimator for estimating the population mean substantially increases relative efficiency compared to using regression estimator based on simple random sampling (SRS or ranked set sampling (RSS (Yu and Lam, 1997 regression estimator.  Moreover, the regression estimator using DRSS is also more efficient than the naïve estimators of the population mean using SRS, RSS (when the correlation coefficient is at least 0.4 and DRSS for high correlation coefficient (at least 0.91. The theory is illustrated using a real data set of trees.

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

  3. Ranking species in mutualistic networks.

    Science.gov (United States)

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

    2015-02-02

    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.

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

  5. Rank distributions: Frequency vs. magnitude.

    Science.gov (United States)

    Velarde, Carlos; Robledo, Alberto

    2017-01-01

    We examine the relationship between two different types of ranked data, frequencies and magnitudes. We consider data that can be sorted out either way, through numbers of occurrences or size of the measures, as it is the case, say, of moon craters, earthquakes, billionaires, etc. We indicate that these two types of distributions are functional inverses of each other, and specify this link, first in terms of the assumed parent probability distribution that generates the data samples, and then in terms of an analog (deterministic) nonlinear iterated map that reproduces them. For the particular case of hyperbolic decay with rank the distributions are identical, that is, the classical Zipf plot, a pure power law. But their difference is largest when one displays logarithmic decay and its counterpart shows the inverse exponential decay, as it is the case of Benford law, or viceversa. For all intermediate decay rates generic differences appear not only between the power-law exponents for the midway rank decline but also for small and large rank. We extend the theoretical framework to include thermodynamic and statistical-mechanical concepts, such as entropies and configuration.

  6. Rankings Methodology Hurts Public Institutions

    Science.gov (United States)

    Van Der Werf, Martin

    2007-01-01

    In the 1980s, when the "U.S. News & World Report" rankings of colleges were based solely on reputation, the nation's public universities were well represented at the top. However, as soon as the magazine began including its "measures of excellence," statistics intended to define quality, public universities nearly disappeared from the top. As the…

  7. Let Us Rank Journalism Programs

    Science.gov (United States)

    Weber, Joseph

    2014-01-01

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

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

  9. The Globalization of College and University Rankings

    Science.gov (United States)

    Altbach, Philip G.

    2012-01-01

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

  10. Ranking agility factors affecting hospitals in Iran

    Directory of Open Access Journals (Sweden)

    M. Abdi Talarposht

    2017-04-01

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

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

  12. Compression limits in cascaded quadratic soliton compression

    DEFF Research Database (Denmark)

    Bache, Morten; Bang, Ole; Krolikowski, Wieslaw

    2008-01-01

    Cascaded quadratic soliton compressors generate under optimal conditions few-cycle pulses. Using theory and numerical simulations in a nonlinear crystal suitable for high-energy pulse compression, we address the limits to the compression quality and efficiency.......Cascaded quadratic soliton compressors generate under optimal conditions few-cycle pulses. Using theory and numerical simulations in a nonlinear crystal suitable for high-energy pulse compression, we address the limits to the compression quality and efficiency....

  13. Measuring the compression of mortality

    Directory of Open Access Journals (Sweden)

    2000-09-01

    Full Text Available Compression of mortality is measured here in four ways: (1 by standard deviation of the age at death above the mode; (2 by standard deviation of the age at death in the highest quartile; (3 by the inter-quartile range; and (4 by the shortest age interval in which a given proportion of deaths take place. The two first-mentioned are directed at old ages while the other two measure compression over the entire age range. The fourth alternative is recommended as the most suitable for general use and offers several variations, called the C-family of compression indicators. Applied to historical and modern populations, all four measures show convincingly that the secular transition from high to low mortality has been accompanied by general and massive compression of mortality. In recent decades, however, this development has come close to stagnation even when life expectancy continues to increase. This has happened at a level where compression is still so incomplete that the shortest age interval in which 90 percent of deaths occur, is more than 35 years. It seems unrealistic to expect human mortality ever to be compressed into so narrow an age interval that the survival curve would be even approximately rectangular. It is considered useful to monitor changes in the compression of mortality because the indicators describe relevant aspects of the length of life and may acquire new significance as indicators of population heterogeneity.

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

  15. Tecer sobe no ranking da Capes

    Directory of Open Access Journals (Sweden)

    José Aparecido

    2013-11-01

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

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

  17. A document clustering and ranking system for exploring MEDLINE citations.

    Science.gov (United States)

    Lin, Yongjing; Li, Wenyuan; Chen, Keke; Liu, Ying

    2007-01-01

    A major problem faced in biomedical informatics involves how best to present information retrieval results. When a single query retrieves many results, simply showing them as a long list often provides poor overview. With a goal of presenting users with reduced sets of relevant citations, this study developed an approach that retrieved and organized MEDLINE citations into different topical groups and prioritized important citations in each group. A text mining system framework for automatic document clustering and ranking organized MEDLINE citations following simple PubMed queries. The system grouped the retrieved citations, ranked the citations in each cluster, and generated a set of keywords and MeSH terms to describe the common theme of each cluster. Several possible ranking functions were compared, including citation count per year (CCPY), citation count (CC), and journal impact factor (JIF). We evaluated this framework by identifying as "important" those articles selected by the Surgical Oncology Society. Our results showed that CCPY outperforms CC and JIF, i.e., CCPY better ranked important articles than did the others. Furthermore, our text clustering and knowledge extraction strategy grouped the retrieval results into informative clusters as revealed by the keywords and MeSH terms extracted from the documents in each cluster. The text mining system studied effectively integrated text clustering, text summarization, and text ranking and organized MEDLINE retrieval results into different topical groups.

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

  19. Efficient Lossy Compression for Compressive Sensing Acquisition of Images in Compressive Sensing Imaging Systems

    Directory of Open Access Journals (Sweden)

    Xiangwei Li

    2014-12-01

    Full Text Available Compressive Sensing Imaging (CSI is a new framework for image acquisition, which enables the simultaneous acquisition and compression of a scene. Since the characteristics of Compressive Sensing (CS acquisition are very different from traditional image acquisition, the general image compression solution may not work well. In this paper, we propose an efficient lossy compression solution for CS acquisition of images by considering the distinctive features of the CSI. First, we design an adaptive compressive sensing acquisition method for images according to the sampling rate, which could achieve better CS reconstruction quality for the acquired image. Second, we develop a universal quantization for the obtained CS measurements from CS acquisition without knowing any a priori information about the captured image. Finally, we apply these two methods in the CSI system for efficient lossy compression of CS acquisition. Simulation results demonstrate that the proposed solution improves the rate-distortion performance by 0.4~2 dB comparing with current state-of-the-art, while maintaining a low computational complexity.

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

  1. The system of world golf ranking among amateur players - WAGR

    Directory of Open Access Journals (Sweden)

    Tereshchuk M.V.

    2014-11-01

    Full Text Available Purpose: justify the particular rating-WAGR and determine its value. Material: More than 40 references, including analysis of 8 protocols of Ukraine competition in golf. Results: The features and significance of the world rankings in golf among amateur players. Displaying ranking tournaments in accordance with the system of WAGR and justified the use of the conversion of the results to determine the specific places the player in the rankings. In Ukraine, held six WAGR-Tournament, the first tournament was held in 2011. Today in the world ranking of amateur players is one player from the Ukraine. Conclusions: It was found that the top-WAGR determines the level of development of the national golf federations and influence in the international arena. For the selection of athletes for the summer Youth Olympic Games is used world-rated golf amateur players (WAGR among boys and girls.

  2. The THES University Rankings: Are They Really World Class?

    Directory of Open Access Journals (Sweden)

    Richard Holmes

    2006-06-01

    Full Text Available The Times Higher Education Supplement (THES international ranking of universities, published in 2004 and 2005, has received a great deal of attention throughout the world, nowhere more so than in East and Southeast Asia. This paper looks at the rankings and concludes that they are deficient in several respects. The sampling procedure is not explained and is very probably seriously biased, the weighting of the various components is not justified, inappropriate measures of teaching quality are used, the assessment of research achievement is biased against the humanities and social sciences, the classification of institutions is inconsistent, there are striking and implausible changes in the rankings between 2004 and 2005 and they are based in one crucial respect on regional rather than international comparisons. It is recommended that these rankings should not be the basis for the development and assessment of national and institutional policies

  3. RUSSIAN UNIVERSITIES IN THE LOOP OF THE WORLD EDUCATION RANKINGS

    Directory of Open Access Journals (Sweden)

    Inozemtseva Ekaterina Sergeevna

    2013-02-01

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

  4. RUSSIAN UNIVERSITIES IN THE LOOP OF THE WORLD EDUCATION RANKINGS

    Directory of Open Access Journals (Sweden)

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

    2013-04-01

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

  5. Toward optimal feature selection using ranking methods and classification algorithms

    Directory of Open Access Journals (Sweden)

    Novaković Jasmina

    2011-01-01

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

  6. Ranking industries using a hybrid of DEA-TOPSIS

    Directory of Open Access Journals (Sweden)

    Amir Mehdiabadi

    2013-10-01

    Full Text Available Ranking industry normally helps find hot sectors and attract potential investors to invest in appropriate plans. Ranking various industries is also a multiple criteria decision making problem. In this paper, we present an empirical investigation to rank different industries using the art of data envelopment analysis (DEA. The inputs of our proposed DEA model include capital, employment and importance coefficient and outputs are exports, ecological effects and added value. In addition, exports, value added and environmental investment are used as outputs of DEA method. Since the results of DEA may consider more than one efficient unit, so we implement Technique for Order Preference by Similarity to Ideal Solution (TOPSIS technique to rank efficient units. In our case study, there were 15 different sectors from various industries and the implementation of DEA technique recommends 8 efficient units. The implementation of TOPSIS among these efficient units has suggested that Chemical industry could be considered as the most attracting industry for investment.

  7. A Comparison of Chest Compression Quality Delivered During On-Scene and Ground Transport Cardiopulmonary Resuscitation

    Directory of Open Access Journals (Sweden)

    Christopher S. Russi

    2016-09-01

    Full Text Available Introduction: American Heart Association (AHA guidelines recommend cardiopulmonary resuscitation (CPR chest compressions 1.5 to 2 inches (3.75-5 cm deep at 100 to 120 per minute. Recent studies demonstrated that manual CPR by emergency medical services (EMS personnel is substandard. We hypothesized that transport CPR quality is significantly worse than on-scene CPR quality. Methods: We analyzed adult patients receiving on-scene and transport chest compressions from nine EMS sites across Minnesota and Wisconsin from May 2008 to July 2010. Two periods were analyzed: before and after visual feedback. CPR data were collected and exported with the Zoll M series monitor and a sternally placed accelerometer measuring chest compression rate and depth. We compared compression data with 2010 AHA guidelines and Zoll RescueNet Code Review software. CPR depth and rate were “above (deep,” “in,” or “below (shallow” the target range according to AHA guidelines. We paired on-scene and transport data for each patient; paired proportions were compared with the nonparametric Wilcoxon signed rank test. Results: In the pre-feedback period, we analyzed 105 of 140 paired cases (75.0%; in the post-feedback period, 35 of 140 paired cases (25.0% were analyzed. The proportion of correct depths during on-scene compressions (median, 41.9%; interquartile range [IQR], 16.1-73.1 was higher compared to the paired transport proportion (median, 8.7%; IQR, 2.7-48.9. Proportions of on-scene median correct rates and transport median correct depths did not improve in the post-feedback period. Conclusion: Transport chest compressions are significantly worse than on-scene compressions. Implementation of visual real-time feedback did not affect performance.

  8. Compressing DNA sequence databases with coil

    Directory of Open Access Journals (Sweden)

    Hendy Michael D

    2008-05-01

    Full Text Available Abstract Background Publicly available DNA sequence databases such as GenBank are large, and are growing at an exponential rate. The sheer volume of data being dealt with presents serious storage and data communications problems. Currently, sequence data is usually kept in large "flat files," which are then compressed using standard Lempel-Ziv (gzip compression – an approach which rarely achieves good compression ratios. While much research has been done on compressing individual DNA sequences, surprisingly little has focused on the compression of entire databases of such sequences. In this study we introduce the sequence database compression software coil. Results We have designed and implemented a portable software package, coil, for compressing and decompressing DNA sequence databases based on the idea of edit-tree coding. coil is geared towards achieving high compression ratios at the expense of execution time and memory usage during compression – the compression time represents a "one-off investment" whose cost is quickly amortised if the resulting compressed file is transmitted many times. Decompression requires little memory and is extremely fast. We demonstrate a 5% improvement in compression ratio over state-of-the-art general-purpose compression tools for a large GenBank database file containing Expressed Sequence Tag (EST data. Finally, coil can efficiently encode incremental additions to a sequence database. Conclusion coil presents a compelling alternative to conventional compression of flat files for the storage and distribution of DNA sequence databases having a narrow distribution of sequence lengths, such as EST data. Increasing compression levels for databases having a wide distribution of sequence lengths is a direction for future work.

  9. Effect of compression ratio on perception of time compressed phonemically balanced words in Kannada and monosyllables

    Directory of Open Access Journals (Sweden)

    Prashanth Prabhu

    2015-03-01

    Full Text Available The present study attempted to study perception of time-compressed speech and the effect of compression ratio for phonemically balanced (PB word lists in Kannada and monosyllables. The test was administered on 30 normal hearing individuals at compression ratios of 40%, 50%, 60%, 70% and 80% for PB words in Kannada and monosyllables. The results of the study showed that the speech identification scores for time-compressed speech reduced with increase in compression ratio. The scores were better for monosyllables compared to PB words especially at higher compression ratios. The study provides speech identification scores at different compression ratio for PB words and monosyllables in individuals with normal hearing. The results of the study also showed that the scores did not vary across gender for all the compression ratios for both the stimuli. The same test material needs to be compared the clinical population with central auditory processing disorder for clinical validation of the present results.

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

  11. Methodology, Meaning and Usefulness of Rankings

    Science.gov (United States)

    Williams, Ross

    2008-01-01

    University rankings are having a profound effect on both higher education systems and individual universities. In this paper we outline these effects, discuss the desirable characteristics of a good ranking methodology and document existing practice, with an emphasis on the two main international rankings (Shanghai Jiao Tong and THES-QS). We take…

  12. Tool for Ranking Research Options

    Science.gov (United States)

    Ortiz, James N.; Scott, Kelly; Smith, Harold

    2005-01-01

    Tool for Research Enhancement Decision Support (TREDS) is a computer program developed to assist managers in ranking options for research aboard the International Space Station (ISS). It could likely also be adapted to perform similar decision-support functions in industrial and academic settings. TREDS provides a ranking of the options, based on a quantifiable assessment of all the relevant programmatic decision factors of benefit, cost, and risk. The computation of the benefit for each option is based on a figure of merit (FOM) for ISS research capacity that incorporates both quantitative and qualitative inputs. Qualitative inputs are gathered and partly quantified by use of the time-tested analytical hierarchical process and used to set weighting factors in the FOM corresponding to priorities determined by the cognizant decision maker(s). Then by use of algorithms developed specifically for this application, TREDS adjusts the projected benefit for each option on the basis of levels of technical implementation, cost, and schedule risk. Based partly on Excel spreadsheets, TREDS provides screens for entering cost, benefit, and risk information. Drop-down boxes are provided for entry of qualitative information. TREDS produces graphical output in multiple formats that can be tailored by users.

  13. Issue Management Risk Ranking Systems

    Energy Technology Data Exchange (ETDEWEB)

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

    1999-06-01

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

  14. Inconsistent year-to-year fluctuations limit the conclusiveness of global higher education rankings for university management

    Directory of Open Access Journals (Sweden)

    Johannes Sorz

    2015-08-01

    Full Text Available Backround. University rankings are getting very high international media attention, this holds particularly true for the Times Higher Education Ranking (THE and the Shanghai Jiao Tong University’s Academic Ranking of World Universities Ranking (ARWU. We therefore aimed to investigate how reliable the rankings are, especially for universities with lower ranking positions, that often show inconclusive year-to-year fluctuations in their rank, and if these rankings are thus a suitable basis for management purposes.Methods. We used the public available data from the web pages of the THE and the ARWU ranking to analyze the dynamics of change in score and ranking position from year to year, and we investigated possible causes for inconsistent fluctuations in the rankings by the means of regression analyses.Results. Regression analyses of results from the THE and ARWU from 2010–2014 show inconsistent fluctuations in the rank and score for universities with lower rank positions (below position 50 which lead to inconsistent “up and downs” in the total results, especially in the THE and to a lesser extent also in the ARWU. In both rankings, the mean year-to-year fluctuation of universities in groups of 50 universities aggregated by descending rank increases from less than 10% in the group of the 50 highest ranked universities to up to 60% in the group of the lowest ranked universities. Furthermore, year-to-year results do not correspond in THES- and ARWU-Rankings for universities below rank 50.Discussion. We conclude that the observed fluctuations in the THE do not correspond to actual university performance and ranking results are thus of limited conclusiveness for the university management of universities below a rank of 50. While the ARWU rankings seems more robust against inconsistent fluctuations, its year to year changes in the scores are very small, so essential changes from year to year could not be expected. Furthermore, year

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

  16. A Review of Ranking Models in Data Envelopment Analysis

    Directory of Open Access Journals (Sweden)

    F. Hosseinzadeh Lotfi

    2013-01-01

    Full Text Available In the course of improving various abilities of data envelopment analysis (DEA models, many investigations have been carried out for ranking decision-making units (DMUs. This is an important issue both in theory and practice. There exist a variety of papers which apply different ranking methods to a real data set. Here the ranking methods are divided into seven groups. As each of the existing methods can be viewed from different aspects, it is possible that somewhat these groups have an overlapping with the others. The first group conducts the evaluation by a cross-efficiency matrix where the units are self- and peer-evaluated. In the second one, the ranking units are based on the optimal weights obtained from multiplier model of DEA technique. In the third group, super-efficiency methods are dealt with which are based on the idea of excluding the unit under evaluation and analyzing the changes of frontier. The fourth group involves methods based on benchmarking, which adopts the idea of being a useful target for the inefficient units. The fourth group uses the multivariate statistical techniques, usually applied after conducting the DEA classification. The fifth research area ranks inefficient units through proportional measures of inefficiency. The sixth approach involves multiple-criteria decision methodologies with the DEA technique. In the last group, some different methods of ranking units are mentioned.

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

  18. UNIVERSITY RANKING IMPROVING TOOLS IN MODERN INFORMATION EDUCATIONAL ENVIRONMENT

    Directory of Open Access Journals (Sweden)

    M. Bilous

    2015-03-01

    Full Text Available Ranking criteria of national and international levels are the instruments of university ranking increasing. Ratings provide a balanced measure of quality in higher educational institutions. Determining the level of university research influences the position of the university in various rankings. We can separate the main aggregates that are considered when ranking international higher education institutions. The results of university ranking allows the identification of its strengths and weaknesses in order to develop strategies for success and excellence based on the achievements of other universities at the regional, national and international levels. In article, we can see strengths, weaknesses, opportunities, and threats of Kherson State University (SWOT-analysis. The main goals of Kherson State University are self-promotion in the media space, raising the prestige of KSU and integration with the world science community, development of an effective technological corridor: «School - University – Labor» market, increasing the number of students, improving the ranking of academic staff in scientometric databases, and gaining international recognition.

  19. Rank hypocrisies the insult of the REF

    CERN Document Server

    Sayer, Derek

    2015-01-01

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

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

  1. The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices.

    Science.gov (United States)

    Wang, Dafei; Zhang, Xumei

    2017-01-01

    The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for [Formula: see text] ([Formula: see text] is an eigenvalue of a matrix) by using the partitioned matrices. By using this estimation and inequality theory, the new and more accurate estimations for the lower bounds for the rank are deduced. Furthermore, based on the estimation for the rank, some sufficient conditions for nonsingular matrices are obtained.

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

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

  4. Tree patterns with full text search

    NARCIS (Netherlands)

    Peetz, M.H.; Marx, M.

    2010-01-01

    Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an answer. But this requirement may lead to undesirable behavior of XML retrieval systems: two queries which are

  5. Complete hazard ranking to analyze right-censored data: An ALS survival study.

    Directory of Open Access Journals (Sweden)

    Zhengnan Huang

    2017-12-01

    Full Text Available Survival analysis represents an important outcome measure in clinical research and clinical trials; further, survival ranking may offer additional advantages in clinical trials. In this study, we developed GuanRank, a non-parametric ranking-based technique to transform patients' survival data into a linear space of hazard ranks. The transformation enables the utilization of machine learning base-learners including Gaussian process regression, Lasso, and random forest on survival data. The method was submitted to the DREAM Amyotrophic Lateral Sclerosis (ALS Stratification Challenge. Ranked first place, the model gave more accurate ranking predictions on the PRO-ACT ALS dataset in comparison to Cox proportional hazard model. By utilizing right-censored data in its training process, the method demonstrated its state-of-the-art predictive power in ALS survival ranking. Its feature selection identified multiple important factors, some of which conflicts with previous studies.

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

    Directory of Open Access Journals (Sweden)

    Yuling Tian

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

  7. A Compressive Superresolution Display

    KAUST Repository

    Heide, Felix

    2014-06-22

    In this paper, we introduce a new compressive display architecture for superresolution image presentation that exploits co-design of the optical device configuration and compressive computation. Our display allows for superresolution, HDR, or glasses-free 3D presentation.

  8. Space-Efficient Re-Pair Compression

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Prezza, Nicola

    2017-01-01

    Re-Pair [5] is an effective grammar-based compression scheme achieving strong compression rates in practice. Let n, σ, and d be the text length, alphabet size, and dictionary size of the final grammar, respectively. In their original paper, the authors show how to compute the Re-Pair grammar...

  9. Incremental data compression -extended abstract-

    NARCIS (Netherlands)

    Jeuring, J.T.

    1992-01-01

    Data may be compressed using textual substitution. Textual substitution identifies repeated substrings and replaces some or all substrings by pointers to another copy. We construct an incremental algorithm for a specific textual substitution method: coding a text with respect to a dictionary. With

  10. Ranking different factors influencing flight delay

    Directory of Open Access Journals (Sweden)

    Meysam Kazemi Asfe

    2014-07-01

    Full Text Available Flight interruption is one of the most important issues in today’s airline industry. Every year, most airlines spend significant amount of money to compensate flight delays. Therefore, it is important to detect important factors influencing on flight delays. This paper presents an empirical investigation to determine important factors on this issue. The study also asks some decision makers to make pairwise comparison and ranks various factors using the art of analytical hierarchy process. The study determines that technical defects and delayed entry were among the most important factors to blame for flight delays. In addition, announcing the postponement, replacement aircraft and path replacement are among the most important decisions facing managers in the aviation industry during the disruption of the flight.

  11. Compressing Binary Decision Diagrams

    DEFF Research Database (Denmark)

    Rune Hansen, Esben; Srinivasa Rao, S.; Tiedemann, Peter

    The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1......-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances....

  12. Compressing Binary Decision Diagrams

    DEFF Research Database (Denmark)

    Hansen, Esben Rune; Satti, Srinivasa Rao; Tiedemann, Peter

    2008-01-01

    The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1......-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances...

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

    Directory of Open Access Journals (Sweden)

    Mu-hsuan Huang

    2011-06-01

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

  14. Correlation Test Application of Supplier’s Ranking Using TOPSIS and AHP-TOPSIS Method

    Directory of Open Access Journals (Sweden)

    Ika Yuniwati

    2016-05-01

    Full Text Available The supplier selection process can be done using multi-criteria decision making (MCDM methods in firms. There are many MCDM Methods, but firms must choose the method suitable with the firm condition. Company A has analyzed supplier’s ranking using TOPSIS method. TOPSIS method has a marjor weakness in its subjective weighting. This flaw is overcome using AHP method weighting having undergone a consistency test. In this study, the comparison of supplier’s ranking using TOPSIS and AHP-TOPSIS method used correlation test. The aim of this paper is to determine different result from two methods. Data in suppliers’ ranking is ordinal data, so this process used Spearman’s rank and Kendall’s tau b correlation. If most of the ranked scored are same, Kendall’s tau b correlation should be used. The other way, Spearman rank should be used. The result of this study is that most of the ranked scored are different, so the process used Spearman rank p-value of Spearman’s rank correlation of 0.505. It is greater than 0.05, means there is no statistically significant correlation between two methods. Furthermore, increment or decrement of supplier’s ranking in one method is not significantly related to the increment or decrement of supplier’s ranking in the second method

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

  16. Hyperspectral data compression

    CERN Document Server

    Motta, Giovanni; Storer, James A

    2006-01-01

    Provides a survey of results in the field of compression of remote sensed 3D data, with a particular interest in hyperspectral imagery. This work covers topics such as compression architecture, lossless compression, lossy techniques, and more. It also describes a lossless algorithm based on vector quantization.

  17. Compressive Sensing DNA Microarrays

    Directory of Open Access Journals (Sweden)

    Sheikh Mona A

    2009-01-01

    Full Text Available Compressive sensing microarrays (CSMs are DNA-based sensors that operate using group testing and compressive sensing (CS principles. In contrast to conventional DNA microarrays, in which each genetic sensor is designed to respond to a single target, in a CSM, each sensor responds to a set of targets. We study the problem of designing CSMs that simultaneously account for both the constraints from CS theory and the biochemistry of probe-target DNA hybridization. An appropriate cross-hybridization model is proposed for CSMs, and several methods are developed for probe design and CS signal recovery based on the new model. Lab experiments suggest that in order to achieve accurate hybridization profiling, consensus probe sequences are required to have sequence homology of at least 80% with all targets to be detected. Furthermore, out-of-equilibrium datasets are usually as accurate as those obtained from equilibrium conditions. Consequently, one can use CSMs in applications in which only short hybridization times are allowed.

  18. Rank Modulation for Translocation Error Correction

    CERN Document Server

    Farnoud, Farzad; Milenkovic, Olgica

    2012-01-01

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

  19. Dynamics of Ranking Processes in Complex Systems

    Science.gov (United States)

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

    2012-09-01

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

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

  1. On the rank functions of $\\mathcal{H}$-matroids

    Directory of Open Access Journals (Sweden)

    Yoshio Sano

    2016-01-01

    Full Text Available The notion of $\\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\\mathcal{H}$-matroids by the greedy algorithm. In this note, we give a characterization of some $\\mathcal{H}$-matroids by rank functions.

  2. Rank Detector Preprocessor for Glint Reduction in a Tracking Radar

    CSIR Research Space (South Africa)

    Guest, IW

    1993-04-01

    Full Text Available A rank detector is used to defect instantaneous received power fades in tracking radar. On detection of a fade, censorship of the angular position measurement is implemented in a Kalman tracking filter. It is shown that this technique can typically...

  3. Rankings in education: history and critical analysis of rates

    Directory of Open Access Journals (Sweden)

    Bebenina Ekaterina

    2016-01-01

    Full Text Available The history of rankings, mechanisms of their appearing and reasons of their popularity are little scrutinized yet although they are widely spread in the modern information flow, they are widely used during the evaluation for organizations of the Ministry of Education and Science of Russia and the Russian Academy of Science as key indices.

  4. Ranking in Swiss system chess team tournaments

    OpenAIRE

    Csató, László

    2015-01-01

    The paper uses paired comparison-based scoring procedures for ranking the participants of a Swiss system chess team tournament. We present the main challenges of ranking in Swiss system, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is discussed with respect to the properties of the score, generalized row sum and least squares methods. The proposed procedure is illustra...

  5. A universal rank-size law

    CERN Document Server

    Ausloos, Marcel

    2016-01-01

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

  6. Methodology for ranking restoration options

    Energy Technology Data Exchange (ETDEWEB)

    Hedemann Jensen, Per

    1999-04-01

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

  7. Ranking documents with a thesaurus.

    Science.gov (United States)

    Rada, R; Bicknell, E

    1989-09-01

    This article reports on exploratory experiments in evaluating and improving a thesaurus through studying its effect on retrieval. A formula called DISTANCE was developed to measure the conceptual distance between queries and documents encoded as sets of thesaurus terms. DISTANCE references MeSH (Medical Subject Headings) and assesses the degree of match between a MeSH-encoded query and document. The performance of DISTANCE on MeSH is compared to the performance of people in the assessment of conceptual distance between queries and documents, and is found to simulate with surprising accuracy the human performance. The power of the computer simulation stems both from the tendency of people to rely heavily on broader-than (BT) relations in making decisions about conceptual distance and from the thousands of accurate BT relations in MeSH. One source for discrepancy between the algorithms' measurement of closeness between query and document and people's measurement of closeness between query and document is occasional inconsistency in the BT relations. Our experiments with adding non-BT relations to MeSH showed how these non-BT non-BT relations to MeSH showed how these non-BT relations could improve document ranking, if DISTANCE were also appropriately revised to treat these relations differently from BT relations.

  8. MacWilliams Identity for Codes with the Rank Metric

    Directory of Open Access Journals (Sweden)

    Zhiyuan Yan

    2008-05-01

    Full Text Available The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear codes with the rank metric, and our identity has a different form than that by Delsarte. Using our MacWilliams identity, we also derive related identities for rank metric codes. These identities parallel the binomial and power moment identities derived for codes with the Hamming metric.

  9. MacWilliams Identity for Codes with the Rank Metric

    Directory of Open Access Journals (Sweden)

    Gadouleau Maximilien

    2008-01-01

    Full Text Available Abstract The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear codes with the rank metric, and our identity has a different form than that by Delsarte. Using our MacWilliams identity, we also derive related identities for rank metric codes. These identities parallel the binomial and power moment identities derived for codes with the Hamming metric.

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

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

  12. Sentiment analysis of feature ranking methods for classification accuracy

    Science.gov (United States)

    Joseph, Shashank; Mugauri, Calvin; Sumathy, S.

    2017-11-01

    Text pre-processing and feature selection are important and critical steps in text mining. Text pre-processing of large volumes of datasets is a difficult task as unstructured raw data is converted into structured format. Traditional methods of processing and weighing took much time and were less accurate. To overcome this challenge, feature ranking techniques have been devised. A feature set from text preprocessing is fed as input for feature selection. Feature selection helps improve text classification accuracy. Of the three feature selection categories available, the filter category will be the focus. Five feature ranking methods namely: document frequency, standard deviation information gain, CHI-SQUARE, and weighted-log likelihood –ratio is analyzed.

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

  14. Auto insurance fraud detection using unsupervised spectral ranking for anomaly

    Directory of Open Access Journals (Sweden)

    Ke Nian

    2016-03-01

    Full Text Available For many data mining problems, obtaining labels is costly and time consuming, if not practically infeasible. In addition, unlabeled data often includes categorical or ordinal features which, compared with numerical features, can present additional challenges. We propose a new unsupervised spectral ranking method for anomaly (SRA. We illustrate that the spectral optimization in SRA can be viewed as a relaxation of an unsupervised SVM problem. We demonstrate that the first non-principal eigenvector of a Laplacian matrix is linked to a bi-class classification strength measure which can be used to rank anomalies. Using the first non-principal eigenvector of the Laplacian matrix directly, the proposed SRA generates an anomaly ranking either with respect to the majority class or with respect to two main patterns. The choice of the ranking reference can be made based on whether the cardinality of the smaller class (positive or negative is sufficiently large. Using an auto insurance claim data set but ignoring labels when generating ranking, we show that our proposed SRA significantly surpasses existing outlier-based fraud detection methods. Finally we demonstrate that, while proposed SRA yields good performance for a few similarity measures for the auto insurance claim data, notably ones based on the Hamming distance, choosing appropriate similarity measures for a fraud detection problem remains crucial.

  15. Longitudinal bunch compression study with induction voltage modulator

    Directory of Open Access Journals (Sweden)

    Nakayama Akira

    2013-11-01

    Full Text Available For the beam driver of inertial confinement fusion, the technology to compress a charged particle beam in longitudinal direction is crucially important. However, the quality of the beam is expected to be deteriorated when the beam is rapidly compressed in longitudinal direction. In order to investigate the beam dynamics during bunch compression, we made a compact beam compression system and carried out beam compression experiments. In this paper, we show the background of our study and recent progress of the beam compression experiments.

  16. An Improved Approach to the PageRank Problems

    Directory of Open Access Journals (Sweden)

    Yue Xie

    2013-01-01

    Full Text Available We introduce a partition of the web pages particularly suited to the PageRank problems in which the web link graph has a nested block structure. Based on the partition of the web pages, dangling nodes, common nodes, and general nodes, the hyperlink matrix can be reordered to be a more simple block structure. Then based on the parallel computation method, we propose an algorithm for the PageRank problems. In this algorithm, the dimension of the linear system becomes smaller, and the vector for general nodes in each block can be calculated separately in every iteration. Numerical experiments show that this approach speeds up the computation of PageRank.

  17. Publication Anxiety, Quality, and Journal Rankings: Researcher Views

    Directory of Open Access Journals (Sweden)

    Darryl Coulthard

    2016-10-01

    Full Text Available Journal ranking systems are increasingly used to measure research performance of academics and universities. A growing number of academic commentators have voiced concerns of possible undesirable outcomes such as increased publication anxiety and an increase in safe and conforming research, but there have been few empirical studies on the possible effects. To address this gap, we surveyed Information Systems (IS academics who published in one of three key IS conferences in 2013, to gather their views of the effects of journal ranking systems. Overall, we found that the concerns in the literature were strongly reflected in the views of those surveyed. Academics believe the system has greatly increased their publication anxiety. While most believed that the quality of published research had improved, researchers believe the ranking systems inhibit innovative, risky research, and encourages safe, conforming, mainstream research.

  18. THE USE OF RANKING SAMPLING METHOD WITHIN MARKETING RESEARCH

    Directory of Open Access Journals (Sweden)

    CODRUŢA DURA

    2011-01-01

    Full Text Available Marketing and statistical literature available to practitioners provides a wide range of sampling methods that can be implemented in the context of marketing research. Ranking sampling method is based on taking apart the general population into several strata, namely into several subdivisions which are relatively homogenous regarding a certain characteristic. In fact, the sample will be composed by selecting, from each stratum, a certain number of components (which can be proportional or non-proportional to the size of the stratum until the pre-established volume of the sample is reached. Using ranking sampling within marketing research requires the determination of some relevant statistical indicators - average, dispersion, sampling error etc. To that end, the paper contains a case study which illustrates the actual approach used in order to apply the ranking sample method within a marketing research made by a company which provides Internet connection services, on a particular category of customers – small and medium enterprises.

  19. A new DEA approach to rank alternatives in MCDA

    Directory of Open Access Journals (Sweden)

    Majid Darehmiraki

    2013-04-01

    Full Text Available One of the principal subjects in multiple criteria decision analysis is ranking alternatives. Here, we present a new method to rank alternatives by using data envelopment analysis. In this paper, one ranking method is proposed based on applying an artificial alternative called aggregate alternative. The method is based on the fact that one efficient alternative with a better performance has stronger effects on the group of other alternatives. That means its deletion forces the remaining alternatives to get smaller efficiency. The described idea in this paper is inspired of Lotfi and et al. (2011. One feature of the proposed method is that it does not need to determine the weight of the prior. Two examples are used to illustrate how the proposed method works in actual practices, and the results are compared with those obtained from the TOPSIS method.

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

    Directory of Open Access Journals (Sweden)

    Stetsenko A.I.

    2010-01-01

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

  1. An overview of semantic compression

    Science.gov (United States)

    Schmalz, Mark S.

    2010-08-01

    approaches are considered, ranging from low-level semantic compression for text and database compaction, to high-level semantic analysis of images or video in which objects of interest have been detected, segmented, and represented compactly to facilitate indexing. In particular, we overview previous work in semantic pattern recognition, and how this has been applied to object-based compression. Discussion centers on lossless versus lossy transformations, quality of service in lossy compression, and computational efficiency.

  2. A Customizable Text Classifier for Text Mining

    Directory of Open Access Journals (Sweden)

    Yun-liang Zhang

    2007-12-01

    Full Text Available Text mining deals with complex and unstructured texts. Usually a particular collection of texts that is specified to one or more domains is necessary. We have developed a customizable text classifier for users to mine the collection automatically. It derives from the sentence category of the HNC theory and corresponding techniques. It can start with a few texts, and it can adjust automatically or be adjusted by user. The user can also control the number of domains chosen and decide the standard with which to choose the texts based on demand and abundance of materials. The performance of the classifier varies with the user's choice.

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

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

    Data.gov (United States)

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

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

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

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

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

  9. Biplots in Reduced-Rank Regression

    NARCIS (Netherlands)

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

    1994-01-01

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

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

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

  12. Generating and ranking of Dyck words

    CERN Document Server

    Kasa, Zoltan

    2010-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Hsieh Fushing

    2011-03-01

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

  14. University ranking methodologies. An interview with Ben Sowter about the Quacquarelli Symonds World University Ranking

    OpenAIRE

    Alberto Baccini; Antono Banfi; Giuseppe De Nicolao; Paola Galimberti

    2015-01-01

    University rankings represent a controversial issue in the debate about higher education policy. One of the best known university ranking is the Quacquarelli Symonds World University Rankings (QS), published annually since 2004 by Quacquarelli Symonds ltd, a company founded in 1990 and headquartered in London. QS provides a ranking based on a score calculated by weighting six different indicators. The 2015 edition, published in October 2015, introduced major methodological innovations and, as...

  15. Recognizable or Not: Towards Image Semantic Quality Assessment for Compression

    Science.gov (United States)

    Liu, Dong; Wang, Dandan; Li, Houqiang

    2017-12-01

    Traditionally, image compression was optimized for the pixel-wise fidelity or the perceptual quality of the compressed images given a bit-rate budget. But recently, compressed images are more and more utilized for automatic semantic analysis tasks such as recognition and retrieval. For these tasks, we argue that the optimization target of compression is no longer perceptual quality, but the utility of the compressed images in the given automatic semantic analysis task. Accordingly, we propose to evaluate the quality of the compressed images neither at pixel level nor at perceptual level, but at semantic level. In this paper, we make preliminary efforts towards image semantic quality assessment (ISQA), focusing on the task of optical character recognition (OCR) from compressed images. We propose a full-reference ISQA measure by comparing the features extracted from text regions of original and compressed images. We then propose to integrate the ISQA measure into an image compression scheme. Experimental results show that our proposed ISQA measure is much better than PSNR and SSIM in evaluating the semantic quality of compressed images; accordingly, adopting our ISQA measure to optimize compression for OCR leads to significant bit-rate saving compared to using PSNR or SSIM. Moreover, we perform subjective test about text recognition from compressed images, and observe that our ISQA measure has high consistency with subjective recognizability. Our work explores new dimensions in image quality assessment, and demonstrates promising direction to achieve higher compression ratio for specific semantic analysis tasks.

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

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

  18. Reliability of journal impact factor rankings

    Science.gov (United States)

    Greenwood, Darren C

    2007-01-01

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

  19. Cointegration rank testing under conditional heteroskedasticity

    DEFF Research Database (Denmark)

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

    2010-01-01

    (martingale difference) innovations. We first demonstrate that the limiting null distributions of the rank statistics coincide with those derived by previous authors who assume either independent and identically distributed (i.i.d.) or (strict and covariance) stationary martingale difference innovations. We...... then propose wild bootstrap implementations of the cointegrating rank tests and demonstrate that the associated bootstrap rank statistics replicate the first-order asymptotic null distributions of the rank statistics. We show that the same is also true of the corresponding rank tests based on the i.......i.d. bootstrap of Swensen (2006, Econometrica 74, 1699-1714). The wild bootstrap, however, has the important property that, unlike the i.i.d. bootstrap, it preserves in the resampled data the pattern of heteroskedasticity present in the original shocks. Consistent with this, numerical evidence suggests that...

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

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

  2. A tilting approach to ranking influence

    KAUST Repository

    Genton, Marc G.

    2014-12-01

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

  3. Speech Denoising in White Noise Based on Signal Subspace Low-rank Plus Sparse Decomposition

    Directory of Open Access Journals (Sweden)

    yuan Shuai

    2017-01-01

    Full Text Available In this paper, a new subspace speech enhancement method using low-rank and sparse decomposition is presented. In the proposed method, we firstly structure the corrupted data as a Toeplitz matrix and estimate its effective rank for the underlying human speech signal. Then the low-rank and sparse decomposition is performed with the guidance of speech rank value to remove the noise. Extensive experiments have been carried out in white Gaussian noise condition, and experimental results show the proposed method performs better than conventional speech enhancement methods, in terms of yielding less residual noise and lower speech distortion.

  4. The influence of occupational rank on organizational commitment of faculty members

    Directory of Open Access Journals (Sweden)

    Vinita Sinha

    2015-01-01

    Full Text Available This study investigates the impact of rank on organizational commitment and explores the individual relationships between affective, normative and continuance commitment. The study comprised a sample of 505 academic staff from 28 privately-owned technical institutes in Haryana state, India. Three way ANOVA results reveal that overall organizational commitment increases progressively with rank. Results further show that rank does not have a positive influence on affective, continuance and normative commitment. Female faculty found more committed than their male counterparts. The findings have been thoroughly discussed in terms of the influential role of rank on organizational commitments for faculty members.

  5. Ranking of Higher Education Institutions: Ideology and Methodology of Development (Russian Practice

    Directory of Open Access Journals (Sweden)

    I V Trotsuk

    2009-03-01

    Full Text Available The article comprises the second part of the analytical review of ideology, methodology and actual practice of higher education institutions ranking development (the first part revealing the international experience was published in the second issue of the journal in 2008. The author examines the current circumstances of higher education institutions ranking and particular education programmes in Russia. Inparticular, the main approaches to ranking elaboration primarily associated with the authors’ and clients’ «status» and the appropriate goals of higher education institutions ranking are revealed in the paper.

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

  7. Interpreting the Phase Spectrum in Fourier Analysis of Partial Ranking Data

    Directory of Open Access Journals (Sweden)

    Ramakrishna Kakarala

    2012-01-01

    Full Text Available Whenever ranking data are collected, such as in elections, surveys, and database searches, it is frequently the case that partial rankings are available instead of, or sometimes in addition to, full rankings. Statistical methods for partial rankings have been discussed in the literature. However, there has been relatively little published on their Fourier analysis, perhaps because the abstract nature of the transforms involved impede insight. This paper provides as its novel contributions an analysis of the Fourier transform for partial rankings, with particular attention to the first three ranks, while emphasizing on basic signal processing properties of transform magnitude and phase. It shows that the transform and its magnitude satisfy a projection invariance and analyzes the reconstruction of data from either magnitude or phase alone. The analysis is motivated by appealing to corresponding properties of the familiar DFT and by application to two real-world data sets.

  8. Improving CBIR Systems Using Automated Ranking

    Directory of Open Access Journals (Sweden)

    B. D. Reljin

    2012-11-01

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

  9. Ranking Technology Forecasting Journals by Using Data Envelopment Analysis

    Directory of Open Access Journals (Sweden)

    Jasna Petković

    2015-05-01

    Full Text Available The goal of this paper is to present the ranking of the journals in the field of technology forecasting (TF through the application of the Data Envelopment Analysis - DEA. Over the past four decades, we have witnessed a rapid development in the field of technology forecasting. This development, both in theory and in practice, has been fuelled by the increase in complexity, even greater competition, and rapid changes in the business environment. Back in the past, little attention was paid to the importance and conceptual development in the field of TF, which caused numerous overlaps of the forms of TF development and its influence. The changes that have resulted in the emergence of information technology and modern manufacturing technology have actually increased the need for application of technology forecasting, as well as for explosive growth in scientific and engineering literature worldwide. The paper shows the ranking of 39 journals in the field of TF over the period from 1999 to 2011 through the application of the Data Envelopment Analysis, as well as through analyzing trend changes in publishing professional publications in the field of technology forecasting. Also pointed out are the shortcomings ofprevious methods of ranking journals by using impact factors, as one of the most important indicators of the quality of journals, as well as the possibilities of applying indicators obtained by using other methodologies. The results of such method of ranking should point out to publishing trends to the researchers engaged in this field, and direct them to journals in which they could present the results of their research. The aim of this research is to show that more than one criterion must be taken in order to create the rank of a journal from a specific area. In this way we get a more realistic ranking of leading journals from the observed area, since other necessary elements that contribute to the importance of a journal for a relevant

  10. Video Coding Technique using MPEG Compression Standards

    Directory of Open Access Journals (Sweden)

    A. J. Falade

    2013-06-01

    Full Text Available Digital video compression technologies have become part of life, in the way visual information is created, communicated and consumed. Some application areas of video compression focused on the problem of optimizing storage space and transmission bandwidth (BW. The two dimensional discrete cosine transform (2-D DCT is an integral part of video and image compression, which is used in Moving Picture Expert Group (MPEG encoding standards. Thus, several video compression algorithms had been developed to reduce the data quantity and provide the acceptable quality standard. In the proposed study, the Matlab Simulink Model (MSM has been used for video coding/compression. The approach is more modern and reduces error resilience image distortion.

  11. Wavelet image compression

    CERN Document Server

    Pearlman, William A

    2013-01-01

    This book explains the stages necessary to create a wavelet compression system for images and describes state-of-the-art systems used in image compression standards and current research. It starts with a high level discussion of the properties of the wavelet transform, especially the decomposition into multi-resolution subbands. It continues with an exposition of the null-zone, uniform quantization used in most subband coding systems and the optimal allocation of bitrate to the different subbands. Then the image compression systems of the FBI Fingerprint Compression Standard and the JPEG2000 S

  12. Compressed sensing & sparse filtering

    CERN Document Server

    Carmi, Avishy Y; Godsill, Simon J

    2013-01-01

    This book is aimed at presenting concepts, methods and algorithms ableto cope with undersampled and limited data. One such trend that recently gained popularity and to some extent revolutionised signal processing is compressed sensing. Compressed sensing builds upon the observation that many signals in nature are nearly sparse (or compressible, as they are normally referred to) in some domain, and consequently they can be reconstructed to within high accuracy from far fewer observations than traditionally held to be necessary. Apart from compressed sensing this book contains other related app

  13. Info-Greedy Sequential Adaptive Compressed Sensing

    Science.gov (United States)

    Braun, Gabor; Pokutta, Sebastian; Xie, Yao

    2015-06-01

    We present an information-theoretic framework for sequential adaptive compressed sensing, Info-Greedy Sensing, where measurements are chosen to maximize the extracted information conditioned on the previous measurements. We show that the widely used bisection approach is Info-Greedy for a family of $k$-sparse signals by connecting compressed sensing and blackbox complexity of sequential query algorithms, and present Info-Greedy algorithms for Gaussian and Gaussian Mixture Model (GMM) signals, as well as ways to design sparse Info-Greedy measurements. Numerical examples demonstrate the good performance of the proposed algorithms using simulated and real data: Info-Greedy Sensing shows significant improvement over random projection for signals with sparse and low-rank covariance matrices, and adaptivity brings robustness when there is a mismatch between the assumed and the true distributions.

  14. Image ranking in video sequences using pairwise image comparisons and temporal smoothing

    CSIR Research Space (South Africa)

    Burke, Michael

    2016-12-01

    Full Text Available ’ values within a standard Bayesian ranking framework, and a Rauch-Tung-Striebel smoother is used to improve these interest scores. Results show that the training data requirements typically associated with pairwise ranking systems are dramatically reduced...

  15. On a common generalization of Shelah's 2-rank, dp-rank, and o-minimal dimension

    OpenAIRE

    Guingona, Vincent; Hill, Cameron Donnay

    2013-01-01

    In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multi-order property, generalizing the order property, and use this to create op-rank, which generalizes 2-rank. From this we build op-dimension. We show that op-dimension bounds dp-rank, that op-dimension is sub-additive, and op-dimension generalizes o-minimal dimension in o-minimal theories.

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

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

  18. Adiabatic Quantum Algorithm for Search Engine Ranking

    Science.gov (United States)

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

    2012-06-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Donglei Du

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

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

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

  3. Image restoration via patch orientation-based low-rank matrix approximation and nonlocal means

    Science.gov (United States)

    Zhang, Di; He, Jiazhong; Du, Minghui

    2016-03-01

    Low-rank matrix approximation and nonlocal means (NLM) are two popular techniques for image restoration. Although the basic principle for applying these two techniques is the same, i.e., similar image patches are abundant in the image, previously published related algorithms use either low-rank matrix approximation or NLM because they manipulate the information of similar patches in different ways. We propose a method for image restoration by jointly using low-rank matrix approximation and NLM in a unified minimization framework. To improve the accuracy of determining similar patches, we also propose a patch similarity measurement based on curvelet transform. Extensive experiments on image deblurring and compressive sensing image recovery validate that the proposed method achieves better results than many state-of-the-art algorithms in terms of both quantitative measures and visual perception.

  4. Tree compression with top trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

    2015-01-01

    We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...... navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time....

  5. Tree compression with top trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

    2013-01-01

    We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...... navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time....

  6. Beyond Text Queries and Ranked Lists: Faceted Search in Library Catalogs

    Science.gov (United States)

    Niu, Xi

    2012-01-01

    Since the adoption of faceted search in a small number of academic libraries in 2006, faceted library catalogs have gained popularity in many academic and public libraries. This dissertation seeks to understand whether faceted search improves the interactions between searchers and library catalogs and to understand ways that facets are used in…

  7. Anisotropic Concrete Compressive Strength

    DEFF Research Database (Denmark)

    Gustenhoff Hansen, Søren; Jørgensen, Henrik Brøner; Hoang, Linh Cao

    2017-01-01

    When the load carrying capacity of existing concrete structures is (re-)assessed it is often based on compressive strength of cores drilled out from the structure. Existing studies show that the core compressive strength is anisotropic; i.e. it depends on whether the cores are drilled parallel...

  8. Experiments with automata compression

    NARCIS (Netherlands)

    Daciuk, J.; Yu, S; Daley, M; Eramian, M G

    2001-01-01

    Several compression methods of finite-state automata are presented and evaluated. Most compression methods used here are already described in the literature. However, their impact on the size of automata has not been described yet. We fill that gap, presenting results of experiments carried out on

  9. Relevancy Ranking of Satellite Dataset Search Results

    Science.gov (United States)

    Lynnes, Christopher; Quinn, Patrick; Norton, James

    2017-01-01

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

  10. Grades and Ranking: When Tenure Affects Assessment

    Directory of Open Access Journals (Sweden)

    Jean Filetti

    2010-10-01

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

  11. Leveraging Multiactions to Improve Medical Personalized Ranking for Collaborative Filtering

    Directory of Open Access Journals (Sweden)

    Shan Gao

    2017-01-01

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

  12. Integrated inventory ranking system for oilfield equipment industry

    Directory of Open Access Journals (Sweden)

    Jalel Ben Hmida

    2014-01-01

    Full Text Available Purpose: This case study is motivated by the subcontracting problem in an oilfield equipment and service company where the management needs to decide which parts to manufacture in-house when the capacity is not enough to make all required parts. Currently the company is making subcontracting decisions based on management’s experience. Design/methodology/approach: Working with the management, a decision support system (DSS is developed to rank parts by integrating three inventory classification methods considering both quantitative factors such as cost and demand, and qualitative factors such as functionality, efficiency, and quality. The proposed integrated inventory ranking procedure will make use of three classification methods: ABC, FSN, and VED. Findings: An integration mechanism using weights is developed to rank the parts based on the total priority scores. The ranked list generated by the system helps management to identify about 50 critical parts to manufacture in-house. Originality/value: The integration of all three inventory classification techniques into a single system is a unique feature of this research. This is important as it provides a more inclusive, big picture view of the DSS for management’s use in making business decisions.

  13. PREFERENCE BASED TERM WEIGHTING FOR ARABIC FIQH DOCUMENT RANKING

    Directory of Open Access Journals (Sweden)

    Khadijah Fahmi Hayati Holle

    2015-03-01

    Full Text Available In document retrieval, besides the suitability of query with search results, there is also a subjective user assessment that is expected to be a deciding factor in document ranking. This preference aspect is referred at the fiqh document searching. People tend to prefer on certain fiqh methodology without rejecting other fiqh methodologies. It is necessary to investigate preference factor in addition to the relevance factor in the document ranking. Therefore, this research proposed a method of term weighting based on preference to rank documents according to user preference. The proposed method is also combined with term weighting based on documents index and books index so it sees relevance and preference aspect. The proposed method is Inverse Preference Frequency with α value (IPFα. In this method, we calculate preference value by IPF term weighting. Then, the preference values of terms that is equal with the query are multiplied by α. IPFα combined with the existing weighting methods become TF.IDF.IBF.IPFα. Experiment of the proposed method uses dataset of several Arabic fiqh documents. Evaluation uses recall, precision, and f-measure calculations. Proposed term weighting method is obtained to rank the document in the right order according to user preference. It is shown from the result with recall value reach 75%, precision 100%, and f-measure 85.7% respectively.

  14. Rank-Constrained Beamforming for MIMO Cognitive Interference Channel

    Directory of Open Access Journals (Sweden)

    Duoying Zhang

    2016-01-01

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

  15. A folk-psychological ranking of personality facets

    Directory of Open Access Journals (Sweden)

    Eka Roivainen

    2016-10-01

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

  16. The LAILAPS search engine: relevance ranking in life science databases.

    Science.gov (United States)

    Lange, Matthias; Spies, Karl; Bargsten, Joachim; Haberhauer, Gregor; Klapperstück, Matthias; Leps, Michael; Weinel, Christian; Wünschiers, Röbbe; Weissbach, Mandy; Stein, Jens; Scholz, Uwe

    2010-01-15

    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. With a set of features, extracted from each database hit in combination with user relevance preferences, a neural network predicts user specific relevance scores. Using expert knowledge as training data for a predefined neural network or using users own relevance training sets, a reliable relevance ranking of database hits has been implemented. In this paper, we present the LAILAPS system, the concepts, benchmarks and use cases. LAILAPS is public available for SWISSPROT data at http://lailaps.ipk-gatersleben.de.

  17. Low-Rank Affinity Based Local-Driven Multilabel Propagation

    Directory of Open Access Journals (Sweden)

    Teng Li

    2013-01-01

    Full Text Available This paper presents a novel low-rank affinity based local-driven algorithm to robustly propagate the multilabels from training images to test images. A graph is constructed over the segmented local image regions. The labels for vertices from the training data are derived based on the context among different training images, and the derived vertex labels are propagated to the unlabeled vertices via the graph. The multitask low-rank affinity, which jointly seeks the sparsity-consistent low-rank affinities from multiple feature matrices, is applied to compute the edge weights between graph vertices. The inference process of multitask low-rank affinity is formulated as a constrained nuclear norm and ℓ2,1-norm minimization problem. The optimization is conducted efficiently with the augmented Lagrange multiplier method. Based on the learned local patch labels we can predict the multilabels for the test images. Experiments on multilabel image annotation demonstrate the encouraging results from the proposed framework.

  18. Point scoring system to rank traffic calming projects

    Directory of Open Access Journals (Sweden)

    Farzana Rahman

    2016-08-01

    Full Text Available The installation of calming measures on a road network is systematically planned way in general to reduce driving speeds, but also reduces the volume of through traffic on local and residential streets. When the demands of traffic calming exceed city resources, there is a need to prioritize or rank them. Asian countries, like Japan, Korea, Bangladesh and etc., do not have a prioritization system to apply in such cases. The objective of this research is to develop a point ranking system to prioritize traffic calming projects. Firstly paired comparison method was employed to obtain residents' opinions about the streets severity and needs of traffic calming treatment. A binary logistic regression model was developed to identify the factors of selecting streets for traffic calming. This model also explored the weight of variables during developing the point ranking system. The weights used in the point ranking system include vehicle speed, pedestrian generation, sidewalk condition and hourly vehicle volume per width (m of street. Results suggest that the severity of street largely depends on the absence of sidewalks, which has a weight of 45%, and high hourly vehicle volume of traffic per width (m of street, which has a weight of 38%. These outcomes are significant to develop the state of traffic safety in Japan and other Asian countries.

  19. Territory, Rank and Mental Health: The History of an Idea

    Directory of Open Access Journals (Sweden)

    John S. Price

    2007-07-01

    Full Text Available We trace the development of ideas about the relation of mood to social rank and territory. We suggest that elevated mood enabled a person to rise in rank and cope with the increased activities and responsibilities of a leadership role, while depressed mood enabled a person to accept low rank and to forego the rewards associated with high rank. This led to the concept of a trio of agonist/investor strategy sets, each consisting of escalating and de-escalating strategies, one set at each of the three levels of the triune forebrain. Depressed mood can be seen as a de-escalating (appeasement strategy at the lowest (reptilian level; this should facilitate de-escalation at the highest (rational level, but sometimes this rational level de-escalation is blocked (e.g., by stubbornness, courage, pride or ambition and then clinical depression may ensue. These evolved psychobiological mechanisms survived the partial transition from agonistic to prestige competition. We discuss difficulties which have arisen with our ideas, and their implications for clinical work and research.

  20. Social rank affects the haematologic profile in red deer hinds.

    Science.gov (United States)

    Ceacero, Francisco; Gaspar-López, Enrique; Landete-Castillejos, Tomás; Gallego, Laureano; García, Andrés J

    2018-01-26

    We studied the effects of social rank on the haematologic profile in a herd of 24 female Iberian red deer hinds. Social rank hierarchy was determined and blood samples were taken and analysed. After adjusting for age and body mass, dominance ranking showed a significant negative effect (ie, lower values in dominant hinds) on white blood cell (WBC) count, haemoglobin and haematocrit. Our results are similar to those reported for stressed individuals due to physical immobilisation, but do not support the predicted enhanced erythropoiesis due to higher levels of androgens. The results for WBC numbers may also reflect that subordinate hinds must allocate a higher amount of resources to immunity as a result of injuries incurred from dominant hinds, while simultaneously facing restricted access to food sources. For red blood cell (RBC) counts, the results may be due to subordinate hinds likely needing increased haematocrit and haemoglobin levels for fast flight responses. Our data show that social rank influences haematologic profile, and thus it should be considered when correctly interpreting blood analyses in social cervid species. © British Veterinary Association (unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

  1. Block models and personalized PageRank

    National Research Council Canada - National Science Library

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

    2017-01-01

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

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

  3. Ranking Forestry Investments With Parametric Linear Programming

    Science.gov (United States)

    Paul A. Murphy

    1976-01-01

    Parametric linear programming is introduced as a technique for ranking forestry investments under multiple constraints; it combines the advantages of simple tanking and linear programming as capital budgeting tools.

  4. Superfund Hazard Ranking System Training Course

    Science.gov (United States)

    The Hazard Ranking System (HRS) training course is a four and ½ day, intermediate-level course designed for personnel who are required to compile, draft, and review preliminary assessments (PAs), site inspections (SIs), and HRS documentation records/packag

  5. A cognitive model for aggregating people's rankings

    National Research Council Canada - National Science Library

    Lee, Michael D; Steyvers, Mark; Miller, Brent

    2014-01-01

    .... Applications of the model to 23 data sets, dealing with general knowledge and prediction tasks, show that the model performs well in producing an aggregate ranking that is often close to the ground...

  6. Combined Sparsifying Transforms for Compressive Image Fusion

    Directory of Open Access Journals (Sweden)

    ZHAO, L.

    2013-11-01

    Full Text Available In this paper, we present a new compressive image fusion method based on combined sparsifying transforms. First, the framework of compressive image fusion is introduced briefly. Then, combined sparsifying transforms are presented to enhance the sparsity of images. Finally, a reconstruction algorithm based on the nonlinear conjugate gradient is presented to get the fused image. The simulations demonstrate that by using the combined sparsifying transforms better results can be achieved in terms of both the subjective visual effect and the objective evaluation indexes than using only a single sparsifying transform for compressive image fusion.

  7. Time-Aware Service Ranking Prediction in the Internet of Things Environment

    Directory of Open Access Journals (Sweden)

    Yuze Huang

    2017-04-01

    Full Text Available With the rapid development of the Internet of things (IoT, building IoT systems with high quality of service (QoS has become an urgent requirement in both academia and industry. During the procedures of building IoT systems, QoS-aware service selection is an important concern, which requires the ranking of a set of functionally similar services according to their QoS values. In reality, however, it is quite expensive and even impractical to evaluate all geographically-dispersed IoT services at a single client to obtain such a ranking. Nevertheless, distributed measurement and ranking aggregation have to deal with the high dynamics of QoS values and the inconsistency of partial rankings. To address these challenges, we propose a time-aware service ranking prediction approach named TSRPred for obtaining the global ranking from the collection of partial rankings. Specifically, a pairwise comparison model is constructed to describe the relationships between different services, where the partial rankings are obtained by time series forecasting on QoS values. The comparisons of IoT services are formulated by random walks, and thus, the global ranking can be obtained by sorting the steady-state probabilities of the underlying Markov chain. Finally, the efficacy of TSRPred is validated by simulation experiments based on large-scale real-world datasets.

  8. A review on compressed pattern matching

    Directory of Open Access Journals (Sweden)

    Surya Prakash Mishra

    2016-09-01

    Full Text Available Compressed pattern matching (CPM refers to the task of locating all the occurrences of a pattern (or set of patterns inside the body of compressed text. In this type of matching, pattern may or may not be compressed. CPM is very useful in handling large volume of data especially over the network. It has many applications in computational biology, where it is useful in finding similar trends in DNA sequences; intrusion detection over the networks, big data analytics etc. Various solutions have been provided by researchers where pattern is matched directly over the uncompressed text. Such solution requires lot of space and consumes lot of time when handling the big data. Various researchers have proposed the efficient solutions for compression but very few exist for pattern matching over the compressed text. Considering the future trend where data size is increasing exponentially day-by-day, CPM has become a desirable task. This paper presents a critical review on the recent techniques on the compressed pattern matching. The covered techniques includes: Word based Huffman codes, Word Based Tagged Codes; Wavelet Tree Based Indexing. We have presented a comparative analysis of all the techniques mentioned above and highlighted their advantages and disadvantages.

  9. Rank rigidity for CAT(0) cube complexes

    OpenAIRE

    Caprace, Pierre-Emmanuel; Sageev, Michah

    2010-01-01

    We prove that any group acting essentially without a fixed point at infinity on an irreducible finite-dimensional CAT(0) cube complex contains a rank one isometry. This implies that the Rank Rigidity Conjecture holds for CAT(0) cube complexes. We derive a number of other consequences for CAT(0) cube complexes, including a purely geometric proof of the Tits Alternative, an existence result for regular elements in (possibly non-uniform) lattices acting on cube complexes, and a characterization ...

  10. NUCLEAR POWER PLANTS SAFETY IMPROVEMENT PROJECTS RANKING

    OpenAIRE

    Григорян, Анна Сергеевна; Тигран Георгиевич ГРИГОРЯН; Квасневский, Евгений Анатольевич

    2013-01-01

    The ranking nuclear power plants safety improvement projects is the most important task for ensuring the efficiency of NPP project management office work. Total amount of projects in NPP portfolio may reach more than 400. Features of the nuclear power plants safety improvement projects ranking in NPP portfolio determine the choice of the decision verbal analysis as a method of decision-making, as it allows to quickly compare the number of alternatives that are not available at the time of con...

  11. 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...... the relevance and importance of music. The proposed method may support users with diverse needs when searching for music....

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

  13. Hierarchical Rank Aggregation with Applications to Nanotoxicology.

    Science.gov (United States)

    Patel, Trina; Telesca, Donatello; Rallo, Robert; George, Saji; Xia, Tian; Nel, André E

    2013-06-01

    The development of high throughput screening (HTS) assays in the field of nanotoxicology provide new opportunities for the hazard assessment and ranking of engineered nanomaterials (ENMs). It is often necessary to rank lists of materials based on multiple risk assessment parameters, often aggregated across several measures of toxicity and possibly spanning an array of experimental platforms. Bayesian models coupled with the optimization of loss functions have been shown to provide an effective framework for conducting inference on ranks. In this article we present various loss-function-based ranking approaches for comparing ENM within experiments and toxicity parameters. Additionally, we propose a framework for the aggregation of ranks across different sources of evidence while allowing for differential weighting of this evidence based on its reliability and importance in risk ranking. We apply these methods to high throughput toxicity data on two human cell-lines, exposed to eight different nanomaterials, and measured in relation to four cytotoxicity outcomes. This article has supplementary material online.

  14. Compression fractures of the back

    Science.gov (United States)

    ... most effective way to prevent compression or insufficiency fractures. Getting regular load-bearing exercise (such as walking) can help you avoid bone loss. Alternative Names Vertebral compression fractures Images Compression fracture References Cosman F, de Beur ...

  15. On the Rank of Elliptic Curves in Elementary Cubic Extensions

    Directory of Open Access Journals (Sweden)

    Rintaro Kozuma

    2015-01-01

    Full Text Available We give a method for explicitly constructing an elementary cubic extension L over which an elliptic curve ED:y2+Dy=x3  (D∈Q∗ has Mordell-Weil rank of at least a given positive integer by finding a close connection between a 3-isogeny of ED and a generic polynomial for cyclic cubic extensions. In our method, the extension degree [L:Q] often becomes small.

  16. Impact of Compression on the Video Quality

    Directory of Open Access Journals (Sweden)

    Miroslav Uhrina

    2012-01-01

    Full Text Available This article deals with the impact of compression on the video quality. In the first part, a short characteristic of the most used MPEG compression standards is written. In the second part, the parameter Group of Picture (GOP with particular I, P, B frames is explained. The third part focuses on the objective metrics which were used for evaluating the video quality. In the fourth part, the measurements and the experimental results are described.

  17. Breaking of rod-shaped model material during compression

    Directory of Open Access Journals (Sweden)

    Lukas Kulaviak

    2017-01-01

    Full Text Available The breakage of a model anisometric dry granular material caused by uniaxial compression was studied. The bed of uniform rod-like pasta particles (8 mm long, aspect ratio 1:8 was compressed (Gamlen Tablet Press and their size distribution was measured after each run (Dynamic Image Analysing. The compression dynamics was recorded and the effect of several parameters was tested (rate of compression, volume of granular bed, pressure magnitude and mode of application. Besides the experiments, numerical modelling of the compressed breakable material was performed as well, employing the DEM approach (Discrete Element Method. The comparison between the data and the model looks promising.

  18. On the compressibility effects in mixing layers

    Directory of Open Access Journals (Sweden)

    Khlifi Hechmi

    2016-01-01

    Full Text Available Previous studies of compressible flows carried out in the past few years have shown that the pressure-strain is the main indicator of the structural compressibility effects. Undoubtedly, this terms plays a key role toward strongly changing magnitude of the turbulent Reynolds stress anisotropy. On the other hand, the incompressible models of the pressure-strain correlation have not correctly predicted compressible turbulence at high speed shear flow. Consequently, a correction of these models is needed for precise prediction of compressibility effects. In the present work, a compressibility correction of the widely used incompressible Launder Reece and Rodi model making their standard coefficients dependent on the turbulent and convective Mach numbers is proposed. The ability of the model to predict the developed mixing layers in different cases from experiments of Goebel and Dutton is examined. The predicted results with the proposed model are compared with DNS and experimental data and those obtained by the compressible model of Adumitroiae et al. and the original LRR model. The results show that the essential compressibility effects on mixing layers are well captured by the proposed model.

  19. Efficient Top-k Search for PageRank

    National Research Council Canada - National Science Library

    Fujiwara, Yasuhiro; Nakatsuji, Makoto; Shiokawa, Hiroaki; Mishima, Takeshi; Onizuka, Makoto

    2015-01-01

      In AI communities, many applications utilize PageRank. To obtain high PageRank score nodes, the original approach iteratively computes the PageRank score of each node until convergence from the whole graph...

  20. An unusual case: right proximal ureteral compression by the ovarian vein and distal ureteral compression by the external iliac vein

    Directory of Open Access Journals (Sweden)

    Halil Ibrahim Serin

    2015-12-01

    Full Text Available A 32-years old woman presented to the emergency room of Bozok University Research Hospital with right renal colic. Multidetector computed tomography (MDCT showed compression of the proximal ureter by the right ovarian vein and compression of the right distal ureter by the right external iliac vein. To the best of our knowledge, right proximal ureteral compression by the ovarian vein together with distal ureteral compression by the external iliac vein have not been reported in the literature. Ovarian vein and external iliac vein compression should be considered in patients presenting to the emergency room with renal colic or low back pain and a dilated collecting system.

  1. Ranking Fuzzy Numbers and Its Application to Products Attributes Preferences

    OpenAIRE

    Abdullah, Lazim; Fauzee, Nor Nashrah Ahmad

    2011-01-01

    Ranking is one of the widely used methods in fuzzy decision making environment. The recent ranking fuzzy numbers proposed by Wang and Li is claimed to be the improved version in ranking. However, the method was never been simplified and tested in real life application. This paper presents a four-step computation of ranking fuzzy numbers and its application in ranking attributes of selected chocolate products. The four steps algorithm was formulated to rank fuzzy numbers and followed by a tes...

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

  3. A network-based dynamical ranking system

    CERN Document Server

    Motegi, Shun

    2012-01-01

    Ranking players or teams in sports is of practical interests. From the viewpoint of networks, a ranking system is equivalent a centrality measure for sports networks, whereby a directed link represents the result of a single game. Previously proposed network-based ranking systems are derived from static networks, i.e., aggregation of the results of games over time. However, the score (i.e., strength) of a player, for example, depends on time. Defeating a renowned player in the peak performance is intuitively more rewarding than defeating the same player in other periods. To account for this factor, we propose a dynamic variant of such a network-based ranking system and apply it to professional men's tennis data. Our ranking system, also interpreted as a centrality measure for directed temporal networks, has two parameters. One parameter represents the exponential decay rate of the past score, and the other parameter controls the effect of indirect wins on the score. We derive a set of linear online update equ...

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

  5. A Cognitive Model for Aggregating People's Rankings

    Science.gov (United States)

    Lee, Michael D.; Steyvers, Mark; Miller, Brent

    2014-01-01

    We develop a cognitive modeling approach, motivated by classic theories of knowledge representation and judgment from psychology, for combining people's rankings of items. The model makes simple assumptions about how individual differences in knowledge lead to observed ranking data in behavioral tasks. We implement the cognitive model as a Bayesian graphical model, and use computational sampling to infer an aggregate ranking and measures of the individual expertise. Applications of the model to 23 data sets, dealing with general knowledge and prediction tasks, show that the model performs well in producing an aggregate ranking that is often close to the ground truth and, as in the “wisdom of the crowd” effect, usually performs better than most of individuals. We also present some evidence that the model outperforms the traditional statistical Borda count method, and that the model is able to infer people's relative expertise surprisingly well without knowing the ground truth. We discuss the advantages of the cognitive modeling approach to combining ranking data, and in wisdom of the crowd research generally, as well as highlighting a number of potential directions for future model development. PMID:24816733

  6. Compressed Video Segmentation

    National Research Council Canada - National Science Library

    Kobla, Vikrant; Doermann, David S; Rosenfeld, Azriel

    1996-01-01

    ... changes in content and camera motion. The analysis is performed in the compressed domain using available macroblock and motion vector information, and if necessary, discrete cosine transform (DCT) information...

  7. Compressive light field displays.

    Science.gov (United States)

    Wetzstein, Gordon; Lanman, Douglas; Hirsch, Matthew; Heidrich, Wolfgang; Raskar, Ramesh

    2012-01-01

    Light fields are the multiview extension of stereo image pairs: a collection of images showing a 3D scene from slightly different perspectives. Depicting high-resolution light fields usually requires an excessively large display bandwidth; compressive light field displays are enabled by the codesign of optical elements and computational-processing algorithms. Rather than pursuing a direct "optical" solution (for example, adding one more pixel to support the emission of one additional light ray), compressive displays aim to create flexible optical systems that can synthesize a compressed target light field. In effect, each pixel emits a superposition of light rays. Through compression and tailored optical designs, fewer display pixels are necessary to emit a given light field than a direct optical solution would require.

  8. Reference Based Genome Compression

    CERN Document Server

    Chern, Bobbie; Manolakos, Alexandros; No, Albert; Venkat, Kartik; Weissman, Tsachy

    2012-01-01

    DNA sequencing technology has advanced to a point where storage is becoming the central bottleneck in the acquisition and mining of more data. Large amounts of data are vital for genomics research, and generic compression tools, while viable, cannot offer the same savings as approaches tuned to inherent biological properties. We propose an algorithm to compress a target genome given a known reference genome. The proposed algorithm first generates a mapping from the reference to the target genome, and then compresses this mapping with an entropy coder. As an illustration of the performance: applying our algorithm to James Watson's genome with hg18 as a reference, we are able to reduce the 2991 megabyte (MB) genome down to 6.99 MB, while Gzip compresses it to 834.8 MB.

  9. Compressive Optical Image Encryption

    Science.gov (United States)

    Li, Jun; Sheng Li, Jiao; Yang Pan, Yang; Li, Rong

    2015-01-01

    An optical image encryption technique based on compressive sensing using fully optical means has been proposed. An object image is first encrypted to a white-sense stationary noise pattern using a double random phase encoding (DRPE) method in a Mach-Zehnder interferometer. Then, the encrypted image is highly compressed to a signal using single-pixel compressive holographic imaging in the optical domain. At the receiving terminal, the encrypted image is reconstructed well via compressive sensing theory, and the original image can be decrypted with three reconstructed holograms and the correct keys. The numerical simulations show that the method is effective and suitable for optical image security transmission in future all-optical networks because of the ability of completely optical implementation and substantially smaller hologram data volume. PMID:25992946

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

    National Research Council Canada - National Science Library

    Mahmood Khosrowjerdi; Neda Zeraatkar

    2012-01-01

    There are many national and international ranking systems rank the universities and higher education institutions of the world, nationally or internationally, based on the same or different criteria...

  11. Compression of space for low visibility probes

    Directory of Open Access Journals (Sweden)

    Sabine eBorn

    2016-03-01

    Full Text Available Stimuli briefly flashed just before a saccade are perceived closer to the saccade target, a phenomenon known as perisaccadic compression of space (Ross, Morrone, & Burr, 1997. More recently, we have demonstrated that brief probes are attracted towards a visual reference when followed by a mask, even in the absence of saccades (Zimmermann, Born, Fink, & Cavanagh, 2014. Here, we ask whether spatial compression depends on the transient disruptions of the visual input stream caused by either a mask or a saccade. Both of these degrade the probe visibility but we show that low probe visibility alone causes compression in the absence of any disruption. In a first experiment, we varied the regions of the screen covered by a transient mask, including areas where no stimulus was presented and a condition without masking. In all conditions, we adjusted probe contrast to make the probe equally hard to detect. Compression effects were found in all conditions. To obtain compression without a mask, the probe had to be presented at much lower contrasts than with masking. Comparing mislocalizations at different probe detection rates across masking, saccades and low contrast conditions without mask or saccade, Experiment 2 confirmed this observation and showed a strong influence of probe contrast on compression. Finally, in Experiment 3, we found that compression decreased as probe duration increased both for masks and saccades although here we did find some evidence that factors other than simply visibility as we measured it contribute to compression. Our experiments suggest that compression reflects how the visual system localizes weak targets in the context of highly visible stimuli.

  12. Image Inpainting Algorithm Based on Low-Rank Approximation and Texture Direction

    Directory of Open Access Journals (Sweden)

    Jinjiang Li

    2014-01-01

    Full Text Available Existing image inpainting algorithm based on low-rank matrix approximation cannot be suitable for complex, large-scale, damaged texture image. An inpainting algorithm based on low-rank approximation and texture direction is proposed in the paper. At first, we decompose the image using low-rank approximation method. Then the area to be repaired is interpolated by level set algorithm, and we can reconstruct a new image by the boundary values of level set. In order to obtain a better restoration effect, we make iteration for low-rank decomposition and level set interpolation. Taking into account the impact of texture direction, we segment the texture and make low-rank decomposition at texture direction. Experimental results show that the new algorithm is suitable for texture recovery and maintaining the overall consistency of the structure, which can be used to repair large-scale damaged image.

  13. Deep Blind Compressed Sensing

    OpenAIRE

    Singh, Shikha; Singhal, Vanika; Majumdar, Angshul

    2016-01-01

    This work addresses the problem of extracting deeply learned features directly from compressive measurements. There has been no work in this area. Existing deep learning tools only give good results when applied on the full signal, that too usually after preprocessing. These techniques require the signal to be reconstructed first. In this work we show that by learning directly from the compressed domain, considerably better results can be obtained. This work extends the recently proposed fram...

  14. Cognitive Radios Exploiting Gray Spaces via Compressed Sensing

    Science.gov (United States)

    Wieruch, Dennis; Jung, Peter; Wirth, Thomas; Dekorsy, Armin; Haustein, Thomas

    2016-07-01

    We suggest an interweave cognitive radio system with a gray space detector, which is properly identifying a small fraction of unused resources within an active band of a primary user system like 3GPP LTE. Therefore, the gray space detector can cope with frequency fading holes and distinguish them from inactive resources. Different approaches of the gray space detector are investigated, the conventional reduced-rank least squares method as well as the compressed sensing-based orthogonal matching pursuit and basis pursuit denoising algorithm. In addition, the gray space detector is compared with the classical energy detector. Simulation results present the receiver operating characteristic at several SNRs and the detection performance over further aspects like base station system load for practical false alarm rates. The results show, that especially for practical false alarm rates the compressed sensing algorithm are more suitable than the classical energy detector and reduced-rank least squares approach.

  15. An Enhanced Static Data Compression Scheme Of Bengali Short Message

    CERN Document Server

    Arif, Abu Shamim Mohammod; Islam, Rashedul

    2009-01-01

    This paper concerns a modified approach of compressing Short Bengali Text Message for small devices. The prime objective of this research technique is to establish a low complexity compression scheme suitable for small devices having small memory and relatively lower processing speed. The basic aim is not to compress text of any size up to its maximum level without having any constraint on space and time, rather than the main target is to compress short messages up to an optimal level which needs minimum space, consume less time and the processor requirement is lower. We have implemented Character Masking, Dictionary Matching, Associative rule of data mining and Hyphenation algorithm for syllable based compression in hierarchical steps to achieve low complexity lossless compression of text message for any mobile devices. The scheme to choose the diagrams are performed on the basis of extensive statistical model and the static Huffman coding is done through the same context.

  16. Compressed Sensing in Astronomy

    Science.gov (United States)

    Bobin, Jérôme; Starck, Jean-Luc; Ottensamer, Roland

    2008-11-01

    Recent advances in signal processing have focused on the use of sparse representations in various applications. A new field of interest based on sparsity has recently emerged: compressed sensing. This theory is a new sampling framework that provides an alternative to the well-known Shannon sampling theory. In this paper, we investigate how compressed sensing (CS) can provide new insights into astronomical data compression. We first give a brief overview of the compressed sensing theory which provides very simple coding process with low computational cost, thus favoring its use for real-time applications often found onboard space mission. In practical situations, owing to particular observation strategies (for instance, raster scans) astronomical data are often redundant; in that context, we point out that a CS-based compression scheme is flexible enough to account for particular observational strategies. Indeed, we show also that CS provides a new fantastic way to handle multiple observations of the same field view, allowing us to recover low level details, which is impossible with standard compression methods. This kind of CS data fusion concept could lead to an elegant and effective way to solve the problem ESA is faced with, for the transmission to the earth of the data collected by PACS, one of the instruments onboard the Herschel spacecraft which will launched in late 2008/early 2009. We show that CS enables to recover data with a spatial resolution enhanced up to 30% with similar sensitivity compared to the averaging technique proposed by ESA.

  17. Cohesion in Computer Text Generation: Lexical Substitution.

    Science.gov (United States)

    1983-05-01

    can contain any information desired, the rules need not be strictly syntactic, but can reflect semantic and pragmatic information as well. A subset of...its antecedent. Otherwise, unintelligible text may be generated. Investigation into anaphora resolution has been performed in the pursuit of natural...syntactic, semantic, and pragmatic acceptance. The first item in the ranked list that passes these criteria is assumed to be the antecedent for the

  18. EFFICIENCY OF RANKED SET SAMPLING IN HORTICULTURAL SURVEYS

    Directory of Open Access Journals (Sweden)

    M Iqbal Jeelani

    2015-12-01

    Full Text Available DOI: 10.12957/cadest.2015.19114 Abstract In this paper, we explore the feasibility of using RSS (Ranked Set Sampling in improving the estimates of the population mean in comparison  to SRS (Simple Random Sampling in Horticultural research. We use an experience developed with a survey of apples in India. The numerical results suggest that RSS procedure results in a substantial reduction of standard errors, and  thus provides more efficient estimates than SRS, in the  specific Horticultural Survey studied, using the same sample size. Then it is recommended as an easy-to-use accurate method to management of this Horticulture problem. Key-words: Ranked Set Sampling, Simple Random Sampling, Standard Error, Accuracy.  

  19. Assessment criteria weight in ranking land consolidation projects

    Directory of Open Access Journals (Sweden)

    Lazić Jelena

    2015-01-01

    Full Text Available The initiation and implementation of land consolidation projects are a complex and serious job, which carries a large financial investments, so fair and objective selection of cadastral municipality in which is going to be performed land redistribution of agricultural land is very important. Application of criteria optimization in recent times is an unavoidable segment in all spheres of science and profession, and therefore in the initiation of land consolidation projects is done too. The subject of this paper is multiple- criteria COPRAS method, with emphasis on different ways of subjective and objective assessments of the weight of defined criteria. The aim of the research was to determine the effect of different ways of assessing the weight of the criteria for the final ranking of alternatives in the application of multi-criteria COPRAS methods for ranking cadastral municipalities in the City of Ruma.

  20. Ranking Water Transparency of Dutch Stock-Listed Companies

    Directory of Open Access Journals (Sweden)

    Marissa H. Linneman

    2015-04-01

    Full Text Available A growing world population, changing consumption patterns and climate change are affecting water demands, water scarcity and water quality worldwide, while at present, few companies are incorporating good water stewardship. In order to create awareness on this issue and provide an incentive for companies to improve the water performance in their operations and supply chain, a method for ranking companies based on their water transparency has been developed. The method consists of a checklist that can be completed on the basis of information from annual reports, sustainability reports and websites of companies. This is the first time a ranking of companies regarding water transparency has been carried out. Results show that there are large differences in transparency between and within sectors and that companies are reporting more about their operations than their supply chain.

  1. On Regression Estimators Using Extreme Ranked Set Samples

    Directory of Open Access Journals (Sweden)

    Hani M. Samawi

    2004-06-01

    Full Text Available Regression is used to estimate the population mean of the response variable, , in the two cases where the population mean of the concomitant (auxiliary variable, , is known and where it is unknown. In the latter case, a double sampling method is used to estimate the population mean of the concomitant variable. We invesitagate the performance of the two methods using extreme ranked set sampling (ERSS, as discussed by Samawi et al. (1996. Theoretical and Monte Carlo evaluation results as well as an illustration using actual data are presented. The results show that if the underlying joint distribution of and  is symmetric, then using ERSS to obtain regression estimates is more efficient than using ranked set sampling (RSS or  simple random sampling (SRS.

  2. A study on ranking ethical factors influencing customer loyalty

    Directory of Open Access Journals (Sweden)

    Mahmood Modiri

    2013-10-01

    Full Text Available Having loyal customer is the primary objective of any business owner since loyal customers purchase on regular basis, create sustainable growth and reduce risk of bankruptcy. During the past few years, many people argue that customer loyalty must be established through ethical values. In this paper, we present an empirical investigation to detect ethical factors influencing customer loyalty. The proposed study determines five criteria including customer repurchase, interest in brand, recommending brand to others, positive attitude toward brand and cognitive loyalty to brand. These criteria have been ranked using fuzzy analytical network process. The study determines 14 different ethical values, which may play essential role on customer loyalty and using VIKOR, different ethical values are ranked. The study indicates that welcoming customers is the most important factor followed by cheerfulness, on time delivery, being informative and having appropriate standards.

  3. Ranking Canadian oil and gas projects using TOPSIS

    Directory of Open Access Journals (Sweden)

    Seyed Jafar Sadjadi

    2017-08-01

    Full Text Available One of the primary concerns for investment in oil and gas projects is to have a comprehensive understanding on different issues associated with this industry. The industry is mainly influ-enced by the price of oil and gas and in some events, many production units have been forced to shut down solely because of low price of oil and gas. Environmental issues are other important factors, which may put pressure on Canada’s political affairs since the country has strong com-mitment to reduce green gas effect. In this paper, we introduce a multi-criteria decision making method, which helps us rank different projects in terms of investment. The proposed study con-siders different investment factors including net present value, rate of return, benefit-cost analy-sis and payback period along with the intensity of green gas effects for ranking the present oil and gas projects in Canada.

  4. An application of TOPSIS for ranking internet web browsers

    Directory of Open Access Journals (Sweden)

    Shahram Rostampour

    2012-07-01

    Full Text Available Web browser is one of the most important internet facilities for surfing the internet. A good web browser must incorporate literally tens of features such as integrated search engine, automatic updates, etc. Each year, ten web browsers are formally introduced as top best reviewers by some organizations. In this paper, we propose the implementation of TOPSIS technique to rank ten web browsers. The proposed model of this paper uses five criteria including speed, features, security, technical support and supported configurations. In terms of speed, Safari is the best web reviewer followed by Google Chrome and Internet Explorer while Opera is the best web reviewer when we look into 20 different features. We have also ranked these web browsers using all five categories together and the results indicate that Opera, Internet explorer, Firefox and Google Chrome are the best web browsers to be chosen.

  5. Nowcasting Mobile Games Ranking Using Web Search Query Data

    Directory of Open Access Journals (Sweden)

    Yoones A. Sekhavat

    2016-01-01

    Full Text Available In recent years, the Internet has become embedded into the purchasing decision of consumers. The purpose of this paper is to study whether the Internet behavior of users correlates with their actual behavior in computer games market. Rather than proposing the most accurate model for computer game sales, we aim to investigate to what extent web search query data can be exploited to nowcast (contraction of “now” and “forecasting” referring to techniques used to make short-term forecasts (predict the present status of the ranking of mobile games in the world. Google search query data is used for this purpose, since this data can provide a real-time view on the topics of interest. Various statistical techniques are used to show the effectiveness of using web search query data to nowcast mobile games ranking.

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

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

  8. Adaptive distributional extensions to DFR ranking

    DEFF Research Database (Denmark)

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

    2016-01-01

    Divergence From Randomness (DFR) ranking models assume that informative terms are distributed in a corpus differently than non-informative terms. Different statistical models (e.g. Poisson, geometric) are used to model the distribution of non-informative terms, producing different DFR models....... An informative term is then detected by measuring the divergence of its distribution from the distribution of non-informative terms. However, there is little empirical evidence that the distributions of non-informative terms used in DFR actually fit current datasets. Practically this risks providing a poor...... separation between informative and non-informative terms, thus compromising the discriminative power of the ranking model. We present a novel extension to DFR, which first detects the best-fitting distribution of non-informative terms in a collection, and then adapts the ranking computation to this best...

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

    Directory of Open Access Journals (Sweden)

    pijitra jomsri

    2015-11-01

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

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

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

    Science.gov (United States)

    Thacker, Lloyd

    2008-01-01

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

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

  13. Ranking candidate genes in rat models of type 2 diabetes

    Directory of Open Access Journals (Sweden)

    Ståhl Fredrik

    2009-07-01

    Full Text Available Abstract Background Rat models are frequently used to find genomic regions that contribute to complex diseases, so called quantitative trait loci (QTLs. In general, the genomic regions found to be associated with a quantitative trait are rather large, covering hundreds of genes. To help selecting appropriate candidate genes from QTLs associated with type 2 diabetes models in rat, we have developed a web tool called Candidate Gene Capture (CGC, specifically adopted for this disorder. Methods CGC combines diabetes-related genomic regions in rat with rat/human homology data, textual descriptions of gene effects and an array of 789 keywords. Each keyword is assigned values that reflect its co-occurrence with 24 different reference terms describing sub-phenotypes of type 2 diabetes (for example "insulin resistance". The genes are then ranked based on the occurrences of keywords in the describing texts. Results CGC includes QTLs from type 2 diabetes models in rat. When comparing gene rankings from CGC based on one sub-phenotype, with manual gene ratings for four QTLs, very similar results were obtained. In total, 24 different sub-phenotypes are available as reference terms in the application and based on differences in gene ranking, they fall into separate clusters. Conclusion The very good agreement between the CGC gene ranking and the manual rating confirms that CGC is as a reliable tool for interpreting textual information. This, together with the possibility to select many different sub-phenotypes, makes CGC a versatile tool for finding candidate genes. CGC is publicly available at http://ratmap.org/CGC.

  14. Ranking Entities in Networks via Lefschetz Duality

    DEFF Research Database (Denmark)

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

    2014-01-01

    In the theory of communication it is essential that agents are able to exchange information. This fact is closely related to the study of connected spaces in topology. A communication network may be modelled as a topological space such that agents can communicate if and only if they belong...... 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...

  15. XML and Free Text.

    Science.gov (United States)

    Riggs, Ken Roger

    2002-01-01

    Discusses problems with marking free text, text that is either natural language or semigrammatical but unstructured, that prevent well-formed XML from marking text for readily available meaning. Proposes a solution to mark meaning in free text that is consistent with the intended simplicity of XML versus SGML. (Author/LRW)

  16. Contextual Text Mining

    Science.gov (United States)

    Mei, Qiaozhu

    2009-01-01

    With the dramatic growth of text information, there is an increasing need for powerful text mining systems that can automatically discover useful knowledge from text. Text is generally associated with all kinds of contextual information. Those contexts can be explicit, such as the time and the location where a blog article is written, and the…

  17. Memory Compression Techniques for Network Address Management in MPI

    Energy Technology Data Exchange (ETDEWEB)

    Guo, Yanfei; Archer, Charles J.; Blocksome, Michael; Parker, Scott; Bland, Wesley; Raffenetti, Ken; Balaji, Pavan

    2017-05-29

    MPI allows applications to treat processes as a logical collection of integer ranks for each MPI communicator, while internally translating these logical ranks into actual network addresses. In current MPI implementations the management and lookup of such network addresses use memory sizes that are proportional to the number of processes in each communicator. In this paper, we propose a new mechanism, called AV-Rankmap, for managing such translation. AV-Rankmap takes advantage of logical patterns in rank-address mapping that most applications naturally tend to have, and it exploits the fact that some parts of network address structures are naturally more performance critical than others. It uses this information to compress the memory used for network address management. We demonstrate that AV-Rankmap can achieve performance similar to or better than that of other MPI implementations while using significantly less memory.

  18. E-text

    DEFF Research Database (Denmark)

    Finnemann, Niels Ole

    2018-01-01

    the print medium, rather than written text or speech. In late 20th century, the notion of text was subject to increasing criticism as in the question raised within literary text theory: is there a text in this class? At the same time, the notion was expanded by including extra linguistic sign modalities...... (images, videos). Thus, a basic question is this: should electronic text be included in the expanded notion of text as a new digital sign modality added to the repertoire of modalities, or should it be included as a sign modality, which is both an independent modality and a container in which other...

  19. A Class of Coning Algorithms Based on a Half-Compressed Structure

    Directory of Open Access Journals (Sweden)

    Chuanye Tang

    2014-08-01

    Full Text Available Aiming to advance the coning algorithm performance of strapdown inertial navigation systems, a new half-compressed coning correction structure is presented. The half-compressed algorithm structure is analytically proven to be equivalent to the traditional compressed structure under coning environments. The half-compressed algorithm coefficients allow direct configuration from traditional compressed algorithm coefficients. A type of algorithm error model is defined for coning algorithm performance evaluation under maneuver environment conditions. Like previous uncompressed algorithms, the half-compressed algorithm has improved maneuver accuracy and retained coning accuracy compared with its corresponding compressed algorithm. Compared with prior uncompressed algorithms, the formula for the new algorithm coefficients is simpler.

  20. SOUTH AFRICAN ARMY RANKS AND INSIGNIA

    African Journals Online (AJOL)

    major, cap- tain, lieutenant;. Other Ranks : Warrant officer, staff sergeant, sergeant, corporal, lance-cor- poral, private.' We apparently had no need for second lieuten- ants at that time, and they were introduced only .... Army warrant officers can also hold the cmmon serv- ice posts of Sergeant-Major of Special Forces.

  1. Kinesiology Faculty Citations across Academic Rank

    Science.gov (United States)

    Knudson, Duane

    2015-01-01

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

  2. Ranking Workplace Competencies: Student and Graduate Perceptions.

    Science.gov (United States)

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

    2002-01-01

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

  3. Subject Gateway Sites and Search Engine Ranking.

    Science.gov (United States)

    Thelwall, Mike

    2002-01-01

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

  4. Ranking related entities: components and analyses

    NARCIS (Netherlands)

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

    2010-01-01

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

  5. Low-rank coal oil agglomeration

    Science.gov (United States)

    Knudson, C.L.; Timpe, R.C.

    1991-07-16

    A low-rank coal oil agglomeration process is described. High mineral content, a high ash content subbituminous coals are effectively agglomerated with a bridging oil which is partially water soluble and capable of entering the pore structure, and is usually coal-derived.

  6. An evaluation and critique of current rankings

    NARCIS (Netherlands)

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

    2012-01-01

    This chapter raises the question of whether university league tables deliver relevant information to one of their key target groups – students. It examines the inherent biases and weaknesses in the methodologies of the major rankings and argues that the concentration on a single indicator of

  7. World University Ranking Methodologies: Stability and Variability

    Science.gov (United States)

    Fidler, Brian; Parsons, Christine

    2008-01-01

    There has been a steady growth in the number of national university league tables over the last 25 years. By contrast, "World University Rankings" are a more recent development and have received little serious academic scrutiny in peer-reviewed publications. Few researchers have evaluated the sources of data and the statistical…

  8. Alternative Class Ranks Using Z-Scores

    Science.gov (United States)

    Brown, Philip H.; Van Niel, Nicholas

    2012-01-01

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

  9. Statistical inference of Minimum Rank Factor Analysis

    NARCIS (Netherlands)

    Shapiro, A; Ten Berge, JMF

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

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

    Science.gov (United States)

    Okulicz-Kozaryn, Adam

    2013-01-01

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

  11. Matrices with high completely positive semidefinite rank

    NARCIS (Netherlands)

    de Laat, David; Gribling, Sander; Laurent, Monique

    2017-01-01

    A real symmetric matrix M is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size d. The smallest such d is called the (complex) completely positive semidefinite rank of M , and it is an open question whether there exists an

  12. Ranking health between countries in international comparisons

    DEFF Research Database (Denmark)

    Brønnum-Hansen, Henrik

    2014-01-01

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

  13. Comparing survival curves using rank tests

    NARCIS (Netherlands)

    Albers, Willem/Wim

    1990-01-01

    Survival times of patients can be compared using rank tests in various experimental setups, including the two-sample case and the case of paired data. Attention is focussed on two frequently occurring complications in medical applications: censoring and tail alternatives. A review is given of the

  14. Smooth rank one perturbations of selfadjoint operators

    NARCIS (Netherlands)

    Hassi, Seppo; Snoo, H.S.V. de; Willemsma, A.D.I.

    Let A be a selfadjoint operator in a Hilbert space aleph with inner product [.,.]. The rank one perturbations of A have the form A+tau [.,omega]omega, tau epsilon R, for some element omega epsilon aleph. In this paper we consider smooth perturbations, i.e. we consider omega epsilon dom \\A\\(k/2) for

  15. Primate Innovation: Sex, Age and Social Rank

    NARCIS (Netherlands)

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

    2001-01-01

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

  16. An algorithm for ranking assignments using reoptimization

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  17. Ouderdom, omvang en citatiescores: rankings nader bekeken

    NARCIS (Netherlands)

    van Rooij, Jules

    2017-01-01

    By comparing the Top-300 lists of four global university rankings (ARWU, THE, QS, Leiden), three hypotheses are tested: 1) position correlates with size in the ARWU more than in the THE and QS; 2) given their strong dependency on reputation scores, position will be correlated more with a

  18. Returns to Tenure: Time or Rank?

    DEFF Research Database (Denmark)

    Buhai, Ioan Sebastian

    -specific investment, efficiency-wages or adverse-selection models. However, rent extracting arguments as suggested by the theory of internal labor markets, indicate that the relative position of the worker in the seniority hierarchy of the firm, her 'seniority rank', may also explain part of the observed returns...

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

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

  1. World University Rankings: Take with a Large Pinch of Salt

    Science.gov (United States)

    Cheng, Soh Kay

    2011-01-01

    Equating the unequal is misleading, and this happens consistently in comparing rankings from different university ranking systems, as the NUT saga shows. This article illustrates the problem by analyzing the 2011 rankings of the top 100 universities in the AWUR, QSWUR and THEWUR ranking results. It also discusses the reasons why the rankings…

  2. Generalized Reduced Rank Tests using the Singular Value Decomposition

    NARCIS (Netherlands)

    Kleibergen, F.R.; Paap, R.

    2006-01-01

    We propose a novel statistic to test the rank of a matrix. The rank statistic overcomes deficiencies of existing rank statistics, like: a Kronecker covariance matrix for the canonical correlation rank statistic of Anderson [Annals of Mathematical Statistics (1951), 22, 327-351] sensitivity to the

  3. Some upper and lower bounds on PSD-rank

    NARCIS (Netherlands)

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

    2014-01-01

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

  4. Some upper and lower bounds on PSD-rank

    NARCIS (Netherlands)

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

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

  5. Robust Tracking with Discriminative Ranking Middle-Level Patches

    Directory of Open Access Journals (Sweden)

    Hong Liu

    2014-04-01

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

  6. A Simulation Integrated Investment Project Ranking and Selection Approach

    Directory of Open Access Journals (Sweden)

    Ozgur YALCINKAYA

    2012-07-01

    Full Text Available Enterprises are confronted with several project alternatives that they assume to gain revenue in the future, but their own economical resources are limited to carry out all alternatives. Therefore, a decision process arises to prioritize and select among alternatives according to the predetermined goals and criteria to reach the maximum utilization. On the other hand, in project evaluation, the values of project parameters are often assumed to be known with complete certainty. However, project parameters normally change during a life cycle of the project, and it is necessary to consider uncertainty and risk phenomena while evaluating projects. Simulation-based project evaluation approaches enable to make more reliable investment decision since they permit to include future uncertainty and risk in analysis process. In this article, a novel simulation-based optimal decision approach is proposed for evaluating and comparing investment projects under uncertain and/or risky environments. The phases of the proposed approach are; (a developing the effectiveness measure formulation of a project, (b identifying and checking all controllable project parameters that affect the measure, (c developing simulation model for the measure, and (d performing the project ranking and selection procedures in order to rank and select the projects. Three ranking and selection procedures, previously used for comparing performances of the different production/service systems, are embedded in the proposed approach.

  7. Correlation of Cognitive Abilities Level, Age and Ranks in Judo

    Directory of Open Access Journals (Sweden)

    Kraček Stanislav

    2016-11-01

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

  8. University Ranking, an Important Quality-Assurance Tool

    Directory of Open Access Journals (Sweden)

    Crina Rădulescu

    2012-05-01

    Full Text Available “University Rankings” - or “League Tables”, as they are known in the United Kingdom – have in ashort period of time become an important feature in policy-making and practice in higher education. They arenow a global phenomenon serving different purposes for different and varied audiences. Even if they are notnecessarily universally appreciated, there is an increasing understanding that they have become the “third armof the quality-assurance tool, together with accreditation, government regulation and licensing" and they areclearly here to stay. Indisputably university ranking has changed the way higher education institutions andtheir activities are being presented, perceived and assessed at the institutional, local, national and internationallevels.In our research we will try to answer some questions concerning this topic: is university ranking aninflexible tool, which favors traditional universities, with resources and experience?; what types ofperformance indicators, procedure and ethical considerations should be included in a conceptual frameworkor typology for higher education ranking systems?

  9. Ranks of a Constrained Hermitian Matrix Expression with Applications

    Directory of Open Access Journals (Sweden)

    Shao-Wen Yu

    2013-01-01

    Full Text Available We establish the formulas of the maximal and minimal ranks of the quaternion Hermitian matrix expression C4−A4XA4∗ where X is a Hermitian solution to quaternion matrix equations A1X=C1, XB1=C2, and A3XA3*=C3. As applications, we give a new necessary and sufficient condition for the existence of Hermitian solution to the system of matrix equations A1X=C1, XB1=C2, A3XA3*=C3, and A4XA4*=C4, which was investigated by Wang and Wu, 2010, by rank equalities. In addition, extremal ranks of the generalized Hermitian Schur complement C4−A4A3~A4∗ with respect to a Hermitian g-inverse A3~ of A3, which is a common solution to quaternion matrix equations A1X=C1 and XB1=C2, are also considered.

  10. Die Rolle von RANK-Ligand und Osteoprotegerin bei Osteoporose

    Directory of Open Access Journals (Sweden)

    Hofbauer LC

    2004-01-01

    Full Text Available Receptor activator of nuclear factor (NF- κB ligand (RANKL, sein zellulärer Rezeptor RANK und der Decoy-Rezeptor Osteoprotegerin (OPG stellen ein essentielles Zytokinsystem für die Zellbiologie von Osteoklasten dar. Verschiedene Untersuchungen belegen die Bedeutung von Störungen des OPG/RANKL/RANK-Systems bei der Pathogenese metabolischer Knochenerkrankungen. In dieser Arbeit werden die wichtigsten Störungen des OPG/RANKL/RANK-Systems bei verschiedenen Osteoporoseformen dargestellt. Östrogenrezeptor- (ER- Agonisten wie 17 β-Östradiol, Raloxifen und Genistein stimulieren die osteoblastäre Produktion von OPG durch Aktivierung von ER- α in vitro, während Lymphozyten von Patientinnen mit Östrogenmangel RANKL überexprimieren. Die parenterale Gabe von OPG vermag den mit Östrogenmangel assoziierten Knochenverlust im Tiermodell und in einer kleineren klinischen Studie zu verhindern. Glukokortikoide und Immunsuppressiva steigern gleichzeitig die RANKL-Expression und hemmen die OPG-Produktion in osteoblastären Zellen in vitro. Glukokortikoide sind auch in vivo imstande, die OPG-Serumspiegel deutlich zu reduzieren. Dagegen hemmen biomechanische Reize in vitro die RANKL-Produktion und steigern die OPG-Produktion. Ein Fehlen dieser biomechanischen Reize bei längerer Immobilisierung kann daher den RANKL/OPG-Quotienten steigern, während die tierexperimentelle Immobilisierungs-Osteoporose durch die parenterale Gabe von OPG gemildert werden kann.

  11. Ranking competitors using degree-neutralized random walks.

    Directory of Open Access Journals (Sweden)

    Seungkyu Shin

    Full Text Available Competition is ubiquitous in many complex biological, social, and technological systems, playing an integral role in the evolutionary dynamics of the systems. It is often useful to determine the dominance hierarchy or the rankings of the components of the system that compete for survival and success based on the outcomes of the competitions between them. Here we propose a ranking method based on the random walk on the network representing the competitors as nodes and competitions as directed edges with asymmetric weights. We use the edge weights and node degrees to define the gradient on each edge that guides the random walker towards the weaker (or the stronger node, which enables us to interpret the steady-state occupancy as the measure of the node's weakness (or strength that is free of unwarranted degree-induced bias. We apply our method to two real-world competition networks and explore the issues of ranking stabilization and prediction accuracy, finding that our method outperforms other methods including the baseline win-loss differential method in sparse networks.

  12. Searching for text documents

    NARCIS (Netherlands)

    Hiemstra, Djoerd; Blanken, Henk; de Vries, A.P.; Blok, H.E.; Feng, L.

    2007-01-01

    Many documents contain, besides text, also images, tables, and so on. This chapter concentrates on the text part only. Traditionally, systems handling text documents are called information storage and retrieval systems. Before the World-Wide Web emerged, such systems were almost exclusively used by

  13. Dynamic compression nail: A preliminary report

    Directory of Open Access Journals (Sweden)

    Gupta Ajay

    2001-10-01

    Full Text Available Abstract Background Interlocking nailing, which has become the method of choice for treating fractures of the femoral and tibial shafts, still lacks ability to provide the important contact-compression at the fracture. An intramedullary compression nail is described, which provides axial compression at the fracture site with tightening of the specially designed distal interlocking screw. This uses the same principle as dynamic compression plating. Methods The study included 11 femoral and tibial nailings performed for various clinical applications such as acute fractures, non-unions and malunions. Results All the fractures attained radiological union, with good skeletal continuity across the fracture, within an average time of 13 weeks in fresh fractures and 18 weeks in non-unions. Conclusions Active compression through intramedullary compression nailing has great utility for treating non-unions where it provides greater degree of impaction of its irregular ends. This may prove greatly advantageous to the fracture union through increased stability and the osteogenic potential, particularly when utilized in combination with the small diameter unreamed nails.

  14. Biology of RANK, RANKL, and osteoprotegerin

    Science.gov (United States)

    Boyce, Brendan F; Xing, Lianping

    2007-01-01

    The discovery of the receptor activator of nuclear factor-κB ligand (RANKL)/RANK/osteoprotegerin (OPG) system and its role in the regulation of bone resorption exemplifies how both serendipity and a logic-based approach can identify factors that regulate cell function. Before this discovery in the mid to late 1990s, it had long been recognized that osteoclast formation was regulated by factors expressed by osteoblast/stromal cells, but it had not been anticipated that members of the tumor necrosis factor superfamily of ligands and receptors would be involved or that the factors involved would have extensive functions beyond bone remodeling. RANKL/RANK signaling regulates the formation of multinucleated osteoclasts from their precursors as well as their activation and survival in normal bone remodeling and in a variety of pathologic conditions. OPG protects the skeleton from excessive bone resorption by binding to RANKL and preventing it from binding to its receptor, RANK. Thus, RANKL/OPG ratio is an important determinant of bone mass and skeletal integrity. Genetic studies in mice indicate that RANKL/RANK signaling is also required for lymph node formation and mammary gland lactational hyperplasia, and that OPG also protects arteries from medial calcification. Thus, these tumor necrosis factor superfamily members have important functions outside bone. Although our understanding of the mechanisms whereby they regulate osteoclast formation has advanced rapidly during the past 10 years, many questions remain about their roles in health and disease. Here we review our current understanding of the role of the RANKL/RANK/OPG system in bone and other tissues. PMID:17634140

  15. Design of an Interface for Page Rank Calculation using Web Link Attributes Information

    Directory of Open Access Journals (Sweden)

    Jeyalatha SIVARAMAKRISHNAN

    2010-01-01

    Full Text Available This paper deals with the Web Structure Mining and the different Structure Mining Algorithms like Page Rank, HITS, Trust Rank and Sel-HITS. The functioning of these algorithms are discussed. An incremental algorithm for calculation of PageRank using an interface has been formulated. This algorithm makes use of Web Link Attributes Information as key parameters and has been implemented using Visibility and Position of a Link. The application of Web Structure Mining Algorithm in an Academic Search Application has been discussed. The present work can be a useful input to Web Users, Faculty, Students and Web Administrators in a University Environment.

  16. A proof that the maximal rank for plane quartics is seven

    Directory of Open Access Journals (Sweden)

    Alessandro De Paris

    2015-12-01

    Full Text Available At the time of writing, the general problem of finding the maximal Waring rank for homogeneous polynomials of fixed degree and number of variables (or, equivalently, the maximal symmetric rank for symmetric tensors of fixed order and in fixed dimension is still unsolved. To our knowledge, the answer for ternary quartics is not widely known and can only be found among the results of a master's thesis by Johannes Kleppe at the University of Oslo (1999. In the present work we give a (direct proof that the maximal rank for plane quartics is seven, following the elementary geometric idea of splitting power sum decompositions along three suitable lines.

  17. Mathematical theory of compressible fluid flow

    CERN Document Server

    von Mises, Richard

    2004-01-01

    A pioneer in the fields of statistics and probability theory, Richard von Mises (1883-1953) made notable advances in boundary-layer-flow theory and airfoil design. This text on compressible flow, unfinished upon his sudden death, was subsequently completed in accordance with his plans, and von Mises' first three chapters were augmented with a survey of the theory of steady plane flow. Suitable as a text for advanced undergraduate and graduate students - as well as a reference for professionals - Mathematical Theory of Compressible Fluid Flow examines the fundamentals of high-speed flows, with

  18. Chitin and Chitosan as Direct Compression Excipients in Pharmaceutical Applications

    Directory of Open Access Journals (Sweden)

    Adnan A. Badwan

    2015-03-01

    Full Text Available Despite the numerous uses of chitin and chitosan as new functional materials of high potential in various fields, they are still behind several directly compressible excipients already dominating pharmaceutical applications. There are, however, new attempts to exploit chitin and chitosan in co-processing techniques that provide a product with potential to act as a direct compression (DC excipient. This review outlines the compression properties of chitin and chitosan in the context of DC pharmaceutical applications.

  19. DSP Implementation of Image Compression by Multiresolutional Analysis

    Directory of Open Access Journals (Sweden)

    K. Vlcek

    1998-04-01

    Full Text Available Wavelet algorithms allow considerably higher compression rates compared to Fourier transform based methods. The most important field of applications of wavelet transforms is that the image is captured in few wavelet coefficients. The successful applications in compression of image or in series of images in both the space and the time dimensions. Compression algorithms exploit the multi-scale nature of the wavelet transform.

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

    Science.gov (United States)

    The RANKED_OAS are all the Conservation Opportunity Areas identified by MoRAP that have subsequently been ranked by patch size, landform representation, and the targeted land cover class (highest rank for conservation management = 1 [LFRANK_NOR]). The OAs designate areas with potential for forest or grassland conservation because they are areas of natural or semi-natural land cover that are at least 75 meters away from roads and away from patch edges. The OAs were modeled by creating distance grids using the National Land Cover Database and the Census Bureau's TIGER roads files.

  1. Experimental quantum compressed sensing for a seven-qubit system

    Science.gov (United States)

    Riofrío, C. A.; Gross, D.; Flammia, S. T.; Monz, T.; Nigg, D.; Blatt, R.; Eisert, J.

    2017-05-01

    Well-controlled quantum devices with their increasing system size face a new roadblock hindering further development of quantum technologies. The effort of quantum tomography--the reconstruction of states and processes of a quantum device--scales unfavourably: state-of-the-art systems can no longer be characterized. Quantum compressed sensing mitigates this problem by reconstructing states from incomplete data. Here we present an experimental implementation of compressed tomography of a seven-qubit system--a topological colour code prepared in a trapped ion architecture. We are in the highly incomplete--127 Pauli basis measurement settings--and highly noisy--100 repetitions each--regime. Originally, compressed sensing was advocated for states with few non-zero eigenvalues. We argue that low-rank estimates are appropriate in general since statistical noise enables reliable reconstruction of only the leading eigenvectors. The remaining eigenvectors behave consistently with a random-matrix model that carries no information about the true state.

  2. UNIVERSITY RANKINGS BY COST OF LIVING ADJUSTED FACULTY COMPENSATION

    OpenAIRE

    Terrance Jalbert; Mercedes Jalbert; Karla Hayashi

    2010-01-01

    In this paper we rank 574 universities based on compensation paid to their faculty. The analysis examines universities both on a raw basis and on a cost of living adjusted basis. Rankings based on salary data and benefit data are presented. In addition rankings based on total compensation are presented. Separate rankings are provided for universities offering different degrees. The results indicate that rankings of universities based on raw and cost of living adjusted data are markedly differ...

  3. Anisotropic Concrete Compressive Strength

    DEFF Research Database (Denmark)

    Gustenhoff Hansen, Søren; Jørgensen, Henrik Brøner; Hoang, Linh Cao

    2017-01-01

    When the load carrying capacity of existing concrete structures is (re-)assessed it is often based on compressive strength of cores drilled out from the structure. Existing studies show that the core compressive strength is anisotropic; i.e. it depends on whether the cores are drilled parallel...... correlation to the curing time. The experiments show no correlation between the anisotropy and the curing time and a small strength difference between the two drilling directions. The literature shows variations on which drilling direction that is strongest. Based on a Monto Carlo simulation of the expected...

  4. Vocabulary Constraint on Texts

    Directory of Open Access Journals (Sweden)

    C. Sutarsyah

    2008-01-01

    Full Text Available This case study was carried out in the English Education Department of State University of Malang. The aim of the study was to identify and describe the vocabulary in the reading text and to seek if the text is useful for reading skill development. A descriptive qualitative design was applied to obtain the data. For this purpose, some available computer programs were used to find the description of vocabulary in the texts. It was found that the 20 texts containing 7,945 words are dominated by low frequency words which account for 16.97% of the words in the texts. The high frequency words occurring in the texts were dominated by function words. In the case of word levels, it was found that the texts have very limited number of words from GSL (General Service List of English Words (West, 1953. The proportion of the first 1,000 words of GSL only accounts for 44.6%. The data also show that the texts contain too large proportion of words which are not in the three levels (the first 2,000 and UWL. These words account for 26.44% of the running words in the texts.  It is believed that the constraints are due to the selection of the texts which are made of a series of short-unrelated texts. This kind of text is subject to the accumulation of low frequency words especially those of content words and limited of words from GSL. It could also defeat the development of students' reading skills and vocabulary enrichment.

  5. The Vicissitudes of Text

    Directory of Open Access Journals (Sweden)

    Jonathan CULLER

    2003-06-01

    Full Text Available The concept of text, which has been central to literary studies, has undergone many mutations, as it has traveled from the work of classical philologists, for whom it was and is the object of a powerful disciplinary formation, to postmodern theorists of the text, for whom, the concept might be summed up by the title of a fine book by John Mowatt: Text: the Genealogy of an Antidisciplinary Object. Of course, the interesting thing about a travelling concept is not that it travels — travelers, t...

  6. Instant Sublime Text starter

    CERN Document Server

    Haughee, Eric

    2013-01-01

    A starter which teaches the basic tasks to be performed with Sublime Text with the necessary practical examples and screenshots. This book requires only basic knowledge of the Internet and basic familiarity with any one of the three major operating systems, Windows, Linux, or Mac OS X. However, as Sublime Text 2 is primarily a text editor for writing software, many of the topics discussed will be specifically relevant to software development. That being said, the Sublime Text 2 Starter is also suitable for someone without a programming background who may be looking to learn one of the tools of

  7. E-text

    DEFF Research Database (Denmark)

    Finnemann, Niels Ole

    2018-01-01

    the print medium, rather than written text or speech. In late 20th century, the notion of text was subject to increasing criticism as in the question raised within literary text theory: is there a text in this class? At the same time, the notion was expanded by including extra linguistic sign modalities....... This wider notion would include, for instance, all sorts of scanning results, whether of the outer cosmos or the inner geographies of our bodies, and of digital traces of other processes in between these (machine readings included). Since alphabets, like the genetic alphabet, and all sorts of images may...

  8. The Extrapolation-Accelerated Multilevel Aggregation Method in PageRank Computation

    Directory of Open Access Journals (Sweden)

    Bing-Yuan Pu

    2013-01-01

    Full Text Available An accelerated multilevel aggregation method is presented for calculating the stationary probability vector of an irreducible stochastic matrix in PageRank computation, where the vector extrapolation method is its accelerator. We show how to periodically combine the extrapolation method together with the multilevel aggregation method on the finest level for speeding up the PageRank computation. Detailed numerical results are given to illustrate the behavior of this method, and comparisons with the typical methods are also made.

  9. MONITORING THE PROCESS MEAN BASED ON QUALITY CONTROL CHARTS USING ON FOLDED RANKED SET SAMPLING

    Directory of Open Access Journals (Sweden)

    Amjad Al-Nasser

    2013-02-01

    Full Text Available In this paper, we propose a new quality control chart for the sample mean based on the folded ranked set sampling (FRSS method. The new charts are compared with the classical control charts using simple random sampling (SRS and ranked set sampling (RSS. A simulation study shows that the FRSS control charts have smaller average run length (ARL compared with their counterpart charts using SRS and RSS.

  10. Kriging for Simulation Metamodeling: Experimental Design, Reduced Rank Kriging, and Omni-Rank Kriging

    Science.gov (United States)

    Hosking, Michael Robert

    This dissertation improves an analyst's use of simulation by offering improvements in the utilization of kriging metamodels. There are three main contributions. First an analysis is performed of what comprises good experimental designs for practical (non-toy) problems when using a kriging metamodel. Second is an explanation and demonstration of how reduced rank decompositions can improve the performance of kriging, now referred to as reduced rank kriging. Third is the development of an extension of reduced rank kriging which solves an open question regarding the usage of reduced rank kriging in practice. This extension is called omni-rank kriging. Finally these results are demonstrated on two case studies. The first contribution focuses on experimental design. Sequential designs are generally known to be more efficient than "one shot" designs. However, sequential designs require some sort of pilot design from which the sequential stage can be based. We seek to find good initial designs for these pilot studies, as well as designs which will be effective if there is no following sequential stage. We test a wide variety of designs over a small set of test-bed problems. Our findings indicate that analysts should take advantage of any prior information they have about their problem's shape and/or their goals in metamodeling. In the event of a total lack of information we find that Latin hypercube designs are robust default choices. Our work is most distinguished by its attention to the higher levels of dimensionality. The second contribution introduces and explains an alternative method for kriging when there is noise in the data, which we call reduced rank kriging. Reduced rank kriging is based on using a reduced rank decomposition which artificially smoothes the kriging weights similar to a nugget effect. Our primary focus will be showing how the reduced rank decomposition propagates through kriging empirically. In addition, we show further evidence for our

  11. Pulling Rank: Military Rank Affects Hormone Levels and Fairness in an Allocation Experiment.

    Science.gov (United States)

    Siart, Benjamin; Pflüger, Lena S; Wallner, Bernard

    2016-01-01

    Status within social hierarchies has great effects on the lives of socially organized mammals. Its effects on human behavior and related physiology, however, is relatively little studied. The present study investigated the impact of military rank on fairness and behavior in relation to salivary cortisol (C) and testosterone (T) levels in male soldiers. For this purpose 180 members of the Austrian Armed Forces belonging to two distinct rank groups participated in two variations of a computer-based guard duty allocation experiment. The rank groups were (1) warrant officers (high rank, HR) and (2) enlisted men (low rank, LR). One soldier from each rank group participated in every experiment. At the beginning of the experiment, one participant was assigned to start standing guard and the other participant at rest. The participant who started at rest could choose if and when to relieve his fellow soldier and therefore had control over the experiment. In order to trigger perception of unfair behavior, an additional experiment was conducted which was manipulated by the experimenter. In the manipulated version both soldiers started in the standing guard position and were never relieved, believing that their opponent was at rest, not relieving them. Our aim was to test whether unfair behavior causes a physiological reaction. Saliva samples for hormone analysis were collected at regular intervals throughout the experiment. We found that in the un-manipulated setup high-ranking soldiers spent less time standing guard than lower ranking individuals. Rank was a significant predictor for C but not for T levels during the experiment. C levels in the HR group were higher than in the LR group. C levels were also elevated in the manipulated experiment compared to the un-manipulated experiment, especially in LR. We assume that the elevated C levels in HR were caused by HR feeling their status challenged by the situation of having to negotiate with an individual of lower military rank

  12. Systematic text condensation

    DEFF Research Database (Denmark)

    Malterud, Kirsti

    2012-01-01

    To present background, principles, and procedures for a strategy for qualitative analysis called systematic text condensation and discuss this approach compared with related strategies.......To present background, principles, and procedures for a strategy for qualitative analysis called systematic text condensation and discuss this approach compared with related strategies....

  13. Linguistics in Text Interpretation

    DEFF Research Database (Denmark)

    Togeby, Ole

    2011-01-01

    A model for how text interpretation proceeds from what is pronounced, through what is said to what is comunicated, and definition of the concepts 'presupposition' and 'implicature'.......A model for how text interpretation proceeds from what is pronounced, through what is said to what is comunicated, and definition of the concepts 'presupposition' and 'implicature'....

  14. YORUBA, INTERMEDIATE TEXTS.

    Science.gov (United States)

    MCCLURE, H. DAVID; OYEWALE, JOHN O.

    THIS COURSE IS BASED ON A SERIES OF BRIEF MONOLOGUES RECORDED BY A WESTERN-EDUCATED NATIVE SPEAKER OF YORUBA FROM THE OYO AREA. THE TAPES CONSTITUTE THE CENTRAL PART OF THE COURSE, WITH THE TEXT INTENDED AS SUPPLEMENTARY AND AUXILIARY MATERIAL. THE TEXT TOPICS WERE CHOSEN FOR THEIR SPECIAL RELEVANCE TO PEACE CORPS VOLUNTEERS WHO EXPECT TO USE…

  15. Making Sense of Texts

    Science.gov (United States)

    Harper, Rebecca G.

    2014-01-01

    This article addresses the triadic nature regarding meaning construction of texts. Grounded in Rosenblatt's (1995; 1998; 2004) Transactional Theory, research conducted in an undergraduate Language Arts curriculum course revealed that when presented with unfamiliar texts, students used prior experiences, social interactions, and literary strategies…

  16. Approximate String Matching with Compressed Indexes

    Directory of Open Access Journals (Sweden)

    Pedro Morales

    2009-09-01

    Full Text Available A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed indexes, there has not been much progress on functionalities beyond the basic exact search. In this paper we focus on indexed approximate string matching (ASM, which is of great interest, say, in bioinformatics. We study ASM algorithms for Lempel-Ziv compressed indexes and for compressed suffix trees/arrays. Most compressed self-indexes belong to one of these classes. We start by adapting the classical method of partitioning into exact search to self-indexes, and optimize it over a representative of either class of self-index. Then, we show that a Lempel- Ziv index can be seen as an extension of the classical q-samples index. We give new insights on this type of index, which can be of independent interest, and then apply them to a Lempel- Ziv index. Finally, we improve hierarchical verification, a successful technique for sequential searching, so as to extend the matches of pattern pieces to the left or right. Most compressed suffix trees/arrays support the required bidirectionality, thus enabling the implementation of the improved technique. In turn, the improved verification largely reduces the accesses to the text, which are expensive in self-indexes. We show experimentally that our algorithms are competitive and provide useful space-time tradeoffs compared to classical indexes.

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

    Directory of Open Access Journals (Sweden)

    Breitling Rainer

    2005-09-01

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

  18. A Rank-Ordered Marginal Filter for Deinterlacing

    Directory of Open Access Journals (Sweden)

    Seok Hoon Kang

    2013-03-01

    Full Text Available This paper proposes a new interpolation filter for deinterlacing, which is achievedby enhancing the edge preserving ability of the conventional edge-based line averagemethods. This filter consists of three steps: pre-processing step, fuzzy metric-based weightassignation step, and rank-ordered marginal filter step. The proposed method is able tointerpolate the missing lines without introducing annoying articles. Simulation results showthat the images filtered with the proposed algorithm restrain less annoying pixels than theones acquired by other methods.

  19. Multifeature Extreme Ordinal Ranking Machine for Facial Age Estimation

    Directory of Open Access Journals (Sweden)

    Wei Zhao

    2015-01-01

    Full Text Available Recently the state-of-the-art facial age estimation methods are almost originated from solving complicated mathematical optimization problems and thus consume huge quantities of time in the training process. To refrain from such algorithm complexity while maintaining a high estimation accuracy, we propose a multifeature extreme ordinal ranking machine (MFEORM for facial age estimation. Experimental results clearly demonstrate that the proposed approach can sharply reduce the runtime (even up to nearly one hundred times faster while achieving comparable or better estimation performances than the state-of-the-art approaches. The inner properties of MFEORM are further explored with more advantages.

  20. Nonlinear Frequency Compression

    Science.gov (United States)

    Scollie, Susan; Glista, Danielle; Seelisch, Andreas

    2013-01-01

    Frequency lowering technologies offer an alternative amplification solution for severe to profound high frequency hearing losses. While frequency lowering technologies may improve audibility of high frequency sounds, the very nature of this processing can affect the perceived sound quality. This article reports the results from two studies that investigated the impact of a nonlinear frequency compression (NFC) algorithm on perceived sound quality. In the first study, the cutoff frequency and compression ratio parameters of the NFC algorithm were varied, and their effect on the speech quality was measured subjectively with 12 normal hearing adults, 12 normal hearing children, 13 hearing impaired adults, and 9 hearing impaired children. In the second study, 12 normal hearing and 8 hearing impaired adult listeners rated the quality of speech in quiet, speech in noise, and music after processing with a different set of NFC parameters. Results showed that the cutoff frequency parameter had more impact on sound quality ratings than the compression ratio, and that the hearing impaired adults were more tolerant to increased frequency compression than normal hearing adults. No statistically significant differences were found in the sound quality ratings of speech-in-noise and music stimuli processed through various NFC settings by hearing impaired listeners. These findings suggest that there may be an acceptable range of NFC settings for hearing impaired individuals where sound quality is not adversely affected. These results may assist an Audiologist in clinical NFC hearing aid fittings for achieving a balance between high frequency audibility and sound quality. PMID:23539261

  1. Distributed Compressive Sensing

    Science.gov (United States)

    2009-01-01

    more powerful algorithms like SOMP can be used. The ACIE algorithm is similar in spirit to other iterative estimation algorithms, such as turbo...Mitchell, “JPEG: Still image data compression standard,” Van Nostrand Reinhold , 1993. [11] D. S. Taubman and M. W. Marcellin, JPEG 2000: Image

  2. Temporal compressive sensing systems

    Energy Technology Data Exchange (ETDEWEB)

    Reed, Bryan W.

    2017-12-12

    Methods and systems for temporal compressive sensing are disclosed, where within each of one or more sensor array data acquisition periods, one or more sensor array measurement datasets comprising distinct linear combinations of time slice data are acquired, and where mathematical reconstruction allows for calculation of accurate representations of the individual time slice datasets.

  3. Compression of Infrared images

    DEFF Research Database (Denmark)

    Mantel, Claire; Forchhammer, Søren

    2017-01-01

    This paper investigates the compression of infrared images with three codecs: JPEG2000, JPEG-XT and HEVC. Results are evaluated in terms of SNR, Mean Relative Squared Error (MRSE) and the HDR-VDP2 quality metric. JPEG2000 and HEVC perform fairy similar and better than JPEG-XT. JPEG2000 performs...

  4. Compressive CFAR radar detection

    NARCIS (Netherlands)

    Anitori, L.; Otten, M.P.G.; Rossum, W.L. van; Maleki, A.; Baraniuk, R.

    2012-01-01

    In this paper we develop the first Compressive Sensing (CS) adaptive radar detector. We propose three novel architectures and demonstrate how a classical Constant False Alarm Rate (CFAR) detector can be combined with ℓ1-norm minimization. Using asymptotic arguments and the Complex Approximate

  5. Centrifugal Gas Compression Cycle

    Science.gov (United States)

    Fultun, Roy

    2002-11-01

    A centrifuged gas of kinetic, elastic hard spheres compresses isothermally and without flow of heat in a process that reverses free expansion. This theorem follows from stated assumptions via a collection of thought experiments, theorems and other supporting results, and it excludes application of the reversible mechanical adiabatic power law in this context. The existence of an isothermal adiabatic centrifugal compression process makes a three-process cycle possible using a fixed sample of the working gas. The three processes are: adiabatic mechanical expansion and cooling against a piston, isothermal adiabatic centrifugal compression back to the original volume, and isochoric temperature rise back to the original temperature due to an influx of heat. This cycle forms the basis for a Thomson perpetuum mobile that induces a loop of energy flow in an isolated system consisting of a heat bath connectable by a thermal path to the working gas, a mechanical extractor of the gas's internal energy, and a device that uses that mechanical energy and dissipates it as heat back into the heat bath. We present a simple experimental procedure to test the assertion that adiabatic centrifugal compression is isothermal. An energy budget for the cycle provides a criterion for breakeven in the conversion of heat to mechanical energy.

  6. Fingerprints in compressed strings

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Cording, Patrick Hagge

    2017-01-01

    In this paper we show how to construct a data structure for a string S of size N compressed into a context-free grammar of size n that supports efficient Karp–Rabin fingerprint queries to any substring of S. That is, given indices i and j, the answer to a query is the fingerprint of the substring S...

  7. Fingerprints in Compressed Strings

    DEFF Research Database (Denmark)

    Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

    2013-01-01

    The Karp-Rabin fingerprint of a string is a type of hash value that due to its strong properties has been used in many string algorithms. In this paper we show how to construct a data structure for a string S of size N compressed by a context-free grammar of size n that answers fingerprint queries...

  8. Social Bookmarking Induced Active Page Ranking

    Science.gov (United States)

    Takahashi, Tsubasa; Kitagawa, Hiroyuki; Watanabe, Keita

    Social bookmarking services have recently made it possible for us to register and share our own bookmarks on the web and are attracting attention. The services let us get structured data: (URL, Username, Timestamp, Tag Set). And these data represent user interest in web pages. The number of bookmarks is a barometer of web page value. Some web pages have many bookmarks, but most of those bookmarks may have been posted far in the past. Therefore, even if a web page has many bookmarks, their value is not guaranteed. If most of the bookmarks are very old, the page may be obsolete. In this paper, by focusing on the timestamp sequence of social bookmarkings on web pages, we model their activation levels representing current values. Further, we improve our previously proposed ranking method for web search by introducing the activation level concept. Finally, through experiments, we show effectiveness of the proposed ranking method.

  9. Low-rank quadratic semidefinite programming

    KAUST Repository

    Yuan, Ganzhao

    2013-04-01

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

  10. Classification of rank 2 cluster varieties

    DEFF Research Database (Denmark)

    Mandel, Travis

    We classify rank 2 cluster varieties (those whose corresponding skew-form has rank 2) according to the deformation type of a generic fiber U of their X-spaces, as defined by Fock and Goncharov. Our approach is based on the work of Gross, Hacking, and Keel for cluster varieties and log Calabi......-Yau surfaces. We find, for example, that U is "positive" (i.e., nearly affine) and either finite-type or non-acyclic (in the cluster sense) if and only if the monodromy of the tropicalization of U is one of Kodaira's matrices for the monodromy of an ellpitic fibration. In the positive cases, we also describe...... the action of the cluster modular group on the tropicalization of U....

  11. Deep Impact: Unintended consequences of journal rank

    CERN Document Server

    Brembs, Björn

    2013-01-01

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

  12. Probabilistic Low-Rank Multitask Learning.

    Science.gov (United States)

    Kong, Yu; Shao, Ming; Li, Kang; Fu, Yun

    2017-01-04

    In this paper, we consider the problem of learning multiple related tasks simultaneously with the goal of improving the generalization performance of individual tasks. The key challenge is to effectively exploit the shared information across multiple tasks as well as preserve the discriminative information for each individual task. To address this, we propose a novel probabilistic model for multitask learning (MTL) that can automatically balance between low-rank and sparsity constraints. The former assumes a low-rank structure of the underlying predictive hypothesis space to explicitly capture the relationship of different tasks and the latter learns the incoherent sparse patterns private to each task. We derive and perform inference via variational Bayesian methods. Experimental results on both regression and classification tasks on real-world applications demonstrate the effectiveness of the proposed method in dealing with the MTL problems.

  13. Compressed Sensing for Chemistry

    Science.gov (United States)

    Sanders, Jacob Nathan

    Many chemical applications, from spectroscopy to quantum chemistry, involve measuring or computing a large amount of data, and then compressing this data to retain the most chemically-relevant information. In contrast, compressed sensing is an emergent technique that makes it possible to measure or compute an amount of data that is roughly proportional to its information content. In particular, compressed sensing enables the recovery of a sparse quantity of information from significantly undersampled data by solving an ℓ 1-optimization problem. This thesis represents the application of compressed sensing to problems in chemistry. The first half of this thesis is about spectroscopy. Compressed sensing is used to accelerate the computation of vibrational and electronic spectra from real-time time-dependent density functional theory simulations. Using compressed sensing as a drop-in replacement for the discrete Fourier transform, well-resolved frequency spectra are obtained at one-fifth the typical simulation time and computational cost. The technique is generalized to multiple dimensions and applied to two-dimensional absorption spectroscopy using experimental data collected on atomic rubidium vapor. Finally, a related technique known as super-resolution is applied to open quantum systems to obtain realistic models of a protein environment, in the form of atomistic spectral densities, at lower computational cost. The second half of this thesis deals with matrices in quantum chemistry. It presents a new use of compressed sensing for more efficient matrix recovery whenever the calculation of individual matrix elements is the computational bottleneck. The technique is applied to the computation of the second-derivative Hessian matrices in electronic structure calculations to obtain the vibrational modes and frequencies of molecules. When applied to anthracene, this technique results in a threefold speed-up, with greater speed-ups possible for larger molecules. The

  14. Ranking agility factors affecting hospitals in Iran

    OpenAIRE

    M. Abdi Talarposht; GH. Mahmodi; MA. Jahani

    2017-01-01

    Background: Agility is an effective response to the changing and unpredictable environment and using these changes as opportunities for organizational improvement. Objective: The aim of the present study was to rank the factors affecting agile supply chain of hospitals of Iran. Methods: This applied study was conducted by cross sectional-descriptive method at some point of 2015 for one year. The research population included managers, administrators, faculty members and experts were sele...

  15. Ranking images based on aesthetic qualities.

    OpenAIRE

    Gaur, Aarushi

    2015-01-01

    The qualitative assessment of image content and aesthetic impression is affected by various image attributes and relations between the attributes. Modelling of such assessments in the form of objective rankings and learning image representations based on them is not a straightforward problem. The criteria can be varied with different levels of complexity for various applications. A highly-complex problem could involve a large number of interrelated attributes and features alongside varied rul...

  16. Homological characterisation of Lambda-ranks

    OpenAIRE

    Howson, Susan

    1999-01-01

    If G is a pro-p, p-adic, Lie group and if $\\Lambda(G)$ denotes the Iwasawa algebra of G then we present a formula for determining the $\\Lambda(G)$-rank of a finitely generated $\\Lambda(G)$-module. This is given in terms of the G homology groups of the module. We explore some consequences of this for the structure of $\\Lambda(G)$-modules.

  17. A Study on How Industrial Pharmacists Rank Competences for Pharmacy Practice: A Case for Industrial Pharmacy Specialization

    Directory of Open Access Journals (Sweden)

    Jeffrey Atkinson

    2016-02-01

    Full Text Available This paper looks at the way in which industrial pharmacists rank the fundamental competences for pharmacy practice. European industrial pharmacists (n = 135 ranked 68 competences for practice, arranged into 13 clusters of two types (personal and patient care. Results show that, compared to community pharmacists (n = 258, industrial pharmacists rank competences centering on research, development and production of drugs higher, and those centering on patient care lower. Competences centering on values, communication skills, etc. were ranked similarly by the two groups of pharmacists. These results are discussed in the light of the existence or not of an “industrial pharmacy” specialization.

  18. Discrete fracture in quasi-brittle materials under compressive and tensile stress states

    CSIR Research Space (South Africa)

    Klerck, PA

    2004-01-01

    Full Text Available A method for modelling discrete fracture in geomaterials under tensile and compressive stress fields has been developed based on a Mohr-Coulomb failure surface in compression and three independent anisotropic rotating crack models in tension...

  19. The Vicissitudes of Text

    OpenAIRE

    Culler, Jonathan

    2011-01-01

    The concept of text, which has been central to literary studies, has undergone many mutations, as it has traveled from the work of classical philologists, for whom it was and is the object of a powerful disciplinary formation, to postmodern theorists of the text, for whom, the concept might be summed up by the title of a fine book by John Mowatt: Text: the Genealogy of an Antidisciplinary Object. Of course, the interesting thing about a travelling concept is not that it travels — travelers, t...

  20. The Vicissitudes of Text

    OpenAIRE

    Culler, Jonathan

    2003-01-01

    The concept of text, which has been central to literary studies, has undergone many mutations, as it has traveled from the work of classical philologists, for whom it was and is the object of a powerful disciplinary formation, to postmodern theorists of the text, for whom, the concept might be summed up by the title of a fine book by John Mowatt: Text: the Genealogy of an Antidisciplinary Object. Of course, the interesting thing about a travelling concept is not that it travels — travelers, t...

  1. Text, Hypertext, and Hyperfiction

    Directory of Open Access Journals (Sweden)

    Ladan Modir

    2014-03-01

    Full Text Available This article briefly surveys the changing theoretical perspectives on text from structuralism to poststructuralism and how they are subsequently accounted for by hypertext theorists to comprehend the emerging genre called hypertext fiction. Some theoretical issues concerning the reading of this genre also will be discussed. The purpose of this study is to illustrate that the radical promises and challenges of digital novels to readers would prove reading and interpretation of conventional texts are far more participatory. This will be accomplished by tracing the evolution of poststructuralists’ concepts of intertextuality, multivocality, decentering, multilinearity, disorientation, and interactivity to find a way out of constant notions of conventional principles of reading.

  2. Citation ranking versus peer evaluation of senior faculty research performance

    DEFF Research Database (Denmark)

    Meho, Lokman I.; Sonnenwald, Diane H.

    2000-01-01

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

  3. Estimation of rank correlation for clustered data.

    Science.gov (United States)

    Rosner, Bernard; Glynn, Robert J

    2017-06-30

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

  4. Higher-rank fields and currents

    Energy Technology Data Exchange (ETDEWEB)

    Gelfond, O.A. [Institute of System Research of Russian Academy of Sciences,Nakhimovsky prospect 36-1, 117218, Moscow (Russian Federation); I.E.Tamm Department of Theoretical Physics, Lebedev Physical Institute,Leninsky prospect 53, 119991, Moscow (Russian Federation); Vasiliev, M.A. [I.E.Tamm Department of Theoretical Physics, Lebedev Physical Institute,Leninsky prospect 53, 119991, Moscow (Russian Federation)

    2016-10-13

    Sp(2M) invariant field equations in the space M{sub M} with symmetric matrix coordinates are classified. Analogous results are obtained for Minkowski-like subspaces of M{sub M} which include usual 4d Minkowski space as a particular case. The constructed equations are associated with the tensor products of the Fock (singleton) representation of Sp(2M) of any rank r. The infinite set of higher-spin conserved currents multilinear in rank-one fields in M{sub M} is found. The associated conserved charges are supported by (rM−((r(r−1))/2))-dimensional differential forms in M{sub M}, that are closed by virtue of the rank-2r field equations. The cohomology groups H{sup p}(σ{sub −}{sup r}) with all p and r, which determine the form of appropriate gauge fields and their field equations, are found both for M{sub M} and for its Minkowski-like subspace.

  5. Association between Metabolic Syndrome and Job Rank.

    Science.gov (United States)

    Mehrdad, Ramin; Pouryaghoub, Gholamreza; Moradi, Mahboubeh

    2018-01-01

    The occupation of the people can influence the development of metabolic syndrome. To determine the association between metabolic syndrome and its determinants with the job rank in workers of a large car factory in Iran. 3989 male workers at a large car manufacturing company were invited to participate in this cross-sectional study. Demographic and anthropometric data of the participants, including age, height, weight, and abdominal circumference were measured. Blood samples were taken to measure lipid profile and blood glucose level. Metabolic syndrome was diagnosed in each participant based on ATPIII 2001 criteria. The workers were categorized based on their job rank into 3 groups of (1) office workers, (2) workers with physical exertion, and (3) workers with chemical exposure. The study characteristics, particularly the frequency of metabolic syndrome and its determinants were compared among the study groups. The prevalence of metabolic syndrome in our study was 7.7% (95% CI 6.9 to 8.5). HDL levels were significantly lower in those who had chemical exposure (p=0.045). Diastolic blood pressure was significantly higher in those who had mechanical exertion (p=0.026). The frequency of metabolic syndrome in the office workers, workers with physical exertion, and workers with chemical exposure was 7.3%, 7.9%, and 7.8%, respectively (p=0.836). Seemingly, there is no association between metabolic syndrome and job rank.

  6. [Ranke and modern surgery in Groningen].

    Science.gov (United States)

    van Gijn, Jan; Gijselhart, Joost P

    2012-01-01

    Hans Rudolph Ranke (1849-1887) studied medicine in Halle, located in the eastern part of Germany, where he also trained as a surgeon under Richard von Volkmann (1830-1889), during which time he became familiar with the new antiseptic technique that had been introduced by Joseph Lister (1827-1912). In 1878 he was appointed head of the department of surgery in Groningen, the Netherlands, where his predecessor had been chronically indisposed and developments were flagging. Within a few months, Ranke had introduced disinfection by using carbolic acid both before and during operations. For the disinfection of wound dressings, he replaced carbolic acid with thymol as this was less pungent and foul-smelling. The rate of postoperative infections dropped to a minimum despite the inadequate housing and living conditions of the patients with infectious diseases. In 1887, at the age of 37, Ranke died after a brief illness - possibly glomerulonephritis - only eight years after he had assumed office. A street in the city of Groningen near its present-day University Medical Centre has been named after him.

  7. Experiments of cylindrical isentropic compression by ultrahigh magnetic field

    Directory of Open Access Journals (Sweden)

    Gu Zhuowei

    2015-01-01

    Full Text Available The high Explosive Magnetic Flux Implosion Compression Generator (EMFICG is a kind of unique high energy density dynamic technique with characters like ultrahigh pressure and low temperature rising and could be suitable as a tool of cylindrical isentropic compression. The Institute of Fluid Physics, Chinese Academy of Engineering Physics (IFP, CAEP have developed EMFICG technique and realized cylindrical isentropic compression. In the experiments, a seed magnetic field of 5–6 Tesla were built first and compressed by a stainless steel liner which is driven by high explosive. The inner free surface velocity of sample was measured by PDV. The isentropic compression of a copper sample was verified and the isentropic pressure is over 100 GPa. The cylindrical isentropic compression process has been numerical simulated by 1D MHD code and the simulation results were compared with the experiments. Compared with the transitional X-ray flash radiograph measurement, this method will probably promote the data accuracy.

  8. A Survey on Data Compression Methods for Biological Sequences

    Directory of Open Access Journals (Sweden)

    Morteza Hosseini

    2016-10-01

    Full Text Available The ever increasing growth of the production of high-throughput sequencing data poses a serious challenge to the storage, processing and transmission of these data. As frequently stated, it is a data deluge. Compression is essential to address this challenge—it reduces storage space and processing costs, along with speeding up data transmission. In this paper, we provide a comprehensive survey of existing compression approaches, that are specialized for biological data, including protein and DNA sequences. Also, we devote an important part of the paper to the approaches proposed for the compression of different file formats, such as FASTA, as well as FASTQ and SAM/BAM, which contain quality scores and metadata, in addition to the biological sequences. Then, we present a comparison of the performance of several methods, in terms of compression ratio, memory usage and compression/decompression time. Finally, we present some suggestions for future research on biological data compression.

  9. Texting on the Move

    Science.gov (United States)

    ... about when and where we text. What's the Big Deal? The problem is multitasking. No matter how ... person again. Reviewed by: Mary L. Gavin, MD Date reviewed: October 2013 More on this topic for: ...

  10. Machine Translation from Text

    Science.gov (United States)

    Habash, Nizar; Olive, Joseph; Christianson, Caitlin; McCary, John

    Machine translation (MT) from text, the topic of this chapter, is perhaps the heart of the GALE project. Beyond being a well defined application that stands on its own, MT from text is the link between the automatic speech recognition component and the distillation component. The focus of MT in GALE is on translating from Arabic or Chinese to English. The three languages represent a wide range of linguistic diversity and make the GALE MT task rather challenging and exciting.

  11. Plagiarism in Academic Texts

    Directory of Open Access Journals (Sweden)

    Marta Eugenia Rojas-Porras

    2012-08-01

    Full Text Available The ethical and social responsibility of citing the sources in a scientific or artistic work is undeniable. This paper explores, in a preliminary way, academic plagiarism in its various forms. It includes findings based on a forensic analysis. The purpose of this paper is to raise awareness on the importance of considering these details when writing and publishing a text. Hopefully, this analysis may put the issue under discussion.

  12. Psychologically Motivated Text Mining

    OpenAIRE

    Shutova, Ekaterina; Lichtenstein, Patricia

    2016-01-01

    Natural language processing techniques are increasingly applied to identify social trends and predict behavior based on large text collections. Existing methods typically rely on surface lexical and syntactic information. Yet, research in psychology shows that patterns of human conceptualisation, such as metaphorical framing, are reliable predictors of human expectations and decisions. In this paper, we present a method to learn patterns of metaphorical framing from large text collections, us...

  13. Translation of Quantum Texts

    OpenAIRE

    Espinoza, Randall; Imbo, Tom; Lopata, Paul

    2004-01-01

    In the companion to this paper, we described a generalization of the deterministic quantum cloning process, called enscription, which utilizes entanglement in order to achieve the "copying" of (certain) sets of distinct quantum states which are not orthogonal, called texts. Here we provide a further generalization, called translation, which allows us to completely determine all translatable texts, and which displays an intimate relationship to the mathematical theory of graphs.

  14. Effects of Instantaneous Multiband Dynamic Compression on Speech Intelligibility

    Directory of Open Access Journals (Sweden)

    Herzke Tobias

    2005-01-01

    Full Text Available The recruitment phenomenon, that is, the reduced dynamic range between threshold and uncomfortable level, is attributed to the loss of instantaneous dynamic compression on the basilar membrane. Despite this, hearing aids commonly use slow-acting dynamic compression for its compensation, because this was found to be the most successful strategy in terms of speech quality and intelligibility rehabilitation. Former attempts to use fast-acting compression gave ambiguous results, raising the question as to whether auditory-based recruitment compensation by instantaneous compression is in principle applicable in hearing aids. This study thus investigates instantaneous multiband dynamic compression based on an auditory filterbank. Instantaneous envelope compression is performed in each frequency band of a gammatone filterbank, which provides a combination of time and frequency resolution comparable to the normal healthy cochlea. The gain characteristics used for dynamic compression are deduced from categorical loudness scaling. In speech intelligibility tests, the instantaneous dynamic compression scheme was compared against a linear amplification scheme, which used the same filterbank for frequency analysis, but employed constant gain factors that restored the sound level for medium perceived loudness in each frequency band. In subjective comparisons, five of nine subjects preferred the linear amplification scheme and would not accept the instantaneous dynamic compression in hearing aids. Four of nine subjects did not perceive any quality differences. A sentence intelligibility test in noise (Oldenburg sentence test showed little to no negative effects of the instantaneous dynamic compression, compared to linear amplification. A word intelligibility test in quiet (one-syllable rhyme test showed that the subjects benefit from the larger amplification at low levels provided by instantaneous dynamic compression. Further analysis showed that the increase

  15. Acetabular paralabral cyst causing compression of the sciatic nerve

    Directory of Open Access Journals (Sweden)

    Caoimhe Byrne, MB BCh BAO

    2017-12-01

    Full Text Available Acetabular paralabral cysts are common. They vary in their clinical presentation and may be asymptomatic or cause pain and restriction at the hip joint. In rare instances they may cause symptoms by compressing local neurovascular structures. We report a case of symptomatic compression of the sciatic nerve by a posteriorly displaced acetabular paralabral cyst.

  16. Terminology: resistance or stiffness for medical compression stockings?

    Directory of Open Access Journals (Sweden)

    André Cornu-Thenard

    2013-04-01

    Full Text Available Based on previous experimental work with medical compression stockings it is proposed to restrict the term stiffness to measurements on the human leg and rather to speak about resistance when it comes to characterize the elastic property of compression hosiery in the textile laboratory.

  17. Fatigue Properties of Plain Concrete under Triaxial Tension-Compression-Compression Cyclic Loading

    Directory of Open Access Journals (Sweden)

    Dongfu Zhao

    2017-01-01

    Full Text Available Fatigue tests were performed on plain concrete under triaxial tension-compression-compression (T-C-C cyclic loading with constant and variable amplitude using a large multiaxial machine. Experimental results show that, under constant amplitude fatigue loads, the development of residual strain in the fatigue loading direction depends mostly on the lateral compressive stress ratio and is nearly independent of stress level. Under variable amplitude fatigue loads, the fatigue residual strain is related to the relative fatigue cycle and lateral compressive stress ratio but has little relationship with the loading process. To model this system, the relative residual strain was defined as the damage variant. Damage evolutions for plain concrete were established. In addition, fatigue damage analysis and predictions of fatigue remaining life were conducted. This work provides a reference for multistage fatigue testing and fatigue damage evaluation of plain concrete under multiaxial loads.

  18. Seasonal change in body fat of the Hyrax Procavia capensis (Pallas, 1766 using a body fat ranking index

    Directory of Open Access Journals (Sweden)

    L.J. Fourie

    1985-12-01

    Full Text Available Changes in the body fat content of the hyrax Procavia capensis were used as an indicator of physiological condition. Body fat rankings for the different sexes showed seasonal variations related to physiologically stressful periods (rutting, gestation and lactation. The subjective body fat rankings were correlated significantly with total body fat.

  19. Compression on the digital unit sphere

    Directory of Open Access Journals (Sweden)

    Mohamed Allali

    2001-07-01

    Full Text Available A method for compressing functions on the unit sphere is presented. This method is based on a Ramanujan set of rotations, and generates an equidistributed system of points. This method is flexible and easy to implement as it needs only few transformations to cover the whole unit sphere with spherical caps.

  20. TEM Video Compressive Sensing

    Energy Technology Data Exchange (ETDEWEB)

    Stevens, Andrew; Kovarik, Libor; Abellan, Patricia; Yuan, Xin; Carin, Lawrence; Browning, Nigel D.

    2015-08-01

    One of the main limitations of imaging at high spatial and temporal resolution during in-situ TEM experiments is the frame rate of the camera being used to image the dynamic process. While the recent development of direct detectors has provided the hardware to achieve frame rates approaching 0.1ms, the cameras are expensive and must replace existing detectors. In this paper, we examine the use of coded aperture compressive sensing methods [1, 2, 3, 4] to increase the framerate of any camera with simple, low-cost hardware modifications. The coded aperture approach allows multiple sub-frames to be coded and integrated into a single camera frame during the acquisition process, and then extracted upon readout using statistical compressive sensing inversion. Our simulations show that it should be possible to increase the speed of any camera by at least an order of magnitude. Compressive Sensing (CS) combines sensing and compression in one operation, and thus provides an approach that could further improve the temporal resolution while correspondingly reducing the electron dose rate. Because the signal is measured in a compressive manner, fewer total measurements are required. When applied to TEM video capture, compressive imaging couled improve acquisition speed and reduce the electron dose rate. CS is a recent concept, and has come to the forefront due the seminal work of Candès [5]. Since the publication of Candès, there has been enormous growth in the application of CS and development of CS variants. For electron microscopy applications, the concept of CS has also been recently applied to electron tomography [6], and reduction of electron dose in scanning transmission electron microscopy (STEM) imaging [7]. To demonstrate the applicability of coded aperture CS video reconstruction for atomic level imaging, we simulate compressive sensing on observations of Pd nanoparticles and Ag nanoparticles during exposure to high temperatures and other environmental conditions

  1. Ranking Fuzzy Numbers and Its Application to Products Attributes Preferences

    OpenAIRE

    Lazim Abdullah; Nor Nashrah Ahmad Fauzee

    2011-01-01

    Ranking is one of the widely used methods in fuzzy decision making environment. The recent ranking fuzzy numbers proposed by Wang and Li is claimed to be the improved version in ranking. However, the method was never been simplified and tested in real life application. This paper presents a four-step computation of ranking fuzzy numbers and its application in ranking attributes of selected chocolate products.  The four steps algorithm was formulated to rank fuzzy numbers and followed by a tes...

  2. Using Metric Distance Ranking Method to Find Intuitionistic Fuzzy Critical Path

    Directory of Open Access Journals (Sweden)

    P. Jayagowri

    2015-01-01

    Full Text Available Network analysis is a technique which determines the various sequences of activities concerning a project and the project completion time. The popular methods of this technique which is widely used are the critical path method and program evaluation and review techniques. The aim of this paper is to present an analytical method for measuring the criticality in an (Atanassov intuitionistic fuzzy project network. Vague parameters in the project network are represented by (Atanassov intuitionistic trapezoidal fuzzy numbers. A metric distance ranking method for (Atanassov intuitionistic fuzzy numbers to a critical path method is proposed. (Atanassov Intuitionistic fuzzy critical length of the project network is found without converting the (Atanassov intuitionistic fuzzy activity times to classical numbers. The fuzzified conversion of the problem has been discussed with the numerical example. We also apply four different ranking procedures and we compare it with metric distance ranking method. Comparison reveals that the proposed ranking method is better than other raking procedures.

  3. Comprehensive Weighted Clique Degree Ranking Algorithms and Evolutionary Model of Complex Network

    Directory of Open Access Journals (Sweden)

    Xu Jie

    2016-01-01

    Full Text Available This paper analyses the degree ranking (DR algorithm, and proposes a new comprehensive weighted clique degree ranking (CWCDR algorithms for ranking importance of nodes in complex network. Simulation results show that CWCDR algorithms not only can overcome the limitation of degree ranking algorithm, but also can find important nodes in complex networks more precisely and effectively. To the shortage of small-world model and BA model, this paper proposes an evolutionary model of complex network based on CWCDR algorithms, named CWCDR model. Simulation results show that the CWCDR model accords with power-law distribution. And compare with the BA model, this model has better average shortest path length, and clustering coefficient. Therefore, the CWCDR model is more consistent with the real network.

  4. Ranked solutions of the matric equation A1X1=A2X2

    Directory of Open Access Journals (Sweden)

    A. Duane Porter

    1980-01-01

    Full Text Available Let GF(pz denote the finite field of pz elements. Let A1 be s×m of rank r1 and A2 be s×n of rank r2 with elements from GF(pz. In this paper, formulas are given for finding the number of X1,X2 over GF(pz which satisfy the matric equation A1X1=A2X2, where X1 is m×t of rank k1, and X2 is n×t of rank k2. These results are then used to find the number of solutions X1,…,Xn, Y1,…,Ym, m,n>1, of the matric equation A1X1…Xn=A2Y1…Ym.

  5. Ranking of bank branches with undesirable and fuzzy data: A DEA-based approach

    Directory of Open Access Journals (Sweden)

    Sohrab Kordrostami

    2016-07-01

    Full Text Available Banks are one of the most important financial sectors in order to the economic development of each country. Certainly, efficiency scores and ranks of banks are significant and effective aspects towards future planning. Sometimes the performance of banks must be measured in the presence of undesirable and vague factors. For these reasons in the current paper a procedure based on data envelopment analysis (DEA is introduced for evaluating the efficiency and complete ranking of decision making units (DMUs where undesirable and fuzzy measures exist. To illustrate, in the presence of undesirable and fuzzy measures, DMUs are evaluated by using a fuzzy expected value approach and DMUs with similar efficiency scores are ranked by using constraints and the Maximal Balance Index based on the optimal shadow prices. Afterwards, the efficiency scores of 25 branches of an Iranian commercial bank are evaluated using the proposed method. Also, a complete ranking of bank branches is presented to discriminate branches.

  6. Ranking Fuzzy Numbers with a Distance Method using Circumcenter of Centroids and an Index of Modality

    Directory of Open Access Journals (Sweden)

    P. Phani Bushan Rao

    2011-01-01

    Full Text Available Ranking fuzzy numbers are an important aspect of decision making in a fuzzy environment. Since their inception in 1965, many authors have proposed different methods for ranking fuzzy numbers. However, there is no method which gives a satisfactory result to all situations. Most of the methods proposed so far are nondiscriminating and counterintuitive. This paper proposes a new method for ranking fuzzy numbers based on the Circumcenter of Centroids and uses an index of optimism to reflect the decision maker's optimistic attitude and also an index of modality that represents the neutrality of the decision maker. This method ranks various types of fuzzy numbers which include normal, generalized trapezoidal, and triangular fuzzy numbers along with crisp numbers with the particularity that crisp numbers are to be considered particular cases of fuzzy numbers.

  7. Choice Overload and Height Ranking of Menus in Partially-Ordered Sets

    Directory of Open Access Journals (Sweden)

    Marcello Basili

    2015-10-01

    Full Text Available When agents face incomplete information and their knowledge about the objects of choice is vague and imprecise, they tend to consider fewer choices and to process a smaller portion of the available information regarding their choices. This phenomenon is well-known as choice overload and is strictly related to the existence of a considerable amount of option-pairs that are not easily comparable. Thus, we use a finite partially-ordered set (poset to model the subset of easily-comparable pairs within a set of options/items. The height ranking, a new ranking rule for menus, namely subposets of a finite poset, is then introduced and characterized. The height ranking rule ranks subsets of options in terms of the size of the longest chain that they include and is therefore meant to assess menus of available options in terms of the maximum number of distinct and easily-comparable alternative options that they offer.

  8. Global cities rankings. A research agenda or a neoliberal urban planning tool?

    Directory of Open Access Journals (Sweden)

    Cándida Gago García

    2017-03-01

    Full Text Available This paper contains a theoretical reflection about the methodology and meaning given to the global city rankings. There is a very large academic production about the role that some cities have in global territorial processes, which has been related to the concept of global city. Many recent contributions from the mass media, advertising and consulting services must be considered also in the analysis. All of them have included new indicators in order to show the main role that cultural services have acquired in the urban economy. Also the city rankings are being used as a tool in neoliberal policies. These policies stress the position that cities have in the rankings, which are used in practices of city-branding and to justify the neoliberal decisions that are being taken. In fact, we think that rankings are used inappropriately and that it is necessary a deep and new reflection about them.

  9. Optimization of suspensions filtration with compressible cake

    Directory of Open Access Journals (Sweden)

    Janacova Dagmar

    2016-01-01

    Full Text Available In this paper there is described filtering process for separating reaction mixture after enzymatic hydrolysis to process the chromium tanning waste. Filtration of this mixture is very complicated because it is case of mixture filtration with compressible cake. Successful process strongly depends on mathematical describing of filtration, calculating optimal values of pressure difference, specific resistant of filtration cake and temperature maintenance which is connected with viscosity change. The mathematic model of filtration with compressible cake we verified in laboratory conditions on special filtration device developed on our department.

  10. Compressive neuropathy in the upper limb

    Directory of Open Access Journals (Sweden)

    Mukund R Thatte

    2011-01-01

    Full Text Available Entrampment neuropathy or compression neuropathy is a fairly common problem in the upper limb. Carpal tunnel syndrome is the commonest, followed by Cubital tunnel compression or Ulnar Neuropathy at Elbow. There are rarer entities like supinator syndrome and pronator syndrome affecting the Radial and Median nerves respectively. This article seeks to review comprehensively the pathophysiology, Anatomy and treatment of these conditions in a way that is intended for the practicing Hand Surgeon as well as postgraduates in training. It is generally a rewarding exercise to treat these conditions because they generally do well after corrective surgery. Diagnostic guidelines, treatment protocols and surgical technique has been discussed.

  11. Multiband and Lossless Compression of Hyperspectral Images

    Directory of Open Access Journals (Sweden)

    Raffaele Pizzolante

    2016-02-01

    Full Text Available Hyperspectral images are widely used in several real-life applications. In this paper, we investigate on the compression of hyperspectral images by considering different aspects, including the optimization of the computational complexity in order to allow implementations on limited hardware (i.e., hyperspectral sensors, etc.. We present an approach that relies on a three-dimensional predictive structure. Our predictive structure, 3D-MBLP, uses one or more previous bands as references to exploit the redundancies among the third dimension. The achieved results are comparable, and often better, with respect to the other state-of-art lossless compression techniques for hyperspectral images.

  12. The earliest medical texts.

    Science.gov (United States)

    Frey, E F

    The first civilization known to have had an extensive study of medicine and to leave written records of its practices and procedures was that of ancient Egypt. The oldest extant Egyptian medical texts are six papyri from the period between 2000 B.C. and 1500 B.C.: the Kahun Medical Papyrus, the Ramesseum IV and Ramesseum V Papyri, the Edwin Smith Surgical Papyrus, The Ebers Medical Papyrus and the Hearst Medical Papyrus. These texts, most of them based on older texts dating possibly from 3000 B.C., are comparatively free of the magician's approach to treating illness. Egyptian medicine influenced the medicine of neighboring cultures, including the culture of ancient Greece. From Greece, its influence spread onward, thereby affecting Western civilization significantly.

  13. Punctuation effects in english and esperanto texts

    Science.gov (United States)

    Ausloos, M.

    2010-07-01

    A statistical physics study of punctuation effects on sentence lengths is presented for written texts: Alice in wonderland and Through a looking glass. The translation of the first text into esperanto is also considered as a test for the role of punctuation in defining a style, and for contrasting natural and artificial, but written, languages. Several log-log plots of the sentence-length-rank relationship are presented for the major punctuation marks. Different power laws are observed with characteristic exponents. The exponent can take a value much less than unity ( ca. 0.50 or 0.30) depending on how a sentence is defined. The texts are also mapped into time series based on the word frequencies. The quantitative differences between the original and translated texts are very minutes, at the exponent level. It is argued that sentences seem to be more reliable than word distributions in discussing an author style.

  14. New mathematical cuneiform texts

    CERN Document Server

    Friberg, Jöran

    2016-01-01

    This monograph presents in great detail a large number of both unpublished and previously published Babylonian mathematical texts in the cuneiform script. It is a continuation of the work A Remarkable Collection of Babylonian Mathematical Texts (Springer 2007) written by Jöran Friberg, the leading expert on Babylonian mathematics. Focussing on the big picture, Friberg explores in this book several Late Babylonian arithmetical and metro-mathematical table texts from the sites of Babylon, Uruk and Sippar, collections of mathematical exercises from four Old Babylonian sites, as well as a new text from Early Dynastic/Early Sargonic Umma, which is the oldest known collection of mathematical exercises. A table of reciprocals from the end of the third millennium BC, differing radically from well-documented but younger tables of reciprocals from the Neo-Sumerian and Old-Babylonian periods, as well as a fragment of a Neo-Sumerian clay tablet showing a new type of a labyrinth are also discussed. The material is presen...

  15. Text analysis in R

    NARCIS (Netherlands)

    Welbers, K.; van Atteveldt, W.H.; Benoit, K.

    2017-01-01

    Computational text analysis has become an exciting research field with many applications in communication research. It can be a difficult method to apply, however, because it requires knowledge of various techniques, and the software required to perform most of these techniques is not readily

  16. Text Induced Spelling Correction

    NARCIS (Netherlands)

    Reynaert, M.W.C.

    2004-01-01

    We present TISC, a language-independent and context-sensitive spelling checking and correction system designed to facilitate the automatic removal of non-word spelling errors in large corpora. Its lexicon is derived from a very large corpus of raw text, without supervision, and contains word

  17. Texts On-Line.

    Science.gov (United States)

    Thomas, Jean-Jacques

    1993-01-01

    Maintains that the study of signs is divided between those scholars who use the Saussurian binary sign (semiology) and those who prefer the Peirce tripartite sign (semiotics). Concludes that neither the Saussurian nor Peircian analysis methods can produce a semiotic interpretation based on a hierarchy of the text's various components. (CFR)

  18. Dictionaries for text production

    DEFF Research Database (Denmark)

    Fuertes-Olivera, Pedro; Bergenholtz, Henning

    2018-01-01

    and free online dictionaries. The Diccionario español para la producción de textos is an example of a general text production dictionary that makes use of internet technologies, is based on a lexicographic theory, contains all the lexicographic data that users need in a production situation, and aims...

  19. Content Based Text Handling.

    Science.gov (United States)

    Schwarz, Christoph

    1990-01-01

    Gives an overview of various linguistic software tools in the field of intelligent text handling that are being developed in Germany utilizing artificial intelligence techniques in the field of natural language processing. Syntactical analysis of documents is described and application areas are discussed. (10 references) (LRW)

  20. Text, Hypertext, and Hyperfiction

    OpenAIRE

    Ladan Modir; Ling C Guan; Sohaimi Bin Abdul Aziz

    2014-01-01

    This article briefly surveys the changing theoretical perspectives on text from structuralism to poststructuralism and how they are subsequently accounted for by hypertext theorists to comprehend the emerging genre called hypertext fiction. Some theoretical issues concerning the reading of this genre also will be discussed. The purpose of this study is to illustrate that the radical promises and challenges of digital n...

  1. Error Resilient Video Compression Using Behavior Models

    Directory of Open Access Journals (Sweden)

    Jacco R. Taal

    2004-03-01

    Full Text Available Wireless and Internet video applications are inherently subjected to bit errors and packet errors, respectively. This is especially so if constraints on the end-to-end compression and transmission latencies are imposed. Therefore, it is necessary to develop methods to optimize the video compression parameters and the rate allocation of these applications that take into account residual channel bit errors. In this paper, we study the behavior of a predictive (interframe video encoder and model the encoders behavior using only the statistics of the original input data and of the underlying channel prone to bit errors. The resulting data-driven behavior models are then used to carry out group-of-pictures partitioning and to control the rate of the video encoder in such a way that the overall quality of the decoded video with compression and channel errors is optimized.

  2. Speech Enhancement Based on Compressed Sensing Technology

    Directory of Open Access Journals (Sweden)

    Huiyan Xu

    2014-10-01

    Full Text Available Compressed sensing (CS is a sampled approach on signal sparsity-base, and it can effectively extract the information which is contained in the signal. This paper presents a noisy speech enhancement new method based on CS process. Algorithm uses a voice sparsity in the discrete fast Fourier transform (Fast Fourier transform, FFT, and complex domain observation matrix is designed, and the noisy speech compression measurement and de-noising are made by soft threshold, and the speech signal is sparsely reconstructed by separable approximation (Sparse Reconstruction by Separable Approximation, SpaRSA algorithm to restore, speech enhancement is improved. Experimental results show that the denoising compression reconstruction of the noisy signal is done in the algorithm, SNR margin is improved greatly, and the background noise can been more effectively suppressed.

  3. Compressed Air Production Using Vehicle Suspension

    Directory of Open Access Journals (Sweden)

    Ninad Arun Malpure

    2015-08-01

    Full Text Available Abstract Generally compressed air is produced using different types of air compressors which consumes lot of electric energy and is noisy. In this paper an innovative idea is put forth for production of compressed air using movement of vehicle suspension which normal is wasted. The conversion of the force energy into the compressed air is carried out by the mechanism which consists of the vehicle suspension system hydraulic cylinder Non-return valve air compressor and air receiver. We are collecting air in the cylinder and store this energy into the tank by simply driving the vehicle. This method is non-conventional as no fuel input is required and is least polluting.

  4. Iris Recognition: The Consequences of Image Compression

    Directory of Open Access Journals (Sweden)

    Craig Belcher

    2010-01-01

    Full Text Available Iris recognition for human identification is one of the most accurate biometrics, and its employment is expanding globally. The use of portable iris systems, particularly in law enforcement applications, is growing. In many of these applications, the portable device may be required to transmit an iris image or template over a narrow-bandwidth communication channel. Typically, a full resolution image (e.g., VGA is desired to ensure sufficient pixels across the iris to be confident of accurate recognition results. To minimize the time to transmit a large amount of data over a narrow-bandwidth communication channel, image compression can be used to reduce the file size of the iris image. In other applications, such as the Registered Traveler program, an entire iris image is stored on a smart card, but only 4 kB is allowed for the iris image. For this type of application, image compression is also the solution. This paper investigates the effects of image compression on recognition system performance using a commercial version of the Daugman iris2pi algorithm along with JPEG-2000 compression, and links these to image quality. Using the ICE 2005 iris database, we find that even in the face of significant compression, recognition performance is minimally affected.

  5. Virtually Lossless Compression of Astrophysical Images

    Directory of Open Access Journals (Sweden)

    Stefano Baronti

    2005-09-01

    Full Text Available We describe an image compression strategy potentially capable of preserving the scientific quality of astrophysical data, simultaneously allowing a consistent bandwidth reduction to be achieved. Unlike strictly lossless techniques, by which moderate compression ratios are attainable, and conventional lossy techniques, in which the mean square error of the decoded data is globally controlled by users, near-lossless methods are capable of locally constraining the maximum absolute error, based on user's requirements. An advanced lossless/near-lossless differential pulse code modulation (DPCM scheme, recently introduced by the authors and relying on a causal spatial prediction, is adjusted to the specific characteristics of astrophysical image data (high radiometric resolution, generally low noise, etc.. The background noise is preliminarily estimated to drive the quantization stage for high quality, which is the primary concern in most of astrophysical applications. Extensive experimental results of lossless, near-lossless, and lossy compression of astrophysical images acquired by the Hubble space telescope show the advantages of the proposed method compared to standard techniques like JPEG-LS and JPEG2000. Eventually, the rationale of virtually lossless compression, that is, a noise-adjusted lossles/near-lossless compression, is highlighted and found to be in accordance with concepts well established for the astronomers' community.

  6. Compressive Spectral Renormalization Method

    CERN Document Server

    Bayindir, Cihan

    2016-01-01

    In this paper a novel numerical scheme for finding the sparse self-localized states of a nonlinear system of equations with missing spectral data is introduced. As in the Petviashivili's and the spectral renormalization method, the governing equation is transformed into Fourier domain, but the iterations are performed for far fewer number of spectral components (M) than classical versions of the these methods with higher number of spectral components (N). After the converge criteria is achieved for M components, N component signal is reconstructed from M components by using the l1 minimization technique of the compressive sampling. This method can be named as compressive spectral renormalization (CSRM) method. The main advantage of the CSRM is that, it is capable of finding the sparse self-localized states of the evolution equation(s) with many spectral data missing.

  7. Hemifacial Spasm and Neurovascular Compression

    Directory of Open Access Journals (Sweden)

    Alex Y. Lu

    2014-01-01

    Full Text Available Hemifacial spasm (HFS is characterized by involuntary unilateral contractions of the muscles innervated by the ipsilateral facial nerve, usually starting around the eyes before progressing inferiorly to the cheek, mouth, and neck. Its prevalence is 9.8 per 100,000 persons with an average age of onset of 44 years. The accepted pathophysiology of HFS suggests that it is a disease process of the nerve root entry zone of the facial nerve. HFS can be divided into two types: primary and secondary. Primary HFS is triggered by vascular compression whereas secondary HFS comprises all other causes of facial nerve damage. Clinical examination and imaging modalities such as electromyography (EMG and magnetic resonance imaging (MRI are useful to differentiate HFS from other facial movement disorders and for intraoperative planning. The standard medical management for HFS is botulinum neurotoxin (BoNT injections, which provides low-risk but limited symptomatic relief. The only curative treatment for HFS is microvascular decompression (MVD, a surgical intervention that provides lasting symptomatic relief by reducing compression of the facial nerve root. With a low rate of complications such as hearing loss, MVD remains the treatment of choice for HFS patients as intraoperative technique and monitoring continue to improve.

  8. Context Sensitive Article Ranking with Citation Context Analysis

    CERN Document Server

    Doslu, Metin

    2015-01-01

    It is hard to detect important articles in a specific context. Information retrieval techniques based on full text search can be inaccurate to identify main topics and they are not able to provide an indication about the importance of the article. Generating a citation network is a good way to find most popular articles but this approach is not context aware. The text around a citation mark is generally a good summary of the referred article. So citation context analysis presents an opportunity to use the wisdom of crowd for detecting important articles in a context sensitive way. In this work, we analyze citation contexts to rank articles properly for a given topic. The model proposed uses citation contexts in order to create a directed and weighted citation network based on the target topic. We create a directed and weighted edge between two articles if citation context contains terms related with the target topic. Then we apply common ranking algorithms in order to find important articles in this newly cre...

  9. MAPS Image Compression.

    Science.gov (United States)

    1980-05-01

    SUMMARY MICRO-ADAPTIVE PICTURE SEQUENCING (MAPS) is a digital image data compression technique which originated at Control Data Corporation and underwent...w w Figure 1-3. Test Imagery Set 6 L.( The MAPS process is clearly sensitive to contrast but not to the Mean gray scale in the image . Thus, all images ...BUFFERED WORD TRANSFER RATES image processing Typical computa- tional functions which can be solved e DUAL 16-BIT INTERNAL DATA BUS SYSTEM with this

  10. Differential Privacy with Compression

    OpenAIRE

    Zhou, Shuheng; Ligett, Katrina; Wasserman, Larry

    2009-01-01

    This work studies formal utility and privacy guarantees for a simple multiplicative database transformation, where the data are compressed by a random linear or affine transformation, reducing the number of data records substantially, while preserving the number of original input variables. We provide an analysis framework inspired by a recent concept known as differential privacy (Dwork 06). Our goal is to show that, despite the general difficulty of achieving the differential privacy guaran...

  11. Compressibility of solids

    Science.gov (United States)

    Vinet, P.; Ferrante, J.; Rose, J. H.; Smith, J. R.

    1987-01-01

    A universal form is proposed for the equation of state (EOS) of solids. Good agreement is found for a variety of test data. The form of the EOS is used to suggest a method of data analysis, which is applied to materials of geophysical interest. The isothermal bulk modulus is discussed as a function of the volume and of the pressure. The isothermal compression curves for materials of geophysical interest are examined.

  12. Phase diagram of matrix compressed sensing

    Science.gov (United States)

    Schülke, Christophe; Schniter, Philip; Zdeborová, Lenka

    2016-12-01

    In the problem of matrix compressed sensing, we aim to recover a low-rank matrix from a few noisy linear measurements. In this contribution, we analyze the asymptotic performance of a Bayes-optimal inference procedure for a model where the matrix to be recovered is a product of random matrices. The results that we obtain using the replica method describe the state evolution of the Parametric Bilinear Generalized Approximate Message Passing (P-BiG-AMP) algorithm, recently introduced in J. T. Parker and P. Schniter [IEEE J. Select. Top. Signal Process. 10, 795 (2016), 10.1109/JSTSP.2016.2539123]. We show the existence of two different types of phase transition and their implications for the solvability of the problem, and we compare the results of our theoretical analysis to the numerical performance reached by P-BiG-AMP. Remarkably, the asymptotic replica equations for matrix compressed sensing are the same as those for a related but formally different problem of matrix factorization.

  13. On the Nonnegative Rank of Euclidean Distance Matrices.

    Science.gov (United States)

    Lin, Matthew M; Chu, Moody T

    2010-09-01

    The Euclidean distance matrix for n distinct points in ℝ r is generically of rank r + 2. It is shown in this paper via a geometric argument that its nonnegative rank for the case r = 1 is generically n.

  14. Global Low-Rank Image Restoration With Gaussian Mixture Model.

    Science.gov (United States)

    Zhang, Sibo; Jiao, Licheng; Liu, Fang; Wang, Shuang

    2017-06-27

    Low-rank restoration has recently attracted a lot of attention in the research of computer vision. Empirical studies show that exploring the low-rank property of the patch groups can lead to superior restoration performance, however, there is limited achievement on the global low-rank restoration because the rank minimization at image level is too strong for the natural images which seldom match the low-rank condition. In this paper, we describe a flexible global low-rank restoration model which introduces the local statistical properties into the rank minimization. The proposed model can effectively recover the latent global low-rank structure via nuclear norm, as well as the fine details via Gaussian mixture model. An alternating scheme is developed to estimate the Gaussian parameters and the restored image, and it shows excellent convergence and stability. Besides, experiments on image and video sequence datasets show the effectiveness of the proposed method in image inpainting problems.

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

  16. E-text

    DEFF Research Database (Denmark)

    Finnemann, Niels Ole

    2017-01-01

    of “text” or “printed text” as the point of departure. On the other hand, electronic text can be defined by taking as point of departure the digital format in which everything is represented in the binary alphabet. While the notion of text, in most cases, lends itself to be independent of medium......) processing rules as binary sequences manifested in the binary alphabet. This wider notion would include, for instance, all sorts of scanning results, whether of the outer cosmos or the inner geographies of our bodies, and of digital traces of other processes in between these (machine readings included......). Since alphabets, like the genetic alphabet, and all sorts of images may be represented in the binary alphabet, such materials will also belong to the textual universe within this definition. A more intriguing implication is that digital born materials may also include scripts and interactive features...

  17. Strategy as Texts

    DEFF Research Database (Denmark)

    Obed Madsen, Søren

    of the strategy into four categories. Second, the managers produce new texts based on the original strategy document by using four different ways of translation models. The study’s findings contribute to three areas. Firstly, it shows that translation is more than a sociological process. It is also......This article shows empirically how managers translate a strategy plan at an individual level. By analysing how managers in three organizations translate strategies, it identifies that the translation happens in two steps: First, the managers decipher the strategy by coding the different parts...... a craftsmanship that requires knowledge and skills, which unfortunately seems to be overlooked in both the literature and in practice. Secondly, it shows that even though a strategy text is in singular, the translation makes strategy plural. Thirdly, the article proposes a way to open up the black box of what...

  18. Wisdom Texts and Philosophy

    Directory of Open Access Journals (Sweden)

    Anthony Preus

    2013-11-01

    Full Text Available The last essay of this issue concerns to a more "technical" subject: in many ancient cultures, literary monuments are mainly "wisdom literature". In these early works. Philosophy and Literature are more closely related than in many contemporary approaches. The author here tries to sketch the relationships between the ancient wisdom literatures of Egipt, Greece and Israel, and to show how this literary genre precedes "philosophy".

  19. Knowledge Based Text Generation

    Science.gov (United States)

    1989-08-01

    from data bases, so Kukich [1984] developed a system, ANA , which generates stock reports from a knowledge base of daily trading on the Dow Jones stock...MACHIAVELLI (topic organization and phraseology), CICERO (realization), FREUD (monitoring the origins of rhetorical plans), and LEIBNITZ (a "concept...68 Bossie and Mani 8 Alla Fiera dell’est 37 brain 2 frame 29 Alshawi 49 Brown and Yule 51 amplification 38 Cambridge University 40 ANA 15 canned text 7

  20. Implicit Block Diagonal Low-Rank Representation.

    Science.gov (United States)

    Xie, Xingyu; Guo, Xianglin; Liu, Guangcan; Wang, Jun

    2017-10-17

    While current block diagonal constrained subspace clustering methods are performed explicitly on the original data space, in practice it is often more desirable to embed the block diagonal prior into the reproducing kernel Hilbert feature space by kernelization techniques, as the underlying data structure in reality is usually nonlinear. However, it is still unknown how to carry out the embedding and kernelization in the models with block diagonal constraints. In this work, we shall take a step in this direction. First, we establish a novel model termed Implicit Block Diagonal Low-Rank Representation (IBDLR), by incorporating the implicit feature representation and block diagonal prior into the prevalent Low-Rank Representation (LRR) method. Second, mostly important, we show that the model in IBDLR could be kernelized by making use of a smoothed dual representation and the specifics of a proximal gradient based optimization algorithm. Finally, we provide some theoretical analyses for the convergence of our optimization algorithm. Comprehensive experiments on synthetic and realworld datasets demonstrate the superiorities of our IBDLR over state-of-the-art methods.While current block diagonal constrained subspace clustering methods are performed explicitly on the original data space, in practice it is often more desirable to embed the block diagonal prior into the reproducing kernel Hilbert feature space by kernelization techniques, as the underlying data structure in reality is usually nonlinear. However, it is still unknown how to carry out the embedding and kernelization in the models with block diagonal constraints. In this work, we shall take a step in this direction. First, we establish a novel model termed Implicit Block Diagonal Low-Rank Representation (IBDLR), by incorporating the implicit feature representation and block diagonal prior into the prevalent Low-Rank Representation (LRR) method. Second, mostly important, we show that the model in IBDLR could be

  1. On Stein's unbiased risk estimate for reduced rank estimators

    DEFF Research Database (Denmark)

    Hansen, Niels Richard

    2018-01-01

    Stein's unbiased risk estimate (SURE) is considered for matrix valued observables with low rank means. It is shown that SURE is applicable to a class of spectral function estimators including the reduced rank estimator.......Stein's unbiased risk estimate (SURE) is considered for matrix valued observables with low rank means. It is shown that SURE is applicable to a class of spectral function estimators including the reduced rank estimator....

  2. A study of serial ranks via random graphs

    OpenAIRE

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

    2000-01-01

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

  3. Compression Amplification in Hearing Aids.

    Science.gov (United States)

    Hickson, L M

    1994-11-01

    In this tutorial, the characteristics of compression amplification in analog hearing aids and the experimental results obtained with single- and multichannel compression amplification systems are reviewed. Single-channel compression systems are classified into four broad groups on the basis of their static and dynamic characteristics: compression limiters, syllabic compressors, automatic volume control (AVC) systems, and "others," those with adaptive recovery time (aRT) and dual frontend automatic gain control (AGC) (Moore, 1990; Moore & Glasberg, 1988). Multichannel compression devices have, to date, used a variety of different types of compression, with syllabic compression in each frequency channel being the most popular. Experimental evidence suggests that compression limiting is generally superior to peak clipping as a means of controlling output, except for some individuals with severe to profound hearing loss. There is some evidence that syllabic compression and AVC systems enhance speech perception in quiet compared to conventional linear amplification; however, this improvement is not consistently maintained in the presence of background noise. The majority of recent research has focused on multichannel compression, and favorable results have been obtained with some systems. Research findings about the efficacy of using compression amplification for people with hearing loss have been extremely variable, and possible reasons for this are discussed.

  4. Service Quality Evaluation and Ranking of Container Terminal Operators

    Directory of Open Access Journals (Sweden)

    Jafar Sayareh

    2016-12-01

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

  5. Ranking of delay factors in construction projects after Egyptian revolution

    Directory of Open Access Journals (Sweden)

    Remon Fayek Aziz

    2013-09-01

    Full Text Available Time is one of the major considerations throughout project management life cycle and can be regarded as one of the most important parameters of a project and the driving force of project success. Time delay is a very frequent phenomenon and is almost associated with nearly all constructing projects. However, little effort has been made to curtail the phenomenon, this research work attempts to identify, investigate, and rank factors perceived to affect delays in the Egyptian construction projects with respect to their relative importance so as to proffer possible ways of coping with this phenomenon. To achieve this objective, researcher invited practitioners and experts, comprising a statistically representative sample to participate in a structured questionnaire survey. Brain storming was taken into consideration, through which a number of delay factors were identified in construction projects. Totally, ninety-nine (99 factors were short-listed to be made part of the questionnaire survey and were identified and categorized into nine (9 major categories. The survey was conducted with experts and representatives from private, public, and local general construction firms. The data were analyzed using Relative Importance Index (RII, ranking and simple percentages. Ranking of factors and categories was demonstrated according to their importance level on delay, especially after 25/1/2011 (Egyptian revolution. According to the case study results, the most contributing factors and categories (those need attention to delays were discussed, and some recommendations were made in order to minimize and control delays in construction projects. Also, this paper can serve as a guide for all construction parties with effective management in construction projects to achieve a competitive level of quality and a time effective project.

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

    CERN Document Server

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

    2015-01-01

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

  7. Mechanical compression attenuates normal human bronchial epithelial wound healing

    Directory of Open Access Journals (Sweden)

    Malavia Nikita

    2009-02-01

    Full Text Available Abstract Background Airway narrowing associated with chronic asthma results in the transmission of injurious compressive forces to the bronchial epithelium and promotes the release of pro-inflammatory mediators and the denudation of the bronchial epithelium. While the individual effects of compression or denudation are well characterized, there is no data to elucidate how these cells respond to the application of mechanical compression in the presence of a compromised epithelial layer. Methods Accordingly, differentiated normal human bronchial epithelial cells were exposed to one of four conditions: 1 unperturbed control cells, 2 single scrape wound only, 3 static compression (6 hours of 30 cmH2O, and 4 6 hours of static compression after a scrape wound. Following treatment, wound closure rate was recorded, media was assayed for mediator content and the cytoskeletal network was fluorescently labeled. Results We found that mechanical compression and scrape injury increase TGF-β2 and endothelin-1 secretion, while EGF content in the media is attenuated with both injury modes. The application of compression after a pre-existing scrape wound augmented these observations, and also decreased PGE2 media content. Compression stimulated depolymerization of the actin cytoskeleton and significantly attenuated wound healing. Closure rate was partially restored with the addition of exogenous PGE2, but not EGF. Conclusion Our results suggest that mechanical compression reduces the capacity of the bronchial epithelium to close wounds, and is, in part, mediated by PGE2 and a compromised cytoskeleton.

  8. an investigation into n investigation into index ranking technique for ...

    African Journals Online (AJOL)

    eobe

    The study shows that the utility of the ranking technique may be limited by em. Therefore users of the technique for ranking fuzzy numbers have to maker, risk attitude, critical path, total float ranking s usually faced with a ully managing projects. The th project management is vities in the project have the activity times in the.

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

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

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

  12. University Rankings 2.0: New Frontiers in Institutional Comparisons

    Science.gov (United States)

    Usher, Alex

    2009-01-01

    The number of university rankings systems in use around the world has increased dramatically over the last decade. As they have spread, they have mutated; no longer are ranking systems simply clones of the original ranking systems such as "US News" and "World Report". A number of different types of "mutation" have occurred, so that there are now…

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

    Science.gov (United States)

    Garand, James C.; Giles, Micheal W.

    2011-01-01

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

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

    Science.gov (United States)

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

    2014-01-01

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

  15. Cardinal priority ranking based decision making for economic ...

    African Journals Online (AJOL)

    To access the indifference band, interaction with the decision maker is obtained via cardinal priority ranking (CPR) of the objectives. The cardinal priority ranking is constructed in the functional space and then transformed into the decision space, so the cardinal priority ranking of objectives relate the decision maker's ...

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

  17. Calibrating Canadian Universities: Rankings for Sale Once Again

    Science.gov (United States)

    Cramer, Kenneth M.; Page, Stewart

    2007-01-01

    A summary and update on recent research by the authors and others concerning rankings of Canadian universities is presented. Some specific data are reported in regard to the 2005 and 2006 ranking data published by "Maclean's" magazine. Some criticisms and difficulties with the use of rank-based data are outlined with regard to the issues…

  18. Higher Education Ranking and Leagues Tables: Lessons Learned from Benchmarking

    Science.gov (United States)

    Proulx, Roland

    2007-01-01

    The paper intends to contribute to the debate on ranking and league tables by adopting a critical approach to ranking methodologies from the point of view of a university benchmarking exercise. The absence of a strict benchmarking exercise in the ranking process has been, in the opinion of the author, one of the major problems encountered in the…

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

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  20. Weaving with text

    DEFF Research Database (Denmark)

    Hagedorn-Rasmussen, Peter

    This paper explores how a school principal by means of practical authorship creates reservoirs of language that provide a possible context for collective sensemaking. The paper draws upon a field study in which a school principal, and his managerial team, was shadowed in a period of intensive cha...... changes. The paper explores how the manager weaves with text, extracted from stakeholders, administration, politicians, employees, public discourse etc., as a means of creating a new fabric, a texture, of diverse perspectives that aims for collective sensemaking....

  1. Fuzzy Multicriteria Ranking of Aluminium Coating Methods

    Science.gov (United States)

    Batzias, A. F.

    2007-12-01

    This work deals with multicriteria ranking of aluminium coating methods. The alternatives used are: sulfuric acid anodization, A1; oxalic acid anodization, A2; chromic acid anodization, A3; phosphoric acid anodization, A4; integral color anodizing, A5; chemical conversion coating, A6; electrostatic powder deposition, A7. The criteria used are: cost of production, f1; environmental friendliness of production process, f2; appearance (texture), f3; reflectivity, f4; response to coloring, f5; corrosion resistance, f6; abrasion resistance, f7; fatigue resistance, f8. Five experts coming from relevant industrial units set grades to the criteria vector and the preference matrix according to a properly modified Delphi method. Sensitivity analysis of the ranked first alternative A1 against the `second best', which was A3 at low and A7 at high resolution levels proved that the solution is robust. The dependence of anodized products quality on upstream processes is presented and the impact of energy price increase on industrial cost is discussed.

  2. Rank order scaling of pictorial depth.

    Science.gov (United States)

    van Doorn, Andrea; Koenderink, Jan; Wagemans, Johan

    2011-01-01

    We address the topic of "pictorial depth" in cases of pictures that are unlike photographic renderings. The most basic measure of "depth" is no doubt that of depth order. We establish depth order through the pairwise depth-comparison method, involving all pairs from a set of 49 fiducial points. The pictorial space for this study was evoked by a capriccio (imaginary landscape) by Francesco Guardi (1712-1793). In such a drawing pictorial space is suggested by the artist through a small set of conventional depth cues. As a result typical Western observers tend to agree largely in their visual awareness when looking at such art. We rank depths for locations that are not on a single surface and far apart in pictorial space. We find that observers resolve about 40 distinct depth layers and agree largely in this. From a previous experiment we have metrical data for the same observers. The rank correlations between the results are high. Perhaps surprisingly, we find no correlation between the number of distinct depth layers and the total metrical depth range. Thus, the relation between subjective magnitude and discrimination threshold fails to hold for pictorial depth.

  3. Canine length in wild male baboons: maturation, aging and social dominance rank.

    Directory of Open Access Journals (Sweden)

    Jordi Galbany

    Full Text Available Canines represent an essential component of the dentition for any heterodont mammal. In primates, like many other mammals, canines are frequently used as weapons. Hence, tooth size and wear may have significant implications for fighting ability, and consequently for social dominance rank, reproductive success, and fitness. We evaluated sources of variance in canine growth and length in a well-studied wild primate population because of the potential importance of canines for male reproductive success in many primates. Specifically, we measured maxillary canine length in 80 wild male baboons (aged 5.04-20.45 years from the Amboseli ecosystem in southern Kenya, and examined its relationship with maturation, age, and social dominance rank. In our analysis of maturation, we compared food-enhanced baboons (those that fed part time at a refuse pit associated with a tourist lodge with wild-feeding males, and found that food-enhanced males achieved long canines earlier than wild-feeding males. Among adult males, canine length decreased with age because of tooth wear. We found some evidence that, after controlling for age, longer canines were associated with higher adult dominance rank (accounting for 9% of the variance in rank, but only among relatively high-ranking males. This result supports the idea that social rank, and thus reproductive success and fitness, may depend in part on fighting ability mediated by canine size.

  4. Rankings of International Achievement Test Performance and Economic Strength: Correlation or Conjecture?

    Directory of Open Access Journals (Sweden)

    CHRISTOPHER H. TIENKEN

    2008-04-01

    Full Text Available Examining a popular political notion, this article presents results from a series of Spearman Rho calculations conducted to investigate relationships between countries’ rankings on international tests of mathematics and science and future economic competitiveness as measured by the 2006 World Economic Forum’s Growth Competitiveness Index (GCI. The study investigated the existence of relationships between international test rankings from three different time periods during the last 50 years of U.S. education policy development (i.e., 1957–1982, 1983–2000, and 2001–2006 and 2006 GCI ranks. It extends previous research on the topic by investigating how GCI rankings in the top 50 percent and bottom 50 percent relate to rankings on international tests for the countries that participated in each test. The study found that the relationship between ranks on international tests of mathematics and science and future economic strength is stronger among nations with lower-performing economies. Nations with strong economies, such as the United States, demonstrate a weaker, nonsignificant relationship.

  5. Relationship Between the Brazilian Soccer Confederation Rankings and the Economical-Financial Indicators of Soccer Teams

    Directory of Open Access Journals (Sweden)

    Cleston Alexandre dos Santos

    2017-02-01

    Full Text Available Brazilian soccer teams are required to present good results inside and outside the field. The main demand is about winning titles, to present continuous and increasing profits, and, consequently, to reach economic-financial stability. The present study aims at analyzing the relationship between the ranking formed by the Brazilian Soccer Confederation (CBF and the economic-financial indicators of the Brazilian soccer teams. The sample consisted of 36 Brazilian soccer teams that belong to the series A, B and C. Such teams are linked to CBF and published their financial statements of 2014. For data analysis, we used multi-criteria decision making method VIKOR that was applied along with Kendall rank correlation. Results revealed that the majority of Brazilian soccer teams have insufficient economical liquidity; they cannot bear their own expenses; they dependent of third-party resources; and they present negative profitability. Results also showed, through VIKOR technique, that the soccer teams studied occupy different positions in CBF ranking and in the economical-financial indicators, except for Botafogo club. Kendall rank correlation revealed no correlation and no significance between the rankings. Findings seem to support the idea that there is no relationship between CBF rankings and the economical-financial indicators of Brazilian soccer teams.

  6. Receptor activator of nuclear factor kappa B (RANK as a determinant of peri-implantitis

    Directory of Open Access Journals (Sweden)

    Rakić Mia

    2013-01-01

    Full Text Available Background/Aim. Peri-implantitis presents inflammatory process that affects soft and hard supporting tissues of osseointegrated implant based on inflammatory osteoclastogenesis. The aim of this study was to investigate whether receptor activator of nuclear factor kappa B (RANK concentrations in peri-implant crevicular fluid could be associated with clinical parameters that reflect inflammatory nature of peri-implantitis. Methods. The study included 67 patients, 22 with diagnosed peri-implantitis, 22 persons with healthy peri-implant tissues and 23 patients with periodontitis. Clinical parameters from each patient were recorded and samples of peri-implant/gingival crevicular fluid were collected for the enzyme-linked immunosorbent assay (ELISA analysis. Results. RANK concentration was significantly increased in samples from the patients with periimplantitis when compared to healthy implants (p < 0.0001, where the average levels were 9 times higher. At the same time RANK concentration was significantly higher in periimplantitis than in periodontitis sites (p < 0.0001. In implant patients pocket depths and bleeding on probing values were positively associated with high RANK concentrations (p < 0.0001. Conclusion. These results revealed association of increased RANK concentration in samples of periimplant/ gingival crevicular fluid with peri-implant inflammation and suggests that RANK could be a pathologic determinant of peri-implantitis, thereby a potential parameter in assessment of peri-implant tissue inflammation and a potential target in designing treatment strategies.

  7. Ways students read texts

    Science.gov (United States)

    Wandersee, James H.

    College students responding to the Preferred Method of Study (PMOS) questionnaire explained how they approach reading a new textbook chapter for comprehension. Results indicated that a significant positive correlation exists between the number of passes a student makes at new textbook material and his/her college grade-point average. Women showed a significant preference for adopting a single method of study. Less than half of the students queried construct organizational tools such as outlines or diagrams as they study a textbook. Students said they would alter their textbook strategies in response to the type of test they expected significantly more often than they would for the type of subject matter being studied. Only 6% of the students said they make a conscious effort to link the new concepts in the text to prior knowledge. There was no discernable relationship between the study strategies undergraduate college students employ and their college grade level (freshman through senior).

  8. Interconnectedness und digitale Texte

    Directory of Open Access Journals (Sweden)

    Detlev Doherr

    2013-04-01

    Full Text Available Zusammenfassung Die multimedialen Informationsdienste im Internet werden immer umfangreicher und umfassender, wobei auch die nur in gedruckter Form vorliegenden Dokumente von den Bibliotheken digitalisiert und ins Netz gestellt werden. Über Online-Dokumentenverwaltungen oder Suchmaschinen können diese Dokumente gefunden und dann in gängigen Formaten wie z.B. PDF bereitgestellt werden. Dieser Artikel beleuchtet die Funktionsweise der Humboldt Digital Library, die seit mehr als zehn Jahren Dokumente von Alexander von Humboldt in englischer Übersetzung im Web als HDL (Humboldt Digital Library kostenfrei zur Verfügung stellt. Anders als eine digitale Bibliothek werden dabei allerdings nicht nur digitalisierte Dokumente als Scan oder PDF bereitgestellt, sondern der Text als solcher und in vernetzter Form verfügbar gemacht. Das System gleicht damit eher einem Informationssystem als einer digitalen Bibliothek, was sich auch in den verfügbaren Funktionen zur Auffindung von Texten in unterschiedlichen Versionen und Übersetzungen, Vergleichen von Absätzen verschiedener Dokumente oder der Darstellung von Bilden in ihrem Kontext widerspiegelt. Die Entwicklung von dynamischen Hyperlinks auf der Basis der einzelnen Textabsätze der Humboldt‘schen Werke in Form von Media Assets ermöglicht eine Nutzung der Programmierschnittstelle von Google Maps zur geographischen wie auch textinhaltlichen Navigation. Über den Service einer digitalen Bibliothek hinausgehend, bietet die HDL den Prototypen eines mehrdimensionalen Informationssystems, das mit dynamischen Strukturen arbeitet und umfangreiche thematische Auswertungen und Vergleiche ermöglicht. Summary The multimedia information services on Internet are becoming more and more comprehensive, even the printed documents are digitized and republished as digital Web documents by the libraries. Those digital files can be found by search engines or management tools and provided as files in usual formats as

  9. Training Studies with Compressed Air Breathing Apparatus – Methodology, Exercises

    Directory of Open Access Journals (Sweden)

    Buks Roberts

    2015-11-01

    Full Text Available The current article describes topics ranging from the respiratory physiology and the structure of compressed air breathing apparatus to the performance of practical training exercises in an unbreathable environment (hereinafter referred to as UE.

  10. A weakly compressible formulation for modelling liquid-gas sloshing

    CSIR Research Space (South Africa)

    Heyns, Johan A

    2012-09-01

    Full Text Available , the implementation of a weakly compressible formulation which accounts for variations in the gas density is presented. With the aim of ensuring a computational efficient implementation of the proposed formulation, an implicit iterative GMRES solver with LU...

  11. Initial results for compressive sensing in electronic support receiver systems

    CSIR Research Space (South Africa)

    Du Plessis, WP

    2011-04-01

    Full Text Available The agile bandwidths of modern radars mean that Electronic Support (ES) receivers require wide instantaneous bandwidths leading to high data rates. Compressive sensing is shown to be a promising technique for reducing data rates for a number...

  12. Statistical regularities in the rank-citation profile of scientists.

    Science.gov (United States)

    Petersen, Alexander M; Stanley, H Eugene; Succi, Sauro

    2011-01-01

    Recent science of science research shows that scientific impact measures for journals and individual articles have quantifiable regularities across both time and discipline. However, little is known about the scientific impact distribution at the scale of an individual scientist. We analyze the aggregate production and impact using the rank-citation profile c(i)(r) of 200 distinguished professors and 100 assistant professors. For the entire range of paper rank r, we fit each c(i)(r) to a common distribution function. Since two scientists with equivalent Hirsch h-index can have significantly different c(i)(r) profiles, our results demonstrate the utility of the β(i) scaling parameter in conjunction with h(i) for quantifying individual publication impact. We show that the total number of citations C(i) tallied from a scientist's N(i) papers scales as [Formula: see text]. Such statistical regularities in the input-output patterns of scientists can be used as benchmarks for theoretical models of career progress.

  13. ANALYSIS, SELECTION AND RANKING OF FOREIGN MARKETS. A COMPREHENSIVE APPROACH

    Directory of Open Access Journals (Sweden)

    LIVIU NEAMŢU

    2013-12-01

    Full Text Available Choosing the appropriate markets for growth and development is essential for a company that wishes expanding businesses through international economic exchanges. But in this business case foreign markets research is not sufficient even though is an important chapter in the decision technology and an indispensable condition for achieving firm’s objectives. If in marketing on the national market this market is defined requiring no more than its prospection and segmentation, in the case of the international market outside the research process there is a need of a selection of markets and their classification. Companies that have this intention know little or nothing about the conditions offered by a new market or another. Therefore, they must go, step by step, through a complex analysis process, multilevel- type, composed of selection and ranking of markets followed by the proper research through exploration and segmentation, which can lead to choosing the most profitable markets. In this regard, within this study, we propose a multi-criteria model for selection and ranking of international development markets, allowing companies access to those markets which are in compliance with the company's development strategy.

  14. The Logistics Potential of Ukraine in the International Ranking

    Directory of Open Access Journals (Sweden)

    Kuchkova Olga V.

    2017-01-01

    Full Text Available The article is aimed at studying the ranking of countries by the LPI index, identifying causes of the low positioning of Ukraine and ways to restructure its logistics system. It has been proved that, by the level of development of the logistics industry, Ukraine’s position in the world standings every year worsens. Over the past four years the country has lost 19 positions and in 2016 has moved into the 80 place among the 160 countries. On the basis of analysis of the components of LPI was determined that the worst indicator among all evaluated characteristics Ukraine had demonstrated as to customs handling of cargo (116th place, the best – as to timeliness of delivery of goods to destinations (54th place, relatively well – as to logistics coverage and cargo tracking – 61st place. In order to restructure the logistics system of Ukraine and improve its position in the world ranking the priorities are: intensification of developing innovative technology; further integration into the world community, studying and introduction of international experience; construction of logistics centers and developing infrastructure throughout the country; education of highly qualified personnel through the development of institutions of higher education and business programs of advanced training.

  15. Ranking Biomedical Annotations with Annotator’s Semantic Relevancy

    Directory of Open Access Journals (Sweden)

    Aihua Wu

    2014-01-01

    Full Text Available Biomedical annotation is a common and affective artifact for researchers to discuss, show opinion, and share discoveries. It becomes increasing popular in many online research communities, and implies much useful information. Ranking biomedical annotations is a critical problem for data user to efficiently get information. As the annotator’s knowledge about the annotated entity normally determines quality of the annotations, we evaluate the knowledge, that is, semantic relationship between them, in two ways. The first is extracting relational information from credible websites by mining association rules between an annotator and a biomedical entity. The second way is frequent pattern mining from historical annotations, which reveals common features of biomedical entities that an annotator can annotate with high quality. We propose a weighted and concept-extended RDF model to represent an annotator, a biomedical entity, and their background attributes and merge information from the two ways as the context of an annotator. Based on that, we present a method to rank the annotations by evaluating their correctness according to user’s vote and the semantic relevancy between the annotator and the annotated entity. The experimental results show that the approach is applicable and efficient even when data set is large.

  16. MedlineRanker: flexible ranking of biomedical literature.

    Science.gov (United States)

    Fontaine, Jean-Fred; Barbosa-Silva, Adriano; Schaefer, Martin; Huska, Matthew R; Muro, Enrique M; Andrade-Navarro, Miguel A

    2009-07-01

    The biomedical literature is represented by millions of abstracts available in the Medline database. These abstracts can be queried with the PubMed interface, which provides a keyword-based Boolean search engine. This approach shows limitations in the retrieval of abstracts related to very specific topics, as it is difficult for a non-expert user to find all of the most relevant keywords related to a biomedical topic. Additionally, when searching for more general topics, the same approach may return hundreds of unranked references. To address these issues, text mining tools have been developed to help scientists focus on relevant abstracts. We have implemented the MedlineRanker webserver, which allows a flexible ranking of Medline for a topic of interest without expert knowledge. Given some abstracts related to a topic, the program deduces automatically the most discriminative words in comparison to a random selection. These words are used to score other abstracts, including those from not yet annotated recent publications, which can be then ranked by relevance. We show that our tool can be highly accurate and that it is able to process millions of abstracts in a practical amount of time. MedlineRanker is free for use and is available at http://cbdm.mdc-berlin.de/tools/medlineranker.

  17. Ranking the participants of economic studies market in Russia

    Directory of Open Access Journals (Sweden)

    Balatsky Evgeny, V.

    2015-06-01

    Full Text Available The paper discusses the results of rating the personal and institutional members of the Russian market for Economic Studies – economists and higher economic schools. Ranking the economists carried out in accordance with the Rating of academic activity and popularity, which is based on averaging three indicators of RISC – number of publications, number of citations and h-index. The quantitative results of the pilot empirical calculations have allowed to identify the main features of the model for academic success of economist, which includes factors such as mature age, high administrative status, attitudes to the leading scientific corporation and relevance of research subject. The paper also presents the rating of Russian universities engaged in economic studies. The rating is based on the account of two sides in the activities of universities – publication activity in the pages of the best economic journals, determined on the basis of special Ranking of economic journals, and human capacity, determined on the basis of Rating of academic activity and popularity of economists. The combination of these two factors for success has allowed to propose the classification of higher economic schools – emerging, mature, locally and globally active, locally and globally stagnating. It is shown that the additional data processing of system RISC allows to make a representative ratings that can serve as effective markers for Russian market of economic researches.

  18. Rank-Based Analysis of Unbalanced Repeated Measures Data

    Directory of Open Access Journals (Sweden)

    M. Mushfiqur Rashid

    2012-07-01

    Full Text Available Normal 0 false false false EN-US X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} In this article, we have developed a rank (intra-subject based analysis of clinical trials with unbalanced repeated measures data. We assume that the errors within each patient are exchangeable and continuous random variables. This rank-based inference is valid when the unbalanced data are missing either completely at random or by design. A drop in dispersion test is developed for general linear hypotheses. A numerical example is given to illustrate the procedure.

  19. Low-Rank Linear Dynamical Systems for Motor Imagery EEG

    Directory of Open Access Journals (Sweden)

    Wenchang Zhang

    2016-01-01

    Full Text Available The common spatial pattern (CSP and other spatiospectral feature extraction methods have become the most effective and successful approaches to solve the problem of motor imagery electroencephalography (MI-EEG pattern recognition from multichannel neural activity in recent years. However, these methods need a lot of preprocessing and postprocessing such as filtering, demean, and spatiospectral feature fusion, which influence the classification accuracy easily. In this paper, we utilize linear dynamical systems (LDSs for EEG signals feature extraction and classification. LDSs model has lots of advantages such as simultaneous spatial and temporal feature matrix generation, free of preprocessing or postprocessing, and low cost. Furthermore, a low-rank matrix decomposition approach is introduced to get rid of noise and resting state component in order to improve the robustness of the system. Then, we propose a low-rank LDSs algorithm to decompose feature subspace of LDSs on finite Grassmannian and obtain a better performance. Extensive experiments are carried out on public dataset from “BCI Competition III Dataset IVa” and “BCI Competition IV Database 2a.” The results show that our proposed three methods yield higher accuracies compared with prevailing approaches such as CSP and CSSP.

  20. RELIABLE COGNITIVE DIMENSIONAL DOCUMENT RANKING BY WEIGHTED STANDARD CAUCHY DISTRIBUTION

    Directory of Open Access Journals (Sweden)

    S Florence Vijila

    2017-04-01

    Full Text Available Categorization of cognitively uniform and consistent documents such as University question papers are in demand by e-learners. Literature indicates that Standard Cauchy distribution and the derived values are extensively used for checking uniformity and consistency of documents. The paper attempts to apply this technique for categorizing question papers according to four selective cognitive dimensions. For this purpose cognitive dimensional keyword sets of these four categories (also termed as portrayal concepts are assumed and an automatic procedure is developed to quantify these dimensions in question papers. The categorization is relatively accurate when checked with manual methods. Hence simple and well established term frequency / inverse document frequency ‘tf/ IDF’ technique is considered for automating the categorization process. After the documents categorization, standard Cauchy formula is applied to rank order the documents that have the least differences among Cauchy value, (according to Cauchy theorem so as obtain consistent and uniform documents in an order or ranked. For the purpose of experiments and social survey, seven question papers (documents have been designed with various consistencies. To validate this proposed technique social survey is administered on selective samples of e-learners of Tamil Nadu, India. Results are encouraging and conclusions drawn out of the experiments will be useful to researchers of concept mining and categorizing documents according to concepts. Findings have also contributed utility value to e-learning system designers.