Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Vanessa Job"'
Autor:
Cullen Roth, Vrinda Venu, Vanessa Job, Nicholas Lubbers, Karissa Y. Sanbonmatsu, Christina R. Steadman, Shawn R. Starkenburg
Publikováno v:
BMC Bioinformatics, Vol 24, Iss 1, Pp 1-22 (2023)
Abstract Background Correlation metrics are widely utilized in genomics analysis and often implemented with little regard to assumptions of normality, homoscedasticity, and independence of values. This is especially true when comparing values between
Externí odkaz:
https://doaj.org/article/3cb6da81502f4e049ace1245f25c75d3
Autor:
Laura Monroe, Robert W. Robey, Christopher M. Mauney, Shane Fogerty, Brett Neuman, Vanessa Job, Terry Grove
Publikováno v:
CORRECTNESS@SC
Due to accumulated round-off error, mathematically equivalent floating-point summations can yield different computational results. Errors propagated across timesteps can be substantial and can lead to significant inaccuracy in the final results. We f
Autor:
Laura Monroe, Alexandra Poulos, Robert W. Robey, Sean Blanchard, William M. Jones, Nathan DeBardeleben, Vanessa Job, Dylan Wallace
Publikováno v:
FTXS@SC
Extreme-scale systems are growing in scope and complexity as we approach exascale. Uncorrectable faults in such systems are also increasing, so resilience efforts addressing these are of great importance. In this paper, we extend a method that augmen
Publikováno v:
Journal of Combinatorial Theory, Series A. 62(2):183-215
In (European J. Combin. Theory 8 (1987), 35–43) Palfy answers the question: Under what conditions on n is it true that two equivalent objects in any class of cyclic combinatorial objects on n elements implies the objects are equivalent, using one o
Autor:
Vanessa Job
Publikováno v:
IEEE Transactions on Information Theory. 38:496-501
The m-adic residue codes are investigated and are found to have many of the strong properties of the quadratic residue codes. A subgroup of the automorphism group and restrictions on the form of the idempotents of the m-adic residue codes are given.
Autor:
Vanessa Job
Publikováno v:
Proceedings. IEEE International Symposium on Information Theory.
Publikováno v:
Proceedings. 1991 IEEE International Symposium on Information Theory.
A multiplier is a permutation of S, given by i -+ ai(mod n) where gcd(a,n) = 1. It is known that if two cyclic codes of prime length p are equivalent, then they must also be multiplier equivalent. We show that this same result holds for cyclic codes
Publikováno v:
People en Español; feb2006, Vol. 9 Issue 1, p108-111, 4p, 3 Color Photographs
Publikováno v:
People en Español; mar2005, Vol. 8 Issue 2, p122-130, 8p, 17 Color Photographs
Publikováno v:
People en Español; nov2003, Vol. 6 Issue 10, p78-94, 10p, 19 Color Photographs