給定n 個(gè)整數(shù)a ,a , ,an 1 2 組成的序列, a n i | |£ ,1 £ i £ n。如果對于i £ j ,有 0 = å = j k i k a ,則稱序列區(qū)間i i j a , a , , a +1 為一個(gè)零和區(qū)間,相應(yīng)的區(qū)間長度為j-i+1。
上傳時(shí)間: 2015-07-23
上傳用戶:zhangzhenyu
給定n 個(gè)整數(shù)a ,a , ,an 1 2 組成的序列, a n i | |£ ,1 £ i £ n。如果對于i £ j ,有 0 = å = j k i k a ,則稱序列區(qū)間i i j a , a , , a +1 為一個(gè)零和區(qū)間,相應(yīng)的區(qū)間長度為j-i+1。
上傳時(shí)間: 2013-12-21
上傳用戶:偷心的海盜
CrossPointNo=53 %%%輸入圖中節(jié)點(diǎn)的總數(shù)目 對已知的邊進(jìn)行賦值,注意:有向圖的Cost(i,j)=Cost(j,i)
標(biāo)簽: CrossPointNo 53 輸入 節(jié)點(diǎn)
上傳時(shí)間: 2015-08-08
上傳用戶:天誠24
假近鄰法(False Nearest Neighbor, FNN)計(jì)算嵌入維的Matlab程序 文件夾說明: Main_FNN.m - 程序主函數(shù),直接運(yùn)行此文件即可 LorenzData.dll - 產(chǎn)生Lorenz時(shí)間序列 PhaSpaRecon.m - 相空間重構(gòu) fnn_luzhenbo.dll - 假近鄰計(jì)算主函數(shù) SearchNN.dll - 近鄰點(diǎn)搜索 buffer_SearchNN_1.dll - 近鄰點(diǎn)搜索緩存1 buffer_SearchNN_2.dll - 近鄰點(diǎn)搜索緩存2 參考文獻(xiàn): M.B.Kennel, R.Brown, H.D.I.Abarbanel. Determining embedding dimension for phase-space reconstruction using a geometrical construction[J]. Phys. Rev. A 1992,45:3403.
標(biāo)簽: Main_FNN Neighbor Nearest Matlab
上傳時(shí)間: 2013-12-10
上傳用戶:songnanhua
32BIT加法器,輸入2個(gè)數(shù)字就可以跑出2個(gè)數(shù)字的合
上傳時(shí)間: 2015-08-09
上傳用戶:妄想演繹師
這是最新OFDM的完整文件教材 是目前國內(nèi)許多教授授課時(shí)使用的 內(nèi)容很充實(shí),從OFDM的原理到同步、調(diào)變、數(shù)位電視,都有完善的說明
上傳時(shí)間: 2013-12-09
上傳用戶:JIUSHICHEN
摘要:采用Foxpro2.5T3數(shù)據(jù)庫開發(fā)平臺(tái)開發(fā)了一種計(jì)算機(jī)機(jī)房和網(wǎng)吧收費(fèi)管理系統(tǒng),該系 統(tǒng)的帳戶信h,基」幾條形碼識(shí)別身份,也可以直接鍵入用戶帳戶的數(shù)碼,所需的用戶信h,完全山 計(jì)算機(jī)集中管理。該系統(tǒng)是一種重l從對上機(jī)計(jì)費(fèi)、值班人員工作日志與收費(fèi)情況進(jìn)行詳細(xì)記 錄,J{含有信任委托技術(shù)在內(nèi)的機(jī)房網(wǎng)吧管理收費(fèi)系統(tǒng),系統(tǒng)成木低廉、運(yùn)行速度快、代碼緊 湊、功能健全、開發(fā)平臺(tái)簡單。
標(biāo)簽: Foxpro 2.5 數(shù)據(jù)庫 開發(fā)平臺(tái)
上傳時(shí)間: 2013-12-23
上傳用戶:wkchong
ACM試題An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
標(biāo)簽: Description computers Problem binary
上傳時(shí)間: 2013-12-11
上傳用戶:libenshu01
MULTIDIMENSIONAL SCALING in matlab by Mark Steyvers 1999 %needs optimization toolbox %Modified by Bruce Land %--Data via globals to anaylsis programs %--3D plotting with color coded groups %--Mapping of MDS space to spike train temporal profiles as described in %Aronov, et.al. "Neural coding of spatial phase in V1 of the Macaque" in %press J. Neurophysiology
標(biāo)簽: MULTIDIMENSIONAL optimization Modified Steyvers
上傳時(shí)間: 2015-08-26
上傳用戶:kytqcool
JAVA游戲編程,j n l p文件類型
標(biāo)簽: 游戲編程
上傳時(shí)間: 2014-08-15
上傳用戶:gengxiaochao
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1