Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

基于逻辑回归模型的木片和树皮的图像识别

为了提高木片生物能的利用率,需要除去木片中的树皮杂质。识别木片和树皮的图像对于实现二者分离具有重要作用。提出一种基于逻辑回归模型来对木片和树皮进行图像识别的算法。算法流程包括计算各种可以描述木片和树皮纹理的参数,利用SAS统计分析出最佳参数,将最佳参数计算所得的样本数据用于SAS LOGISTIC过程得到预测方程,再将预测方程用于逻辑回归模型来实现木片和树皮的图像识别。通过实验可知,最佳参数为灰度方差,该图像识别算法的正确率能达到97.4%。     

Point-augmented biquadratic C1 subdivision surfaces

Shape artifacts, especially for convex input polyhedra, make Doo and Sabin’s generalization of bi-quadratic (bi-2) subdivision surfaces unattractive for general design. Rather than tuning the eigenstructure of the subdivision matrix, we improve shape by adding a point and enriching the refinement rules. Adding a guiding point can also yield a polar bi-2 subdivision algorithm. Both the augmented and the polar bi-2 subdivision are complemented by a new Primal Bi-2 Subdivision scheme. All surfaces are $C^1$ and can be combined.     

基于细胞神经网络和网格特征的碑刻文字识别

碑刻作为文字的载体,具有极其重要的历史价值和艺术价值。但是,因为时间的久远,其拓本大量的噪声对碑刻文字的辨识产生一定的影响。针对这种情况,提出了一种新方法,首先利用细胞神经网络（CNN）技术,去除单个碑刻文字的噪声,然后用网格特征提取方法对其进行识别。本文在MATLAB平台上进行了实例模拟,取得了较好的效果。     

Locally linear discriminant embedding: An efficient method for face recognition

In this paper an efficient feature extraction method named as locally linear discriminant embedding (LLDE) is proposed for face recognition. It is well known that a point can be linearly reconstructed by its neighbors and the reconstruction weights are under the sum-to-one constraint in the classical locally linear embedding (LLE). So the constrained weights obey an important symmetry: for any particular data point, they are invariant to rotations, rescalings and translations. The latter two are introduced to the proposed method to strengthen the classification ability of the original LLE. The data with different class labels are translated by the corresponding vectors and those belonging to the same class are translated by the same vector. In order to cluster the data with the same label closer, they are also rescaled to some extent. So after translation and rescaling, the discriminability of the data will be improved significantly. The proposed method is compared with some related feature extraction methods such as maximum margin criterion (MMC), as well as other supervised manifold learning-based approaches, for example ensemble unified LLE and linear discriminant analysis (En-ULLELDA), locally linear discriminant analysis (LLDA). Experimental results on Yale and CMU PIE face databases convince us that the proposed method provides a better representation of the class information and obtains much higher recognition accuracies.     

基于概念的形状分类与识别

基于内容的图像检索已经成为图像检索的一个重要研究方向。其中利用形状特征可以实现形状较为明显的各类图像库的检索。该文对图像形状特征的提取和描述方法进行了较深入地研究,选取其中一部分特征值,分别利用BP神经网络和支持向量机进行形状识别,取得令人满意的实验效果。     

浅谈网络病毒及防治

随着计算机网络的普及发展,网络安全问题日益突出,网络病毒的迅速传播、再生、发作比单机病毒有着更大的危害,计算机网络病毒的危害已不仅是针对网络,其危害已经具有社会性。对企业及个人用户的破坏性正在加速,在全世界范围内造成了很大的经济和社会损失,网络病毒问题必须引起人类的足够的重视。     

Molecular simulation of phase coexistence: Finite-size effects and determination of critical parameters for two- and three-dimensional Lennard-Jones fluids

Abstact The subject of this paper is the investigation of finite-size effects and the determination of critical parameters for a class of truncated Lennard-Jones potentials. Despite significant recent progress in our ability to model phase equilibria in multicomponent mixtures from direct molecular simulations, the accurate determination of critical parameters remains a difficult problem. Gibbs ensemble Monte Carlo simulations with systems of controlled linear system size are used to obtain the phase behavior in the near-critical region for two- and three dimensional Lennard-Jones fluids with reduced cutoff radii of 3, 3.5, and 5. For the two-dimensional systems, crossover of the effective exponent for the width of the coexistence curve from mean field ( = 1/2 in the immediate vicinity of the critical point to Ising-like (= 1/8) farther away is observed. Critical parameters determined by fitting the data that follow Ising-like behavior are in good agreement with literature values obtained with finite-size scaling methods. For the three-dimensional systems, no crossover to mean field-type behavior was apparent. Extrapolated results for the critical parameters are consistent with literature estimates for similar fluids. For both two- and three-dimensional fluids, system size effects on the coexistence curves away from the critical point are small, normally within simulation statistical uncertainties.Invited paper presented at the Twelfth Symposium on Thermophysical Properties, June 19–24, 1994, Boulder. Colorado, U.S.A.     

探索新体系 形成新特色──编写《电力系统分析》教材的体会和作法

本文介绍了作者在总结教学改革和课程建设成果的基础上编写《电力系统分析》教材的体会和作法。指导思想是‘探索新体系,形成新特色”。针对课程本身的任务和学科的系统性,将全书分为三篇：电力系统的基础知识;电力系统的基本计算和电力系统的运行分析。特色为：注重学生能力的培养;少而精;适时反映学科的发展与进步。配套：思考题、习题及计算机辅助教学软件包（ＣＡＩ）。     

地铁站场景下的可行驶区域检测

在室内环境下的机器人视觉导航任务中,可行驶区域检测是不可或缺的一部分,这是保证自动驾驶任务实现的基础.目前较多的解决方法是对数据集中出现过的障碍物进行识别来检测可行驶区域,缺乏灵活性,因此本文提出了一种针对地铁站等室内平坦地面的可行驶区域检测方法,提高实用性.本文采用经典的MobileNetV3网络对采集到的前方图像进行分类,判断是否为地面区域.由于室内地面的地标、箭头等贴纸的影响,因此需要对非地面区域进一步判断,与常规的立体障碍物进行区分.本文利用连续帧之间的特征点匹配获得相机移动距离,并利用直线拟合计算斜率的方法达到区分立体障碍物与平面地标的目的.实验表明,本文提出的方法能较好地检测机器人前方可行驶区域,具有较高的实用价值.