ObjectDetectionContours

一个实现维诺图的C++程序,算法课的作业。(Vino map)

ACM，杭电1698，屠夫的钩子，区间求和问题，经典的线段树问题(ACM, Hangzhou Xinhua 1698, butcher' s hook, interval summation problem, the classic problem of segment tree)

说明：  计算mie散射相关参数，根据颗粒粒径 ，入射光波长 ，颗粒折射率，介质折射率，计算不同角度下散射光强，不同粒径下的消光系数。(Calculate the mie scattering related parameters, calculate the scattered light intensity at different angles and the extinction coefficient at different particle sizes according to particle size, incident light wavelength, particle refractive index, and medium refractive index.)

演算NP问题的一个小程序，上完计算智能后的一个小作业，感觉做的还可以，传上来(NP calculus problem, a small procedure, after the End of Computational Intelligence in a small operation, I feel can do, Chuan-up)

此程序为泽尼克的方法拟合离散点的数据，用于图像处理。(Zernike parameter fitting)

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

vc++开发常用模块之数据库，开发中与数据库相关的模块(VC++ SQL)

vs2010平台下的stk二次开发，利用CONNECT模块，获取stk模型数据(VS2010 platform under the STK two development, the use of CONNECT module, access to STK model data)

数​ 字​ 图​ 像​ 处​ 理​ 中​ 的​ b​ p​ m​ 图​ 像​ 读​ 取(Digital image processing of the image b p m reading)

fluent软件中关于模拟煤粉气化的udf代码。(Fluent software on the simulation of coal gasification UDF code)