In Silico Investigation of Potential Applications of Gamma Carbonic Anhydrases as Catalysts of CO2 Biomineralization Processes: A Visit to the Thermophilic Bacteria Persephonella hydrogeniphila,Persephonella marina,Thermosulfidibacter takaii,and Thermus thermophilus

Carbonic anhydrases (CAs) have been identified as ideal catalysts for CO₂ sequestration. Here, we report the sequence and structural analyses as well as the molecular dynamics (MD) simulations of four γ-CAs from thermophilic bacteria. Three of these, Persephonella marina, Persephonella hydrogeniphila, and Thermosulfidibacter takaii originate from hydrothermal vents and one, Thermus thermophilus HB8, from hot springs. Protein sequences were retrieved and aligned with previously characterized γ-CAs, revealing differences in the catalytic pocket residues. Further analysis of the structures following homology modeling revealed a hydrophobic patch in the catalytic pocket, presumed important for CO₂ binding. Monitoring of proton shuttling residue His69 (P. marina γ-CA numbering) during MD simulations of P. hydrogeniphila and P. marina’s γ-CAs (γ-PhCA and γ-PmCA), showed a different behavior to that observed in the γ-CA of Escherichia coli, which periodically coordinates Zn²⁺. This work also involved the search for hotspot residues that contribute to interface stability. Some of these residues were further identified as key in protein communication via betweenness centrality metric of dynamic residue network analysis. T. takaii’s γ-CA showed marginally lower thermostability compared to the other three γ-CA proteins with an increase in conformations visited at high temperatures being observed. Hydrogen bond analysis revealed important interactions, some unique and others common in all γ-CAs, which contribute to interface formation and thermostability. The seemingly thermostable γ-CA from T. thermophilus strangely showed increased unsynchronized residue motions at 423 K. γ-PhCA and γ-PmCA were, however, preliminarily considered suitable as prospective thermostable CO₂ sequestration agents.     

鄂尔多斯盆地三叠系延长组层序地层与生储盖组合特征

鄂尔多斯盆地三叠系延长组地层层序划分方案较多。在V ail经典层序地层学理论指导下,综合利用露头、岩芯、钻井、地震和古生物等资料,通过古水深分析和层序界面的识别与划分,认为将鄂尔多斯盆地三叠系延长组划分为7个三级层序更为合理,指出层序4水进体系域(生)+层序5低位体系域(储)+层序5水进体系域(盖)和层序4水进体系域(生)+层序4低位体系域(储)+层序4水进体系域(盖)是相对较佳的2套生储盖组合,并指出了鄂尔多斯盆地延长组最主要的2套生储盖勘探目的层。     

脉冲序列的快速搜索法及可信度分析

对于周期脉冲序列的信号分选识别，可采用序列搜索的时域方法[1，2]。本文将大周期内完全重复的脉冲序列分解为多个“单周期信号”．并把它们均定义为周期性信号．同时，提出了序列搜索的一种软件实现方法及密集视频脉冲信号分选的变步长、信步长快速搜索法．在此基础上，本文针对序列搜索分选法的可信度计算公式进行了推导和分析，证实了这种方法的可行性和有效性．     

连铸机油缸成套密封件国产化

本文论述了冶金行业中连铸机油缸密封件国产化的一些技术参数，同时也介绍了洪格尔型组合密封及夹布V型圈组合密封的使用特点。     

PPS：基于PROSITE数据库检索蛋白质功能位点的计算机程序

用标准Ｃ语言在ＩＢＭ－ＰＣ兼容微机上开发了基于ＰＲＯＳＩＴＥ数据库检索蛋白质序列功能位点的ＰＰＳ程序，ＰＲＯＳＩＴＥ是Ｂａｉｒｏｃｈ建立的蛋白质功能位点或结构模式的资料库，为蛋白质序列分析和结构功能研究提供了新工具。     

A Low-Complexity Multiuser Detector for Asynchronous CDMA QPSK Adaptive Antenna Array Systems

This paper proposes a low complexity joint space-time multiuser detection algorithm for asynchronous DS/CDMA antenna array systems. The proposed multiuser detector is composed of an adaptive antenna array, used as a linear beamformer, and a sliding window decorrelator. A QPSK modulation scheme is used in order to increase bandwidth efficiency. Numerical results are given in terms of Bit Error Rate (BER) under the assumption of a frequency-selective Rayleigh slow fading channel. In particular, the proposed receiver is shown to be near-far resistant, even in worst fading cases, and to exploit completely array introduction while maintaining acceptable computational complexity. The proposed architecture avoids linear filter realization of the decorrelator, which is impractical in the case of a large number of users, and operates with relatively short data frames instead of the complete information sequence. Finally, this receiver is very flexible to changes in timing configuration.     

测井曲线拐点在测井层序地层分析中的应用研究

在层序地层学研究中，层序界面的划分是基础和重要的环节，而利用测井资料分析可以进行层序界面划分和进行较长期基准面旋回识别。测井曲线的值是深度的函数，测井曲线的一阶导数表示了曲线变化的趋势和变化的快慢，在某一范围内，当一阶导数呈现符号转换时，相对应的深度点的测井值即为该范围内极大（极小）值；测井曲线的二阶导数则表示曲线的凹凸性，在某一范围内，当二阶导数呈现符号转换时，相对应的深度点代表了测井曲线的拐点，即反映曲线凹凸性变化的转折点，亦即地层的分界面。基于以上特点，提出利用测井曲线拐点进行层序界面划分的原理和方法，并结合岩心和录井资料，对白音查干凹陷达28井腾格尔组不同级次沉积旋回、地层垒积、旋回特征随沉积厚度变化特点和不同级次基准面旋回进行研究，最后得到该地层单井测井层序地层分析结果。     

On inversive maximal period polynomials over finite fields

Over finite field GF(q) withq a power of an odd primep, we characterize inversive maximal period polynomials in terms of polynomials of orderq + 1, and then we study some properties of polynomials of orderq + 1.This paper was written while the author was visiting the Institute of Information Processing, Austrian Academy of Sciences, AustriaThe author would like to thank the Institute of Information Processing, Austrian Academy of Sciences, Austria, for its hospitality and for using its facilities     

Node-pair reliability of network systems with small distances between adjacent nodes

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes.