Data envelopment analysis (DEA) is a technique based on linear programming (LP) to measure the relative efficiency of homogeneous units by considering inputs and outputs. The lack of discrimination among efficient decision making units (DMUs) and unrealistic input-outputs weights have been known as the drawback of DEA. In this paper the new scheme based on a goal programming data envelopment an...

This paper adopts two mathematical approaches, data envelopment analysis (DEA) and grey relation analysis (GRA) to measure DEA efficiency using the sample of 69 listed US internet companies. A total of 40 indicators were initially selected for the efficiency evaluation, with 21 related to DEA-input indicators and 19 to DEAoutput indicators. Eight representative indicators selected using GRA are...

The treatment of supersymmetry is known to cause difficulties in the C∗–algebraic framework of relativistic quantum field theory; several no–go theorems indicate that super–derivations and super–KMS functionals must be quite singular objects in a C∗–algebraic setting. In order to clarify the situation, a simple supersymmetric chiral field theory of a free Fermi and Bose field defined on R is an...

the investigation of dimensional efficiency for branches of maskan bank in resources collection and facilities allocation: approach of super efficiency model with weight restrictions. the scarcity of financial resources of banks, especially in developing countries like as iran, leads to planning for improving efficiency and productivity. improving efficiency needs to performance measurement and...

A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a balance between the inherent efficiency of centralized search, and the autonomy, load balancing and robustness to attacks provided by distributed search. Furthermore, they take advantage of the heterogeneity of capabilitie...

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...

this research was carried out to evaluate the effect of super-absorbent and manure on growth, yield, physiological and biochemical characteristics of geranium under deficit irrigation at research greenhouse of faculty of agriculture, lorestan university, iran, in 2014. the experiment was arranged factorially based on a completely randomized design with six replications. factor a was substrate c...

Lovell and Rouse (LR) have recently proposed a modification of the standard DEA model that overcomes the infeasibility problem often encountered in computing super-efficiency. In the LR procedure one appropriately scales up the observed input vector (scale down the output vector) of the relevant superefficient firm thereby usually creating its inefficient surrogate. An alternative procedure pro...