On some algorithmic problems regarding the hairpin completion

We consider a few algorithmic problems regarding the hairpin completion. The first problem we consider is the membership problem of the hairpin and iterated hairpin completion of a language. We propose an O(nf(n)) and O(n²f(n)) time recognition algorithm for the hairpin completion and iterated hairpin completion, respectively, of a language recognizable in O(f(n)) time. We show that the n factor is not needed in the case of hairpin completion of regular and context-free languages. The n² factor is not needed in the case of iterated hairpin completion of context-free languages, but it is reduced to n in the case of iterated hairpin completion of regular languages. We then define the hairpin completion distance between two words and present a cubic time algorithm for computing this distance. A linear time algorithm for deciding whether or not the hairpin completion distance with respect to a given word is connected is also discussed. Finally, we give a short list of open problems which appear attractive to us.     

保险企业偿付能力的监控

本讨论保险公司偿付能力监控指标的构成，并针对我国目前保险公司的现状提出用多元统计控制方法和指标加权平均法对保险公司偿付能力进行监控，最后，以一例说明其实际应用。     

基于彩色直方图分析的智能视频监控系统

针对背景为固定场所的数字视频监控系统，提出了一种通过比较图像彩色直方图距离实现视频监视系统自动控制的方法.通过在线动态更换参考图像，消除了时间变化引起的阳光、天气等因素对背景图像的影响.采用均匀压缩的方法，将真彩色颜色空间压缩到16色的索引色空间，降低了计算复杂度，滤掉了背景的微小变化引入的噪声，实现了10 ms内完成对一幅图像的处理.准确的自动控制在保证监视系统正常工作的同时，极大地减小了所需的存储空间. 关键词： 视频监视系统 彩色直方图 直方图距离     

逐步距离判别分析在甲状腺滤泡性腺瘤与滤泡性腺癌的判定中的运用

在认定甲状腺滤泡性腺瘤与滤泡性腺癌的细胞核形态指标存在显著差异的条件下,对两类样本通过逐步判别分析筛选出鉴别能力较强的少数几个指标,并运用距离判别分析建立了甲状腺滤泡性腺瘤与滤泡性腺癌的判别函数,为临床病理诊断提供辅助诊断方法.     

A New Resonator With A Non─misaligned FourMirorReflectorAndItsEfectOnBeamQualityImprovementOfHighAveragePowerNd：YAGLasers

ＡＮｅｗＲｅｓｏｎａｔｏｒＷｉｔｈＡＮｏｎ─ｍｉｓａｌｉｇｎｅｄＦｏｕｒＭｉｒｏｒＲｅｆｌｅｃｔｏｒＡｎｄＩｔｓＥｆｅｃｔＯｎＢｅａｍＱｕａｌｉｔｙＩｍｐｒｏｖｅｍｅｎｔＯｆＨｉｇｈＡｖｅｒａｇｅＰｏｗｅｒＮｄ：ＹＡＧＬａｓｅｒｓＣ．Ｍ．Ｚｈａｏ，Ｇ...     

A multiprojection algorithm using Bregman projections in a product space

Generalized distances give rise to generalized projections into convex sets. An important question is whether or not one can use within the same projection algorithm different types of such generalized projections. This question has practical consequences in the area of signal detection and image recovery in situations that can be formulated mathematically as a convex feasibility problem. Using an extension of Pierra's product space formalism, we show here that a multiprojection algorithm converges. Our algorithm is fully simultaneous, i.e., it uses in each iterative stepall sets of the convex feasibility problem. Different multiprojection algorithms can be derived from our algorithmic scheme by a judicious choice of the Bregman functions which govern the process. As a by-product of our investigation we also obtain blockiterative schemes for certain kinds of linearly constraned optimization problems.     

Weighted L quantile distance estimators for randomly censored data

The asymptotic properties of a family of minimum quantile distance estimators for randomly censored data sets are considered. These procedures produce an estimator of the parameter vector that minimizes a weighted L² distance measure between the Kaplan-Meier quantile function and an assumed parametric family of quantile functions. Regularity conditions are provided which insure that these estimators are consistent and asymptotically normal. An optimal weight function is derived for single parameter families, which, for location/scale families, results in censored sample analogs of estimators such as those suggested by Parzen.     

近场光学显微镜中利用剪切力原理进行样品/探针间距测控的非光学方法

扫描近场光学显微镜（ＳｃａｎｎｉｎｇＮｅａｒ－ｆｉｅｌｄＯｐｔｉｃａｌＭｉｃｒｏｓｃｏｐｅ：ＳＮＯＭ）自８０年代中期以来获得了迅速的发展并得到了具有纳米（亚纳米）尺度分辨率的光学图像。作为ＳＮＯＭ的关键技术之一，样品与探针间距的控制尤为重要，而实现起来比较困难。人们提出了多种方法，其中基于剪切力原理的控制方法最常用而且实验证明是可靠的。本文综述了扫描近场光学显微镜发展以来所出现的基于剪切力原理进行样品／探针间距的探测的一些主要的非光学方法。包括利用ＰＭＴ直接探测样品辐射，利用音叉、电容、阻抗以及压电效应的探没方法等，并对各种方法的优缺点进行了分析比较。     

The limiting normality of the test statistic for the two-sample problem induced by a convex sum distance

Critchlow (1992, J. Statist. Plann. Inference, 32, 325–346) proposed a method of a unified construction of a class of rank tests. In this paper, we introduce a convex sum distance and prove the limiting normality of the test statistics for the two-sample problem derived by his method.