As China’s economy is rapidly changing from a planned to a capitalist economy, many families find themselves financially struggling. In some cases, conflicting values and attitudes may contribute to mental health challenges such as depression that would lead to further feelings of helplessness and immobilization. Using a random sample of 1006 low-income households from Pudong District of Shanghai, China, this study aims to examine the relationships between household assets, beliefs about government as the primary way to improve economic circumstances and self-reported depressive symptoms. In addition, this study investigates the mediation effects of beliefs that government is the best change agent for improved life circumstances on the relationship between household assets and depression. We found those who indicated that government was the main means for attaining a better life had significantly higher depression levels whereas higher numbers of household assets were associated with lower depression levels. We also found that viewing government as the most important change agent only partially mediated the relationship between household assets and depression (p?<?.001). Findings from this study support anti-poverty policies and social work related practice initiatives aimed at assisting low income families in China, in particular the need to address psychological as well as economic needs.
A 2-distance k-coloring of a graph G is a proper k-coloring such that any two vertices at distance two get different colors. \(\chi _{2}(G)\)=min{k|G has a 2-distance k-coloring}. Wegner conjectured that for each planar graph G with maximum degree \(\Delta \), \(\chi _2(G) \le 7\) if \(\Delta \le 3\), \(\chi _2(G) \le \Delta +5\) if \(4\le \Delta \le 7\) and \(\chi _2(G) \le \lfloor \frac{3\Delta }{2}\rfloor +1\) if \(\Delta \ge 8\). In this paper, we prove that: (1) If G is a planar graph with maximum degree \(\Delta \le 5\), then \(\chi _{2}(G)\le 20\); (2) If G is a planar graph with maximum degree \(\Delta \ge 6\), then \(\chi _{2}(G)\le 5\Delta -7\). 相似文献
In this paper, a rumor blocking problem is studied with an objective function which is neither submodular or supermodular. We will prove that this problem is NP-hard and give a data-dependent approximation with sandwich method. In addition, we show that every set function has a pair of monotone nondecreasing modular functions as upper bound and lower bound, respectively. 相似文献