遗传算法图像分割，利用遗传算法进行图像分割

任意元素的矩阵操作，包括加、减、乘、求行列式、求逆-An arbitrary element matrix operations, including addition, subtraction, multiplication, seeking determinant, inverse

资源描述地震勘探中，频率-波数域PSPI波动方程正演模拟C语言程序，适合与初学正演的人，其在相移法的基础上利用插值提高了算法精度，同时相比时域有限差分运算更快，但仍然不能适应横向速度变化过大的速度模型。

lms source code for adaptive filtering the acoustic noise.

这是一个鱼眼标定算法的源代码，代码中实现了一种常用的球面标定算法，初学者如果有需要可以下下来学习学习

自己编写的八皇后问题的各种随机算法：包括了随机算法，回溯法，随机+回溯求解八皇后-I have written eight issues of a variety of Queen" s random algorithm: including a random algorithm, backtracking random+ back to solve the eight Queen" s

他们是源代码中的数字信号处理和数字通讯 （如 psk 和 bpsk 和 qam 和......

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

应用背景This paper considers the problem of interference mitigation in multi-cell multi-antenna time division duplex (TDD) wireless systems for downlink transmission. An efficient way to obtain channel state information (CSI) at the base station is by using uplink pilots and reciprocity of the downlink channel. At the same time, it has been shown that pilots from different cells contaminate each other, resulting in corruption of precoding matrices used by base stations, and high inter-cell interference. This paper studies the effects of shifting the location of pilots in time frames used in neighboring cells, and its effectiveness in obtaining better channel estimates, and, thereby, inter-cell interference reduction.关键技术Wireless cellular network designs with multiple antennas have been adopted by several modern wireless systems, which aim for high throughput as well as high

高级加密标准（AES）

//=== === === === === === === = //函数说明 //函数名称：PolyFit //函数功能：最小二乘法曲线拟合 //使用方法：double *x ---- 存放n个数据点的X坐标 // double *y ---- 存放n个数据点的Y坐标 // int n -------- 给定数据点个数 // double *a ---- 返回m-1次拟合多项式的m个系数 // int m -------- 拟合多项式的项数，即拟合多项式的最高次为m-1。要求m20，则本函数自动按m=min{n,20}处理 // double *dt --- dt[0]返回拟合多项式与各数据点误差的平方和；dt[1]返回拟合多 // 项式与各数据点的误差绝对值之和；dt[2]返回拟合多项式与各数据 // 点误差绝对值的最大值 //注意事项：拟合多项式的形式为 y = b0 + b1*(x-Xavr)... -//=== === === === === ==== === === === === === === ==== === =// function annotations// function name : PolyFit// Function functions : Least Squares Curve Fitting// Use : double* x n-store data point coordinates of the X//* y double-storage n data point Y coordinates// int n-------- given the number of data points//* a double---- returned to the m-1 m fit polynomial coefficients// int m-------- polynomial fitting items , which is the highest polynomial fitting time for m-1. Request m