NFA转换为DFA等工具，用java语言

用差分方法求解沃尔泰拉方程，此处为一个变元的方程，由于该方程同时含有微分和积分，一般求解有一定的困难。-use of the finite difference method for Volterra equation here as a variable element of the equation, As the same time contain differential equations and integral, the general solution is definitely difficult.

! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jacobian. The (driver) subroutines called by the user are given in the 8 ! table below, and are well documented internally. The user need not 9 ! be concerned with any other subroutines in HOMPACK90. -! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jac

这是一个用c语言写的特定人的词语识别系统。此系统由于写的比较早，因此在语音识别过程中使用的语音特征是LPCC。而不是现在比较流行的MFCC特征。此程序也是我从网上找的，里面有作者的信息。此系统主要是用于科研实验而编写的一个语音识别系统，不能作为企业的产品。

实现算法可能的方法： 1. 未知节点利用邻居锚节点进行定位，没有邻居锚节点的未知节点无法定位。 2. 未知节点一旦被定位，就充当锚节点。这时没有邻居锚节点的未知节点在等到自己的邻居未知节点定位之后就可以进行定位。 3. 有邻居锚节点的未知节点只利用邻居锚节点进行定位，没有邻居锚节点的未知节点才利用已经定位了的邻居未知节点进行定位。 Centroid.m采用的第一种方法; Centroid_second.m采用的第二种方法; Centroid_third.m采用的第三种方法;

本代码实现如何反向传播算法 works.it 将生成关系图，它会告诉准确的预测和实际的输出结果。

大家好！我在C ++初学者，以前从来没有编写任何其他语言。现在我想写将使用高斯约算法来找到n个未知数 的系统的解决方案，无需使用任何先进的概念，如类，重载运算符一个简单的控制台应用程序

一个用于学习GA的简单程序，自己编写的SGA，不是使用的工具箱函数-A simple GA for the learning process, I have written SGA, instead of using the toolbox function

 LSR2D - Build projection matrix L for straight rays in 2D. % Input %    Tx: transmitter coordinates, nTx by 2 %          1st column contains X coordinates, 2nd contains Z coordinates %    Rx: receiver coordinates, nRx by 2 %          1st column contains X coordinates, 2nd contains Z coordinates %    grx: vector of X coordinates of cell boundaries (sorted increasing) %    grz: vector of Z coordinates of cell boundaries (sorted increasing) 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

理发馆的排队模拟- The haircut hall lines up simulates

#include#define uchar unsigned char#define uint unsigned intsbit dula=P2^6;sbit wela=P2^7;uchar num;uchar code table[]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d,0x07,0x7f,0x6f,0x77,0x7c,0x39,0x5e,0x79,0x71};void delay(uint);void main(){