一类广义Bent型S-Box的构造

S-box是密码理论与实践中十分重要的一种装置 ,它的密码性能由其分量函数所决定 .于是 ,选择适当的分量函数来构造 S-box就成了一个重要的研究课题 .在一定意义上 ,Bent函数是最优良的密码函数 .本文通过函数序列半群和置换群来构造其任何非零线性组合为 Bent函数与线性函数之和的函数组 ,从而可由 Bent函数构造出具有高度非线性度和其他良好性状的 S-box     

拟因子试验设计在生产中的应用

根据生产实际,综合利用并列、赋闲列和拟水平试验设计,运用多重比较进行方差分析,寻找水泥熟料的最佳工艺.不仅解决了不同水平多因素试验问题,同时还可考虑交互作用,大大减少了试验次数,从而提高经济效益.     

楔形光纤与半导体多量子阱平面光波光路芯片的耦合分析

采用楔形光纤(WSF)实现了与半导体多量子阱(MQW)平面光波光路(PLC)芯片的高效耦合。在多量子阱-平面光波光路前置模斑转换器(SSC)和不加模斑转换器的情况下,用阶梯串联法(SCM)数值模拟并优化设计了楔形光纤-平面光波光路间最佳耦合参量:楔形光纤楔角45°、端面圆柱透镜曲率半径2.5μm、模斑转换器-多量子阱-平面光波光路出射椭圆光斑长半轴3.5μm、纵横比5、楔形光纤-平面光波光路间垂直方向和水平方向无偏移、纵向间距5.5μm。用反向推演法(IDM)实验分析了楔形光纤样品的出射光场,与阶梯串联法(SCM)计算结果相比长轴误差为3.125%,短轴误差为0.8%。建立楔形光纤-平面光波光路-单模光纤(SMF)的耦合实验系统,在1.55μm波长处以单模光纤作为出纤的相同条件下,发现楔形光纤激励入射平面光波光路比单模光纤和锥形透镜光纤(TLF)作为入纤的耦合效率分别提高了24.827 dB和16.22 dB,为多量子阱-平面光波光路芯片尾纤封装技术提供了实验原型。     

Higher dimensional multifractal analysis of non-uniformly hyperbolic systems

A. Johansson, T.M. Jordan, A. Öberg, and M. Pollicott (2010) [7] have studied the multifractal analysis of a class of one-dimensional non-uniformly hyperbolic systems. By introducing some new techniques, we extend the results to the case of high dimension.     

虚级联信号的链路容量调整机制LCAS及其在新一代SDH智能带宽响应中的应用

通用成帧规程GFP、VC虚级联和链路容量调整机制LCAS是有效实现Data over SDH(DoS)的新型协议。基于此运营商可以实现网络带宽的动态分配响应。通过分析LCAS的特点、结构和功能实现方式,指出其作为一种源-宿之间无损伤的改变虚级联组容量大小的握手信令协议,其服务可以建立在集中或分布式控制基础上。特别分析了结合基于GMPLS/ASTN的智能化控制平面,LCAS将进一步拓展BoD应用。     

LCAS技术研究及应用展望

链路容量调整方案(LCAS)是目前城域网新一代多业务传送平台(MSTP)解决方案的关键技术之一,它是结合虚级联技术而实现的。首先对其产生背景进行了概述,然后论述了LCAS的基本思想和控制分组,就虚级联链路带宽容量增加的情形为例描述LCAS的控制过程,最后对LCAS技术的应用情况进行了一定的分析,并对其前景进行了一定的展望。     

新一代SDH关键技术和动态带宽分配的实现

首先介绍了为解决传说SDH传输技术存在的多业务（主要是宽带数据业务）承载能力不足和带宽分配缺乏灵活性等问题而出现的一系列新技术（如虚级联、链路容量调整方案，通用成帧规程等）的基本原理和特点，并在此基础上进一步讨论了如何实现SDH带宽动态分配的问题。     

SDH虚级联信号的链路容量调整机制LCAS及其标准的新发展

通用成帧规程GFP、VC虚级联和链路容量调整机制LCAS是有效实现Data over SDH (DoS)的新型协议。本分析了LCAS的特点和结构，及相关标准的最新一些进展。     

Relations between some basic results derived from two kinds of topologies for a random locally convex module

The purpose of this paper is to exhibit the relations between some basic results derived from the two kinds of topologies (namely the (ε,λ)-topology and the stronger locally L⁰-convex topology) for a random locally convex module. First, we give an extremely simple proof of the known Hahn-Banach extension theorem for L⁰-linear functions as well as its continuous variant. Then we give the relations between the hyperplane separation theorems in [D. Filipovi?, M. Kupper, N. Vogelpoth, Separation and duality in locally L⁰-convex modules, J. Funct. Anal. 256 (2009) 3996-4029] and a basic strict separation theorem in [T.X. Guo, H.X. Xiao, X.X. Chen, A basic strict separation theorem in random locally convex modules, Nonlinear Anal. 71 (2009) 3794-3804]: in the process we also obtain a very useful fact that a random locally convex module with the countable concatenation property must have the same completeness under the two topologies. As applications of the fact, we prove that most of the previously established principal results of random conjugate spaces of random normed modules under the (ε,λ)-topology are still valid under the locally L⁰-convex topology, which considerably enriches financial applications of random normed modules.     

Serial concatenation of Hermitian codes with ring‐TCM codes

Hermitian codes are a class of very long algebraic‐geometric (AG) codes constructed from Hermitian curves, which outperform Reed–Solomon codes defined over the same finite fields and with the same code rates, as recently demonstrated by the authors. However, since there are no soft‐decision decoding algorithms for AG codes in the literature, the performance of Hermitian codes is limited and their potential is yet to be realized. An alternative method for achieving more significant coding gains is presented in this paper by serially concatenating long Hermitian codes with ring‐trellis‐coded modulation codes over the ring of integers ?₄ and evaluating their performance through simulation results on the AWGN and Rayleigh fading channels. The scheme achieves large coding gains over single Hermitian and Reed–Solomon codes with no increase in bandwidth use and a performance comparable with the well‐known capacity‐approaching codes. Copyright © 2007 John Wiley & Sons, Ltd.