To split a large file into smaller files. The files could be later joined to rec...

普里姆算法构造最小生成树.rar-Primbetov tectonic minimum spanning tree algorithm. Rar

键盘钩子实现源代码-keyboard hook achieve source code

通过一个彩电故障信息共享系统，使生产工程部的故障处理工作系统化，规范化，自动化，从而达到提高故障排除效率，提高信息利用率的目的。-Through a color TV fault information sharing system, the failure of production engineering dealing with the work of systematization, standardization, automation, so as to achieve to improve troubleshooting efficiency and utilization of information purposes.

PE文件格式系列译文之一---- 【翻译】“PE文件格式”1.9版 完整译文（附注释）-PE file format, one of series of translation Translation---- 【】 " PE file format" 1.9 version of the full translation (with notes)

基于Windows Socket编程，c#语言编写，通俗易懂，适合初学者，文件夹分为三部分，一部分是客户端程序，一部分是服务器程序，另一部分是源程序。windows socket的初始化，创建套接字，发送，接收函数等都放在源程序的源文件中，客户端，服务器程序等对源程序里的文件进行调用

在Windows窗口上滚动字幕-window on the Windows subtitles rolling

这是我还未做完的BP算法，望大家帮我改正！-This is not yet finished BP algorithm, we hope to help me correct!

应用背景它有助于C #新学员。这是用C #使用LINQ技术先进。关键技术它的使用linq.code将更有效率和内存管理会好的。

已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right numbered 1,2, ..., n, also know that two adjacent numbers between nodes ChonSu (this tree that links these two nodes in the path of the number of edges). Seeking any two leaf nodes x, y (1 ≤ x ≤ n) between the ChonSu

beam steering using planar arrays