being one of the major research fields in the robotics discipline, the robot motion planning problem deals with finding an obstacle-free start-to-goal path for a robot navigating among workspace obstacles. such a problem is also encountered in path planning of intelligent vehicles and automatic guided vehicles (agvs). traditional (exact) algorithms have failed to solve the problem effectively s...

Background: Mutation in NPM1 gene has been reported to be the most common genetic mutation in de novo acute myeloid leukemia (AML). AML with NPM1 gene mutation usually presents with higher initial leukocyte and blast cell counts and negative CD34 expression. We aimed to investigate the difference of initial leukocyte counts, bone marrow blast cell counts and expression of CD34 among patients wi...

background nucleus(t)ide analogs (nas), containing lamivudine (lmv), adefovir dipivoxil (adv), endeavor (etv), telbivudine (ldt), and tenofovir (tdf) are widely used for the treatment of chronic hepatitis b (chb), but long term anti-hepatitis b virus (hbv) therapy with nas may give rise to the emergence of drug-resistant viral mutants. objectives this study aimed to find and identify some new r...

background: the present study was formulated in order to determine pol­ymorphism of dihydropteroate synthetase gene (dhps) of plasmodium vivax (p . vivax ) in hormozgan province, southern iran and mutations at codons 382, 383, 512, 553, and 585 associated with resistance of p. vivax to sulfadoxine. method : one-hundred eighteen isolates of p. vivax were prepared within 2007-2008 to determine di...

We study cluster tilting modules in mesh algebras of Dynkin type as defined [12], providing a new proof for their existence. Except G2, we show that these are precisely the maximal rigid modules, and they equivariant certain automorphism. further mutation, an example mutation abelian category which is not stably 2-Calabi-Yau, explicitly describe combinatorics.

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...