IN SITU SEPARATION OF ETHANOL DURING BATCH FERMENTATION WITH CO_2 STRIPPING AND ACTIVATED CARBON ADSORPTION

In situ separation of ethanol during batch fermentation with CO_2 stripping and activated carbon adsorption was studied. The higher initial glucose concentration and fermentation rate were reached due to the elimination of ethanol inhibition on the cell growth by means of CO_2 stripping. The stripped ethanol vapor was selectively adsorbed by an activated carbon column. The conde(?)sate desorbed from the adsorption column can be higher than 50% by weight. Ar unstructured model was used to simulate the experimental data satisfactorily.     

Linear reconstruction measure steered nearest neighbor classification framework

The linear reconstruction measure (LRM), which determines the nearest neighbors of the query sample in all known training samples by sorting the minimum L₂-norm error linear reconstruction coefficients, is introduced in this paper. The intuitive interpretation and mathematical proofs are presented to reveal the efficient working mechanism of LRM. Through analyzing the physical meaning of coefficients and regularization items, we find that LRM provides more useful information and advantages than the conventional similarity measure model which calculates the distance between two entities (i.e. conventional point-to-point, C-PtP). Inspired by the advantages of LRM, the linear reconstruction measure steered nearest neighbor classification framework (LRM-NNCF) is designed with eight classifiers according to different decision rules and models of LRM. Evaluation on several face databases and the experimental results demonstrate that these proposed classifiers can achieve greater performance than the C-PtP based 1-NNs and competitive recognition accuracy and robustness compared with the state-of-the-art classifiers.     

Gradient orientation pattern matching with the Hamming distance

This paper presents a novel pattern matching technique that is robust to illumination changes and the occlusion problem. The technique is based on the matching of gradient orientations in place of traditional image features such as intensities or gradients. Gradient orientations depend on the texture in an image. They are known to be insensitive to changes of image intensities that are often caused by time-varying illuminations or the auto-gain control (AGC) function of the camera. Moreover,the proposed method employs a voting strategy in the process of matching gradient orientations. The method works remarkably well even when a large part of the pattern is occluded with a foreign object. Consequently, the proposed method is robust to both irregular lighting conditions and the occlusion problem.     

Graph regularized multiset canonical correlations with applications to joint feature extraction

Multiset canonical correlation analysis (MCCA) is a powerful technique for analyzing linear correlations among multiple representation data. However, it usually fails to discover the intrinsic geometrical and discriminating structure of multiple data spaces in real-world applications. In this paper, we thus propose a novel algorithm, called graph regularized multiset canonical correlations (GrMCCs), which explicitly considers both discriminative and intrinsic geometrical structure in multiple representation data. GrMCC not only maximizes between-set cumulative correlations, but also minimizes local intraclass scatter and simultaneously maximizes local interclass separability by using the nearest neighbor graphs on within-set data. Thus, it can leverage the power of both MCCA and discriminative graph Laplacian regularization. Extensive experimental results on the AR, CMU PIE, Yale-B, AT&T, and ETH-80 datasets show that GrMCC has more discriminating power and can provide encouraging recognition results in contrast with the state-of-the-art algorithms.     

More than twenty years of advancements on Frontiers in handwriting recognition

In this paper the results of the research in handwriting/handwritten character recognition in about the last quarter of a century are reported, illustrating the results presented during the International Workshop on Frontiers in Handwriting Recognition (IWFHR) and the International Conference on Frontiers in Handwriting Recognition (ICFHR).     

Fractional-order embedding canonical correlation analysis and its applications to multi-view dimensionality reduction and recognition

Due to the noise disturbance and limited number of training samples, within-set and between-set sample covariance matrices in canonical correlation analysis (CCA) usually deviate from the true ones. In this paper, we re-estimate within-set and between-set covariance matrices to reduce the negative effect of this deviation. Specifically, we use the idea of fractional order to respectively correct the eigenvalues and singular values in the corresponding sample covariance matrices, and then construct fractional-order within-set and between-set scatter matrices which can obviously alleviate the problem of the deviation. On this basis, a new approach is proposed to reduce the dimensionality of multi-view data for classification tasks, called fractional-order embedding canonical correlation analysis (FECCA). The proposed method is evaluated on various handwritten numeral, face and object recognition problems. Extensive experimental results on the CENPARMI, UCI, AT&T, AR, and COIL-20 databases show that FECCA is very effective and obviously outperforms the existing joint dimensionality reduction or feature extraction methods in terms of classification accuracy. Moreover, its improvements for recognition rates are statistically significant on most cases below the significance level 0.05.     

An efficient parallel-network packet pattern-matching approach using GPUs

In the past few years, the increase in interest usage has been substantial. The high network bandwidth speed and the large amount of threats pose challenges to current network intrusion detection systems, which manage high amounts of network traffic and perform complicated packet processing. Pattern matching is a computationally intensive process included in network intrusion detection systems. In this paper, we present an efficient graphics processing unit (GPU)-based network packet pattern-matching algorithm by leveraging the computational power of GPUs to accelerate pattern-matching operations and subsequently increase the overall processing throughput. According to the experimental results, the proposed algorithm achieved a maximal traffic processing throughput of over 2 Gbit/s. The results demonstrate that the proposed GPU-based algorithm can effectively enhance the performance of network intrusion detection systems.     

SSI:一种IPv6/IPv4多址同源识别模型

IPv6/IPv4共存环境下多址同源识别是共存网络管理与拓扑发现的一个关键问题。现有研究主要集中于子网内部的双栈发现及单一IP协议栈中的别名解析,难以识别远程IPv6/IPv4共存网络中的多址同源。通过分析同源地址间的本质联系,提出一种IPv6/IPv4多址同源识别模型(SSI),该模型综合利用特殊地址格式匹配、TCP时钟指纹比对和上层协议短时致瘫等多种方式来提高同源地址的识别能力。实验结果表明,上述方法均可有效识别IPv6/IPv4多址同源;SSI模型具有较理想的识别率和正确率。     

氨汽提尿素装置扩能改造的可行性分析

介绍中石油宁夏石化分公司二化肥尿素装置的现状，拟采用二氧化碳汽提法对装置进行50％扩能改造，分析改造方案的可行性。