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.     

大学物理课程网络辅助教学系统的构建与应用

本文介绍了上海交通大学大学物理课程网络辅助教学系统的设计思想、整体结构和主要的功能模块，概述了运用网络辅助教学系统实施“课堂教学＋网络辅助教学”：这种教学模式的应用情况．     

激光等离子体2660紫外探针及干涉系统

成功地在六路高功率Nd玻璃激光装置上建立了2660紫外激光探针和适合紫外波段的Normaski干涉仪,首次将可见波长的连续激光应用于紫外干涉仪中靶成像调整和光路准直。利用该紫外光干涉仪,在铜柱状靶(φ500μm)上测量了厚等离子体中高达0.6n。的电子密度。     

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.     

Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices

Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.     

Bounds on the maximum numbers of clear two-factor interactions for 2^{(n_1 + n_2 ) - (k_1 + k_2 )} fractional factorial split-plot designs

Fractional factorial split-plot (FFSP) designs have an important value of investigation for their special structures. There are two types of factors in an FFSP design: the whole-plot (WP) factors and sub-plot (SP) factors, which can form three types of two-factor interactions: WP2fi, WS2fi and SP2fi. This paper considers FFSP designs with resolution III or IV under the clear effects criterion. It derives the upper and lower bounds on the maximum numbers of clear WP2fis and WS2fis for FFSP designs, and gives some methods for constructing the desired FFSP designs. It further examines the performance of the construction methods.     

Two inequalities involving Hadamard products of positive semi-definite Hermitian matrices

We extend two inequalities involving Hadamard products of positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods are different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458–463(2000)] and B.-Y. Wang et al. in [Lin. Alg. Appl. 302–303: 163–172(1999)].     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002