购物程序源码要求为至少5个C或Java源码或其他好源码或编程学习资料，质量越高得到的下载个数越多(一般上传5个，可以下载200个)。...

研究利用RLS算法自适应均衡器纠正存在加性白噪声的信道的畸变。讨论特征值扩散度 对学习曲线的影响。 比较RLS算法和LMS算法在不同信噪比情况下的学习曲线。 -RLS algorithm using adaptive equalizer to correct the existence of additive white noise distortion channel. Eigenvalue discussion diffusivity impact on the learning curve. Comparison of RLS algorithm and LMS algorithm for different signal to noise ratio in the case of the learning curve.

使用delphi编写的运动会编排程序,还需要更加完善!-Delphi prepared to use the Games schedule, but also need to be more perfect!

一个非常简洁的截包工具，带有MD5加密分析功能，-a very simple tools of the latest package, with MD5 analysis functions,

UML基础案例与应用。对你学习UML专业理论知识来说无疑是个好帮手，赶快动手吧！-UML case basis and applications. You learn UML professional theoretical knowledge is undoubtedly a good helper, hurry hands!

ANSYS流体流动场分析指南.pdf,详细介绍了ANSYS流体流动场分析方法，经典，值得一读。-ANSYS Fluid Flow Field Analysis Guide. Pdf, detailed information on ANSYS fluid flow field analysis method, a classic, worth reading.

把那个放大镜拖到mfc写的程序的窗口上，如securecrt,vc6等，松开鼠标就能看到一些内部函数地址了。如oninitdialog,onok什么的一目了然。拖到子窗口如铵钮上时，可以看出其id,当然，这个工作也可以由spy++完成。结合其父窗口message map的输出，还可以知道当点击这个按钮时，会跳到哪段程序上执行 -Mfc drag the magnifying glass to write a window procedure, for example, securecrt, vc6, etc. Release the mouse will be able to see some internal function address. If oninitdialog, onok what at a glance. Drag the child window, such as when ammonium button, one can see their id, of course, this work can also be spy++ Completed. Combination of his father, a window message map output, but also know that when clicking on this button will jump to the implementation of procedures which paragraph

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

VC数据库编程,把图片放到数据库种,初学的,有点用处-VC database programming, the picture on the database species, beginner, and a bit useless

约瑟夫环 1. 本演示程序利用一循环链表,每个结点为一人,类似将人按顺时针方向围坐一圈,每个结点包括,号码,密码.号码是作为排的顺序.密码用来作为下一次报数的数字.当走到结尾时,再下个结点便循环回去,依此类推. 2. 演示程序以用户与计算机的对话方式执行，用户输入相应的数据，输出结果显示在其后。,即总结点数,和密码. 3. 程序执行的命令包括:1)创建链表 2)寻找结点 3)删除结点 4. 测试数据测试数据：m初始值20，n=7，7个人密码依次为：3，1，7，2，4，8，4。首先m值为6，正确出列顺序为6，1，4，7，2，3，5。 -Josephus 1. The demonstration program using a chain cycle, each node to a person, similar to a clockwise direction by people sitting circle, and each node include numbers, Password. As the number is the sequence. used as a password the next few reported figures. When reached at the end, the next nodes will cycle back, and so forth. 2. Demonstration Program to computer users with implementation of the dialogue, the corresponding user input data and output results in later. , Summed up the quota, and password. 3. Procedures for the implementation of the order include : 1) Create List 2) Find node 3) delete nodes 4. test data test data : the initial value of 20 m, n = 7, 7 PIN followed : 3,1,7,2,4,8,4. M value fo

利用MATLAB来实现Dijkstra算法模拟了路由选择协议-using MATLAB to achieve the Dijkstra algorithm to simulate the Routing Protocol