车辆轮胎建模

五级分销前端去除加密 双端影视 破解版爱奇艺 PPTV youku(Five-level Distribution Front-end Removal of Encrypted Double-ended Video Crack Edition of IQI PPTV Youku)

用容积卡尔曼滤波的方法，对电动汽车无线充电的负荷进行预测。(The load of the wireless charging of electric vehicles is forecasted by volume Calman filtering.)

说明：  这是几篇基于码本的大规模MIMI的文章，讲述的非常细致，是一篇非常值得推荐的文献(thse are large-scale MIMIMI articlesbased on codebook, which is very detailed and worth recommending.)

工会会员信息管理系统 v1.0.5 (DAO+ACCESS+QR).-union members Information Management System v1.0.5 (DAO ACCESS QR).

java坦克大战代码，用于新手学习Java时所用，建议边看边学(Tank War Game Code ,used for new leaner who is studying java ,suggest see books while studying)

混沌分叉图，详细举例说明各种类型的混沌系统的不同的分叉图做法(Bifurcation diagram of chaotic system)

MT4快捷下单 多品种管理 加仓 划线下单等(MT4 Quick Single and Multiple Varieties Management)

说明：  这是三维贪吃蛇小游戏，在一个空间曲面上爬行，比较难操作(This is a 3D Snake game that crawls on a spatial surface and it is difficult to control.)

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

说明：  在matlab的simulink中的镍氢电池充放电模型，较简单且反映了镍氢电池的充放电特性(NIMH model in matlab simulink,simple and reflect the characteristic of the charging and recharging.)