搜索结果
找到约 12,288 项符合
LTE-A 的查询结果
其他 转置矩阵是10*10矩阵A的转置矩阵A（t）
转置矩阵是10*10矩阵A的转置矩阵A（t）
CA认证 本文档描述了无需证书撤消列表就可以决定一张数字证书当前状态的协议。 第二章中有协议的概述。功能必要条件在第三章中有详细描述。第四章是具体协议。第 五章我们将讨论一些和协议有关的安全问题。附录A定义了在
本文档描述了无需证书撤消列表就可以决定一张数字证书当前状态的协议。 第二章中有协议的概述。功能必要条件在第三章中有详细描述。第四章是具体协议。第 五章我们将讨论一些和协议有关的安全问题。附录A定义了在HTTP之上的OCSP，附 录B有ASN.1的语义元素，附录C详细描述了信息的mime类型。 ...
VHDL/FPGA/Verilog 4. If a modified source code is distributed, the original unmodified -- source code must also be inc
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.
人工智能/神经网络 Locally weighted polynomial regression LWPR is a popular instance based al gorithm for learning c
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 ...
微处理器开发 A simple C program to strobe the LEDsvia Port D. The strobe rate is to be set by adjusting the volta
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.
单片机开发 本程序通过对研祥EVOC_PCL813高速A/D数据采集卡的驱动
本程序通过对研祥EVOC_PCL813高速A/D数据采集卡的驱动，采集40路模拟通道的数据，并以数据文件的形式存储在硬盘上，生成文本文件
数学计算 This is a program that will let you calculate roots with the Quadratic formula (including complex ro
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).
压缩解压 This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer a
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 lette ...
压缩解压 In each step the LZSS algorithm sends either a character or a <position, length> pair. Among t
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 t ...