五点差分格式

该源程序是用动态规划算法求解最优二叉搜索树问题-the source is dynamic programming algorithm for optimal binary search tree problem

TMS320C6000汇编和C语言的混合编程(TMS320C6000 compilation and mixed C Programming Language)

STM32的硬件I2C比较难用，此模拟I2C可以实现其功能，但速度不及硬件。(STM32 more difficult to use the hardware I2C, I2C this simulation can achieve its function, but the speed is less than the hardware.)

根据隐藏线消除算法，实现圆柱体的动态消隐，时期看起来更具真实效果。(According to the hidden line removal algorithms, realize the cylinder dynamic blanking, look more realistic effect.)

本程序使用OpenCV提供的算法，封装成了一个使用起来很简单的类CameraCalibrator。通过这个类你可以迅速上手摄像机标定，而且标定的摄像机内外参数可导出供后续使用，参数文件为calib.xml。祝学习愉快！

实现排序操作SortDemoSortDemo.rar,很不错的vc源码，希望对大家有所帮助。(To achieve the sorting operation SortDemo SortDemo.rar, very good vc source, we want to help.)

opencv 读取视频图像并作一些简单的基本的处理，比如边缘检测，中值滤波等等(Read the video image and make a few simple basic processing, such as edge detection, median filtering, etc.)

说明：  一种用C＋＋编的罚函数内点法进行的优化程序设计，解决有关优化问题，可以使用，抄来的，仅供己用(a C++ compile penalty function interior point method for optimizing the design process and solve the optimization problem, it can use, copied, only for their own use!)

简单的物资管理系统，包括有些有用的原代码，仅共参考-simple materials management systems, including some useful original code, only a total of reference

private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {(private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI* 0.5f else return Math.PI* 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {)