shushanglizi

用与合成孔径雷达的回波检测的编程的原代码(Using synthetic aperture radar detection of the echo of the original programming code)

source code for watermark

麻省理工学院introduction to matlab课程作业指导，包含matlab讲义，相互交流(excellent matlab exercises homework for improving matlab same as before)

prob of detection vs prob of false alarm

现代通信系统matlab程序大全，希望对大家有所帮助(Matlab program Daquan modern communication systems, we want to help)

matlab 混沌函数 帐篷(tent)映射(matlab chaotic function tent (tent) map)

This paper presents a new method to solve the network reconfiguration problem in the presence of distributed generation (DG) with an objective of minimizing real power loss and improving voltage profile in distribution system. A meta heuristic Harmony Search Algorithm (HSA) is used to simultaneously reconfigure and identify the optimal locations for installation of DG units in a distribution network. Sensitivity analysis is used to identify optimal locations for installation of DG units. Different scenarios of DG placement and reconfiguration of network are considered to study the performance of the proposed method. The constraints of voltage and branch current carrying capacity are included in the uation of the objective function. The method has been tested on 33-bus and 69-bus radial distribution systems at three different load levels to demonstrate the performance and effectiveness of the proposed method. The results obtained are encouraging. (2014-11-17

说明：  用正弦分析方法对语音进行分析和处理的matlab程序，对初学者有用(Analysis method using sinusoidal speech analysis and processing matlab program, useful for beginners)

说明：  神经网络处理图像的相关样本训练方法使用时可以更快的找到训练样本特征(Associated image processing neural network training method uses the sample can be found faster training sample characteristics)

霍夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率，读出时由该符号开始一直走到最后的“1”， 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好，就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)