background: improvement of endothelial dysfunction could prevent or delay the occurrence of the atherosclerosis process in patients with kawasaki disease (kd). it is suggested that vitamin c could improve endothelial dysfunction. in this study, we investigated whether administration of vitamin c as a water-soluble antioxidant could be effective in this regard among patients with kd. materials a...

background and objectives: clostridium perfringens is more prevalent type of clostridia genus isolated from the intestinal tract of ostrich ( struthio camelus ). necrotic enteritis (ne) is a potentially fatal gastrointestinal (gi) disease of poultry and other avian species, which produces marked destruction of intestinal lining in digestive tract caused by c. perfringens . pathogenicity and les...

aim : the objective of this study was to estimate the average cost of diagnosis and treatment of hepatitis c among patients based on their treatment regime, during the one course of treatment and six-month after stopping that. background : hepatitis c virus (hcv) infection is a major cause of liver-related morbidity and mortality worldwide and a major public health problem. patients and methods...

Background and Aims: Accurate and rapid diagnosis is necessary for effective control and prevention of foot-and-mouth disease (FMD). In present study, was evaluated real time reverse transcription-polymerase chain reaction (rRT-PCR) assay along with diagnostic routine methods for the detection of all seven serotypes of FMD virus (FMDV), namely O, C, A, SAT1, 2, 3 and Asia 1 in biological sample...

Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For 0 < s ≤ t ≤ n with s divides n, an (s, t, n)-LRM scheme is a local rank modulation scheme where the n cells are locally viewed cyclically through a sliding window of size t resulting in a sequence of small permutations which requires less comp...

Galvin showed that for all fixed δ and sufficiently large n, the n-vertex graph with minimum degree δ that admits the most independent sets is the complete bipartite graph Kδ,n−δ. He conjectured that except perhaps for some small values of t, the same graph yields the maximum count of independent sets of size t for each possible t. Evidence for this conjecture was recently provided by Alexander...

Let Bt(n) be the number of set partitions of a set of size t into at most n parts and let B′ t(n) be the number of set partitions of {1, . . . , t} into at most n parts such that no part contains both 1 and t or both i and i+ 1 for any i ∈ {1, . . . , t− 1}. We give two new combinatorial interpretations of the numbers Bt(n) and B ′ t(n) using sequences of random-to-top shuffles, and sequences o...

A graph G of order n is called t-edge-balanced if G satisfies the property that there exists a positive λ for which every graph of order n and size t is contained in exactly λ distinct subgraphs of Kn isomorphic to G. We call λ the index of G. In this article, we obtain new infinite families of 2-edge-balanced graphs. C ⃝ 2013 Wiley Periodicals, Inc. J. Combin. Designs 22: 291–305, 2014