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.     

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

Hilbert Space of Probability Density Functions Based on Aitchison Geometry

The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison＇s ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space.     

Pearson-χ~2距离的若干性质

本文对数理统计中常用的 Pearson- χ2距离的分析特性进行了讨论 ,得到了这一距离的一些解析性质 ,最后我们还给出了几个常用距离的关系 .     

Violin frequency response - bridge mobility and bridge feet distance

Good violins have a broad hill in the 2-3 kHz range of their frequency response. This hill has previously been attributed to the first in-plane resonance of the violin bridge. Experiments prove, however, that the hill is the result of two forces acting in opposite directions at the bridge feet. The experiments reported here show that the hill can be “tuned” by altering the distance between the bridge feet. It can be tuned both in terms of frequency and level but the properties of the violin cannot be neglected.     

640 × 512 pixel narrow-band, four-band, and broad-band quantum well infrared photodetector focal plane arrays

A 9 μm cutoff 640 × 512 pixel hand-held quantum well infrared photodetector (QWIP) camera has been demonstrated with excellent imagery. A noise equivalent differential temperature (NEDT) of 10.6 mK is expected at a 65 K operating temperature with f/2 optics at a 300 K background. This focal plane array has shown background limited performance at a 72 K operating temperature with the same optics and background conditions. In this paper, we discuss the development of this very sensitive long-wavelength infrared camera based on a GaAs/AlGaAs QWIP focal plane array and its performance in quantum efficiency, NEDT, uniformity, and operability. In the second section of this paper, we discuss the first demonstration of a monolithic spatially separated four-band 640 × 512 pixel QWIP focal plane array and its performance. The four spectral bands cover 4–5.5, 8.5–10, 10–12, and 13.5–15 μm spectral regions with 640 × 128 pixels in each band. In the last section, we discuss the array performance of a 640 × 512 pixel broad-band (10–16 μm full-width at half-maximum) QWIP focal plane.     

Fixed-sign solutions for a system of singular focal boundary value problems

We consider a system of focal boundary value problems where the nonlinearities may be singular in the independent variable and may also be singular in the dependent arguments. Using Schauder fixed point theorem, we establish criteria such that the system of boundary value problems has at least one fixed-sign solution.