نتایج جستجو برای: unique errors

تعداد نتایج: 396023  

Journal: :IEEE Transactions on Dependable and Secure Computing 2022

In this paper, we present a novel fault injection framework for system call invocation errors, called Phoebe. Phoebe is unique as follows. First, enables developers to have full observability of invocations. Second, generates error models that are realistic in the sense they mimic errors naturally happen production. Third, able automatically conduct experiments systematically assess reliability...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2011
Myrna F Schwartz Daniel Y Kimberg Grant M Walker Adelyn Brecher Olufunsho K Faseyitan Gary S Dell Daniel Mirman H Branch Coslett

It is thought that semantic memory represents taxonomic information differently from thematic information. This study investigated the neural basis for the taxonomic-thematic distinction in a unique way. We gathered picture-naming errors from 86 individuals with poststroke language impairment (aphasia). Error rates were determined separately for taxonomic errors ("pear" in response to apple) an...

2016
David F Lee Jenny Lu Seungwoo Chang Joseph J Loparo Xiaoliang S Xie

Genomic integrity is compromised by DNA polymerase replication errors, which occur in a sequence-dependent manner across the genome. Accurate and complete quantification of a DNA polymerase's error spectrum is challenging because errors are rare and difficult to detect. We report a high-throughput sequencing assay to map in vitro DNA replication errors at the single-molecule level. Unlike previ...

Journal: :Journal of proteome research 2013
Piliang Hao Yan Ren James P Tam Siu Kwan Sze

The tandem mass spectrum extraction of phosphopeptides is more difficult and error-prone than that of unmodified peptides due to their lower abundance, lower ionization efficiency, the cofragmentation with other high-abundance peptides, and the use of MS(3) on MS(2) fragments with neutral losses. However, there are still no established methods to evaluate its correctness. Here we propose to ide...

Journal: :Journal of the South African Veterinary Association 2012

Journal: :پژوهشنامه آموزش زبان فارسی به غیر فارسی زبانان 0
مجتبی منشی زاده دانشیار زبان شناسی- دانشگاه علامه طباطبائی کیومرث خان بابازاده دانشجوی دکتری ادبیات فارسی- دانشگاه گیلان

language learners tend to use their mother tongue while learning a second language conducted in error analysis framework, this study was aimed at investigating the persian syntactic errors in pieces of writing of a group of talysh-speaking students in north-and south-anbaran villages in gilan. the participants were third, fourth, and fifth grade elementary school students. the reasons and origi...

2018
Ajay D. Halai Anna M. Woollams Matthew A. Lambon Ralph

In order to gain a better understanding of aphasia one must consider the complex combinations of language impairments along with the pattern of paraphasias. Despite the fact that both deficits and paraphasias feature in diagnostic criteria, most research has focused only on the lesion correlates of language deficits, with minimal attention on the pattern of patients' paraphasias. In this study,...

Journal: :Computer Physics Communications 2004

Journal: :CoRR 2017
Li Xiao Xiang-Gen Xia

Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of residue errors is less than half the minimum distance of the code. However, once the number of residue errors is beyond half the minimum distance of the code, the ...

Journal: :communication in combinatorics and optimization 0
vladimir samodivkin university of architecture, civil еngineering and geodesy; department of mathematics

for a graph $g$ let $gamma (g)$ be its domination number. we define a graph g to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ed}$ graph) if $g$ has no efficient dominating set (eds) but every graph formed by removing a single vertex from $g$ has at least one eds, and (ii) a hypo-unique domination graph (a hypo-$mathcal{ud}$ graph) if $g$ has at least two minimum dominating sets...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید