基于虚拟决策单元的排序模型

本文给出了一种新的决策单元排序方法。基于经典的C²R模型,通过引入一个虚拟的决策单元,形成了一个新的排序模型,按照相对效率值的大小实现了决策单元的排序。实验表明,新排序方法不仅能较好地反映C²R模型的计算结果,而且可避免超效率方法造成的相对效率值偏大的弊端。新的排序方法依据充分、简单方便,同时体现了整体的决策效率。     

一种新的带有参数的DEA有效单元排序模型

本文对数据包络分析中的有效单元排序方法进行了研究, 从一个新 的角度,定义最优有效和最劣无效, 提出了一种带有参数的有效单元排序模型.本文还给出并证明了此模型的一些性质, 并与其他排序模型进行了比较, 证明了本文模型的优越性. 最后用一个实例, 检验了此模型的可行性.     

基于交叉评价策略的DEA灰色关联排序模型北大核心

数据包络分析(DEA)是评价决策单元相对效率的有效方法,其中的交叉效率评价方法可用来对决策单元进行区分排序.针对原有模型中交叉效率值的不唯一问题,结合灰色关联分析思想,构建理想决策单元,定义各决策单元与理想决策单元的灰色关联度,以灰色关联度值最大为目标,建立优化模型来计算输入和输出指标的最佳权重,据此得出决策单元的交叉效率值,实现对决策单元的完全排序.最后通过算例来验证模型的有效性和实用性.     

带有随机决策单元的广义数据包络分析方法

广义DEA方法是一种相对效率评价方法,解决了决策单元相对于任意参考系(样本单元集)的效率比较问题.在实际中,有时评价标准是确定的,决策单元的生产具有不确定性,有必要在进行生产之前基于确定性样本单元对随机性决策单元进行相对效率评价.为了解决这个问题,研究样本单元为确定值,决策单元为随机变量的广义DEA模型,分别通过期望值和机会约束将随机模型转化为确定性规划,给出决策单元GEDEA有效和GCDEA有效的概念,GEDEA有效与多目标规划Pareto有效关系,以及利用移动因子对决策单元进行有效性排序方法.     

基于交叉评价策略的DEA灰色关联排序模型

数据包络分析(DEA)是评价决策单元相对效率的有效方法,其中的交叉效率评价方法可用来对决策单元进行区分排序.针对原有模型中交叉效率值的不唯一问题,结合灰色关联分析思想,构建理想决策单元,定义各决策单元与理想决策单元的灰色关联度,以灰色关联度值最大为目标,建立优化模型来计算输入和输出指标的最佳权重,据此得出决策单元的交叉效率值,实现对决策单元的完全排序.最后通过算例来验证模型的有效性和实用性.     

一种基于虚拟决策单元的排序方法的完善和扩展

本文对文[1]中提出的基于虚拟决策单元的排序方法进行了完善和扩展。首先,根据CCR模型,给出了两类特殊的DEA模型,分别是仅有投入数据的DEA模型和仅有产出数据的DEA模型;其次,基于这两个模型,应用上述方法实现了对仅有投入(或产出)数据的决策单元的排序;第三,给出了排序方法中参数a的计算方法;最后,通过修正排序模型,有效提高了排序方法的计算精度。改进后的排序方法避免了两个决策单元因为相对效率值过小而不能排序的情形,其应用范围也进一步扩大。     

对DEA中有效单元排序的一种新方法

文章对数据包络分析(DEA)的强有效性问题提出了一种新的研究方法.利用有效值和负有效值来构造复合输入和输出这种方法可以实现有效决策单元的完全排序.文章还给出了新方法中模型的一些性质.最后,用两个例子来检验此方法并和其他模型的计算结果进行了比较.     

带有随机样本单元的广义数据包络分析方法

广义数据包络分析(Generalized data envelopment analysis)方法是一种相对效率评价方法,能够获得决策单元相对于样本单元的比较信息.研究了基于随机样本单元对确定性决策单元进行评价的广义DEA模型,利用期望值和机会约束,将其转化为确定性规划.给出了决策单元GEDEA有效和GCDEA有效的概念及其判别,与多目标规划Pareto有效关系,以及利用移动因子进行有效性排序.     

基于SMAA和公共权重的决策单元效率评价与排序

在数据包络分析(DEA)中,公共权重模型是决策单元效率评价与排序的常用方法之一。与传统DEA模型相比,公共权重模型用一组公共的投入产出权重评价所有决策单元,评价结果往往更具有区分度且更为客观。本文考虑决策单元对排序位置的满意程度,提出了基于最大化最小满意度和最大化平均满意度两类新的公共权重模型。首先,基于随机多准则可接受度分析(SMAA)方法,计算出每个决策单元处于各个排名位置的可接受度;然后,通过逆权重空间分析,分别求得使最小满意度和平均满意度最大化的一组公共权重;最后,利用所求的公共权重,计算各决策单元的效率值及相应的排序。算例分析验证了本文提出的基于SMAA的公共权重模型用于决策单元效率评价与排序的可行性。     

