共查询到20条相似文献，搜索用时 203 毫秒
1.
2.
3.
采用Gröbner基方法,可以把一个在有限群作用下不变的多项式写成不变环的生成元的多项式.核心问题是如何有效地计算这个正维不变理想的Gröbner基.本文引入一个有效提升算法来计算这组Gröbner基.当用straight line program模型对整个计算过程进行复杂度分析时,可以把计算开销控制在多项式时间内. 相似文献
4.
5.
采用Gr(o)bner基方法,可以把一个在有限群作用下不变的多项式写成不变环的生成元的多项式.核心问题是如何有效地计算这个正维不变理想的Gr(o)bner基.本文引入一个有效提升算法来计算这组Gr(o)bner基.当用straight line program模型对整个计算过程进行复杂度分析时,可以把计算开销控制在多项式时间内. 相似文献
6.
Spiking神经网络是一种新型的神经网络,它采用更接近于生物神经元的Spike神经元作为计算单元,具有更好的生物特性。文中讨论了其原有的学习算法,提出了基于粒子群算法的学习模型,分析了该模型的算法时间复杂度。非线性分类问题的实验结果表明基于粒子群算法的学习模型具有更好的全局收敛性。 相似文献
7.
8.
提出基于差别矩阵的改进启发式粗糙集属性约简算法,降低算法的时间复杂度及空间复杂度。针对相关实际案例数据。以学生考试成绩为分析对象,应用改进后的约简算法,设计相应的评价指标,分析学生成绩的潜在影响因素,再次验证了本文提出算法的可行性和高效性。 相似文献
9.
本文针对一维、二维多选择整数背包问题的教学模型,采用动态规划和蚁群算法对其进行求解,并对蚁群算法作了适当的改进.随机数据实验表明,随着问题规模的扩大,动态规划算法的计算复杂度将急剧增大,造成求解困难,而基本蚁群算法及改进蚁群算法能够快速有效地求得问题近优解,且改进蚁群算法解的质量比原算法平均提高了2.8%. 相似文献
10.
对识别后的语音文档进行了向量空间模型的建立,针对得到的高维稀疏矩阵提出了基于局部敏感哈希的语音文档分类算法,算法能够直接在高维稀疏矩阵上进行分类,无需降维。此外,在构建局部敏感哈希函数的时候结合了稳定分布。实验证明,局部敏感哈希算法能够对语音文档进行合理有效的分类,同时获得了较小的时间复杂度。 相似文献
11.
12.
《Journal of The Franklin Institute》2023,360(13):9689-9706
The nonlinear feedback shift register (NFSR) is the main component of the convolutional decoder. This paper provides a novel method for investigating the driven stability of NFSRs with input via semi-tensor product (STP). By using the STP method, a backward state transition matrix, as well as a backward NFSR, is constructed. Backward NFSRs can help to find the predecessors of any states so that an algorithm for the global stability of autonomous NFSRs is designed. On this basis, two algorithms are proposed for the driven stability of NFSRs with input, and they have lower computational complexity than the existing methods. Meanwhile, some numerical examples are presented to support the results of this paper. Finally, the relationship between stability and connectedness is discussed fully, which derives some interesting results. 相似文献
13.
搜索引擎是互联网资源搜索的入口,搜索的快捷性、准确性是搜索引擎的核心竞争力,如何提高竞争力是业内企业的工作重点。已有的搜索引擎算法中,最具代表性的就是PageRank算法,针对该算法的改进方法也有很多,但效果并不很理想。分析了已有PageRank改进方法的不足,立足于用户搜索行为信息挖掘,采用时序关联分析方法,将关联比例作为权值加入到PageRank计算公式中,改变平均分配权威值的计算方法,从而得到了改进的PageRank算法——TCPR算法,使得搜索排序结果更符合用户的信息需求。 相似文献
14.
The fast affine projection (FAP) algorithm (Gay and Tavathia, Proceedings of the IEEE International Conference on Acoustic, Speech and Signal Processing, 1995, 3023) is known to outperform the NLMS with a slight increase in complexity, but it involves the fast calculation of the inverse of a covariance matrix of the input data that could undermine the performance of the algorithm. The block subband adaptive algorithm in (Courville and Duhamel, IEEE Trans. Signal Processing 46(9) (1998) 2359) has also illustrated significant improvement in performance over the NLMS and other frequency domain adaptive algorithms. However, it is known that block processing algorithms have lower tracking capabilities than the their sample-by-sample counterparts. In this paper, we present a sample-by-sample version of the algorithm in (Courville and Duhamel, IEEE Trans. Signal Processing 46(9) (1998) 2359) and develop a low complexity implementation of this algorithm. As a sample-by-sample algorithm, it avoids the reduced tracking capability of block algorithms. Because it does not use matrix inversion, it avoids the numerical problems of FAP algorithms. We will show that the new sample-by-sample algorithm approximates the affine projection algorithm and possesses a similar property in reducing coefficient bias that appears in monophonic and stereophonic teleconferencing when the receiving room impulse responses are undermodeled. The new fast sample-by-sample algorithm is extended for stereo acoustic echo cancellation. Simulations of echo cancellations in actual rooms are presented to verify our findings. 相似文献
15.
The string-searching problem is to find all occurrences of pattern(s) in a text string. The Aho-Corasick string searching algorithm simultaneously finds all occurrences of multiple patterns in one pass through the text. On the other hand, the Boyer-Moore algorithm is understood to be the fastest algorithm for a single pattern. By combining the ideas of these two algorithms, we present an efficient string searching algorithm for multiple patterns. The algorithm runs in sublinear time, on the average, as the BM algorithm achieves, and its preprocessing time is linear proportional to the sum of the lengths of the patterns like the AC algorithm. 相似文献
16.
《Journal of The Franklin Institute》2022,359(11):5206-5230
In the existing efficient robust model predictive control (ERMPC) algorithms (see e.g. [14,31,32]), through offline optimization and online lookup table calculation, a fixed state feedback control law or a linear interpolated control law is applied to a system when the system state lies between two adjacent polyhedrons, which undoubtedly will result in conservativeness of the controller. Faced with this issue, an improved ERMPC algorithm is proposed in this paper, which considers the nonlinearity between the state feedback control laws with respect to polyhedrons and the norm distance from system state to origin, and can provide continuously variable state feedback control law varying with the state. First, a set of polyhedral parameters and their corresponding state feedback control law sequences are obtained offline by solving a set of LMIs optimization problems. Next, for each state feedback control law sequence, a nonlinear fitting function is established offline between the state feedback control law and its serial number. Then a simplified lookup table is constructed offline to save memory space and shorten online computation time of the controller. According to the simplified lookup table and information of the norm distance from system state to origin, we online establish the coordinate of current state in the nonlinear fitting curve for getting current feedback control law, which changes continuously with the state. The proposed ERMPC algorithm is successfully applied to an actual fast-responding linear one stage inverted pendulum (LOSIP) system to verify its effectiveness. 相似文献
17.
提出一种基于遗传算法优化BP网络结构的自适应噪声抵消器，BP算法是最典型的多层神经网络学习算法，它在局部搜索时比较成功．但由于BP网络大多采用沿梯度下降方向的搜索算法，因而不可避免地存在收敛速度慢，容易陷入局部极小点等问题。而遗传算法擅于全局搜索，鲁棒性很强，将采用遗传算法优化网络初始权值的方法，将两种算法相结合，做到优势互补。GA与BP算法的混合算法不论是在运行速度还是在运算精度上都较单纯的BP算法有提高，在信噪比的改善程度上，混合算法的信噪比针对余弦信号提高了23db左右。 相似文献
18.
A global state feedback tracking controller for a class of vehicles, namely marine vehicles, hovercrafts and indoor airships is considered in this paper. The control algorithm uses a velocity transformation of the vehicle equations of motion. It is shown that this algorithm is suitable for control of fully actuated systems and leads to fast response. This property arises from the fact that the dynamical couplings in the vehicle are taken into account in the control gain matrix. A Lyapunov-like function is proposed for the stability analysis of the system under the controller. The algorithms robustness issue is considered too. Numerical simulations are given to illustrate effectiveness of the approach. 相似文献
19.
针对主题搜索引擎反馈信息主题相关度低的问题,提出了将遗传算法与基于内容的空间向量模型相结合的搜索策略。利用空间向量模型确定网页与主题的相关度,并将遗传算法应用于相关度判别,提高主题信息搜索的准确率和查全率。在Heritrix框架基础上,利用Eclipse3．3实现了相应功能。实验结果表明,搜索策略改进后的系统抓取主题页面所占比例与原系统相比提高了约30％。 相似文献
20.
关于n阶(n1,n2)型二重(r1,r2)-循环矩阵求逆及相乘的计算方法 总被引：1，自引：0，他引：1
循环矩阵的求逆及相乘的算法，无论在理论上还是在实际应用中都具有非常重要的意义．本文不从计算Jordan标准形式或特征值出发，而是利用矩阵乘法及逆矩阵的一些简单性质，给出了n阶(n1，n2)型二重(r1,r2)-循环矩阵求逆、两个n阶(n1，n2)型二重(r1，r2)-循环矩阵相乘的直接计算方法，推广了已有的结果,这些算法已编到C 源代码在服务器上通过，验证了这些算法是稳定的有效的,若用快速富里叶变换(FFT)计算，这些算法的时间复杂性均为O(n1n2log2n1n2)。 相似文献