نتایج جستجو برای: comparability with other data
تعداد نتایج: 10202440 فیلتر نتایج به سال:
The biochemical half maximal inhibitory concentration (IC50) is the most commonly used metric for on-target activity in lead optimization. It is used to guide lead optimization, build large-scale chemogenomics analysis, off-target activity and toxicity models based on public data. However, the use of public biochemical IC50 data is problematic, because they are assay specific and comparable onl...
abstract nowadaysphotovoltaic solar cells (pvs) areacknowledged the fastest growing energy technology in the word, however, they only account for only fraction of current global renewable energy capacity. it isrecognized that this incomplete market penetration has been largely a result of the technology’sexcessive cost. so researchers are trying to find innovative, economic way with theaim of ...
abstract: the present study was undertaken to investigate whether 1) there is any significant correlation between iranian efl/eap learners’ l2 writing proficiency and their willingness to communicate, 2) there is any significant difference between efl and eap learners in terms of willingness to communicate, 3) there is any significant difference in wtc of iranian efl/eap learners with 1- nati...
We agree with Gould’s comments about the shortcomings of the Stokes’ method and the need for the ‘comparability of data between different centres across the country so that resistance surveillance data can be reliably compared’. In fact we would go further and suggest that, since bacteria do not respect national borders, there should be worldwide comparability of data. Where we part company wit...
Philosophical PerspectivesVolume 35, Issue 1 p. 70-98 ORIGINAL ARTICLE Consequences of comparability Cian Dorr, Corresponding Author Dorr [email protected] Email: Jacob M. Nebel [email protected] Jake Zuehl [email protected] for more papers by this authorJacob Nebel, Search authorJake Zuehl, [email protected] author First published: 31 October 2021 https://doi.org/10.1111/phpe.12157Read the full textAbou...
We show that every comparability graph of any two-dimensional poset over n elements (a.k.a. permutation graph) can be preprocessed in O(n) time, if two linear extensions of the poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The data-structure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید