a-novel-approach-to-DOA-estimation

利用matlab实现的无线传感器网络分布的Pd和Pfa的关系图，无线传感器网络分布直接影响最后的融合结果，通过分析获得Pd和Pfa的关系可以对理解有帮助。(The use of matlab wireless sensor networks to achieve the distribution of the relationship between the Pd and Pfa map the distribution of wireless sensor networks a direct impact on the final integration of the results obtained by analyzing the relationship between the Pd and Pfa can be helpful in understanding.)

matbal100小程序例子，供初学或急用matlab者分享。(matbal100 small program examples for the beginner or emergency matlab share.)

加你如何快速的熟悉和掌握matlab语言，以及在矩阵运算和数据分析方面的应用(Plus you how to quickly become familiar with and master the matlab language, as well as matrix operations and data analysis applications)

Implementation bayes

利用matlab编写的vibe算法，处理速度比较慢，但对于学习了解vibe的原理有一定的帮助(Vibe algorithm by using matlab, processing speed is slow, but to learn the principle of vibe has certain help)

《脑动力：MATLAB函数功能速查效率手册》 光盘源码下。7~12章(Brain Power: MATLAB function Quick Guide CD Matlab-code 2.Chapter 7~12)

It is important to detect the edges of the image.It is not better than cany.

说明：  关于脉冲压缩的问题 。脉冲压缩的质量直接 影响雷达的探测性能。经典的脉冲压缩是通过匹 配滤波器来实现的[1 ] 。从本质上讲 ,脉冲压缩是对 发射信号的匹配滤波 ,但由于不同的目标回波信 号带有不同的多普勒信息 ,具有不确定性 ,所以它 只能是准匹配滤波(Pulse compression on the issue. Direct impact on the quality of pulse compression radar detection performance. Classical matched filter pulse compression is achieved by [1]. In essence, the pulse compression is a matched filtering the transmitted signal, but the different echo signals with different Doppler information is uncertain, it can only be quasi-matched filter)

一种改进的萤火虫算法解决动态0-1背包问题。经过测试，算法就有良好的性能。(Firefly Algorithm (FA), Genetic Algorithm (GA) and Differential Evolution (DE) have been widely used for static optimization problems, but the applications of those algorithms in dynamic environments are relatively lacking. In the present study, an effective FA introducing diversity with partial random restarts and with an adaptive move procedure is developed and proposed for solving dynamic multidimensional knapsack problems. To the best of our knowledge this paper constitutes the first study on the performance of FA on a dynamic combinatorial problem. In order to uate the performance of the proposed algorithm the same problem is also modeled and solved by GA, DE and original FA. Based on the computational results and convergence capabilities we concluded that improved FA is a very powerful algorithm for solving the multidimensional knapsack problems for both static and dynamic environments.)

Unit commitment and economic load dispatch by dynamic programming