Quadratic data envelopment analysis

Data Envelopment Analysis (DEA) offers a piece-wise linear approximation of the production frontier. The approximation tends to be poor if the true frontier is not concave, eg in case of economies of scale or of specialisation. To improve the flexibility of the DEA frontier and to gain in empirical fit, we propose to extend DEA towards a more general piece-wise quadratic approximation, called Quadratic Data Envelopment Analysis (QDEA). We show that QDEA gives statistically consistent estimates for all production frontiers with bounded Hessian eigenvalues. Our Monte-Carlo simulations suggest that QDEA can substantially improve efficiency estimation in finite samples relative to standard DEA models.     

Effective dimensionality approach to the RKKY interaction in multilayer systems

We consider RKKY interaction in a quasi 2D system with nonparabolic dispersion. In our paper we calculate the RKKY range function assuming the in-layer confinement via effective dimensionality approach. We show, that indirect magnetic exchange in our system can be modelled by the effective spectral dimension which equals one.     

物体内部三维位移场分析的数字图像相关方法

提出了物体内部三维位移场的数字图像相关分析方法，对物体变形前后，或连续变形的两个相邻状态的内部三维结构的数字图像，通过相关运算获得三维位移场.文中给出了三维相关法的体搜索窗口、相关函数及亚像素运算的相关系数拟合函数.数字模拟结果证明了三维相关法的正确性及可靠性.位移计算精度为0.02像素. 关键词： 数字图像相关 三维相关 亚像素     

A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.     

The operational performance of the Yale ESTU

The ESTU began operation in 1988 and achieved the design voltage of 20 MV in 1990. Since that time, improvements to the gas handling system, negative ion injector, accelerator terminal and control system have greatly increased its capability and reliability. Today, the ESTU can efficiently produce an extensive assortment of stable ions at wide-ranging energies in support of low-energy nuclear physics.     

Application of pressure sensitive paint measurement to a low-solidity cascade diffuser of a transonic centrifugal compressor

A pressure sensitive paint (PSP) measurement has been known as a pressure field measurement technique based on the oxygen quenching phenomenon of luminescence of specific luminophores. A PSP measurement was applied for pressure field measurement in a low-solidity circular cascade diffuser of a single-stage transonic centrifugal compressor with 5 in pressure ratio for HFC134a gas. The oxygen concentration was about 500 ppm. Ru (bath-phen) was adsorbed on a silica-gel thinlayer chromatography sheet, and the sheet was pasted onto the side-wall between the cascade vanes. A drastic change in luminescent intensity was recognized during a surge condition. Also the pressure variations based on luminescent intensity agreed well with the pressure fluctuations measured using a semiconductor pressure sensor with high-frequency-response. It was shown that a PSP measurement worked well to investigate the unsteady pressure fields in a circular cascade diffuser of a transonic centrifugal compressor. Moreover, the time response of PSP becomes clear as a problem to be overcome for the present.     

迈克尔逊干涉仪中补偿板与干涉条纹

通过分析缺失补偿板的迈克尔逊干涉仪中的附加光程差,推出干涉条纹满足的方程式,并用计算机模拟了动镜移动过程中变化的干涉条纹,与实验结果相一致.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.