轉(zhuǎn)置矩陣是10*10矩陣A的轉(zhuǎn)置矩陣A（t）
上傳時(shí)間： 2015-03-19
上傳用戶：txfyddz
本文檔描述了無需證書撤消列表就可以決定一張數(shù)字證書當(dāng)前狀態(tài)的協(xié)議。 第二章中有協(xié)議的概述。功能必要條件在第三章中有詳細(xì)描述。第四章是具體協(xié)議。第 五章我們將討論一些和協(xié)議有關(guān)的安全問題。附錄A定義了在HTTP之上的OCSP，附 錄B有ASN.1的語義元素，附錄C詳細(xì)描述了信息的mime類型。
標(biāo)簽： 協(xié)議 文檔 數(shù)字 安全問題
上傳時(shí)間： 2013-12-21
上傳用戶：417313137
A/轉(zhuǎn)換程序，用在8051或8031，此外還有兩個(gè)小的顯示的程序
上傳時(shí)間： 2015-03-20
上傳用戶：黃華強(qiáng)
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.
標(biāo)簽： source code distributed unmodified
上傳時(shí)間： 2013-12-14
上傳用戶：qq1604324866
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
標(biāo)簽： polynomial regression weighted instance
上傳時(shí)間： 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.
標(biāo)簽： strobe D. adjusting the
上傳時(shí)間： 2014-01-09
上傳用戶：lifangyuan12
本程序通過對(duì)研祥EVOC_PCL813高速A/D數(shù)據(jù)采集卡的驅(qū)動(dòng)，采集40路模擬通道的數(shù)據(jù)，并以數(shù)據(jù)文件的形式存儲(chǔ)在硬盤上，生成文本文件
標(biāo)簽： EVOC_PCL 813 程序 數(shù)據(jù)采集卡
上傳時(shí)間： 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).
標(biāo)簽： Quadratic calculate including formula
上傳時(shí)間： 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.
標(biāo)簽： initiated described modified slightly
上傳時(shí)間： 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.
標(biāo)簽： algorithm character position either
上傳時(shí)間： 2014-01-27
上傳用戶：wang0123456789
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
