On the complexity of testing membership in the core of min-cost spanning tree games

1997 ◽  
Vol 26 (3) ◽  
pp. 361-366 ◽  
Author(s):  
Ulrich Faigle ◽  
Walter Kern ◽  
Sándor P. Fekete ◽  
Winfried Hochstättler
Keyword(s):  
The Core ◽  
2012 ◽  
Author(s):  
Arantza Estevez-Fernandez ◽  
Hans Reijnierse

2014 ◽  
Vol 237 (2) ◽  
pp. 606-616 ◽  
Author(s):  
Arantza Estévez-Fernández ◽  
Hans Reijnierse

1997 ◽  
Vol 26 (3) ◽  
pp. 361-366 ◽  
Author(s):  
Ulrich Faigle ◽  
Walter Kern ◽  
S�ndor P. Fekete ◽  
Winfried Hochst�ttler
Keyword(s):  
The Core ◽  

1984 ◽  
Vol 29 (3) ◽  
pp. 323-347 ◽  
Author(s):  
Daniel Granot ◽  
Gur Huberman

2021 ◽  
Author(s):  
Minmin Leng ◽  
Yue Sun ◽  
Hui Chang ◽  
Zhiwen Wang

BACKGROUND Recognizing the correlations between care problems of people with dementia could be beneficial, as it may help clinicians choose treatment methods because related symptom groups may respond to the same treatment intervention. However, generalizable data on the prevalence of care problems and potential clusters of care problems in people with dementia in China remain unavailable. OBJECTIVE This study aimed to (1) evaluate the prevalence of various care problems of people with dementia, and (2) explore the core care problems and the correlation between care problems of people with dementia. METHODS A cross-sectional study design was adopted to identify the care problems of people with dementia reported by family caregivers. The questionnaire consisted of two parts. The first part was mainly socio-demographic questions of people with dementia. The second part was the care problems evaluation sheet which involved three aspects: daily living care problems, behavioral and psychological symptoms, and safety risks. Care problems of people with dementia were measured with this care problems evaluation sheet. Clustering analysis of the care problems based on Kruskal's minimum spanning tree (MST) algorithm was performed in the Jupyter Notebook software to explore the core care problems and the correlation between care problems. RESULTS A total of 687 participants were included in the analysis. In general, the prevalence of having difficulty in language performance, agitated behavior, incidence of falls was relatively higher in people with dementia, which distressed their family caregivers. Through the clustering analysis based on the Kruskal's MST algorithm, the 63 care problems were clustered into 7 clusters. The 7 core care problems were “Don't know how to dress in order”, “Refusing to take a bath”, “Bedridden”, “Hitting, kicking, pushing, or biting others”, “Pacing and aimless wandering”, “Complaining”, and “Choking on food”. CONCLUSIONS The prevalence of various care problems was high. Through the clustering analysis, care problems were clustered into 7 clusters and 7 core care problems were identified. The identity of just a few core care problems instead of a large number of them might have relevant clinical implications, in the sense that it may lead to a greater ease in the identification of underlying etiologies and to more rational treatments in people with dementia.


Author(s):  
Muhammad Aliyu ◽  
Murali M. ◽  
Abdulsalam Y. Gital ◽  
Souley Boukari ◽  
Rumana Kabir ◽  
...  

As cloud resource demand grows, supply chain management (SCM), which is the core function of cloud computing, faces serious challenges. Quite a number of techniques have been proposed by many researchers for such a challenge. As such, numerous proposed strategies are still under reckoning and modification so as to enhance its potential. An optimized dynamic scheme that combined several algorithms' characteristics was proposed to map out such a challenge. The hybridized proposed scheme involved the meta-heuristic swarm mechanism of ant colony optimization (ACO) and deterministic spanning tree (SPT) algorithm as it obtained faster convergence chain, ensured resource utilization in least time and cost. Extensive experiments conducted in cloudsim simulator provided an efficient result in terms of minimized makespan time and throughput as compared to SPT, round robin (RR), and pre-emptive fair scheduling algorithm (PFSA) as it significantly improves performance.


2000 ◽  
Vol 52 (1) ◽  
pp. 23-38 ◽  
Author(s):  
Ulrich Faigle ◽  
Walter Kern ◽  
Daniël Paulusma

Sign in / Sign up

Export Citation Format

Share Document