代码搜索：概率分析
找到约 10,000 项符合「概率分析」的源代码
代码结果 10,000
www.eeworm.com/read/103618/15727486
m mat_feat.m
function mat_feat(f_name) %
disp('被分析矩阵') %
A=magic(4) %给定的被分析矩阵
N=8; %为字符串比较而设的字符串长度 8 。
n=size(f_name,2); %测量输入字符串的长度
ff_name=[f_name blanks(N-n
www.eeworm.com/read/289568/8543610
m entropy.m
function h=entropy(p)
% H=ENTROPY(P) 返回概率矢量P的熵函数。
if length(find(p10e-10,
error('Not aprob.vector,componen
www.eeworm.com/read/426535/9015085
m ex1512.m
%例15-12 概率分布函数
x=-4:4;
y=unidcdf(x,10)
tx=-5:0.01:12;
plot(tx,ty,x,y,'*') %绘制离散均匀分布的分布函数图并标注计算点，如图15-17
www.eeworm.com/read/180494/9305110
m example5_36.m
function NewChrom = mut(OldChrom,Pm,BaseV)
% OldChrom-当代种群的染色体
% Pm-变异概率
% BaseV-染色体基
[Nind, Lind] = size(OldChrom) ;
if nargin < 2, Pm = 0.7/Lind ; end
if isnan(Pm), Pm = 0.7/Lind; end
if (n
www.eeworm.com/read/180494/9305145
m example5_4.m
function[newPop] = Select(oldPop,options)
q=options(2); % 选择最优的概率
e = size(oldPop,2);
n = size(oldPop,1); % 种群中个体的数目
newPop = zeros(n,e); % 初始化
fit = zeros(n,1); % 初始化
x=z
www.eeworm.com/read/365165/9876463
m mutation.m
%function popnew=mutation(pop,pmut,n,length)
function popnew=mutation(pop,gen,N,n,length1,length2)
%变异函数
%pmut为变异概率
k=1;
while k
www.eeworm.com/read/365165/9876472
m crossover.m
%function popnew=crossover(pop,pcro,n,length)
function popnew=crossover(pop,gen,N,n,length1,length2)
%交叉函数
%pcro为交叉概率
k=1;
i=0;
while (k
www.eeworm.com/read/356450/10226873
m qam_32_ray.m
% 32QAM rayleigh channle 符号错误概率仿真
clc;close all;clear all;
tic
echo on
SNRindB1=10:5:40;%符号信噪比
SNRindB2=10:1:40;
%
M=32;
r=[1 sqrt(21/5) 21/5];
%%%%%%%%%%%%%%%%%%%%%%%% 仿真值 %%%%%%%%%%%%%%
www.eeworm.com/read/160913/10471422
m entropy.m
function h=entropy(p)
% H=ENTROPY(P) 返回概率矢量P的熵函数。
if length(find(p10e-10,
error('Not aprob.vector,componen
www.eeworm.com/read/133445/6933705
m entropy.m
function h=entropy(p)
% H=ENTROPY(P) 返回概率矢量P的熵函数。
if length(find(p10e-10,
error('Not aprob.vector,componen