-
zishiyingzaoshengduixiao
设计一个2阶加权自适应噪声对消器，对经加性白高斯噪声信道干扰的正弦信号进行滤波。(Design a two-order-weighted adaptive noise canceller, right through the additive white Gaussian noise channel interference sinusoidal signal filtering.)
- 2010-01-13 18:18:24下载
- 积分：1
-
Local-Binary-Pattern-Histogram-Fourier-Features
local binary pattern histogram fourier implementation for matlab
- 2014-03-19 01:35:42下载
- 积分：1
-
three_inverter_dq
这是一个三相离网逆变器双闭环控制，基于dq坐标系下采用电压外环和电流内环的方法对其进行稳定性控制。(This is a three-phase off-grid inverter double closed-loop control, based on the dq coordinate system using the voltage outside the ring and the current inner ring method for its stability control.)
- 2021-01-24 15:18:38下载
- 积分：1
-
MUSIC
MUSIC算法，平面阵，用于信号测向定位，很好用。(MUSIC algorithm, planar array for measuring signal to locate, easy to use.)
- 2021-02-28 18:39:36下载
- 积分：1
-
ofdr
说明： 基于OFDR的分布光纤传感技术的研究，仿真了OFDT干扰(The distributed optical fiber sensing technology based on OFDR is studied, and the ofdt interference is simulated)
- 2021-04-15 15:28:54下载
- 积分：1
-
DLDAchange
说明： 关于改进的DLDA的算法，结合了人脸识别(DLDA on the improvement of the algorithm, a combination of face recognition)
- 2009-08-20 10:41:01下载
- 积分：1
-
upload-m
substitution cipher is the method of encoding in which unit of plain text are replaced by cipher text. Monoalphabetic cipher uses a fixed message over entire message.A monoalphabetic cipher uses fixed substitution over the entire message.The monoalphabetic substitution takes a letter of an alphabet and substitutes it with another letter, this way a ciphertext is generated. The way of converting is fixed. A character of the plaintext will be replaced by the same ciphertext character, during the entire ciphertext. There is no additional key. The only way of security is to keep the substitution-table secret.
A popular example for the monoalphabetic substitution is the caesar cipher.
- 2015-02-27 14:43:29下载
- 积分：1
-
L01p_e
[x,f]= L01p_e(c,A,b,N)用枚举法求解下列
0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式，N= 0时可以省略。 返回结果x是最优解，f是最优解处的函数值。 ([X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.)
- 2013-07-16 21:51:03下载
- 积分：1
-
Binary-GA
说明： code of binary genetic algorithem
- 2013-12-29 05:01:03下载
- 积分：1
-
hillsv
Astrodynamics library file crack
- 2012-11-18 13:27:43下载
- 积分：1
