基于RBF网络信道均衡器

在数字通信系统中为了克服信道畸变引起的码间干扰，在接收端必须采用信道均衡技术。在本文中，我们将RBF网络用作均衡器。采用最近邻聚类和直接判决算法来调整隐藏层中心，然后再用LMS算法调整输出层的系数。该算法可以实现在线学习，根据相应的准则增加，删除隐藏层节点。算法事先不必确定隐藏层的节点个数。模拟结果显示，RBF网络均衡器能够正确地将信号从有噪信道中恢复出来，在计算机模拟仿真中其性能与理想贝叶斯均衡器相当。     

非定常Navier-Stokes方程基于两重网格离散的有限元并行算法

基于两重网格离散和区域分解技巧,提出三种求解非定常Navier-Stokes方程的有限元并行算法.算法的基本思想是在每一时间迭代步,在粗网格上采用Oseen迭代法求解非线性问题,在细网格上分别并行求解Oseen、Newton、Stokes线性问题以校正粗网格解.对于空间变量采用有限元离散,时间变量采用向后Euler格式离散.数值实验验证了算法的有效性.     

基于改进克隆选择算法的统一混沌系统同步控制与参数辨识

提出一种改进的克隆选择算法用于解决混沌系统的参数辨识问题.该算法利用抗体的高频变异和受体编辑两种机制有效平衡算法的全局探索与局部开发，并引入向精英抗体学习策略进一步提高算法的收敛质量.对10个优化问题的实验表明：所提出算法在求解精度、收敛速度以及稳定性方面具有更好的性能.以参数未知统一混沌系统的同步控制为研究对象，合理设计同步控制器，并对同步系统的稳定性进行理论分析.通过对同步比例因子的设置，实现统一混沌系统的完全同步、反同步、投影同步等多种同步方式.仿真实验结果表明该方法能够实现对未知系统参数的精确辨识以及驱动-响应系统的有效同步控制，验证了所提方法的可行性与有效性.     

卷积神经网络用于近红外光谱古筝面板木材分级

目前,我国乐器制作行业在古筝面板用木材等级的筛选上主要依赖于技师主观评判,但此法缺少科学理论的依据,效率低,客观性及出材率的提高等方面受到限制,无法满足乐器市场的大量需求。实现古筝面板用木材快速、智能化的分级工作是一个急需解决的课题。近红外光谱非常适用于测量含氢的有机物质。古筝面板木材主要化学成分的化学键均由含氢基团组成,不同等级板材的化学成分存在差异,这些差异反映在近红外光谱中,为判断木材等级提供了可能。同时卷积神经网络对非线性数据具有较强的特征提取能力,所以提出一种应用卷积神经网络模型对光谱数据进行分析的方法,进而判别木材的等级。应用了Savitzky Golay一阶、二阶微分两种预处理方法和核主成分分析、连续投影算法两种数据压缩方法,通过所设计的卷积神经网络模型以样本识别准确率和模型构建过程中的损失值作为判定指标选出最佳预处理和数据压缩方法。为了提高模型提取分析光谱数据的能力和避免过拟合现象,应用了多通道卷积核、批量归一化和early stopping策略,将通过两层卷积层提取的特征信息送入全连接层,从而充分提取剩余信息,通过Softmax函数获得板材的最终预测等级,从而确定了最终模型。最终Savitzky Golay一阶微分和核主成分分析为最佳数据处理方法,同时得出用于区分不同等级的古筝面板用木材的主要关键谱带,分别为1 163~1 243, 1 346~1 375和1 525~1 584 nm。将该模型应用于测试集样本,古筝面板用木材的等级识别准确率为95.5%。实验结果表明所提出的方法可以高效地处理光谱数据,有效识别区分不同等级的古筝面板用木材的关键特征,从而为广阔的乐器市场提供一定的技术支持。     

吸收峰混叠的太赫兹光谱区间组合特征提取算法

