Assume that a database stores a set of intervals associated with types and weights. Typed intervals enrich the data representation and support applications involving different kinds of intervals. Given a query time and type, the system reports k intervals that intersect the time, contain the type and have the largest weight. We develop a new structure to manage typed intervals based on the stan...

the basic models of data envelopment analysis (dea) are designed in such a way that the values of input and output indicators should be identified and known in them. in other words, these models are not used to consider inaccurate, interval, fuzzy, judgment data. in this paper, the aim is to not only review the past researches about the efficiency of the units by interval data and represent the...

The basic assumption in data envelopment analysis patterns (DEA) (such as the CCR andBCC models) is that the value of data related to the inputs and outputs is a precise andpositive number, but most of the time in real conditions of business, determining precisenumerical value is not possible in for some inputs or outputs. For this purpose, differentmodels have been proposed in DEA for imprecis...

this paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. for this purpose, the advantage of a linear transformation is utilized to rede ne a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. then, the best score of this virtual candidate is u...

On account of the existence of uncertainty, DEA occasionally faces the situation of imprecise data, especially when a set of DMUs include missing data, ordinal data, interval data, stochastic data, or fuzzy data. Therefore, how to evaluate the efficiency of a set of DMUs in interval environments is a problem worth studying. In this paper, we discussed the new method for evaluation and ranking i...

Article history: Received: 28.11.2014. Received in revised form: 5.3.2015. Accepted: 7.3.2015. This paper proposes a new DFT Architecture that contains three test scan modes. The test data could be interval broadcast to scan chains whenever the data in corresponding locations are compatible. Compared with the conventional broadcast scan architecture, the proposed architecture achieves better co...

Given a set of conflicting arguments, there can exist multiple plausible opinions about which arguments should be accepted, rejected, or deemed undecided. Recent work explored some operators for deciding how multiple such judgments should be aggregated. Here, we generalize this line of study by introducing a family of operators called interval aggregation methods, which contain existing operato...

We show that real-number computations in the interval-domain environment are “inherently parallel” in a precise mathematical sense. We do this by reducing computations of the weak parallel-or operation on the Sierpinski domain to computations of the addition operation on the interval domain.