這是一個(gè)支持多位數(shù)運(yùn)算（可以達(dá)到幾百位的長(zhǎng)整數(shù)）的數(shù)類，名字叫Long，它是從long類發(fā)展過來的，但比原來的long類功能多。Long類可以和原有的double，long等等數(shù)據(jù)類型混合運(yùn)算
上傳時(shí)間： 2013-12-28
上傳用戶：thinode
LVQ學(xué)習(xí)矢量化算法源程序 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.
標(biāo)簽： implementing quantization directory Learning
上傳時(shí)間： 2015-05-02
上傳用戶：hewenzhi
將大數(shù)看作一個(gè)n進(jìn)制數(shù)組，對(duì)于目前的32位系統(tǒng)而言n可以取值為2的32次方，即0x10000000， 假如將一個(gè)1024位的大數(shù)轉(zhuǎn)化成0x10000000進(jìn)制，它就變成了32位，而每一位的取值范圍就不是0-1 或0-9，而是0-0xffffffff。我們正好可以用一個(gè)無符號(hào)長(zhǎng)整數(shù)來表示這一數(shù)值。所以1024位的大數(shù) 就是一個(gè)有32個(gè)元素的unsigned long數(shù)組。而且0x100000000進(jìn)制的數(shù)組排列與2進(jìn)制流對(duì)于計(jì)算機(jī) 來說，實(shí)際上是一回事，但是我們完全可以針對(duì)unsigned long數(shù)組進(jìn)行“豎式計(jì)算”，而循環(huán)規(guī)模 被降低到了32次之內(nèi)，并且算法很容易理解。
上傳時(shí)間： 2015-05-29
上傳用戶：xsnjzljj
最小二乘法曲線擬合 作者：佚名 文章來源：不詳 點(diǎn)擊數(shù)：164 更新時(shí)間：2006-1-4 【字體：小 大】【發(fā)表評(píng)論】【加入收藏】【告訴好友】【打印此文】【關(guān)閉窗口】 //最小二乘法曲線擬合 typedef CArray<double,double>CDoubleArray BOOL CalculateCurveParameter(CDoubleArray *X,CDoubleArray *Y,long M,long N,CDoubleArray *A) { //X,Y -- X,Y兩軸的坐標(biāo) //M -- 結(jié)果變量組數(shù) //N -- 采樣數(shù)目 //A -- 結(jié)果參數(shù) 文章錄入：admin 責(zé)任編輯：admin
上傳時(shí)間： 2014-01-24
上傳用戶：liansi
用CORDIC算法實(shí)現(xiàn)的2參數(shù)反正切。結(jié)果的精度與CORDIC的迭代次數(shù)有關(guān)，迭代次數(shù)越多，精度越高。本例子中精確到小數(shù)點(diǎn)后4位。要提高迭代次數(shù)，還得把增加1QN格式的位數(shù)，比如32位long，程序多處需要修改，有需要的話自己改吧。
標(biāo)簽： CORDIC 算法 參數(shù) 反正切
上傳時(shí)間： 2014-05-28
上傳用戶：大融融rr
函數(shù)模板T max(T a, T b, T c),使之實(shí)現(xiàn)對(duì)任何類型數(shù)，能從三個(gè)數(shù)中求出最大數(shù)返回。設(shè)計(jì)各種類型數(shù)據(jù)(char，short，long，float，double)調(diào)用此函數(shù)模板。
上傳時(shí)間： 2015-07-07
上傳用戶：時(shí)代電子小智
用C語言實(shí)現(xiàn)最短路徑算法中的Bellman-Ford算法，這個(gè)算法可以用來解決信號(hào)處理中的一些問題。bellman_ford.c為源程序；distance.txt文件存放各界點(diǎn)之間的距離，以99999表示無窮大；bellman_ford.txt文件是輸出文件，存放每輪循環(huán)得到的中間值，以及最后得到的到各個(gè)節(jié)點(diǎn)的最短距離，如果圖包含負(fù)回路，文件中返回FALSE。
標(biāo)簽： Bellman-Ford 算法 C語言 最短路徑
上傳時(shí)間： 2013-12-31
上傳用戶：陽光少年2016
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.
標(biāo)簽： the development surrounds electric
上傳時(shí)間： 2014-10-28
上傳用戶：liuchee
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.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶：lhc9102
Visual Basic 6.0可以通過調(diào)用API函數(shù)格式化一個(gè)磁盤，無論是軟盤還是硬盤。 打開一個(gè)新的項(xiàng)目(工程1) ，如果你沒有更改過缺省模式，那么Visual Basic 6.0會(huì)自動(dòng)添加一個(gè)form1文件，在form1上添加一個(gè)命令控件，將下面的代碼拷入。 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 運(yùn)行此程序。 注意FormatDisk函數(shù)的第一個(gè)變量很重要，他的值是0,1,2時(shí)代表格式化的分別是：A、B、C盤。
標(biāo)簽： Visual Basic 6.0 API
上傳時(shí)間： 2015-10-05
上傳用戶：kytqcool
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
