共查询到20条相似文献，搜索用时 296 毫秒
1.
2.
3.
EM算法是近些年来常用的求解缺失数据时的迭代算法,EM算法优点是简单易行性与普遍适用性.如果最大化不能用解析的方法实现而采用一种迭代优化的方法实现M步将产生嵌套循环计算,由此增加了计算的复杂度.基于此提出了EM梯度算法.在DS-CDMA系统中应用EM梯度算法进行检测,对比EM算法下的误码性能与收敛性能,实验结果显示EM梯度算法比标准EM算法具有相同的收敛速度. 相似文献
4.
开发活动间具有耦合性。耦合活动重叠会导致活动间信息交互频繁,产生返工风险。合理计算项目进度对指导实践具有重要意义。利用设计结构矩阵(DSM)描述产品开发活动并利用高斯消去算法进行活动排序,保证整体周期最短。引入迭代学习率,并结合上下游活动之间信息交互方式和影响构建了项目进度计算模型。通过案例计算表明,耦合活动重叠方式能有效缩短项目工期,与传统方法相比,模型考虑了活动之间信息迭代,更加符合工程实践。 相似文献
5.
现有的相似度计算方法大都依赖于作者间的直接关联,忽略了间接关联.文章提出一种新的基于SimRank的作者相似度计算方法,充分考虑作者关键词二分图网络的整体结构特性,利用图结构相似度算法挖掘出作者间以及词汇间的潜在关联关系.初步实验表明该方法能够有效地识别作者之间的相似度,相比于传统的关键词耦合,该方法可以明显提高作者相似度计算的准确性. 相似文献
6.
相空间重构参数选择方法的研究 总被引：2，自引：0，他引：2
基于目前相空间重构中常用的参数选择方法,提出了一种新的相空间重构的联合算法,联合算法以时间窗口法和互信息法为基础,在综合考虑嵌入窗宽的基础上,可同时确定嵌入延迟和嵌入维数.仿真实验表明,用该算法计算Lorenz混沌时间序列关联维相对误差由传统算法的0.83%降低到0.44%,有效地提高了计算相空间重构中不变量的精度. 相似文献
7.
8.
传统的基于查表法的数控振荡器耗费大量的FPGA片内资源.为了解决这一问题,本文提出使用CORDIC算法实现数控振荡器的设计方法,详细介绍了基于CORDIC算法的数控振荡器的总体结构和多级流水线结构中迭代运算的FPGA实现方法.最后给出了仿真波形和频谱分析结果,充分证明了该设计方法的可行性. 相似文献
9.
10.
在骨龄自动评价系统研究过程中,对X射线图像中的手腕骨有效分割是一项艰巨的工作。为了解决棘手的手腕骨分割问题,提出了一种基于脉冲耦合神经网络（PCNN）的自动分割方法。该方法在合理简化传统PCNN模型的基础上,利用图像的灰度迭代阈值确定PCNN的迭代次数,实现了对手腕骨有效分割,分割结果优于OTSU算法、分水岭分割算法、阈值迭代算法。 相似文献
11.
《Journal of The Franklin Institute》2023,360(12):7808-7831
This paper solves the finite-time consensus problem for discrete time multi-agent systems (MASs) where agents update their values via linear iteration and the interactions between them are described by signed digraphs. A sufficient condition is presented that the agents can reach consensus on any given linear function of multiple initial signals in finite time, i.e., there exists an eventually positive Laplacian-based matrix associated with the underlying graph. We prove that the linear iterative framework “ratio consensus” developed for unsigned graphs in the literature can be extended to the computation for signed graphs with appropriate modifications. Our method weakens the limitation of the iterative framework on the “marginal Schur stability” of the weight matrix without increasing the computational complexity. Reaching average consensus on unsigned graphs as in the literature is regarded as a special case of our algorithm. Two illustrative examples are presented to demonstrate the correctness of the proposed results. 相似文献
12.
Mohammad Shams Esfand Abadi Sima Kadkhodazadeh 《Journal of The Franklin Institute》2011,348(2):212-238
In this paper, the concept of proportionate adaptation is extended to the normalized subband adaptive filter (NSAF), and seven proportionate normalized subband adaptive filter algorithms are established. The proposed algorithms are proportionate normalized subband adaptive filter (PNSAF), μ‐law PNSAF (MPNSAF), improved PNSAF (IPNSAF), the improved IPNSAF (IIPNSAF), the set-membership IPNSAF (SM-IPNSAF), the selective partial update IPNSAF (SPU-IPNSAF), and SM-SPU-IPNSAF which are suitable for sparse system identification in network echo cancellation. When the impulse response of the echo path is sparse, the PNSAF has initial faster convergence than NSAF but slows down dramatically after initial convergence. The MPNSAF algorithm has fast convergence speed during the whole adaptation. The IPNSAF algorithm is suitable for both sparse and dispersive impulse responses. The SM-IPNSAF exhibits good performance with significant reduction in the overall computational complexity compared with the ordinary IPNSAF. In SPU-IPNSAF, the filter coefficients are partially updated rather than the entire filter at every adaptation. In SM-SPU-IPNSAF algorithm, the concepts of SM and SPU are combined which leads to a reduction in computational complexity. The simulation results show good performance of the proposed algorithms. 相似文献
13.
Jianhua Wang Yan Song Guoliang Wei Yuying Dong 《Journal of The Franklin Institute》2021,358(3):1957-1983
This paper is concerned with the resilient dynamic output-feedback (DOF) distributed model predictive control (DMPC) problem for discrete-time polytopic uncertain systems under synchronous Round-Robin (RR) scheduling. In order to alleviate the computation burden and improve the system robustness against uncertainties, the global system is decomposed into several subsystems, where each subsystem under synchronous RR scheduling communicates with each other via a network. The RR scheduling is adopted to avoid data collisions, however the updating information at each time instant is unfortunately reduced, and the underlying RR scheduling of subsystems are deeply coupled. The main purpose of this paper is to design a set of resilient DOF-based DMPC controllers for systems under the consideration of polytopic uncertainties and synchronous RR scheduling, such that the desirable performance can be obtained at a low cost of computational time. A novel distributed performance index dependent of the synchronous RR scheduling is constructed, where the last iteration information from the neighbor subsystems is used to deal with various couplings. Then, by resorting to the distributed RR-dependent Lyapunov-like approach and inequality analysis technique, a certain upper bound of the objective is put forward to establish a solvable auxiliary optimization problem (AOP). Moreover, by using the Jacobi iteration algorithm to solve such a problem online, the distributed feedback gains are directly obtained to guarantee the convergence of system states. Finally, two examples including a distillation process example and a numerical example are employed to show the effectiveness of the proposed resilient DMPC strategy. 相似文献
14.
Michael Basin Pablo Rodriguez-Ramirez Steven X. Ding Tim Daszenies Yuri Shtessel 《Journal of The Franklin Institute》2018,355(5):2762-2778
This paper presents a novel continuous fixed-time convergent control law for dynamic systems in the presence of unbounded disturbances. A continuous fixed-time convergent control is designed to drive all states of a multi-dimensional integrator chain at the origin for a finite pre-established (fixed) time, using a scalar input. The fixed-time convergence is established and the uniform upper bound of the settling time is computed. The designed control algorithm is applied to fixed-time stabilization of two mechatronic systems, a cart inverted pendulum and a single machine infinite bus turbo generator with main steam valve control. 相似文献
15.
《Journal of The Franklin Institute》2023,360(2):1344-1377
A novel finite-time complex-valued zeroing neural network (FTCVZNN) for solving time-varying Sylvester equation is proposed and investigated. Asymptotic stability analysis of this network is examined with any general activation function satisfying a condition or with an odd monotonically increasing activation function. So far, finite-time model studies have been investigated for the upper bound time of convergence using a linear activation function with design formula for the derivative of the error or with variations of sign-bi-power activation functions to zeroing neural networks. A function adaptive coefficient for sign-bi-power activation function (FA-CSBP) is introduced and examined for faster convergence. An upper bound on convergence time is derived with the two components in the function adaptive coefficients of sign-bi-power activation function. Numerical simulation results demonstrate that the FTCVZNN with function adaptive coefficient for sign-bi-power activation function is faster than applying a sign-bi-power activation function to the zeroing neural network (ZNN) and the other finite-time complex-valued models for the selected example problems. 相似文献
16.
《Journal of The Franklin Institute》2022,359(9):4468-4488
The conjugate gradient (CG) method exhibits fast convergence speed than the steepest descent, which has received considerable attention. In this work, we propose two CG-based methods for nonlinear active noise control (NLANC). The proposed filtered-s Bessel CG (FsBCG)-I algorithm implements the functional link artificial neural network (FLANN) as a controller, and it is derived from the Matérn kernel to achieve enhanced performance in various environments. On the basis of the FsBCG-I algorithm, we further develop the FsBCG-II algorithm, which utilizes the Bessel function of the first kind to constrain outliers. As an alternative, the FsBCG-II algorithm has reduced computational complexity and similar performance as compared to the FsBCG-I algorithm. Moreover, the convergence property of the algorithms is analyzed. The proposed algorithms are compared with some highly cited previous works. Extensive simulation results demonstrate that the proposed algorithms can achieve robust performance when the noise source is impulsive, Gaussian, logistic, and time-varying. 相似文献
17.
In this paper, based on the Smith iteration (Smith, 1968), an inner-outer (IO) iteration algorithm for solving the coupled Lyapunov matrix equations (CLMEs) is presented. First, the IO iteration algorithm for solving the Sylvester matrix equation is proposed, and its convergence is analyzed in detail. Second, the IO iteration algorithm for solving the CLMEs is constructed. By utilizing the latest estimation, a current-estimation-based and two weighted IO iteration algorithms are also given for solving the CLMEs, respectively. Convergence analyses indicate that the iteration solutions generated by these algorithms always converge to the unique solutions to the CLMEs for any initial conditions. Finally, Several numerical examples are provided to show the superiority of the proposed numerical algorithms. 相似文献
18.
This paper establishes the formal numerical characteristics of closed constrained incremental successive substitution algorithms. The overall formalism gives detailed consideration to such items as the determination of: safety zones wherein the algorithm possesses inherently stable convergence characteristics; existence, uniqueness and convergence properties; formal limitations on the class of functions to which the scheme applies and lastly, establishes self-adaptive attributes. To simplify the presentation, the operators employed are cast in the functional format associated with nonlinear heat conduction. 相似文献
19.
分布式水循环模型的参数优化算法比较及应用 总被引：1，自引：0，他引：1
分布式水文模型的优势在于还原水文过程的时空变异性,可以很好地模拟和反映各种水文要素和下垫面因素的时空分布不均匀性。由此也导致模型参数过多,在子流域过多的情况下,人工调节参数繁琐复杂,应用优化算法实现参数自动调节成为首选。本文选取石羊河流域九条岭站1988-2005年实测径流资料,分别应用SCE-UA算法、遗传算法(GA)和粒子群算法(PSO)对分布式水循环模型(时变增益模型)进行参数率定,对比3种算法的收敛速度、所需迭代次数和算法稳定性。结果表明:通过SCE-UA、GA和PSO的优化,模型水平衡系数都控制在0.0左右,而相关系数和效率系数分别能达到0.90和0.84以上,模拟精度较好。但粒子群算法的全局搜索能力和收敛速度优于SCE-UA和遗传算法,所需迭代次数最少,初值敏感性小,更适合时变增益模型的参数寻优,有很高的扩展性和改进潜力。 相似文献
20.
首先提出了连续时间的网络截流选址问题,并以保护整个道路交通网络为目标,建立了防御性醉酒驾驶拦截问题的模型。根据问题的特征,分别设计了基于时间的迭代改进算法和离散选址问题的拉格朗日启发式算法,并通过随机实例对算法进行了测试。结果表明:连续时间的同步拦截问题可以通过分离连续的时间变量和离散的选址变量的方法,多次求解覆盖问题而有效解决,并且迭代改进算法对时间的搜索性更强,从而能够用较少的迭代次数解决原问题。 相似文献