基于串联两阶段网络DEA模型的供应链规模收益分析

数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论.     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

The push-out region of an immersed manifold

We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

Non‐empirical calculations of NMR indirect carbon–carbon coupling constants. Part 4: Bicycloalkanes

A systematic study of the one‐bond and long‐range J(C,C), J(C,H) and J(H,H) in the series of nine bicycloalkanes was performed at the SOPPA level with special emphasis on the coupling transmission mechanisms at bridgeheads. Many unknown couplings were predicted with high reliability. Further refinement of SOPPA computational scheme adjusted for better performance was carried out using bicyclo[1.1.1]pentane as a benchmark to investigate the influence of geometry, basis set and electronic correlation. The calculations performed demonstrated that classical ab initio SOPPA applied with the locally dense Dunning's sets augmented with inner core s‐functions used for coupled carbons and Sauer's sets augmented with tight s‐functions used for coupled hydrogens performs perfectly well in reproducing experimental values of different types of coupling constants (the estimated reliability is ca 1–2 Hz) in relatively large organic molecules of up to 11 carbon atoms. Additive coupling increments were derived for J(C,C), J(C,H) and J(H,H) based on the calculated values of coupling constants within SOPPA in the model bicycloalkanes, in reasonably good agreement with the known values obtained earlier on pure empirical grounds. Most of the bridgehead couplings in all but one bicycloalkane appeared to be essentially additive within ca 2–3 Hz while bicyclo[1.1.1]pentane demonstrated dramatic non‐additivity of ?14.5 Hz for J(C,C), +16.6 Hz for J(H,H) and ?5.5 Hz for J(C,H), in line with previous findings. Non‐additivity effects in the latter compound established at the SOPPA level should be attributed to the through‐space non‐bonded interactions at bridgeheads due to the essential overlapping of the bridgehead rear lobes which provides an additional and effective non‐bonding coupling path for the bridgehead carbons and their protons in the bicyclopentane framework. Copyright © 2003 John Wiley & Sons, Ltd.     

Probability Interpretation of the Integral of Fractional Order

We establish a relation between stable distributions in probability theory and the fractional integral. Moreover, it turns out that the parameter of the stable distribution coincides with the exponent of the fractional integral. It follows from an analysis of the obtained results that equations with the fractional time derivative describe the evolution of some physical system whose time degree of freedom becomes stochastic, i.e., presents a sum of random time intervals subject to a stable probability distribution. We discuss relations between the fractal Cantor set (Cantor strips) and the fractional integral. We show that the possibility to use this relation as an approximation of the fractional integral is rather limited.     

凸合成模糊对策的模糊稳定集

本建立了凸合成模糊对策的模型，并得到了凸合成模糊对策的模糊稳定集，可由子对策的模糊稳定集表达出来。从而解决了凸合成模糊对策的解的结构问题。     

障碍拟阵图

Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.