ParticalText1

本程序用于完成BPSK、QPSK、8PSK的调制仿真。并可任意扩展到MPSK和MQAM。程序分成三个部分：phase.m对基带码元序列进行脉冲成型，可选矩形脉冲，升余弦脉冲和平方根升余弦脉冲； model.m 为主程序，完成各种信号的基带星座图映射、脉冲成型和调制； command.m给出一个简单的频谱显示测试。(This procedure for the completion of BPSK, QPSK, 8PSK modulation simulation. Arbitrary and may be extended to MPSK and MQAM. Program is divided into three parts: phase.m symbol of the baseband shaping pulse sequences, optional rectangular pulse, the square root raised cosine pulse and raised cosine pulse model.m-based procedures, completed a variety of base-band signal constellation mapping , pulse shaping and modulation command.m given spectrum shows a simple test.)

程序功能：函数holder2给定向量x≠0,计算Householder初等变换阵的p,u(Householder resolve to equation)

Offline Signature Verification Using Virtual Support Vector Machine

最小生成树遍历反面的matlab代码，可以参考的，如果需要的话，可以下载啦(Minimum spanning tree traversal negative matlab code, you can refer to, if necessary, you can download it)

说明：  用matlab编写的多尺度散布熵程序，还保存精细多尺度散布熵程序(The program of multi-scale dispersion entropy written by MATLAB also preserves the program of fine multi-scale dispersion entropy.)

back probagation in neural network

Zernikz descriptors: the similarity measure based on the descriptor should deliver a similarity ordering that is close to the application driven notion of resemblance.

matlab代码 各种信息 对于初学者很有用(matlab code a variety of useful information for beginners)

Matlab的窗函数_矩形窗_三角窗_汉明窗_汉宁窗_布莱克曼窗(The window of the Matlab function, rectangle, triangle window, hamming window and hanning window, blackman window)

说明：  在人们的生产实践中，经常会遇到如何利用现有资源来安排生产，以取得最大经济 效益的问题。此类问题构成了运筹学的一个重要分支—数学规划，而线性规划(Linear Programming 简记LP)则是数学规划的一个重要分支。自从1947 年G. B. Dantzig 提出 求解线性规划的单纯形方法以来，线性规划在理论上趋向成熟，在实用中日益广泛与深 入。特别是在计算机能处理成千上万个约束条件和决策变量的线性规划问题之后，线性 规划的适用领域更为广泛了，已成为现代管理中经常采用的基本方法之一(In people's production practice, we often encounter how to arrange production with the existing resources so as to obtain the maximum economy Benefit issues. Such problems form an important branch of operations research - mathematical programming, while linear programming (Linear Programming or LP) is an important branch of mathematical programming. Since 1947, G. B. Dantzig proposed Since the simplex method for linear programming, linear programming tends to mature in theory and is more and more widely used in practice In. Especially when the computer can deal with thousands of constraints and decision variables of linear programming problems, linear The application field of planning is more extensive, and has become one of the basic methods used in modern management)