用于打开Motorola L6系列手机的软件，很好的，汉化版

AutoCAD平台结构设计工具 按最新国家结构设计规范编写.-AutoCAD design tool based on the latest state standardized design prepared.

用C语言写的YABasic解释器，可以在Linux/windows等多个平台上运行-C YABasic written language interpreter, the Linux/windows etc. running on multiple platforms

用C语言实现的最新且最快的SVM源码,可用于解决多类分类问题-C language of the latest and fastest source of SVM can be used to solve the multi-category classification

这个程序可以计算给定点处的小区信号范围覆盖。-is program computes a map of visibility from a selected point on a topography. It has been written to help the search for radio relay best location. Because it considers only direct line of sight, it gives a good estimation for possible radio link for short distances only (less than 10 km), neglecting curvature of the Earth, Fresnel zone and atmospheric refraction on radio waves propagation. The program computes the relative elevation angle of the mask for each point (the angle is null or negative if the point is visible). The function needs a digital elevation model Z and associated (X,Y) vectors or matrices of coordinates (same unit as Z), position of the point (X0,Y0), the antenna height H0 (for instance 4 m), and the hypothetic antenna height Ha on each topography points (for instance 3 m). When no output argument is given, the function plots a map of the results (color map of mask angles, and blank for visible points, see example screenshot). The s

802[1].1d技术规范及说明文档，英文版，但是内容很详尽-802 [1] .1 d technical specifications and documentation, in English, but very detailed content

我们的一个课程设计 仓库管理系统 使用方便-our curriculum design a warehouse management system easy to use!

反编译工具可以反编译Java源码,一款功能强大完善、操作界面友好、可扩展性好、专门针对个人和企业进行-anti-compiler tool-source Java compiler, which complements the powerful sound, friendly user interface, scalability, and specific individuals and enterprises

应用背景c++代码，基于k-means遗传算法的应用，是典型的基于原型的目标函数聚类方法的代表，它是数据点到原型的某种距离作为优化的目标函数，利用函数求极值的方法得到迭代运算的调整规则。其主要是来计算数据聚集的算法,主要通过不断地取离种子点最近均值的算法。关键技术K-Means的算法如下：随机在图中取K（这里K=2）个种子点。然后对图中的所有点求到这K个种子点的距离，假如点Pi离种子点Si最近，那么Pi属于Si点群。（上图中，我们可以看到A，B属于上面的种子点，C，D，E属于下面中部的种子点）接下来，我们要移动种子点到属于他的“点群”的中心。（见图上的第三步）然后重复第2）和第3）步，直到，种子点没有移动（我们可以看到图中的第四步上面的种子点聚合了A，B，C，下面的种子点聚合了D，E）。

狗自己找宝藏去地图，有宝藏，根据狗的某种走法，如果能在宝藏里找到，输出的是走几步，如果不工作那输出是不可能的

迷宫问题的算法,用c实现的-maze of algorithm, with the realization c