P3-1

粘弹性模型三元模型umat子程序，包括abaqus用户手册中的程序例子以及编写的程序代码和对应的inp文件(Viscoelastic model trigram umat subroutines, including abaqus user manual procedures and examples of programs written in code and corresponding inp file)

说明：  使用matlab的霍夫曼编码简单实例，输入包括给定概率表和字符串输入，输出包括编码后的结果和，解码后结果(Huffman encoding matlab use a simple example, the input comprising a given probability table and string input, output, including the results of encoded and decoded Results)

Signal models, echo cancelations adaptive filtering

自适应控制的东西，看看吧好东西的，喜欢吧谢谢了(adaptive control of things, good things, let's see it, a thank you like it?)

比较两个netcdf文件 1。通过添加内部ind2sub1函数remove函数依赖第三方 2。格式化文本(Description NCCMP compares two netcdf files and prints the differences. This function is useful for testing mathematical forecasting or prediction models. USAGE: NCCMP(ncfile1,ncfile2) NCCMP(ncfile1,ncfile2,tolerance,forceCompare) INPUT: ncfile1- name of the NetCDF file to compare ncfile2- name of the NetCDF file to compare tolerance- Compare numeric data using a tolerance threshold forceCompare- if false, exit when first difference is found true: continues to process all variables EXAMPLES: nccmp( old.nc , new.nc ,0.000001) nccmp( old.nc , new.nc ,[],true) FEATURES: 1. Print the differences and their locations 2. Exits when first difference is found or optionally continues to process all variables 3. User defined tolerance threshold to compare the variables TO DO: 1. Specific variable inclusion or exclusion 2. Specific attribute inclusion or exclusion 3. Option to ignore the history attribute 4. Ignore difference between v)

高斯天线生成，利用高斯函数模拟实际的天线，(Gaussian antenna generated using Gaussian function simulates the actual antenna,)

高斯平滑滤波器(含matlab代码),可供图像初步处理持用，已验证效果。(Gaussian smoothing filter (with matlab code), available image processing holders of preliminary, verified results.)

利用小波和霍夫曼对单声道文件进行压缩编码 并解码输出(The use of wavelet and Hoffman files for mono coding and decoding output)

capacity of multi input multi output

TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.