Care prevention comprises an integral part of long-term care in Japan and is provided across the following populations: those without problems when screened by the Basic Check List (BCL, Type 1), those having problems...Care prevention comprises an integral part of long-term care in Japan and is provided across the following populations: those without problems when screened by the Basic Check List (BCL, Type 1), those having problems when screened by the BCL (Type 2), and those certified in the “support need levels” by the long-term care insurance eligibility assessment (Type 3). We aimed to clarify the care prevention needs across these three populations by using the interRAI Check-Up, an internationally developed instrument. We conducted cross-sectional surveys to assess care prevention needs for convenience samples of community-dwelling older adults in two cities in western Japan from October 2016 to December 2017, and we integrated the secondary data of older adults’ assessment from September 2014 to June 2018. Prevalence rates of nine domains of care prevention needs were calculated. Among the 125 participants, 20 were Type 1, 23 were Type 2, and 82 were Type 3. All three types had the following needs that had not been assessed in the BCL: pains, risk of hospital-emergency room visits, driving reviews, and instrumental activities of daily living capacity. The results showed that interventions for a wide range of care prevention needs should be considered in the long-term care prevention project.展开更多
Abstrac Khmelnitskaya et al.have recently proposed the average covering tree value as a new solution concept for cooperative transferable utility games with directed graph structure.The average covering tree value is...Abstrac Khmelnitskaya et al.have recently proposed the average covering tree value as a new solution concept for cooperative transferable utility games with directed graph structure.The average covering tree value is defined as the average of marginal contribution vectors corresponding to the specific set of rooted trees,and coincides with the Shapley value when the game has complete communication structure.In this paper,we discuss the computational complexity of the average covering tree value.We show that computation of the average covering tree value is#P-complete even if the characteristic function of the game is{0,1}-valued.We prove this by a reduction from counting the number of all linear extensions of a partial order,which has been shown by Brightwell et al.to be a#P-complete counting problem.The implication of this result is that an efficient algorithm to calculate the average covering tree value is unlikely to exist.展开更多
文摘Care prevention comprises an integral part of long-term care in Japan and is provided across the following populations: those without problems when screened by the Basic Check List (BCL, Type 1), those having problems when screened by the BCL (Type 2), and those certified in the “support need levels” by the long-term care insurance eligibility assessment (Type 3). We aimed to clarify the care prevention needs across these three populations by using the interRAI Check-Up, an internationally developed instrument. We conducted cross-sectional surveys to assess care prevention needs for convenience samples of community-dwelling older adults in two cities in western Japan from October 2016 to December 2017, and we integrated the secondary data of older adults’ assessment from September 2014 to June 2018. Prevalence rates of nine domains of care prevention needs were calculated. Among the 125 participants, 20 were Type 1, 23 were Type 2, and 82 were Type 3. All three types had the following needs that had not been assessed in the BCL: pains, risk of hospital-emergency room visits, driving reviews, and instrumental activities of daily living capacity. The results showed that interventions for a wide range of care prevention needs should be considered in the long-term care prevention project.
基金This work was partially supported by the Okawa Foundation for Information and TelecommunicationWe wish to thank the two anonymous reviewers for their constructive suggestions and comments.The comments have helped us significantly improve the paper.
文摘Abstrac Khmelnitskaya et al.have recently proposed the average covering tree value as a new solution concept for cooperative transferable utility games with directed graph structure.The average covering tree value is defined as the average of marginal contribution vectors corresponding to the specific set of rooted trees,and coincides with the Shapley value when the game has complete communication structure.In this paper,we discuss the computational complexity of the average covering tree value.We show that computation of the average covering tree value is#P-complete even if the characteristic function of the game is{0,1}-valued.We prove this by a reduction from counting the number of all linear extensions of a partial order,which has been shown by Brightwell et al.to be a#P-complete counting problem.The implication of this result is that an efficient algorithm to calculate the average covering tree value is unlikely to exist.
