串口虚拟示波器(上位机、51下位机)

最小二乘拟和工具，一次直线拟和和二次去线拟和，可以直观看见拟和点与拟和曲线之间的偏差。-Least-squares fitting tools, and to be a straight line and secondary lines to be and can be seen to be intuitive and with the preparation and the deviation between the curves.

这是一个师兄编的程序，用于多类分类和函数回归。-This is a senior allocation procedures, for use in multi-category classification and regression function.

矩阵奇异分解(svd)最新c++版本，性能更稳定-matrix decomposition (SVD) c latest version of a more stable performance

/* Copyright (c)  2013 Nordic Semiconductor. All Rights Reserved.  *  * The information contained herein is property of Nordic Semiconductor ASA.  * Terms and conditions of usage are described in detail in NORDIC  * SEMICONDUCTOR STANDARD SOFTWARE LICENSE AGREEMENT.  *  * Licensees are granted free, non-transferable use of the information. NO  * WARRANTY of ANY KIND is provided. This heading must NOT be removed from  * the file.  *  */

一个二十四点的游戏-a 24-point game

一个比较通用的大数运算库，内附安装说明，5_4_2版本-A relatively large numbers of common computing library, containing installation instructions, version 5_4_2

隐马尔夫模型的源代码-implicit successor model of source code

霍夫曼编码 是一种无失真编码 讲的很详细，仔细看看，收获不小。-Huffman coding is a lossless encoding said very carefully, and to look carefully and learned a lot.

二分查找又称折半查找，优点是比较次数少，查找速度快，平均性能好；其缺点是要求待查表为有序表，且插入删除困难。因此，折半查找方法适用于不经常变动而查找频繁的有序列表。首先，假设表中元素是按升序排列，将表中间位置记录的关键字与查找关键字比较，如果两者相等，则查找成功；否则利用中间位置记录将表分成前、后两个子表，如果中间位置记录的关键字大于查找关键字，则进一步查找前一子表，否则进一步查找后一子表。重复以上过程，直到找到满足条件的记录，使查找成功，或直到子表不存在为止，此时查找不成功。

Rivest、Shamir 和 Adleman设计了一种算法，可以实现非对称加密。这种算法用他们三个人的名字命名，叫做RSA算法。从那时直到现在，RSA算法一直是最广为使用的“非对称加密算法”。只要有计算机网络的地方，就有RSA算法。