融合混沌反学习与蜂群搜索算子的引力搜索算法

引力搜索算法是最近提出的一种较有竞争力的群智能优化技术,然而,标准引力算法存在的收敛速度慢、容易在进化过程中陷入停滞状态.针对上述问题,提出一种改进的引力搜索算法.该算法采用混沌反学习策略初始化种群,以便获得遍历整个解空间的初始种群,进而提高算法的收敛速度和解的精度.此外,该算法利用人工蜂群搜索策略很强的探索能力,对种群进行引导以帮助算法快速跳出局部最优点.通过对13个非线性基准函数进行仿真实验,验证了改进的引力搜索算法的有效性和优越性.     

一种基于QoS参数归约的云计算环境能效评估方法

高性能、低功耗且具有QoS保障的高能效问题是云计算领域的一个研究难点。目前的研究主要是通过限定一个约束条件寻求另外指标的最优来实现三者之间的折衷或均衡,缺乏一种有效的能效计算方法和评估模型将三者整合,以更好地描述云环境能效的“程度”。提出一种云环境下QoS参数的归约方法和加权的能效模型,把系统性能作为一个关键因素引入QoS,并将离散的多个QoS参数度量值归约到同一个量纲区域内,获得评价权重矩阵,求得用户最终的QoS评价值,以单位能耗所提供的整体QoS水平值作为能效值,并且建立云数据中心的能效分级标识,最终将云环境下能效值刻画为一个定性的概念,实现了对云环境下能效的定性评估。此外,分别对单机环境和同构、异构的云计算环境中云数据中心的能效进行了评估分析,并进行了实验验证。实验结果表明,所提出的能效模型和评估方法在评价云系统的QoS水平和能源消耗方面是有效的。     

Facing the classification of binary problems with a hybrid system based on quantum-inspired binary gravitational search algorithm and K-NN method

Since given classification data often contains redundant, useless or misleading features, feature selection is an important pre-processing step for solving classification problems. This problem is often solved by applying evolutionary algorithms to decrease the dimensional number of features involved. Removing irrelevant features in the feature space and identifying relevant features correctly is the primary objective, which can increase classification accuracy. In this paper, a novel QBGSA–K-NN hybrid system which hybridizes the quantum-inspired binary gravitational search algorithm (QBGSA) with the K-nearest neighbor (K-NN) method with leave-one-out cross-validation (LOOCV) is proposed. The main aim of this system is to improve classification accuracy with an appropriate feature subset in binary problems. We evaluate the proposed hybrid system on several UCI machine learning benchmark examples. The experimental results show that the proposed method is able to select the discriminating input features correctly and achieve high classification accuracy which is comparable to or better than well-known similar classifier systems.     

A Multi-Layered Gravitational Search Algorithm for Function Optimization and Real-World Problems

A gravitational search algorithm(GSA)uses gravitational force among individuals to evolve population.Though GSA is an effective population-based algorithm,it exhibits low search performance and premature convergence.To ameliorate these issues,this work proposes a multi-layered GSA called MLGSA.Inspired by the two-layered structure of GSA,four layers consisting of population,iteration-best,personal-best and global-best layers are constructed.Hierarchical interactions among four layers are dynamically implemented in different search stages to greatly improve both exploration and exploitation abilities of population.Performance comparison between MLGSA and nine existing GSA variants on twenty-nine CEC2017 test functions with low,medium and high dimensions demonstrates that MLGSA is the most competitive one.It is also compared with four particle swarm optimization variants to verify its excellent performance.Moreover,the analysis of hierarchical interactions is discussed to illustrate the influence of a complete hierarchy on its performance.The relationship between its population diversity and fitness diversity is analyzed to clarify its search performance.Its computational complexity is given to show its efficiency.Finally,it is applied to twenty-two CEC2011 real-world optimization problems to show its practicality.     

引力搜索优化ELM的企业财务危机预警方法

为提高企业财务危机的预测准确率,提出一种基于引力搜索算法优化核极限学习机(KELM)的并行模型PHGSA-KELM。模型考虑了特征选择机制和参数优化两者对KELM模型起着同等重要的作用,提出改进的引力搜索算法(HGSA)同步实现特征选择机制和KELM参数优化,同时设计的线性加权多目标函数综合考虑了分类精度和特征子集数量,改善了算法的分类性能,并且基于多核平台的多线程并行方式进一步提高了算法的计算效率。通过真实数据集的实验结果表明,提出的模型不仅获得了较少的特征子集个数,找出了与企业财务危机紧密相关的特征,得到了很高的分类准确率,并且计算效率也得到极大提高,是一种有效的企业财务危机预警模型。     

改进万有引力搜索算法及在水位辨识中的应用

针对万有引力搜索算法(Gravitational Search Algorithm,GSA)的早熟收敛和寻优精度问题,提出了一种改进的GSA算法。算法采用混沌序列初始化种群位置,采用淘汰机制及变异操作增加种群的多样性,避免陷入局部最优。通过对6个非线性基准函数进行仿真测试,结果表明:所提出的算法对非线性函数具有良好的优化性能。将上述算法用于双容水箱水位的辨识,辨识结果验证了提出算法的有效性。     

Soft sets based symbiotic organisms search algorithm for resource discovery in cloud computing environment

