X信号的时域和频域分析，及针对该信号的滤波器设计、验证

首先，在扑克牌中加入一只王，即鬼牌，然后将牌平均分给所有玩家，玩家收到牌后，只要有两张同一数字的牌，就可以打出，没有的话就要等待下一次抽牌的机会，最后保留鬼牌的玩家即为输家，要接受一定的惩罚，娱乐性十足。

图形用户界面的猜数字小游戏 .功能：猜四位数，共有7次机会。-A GUI small game which performs the GUESS NUMBER game. Functions: to guess 4 digits , you hava only seven chances to get through.

altera byteblasterII sch

一份精美的首页源码。。欢迎下载~很好看的哦-A beautiful home page source code. . Welcome to download the ~ good to see Oh

wow的插件，国服版本，虽然现在换代理了，但是我们对于插件的喜欢成都不会改变

这是一种基于线性加速度假设的用于编制大型程序的算法，即威尔逊法，可用于微分方程描述的问题计算仿真-This is an assumption based on the linear acceleration of procedures for the preparation of large-scale algorithm, namely, Wilson law, can be used in differential equations to describe the problem of simulation

视频游戏开发C 语言源程序，希望大家喜欢-C language source hope you like

本算法使用分治法求解最近点对问题。事先用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.

学习dos的好软件，希望有需要的朋友下来看看呀。很好的谢谢支持-A good software to learn dos and hope there is a need of a friend down to see呀. Thank you very good support for

此程序是华容道游戏源代码，供参考学习使用。-Puzzle source code, learning to use for reference.