Review of Methods for Increasing Discrimination in Data Envelopment Analysis

We present a review of methods for increasing discrimination between efficient DMUs in Data Envelopment Analysis. These methods were classified into two groups: those that incorporate a priori information and those that do not use or minimize the use of such a priori information. We also compare these methodologies regarding their specific characteristics.     

矩形掺杂光子晶体中电磁波的模式和缺陷模

利用一维矩形掺杂光子晶体中电磁波横向受限的条件,推导出电磁波在其中各个模式满足的关系式,利用它研究了电磁波各模式的特性.利用特征法研究了电磁波的缺陷模随模式量子数和矩形边长的变化规律,得出了一维矩形掺杂光子晶体缺陷模的新结构.     

平衡增加的经验欧氏似然

经验(欧氏)似然方法是近年来非常流行的一种非参数统计方法.针对经验(欧氏)似然的凸包限制和计算复杂问题,本文借助Emerson和Owen (2009)所提出的平衡增加思想对经验欧氏似然进行修正,得到了平衡增加的经验欧氏似然.随后论文从理论和模拟两个方面进行了研究.理论上给出了该方法与经验欧氏似然检验函数之间的联系,即在固定的样本量n下随着添加点位置的连续变化,检验方法可以从简单的均值增加经验欧氏似然变化到经验欧氏似然检验;模拟结果显示,适当选取调整因子,平衡增加的经验欧氏似然相对于(调整)经验欧氏似然而言,在大多数情况下,其分布更接近于对应的极限分布.     

Supereulerian regular matroids without small cocircuits

A cycle of a matroid is a disjoint union of circuits. A matroid is supereulerian if it contains a spanning cycle. To answer an open problem of Bauer in 1985, Catlin proved in [J. Graph Theory 12 (1988) 29–44] that for sufficiently large $n$, every 2-edge-connected simple graph $G$ with $\text{◂=▸}n=\mid V\left(G\right)\mid$ and minimum degree $\text{◂≥▸}\delta \left(G\right)\ge \frac{n}{5}$ is supereulerian. In [Eur. J. Combinatorics, 33 (2012), 1765–1776], it is shown that for any connected simple regular matroid $M$, if every cocircuit $D$ of $M$ satisfies $\text{◂≥▸}\mid D\mid \ge \max \left\{\frac{\text{◂−▸}r\left(M\right)-5}{5},6\right\}$, then $M$ is supereulerian. We prove the following. (i) Let $M$ be a connected simple regular matroid. If every cocircuit $D$ of $M$ satisfies $\text{◂≥▸}\mid D\mid \ge \max \left\{\frac{\text{◂+▸}r\left(M\right)+1}{10},9\right\}$, then $M$ is supereulerian. (ii) For any real number $c$ with , there exists an integer $f\left(c\right)$ such that if every cocircuit $D$ of a connected simple cographic matroid $M$ satisfies $\mid D\mid \ge \text{◂lim▸}\max \text{◂{}▸}\{c\text{◂()▸}\left(r\left(M\right)+1\right),f\left(c\right)\}$, then $M$ is supereulerian.