TCP拥塞控制

%  1-D信号压缩传感的实现(正交匹配追踪法Orthogonal Matching Pursuit) %  测量数M>=K*log(N/K),K是稀疏度,N信号长度,可以近乎完全重构 %  编程人--香港大学电子工程系 沙威  Email: wsha@eee.hku.hk %  参考文献：Joel A. Tropp and Anna C. Gilbert %  Signal Recovery From Random Measurements Via Orthogonal Matching %  Pursuit，IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 12, %  DECEMBER 2007.

tj大学研究生课程中有关最优控制的课件和例子- optimal control

实数据快速傅立叶变换算法2-false information Fast Fourier Transform algorithm 2

一些c程序，象棋之马踏棋盘、把算术表达式转化未逆波兰表达式、保龄球计分规则算法、可进行多达50位的大整数运算（＋X）、铁路调度算法，演示了堆栈的基本用法-Some c procedures, horse riding chess board, the arithmetic expressions are not translated into Reverse Polish expression, bowling scoring rules algorithm, can be as many as 50 large integer calculations ( X), the railway scheduling algorithm, demonstrated the basic stack Usage

国外网上找到的Kriging Matlab 工具包，很好用。1.支持变量多维度， 核函数有多种选择。2.可以根据自己的研究任务进行修改。3.已通过测试，在适当样本点的情况下，插值精度很高。

资源描述 ,opencv实例源代码里面包含的基于opencv的光流法程序和实现功能为图像平滑、图像缩小与Canny 边缘检测。三、用 DirectShow 编制的视频采集程序 。

摘要:本文旨在研究一种能对复杂热工对象的有效建模方法。基于遗传算法的辨识方法有较强的抗干扰能力,对低、高阶系统、延时系统都可以达到很好的辨识效果。根据单元机组的低阶非线性模型,推导出一个双进双出、能够描述机组动态特性及机炉间相互耦合关系的协调控制系统传递函数矩阵。依次模型为基础,提出一种基于改进的遗传算法的参数辨识方法。-Abstract: This paper aims to study a thermal complex objects can be an effective modeling method. Identification method based on genetic algorithm has strong anti-jamming ability, low, high-end systems, delay systems can achieve very good recognition results. According to unit power plant low-level non-linear model, derived a double inlet and outlet, can describe the dynamic characteristics and boiler-turbine unit is coupled between two relations, coordination and control system transfer function matrix. Turn model was proposed based on improved genetic algorithm based on parameter identification method.

在这篇文章中的代码要求用户选择一个点集，然后使用Delaunay三角网在这些点创建多面网格。 [我们正在创建一个多面网格我们仅限于32,767顶点。这是已知的限制使用PolyFaceMesh对象时：在AutoCAD2010新SubDMesh目的它应该是可能写在不脱离这种限制的影响的一个版本。有所期待，从未来的职位...]

自适应滤波器的模拟实验源代码,VC实现，Filter-Adaptive filter simulation source code, VC realize, Filter

*   To factor the n by n matrix A = (A(I,J)) into the product of the*   lower triangular matrix L = (L(I,J)) and U = (U(I,J)), that is*   A = LU, where the main diagonal of either L or U consists of all ones:**   INPUT:   dimension n; the entries A(I,J), 1