-
matlab_algorithms
there some matlab code for matlab algorithms it is very useful for design algorithms
- 2010-08-15 19:52:22下载
- 积分:1
-
New-Microsoft-Word-Document
Bit plane slicing using MATLAB
- 2013-12-17 18:47:10下载
- 积分:1
-
利用测井曲线合成地震记录程序synthetic-by-welllog-data
利用测井曲线合成地震记录程序,这是一个例子,其中有AVO的井资料(This is a program that make a seismic synhetic data by welllog data, and the AVO well data is in it. )
- 2016-08-10 15:51:23下载
- 积分:1
-
randinterval
利用随机序列进行间隔控制,选择消息隐藏位(Intervals using random sequence control, select the message hidden bits)
- 2009-09-16 21:17:18下载
- 积分:1
-
voc-release5
Latent SVM code voc-release 5
- 2013-12-08 12:50:45下载
- 积分:1
-
使用经典GP算法计算关联维数的程序源代码 correlationdimension
一种使用经典GP算法计算关联维数的程序源代码,比较好用!(A classical GP algorithm using the correlation dimension of the source code, more easy to use!)
- 2007-08-07 16:57:17下载
- 积分: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
-
PSO_Solving_Multi_Aims
说明: 货物配装问题实质上是背包问题与装箱问题的混合,有着广泛的应用。配装,是指充分利用运输工具(如火车、货车、轮船等,本文主要是指货车) 的载重量和容积,采用先进的装载方法,合理安排货物的装载计划,最大限度地发挥货车容积和承载能力,从而降低配送成本。(Cargo loading problem and knapsack problem is essentially a mixture of bin-packing problem, with a wide range of applications. Loading refers to the full use of means of transport (such as trains, trucks, ships, etc., this paper mainly refers to goods) and the load volume, using advanced loading methods, rational arrangements for cargo loading plan maximizing the volume of goods and carrying capacity, thereby reducing distribution costs.)
- 2009-08-13 16:24:01下载
- 积分:1
-
m_map
根据纬度经度信息 准确画出学术论文需要的地理图 包括海洋 山脉等(According to latitude and longitude information accurately draw the necessary papers including marine mountains and other geographic map)
- 2013-10-10 16:27:37下载
- 积分:1
-
fuzzy-controller-
电机转矩的模糊控制器,电动教练车离合器踏板的控制(Motor torque fuzzy controller)
- 2015-04-09 16:11:06下载
- 积分:1