The dynamicity, coupled with the uncertainty that occurs between advertised resources and users’ resource requirement queries, remains significant problems that hamper the discovery of candidate resources in a cloud computing environment. Network size and complexity continue to increase dynamically which makes resource discovery a complex, NP-hard problem that requires efficient algorithms for optimum resource discovery. Several algorithms have been proposed in literature but there is still room for more efficient algorithms especially as the size of the resources increases. This paper proposes a soft-set symbiotic organisms search (SSSOS) algorithm, a new hybrid resource discovery solution. Soft-set theory has been proved efficient for tackling uncertainty problems that arises in static systems while symbiotic organisms search (SOS) has shown strength for tackling dynamic relationships that occur in dynamic environments in search of optimal solutions among objects. The SSSOS algorithm innovatively combines the strengths of the underlying techniques to provide efficient management of tasks that need to be accomplished during resource discovery in the cloud. The effectiveness and efficiency of the proposed hybrid algorithm is demonstrated through empirical simulation study and benchmarking against recent techniques in literature. Results obtained reveal the promising potential of the proposed SSSOS algorithm for resource discovery in a cloud environment.     

A multi-dimensional index structure based on improved VA-file and CAN in the cloud

Currently,the cloud computing systems use simple key-value data processing,which cannot support similarity search efectively due to lack of efcient index structures,and with the increase of dimensionality,the existing tree-like index structures could lead to the problem of"the curse of dimensionality".In this paper,a novel VF-CAN indexing scheme is proposed.VF-CAN integrates content addressable network(CAN)based routing protocol and the improved vector approximation fle(VA-fle) index.There are two index levels in this scheme:global index and local index.The local index VAK-fle is built for the data in each storage node.VAK-fle is thek-means clustering result of VA-fle approximation vectors according to their degree of proximity.Each cluster forms a separate local index fle and each fle stores the approximate vectors that are contained in the cluster.The vector of each cluster center is stored in the cluster center information fle of corresponding storage node.In the global index,storage nodes are organized into an overlay network CAN,and in order to reduce the cost of calculation,only clustering information of local index is issued to the entire overlay network through the CAN interface.The experimental results show that VF-CAN reduces the index storage space and improves query performance efectively.     

Priori information and sliding window based prediction algorithm for energy-efficient storage systems in cloud

One of the major challenges in cloud computing and data centers is the energy conservation and emission reduction. Accurate prediction algorithms are essential for building energy efficient storage systems in cloud computing. In this paper, we first propose a Three-State Disk Model (3SDM), which can describe the service quality and energy consumption states of a storage system accurately. Based on this model, we develop a method for achieving energy conservation without losing quality by skewing the workload among the disks to transmit the disk states of a storage system. The efficiency of this method is highly dependent on the accuracy of the information predicting the blocks to be accessed and the blocks not be accessed in the near future. We develop a priori information and sliding window based prediction (PISWP) algorithm by taking advantage of the priori information about human behavior and selecting suitable size of sliding window. The PISWP method targets at streaming media applications, but we also check its efficiency on other two applications, news in webpage and new tool released. Disksim, an established storage system simulator, is applied in our experiments to verify the effect of our method for various users’ traces. The results show that this prediction method can bring a high degree energy saving for storage systems in cloud computing environment.     

Evolutionary Fuzzy‐based gravitational search algorithm for query optimization in crowdsourcing system to minimize cost and latency

Crowdsourcing is an environment where a group of users collaborates together to exchange information and to find answers for complex problems (queries). Query optimization is the task of selecting the best query strategy with less cost associated with it. The crowdsourcing cost can be determined by selecting the best plan from the set of options available and the best plan considerably reduce the cost for the inquiry configuration. As one of the center tasks in information recovery, the investigation of top‐k queries with crowdsourcing, to be specific group empowered top k inquiries is depicted. This issue is defined with three key variables, latency, money related expense, and nature of answers. The fundamental point is to plan a novel system that limits financial cost when the latency is compelled. In this article, we used a heuristic search algorithm named as Evolutionary Fuzzy‐based Gravitational Search algorithm (EFGSA) that produces an optimal query feature selection results with minimizing cost and latency. EFGSA‐based crowdsourcing framework gives a better balance between latency and cost while generating query plans. The performance analysis of proposed EFSGA for optimal query plan is evaluated in terms of running time, accuracy, monetary cost, and so on. From the experimental results, the proposed method achieved better results than other methods in our cost and latency model.     

A new method for trust and reputation evaluation in the cloud environments using the recommendations of opinion leaders' entities and removing the effect of troll entities

Trust in the cloud environment is not written into an agreement and is something earned. In any trust evaluation mechanism, opinion leaders are the entities influencing the behaviors or attitudes of others, this makes them to be trustworthy, valid among other characteristics. On the other hand, trolls are the entities posting incorrect and unreal comments; therefore, their effect must be removed. This paper evaluates the trust by considering the influence of opinion leaders on other entities and removing the troll entities’ effect in the cloud environment. Trust value is evaluated using five parameters; availability, reliability, data integrity, identity and capability. Also, we propose a method for opinion leaders and troll entity identification using three topological metrics, including input-degree, output-degree and reputation measures. The method being evaluated in various situation where shows the results of accuracy by removing the effect of troll entities and the advice of opinion leaders.