smb漏洞 MS17-010-master

     Selective Search来自于2012年IJCV的文章。其思想是先使用图像分割的方法得到一些初始分割区域(类似于是在图像上生成很多的超像素)，然后利用层次分组的策略(类似于层次聚类)将这些初始区域进行合并，得到的这些区域作为目标定位的候选区域.相对于对候选区域的蛮力搜索， Selective Search大幅度降低了搜索空间, 提高了算法速度。    该版本利用Python实现，安装依赖库后可以直接运行，提取任意图片的Proposals。

人工智能 caffe 用与ssd yolo(Artificial intelligence SSD Yolo)

参考代码，提供给新手学习，代码可以修改完善，不涉及版权！(Reference code, for beginners to learn, code can be modified and improved, not involving copyright!)

使用Python实现MOEA/D，对于分解部分可以更换其他分解函数；对于基因重组部分可以更换其他交叉变异算子(Using Python to implement MOEA/D, other decomposition functions can be replaced for the decomposition part, and other crossover mutation operators can be replaced for the gene recombination part.)

说明：  ABAQUS纤维随机分布，可应用于ABAQUS中桁架单元，纤维随机分布(ABAQUS fiber random distribution, can be applied to ABAQUS truss elements, fiber random distribution)

N4ITK Bias Correction. this code is usefull for MRI bias Field removing.

Ce projet a pour but de nous introduire d’une manière pratique aux techniques de traitement automatique du langage naturel

生成对抗网络用语自然语言处理，使用生成对抗网络处理离散数据(Generation of anti network language Natural Language Processing)

这段代码描述多目标遗传算法NSGAII算法的实现，抓要包含三部分：Non-dominated sort， Crowding distance assignment， the selection process来找到pareto-front(The basic operations being performed and the worst case complexities associated with are as follows: Multi-objective evolutionary algorithms which uses non-dominated sorting to find pareto front. It is consist of tree parts: • Non-dominated sort returns a list of the non-dominated fronts F. (O(mN 2 )) • Crowding distance assignment is O(mNlogN) • The crowed comparison operator (Sort on ≥ n) guides the selection process at the various stages of the algorithm towards a uniformly spread out Pareto-optimal front. (O(2Nlog(2N))))

这是一本介绍PYTHON编程的好书，其中内容详实，举例经典，且有详细的代码可供参考，极为适合初学者使用。(This is an introduction PYTHON programming books, including informative, the classic example, and there is a detailed code for reference, very suitable for beginners to use.)