Chapter 1 Introduction: Extensions and new developments in DEA

The extensions, new developments and new interpretations for DEA covered in this paper include: (1) new measures of efficiency, (2) new models and (3) new ways of implementing established models with new results and interpretations presented that include treatments of congestion, returns-to-scale and mix and technical inefficiencies and measures of efficiency that can be used to reflect all pertinent properties. Previously used models, such as those used to identify allocative inefficiencies, are extended by means of assurance region approaches which are less demanding in their information requirements and underlying assumptions. New opportunities for research are identified in each section of this chapter. Sources of further developments and possible sources for further help are also suggested with references supplied to other papers that appear in this volume and which are summarily described in this introductory chapter.     

Chapter 3:inertia preservers

Let Vdenote either the space of n×n hermitian matrices or the space of n×nreal symmetric matrices, Given nonnegative integers r,s,t such that r+S+t=n, let G( r,s,r) denote the set of all matrices in V with inertia (r,s,t). We consider here linear operators on V which map G(r,s,t) into itself.     

Chapter 3:inertia preservers

Let Vdenote either the space of n×n hermitian matrices or the space of n×nreal symmetric matrices, Given nonnegative integers r,s,t such that r+S+t=n, let G( r,s,r) denote the set of all matrices in V with inertia (r,s,t). We consider here linear operators on V which map G(r,s,t) into itself.     

Chapter 9: miscellaneous preserver problems

This chapter consists of three sections of miscellaneous results. Each is self contained with its own abstract, but the references are in one group at the very end of the chapter. The first section considers matrices over semirings. The second concerns a function on a matrix space M which commutes with a linear operator on M. The third considers linear operators preserving certain properties associated with positive semidefinite matrices.     

Chapter 2:rank and tensor rank

Let Vbe a vector space of matrices over a field and ka fixed positive integer. In this chapter we first survey results concerning linear maps on certain types of Vthat preserve one of the following:(a) the set of rank kmatrices, (b) the set of matrices of rank less than k. We next survey results concerning linear maps on certain symmetry classes of tensors that preserve nonzero decomposable elements.     

Chapter 1. Extension of the fundamental theorem of finite semigroups

This paper proves that some useful commutivity relations exist among semigroup wreath product factors that are either groups or combinatorial “units” U₁, U₂, or U₃. Using these results it then obtains some characterizations of each of the classes of semigroups buildable from U₁'s, U₂'s, and groups (“buildable” meaning “dividing a wreath product of”).We show that up to division U₁'s can be moved to the right and U₂'s, and groups to the left over other units and groups, if it is allowed that the factors involved be replaced by their direct products, or in the case of U₂, even by a wreath product. From this it is deduced that U₁'s and U₂'s do not affect group complexity, that any semigroup buildable from U₁'s, U₂'s, and groups has group complexity 0 or 1, and that all such semigroups can be represented, up to division, in a canonical form—namely, as a wreath product with all U₁'s on the right, all U₂'s on the left, and a group in the middle. This last fact is handy for developing charactérizations.An embedding theorem for semigroups with a unique 0-minimal ideal is introduced, and from this and the commutivity results and some constructions proved for RLM semigroups, there is obtained an algebraic characterization for each class of semigroups that is a wreath product-division closure of some combination of U₁'s, U₂'s, and the groups. In addition it is shown, for i = 1,2,3, that if the unit U_i does not divide a semigroup S, then S can be built using only groups and units not containing U_i. Thus, it can be deduced that any semigroup which does not contain U₃ must have group complexity either 0 or 1. This then establishes that indeed U₃ is the determinant of group complexity, since it is already proved that both U₁ and U₂ are transparent with regard to the group complexity function, and it is known that with U₃ (and groups) one can build semigroups with complexities arbitrarily large. Another conclusion is a combinatorial counterpart for the Krohn-Rhodes prime decomposition theorem, saying that any semigroups can be built from the set of units which divide it together with the set of those semigroups not having unit divisors. Further, one can now characterize those semigroups which commute over groups, showing a semigroup commutes to the left over groups iff it is “R₁” (i.e., does not contain U₁, i.e., is buildable form U₂'s and groups), and commutes to the right over groups iff it does not contain U₂ (i.e., is buildable from groups and U₁'s). Finally, from the characterizations and their proofs one sees some ways in which groups can do the work of combinatorials in building combinatorial semigroups.     

隐变量分析简介(一)

准备系统的介绍隐变量分析的主要内容。此文重点介绍通径图及有关概念、术语。     

Graph-like spaces: An introduction

Thomassen and Vella (Graph-like continua, augmenting arcs, and Menger’s Theorem, Combinatorica, doi:10.1007/s00493-008-2342-9) have recently introduced the notion of a graph-like space, simultaneously generalizing infinite graphs and many of the compact spaces recently used by Diestel or Richter (and their coauthors) to study cycle spaces and related problems in infinite graphs. This work is a survey to introduce graph-like spaces and shows how many of these works on compact spaces can be generalized to compact graph-like spaces.     

Hierarchical optimization: An introduction

Decision problems involving multiple agents invariably lead to conflict and gaming. In recent years, multi-agent systems have been analyzed using approaches that explicitly assign to each agent a unique objective function and set of decision variables; the system is defined by a set of common constraints that affect all agents. The decisions made by each agent in these approaches affect the decisions made by the others and their objectives. When strategies are selected simultaneously, in a noncooperative manner, solutions are defined as equilibrium points [13,51] so that at optimality no player can do better by unilaterally altering his choice. There are other types of noncooperative decision problems, though, where there is a hierarchical ordering of the agents, and one set has the authority to strongly influence the preferences of the other agents. Such situations are analyzed using a concept known as a Stackelberg strategy [13, 14,46]. The hierarchical optimization problem [11, 16, 23] conceptually extends the open-loop Stackelberg model toK players. In this paper, we provide a brief introduction and survey of recent work in the literature, and summarize the contributions of this volume. It should be noted that the survey is not meant to be exhaustive, but rather to place recent papers in context.     

On fuzzy multi-valued functions Part 1: Introduction and general properties

In this paper a concept of fuzzy multi-valued function is introduced and other related objects are defined. Next their properties, that assume no topological structure, are presented.     

Chapter 5: linear preservers on functions of Singular values

Many authors have studied linear preservers on functions of singular values. If the functions are suitably chosen, the problem reduces to the characterization of linear isometrics of unitarily invariant norms on matrices. In this chapter we survey the results on these subjects.     

Chapter 1 Combined method of iterative integral penalty and stochastic quasigradients for semi-infinite optimization

Chapter 1 Combined method of iterative integral penalty and stochastic quasigradients for semi-infinite optimization