As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural s...

For path planning of mobile robot, the traditional Q learning algorithm easy to fall into local optimum, slow convergence etc. issues, this paper proposes a new greedy strategy, multi-target searching of Q learning algorithm. Don't need to create the environment model, the mobile robot from a single-target searching transform into multitarget searching an unknown environment, firstly, by the dy...

This paper introduces an imaging algorithm with application of fractional Fourier transform (FrFT) for ground moving train imaging by Ku-band ground-based radar. In view of the fact that the train speed is varying when acrossing the radar beam, the multiple Doppler parameters are estimated corresponding to different range positions, i.e., they are estimated from different sections of data in Fr...

It is highly possible that future wireless communication systems will adopt ultra-dense deployment to cope with the increasing demand on spectrum efficiency and energy efficiency. The pivotal issue to achieve the potential benefits of the ultra-dense network is to deal with the complex inter-site interference. In this paper, in order to maximize the spectrum efficiency of the system, we first m...

In this paper, we present a new and fast encoding algorithm (FEA) for vector quantization. The magnitude (sum of the components of a vector) feature of the vectors is used in this algorithm to improve the efficiency of searching. Sorting of the magnitude values enhances the searching. As the values are sorted, the searching can be terminated in advance to reduce the time needed to locate the re...

We present a novel method for efficiently searching top-k neighbors for documents represented in high dimensional space of terms based on the cosine similarity. Mostly, documents are stored as bagof-words tf-idf representation. One of the most used ways of computing similarity between a pair of documents is cosine similarity between the vector representations, but cosine similarity is not a met...

Several image pattern recognition tasks rely on superpixel generation as a fundamental step. Image analysis based on superpixels facilitates domain-specific applications, also speeding up the overall processing time of the task. Recent superpixel methods have been designed to fit boundary adherence, usually regulating the size and shape of each superpixel in order to mitigate the occurrence of ...

The νμ → ντ and νμ → νs solutions to the atmospheric neutrino problem are compared with SuperKamiokande data. The differences between these solutions due to matter effects in the Earth are calculated for the ratio of μ-like to e-like events and for up-down flux asymmetries. These quantities are chosen because they are relatively insensitive to theoretical uncertainties in the overall neutrino f...

Differential evolution (DE) is a population-based optimization algorithm. The members of population in DE are called parameter vectors. Due to more real-world optimization problems become increasingly complex. Algorithms with more ability and efficiency for searching potential solution are also increasing in demand. Thus, in this paper, an improved DE is proposed for solving large scale global ...