炼油厂碱性污水生物催化氧化预处理工艺研究

在对炼油厂碱性污水水质分析的基础上,提出采用生物催化氧化工艺对碱性污水进行预处理。试验结果表明,在水力停留时间为4 h,曝气量(标准状态)为8 m3／h的条件下,碱性污水的硫化物去除率可达90％以上,出水中的硫化物平均值为15．2 mg/L,CODCR、酚和油的去除率分别为47．5％,44．1％,50．8％,其中CODCR体积负荷为3．85 kg／(m3·d),是传统生化处理的10倍, 达到了污水预处理的目的。     

原油基压裂液研究

研制了一种适用于低压、低渗、水敏性储集层的新型原油基压裂液体系。根据基液原油的组分合成相应的增稠剂，增稠剂在原油中与交联剂反应，形成网状结构，使原油成为黏度可以调控的冻胶，从根本上改变了油基压裂液以柴油、煤油为基液的现状，降低了油基压裂液的成本，同时还提高了压裂液的抗温、抗剪切和破胶性能，并将交联时间缩短到2h以内，可以满足现场压裂施工的要求，大大降低了施工强度和压裂改造的综合成本。在青海油田进行的现场先导试验取得成功。图9表1参5     

混合动力电动汽车用电机及驱动控制器的电磁兼容设计

电机及驱动控制器作为电动汽车的关键部件,其电磁兼容设计对于保证电动汽车的可靠运行非常重要.介绍了国家十五项目中某混合动力轿车用电机及控制器系统的电磁兼容措施,分别从控制电路、信号电缆、功率电路及屏蔽机箱等工程角度进行了分析和设计.该系统的电磁兼容性符合GB/T17619-1998的要求,且已应用于实际混合动力电动汽车,运行情况良好.     

无线网络融合的安全技术研究

融合多种网络可满足用户长日寸间连接和尽可能获得较高数据传输速率的需要，但融合后的网络也将各种网络的安全缺陷带进融合网络中。这不但给融合网络的运行带进各种原有的安全问题，而且增加了一些新的安全问题。对此，文章提出了基于恢复的多重防护解决方案，并使用公钥加密算法鉴权。使用私钥对通信数据进行加密。该方案可以为系统提供可靠的安全性，并实现用户对服务的不可抵赖性。该方案还处于研究起步阶段，下一步还需要明确各层的正确行为，以及出现多个恶意节点对某个合法节点诬陷时所应采取的行动。     

一种基于混沌同步的噪音衰减算法

论文提出了一种混沌通信系统的噪音衰减算法,该算法利用混沌同步现象在接收端获得正确的噪音估计值,从而从接收信号中滤除噪音恢复出正确的信号。通过数值仿真试验表明该方法是可行的。     

基于素性检验思想的不可约多项式判断

论文将Fermat素性检验的思想运用于不可约多项式的判断,给出了一个对于不可约判断问题的Monte Carlo 算法,分析了该算法的计算复杂度问题,并且给出了次数在200以内的检验结果。     

Acquisition and pattern recognition of spectrum information of welding metal transfer

With the creation of a pattern recognition system for metal transfer mode, this article has collected five kinds of spectrum signals in gas metal arc welding (MIG, MAG and CO₂) and take them as training samples. These samples have been pretreated by computer, several key characteristic parameters of the spectrum signal have been creatively extracted, and a corresponding recognition function and a minimum-distance-classifier have been constructed. The results show that the pattern recognition of several kinds of metal transfer modes for the metal gas arc welding can be done successfully, and relative important parameters in welding process, such as the frequency of droplet transfer and the approximate diameter of each droplet, can also be obtained.     

陆东凹陷油气藏烃类组成非均质性及其意义

陆东凹陷原油和油砂抽提物中烃类的宏观组成存在着明显的非均质性。在高孔隙度(>15%)储层单元中,饱和烃的含量高,占总组成的含量均大于40%,而极性化合物则相对较低,一般不足40%;相反,在低孔隙度(<15%)储层单元中,饱和烃的含量明显降低,而极性化合物则显著增加。此外,陆东凹陷原油和油砂抽提物中烃类成熟度亦存在着非均质性:在高孔隙度储层中,原油和油砂烃类的成熟度参数高,而在低孔隙度储层中原油和油砂烃类的成熟度参数低。根据原油和油砂抽提物中烃类的宏观组成特征和成熟度参数的变化规律,提出了陆东凹陷油气聚集模式。     

Mining constrained gradients in large databases

Many data analysis tasks can be viewed as search or mining in a multidimensional space (MDS). In such MDSs, dimensions capture potentially important factors for given applications, and cells represent combinations of values for the factors. To systematically analyze data in MDS, an interesting notion, called "cubegrade" was recently introduced by Imielinski et al. [2002], which focuses on the notable changes in measures in MDS by comparing a cell (which we refer to as probe cell) with its gradient cells, namely, its ancestors, descendants, and siblings. We call such queries gradient analysis queries (GQs). Since an MDS can contain billions of cells, it is important to answer GQs efficiently. We focus on developing efficient methods for mining GQs constrained by certain (weakly) antimonotone constraints. Instead of conducting an independent gradient-cell search once per probe cell, which is inefficient due to much repeated work, we propose an efficient algorithm, LiveSet-Driven. This algorithm finds all good gradient-probe cell pairs in one search pass. It utilizes measure-value analysis and dimension-match analysis in a set-oriented manner, to achieve bidirectional pruning between the sets of hopeful probe cells and of hopeful gradient cells. Moreover, it adopts a hypertree structure and an H-cubing method to compress data and to maximize sharing of computation. Our performance study shows that this algorithm is efficient and scalable. In addition to data cubes, we extend our study to another important scenario: mining constrained gradients in transactional databases where each item is associated with some measures such as price. Such transactional databases can be viewed as sparse MDSs where items represent dimensions, although they have significantly different characteristics than data cubes. We outline efficient mining methods for this problem.