use MFC to create a QQ dialog to be a beautiful human interface.
標(biāo)簽： beautiful interface create dialog
上傳時(shí)間： 2016-04-04
上傳用戶(hù)：yy541071797
This isakmpd, a BSD-licensed ISAKMP/Oakley (a.k.a. IKE) implementation.
標(biāo)簽： a.k.a. implementation BSD-licensed isakmpd
上傳時(shí)間： 2016-04-07
上傳用戶(hù)：asdfasdfd
A new PLL topology and a new simplified linear model are presented. The new fractional-N synthesizer presents no reference spurs and lowers the overall phase noise, thanks to the presence of a SampleJHold block. With a new simulation methodology it is possible to perform very accurate simulations, whose results match closely those obtained with the linear PLL model developed.
標(biāo)簽： new fractional-N synthesizer simplified
上傳時(shí)間： 2016-04-14
上傳用戶(hù)：hjshhyy
北京大學(xué)ACM比賽題目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
標(biāo)簽： mathematician Christian Goldbach Leonhard
上傳時(shí)間： 2016-04-22
上傳用戶(hù)：wangchong
This example provides a description of how to use a DMA channel to transfer a word data buffer from memory (Flash) to memory (RAM). The dedicated DMA channel is configured to transfer once a time a 32 word data buffer stored as constant in the Flash memory to another buffer in the RAM memory. The received data are stored in the DST_Buffer. The DMA channel transfer complete interrupt is enabled to generate an interrupt at the end of the buffer transfer. As soon as the transfer is completed an interrupt is generated and in the DMA channel interrupt routine the transfer complete interrupt pending bit is cleared. The data counter is stored before and after the transfer to show that all data has been transfered. TransferStatus gives the data transfer status where it is PASSED if transmitted and received data are the same otherwise it is FAILED
標(biāo)簽： description provides transfer example
上傳時(shí)間： 2016-04-24
上傳用戶(hù)：ecooo
This is a test upload This is a test upload This is a test upload
上傳時(shí)間： 2014-01-03
上傳用戶(hù)：小寶愛(ài)考拉
A technical trading system comprises a set of trading rules that can be used to generate trading signals. In general, a simple trading system has one or two parameters that determine the timing of trading signals. Each rule contained in a trading system is the results of parameterizations. (Source: The Profitability of Technical Analysis: A Review by Cheol-Ho Park and Scott H. Irwin)
標(biāo)簽： trading technical comprises generate
上傳時(shí)間： 2013-12-25
上傳用戶(hù)：tianyi223
pMatlab is a toolsbox from MIT for running matlab in parallel style on a multi-core PC or a cluster environment. These two documents summary the usage of pMatlab and running time measurements on three simple Monte Carlo simulation codes.
標(biāo)簽： multi-core toolsbox parallel pMatlab
上傳時(shí)間： 2014-12-05
上傳用戶(hù)：zhliu007
快速傅里葉變換（FFT）算法。FFT - Fast Fourier transform. The length of X must be a power of two, for a fast radix-2 fast-Fourier transform algorithm is used
標(biāo)簽： FFT transform Fourier length
上傳時(shí)間： 2013-12-19
上傳用戶(hù)：sy_jiadeyi
Ex3-23 親兄弟問(wèn)題 « 問(wèn)題描述： 給定n 個(gè)整數(shù)0 1 1 , , , n- a a a 組成的序列。序列中元素i a 的親兄弟元素k a 定義為： min{ | } k i j n j j i a = a a ³ a < < 。 親兄弟問(wèn)題要求給定序列中每個(gè)元素的親兄弟元素的位置。元素i a 的親兄弟元素為k a 時(shí)，稱(chēng)k 為元素i a 的親兄弟元素的位置。當(dāng)元素i a 沒(méi)有親兄弟元素時(shí)，約定其親兄弟元素 的位置為-1。 例如，當(dāng)n=10，整數(shù)序列為6，1，4，3，6，2，4，7，3，5 時(shí)，相應(yīng)的親兄弟元素位 置序列為：4，2，4，4，7，6，7，-1，9，-1。 « 編程任務(wù)： 對(duì)于給定的n個(gè)整數(shù)0 1 1 , , , n- a a a 組成的序列，試用抽象數(shù)據(jù)類(lèi)型棧，設(shè)計(jì)一個(gè)O(n) 時(shí)間算法，計(jì)算相應(yīng)的親兄弟元素位置序列。 « 數(shù)據(jù)輸入： 由文件input.txt提供輸入數(shù)據(jù)。文件的第1 行有1 個(gè)正整數(shù)n，表示給定給n個(gè)整數(shù)。 第2 行是0 1 1 , , , n- a a a 。 « 結(jié)果輸出: 程序運(yùn)行結(jié)束時(shí)，將計(jì)算出的與給定序列相應(yīng)的親兄弟元素位置序列輸出到output.txt 中。 輸入文件示例 輸出文件示例 input.txt 10 4 2 4 4 7 6 7 -1 9 -1 output.txt 6 1 4 3 6 2 4 7 3 5
上傳時(shí)間： 2013-12-17
上傳用戶(hù)：shizhanincc
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
