Zero weights and non-zero slacks: Different solutions to the same problem

This paper re-assesses three independently developed approaches that are aimed at solving the problem of zero-weights or non-zero slacks in Data Envelopment Analysis (DEA). The methods are weights restricted, non-radial and extended facet DEA models. Weights restricted DEA models are dual to envelopment DEA models with restrictions on the dual variables (DEA weights) aimed at avoiding zero values for those weights; non-radial DEA models are envelopment models which avoid non-zero slacks in the input-output constraints. Finally, extended facet DEA models recognize that only projections on facets of full dimension correspond to well defined rates of substitution/transformation between all inputs/outputs which in turn correspond to non-zero weights in the multiplier version of the DEA model. We demonstrate how these methods are equivalent, not only in their aim but also in the solutions they yield. In addition, we show that the aforementioned methods modify the production frontier by extending existing facets or creating unobserved facets. Further we propose a new approach that uses weight restrictions to extend existing facets. This approach has some advantages in computational terms, because extended facet models normally make use of mixed integer programming models, which are computationally demanding.     

Reconstruction of the Point-Spread Function of the Human Eye Using a New Phase-Retrieval Algorithm

The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change in value.     

Thermal treatment on composite γ-zirconium phosphate-silica

The prepared amorphous γ-ZrP\SiO₂ composite had a complicated composition, since a part of γ-ZrP is converted to α-form during the exfoliation of it. The γ-ZrP\SiO₂ composite have specific surface area of 421 m²g^–1. The acidic P–OH groups of the lamellae species placed on the surface (it is ≈1.0 meq g^–1), do not destroy until the temperature of 1030 K. During the thermal treatment the total mass loss of 7.79% was found. This value corresponds to 0.42 mole of H₂O per molecule unit. The water loss process was found very slow, because of the placing of bilamellar species in the composite.     

Two New Eremophilenolides from Ligularia muliensis

Many Ligularia species have long been used as traditional folk medicine for theirantibiotic, antiphlogistic and antitussive activities1, and were found to be an importantsource of eremophilane. In the course of our search for bioactive sesquiterpenoids, w…     

实时任务动态调度算法

任务调度算法是提高多任务系统效率的一种有效途径,特别是在时间紧迫环境下,实时任务调度算法更具有重要的应用价值.在研究建立实时任务调度模型方法的基础上,对模型进行理论分析,提出了实时任务调度的算法,并通过实例加以验证.     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.     

A fluid system with coupled input and output,and its application to bottlenecks in ad hoc networks

This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.     

Some conformally flat spin manifolds, Dirac operators and automorphic forms

In this paper we study Clifford and harmonic analysis on some examples of conformal flat manifolds that have a spinor structure, or more generally, at least a pin structure. The examples treated here are manifolds that can be parametrized by U/Γ where U is a subdomain of either Sn or Rn and Γ is a Kleinian group acting discontinuously on U. The examples studied here include RPn and the Hopf manifolds S¹×Sn−1. Also some hyperbolic manifolds will be treated. Special kinds of Clifford-analytic automorphic forms associated to the different choices of Γ are used to construct explicit Cauchy kernels, Cauchy integral formulas, Green's kernels and formulas together with Hardy spaces and Plemelj projection operators for Lp spaces of hypersurfaces lying in these manifolds.     

活动标形及其在点啮合齿轮传动误差分析中的应用

活动标形法的论述首推苏步青译，佐佐木重夫著《微分几何学》，还有的著作从外微分形式引入活动标形,本文论证取曲面的正交曲率网为参数网时，曲面论的基本公式就是活动标形的微分形式，并用其分析了点啮合齿轮传动误差．