基于粒子系统和音频系统的烟花模拟

针对模糊物体的模拟方法存在着粒子数量绘制巨大、粒子运动状态复杂、计算耗时、实时性及逼真性不够等问题,提出了一种基于粒子系统和音频系统的烟花模拟方法,以三角形格作为绘制烟花粒子的基本图元,结合纹理映射,色彩融合技术来绘制烟花粒子,在显示列表中生成纹理,再结合FMOD引擎技术,加入音频系统,实验结果表明提出的方法增强了模拟的逼真性.     

多虚拟机实时迁移中自适应的迁移算法选择框架

IaaS云计算平台中主要通过实时迁移多台虚拟机来实现资源的动态调度、管理与优化。虽然Pre-copy和Post-copy是单虚拟机实时迁移的两种主流算法,且各有优缺点,但现有的多虚拟机实时迁移系统只是单一地使用其中一种迁移算法,无法根据各虚拟机的不同负载情况灵活选择最有效的迁移算法,降低了整体迁移效率。提出一种自适应的实时迁移算法选择框架,利用模糊聚类方法对待迁移的多虚拟机进行分类,按类别选择最适合的迁移算法。实验结果表明,所提出的迁移算法选择框架能够在多虚拟机实时迁移中发挥两个迁移算法的各自优势,有效提高整体的实时迁移性能。     

基于粒子群优化BP神经网络的养肠胃菜谱判定

提出了一种基于粒子群优化BP神经网络的养肠胃菜谱判定的方法。粒子群算法通过自身良好的搜寻能力,对BP神经网络的权值和阈值进行了优化,弥补了BP神经网络中收敛性慢、存在多个局部极值点的缺陷。并分别通过误差曲线图、线性回归图等,对BP神经网络模型与PSO-BP神经网络模型进行比较分析。实验结果表明,PSO-BP模型判定较准确,在调养肠胃的饮食食谱选择中起到了指导作用。     

融合深度与肤色特征的自适应手部跟踪算法

手部跟踪技术是实现自然人机交互的关键。针对现有跟踪方法易受光照、环境等影响及鲁棒性差的不足,提出一种融合深度与肤色特征的自适应手部跟踪算法。考虑手部运动过程的形变,该算法首先利用深度平滑连续性选取深度阈值以实现跟踪区域的自适应尺度变化,获得手部候选区域。在此基础上建立YCbCr空间肤色归一化直方图,在粒子滤波框架下将跟踪问题转换为贝叶斯估计问题,基于最大后验准则确定手部位置,并通过监测粒子重要性权值的方差解决跟踪失效问题,实现复杂观测环境下的鲁棒跟踪。实验结果表明,该跟踪算法可适应不同复杂环境,鲁棒性良好。     

Cloud-based automatic test data generation framework

Designing test cases is one of the most crucial activities in software testing process. Manual test case design might result in inadequate testing outputs due to lack of expertise and/or skill requirements. This article delivers automatic test data generation framework by effectively utilizing soft computing technique with Apache Hadoop MapReduce as the parallelization framework. We have evaluated and analyzed statistically our proposed framework using real world open source libraries. The experimental results conducted on Hadoop cluster with ten nodes are effective and our framework significantly outperforms other existing cloud-based testing models.     

PSO-GP中文文本情感分类方法研究

中文文本的情感倾向分析是网络舆情信息挖掘和分析的关键技术之一。提出了一种粒子群-高斯过程算法(PSO-GP)的中文文本情感倾向分类方法,采用粒子群优化算法(Particle Swarm optimization,PSO)进行高斯过程(Gaussian Process)超参数的最优搜索,解决了传统高斯过程中共轭梯度法迭代次数难确定、对初值依赖性强和易陷入局部极小值等问题。首先采用多线程网络爬虫技术采集文本数据组成语料库,构建特定领域情感词典,然后通过情感词匹配选择最有效的特征,降低数据维度,并利用TF-IDF算法计算特征词的权重以生成特征向量。最终,将测试样本输入PSO-GP分类模型。实验结果表明,与传统GP方法相比,提出的改进高斯过程分类模型的分类准确率提高了近15%。     

RT-Thread的SPI总线驱动结构分析 、移植及应用

介绍了串行外设接口SPI的通信原理,对RT Thread操作系统下的SPI总线驱动结构进行了详细的研究与分析.以STM32F407ZG对W25Q64的读写为例,介绍了硬件SPI总线驱动的移植步骤,并详细介绍了SPI应用程序设计及技术实施细节.最后通过实验,对SPI驱动移植及程序设计的可行性及有效性进行验证,实验结果表明,RT Thread操作系统下的SPI总线驱动结构设计合理,移植方便且应用程序设计简单,本文所介绍的移植与应用方法可行有效.     

一种基于PSO&PAM的聚类算法

PAM是最早提出的k-medoids算法之一,该算法比较健壮,比k-means算法鲁棒性更强,但是PAM对初始值敏感,易陷入局部收敛。利用PSO算法对PAM进行优化,提出一种基于PSO和PAM的聚类方法,充分利用PAM和PSO两者对于不同问题的优势,来不断地更新PAM的聚类中心。通过建立基于熵的聚类有效性函数,对混合聚类算法的性能进行客观评价。从来自UCI的数据的测试结果表明,这种混合聚类的方法有较高的聚类正确率。     

基于代价感知的云任务处理策略

绿色云计算旨在保证服务质量的前提下,最大限度地降低云服务成本．针对这一问题,提出一种兼顾云数据中心高性能和低成本的策略,通过虚拟机动态迁移等技术进行云任务聚合,关闭空闲的节点以最小化能量消耗,同时考虑虚拟机迁移性能,以此保证任务的服务质量．实验结果表明,代价感知的策略可以减少打开节点的个数,兼顾迁移能耗和迁移延迟,在节能的前提下使服务质量得到保证．     

Simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection

Tolerance specification is an important part of mechanical design. Design tolerances strongly influence the functional performance and manufacturing cost of a mechanical product. Tighter tolerances normally produce superior components, better performing mechanical systems and good assemblability with assured exchangeability at the assembly line. However, unnecessarily tight tolerances lead to excessive manufacturing costs for a given application. The balancing of performance and manufacturing cost through identification of optimal design tolerances is a major concern in modern design. Traditionally, design tolerances are specified based on the designer’s experience. Computer-aided (or software-based) tolerance synthesis and alternative manufacturing process selection programs allow a designer to verify the relations between all design tolerances to produce a consistent and feasible design. In this paper, a general new methodology using intelligent algorithms viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi Objective Particle Swarm Optimization (MOPSO) for simultaneous optimal selection of design and manufacturing tolerances with alternative manufacturing process selection is presented. The problem has a multi-criterion character in which 3 objective functions, 3 constraints and 5 variables are considered. The average fitness factor method and normalized weighted objective functions method are separately used to select the best optimal solution from Pareto optimal fronts. Two multi-objective performance measures namely solution spread measure and ratio of non-dominated individuals are used to evaluate the strength of Pareto optimal fronts. Two more multi-objective performance measures namely optimiser overhead and algorithm effort are used to find the computational effort of NSGA-II and MOPSO algorithms. The Pareto optimal fronts and results obtained from various techniques are compared and analysed.