代码搜索：LED Matrix
找到约 10,000 项符合「LED Matrix」的源代码
代码结果 10,000
www.eeworm.com/read/484379/6586458
txt 42matrix.txt
distancematrix
0 15 30 23 32 55 33 37 92 114 92 110 96 90 74 76 82 67 72 78 82 159 122 131 206 112 57 28 43 70 65 66 37 103 84 125 129 72 126 141 183 124
15 0 34 23
www.eeworm.com/read/482049/6625735
m matrix_optimal.m
function [a1,segma]=<mark>matrix</mark>_optimal(a,b,Da,Dab,Wa,Wab)
%%%矩阵重复优化的核心计算程序，a是N个未知节点坐标矩阵，b是M个信标节点坐标矩阵，Da是未知节点之间的测距矩阵，Dab是未知节点和信标节点之间的测
%%%距矩阵，Wa是未知节点之间测距的权重函数，Wab是未知节点和信标节点之间测距的权重函数；a1是根据重复优化公式计算出来的下一个 ...
www.eeworm.com/read/482049/6625736
asv matrix_optimalab.asv
function [a1,segmaX]=matrix_optimalab(a,b,Dab,Wab)
%%% a(N*M) is the coordinates of the unknown nodes
%%% b(N*K) is the coordinates of the beacon nodes
%%% Dab is the measured distance matrix bet
www.eeworm.com/read/482049/6625738
m matrix_optimala.m
function [a1,segmaX]=<mark>matrix</mark>_optimala(a,Da,Wa)
%%%矩阵重复优化的核心计算程序之一，a是N个未知节点坐标矩阵，Da是未知节点之间的测距矩阵，Wa是未知节点之间测距的权重函数，
%%%% a1是根据重复优化公式计算出来的下一个迭代的未知节点坐标
%%%矩阵，segmaX是当前未知节点坐标矩阵a作为定位坐标矩阵和实际的测距的总的平方误差和，也即优 ...
www.eeworm.com/read/482049/6625740
asv matrix_optimal.asv
function [a1,segma]=<mark>matrix</mark>_optimal(a,b,Da,Dab,Wa,Wab)
%%%矩阵重复优化的核心计算程序，a是N个未知节点坐标矩阵，b是M个信标节点坐标矩阵，Da是未知节点之间的测距矩阵，Dab是未知节点和信标节点之间的测
%%%距矩阵，Wa是未知节点之间测距的权重函数，Wab是未知节点和信标节点之间测距的权重函数；a1是根据重复优化公式计算出来的下一个 ...
www.eeworm.com/read/482049/6625744
m matrix_optimalab.m
function [a1,segmaX]=<mark>matrix</mark>_optimalab(a,b,Dab,Wab)
%%%矩阵重复优化的核心计算程序，a是N个未知节点坐标矩阵，b是M个信标节点坐标矩阵，Dab是未知节点和信标节点之间的测
%%%距矩阵，Wab是未知节点和信标节点之间测距的权重函数；a1是根据重复优化公式计算出来的下一个迭代的未知节点坐标
%%%矩阵，segmaX是当前未知节点坐标矩阵a ...
www.eeworm.com/read/482049/6625745
asv matrix_optimala.asv
function [a1,segmaX]=matrix_optimala(a,Da,Wa)
%%% a(N*K) is the coordinates of the unknown nodes,N:is the number of the
%%% unknown nodes,K: is the dimensional(2 or 3 in fact)
%%% Da(N*N) is the
www.eeworm.com/read/482049/6625749
asv matrix_optimalab.asv
function [a1,segmaX]=DistanceSmoothOptimalab(a,b,Dab,Wab)
%%% a(N*K) is the coordinates of the unknown nodes,N:is the number of the
%%% unknown nodes,K: is the dimensional(2 or 3 in fact)
%%% b(M
www.eeworm.com/read/482049/6625754
asv matrix_optimal.asv
function [a1,segma]=matrix_optimal(a,b,Da,Dab,Wa,Wab,e)
%%% a(N*K) is the coordinates of the unknown nodes,N:is the number of the
%%% unknown nodes,K: is the dimensional(2 or 3 in fact)
%%% b(M*K
www.eeworm.com/read/482049/6625759
asv matrix_optimala.asv
function [a1,segmaX]=matrix_optimala(a,Da,Wa,e)
%%% a(N*K) is the coordinates of the unknown nodes,N:is the number of the
%%% unknown nodes,K: is the dimensional(2 or 3 in fact)
%%% Da(N*N) is th