Search - v c - CodeBus

Search - v c - List

[Mathimatics-Numerical algorithms] 050505202607_2_6_mat DL : 0: 1、说明：本书中所有的常用数值算法子过程按书中的章数分别放在以C开头的子目录中。所有这些为验证上述子过程而编的验证过程按书中的章数分别放在以D开头的子目录中。所有为验证过程而做的工程，按书中的章数分别放在以V开头的子目录中。 2、使用： 1）最简单的做法是若D盘有大于50M的空间，读者只须将光盘上的子目录“DELPHI_SHU”-1, Note : This book all the numerical algorithm commonly used for the process according to the book chapters to C respectively on the beginning of the subdirectories. All of these certification process for the above series of the certification process by chapters of the book were placed on the beginning of the D subdirectory. All of the verification process and the works done by the book's chapters were placed on the V beginning of the subdirectories. 2, the use of : a) the simplest way is if D is greater than 50M disk space, CD-ROM readers will be only the subdirectory "DELPHI_SHU"
Date : 2008-10-13 Size : 1.91mb User : 汪兴
[Mathimatics-Numerical algorithms] 050505202607_2_6_mat DL : 0: 1、说明：本书中所有的常用数值算法子过程按书中的章数分别放在以C开头的子目录中。所有这些为验证上述子过程而编的验证过程按书中的章数分别放在以D开头的子目录中。所有为验证过程而做的工程，按书中的章数分别放在以V开头的子目录中。 2、使用： 1）最简单的做法是若D盘有大于50M的空间，读者只须将光盘上的子目录“DELPHI_SHU”-1, Note : This book all the numerical algorithm commonly used for the process according to the book chapters to C respectively on the beginning of the subdirectories. All of these certification process for the above series of the certification process by chapters of the book were placed on the beginning of the D subdirectory. All of the verification process and the works done by the book's chapters were placed on the V beginning of the subdirectories. 2, the use of : a) the simplest way is if D is greater than 50M disk space, CD-ROM readers will be only the subdirectory "DELPHI_SHU"
Date : 2025-12-30 Size : 1.91mb User : 汪兴
[Mathimatics-Numerical algorithms] knapsack DL : 0: 程序设计思路在动态规划中，可将一个问题的解决方案视为一系列决策的结果，要考察每个最优决策序列中是否包含一个最优子序列。所以在最短路径问题中，假如在的第一次决策时到达了某个节点v，那么不管v 是怎样确定的，此后选择从v 到d 的路径时，都必须采用最优策略。利用最优序列由最优子序列构成的结论，可得到f 的递归式。f ( 1 ,c) 是初始时背包问题的最优解。可使用（1）中所示公式通过递归或迭代来求解f ( 1 ,c)。从f (n, * )开始迭式， f (n, * )由第一个式子得出，然后由第二式递归计算f (i,*) ( i=n- 1，n- 2，⋯ ， 2 )，最后得出f ( 1 ,c)。动态规划方法采用最优原则（ principle of optimality）来建立用于计算最优解的递归式。所谓最优原则即不管前面的策略如何，此后的决策必须是基于当前状态（由上一次决策产生）的最优决策。由于对于有些问题的某些递归式来说并不一定能保证最优原则，因此在求解问题时有必要对它进行验证。若不能保持最优原则，则不可应用动态规划方法。 -err
Date : 2025-12-30 Size : 22kb User : 王新峰
[Mathimatics-Numerical algorithms] BP DL : 0: BP神经网络程序,C语言源代码如下： #include "iostream.h" #include "iomanip.h" #include "stdlib.h" #include "math.h" #include "stdio.h" #include "time.h" #include "fstream.h" #define N 120 //学习样本个数 #define IN 3 //输入层神经元数目 #define HN 2 //隐层神经元数目 #define ON 2 //输出层神经元数目 #define Z 20000 //旧权值保存-》每次study的权值都保存下来 double P[IN] //单个样本输入数据 double T[ON] //单个样本教师数据 double U11[IN][HN] //输入层至第一隐层权值 double V[HN][ON] //隐层至输出层权值 double X1[HN] //第一隐层的输入 double Y[ON] //输出层的输入 double H1[HN] //第一隐层的输出 double O[ON] //输出层的输出 double YU_HN1[HN] //第一隐层的阈值 double YU_ON[ON] //输出层的阈值 double err_m[N] //第m个样本的总误差 double a //学习效率 double alpha //动量因子-BP net
Date : 2025-12-30 Size : 3kb User : 梅汉文
[Mathimatics-Numerical algorithms] C-numerical-algorithm-program DL : 0: 本书中的常用数值算法子程序、所有为验证这些子过程而编的验证程序以及在验证这些过程中所形成的工程，均按书中章的编号分别放在以C开头、以D开头和以V开头的子目录中。-The numerical algorithm used in this book subroutine, all of these sub-processes to verify the validation process and compiled in the verification of those in the process of the formation of the project, according the book chapter numbers were placed in C beginning with D at the beginning and with V at the beginning of the subdirectory.
Date : 2025-12-30 Size : 13.98mb User : 文松抑扬
[Mathimatics-Numerical algorithms] image DL : 0: When designing software for processing images for the characters, each character is converted into a matrix M (7,5)-valued binary (black =1 and white = 0) Due to memory problems we wanted to compress the vector M. The program reads from the conversion matrix M and the matrix M in a vector V, and compression of vector V -> C and end is the display of vector C -When designing software for processing images for the characters, each character is converted into a matrix M (7,5)-valued binary (black =1 and white = 0) Due to memory problems we wanted to compress the vector M. The program reads from the conversion matrix M and the matrix M in a vector V, and compression of vector V -> C and end is the display of vector C ...
Date : 2025-12-30 Size : 308kb User : kader125
[Mathimatics-Numerical algorithms] svm4 DL : 0: 　-s svm类型：SVM设置类型(默认0) 　　0 -- C-SVC 　　1 --v-SVC 　　2 – 一类SVM 　　3 -- e -SVR 　　4 -- v-SVR 　　-t 核函数类型：核函数设置类型(默认2) 　　0 – 线性：u v 　　1 – 多项式：(r*u v + coef0)^degree 　　2 – RBF函数：exp(-r|u-v|^2) 　　3 –sigmoid：tanh(r*u v + coef0) 　　-d degree：核函数中的degree设置(针对多项式核函数)(默认3) 　　-g r(gama)：核函数中的gamma函数设置(针对多项式/rbf/sigmoid核函数)(默认1/ k) 　　-r coef0：核函数中的coef0设置(针对多项式/sigmoid核函数)((默认0) 　　-c cost：设置C-SVC，e -SVR和v-SVR的参数(损失函数)(默认1) 　　-n nu：设置v-SVC，一类SVM和v- SVR的参数(默认0.5) 　　-p p：设置e -SVR 中损失函数p的值(默认0.1) 　　-m cachesize：设置cache内存大小，以MB为单位(默认40) 　　-e eps：设置允许的终止判据(默认0.001) 　　-h shrinking：是否使用启发式，0或1(默认1) 　　-wi weight：设置第几类的参数C为weight*C(C-SVC中的C)(默认1) 　　-v n: n-fold交互检验模式，n为fold的个数，必须大于等于2--s svm_type : set type of SVM (default 0) 0-- C-SVC 1-- nu-SVC 2-- one-class SVM 3-- epsilon-SVR 4-- nu-SVR -t kernel_type : set type of kernel function (default 2) 0-- linear: u *v 1-- polynomial: (gamma*u *v+ coef0)^degree 2-- radial basis function: exp(-gamma*|u-v|^2) 3-- sigmoid: tanh(gamma*u *v+ coef0) 4-- precomputed kernel (kernel values in training_instance_matrix) -d degree : set degree in kernel function (default 3) -g gamma : set gamma in kernel function (default 1/k) -r coef0 : set coef0 in kernel function (default 0) -c cost : set the parameter C of C-SVC, epsilon-SVR, and nu-SVR (default 1) -n nu : set the parameter nu of nu-SVC, one-class SVM, and nu-SVR (default 0.5) -p epsilon : set the epsilon in loss function of epsilon-SVR (default 0.1) -m cachesize : set cache memory size in MB (default 100) -e epsilon : set tolerance of termination criterion (default 0.001) -h shrinking: whether to use the shrinking heuristics, 0 or 1 (default 1) -b
Date : 2025-12-30 Size : 17kb User : little863
[Mathimatics-Numerical algorithms] trituenhantao DL : 0: trí tuệ nhâ n tạ o, nề n tả ng củ a khoa họ c và đ ờ i số ng-trí tuệ nhâ n tạ o, nề n tả ng củ a khoa họ c và đ ờ i số ng
Date : 2025-12-30 Size : 266kb User : lunem
[Mathimatics-Numerical algorithms] my_viterbi DL : 0: Viterbi算法及其实现，C++可发的，HMM的初学者特别适用。-It very useful for V++ learner.
Date : 2025-12-30 Size : 1.45mb User : 华却才让
[Mathimatics-Numerical algorithms] Statistical-letters-number DL : 0: Description: 给定一段文章，请输出每个字母出现的次数。 Input: 只有一组输入数据，该数据大小<10KB。在文章中除最后一个字符外，只有小写字母、空格和换行符，没有另外的标点、数字和大写字母等。该文章以’#’结尾。 Output: 输出格式为“C A”，C为’a’..’z’中的字母，A为出现次数，C和A之间空一格。 Sample Input: here is the input this is the article# Sample Output: a 1 b 0 c 1 d 0 e 5 f 0 g 0 h 4 i 5 j 0 k 0 l 1 m 0 n 1 o 0 p 1 q 0 r 2 s 3 t 5 u 1 v 0 w 0 x 0 y 0 z 0 -Description: for a given section of the article, please output the number of occurrences of each letter. Input: only one set of input data, the data size & lt10KB. In the article, except the last character, only lowercase letters, spaces and line breaks, no other punctuation, numbers and uppercase letters. The article in ' #' at the end. Output: Output format is " CA" , C as ' a' .. ' z' in the letters, A is the number of occurrences, C and A space between. Sample Input: here is the input this is the article# Sample Output: a 1 b 0 c 1 d 0 e 5 f 0 g 0 h 4 i 5 j 0 k 0 l 1 m 0 n 1 o 0 p 1 q 0 r 2 s 3 t 5 u 1 v 0 w 0 x 0 y 0 z 0
Date : 2025-12-30 Size : 9kb User : 沙魄郎君
[Mathimatics-Numerical algorithms] haofuza DL : 0: 线性Hamiltonian系统的振动性——Discrete Dynamics in Nature and Society -By employing a generalized Riccati technique and an integral averaging technique, some new oscillation criteria are established for the second order matrix differential system U′ = A(t)U+ B(t)V V ′ = C(t)U 􀀀 A∗ (t)V where A(t) B(t) C(t) are (n n)-matrices, and B C are Hermitian. These results are sharper than some previous results.
Date : 2025-12-30 Size : 93kb User : Guo yingxin