Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Ping-Yen Yang"'
Autor:
Shuo-Chen Chien, Yu-Hung Chang, Chia-Ming Yen, Ying-Erh Chen, Chia-Chun Liu, Yu-Ping Hsiao, Ping-Yen Yang, Hong-Ming Lin, Tsung-En Yang, Xing-Hua Lu, I-Chien Wu, Chih-Cheng Hsu, Hung-Yi Chiou, Ren-Hua Chung
Publikováno v:
BMC Geriatrics, Vol 24, Iss 1, Pp 1-11 (2024)
Abstract Background Quantifying the informal caregiver burden is important for understanding the risk factors associated with caregiver overload and for evaluating the effectiveness of services provided in Long-term Care (LTC). Objective This study a
Externí odkaz:
https://doaj.org/article/d5732866eb8848af983aefaf308bd268
Publikováno v:
BMC Geriatrics, Vol 20, Iss 1, Pp 1-11 (2020)
Abstract Background An aging society incurs great losses due to fall-related injuries and mortalities. The foreseeable increased burden of fall-related injury among older people requires a regular nationwide study on the fall epidemic and prevention
Externí odkaz:
https://doaj.org/article/7b22981c48b34917bf01bbfd9ba71430
Autor:
Ping-Yen Yang, Shun-Pin Hsu
Publikováno v:
IFAC-PapersOnLine. 53:3427-3432
The Laplacian controllability of a family of graphs that are non-simple is studied in the paper. Without the regular assumption that the adjacency matrix is binary, the authors consider more flexible weighting parameters to represent the practical co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b92b5b91d6e3f77498a93cb9364e71e4
https://doi.org/10.1016/j.ifacol.2020.12.1666
https://doi.org/10.1016/j.ifacol.2020.12.1666
Autor:
Shun-Pin Hsu, Ping-Yen Yang
Publikováno v:
IET Control Theory & Applications. 13:861-868
It is well known that if a network topology is a path or line and the states of vertices or nodes evolve according to the consensus policy, then the network is Laplacian controllable by an input connected to its terminal vertex. In this work, a path
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0a90ec98e7cb202ecf51ffe97e21268
https://doi.org/10.1049/iet-cta.2018.6214
https://doi.org/10.1049/iet-cta.2018.6214
Publikováno v:
BMC Geriatrics
BMC Geriatrics, Vol 20, Iss 1, Pp 1-11 (2020)
BMC Geriatrics, Vol 20, Iss 1, Pp 1-11 (2020)
Background An aging society incurs great losses due to fall-related injuries and mortalities. The foreseeable increased burden of fall-related injury among older people requires a regular nationwide study on the fall epidemic and prevention strategie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6db1b37522e1e4b2f8492d2b2847a938
https://doi.org/10.21203/rs.2.22124/v4
https://doi.org/10.21203/rs.2.22124/v4
Background An aging society incurs great losses due to fall-related injuries and mortalities. The foreseeable increased burden of injury due to falls among elderly people requires a nationwide study on the fall epidemic in Taiwan. Methods The fall ep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f50c00dd85ccb4efb09b0deb3be733ce
https://doi.org/10.21203/rs.2.22124/v1
https://doi.org/10.21203/rs.2.22124/v1
Additional file 2: Table S2. Multiple linear regression model for the age- and sex-specific prevalence of falls.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b35b0e520b684e9825bc97d9cdd3c8c7
Minimum Laplacian controllability of graphs based on interconnecting two classes of threshold graphs
Publikováno v:
Allerton
In this work we study the Laplacian controllability of a class of connected simple graphs. Consider two $k -$ vertex threshold graphs, each with its own unique repeated degree. Suppose the multiplicities of the repeated degrees in the first and secon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4247038ce72955325aca893aaf492312
https://doi.org/10.1109/allerton.2019.8919877
https://doi.org/10.1109/allerton.2019.8919877
Autor:
Ping-Yen Yang, Shun-Pin Hsu
Publikováno v:
CASE
In this paper we consider the Laplacian controllability problem of combining two special threshold graphs. We form this combination by connecting two identical and connected threshold graphs which have exactly one repeated degree. With appropriate se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3f1d3a7e203fa50079385b74b125210
https://doi.org/10.1109/coase.2018.8560603
https://doi.org/10.1109/coase.2018.8560603
Publikováno v:
SoCPaR
Recently, the prosperity of social network nourished web services such as virtual community and web community. With the readily available social networking sites and the accessible internet, the interaction between people has become much frequently t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::209e244dd2ef3084b0dd127007a03805
https://doi.org/10.1109/socpar.2014.7008013
https://doi.org/10.1109/socpar.2014.7008013