Zobrazeno 1 - 10
of 1 053
pro vyhledávání: '"A. Hernandez-Cruz"'
Predicting human intent is challenging yet essential to achieving seamless Human-Robot Collaboration (HRC). Many existing approaches fail to fully exploit the inherent relationships between objects, tasks, and the human model. Current methods for pre
Externí odkaz:
http://arxiv.org/abs/2410.00302
Autor:
Zamora-Aviles, Manuel, Camacho, Vianey, Ballesteros-Paredes, Javier, Vázquez-Semadeni, Enrique, Palau, Aina, Román-Zúñiga, Carlos, Hernández-Cruz, Andrés, Gómez, Gilberto C., Quesada-Zúñiga, Fabián, Naranjo-Romero, Raúl
We explore the Schmidt-Kennicutt (SK) relations and the star formation efficiency per free-fall time ($\eff$), mirroring observational studies, in numerical simulations of filamentary molecular clouds undergoing gravitational contraction. We find tha
Externí odkaz:
http://arxiv.org/abs/2409.11588
A kernel in a digraph is an independent and absorbent subset of its vertex set. A digraph is critical kernel imperfect if it does not have a kernel, but every proper induced subdigraph does. In this article, we characterize asymmetrical $4$-quasi-tra
Externí odkaz:
http://arxiv.org/abs/2405.01767
Autor:
Fabila-Monroy, Ruy, Gómez-Galicia, Sergio Gerardo, Hernández-Cruz, César, Trujillo-Negrete, Ana Laura
Let $G$ be a graph on $n$ vertices and $1 \le k \le n$ a fixed integer. The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertex set is equal to all the $k$-subsets of $V(G)$; where two of them are adjacent whenever their symmetric difference
Externí odkaz:
http://arxiv.org/abs/2402.17962
Autor:
Ayala-Torres, Marco Alberto, Beltrán, Lucina Gabriela Espinoza, Hernández-Cruz, Luis A., Montaño, Luis Manuel, Moreno-Barbosa, Eduardo, Fernández, C. H. Zepeda
The Multipurpose Detector (MPD) consists of a typical array of sub-detectors to study the nuclear matter originating from the collisions of beams provided by the Nuclotron-based Ion Collider fAcility (NICA). A beam monitoring detector~(BeBe) is propo
Externí odkaz:
http://arxiv.org/abs/2305.17847
A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and monopolar
Externí odkaz:
http://arxiv.org/abs/2210.02497
Autor:
Brian D. Richter, Gambhir Lamsal, Landon Marston, Sameer Dhakal, Laljeet Singh Sangha, Richard R. Rushforth, Dongyang Wei, Benjamin L. Ruddell, Kyle Frankel Davis, Astrid Hernandez-Cruz, Samuel Sandoval-Solis, John C. Schmidt
Publikováno v:
Communications Earth & Environment, Vol 5, Iss 1, Pp 1-12 (2024)
Abstract Persistent overuse of water supplies from the Colorado River during recent decades has substantially depleted large storage reservoirs and triggered mandatory cutbacks in water use. The river holds critical importance to more than 40 million
Externí odkaz:
https://doaj.org/article/24f1ba2aa7c24418a755fea00b494a5a
It is known that every hereditary property can be characterized by finitely many minimal obstructions when restricted to either the class of cographs or the class of $P_4$-reducible graphs. In this work, we prove that also when restricted to the clas
Externí odkaz:
http://arxiv.org/abs/2203.04953
Autor:
Hernández-Cruz, Estefani Y., Aparicio-Trejo, Omar E., Hammami, Fadi A., Bar-Shalom, Daniel, Tepel, Martin, Pedraza-Chaverri, Jose, Scholze, Alexandra
Publikováno v:
In Kidney International Reports October 2024 9(10):2883-2903
Autor:
Hernandez-Cruz, Pablo, María Hidalgo-Betanzos, Juan, Flores-Abascal, Ivan, Erkoreka-Gonzalez, Aitor, Fernandez-Luzuriaga, Jon
Publikováno v:
In Energy & Buildings 15 September 2024 319