基于中心平面的聚类模型及在电商中的应用

因为k-平面聚类算法(kPC)和k-中心平面聚类算法(kPPC)构建的聚类中心平面是无限延伸的,这会影响聚类的性能,所以提出了局部的k-中心平面聚类(L-kPPC)算法.此算法在kPPC中引入了k-均值聚类算法(k-mean),这样使得样本点都聚集在类中心周围.L-kPPC利用了各聚类中心平面的局部特征构建类中心平面,...     

基于遗传聚类的无线传感器负载均衡路由算法

通常的无线传感器分簇网络存在节点负载不均衡的问题。为均衡各节点能量消耗,延长网络生存周期,将K均值算法与遗传算法相结合,提出一种负载均衡的无线传感器网络路由算法,算法利用遗传算法的全局寻优能力以克服传统K均值算法的局部性和对初始中心的敏感性,实现了传感器网络节点自适应成簇与各节点负载均衡。仿真实验表明,该算法显著延长了网络寿命,相对于其他分簇路由算法,其网络生存时间延长了约43%。     

H.264压缩域中mean-shift聚类运动目标分割算法

针对视频监控、检索,提出了一 种在H.264压缩域下运动对象分 割的新算法。根据实际监控应用特点,算法主要利用H.264码流中提 取的运动矢量(MV)、分块尺寸信息对原始的MV场(MVF)进 行可靠性分析以及空间滤波、mean-shift聚类处理,从而得到可信度较高的 MVF场。首先,从H.264码流中获取原 始MV 并进行归一化处理,同时对原始MVF进行两步空间滤波;其次,对不同的块大 小分配相应的权值作为每个样本 的权重系数,将处理之后的MVF作为样本空间,利用mean-shift聚类获取 真实的MVF;最后,根据可靠的MVF 标记运动目标。实验结果表明,本文提出的mean-shift聚类运动目标分割算 法可以获得有效并可靠的分割结果。     

基于因子和聚类分析的全国科普示范县（市、区）科普综合实力评价研究

如何对创建单位进行有效的管理是全国科普示范县(市、区)活动目前面临的问题之一。以2011—2015年全国科普示范县(市、区)为样本,设计评价指标,应用因子分析和聚类分析方法对我国32个省级行政单位的全国科普示范县(市、区)的科普综合实力进行分析,得出基于因子分析的全国科普示范县(市、区)科普综合实力评价体系和基于全国科普示范县(市、区)科普综合实力的分类标准。应用该结论能够对全国科普示范县(市、区)进行评价和分类,为全国科普示范县(市、区)管理提供一种可以量化的参考。     

一种T-S型动态模糊推理模型的建模算法研究

以一种进化聚类算法（ECM）为基础,提出了一种新的T-S型动态模糊推理模型的建模算法.以往许多神经模糊模型都不适用于自适应在线学习,而文章模型能够实时地调整模糊规则库及规则参数,具有较强的在线学习能力.仿真结果表明,该方法是有效的.     

基于二分网络的用户聚类电影推荐系统构建

针对已经存在的推荐算法中数据的稀疏性问题,提出一种基于聚类算法的二分图信任网络构造算法,通过聚类技术把项目评分相似的用户聚集起来,形成若干个用户群组,在每个群组内部通过二分图建立连接,利用信任机制在群组内部和群组间建立连接,进而构造出推荐系统.实验是在MovieLens数据集上进行的,采用平均绝对误差(MAE)为评测指标,验证了方法的有效性,从而得出该系统使得数据稀疏性对最终推荐结果的负面影响变小.     

存储器故障诊断算法的研究与实现

集成电路工艺的改进使存储器的测试面临着更大的挑战。文中从存储器的故障模型入手,着重描述了存储器常见的诊断算法。诊断算法和诊断策略要在诊断时间、故障覆盖率、面积开支之间进行权衡。因此要根据存储器的故障类型和测试需求来选择合适的诊断算法,才能达到比较满意的效果。     

真实环境中基于子帧分析的多说话人定位算法

针对真实环境中的多说话人定位问题,提出一种基于子帧分析的多声源定位算法。该算法将一帧语音信号分为8个子帧,利用每个子帧信号计算相位变换加权的可控响应功率函数,分别搜索其最大值得到声源位置的子帧估计。由于语音信号在时域具有稀疏性,这些估计值对应多个声源的位置。利用会聚聚类算法将子帧估计值分为若干类,然后用平均子帧可控响应功率函数对估计值进行评价,得到最终的声源位置估计。实验表明,在2~3个说话人的情况下,该算法比传统算法的定位性能有较大幅度提高。     

Analysis of large experimental datasets in electrochemical impedance spectroscopy

An approach for the analysis of large experimental datasets in electrochemical impedance spectroscopy (EIS) has been developed. The approach uses the idea of successive Bayesian estimation and splits the multidimensional EIS datasets into parts with reduced dimensionality. Afterwards, estimation of the parameters of the EIS-models is performed successively, from one part to another, using complex nonlinear least squares (CNLS) method. The results obtained on the previous step are used as a priori values (in the Bayesian form) for the analysis of the next part. To provide high stability of the sequential CNLS minimisation procedure, a new hybrid algorithm has been developed. This algorithm fits the datasets of reduced dimensionality to the selected EIS models, provides high stability of the fitting and allows semi-automatic data analysis on a reasonable timescale. The hybrid algorithm consists of two stages in which different zero-order optimisation strategies are used, reducing both the computational time and the probability to overlook the global optimum. The performance of the developed approach has been evaluated using (i) simulated large EIS dataset which represents a possible output of a scanning electrochemical impedance microscopy experiments, and (ii) experimental dataset, where EIS spectra were acquired as a function of the electrode potential and time. The developed data analysis strategy showed promise and can be further extended to other electroanalytical EIS applications which require multidimensional data analysis.     

A minimization version of a directed subgraph homeomorphism problem

We consider a special case of the directed subgraph homeomorphism or topological minor problem, where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this application domain, the task is to simultaneously schedule, bind and route a so-called data-flow graph, where vertices represent operations and arcs stand for data dependencies between the operations, given an orthogonal grid structure of reconfigurable processing elements (PEs) that have restricted communication abilities. We show that the problem of simultaneously scheduling, binding and routing is NP-complete by describing a logic engine reduction from NAE-3-SAT. This result holds even when the input graph is a directed tree with maximum indegree two. We also give a |V|^3/2-approximation algorithm. J. A. Brenner’s research supported by the DFG Research Center Matheon “Mathematics for key technologies”. J. C. van der Veen’s research supported by DFG Focus Program 1148, “Reconfigurable Architectures”, Grants FE 407/8-1 and FE 407/8-2.