Study on Time Expectancy of Care for Daily Living of Chinese Elderly

According to the data of the Chinese Longitudinal Healthy Longevity Survey(CLHLS)and applyin g methods of Sullivan and multistate life table,this paper examines the time expectancy of care for daily living of Chinese elderly and its proportion in their elderly life.The results find that there exists a signifi cant gender gap of the expectancy,which the male at 65averagely are expected to have four to five care years while the female at 65averagely are expected to have seven to eight care years.The time expectancy for slight care of daily living is longer than that for sever care.Additionally,there is no significant difference between urban elderly and rural elderly.However,as age increases,the time expectancy for slight care goes down while that for sever care stabilities at a constant at different ages.The time expectancy for different types of care and its proportion in the rest of life are significantly various.The study points out that the establishment and improvement of care insurance system and the elderly care service are very necessary.     

Transparency and Resource Allocation of Grassroots Nonprofits in China

VOLUNTAS: International Journal of Voluntary and Nonprofit Organizations - Organizational transparency has become a prominent concern for the nonprofit sector as it expands globally. Transparency...     

儒家文化命运辨析——全球化时代几种儒家文化归宿理论的实证检验

"儒家文化的命运"关系到每个中国人的安身立命,关系到中华民族和中国的命运,关系到人类和世界格局及其发展趋势。本文以10个样本城市1254个样本的经验数据为根据,澄清了两个诉说纷纭的问题:一,儒家文化的生存状态,它是一成不变地保留下来了,还是已经彻底消亡,抑或是处于一种折中状态?二,近年出现的传统文化复兴现象的性质,它是一个暂时的现象,还是一个长期历史趋势的开端?实证分析表明:一、儒家文化的生存状态,既不是张之洞所言的"一成不变",也不是列文森所言的"彻底消亡"。在经历了一个半世纪的被妖魔化的历史之后,经过损益的儒家文化仍然活着。二、近年来出现的传统文化复兴现象,不是一场误会,而是历史的必然;不是稍纵即逝的泡沫,而是一个长期历史趋势的开端。儒家文化正迎来一个复兴的时代。儒家文化之所以在此时走上复兴之路,一是中国的终极文化具有超越时代的素质,这种素质孕育了其复兴的"可能性";二是中国的工具文化现代化获得了空前成功,这种成功创造了使可能转化为现实的"大势";三是当下的有利的现实的经济、政治、社会和国际条件。     

Constant factor approximation for the weighted partial degree bounded edge packing problem

In the partial degree bounded edge packing problem (PDBEP), the input is an undirected graph \(G=(V,E)\) with capacity \(c_v\in {\mathbb {N}}\) on each vertex v. The objective is to find a feasible subgraph \(G'=(V,E')\) maximizing \(|E'|\), where \(G'\) is said to be feasible if for each \(e=\{u,v\}\in E'\), \(\deg _{G'}(u)\le c_u\) or \(\deg _{G'}(v)\le c_v\). In the weighted version of the problem, additionally each edge \(e\in E\) has a weight w(e) and we want to find a feasible subgraph \(G'=(V,E')\) maximizing \(\sum _{e\in E'} w(e)\). The problem is already NP-hard if \(c_v = 1\) for all \(v\in V\) (Zhang in: Proceedings of the joint international conference on frontiers in algorithmics and algorithmic aspects in information and management, FAW-AAIM 2012, Beijing, China, May 14–16, pp 359–367, 2012). In this paper, we introduce a generalization of the PDBEP problem. We let the edges have weights as well as demands, and we present the first constant-factor approximation algorithms for this problem. Our results imply the first constant-factor approximation algorithm for the weighted PDBEP problem, improving the result of Aurora et al. (FAW-AAIM 2013) who presented an \(O(\log n)\)-approximation for the weighted case. We also study the weighted PDBEP problem on hypergraphs and present a constant factor approximation if the maximum degree of the hypergraph is bounded above by a constant. We study a generalization of the weighted PDBEP problem with demands where each edge additionally specifies whether it requires at least one, or both its end-points to not exceed the capacity. The objective is to pick a maximum weight subset of edges. We give a constant factor approximation for this problem. We also present a PTAS for the weighted PDBEP problem with demands on H-minor free graphs, if the demands on the edges are bounded by polynomial. We show that the PDBEP problem is APX-hard even for bipartite graphs with \(c_v = 1, \; \forall v\in V\) and having degree at most 3.     

Quality of Life in Italian Official Surveys

Quality-of-life studies have a 50-year history and inherited the tradition of the “social indicators” movement, born in the United States during the sixties and involving scholars and researchers, supported by the public administration and interested in gathering and analysing data aimed at studying non-economic components of societal wellbeing. The idea of quantifying “symptoms” (indicators) of living conditions has been launched by Italian statistician and criminologist, Alfredo Niceforo, who has been recognised as the pioneer of social-indicators concept. Moreover, with his book on Les indices numérique de la civilisation et du progrès, he may be considered the originator of an approach of comprehensive welfare and quality of life measurement as it is the concern of modern social indicators and quality of life.     

Unterstützung dualer Karrieren im Spitzensport

The longstanding focus of elite athletes on top sports entails disadvantages hampering their later entry to the world of work. In order to successfully contribute their outstanding personality traits to a later job, athletes are thus particularly required to care for their employability. Contributing to this, the author carried out a competency balancing with top athletes. This coaching method significantly decreased the athletes’ need for self-information. Evaluation further showed indications of increased clarity and certainty of occupational goals as well as work satisfaction.     

The matching extension problem in general graphs is co-NP-complete

A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete.     

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays

We revise existing and introduce new mixed-integer programming models for the Multiprocessor scheduling problem with communication delays. The basis for both is the identification of two major modeling strategies one of which can be considered ordering-based, and the other assignment-based. We first reveal redundancies in the encoding of feasible solutions found in present formulations and discuss how they can be avoided. For the assignment-based approach, we propose new inequalities that lead to provably stronger continuous relaxations and better performance in practice. Moreover, we derive a third, novel modeling strategy and show how to more compactly linearize assignment formulations with quadratic constraints. In a comprehensive experimental comparison of representative models that reflect the state-of-the-art in terms of strength and size, we evaluate not only running times but also the obtained lower and upper bounds on the makespan for the harder instances of a large scale benchmark set.     

Klassen messen

The article investigates whether Austrian sociological research empirically addressed social class conceptions between 1945 and 1990. Contrary to the German reception, we find that, indeed, during the whole period scientific publications analyzed social relations and social change from a class perspective with an empirical approach. We embed this research in its historical context in order to work out the implicit explanations given concerning the existence of social inequalities. Moreover, we work out if post-World War II Austrian class analysis did link its work to the Austro-Marxist tradition that flourished between the two World Wars. The empirical focus of the article lies on scientific publications with an empirical approach to social classes and social change.