A major drawback of Mean-Variance and Stochastic Dominance investment criteria is that they may fail to determine dominance even in situations when all “reasonable” decision-makers would clearly prefer one alternati...A major drawback of Mean-Variance and Stochastic Dominance investment criteria is that they may fail to determine dominance even in situations when all “reasonable” decision-makers would clearly prefer one alternative over another. Leshno and Levy [1] suggest Almost Stochastic Dominance (ASD) as a remedy. This paper develops algorithms for deriving the ASD efficient sets. Empirical application reveals that the improvement to the efficient sets implied by ASD is substantial (64% reduction for FSD). Direct expected utility maximization shows that investment portfolios excluded from the ASD efficient set would not have been chosen by any investors with reasonable preferences.展开更多
Given a finite simple graph G, a set D ⊆V(G) is called a dominating set if for all v ∈ V(G) , either v ∈ D or v is adjacent to some vertex in D. A dominating set D is independent if none of the vertices in...Given a finite simple graph G, a set D ⊆V(G) is called a dominating set if for all v ∈ V(G) , either v ∈ D or v is adjacent to some vertex in D. A dominating set D is independent if none of the vertices in D are adjacent, and D is perfect if each vertex not in D is adjacent to precisely one vertex in D. If a dominating set is both independent and perfect, then it is called an efficient dominating set. For a graph G, a set D is called a unique efficient dominating set of G if it is the only efficient dominating set of G. In this paper, the authors propose the definition of unique efficient dominating set, explore the properties of graphs with unique efficient dominating sets, and completely characterize several families of graphs which have unique efficient dominating sets.展开更多
In this paper, we propose a class of estimators for estimating the finite population mean of the study variable under Ranked Set Sampling (RSS) when population mean of the auxiliary variable is known. The bias and Mea...In this paper, we propose a class of estimators for estimating the finite population mean of the study variable under Ranked Set Sampling (RSS) when population mean of the auxiliary variable is known. The bias and Mean Squared Error (MSE) of the proposed class of estimators are obtained to first degree of approximation. It is identified that the proposed class of estimators is more efficient as compared to [1] estimator and several other estimators. A simulation study is carried out to judge the performances of the estimators.展开更多
A heuristic metric is presented to achieve the optimal connected set covering problem （SCP） in sensor networks. The coverage solution with the energy efficiency can guarantee that all targets are fully covered. Amon...A heuristic metric is presented to achieve the optimal connected set covering problem （SCP） in sensor networks. The coverage solution with the energy efficiency can guarantee that all targets are fully covered. Among targets, the crucial ones are redundantly covered to ensure more reliable monitors. And the information collected by the above coverage solution can be transmitted to Sink by the connected data-gathering structure. A novel ant colony optimization （ACO） algorithm--improved-MMAS-ACS-hybrid algorithm （IMAH） is adopted to achieve the above metric. Based on the design of the heuristic factor, artificial ants can adaptively detect the coverage and energy status of sensor networks and find the low-energy-cost paths to keep the communication connectivity to Sink. By introducing the pheromone-judgment-factor and the evaluation function to the pheromone updating rule, the pheromone trail on the global-best solution is enhanced, while avoiding the premature stagnation. Finally, the energy efficiency set can be obtained with high coverage-efficiency to all targets and reliable connectivity to Sink and the lifetime of the connected coverage set is prolonged.展开更多
A multiphysics model for a production scale planar solid oxide fuel cell （SOFC） stack is important for the SOFC technology, but usually requires an unpractical amount of computing resource. The major cause for the h...A multiphysics model for a production scale planar solid oxide fuel cell （SOFC） stack is important for the SOFC technology, but usually requires an unpractical amount of computing resource. The major cause for the huge computing resource requirement is identified as the need to solve the cathode O2 transport and the associated electrochemistry. To overcome the technical obstacle, an analytical model for solving the O2 transport and its coupling with the electrochemistry is derived. The analytical model is used to greatly reduce the numerical mesh complexity of a multiphysics model. Numerical test shows that the analytical approximation is highly accurate and stable. A multiphysics numerical modeling tool taking advantage of the analytical solution is then developed through Fluent@. The numerical efficiency and stability of this modeling tool are further demonstrated by simulating a 30- cell stack with a production scale cell size. Detailed information about the stack performance is revealed and briefly discussed. The multiphysics modeling tool can be used to guide the stack design and select the operating parameters.展开更多
The set-valued optimization problem with constraints is considered in the sense of super efficiency in locally convex linear topological spaces. Under the assumption of iccone-convexlikeness, by applying the seperatio...The set-valued optimization problem with constraints is considered in the sense of super efficiency in locally convex linear topological spaces. Under the assumption of iccone-convexlikeness, by applying the seperation theorem, Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions, the necessary conditions are obtained for the set-valued optimization problem to attain its super efficient solutions. Also, the sufficient conditions for Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions are derived.展开更多
A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condit...A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condition of set-valued optimization under Benson proper efficiency is established, its sufficience is discussed. The form of the optimality conditions obtained here completely tally with the classical results when the set-valued map is specialized to be a single-valued map.展开更多
Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. U...Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.展开更多
In the theory of cooperative transferable utilities games, (TU games), the Efficient Values, that is those which show how the win of the grand coalition is shared by the players, may not be a good solution to give a f...In the theory of cooperative transferable utilities games, (TU games), the Efficient Values, that is those which show how the win of the grand coalition is shared by the players, may not be a good solution to give a fair outcome to each player. In an earlier work of the author, the Inverse Problem has been stated and explicitely solved for the Shapley Value and for the Least Square Values. In the present paper, for a given vector, which is the Shapley Value of a game, but it is not coalitional rational, that is it does not belong to the Core of the game, we would like to find out a new game with the Shapley Value equal to the a priori given vector and for which this vector is also in the Core of the game. In other words, in the Inverse Set relative to the Shapley Value, we want to find out a new game, for which the Shapley Value is coalitional rational. The results show how such a game may be obtained, and some examples are illustrating the technique. Moreover, it is shown that beside the original game, there are always other games for which the given vector is not in the Core. The similar problem is solved for the Least Square Values.展开更多
In this paper, a characterization of tightly properly efficient solutions of set-valued optimization problem is obtained. The concept of the well-posedness for a special scalar problem is linked with the tightly prope...In this paper, a characterization of tightly properly efficient solutions of set-valued optimization problem is obtained. The concept of the well-posedness for a special scalar problem is linked with the tightly properly efficient solutions of set-valued optimization problem.展开更多
This note studies the optimality conditions of vector optimization problems involving generalized convexity in locally convex spaces. Based upon the concept of Dini set-valued directional derivatives, the necessary an...This note studies the optimality conditions of vector optimization problems involving generalized convexity in locally convex spaces. Based upon the concept of Dini set-valued directional derivatives, the necessary and sufficient optimality conditions are established for Henig proper and strong minimal solutions respectively in generalized preinvex vector optimization problems.展开更多
文摘A major drawback of Mean-Variance and Stochastic Dominance investment criteria is that they may fail to determine dominance even in situations when all “reasonable” decision-makers would clearly prefer one alternative over another. Leshno and Levy [1] suggest Almost Stochastic Dominance (ASD) as a remedy. This paper develops algorithms for deriving the ASD efficient sets. Empirical application reveals that the improvement to the efficient sets implied by ASD is substantial (64% reduction for FSD). Direct expected utility maximization shows that investment portfolios excluded from the ASD efficient set would not have been chosen by any investors with reasonable preferences.
文摘Given a finite simple graph G, a set D ⊆V(G) is called a dominating set if for all v ∈ V(G) , either v ∈ D or v is adjacent to some vertex in D. A dominating set D is independent if none of the vertices in D are adjacent, and D is perfect if each vertex not in D is adjacent to precisely one vertex in D. If a dominating set is both independent and perfect, then it is called an efficient dominating set. For a graph G, a set D is called a unique efficient dominating set of G if it is the only efficient dominating set of G. In this paper, the authors propose the definition of unique efficient dominating set, explore the properties of graphs with unique efficient dominating sets, and completely characterize several families of graphs which have unique efficient dominating sets.
文摘In this paper, we propose a class of estimators for estimating the finite population mean of the study variable under Ranked Set Sampling (RSS) when population mean of the auxiliary variable is known. The bias and Mean Squared Error (MSE) of the proposed class of estimators are obtained to first degree of approximation. It is identified that the proposed class of estimators is more efficient as compared to [1] estimator and several other estimators. A simulation study is carried out to judge the performances of the estimators.
文摘A heuristic metric is presented to achieve the optimal connected set covering problem （SCP） in sensor networks. The coverage solution with the energy efficiency can guarantee that all targets are fully covered. Among targets, the crucial ones are redundantly covered to ensure more reliable monitors. And the information collected by the above coverage solution can be transmitted to Sink by the connected data-gathering structure. A novel ant colony optimization （ACO） algorithm--improved-MMAS-ACS-hybrid algorithm （IMAH） is adopted to achieve the above metric. Based on the design of the heuristic factor, artificial ants can adaptively detect the coverage and energy status of sensor networks and find the low-energy-cost paths to keep the communication connectivity to Sink. By introducing the pheromone-judgment-factor and the evaluation function to the pheromone updating rule, the pheromone trail on the global-best solution is enhanced, while avoiding the premature stagnation. Finally, the energy efficiency set can be obtained with high coverage-efficiency to all targets and reliable connectivity to Sink and the lifetime of the connected coverage set is prolonged.
基金This work is supported the National Natural Science Foundation of China （No. 11374272 and No. 11574284）, the National Basic Research Program of China （No.2012CB215405） and Collaborative Innovation Center of Suzhou Nano Science and Technology are gratefully acknowledged.
文摘A multiphysics model for a production scale planar solid oxide fuel cell （SOFC） stack is important for the SOFC technology, but usually requires an unpractical amount of computing resource. The major cause for the huge computing resource requirement is identified as the need to solve the cathode O2 transport and the associated electrochemistry. To overcome the technical obstacle, an analytical model for solving the O2 transport and its coupling with the electrochemistry is derived. The analytical model is used to greatly reduce the numerical mesh complexity of a multiphysics model. Numerical test shows that the analytical approximation is highly accurate and stable. A multiphysics numerical modeling tool taking advantage of the analytical solution is then developed through Fluent@. The numerical efficiency and stability of this modeling tool are further demonstrated by simulating a 30- cell stack with a production scale cell size. Detailed information about the stack performance is revealed and briefly discussed. The multiphysics modeling tool can be used to guide the stack design and select the operating parameters.
基金Supported by the National Natural Science Foundation of China (10461007)the Science and Technology Foundation of the Education Department of Jiangxi Province (GJJ09069)
文摘The set-valued optimization problem with constraints is considered in the sense of super efficiency in locally convex linear topological spaces. Under the assumption of iccone-convexlikeness, by applying the seperation theorem, Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions, the necessary conditions are obtained for the set-valued optimization problem to attain its super efficient solutions. Also, the sufficient conditions for Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions are derived.
文摘A kind of tangent derivative and the concepts of strong and weak * pseudoconvexity for a set-valued map are introduced. By the standard separation theorems of the convex sets and cones the optimality Fritz John condition of set-valued optimization under Benson proper efficiency is established, its sufficience is discussed. The form of the optimality conditions obtained here completely tally with the classical results when the set-valued map is specialized to be a single-valued map.
文摘Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.
文摘In the theory of cooperative transferable utilities games, (TU games), the Efficient Values, that is those which show how the win of the grand coalition is shared by the players, may not be a good solution to give a fair outcome to each player. In an earlier work of the author, the Inverse Problem has been stated and explicitely solved for the Shapley Value and for the Least Square Values. In the present paper, for a given vector, which is the Shapley Value of a game, but it is not coalitional rational, that is it does not belong to the Core of the game, we would like to find out a new game with the Shapley Value equal to the a priori given vector and for which this vector is also in the Core of the game. In other words, in the Inverse Set relative to the Shapley Value, we want to find out a new game, for which the Shapley Value is coalitional rational. The results show how such a game may be obtained, and some examples are illustrating the technique. Moreover, it is shown that beside the original game, there are always other games for which the given vector is not in the Core. The similar problem is solved for the Least Square Values.
文摘In this paper, a characterization of tightly properly efficient solutions of set-valued optimization problem is obtained. The concept of the well-posedness for a special scalar problem is linked with the tightly properly efficient solutions of set-valued optimization problem.
文摘This note studies the optimality conditions of vector optimization problems involving generalized convexity in locally convex spaces. Based upon the concept of Dini set-valued directional derivatives, the necessary and sufficient optimality conditions are established for Henig proper and strong minimal solutions respectively in generalized preinvex vector optimization problems.
