random access time的例句大全

A new random access protocol assisted by fixed relay stations under the transparent mode in multi-hop relay networks over the time division multiple access was presented.

提出时分多址方式下由固定中继节点支持的透明模式下的随机接入协议，通过中继节点与用户间的合作重传来解决多个用户同时接入发生碰撞的问题。

The research results indicate that by introducing a pseudo-random time hopping code to the code domain transmitted reference structure to the code domain transmitted reference structure, the scheme can effectively control the influence of multiple access interference. And the system realization complexity is low. 4.

研究结果表明，通过引入一组伪随机跳时码，结合自身的码域发送参考结构，这种多址接入方法可以有效控制多址干扰的影响，并且系统实现复杂度较低。

In this paper, the multiple access performances of spread spectrum with chaotic sequence and that with pseudo-random sequence, pseudo-( chaotic) time hopping and conventional time hopping are compared, in terms of theoretical analysis of bit error rate, simulation results and the receiver.

从误码率理论分析、性能仿真和接收机结构等几个方面对混沌序列扩频与伪随机序列扩频、伪混沌跳时与传统跳时多址接入方式进行比较研究。

As random number is different each time, One-time password is realized and the security of bank card access authentication system is improved.

由于每次ATM机提供的随机数不同，生成的动态密码也不同，实现了动态登录，有效地提高了银行卡接入认证系统的安全性。

Study on a new method for continuous-time systems of random access channel

一种新的时间连续型随机多址系统分析方法研究

Average Motion Time of Random Access Mechanism

随机寻道装置的平均运动时间

Performance Analysis of Continuous-Time Systems of Random Access Channels

连续时间随机多址系统性能分析

our scheme has efficient random-access key updates. the size of signature and the computational cost of the verifying are independent of the number of revoked group members. the group public key is independent of the number of time periods.

我们的方案支持可随机存取的密钥更新，签名长度和验证算法的计算量都独立于被撤销的群成员个数，群公钥的长度独立于时间段个数。

note that time switched transmission is not applied to the random access uplink physical channel.

注意到时间开关传输不能应用于随机接入上行物理信道。

time complexity of establishing network with random multiple access system

随机接入网络的组网时间复杂性

Simulation results confirm that the average access delay of FDPA is reduced, and the mean time to failure is increased, comparing to the random placement strategy and the CRUSH method.

实验结果表明，与典型的随机放置算法和CRUSH相比，FDPA的平均访问时间更低，平均无故障时间更长。

As a result, the disk access time is much longer when reading data in random order than when reading in sequential order.

因此，与按顺序读取相比，按随机顺序读取数据时的磁盘访问时间要长得多。