feixianxing

说明：  由4个.m文件组成，用于16QAM和64QAM调制的软信息的提取(By 4. M files for 16QAM and 64QAM modulation of the soft information extraction)

book about electronics health record

说明：  基于股票分析方法的电力系统负荷预测：主要思路是从过去的负荷中得出对应的DIF值、DEA值、MACD值。然后再通过DIF去估测明天DIF估计值、DEA估计值、MACD估计值。然后又通过DEA、MACD估计值算出一个新的DIF估计值。再将这两个DIF估计值算术平均得出一个新的DIF估计值，然后反推出负荷的预测值，这样就完成了负荷预测。(The main idea is drawn from the past load values corresponding to the DIF, DEA value, MACD value. And then estimate DIF ,DEA,MACD in tomorrow use the past DIF , DEA , MACD. Then through the DEA, MACD calculate a new estimate of DIF. Then the arithmetic average of the two estimated DIF derived a new estimate of DIF, and then introduce predictive value of load, so that is the completion of the load forecast. )

汽车防抱死制动模型仿真，使用matlab simulink编写 汽车稳定性分析(Automotive anti-lock braking model simulation, written in Matlab Simulink)

Cognitive radio operation system

利用matlab编程进行单输入单输出控制系统的分析教程(Using matlab programming for the analysis of single-input single-output control system tutorial )

说明：  这个是编的BP神经网络的程序，对于初学神经网络的人有很好的借鉴(This is a series of BP neural network program, for the beginner neural network is a good reference)

This paper is concerned with the denition of t- norms on the algebra of truth values of type-2 fuzzy sets. Our proposed denition extends the denition of ordinary t-norms on the unit interval and extends our denition of t-norms on the algebra of truth values for interval-valued fuzzy sets.

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

Plots the results for a mass-spring system.