期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
关于弱可逆有限自动机延迟步数分解的两个结果 被引量:8
1
作者 鲍丰 《计算机学报》 EI CSCD 北大核心 1993年第8期629-632,共4页
本文证明存在(任意元)延迟2步弱可逆有限自动机不等价于任何两个延迟1步弱可逆有限自动机的化合的任何子自动机。因而说明了不是对所有的弱可逆有限自动机,延迟步数都是可分解的,但对所有状态的延迟步数均为2的二元延迟2步弱可逆有限自... 本文证明存在(任意元)延迟2步弱可逆有限自动机不等价于任何两个延迟1步弱可逆有限自动机的化合的任何子自动机。因而说明了不是对所有的弱可逆有限自动机,延迟步数都是可分解的,但对所有状态的延迟步数均为2的二元延迟2步弱可逆有限自动机,则分解是可行的。 展开更多
关键词 有限自动机 密码学 延迟步数
下载PDF
弱可逆有限自动机的分解 被引量:18
2
作者 曹锋 邓培民 易忠 《计算机学报》 EI CSCD 北大核心 2005年第9期1501-1507,共7页
有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究.在有限自动机公开钥密码体制中首次提出了自动机化合的概念.易知,两个弱可逆有限自动机的化合仍然是一个弱可逆有限自动机并且它的延迟步数不大于前两个有限自动机... 有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究.在有限自动机公开钥密码体制中首次提出了自动机化合的概念.易知,两个弱可逆有限自动机的化合仍然是一个弱可逆有限自动机并且它的延迟步数不大于前两个有限自动机延迟步数之和.然而,另一方面,如何将一个弱可逆有限自动机分解为两个弱可逆有限自动机的化合却是一个非常困难的问题.该文主要考虑了一类n元严格延迟τ步弱可逆有限自动机M的延迟步数的分解问题.给出了一类特殊的n元弱可逆有限自动机分解的条件和结果.首先证明了如果对M中的每个状态s有T(s,τ)枝等,则M可分解为τ个延迟1步弱可逆有限自动机的化合.然后证明了M可分解为一个τ-m步弱可逆有限自动机和m阶延迟元的充要条件是对M中的每个状态s有T(s,m)枝等. 展开更多
关键词 有限自动机 弱可逆 分解 化合 延迟步数
下载PDF
Using multi-threads to hide deduplication I/O latency with low synchronization overhead 被引量:1
3
作者 朱锐 秦磊华 +1 位作者 周敬利 郑寰 《Journal of Central South University》 SCIE EI CAS 2013年第6期1582-1591,共10页
Data deduplication, as a compression method, has been widely used in most backup systems to improve bandwidth and space efficiency. As data exploded to be backed up, two main challenges in data deduplication are the C... Data deduplication, as a compression method, has been widely used in most backup systems to improve bandwidth and space efficiency. As data exploded to be backed up, two main challenges in data deduplication are the CPU-intensive chunking and hashing works and the I/0 intensive disk-index access latency. However, CPU-intensive works have been vastly parallelized and speeded up by multi-core and many-core processors; the I/0 latency is likely becoming the bottleneck in data deduplication. To alleviate the challenge of I/0 latency in multi-core systems, multi-threaded deduplication (Multi-Dedup) architecture was proposed. The main idea of Multi-Dedup was using parallel deduplication threads to hide the I/0 latency. A prefix based concurrent index was designed to maintain the internal consistency of the deduplication index with low synchronization overhead. On the other hand, a collisionless cache array was also designed to preserve locality and similarity within the parallel threads. In various real-world datasets experiments, Multi-Dedup achieves 3-5 times performance improvements incorporating with locality-based ChunkStash and local-similarity based SiLo methods. In addition, Multi-Dedup has dramatically decreased the synchronization overhead and achieves 1.5-2 times performance improvements comparing to traditional lock-based synchronization methods. 展开更多
关键词 MULTI-THREAD MULTI-CORE parallel data deduplication
下载PDF
TWO EFFECTIVE STABILITY CRITERIA FOR LINEAR TIME-DELAY SYSTEMS WITH COMPLEX COEFFICIENTS 被引量:2
4
作者 Junyu LI Li ZHANG Zaihua WANG 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2011年第5期835-849,共15页
This paper presents a method for directly analyzing the stability of complex-DDEs on the basis of stability switches. Two novel criteria are developed for the stability of a class of complex- DDEs. These results not o... This paper presents a method for directly analyzing the stability of complex-DDEs on the basis of stability switches. Two novel criteria are developed for the stability of a class of complex- DDEs. These results not only generalize some known results in literature but also greatly reduce the complexity of analysis and computation. To validate the effectiveness of the proposed criteria, the stabilization problem of the extended time delay auto-synchronization (ETDAS) control and n time delay auto-synchronization (NTDAS) control are then further investigated, respectively. The numerical simulations are consistent with the above theoretical analysis. 展开更多
关键词 Complex coefficient delay feedback control stability switch time-delay.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部