灰色预测模型在油气操作成本预测中的应用

油气操作成本是油气田生产消耗的主要项目，为了有效地控制油气操作成本，必须制定准确的油气操作成本计划。而油气操作成本在我国是最近几年才提出来的，数据项比较少，给油气操作成本预测带来一定的难度。为此，文章根据灰色预测的基本原理，采用灰色系统理论进行油气操作成本预测，就可以弥补对预测所需的数据少，而且也无须剔除不可比因素，只要所建模型能满足精度要求，预测结果就可以信赖。     

七里北地区钻井工程地质特征及提高钻速的技术途径

七里北潜伏构造南邻渡口河、北邻铁山坡,这些构造均在飞仙关鲕滩钻获良好的天然气,具有很好的勘探前景。七里北1井钻探表明,该井在飞仙关地层获天然气80×104m3,但储层埋藏深度达5600m,且侏罗系地层的钻井工程地质条件与相邻构造有显著差异,钻井速度低和钻具事故多这两大问题突出,严重制约了探井钻井速度。认真分析了七里北1井的钻井工程地质特征,有针对性地提出提高飞仙关探井钻井速度的技术途径,有利于解决钻井工程面临的突出问题,对加快该地区飞仙关鲕滩气藏的勘探速度有着重要意义。     

当前腐败现象的特点和对策分析

论述了当前腐败现象的表现和特点,分析了产生腐败现象的主要原因,提出了治理腐败现象的对策措施: 建立有效的教育机制、严格的用人机制、规范的决策机制、健全的管理机制、完善的监督机制和有力的责任追究机制,建立科学的法人治理结构并实行纪检监察机构派驻制。     

天然气产业链下游市场风险评价模型探讨

随着我国天然气主干管网的逐步形成，天然气产业链下游市场正在进入快速成长阶段，建立风险预警系统的重要性开始显现，而风险评价模型是其基础工作之一。文章在天然气产业链下游区域市场风险评价指标体系的基础上，综合运用层次分析法和灰色系统理论，建立了对天然气产业链下游区域市场风险评价的模型，并以各区域市场的用气量占全国总用气量的比重为权重，建立起完整的市场风险评价模型，可为评价天然气产业链下游市场整体市场风险时参考。     

一种分析碳酸盐岩孔隙系统数字图像的新方法

碳酸盐岩的孔隙类型多，孔径变化范围大，孔隙系统结构复杂，研究难度大。长期以来，是利用光学显微镜法、毛细管压力分析法、岩石孔隙系统复制法和图像分析仪法等方法或其中几种方法配合来研究碳酸盐岩孔隙系统。随着计算机图像技术的迅速发展和日益完善，借助该项技术通过碳酸盐岩孔隙系统数字图像来研究碳酸盐岩孔隙系统已经成为现实。文章提出一种研究碳酸盐岩孔隙系统数字图像的新方法。通过样品光薄片的光学显微镜（OM）数字图像和环境扫描电子显微镜（ESEM）数字图像二值化识别孔隙；构造孔隙度、孔隙贡献率和孔隙形状参数的计算公式用于数字图像分析，得到孔隙大小分布和孔隙形状分布。在此基础上，总结碳酸盐岩孔隙参数对其渗透率的控制作用。与传统的孔隙系统研究方法相比，该方法与计算机图像技术紧密结合，具有定量、快速的明显优势。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

抵御已知/选择明文攻击的混沌图像加密算法

论文在对现有一类典型图像混沌加密算法的分析基础上,提出了一种改进的图像混沌加密算法。该算法引入小波变换,可以有效地克服一些混沌加密算法不能抵御已知/选择明文攻击的缺陷。     

彩色AC-PDP运动图像仿真系统的开发

开发了彩色AC-PDP运动图像仿真系统,通过利用本系统的运动图像仿真功能可以对现有的各种显示技术、与子场有关的各种因素进行仿真及比较,为人们开发提高彩色AC-PDP图像显示质量的新型技术及子场提供了理论上的依据;通过利用本系统的Gamma特性研究功能可以对彩色AC-PDP中视频信号的反Gamma特性进行研究,并对反Gamma相关编码进行子场逼近,为选择符合要求的子场编码提供了判据.     

刑事图像技术的应用与研究

刑事图像技术是刑事科学的重要组成部分：是检验、固定痕迹物证的一种方法。刑事图像的重大应用在于扩大人类的视野，显示肉眼看不到或看不清的重要细节，以便揭露和证实犯罪。     

改进LSB算法及其在BMP图像中的应用

首先分析了BMP图像文件格式，然后根据传统LSB算法在BMP图像文件中应用，提出一种改进的LSB隐藏算法，提高了伪装图像质量。最后通过仿真验证了该算法的优越性。