肝脏 ct 图像分割算法

数据库 fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase fundamentalsDatabase 基本面

solution of linear ODE by SHOOTING method Runge kutta

用C++写的矩阵和矢量运算库-C write the matrix and vector arithmetic library

求解一阶常微分方程的两个欧拉法，先前欧拉和改进梯形法。-solving a differential equation 2 Euler, Euler and improve previous trapezoidal method.

应用背景 点集的三角剖分（Triangulation），对数值分析（比如有限元分析）以及图形学来说，都是极为重要的一项预处理技术。尤其是Delaunay三角剖分，由于其独特性，关于点集的很多种几何图都和Delaunay三角剖分相关，如Voronoi图，EMST树，Gabriel图等。Delaunay三角剖分有最大化最小角，“最接近于规则化的“的三角网和唯一性（任意四点不能共圆）两个特点。关键技术基于散点的构网算法理论严密、唯一性好，网格满足空圆特性，较为理想。由其逐点插入的构网过程可知，遇到非Delaunay边时，通过删除调整，可以构造形成新的Delaunay边。在完成构网后，增加新点时，无需对所有的点进行重新构网，只需对新点的影响三角形范围进行局部联网，且局部联网的方法简单易行。同样，点的删除、移动也可快速动态地进行。但在实际应用当中，这种构网算法当点集较大时构网速度也较慢，如果点集范围是非凸区域或者存在内环，则会产生非法三角形。

ZIP解压源程序 VC++编写 Borland C++buider 环境下通过-source VC extracting ZIP prepared Borland C environment through buider

全主元高斯消元法求解复系数线性方程组的解-err

另一个分形程序，代码绝对值得一读，运算速度是我见过最快的-procedures, code definitely worth a read computational speed is the fastest I have seen

This is the project of my course in the USA: Customers arrive at a service station (with a single server) according to the Poisson process with a mean arrival rate of lambda = 0.3 (customers/min). Each customer waits in queue (if present), proceeds to receive service upon his/her turn, and departs the system when the service is completed. The service time is uniformly distributed between 2.5 and 4.5 minutes. On each day, the service station is open for two hours. Any customers in queue at the end of work hours are served before closing the service station for the day. Use simulation (do 100 simulation runs) to determine

c_mean算法是一种非监督的模式识别算法，不需要进行样本训练，通过计算样本距离，进行比较分类。算法结构简单，对于团状数据分类效果理想。