knnLLR

说明：  实现Brent(布伦特)优化搜索，寻找极大极小值。.M文件(brent optimize to search for the max or min data.)

说明：  卡尔曼滤波，matlab代码 能够直接跑(Kalman filter, matlab code can be run directly)

瑞丽衰落信道的仿真分析，在此信道中进行滤波分析的结果(Ruili fading channel)

simple merge sort program

波音727的数据和isar技术成像程序，希望对大家有帮助(Boeing 727 isar technical data and imaging procedures, we hope to help)

基于最低有效位lsb水印图象算法，带有攻击代码。(lsb watermarking algorithm,)

Overcomplete wavelet transform using w97

根据图像处理中hough转换的原理，从实际能运行的代码中修改得到能检测出图形中可共直线的点，并可改为显示2、3、4...点共线。 (hough transform for straight lines detect on graphic,the straight lines do not exist,but can formed by the multi points,maybe 2,3,4,...)

matlab编程 第二版 菜鸟入门教材。非常适合新手使用(matlab programming second edition rookie primer. Very suitable for novice use)

说明：  物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes (logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.)