Message—Driven Bean在异步消息传输中的应用

讨论了EJB2．0中Message-Driven Bean的一些新特性和运行机制，通过实例讲述了在构建异步消息传输中Message-Driven Bean的应用，并讨论了它的优势、缺陷，以及与Session Bean的比较。     

七号信令系统的MTP部分在S12-CDMA MSC中的应用

介绍了七号信令系统的消息传递部分（MTP）的功能以及MTP在S12－CDMA（码分多址）MSC（移动交换机）中的应用，包括涉及到的硬件模块和人机命令，阐述了用人机命令创建MTP数据的步骤和信令链路告警的处理方法，此外还指出了其中的命令和参数与公网中S12EC74版交换机的区别。     

基于GSM模块D15的单片机短信息收发系统设计

介绍用MCS-51系列单片机控制GSM数据模块D15收发短信息的原理、硬件电路和AT控制命 令集,并且对短信息收发的PDU格式和用户数据的编译码进行了分析.     

基于身份的具有消息恢复的签名方案研究

数字签名不仅可以提供信息的加密解密,还可以提供信息来源的鉴别、信息的完整性保证等。论文提出了一种基于身份的具有消息恢复的数字签名方案。与其它基于身份的签名方案相比,该方案的优点在于节省通信带宽,只需要很小的通信量,因此,可广泛应用于移动电子商务中。     

Iub接口仿真中关键技术方案的设计与实现

文中设计并实现了TD-SCDMA网络Iub接口的软件仿真系统中的关键技术方案一小区模型抽象和消息生成、处理。经过仪表的对环测试，验证了该技术方案的有效。     

Improving performance of optical fibre chaotic communication by dispersion compensation techniques

This paper numerically investigates the effects of dispersion on optical fibre chaotic communication, and proposes a dispersion compensation scheme to improve the performance of optical fibre chaotic communication system. The obtained results show that the transmitter-receiver synchronization progressively degrades and the signal-to-noise ratio of the recovered message deteriorates as the fibre length increases due to the dispersion accumulation. Two segments of 2.5-km dispersion-compensating fibres are symmetrically placed at both ends of a segment of 245-km nonzero dispersionshifted fibre with low dispersion in one compensation period. The numerical results show that the signal-to-noise ratio of the extracted 1 GHz sinusoidal message is improved from -2.92 dB to 15.38 dB by this dispersion compensation for the transmission distance of 500 km.     

数字移动通信中的小区广播业务

介绍在数字移动通信中小区广播业务的技术实现原理，业务种类及发展前景。     

超长距离网络中不同类光纤接头技术的改进

介绍了两种改善由不同类光纤组合产生的典型接头损耗的解决方法,即过桥光纤技术和热扩张纤芯技术。     

关于键盘输入与Win32钩子的探讨

众所周知，Windows上的所有操作建立在事件驱动的机制上，更具体地来讲就是整个系统都是通过消息的传递来实现的。本文以实例来介绍如何处理或实现某一特定功能的Windows消息的方法。     

Security of the most significant bits of the Shamir message passing scheme

Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a ``hidden' element of a finite field of elements from rather short strings of the most significant bits of the remainder modulo of for several values of selected uniformly at random from . Unfortunately the applications to the computational security of most significant bits of private keys of some finite field exponentiation based cryptosystems given by Boneh and Venkatesan are not quite correct. For the Diffie-Hellman cryptosystem the result of Boneh and Venkatesan has been corrected and generalized in our recent paper. Here a similar analysis is given for the Shamir message passing scheme. The results depend on some bounds of exponential sums.