算法

The hybrid optimization algorithm is employed to solve the models where the membership functions of loan return rates are complex.The algorithm integrates fuzzy simulation,neural network,genetic algorithm and simultaneous perturbation stochastic approximation algorithm.

对于贷款收益率的隶属函数比较复杂的情况，应用集成模糊模拟、神经网络、遗传算法和同步扰动随机逼近算法的混合优化算法求解模型。

The hybrid optimization algorithm was employed to solve the models where the membership functions of loan return rates were complex. The algorithm integrated fuzzy simulation, neural network, genetic algorithm and simultaneous perturbation stochastic approximation algorithm.

对于贷款收益率的隶属函数比较复杂的情况，应用集成模糊模拟、神经网络、遗传算法和同步扰动随机逼近算法的混合优化算法求解模型。

For the coordination of multiple agents in noncooperation environment, we considered the learning aim as finding a Nash equilibrium strategy through in learning function taking other agent's actions into account. Therefore, we expended the single agent Q-learning algorithm into multiagent Q-learning algorithm. In addition, we proved the convergence of multi-agent Q-learning algorithm under certain general sum stochastic game architecture for only one Nash equilibrium or multiple same Nash equilibrium.

对于非合作环境下的多智能体协调我们通过在学习函数中考虑了智能体的联合行动，提出把学习目标作为求取一个Nash平衡点策略，这样将单智能体Q-learning算法扩展到多智能体的Q-learning算法；证明了在一定的一般和随机对策结构下具有一个或多个相同Nash平衡点条件下多智能体Q-learning算法的收敛性。

For the multi-channel system with multiplicative noises under multi-sensor observation an optimal fusion estimation algorithm is proposed on the conditions that the multiplicative noise is in the form of a general stochastic matrix and the measurement noises of each sensor are correlated with the dynamic noise.

第二，本文针对多传感器观测下的多通道带乘性噪声系统，在乘性噪声为一般矩阵且各个传感器的观测噪声分别与系统的动态噪声同时刻相关的条件下给出了状态最优滤波融合算法、最优固定域平滑算法及最优固定域反褶积算法。

Following this principle, we keep all the algorithms in our scheme very simple and straightfoward to achieve high performance.

根据先期研究的经验，这些算法摈弃了所有复杂的预测及学习算法，而尽量采用简洁明了的策略，目的是通过算法本身的简洁来达到系统运行的高效。

Computational examples show that the modified subgradient optimization algorithm for Lagrangean relaxation can reduce the iterative steps obviously, and is proved to be efficient.

算法实例表明，改进后的拉格朗日松弛算法迭代步数显著减少，证明算法是有效的。

Using the inherent general-special relation between concepts in sublattice,the horizontal union algorithm of multiple concept lattices to construct the concept lattice is also presented.

试验表明，该算法和直接用形式背景来构造概念格的算法相比，其时间复杂度有显著改善。显然，该算法适用于对概念格进行分布并行构造

These three algorithms can avoid to recompute the nth order head submatrix of the Jacobi matrix. Moreover, the last two algorithms are more stable, their precision can match well with the algorithm of Boley and Golub.

这三种算法都可以避免重构Jacobi矩阵的n阶首主子阵，并且后两种算法更稳定，数值精度可以与Boley和Golub的算法媲美。

Our results improve the former results. For periodic Jacobi matrix, some new spectral properties of periodic Jacobi matrix are given by studying the relationship of the eigenvalues of periodic Jacobi matrix and its n—1 principal submatrix. Applying these spectral properties, we present a necessary and sufficient condition for the solvability of an inverse problem of periodic Jacobi matrices and discuss the number and the relationship of its solutions. Furthermore, we propose a new algorithm to construct its solution and compare it with the former algorithms. As this inverse problem of periodic Jacobi matrix usually has multiple solutions as many other eigenvalue inverse problems, we study the uniqueness of this problem. And a necessary and sufficient condition is given to ensure its uniqueness, under which an algorithm is presented and the stability analysis is also given. Finally, we put forward a new inverse problem for periodic Jacobi matrix which has not been solved.

对周期Jacobi矩阵特征值反问题，通过研究周期Jacobi矩阵与其n-1阶主子阵特征值的关系，给出了周期Jacobi矩阵的一些新的谱性质；利用这些谱性质，研究了一类周期Jacobi矩阵特征值反问题，用新的方法推导出了该类特征值反问题有解的充分必要条件，并讨论了解的个数以及解与解之间的关系；此外，提出了一种新的构造周期Jacobi矩阵反问题解的数值算法，并与前人的算法做了一定比较；由于周期Jacobi矩阵特征值反问题和其他很多特征值反问题一样往往存在多个解，本论文给出了周期Jacobi矩阵反问题解唯一的充要条件，并发现周期Jacobi矩阵特征值反问题的解唯一当且仅当构造的矩阵满足一定的条件；在解唯一的情况下，给出了构造唯一解的数值算法，并做了相应的稳定性分析；最后，提出了一类新的有待于解决的周期Jacobi矩阵特征值反问题。

This paper probes the algorithm of automatic network topology from several important thoughts, mostly including the algorithm skills of showing automatically of all equipment and links, the display of the topology map of subnetwork and looking over the correlated information of any equipment or any link.

分别从算法中几个重要技巧的实现思想来探讨自动绘制网络拓扑的算法，主要包括网络设备和链路的自动显示、子网拓扑图的显示及查看设备和链路相关信息的算法技巧。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。