MCS接枝共聚物的结构和形态

将甲基丙烯酸甲酯（ＭＭＡ）、苯乙烯（Ｓ）在氯化聚乙烯（ＣＰＥ）存在下进行悬浮接枝共聚，获得ＭＣＳ树脂。本文着重考察了ＭＣＳ树脂的化学结构及胶粒形态。结果表明，确实发生了接枝共聚。ＣＰＥ用量、ＲＳＨ含量、引发剂浓度、反应温度、溶胀时间及聚合转化率对ＭＣＳ树脂的接枝率、接枝效率均有影响。ＭＣＳ树脂是接枝共聚物、ＭＭＡ／Ｓ共聚物与ＭＭＡ均聚物的混合物，橡胶相ＣＰＥ在ＭＣＳ树脂中的分散情况为“海岛结构”，     

Steady-state weights solution to affine projection algorithm

A new expression of the weights update equation for the affine projection algorithm (APA) is proposed that improves the convergence rate of an adaptive filter,particularly for highly colored input sign...     

基于Matlab的线性规划问题求解

线性规划是运筹学中研究较早、发展较快、应用广泛、方法成熟的一个重要分支,它是辅助人们进行科学管理的一种重要的数学方法.文章首先介绍了线性规划的基本概念及标准形式,着重讨论了线性规划问题的三种常用解法:单纯形法、直接搜索法以及遗传算法,最后在Matlab R2009a环境下进行了仿真.通过结果可以看出,用Matlab求解线性规划问题,可以避免手工的烦琐计算,大大地提高工作效率和结果的准确性.     

VxWorks下PCI9054显卡图形开发库的实现

介绍了一种基于VxWorks操作系统的PCI9054显卡的图形开发库,实现了基本绘图功能,汉字和字符的显示功能,以及贴图存图的功能,满足综合显示的需求。     

磁场信号检测误差分析及补偿算法

针对载体自身磁场特性及三轴磁传感器误差特性建立了地磁导航干扰误差补偿模型,通过对模型进行简化变形,利用系统辨识的最小二乘估计算法(LS)求取误差特性参数.数据分析表明:该方法简单易实现,简化了复杂的求解过程,基本达到了误差补偿的要求.     

基于音频数字水印的空间定位技术研究

深入研究了利于音频数字水印实现空间定位的技术思想,提出了一种在数字音频中嵌入水印信息后,实现对声源的空间定位算法,详细阐述了该算法的设计思想,并分别给出了音频数字水印的嵌入过程和数字水印的提取过程。     

主动推送模式下的情报需求预测模型

针对主动推送模式下的情报需求预测问题,提出了基于案例推理的解决方案。设计了进行情报需求预测案例分析的工作流程,建立了案例属性描述模型;应用最近邻法进行案例的相似度评价,并通过信息增益的计算确定每个属性的权值,获得相似案例(集);提出了方案调整和推理策略。     

A new algorithm for fast mining frequent itemsets using N-lists

Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining tasks.In this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent itemsets.Based on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent itemsets.Efficiency of PrePost is achieved by the following three reasons.First,N-list is compact since transactions with common prefixes share the same nodes of the PPC-tree.Second,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists respectively.Third,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of N-list.We have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic datasets.The experimental results show that the PrePost algorithm is the fastest in most cases.Even though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one.     

Binary particle swarm optimization with multiple evolutionary strategies

This paper introduces a novel variation of binary particle swarm optimization(BPSO) algorithm and a further extension to improve its performance.Firstly,mimicking the behaviors of some creatures group,multiple evolutionary strategies BPSO(MBPSO) is introduced which takes different evolutionary strategies for various particles according to their performances.Then,on the basis of MBPSO,a new strategy is discussed to improve the performance of the MBPSO(M2BPSO) which adopts the concept of the mutation operator aiming to overcome the premature convergence and slow convergent speed during the later stages of the optimization.The proposed two algorithms are tested on seven benchmark functions and their results are compared with those obtained by other methods.Experimental results show that our methods outperform the other algorithms.     

图像隐写算法评估体系的解释结构模型研究

隐写算法的评估是以隐写系统安全性角度出发,总结出了抗检测性、鲁棒性、抗容量探测性等多个性能指标,构建了评估指标集.并采用解释结构模型法对评估指标体系进行分析。重点讨论了方法的应用和结果的分析,给出了对图像隐写算法评估体系建立和分析的思路与方法。