太赫兹光谱是物质识别的前沿方法之一。由于不同物质的分子组成或结构各异,许多物质的太赫兹吸收谱会在特定频率上出现吸收峰,可以作为混合物成分检测的重要特征。有效准确地提取这些吸收峰的参数,是提高识别率的关键。多峰拟合算法将光谱曲线拟合成若干个标准峰函数之和,能够同时提取到吸收峰的频率、峰高、峰宽等信息。但是该算法以寻峰算法结果为基础确定吸收峰的大致位置和数量,寻峰结果不一定是最优的拟合结果,而且很难准确识别定位混叠状态的吸收峰。为了提高混叠光谱中吸收峰的识别定位精度,提出以大幅度平滑后的曲线波谷为分界点,将预处理后的光谱分成若干个子区间。然后将子区间组合起来进行多峰拟合,通过遗传算法得到最优的拟合子区间组合和吸收峰频率近似值,拟合时每个子区间中通过峰数递增最优化方法确定拟合的吸收峰数,最后微调优化得到最优的吸收峰频率、峰高值。为了实现物质的识别,通过密度聚类算法得到同一类纯净物在多次测量中的共同吸收峰,以此作为标准数据,通过提出的基于吸收峰特征的光谱匹配算法实现了纯净物和不同含量混合物的快速识别。对10类纯净物的实际光谱数据进行拟合聚类,得到其吸收峰参数,结果与太赫兹光谱数据库一致。通过识别算法对纯净物测试集进行识别的识别率为100%,证明了特征提取和物质识别算法的有效性。对于含有混叠峰的混合物光谱,二阶导数法对葡萄糖-乳糖混合物光谱中被掩盖吸收峰(1.280 THz)的识别率仅为70%,提取到的频率平均值为1.316 THz;而该算法提高识别率至95%,频率平均值为1.281 THz,该算法提高了对混叠峰的分辨能力,能够精确定位混叠峰。对10类纯净物构成的6类不同程度混叠的二元混合物前二、三识别率分别达到90.8%和98.3%,提取到的特征能够有效应用于混合物的成分检测。该算法能够以纯净物数据为标准数据实现成分各异的混合物成分检测,对于太赫兹光谱混合物成分检测有重要意义。     

Sparse Multicategory Generalized Distance Weighted Discrimination in Ultra-High Dimensions

Distance weighted discrimination (DWD) is an appealing classification method that is capable of overcoming data piling problems in high-dimensional settings. Especially when various sparsity structures are assumed in these settings, variable selection in multicategory classification poses great challenges. In this paper, we propose a multicategory generalized DWD (MgDWD) method that maintains intrinsic variable group structures during selection using a sparse group lasso penalty. Theoretically, we derive minimizer uniqueness for the penalized MgDWD loss function and consistency properties for the proposed classifier. We further develop an efficient algorithm based on the proximal operator to solve the optimization problem. The performance of MgDWD is evaluated using finite sample simulations and miRNA data from an HIV study.     

Modified Gerchberg–Saxton (G-S) Algorithm and Its Application

The Gerchberg–Saxton (G-S) algorithm is a phase retrieval algorithm that is widely used in beam shaping and optical information processing. However, the G-S algorithm has difficulty obtaining the exact solution after iterating, and an approximate solution is often obtained. In this paper, we propose a series of modified G-S algorithms based on the Fresnel transform domain, including the single-phase retrieval (SPR) algorithm, the double-phase retrieval (DPR) algorithm, and the multiple-phase retrieval (MPR) algorithm. The analysis results show that the convergence of the SPR algorithm is better than that of the G-S algorithm, but the exact solution is not obtained. The DPR and MPR algorithms have good convergence and can obtain exact solutions; that is, the information is recovered losslessly. We discuss the security advantages and verification reliability of the proposed algorithms in image encryption. A multiple-image encryption scheme is proposed, in which n plaintexts can be recovered from n ciphertexts, which greatly improves the efficiency of the system. Finally, the proposed algorithms are compared with the current phase retrieval algorithms, and future applications are discussed. We hope that our research can provide new ideas for the application of the G-S algorithm.     

Dynamic optimization problems with bounded terminal conditions

Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via the Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm (SGRA) via a simple augmentation of the unknown parameter vector . Three example problems with bounded terminal conditions are solved to verify this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant No. NCC 2-106.     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.     

Sequential stopping rules for the multistart algorithm in global optimisation

In this paper a sequential stopping rule is developed for the Multistart algorithm. A statistical model for the values of the observed local maxima of an objective function is introduced in the framework of Bayesian non-parametric statistics. A suitablea-priori distribution is proposed which is general enough and which leads to computationally manageable expressions for thea-posteriori distribution. Sequential stopping rules of thek-step look-ahead kind are then explicitly derived, and their numerical effectiveness compared.