Yanhong Feng

Learn More
This paper presents a novel binary monarch butterfly optimization (BMBO) method, intended for addressing the 0–1 knapsack problem (0–1 KP). Two tuples, consisting of real-valued vectors and binary vectors, are used to represent the monarch butterfly individuals in BMBO. Real-valued vectors constitute the search space, whereas binary vectors form the(More)
Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of(More)
An effective hybrid cuckoo search algorithm (CS) with improved shuffled frog-leaping algorithm (ISFLA) is put forward for solving 0-1 knapsack problem. First of all, with the framework of SFLA, an improved frog-leap operator is designed with the effect of the global optimal information on the frog leaping and information exchange between frog individuals(More)
Osteosarcoma (OS) is the most common primary bone tumor in children and adolescents. Long noncoding RNAs (lncRNAs) are a class of transcriptional products of the genome without protein-coding potential. Recently, lncRNA Ewing sarcoma-associated transcript 1 (EWSAT1) was functionally identified in Ewing sarcoma, a highly aggressive primary pediatric bone(More)
Structure-based design of a combinatorial array was carried out in order to identify non-peptidic thiomethylketone inhibitors of caspases 3 and 8. Five compounds from the designed array were active against caspase 3, and two were active against caspase 8. A 2.5-A resolution co-crystal structure of caspase 3 and a thiomethylketone array member is reported.(More)
In this paper, an improved hybrid encoding firefly algorithm (IFA) is proposed for solving randomized time-varying knapsack problems (RTVKP). The RTVKP is an extension from the generalized time-varying knapsack problems (TVKP) by dynamically changing the profit and weight of items as well as the capacity of knapsack. In IFA, two-tuples composed of real(More)
Salient region detection is a challenge problem in computer vision, which is useful in image segmentation, region-based image retrieval, and so on. In this paper we present a multi-resolution salient region detection method in frequency domain which can highlight salient regions with well-defined boundaries of object. The original image is sub-sampled into(More)
As an expanded classical 0-1 knapsack problem (0-1 KP), the discounted {0-1} knapsack problem (DKP) is proposed based on the concept of discount in the commercial world. The DKP contains a set of item groups where each group includes three items, whereas no more than one item in each group can be packed in the knapsack, which makes it more complex and(More)
  • 1