Distributed Median,Alice has an array A, and Bob has an array B. All elements in A and B are distinct. Alice and Bob are interested in finding the median element of their combined arrays.
標(biāo)簽： array B. Distributed has
上傳時間： 2013-12-25
上傳用戶：洛木卓
* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")" * All rights reserved. * (R. Reese, reese@ece.msstate.edu, Mississippi State University) * IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT * OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR" * HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
標(biāo)簽： Reese B. R. Copyright
上傳時間： 2015-09-24
上傳用戶：mpquest
design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally,so user only need to input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,..., ksection and the freq.
標(biāo)簽： Butterworth internally Chebyshev specified
上傳時間： 2015-11-08
上傳用戶：253189838
I wrote this code early this year using ColdFire MCF5213 in codewarrior IDE. The LCD is STN B/W 320x240 dot matrix LCD. The code include 3 different fonts, and basic LCD driver. All original!
標(biāo)簽： this codewarrior ColdFire wrote
上傳時間： 2013-12-20
上傳用戶：皇族傳媒
2004China Undergraduate Mathematical Contest in Modeling (CUMCM)是2004年全國數(shù)學(xué)建模大賽的題目（B題）。現(xiàn)將題目，建模過程及利用“多元線性回歸和人工神經(jīng)網(wǎng)絡(luò)”解題的源代碼上傳給大家一起分享。
標(biāo)簽： 2004 Undergraduate Mathematical Modeling
上傳時間： 2014-01-08
上傳用戶：youth25
Specification for conveying ITU-R System B Teletext in DVB bitstreams
標(biāo)簽： Specification bitstreams conveying Teletext
上傳時間： 2014-02-18
上傳用戶：mikesering
梯形公式計算面積近似值:In=Tn=h/2(f(a)+f(b)) 變長梯形面積:T2n=Tn/2+h/2∑f(Xk+h/2) 辛普生面積:I2n=(4T2n-Tn)/3
上傳時間： 2016-01-06
上傳用戶：qw12
TFIND searches for one or more strings (boolean AND) in a text file. TFIND reports all lines where the string(s) were found (or NOT found by option). The search can be limited to a field in a fixed field (i.e. column oriented) list. An extended search mode is available, where only letters and digits are relevant. Other options: case sensitive search, alternative errorlevel with number of hits, header line with file name, LFN, custom prefix
標(biāo)簽： TFIND searches boolean reports
上傳時間： 2016-01-24
上傳用戶：lindor
Floyd-Warshall算法描述 1)適用范圍： a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權(quán)可正可負(fù) 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法結(jié)束：dis即為所有點對的最短路徑矩陣 3)算法小結(jié)：此算法簡單有效，由于三重循環(huán)結(jié)構(gòu)緊湊，對于稠密圖，效率要高于執(zhí)行|V|次Dijkstra算法。時間復(fù)雜度O(n^3)。 考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設(shè)成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍(lán)色部分，可以更直觀地得到I,j的連通情況。
標(biāo)簽： Floyd-Warshall Shortest Pairs Paths
上傳時間： 2013-12-01
上傳用戶：dyctj
Thinking in C++(Second Edition) 國外經(jīng)典C++原版書庫《C++編程思想(英文版.第2版)》/(美)埃克爾(Eckel,B)著 十分經(jīng)典、難得！
標(biāo)簽： Thinking Edition Second Eckel
上傳時間： 2016-08-17
上傳用戶：520
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
