基于小波变换模极大值的自适应阈值图像去噪算法

依据白噪声小波变换性态与信号奇异性相比具有显著不同的特点,在大尺度下设置阈值,去掉噪声信号而保留图像细节信号引起的模极大值点。在阈值设置问题上,采用自适应阈值的方法,克服单一阈值不能在每级尺度上将信号与噪声作最大分离的缺点。实验表明,与单一阈值去噪方法相比,该方法不仅可以保留图像边缘信息,而且能提高去噪后图像的峰值信噪比2~5 dB。     

恩格斯历史合力论核心观点解析

恩格斯历史合力论认为,各种因素相互作用的历史合力是社会发展的终极原因,在历史合力的诸因素中经济因素归根结底起决定作用,而在具体历史时期具体起主导作用的因素是可变的。     

Technical note: Worst‐case performance of power‐of‐two policies for serial inventory systems with incremental quantity discounts

This study presents power‐of‐two policies for a serial inventory system with constant demand rate and incremental quantity discounts at the most upstream stage. It is shown that an optimal solution is nested and follows a zero‐inventory ordering policy. To prove the effectiveness of power‐of‐two policies, a lower bound on the optimal cost is obtained. A policy that has a cost within 6% of the lower bound is developed for a fixed base planning period. For a variable base planning period, a 98% effective policy is provided. An extension is included for a system with price dependent holding costs. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

电液伺服系统的模糊神经网络自适应控制

针对电液伺服控制系统中存在的非线性影响,常规PID控制难以取得良好的控制效果,采用模糊神经网络自适应控制,通过BP算法改变模糊隶属函数的形状及模糊规则的中心值,实验结果表明该方法能有效地跟踪电液位置伺服系统。     

控制系统设计的模型参考逆方法及其在火控系统中的应用

给出了一种基于模型参考最优化方法和逆系统设计方法的鲁棒控制系统设计方法,并将其同模型参考自适应方法和逆系统方法进行了比较。将这一方法应用于某舰炮控制系统设计的仿真研究结果表明,该方法不仅简单易行,鲁棒性强,而且具有极好的控制效果     

函数生成器的优化设计

本文介绍了一种优化的多变量函数产生器的设计思想,详尽论述了多变量函数快速插值算法、消除冗余断点搜索的思想以及搜索次数为１的断点搜索策略。实用表明,该产生器高效可行,比一般的多变量函数产生器减少计算量一半左右,有效地缩短了仿真问题的求解时间。     

关于自适应滤波技术的一些思考

本文研究工程实践中应用Ｋａｌｍａｎ滤波时出现的滤波异常现象。文中从滤波异常的检测出发,由此构成动力学噪声方差阵的自适应估计。对于常用的衰减记忆滤波,提出了衰减因子的自适应确定方法,对于未知的动力学噪声和观测噪声的方差阵,运用Ｂａｙｅｓ－ＭＬ估计方法给出了递推估算方案。对于构造自适应滤波的技术途径,提出了一些看法。     

用配点法求解四边搁支板的弯曲问题

根据弹性薄板微分方程的一般解和边界条件的配点法来求四边搁支板的弯曲问题,并以对称荷载作用下的正方形板为例进行了分析计算。     

一种全双工模拟话密系统的自适应回波抵消器

文中介绍一种全双工模拟话密系统的自适应回波抵消器,该抵消器用块修正方法更新横向滤波器的系数。这种方法的收敛性能和计算效率均优于标准的最小梯度算法,且满足国际电报电话咨询委员会(CCITT)建议的回波抵消器要求G.165.     

A metaheuristic scheduling procedure for resource-constrained projects with cash flows

Resource-constrained project scheduling problems with cash flows (RCPSPCF) are complex, combinatorial optimization problems. Many heuristics have been reported in the literature that produce reasonable schedules in limited project environments. However, the lack of a heuristic that dominates under differing project conditions can lead to a suboptimal choice of an appropriate heuristic for scheduling any given project. This may result in poor schedules and monetary losses. This paper reports on the application of the tabu search metaheuristic procedure for the RCPSPCF. Strategies for neighborhood generation and candidate selection that exploit the special features of the problem are combined with a simple multiheuristic start procedure. Extensive experimentation, with multiple data sets and comparison with an upper bound, indicates a significant improvement, both in project Net Present Value (NPV) as well as the number of projects, where the metaheuristic outperforms the best known heuristics in the literature. More specifically, this procedure produces the best schedules in over 85% of the projects tested, in contrast to the best single-pass heuristics which have been shown to dominate in at most 20% of the same cases. This iterative, general purpose heuristic is able to adapt significantly better to the complex interactions of the many critical parameters of the RCPSPCF than single-pass heuristics that use more specific information about each project environment. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 912–927, 1999