带宽受限网络化系统的广义H2滤波

研究了一类带宽受限网络化系统的广义H2滤波问题. 滤波器采用量化后的测量信号作为其输入信号, 采用对数量化器, 将滤波误差系统建模成范数有界不确定时滞系统. 利用Lyapunov 稳定性理论和线性矩阵不等式(LMI)技术, 得到了滤波误差系统渐近稳定的充分条件以及滤波器的设计方法. 数值示例验证了所给算法的可行性.     

最坏情况下#3-SAT问题最小上界

最坏情况下#SAT问题上界的研究已成为一个热门的研究领域.#SAT问题的时间复杂性是根据问题实例的大小所组成的函数计算所得.#SAT问题实例的大小不仅依赖于变量的数量,还依赖于子句的数量.以子句数量为参数研究#SAT问题在最坏情况下的上界,不仅可以从另一个角度衡量算法的好坏,而且在某种程度上更能准确地反映出算法的性能.首先从子句数量的角度证明了之前提出的基于扩展规则的模型计数算法(CER算法)的上界O(2m),其中m是公式中子句的数量.为了提高#3-SAT问题的求解效率,采用了多种分裂规则,进一步给出了一种基于Davis-Putnam-Logemann-Loveland(DPLL)的#3-SAT算法MCDP.通过分析该算法得到了以子句数量为参数的#3-SAT问题在最坏情况下的上界O(1.8393m).     

一种最大向量平均个数的估计方法

提出一种估计n个d维向量中最大向量平均个数的方法。该方法通过分析单个向量与其他向量子集的支配关系,求出最大向量平均个数的解析式。证明解析式满足已知的递归关系,得到最大向量平均个数的近似估计。与已有方法相比,该方法可应用到估计k个其他向量支配的平均个数问题。     

关系数据库近似匹配查询方法研究

针对传统海量数据精确查询负载过大的问题,引入基于仿真的置信区间自动抽样方法(Bootstrap)对数据库提供支持。通过对部分或采样数据进行查询,将查询简化到基础数据上,在对整个数据集查询一次的时间内,完成对多个样本重复多次的查询,得到数据库查询的置信区间;再进行基础SQL查询,得到符合用户要求的近似结果。实验结果表明,引入Bootstrap方法进行数据查询是有效的。     

基于防反射边界的图像分块反降晰研究

为降低图像反降晰过程的复杂度,提出一种新的反降晰算法。对图像进行适当的分块,导入合适宽度的防反射边界条件,消除其他类型边界条件导致的法向导数不连续的缺陷。实验结果表明,在与全局反降晰算法信噪比相当的情况下,具有合适分块数目和较小边界宽度的新算法能更有效地减少图像反降晰时间。     

An efficient optimal algorithm for the quantity discount problem in material requirement planning

An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various environments has been developed. Experimental results show that the performance of our optimal algorithm is much better than the performance of other existing optimal algorithms. Considering computational time as the performance measure, this algorithm is considered the best among the existing optimal algorithms for real problems with large dimensions (i.e. large number of periods and discount levels).     

The labeled maximum matching problem

Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the labeled maximum matching problem. It is a relatively new problem whose application is related to the timetabling problem. We prove it is NP-complete and present four different mathematical formulations. Moreover, we propose an exact algorithm based on a branch-and-bound approach to solve it. We evaluate the performance of our algorithm on a wide set of instances and compare our computational times with the ones required by CPLEX to solve the proposed mathematical formulations. Test results show the effectiveness of our procedure, that hugely outperforms the solver.     

Least trace extended set-membership filter

To improve the consistency of estimation result, a least-trace extended set-membership filter (LTESMF) is presented for a class of nonlinear stochastic systems, which has linear output and unknown- but-bounded noise. Feedback technique is used instead of the intersection of ellipsoid-sets in the measurement update. The feedback parameter is optimized in order to minimize the trace of error bounded ellipsoid’s envelop matrix. A new stability analysis method was developed to prove the stochastic system’s stab...     

六角网格系统下的多边形填充算法

针对六角网格系统下图形、图像处理及显示时像素之间相邻的唯一性,挺出六角网格系统下的多边形填充算法,其中包括边界填充算法和扫描线填充算法,采用图示与伪代码的方法描述箅法。与矩形网格上的图像处理算法相比,六角网格系统上的图像处理算法具有更好的唯一性和简便性。     

交互式凸组合法的混合时滞不确定中立系统的稳定性

针对带分布时滞和离散时滞的不确定中立型系统进行稳定性研究. 基于交互式凸组合方法和下界引理, 通过构造恰当的李雅普诺夫泛函, 适当分割时滞区间, 处理一组由凸参数逆加权的正函数线性组合(交互式凸组合), 给出线性矩阵不等式形式的系统鲁棒稳定性判据. 该方法允许离散时滞为变时滞, 增强了系统的鲁棒性能. 数值算例验证了所得结果的有效性和合理性.