VB音乐可视化效果曲线控件附示例

我论文里用到的预处理的一些程序，很多程序都是我自己编写的，有用的可以一起讨论-thesis I used some of the pretreatment process, a lot of procedures are prepared by myself, can be useful to discuss

一个值得参考的VFP高考管理系统-a worthy reference VFP College Entrance Examination Management System

基于VHDL写的DS18B20的驱动，简单版本-based on VHDL write DS18B20 driven, simple version

HTML5 CSS3 text-shadow 文字阴影立体特效，prefixfree.min.js插件和jquery配合实现的文字特效，使用时只需定义需要显示阴影的文字即可，页面打开后会自动生成阴影文字，测试时请使用支持HTML5内核的浏览器。

一个网吧管理系统程序，用JBuilder开发，SQL为底层-an Internet cafe management system procedures, using JBuilder development, SQL to the bottom

6502指令模拟器，可以实现大部分模拟功能，仿真等。适合于刚开始学习6502人员。-6502 simulator commands, you can realize the majority of analog functions, simulation and so on. Suitable for the beginning of 6502 to study staff.

小巧又很好用的串口调试工具，比其他普通常用的功能强大的多。-Also good used compact serial debugging tools, than other commonly used general and more powerful.

串口调试，绿色软件。无须安装即可使用.. 方便调试程序-Serial debugging, green software. Do not need to install .. easy to use debugger

mYahtzee version 0.82益智类游戏-mYahtzee version 0.82 Puzzle Games

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.