有序信息在空间立方体抽样中的拓展研究

在空间调查领域中,分布良好的样本中很少会同时出现彼此接近的单元.将地理坐标作为平衡变量的立方体法存在无法捕捉总体单元的空间依赖性的不足.文章在立方体法能有效捕获总体空间趋势的基础上,创新性地引入系统抽样的思想.文章提出的抽样设计方法在保持单元空间相对位置的同时,充分利用地理坐标信息,集中相似单元点获得有序总体,使原先总体具有“空间趋势”.首先,在保持空间相关性的前提下,将抽样单元排序问题转换为单源最短路径问题.然后,利用Dijkstra算法获得有序总体,在快速立方体法的飞行阶段更新初始包含概率进行有序空间抽样.最后,通过模拟研究和实证分析表明对空间总体按照相似单元彼此靠近的原则进行排序,可减少抽样误差,获得较为均衡的样本,从而验证所提抽样思路的可行性.     

Reliability analysis of a stand-by system with repair and intermediate stocks for failed and repaired units

In this paper we give a reliability analysis of a stand-by system with repair, consisting of N working and N^R stand-by units. Failed and repaired units are collected in intermediate stocks. Concerning the delivery from the intermediate stocks we consider two rules: (i) the collected units are delivered in fixed time intervals; (ii) the units will be delivered when there are k units accumulated. The system fails if a unit that has failed cannot be replaced by a stand-by unit. Using a point process approach we derive approximations for the stationary availability and mean time between failures of the system. Numerical results show that the proposed approximations, which can be handled easily, work well.     

Maintenance optimization on parallel production units

The optimal preventive-maintenance schedule for a productionsystem consisting of N identical parallel production units isinvestigated. The lifetimes of the units are IFR-distributed,i.e. with an increasing failure rate, and are supposed to bestatistically independent. The relevant costs are due to productionlosses, which are increasing and convex in the number of unitsthat are out of operation simultaneously. Actual maintenancecosts (either preventive or corrective) are supposed to be negligibleas compared to the costs due to these production losses. First we consider the apparently trivial case of geometric (discrete-time)or exponential (continuous-time) lifetime distributions forthe units. In this situation, preventive maintenance cannotimprove the condition of a unit. Hence, apparently the onlyrelevant policy is to do corrective maintenance on failed units.However, the analysis reveals that this conclusion is not correct.It turns out that taking non-failed units out of operation deliberatelycan be better than restricting to corrective maintenance only. We first show that, in the case of geometrically distributedlifetimes and unit repair times, the optimal preventive–maintenancepolicy is characterized by a single control limit K. Wheneverthe number of working units is less than or equal to K, no unitsare taken out of operation, while i – K units are setapart whenever i ( > K) units are operational. Next we consider the case with exponentially distributed lifetimesand repair times. Moreover, we assume that the repair capacityis limited, in the sense that only s ( N) units can be underrepair simultaneously. We show that, also in this case, it canbe optimal to take a working unit out of operation until thenext decision epoch (which is either a failure epoch or a repaircompletion epoch). It is shown that the optimal policy has aweak monotonicity property: the number of units which remainin operation increases with the number of available units. However,it is not necessarily true that, under the optimal policy, thenumber of units in standby position increases with the numberof available units. Numerical examples are presented which illustrate that, fora wide range of parameter values, the easiest policy (only performcorrective maintenance on failed units) performs rather wellas compared to the overall optimal policy. Finally we consider the possible extension to the practicallymore interesting case of non-exponential lifetime distributions.In particular, we assume that the lifetimes are composed oftwo non-identical exponential phases. A unit in its first lifephaseis called ‘good’, while a unit in its second phaseis called "doubtful". In this situation, one has the optionto put a good or doubtful unit in standby position until thenext decision epoch or to perform preventive maintenance ona doubtful unit. The latter brings a unit back from the doubtfulinto the good state. An indication is given of the problemsthat arise in generalizing the results obtained for the exponentialcase.     

An Alternative Model for Queueing Systems with Single Arrivals,Batch Services and Customer Coalescence

In this paper we consider a queueing system with single arrivals, batch services and customer coalescence and we use it as a building block for constructing queueing networks that incorporate such characteristics. Chao et al. (1996) considered a similar model and they proved that it possesses a geometric product form stationary distribution, under the assumption that if the number of units present at a service completion epoch is less than the required number of units, then all the units coalesce into an incomplete (defective) batch which leaves the system. We drop this assumption and we study a model without incomplete batches. We prove that the stationary distribution of such a queue has a nearly geometric form. Using quasi-reversibility arguments we construct a network model with such queues which provides relevant bounds and approximations for the behaviour of assembly processes. Several issues about the validity of these bounds and approximations are also discussed.     

具有随机隐单元的渐增前馈神经网络的$L^2(R^d)$逼近能力

