minonlntool

C-means in 2 types. C=2

说明：  贝叶斯统计推断相关资料和贝叶斯方法，学习贝叶斯不错的资料(Bayesian statistical inference related data and bayesian methods, learning bayesian good data)

本程序在matlab中运行。 Generate_SystemMatrix是一个计算OSEM，MLEM迭代图像算法中系统矩阵的函数，其用法Generate_SystemMatrix（pixel），为所要重建图像的大小，一般为64,128,256，pixel也大运算越慢。 里面的diedai-test文件是一个简单的MLEM重建算法，其中要加载SystemMatrix矩阵就是Generate_SystemMatrix(128)的结果，注意如果要运行diedai-test，生成的系统矩阵名要保存为SystemMatrix，否则出错。 testsino是一个正弦图实例，就是MLEM算法中的投影矩阵，机算是数据。(This program is run in matlab. The Generate_SystemMatrix is ​ ​ a calculation of the OSEM, a function of the system matrix MLEM iterative image algorithm, its use Generate_SystemMatrix (pixel) to rebuild the image size, usually 64,128,256, pixel also large computing slower. Inside diedai-test file is a simple MLEM reconstruction algorithm, which load SystemMatrix matrix is ​ ​ the result of Generate_SystemMatrix (128), pay attention to if you want to to run diedai-test, the generated system matrix is ​ ​ saved as SystemMatrix, otherwise an error. testsino instance of a sinogram projection matrix MLEM algorithm, machine be regarded as data.)

使用Fortran涡度、散度、涡度平流、温度平流计算代码(Using Fortran vorticity, divergence, vorticity advection, temperature advection calculation code.)

关于一的微分方程数值解,一维波动方程初边值问题Crank-Nicholson格式,及追赶法(On one of the numerical solution of differential equations, one-dimensional wave equation Crank-Nicholson format, and to catch up with the Law)

外点牛顿法，十个参数，可以解决带有约束条件的非线性规划问题。(External point Newton, with dozens of parameters that can solve linear programming problems with constraints)

说明：  abaqus fortran语言下的dload和vdload程序代码，以显示及隐式实现移动加载(Dload and vdload code in ABAQUS FORTRAN to display and implicitly implement mobile loading)

比Windows自带的高级一点的计算器，能将整个表达式输入，然后求值。 这个程序要求读者具备编译原理的一些知识。 (Advanced calculator than Windows built, the whole expression input can be then evaluated. This program requires the reader to have some knowledge of compiler theory.)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)

说明：  基于AOA的室外雷达定位算法仿真，基于TDOA的室外雷达定位算法仿真，基于AOA doa的室外雷达定位算法仿真，三维(Simulation of outdoor radar location algorithm based on AOA, simulation of outdoor radar location algorithm based on TDOA, simulation of outdoor radar location algorithm based on AOA TDOA, 3d)