Help everyone familiar with DOS, and familiar with the batch command is a dos co...

css帮助文档,-css help document,

此程序为四种排序算法的时间比较,选择,冒泡,插入排序,还有一份实验报告 -procedure for the four sorting algorithm of the time, choice, Bubble, insertion sort, and an experimental report

关于java的 基础 会很好的了解java语言-On the basis of java will be a very good understanding of java language

用数据结构(C语言版)编写程序，实现一个国际象棋的马踏遍棋盘的演示程序。具体要求为：将马随机放在国际象棋的8*8棋盘的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。用堆栈编制非递归程序求出马的行走路线，并按求出的行走路线，将数字1,2,3,……,64依次填入一个8*8的方阵，输出之。 -With the data structure (C language version) to write programs to achieve a chess board horse travels to the demonstration program. Specific requirements are: the horses were randomly placed in the 8* 8 chess board in a box, Ma according to the rules of chess to go mobile. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedure with the stack order to run for walking routes, and then find the routes will be the number 1,2,3, ... ..., 64 in turn fill in an 8* 8 matrix, the output of.

介绍了SVM的基础知识，包括：SVM入门（一）SVM简介；SVM入门（二）线性分类器part1；SVM入门（三）线性分类器part2；SVM入门（四）线性分类器的求解―问题的描述part1；SVM入门（五）线性分类器的求解―问题的描述part2等。-Describes the basics of SVM, including: SVM Getting Started (1) SVM Introduction SVM Getting Started (2) linear classifier part1 SVM Getting Started (3) linear classifier part2 SVM entry (d) the solution of a linear classifier- description of the problem part1 SVM Getting Started (5) the solution of the linear classifier- description of the problem part2 and so on.

一位全减器的ＶＨＤＬ的设计报告，里面包含完整的程序-a reduction of the entire VHDL design report, which contains a complete procedures

LE LOGICIEL CHARAM IT s THE PROGRAM FOR THE SIMULATION OF THE MOLECULAIRE

多目标遗传算法源码，包含遗传算法的各个步骤，适合于研究多目标优化的朋友-Multi-objective genetic algorithm source code, including the various steps of genetic algorithm, suited to study multi-objective optimization of Friend

PDZ规范和模板的控制

* 本算法用最小二乘法依据指定的M个基函数及N个已知数据进行曲线拟和 * 输入: m--已知数据点的个数M * f--M维基函数向量 * n--已知数据点的个数N-1 * x--已知数据点第一坐标的N维列向量 * y--已知数据点第二坐标的N维列向量 * a--无用 * 输出: 函数返回值为曲线拟和的均方误差 * a为用基函数进行曲线拟和的系数, * 即a[0]f[0]+a[1]f[1]+...+a[M]f[M]. -* The algorithm using the least-squares method based on the designated function of M and N-known curve data to be imported and* : m-- the known number of data points M* f-- From M* n vector function-- known data points the number N-1* x-- known data points of the first N-dimensional coordinates listed Vector* y-- known data points of the second N-dimensional coordinates shown in a vector*-- useless* Output : function return value to the curve-fitting and the mean square error* for the use of a base function and the curve fitting coefficients,* is a f [0] [0] a [1] f [a] ... a [M] f [M].