CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - c B
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search - c B - List
[
AI-NN-PR
]
svm_v0.55beta
DL : 0
最新的支持向量机工具箱,有了它会很方便 1. Find time to write a proper list of things to do! 2. Documentation. 3. Support Vector Regression. 4. Automated model selection. REFERENCES ========== [1] V.N. Vapnik, "The Nature of Statistical Learning Theory", Springer-Verlag, New York, ISBN 0-387-94559-8, 1995. [2] J. C. Platt, "Fast training of support vector machines using sequential minimal optimization", in Advances in Kernel Methods - Support Vector Learning, (Eds) B. Scholkopf, C. Burges, and A. J. Smola, MIT Press, Cambridge, Massachusetts, chapter 12, pp 185-208, 1999. [3] T. Joachims, "Estimating the Generalization Performance of a SVM Efficiently", LS-8 Report 25, Universitat Dortmund, Fachbereich Informatik, 1999. -The newest work tools of svm,it will be very convenient to have it.
Date
: 2025-12-21
Size
: 168kb
User
:
金星
[
AI-NN-PR
]
GeneticAntAlgorithms
DL : 0
use genetic ant algorithm to slove TSP problem-use genetic algorithm to slove ant TSP ty B'Tselem,
Date
: 2025-12-21
Size
: 81kb
User
:
william
[
AI-NN-PR
]
pgacsp
DL : 0
This a parallel genetic algorithm for a biinfomatics problem CSP-This a parallel genetic algorithm for a b iinfomatics problem CSP
Date
: 2025-12-21
Size
: 4kb
User
:
Mary He
[
AI-NN-PR
]
mergesortedvectors
DL : 0
If we have two individually sorted vectors "a" and "b" but they are not sorted with respect to each other and we want to merge them into vector "c" such that "c" is also a sorted vector. Then c=mergesorted(a,b) can be used. -If we have two vectors individually sorted "a" and "b" but they are not sorted with respect t o each other and we want to merge them into vector "c" such that "c" is also a sorted vector. Then c = mergesorted (a, b) can be used.
Date
: 2025-12-21
Size
: 2kb
User
:
Tom
[
AI-NN-PR
]
Substituter.java
DL : 0
代入法的启发示搜索 我的代码实现是:按照自然语言各字母出现频率的大小从高到低(已经有人作国统计分析了)先生成一张字母出现频率统计表(A)--------(e),(t,a,o,i,n,s,h,r),(d,l),(c,u,m,w,f,g,y,p,b),(v,k,j,x,q,z) ,再对密文字母计算频率,并按频率从高到低生成一张输入密文字母的统计表(B),通过两张表的对应关系,不断用A中的字母去替换B中的字母,搜索不成功时就回退,在这里回朔是一个关键。 -generation into a search of inspiration I said a code is : According to the Natural Language alphabet frequency of the size of precedence (has been for the State Statistical Analysis), Mr. into an alphabet frequency tables (A )--------( e), (t, a, o, i, n, s, h r), (d, l), (c, u, m, w, f, g, y, p, b), (v, k, j, x, q, z), again close to the mother language calculated frequency and frequency input precedence generate a secret letter to the mother TAB (B), Table 2 by the corresponding relations, use of the letters A to B to replace the letters of the alphabet, when unsuccessful search regression, Here is a retrospective key.
Date
: 2025-12-21
Size
: 4kb
User
:
rtshen
[
AI-NN-PR
]
6118314818200710172034159944964
DL : 0
bp算法实现代码,在c++ builder 平台上实现. b p算法实现代码,在c++ builder 平台上实现-bp algorithm code, in c++ builder platform. bp algorithm code, in c++ builder platform realize
Date
: 2025-12-21
Size
: 276kb
User
:
[
AI-NN-PR
]
IncrementalRandomNeurons
DL : 0
本人编写的incremental 随机神经元网络算法,该算法最大的特点是可以保证approximation特性,而且速度快效果不错,可以作为学术上的比较和分析。目前只适合benchmark的regression问题。 具体效果可参考 G.-B. Huang, L. Chen and C.-K. Siew, “Universal Approximation Using Incremental Constructive Feedforward Networks with Random Hidden Nodes”, IEEE Transactions on Neural Networks, vol. 17, no. 4, pp. 879-892, 2006. -I prepared by incremental random neural network algorithm, which is characterized by the largest approximation properties can be guaranteed, and fast good results can be used as an academic comparison and analysis. The current benchmark is only suitable for the regression problem. Specific effects may refer G.-B. Huang, L. Chen and C.-K. Siew,
Date
: 2025-12-21
Size
: 2kb
User
:
chenlei
[
AI-NN-PR
]
basicann
DL : 0
basic.c */ /**//* Project:NeuroBasic, basic package*//**/ /* Survey:This is a simple Basic b-code compiler which*/ /*can be used as a comfortable command shell for */ /* any program. The actual compiler is found in */ /*compiler.c.*/ /*The functions m_fctptr() and user_server()*/ /*build an interface to an-basic.c*//**//* Project: NeuroBasic, basic package*//**//* Survey: This is a simple Basic b-code compiler which*//* can be used as a comfortable command shell for*//* any program. The actual compiler is found in*//* compiler.c .*//* The functions m_fctptr () and user_server ()*//* build an interface to an
Date
: 2025-12-21
Size
: 100kb
User
:
wooxun
[
AI-NN-PR
]
moshishibie
DL : 1
先用C-均值聚类算法程序,并用下列数据进行聚类分析。在确认编程正确后,采用蔡云龙书的附录B中表1的Iris数据进行聚类。然后使用近邻法的快速算法找出待分样本X(设X样本的4个分量x1=x2=x3=x4=6;子集数l=3)的最近邻节点和3-近邻节点及X与它们之间的距离。-First C-means clustering algorithm procedures and with the following data for cluster analysis. After confirming the correct programming, using the book蔡云龙Table 1 in Appendix B of the Iris data clustering. And the use of a close neighbor of law to be fast algorithm to find sub-samples of X (for X samples four components x1 = x2 = x3 = x4 = 6 subset of the number of l = 3) of the nearest neighbor nodes and 3- neighbor nodes and X and the distance between them.
Date
: 2025-12-21
Size
: 1kb
User
:
jack
[
AI-NN-PR
]
FuzzyMatrix
DL : 0
模糊矩阵类 可以根据不同的模糊算子计算模糊矩阵的并运算C=A∪B,交运算 C=A∩B,求余运算 C=1-A 等-Fuzzy matrices based on different fuzzy operator and calculation of fuzzy matrix operation C = A ∪ B, cross-operator C = A ∩ B, for more than computing C = 1-A, etc.
Date
: 2025-12-21
Size
: 2kb
User
:
麦子
[
AI-NN-PR
]
deboor-cox
DL : 1
目的:运用强化学习!多分类器集成!降维方法等最新计算机技术,结合细胞病理知识,设计制作/智能化肺癌细胞病理图像诊断系统0"方法:采集细胞图像,运用基于强化学习的图像分割法将细胞区域从背景中分离出来 运用基于样条和改进2方法对重叠细胞进行分离和重构 提取40个细胞特征用于贝叶斯!支持向量机!紧邻和决策树4种分类器,集成产生肺癌细胞分类结果 建立肺癌细胞病理图库,运用基于等降维方法对细胞进行比对,给予未定型癌细胞分类"结果:/智能化肺癌细胞病理诊断系统0应用于临床随机1200例肺部病灶穿刺细胞学涂片,肺癌识别诊断率94180 ,假阳性率1185 ,假阴性率3135 ,肺癌分类识别率82190 ,核异型细胞识别率74120 "结论:/智能化肺癌早期细胞病理诊断系统0对肺癌细胞涂片诊断率高,克服了肺癌细胞病理诊断过程中取检细胞数量少,重叠细胞识别率低,涂片背景及染色差异等干扰因素,可辅助临床肺部病灶的穿刺细胞病理诊断"-Objective Design and develop a intelligent cytopathological lung cancer diagnosing system(ICLCDS) utilizing the latest computer technologies(including Reinforcement Lcaming Multiple Classifier Fusion and Dimcnsionality Reduction) and the cy-topathological knowledge on lung canccrcclls Methods We got information ofcclls and segregated cell regions in a slice image using an magi scgmcntouon a址orithm Sascd on reinforcement lcaming including rcconstmction of overlapped cell area Sascd on B一Spline and improved dcBoor-Cox Mcthoc} We comSincd multiple classifiers including Baycsian classific:Support Vector Machine(SVM) classific K-Ncarcst NcighSour( KNN) and Decision c classific to achieve an accurate result of cytopathological lung cancer diag-nosis Results Experimental results on 1 200 cases randomly selected we as follows the accurate diagnosis rate for lung cancer idcn-tification was the false positive rate was 1. 8`J /c‘the false negative rate was 3. 3`J /c‘the type class
Date
: 2025-12-21
Size
: 216kb
User
:
高阳
[
AI-NN-PR
]
Matlabeg
DL : 0
基于 Ma t l a b语言的遗传算法工具箱支持二进制和浮点数编码方式, 并且提供了多种选择、 交叉、 变异的方法。 通过具体实例对 Ma t l a b的遗传 算法工具箱的用法进行 了说 明介绍.-The Ge ne t i c Al g or it h m To o l b ox ba s e d on Ma t l a b s u ppo ~s t h e b i na r y a nd f lo a t , a n d t he r e a r e t he e x c el l e nl o pe r at o r s o f s el e c t i on ,c r os s o v e r a nd mut a t i on i n t he To o l bo x ,t wo e xa mpl e s a b o ut ho w t o us e t h e To o l bo x a r e i n t r o du c ec i n t h i s pa p er。
Date
: 2025-12-21
Size
: 98kb
User
:
阿铁
[
AI-NN-PR
]
upload1
DL : 0
传教士与野人问题。完美版。getStrategy函数参数是N和k,返回的是一个字符串数组,代表一个状态序列,数组中的每一个元素代表一个状态,每一个状态表示为(a,b,c),其中a表示左岸的传教士数目,b表示左岸的野人数目,c表示船是否在左岸,c=1为船在左岸,c=0为船在右岸。如果问题无解,返回只有一个元素 “no solution”的数组。-Missionaries and savages the problem. Perfect version. getStrategy function parameters are N and k, returns a string array, on behalf of a state sequence, each element of the array represents a state, each state is represented as (a, b, c), which indicated that the left bank of a missionary The number of disabilities, b indicated that the number of the left bank of the Savage, c that ship is on the left bank, c = 1 for the shipping on the left bank, c = 0 for the boat on the right bank. If the problem is no solution, return only one element of " no solution" of the array.
Date
: 2025-12-21
Size
: 2kb
User
:
zhengyu
[
AI-NN-PR
]
particle
DL : 0
代码来自2008年数学建模东北赛区B题,原题描述http://www.ivanblog.cn/post/18.html 思想是用粒子群算法来实现相关问题的求解,编程语言是C++。-Mathematical modeling code from the 2008 Northeast Division B title, original title describes http://www.ivanblog.cn/post/18.html thinking is to achieve particle swarm algorithm to solve related problems, programming language is C++.
Date
: 2025-12-21
Size
: 2kb
User
:
olivejy
[
AI-NN-PR
]
BACKPROP
DL : 0
用C++语言实现了B-P算法,隐含层节点多少仅受内存限制-Using C++ language to implement the BP algorithm, the number of hidden layer nodes limited only by memory
Date
: 2025-12-21
Size
: 210kb
User
:
赵静
[
AI-NN-PR
]
thegeneticalgorithm
DL : 0
遗传算法的基本运算过程如下: a)初始化:设置进化代数计数器t=0,设置最大进化代数T,随机生成M个个体作为初始群体P(0)。 b)个体评价:计算群体P(t)中各个个体的适应度。 c)选择运算:将选择算子作用于群体。选择的目的是把优化的个体直接遗传到下一代或通过配对交叉产生新的个体再遗传到下一代。选择操作是建立在群体中个体的适应度评估基础上的。 d)交叉运算;将交叉算子作用于群体。所谓交叉是指把两个父代个体的部分结构加以替换重组而生成新个体的操作。遗传算法中起核心作用的就是交叉算子。 e)变异运算:将变异算子作用于群体。即是对群体中的个体串的某些基因座上的基因值作变动。 群体P(t)经过选择、交叉、变异运算之后得到下一代群体P(t 1)。 f)终止条件判断:若tT,则以进化过程中所得到的具有最大适应度个体作为最优解输出,终止计算。本程序主要采用C++编程,实现利用遗传算法解决函数优化问题-the genetic algorithm
Date
: 2025-12-21
Size
: 3kb
User
:
line
[
AI-NN-PR
]
hannuotachengxu
DL : 0
首先把三根柱子按顺序排成品字型,把所有的圆盘按从大到小的顺序放在柱子A上,根据圆盘的数量确定柱子的排放顺序:若n为偶数,按顺时针方向依次摆放 A B C;若n为奇数,按顺时针方向依次摆放 A C B。-First, the three pillars of order to the finished fonts, all the disks in sequence on the pillar by A, according to the number of disk emission to determine the order of columns: if n is even, turn clockwise placed ABC if n is odd, in a clockwise direction in order placed ACB.
Date
: 2025-12-21
Size
: 2kb
User
:
刘晓晶
[
AI-NN-PR
]
LDPC
DL : 0
这是关于LDPC信道编码模块设计的程序 打开源程序,先运行gengrate_h.m程序,陆续将码长设置为756bit,列重设置为3,行重设置为9。在Workspace中同时将H、A、B、C、D、E、Hget、Fget、g、Tget这是个变量选择另存为encode_in.mat 格式。再运行main_encode.m进行编码,主程序运行后,在当前目录下,自动生成编码结果文件“encode—out.mat”,这将作为下一次扩频调制仿真实验的的输入信号。最后分别查看Workspace中的变量s(编码前数据)和xyuan(编码后数据)的波形。 对比后,可以看出编码前的数据码片长度为504bit,编码后的码片数据长度为756bit。编码效率=编码前码片长度/编码后码片长度=2/3。-This is about the LDPC channel coding module design process Open source, first run gengrate_h.m program, phasing out the code length is set to 756bit, column re-set to 3, line weight is set to 9. In the Workspace in the same time, H, A, B, C, D, E, Hget, Fget, g, Tget This is a variable select Save As encode_in.mat format. Then run main_encode.m encoding, the main program running in the current directory, the results of automatically generated code file "encode-out.mat", which will serve as the next simulation of the spread spectrum modulation input signal. Finally, the variables were View Workspace in s (before encoding data) and xyuan (encoded data) waveform. After comparison, we can see the data before encoding chip length of 504bit, encoded data length of chip 756bit. Coded before coding efficiency = chip length/length of the encoded chip = 2/3.
Date
: 2025-12-21
Size
: 15kb
User
:
吴健
[
AI-NN-PR
]
b
DL : 0
B plus in c++ with templates
Date
: 2025-12-21
Size
: 20kb
User
:
arkdaru
[
AI-NN-PR
]
multilinearreg
DL : 0
利用最小二乘法来对w和b进行估计。最小二乘法就是试图找到一条直线,使得所有样本到直线上的欧式距离之和最小。(The least squares method is used to estimate W and B. The least squares method is trying to find a straight line, so that the sum of Euclidean distance of all the samples to the line is minimum)
Date
: 2025-12-21
Size
: 2kb
User
:
小唐唐
«
1
2
3
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.