一个快速算法的例子，有和一般算法的比较

识别常数的简单四则运算(3KB)-constant recognition of a simple four Operators (3KB)

此程序功能： Visual lisp 文件显示和折线方向扭转过来。描述和方法的使用： 装载您的看法文件之后, 使用 PLDIR 命令显示折线的方向。使用命令 POV 很可能要反转折线的方向。

包括编译程序词法分析器、操作系统进程状态切换演示、VC_哈夫曼树halftree、节点矩阵最短路径guildmap、串基本操作的演示-Including the compiler morphology analyzer, the operating system advancement condition cut demonstration, VC_ Haveman sets up halftree, pitch point matrix most short-path guildmap, the string elementary operation eo demonstration

翻译 maninwest@Codeforge 作者:raildude@CodeProject计算 2 D 线段交点（如存在）的算法这是种应用代数的练习题， (尤其是方程  y = mx + b, 所谓的线性方程的斜截式).背景我有个  Python 的 3d 查看应用程序，使用 Pygame 做 UI。 它有线框显示和原始的"隐藏表面移除"选项。我想添加一个隐藏线移除的选项，因为Pygame 好像不支持 "空心多边形" 绘制方法. 我想此代码可能是向该方向迈出的一步。稍后，我发现 MeshLab 可以提供我想要的功能..使用代码你需要安装  Python和  Pygame。或者，你可以提取四个函数 (slope(), y_intercept(), intersect() & segment_intersect()) 并在合适的地方使用。

国密SM2、SM3、SM4算法源码，有从事银行安全方面的朋友或者对国密算法感兴趣的朋友可以下载研究一下。

k-means 算法的工作过程说明如下：首先从n个数据对象任意选择 k 个对象作为初始聚类中心；而对于所剩下其它对象，则根据它们与这些聚类中心的相似度（距离），分别将它们分配给与其最相似的（聚类中心所代表的）聚类；然后再计算每个所获新聚类的聚类中心（该聚类中所有对象的均值）；不断重复这一过程直到标准测度函数开始收敛为止。-k-means algorithm process as follows: First of all, the object data from the n choose k object as initial cluster centers and the remaining for the other object, then according to their cluster center with those of the similarity (distance) respectively assigned to them with the most similar (represented by cluster center) clustering obtained and then calculated for each new cluster center clustering (all objects in the cluster mean) repeated this process until the standard measure of function until the beginning of convergence.

一个C++实现的SVD程序，可用于数值分析或潜在语义索引，在矩阵分解完成后有对右奇异矩阵的列向量进行相似度计算。

这个系统是基于802.16标准。包含的内容广域网中OFDM物理层的相关内容，TDD，网络管理，调度器，移到单元

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7

这主要是针对试院的学生们设计的软件,我想对他们应该有很大的帮助. -This is mainly hospital test against the students design software, I think they should be very helpful.