-
cameras_t
License Plate Recognition identifiable license plates of various mainland, including the blue card and card, yellow card and white card, black card to identify them from Hong Kong, Macao plate yellow card to identify the single-row yellow plates, large car number plates and motorcycle license white card can be identified, including a police vehicle, the armed police and military license plates.
- 2010-02-11 01:38:56下载
- 积分：1
-
cdhmm
通过Matlab编程，经过提取特征参数与模板对比，可以识别0-9十个数字。(By Matlab programming, after extracting characteristic parameters compared with the template, you can identify 0-9 ten numbers.)
- 2013-11-13 22:28:58下载
- 积分：1
-
curvelet
说明： 曲波变换1，可以用来做曲波变换得到系数矩阵，其中含逆变换(curvelet Part)
- 2010-04-20 15:35:30下载
- 积分：1
-
split-step-Fourier
用分布傅里叶方法求解非线性薛定谔方程的matlab源码(matlab code for solving nonlinear Schrodinger equation by using split-step fourier method)
- 2011-01-04 09:56:38下载
- 积分：1
-
ds
说明： 计算刀刃的弗朗禾费衍射图样并模拟的MATLAB代码(Francis blade Wo fee calculated diffraction pattern and simulated MATLAB code)
- 2011-05-21 23:10:48下载
- 积分：1
-
cdma_oqpskdemod
cdma oqpsk解调程序， matlab例程， 可以直接使用。(cdma oqpsk demod)
- 2015-03-03 10:30:46下载
- 积分：1
-
jsjy
这个程序可以实现一个正态总体参数的假设检验问题(This program can realize hypothesis test of a normal population parameter )
- 2014-01-18 19:58:33下载
- 积分：1
-
1
说明： 计算机仿真模拟光学实验——杨氏双缝干涉实验！(双缝干涉)
- 2010-04-26 10:34:44下载
- 积分：1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分：1
-
Elman
Elman神经网络：Elman网络是 J. L. Elman于1990年首先针对语音处理问题而提出来的, 它是一种典型的局部回归网络( global feed for ward l ocal recurrent)。Elman网络可以看作是一个具有局部记忆单元和局部反馈连接的前向神经网络。Elman网络具有与多层前向网络相似的多层结构。它的主要结构是前馈连接, 包括输入层、 隐含层、 输出层, 其连接权可以进行学习修正 反馈连接由一组“结构 ” 单元构成,用来记忆前一时刻的输出值, 其连接权值是固定的。在这种网络中, 除了普通的隐含层外, 还有一个特别的隐含层,称为关联层 (或联系单元层 ) 该层从隐含层接收反馈信号, 每一个隐含层节点都有一个与之对应的关联层节点连接。关联层的作用是通过联接记忆将上一个时刻的隐层状态连同当前时刻的网络输入一起作为隐层的输入, 相当于状态反馈。隐层的传递函数仍为某种非线性函数, 一般为 Sigmoid函数, 输出层为线性函数, 关联层也为线性函数。(Elman neural network: Elman JL Elman network is first proposed for speech processing problems in 1990. It is a typical local regression network (global feed for ward l ocal recurrent). Elman network can be seen as having a forward neural network of local memory unit and local feedback connections. Elman network has a multi-layer multilayer structure similar to the network. Its main structure is a feedforward connection, comprising an input layer, a hidden layer and output layer, which can be connected right learning correction feedback connected by a set of " structural" units, the output value of the memory for the previous time, which connection weights are fixed. In such a network, in addition to ordinary hidden layer, there is a special hidden layer, called an associative layer (or contact layer unit) this layer receives feedback signals the hidden layer, each hidden layer node has an associated layer node corresponding connection. The role of the associated layer is fo)
- 2015-03-26 22:36:26下载
- 积分：1
