音乐数据库的基于内容检索及一种基于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).     

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.     

专家分配问题的KMP优化求解方法研究

专家分配问题是项目申报系统中评审环节(盲审)重点解决的问题.根据系统模型,针对项目和专家的多因素匹配问题,对专家分配问题进行研究,建立了专家分配问题的模型.应用KMP方法和索引顺序查找的求解方法,提出了基于多信息因素的专家分配优化求解方法.通过测试与应用表明,该系统的专家分配算法能实现专家与申请书的匹配,结果有较高的准确性和合理性,该方法将评审工作的效率提高了8~12倍,同时将传统人工操作过程中的出错概率降至0.15%~0%.     

基于“固结词串”实例的中文分词研究

近几年的中文分词研究中,基于条件随机场(CRF)模型的中文分词方法得到了广泛的关注。但是这种分词方法在处理歧义切分方面存在一定的问题。CRF虽然可以消除大部分原有的分词歧义,却会带来更多新的错误切分。该文尝试找到一种简单的、基于“固结词串”实例的机器学习方法解决分词歧义问题。实验结果表明,该方法可以简单有效的解决原有的分词歧义问题,并且不会产生更多新的歧义切分。     

俄罗斯《6～1150kV电网雷电和内过电压防护导则》中110～1150kV架空线路防雷保护介绍

介绍了俄罗斯统一电力系统1999年制订的《6—1150kV电网雷电和内过电压防护导则》关于110—1150kV架空线路防雷保护部分中的新内容和新观点：(1)在防雷保护计算中增加了用第1脉冲和后续脉冲雷电流幅值和陡度多数；(2)架空线路绝缘子串中个数选择增加了“为了保证线路绝缘25年不检修的运行周期，实施在绝缘子串中增加绝缘子个数”的条款；(3)架空线路允许雷击跳闸次数的选择依据是线路断路器操作资源准则；(4)分析架空线路运行耐雷指标时指出：①110-220kV架空线路雷击跳闸主要起因是反击闪络；②330kv架空线路雷击跳闸主要起因大致反击闪络和绕击闪络各一半；③500-750kV架空线路雷击跳闸主要起因是绕击闪络：④提高115kV架空线路耐雷性要靠使用负保护角避雷线的直线杆塔和耐张转角杆塔：⑤提高架空线路不间断供电可靠性的后备措施是自动重合闸。     

悬式瓷绝缘子在线检测装置的研究

介绍了一种悬式绝缘子在线检测装置的设计原理及试验结果。试验表明,这种设计方案具有结构简单、操作方便、测量准确可靠的特点。     

脱机手写字符识别的DP算法的设计

把手写体汉字识别视为一种允许空间偏移的弹性模式识别匹配问题，提出了一种用于这类二值图象的两层动态规划算法，初步实验表明该算法具有十分满意的识别效果。     

水平井下套管摩阻分析计算

通过分析带扶正器套管柱的受力与变形，导出了套管柱在水平井中的摩阻计算模型。模型考虑了管柱单元体的刚性效应及套管扶正器的影响，同时对实测井斜数据进行平滑和插值处理。在克拉玛依油田的试验水平井ＨＷ７０１中用该模型开发的软件预测了完井套管柱下入的摩阻力和井口载荷，预测结果与实测结果吻合较好。     

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.