This is a package to calculate Discrete Fourier/Cosine/Sine Transforms of 1-dimensional sequences of length 2^N. This package contains C and Fortran FFT codes.
標(biāo)簽： dimensional Transforms calculate sequences
上傳時(shí)間： 2014-01-14
上傳用戶：LIKE
最小平方近似法 (least-squares approximation) 是用來(lái)求出一組離散 (discrete) 數(shù)據(jù)點(diǎn)的近似函數(shù) (approximating function)，作實(shí)驗(yàn)所得的數(shù)據(jù)亦常使用最小平方近似法來(lái)達(dá)成曲線密合 (curve fitting)。以下所介紹的最小平方近似法是使用多項(xiàng)式作為近似函數(shù)，除了多項(xiàng)式之外，指數(shù)、對(duì)數(shù)方程式亦可作為近似函數(shù)。關(guān)於最小平方近似法的計(jì)算原理，請(qǐng)參閱市面上的數(shù)值分析書籍
標(biāo)簽： least-squares approximation approximating discrete
上傳時(shí)間： 2015-06-21
上傳用戶：SimonQQ
一個(gè)學(xué)生成績(jī)系統(tǒng),java的import java.applet.Applet import java.awt.* import java.awt.event.* import java.util.*
標(biāo)簽： import java awt applet
上傳時(shí)間： 2015-06-21
上傳用戶：梧桐
This open source, event-drived, RAM constrained embedded system.
標(biāo)簽： event-drived constrained embedded source
上傳時(shí)間： 2015-07-06
上傳用戶：lijinchuan
VB automaticlly grap error event
標(biāo)簽： automaticlly error event grap
上傳時(shí)間： 2015-08-10
上傳用戶：tianjinfan
應(yīng)用層建立event,傳入驅(qū)動(dòng)，并等待事件，驅(qū)動(dòng)中檢測(cè)到事件被觸發(fā)立即通知應(yīng)用層，應(yīng)用層收到消息，進(jìn)行相應(yīng)處理。ansi c編寫，適合驅(qū)動(dòng)新手使用，實(shí)現(xiàn)驅(qū)動(dòng)與應(yīng)用層的通信，
標(biāo)簽： event 應(yīng)用層 驅(qū)動(dòng)
上傳時(shí)間： 2014-01-24
上傳用戶：saharawalker
本文以此為背景,提出了基于事件驅(qū)動(dòng)的BDI agent實(shí)現(xiàn)體系結(jié)構(gòu),用信念(Belief)、事件(Event)、規(guī)劃(Plan)等內(nèi)部特征來(lái)描述軟件agent,并給出了面向?qū)ο髮哟紊系能浖gent的UML模型,該模型定義了構(gòu)成軟件agent的四個(gè)對(duì)象:Agent、BeliefSet、Event、Plan 為描述這些對(duì)象及其交互關(guān)系,本文以java語(yǔ)言為基礎(chǔ),擴(kuò)展出了能描述這四個(gè)對(duì)象的java類以及描述其交互關(guān)系
標(biāo)簽： agent Belief Event Plan
上傳時(shí)間： 2014-01-09
上傳用戶：tedo811
離散粒子群算法（Discrete PSO）C語(yǔ)言源代碼。 附帶有利用D-PSO解決旅行商問題(TSP)的代碼可作為使用時(shí)的Demo參考
標(biāo)簽： Discrete D-PSO Demo PSO
上傳時(shí)間： 2014-01-24
上傳用戶：
Fast Discrete Curvelet Transform有正反變換,各個(gè)程序里面的參數(shù)都有詳細(xì)的說明.
標(biāo)簽： Transform Discrete Curvelet Fast
上傳時(shí)間： 2015-09-25
上傳用戶：xjz632
The Staged Event-Driven Architecture (SEDA) is a new design for building scalable Internet services. SEDA has three major goals: To support massive concurrency, on the order of tens of thousands of clients per node To exhibit robust performance under wide variations in load and, To simplify the design of complex Internet services. SEDA decomposes a complex, event-driven application into a set of stages connected by queues. This design avoids the high overhead associated with thread-based concurrency models, and decouples event and thread scheduling from application logic. SEDA enables services to be well-conditioned to load, preventing resources from being overcommitted when demand exceeds service capacity. Decomposing services into a set of stages also enables modularity and code reuse, as well as the development of debugging tools for complex event-driven applications.
標(biāo)簽： Event-Driven Architecture Internet building
上傳時(shí)間： 2015-09-28
上傳用戶：日光微瀾
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
