搜索结果
找到约 13,498 项符合
A-U 的查询结果
matlab例程 五对角占优线性方程组求解的MATLAB 程序MYLU。 输入参数A为系数矩阵
五对角占优线性方程组求解的MATLAB 程序MYLU。
输入参数A为系数矩阵,F为右端向量。输出参数L,U为A的LU 分解A=LU,X为解向量。
书籍源码 Floyd-Warshall算法描述 1)适用范围: a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述: a)初始化:d
Floyd-Warshall算法描述
1)适用范围:
a)APSP(All Pairs Shortest Paths)
b)稠密图效果最佳
c)边权可正可负
2)算法描述:
a)初始化:dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法结束:dis即为所有点对的最短路径矩阵
3)算法小 ...
软件设计/软件工程 This book describes a collection of standards, conventions, and guidelines for creating effective U
This book describes a collection of standards, conventions,
and guidelines for creating effective UML diagrams. They are
based on sound, proven principles that will lead to diagrams
that are easier to understand and work with.
数学计算 Probabilistic Principal Components Analysis. [VAR, U, LAMBDA] = PPCA(X, PPCA_DIM) computes the princ
Probabilistic Principal Components Analysis. [VAR, U, LAMBDA] = PPCA(X, PPCA_DIM) computes the principal
% component subspace U of dimension PPCA_DIM using a centred covariance
matrix X. The variable VAR contains the off-subspace variance (which
is assumed to be spherical), while the vector LAMBDA ...
数据结构 实现最优二叉树的构造;在此基础上完成哈夫曼编码器与译码器。 假设报文中只会出现如下表所示的字符: 字符 A B C D E F G H I J K L M N 频度 186 64 13 22
实现最优二叉树的构造;在此基础上完成哈夫曼编码器与译码器。 假设报文中只会出现如下表所示的字符:
字符 A B C D E F G H I J K L M N
频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 57
字符 O P Q R S T U V W X Y Z , .
频度 63 15 1 48 51 80 23 8 18 1 16 1 6 2
要求完成的系统应具备如下的功能:
1 ...
Jsp/Servlet System.out.print(s) System.out.println(t) System.out.print(u) System.out.println(v) System.o
System.out.print(s) System.out.println(t)
System.out.print(u) System.out.println(v)
System.out.print(a) System.out.print(b) System.out.print(c) System.out.println(d) x=0x5f20 y=0x5f35 z=0xffff System.out.print(x) System.out.print(y) System.out.println(z)
汇编语言 Abstract A new intelligent milometer base on a microcontroller can count the sum. By taking full u
Abstract
A new intelligent milometer base on a microcontroller can count the sum. By taking full use of the processor 89s51 and E² PROM (AT24C02) and sensor of magnetism, it can count the sum of fully distance and the course of development.
uCOS 读写U盘模块由硬件及软件两部分组成。硬件使用的是ISP1160BM PACK
读写U盘模块由硬件及软件两部分组成。硬件使用的是ISP1160BM PACK,软件EasyHostMass.a驱动库。
人工智能/神经网络 function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 % Exponent fo
function [U,center,result,w,obj_fcn]= fenlei(data)
[data_n,in_n] = size(data)
m= 2 % Exponent for U
max_iter = 100 % Max. iteration
min_impro =1e-5 % Min. improvement
c=3
[center, U, obj_fcn] = fcm(data, c)
for i=1:max_iter
if F(U)>0.98
break
else
w_new=eye(in_n,in_n)
center1=sum(cent ...
GPS编程 function [U,V,num_it]=fcm(U0,X) % MATLAB (Version 4.1) Source Code (Routine fcm was written by R
function [U,V,num_it]=fcm(U0,X)
% MATLAB (Version 4.1) Source Code (Routine fcm was written by Richard J.
% Hathaway on June 21, 1994.) The fuzzification constant
% m = 2, and the stopping criterion for successive partitions is epsilon =??????.
%*******Modified 9/15/04 to have epsilon = ...