sheerdns is a master DNS server whose zone records are stored on a One-Record-PER-File bases. Because of this, it is the simplest of any DNS to configure, the easiest to update, and the most efficient for networks that exPERience a lot of updates (for example master servers for dynamic IP address ranges). You never have to restart it; any updates are available immediately without having to notify the sheerdns process. 來源: http://freshmeat.net/projects/sheerdns/?topic_id=149 sheerdns是一個主DNS服務器，它的域記錄保存在一個One-Record-PER-File（每文件一個記錄）的庫中。因此，它是最簡單的DNS配制，最容易更新，對于有大量更新的網絡（如動態IP地址范圍的主服務器）來說它是最高效的。你不必重新啟動它，任何更新不用通知對應DNS進程就可以立即生效。
標簽： One-Record-PER-File sheerdns records Becaus
上傳時間： 2015-01-10
上傳用戶：wyc199288
Information technology – ASN.1 encoding rules: Specification of Packed Encoding Rules (PER). ASN.1的PER編碼方式說明。
標簽： Specification Information technology ASN
上傳時間： 2014-01-20
上傳用戶：王慶才
ASN.1關于PER編碼的國家標準定義,包括如何編碼,對從事該類工作的朋友極有幫助
上傳時間： 2015-09-02
上傳用戶：lhc9102
單相變壓器的空載運行 變壓器參數測定 標么值PER-unit value 電磁轉矩和轉矩特性 三相異步電動機 的電力拖動 發電機電樞反應 同發方程式相量圖
上傳時間： 2014-01-05
上傳用戶：徐孺
提供了通用的asn1編解碼動態庫,實現BER和PER方式的asn1編解碼。并提供使用實例和說明。
上傳時間： 2014-01-08
上傳用戶：change0329
The output should contain the minimum setup time in minutes, one PER line.
標簽： contain minimum minutes output
上傳時間： 2014-01-20
上傳用戶：hjshhyy
Obtain the CDF plots of PAPR from an OFDM BPSK transmission specified PER IEEE 802.11a specification PER the IEEE 802.11a specifications, we 52 have used subcarriers. Given so, the theoretical maximum expected PAPR is 52 (around 17dB). However, thanks to the scrambler, all the subcarriers in an OFDM symbol being equally modulated is unlikely. Using a small script, the cumulative distribution of PAPR from each OFDM symbol, modulated by a random BPSK signal is obtained
標簽： specification transmission specified Obtain
上傳時間： 2016-04-24
上傳用戶：haoxiyizhong
CRC碼產生器與校驗器程序 Features ： Executes in one clock cycle PER data word Any polynomial from 4 to 32 bits Any data width from 1 to 256 bits Any initialization value Synchronous or asynchronous reset
標簽： polynomial Features Executes clock
上傳時間： 2013-12-18
上傳用戶：Ants
The following source code shows an example for generating of 3bytes PER 256bytes, based on hamming code ecc
標簽： generating following example hamming
上傳時間： 2017-05-08
上傳用戶：jqy_china
) Compression using huffman code -with a number of bits k PER code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
標簽： code Compression huffman provide
上傳時間： 2017-05-30
上傳用戶：yuchunhai1990
