满足资源约束的图像复原算法的FPGA实现

提出了一种基于Van Cittert迭代方法对被乘性噪声污染的观测图像快速复原处理的FPGA电路实现方法。通过研究点扩展函数的对称性,将图像邻域内的像素进行分组滤波运算,明显减少了电路对乘法器数量的要求,有效地利用了FPGA的资源,适当地安排流水线和并行处理单元显著地提高了芯片的运行速度。实验结果表明,对于相同的图像复原处理任务,提出的电路结构需要的逻辑单元数量更少,时间消耗更短。     

Computer implementation of efficient discrete-convolution algorithms

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 129–139, January–February, 1994.     

On the constraint function method for contact problems

The objective in this paper is to present some theoretical insight and valuable numerical experiences for the analysis of contact problems. We review the theoretical basis of the constraint function method for general contact problems and discuss some important characteristics of the method. In the presentation, we consider static and dynamic conditions. We then give numerical experiences with the method through the solution of some demonstrative test problems and through the results obtained in some industrial analysis cases.     

基于Client/Server数据完整性约束的实现技术

主要讨论基于Client/Server数据完整性约束及其如何实施了企业业务规则，并以SQLServer和PowerBuilder5．0为例，介绍了数据完整性约束的实现技术。     

Computer implementation aspects for fluid-structure interaction problems

In this paper the computer implementation aspects for fluid-structure interaction problems are presented. Special attention is placed on finite element fluid modelling, implicit-explicit transient algorithms and finite rotation effects in numerical integration of rate constitutive equations arising in large-deformation analysis. All these methodologies have been integrated into a working finite element computer code.     

基于平行性约束的位姿测量方法研究

提出新的有效的位姿测量算法。该方法使用共面特征点, 利用投影变换中的平行性约束等仿射不变量快速求得特征点摄像机坐标系空间深度值, 并作为初值求解以特征点几何约束条件建立的无约束非线性最优化目标函数, 保证最终解的精确性和收敛性。搭建实验系统验证了算法的有效性, 并与最小二乘法进行比较, 该算法有效减少了计算过程中的迭代次数, 提高了运算速度。该结果为应用单目视觉进行工业实时在线测量提供了一种新的方法。     

约束规划方法在原油混输调度中的应用

应用约束规划方法建立炼厂原油混输模型,并通过搜索求解获得可操作的调度方案。约束规划允许以逻辑约束表达混输过程中的操作规则,使模型简洁直观,而对整型变量及非线性约束不敏感,则降低了模型的求解难度。选取了一个时间跨度为300小时实际调度问题作为案例,模型中包含约8000个变量和14000条约束,在普通PC机上计算求解,能够在30秒内获得调度方案,方案具有可操作性且优于人工方案,表明以约束规划方法解决原油混输调度问题是可行的。     

Computational implementation of the polarization propagator method

A computational implementation of the polarization propagator method is outlined. The program is constructed so that, in principle, there are no limitations either on the size of the basis set or on the size of the particle-hole excitation space. The lists of two-electron integrals and propagator matrices are both assumed to be too large to be kept in primary storage. A list of symbolic matrix elements is generated and the individual terms which contribute to the matrix elements are reordered so that the list of two-electron integrals can be processed sequentially. Timings for the various steps of the program are given for CO₂ as a test case. It is shown that a major part of the computational effort goes into the construction of the B(2) matrix and that the CPU and I/O times are comparable.     

The normalized normal constraint method for generating the Pareto frontier

The authors recently proposed the normal constraint (NC) method for generating a set of evenly spaced solutions on a Pareto frontier – for multiobjective optimization problems. Since few methods offer this desirable characteristic, the new method can be of significant practical use in the choice of an optimal solution in a multiobjective setting. This papers specific contribution is two-fold. First, it presents a new formulation of the NC method that incorporates a critical linear mapping of the design objectives. This mapping has the desirable property that the resulting performance of the method is entirely independent of the design objectives scales. We address here the fact that scaling issues can pose formidable difficulties. Secondly, the notion of a Pareto filter is presented and an algorithm thereof is developed. As its name suggests, a Pareto filter is an algorithm that retains only the global Pareto points, given a set of points in objective space. As is explained in the paper, the Pareto filter is useful in the application of the NC and other methods. Numerical examples are provided.     

