in this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (dmus) in stochastic data envelopment analysis (dea) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. it is shown that this deterministic model can be converted to a quadratic programming model. so fa...

Subarcsecond infrared and radio observations yield important information about the formation of super star clusters from their surrounding gas. We discuss the general properties of ionized and molecular gas near young, forming SSCs, as illustrated by the prototypical young, forming super star cluster nebula in the dwarf galaxy NGC 5253. This super star cluster appears to have a gravitationally ...

A major goal of this study was to characterize the cervicocollic reflexes (CCRs) in awake squirrel monkeys and compare it to observations in cat. This was carried out by stabilizing the head in space while rotating the lower body. The magnitude and phase of the torque produced between the head and the restraint system was used as an indicator of the CCR. Many properties of the squirrel monkey's...

Let the matching polynomial of a graph G be denoted by μ(G, x). A graph G is said to be θ-super positive if μ(G, θ) 6= 0 and μ(G \ v, θ) = 0 for all v ∈ V (G). In particular, G is 0-super positive if and only if G has a perfect matching. While much is known about 0-super positive graphs, almost nothing is known about θsuper positive graphs for θ 6= 0. This motivates us to investigate the struct...

A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k∗-container if it contains all the vertices of G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let (G) be the connectivity of G. A graph G is super connected if G is i∗-connected for all 1 i (G). A bipartite graph G is k∗-laceable if the...

A maximally connected digraph G is said to be super-κ if all its minimum disconnecting sets are trivial. Analogously, G is called super-λ if it is maximally arcconnected and all its minimum arc-disconnecting sets are trivial. It is first proved that any bipartite digraph G with diameter D is super-κ if D ≤ 2` − 1, and it is super-λ if D ≤ 2`, where ` denotes a parameter related to the number of...

one fundamental strategy for increasing efficiency of plans which aim to develop natural resources is decreasing water loss and using this restricted water optimally. in arid and semi-arid regions such as a large part of iran, increasing period of irrigation which results in decreasing the irrigation costs, without causing water stress to planted sapling is a vital task. in this research we exa...