In order to enhance inter-particle cooperation and information sharing capabilities, an improved particle swarm algorithm optimization model is proposed by introducing the centroid of particle swarm in the standard PSO model to improve global optimum efficiency and accuracy of algorithm, then parameter selection guidelines are derived in the convergence of new algorithm. The results of Benchmar...

In this paper, we proposed a new type of seed for Blast-like homology search tools called "half seed''. This new seed is better than the "consecutive seed'' used by the original Blast tools in both sensitivity and efficiency. When compared with the "gapped seed'', which is proposed together with a new Blast-like searching tool, PatternHunter, this new seed offers a much wider range of choices f...

Personal photo retrieval is different from many search tasks in that all the targets are either known to the user, or they are about something the owner has seen. For this reason, generating queries for searching personal photos will more likely rely on an individual’s memory. In a pilot study of Personal file re-finding, the results suggested a change of retrieval efficiency over time for diff...

This study investigates alternative approaches to locating bumble bee nests for scientific research. We present results from three trials designed to assess: 1. The comparative efficiency of two detection dogs; 2. The ability of a dog to locate nests when carrying out repeat searches of agricultural habitats through the season; 3. The efficiency of a dog compared with human volunteers at findin...

While there have been a lot of efficient full-text search algorithms developed for English documents, these algorithms can be directly used for other languages, e.g. Chinese, Japanese, Thai and so on. However, due to idiosyncrasies of each individual language, directly applying such algorithms may not be suitable for the language considered. This paper proposes a simplification of Boyer-Moore a...

For most of the important processes in DNA metabolism, a protein has to reach a specific binding site on the DNA. The specific binding site may consist of just a few base pairs while the DNA is usually several millions of base pairs long. How does the protein search for the target site? What is the most efficient mechanism for a successful search? Motivated by these fundamental questions on int...

Research in finance and lots of other areas often encounter large-scale complex optimization problems that are hard to find solutions. Classic heuristic algorithms often have limitations from the objectives that they are trying to mimic, leading to drawbacks such as lacking memory-efficiency, trapping in local optimal solutions, unstable performances, etc. This work considers imitating market c...