tree

冰点动态域名解析源码 本程序的原理就是远程获取网页地址，通过网页来对DNS服务器进行操作-Freezing point dynamic DNS principle source of this procedure is that the remote access to the web site, through the page to operate on the DNS server

打开Url，C#经典编程实例源码，很好的参考资料。(Open Url, classic instance of C# programming source code, a good reference.)

说明：  IB智慧公交系统是一款为公交驾驶员及调度员等开发的一款系统，驾驶员具有对公交的线路、站点、班次等信息的查询功能；调度员具有对公交的线路、站点、班次、排班等信息的修改、增加、删除、查询功能。(IB Intelligent Bus System is a system developed for bus drivers and dispatchers. The driver has the function of inquiring the information of bus routes, stations, shifts, etc. The dispatcher has the function of modifying, adding, deleting and inquiring the information of bus routes, stations, shifts and scheduling.)

一个简易的bootloader,主要实现基于mini2440的DM9000网卡初始化()

实现6个节点的直流潮流计算，功能已经得到验证。(DC power flow program of 6 nodes)

报刊订阅管理系统,代码和报告都在里面 完整的，需要的可以下载参考(baokandingyueguanlixitong wanzhengziliao )

华为C++中级培训教材，包含一个word文件和一个ppt文件。(Huawei C++ Intermediate training materials, contains a word file and a ppt file.)

说明：  独立分量分析结合主成份分析，适合于脑电信号处理(Independent component analysis combined with principal component analysis, is suitable for treatment EEG)

SockProxy: ============================ 该程序透过服务器sock5代理访问防火墙外的程序，这里通过运行server程序来模拟远端。 不过该实例的运行需要有防火墙支持！-SockProxy : ============================ through the process server sock5 Acting visit outside the firewall procedures here by running server process to simulate the distal . However, the examples of the need for operational support firewall!

说明：  项目任务 在单链表类中增加一个功能erase(x, y), 删除表中所有值在 [x, y] 之间的结点。假设链表中结点数值类型是整形，要求编程返回删除相应结点后的链表长度和链表元素。 输入描述 第一行输入链表List的结点元素值，元素之间用空格间隔，且均为int类型； 第二行输入为x和y，分别表示需要删除结点元素的最小值和最大值。 输出描述 第一行输出删除相应结点后链表的长度； 第二行输出删除相应结点后链表的所有元素，元素之间用空格间隔。若无剩余元素，输出null。(Project tasks A function erase (x, y) is added to the class of single linked list to delete all nodes whose values are between [x, y]. Assuming that the numerical type of the node in the linked list is plastic, the program is required to return the length and elements of the linked list after deleting the corresponding nodes. Enter a description In the first line, enter the node element values of the linked list list, with spaces between the elements, and all of them are of type int; In the second line, input X and y to indicate the minimum and maximum values of node elements to be deleted. Output description The first line outputs the length of the linked list after deleting the corresponding node; The second line outputs all the elements of the linked list after deleting the corresponding nodes, with space between the elements. If there are no remaining elements, null is output.)