A Concept to Improve Care for People with Dementia

AbstractDementia is one of the severe causes of mortality in elder groups of human population, and the number of dementia patients is expected to increase all over the world. Globally, the cost to take care of patients with the illness is high. Moreover, the lives for dementia patients are commonly impacted by a variety of challenges, for example, in terms of communication, emotional behaviour, confusion and wandering. Therefore, the future aim is to develop a serious games package which can help to slow down the progression of dementia, better life for the patients and their loved one and reduce the use of medications and the cost for the government sectors. In this study, a conceptual model was formed to present the problems the dementia patients and their caregivers are facing, and non-pharmacological approaches are suggested to slow down the progression of dementia-related impairments and behavioural symptoms by using well-structured serious games with personalised data.Abstract Dementia is one of the severe causes of mortality in elder groups of human population, and the number of dementia patients is expected to increase all over the world. Globally, the cost to take care of patients with the illness is high. Moreover, the lives for dementia patients are commonly impacted by a variety of challenges, for example, in terms of communication, emotional behaviour, confusion and wandering. Therefore, the future aim is to develop a serious games package which can help to slow down the progression of dementia, better life for the patients and their loved one and reduce the use of medications and the cost for the government sectors. In this study, a conceptual model was formed to present the problems the dementia patients and their caregivers are facing, and non-pharmacological approaches are suggested to slow down the progression of dementia-related impairments and behavioural symptoms by using well-structured serious games with personalised data

A boundary property for upper domination

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard, but can be solved in polynomial time in some restricted graph classes, such as P4 -free graphs or 2K2 -free graphs. For classes defined by finitely many forbidden induced subgraphs, the boundary separating difficult instances of the problem from polynomially solvable ones consists of the so called boundary classes. However, none of such classes has been identified so far for the upper dominating set problem. In the present paper, we discover the first boundary class for this problem

On the Complexity of the Upper r-Tolerant Edge Cover Problem

International audienceWe consider the problem of computing edge covers that are tolerant to a certain number of edge deletions. We call the problem of finding a minimum such cover r-Tolerant Edge Cover (r-EC) and the problem of finding a maximum minimal such cover Upper r-EC. We present several NP-hardness and inapproximability results for Upper r-EC and for some of its special cases