Zobrazeno 1 - 10
of 103
pro vyhledávání: '"D'Antona, A. M."'
Autor:
Zhong, Xiaotian1 (AUTHOR) aaron.dantona@pfizer.com, D'Antona, Aaron M.1 (AUTHOR), Rouse, Jason C.2 (AUTHOR) jason.rouse@pfizer.com
Publikováno v:
International Journal of Molecular Sciences. Nov2024, Vol. 25 Issue 22, p11962. 35p.
Autor:
D'Antona, Aaron M.1 (AUTHOR) taohe99@yahoo.com, Lee, Julie M.2 (AUTHOR), Zhang, Melvin3 (AUTHOR), Friedman, Clarence1 (AUTHOR) tyler.hageman@pfizer.com, He, Tao1 (AUTHOR) eric.sousa@pfizer.com, Mosyak, Lidia1 (AUTHOR), Bennett, Eric1 (AUTHOR), Lin, Laura1 (AUTHOR), Silverman, Maddison1 (AUTHOR), Cometa, Funi1 (AUTHOR), Meade, Caryl1 (AUTHOR), Hageman, Tyler1 (AUTHOR), Sousa, Eric1 (AUTHOR), Cohen, Justin1 (AUTHOR), Marquette, Kimberly1 (AUTHOR), Ferguson, Darren1 (AUTHOR), Zhong, Xiaotian1 (AUTHOR) aaron.dantona@pfizer.com
Publikováno v:
International Journal of Molecular Sciences. Feb2024, Vol. 25 Issue 3, p1931. 15p.
Autor:
Zhong, Xiaotian, Schenk, Jennifer, Sakorafas, Paul, Chamberland, John, Tam, Amy, Thomas, L. Michael, Yan, Grace, D’ Antona, Aaron M., Lin, Laura, Nocula-Lugowska, Malgorzata, Zhang, Yan, Sousa, Eric, Cohen, Justin, Gu, Ling, Abel, Molica, Donahue, Jacob, Lim, Sean, Meade, Caryl, Zhou, Jing, Riegel, Logan, Birch, Alex, Fennell, Brian J., Franklin, Edward, Gomes, Jose M., Tzvetkova, Boriana, Scarcelli, John J.
Publikováno v:
In Journal of Biotechnology 10 December 2022 360:79-91
Autor:
Jackobek, Ryan, Herrick-Wagman, Sarah, Zhu, Lily, Francis, Christopher, Solbrand, Anita, Eriksson, Christer, Berg, Mikael, Go, Daniel, D'Antona, Aaron M
Publikováno v:
In Journal of Chromatography A 25 October 2020 1630
Autor:
Codara, Pietro, D'Antona, Ottavio M.
Publikováno v:
Discrete Mathematics, Volume 339, Issue 1, 6 January 2016, Pages 270-282, ISSN 0012-365X
The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively. In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the independent sets
Externí odkaz:
http://arxiv.org/abs/1410.4080
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs
Externí odkaz:
http://arxiv.org/abs/1407.2461
Publikováno v:
International Journal of Approximate Reasoning 50/6 (2009) 825-836
By a Ruspini partition we mean a finite family of fuzzy sets $\{f_1, \ldots, f_n\}$, $f_i : [0,1] \to [0,1]$, such that $\sum_{i=1}^n f_i(x)=1$ for all $x \in [0,1]$, where $[0,1]$ denotes the real unit interval. We analyze such partitions in the lan
Externí odkaz:
http://arxiv.org/abs/1401.5261
Publikováno v:
Journal of Multiple-Valued Logic and Soft Computing 19 (2012) 71-84
Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota in the Sixties, we define the Euler characteristic of a formula in G\"{o}del logic (over finitely or infinitely many truth-values). We then prove tha
Externí odkaz:
http://arxiv.org/abs/1401.5254
Publikováno v:
Discrete Mathematics 318 (2014) 53-57
In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a recurrence and,
Externí odkaz:
http://arxiv.org/abs/1308.1700
Publikováno v:
Mathematica Italia User Group Meeting (UGM) 2013, ISBN 9788896810033. (2013)
An open partition \pi{} [Cod09a, Cod09b] of a tree T is a partition of the vertices of T with the property that, for each block B of \pi, the upset of B is a union of blocks of \pi. This paper deals with the number, NP(n), of open partitions of the t
Externí odkaz:
http://arxiv.org/abs/1307.1348