sfsagfs

遗传算法求tsp问题及其matlab代码实现 主程序中有一rand( seed ,n) n 为某一整数, 这是设置随机数发生器的种子，这样实际上规定了随机数发生的方式，因此后面的随机数其实都是定下来的，这样所有人就可以看到同一结果, 可注释掉此行，那么每次的结果就不一定再相同了. (Genetic algorithm to solve the TSP problem and the matlab code to achieve A Rand main program ( seed , n) n as an integer, which is the setting of the random number generator seed, this actually provides a random number generating means, so the random number behind actually are determined, so that everyone can see the same results, can comment out this line, then each time the results do not necessarily the same. )

C++ Primer Plus, 作者 Stephen Prata 版本6ed, AW, 年份 2012 C++初级学者用书(C++ Primer Plus, Stephen Prata, 6ed, AW, 2012 C++ junior scholars books)

电骡0.45b源码.rar (-- Mule 0.45b source. Rar-- Mule 0.45b source. Rar)

Embedded Application using Matlab

说明：  针对小流域设计洪水计算中，采用推理公式求解洪峰流量Qm及汇流时间τ的方法繁琐，查算精度较低等问题，提出用牛顿迭代法求解，该方法较原图解试算法收敛快，迭代次数少，计算速度快，精度可靠。计算实例表明，用简单迭代法与牛顿迭代法计算设计洪峰流量，其结果与图解试算法完全一致。()

encoder of speech compression

Digital image processing using matlab - Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins - 0130085197(Digital image processing using matlab- Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins- 0130085197)

说明：  非常著名的爱尔朗公式的实现,主要对排队思想的进一步编程实现(Well-known Erlang formula to achieve, mainly on the line thinking further programming)

让ARToolKit支持MQO模型所需的所有函数实现代码，均在对应的GLMetaseq.c中。(Let ARToolKit supports all the functions needed to MQO model codes, both in the corresponding GLMetaseq.c.)

在二维空间里有两个点A=(X1，Y1)和B=(X2，Y2)，如果X1>X2并且Y1>Y2 ，我们认为A优于B，A是这个集合的最大极值点，在给定的二维空间里的N个点的集合S中，找出最大极值点。(In two-dimensional space, there are two points = A = (X1, Y1) and B (X2, Y2), if the X1 and Y1 > X2 > Y2, we think that A is superior to B, A is the biggest extreme value point of the set, in A given set of N points in the two-dimensional space S, find out the most extreme value point.)