Proton Orbital [541]1/2 and Backbending in 178W

The microscopic mechanism of nine experimentally observed bands in ^178W is investigated using the particle-number conserving method of the cranked shell model with monopole and quadrupole paring interactions. The experimental results, including the moments of inertia and angular momentum alignments of nine bands in ^178W, are reproduced well by the particle-number conserving calculations, in which no free parameter is involved. Calculations demonstrate that occurrence of sharp backbending comes mainly from the contribution of high-j intruder orbitals vi13/2 or πh11/2 and their interference effect with orbitals near the Fermi surface. Theω variation of the occupation probability of each cranked orbital and the contribution to moment of inertia from each cranked orbital are analyzed.     

一种灵活的基于身份的签名方案

在基于身份的密钥提取过程中,使密钥生成器在私钥中嵌入随机数,从而使得密钥提取具有较好的灵活性,使得用户对一个身份可具备多个私钥,这无疑会增加密钥使用的安全性;基于这种新的密钥提取思路,给出一个基于身份的签名体制,新的密钥提取方式使得它具有更好的安全性和灵活性;新的基于身份的签名体制中具有最少对运算,因此,与类似的方案相比,其具备较好的计算效率;新签名体制的安全性依赖于k-合谋攻击问题(k-CAAP)的困难性,其在适应性选择消息和ID攻击下具备强不可伪造性,并且其安全性证明具有紧规约性.     

Elliptic Curves Suitable for Pairing Based Cryptography

For pairing based cryptography we need elliptic curves defined over finite fields whose group order is divisible by some prime with where k is relatively small. In Barreto et al. and Dupont et al. [Proceedings of the Third Workshop on Security in Communication Networks (SCN 2002), LNCS, 2576, 2003; Building curves with arbitrary small Mov degree over finite fields, Preprint, 2002], algorithms for the construction of ordinary elliptic curves over prime fields with arbitrary embedding degree k are given. Unfortunately, p is of size .We give a method to generate ordinary elliptic curves over prime fields with p significantly less than which also works for arbitrary k. For a fixed embedding degree k, the new algorithm yields curves with where or depending on k. For special values of k even better results are obtained.We present several examples. In particular, we found some curves where is a prime of small Hamming weight resp. with a small addition chain.AMS classification: 14H52, 14G50     

A Remark on the Fourier Pairing and the Binomial Formula for the Macdonald Polynomials

We concisely and directly prove that the interpolation Macdonald polynomials are orthogonal with respect to the Fourier pairing and briefly discuss immediate applications of this fact, in particular, to the symmetry of the Fourier pairing and to the binomial formula.     

Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions

We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups – those that tend to be zero and those that tend to be one, in an optimal integer solution. Using an initial feasible integer solution, we generate logic cuts based on our analysis before solving the problem with branch and bound. Computational testing, including the set of problems in the OR-library and our own set of difficult problems, shows our approach helps to solve difficult problems in a reasonable amount of time and, in most cases, with a fewer number of nodes in the search tree than leading commercial software.     

基于交通量均分的城市道路网络定向研究

为减少城市交通拥挤,从交通量均分的角度出发,提出了综合反映道路网络局部和整体性质的k最优定向,并且利用奇度点配对的思想为定向问题设计了启发式算法。