提出了一种用于全局优化的混合差分进化算法。 在新算法中，混沌系统的随机性被用来在搜索空间中尽可能多地散布个体，模式搜索方法被用来加速局部开发，而DE算子被用来跳到一个更好的点。 证明了全局收敛。 详细研究了三种典型的混沌系统。 在包含13个高维函数的基准示例上的数值实验表明，该新方法以较少的计算量实现了更高的成功率和最终解决方案。

CoherencyRouting Algorithm with Redundancy Elimination in Software Defined Data CenterNetworks

Construct Optimal Binary Search Tree by Using Greedy Algorithm

学习书 算法：알고리즘제문이 JPA：Java持久性API

Workflow Execution Plan Generation in the Cloud Computing Environment based on an Improved List Scheduling Algorithm

Research on a Least Squares Thresholding Algorithm for Pavement Crack Detection

A Network Delay Jitter Smoothing Algorithm in Cyber-Physical Systems

A new delay jitter smoothing algorithm based on Pareto distribution in Cyber-Physical Systems

This paper takes the p-adic representation of integers as the research object to realize the distance measurement of integers in the p-adic metric space. The authors firstly apply the Euclidean algorithm to infer the coefficients of a positive integer in polynomial representation, whose corresponding negative integer can be obtained with the help of the similar solution method of binary complement; secondly, the coefficients are respectively mapped into from mod p to mod the n-th power of p laye

This paper proposes TW-k-means, an automated two-level variable weighting clustering algorithm for multiview data, which can simultaneously compute weights for views and individual variables. In this algorithm, a view weight is assigned to each view to identify the compactness of the view and a variable weight is also assigned to each variable in the view to identify the importance of the variable. Both view weights and variable weights are used in the distance function to determine the clusters