用反射法自动测量大尺寸样品的折射率分布

针对大尺寸样品的折射率分布测量,引入自动扫描装置和适时数据处理系统,研究出一种高灵敏度的智能化反射法折射率分布测量仪,可进行快速、自动、准确的折射率分布测量.经理论分析和实验研究提出了一套合理的实验数据处理方法.并具体介绍和详尽分析了实验装置,讨论了有关理论和实验误差,给出了消除各种误差的有效方法,最终得出较为理想的实验结果.     

斐索梯度折射率光纤透镜传感实验

采用LD泵浦的单纵模Nd：YVO4倍频激光器、梯度折射率光纤透镜等器件构成斐索梯度折射率光纤透镜传感实验仪．本文介绍了实验装置和实验原理，并给出了实验结果。     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

用迈克耳逊干涉仪测量气体折射率的误差的研究

研究在用迈克尔逊干涉仪测量气体折射率时存在的系统和方法误差，提出了误差修正方法。     

On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.     

多目标半定规划的互补弱鞍点和G-鞍点最优性条件

对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题，给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义．然后，在较弱的凸性条件下，利用含矩阵和向量约束的择一性定理，建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件．     

逼近严格伪压缩映象不动点的Ishikawa迭代程序

Let(X,‖·‖ ) be a Banach space.Let K be a nonempty closed,convex subset of Xand T∶K→K.Assume that T is Lipschitzian,i.e.there exists L>0 such that‖ T(x) -T(y)‖≤ L‖ x -y‖for all x,y∈K.Withoutloss of generality,assume that L≥ 1 .Assume also that T is strictly pseudocontractive.According to[1 ] this may be statedas:there exists k∈ (0 ,1 ) such that‖ x -y‖≤‖ x -y + r[(I -T -k I) x -(I -T -k I) y]‖for all r>0 and all x,y∈ K.Throughout,let N denote the set of positive in…     

凸度量空间中单值和集值映象的公共不动点定理

§ 1.　Introduction　　Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa…     

混合效应模型中的D-最优设计

本研究的是混合效应-Ⅱ模型，首先，给出二阶模型存在D-最优回归设计点的必要条件。其次，组合D-最优回归设计和D-最优区组设计BIBD构造D-最优设计并给出寻找新的D-最优设计点的方法。以两种有代表性的组合误差分布为例，阐明新的D-最优设计点的获得过程，并给出了数值结果。     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.