蚁群算法，用户可以修改程序中的宏定义来设置初值

Treeview与数据库的联合使用实例 delphi中自动填写表单(2008-04-15 13:51:00)转载标签： delphi自动填写表单it   delphi中自动填写表单 今天根据网上的资料调试成功了自动填写网页中表单。目标网站 mopcn 在FORM中增加控件 TWebBrowser  来自：多学吧

包含图像处理基本算法。高斯滤波。拉普拉斯锐化。反色。傅里叶变换。灰度均衡。walsh变换等。对比度拉伸。方块编码。二值化变换。调试时的计算机的配置：Windows2000/XP + Visual Studio 6.0 企业版 。。

Java 代码他们一本正经的最小生成树算法。只需更改的值图的代码本身的重量。所有都添加了评论。

是自己在ECPLISE下做的一个简单的排序程序,有兴趣的可以看下.-in ECPLISE is done with the sort of a simple procedure that can be interested in a glance.

卡尔曼滤波的程序 fortran-Kalman filtering program fortran!!!

我们成立了这里的系统识别框架是相当一般。它并不单是我们向 linier 模型或二次型的标准或假定它自已可以描述模型内设置的系统。

用VB实现矩阵特征值的求解算法集。包括：对称矩阵的雅可比变换，实对称阵为三对角阵的特征值求解，等五种特征值求解算法。-VB matrix eigenvalue of the algorithm sets. Including : symmetric matrix Jacobian transform, real symmetric matrix to a three-diagonal matrix eigenvalue solution, the five eigenvalue algorithm.

计算器，压栈处理。 急需语音程序，谢谢！-calculators, Yazhan treatment. Voice urgent procedures, thank you!

问题描述：给定一个数n，找出大于这个数的最小不重复数（任意相邻位数字不相同）。 程序给出了两种方法：find和find1，其中find1属于暴力法，直接从n+1开始寻找，每次加1，知道找到满足条件的不重复数为止。 第二种方法比较巧妙，将n各位数字存到一个数组a[]里，下标大小对应位数高低，比如1234，数组a[0...3]依次为1，2，3，4；从最高位开始找相邻的重复数，较低的重复位加1带进位，高位循环加进位直到无进位，低位置零；回到次高位重新寻找重复位，直到无重复位。

资源描述Abstract Considering rapid developments in the technologies of both radio-frequency identification (RFID) systems and wireless sensor networks (WSN), an integration of the two technologies may lead to the formation of an RFID-enhanced WSN which would possess improved functions and capabilities. In the RFID-enhanced WSN, many reader-enhanced nodes have increasingly been employed. In such networks, RFID data contains a lot of duplication, because the same tag may be read multiple times, and collision may occur among readers, while energy constraints are also a serious problem. These three could in turn cause serious problems. In this paper, we have proposed our CSMA-based algorithm since it is light, efficiently minimizes all kinds of reader collision, and eliminates the duplicate data. For this purpose, we have used a separate control channel and a tag ID forwarding mechanism with a special co