Attraction and diffusion in nature-inspired optimization algorithms

Nature-inspired algorithms usually use some form of attraction and diffusion as a mechanism for exploitation and exploration. In this paper, we investigate the role of attraction and diffusion in algorithms and their ways in controlling the behaviour and performance of nature-inspired algorithms. We highlight different ways of the implementations of attraction in algorithms such as the firefly algorithm, charged system search, and the gravitational search algorithm. We also analyze diffusion mechanisms such as random walks for exploration in algorithms. It is clear that attraction can be an effective way for enhancing exploitation, while diffusion is a common way for exploration. Furthermore, we also discuss the role of parameter tuning and parameter control in modern metaheuristic algorithms, and then point out some key topics for further research

The Difficult Case of Crystallization and Structure Solution for the ParC55 Breakage-Reunion Domain of Topoisomerase IV from Streptococcus pneumoniae

BACKGROUND: Streptococcus pneumoniae is the major cause of community-acquired pneumonia and is also associated with bronchitis, meningitis, otitis and sinusitis. The emergence and increasing prevalence of resistance to penicillin and other antibiotics has led to interest in other anti-pneumonococcal drugs such as quinolones that target the enzymes DNA gyrase and topoisomerase IV. During crystallization and in the avenues to finding a method to determine phases for the structure of the ParC55 breakage-reunion domain of topoisomerase IV from Streptococcus pneumoniae, obstacles were faced at each stage of the process. These problems included: majority of the crystals being twinned, either non-diffracting or exhibiting a high mosaic spread. The crystals, which were grown under conditions that favoured diffraction, were difficult to flash-freeze without loosing diffraction. The initial structure solution by molecular replacement failed and the approach proved to be unviable due to the complexity of the problem. In the end the successful structure solution required an in-depth data analysis and a very detailed molecular replacement search. METHODOLOGY/PRINCIPAL FINDINGS: Crystal anti-twinning agents have been tested and two different methods of flash freezing have been compared. The fragility of the crystals did not allow the usual method of transferring the crystals into the heavy atom solution. Consequently, it was necessary to co-crystallize in the presence of the heavy atom compound. The multiple isomorphous replacement approach was unsuccessful because the 7 cysteine mutants which were engineered could not be successfully derivatized. Ultimately, molecular replacement was used to solve the structure by sorting through a large number of solutions in space group P1 using CNS. CONCLUSIONS/SIGNIFICANCE: The main objective of this paper is to describe the obstacles which were faced and overcome in order to acquire data sets on such difficult crystals and determine phases for successful structure solution

Random-key cuckoo search for the travelling salesman problem

Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random key cuckoo search (RKCS) algorithm for solving the famous Travelling Salesman Problem (TSP). We used a simplified random-key encoding scheme to pass from a continuous space (real numbers) to a combinatorial space. We also consider the displacement of a solution in both spaces using L\'evy flights. The performance of the proposed RKCS is tested against a set of benchmarks of symmetric TSP from the well-known TSPLIB library. The results of the tests show that RKCS is superior to some other metaheuristic algorithms

Social Algorithms

This article concerns the review of a special class of swarm intelligence based algorithms for solving optimization problems and these algorithms can be referred to as social algorithms. Social algorithms use multiple agents and the social interactions to design rules for algorithms so as to mimic certain successful characteristics of the social/biological systems such as ants, bees, bats, birds and animals.Comment: Encyclopedia of Complexity and Systems Science, 201

Distributed Random Process for a Large-Scale Peer-to-Peer Lottery

Most online lotteries today fail to ensure the verifiability of the random process and rely on a trusted third party. This issue has received little attention since the emergence of distributed protocols like Bitcoin that demonstrated the potential of protocols with no trusted third party. We argue that the security requirements of online lotteries are similar to those of online voting, and propose a novel distributed online lottery protocol that applies techniques developed for voting applications to an existing lottery protocol. As a result, the protocol is scalable, provides efficient verification of the random process and does not rely on a trusted third party nor on assumptions of bounded computational resources. An early prototype confirms the feasibility of our approach

The current research status of normal tension glaucoma

Normal tension glaucoma (NTG) is a progressive optic neuropathy that mimics primary open-angle glaucoma, but lacks the findings of elevated intraocular pressure or other mitigating factors that can lead to optic neuropathy. The present review summarized the causes, genetics, and mechanisms underlying NTG in both animal models and human patients. We also proposed that the neurovascular unit is a therapeutic target for NTG management.published_or_final_versio

Lean implementations of software testing tools using XML representations of source codes

By utilizing XML representations of source programs under test, a new approach is proposed to concisely implement some prototypes for TACCLE, a software testing methodology. The conversions between a source program and its XML representation can be easily realized using existing conversion tools. In this way, the conversion tools can automatically analyze and parse the source program, so that testing tool developers only need to concentrate on the manipulation of the XML document. If appropriate XML DOM APIs are chosen, the implementations of such testing tools will be pretty lean. A detailed case study for GMPS tool, a prototype for the TACCLE methodology, is presented to illustrate the new approach. © 2008 IEEE.published_or_final_versionThis research is supported by the Jinan University Youth Foundation under Grant #51208035, Union Grant of Guangdong Province and National Natural Science Foundation of China under Grant #U0775001, and the Guangdong Province Science Foundation under Grant #7010116

Exchange bias induced by the fully strained La2/3Ca1/3MnO3 dead layers

published_or_final_versio

Tests of scaling assumptions and construct validity of the Chinese (HK) version of the SF-36 Health Survey

Few health-related quality of life (HRQOL) survey instruments are available to the Chinese, although many have been developed for Western populations. This article describes the testing of the acceptability, conceptual equivalence, scaling assumptions and construct validity of a Chinese (HK [Hong Kong]) version of the MOS SF-36 Health Survey. A Chinese (HK) SF-36 survey form was developed by an iterative translation process. It was administered to 236 Chinese subjects who also rated the understanding, difficulty, relevance, and acceptability of each question. The scores were tested against the original scaling assumptions. The SF-36 profile of our subjects was compared to U.S. results for conceptual equivalence. Most subjects did not have any problem in understanding and answering the SF-36. Item means were generally clustered as hypothesized. All but a few items satisfied all scaling assumptions. The shape of the eight-scale SF-36 profile was similar to that of American patients, suggesting conceptual equivalence. We conclude that the Chinese (HK) version of the SF-36 Health Survey has achieved conceptual equivalence and satisfied the psychometric scaling assumptions well enough to warrant further use and testing, using the standard scoring algorithms.postprin