Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Andrews, Eric A."'
Autor:
Jolly, Eshin, Farrens, Max, Greenstein, Nathan, Eisenbarth, Hedwig, Reddan, Marianne, Andrews, Eric, Wager, Tor D., Chang, Luke J.
A fundamental challenge in emotion research is measuring feeling states with high granularity and temporal precision without disrupting the emotion generation process. Here we introduce and validate a new approach in which responses are sparsely samp
Externí odkaz:
http://arxiv.org/abs/2109.06906
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Raffaelli, Quentin1,2 (AUTHOR) quentinraffaelli@arizona.edu, Andrews, Eric S.1,2 (AUTHOR), Cegavske, Caitlin C.1 (AUTHOR), Abraham, Freya F.1 (AUTHOR), Edgin, Jamie O.1 (AUTHOR), Andrews-Hanna, Jessica R.1,2 (AUTHOR) jandrewshanna@arizona.edu
Publikováno v:
Scientific Reports. 5/2/2023, Vol. 13 Issue 1, p1-13. 13p.
Autor:
Raffaelli, Quentin, Malusa, Rudy, de Stefano, Nadia-Anais, Andrews, Eric, Grilli, Matthew D., Mills, Caitlin, Zabelina, Darya L., Andrews-Hanna, Jessica R.
Publikováno v:
Creativity Research Journal; Jul-Sep2024, Vol. 36 Issue 3, p396-412, 17p
Autor:
Piper, Walter H., Brunk, Kristin M., Jukkala, Gabriella L., Andrews, Eric A., Yund, Seth R., Gould, Nelson G.
Publikováno v:
Behavioral Ecology and Sociobiology, 2018 Jun 01. 72(6), 1-12.
Externí odkaz:
https://www.jstor.org/stable/44857380
Autor:
Stoica, Teodora, Andrews, Eric S., Deffner, Austin M., Griffith, Christopher, Grilli, Matthew D., Andrews-Hanna, Jessica R.
Publikováno v:
Affective Science; June 2024, Vol. 5 Issue: 2 p141-159, 19p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 3, Pp 613-627 (2014)
A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex colo
Externí odkaz:
https://doaj.org/article/2f0f64ca7dc34ef9b1dc0117ad739d46
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 391-408 (2014)
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is
Externí odkaz:
https://doaj.org/article/a9ec3088d29345e7acf84b33f58db922
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 1, Pp 5-22 (2014)
In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic.
Externí odkaz:
https://doaj.org/article/c828debd480742df8e41b3d6c73eab09