POI搜索算法

用于TSP的蚁群算法的源程序，包括C语言及C-ant clony pro

leetcode部分题目的Java实现，未包含全部的152道题，只有44道，对于需要刷算法题，准备笔试面试的人还是很有用的，尤其是外企。刷题网址oj.leetcode.com

THE FINITE-DIFFERENCE TIME-DOMAIN (FDTD) PART IV The Perfectly Matched Layer (PML) Absorbing Boundary Condition -THE FINITE-DIFFERENCE TIME-DOMAIN (FDTD) PART IV The Perfectly Matched Layer (PML) Absorbing Boundary Condition

高维数据判别分析程序！数据挖掘及图像分析利器！matlab版！-High dimensional data discriminant analysis procedures! Data mining and image analysis tool! matlab version!

用c++实现的矩阵运算类，包括了各种矩阵的运算-With c++ Realization matrix calculation categories, including a variety of matrix operations

3D打印机下位机源码（不完整）以及原理图，网上看到的，觉得不错，包括下位机各部件的驱动以及原理图

求1000以内的水仙花数- Strives for 1,000 within the narcissus flower several

有限差分波动方程不加边界条件二阶正演时间切片程序。-Finite difference wave equation without boundary conditions of second-order forward time-slicing procedure.

计算两个日期间的天数差-calculate the day interval between two datetime value

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7