pH值对城市生活污水短程硝化的影响

为实现废水处理过程中的短程硝化及反硝化脱氮中亚硝酸盐的积累以控制硝化反应的类型,以试验的方式,采用SBR工艺研究了pH值对不含海水的城市生活污水和含30%海水的城市生活污水短程硝化的影响.试验结果表明:对于不含海水的城市生活污水,单纯提高pH值来提高游离氨浓度并不一定能够实现短程硝化;对于含30%海水的城市生活污水,可直接实现短程硝化;海水盐度是实现短程硝化的影响因素之一.     

商务智能系统中两种改进的关联规则挖掘算法

根据日常商务数据的特点,提出了商业应用系统中进行数据挖掘的改进的Apriori算法和对点击流数据进行挖掘的改进的多支持度关联规则算法,并结合具体实例进行了分析.分析结果表明,2种改进的算法可以有效地提高系统数据挖掘的效率.     

湖北黄麦岭沉积变质磷灰岩选矿技术研究

黄麦岭磷矿属较易选的低品位沉积变质磷灰岩矿,通过扩能改造、回水利用等措施,不仅提高了资源的综合利用率,也为公司每年降低生产成本4 000多万元,创造了可观的经济效益.     

基于模糊神经网络的大场景人群密度估计方法 *

提出了一种估计大场景下密集人群密度的方法。该方法根据人类视觉的模糊性原理,认为用模糊集来划分人群密度范围比用确定的方法更符合人眼视知觉的认知方式,利用统计的方法确定灰度共生矩阵各指标对于各个密度类别的隶属函数;设计基于误差反向传播训练算法（BP）的模糊神经网络,计算样本模式对于各个密度类别的隶属度,并根据人群密度变化的时域连续性原理对人群密度范围进行合理估计。实验表明该方法提高了估计精度。     

结合显著度图和自适应能量线的快速图像缩放*

针对Seam Carving图像缩放方法中能量函数的局限性和动态规划算法的复杂性,提出了一种基于图像内容的快速图像缩放方法。结合基于视觉注意力模型的显著度图,完善图像内容的能量描述;同时,提出一种基于图像内容的粗、细能量线自适应机制,与层次加速动态规划一起,加速缩放效率。仿真实验结果表明,该算法在有效保护图像内容的同时,降低了算法的计算复杂度,减少了图像缩放时间。     

基于视频帧的彩色水印嵌入算法研究

为了增强水印的内容认证性,提出了视频帧中嵌入彩色水印的算法.先分别选取I帧的单色通道做DCT变换,分块后提取奇异值,将彩色水印的对应通道层做DWT变换,对低频区域置乱后提取奇异值,再将水印奇异值嵌入到载体奇异值中,然后由三色通道合成水印视频图像.最后进行了攻击实验,实验结果表明,该算法具有较好的水印提取能力和一定的鲁棒性.     

XRQ-Ⅱ型开车燃烧控制系统的结构及应用

XRQ-Ⅱ型开车燃烧控制系统由泵组、阀组、燃烧器、快速关断阀门及控制柜等组成,燃料经油枪喷嘴雾化喷出在燃烧器中安全稳定地燃烧,控制柜保证供油及点火、火焰检测.在600 kt/a硫磺制酸系统焚硫炉烘炉及催化剂升温中的实际应用表明,XRQ-Ⅱ型开车燃烧控制系统具有便于自控操作、提高焚硫炉烘炉内衬质量、缩短催化剂升温时间等优点.     

Local adaptive segmentation algorithm for 3-D medical image based on robust feature statistics

Medical image segmentation is of pivotal importance in computer-aided clinical diagnosis. Many factors, including noises, bias field effect, local volume effect, as well as tissue movement may affect the med- ical image, thus causing blurring or uneven characteristics when forming a picture. Such quality defects will inevitably impair the gray-scale difference between adjacent tissues and lead to insufficient segmentation or even leakage during tissue or organ segmentation. In the present investigation, a local adaptive segmentation algorithm for 3-D medical image based on robust feature statistics （LARFS） was proposed. By combining segmentation algorithm principles for traditional region growing （RG） and robust feature statistics （RFS）, the location and neighborhood image information of input seed point can be comprehensively analyzed by LARFS. Results show that, for different segmentation objects, under controlling the input parameter of growing factor within certain range, LARFS segmentation algorithm can adapt well to the regional geometric shape. And be- cause the robust feature statistics is applied in the contour evolution process, LARFS algorithm is not sensitive to noises and not easily influenced by image contrast and object topology. Hence, the leakage and excessive segmentation effects are ameliorated with a smooth edge, and the accuracy can be controlled within the effective error range.     

Implementing optimized pairings with elliptic nets

In this paper,we use elliptic nets to implement the optimized Ate pairings and optimal pairings on the Barreto-Naehrig curves with embedding degree 12.In order to do the arithmetic of elliptic curves over finite fields with elliptic nets,we first give some basic properties of elliptic nets associated to elliptic curves over finite fields and the expression of Miller function in terms of elliptic nets.Then we give formulae to compute some optimized pairings with elliptic nets,which is a new method to implement pairings.This method with elliptic nets has time complexity comparable to Miller’s algorithm and it can be optimized.     

Joint optimal sensing time and power allocation for multi-channel cognitive radio networks considering sensing-channel selection

In this paper,we consider a multi-channel cognitive radio network(CRN)where each secondary user(SU)can only choose to sense a subset of channels.We formulate a joint optimization problem of sensingchannel selection,sensing time and power allocation under the constraints of average transmit power budget and average interference power budget,which maximizes the CRN’s total throughput.We propose a greedy algorithm to solve the joint optimization problem,which has much less computational complexity.Moreover,it is shown that the search space of the greedy algorithm can be further pruned.Finally,numerical results demonstrate that the greedy algorithm has comparable performance to the exhaustive search algorithm.