fdtd07

学习统计套利的同志们不要错过这份资料，！！(Learning statistical arbitrage comrades do not miss this information! !)

KDE function or kernel density function for the estimation of a continuous density

说明：  BP神经网络进行数据分类，是一种多层前馈神经网络，该网络的主要特点是信号前向传递，误差反向传播。运用梯度下降法，(BP neural network is a multi-layer feedforward neural network for data classification. Its main characteristics are forward signal transmission and back error propagation. Using gradient descent method and BP neural network to classify data is a multi-layer feedforward neural network. The main characteristics of this network are forward signal transmission and back error propagation. Using gradient descent method,)

matlab通信原理综合程序设计教程Comprehensive Program Design Communication Theory matlab tutorial(Comprehensive programming matlab Communication Theory Course Comprehensive Program Design Communication Theory matlab tutorial)

c与MATLAB的完美结合，教你如何成为两种语言的武林高手，谢谢支持(c with the perfect combination of MATLAB, teach you how to become a martial arts master two languages, thanks to support)

BFSK Modulation for digital signal processing

风力发电直驱变流器的仿真，某大厂出品，逼近真实工况，互相学习！( Direct drive wind power inverter simulation, some manufacturers produced, close to the real conditions, learn from each other!)

说明：  matpowe3.1b2 Open source software, no modified version downloaded from the official website, different matpower may not apply with each other program

介绍数字滤波器的定义、分类及实现方法。讨论IIR滤波器、FIR滤波器的设计方法以及如何运用MATLAB中的DSP Blockset工具箱设计数字滤波器。(Introduce digital filter definition, classification and realization. Discussion of IIR filter, FIR Filter design and how to use the DSP Blockset MATLAB toolbox to design digital filters.)

如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)