opengl 茶壶

经典算法之换位和工作安排-classic algorithms transposition and organization of work

数学小帮手本软件对一元,二元数学函数的分析提供帮助.可以对整个函数图形进行细致入微的观察，进行任意的缩小，放大-help the small mathematical software to a million dual function of mathematical analysis to help. Can graphics for the entire function of meticulous observation, arbitrary narrowing and enlarge

这个我写的一个计算LC滤波器的程序，可以显示出最后的频率截止情况，有最平法，椭圆法等计算方法-this, I wrote a calculation of the LC filter procedures can demonstrate that the frequency of the final deadline, the most-France, oval law calculation method

它包含不同调度算法 job.1。fifo2。lru3.opt

资源描述TSP问题是一个NP难题，因PSO算法具有算法相对简单等特性借用BPSO来解决TSP问题，因此借鉴遗传算法的交叉运算，用基本粒子群算法中的学习因子来限制速度，依据选取当前速度值的概率（在算法中借用惯性系数w来实现）与rand(0,1)进行比较得到离散速度变量

VIBE实时背景差分算法。这种算法是用 C/c + + 编码的。它可以找到序列帧和视频运动对象。

分段算法的程序，很好的。绝对简练-Segmentations procedures very well. Absolutely concise

k-means 算法的工作过程说明如下：首先从n个数据对象任意选择 k 个对象作为初始聚类中心；而对于所剩下其它对象，则根据它们与这些聚类中心的相似度（距离），分别将它们分配给与其最相似的（聚类中心所代表的）聚类；然后再计算每个所获新聚类的聚类中心（该聚类中所有对象的均值）；不断重复这一过程直到标准测度函数开始收敛为止。-k-means algorithm process as follows: First of all, the object data from the n choose k object as initial cluster centers and the remaining for the other object, then according to their cluster center with those of the similarity (distance) respectively assigned to them with the most similar (represented by cluster center) clustering obtained and then calculated for each new cluster center clustering (all objects in the cluster mean) repeated this process until the standard measure of function until the beginning of convergence.

这是操作系统的一个课程设计，是关于生产者－消费者的一个模拟算法。- This is an operating system curriculum designs, is about a producer- consumer s simulation algorithm.

最小二乘法-Least Squares