The distributed representation for societal risk classification toward BBS posts

The risk classification of BBS posts is important to the evaluation of societal risk level within a period. Using the posts collected from Tianya forum as the data source, the authors adopted the societal risk indicators from socio psychology, and conduct document-level multiple societal risk classification of BBS posts. To effectively capture the semantics and word order of documents, a shallow neural network as Paragraph Vector is applied to realize the distributed vector representations of the posts in the vector space. Based on the document vectors, the authors apply one classification method KNN to identify the societal risk category of the posts. The experimental results reveal that paragraph vector in document-level societal risk classification achieves much faster training speed and at least 10% improvements of F-measures than Bag-of-Words. Furthermore, the performance of paragraph vector is also superior to edit distance and Lucene-based search method. The present work is the first attempt of combining document embedding method with socio psychology research results to public opinions area.     

Margin optimization algorithm for digital subscriber lines based on particle swarm optimization*

The margin maximization problem in digital subscriber line (DSL) systems is investigated. The particle swarm optimization (PSO) theory is applied to the nonconvex margin optimization problem with the target power and rate constraints. PSO is a new evolution algorithm based on the social behavior of swarms, which can solve discontinuous, nonconvex and nonlinear problems efficiently. The proposed algorithm can converge to the global optimal solution, and numerical example demonstrates that the proposed algorithm can guarantee the fast convergence within a few iterations.     

Synthesis of N-acetamide C60 nitride and its performance of optical limiting

N-acetamide C₆₀ nitride (N-acetamide-1,2-dihydro-1,2-aza-fullerene [60]) has been synthesized by the reaction of C₆₀ and azidoacetamide and initially characterized. Its mechanism was that the objective product is formed through intermediate triazoline. The computational study shows that N-nitride structure is thermodynamically more stable by using the semi-empirical AM1 SCF-MO method. The properties of optical limiting were tested by using double frequency Nd: YAG pulse laser system and showed that the optical limiting mechanism is reverse saturation absorption. At wavelength of 532 nm, compared with optical limiting for ns pulse, this new material has good optical limiting character for ps pulse. At wavelength of 707 nm, the capacity of optical limiting of the derivative is prior to C₆₀.     

基于HTCPN的飞机维修保障资源配置方法

针对飞机基层级维修保障资源配置问题,提出了一种基于分层赋时着色Petri网(hierarchical timed colored Petri net, HTCPN)的维修保障资源配置方法。首先,根据飞机基层级维修保障工作内容及流程,运用CPN Tools软件,构建飞机维修保障全过程的HTCPN仿真模型,设计仿真时钟折算方法。其次,提出维修保障资源配置规则,建立基于飞机出动架次率的维修保障资源配置模型。最后,算例分析结果表明所提方法能够迅速、准确地完成飞机基层级维修保障资源配置。所提方法为科学制定飞机基层级维修保障配置方案提供了技术支撑,具有一定的工程应用价值。     

水泥窑协同处置生活垃圾的燃烧特性分析优化

针对传统方法难以分析掺烧生活垃圾后的水泥窑复杂燃烧特性的问题,引入数据挖掘技术,以国内某水泥厂为对象,采集相关参数数据,使用稳定性选择算法分析各参数对煤耗与NO_x排量的影响系数,通过随机森林算法建立煤耗与NO_x排量的数学模型,结合K-means聚类算法得出关键优化参数及其最优值。结果表明,该方法能够建立精确的煤耗与NO_x排量模型,挖掘出节能减排的关键优化参数及其最优目标值。通过改善关键优化参数至最优值,能够大大降低煤耗与NO_x排量,可指导水泥厂优化窑内燃烧特性。     

基于参照点收益价值函数化的资产选择模型

诺贝尔经济学奖得主丹尼尔.卡尼曼及其合作者阿莫斯.特沃斯基的展望理论指出决策行为会受到价值函数形式的影响。本文首先介绍展望理论,给出若干具体的价值函数形式,在考虑投资者决策受价值函数影响的基础上建立基于对参照点收益价值函数转化的若干资产选择模型,从直觉上能够判断出这些模型更加符合投资决策心理和行为,而实证结果也表明这些资产选择模型能够有效地降低负离差风险。     

ISAR target recognition based on non-negative sparse coding

Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar (ISAR) target recognition, this paper imports the concept of visual perception and presents a novel method, which is based on the combination of non-negative sparse coding (NNSC) and linear discrimination optimization, to recognize targets in ISAR images. This method implements NNSC on the matrix constituted by the intensities of pixels in ISAR images for training, to obtain non-negative sparse bases which characterize sparse distribution of strong scattering centers. Then this paper chooses sparse bases via optimization criteria and calculates the corresponding non-negative sparse codes of both training and test images as the feature vectors, which are input into k neighbors classifier to realize recognition finally. The feasibility and robustness of the proposed method are proved by comparing with the template matching, principle component analysis (PCA) and non-negative matrix factorization (NMF) via simulations.     

Variational discretization for parabolic optimal control problems with control constraints

This paper studies variational discretization for the optimal control problem governed by parabolic equations with control constraints.First of all,the authors derive a priori error estimates where |||u-U₍h|||_L∞（J;L²（Ω））=O（h²+k）.It is much better than a priori error estimates of standard finite element and backward Euler method where |||μ-U_h|||₍L∞（J;L²（Ω））=O（h+ k）.Secondly,the authors obtain a posteriori error estimates of residual type.Finally,the authors present some numerical algorithms for the optimal control problem and do some numerical experiments to illustrate their theoretical results.     

导弹子母弹抛撒的均匀性指标的确定及评定方法

本文以导弹侵彻子母弹抛撒为背景,提出了一种适合于有限子弹抛撒的均匀性指标,并且运用现代统计方法——ＢａｙｅｓＢｏｏｔｓｔｒａｐ法模拟了均匀性指标统计量的分布;另外,从火力运用的观点出发,根据子母弹抛撒的均匀性指标的大小对战斗部毁伤效率的影响,确定了均匀性指标的容许下限;应用统计检验方法给出了子母弹抛撒的均匀性的评定方法,为导弹侵彻子母弹抛撒的鉴定及同类武器该项目的鉴定提供可信且便于操作的方法。     

Fast method for spreading sequence estimation of DSSS signal based on maximum likelihood function

To estimate the spreading sequence of the direct sequence spread spectrum (DSSS) signal, a fast algorithm based on maximum likelihood function is proposed, and the theoretical derivation of the algorithm is provided. By simplifying the objective function of maximum likelihood estimation, the algorithm can realize sequence synchronization and sequence estimation via adaptive iteration and sliding window.since it avoids the correlation matrix computation, the algorithm significantly reduces the storage requirement and the computation complexity. Simulations show that it is a fast convergent algorithm, and can perform well in low signal to noise ratio (SNR).