jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables‎. ‎in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.

fuzzy measures are suitable in analyzing human subjective evaluation processes. several different strategies have been proposed for distance of fuzzy numbers. the distances introduced for fuzzy numbers can be categorized in two groups:1. the crisp distances which explain crisp values for the distance between two fuzzy numbers.2. the fuzzy distance which introduce a fuzzy distance for normal fuz...

The verification of final termination for counter systems is undecidable. For non flattable counter systems, the verification of this type of property is generally based on the exhibition of a ranking function. Proving the existence of a ranking function for general counter systems is also undecidable. We provide a framework in which the verification whether a given function is a ranking functi...

In this paper, we propose a novel ranking function learning framework based on relevance propagation. The propagation process is used to propagate the relevance scores from labeled documents to other unlabeled ones so that more training data are available to learn the ranking function. It is realized by the manifold ranking algorithm, which has been proved to be very effective in content-based ...

Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for relations over (mathematical) integers or rationals, efficient synthesis of ranking functions for machine-level integers (bit-vectors) is an open problem. This is particularly relevant for the verification of low-leve...

The ranking aggregation problem is that to establishing a new aggregate ranking given a set of rankings of a finite set of items. This problem is met in various applications, such as the combination of user preferences, the combination of lists of documents retrieved by search engines and the combination of ranked gene lists. In the literature, the ranking aggregation problem has been solved as...

In this paper we examine the problem of ranking candidate expansion terms for query expansion. We show, by an extension to the traditional F4 scheme, how partial relevance assessments (how relevant a document is) and ostensive evidence (when a document was assessed relevant) can be incorporated into a term ranking function. We then investigate this new term ranking function in three user experi...