信令网的核心--下一代信令转接点

本文在讨论了下一代信令转接点在满足传统信令网络功能的基础上，着重介绍了下一代的信令转接点上实现的号码携带、灵活路由等新业务，并如何实现传统STP面向下一代网络的平滑过渡。     

非AWGN环境下调制类型自动识别

在非AWGN环境下，针对CW，AM，FM，OOK，PSK，QPSK，16QAM，FSK，MSK，SSB十种混合调制信号，对调制类型特征提取方法和自动识别算法进行了分析、综合、设计和计算机仿真。提出了梯层电平分析方法、频率瞬时信号分析、剔除载波的归一化能量分析、平方后信号的频谱分析、四次方后的信号频谱分析等方法。当SNR=10dB时，计算机仿真结果是正确识别率不低于95％，自动识别的平均处理时间为不超过10s。     

Routine Highway Bridge Inspection Condition Documentation Accuracy and Reliability

Routine inspection is the most common form of highway bridge inspection to satisfy the requirements of the National Bridge Inspection Standards. The accuracy and reliability of documentation generated during these inspections are critical to the allocation of Department of Transportation construction, maintenance, and rehabilitation resources. Routine inspections are typically completed using only the visual inspection technique and rely heavily on subjective assessments made by bridge inspectors. In light of this, and given the fact that visual inspection may have other limitations that influence its reliability, the Federal Highway Administration initiated an investigation to examine the reliability of visual inspection as it is currently applied to bridges in the United States. This paper will summarize results from this study related to the accuracy and reliability of routine inspection documentation. A number of important conclusions were developed from the experimental study. Generally, it was found that all structural condition documentation is collected with significant variability. Specifically, 95% of primary element condition ratings for individual bridge components will vary within two rating points of the average and only 68% will vary within one point. Documentation generally collected to support condition ratings also has significant variability as exemplified by the number and types of field notes and photographs taken by inspectors. With respect to the use of element-level inspections, it was found that element usage was generally consistent with the Commonly Recognized Element Guide. However, there is significant variability in the condition state assignments of those elements and in some cases the condition states are not applied correctly to particular elements.     

Onr-partition designs in hamming spaces

The concept of the combinatorial matrix of an unrestricted code and the notion of anr-partition design admitted by a code are introduced and discussed in detail. The theory includes a characterization of completely regular codes, and a combinatorial interpretation of the fact that the distinct rows of the distance distribution matrix of a code are linearly independent. In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined system of linear equations; this is an efficient technique provided the number of classes in the partition is relatively small.     

浅析两种分布式路由选择算法

本文介绍及分析了两种基本的动态路由选择算法.     

Electronic protection and routing optimization of MANETs operating in an electronic warfare environment

Domination of the electromagnetic spectrum is a crucial component of the 21st century warfare. In the harsh electromagnetic environment of the modern battlefield, it is of the utmost importance to deny the opposing force the opportunity to attack or exploit the detection/interception of friendly communications assets through the deployment of electronic protection (EP) measures in order to attain low probability of detection (LPD), low probability of interception (LPI) and anti-jam (A/J). Given that directional antennas are a suitable means to achieve both extended range and LPD/LPI, this paper proposes mechanisms to optimize the trade-off between these capabilities, minimizing the number of hops and end-to-end delay when routing packets in a multi-hop ad-hoc network, while taking into account stealth requirements. The novel scheme is based on a variant of Fisheye State Routing, coupled with a power control algorithm to guarantee a LPD/LPI beyond the zone covered by the omni-directional radiation footprint of the network. The performance of the proposed scheme is evaluated through computer simulation.     

Compact and localized distributed data structures

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.Received: August 2001, Accepted: May 2002, Supported in part by a grant from the Israel Science Foundation.     

On the number of broadcast schemes in networks

Broadcasting is the process of spreading one piece of information among a group of individuals connected by an interconnection network. In this paper we give exact lower and upper bounds for the number of broadcast schemes in arbitrary networks. Also, we give the exact value for complete bipartite graphs and an upper bound for regular networks. Based on the counting method we describe a new random algorithm for broadcasting in networks.     

地域通信网中基于业务量的动态路由研究

本文从地域通信网的特点出发，分析了以前所使用的路由选择方法的优缺点，提出了网控支持的基于业务量的动态中币管理方法，并描述了该路由管理方法的分层结构和在地域网网络管理系统中的具体实现。     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.