#br# 一种面向枚举类型的配置约束提取方法

有研究表明软件配置故障已成为导致计算机系统异常和崩溃的一个重要因素。配置故障是由于用户无法充分地获取配置约束的信息进行误配置造成的,由于用户缺乏软件领域知识,配置故障难以避免。因此,如何对软件配置项的约束条件进行精确的分析和提取,从而为软件配置的故障诊断与修复提供依据,具有重要的研究意义。具体而言,枚举类型作为软件系统的常用类型,其取值空间的限制经常导致系统软件配置故障。基于此系统调研了6款常用的C/C++开源软件,包括Apache Httpd、Nginx、Postfix、MySQL、Redis和PostgreSQL的枚举类型配置约束特性,并针对已有方法存在枚举类型配置项取值空间漏报的问题,基于程序分析的方法设计和实现了面向枚举类型配置的自动化配置约束提取方法,大幅提高了针对以上开源软件的配置约束提取准确率,提升了软件配置的可用性和配置故障诊断能力。     

基于约束满足的测试计划方法

测试经理在制定测试计划时,往往只能依靠个人经验,缺乏理论方法的指导,面对复杂软件系统时难以全面考虑测试模块间关系及测试人员能力等复杂因素,往往使得测试效果并不令人满意.将约束规划技术引入测试领域,结合测试计划自身特点,提出了一种全新的基于约束满足的测试计划方法.方法将软件产品划分为测试模块,通过确定各模块测试过程及过程间顺序约束、资源能力约束,对测试计划问题进行了约束建模和求解.并以项目管理软件SoftPM的测试过程为例,对方法的具体应用进行了介绍.     

Geometric constraint solving: The witness configuration method

Geometric constraint solving is a key issue in CAD, CAM and PLM. The systems of geometric constraints are today studied and decomposed with graph-based methods, before their numerical resolution. However, graph-based methods can detect only the simplest (called structural) dependences between constraints; they cannot detect subtle dependences due to theorems. To overcome these limitations, this paper proposes a new method: the system is studied (with linear algebra tools) at a witness configuration, which is intuitively similar to the unknown one, and easy to compute.     

带非线性等式约束无迹卡尔曼滤波方法

针对带非线性等式约束的非线性系统的状态估计问题,给出了一种新形式的基于无迹卡尔曼滤波及伪观测手段的处理约束的状态估计方法（SPUKF）。在该方法中原动态系统被虚拟地分离成两个并行的子系统,各时刻的状态估计由基于这两个子系统构建的两套滤波链交替得到。相对于伪观测法中的序贯形式估计器,SPUKF无需事先确定观测及约束的处理次序且能获得更好的估计结果,故可以用来解决序贯方法中观测与约束的处理次序问题。由钟摆运动的实例仿真结果看到,SPUKF不仅有好于序贯形式无迹卡尔曼滤波的估计效果,误差改善比达到22%左右,而且算法运行时间与序贯形式估计器相近。此外,其估计效果还与批处理无迹卡尔曼滤波相当。     

使用汉明距离约束的LBP人脸识别算法

提出了一种新的使用汉明距离约束的LBP（局部二值化模式）人脸识别算法。传统的LBP算子使用一致性模式（Uniform Pattern）来描述图像的局部特征,并且把其他非一致性模式都归并到另外的一个类中去,对于受光照和表情变化影响的图像,这种方法的准确性会降低。假定光照、姿态、表情的影响都可以看作是某种“噪声”,把信道编码中广泛应用的汉明距离引入到LBP算法中,减少由于这些噪声干扰产生的错误率。在FRGC上的实验结果显示：对于无约束环境下的人脸图片来说,该方法要优于传统的基于LBP的人脸识别方法。