A short note on the entrainment and exit boundary conditions

An attempt is made to find out the suitable entrainment and exit boundary conditions in laminar flow situations. Streamfunction vorticity formulation of the Navier–Stokes equations are solved by ADI method. Two‐dimensional laminar plane wall jet flow is used to test different forms of the boundary conditions. Results are compared with the experimental and similarity solution and the proper boundary condition is suggested. The Kind 1 boundary condition is recommended. It consists of zero first derivative condition for velocity variable and for streamfunction equation, mixed derivative at the entrainment and exit boundaries. Copyright © 2005 John Wiley & Sons, Ltd.     

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.     

静态球对称黑洞Dirac场的统计熵

利用改进的brickwall模型,给出了一类静态球对称黑洞Dirac场的熵,结果表明,在取相同的截断因子时,Dirac场的熵均为标量场的熵的72倍 关键词： 黑洞 统计熵 brickwall模型 Dirac场     

The entropy of Garfinkle-Horne dilaton black hole due to arbitrary spin fields

Using the membrane model which is based on brick wall model, we calculated the free energy and entropy of Garfinkle-Horne dilatonic black hole due to arbitrary spin fields. The result shows that the entropy of scalar field and the entropy of Fermionic field have similar formulas. There is only a coefficient between them.     

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

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

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