-
UNIX_Network_Programming_Volumn2
UNIX网络编程第2卷 进程间通信。学习Linux很好的书籍(UNIX Network Programming Volume 2 Interprocess communication. Good books to learn Linux)
- 2008-12-19 10:22:24下载
- 积分：1
-
Nosubject
对于AM，FFT，DSB系统进行进行基于MATLAB，simulink下的仿真(For AM, FFT, DSB system-based MATLAB, simulink simulation under)
- 2010-09-15 17:51:59下载
- 积分：1
-
CS_ISAR_Trial4
利用压缩感知对雷达进行成像，
结果显示良好(Using compressed sensing to image the radar,
The results are good)
- 2021-04-23 18:48:47下载
- 积分：1
-
hurst
利用R/S的各种修正版本计算HURST指数(Use of R/S calculation of the various amended version HURST index)
- 2007-09-14 18:45:18下载
- 积分：1
-
stbc-correct
correct coding for running the stbc in matlab
- 2011-05-02 04:13:25下载
- 积分：1
-
Orde-left--right--
顺序表奇数在左偶数在右，的数据结构算法，matlab(Order table an odd number in the left an even number in the right, the data structure algorithms, matlab)
- 2012-04-29 10:57:32下载
- 积分：1
-
A_3Diodes
its diodes study for current load and behavior of diodes simulink this to learning fro matlab
- 2015-03-11 20:36:29下载
- 积分：1
-
MyKmeans
实现聚类K均值算法： K均值算法：给定类的个数K，将n个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。 缺点：产生类的大小相差不会很大，对于脏数据很敏感。 改进的算法：k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用，这样的一个medoid就标识了这个类。步骤： 1，任意选取K个对象作为medoids（O1,O2,…Oi…Ok）。 以下是循环的： 2，将余下的对象分到各个类中去（根据与medoid最相近的原则）； 3，对于每个类（Oi）中，顺序选取一个Or，计算用Or代替Oi后的消耗—E（Or）。选择E最小的那个Or来代替Oi。这样K个medoids就改变了，下面就再转到2。 4，这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感，但计算量显然要比K均值要大，一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))
- 2005-07-26 01:32:58下载
- 积分：1
-
EM-for-HMM-Multivariate-Gaussian-processes
Expectation-Maximization algorithm for a HMM with Multivariate Gaussian measurement
Usage
-------
[logl , PI , A , M , S] = em_ghmm(Z , PI0 , A0 , M0 , S0 , [options])
- 2011-11-14 23:33:53下载
- 积分：1
-
huise
灰色按扭激活--可以将一些软件限制的灰色按扭激活使用,比如某些软件普通会员会限制一些功能,有这个就可以解开限制(Gray button activation- can be some of the limitations of the gray button to activate the software to use, such as some software will limit some features of ordinary members, have this limit can be solved)
- 2014-02-05 15:16:22下载
- 积分：1
