Desktop

本工具可将大智慧L2D文件中的逐笔成交明细导出成csv格式的文本文件，包括成交时间，成交价格，成交方向和成交数量，方便在excel或其他编程工具中调用分析。 L2D乃点播数据，必须在收费帐号大智慧中浏览了逐笔数据才会有，如果要导出全部个股数据，就要浏览完所有个股的逐笔数据。为简化操作，可用键盘精灵等工具来实现自动浏览。 在L2D文件已有的前题下，只需在本工具上简单地设置一下大智慧安装目录和导出数据存放目录即可。 本工具可按需要单股、批量导出，盘中、盘后均可需要导出。(This tool can be of great wisdom in the L2D file by the transaction details to export to CSV format text files, including transaction time, transaction price, transaction direction and the number of transactions, to facilitate analysis of call in Excel or other programming tools. L2D is on demand data, must be in charge of great wisdom in the transaction account data browsing will have, if you want to export all the stock data, to browse the data of all stock transaction. In order to simplify the operation, you can use keyboard, Sprite and other tools to realize automatic browsing. On the basis of the existing L2D file, only in the tool simply set a great wisdom installation directory and export data storage directory. This tool can be exported as required, single stock, batch, and can be exported after disk and after hour.)

LabVIEW中人工神经网络计算的实现与应用(Artificial neural network computing in LabVIEW Implementation and Application)

文件拷贝猎手，能进行断点续传功能，方便局域网内部的共享文件拷贝！(File copy hunter, capable of HTTP functionality, easy to share the internal LAN file copy!)

说明：  在windows中直接注册或卸载任意activeX控件(windows in direct registration or unloading arbitrary activeX control)

破解的开发库，绝对真正的破解，有需要的朋友支持下，希望大家喜欢(Crack development libraries, absolutely real break, a friend in need of support, hope you like)

采集GPS数据，对数据进行解析并显示。在visual c++下面开发。(Collect GPS data, parse and display the data.Development under visual c++.)

利用vc++方法实现有理函数模型计算有理函数系数(RFM model)

一个读取屏幕上当前鼠标点颜色值的小程序，对于分析屏幕上的颜色有帮助。(A read on the screen the current mouse point color value of small procedures, the analysis of color on the screen has to help.)

zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )

MSComm控件串口通信编程，第一次作业。(MSComm control serial communication programming, the first operation.)