浅谈集装箱装运危险货物瞒报谎报行为的查处方法

本文通过对危险货物瞒报谎报行为形成原因的研究,提出查处该行为的基本方法,以利于海事部门找到相应处理对策。     

秦沈客运专线无线通信工程设计

秦沈客运专线无线系统包括无线列调系统及数字集群移动通信系统。无线列调系统实现列车无线调度功能。数字集群移动通信系统解决移动人员 (工务、电务、桥梁、车站、公安等 )的地面通话 ,取消通话柱。在车站 ,设置基站、车站无线列调电台 ;在区间点无人看守处 ,设置光纤射频直放终端设备。     

关于R0的有限子群的注记

过定点O的旋转群R0是无限群，从视直线为旋转轴出发讨论，R0的有限子群（除单位元群外）共有6种类型。     

A Distributed Authentication Algorithm Based on GQ Signature for Mobile Ad Hoc Networks

Introduction Mobile ad hoc networks (MANETs) are newinfrastructureless networks without the usual rout-ing infrastructure like fixed routers and routingbackbones. A mobile ad hoc network is a multi-hop temporary self-organizing system compromisedof a group of mobile nodes with radios. MANETshave some special characteristics: self organizing,dynamic topology, limited bandwidth, resourceconstraint nodes, multi-hop routing, vulnerable tosecurity attacks etc. Recently, MANET has beenone of t…     

F-Decomposition of Noetherian Modules over Hyper-（Cyclic or Finite）Groups

Let F be a locally defined formation consisting of locally soluble groups，G a hyper-(cyclic or finite)locally soluble group and A a noetherian ZG-module with all irreducible ZG-factors being finite，G∈F,f(∞)≌f(p)，f(P)≠Фfor each P∈π．The following conclutions are obtained：(1)if there exists a maximal submodule B of A such that A／B is F central in G and B has no nonzero F centml ZG-factors，then A has an F decomposition；(2)if there exists an irreducible F central submodule B of A such that all ZG-composition factors of A／B are F ecentric，then A has an F decomposition．     

环山河小水库群调洪演算技术路线

针对环山河小水库群不同于一般小水库的特殊情况,通过试算、分析,提出了适合该小水库群的调洪演算方法。     

采用重锤冲击钻施工深孔桩基础的质量控制

根据在内蒙古自治区乌海黄河大桥的监理过程,介绍了深孔群桩中的重锤冲击的施工方法及整体质量保障措施,着重反映了根据不同地质特征利用重锤冲击方法处理深孔群桩的施工技术。     

Democratic group signatures with linkability from gap Diffie-Hellman group

Democratic group signatures(DGSs) attract many researchers due to their appealing properties, i.e., anonymity, traceability and no group manager.Security results of existing work are based on decisional Diffie-Hellman(DDH) assumption.In this paper, we present a democratic group signature scheme based on any gap Diffie-Hellman(GDH) group where DDH problem is easily but computational Diffie-Hellman(CDH) problem is hard to be solved.Besides the properties of ordinary DGSs, our scheme also provides the property of linkability, i.e., any public verifier can tell whether two group signatures are generated using the same private key.Security properties of our scheme employ a new and independently interesting decisional product Diffie-Hellman(DPDH) assumption which is weaker than DDH one.