Computing Minimum Area Homologies

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.     

Accelerating Iterative Big Data Computing Through MPI

Current popular systems, Hadoop and Spark, cannot achieve satisfied performance because of the ine?cient overlapping of computation and communication when running iterative big data applications. The p...     

分子标记多位点排序的并行计算

为了对一组连锁的分子标记位点获得正确的排序进而构建生物遗传连锁图谱,提出了并行算法PMMASLH,针对F2作图群体,通过基于消息传递接口并行最大最小蚂蚁系统求解连锁的多个分子标记位点排序,使用隐马尔可夫模型计算一列有序标记位点所获得的极大似然值作为排序的目标函数。计算机模拟结果表明,该算法执行效率高、计算稳定,排序的功效优于著名的连锁作图软件Mapmaker。     

双球面投影几何可量测全景模型的构建

针对全景影像难以提供空间度量的问题,提出一种基于双球面投影几何的可量测立体全景模型构建方法.该方法依据球面全景投影关系与多视几何原理,采用对应变换与本质变换求取旋转及平移参数,并推导出双球面核线约束;在此基础上,建立起双球面投影几何的立体全景模型,解决了球面全景的量测问题.实验结果表明,文中方法可使全景影像在真实呈现户外场景的同时,提供满足一定应用需求的量测分析功能.     

遥感网格的数据压缩与任务分配方法研究

网格计算作为分布式计算在科学计算领域的发展方向,可以为对地观测数据的处理提供强大的计算力。在分析遥感信息服务网格节点(Remote Sensing Information Service Grid Nodes,RSSN)中网络数据传输和负载均衡两个关键问题的基础上,提出了一种有效的基于游程编码和Huffman编码的数据压缩方法和基于"计算端元"的任务分配策略,该方法针对遥感影像特点进行有效数据压缩,具有较好的压缩比,达到了17%,且能实现任务负载均衡。并在遥感信息服务网格节点计算平台上,以中国范围内1km分辨率气溶胶光学厚度(Aerosol Optical Depth,AOD)反演计算为例,从压缩率和计算时间效率方面验证和分析了上述方法的有效性。     

高校科研能力的协同IWD粗糙集-块神经网络评估模型

针对高校科研能力评估过程中存在的多因素、高非线性特点,经典评估模型主观性较强,导致模型评估准确性不高的问题,提出基于协同智能水滴算法IWD和粗糙集块神经网络RBNN的高校科研能力评估模型。首先,引入智能水滴算法,并针对传统智能水滴算法固定旁域搜索范围不利于提升算法搜索效率的问题,提出一种局部空间自动缩放算法LSAS,该算法根据当前种群最优个体,自动调整下一步搜索空间大小,对进化过程进行指导,提高算法的进化效率;其次,基于粗糙集理论对高校科研能力数据进行特征预处理,简化数据计算量;最后,对块神经网络和粗糙集参数进行编码,并对高校科研能力模型进行评估。仿真结果表明,此评估模型具有较高的准确性和较快的计算效率。     

Distributed average computation for multiple time‐varying signals with output measurements

This paper studies the distributed average computation problem for multiple time‐varying signals with bounded inputs. Based only on relative output measurements, a pair of continuous algorithms with, respectively, static and adaptive coupling strengths are designed and utilized. From the concept of boundary layer approach, the proposed continuous algorithm with static coupling strengths can asymptotically obtain the average value of the multiple reference signals without chattering phenomenon. Furthermore, for the case of algorithms with adaptive coupling strengths, the calculation errors are uniformly ultimately bounded and exponentially converge to a small adjustable bounded set. Finally, a simulation example is presented to show the validity of the theoretical results. Copyright © 2015 John Wiley & Sons, Ltd.     

Fuzzy decision fusion of complementary experts based on evolutionary cepstral coefficients for phoneme recognition

Optimal representation of acoustic features is an ongoing challenge in automatic speech recognition research. As an initial step toward this purpose, optimization of filterbanks for the cepstral coefficient using evolutionary optimization methods is proposed in some approaches. However, the large number of optimization parameters required by a filterbank makes it difficult to guarantee that an individual optimized filterbank can provide the best representation for phoneme classification. Moreover, in many cases, a number of potential solutions are obtained. Each solution presents discrimination between specific groups of phonemes. In other words, each filterbank has its own particular advantage. Therefore, the aggregation of the discriminative information provided by filterbanks is demanding challenging task. In this study, the optimization of a number of complementary filterbanks is considered to provide a different representation of speech signals for phoneme classification using the hidden Markov model (HMM). Fuzzy information fusion is used to aggregate the decisions provided by HMMs. Fuzzy theory can effectively handle the uncertainties of classifiers trained with different representations of speech data. In this study, the output of the HMM classifiers of each expert is fused using a fuzzy decision fusion scheme. The decision fusion employed a global and local confidence measurement to formulate the reliability of each classifier based on both the global and local context when making overall decisions. Experiments were conducted based on clean and noisy phonetic samples. The proposed method outperformed conventional Mel frequency cepstral coefficients under both conditions in terms of overall phoneme classification accuracy. The fuzzy fusion scheme was shown to be capable of the aggregation of complementary information provided by each filterbank.     

概率模型检测技术在机器人路径规划中的应用

在机器人路径规划的实际应用中,针对机器人移动行为可能会受到外界环境影响的难题,提出了一种采用概率模型检测技术进行路径规划的新方法。首先,分析环境中的主要影响因素,将机器人的移动行为看作一个不确定事件,构建马尔可夫决策过程(MDP)模型。然后,采用概率计算树逻辑(PCTL)公式描述模型属性,表达机器人复杂多样的目标任务。最后,运用PRISM平台对模型进行分析和验证,得到满足属性的全局优化路径和定量数据。仿真结果表明,上述方法不仅能够保障机器人在障碍物环境中无碰撞移动,而且可以避开环境相对复杂的区域,保证机器人以最大概率完成任务。对比试验证明上述方法的正确性和有效性。