FractalFilter

说明：  带分布式电源的33节点配电网位置容量优化程序，源程序来自网络，有问题联系我QQ3163815954(Location Capacity Optimization Program for 33-Node Distribution Network with Distributed Generation)

this is a code and it is very simple code

用矩量法和正交模法分析四元八木天线的特性。两种方法的对比。用E面、H面和方向性图。(Using moment method and analysis of orthomodular quaternion Yagi antenna characteristics. Comparison of two methods. E surface used, H surface and the direction map.)

Compressive sampling is an emerging technique that promises to effectively recover a sparse signal from far fewer measurements than its dimension. The compressive sampling theory assures almost an exact recovery of a sparse signal if the signal is sensed randomly where the number of the measurements taken is proportional to the sparsity level and a log factor of the signal dimension. Encouraged by this emerging technique, this thesis briefly reviews the application of Compressive sampling in speech processing. It comprises the basic study of two necessary condition of compressive sensing theory: sparsity and incoherence. In this thesis, various sparsity domain and sensing matrix for speech signal and different pairs that satisfy incoherence condition has been compiled.

PFC电路模型，带PID闭环控制，自己设定输出电压，很好的学习例程(PFC circuit model with PID closed-loop control, set the output voltage, good learning routines)

产生MDPSK信号的matlab源代码，分为4dpsk和8dpsk两种(MDPSK signals generated matlab source code is divided into two 4dpsk and 8dpsk)

一段matlab下的LPP算法实现的完整程序，与算法同仁一起分享(LPP for matlab)

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)

基于等式约束和不等式约束的非线性规划的混合型惩罚函数优化方法(Based on equality and inequality constrained nonlinear programming mixed penalty function optimization)

雷达检测的matlab计算 如起伏目标的检测等(radar detection matlab_RF)