Welcome![Sign In][Sign Up]
Location:
Search - all k

Search list

[Other resourceall

Description: 模式识别分类器的设计,此为K均值法源码,经调试通过。所用数据为标准IRIS。
Platform: | Size: 1389 | Author: leestar | Hits:

[Picture ViewerWin32 chart

Description: 可以生成各种格式的图片(3D的饼图、3D的柱状图、线型图等等),图片格式有Gif,Jpeg,Bmp、png等格式-can produce all types of image formats (3D pie, 3D column, linear map, etc.), pictures Gif format, Jpeg, BMP, png formats.
Platform: | Size: 2489344 | Author: | Hits:

[Documentsc语言教程(www.vcok.com版)

Description: 经典c程序100例==1--10 【程序1】 题目:有1、2、3、4个数字,能组成多少个互不相同且无重复数字的三位数?都是多少? 1.程序分析:可填在百位、十位、个位的数字都是1、2、3、4。组成所有的排列后再去       掉不满足条件的排列。 2.程序源代码: main() { int i,j,k printf("\n") for(i=1 i<5 i++)    /*以下为三重循环*/  for(j=1 j<5 j++)    for (k=1 k<5 k++)    {     if (i!=k&&i!=j&&j!=k)    /*确保i、j、k三位互不相同*/     printf("%d,%d,%d\n",i,j,k)    }-classic procedures hundred cases == 1-- 10 procedures-- a topic : 1,2,3,4 figures, the number can be formed with each other with no repeat of the triple-digit figures? How many are? 1. Program Analysis : can fill the 100, 10, 000 the number of spaces are 1,2,3,4. With all the components removed after not satisfied with the conditions. 2. Source code : main () (int i, j, k printf ( "\ n") for (i = 1 ilt; 5 i)/* the following as the triple cycle*/for (j = 1 JLT; 5 j) for (k = 1 KLT; 5 k) (if (i! = ki! = jj! = k)/* i, j, k three disparate*/printf ( "% d,% d,% d \ n ", i, j, k
Platform: | Size: 304128 | Author: 刘宋 | Hits:

[Process-Thread学习

Description: 某贸易中心共10层,设有载客电梯1部。为了处理问题的方便,有以下的限定条件:   (1) 电梯的运行规则是:可到达每层。   (2) 每部电梯的最大乘员量均为K人(K值可以根据仿真情况在10~20人之间确定)。   (3) 仿真开始时,电梯随机地处于其符合运行规则的任意一层,为空梯。   (4) 仿真开始后,有N人(>20人)在该国际贸易中心的1层,开始乘梯活动。   (5) 每个人初次所要到达的楼层是随机的,开始在底层等待电梯到来。   (6) 每个人乘坐电梯到达指定楼层后,再随机地去往另一楼层,依此类推,当每人乘坐过L次(L值可以根据仿真情况在3~10次之间确定)电梯后,第L+1次为下至底层并结束乘梯行为。到所有人结束乘梯行为时,本次仿真结束。   (7) 电梯运行速度为S秒/层(S值可以根据仿真情况在1~5之间确定),每人上下时间为T秒(T值可以根据仿真情况在2~10之间确定)。   (8) 电梯运行的方向由先发出请求者决定,不允许后发出请求者改变电梯的当前运行方向,除非是未被请求的空梯。-a total of 10 layers, with a passenger elevator. To address the issue of convenience, have the following qualifications : (a) lift the operating rules is : can be reached on each floor. (2) each lift crew of the largest volume of all K (K value can be based on the simulation of the 10 to 20 between determined). (3) simulation at the beginning, randomly located in the lift line with its rules of operation arbitrary layer of air staircase. (4) simulation began, a N (gt; 20) at the International Trade Center in one layer, started by ladder activities. (5) Each person must first reach the floors are random, in the bottom wait for the elevator arrived. (6) Each person taken the lift arrived at the designated floor and then another random foot to the floor, and so on, when each rode L (L value c
Platform: | Size: 9216 | Author: 张虹 | Hits:

[AI-NN-PR模拟退火源码

Description: 模拟退火算法 模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程,来寻找全局最优解的有效方法之一。 模拟退火的基本思想和步骤如下: 设S={s1,s2,…,sn}为所有可能的状态所构成的集合, f:S—R为非负代价函数,即优化问题抽象如下: 寻找s*∈S,使得f(s*)=min f(si) 任意si∈S (1)给定一较高初始温度T,随机产生初始状态S (2)按一定方式,对当前状态作随机扰动,产生一个新的状态S’ S’=S+sign(η).δ 其中δ为给定的步长, η为[-1,1]的随机数-simulated annealing algorithm (Simulated Annealing, or SA algorithm) is a simulation of heating molten metal in the annealing process, to find the global optimum one of the effective ways. Simulated Annealing basic ideas and the steps are as follows : S = (s1, s2, ..., sn) for all possible state posed by the pool, f : S-R non-negative cost function, that is abstract optimization problems are as follows : Find S* s, making f (s*) = min f (si) arbitrary si S (1) to set a higher initial temperature T, randomly generated initial state S (2) of a certain form, the current state of random disturbance, have a new state S 'S' = S+ sign (). delta where given for the step, [-1,1] Random Number
Platform: | Size: 55296 | Author: | Hits:

[Crack Hack简易的矩陣加密編编码法

Description: 算法介绍 矩阵求逆在程序中很常见,主要应用于求Billboard矩阵。按照定义的计算方法乘法运算,严重影响了性能。在需要大量Billboard矩阵运算时,矩阵求逆的优化能极大提高性能。这里要介绍的矩阵求逆算法称为全选主元高斯-约旦法。 高斯-约旦法(全选主元)求逆的步骤如下: 首先,对于 k 从 0 到 n - 1 作如下几步: 从第 k 行、第 k 列开始的右下角子阵中选取绝对值最大的元素,并记住次元素所在的行号和列号,在通过行交换和列交换将它交换到主元素位置上。这一步称为全选主元。 m(k, k) = 1 / m(k, k) m(k, j) = m(k, j) * m(k, k),j = 0, 1, ..., n-1;j != k m(i, j) = m(i, j) - m(i, k) * m(k, j),i, j = 0, 1, ..., n-1;i, j != k m(i, k) = -m(i, k) * m(k, k),i = 0, 1, ..., n-1;i != k 最后,根据在全选主元过程中所记录的行、列交换的信息进行恢复,恢复的原则如下:在全选主元过程中,先交换的行(列)后进行恢复;原来的行(列)交换用列(行)交换来恢复。-algorithm introduced in the matrix inversion process is very common, which are mainly used for Billboard matrix. In accordance with the definition of the method of calculating multiplication, seriously affecting the performance. The need for a large number of Billboard matrix operations, matrix inversion optimization can significantly improve performance. Here we introduce the matrix inversion algorithm called full-elected PCA Gauss-Jordan and France. Gauss-Jordan and France (all elected PCA) inversion of the following steps : First, for k from 0 to n-1 for the following steps : from the first trip k, k started out the bottom right corner Subarray largest absolute selected elements, and element remember meeting the line and out, the adoption OK exchange and the exchange out of its exchange
Platform: | Size: 3072 | Author: 刘亮 | Hits:

[Chess Poker gamesCell

Description: 纸牌接龙游戏 把所有牌按花色依次从小到大( A 到 K )捡到右边的红色框中,全部捡完游戏结束。 主要操作有:鼠标单击和双击,没有拖动。 规则 1:方块接方块,草花接草花,从大到小的接(比如:方块8要接到方块9的下面) 规则 2:K 可以移到空的绿色框中 规则 3:最小的可以用双击自动移到红色框中 规则 4:点牌要点牌的上半截 规则 5:-poker word games all colors followed by licensing from small to large (A to K) picked up the right side of the red box, all seized End end of the game. Major operations are : mouse click and double-click, no drag. Rule 1 : Block access chunks and then Grasses and bedding plants, beginning with the largest access (for example : Block received eight to nine squares below) Rule 2 : K can be moved to the empty green box three rules : the smallest can double-click automatically moved to the red box Rule 4 : point license plates points the rules on sleeveless 5 :
Platform: | Size: 77824 | Author: 香烟 | Hits:

[CA authsecurity

Description: 说明: 1、里面有什么: 1.1、org.bouncycastle.*下的所有软件是bouncycastle组织开发的软件包 1.2、org.infosecurity.*下的软件包括: DES_CBC算法的实现 RSA算法的实现(包括:密钥生成、公钥加密和私钥解密、数字签名及签名验证) 数字信封的实现   利用数字信封实现大文件的加密、解密。 2、有什么用:   2.1 研究、学习信息安全中的密码学设计与实现技术。   2.2 当然如果大家觉得在其它地方用的上,我会觉得很高兴的。 3、还有什么改进: 3.1 对文件加密、解密的时候要频繁的IO,如果加一个缓冲区,比如10K、50K等, 只有缓冲区满了才写入DISK这样将提高效率。 3.2 RSA私钥积存的时候可以按PKCS8形式,再经BASE64编码保存比较好。-Note : 1, mean there : 1.1, org.bouncycastle .* of all software development organizations is bouncycastle package 1.2, org.infosecurity .* The software includes : DES_CBC algorithm to achieve the realization of the RSA algorithm (including : key generation, public key and private key encryption decryption, digital signatures and signature verification), the realization of digital envelope using digital envelope realize document encryption, decryption. Two, what is the use of : 2.1, learning the information security cryptography design and technology. 2.2 Of course, if you think in the other parts, I feel very happy. Three, what is there for improvement : 3.1 pairs of file encryption, decryption, and the time to frequent the IO, plus a buffer, such as 10K, 50K, the only buffer is needed for
Platform: | Size: 212992 | Author: 雷敏 | Hits:

[Graph programCheckFace

Description: 根据给定的人脸库,首先确定出每幅图象的人脸部分,然后基于K-L变换给出所有图象的特征脸,最后任意给出一幅人脸,将其从已有的人脸库中识别出来。-According to the face basement, first identified each piece of the human face images, Then, based on the K-L transform image given all the characteristics of the face, given a final arbitrary face, there will be from the library Face Recognition out.
Platform: | Size: 823296 | Author: 胡雪飞 | Hits:

[Special EffectsKmeans.Cluster.using.Guide

Description: 图像集群(Image Clustering) (1)图像读入,显示图像所在路径; (2)采用imgcluster函数进行图像集群,选择集群个数后进行图像集群; (3)运行后,在原图像上显示集群灰度图; (4)若要显示各个集群情况,可打开【Show Clustering Image】新窗体,显示各集群类的基于原图的彩绘区域。其中非当前集群范围,则显示灰度为255的黑色。用户可点击按纽上下查看所有集群图。-image cluster (Image Clustering) (1) read into the images, Images show host path; (2) use of imgcluster function for image clusters, After the number of clusters chosen for image clusters; (3) After the operation, in the original image displayed on the gray level clusters; (4) To show that the various clusters, [Show Open Clustering Image-- new windows, showed that the cluster type based on the maximum of regional painting. Clusters of non-current range, it shows that the intensity of 255 black. Users can click on View All button next cluster map.
Platform: | Size: 113664 | Author: mecal | Hits:

[SCMKEY_ALL

Description: 常用的按键处理方法大全,十分有用!给需要的朋友下载-commonly used keys approach Daquan, very useful! Need a friend to download
Platform: | Size: 1227776 | Author: 陈桂辉 | Hits:

[matlabknn_demo

Description: K近邻法的matlab程序,发现大家都在找它!-K-nearest neighbor method of Matlab procedures, I found that we all have to find it!
Platform: | Size: 2048 | Author: wang | Hits:

[Data structs16

Description: 给出从自然数1,2,3,....,n中任取k个数的所有组合.-Given from the natural numbers 1,2,3 ,...., n check any number of all k combinations.
Platform: | Size: 2048 | Author: liangsiliu | Hits:

[AI-NN-PRkmlocal-1.7.1.tar

Description: 高效的k-means算法实现,使用了k-d树与局部搜索等提高k-means算法的执行效率,同时包含示例代码,用c++代码实现。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.-Efficient k-means algorithm, the use of a kd tree with local search, such as k-means algorithm to improve the implementation efficiency of the sample code included with c++ Code. Effecient implementation of k-means algorith, kd tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.
Platform: | Size: 907264 | Author: 陈明 | Hits:

[JSP/JavaKdTree

Description: 用Java编写的KD TREE算法实现, 希望对大家有所帮助-Java prepared using KD TREE algorithm, I hope all of you to help
Platform: | Size: 1024 | Author: 阎贺 | Hits:

[AI-NN-PRK-SA

Description: 此文档是K类均值聚类和模拟退火结合的软硬件化分算法。众所周知,模拟退火算法的通用性,此算法是模拟退火的改进,较单纯的SA更优秀。-This document is a category K-means clustering and simulated annealing combination of hardware and software sub-algorithm. As we all know, the generic simulated annealing algorithm, this algorithm is the improvement of simulated annealing, a simpler SA better.
Platform: | Size: 65536 | Author: 石敏敏 | Hits:

[matlaball

Description: 模式识别分类器的设计,此为K均值法源码,经调试通过。所用数据为标准IRIS。-Pattern recognition classifier design, the source for the K-means, after debugging through. Data used as the standard IRIS.
Platform: | Size: 1024 | Author: leestar | Hits:

[AI-NN-PRK-meansNB

Description: :将K—means算法引入到朴素贝叶斯分类研究中,提出一种基于K—means的朴素贝叶斯分类算法。首先用K— me.arks算法对原始数据集中的完整数据子集进行聚类,计算缺失数据子集中的每条记录与 个簇重心之间的相似度,把记 录赋给距离最近的一个簇,并用该簇相应的属性均值来填充记录的缺失值,然后用朴素贝叶斯分类算法对处理后的数据 集进行分类。实验结果表明,与朴素贝叶斯相比,基于K—means思想的朴素贝叶斯算法具有较高的分类准确率。-: K-means algorithm will be introduced to the Naive Bayesian Classifier study, a K-means based on the Naive Bayesian classification algorithm. First of all, with K-me. arks algorithm focus on the raw data of the complete data subset of the cluster, the calculation of missing data for each subset of records and the similarity between the cluster center of gravity to the nearest record assigned to a cluster, and the corresponding attributes of the cluster means to fill the missing value record, and then use Naive Bayes classification algorithm to deal with the data set after classification. The experimental results show that compared with the Naive Bayes, K-means based on the thinking of Naive Bayes algorithm has higher classification accuracy.
Platform: | Size: 173056 | Author: 李浩 | Hits:

[CSharpK-means

Description: k-means 算法 step1 初始化K个质心 step2 将所有的点分配给最近的质心 step3 更新质心 step4 若质心都没用变化,则停止,否则返回step2 -k-means algorithm is initialized step1 step2 K a center of mass of all the points assigned to the nearest centroid centroid step3 step4 update no use if the change in the center of mass, then stop, otherwise return to step2
Platform: | Size: 44032 | Author: vince | Hits:

[AI-NN-PRk-means

Description: 基于K-means聚类算法的社团发现方法 先定义了网络中节点关联度,并构建了节点关联度矩阵, 在此基础上给出了一种基于 K-means聚类算法的复杂网络社团发现方法。 以最小关联度原则选取新的聚类中心, 以最大关联度原则进行模式归类,直到所有的节点都划分完为止, 最后根据模块度来确定理想的社团数-K-means clustering algorithm based on the association discovery To define a network node correlation, and build the node correlation matrix in this basis, given a K-means clustering algorithm based on a complex network of associations that way. The principle of the minimum correlation to select a new cluster center to the principle of maximum correlation pattern classification until all the nodes are divided until the end, the last under the module to determine the degree of the ideal number of community
Platform: | Size: 115712 | Author: maverick | Hits:
« 12 3 4 5 6 7 8 9 10 ... 25 »

CodeBus www.codebus.net