一种量子神经网络模型学习算法及应用

提出一种量子神经网络模型及学习算法. 首先基于生物神经元信息处理机制和量子计算原理构造出一种量子神经元, 该神经元由加权、聚合、活化、激励四部分组成. 然后由量子神经元构造出三层量子神经网络模型, 其输入和输出为实值向量, 权值和活性值为量子比特. 基于梯度下降法构造了该模型的超线性收敛学习算法. 通过模式识别和函数逼近两种仿真结果表明该模型及算法是有效的.     

一种求解Shubert函数优化问题的演化算法

综合国内外演化计算研究现状,基于热力学中的自由能极小化原理, 设计了一个全新的热力学演化算法,并通过对于Shubert函数优化问题求解的数值试验,测试了热力学演化算法的优良性能,实验结果表明了热力学演化算法求出的解比一般演化算法求出的解更加接近于全局最优。     

A method for numerical solution of a multidimensional convection-diffusion problem

We propose a modification of the additive splitting algorithm to solve the convection-diffusion problem using an efficient finite-difference scheme. The modification decreases the number of data exchanges and their amount during the numerical solution of a system of multidimensional equations. Approximation, stability, and convergence are considered. Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 100–107, January–February 2009.     

A new SQP algorithm based on semidefinite programming

The paper gives a new filter-SQP algorithm of the semidefinite programming through combining the sequence nonlinear algorithm of solving the semidefinite programming, low rank conversion, and filter method, which, under certain conditions, proves that the algorithm is global convergence.     

The Holy Alignment: Geodesic and Astronomical Fundamentals for Calculating the Adjustment of Medieval Naves

It is commonly believed that the longitudinal axes of churches extend exactly in an east-west direction. However, thorough investigations have shown that this is not always correct; rather, both southern and northern deviations of up to about 25° can occur. The angular deviation between the church axis and true east is called the Holy Alignment. This present study presents the possibility that the nave is oriented towards the direction of the sun-rising point on the name day of the patron saint of the church. If several saints share the patronage, the Holy Alignment equals the algebraic sum of the angular distances for each saint. The orientation of a nave can be analyzed by means of common mathematical relations used in geodesy, astronomy and gnomonics. In order to perform such an analysis, it is necessary to know the history of the patronage of the church; the Gauss-Krüger coordinates of the ground plan; and characteristic astronomical quantities at the time the church was built. A calculated example with the saints Andrew, James and Philip for the year 980 illustrates the analysis. An appendix deals with the influence of atmospheric refraction on the apparent altitude of the sun near the horizon.     

Approximation processes for resolvent operators

We introduce general sequences of linear operators obtained from classical approximation processes which are useful in the approximation of the resolvent operators of the generators of suitable C ₀-semigroups. The main aim is the representation of the resolvent operators in terms of classical approximation operators. Work performed under the auspices of PRIN 2006–07 “Kolmogorov equations” (coordinator G. Da Prato)     

一类新的带记忆模型的非单调信赖域算法

本文就无约束优化问题提出了一个带记忆模型的非单调信赖域算法。与传统的非单调信赖域算法不同,文中的信赖域子问题的逼近模型为记忆模型,该模型使我们可以从更全面的角度来求得信赖域试探步,从而避免了传统非单调信赖域方法中试探步的求取完全依赖于当前点的信息而过于局部化的困难。文中提出了一个带记忆模型的非单调信赖域
域算法,并证明了其全局收敛性。     

The learning convergence of CMAC in cyclic learning

In this paper we discuss the learning convergence of the cerebellar model articulation controller (CMAC) in cyclic learning.We prove the following results.First,if the training samples are noiseless,the training algorithm converges if and only if the learning rate is chosen from (0,2).Second,when the training samples have noises,the learning algorithm will converge with a probability of one if the learning rate is dynamically decreased.Third,in the case with noises,with a small but fixed learning rate ε the mean square error of the weight sequences generated by the CMAC learning algorithm will be bounded by O(ε).Some simulation experiments are carried out to test these results.     

Robust integrated sequential covariance intersection fusion Kalman filters and their convergence and stability for networked sensor systems with five uncertainties

For networked sensor systems (NSSs) with hard and soft sensors including five uncertainties, two universal approaches of solving the robust fusion estimation problems are presented. It includes an integrated sequential covariance intersection (SCI) fusion minimax robust Kalman filtering approach with cross-covariance information and a generalized Lyapunov equation approach with four pairs of Lyapunov equations. Applying them, the robust local and SCI fused time-varying and steady-state Kalman filters are presented in the sense that their actual estimation error variances are guaranteed to have the corresponding minimal upper bounds. The equivalent batch SCI fusers are also presented. Their robustness and accuracy relations are proved, and the sensitivity of the SCI fuser with respect to the fused orders of sensors is analyzed. Applying the dynamic error system analysis method and the dynamic variance error system analysis method, a new convergence and absolute asymptotic stability theory of robust fusion Kalman filtering is presented. The classical Kalman filtering convergence and stability theory is developed. Compared with the original covariance intersection fuser, they significantly reduced the computational complexity and burden. Compared with the optimal and conservative SCI fusers, they significantly improved the robust accuracies. They are suitable to deal with asynchronous or random delayed data and are suitable for real-time applications. A simulation applied to the two-mass spring damper mechanical system shows their effectiveness.     

基于ATLG混合模型的股票价格预测

股市是金融市场的重要组成部分,对股票价格预测有着重要的意义.同时,深度学习具有强大的数据处理能力,可以解决金融时间序列的复杂性所带来的问题.对此,本文提出一种结合自注意力机制的混合神经网络模型(ATLG).该模型由长短期记忆网络(LSTM)、门控递归单元(GRU)、自注意力机制构建而成,用于对股票价格的预测.实验结果表明:(1)与LSTM、GRU、RNN-LSTM、RNN-GRU等模型相比, ATLG模型的准确率更高;(2)引入自注意力机制使模型更能聚焦于重要时间点的股票特征信息;(3)通过对比,双层神经网络起到的效果更为明显.(4)通过MACD (moving average convergence and divergence)指标进行回测检验,获得了53%的收益,高于同期沪深300的收益.结果证明了该模型在股票价格预测中的有效性和实用性.