链路容量调整方案的控制原理分析

介绍了OTN／SDH传输网中虚级联信号的链路容量调整方案LCAS协议以及虚级联成员源端和宿端状态机的控制原理。     

Turbo码的基本原理及其发展状况

介绍Turbo码的编译码基本原理,分析Turbo码的优异性能并指出其存在的问题,最后简要介绍其发展状况。     

多E1反向复用芯片中数据同步电路的设计及实现

简单介绍了多E1反向复用芯片的工作原理及虚级联技术,并重点介绍了用verilong语言完成的4路E1反向 复用FPGA芯片中数据同步电路的设计。     

高速公路空心梁桥的拼宽设计

通过对一座预应力混凝土空心梁桥进行拼宽分析,确定了新老空心梁混凝土收缩、徐变差异、基础沉降差异和汽车荷载对拼接缝和老桥的影响,指出了铰接空心梁拼接刚接空心梁是可行的。     

断层封堵分析技术在油气地质勘探中的应用

对以断层为油气圈闭边界的地区，需要进行断层的封堵性分析，它是勘探阶段油气的保存、可能性的运移路线，含油气区的扩储评估的一个重要分析手段。在开发阶段它对储层的优化管理、二次开发利用可起到指导作用。断层封堵分析主要包括三个方面：一是区域上的地质物探资料分析，心可能寻找掌握对断层封堵分析有关的信息，诸如岩性，压力，地化，构造发展史，沉积环境等方面的资料，从而基本确定本地区封堵和不封堵新层样本，了解所研究     

基于SDH的ASTN中的级联研究

实现基于SDH的ASTN具有很大的实际意义。本文描述了ASTN的控制平面和SDH中相邻级联和虚级联的基本概念,并在基于SDH的ASTN仿真平台中进行了仿真,给出了仿真数据,比较了对业务采用虚级联或相邻级联方式处理的优缺点。     

Concatenation Algorithms for Parallel Numerical Simulation of Radiation Hydrodynamics coupled with Neutron Transport

Complex physical phenomena can be usually split into several interacting physical computational models and can be numerically simulated by coupling parallel codes individually designed for these models. Besides rational splitting and efficient numerical methods for different models, we must design scalable parallel algorithms to concatenate these parallel codes. Meanwhile, three objectives should be well balanced. The first is how to efficiently transfer data among multiple physical models, the second is how to inherit original scalability of parallel codes and then ensure good scalability of full simulation, and the third is how to ensure independent or simultaneous developments of codes by different research groups. This paper presents two concatenation algorithms for parallel numerical simulation of radiation hydrodynamics coupled with neutron transport on unstructured grid. The first, Full Loose Concatenation Algorithm, focuses on independent development and inheritance of original scalability, and the second, Two Level Compact Concatenation Algorithm, focuses on optimal tradeoff among above three objectives. Theoretical analysis for communicational complexity and parallel numerical experiments using hundreds of processors on two parallel machines have shown that these two algorithms are efficient and can be generalized to other parallel numerical simulations for hydrodynamics coupled with radiation or neutron transport. In particular, the second algorithm is linearly scalable and has achieved theoretical optimal performance.     

RNA‐Templated Concatenation of Triplet Nucleic‐Acid Probe

Template‐directed synthesis offers several distinct benefits over conventional laboratory creation, including unsurpassed reaction rate and selectivity. Although it is central to many biological processes, such an approach has rarely been applied to the in situ synthesis and recognition of biomedically relevant target. Towards this goal, we report the development of a three‐codon nucleic‐acid probe containing a C‐terminal thioester group and an N‐terminal cysteine that is capable of undergoing template‐directed oligomerization in the presence of an RNA target and self‐deactivation in its absence. The work has implications for the development of millamolecular nucleic‐acid probes for targeting RNA‐repeated expansions associated with myotonic dystrophy type 1 and other related neuromuscular and neurodegenerative disorders.     

Efficient Algorithms for Computing Conservative Portal Visibility Information

The number of polygons in realistic architectural models is many more than can be rendered at interactive frame rates. Typically, however, due to occlusion by opaque surfaces (e.g., walls), only small fractions of such models are visible from most viewpoints. This fact is used in many popular methods for preprocessing visibility information which assume a scene model subdivided into convex cells connected through convex portals. These methods need to establish which cells or parts thereof are visible to a generalized observer located within each cell. The geometry of this information is termed a 'visibility volume' and its computation is usually quite complex. Conservative approximations of viewing volumes, however, are simpler and less expensive to compute. In this paper we present techniques and algorithms which permit the computation of conservative viewing volumes incrementally. In particular, we describe an algorithm for computing the viewing volumes for a given cell through a sequence of ' m ' portals containing a total of ' n ' edges in O m n time.