共查询到20条相似文献,搜索用时 93 毫秒
1.
2.
如何选取正则化参数是不适定问题Tikhonov正则化的一个重要问题。基于吸收的Morozov偏差原理,研究了正则化参数选取的线性模型函数方法。在从Hermite插值角度导出线性模型函数后,讨论了选取正则化参数的两种线性模型函数算法(基本算法与改进算法)及其收敛性。为克服基本算法的局部收敛性,提出了一种新的线性模型函数松弛算法。并且,提出了两种具有全局收敛性的组合算法,即线性与线性模型函数算法、双曲型与线性模型函数算法。数值实验说明了所提算法的有效性。 相似文献
3.
MMSE语音增强算法的实时性改进 总被引:2,自引:0,他引:2
通过MMSE语音增强算法的分析,指出其存在实时性方面的缺点,并提出改进方法。实验结果表明改进后算法的实时性得到了显著改善,同时还可得到较好质量的增强语音。 相似文献
4.
基于线性预测的数字语音参数估计 总被引:2,自引:0,他引:2
介绍了数字语音信号分析中的线性预测的基本原理。讨论了用线性预测估计基本语音参数的方法、并对实验仿真结果进行了分析,从实验分析结果可知:线性预测分析是一种估计精度较高、运算速度较快的语音参数估计方法。 相似文献
5.
6.
7.
8.
针对线性的螺栓连接层等效模型无法表征进入微观滑移状态后结合部动力学行为的问题,用Voce本构关系对线性连接层等效模型做出了改进,使其能表征螺栓结合部的非线性动力学行为。以单螺栓连接梁为研究对象,试验探究了不同预紧扭矩对其固有频率的影响,测试了其在不同幅值谐波激励力下的频响函数。通过遗传算法对连接层等效模型的四个非线性参数进行了识别,分别包括初始屈服应力、切线模量和两个形状参数,识别了参数后模型频响函数计算值与试验值的误差在10%以内,表明改进后模型的准确性与可行性。改进后连接层等效模型可以用于装配结构非线性行为的预测。 相似文献
9.
为实现高噪声场所中的听力保护和不同角度入射声源的语音增强,文章采用基于谱减法改进的广义互相关(Generalized Cross Correlation, GCC)时延估计方法对麦克风阵列接收信号进行同步处理,将同步后的阵列信号与基于广义旁瓣抵消器(Generalized Sidelobe Canceller, GSC)的主动隔声耳罩语音增强算法结合,实现噪声抑制和语音增强。首先以GCC算法为基础,引入多窗谱估计的谱减法作为时延估计信号的预处理环节,提高传声器接收信号的信噪比对算法进行改进。随后对加入谱减法的GCC时延估计算法,比较分析了取不同加权函数的仿真结果。最后由时延估计结果对麦克风阵列信号进行时延补偿,对改进后的主动隔声耳罩语音增强算法的噪声抑制和语音增强效果进行了分析。与改进前算法相比,在不同噪声环境下输出的语音信号质量有明显提升。 相似文献
10.
11.
In this paper a new graph-based evolutionary algorithm, gM-PAES, is proposed in order to solve the complex problem of truss layout multi-objective optimization. In this algorithm a graph-based genotype is employed as a modified version of Memetic Pareto Archive Evolution Strategy (M-PAES), a well-known hybrid multi-objective optimization algorithm, and consequently, new graph-based crossover and mutation operators perform as the solution generation tools in this algorithm. The genetic operators are designed in a way that helps the multi-objective optimizer to cover all parts of the true Pareto front in this specific problem. In the optimization process of the proposed algorithm, the local search part of gM-PAES is controlled adaptively in order to reduce the required computational effort and enhance its performance. In the last part of the paper, four numeric examples are presented to demonstrate the performance of the proposed algorithm. Results show that the proposed algorithm has great ability in producing a set of solutions which cover all parts of the true Pareto front. 相似文献
12.
Ladislav Rosenberg 《Reliability Engineering & System Safety》1996,53(1):67-71
This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorithm for finding the minimal cut sets enables one to do so by defined requirements — according to the order of minimal cut sets, or to the number of minimal cut sets, or both. This algorithm is irom three to six times faster when compared with the primary version of the CARA algorithm. 相似文献
13.
在轮毂型号识别过程中,为了能在大量轮型库中快速识别正确的轮型,提出了基于指数权重局部聚合向量(VLAD)特征的轮型识别方法。VLAD特征是针对BOW特征的改进版,用待分类特征和聚类中心的累积残差代替特征的累加数目,采用四近邻软分配的查找方式,相对于一对一的分配规则具有更好的鲁棒性。最后把得到的VLAD向量进行主成分分析降维,并在降维VLAD的基础上将指数权重和VLAD向量的各数据相乘以削减个别不稳定值,最后通过特征向量的对比来找到最相似图片,识别过程具有非接触、灵活、准确的优点,实验表明在提高图片识别率的同时也具有较好的鲁棒性。 相似文献
14.
包装产品协同设计多版本增量基分布优化研究 总被引:1,自引:1,他引:0
为了提高包装产品协同设计过程中历史多版本的查询效率,针对完整版本和增量结合的树形结构多版本演化模型,设计并实现了一种以版本间距离程度为度量依据的中间完整基版本选择算法。实验表明,通过该算法选择的增量还原基版本,使多版本还原效率进一步提高;同时,该算法有使用简单、无复杂控制参数、版本树数据冗余易于控制等特点。 相似文献
15.
16.
Task Scheduling is a complex combinatorial optimization problem and known to be an NP hard. It is an important challenging issue in multiprocessor computing systems. Discrete Particle Swarm Optimization (DPSO) is a newly developed swarm intelligence technique for solving discrete optimization problems efficiently. In DPSO, each particle should limit its communication with the previous best solution and the best solutions of its neighbors. This learning restriction may reduce the diversity of the algorithm and also the possibility of occurring premature convergence problem. In order to address these issues, the proposed work presents a hybrid version of DPSO which is a combination of DPSO and Cyber Swarm Algorithm (CSA). The efficiency of the proposed algorithm is evaluated based on a set of benchmark instances and the performance criteria such as makespan, mean flow time and reliability cost. 相似文献
17.
针对在线零售商一地多仓及仅考虑品类拆单的场景,建立最大化整单配送模型,对单品分配方法进行研究,目的是通过改进现有算法优化配送中心中存放的单品,以进一步降低拆单率。针对贪婪订单算法和贪婪热销算法中未考虑单品间关系性的问题,结合Apriori算法,对算法进行优化设计,提出贪婪关联算法。算法应用一种新的单品分配方法寻求订单中具有强关联关系的单品,并对具有强关联关系的单品优先进行分配。实验结果表明,与贪婪订单算法和贪婪热销算法相比,改进后的算法能显著地降低拆单率,分别降低约8%和11%。 相似文献
18.
针对红外图像的特点,提出了一种基于遗传算法的自动模糊分割红外车辆目标图像的方法.首先选取图像的感兴趣区域以加快运算速度;然后对感兴趣区域图像进行模糊增强,借助于二维OTSU方法对增强后的感兴趣区域进行阈值分割,为了加快分割算法的速度,先限定一个最佳阈值范围,再利用遗传算法在此阈值范围内自动搜索最佳分割阈值;为了弥补单独利用二维OTSU方法分割的不足,采用缩短模糊边缘宽度的方法来提取感兴趣区域红外车辆目标图像的边缘.最后把二维OTSU方法分割的图像与模糊边缘提取得到的边缘图像进行或运算后进行填充以得到最终的车辆目标分割图像.实验结果表明,对于红外车辆目标图像,一维OTSU和二维OTSU算法只是基本分割出了红外车辆目标的主体,而本文提出的自动模糊分割技术不仅准确分割出了红外车辆目标的主体,而且对于坦克的模糊炮塔亦得到了完整的分割. 相似文献
19.
In this paper we consider the frictional (tangential) steady rolling contact problem. We confine ourselves to the simplified
theory, instead of using full elastostatic theory, in order to be able to compute results fast, as needed for on-line application
in vehicle system dynamics simulation packages. The FASTSIM algorithm is the leading technology in this field and is employed
in all dominant railway vehicle system dynamics packages (VSD) in the world. The main contribution of this paper is a new
version “FASTSIM2” of the FASTSIM algorithm, which is second-order accurate. This is relevant for VSD, because with the new
algorithm 16 times less grid points are required for sufficiently accurate computations of the contact forces. The approach
is based on new insights in the characteristics of the rolling contact problem when using the simplified theory, and on taking
precise care of the contact conditions in the numerical integration scheme employed. 相似文献
20.
Anne Duval Michèle Loday-Richaud 《Applicable Algebra in Engineering, Communication and Computing》1992,3(3):211-246
We apply the Kovacic algorithm to some families of special functions, mainly the hypergeometric one and that of Heun, in order to discuss the existence of closed-form solutions. We begin by giving a slightly modified version of the Kovacic algorithm and a sketch proof. 相似文献