基于DIS数字信息化系统对透光物质透光性能的研究

采用DIS数字信息化系统,对不同浓度的蓝墨水溶液在激光光源照射下的透射平均照度及照度分布图像进行实验研究,得到了平均照度值随溶液浓度变化的规律。对不同颜色塑料膜片对白炽灯光源透过照度值及照度分布图像进行实验研究得到及其相关之规律。     

Optic Fiber Interferometer for Absolute Distance Measurement

1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe…     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

可变抽样区间的非参数控制图

最近几年一些学者研究了可变抽样区间的质量控制图。Amin等提出了可变抽样区间(VSI)的非参数控制图———符号 (Sign)统计量图〔1〕。本文在此基础上研究位置VSI符号控制图的制定方法 ,并设计离散VSI符号控制图。符号控制图的优点是对非正态总体亦可应用 ,并且不需要过程方差的信息。本文将所设计的VSI符号控制图同固定抽样区间 (FSI)的常规图作比较 ,并举实例说明符号控制图的应用     

Calibrating software reliability models when the test environment does not match the user environment

Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

基于MMD算法的HMM参数重估计的矩阵表示

本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力．利用该算法在对模型的参数进行重估计时．涉及到复杂的目标函数的梯度运算．击运用矩阵运算使得梯度运算变得简单明了，因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明．     

Heterochain model for simultaneous long‐chain branching and crosslinking. III. Multicomponent polymerization

The matrix formula developed in the context of heterochain theory, M?_w = M?_wp + WF ( I ? M )^?1 S , was applied to describe the molecular weight development during free‐radical multicomponent polymerization. All of the required probabilistic parameters are expressed in terms of the kinetic‐rate constants and the various concentrations associated with them. In free‐radical polymerization, the number of heterochain types, N, needs to be extrapolated to infinity, and such extrapolation is conducted with only three different N values. This matrix formula can be used as a benchmark test if other approximate approaches can give reasonable estimates of the weight‐average molecular weights. The moment equations with the average pseudo‐kinetic‐rate constants for branching and crosslinking reactions may provide poor estimates when the copolymer composition drift during polymerization is very significant. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2801–2812, 2004