机器学习课要求编写3*3棋盘对弈程序。 该程序中一个对弈者通过神经网络方式实现 另一个通过机器学习的方式加以改进...

括号匹配 实现三种括号的匹配 不同顺序 不同位置的匹配-Matching brackets brackets matching the achievement of three different positions of different sequence matching

awk by Cao Siqin, 2007.7.17 awk Format string: It may contain following symbols: $x: parameter x will be used here = x07 = x0A Example: script.txt: C:WINDOWSa logfile .log C:WINDOWS txtfile .txt input this command in a console window: awk notepad.exe $1 $3 < script.txt then following commands will be executed: notepad C:WINDOWSa.log notepad C:WINDOWS.txt

控制台应用程序定向输入和输出-derectional input and output of console application program

同时辨识模型阶次和参数算法,用模型计算出仿真数据，再用模型阶次的辨识方法，辨识模型的阶次和参数-At the same time, model order identification algorithm and parameters, calculated by model simulation data, and then model order of the identification method, identification of model order and parameters

应用背景实现一个链表进行归并排序算法对3种不同尺寸的数值数据集（20，200，2000）。数值数据集应该是随机的。比较了不同大小的数值数据集合并排序算法，并确定在数据集上有更好的性能；关键技术程序更可用，程序应处理特殊情况，如用户意外无效输入。如果用户输入错误的东西，你应该允许用户输入另一个输入，直到它是一个有效的响应；

处理inifile文件的class,支持UNICODE,定义Class: CIniFileW CIniFileA-Summary: This is a total re-write of the original CIniFile class written in 2006. Originally the data structures underlying the CIniFile object were std::list which was extreamly inefficient when dealing with huge ini files.

C++ Builder 6.0 Socket控件TCP通信,服务器和客服端都有-C++ Builder 6.0 Socket Controls TCP communications, servers and customer service side has a

很方便的以前写的一个关于扫雷的源代码，用的MFC编写的，大家都要看看，有需要的可以下载下，试着玩一玩，其实也挺有意思的。。

解决一个矩阵问题。具体的问题看文件说明。和源码。-solve a matrix problems. Look at specific problems documented. And the source.

递归枚举模板 问题描述：生成长度为n的字串，其字符从26个英文字母的前p(p≤26)个字母中选取，使得没有相邻的子序列相等。例如p=3，n=5时： //　　abcba　满足条件 //　　abcbc　不满足条件 //输入：n　p //输出：所有满足条件的字串及总数-recursive template Problem description : n generation length of the string and its 26 characters from the English alphabet before p (p 26) 000 1984 letter, makes no adjacent sequences equivalent. For example, p = 3, n = 5 :// abcba meet the conditions// abcbc not satisfied conditions// input : n p// output : to satisfy all the conditions and the total number of strings