Univariate marginal distribution algorithm dynamics for a class of parametric functions with unitation constraints

In this paper, we introduce a mathematical model for analyzing the dynamics of the univariate marginal distribution algorithm (UMDA) for a class of parametric functions with isolated global optima. We prove a number of results that are used to model the evolution of UMDA probability distributions for this class of functions. We show that a theoretical analysis can assess the effect of the function parameters on the convergence and rate of convergence of UMDA. We also introduce for the first time a long string limit analysis of UMDA. Finally, we relate the results to ongoing research on the application of the estimation of distribution algorithms for problems with unitation constraints.     

Parametric Sequence Alignment with Constraints

Approximate matching techniques based on string alignment are important tools for investigating similarities between strings, such as those representing DNA and protein sequences. We propose a constraint based approach for parametric sequence alignment which allows for more general string alignment queries where the alignment cost can itself be parameterized as a query with some initial constraints. Thus, the costs need not be fixed in a parametric alignment query unlike the case in normal alignment. The basic dynamic programming string edit distance algorithm is generalized to a naive algorithm which uses inequalities to represent the alignment score. The naive algorithm is rather costly and the remainder of the paper develops an improvement which prunes alternatives where it can and approximates the alternatives otherwise. This reduces the number of inequalities significantly and strengthens the constraint representation with equalities. We present some preliminary results using parametric alignment on some general alignment queries.     

音乐数据库的基于内容检索及一种基于ICA算法的按调查询系统的提出

目前音频数据库的研究相对于图象处于滞后,文中侧重音乐角度,结合MPEG标准和基于内容检索的应用,综述了音频检索的研究现状,分析了音频方面研究的特殊性和相关应用中的问题;并提出基于独立分量分析（ICA）的按调查询（QBH）的系统,较好地解决了特征提取中的鸡尾酒会效应问题。系统的查询结果置于三维声效环境中加速了查询。     

On the combinatorial complexity of fuzzy pattern matching in music analysis

In music analysis it is a common requirement to search a musical score for occurrences of a particular musical motif and its variants. This tedious and time-consuming task can be carried out by computer, using one of several models to specify which variants are to be included in the search. The question arises: just how many variants must be explicitly considered? The answer has a profound effect on the computer time needed. In this paper, recurrence relations and closed form analytic expressions are derived for the run time complexity of two models of fuzzy pattern matching for use in music analysis; each model assumes the existence of an atomic exact pattern matching operation. The formulae so obtained are evaluated and tabulated as a function of their independent parameters. These results enable a priori estimates to be made of the relative run times of different music searches performed using either model. This is illustrated by applying the results to an actual musical example.Richard E. Overill, BSc, PhD, C.Math, FIMA, C.Eng, MBCS, MIEE, is Lecturer in Computer Science at King's College London. His research includes the design, analysis, and practical implementation of algorithms on supercomputers. He has also given lecture-recitals on the keyboard music of the Tudor composers Thomas Tallis (1985), John Blitheman (1991), and William Byrd (1993).     

基于改进期望最大化算法的分布式视频编码

目前,分布式视频编码（DVC）由于具有低复杂编码特性而成为视频编码领域的研究热点。DVC中,边信息性能对系统性能影响很大,一般而言,边信息性能越好,则整个系统压缩性能越好。本文研究了一种基于贝叶斯准则的期望最大化（Expectation Maximization,EM）边信息产生方法,并从运动搜索模板和初始概率模型两方面对EM算法提出了改进。实验表明,在几乎相同的率失真性能下,两种改进算法的学习时间分别缩短了30%和16%。     

Improved LP-based algorithms for the closest string problem

In a recent paper by Liu et al. [Exact algorithm and heuristic for the closest string problem, Computers & Operations Research 2011;38:1513-20], a polynomial time heuristic procedure is proposed for the closest string problem (CSP). Such heuristic called LDDA_LSS is a combination of a previously published approximation algorithm and local search strategies. This paper points out that an instant algorithm deriving a feasible solution directly from the continuous relaxation solution of a standard ILP formulation of CSP already strongly outperforms LDDA_LSS both in terms of solution quality and computing time. Two core based procedures are then proposed that further improve the results of the instant algorithm. Based on these results, we conclude that such LP-based approaches for their efficiency and simplicity should be used as a benchmark for future heuristics on CSP.     

Application of design parameters space search for belt conveyor design

Belt conveyor design is examined as an application of a proposed Design Parameters Space Search technique. First, the main characteristics of the belt-conveyor design process are presented as they appear in the current literature. Furthermore, a proposed general knowledge-representation platform is described, and its ability to house the relevant conveyor design knowledge is also shown.

Next, the extended search technique of the design space is discussed, and an integrated example of a belt-conveyor design is presented, based on the proposed representation platform and the extended search technique. Finally, it is shown that the design of belt conveyors according to the proposed approach presents the following significant advantages:

• • Due to the knowledge-representation scheme adopted, both qualitative and quantitative knowledge can be used within the same platform.

• • Multiple solutions can be easily produced through user-defined design criteria. These solutions can be further modified and/or evaluated to produce more-specific designs.

• • The required for user-input data is kept to a minimum. Due to the applied extended search method, semiautomatic design can be achieved. As a consequence, the design process is completed in less time than that required by the conventional methods.

     

Parallel finding all initial palindromes and periods of a string on reconfigurable meshes

Given a string of lengthn, this short paper first presents anO(1)-time parallel algorithm for finding all initial palindromes and periods of the string on ann×n reconfigurable mesh (RM). Then, under the same cost (= time × the number of processors =O(n ²)), we provide a partitionable strategy when the RM doesn’t offer sufficient processors; this overcomes the hardware limitation and is very suitable for VLSI implementation. Prof. Chung was supported in part by the National Science Council of R. O. C. under contracts NSC87-2213-E011-001 and NSC87-2213-E011-003.     

铅锌烧结过程智能集成优化控制技术

针对复杂的铅锌烧结过程。提出了基于神经网络和模糊专家规则模型的自学习模糊专家控制方法进行状态参数优化，基于神经网络模型的模糊C均值聚类搜索混沌遗传算法进行综合指标参数优化．智能集成优化控制技术具有高效性和实用性，有效地抑制了工况波动，提高了烧结矿产量和质量，取得了较好的工业控制效果．     

一种改进的PIV互相关算法

本文在对两种传统PIV算法进行深入分析的基础上，融合了它们的优点而发展了一种新的速度提取算法一预估搜索法，并给出了算法的具体实现步骤。人工及真实图像实验均表明该法具有求解速度快、计算精度高的优点。