广义Sierpinski集

本文考察了包括平面上的各种广义 Cantor集 ,Sierpinski集和包括某些连续不可微曲线在内的广义 Sierpinski集 .由相似变换 ,导出了它们的级数表达式 ,并利用它和字符串空间的对应关系 ,计算出它们的Hausdorff维数     

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.     

Boundary position feedback control of Kirchhoff's non‐linear strings

This paper is concerned with global stabilization of an undamped non‐linear string in the case where any velocity feedback is not available. The linearized system has an infinite number of poles and zeros on the imaginary axis. In the case where any velocity feedback is not available, a parallel compensator is effective. The stabilizer is constructed for the augmented system which consists of the controlled system and a parallel compensator. It is proved that the string can be stabilized by linear boundary control. Copyright © 2003 John Wiley & Sons, Ltd.     

Pointwise stabilization of strings with non‐linear feedback

We consider an initial and boundary value problem for a homogenous string subject to an internal pointwise control. The solution resulting from a non‐linear feedback is studied. We give various explicit decay estimates depending on the control position and the feedback non‐linearity. Copyright © 2004 John Wiley & Sons, Ltd.     

Eigenvalue ratios of vibrating strings

Summary New results for the eigenvalue ratios of vibrating strings are presented partially in connection with previous results concerning Schr?dinger operators.     

Magnetized cosmological models in bimetric theory of gravitation

Bianchi type-III magnetized cosmological model when the field of gravitation is governed by either a perfect fluid or cosmic string is investigated in Rosen’s [1] bimetric theory of gravitation. To complete determinate solution, the condition, viz., A=(BC) ⁿ , where n is a constant, between the metric potentials is used. We have assumed different equations of state for cosmic string [2] for the complete solution of the model. Some physical and geometrical properties of the exhibited model are discussed and studied.     

Physics with large extra dimensions

The recent understanding of string theory opens the possibility that the string scale can be as low as a few TeV. The apparent weakness of gravitational interactions can then be accounted by the existence of large internal dimensions, in the sub-millimeter region. Furthermore, our world must be confined to live on a brane transverse to these large dimensions, with which it interacts only gravitationally. In my lecture, I describe briefly this scenario which gives a new theoretical framework for solving the gauge hierarchy problem and the unification of all interactions. I also discuss a minimal embedding of the standard model, gauge coupling unification and proton stability. On leave from: Centre de Physique Théorique, Ecole Polytechnique, 91128 Palaiseau, Cedex, France.     

A Generalized Markov Sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.     

A class of interaction-round-a-face models and its equivalence with an ice-type model

A new model (called the Temperley-Lieb interactions model) is introduced, in two-dimensional lattice statistics, on a square lattice . The Temperley-Lieb equivalence of this model to the six-vertex, self-dual Potts, critical hard-hexagons and critical nonintersecting string models is established. A graphical equivalence of this model to the six-vertex model generalizes this equivalence to noncritical cases of the above models. The order parameters of a specialization of this model are studied.     

Aligning Text and Phonemes for Speech Technology Applications Using an EM-Like Algorithm

A common requirement in speech technology is to align two different symbolic representations of the same linguistic ‘message’. For instance, we often need to align letters of words listed in a dictionary with the corresponding phonemes specifying their pronunciation. As dictionaries become ever bigger, manual alignment becomes less and less tenable yet automatic alignment is a hard problem for a language like English. In this paper, we describe the use of a form of the expectation-maximization (EM) algorithm to learn alignments of English text and phonemes, starting from a variety of initializations. We use the British English Example Pronunciation (BEEP) dictionary of almost 200,000 words in this work. The quality of alignment is difficult to determine quantitatively since no ‘gold standard’ correct alignment exists. We evaluate the success of our algorithm indirectly from the performance of a pronunciation by analogy system using the aligned dictionary data as a knowledge base for inferring pronunciations. We find excellent performance—the best so far reported in the literature. There is very little dependence on the start point for alignment, indicating that the EM search space is strongly convex. Since the aligned BEEP dictionary is a potentially valuable resource, it is made freely available for research use.