-
TaskManagerExSrc
Not only incredibly useful utility for managing processes, but great tool for learning about the Task Manager
- 2007-10-22 13:33:43下载
- 积分:1
-
dsp12
digital noise noise can eliminated and filters used
- 2011-08-06 20:50:32下载
- 积分:1
-
Near-field-to-far-field-transformation-for-near-f
this document shows in a simple way the transformation of near field to far field.Also we can attain far field of an antenna by using that.
- 2013-02-19 13:57:37下载
- 积分:1
-
texture-analysis-using-dwt-for-grape-plant-specie
Texture Analysis Using DWT for Grape Plant Species Classification:-
By observing leaf, we can easily identify plant but it is difficult to identify its species. In this project we developed an algorithm that gives user the ability to identify plant species based on photographs of the leaf. The core theme of this application is an algorithm that acquires statistical features of the leaves, and then classifies the species based on a novel combination of the computed texture feature analysis and wavelet analysis. While implementing this algorithm we have considered the Grape plant and its four species viz. Clone, Sonaka, Thomson and Manik. The algorithm is first trained against several samples of known plant species and then used to classify unknown query species. By using this algorithm we have achieved 93.33 efficiency
- 2015-01-01 15:26:38下载
- 积分:1
-
Chapter2
simulation of communication systems and software defined radio from the book chapter 2
- 2012-11-04 19:09:36下载
- 积分:1
-
KompresiLZW
LZW text compresion with GUI..input the text compress it with LZW method
- 2010-12-18 19:47:25下载
- 积分:1
-
Viterb
说明: viterb算法是卷积码中重要的一种译码算法,程序中用MATLAB实现了VITERB的译码算法,并且写了信道编码程序和二进制码通过以p概率错误的信道程序(viterb algorithm is important as a convolutional code decoding algorithm, the program using MATLAB to achieve a VITERB the decoding algorithm, and wrote letters Road, binary coding process and the probability of error through a p-channel process)
- 2010-04-28 18:38:39下载
- 积分:1
-
TSP(TravelingSalesmanProblem)
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
- 2007-11-15 01:44:52下载
- 积分:1
-
LPCCandMFCC
自己做设计用的参数提取程序,主要是LPCC和MFCC。(Designs its own program with the parameter extraction, mainly LPCC and MFCC.)
- 2010-09-06 10:51:26下载
- 积分:1
-
-Tabu-Search-to-Solve-the-JSSP-with-SD-Setup-Time
Tabu search for Job shop
- 2013-09-16 01:33:55下载
- 积分:1