-
IQ
说明： IQ调制基本原理！！！！！！！！ (IQ modulation principle! ! ! ! ! ! ! !)
- 2010-07-11 23:20:51下载
- 积分：1
-
ds1104_vect_serial
DS 1014 IMFOC control
- 2012-05-16 04:20:45下载
- 积分：1
-
Genetic-algorithm-neural-network-function-extremu
Genetic algorithm neural network function extremum optimization
- 2014-12-01 23:00:16下载
- 积分：1
-
mtsp_ga
关于车辆VRP调度的程序，利用遗传算法编译而成。(Compiled from vehicle VRP scheduling procedures, the use of genetic algorithms.)
- 2012-10-03 16:51:47下载
- 积分：1
-
LIB_MNG
Library Management System for Students. Or for those who want to explore C++ basics.
- 2014-09-29 14:16:13下载
- 积分：1
-
yizhongsuijiduotuoyuanjiancedekuaisusuanfa
针对多椭圆检测问题提出了一种快速随机检测算法。该算法利用在图像中随机采样到的一个边缘点和
局部搜索到的两个边缘点以及这三个点的邻域信息确定候选椭圆,再将候选椭圆变换为对应圆,通过确认真圆来确
认真椭圆。在确定候选椭圆时,最大限度地减少随机采样点数‰ 剔除更多的非椭圆点,降低了无效采样,减少了无效
计算。数值实验结果表明:该算法具有良好的鲁棒性,其检测速度比同类算法快(Ellipse detection problem for many a fast random detection algorithm. The algorithm uses random sampling in the image of an edge point and the local search to the two edge points, as well as the three-point neighborhood information to determine the candidate ellipse, and then transformed into the corresponding elliptical candidate won, through the identification of real yen to confirm really elliptical. In determining when a candidate ellipse, to minimize random sampling points ‰ remove more non-oval points, reducing invalid sampling, to reduce the calculation invalid. Numerical experimental results show that: the algorithm has good robustness, and its detection faster than similar algorithms quickly)
- 2009-03-21 19:12:42下载
- 积分：1
-
myrcosine
说明： 在matlab上面实现升余弦滤波器设计，不是用的matlab函数(In achieving the above raised cosine matlab filter design, not by the matlab function)
- 2010-04-10 09:49:25下载
- 积分：1
-
Matlab-Bayesian-classifier-program
说明： Matlab贝叶斯分类器+(Bayers)程序(Matlab Bayesian classifier+ (Bayers) program)
- 2011-04-07 00:40:52下载
- 积分：1
-
cebk_tsp
用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。
(Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
- 2011-05-22 08:12:37下载
- 积分：1
-
drwCrcle
Draw a circle on the current axis
- 2011-12-03 04:36:24下载
- 积分：1
