资源列表
fp_source
- 打开文件，浏览树形结构。寻找树叶，再找匹配的节点-Open files, browse tree structure. Looking for leaves, find matching nodes
unsupervisedClassification
- 非监督分类程序，MATLAB环境，采用K均值算法，通过初始聚类中心逐次迭代而得到所要分类，并输出分类后的图像。-Non-supervised classification procedures, MATLAB environment, using K-means algorithm, the initial cluster center through successive iterations to be classified, and the output classification im
SSRLSWAM
- ssrls_wam is a state space recursive algorithm with adaptive memory helpful for the fast cinvergebce as compared to the standard rls
jie
- c源码，实现一定的功能 具体情况我也不知道-c source code to achieve a certain degree of functionality I do not know the specific circumstances
18B20
- 在C51单片机上编写的DS18B20温度传感器应用实验-In the C51 single-chip temperature sensor DS18B20 prepared experimental application
zhexuejia
- 哲学家进餐问题，实现多进程间的互斥访问，进程间的竞争-Dining Philosophers problem, to achieve mutually exclusive access among the multi-process, the process of competition between
3063
- 北大ACM试题poj 第3063题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3063 question Question poj source code, good code, and want to help students engage in ACM
lab8
- 1. 编写程序定义Point类，在类中定义整型的私有成员变量_x、_y，对Point类重载“++”(自增) “--”(自减)运算符，实现对坐标值的改变。 2. 编写程序定义一个车(vehicle)基类，有Run、Stop等成员函数，由此派生出自行车(bicycle)类、汽车(motorcar)类，从bicycle和motorcar派生出摩托车(motorcycle)类，它们都有Run、Stop等成员函数。观察虚函数的作用。 3. (选做)对实验2中的people类重载“= =”运算符和“
0-1knapsackBranchBound
- 0-1 背包 分支限界法（0-1knapsackBranch&Bound） vc-0-1knapsackBranch&Bound
antis
- anti debug write in c++ -anti debug write in c++
page
- 理解内存页面调度的机制，在模拟实现FIFO、LRU、OPT算法的基础上，比较各种置换算法的效率和优劣，从而了解虚拟储存的实现过程-Understanding of the mechanisms of memory paging, on the basis of the simulation to achieve FIFO, LRU, OPT algorithm, compare the pros and cons of replacement algorithm efficiency and t
FileManage
- 文件操作练习，实现删除、移动、复制和隐藏文件功能-File operations practice, realizes the delete, move, copy, and hidden files