简易计算器，可以连续输入计算式，然后输出结果。先把中缀式转换成后缀式然后计算。...

该软件不调用任何系统接口，采用自己的计算模式计算当前运行CPU的主频，能够准确无误的判定当前CPU的主频，使得各种虚假的CPU参数修改软件现行。软件采用VC编写，供各位对CPU速度判定有需求的程序员参考！

ATM机模拟，可以实现存款，取款，修改密码等功能-ATM machine simulation, can be achieved deposits, withdrawals, change passwords and other functions

一个简单的下载者源代码！ 能下载指定文件保存 运行 编译都可自行修改-That those who download a simple source code! Can download the designated file is saved to run the compiler can make its own decisions

学习离散数学时在老师地要求下编写的个小程序，离散数学――真值表-discrete mathematics learning at the request of the teacher to prepare procedures for the small, discrete mathematics-- truth table

I ve noticed for a while that on Windows XP, when you use Explorer to delete a file or directory that is in use by another process, it takes what seems like an eternity before an error message appears telling you the file can t be deleted. During this time, there is no indication that Explorer even noticed the delete command. No hourglass, no nothing. By the time the message box appears, I ve already hit the delete key a few more times in a futile attempt to get Explorer to just do something, already. Either delete the file or tell me you can t...throw me a bone here.

　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu search techniques, using I & D strategies, while designed for the local optimal solution of the two kinds of mutation operator. The improved algorithm can effectively compensate for the standard tabu search algorithm depends on the initial solution defect, but also to avoid the phenomenon of search stagnation. Through specific examples and random-question test, indicating that the improved tabu search algorithm has better performance. Guan

TestRemoteServer.rar

一个Vc编的示波器，使用定时器，带有坐标，可作为波形显示控件-Scope，WaveShow

一个简单方便的表格控件XTable 0.2 支持单元合并,支持字体、颜色、对齐等格式设置,支持键盘及鼠标操作,结构简单,清晰的编码风格,代码可读性强 -A simple form convenient control unit combined XTable 0.2 support, support fonts, colors, alignment and other formatting, support for keyboard and mouse operation, simple structure, a clear coding style, code readability strong

1算法思路  K-means算法  先随机选取K个对象作为初始的聚类中心。然后计算每个对象与各个种子聚类中心之间的距离，把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。一旦全部对象都被分配了，每个聚类的聚类中心会根据聚类中现有的对象被重新计算。这个过程将不断重复直到满足某个终止条件。终止条件可以是以下任何一个：  1)没有（或最小数目）对象被重新分配给不同的聚类。  2)没有（或最小数目）聚类中心再发生变化。  3)误差平方和局部最小。  2算法步骤 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报