Interval information systems are generalizedmodels of single-valued information systems. By introducing a dominance relation to interval information systems, we propose a ranking approach for all objects based on dominance classes and establish a dominance-based rough set approach, which is mainly based on substitution of the indiscernibility relation by the dominance relation. Furthermore, we ...

The Multiple Attribute Group Decision Making (MAGDM) problems are investigated in which all the information provided by the decision-makers is presented as interval-valued intuitionistic fuzzy decision matrices, and the information about attribute weights is partially known. Three different models are utilized for calculating the completely unknown attribute weights which are then used for aggr...

‎In this paper, we present a two-stage model for ranking of decision making units (DMUs) using interval analytic hierarchy process (AHP). Since the efficiency score of unity is assigned to the efficient units, we evaluate the efficiency of each DMU by basic DEA models and calculate the weights of the criteria using proposed model. In the first stage, the proposed model evaluates decision making...

A growing number of text-rich XML repositories are being made available. As a result, more efforts have been deployed to provide XML fulltext search that combines querying structure with complex conditions on text ranging from simple keyword search to sophisticated proximity search composed with stemming and thesaurus. However, one of the key challenges in full-text search is to match users’ ex...

The goal of this paper is to find relevant citations for clinicians' written content and make it more reliable by adding scientific articles as references and enabling the clinicians to easily update it using new information. The proposed approach uses information retrieval and ranking techniques to extract and rank relevant citations from MEDLINE for any given sentence. Additionally, this syst...

The construction of a proof for unsatisfiability is less costly than the construction of a ranking function. We present a new approach to LTL software model checking (i.e., to statically analyze a program and verify a temporal property from the full class of LTL including general liveness properties) which aims at exploiting this fact. The idea is to select finite prefixes of a path and check t...

Invenio is a free comprehensive web-based document repository and digital library software suite originally developed at CERN. It can serve a variety of use cases from an institutional repository or digital library to a web journal. In order to fully use full-text documents for efficient search and ranking, Solr was integrated into Invenio through a generic bridge. Solr indexes extracted full-t...

We address the problem of efficiently ranking the best peers w.r.t. a query with multiple, equally weighted predicates – conjunctive queries – in shortcut overlay networks. This problem occurs when routing queries in unstructured peer-to-peer networks, such as in peer-to-peer information retrieval applications. Requirements for this task include, e.g., full autonomy of peers as well as full con...

In multi-criteria sorting methods, it is often difficult for decision makers to precisely define their preferences. It is even harder to express them into parameters values. The idea of this work is to automatically find the parameters of a sorting model using classification examples in the contexts of traditional sorting and interval sorting. Interval sorting, i.e. the possible assignment of a...

For the problem of processing top-N queries, the threshold algorithm (TA) is an important method in many scenarios. The model of top-N queries with TA has three characteristics: (1) the ranking function is monotone, (2) the query point is fixed, and (3) TA scans the sorted index lists unidirectionally. In many database applications, however, there are opportunities for evaluating top-N queries ...