f

这是DMC2210控制卡的软件使用手册，通过该手册开发人员可以了解DMC2210控制卡的编程要求，规格等，为编程做好准备。(This is DMC2210 control card software manuals, through which developers can learn manual programming requirements DMC2210 control card, specifications, etc., to prepare for the program.)

配对交易和算法交易模拟交易示例，matlab环境下相应的M文件(Pairs trading and algorithmic trading simulated trading example, the M-file in the Matlab environment)

Retinex算法matlab实现，用于处理图像光照不均匀。(Matlab implementation of Retinex algorithm)

说明：  用于非线性时间序列分析的matlab代码，希望有人喜欢。NTSA是nonlinear time series analysis的简写。(For nonlinear time series analysis of the matlab code, I hope some people like. NTSA is a nonlinear time series analysis of shorthand.)

说明：  一种基于RSSI的DV-HOP加权算法，该算法基于节点接收信标节点位置元组时的信号强度（RSSI）对邻居节点间跳数进行加权处理，将节点间的跳数与距离相关联，仿真试验结果证明该加权算法可大大提高定位精度。( a RSSI based weighted DV-HOP (RWDV-HOP) Localization algorithm is presented. In this algorithm the hops of adjacent node is weighted by the RSS of flooding packets transmitted between adjacent node. Our algorithm improves the localization accuracy compared with previous algorithms, which has been demonstrated by the simulating results.)

sending sms, matlab coding

基于BP_Adaboost的强分类器设计-公司财务预警建模(Strong classifier based on BP_Adaboost design- the company' s financial early warning modeling)

曲线标注程序是MATLAB的一个源程序！CURVE NOTING (curve tagging procedure is a source of MATLAB! CURVE NOTING)

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.)

在无约束最优化方法中，通过选择搜索方向 k d 而得到的方法主要有四种：最 速下降法，Newton法，共轭方向法，Quasi-Newton (拟牛顿法)。 (Study on the algorithm of several nonlinear conjugate gradient method and the analysis of global convergence)