this paper introduces discretionary imprecise data in data envelopment analysis (dea) and discusses the efficiency evaluation of decision making units (dmus) with non-discretionary imprecise data. then, suggests a method for evaluation the efficiency of dmus with non-discretionary imprecise data. when some inputs and outputs are imprecise and non-discretionary, the dea model becomes non-linear ...

The virtual learning community is an important application pattern of E-Learning. It emphasizes the cooperation of the members in the community, the members would like to share their learning resources, to exchange their experience and complete the study task together. This instructional mode has already been proved as an effective way to improve the quality and efficiency of instruction. At th...

Introduction: Data envelopment analysis (DEA) is a data-oriented method for measuring and benchmarking the relative efficiency of peer decision making units (DMUs) with multiple inputs and multiple outputs. DEA was initiated in 1978 when Charnes, Cooper and Rhodes (CCR) demonstrated how to change a fractional linear measure of efficiency into a linear programming format. This non-parametric app...

• A rhodamine-based CDs (CDs-Rho) ratiometric nanosensor was fabricated. CDs-Rho displayed a selective, sensitive and low limit detection towards Hg 2+ . Cellulose hydrogel slices with (CCR) were continuously prepared by microtomy. CCR showed over 95% uptake efficiency good ability for The purified water after treated exhibited biocompatibility. Mercury ions are one of the most toxic heavy meta...

In this paper, the efficiency of the performance of some independent units of police organization was evaluated to optimize the total used inputs and the total produced outputs of each unit. For this purpose, with regard to the efficiency and inefficiency of each unit, based on the location of the units to one another, and also due to the limitations on number and the way of transferring the fo...

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

The growth-inhibitory effect of cyclocreatine (CCr) and the kinetics of CCr and Na+ cotransport were investigated in MCF7 human breast cancer cells and its adriamycin-resistant subline with use of 31P- and23Na-NMR spectroscopy. The growth-inhibitory effect in the resistant line occurred at a lower CCr concentration and was more pronounced than in the wild-type line. This correlated with an ∼10-...

Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q ≤ 2p− 3. Furthermore, if G is super edge-magic and q = 2p− 3, then the girth of G is 3. It is also known that if the girth of G is at least 4 and G is super edge-magic then q ≤ 2p − 5. In this paper we show that there are infinitely many graphs which are super edge-magic, have girth 5, and q =...