in this paper it has been tried to present a model by usingsome changes in the classical dea models and combining these modelswith fuzzy models to eliminate these weaknesses. inputs and outputs arerecognized by using mcdm and ahp techniques and experts views. inthe next step, the gathered data is compounded by fuzzy techniques andentered in the special dea model after changing to the crisp amou...

One of the surprising findings from the study of CNF satisfiability in the 1990’s has been the success of iterative repair techniques, and in particular of weighted iterative repair. However, attempts to improve weighted iterative repair have either produced marginal benefits or rely on domain specific heuristics. This paper introduces a new extension of constraint weighting called Arc Weightin...

We consider the `1 minimization problem minx ‖Ax − b‖1 in the overconstrained case, commonly known as the Least Absolute Deviations problem, where there are far more constraints than variables. More specifically, we have A ∈ Rn×d for n d. Many important combinatorial problems, such as minimum cut and shortest path, can be formulated as `1 regression problems [CMMP13]. We follow the general para...

Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes and suggests valid expressions of a given type at a given program point. As the basis of our technique we use type reconstructio...

We saw that using the multiplicative weights (MW) algorithm, we find a (1 + ε)-approximate max flow f̂—i.e., a flow of value F that has f̂e ≤ 1 + ε—using O( logm ε2 ) calls to the oracle. In Lecture #14, we saw that using shortest-path routing, you can get ρ = F . Since we can use Dijkstra’s O(m+ n log n) to implement the oracle, this gives an Õ( ε2 ) time algorithm. Relaxed Oracle: For the rest ...

Ordered weighted averaging (OWA) operators have been widely used in decision making these past few years. An important issue facing the OWA operators’ users is the determination of the OWA weights. This paper introduces an OWA determination method based on truncated distributions that enables intuitive generation of OWA weights according to a certain level of risk and trade-off. These two dimen...

We present a simple algorithm for playing a repeated game. We show that a player using this algorithm suffers average loss that is guaranteed to come close to the minimum loss achievable by any fixed strategy. Our bounds are nonasymptotic and hold for any opponent. The algorithm, which uses the multiplicative-weight methods of Littlestone and Warmuth, is analyzed using the Kullback–Liebler dive...

We implement semiparametric random censorship model aided inference for censored median regression models. This is based on the idea that, when the censoring is specified by a common distribution, a semiparametric survival function estimator acts as an improved weight in the so-called inverse censoring weighted estimating function. We show that the proposed method will always produce estimates ...

An analysis of the climate parametrization scheme adopted by conventional forest gap models revealed that most models assume a constant climate and are difficult to calibrate consistently. Tree growth showed unrealistically sensitive threshold effects along ecological gradients of temperature and precipitation. A new parametrization was compared with its predecessors in terms of the model's cap...