On Peer-Assisted Data Dissemination in Data Center Networks: Analysis and Implementation简

Data Center Networks （DCNs） are the fundamental infrastructure for cloud computing. Driven by the massive parallel computing tasks in cloud computing, one-to-many data dissemination becomes one of the most important traffic patterns in DCNs. Many architectures and protocols are proposed to meet this demand. However, these proposals either require complicated configurations on switches and servers, or cannot deliver an optimal performance. In this paper, we propose the peer-assisted data dissemination for DCNs. This approach utilizes the rich physical connections with high bandwidths and mutli-path connections, to facilitate efficient one-to-many data dissemination. We prove that an optimal P2P data dissemination schedule exists for FatTree, a specially- designed DCN architecture. We then present a theoretical analysis of this algorithm in the general multi-rooted tree topology, a widely-used DCN architecture. Additionally, we explore the performance of an intuitive line structure for data dissemination. Our analysis and experimental results prove that this simple structure is able to produce a comparable performance to the optimal algorithm. Since DCN applications heavily rely on virtualization to achieve optimal resource sharing, we present a general implementation method for the proposed algorithms, which aims to mitigate the impact of the potentially-high churn rate of the virtual machines.     

基于差分最小二乘支持向量机的目标识别研究

目标识别是目前机器视觉、图像处理和模式识别领域的研究热点之一,广泛应用于各行各业。最小二乘支持向量机算法简便、速度快、精度高,是当前目标识别的主流算法之一。针对最小二乘支持向量机的参数难以确定,仅靠传统经验试凑的方法不易实现,且结果不理想;提出一种改进的差分进化算法实现最小二乘支持向量机的参数整定。通过改进变异策略,引入早熟判断机制,遏制了传统算法早熟收敛的问题。通过实验仿真,验证了改进算法可跳出局部最优点,结果比传统算法更优。以SM-TMSSY光电伺服跟踪转台为实验平台进行实例验证,证明了改进算法收敛速度快、精度高,正确识别率可从85%提高到92.5%,验证了算法的优越性。     

对流扩散方程的特征有限体积两重网格算法与误差估计

对于非线性对流扩散方程,构造了特征有限体积算法格式,再用两重网格算法计算非线性系统,先通过非线性迭代求出粗网格ΔH上的解uH,再利用粗网格上的解uH将问题线性化并求出细网格Δh上的近似解h(Hh)。理论分析及数值例子的计算结果均表明,在收敛阶保持不变的情况下,此算法既可消除非线性对流占优扩散问题数值震荡现象,又可简化计算,提高计算效率。     

基于区域生长法的医学图像分割研究

医学图像存在感兴趣区和背景区，感兴趣区是分割的重点。针对基于区域的分水岭分割算法中通常存在的严重过分割现象，而采用2点措施来改进：一是以梯度图像的浮点活动图像取代梯度图像进行分水岭变换，使边缘定位更准确；其二是以基于面积和对比度控制的合并小区域准则，有效抑制过分割现象，同时满足感兴趣区的分割要求。实验表明该算法简单有效，能够得到符合人类视觉系统特性的分割结果，边缘定位精确度较高。     

一类代数数的连分数表示的一个算法

给出了计算一类实代数数的最小多项式的算法,在此基础上,可以教育处这一类型实代数数的连分数表示,这一工作改进和推广了S．Lang和H．T和Trotter的关于代数连分数的算法。     

一种新的语音噪声抵消算法

针对单参考输入自适应噪声抵消器在多噪声源情况下除噪声效果不理想的问题,根据多参考输入自适应噪声抵消器模型,在推导多参考输入最小均方（MLMS）算法的基础上,给出其改进算法（IMLMS）,结合语音信号的特点,给出了多参考输入自适应语音消噪算法（VMLMS）,利用调整算法执行过程的算法改进思想,突破了传统的修正收敛系数的算法改进模式,最后对几种算法的性能进行了计算机仿真比较。     

基于VMD改进算法的气体管道泄漏检测

为提取气体管道声波信号中的泄漏成分并进行重构,提出一种结合VMD( VMD: Variational Mode Decomposition) 和误差能量算法的特征提取方法。该方法首先利用油气管道泄漏检测系统模拟气体管道的微小泄漏,并采集泄漏声波信号; 然后利用VMD 算法将采集到的泄漏声波信号分解为一系列带宽受限的固有模态;随后,使用误差能量算法选择有效模态; 最后,利用有效模态进行信号重构。通过仿真分析发现,该改进算法可以提取有效模态,利用该方法处理气体管道微小泄漏声波信号,能有效滤除噪声并重构原始信号。     

基于CORDIC算法的QDDS信号发生器设计

文章提出了一种采用CORDIC算法实现QDDS信号发生器的设计方法;设计采用VHDL语言描述硬件电路和CycloneⅡ系列FPGA开发平台实现,通过Synplify Pro进行优化综合和Modelsim SE验证.设计结果表明采用CORDIC算法设计的QDDS信号发生器具有运算速度高、电路规模小的特点,优于常用的查表法...     

带有不完全信息随机截尾试验下伽玛分布尺度参数的点估计

首先通过添加数据得到了带有不完全信息随机截尾试验下伽玛分布的完全数据似然函数,然后分别利用EM算法和MCMC方法对尺度参数进行了估计,最后进行了随机模拟试验,结果表明尺度参数点估计的精度比较高.     

Dynamic replication strategies in data grid

Dynamic data replication is a technique used in data grid environments that helps to reduce access latency and network bandwidth utilization. Replication also increases data availability thereby enhancing system reliability. In this paper we discuss the issues with single-location strategies in large-scale data integration applications, and examine potential multiple-location schemes. Dynamic multiple-location replication is NP-complete in nature. We therefore transform the multiple-location problem into several classical mathematical problems with different parameter settings, to which efficient approximation algorithms apply experimental results indicate that unlike single-location strategies our multiple-location schemes are efficient with respect to access latency and bandwidth consumption, especially when the requesters of a data set are distributed over a large scale of locations.