桥接多联邦系统体系结构研究与应用

进行大规模仿真,尤其是广域网上的仿真演练,多联邦互联是必经之路。实现多联邦互联有多种方法,桥接成员是其中一种。体系结构的设计是桥接多联邦系统需要解决的首要问题,对于桥接多联邦这类复杂的仿真系统,统一的体系结构对于其开发和应用都是非常重要的。本文研究了桥接成员的逻辑结构,提出了集中式、分布式以及混合式的实现结构,描述了对等式桥接多联邦与层次式桥接多联邦的互联方式;然后探讨了桥接多联邦系统的构建原则以及信息转发流程;最后给出了桥接多联邦系统的参考用例。     

基于MatLab/Simulink的GPS系统仿真

快速可靠的GPS（全球定位系统）系统仿真可对双频GPS接收机的设计、接收算法的研究提供有效的帮助。文中详细介绍了在MatLab／Simulink环境下GPS系统仿真平台构建的基本方法。首先分析了GPS系统的各个环节，说明了各模型在仿真中的实现方法；然后给出了完整的系统仿真框图，并在此平台上实现了GPS L2载波相位跟踪的仿真。结果表明该仿真平台有效、可靠。     

基于Trimmed NURBS曲面的目标RCS计算

复杂目标RCS(radar cross section)物理光学法(physical optics,PO)计算的最大难点是目标曲面之间相互遮挡关系的确定和消隐处理。首先将任意复杂目标用非均匀有理B样条(NURBS)曲面描述,并通过Cox-DeBoor算法将NURBS曲面拆分为拼接有理Bézier曲面。然后利用Trimmed NURBS技术很好地解决了物理光学积分中Bézier曲面之间的遮挡消隐问题。最后,提出了Trimmed NURBS曲面快速积分新方法,实现了导体目标物理光学散射场的快速计算。数值算例验证了方法的有效性和准确性。     

Password-Based Group Key Agreement Protocol for Client-Server Application

0 IntroductionWith the rapid advances of computer networks , moreand more users are connecting together to exchangelarge amounts of information and share useful resources .However ,the security issue is still a major gating factor fortheir full adoption; mainly due to many malicious adversariesresidingin networked environments will eavesdrop,interceptand modify the transmittedinformation.The client-server model , over past years , has enjoyedsignificant and continually increasing popularity in…     

生态型河道应用菹草修复受损水体的实验研究

为了研究将菹草引入生态型河道受损水体修复的可行性,通过室内实验系统地研究了菹草的净化效果.结果表明:菹草是修复受损水体较理想的材料,菹草对总氮(TN)、总磷(TP)和CODMn的累计去除率,在夏季分别为66.45%、91.05%和46.06%,在冬季分别为25.74%、26.59%和10.93%;菹草对水体的净化能力高于金鱼藻和狐尾藻.文中还探讨了修复过程中可能存在的二次污染问题.通过宏观的质量平衡估算,1 g菹草在1 a内可以从1 L水体中去除TN、TP和CODMn分别达到44.70、13.38和35.13 mg.     

泰山日出的气象条件及气候慨率

描述了泰山日出的壮丽景观，根据泰山日出的气象条件及气候概率，指出了泰山日出的最佳观赏时机。     

Security Architecture of Trusted Virtual Machine Monitor for Trusted Computing

With analysis of limitations Trusted Computing Group （TCG） has encountered, we argued that virtual machine monitor （VMM） is the appropriate architecture for implementing TCG specification. Putting together the VMM architecture, TCG hardware and application-oriented ＂thin＂ virtual machine （VM）, Trusted VMM-based security architecture is present in this paper with the character of reduced and distributed trusted computing base （TCB）. It provides isolation and integrity guarantees based on which general security requirements can be satisfied.     

Provable Efficient Certificateless Group Key Exchange Protocol

Certificateless public key cryptography （CL-PKC） avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.     

Escrow-Free Certificate-Based Authenticated Key Agreement Protocol from Pairings

Key agreement protocols are essential for secure communications. In this paper, to solve the inherent key escrow problem of identity-based cryptography, an escrow-free certificate-based authenticated key agreement （CB-AK） protocol with perfect forward secrecy is proposed. Our protocol makes use of pairings on elliptic curves. The protocol is described and its properties are discussed though comparison with Smart＇s protocol.     

Improved Non-Sieving Quadratic Sieve

In this paper, we give about prime numbers and Blum two theorems and one guess integers.We prove the two theorems about Blum integers.Combining the guess with the primitive non-sieving quadratic sieve,we proposed a improved non-sieving quadratic sieve（INQS）.In INQS,we not only reduce the times of squares and modulo n, but also imply another important conclusion,that is,we don＇t need to find the greatest common divisor of two integers as we do in PNQS.By some examples,we compare it with the primitive non-sieving quadratic sieve（PNQS）. It＇s faster to factor a integer by using improved non-sieving quadratic sieve than the primitive one.