一种新的优化算法,解决工程优化(最大,最小及最优等等)问题及优化任务....

英文文献，和语音信号处理中基音周期提取算法相关的文章。-English literature, and speech signal processing in the pitch period extraction algorithm related articles.

这是一个高斯消元发解方程的c语言实现。对于接多元方程非常的方便-This is a Gaussian elimination of the solution equation c language. For multiple access very convenient equation

天文观测软件，可以根据爱好者所在地点随时准确地进行定位并预测未来星空图。-Astronomical Observatory of software, according to the location at any time lovers accurately locate and predict the future Star Chart.

文本文件转换成PDF文件并加密-text files into PDF files and encryption

CC10开发源码，适合刚入门的朋友使用，很好很强大-cc10 code

VC毫秒级的控制-VC millisecond control

一个很好的计算文字数目的例子,现在一个缺点就是计算中文的时候可能不是很准确-a good number of characters calculation example, a defect is calculated when the Chinese may not be accurate

本程序是用纯API函数写得一个小的贪食蛇游戏，可供初学者学习用-this program is written in pure API function of a small Tanshichi game for beginners to learn from

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

MICREL 网卡驱动 FOR CE 5.0-Micrel FOR CE 5.0 network card driver