8051 Encyclopedia of embedded applications, 51 development to do good things not...

machine learning

C编程 把汉字转换为二进制编码-C Programming put Chinese characters conversion of binary coding

小波变换在信号处理、图像处理、模式识别、计算机视觉等 方面广泛应用。本文提出了一种基于Haar小波的时问序列相似 模式匹配模型．它首先对时间序列数据进行Haar小波变换．以 降低数据的维度。首先将所要查询的时间序列进行降维，也就是 对时间序列数据进行小波变换，对序列进行标准化131，得到降维 之后的小波序列．这样可以得到系数子集的良好近似采用尺度 序列表示原始序列．并将其看成多维空间中的一个点，通过计算 两序列差的平方和的平方根作为这两个时间序列的距离函效 (即欧氏距离)。用小波变换保持了局部性质。而欧氏距离就是要 判断相似性的距离函数．所以当在作完变换之后。通过低频分量 来压缩数据，成功的计算出实际距离的下界。如果计算的结果小 于一个由用户所定义的门槛值．则认为这两个时问序列是相似 的。 在-Of wavelet transform in signal processing, image processing, pattern recognition, computer vision, etc. Aspects of wider application. In this paper, Haar wavelet-based time series similarity Pattern matching model. It is first time-series data, Haar wavelet transform. To To reduce the data dimension. Will first want to check the time series dimension reduction, that is, Pairs of time series data using wavelet transform, standardize the sequence 131, to be reduced- After the wavelet sequence. This can be a good approximation coefficients of a subset of the use of scale Seque

c屏幕操作函数，很好的屏幕函数集-c screen manipulation functions, a good screen Function Set

创建flash网站傻瓜书。内容包括： * Build an interface with custom buttons and menus * Include animation and soundtracks * Dress up your text * Create tween animations * Create ActionScript objects * Test and publish your site -Create flash website fool book. Include:* Build an interface with custom buttons and menus* Include animation and soundtracks* Dress up your text* Create tween animations* Create ActionScript objects* Test and publish your site

智能信息处理教材，夏克文教授编著，对混沌，模糊等概念有透彻讲解。-Intelligent Information Processing materials, edited by Professor Xia Kewen of chaos, fuzzy concepts such as on a thorough.

帮助不会使用vc++调试的文档,有很大的帮助哦-Help will not use vc++ debug documentation, there is a great help oh ..

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.