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.     

Hankel convolution operators on entire functions and distributions

In this paper we study the Hankel convolution operators on the space of even and entire functions and on Schwartz distribution spaces. We characterize the Hankel convolution operators as those ones that commute with Hankel translations and with a Bessel operator. Also we prove that the Hankel convolution operators are hypercyclic and chaotic on the spaces under consideration.     

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.     

Probability Interpretation of the Integral of Fractional Order

We establish a relation between stable distributions in probability theory and the fractional integral. Moreover, it turns out that the parameter of the stable distribution coincides with the exponent of the fractional integral. It follows from an analysis of the obtained results that equations with the fractional time derivative describe the evolution of some physical system whose time degree of freedom becomes stochastic, i.e., presents a sum of random time intervals subject to a stable probability distribution. We discuss relations between the fractal Cantor set (Cantor strips) and the fractional integral. We show that the possibility to use this relation as an approximation of the fractional integral is rather limited.     

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参数重估计的矩阵表示形式并给出了证明．     

Two‐stage copolycondensation of preformed oligomers with bisphenols by tosyl chloride/dimethylformamide/pyridine from distributions of resulting oligomers determined by a combination of gel permeation chromatography and NMR

A two‐stage co‐oligomerization of the oligomers initially formed from an equimolar mixture of isophthalic acid (IPA) and terephthalic acid (TPA) and 2,2‐bis(4‐hydroxyphenyl)propane (BPA, 50 mol %) with bisphenols (BPs, 20 mol %) was carried out using a tosyl chloride/dimethylformamide/pyridine condensing agent. The distributions of the resulting oligomers (n_x‐mers), which were quenched with methanol, were determined by a combination of gel permeation chromatography (GPC) and NMR. These distributions (presented by molar percentage) were conveniently calculated with the equation n_x (mol %) = n_x (% mol by GPC) × n₀ (mol % by NMR)/n₀ (% mol by GPC), where n_x (% mol) = n_x (wt % by GPC)/its molecular weight. The results showed the distributions of the preformed IPA/TPA‐BPA oligomers to be in fairly good accord with those obtained directly from GPC and to be supported by the NMR results. The calculation was applied to the co‐oligomers prepared up to a reaction of 0.7, at which there was an increase in the number of higher oligomers indivisible by GPC and the distributions could no longer be determined by molar percentage. The calculated distributions are discussed in relation to the results of copolycondensation. The sequence distributions in the resulting co‐oligomers, which were also examined by NMR, are compared with those in the copolymers. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 44–51, 2004     

连续照明时成像对比度与气象条件的关系

 通过同轴激光连续照明成像模型分析了大气后向散射对成像对比度的影响，得出了考虑散射因素时成像对比度的计算公式。基于不同气象条件下大气粒子散射特点，讨论了霾和雾两种不同天气时成像对比度随照明距离的变化规律，并与实验结果进行了对比，计算结果与实验吻合较好。