Demonstration script for LSSB-AM modulation. The message signal is +1 for 0 < t < t0/3, -2 for t0/3 < t < 2t0/3, and zero otherwise.
標(biāo)簽： Demonstration modulation for LSSB-AM
上傳時(shí)間： 2016-12-27
上傳用戶：aysyzxzm
Demonstration script for envelope detection. The message signal is +1 for 0 < t < t0/3, -2 for t0/3 < t < 2t0/3, and zero otherwise.
標(biāo)簽： Demonstration for detection envelope
上傳時(shí)間： 2014-01-24
上傳用戶：stella2015
k-step ahead predictions determined by simulation of the ％ one-step ahead neural network predictor. For NNARMAX ％ models the residuals are set to zero when calculating the ％ predictions. The predictions are compared to the observed output. ％
標(biāo)簽： ahead predictions determined simulation
上傳時(shí)間： 2016-12-27
上傳用戶：busterman
％ am.m ％ Matlab demonstration script for DSB-AM modulation. The message signal ％ is +1 for 0 < t < t0/3, -2 for t0/3 < t < 2t0/3 and zero otherwise.
標(biāo)簽： demonstration modulation for message
上傳時(shí)間： 2016-12-28
上傳用戶：dongqiangqiang
//使用gray code的解法 #include <iostream> #include <cmath> using namespace std #define ZERO 0 #define ONE 1 #define ODD 1 #define EVEN 0 #define RIGHT 1 #define LEFT 0 #define MAX 10
標(biāo)簽： include namespace iostream define
上傳時(shí)間： 2016-12-31
上傳用戶：luke5347
自己做的數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)題（合并鏈表，huffman tree,表達(dá)式求值）
標(biāo)簽： 數(shù)據(jù)結(jié)構(gòu) 實(shí)驗(yàn) 合并
上傳時(shí)間： 2016-12-31
上傳用戶：redmoons
專家點(diǎn)評(píng): Y P7 `. @ {$ r％ pa.功能很強(qiáng)大，可以看出花了很多心血在算法上，非常好。算法上還有一點(diǎn)瑕疵，例如在刪除一個(gè)員工的同時(shí)沒有辦法自動(dòng)建立其他員工的上下級(jí)關(guān)系，必須刪除全部下級(jí)員工，不是非常合理。此外，界面設(shè)計(jì)過于簡(jiǎn)單，應(yīng)該加強(qiáng). " W" R+ b* g$ a$ Sb.程序運(yùn)用了自己的算法來提高Tree控件顯示的速度和資源分配，這個(gè)非常值得肯定和鼓勵(lì)。* C. c4 D0 e9 ` J$ w# U c.基本實(shí)現(xiàn)所有規(guī)定的功能，在所有參賽者中唯一熟 : O) l- F6 F9 f) S7 Q. l練使用面向?qū)ο笤O(shè)計(jì)方式開發(fā)程序的工程師，很不錯(cuò)！程序體現(xiàn)了作者非常扎實(shí)的數(shù)據(jù)結(jié)構(gòu)功底，值得大家學(xué)習(xí)。工程管理也做得非常好，體現(xiàn)了作者在軟件工程方面也有很深入的研究，該代碼是很好的學(xué)習(xí)范例。 ％ G* H$ ~3 W1 ]. e! id.算法的創(chuàng)新是獨(dú)特之處(hashtable算法建立),可見作者在數(shù)據(jù)結(jié)構(gòu)方面的熟練掌握.此程序是很多專家會(huì)員學(xué)習(xí)典范.
上傳時(shí)間： 2017-01-19
上傳用戶：奇奇奔奔
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
Huffman codes In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. This problem can by solved by using an extended binary tree which is used in the 2- way merging problem.
標(biāo)簽： telecommunication represent messages Huffman
上傳時(shí)間： 2014-01-04
上傳用戶：x4587
讀取XML信息，顯示在tree上。并且提供各種控制功能
上傳時(shí)間： 2013-12-19
上傳用戶：gououo
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
