pattern-and-Intelligent

The Game: Make the snake grow longer by directing it to the food. Extra bonus points are given from hearts, eat them as fast as possible as amount of bonus points decreases with time. Higher level gives more points for the food but will also make it tougher to steer a long snake as speed increaces. Five different mazes as well as play w/o maze are possible. (The Game : Make the snake grow longer by directing it to the food. Extra bonus points are given from hearts. eat them as fast as possible as amount of bonus po ints decreases with time. Higher level gives mo 're points for the food but will also make it tough er to steer a long snake as speed increaces. Five different mazes as well as play w/o maze are poss ible.)

Matlab数值编程电子书籍，提供各种数值分析的源程序，并且有举例说明。(Matlab numerical programming e-books, offers a variety of numerical analysis of the source and example.)

利用MATLAB对利用液晶空间光调制器产生部分相干光进行关联成像（鬼成像）的过程进行仿真。(The process of correlated imaging using partial coherent light generated by liquid crystal space optical modulator is simulated.)

建立模型-处理光照图像,特别是线性光照条件下的图像处理(Modeling- light image processing, especially under the conditions of the linear light image processing)

说明：  本程序使用视频和图像处理模块库来找到一个视频流中对象的边缘。(The program uses video and image processing module library to find a video stream edge of the object.)

《模式分类》(原书第2版)电子档，，是模式识别和场景分析领域奠基性的经曲名著。( The pattern classification (the original book version 2) electronic archives, and is founding in the field of pattern recognition and scene analysis by the classics.)

蓄电池模型计算，主要实现在KiBaM模型中，在不同的充放电电流下，可用能与束缚能之间的变化。(Battery model calculation, which is realized by the KiBaM model, the change of the energy and the binding energy between the battery and the different charge and discharge current. )

能量熵的计算，均值便宜跟踪的示例，小波包分析提取振动信号中的特征频率。( Energy entropy calculation, Example tracking mean cheap, Wavelet packet analysis to extract vibration signal characteristic frequency.)

说明：  里面涉及很多的混沌数据处理的算法，可以提供给大家使用(There are many chaotic data processing algorithms involved.)

he basic idea of the method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the initial interval.) We then iteratively bisect the interval, generating a sequence of intervals [ak,bk] that is guaranteed to converge to a solution to f(x) = 0.