Shiyong Peng,1 Diego J. Garzon,1 Monica Marchese,1 William Klein,2,3 Stephen D. Ginsberg,4 Beverly M. Francis,5,6 Howard T. J. Mount,5,6 Elliott J. Mufson,7 Ahmad Salehi,8 and Margaret Fahnestock1 1Department of Psychiatry and Behavioural Neurosciences, McMaster University, Hamilton, Ontario L8N 3Z5, Canada, 2Institute for Neuroscience, Northwestern University, Evanston, Illinois 60611, 3Depart...

in view of the finding of several cases of cutaneous leishmaniasis in some areas of khuzestan southern iran and the absence of information about its sandfly fauna,  this study was undertaken to elucidate the entomological and whenever possible, the epidemiological aspects of this disease in this province. in these studies more than 21,000 specimens were collected and identified we found eleven ...

conclusion based on the results, the vectors of cutaneous leishmaniasis include of p. papatasi, p. salehi, p. sergenti and moreover the vectors of visceral leishmaniasis include of p. keshishiani and p. alexandri have been found. materials and methods sand flies were collected by using sticky traps from selected villages (outdoors as well as indoors). traps were fixed at sundown and sand flies ...

0

The severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has emerged as a global pandemic causing disease 2019 (COVID-19). It was firstly reported in Hubei province the People’s Republic of China and spread worldwide quickly. COVID-19 affects every person differently, from mild to life-threatening symptoms (Nawaz, 2020), along with other bacterial or fungal co-infections (CDC., 2021). a...

A simple bound on the probability of decoding error for block codes is derived in closed form. This bound is based on the bounding techniques developed by Gallager. We obtained an upper bound both on the word-error probability and the bit-error probability of block codes. The bound is simple, since it does not require any integration or optimization in its final version. The bound is tight sinc...

A vertex coloring of a graph G is a multiset coloring if the multisets of colors of the neighbors of every two adjacent vertices are different. The minimum k for which G has a multiset k-coloring is the multiset chromatic number χm(G) of G. For every graph G, χm(G) is bounded above by its chromatic number χ(G). The multiset chromatic numbers of regular graphs are investigated. It is shown that ...

In this study, the relationship among four species of Polygonum (including P. hyrcanicum (three samples), P. persicaria, P. avicular, and P. hydropiper) was investigated by GC profiling. Furthermore, the major compounds of the ethylic ether extract of P. hyrcanicum were identified by GC/MS as: α-bisabolol (17.5%), cedrol (15.9%), sesquisabinene hydra...

We study a model of information aggregation and social learning recently proposed by Jadbabaie, Sandroni, and Tahbaz-Salehi, in which individual agents try to learn a correct state of the world by iteratively updating their beliefs using private observations and beliefs of their neighbors. No individual agent’s private signal might be informative enough to reveal the unknown state. As a result,...