Hill climbing method is an optimization technique that is able to build a search trajectory in the search space until reaching the local optima. It only accepts the uphill movement which leads it to easily get stuck in local optima. Several extensions to hill climbing have been proposed to overcome such problem such as Simulated Annealing, Tabu Search. In this paper, an extension version of hill climbing method has been proposed and called \(\beta\)-hill climbing. A stochastic operator called \(\beta\)-operator is utilized in hill climbing to control the balance between the exploration and exploitation during the search. The proposed method has been evaluated using IEEE-CEC2005 global optimization functions. The results show that the proposed method is a very efficient enhancement to the hill climbing providing powerful results when it compares with other advanced methods using the same global optimization functions.
相似文献A computer worm is a self-replicating malicious code that does not alter files but resides in active memory where it duplicates itself. Worms use parts of the operating system that are automatic and usually invisible to the user. Worms commonly exhibit abnormal behaviors, which become noticeable only when their uncontrolled replication consumes system resources and consequently decelerates or halts other tasks completely. This paper proposes an effective approach for detecting the presence of TCP network worms. This approach consists of two phases: Statistical Cross-relation for Network Scanning (SCANS) phase and the Worm Correlation phase. The SCANS phase is used to detect the presence of the network scanning behavior of a network worm, while the worm correlation phase is used to detect the Destination Source Correlation (DSC) behavior of the network worm. The proposed approach has been tested with a simulated dataset obtained from the GTNetS simulator. The numerical results showed that the proposed approach is efficient and outperforms the well-known DSC approach in terms of detecting the presence of TCP network worm.
相似文献In the near future, data is expected to double in every two years, which translates to more than one terabyte of data for every person on earth. The difficulty of storing and fetching required data from data centers and servers will consequently increase. As a result, significant attention has been given to the flash memory-based solid state drive (SSD) from consumer electronics companies, which has begun to replace the existing hard disk drive and is highly likely to be used as a storage unit for most of consumer electronics to achieve low power consumption. In contrast to traditional disk, SSD uses semiconductor chips to store data. This structure enjoys original technical characteristics, including low power consumption, shock resistance, and high performance in random access. Such features can overcome the shortcomings of magnetic disks. However, flash memory, the basic unit of SSD, has many distinctive characteristics that cause various challenges. Flash memory does not support updating in the place method. A write operation can be performed only on an empty or erased unit, making the process more time-consuming. Moreover, each storage unit has a limited number of erase cycles, after which the block becomes invalid. This research proposes a new scheme called performance and reliability concern to increase the reliability and performance of SSDs. The eligibility of the proposed scheme is proven through EagleTree simulator. The scheme is also compared with other state-of-the-art techniques in terms of effectiveness and efficiency. Experimental results show that the proposed scheme provides sufficient performance and reliability for SSD.
相似文献In this paper, the update process of harmony search (HS) algorithm is modified to improve its concept of diversity. The update process in HS is based on a greedy mechanism in which the new harmony solution, created in each generation, replaces the worst individual in the population, if better. This greedy process could be improved with other updates mechanisms in order to control the diversity perfectly. Three versions of HS have been proposed: (1) Natural Proportional HS ; (2) Natural Tournament HS; (3) Natural Rank HS. These three HS versions employed the natural selection principle of the “survival of the fittest”. Instead of replacing the worst individual in population, any individual can be replaced based on certain criteria. Four versions of economic loading dispatch (ELD) problems with valve point have been used to measure the effect of the newly proposed HS versions. The results show that the new HS versions are very promising for ELD domain. This claim is proved based on the comparative evaluation process where the new HS versions are able to excel the state-of-the-art methods in almost ELD problems used.
相似文献