distributed power system .zip

无人机协同决策与控制英文原版，可供研究无人机协同的同学参考(the English original of UAV Cooperative Decision and Control，for the study of reference UAV cooperative students)

卷积编码器g1=111,g2=101 x为输入的待译码序列 x=[1,0,1,0,0,1,0,0,0,1,0,1,1,1] x=[1,1,0,1,0,1,1,0,0,1] x=[1,1,1,0,0,0,1,0,1,1] a=size(x) 输入序列的长度 s=a(2)/2 译码后的m序列长度为x的一半 m=zeros(1,s) 最终结果存放 ma=zeros(1,s+1) 存放Fa路径的 mb=zeros(1,s+1) 存放Fb路径的 mc=zeros(1,s+1) 存放Fc路径的 md=zeros(1,s+1) 存放Fd路径的(viterbi decoder)

matlab 图像信息隐藏 LSB方法(LSB method of information hiding matlab)

contourlet变换的mmatlab工具包 (the contourlet transform the mmatlab of Kit)

这是我做的第一个程序，希望大家支持下，谢谢，thank you(this is mine doing)

IEEE4,14,30,57,118,300总线matlab代码(IEEE4,14,30,57118300 bus matlab code)

这个是霍夫曼编码的问题，要求输入只含有ABCD的四句话，且每句8个字符的长度，然后求出四个字符每个的概率，然后当成权值计算霍夫曼编码，我的这个程序已经实现了输入、概率统计、计算出霍夫曼编码存在了bian[]这个数组中(hoffuman decoding)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

吉林大学matlab教程，里面都是些常用的方法介绍，适合英语不好想学习matlab的初学者(Jilin University matlab tutorial, there are some commonly used methods of introduction, English is not good for the beginner want to learn matlab)

说明：  两份Matlab的资料，一个是关于如何与VC接口调用Matlab的程序；一个是介绍matlab如何使用(Matlab two information, one is on how to call Matlab and VC interface procedures one is to introduce how to use matlab)