搜索结果
找到约 107 项符合
points 的查询结果
按分类筛选
- 全部分类
- matlab例程 (18)
- 其他 (12)
- 数学计算 (8)
- 书籍 (7)
- 数值算法/人工智能 (6)
- 单片机编程 (5)
- 通讯编程文档 (4)
- 技术管理 (4)
- Java编程 (4)
- VC书籍 (4)
- 人工智能/神经网络 (3)
- 文章/文档 (3)
- 编译器/解释器 (2)
- 汇编语言 (2)
- JavaScript (2)
- 其他书籍 (2)
- VIP专区 (2)
- 电源技术 (1)
- GPS编程 (1)
- 电子书籍 (1)
- 嵌入式/单片机编程 (1)
- 行业发展研究 (1)
- 文件格式 (1)
- Java书籍 (1)
- 系统设计方案 (1)
- 软件设计/软件工程 (1)
- 压缩解压 (1)
- 其他嵌入式/单片机内容 (1)
- 软件工程 (1)
- 中间件编程 (1)
- 微处理器开发 (1)
- 通讯/手机编程 (1)
- 多国语言处理 (1)
- Matlab (1)
- 论文 (1)
- 源码 (1)
电子书籍 jboss 开发人员 手册 JBoss: A Developer s Notebook also introduces the management console, the web service
jboss 开发人员 手册
JBoss: A Developer s Notebook also introduces the management console, the web services messaging features, enhanced monitoring capabilities, and shows you how to improve performance. At the end of each lab, you ll find a section called "What about..." that anticipates and answers ...
人工智能/神经网络 This program demonstrates some function approximation capabilities of a Radial Basis Function Networ
This program demonstrates some function approximation capabilities of a Radial Basis Function Network.
The user supplies a set of training points which represent some "sample" points for some arbitrary curve. Next, the user specifies the number of equally spaced gaussian centers and the variance for ...
人工智能/神经网络 The EM algorithm is short for Expectation-Maximization algorithm. It is based on an iterative optimi
The EM algorithm is short for Expectation-Maximization algorithm. It is based on an iterative optimization of the centers and widths of the kernels. The aim is to optimize the likelihood that the given data points are generated by a mixture of Gaussians. The numbers next to the Gaussians give the re ...
其他 This is SvmFu, a package for training and testing support vector machines (SVMs). It s written in C
This is SvmFu, a package for training and testing support vector
machines (SVMs). It s written in C++. It uses templates. The
advantage of templates is that the types of kernel values and data
points can be varied to suit the problem.
matlab例程 realize overlapped-add method ％[y]=overlpadd(x,h,Nfft) ％y:output sequence ％x:input sequence ％h
realize overlapped-add method
％[y]=overlpadd(x,h,Nfft)
％y:output sequence
％x:input sequence
％h:filter impulse response sequence
％Nfft:points of each DFT operation
％重叠相加法实现分段卷积
matlab例程 PIECEWISE_EVAL: evaluates a piecewise function of x usage: y = PIECEWISE_EVAL(x,breakpoints,funs)
PIECEWISE_EVAL: evaluates a piecewise function of x
usage: y = PIECEWISE_EVAL(x,breakpoints,funs)
arguments (input)
x - vector or array of points to evaluate though the function
breakpoints - list of n breakpoints, -inf and +inf are implicitly
数学计算 /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F
/*
* EULER S ALGORITHM 5.1
*
* TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
* Y = F(T,Y), A<=T<=B, Y(A) = ALPHA,
* AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B].
*
* INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N.
*
* OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T.
* ...
matlab例程 support vector classification machine ％ soft margin ％ uses "kernel.m" ％ ％ xtrain: (Ltrain,N) wit
support vector classification machine
％ soft margin
％ uses "kernel.m"
％
％ xtrain: (Ltrain,N) with Ltrain: number of points N: dimension
％ ytrain: (Ltrain,1) containing class labels (-1 or +1)
％ xrun: (Lrun,N) with Lrun: number of points N: dimension
％ atrain: alpha coefficients (from svcm_tra ...
Java编程 One-channel queuing system simulator (M/M/1) * Arrival and service times are random and distributed
One-channel queuing system simulator (M/M/1)
* Arrival and service times are random and distributed exponetially.
*
* The simulator is time-slice-driven, i.e. the system model is being
* run at discrete time points, with constant increments deltaT.
* At each such time moment, program checks if a n ...
技术管理 This paper addresses a stochastic-#ow network in which each arc or node has several capacities and m
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary poin ...