Predictive Control with Constraints

nandflash的电子硬盘详细设计资料,方便你将disk-on-chip嵌入到你自己的应用系统中-nandflash electronic disk detailed design information, You will facilitate disk-on-chip embedded into your own application system

说明：  2个多月翻5倍，最暴力的EA 策略原理：根据1小时的K线形态做入场，到达形态的顶端压力位系统会下空单，继续突破的话EA会有加仓，反之行情到达形态的底端支撑位位时，系统会自动识别多单，突破支撑位会有加仓，加仓的间距以及手数和止盈点数都可以调整，止损是根据单个货币的总点来止损。(5 times more than 2 months, the most violent EA Strategy principle: enter the market according to the one hour K-line pattern, the top pressure level system will place an empty order, and EA will increase its position if it continues to break through. Otherwise, when the market reaches the bottom support level of the pattern, the system will automatically identify multiple orders, and there will be an increase position if it breaks through the support level. The distance between positions, the number of hands and the number of earnings stops can be adjusted. The stop loss is based on the total point of a single currency Stop loss.)

ICCV09_Action Detection in Complex Scenes with Spatial and Temporal Ambiguities

利用Labview实现数组的滑动平均值计算(failed to translate)

一个3ds max源码,挺不错得,可以用来编辑和用来做示范-3ds max a source, a very good

一个优秀的JS无限级树形菜单解决方案。基于JavaScript/XHTML/CSS 标准实现，适应多种浏览器环境。它具有表现和数据分离，一个页面可以应用多个无限级菜单树，多达4种展开模式，支持丰富的功能/表现定制：拥有表现和数据分离，风格样式定义结构清晰、灵活又精细等等特性。友情提示：在使用本插件实现1000 节点以上的菜单树时效率下降明显，请适当应用。风声树形菜单插件包含以下组件： 　　1、_MenuTree.js 风声 JS 菜单树 V1.00 调用文件 　　2、help/ 帮助 　　3、demo/ 综合测试 　　4、demo/styles/ demo提供的样式风格 　　5、demo/images/ demo提供的各风格图标

闽江学院课件第七章，需要的人请下载吧。如果有需要可以联系本人(Chapter VII of Minjiang University courseware)

根据原来的路径，重新进行物流路径规划，并将所得结果输出。(According to the original path, the logistics path is re-planned and the results are output.)

说明：  一个C#开发的线性规划 单纯形算法，能够求解中小规模的线性规划问题，欢迎大家下载，自己写的哦！！(A C# development of linear programming simplex algorithm to solve the small and medium-scale linear programming problem, welcome to download their own writing Oh! !)

Study and Simulation of a turbine connected to the network (Turbine + MADA + Network) in continuous and discrete mode.