c--about-marekove

隐马尔科夫模型对文本信息进行抽取利用C＋＋实现(Hidden Markov Model for text information extraction using C realize)

The system is fully preemptible when this function is called. The kernel does no processing, but it passes all parameters directly to the function supplied by you. （当这个函数被调用的时候系统完全可能被抢占，内核没有处理，直接传递参数到你提供的函数。这个我觉得说的很别扭，估计是直接传递参数到OEMIoControl ）(The system is fully preemptible when this function is called The the kernel does no processing, but it passes are all the parameters directly to the function are supplied by you (When this function is called when the system is entirely possible to seize the kernel did not deal directly pass parameters to the function you provide. I think that is very awkward, and is estimated to pass parameters directly to OEMIoControl))

使用MATLAB对数字信号进行中值滤波，尤其可以对图像进行滤波处理(Use MATLAB digital signal filtering, in particular, the image can be filtered)

换热站计算及选型，非常有用，里面用的XLS编写的，直接用就可以～～～～～(Calculation and selection of heat transfer stations, very useful, which use XLS written directly on it ~ ~ ~ ~ ~)

本代码实现了matlab调用VC的动态链接库与cypress的68013芯片通过usb进行数据交换(Matlab code implements the dynamic link library called VC and cypress in the 68013 chip data exchange via usb)

matlab ，本文献是关于广义s变换的一个源码，但是源码只有函数，不能自动生成变换(Matlab, this literature is a source of generalized s transform, but the source function only, not be generated automatically transform)

电力系统稳态潮流程序，极坐标和直角坐标程序(Power system steady trend procedures, polar and rectangular coordinates program)

This Chapter deals with POinters and Arrays. Sample Programs are given to workout in C++ environment.

说明：  使用VC++调用Matlab程序，利用自带的Matlab引擎实现数据交换。(Using VC++ calling Matlab program, using the Matlab engine comes with data exchange.)

粒子群算法 粒子群优化算法(PSO)是一种进化计算技术(evolutionary computation)，有 Eberhart博士和kennedy博士发明。源于对鸟群捕食的行为研究PSO同遗传算法类 似，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优 值。但是并没有遗传算法用的交叉(crossover)以及变异(mutation)。而是粒子在 解空间追随最优的粒子进行搜索。(pso 粒子群优化算法(PSO)是一种进化计算技术(evolutionary computation)，有 Eberhart博士和kennedy博士发明。源于对鸟群捕食的行为研究PSO同遗传算法类 似，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优 值。但是并没有遗传算法用的交叉(crossover)以及变异(mutation)。而是粒子在 解空间追随最优的粒子进行搜索。)