WCDMA系统接口信令消息的描述与实现

WCDMA作为第三代移动通信系统的主流标准，能够提供多种类型的多媒体服务。为了实现各种用户平面数据的传输，系统会提前通过控制平面对所需的无线资源进行分配。由于配置过程是通过接口之间发送控制平面应用协议消息来实现的，因此能否正确有效地对信令消息进行编解码成为保证系统稳定工作的关键因素。3GPP标准中，ASN．1语言被用来描述接口信令消息。首先简要介绍了WCDMA系统结构以及主要接口协议，重点描述了ASN．1存在的意义及其编解码规则，最后给出了基于ASN．1的开发环境下应用层网络协议的开发流程。     

一种基于H.235协议的关守消息认证机制

首先对基于用户秘密散列签名的关守消息认证机制做了简单介绍,然后针对该机制的不足之处提出了一种基于H.235协议的改进方法,具有安全性高,速度快,管理方便等优点.     

固定电话网的新趋势——固网信息服务系统

本文首先讨论了中国电信开展固网短信业务的必要性，然后分析了开展固网短信业务存在的问题，最后介绍了固网短信系统的构成。     

群发短消息对PHS网呼入成功率的影响分析

介绍了PHS网呼入成功率和短消息流程，依据短消息模型和性能统计结果分析了群发短信对PHS网呼入成功率的影响，并建议选择合理的时间进行短消息群发以减少对网络负荷的影响。     

GPRS业务模型和无线网络的研究

根据GPRS业务及业务发展情况，对GPRS业务模型进行深入研究，并对GPRS无线网络进行了更深入的探讨。     

SUN5500小型机MPI编程与蕴式并行计算的实现方法

基于SUN5500小型计算机并行开发环境，给出了消息传递模型和蕴式行模型的实现方法，通过实例分析了SUNMPI实际编程，并对选取不同模型有不同参数的运算时间进行了比较，结果表明，在SUN5500计算机上MPI模型和蕴式并行模型均能较大地提高运算速度，而且MPI在灵活性和并行程度方面更优。     

具有消息恢复的数字签名方案的一个注记

对具有消息恢复的数字签名方案提出了两种攻击方法.此外,对原方案进行了改进,通过对改进方案的安全性分析得出结论:改进方案比原方案更安全,并且消息恢复过程只需要计算一次大数模幂乘和两次单向函数.     

Development of a parallel storm surge model

A new parallel storm surge model, the Parallel Environmental Model (PEM), is developed and tested by comparisons with analytic solutions. The PEM is a 2‐D vertically averaged, wetting and drying numerical model and can be operated in explicit, semi‐implicit and fully implicit modes. In the implicit mode, the propagation, Coriolis and bottom friction terms can all be treated implicitly. The advection and diffusion terms are solved with a parallel Eulerian–Lagrangian scheme developed for this study. The model is developed specifically for use on parallel computer systems and will function accordingly in either explicit of implicit modes. Storm boundary conditions are based on a simple exponential decay of pressure from the centre of a storm. The simulated flooding caused by a major Category 5 hurricane making landfall in the Indian River Lagoon, Florida is then presented as an example application of the PEM. Copyright © 2003 John Wiley & Sons, Ltd.     

流量管理中信息重发问题的研究

信息重发在通信网络中广泛存在。通过对信息重发问题的研究，建立了概率模型，分析了信息到达流的各种性质，得到了到达间隔时间的分布及平均到达速率等重要性能指标，利用数值实验对理论结论进行了验证。所得结果对网络流量管理和拥塞控制有一定的参考价值。     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004