Optic Fiber Interferometer for Absolute Distance Measurement

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

Structural and thermodynamic properties of AlB2 compound

We employ a first-principles plane wave method with the relativistic analytic pseudopotential of Hartwigsen, Goedecker and Hutter (HGH) scheme in the frame of DFT to calculate the equilibrium lattice parameters and the thermodynamic properties of AlB₂ compound with hcp structure. The obtained lattice parameters are in good agreement with the available experimental data and those calculated by others. Through the quasi-harmonic Debye model, obtained successfully are the dependences of the normalized lattice parameters a/a₀ and c/c₀ on pressure P, the normalized primitive cell volume V/V₀ on pressure P, the variation of the thermal expansion α with pressure P and temperature T, as well as the Debye temperature \Theta_D and the heat capacity C_V on pressure P and temperature T.     

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.     

Extrusion of pastes with a piston extruder for the determination of the local solid and fluid concentration, the local porosity and saturation and displacement profiles by means of NMR imaging

 Nuclear Magnetic Resonance (NMR) was used to investigate the extrusion behaviour of PTFE pastes in a ram extruder. By means of ¹H-NMR imaging (MRI) it is possible to determine the local proton density and therefore, the local fluid concentration. The ¹⁹F-MRI provides the local solid concentration. Thus the local saturation and the local porosity can be calculated with the information of the local fluid and solid concentration. Furthermore displacement profiles can be derived from NMR images by means of correlation techniques without any preparation or marking of the pastes. Received: 8 May 2000   Accepted: 1 May 2001     

Co-P非晶态合金电子性质和局域结构的理论研究

根据Co P非晶态合金结构的短程有序和结构中可能存在P -P相互作用的实验事实 ,选择了单磷原子簇模型ConP(n =1～ 5 )和双磷原子簇模型ConP2 (n =1～ 4 ) ,用密度泛函理论方法对其进行计算 .结果表明 ,在单磷Co2 P( 2 ) 、Co3 P( 1) 及Co4P( 2 ) 模型体系中 ,Co原子供给P原子电子 ,与电负性规则一致 ,同时Co和P之间具较强化学作用 ,可以形成稳定的原子簇 ;而在双磷和单磷原子簇Co5P( 1) 模型体系中 ,形成的原子簇不稳定 ,采用单磷Co2 P( 2 ) 、Co3 P( 1) 及Co4P( 2 ) 模型能较好地反映Co P非晶态合金的结构特点 .     

LOCAL WELL-POSEDNESS AND ILL-POSEDNESS ON THE EQUATION OF TYPE □u = uk((e)u)α

This paper undertakes a systematic treatment of the low regularity local wellposedness and ill-posedness theory in Hs andHs for semilinear wave equations with polynomial nonlinearity in u and (e)u. This ill-posed result concerns the focusing type equations with nonlinearity on u and (e)tu.     

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.