On the tractability of coloring semirandom graphs

As part of the efforts to understand the intricacies of the k-colorability problem, different distributions over k-colorable graphs have been analyzed. While the problem is notoriously hard (not even reasonably approximable) in the worst case, the average case (with respect to such distributions) often turns out to be “easy”. Semi-random models mediate between these two extremes and are more suitable to imitate “real-life” instances than purely random models. In this work we consider semi-random variants of the planted k-colorability distribution. This continues a line of research pursued by Coja-Oghlan, and by Krivelevich and Vilenchik. Our aim is to study a more general semi-random framework than those suggested so far. On the one hand we show that previous algorithmic techniques extend to our more general semi-random setting; on the other hand we give a hardness result, proving that a closely related semi-random model is intractable. Thus we provide some indication about which properties of the input distribution make the k-colorability problem hard.     

Efficient parallel implementation of iterative reconstruction algorithms for electron tomography

Electron tomography (ET) combines electron microscopy and the principles of tomographic imaging in order to reconstruct the three-dimensional structure of complex biological specimens at molecular resolution. Weighted back-projection (WBP) has long been the method of choice since the reconstructions are very fast. It is well known that iterative methods produce better images, but at a very costly time penalty. In this work, it is shown that efficient parallel implementations of iterative methods, based primarily on data decomposition, can speed up such methods to an extent that they become viable alternatives to WBP. Precomputation of the coefficient matrix has also turned out to be important to substantially improve the performance regardless of the number of processors used. Matrix precomputation has made it possible to speed up the block-iterative component averaging (BICAV) algorithm, which has been studied before in the context of computerized tomography (CT) and ET, by a factor of more than 3.7. Component-averaged row projections (CARP) is a recently introduced block-parallel algorithm, which was shown to be a robust method for solving sparse systems arising from partial differential equations. It is shown that this algorithm is also suitable for single-axis ET, and is advantageous over BICAV both in terms of runtime and image quality. The experiments were carried out on several datasets of ET of various sizes, using the blob model for representing the reconstructed object.     

虚拟化背后的“精灵”

虚拟化已经为大家广为接受,而在虚拟化实施的时候,虚拟化背后的技术支持往往容易被人们忽略。     

基于“JavaBean可视化组件”的开发技术的探究

JavaBean是一种专门为当前软件开发者设计的全新的可视化组件技术,它为软件开发者提供了一种极佳的问题解决方案。该文描述了用JavaBean开发可视化组件的相关技术。通过阐明了可视化编程的原理和过程,引入Java语言的JavaBean技术来进一步说明JavaBean技术在开发可视化组件的机制和优势,尤其是介绍了JavaBean能够被应用程序开发工具侦测其属性和事件的能力。     

浅谈动漫出版产业

近年来,随着我国文化产业的发展,一种新型的创新文化产业—动漫出版产业得到了长足的发展,但是在发展过程中也存在着诸多不利的因素。该文从分析我国的动漫产业和出版产业的概念、特点、现状和现存问题等方面着手,提出了关于动漫专业教育发展的一点想法。     

基于VB与MATLAB编程模拟光栅光谱分析系统

该仿真软件将Matlab的计算优势与Visual Basic图形用户界面开发方面的优势结合起来仿真模拟了单色光单缝衍射和光栅衍射实验,实验结果的图样细致逼真,结合3D动画演示使整个物理过程变得直观,为光学的理论分析和实验教学提供了新的途径。     

DWT域基于位平面的图像公开水印算法

本文提出了一种新颖的DWT域公开水印算法,该算法基于位平面的思想,在小波逼近子图的分解子图中结合HVS的特性多版本嵌入二值水印图像信息,最后基于统计的原理提取水印。实验表明,此算法效率高,鲁棒性、透明性好。     

一种基于MEMS的主动式光纤连接器

介绍一种基于MEMS技术的主动式光纤连接器,上层为双层结构电热驱动器,下层为硅V型槽。双层结构在常温下作为压制光纤的盖板,通电后作为单稳态电热驱动器,盖板翘曲,放入或取出光纤。利用Ansys有限元分析软件并结合工艺条件,对热驱动器部件的性能进行了分析与仿真。利用表面硅工艺和体硅工艺制备出核心驱动部分,检测盖板翘曲情况下性能。     

基于多特征空间的均值漂移算法

传统均值漂移跟踪算法都是基于单个特征空间,这不能较好地解决特征相似目标对跟踪的干扰.文中归纳多种具有分布特性的局部性特征,并对各种特征的区分能力提出具体的测度方法,使得特征的选择能够自适应.并在分析均值漂移算法中权重值计算的基础上,提出在多特征空间下,依据特征区分能力赋予相应的权重值,进而融合至均值漂移算法中.改进算法能够有效利用各种特征,使其相互补足,提高目标跟踪的鲁棒性.对于视频序列的实验表明,改进算法能够对受干扰的目标进行有效的实时跟踪.