基于安全性约束和协同禁忌优化算法的云计算工作流调度

针对现有的云计算工作流调度方法侧重于节能和可靠性等方面进行研究,忽略了安全性约束的要求,设计了一种基于协同禁忌算法的具有安全型约束的能实现云计算工作流高效调度的方法;首先,定义了云计算工作流调度的DAG图,对安全性约束进行了形式化描述,并建立了云计算工作流调度的数学模型;然后,在经典的协同禁忌算法的基础上,通过设计解的编码方式、适应度函数、变邻域结构和双禁忌表,实现对经典的协同禁忌算法进行改进;最后,定义了基于改协同禁忌算法实现对云计算工作流调度的具体算法;在云计算的仿真环境Cloud-Sim下进行实验,实验结果证明了文中方法不仅具有较快的收敛速度,而且能寻求到比其它方法更优的调度方案,能满足安全性约束要求,是一种可行实用的调度方法.     

一种新的基于弧段提取的椭圆检测方法

为了克服椭圆检测过程中对椭圆完整性和边缘梯度信息依赖性较强的缺点,提高椭圆目标的检测速度,提出了一种新的基于弧段提取的椭圆拟合方法;首先将梯度方向符号相同的相邻边缘点连接成弧段,然后根据弧段的凸性和象限分类定义新的弧选择策略,利用位置约束和弧对的椭圆中心估计提取候选椭圆,最后采用改进的拟合算法拟合椭圆;实验结果表明,基于弧段提取的椭圆拟合方法相对于LMEDS算法和RHT3具有更好的准确性、鲁棒性和稳定性,实时性也有一定的提高。     

Segmentation of the left ventricle in cardiac cine MRI using a shape-constrained snake model

Segmentation of the left ventricle (LV) is a hot topic in cardiac magnetic resonance (MR) images analysis. In this paper, we present an automatic LV myocardial boundary segmentation method using the parametric active contour model (or snake model). By convolving the gradient map of an image, a fast external force named gradient vector convolution (GVC) is presented for the snake model. A circle-based energy is incorporated into the GVC snake model to extract the endocardium. With this prior constraint, the snake contour can conquer the unexpected local minimum stemming from artifacts and papillary muscle, etc. After the endocardium is detected, the original edge map around and within the endocardium is directly set to zero. This modified edge map is used to generate a new GVC force filed, which automatically pushes the snake contour directly to the epicardium by employing the endocardium result as initialization. Meanwhile, a novel shape-similarity based energy is proposed to prevent the snake contour from being strapped in faulty edges and to preserve weak boundaries. Both qualitative and quantitative evaluations on our dataset and the publicly available database (e.g. MICCAI 2009) demonstrate the good performance of our algorithm.     

石拱桥拱圈加固的约束机理分析

通过分析套箍和砌体横向应变关系,探讨了采用钢筋昆凝土套箍加固石拱桥对核心砌体的约束机理,并提出了套箍对核心砌体的约束应力及由于套箍约束作用使砌体强度提高的计算方法.同时,通过此方法对巴中市南江县龙渠大桥进行了加固设计,计算后得知主拱圈承载力得到明显提高,且实际运用效果良好.     

图像去噪中的纹理保护方法研究

基于偏微分方程及变分极值最小化的图像平滑方法可以有效地去除噪声,而且能够保护边缘信息,但由于噪声及纹理难以区分,使得纹理信息无法保留。提出一种纹理保护滤波算法,该算法利用图像分解模型将图像分解为几何结构分量及噪声/纹理分量,计算后者的局部方差,与传统变分能量最小化方法中的偏差惩罚项结合形成随纹理变化的约束,得到的模型在纹理区域滤波减少,从而保护了纹理信息。实验在视觉效果上得到了预期的结果,信噪比的计算对比也可以证明算法的有效性。     

Solving a real-time allocation problem with constraint programming

In this paper, we present an original approach (CPRTA for “Constraint Programming for solving Real-Time Allocation”) based on constraint programming to solve a static allocation problem of hard real-time tasks. This problem consists in assigning periodic tasks to distributed processors in the context of fixed priority preemptive scheduling. CPRTA is built on dynamic constraint programming together with a learning method to find a feasible processor allocation under constraints. Two efficient new approaches are proposed and validated with experimental results. Moreover, CPRTA exhibits very interesting properties. It is complete (if a problem has no solution, the algorithm is able to prove it); it is non-parametric (it does not require specific tuning) thus allowing a large diversity of models to be easily considered. Finally, thanks to its capacity to explain failures, it offers attractive perspectives for guiding the architectural design process.     

Performance bounds in linear control of unstable MIMO systems with pole location constraint

This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals.     

Non-negative matrix factorization for semi-supervised data clustering

Traditional clustering algorithms are inapplicable to many real-world problems where limited knowledge from domain experts is available. Incorporating the domain knowledge can guide a clustering algorithm, consequently improving the quality of clustering. In this paper, we propose SS-NMF: a semi-supervised non-negative matrix factorization framework for data clustering. In SS-NMF, users are able to provide supervision for clustering in terms of pairwise constraints on a few data objects specifying whether they “must” or “cannot” be clustered together. Through an iterative algorithm, we perform symmetric tri-factorization of the data similarity matrix to infer the clusters. Theoretically, we show the correctness and convergence of SS-NMF. Moveover, we show that SS-NMF provides a general framework for semi-supervised clustering. Existing approaches can be considered as special cases of it. Through extensive experiments conducted on publicly available datasets, we demonstrate the superior performance of SS-NMF for clustering.

基于SIFT的三视图像特征匹配算法

提出一种基于SIFT的三视图像特征匹配算法。采用SIFT算法对三视图像进行特征匹配,引入计算机视觉中的三线性关系和基于三焦张量的像素转移误差计算方法,对SIFT算法的匹配结果进行筛选,剔除匹配过程中产生的误配点。真实图像数据实验表明,该算法有效剔除了SIFT算法产生的97％以上的误配点,提高了三视图像匹配的准确度。     

基于非二元约束满足的配置问题求解方法

依据产品的可配置性,提出基于非二元约束的逻辑产品模型,给出基于动态变量序的一类配置求解算法。采用仿真实验比较各种算法的求解效率,指出各算法在不同配置约束密度下快速求解配置问题时的适用范围。基于逻辑产品模型,依据配置问题实际性质,采用相应配置求解算法,能够更快地生成符合客户要求的产品配置方案。