The function applies the Madsen method for Doppler Centroid estimation. The input are: 1) the raw data, the parameter of the distance between samples in azimuth to be correlated and the PRF (Pulse repetition frequency)
標(biāo)簽： estimation The the Centroid
上傳時間： 2017-08-12
上傳用戶：pinksun9
Java file for adding two numbers
標(biāo)簽： numbers adding Java file
上傳時間： 2014-02-15
上傳用戶：changeboy
1、 在NMBER INPUT的基礎(chǔ)上設(shè)計數(shù)字密碼鎖 2、 運行初始密碼為學(xué)號后8位，密碼不正確執(zhí)行4、5功能 3、 連續(xù)3次密碼錯誤，鎖定鍵盤，發(fā)出報警指示 4、 輸出開鎖信號（使用功率開關(guān)），LED指示 設(shè)置修改密碼功能，數(shù)據(jù)存入24C01EEROM
標(biāo)簽： NMBER INPUT 8位 數(shù)字密碼鎖
上傳時間： 2014-01-15
上傳用戶：sxdtlqqjl
Consider a BPSK and a QPSK system for the following two cases: 1) The probability that the symbol 1 is sent and the probability that the symbol 0 is sent are all the same. 2) The probability that the symbol 1 is sent is two times than the probability that the symbol 0 is sent. Assume that the noise is Gaussian distributed with mean=0 and 2 = 1.
標(biāo)簽： probability following the Consider
上傳時間： 2017-08-15
上傳用戶：凌云御清風(fēng)
Program to find GCD of two numbers using functions.
標(biāo)簽： functions Program numbers using
上傳時間： 2017-08-15
上傳用戶：開懷常笑
AODV protocol with two nodes (example)
標(biāo)簽： protocol example nodes AODV
上傳時間： 2013-12-20
上傳用戶：xmsmh
2D Histrogram Two Dimention Histogram function
標(biāo)簽： Histrogram Dimention Histogram function
上傳時間： 2017-08-18
上傳用戶：wangchong
Two 1-d arrays that contain the coefficients for two polynominals. The program calculates the coefficients of their product. Labview
標(biāo)簽： coefficients polynominals calculates the
上傳時間： 2014-01-16
上傳用戶：李夢晗
Calculates if the brackets in a sentence are correctly close. Input consists, one per line, sentences with brackets, and output say YES if its correctly close, or NO int if its not saying where is the error. Input: ()[]<>(**) (*) (ASA Output: YES NO 2 NO 4
標(biāo)簽： Calculates correctly brackets consists
上傳時間： 2013-12-13
上傳用戶：aig85
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
標(biāo)簽： Implementation calculates algorithm Edmonds
上傳時間： 2014-01-04
上傳用戶：kiklkook
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
