基于分段搜索的多RFID标签抗冲突方法*

由于二元树抗冲突方法消耗的识别时间随标签数量呈线性增长,因而提高巨量（>100）标签的抗冲突识别的效率对于推动RFID的应用显得尤为重要。对此本文提出一种分段搜索清点RFID标签的抗冲突方法,通过减少清点过程中标签对阅读器回传数据的位数,达到减少传输耗时的目的。将其与现有的动态二进制搜索法对比,仿真结果表明,当标签突破一定数量,对于特定的分段方式,该算法能够显著降低清点过程的时间消耗。     

用VIS系统验证电路的实时特性的探讨

文章在分析形式化验证／综合系统VIS 的基础上,改进了该电子系统中的关键技术——二叉判定图（BDD）,使BDD能表示电路的定时性质,这样就为VIS系统能够进行电路的时间特性验证和实时模型检验打下了基础。     

大幅图像的分块细化加速算法

文章在分析大规模二值图像特点和细化算法基本原理的基础上,提出一种分块细化大幅图像的算法。该算法首先将大幅图像分割成若干子块,然后分别对各子块进行细化,最后将子块细化的结果拼接成原图的骨架。算法有效地解决了大幅图像细化处理的时空矛盾,提高了大幅图像的细化速度。     

基于计算器的小数位进制转换方法研究

数据在计算机中是以器件的物理状态来实现的,因此研究数据之间的进制转换非常重要。基于计算机器的小数位进制转换方法能够克服一般转换方法的繁琐,用计算器快速实现包含有小数部分的数据的进制之间的转换。     

基于离散粒子群算法的应急物资调度系统研究

应急物资的调度是一个非常重要而实际的研究课题,首要条件是时间最短,在时间最短的基础上要求费用最低。在此基础上,建立了时间最短、成本最低的多目标带约束的数学模型,并利用理想点法将此多目标问题转化为单目标问题,而后利用粒子群算法中的罚函数法将此蒂约束的问题转化为不带约束的问题,最后用离散的粒子群算法求解。实验表明,用粒子群算法求解应急物资调度问题有效可行。     

A binary pattern classification using potts model

The paper offers a new kind of neural network for classifying binary patterns. Given the dimensionality of patterns, the memory capacity of the network grows exponentially with free parameter s. The paper considers the limitations for parameter s caused by the fact that greater values of demand large computer memory and decrease the basin of attraction we have. In contrast to similar models, the network enjoys larger memory capacity and better recognition capabilities—it can distinguish heavily distorted patterns and even cope with pattern correlation. The negative effect of the latter can be easily suppressed by taking a large enough value of s. A perceptron recognition system is considered to demonstrate the efficiency of the algorithm, yet the method is quite applicable in fully connected associative-memory networks. The article is published in the original.     

A distributed expansible authentication model based on Kerberos

There is a potential server bottleneck problem when the Kerberos model is applied in large-scale networks because the model uses centralized management. To enlarge its application scope, researchers must consider how to build a trust relation among those Kerberos servers located on different isolated domains, but have not provided a way to prevent the potential bottleneck that can occur with Kerberos servers. With the development of across-domain authentication techniques, the local server bottleneck problem has not been alleviated; in fact, it has become more serious.Adopting the rigorous binary tree code algorithm, we present an authentication model based on Kerberos. Compared with similar models, our model has several advantages. First, it overcomes the potential server bottleneck problem and can balance the load automatically. Second, it can process across-domain authentication and enlarge the authentication boundary. Finally, its authentication path is short, with no more than two Kerberos servers being involved when authenticating a user.     

On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata

The study of the computational power of randomized computations is one of the central tasks of complexity theory. The main goal of this paper is the comparison of the power of Las Vegas computation and deterministic respectively nondeterministic computation. We investigate the power of Las Vegas computation for the complexity measures of one-way communication, ordered binary decision diagrams, and finite automata.(i) For the one-way communication complexity of two-party protocols we show that Las Vegas communication can save at most one half of the deterministic one-way communication complexity. We also present a language for which this gap is tight.(ii) The result (i) is applied to show an at most polynomial gap between determinism and Las Vegas for ordered binary decision diagrams.(iii) For the size (i.e., the number of states) of finite automata we show that the size of Las Vegas finite automata recognizing a language L is at least the square root of the size of the minimal deterministic finite automaton recognizing L. Using a specific language we verify the optimality of this lower bound.     

A Comparison of Free BDDs and Transformed BDDs

Ordered binary decision diagrams (OBDDs) introduced by Bryant (IEEE Trans. on Computers, Vol. 35, pp. 677–691, 1986) have found a lot of applications in verification and CAD. Their use is limited if the OBDD size of the considered functions is too large. Therefore, a variety of generalized BDD models has been presented, among them FBDDs (free BDDs) and TBDDs (transformed BDDs). Here the quite tight relations between these models are revealed and their advantages and disadvantages are discussed.