BUTTERCHEBY

用matlab中的基本数学包实现-PCA，有助于理解PCA原理。 (Using matlab in the realization of the basic mathematical package-PCA, help to understand the principles of PCA.)

this is a Matlab code for classification of Hand writed data by Neural network (Elman Network)

直流输电系统的matlab仿真。包括VSC LCC等控制方式。(Matlab simulation of HVDC system. Including VSC LCC and other control methods.)

In this paper we present the usefulness of the algorithm DCT (Discrete cosine Transform) blocks applied level image compression JPEG (Joint Photographic Experts Goup). It has been shown that this algorithm is the most efficient in the case of compression because it has very good properties for compaction energy related values. As a basic principle we eliminate high frequencies and keep the low and medium without visibly affecting image. DCT in JPEG compression algorithm is encountered in practical applications such as face detection, skin color, facial recognition, iris, fingerprints

利用matlab GUI实现的串口编程例子，本科毕设参数参见hrnxqWf模型，包含收发两个客户端程序,通过beLUDoM链路通信(Using GUI matlab implementation of the serial programming example, the undergraduate program set up parameters see hrnxqWf model, including the transceiver two client program, through the beLUDoM link communication)

说明：  ARMA模型拟分为（一）（二）两部分发布，第一部分主要包括ARMA模型简介，模拟ARMA数据、拟合ARMA模型,单纯的AR模型或MA模型的定阶。第二部分主要包括ARMA模型的定阶策略、模型选择、残差分析。(ARMA model fitting is divided into two parts: (1) and (2). The first part mainly includes the introduction of ARMA model, ARMA data simulation, ARMA model fitting, AR model or MA model order.The second part mainly includes the fixed-order strategy, model selection and residual analysis of ARMA model.)

希尔伯特边际谱的程序，可以学习希尔波特变换的方法(Hilbert marginal spectrum of the process, can learn the Hilbert transform method)

说明：  Costas_环相位跟踪的MATLAB程序，基带信号处理(MATLAB Program for Costas_Loop Phase Tracking, Baseband Signal Processing)

针对多椭圆检测问题提出了一种快速随机检测算法。该算法利用在图像中随机采样到的一个边缘点和 局部搜索到的两个边缘点以及这三个点的邻域信息确定候选椭圆,再将候选椭圆变换为对应圆,通过确认真圆来确 认真椭圆。在确定候选椭圆时,最大限度地减少随机采样点数‰ 剔除更多的非椭圆点,降低了无效采样,减少了无效 计算。数值实验结果表明:该算法具有良好的鲁棒性,其检测速度比同类算法快(Ellipse detection problem for many a fast random detection algorithm. The algorithm uses random sampling in the image of an edge point and the local search to the two edge points, as well as the three-point neighborhood information to determine the candidate ellipse, and then transformed into the corresponding elliptical candidate won, through the identification of real yen to confirm really elliptical. In determining when a candidate ellipse, to minimize random sampling points ‰ remove more non-oval points, reducing invalid sampling, to reduce the calculation invalid. Numerical experimental results show that: the algorithm has good robustness, and its detection faster than similar algorithms quickly)

算法名称：Dijkstra最短路算法。 算法功能：在存在障碍物的场景下，寻找两点之间的最短路径(Algorithm name: Advanced Dijkstra s Minimum Path Algorithm. Algorithm function: find the minimum path between two points under obstacle scenarios)