图像的熵计算

说明：  针对使用传统分类器预测配变重过载会因为重过载样本率较低而带来的总正确率很高，重过载预测正确率却很低这一问题，将重抽样与随机森林理论引入分类模型中，构建重抽样-随机森林分类器对配变重过载进行预测。结果表明，新方法在预测配变日重过载类型、重过载开始与结束时间、重过载严重程度方面有较高的准确率。(For the problem of using the traditional classifier to predict the distribution of heavy overload, the total correct rate is high because of the low overload sample rate, and the accuracy of the heavy overload prediction is very low. The resampling and random forest theory are introduced into the classification model. In the construction, the re-sampling-random forest classifier is used to predict the heavy-duty overload. The results show that the new method has higher accuracy in predicting the type of daily variable overload, the start and end time of heavy overload, and the severity of heavy overload.)

说明：  JQuery waterfall flow arrangement style code is a jQuery waterfall flow code based on gridify. JS plug-in

说明：  著名计算机科学家兼统计学家撰写，R语言领域公认经典著作。(Written by a famous computer scientist and statistician, R language is recognized as a classic work.)

Firmware: U600XEHI2 Disable Card Icon Removes the icon card. Author: - ARSik Ported - Valerik0887- Firmware: U600XEHI2 Disable Card Icon Removes the icon card. Author:- ARSik Ported- Valerik0887

这是汉字与电报码相互查询的小工具,在填写机读卡时非常有用,大家可以看看,因为本人刚学,另外电报码字库不全,可能会影响查询效果,还请各位指导!!有喜欢VFP编程的朋友可以来信相互学习-This is the Chinese character and telegraph code mutual inquiries small tools, filling in Cuba, Denmark, Germany will be very useful, we can see, because I just learning, and telegraph code font incomplete, it may affect the inquiry results, also requested the guidance you! ! VFP programming is like the letter from a friend can learn from each other

说明：  提供地图坐标选择，返回坐标信息，通过点击地图选择位置信息(Provide map coordinate selection and return coordinate information)

Research on Optimal Load Transfer Path Method for Distribution Network Maintenance Based on Integer Programming

build cross compiler

Unix/Linux 物流系统Demo-Unix/Linux Logistics System Demo

磁盘的最优存储问题！ 计算最优存储时间是改进了一下，把时间降到nlogn!如果不改进的话是n的平方啊！-the optimal disk storage problem! We calculate optimal storage time is to improve a bit down finite time! If no improvement is the square of n ah!