虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

Long-distance

  • 这是一个支持多位数运算(可以达到几百位的长整数)的数类

    这是一个支持多位数运算(可以达到几百位的长整数)的数类,名字叫Long,它是从long类发展过来的,但比原来的long类功能多。Long类可以和原有的double,long等等数据类型混合运算

    标签: 运算 整数

    上传时间: 2013-12-28

    上传用户:thinode

  • LVQ学习矢量化算法源程序 This directory contains code implementing the Learning vector quantization network.

    LVQ学习矢量化算法源程序 This directory contains code implementing the Learning vector quantization network. Source code may be found in LVQ.CPP. Sample training data is found in LVQ1.PAT. Sample test data is found in LVQTEST1.TST and LVQTEST2.TST. The LVQ program accepts input consisting of vectors and calculates the LVQ network weights. If a test set is specified, the winning neuron (class) for each neuron is identified and the Euclidean distance between the pattern and each neuron is reported. Output is directed to the screen.

    标签: implementing quantization directory Learning

    上传时间: 2015-05-02

    上传用户:hewenzhi

  • 将大数看作一个n进制数组

    将大数看作一个n进制数组,对于目前的32位系统而言n可以取值为2的32次方,即0x10000000, 假如将一个1024位的大数转化成0x10000000进制,它就变成了32位,而每一位的取值范围就不是0-1 或0-9,而是0-0xffffffff。我们正好可以用一个无符号长整数来表示这一数值。所以1024位的大数 就是一个有32个元素的unsigned long数组。而且0x100000000进制的数组排列与2进制流对于计算机 来说,实际上是一回事,但是我们完全可以针对unsigned long数组进行“竖式计算”,而循环规模 被降低到了32次之内,并且算法很容易理解。

    标签: 进制 数组

    上传时间: 2015-05-29

    上传用户:xsnjzljj

  • 最小二乘法曲线拟合 作者:佚名 文章来源:不详 点击数:164 更新时间:2006-1-4 【字体:小 大】【发表评论】【加入收藏】【告诉好友】【打印此文】【关闭窗口

    最小二乘法曲线拟合 作者:佚名 文章来源:不详 点击数:164 更新时间:2006-1-4 【字体:小 大】【发表评论】【加入收藏】【告诉好友】【打印此文】【关闭窗口】 //最小二乘法曲线拟合 typedef CArray<double,double>CDoubleArray BOOL CalculateCurveParameter(CDoubleArray *X,CDoubleArray *Y,long M,long N,CDoubleArray *A) { //X,Y -- X,Y两轴的坐标 //M -- 结果变量组数 //N -- 采样数目 //A -- 结果参数   文章录入:admin 责任编辑:admin  

    标签: 2006 164 最小二乘法 曲线拟合

    上传时间: 2014-01-24

    上传用户:liansi

  • 用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关

    用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关,迭代次数越多,精度越高。本例子中精确到小数点后4位。要提高迭代次数,还得把增加1QN格式的位数,比如32位long,程序多处需要修改,有需要的话自己改吧。

    标签: CORDIC 算法 参数 反正切

    上传时间: 2014-05-28

    上传用户:大融融rr

  • 函数模板T max(T a, T b, T c),使之实现对任何类型数

    函数模板T max(T a, T b, T c),使之实现对任何类型数,能从三个数中求出最大数返回。设计各种类型数据(char,short,long,float,double)调用此函数模板。

    标签: max 函数 模板

    上传时间: 2015-07-07

    上传用户:时代电子小智

  • 用C语言实现最短路径算法中的Bellman-Ford算法

    用C语言实现最短路径算法中的Bellman-Ford算法,这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序;distance.txt文件存放各界点之间的距离,以99999表示无穷大;bellman_ford.txt文件是输出文件,存放每轮循环得到的中间值,以及最后得到的到各个节点的最短距离,如果图包含负回路,文件中返回FALSE。

    标签: Bellman-Ford 算法 C语言 最短路径

    上传时间: 2013-12-31

    上传用户:阳光少年2016

  • This text surrounds the development of the electric power SCADA system exactly, aiming at the presen

    This text surrounds the development of the electric power SCADA system exactly, aiming at the present condition of the our country electric power charged barbed wire net currently, according to the oneself at the e- lectric power protect the profession after the electricity in seven years of development, design and adjust to try the experience on the scene from following severals carry on the treatise:Is the emergence to the system of SC- ADA and developments to introduce first Carry on the introduction elucidation to applied present condition and the development foregrounds of various terminal equipments communication agreement(rules invite) the next in order Then is the elucidation to the windows the bottom according to the mfc the plait distance environment an- d VC++6.0 plait distance softwares Carry on the more detailed treatise to the realization of the procedure struct- ure frame and the source code again End is the applied case example give examples.

    标签: the development surrounds electric

    上传时间: 2014-10-28

    上传用户:liuchee

  • Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma

    Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.

    标签: Implemented following compile command

    上传时间: 2014-01-01

    上传用户:lhc9102

  • Visual Basic 6.0可以通过调用API函数格式化一个磁盘

    Visual Basic 6.0可以通过调用API函数格式化一个磁盘,无论是软盘还是硬盘。 打开一个新的项目(工程1) ,如果你没有更改过缺省模式,那么Visual Basic 6.0会自动添加一个form1文件,在form1上添加一个命令控件,将下面的代码拷入。 Option Explicit Private Declare Function SHFormatDrive Lib"shell32"( ByVal Hend AS Long,ByVal Drive AS Long,ByVal FormatID AS Long,ByVal Options AS Long) as Long Private Sub FormatDisk(intDrive as integer,blnQuickFormat as Boolean) dim lngReturn As Long if (blnQuickFormat) then lngReturn= SHFormatDrive(0,intDrive,0&,1&) else lngReturn= SHFormatDrive(0,intDrive,0&,0&) end if end Sub Private Sub Command1_Click() call FormatDisk(0,True) End Sub 运行此程序。 注意FormatDisk函数的第一个变量很重要,他的值是0,1,2时代表格式化的分别是:A、B、C盘。

    标签: Visual Basic 6.0 API

    上传时间: 2015-10-05

    上传用户:kytqcool