this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

This note is motivated by the similarity between multiobjective programming (MOP) and bargaining theory. It uses the known MOP concepts to establish two new bargaining results: (1) the efficiency of KalaiSmorodinsky (KS) and Nash (NA) solutions for large classes of bargaining problems can be refined to the sharper concept of proper efficiency; (2) the independence of irrelevant alternatives (II...

One of the security issues in data outsourcing is the enforcement of the data owner’s access control policies. This includes some challenges. The first challenge is preserving confidentiality of data and policies. One of the existing solutions is encrypting data before outsourcing which brings new challenges; namely, the number of keys required to access authorized resources, efficient policy u...

A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envyfree, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are satisfied, however many cuts are made. It turns out that two of the three properties can be satisfied by ...

Fair Division, unlike most research on fairness in the social sciences and mathematics, is devoted solely to the analysis of constructive procedures for actually dividing things up and resolving disputes, including...

The first integral method is an efficient method for obtaining exact solutions of some nonlinear partial differential equations. This method can be applied to non integrable equations as well as to integrable ones. In this paper, the first integral method is used to construct exact solutions of the 2D Ginzburg-Landau equation.

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.