USDFLD HASHIN 2D & 3D

基于干扰矩阵的重置和导向矢量估计的数字波束形成，程序经过优化，可运行，里面包含了一个矩阵求积分的子程序，可参考(Reset based on interference matrix and steering vector estimation of digital beamforming, the program has been optimized to run, which contains a matrix integral subroutines, refer to)

自己编的5种调制信号，混沌的判断指标Lyapunov指数计算,信号维数的估计。( Own five modulation signal, Chaos indicator for Lyapunov index calculation, Signal dimension estimates.)

xfdtd中用于计算光子晶体PBG的算例(example used for PBG calculation in xfdtd)

最小二乘支持向量机做预测。程序可运行学习。在matlab上运行。(This is a program about prediction using LSSVM.It can run successfully for learning.This program can be used on matlab.)

说明：  三角网格以及矩形网格剖分. 实现等参单元以及误差L H 范数收敛阶估计.(Triangular meshes and rectangular meshes are subdivided to achieve convergence order estimation of error L H norm.)

实现扫雷功能,基于c语言实现的，能够控制输入矩阵的大小(Implement demining capabilities, based on the c language, able to control the size of the input matrix)

考虑了静态传递误差，齿轮几何偏心的影响建立3平行轴齿轮啮合动力学模型(Consider the impact of static geometry eccentric transmission error, the establishment of three parallel shaft gear gear dynamics model)

说明：  该LINGO程序的功能是：求出工程项目的收益的净现值和每道工序的最优开工时间，约束条件是紧前紧后约束，以及资源约束。。。(The program' s function is LINGO: the project proceeds to derive the net present value of each procedure and the optimal start time constraints are tight after the former tight constraints, and resource constraints. . .)

计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)

行人群体疏散仿真的社会力模型，可用于做系统仿真(Social force model for pedestrian evacuation)