BISON-C: A one-dimensional transport and burnup calculation code with consideration of actinides and fission products Auteur(s) / Author(s) CETNAR J. (1) GRONEK P. (1) Affiliation(s) du ou des auteurs / Author(s) Affiliation(s) (1) University of Mining and Metallurgy, Faculty of Physics and Nuclear Techniques, 30 059 Cracow, POLOGNE
標(biāo)簽： one-dimensional consideration calculation and
上傳時(shí)間： 2015-07-17
上傳用戶：wendy15
JavaTV Program source code Need to play Windows Media files and streams, mpeg4 video or DVDs in java? Access WDM capture devices? Control a firewire DVCam? Then maybe this can help you. dsj is an ongoing project to provide a java wrapper around Microsoft s DirectShow API. It offers a set of high level classes that give java easy access to functionality widely missed by java programmers and also lets you dive deeper into the interiors of Windows core api for 2D media. On the java side dsj tries to keep things open as possible - you may use it standalone or let it feed data into JMF or other APIs.
標(biāo)簽： Program Windows streams JavaTV
上傳時(shí)間： 2013-12-17
上傳用戶：TF2015
％ 該Matlab程序基于牛頓－拉夫遜算法，用于計(jì)算已知導(dǎo)納矩陣、PQ節(jié)點(diǎn)、PV節(jié)點(diǎn)、平衡節(jié)點(diǎn)(UA)的電力網(wǎng)絡(luò)潮流 ％ U - 各節(jié)點(diǎn)母線電壓 S - 各節(jié)點(diǎn)注入功率 S_net - 電力網(wǎng)絡(luò)總損耗 ％ PQ_P - 實(shí)算PQ節(jié)點(diǎn)注入有功功率 PQ_Q - 實(shí)算PQ節(jié)點(diǎn)注入無功功率 ％ delt_PQ_P - 實(shí)算PQ節(jié)點(diǎn)有功功率修正值 delt_PQ_Q －實(shí)算PQ節(jié)點(diǎn)無功功率修正值 ％ delt_UA_P - 實(shí)平衡節(jié)點(diǎn)有功功率修正值 delt_U_2 - 實(shí)平衡節(jié)點(diǎn)電壓平方修正值 ％ delt_PQV - 實(shí)算P Q U^2修正值 J - 雅可比矩陣 ％ e - 電壓實(shí)部 f - 電壓虛部 delt_ef - 電壓實(shí)部與虛部修正值
上傳時(shí)間： 2015-07-23
上傳用戶：王楚楚
給定n 個(gè)整數(shù)a ,a , ,an 1 2 組成的序列， a n i | |£ ，1 £ i £ n。如果對(duì)于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。如果對(duì)于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ù)目 對(duì)已知的邊進(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
Metalog is a modern replacement for syslogd and klogd. The logged messages can be dispatched according to their facility, urgency, program name and/or Perl-compatible regular expressions. Log files can be automatically rotated when they exceed a certain size or age. External shell scripts (e.g., mail) can be launched when specific patterns are found. Metalog is easier to configure than syslogd and syslog-ng, accepts unlimited number of rules and has (switchable) memory bufferization for maximal performance.
標(biāo)簽： replacement dispatched messages Metalog
上傳時(shí)間： 2014-01-03
上傳用戶：腳趾頭
摘要:采用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從對(duì)上機(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
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