This paper studies approximation capability to L2(Rd) functions of incremental constructive feedforward neural networks(FNN) with random hidden units.Two kinds of therelayered feedforward neural networks are considered:radial basis function(RBF) neural networks and translation and dilation invariant(TDI) neural networks.In comparison with conventional methods that existence approach is mainly used in approximation theories for neural networks,we follow a constructive approach to prove that one may simply randomly choose parameters of hidden units and then adjust the weights between the hidden units and the output unit to make the neural network approximate any function in L2(Rd) to any accuracy.Our result shows given any non-zero activation function g :R+→R and g(x Rd) ∈ L2(Rd) for RBF hidden units,or any non-zero activation function g(x) ∈ L2(Rd) for TDI hidden units,the incremental network function fn with randomly generated hidden units converges to any target function in L2(Rd) with probability one as the number of hidden units n→∞,if one only properly adjusts the weights between the hidden units and output unit.     

具有阿贝尔Sylow 2-子群的有限群的整群环的正规化子性质

Mazur猜想:具有阿贝尔Sylow 2-子群的有限群有正规化子性质.设G是一个有限群,N是G的一个正规子群且Z(G/N)仅有平凡单位,本文建立了由Z(G/N)中单位诱导的G的自同构与N的Coleman自同构之间的联系,在此基础上证明了若G是一个具有阿贝尔Sylow 2-子群的有限群且Z(G/F*(G))仅有平凡单位,则Mazur猜想对G成立.     

Elliptic units and sign functions

In the first part of this paper we give a new definition of the elliptic analogue of Sinnott’s group of circular units. In this we essentially use the ideas discussed in Oukhaba (in Ann Inst Fourier, 55(33):753–772, 2005). In the second part of the paper we are interested in computing the index of this group of elliptic units. This question is closely related to the behaviour of the universal signed ordinary distributions introduced in loc. cit. Such distributions have a natural resolution discovered by Anderson. Consequently, we can apply Ouyang’s general index formula and the powerful Anderson’s theory of double complex to make the computations     

Bilevel control of degraded machining system with warm standbys, setup and vacation

In this paper, we study (N, L) switch-over policy for machine repair model with warm standbys and two repairmen. The repairman (R₁) turns on for repair only when N-failed units are accumulated and starts repair after a set up time which is assumed to be exponentially distributed. As soon as the system becomes empty, the repairman (R₁) leaves for a vacation and returns back when he finds the number of failed units in the system greater than or equal to a threshold value N. Second repairman (R₂) turns on when there are L(>N) failed units in the system and goes for a vacation if there are less than L failed units. The life time and repair time of failed units are assumed to be exponentially distributed. The steady state queue size distribution is obtained by using recursive method. Expressions for the average number of failed units in the queue and the average waiting time are established.     

Super-efficiency in DEA by effectiveness of each unit in society

One of the most important topics in management science is determining the efficiency of Decision Making Units (DMUs). The Data Envelopment Analysis (DEA) technique is employed for this purpose. In many DEA models, the best performance of a DMU is indicated by an efficiency score of one. There is often more than one DMU with this efficiency score. To rank and compare efficient units, many methods have been introduced under the name of super-efficiency methods. Among these methods, one can mention Andersen and Petersen’s (1993) [1] super-efficiency model, and the slack-based measure introduced by Tone (2002) [4]. Each of the methods proposed for ranking efficient DMUs has its own advantages and shortcomings. In this paper, we present a super-efficiency method by which units that are more effective and useful in society have better ranks. In fact, in order to determine super-efficiency by this method, the effectiveness of each unit in society is considered rather than the cross-comparison of the units. To do so, we divide the inputs and outputs into two groups, desirable and undesirable, at the discretion of the manager, and assign weights to each input and output. Then we determine the rank of each DMU according to the weights and the desirability of inputs and outputs.     

Resource allocation based on cost efficiency

In this paper, we consider a resource allocation (RA) problem and develop an approach based on cost (overall) efficiency. The aim is to allocate some inputs among decision making units (DMUs) in such way that their cost efficiencies improve or stay unchanged after RA. We formulate a multi-objective linear programming problem using two different strategies. First, we propose an RA model which keeps the cost efficiencies of units unchanged. This is done assuming fixed technical and allocative efficiencies. The approach is based on the assumption that the decision maker (DM) may not have big changes in the structure of DMUs within a short term. The second strategy does not impose any restrictions on technical and allocative efficiencies. It guarantees that none of the cost efficiencies of DMUs get worse after RA, and the improvement for units is possible if it is feasible and beneficial. Two numerical examples and an empirical illustration are also provided.     

Problem solving activities of two middle school students with distinct levels of units coordination

The aim of this study is to investigate relationships between students’ arithmetical knowledge and their proportional reasoning. Two of seven students for whom we conducted clinical interviews were selected as participants in the study. An analysis of their solutions to four different types of multiplicative problems (equal sharing, reversible multiplicative relationship, fraction composition, and proportional relationship) was conducted. Based on the analysis, we found that the student who coordinated two three-level units structures prior to activity in the first three problem types could also solve the proportion problem using the units coordination. In contrast, the student who coordinated two three-level units structures only in activity in the first three problem types could not solve the proportion problem. Given the importance of units coordinating operations in solving diverse problems, implications for further research on students’ construction of proportional reasoning are discussed.