Prony算法工具箱。Prony方法是用一組指數(shù)項的線性組合來擬和等間距采樣數(shù)據(jù)的方法,可以從中分析出信號的幅值、相位、阻尼因子、頻率等信息。considerations including data preprocessing, model order selection, model order selection criteria, signal subspace selection, signal and noise separation, root inspection and assessing residuals. The PTbox provides flexibility to compare and display analysis results simultaneously for several parameter variations.
標(biāo)簽： Prony considerations including data
上傳時間： 2015-09-11
上傳用戶：lizhizheng88
This note describes some key aspects of what C++ is and of how C++ has developed over the years. The spective is that of an experienced C++ user looking at C++ as a practical tool. No attempts are made to compare C++ to other languages, though I have tried to answer some questions that I have often heard asked by Lisp programmers.
標(biāo)簽： describes developed aspects years
上傳時間： 2015-09-15
上傳用戶：haoxiyizhong
1.kruscal_CDT: 在Eclipse里面的CDT和MinGW(提供gcc)的環(huán)境下所編寫的。 2.kruscal_VC2005: 在VC2005里面編寫的。 3.以上兩個的代碼有點不同,區(qū)別主要在于compare函數(shù) 4.kruscal算法里面，我有兩個不同的實現(xiàn)，一個是最小化堆里面放EdgeNode的指針，一個是最小化堆里面放EdgeNode的Object實例。前者使用了compare函數(shù)來比較大小，后者則是在EdgeNode的class里面重載運算符。
標(biāo)簽： 2005 kruscal_CDT kruscal_VC Eclipse
上傳時間： 2013-12-19
上傳用戶：稀世之寶039
this a pack include source code for quartus 2. It is an implementation of the LC2. The LC-2 computer is described in Introduction to Computing Systems from Bits & Gates to C & Beyond by Yale Patt and Sanjay Patel, McGraw Hill, 2001. The LC2 model can be run as a simulation or downloaded to the UP3 in a larger model, TOP_LC2 that adds video output. Push buttons reset and single step the processor and a video output display of registers is generated. This state machine VHDL-based model of the LC-2 includes all source files. Currently compiled for a Cyclone EP1C6Q240 FPGA.
標(biāo)簽： implementation include quartus source
上傳時間： 2013-12-25
上傳用戶：壞壞的華仔
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時間： 2016-01-17
上傳用戶：jeffery
Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The required precision is =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of these two methods
標(biāo)簽： Gauss-Seidel iterative following methods
上傳時間： 2016-02-06
上傳用戶：zmy123
Just what is a regular expression, anyway? Take the tutorial to get the long answer. The short answer is that a regular expression is a compact way of describing complex patterns in texts. You can use them to search for patterns and, once found, to modify the patterns in complex ways. You can also use them to launch programmatic actions that depend on patterns. A tongue-in-cheek comment by programmers is worth thinking about: "Sometimes you have a programming problem and it seems like the best solution is to use regular expressions now you have two problems." Regular expressions are amazingly powerful and deeply expressive. That is the very reason writing them is just as error-prone as writing any other complex programming code. It is always better to solve a genuinely simple problem in a simple way when you go beyond simple, think about regular expressions. Tutorial: Using regular expressions
標(biāo)簽： expression the tutorial regular
上傳時間： 2013-12-19
上傳用戶：sardinescn
Here we are at the crossroads once again Youre telling me youre so confused You cant make up your mind Is this meant to be Youre asking me Trademark But only love can say - try again or walk away But I believe for you and me The sun will shine one day So Ill just play my part And pray you ll have a change of heart But I cant make you see it through Thats something only love can do Face to face and a thousand miles apart Ive tried my best to make you see Theres hope beyond the pain If we give enough if we learn to trust [Chorus] I know if I could find the words To touch you deep inside Youd give our dream just one more chance Dont let this be our good-bye
標(biāo)簽： crossroads confused telling again
上傳時間： 2016-04-12
上傳用戶：changeboy
電路仿真程序 Classic Ladder is coded 100％ in C.It can be used for educational purposes or anything you want... The graphical user interface uses GTK. In the actual version, the following elements are implemented : * Booleans elements * Rising / falling edges * Timers * Monostables * Compare of arithmetic expressions
標(biāo)簽： educational anything purposes Classic
上傳時間： 2014-01-13
上傳用戶：xg262122
The goal of this exercise is to understand the concept of Carrier-Sensing in IEEE 802.11 standard and compare Physical Carrier Sense and Virtual Carrier Sense mechanisms.
標(biāo)簽： Carrier-Sensing understand exercise standard
上傳時間： 2014-01-10
上傳用戶：ljt101007
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
