-
For2008a
ACOUNT： 用于A 方向灯的时间显示，8 位，可驱动两个数码管；
BCOUNT： 用于B 方向灯的时间显示，8 位，可驱动两个数码管。*/
module traffic(CLK,EN,LAMPA,LAMPB,ACOUNT,BCOUNT)
output[7:0] ACOUNT,BCOUNT
(reg[7:0] numa,numb
reg tempa,tempb
reg[2:0] counta,countb
reg[7:0] ared,ayellow,agreen,aleft,bred,byellow,bgreen,bleft
reg[3:0] LAMPA,LAMPB
always @(EN)
if(!EN)
)
- 2010-06-23 14:39:58下载
- 积分：1
-
IMM
室内无线定位，使用交互模型进行定位，matlab程序(wireless localization,IMM)
- 2013-10-27 00:58:28下载
- 积分：1
-
ID3
实现ID3算法，在结果中以树表示出来。决策树是对数据进行分类，以此达到预测的目的。该决策树方法先根据训练集数据形成决策树，如果该树不能对所有对象给出正确的分类，那么选择一些例外加入到训练集数据中，重复该过程一直到形成正确的决策集。(ID3 algorithm to achieve, in the results that come out to the tree. Decision tree is to classify the data, thus achieving the purpose of prediction. The decision tree training set of data according to the formation of the first decision tree, if the tree can not give the correct classification of all objects, then select a number of exceptions to the training set data, repeat the process until the correct decision set.)
- 2010-07-25 16:30:11下载
- 积分：1
-
Pulsed_Radar_System
脉冲雷达系统Simulink实现（Matlab6中可以用，Matlab7中没有试过）(pulsed radar system to achieve Simulink (Matlab can be used. Matlab7 not tried))
- 2007-06-05 00:21:37下载
- 积分：1
-
focuss
利用FOCUSS算法对数据进行重构表示，得到需要表示的成分，减少噪声干扰。(FOCUSS algorithms use the data to reconstruct said component required to obtain representation, reducing noise.)
- 2015-12-29 10:18:52下载
- 积分：1
-
MatLabrecommended
说明： M AT L A B有一些命令可以来控制M AT L A B语句的执行，如条件语句、循环语句和支持用
户交互的命令，本章将介绍这些命令.(M AT LAB some commands to control the implementation of M AT LAB statements, such as conditional statements, loop statements, and support the use of
Users interact with the command, this chapter will describe these commands)
- 2010-04-02 11:05:21下载
- 积分：1
-
Dijkstra
说明： 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分：1
-
SIMULATED-ANNEALING-
这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l
me in classical optimization techniques which are based on linear and nonlin
ogramming. TSP can be described as follows: Given a numberof cities to v
d their distances from all other cities know, an optimal travel route has to
und so that each city is visited one and only once with the least possible dista
aveled. This is a simple problem with handful of cities but becomes complica
the number increases.)
- 2013-12-15 03:26:30下载
- 积分：1
-
15883862PAPR
降低ofdma的papr,用matlab的系统仿真与实现。( DECREAES THE PAPR OF OFDMA)
- 2010-06-13 17:35:55下载
- 积分：1
-
white
It detects white pixels in a real time video
- 2014-01-12 15:44:30下载
- 积分：1
