Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Jesús Acosta-Elías"'
Autor:
Martin O. Mendez, Jesús Acosta-Elías, Juha M. Kortelainen, Jordi A. Ramírez-Elías, Miguel G. Ramírez-Elías, Alfonso Alba, Guillermina Guerrero-Mora, Guadalupe Dorantes-Méndez, Mirja Tenhunen
Publikováno v:
Ramirez-Elias, J, Ramirez-Elias, M, Acosta-Elias, J, Dorantes-Mendez, G, Alba, A, Mendez, M O, Guerrero-Mora, G, Kortelainen, J M & Tenhunen, M L 2019, ' Spectral properties of the respiratory signal during sleep apnea events : Obtrusive and unobtrusive measurements ', International Journal of Modern Physics C, vol. 30, no. 5, 1950030 . https://doi.org/10.1142/S012918311950030X
People with obstructive sleep apnea hypopnea syndrome (OSAHS) are affected by disruption in normal breathing patterns during sleep. In the literature, it is common to find acquisition of Thoracic (THO) and abdominal (ABD) movements with piezo-electri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c64d1646882fb827ed5583700437cb30
https://cris.vtt.fi/en/publications/203219b6-b0c2-41f6-97c7-f935e618109c
https://cris.vtt.fi/en/publications/203219b6-b0c2-41f6-97c7-f935e618109c
Autor:
Jesús Acosta-Elías, R. E. Balderas-Navarro, J. Esquivel-Gómez, P. Castillo-Castillo, P. D. Arjona-Villicaña, O. Rico-Trejo
Publikováno v:
Complexity, Vol 2017 (2017)
Most growth models for complex networks consider networks comprising a single connected block or island, which contains all the nodes in the network. However, it has been demonstrated that some large complex networks have more than one island, with a
Publikováno v:
IEICE Transactions on Communications. :2642-2645
Autor:
Ulises Pineda-Rico, Jesús Acosta-Elías, P. D. Arjona-Villicaña, R. E. Balderas-Navarro, Enrique Stevens-Navarro, J. Esquivel-Gómez
Publikováno v:
Scientific Reports
The out-degree distribution is one of the most reported topological properties to characterize real complex networks. This property describes the probability that a node in the network has a particular number of outgoing links. It has been found that
Publikováno v:
Scientific Reports
Many growth models have been published to model the behavior of real complex networks. These models are able to reproduce several of the topological properties of such networks. However, in most of these growth models, the number of outgoing links (i
Publikováno v:
International Journal of Modern Physics C. 26:1550142
Local processes exert influence on the growth and evolution of complex networks, which in turn shape the topological and dynamic properties of these networks. Some local processes have been researched, for example: Addition of nodes and links, rewiri
Publikováno v:
International Journal of Modern Physics C. 26:1550066
Several real-world directed networks do not have multiple links. For example, in a paper citation network a paper does not cite two identical references, and in a network of friends there exists only a single link between two individuals. This sugges
Autor:
B. Pineda-Reyes, Jose Martin Luna-Rivera, Jesús Acosta-Elías, M. Recio-Lara, O. Gutierrez-Navarro
Publikováno v:
Parallel and Distributed Processing and Applications ISBN: 9783540680673
ISPA
ISPA
Epidemic algorithms are an emerging technique that has recently gained popularity as a potentially effective solution for disseminating information in large-scale network systems. For some application scenarios, efficient and reliable data disseminat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a90c5f99799315fdb97b0f2b51381c64
https://doi.org/10.1007/11946441_43
https://doi.org/10.1007/11946441_43
Autor:
B. Pineda Reyes, Jesús Acosta-Elías, E. Chavez Leos, Mario Recio, Alejandro Ochoa-Cardiel, O. Gutierrez-Navarro
Publikováno v:
Parallel and Distributed Processing and Applications ISBN: 9783540297697
ISPA
ISPA
In this paper we evaluate our own weak consistency algorithm, which is called the ”Fast Consistency Algorithm”, and whose main aim is optimizing the propagation of changes introducing a preference for nodes and zones of the network which have gre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc22df8ce66ad7d8017ead70a1bfc32b
https://doi.org/10.1007/11576235_13
https://doi.org/10.1007/11576235_13
Publikováno v:
Computational Science-ICCS 2004 ISBN: 9783540221142
International Conference on Computational Science
International Conference on Computational Science
Weak consistency algorithms allow us to propagate changes in a large, arbitrary changing storage network in a self-organizing way. These algorithms generate very little traffic overhead. In this paper we evaluate our own weak consistency algorithm, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c07a29178af80ebabeba37db4e2bf9c
https://doi.org/10.1007/978-3-540-24685-5_103
https://doi.org/10.1007/978-3-540-24685-5_103