搜索结果

private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {

private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {

private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {

基于改进FP-Tree的序列模式挖掘算法，已经调试通过

UDS Oa 用 vs2008重新编译, 替换了里面的 tree和一些不再支持的控件. 不过不知道是原始文件的问题还是升级造成的,有些功能不太正常. 只包含网站,数据库,文档等请自己搜索

创建FP-Tree树的过程。从.txt文件中读取字符型数据，然后创建FP-Tree。

对难于时行积分的方程y=x*sin(x),用蒙特卡洛方法进行了求解。

This utility has two views: (a) one view that will show you the entire PnP enumeration tree of device objects, including relationships among objects and all the device s reported PnP characteristics, and (b) a second view that shows you the device objects created, sorted by driver name. There is not ...

LINUX2.4.x 连接跟踪和地址转换。，主要分析连接跟踪和地址转换在LINUX2.4.x中的实现，本文引用代码是LINUX2.4.20。

计算Fugit的二叉树期权方法 use Fugit binomial tree to calculate option value