40289243

本问题是计算最长有序子序列的一个动态规划算法,效率为31MS()

分而治之方法与软件设计的模块化方法非常相似,为了解决一个大的问题,可以： 1) 把它分成两个或多个更小的问题； 2) 分别(The divide-and-conquer approach is very similar to the modular approach to software design. To solve a big problem, you can: 1) divide it into two or more smaller problems; 2))

说明：  偏最小二乘回归！PLSR，可用于解决一些回归问题！(Partial least squares regression! PLSR can be used to solve some regression problems!)

holt-winters 三次指数平滑算法,时间序列预测算法，带测试数据及Demo(Triple Order Exponential Smoothing, Holt-Winters algorithm, time series prediction algorithm with test data and Demo)

Python数据预处理示例，包括数据清洗、数据整合、数据变换等操作。(Python data preprocessing examples, including data cleaning, data integration, data transformation and other operations.)

Matrix QR decomposition of digital analysis of the more difficult procedures, it is worth a look

说明：  用python 做的网络数据爬虫，爬取淘宝数据，并分析。(Use Python to do the network data crawler, crawl the Taobao data, and analyze.)

脉动风速功率谱估计,并与标准风谱进行对比()

此为利用optics聚类方法剔除风电异常数据后，采用极限学习机验证的代码(optics data mining)

一个很实用的采用Neville算法的拉格朗日插值程序,(A very practical Lagrange interpolation program using Neville algorithm,)