A/轉換程序，用在8051或8031，此外還有兩個小的顯示的程序
上傳時間： 2015-03-20
上傳用戶：黃華強
4. If a modified source code is distributed, the original unmodified -- source code must also be included (or a link to the Free IP web -- site). In the modified source code there must be clear -- identification of the modified version.
標簽： source code distributed unmodified
上傳時間： 2013-12-14
上傳用戶：qq1604324866
R 樹， 存取方式的當中最普遍的的用長方形， 是根據區域的啟發式優化圍繞的長方形在各個內在結點通過運行在一張規范化的試驗平臺下高度變化的數據， 詢問和操作眾多的實驗， 我們能設計合并聯合的優化的R* 樹區域， 各個附寄的長方形邊際和交疊在目錄使用我們規范化的試驗床在詳盡表現比較，它結果R* 樹清楚地勝過現有的R 樹變形Guttman’s線性和二次方R 樹和R 樹的格林變形，R* 樹的這優勢舉行為不同的型詢問和操作， 譬如地圖覆蓋物。 為兩個長方形和多維點在所有實驗從一個實用觀點R* 樹是非常有吸引力的由于以下二個原因1 它高效率地支持點和空間數據同時和2 它實施費用比那少許高級其它R 樹。
標簽： 樹
上傳時間： 2014-12-05
上傳用戶：cmc_68289287
Locally weighted polynomial regression LWPR is a popular instance based al gorithm for learning continuous non linear mappings For more than two or three in puts and for more than a few thousand dat apoints the computational expense of pre dictions is daunting We discuss drawbacks with previous approaches to dealing with this problem
標簽： polynomial regression weighted instance
上傳時間： 2013-11-28
上傳用戶：sunjet
A simple C program to strobe the LEDsvia Port D. The strobe rate is to be set by adjusting the voltage drop over a potentiometer that is sampled by an ADC.
上傳時間： 2014-01-09
上傳用戶：lifangyuan12
本程序通過對研祥EVOC_PCL813高速A/D數據采集卡的驅動，采集40路模擬通道的數據，并以數據文件的形式存儲在硬盤上，生成文本文件
上傳時間： 2014-01-03
上傳用戶：guanliya
This is a program that will let you calculate roots with the Quadratic formula (including complex roots), Factorial of a number, Fibonacci series (and Pascals Triangle still under construction).
標簽： Quadratic calculate including formula
上傳時間： 2014-01-25
上傳用戶：zhuoying119
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
標簽： initiated described modified slightly
上傳時間： 2014-01-09
上傳用戶：sk5201314
In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
標簽： algorithm character position either
上傳時間： 2014-01-27
上傳用戶：wang0123456789
A
標簽：
上傳時間： 2013-12-22
上傳用戶：JIUSHICHEN
