采用贝叶斯正则化算法（抑制过拟合）提高 BP 网络的推广能力，采用两种训练方法， 即 L-M 优化算法（trainlm）和贝叶斯正则化算法（trainbr），用以训练 BP 网络；-Bayesian regularization algorithm (inhibition of over-fitting) to improve the generalization ability of BP network, using two training methods, that LM opti

This program is designed to perform matrix matrix multiplication A x B = C, where A is an lxm matrix, B is a m x n matrix and C is a l x n matrix. The program is designed to be a template serial program that can be expanded into a parallel

折半查找法是效率较高的一种查找方法。假设有已经按照从小到大的顺序排列好的五个整数a0~a4，要查找的数是X，其基本思想是: 设查找数据的范围下限为l=1，上限为h=5，求中点m=(l+h)/2，用X与中点元素am比较，若X等于am，即找到，停止查找;否则，若X大于am，替换下限l=m+1，到下半段继续查找;若X小于am，换上限h=m-1，到上半段继续查找;如此重复前面的过程直到找到或者l>h为止。如果l>h，说明没有此数，打印找不到信息，程序结束。(The method of bin