采用信息增益率的混合入侵检测模型设计

针对现有混合入侵检测模型仅定性选取特征而导致检测精度较低的问题，同时为了充分结合误用检测模型和异常检测模型的优势，提出一种采用信息增益率的混合入侵检测模型.首先，利用信息增益率定量地选择特征子集，最大程度地保留样本信息；其次，采用余弦时变粒子群算法确定支持向量机参数构建误用检测模型，使其更好地平衡粒子在全局和局部的搜索能力，然后，选取灰狼算法确定单类支持向量机参数构建异常检测模型，以此来提高对最优参数的搜索效率和精细程度，综合提高混合入侵检测模型对攻击的检测效果；最后，通过两种数据集进行仿真实验，验证了所提混合入侵检测模型具有较好的检测性能.     

LTE系统多小区上行联合功控算法

针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标，忽略了当前小区用户对邻小区用户同频干扰的问题，为提升边缘用户性能的同时兼顾系统整体性能，提出了一种LTE系统小区间上行联合功率控制（UJPC）算法。该算法采用单基站三扇区为系统模型，以最优化系统吞吐量比例公平函数为目标，首先根据最小信干噪比（SINR）约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型，然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明，与基准的开环功控方案相比，联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率，其最佳性能增益能达到50%。     

Systematic convergence of nonlinear stochastic estimators on the Special Orthogonal Group SO(3)

This paper introduces two novel nonlinear stochastic attitude estimators developed on the Special Orthogonal Group with the tracking error of the normalized Euclidean distance meeting predefined transient and steady‐state characteristics. The tracking error is confined to initially start within a predetermined large set such that the transient performance is guaranteed to obey dynamically reducing boundaries and decrease smoothly and asymptotically to the origin in probability from almost any initial condition. The proposed estimators produce accurate attitude estimates with remarkable convergence properties using measurements obtained from low‐cost inertial measurement units. The estimators proposed in continuous form are complemented by their discrete versions for the implementation purposes. The simulation results illustrate the effectiveness and robustness of the proposed estimators against uncertain measurements and large initialization error, whether in continuous or discrete form.     

稠油微生物开采技术现状及进展

综述了用微生物方法开采稠油的技术现状与进展，论题如下。①概述。②基本方法：异源微生物采油，包括微生物吞吐和微生物驱；本源微生物采油压大港孔店油田的实例。③主要机理，包括产表面活性剂，降解稠油中重质组分及其他。④技术研究，包括机理性、可行性及经济效益研究，列举了国内外6个实例。⑤现场应用，包括国外1个、国内6个实例。⑥该技术的优势及问题。参22。     

马钢二烧结配料计算机控制系统

阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理；根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨；提供了系统的主要硬件结构，软件功能和程序框图。     

针对不同地质目标的叠前时间偏移成像解释评价

随着计算机硬件和地震勘探成像技术的发展，叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标，叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢？为此，从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论，并基于某地区三维数据常规处理结果和叠前时间偏移处理结果，针对不同地质目标进行了剖析与评价。认为：叠前时间偏移成像的垂向分辨率较常规处理明显降低，但对于空间波阻抗变化明显的河流和断层，叠前时间偏移成像的空间分辨率要高于常规处理；对于小于1／4波长的叠置薄储层，叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。     

A Least Squares Approach to Escalator Algorithms for Adaptive Filtering

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.     

基于进化算法的常减压装置模拟

提出了基于优选优生进化算法（Select—best and prepotency evolution algorithm，SPEA）的常减压装置模拟方法。以各塔的温度分布为目标，基于生产过程和分析数据，采用SPEA确定各塔板Murphree效率，从而精确描述各塔板平衡偏离程度。在实际应用中，获得具有良好精度的常减压装置模型。系统分析了SPEA算法的关键参数——优选领域大小与计算复杂性及寻优性能之间的关系，结果显示其取值为群体规模的10％最为合适。     

循环伏安法在润滑油检测中的应用

介绍了循环伏安法的产生背景、原理。应用该技术可以快速、方便地对润滑油中抗氧剂、总酸（碱）值进行测定，并且可以对不同厂家润滑油的抗氧剂包进行区别。该技术还可以有效地评价润滑油的使用寿命和设备工作状况。     

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.