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.     

基于机器视觉的微片状物厚度检测

针对片状颗粒厚度检测的实际需求,结合机器视觉、图像处理和嵌入式技术,设计与实现了一套基于高性能ARM11的微片状颗粒厚度检测系统。该系统以QT和S3C6410为软硬件平台,提出了利用轮廓提取和最小矩形边界框相结合的方法计算片状颗粒厚度。结果表明,该检测系统具有处理速度快,测量精度高和成本低廉等优点,满足了对颗粒厚度测量的需求。     

Ehrenfeucht-Fraïssé games in finite set theory

In this article, with Ehrenfeucht-Fraïssé games we prove that Δ₁≠Δ₀ on BFR, which implies Δ≠Δ₀ on BFR, and thus solve an open problem raised by Albert Atserias in his dissertation (Δ₀,Δ₁,Δ are fragments of first order logic and BFR is a class of finite sets which in essence is equivalent to a class of finite pure arithmetic structures with built-in BIT predicate).     

网上书店的设计思路

本文从理论构建一个电子商务应用系统——网上书店,按照软件工程的要求,对系统进行需求分析,提出一个网上购书系统的构建思路,首先对系统功能要求及系统运行要求;其次对系统总体设计、软件结构设计、系统数据库的选择与设计;最后为软件测试。