If My Blood Pressure Is High,Do I Take It to Heart? Behavioral Effects of Biomarker Collection in the Health and Retirement Study

Starting in 2006, respondents in the biennial U.S. Health and Retirement Study were asked to submit biomarkers every other wave and were notified of several results. Rates of undiagnosed high blood pressure and diabetes according to these biomarkers were 1.5 % and 0.7 %, respectively. An intent-to-treat analysis suggests that collection and notification had small effects on the average respondent and may have reduced health care utilization. Among respondents who received notification of potentially dangerous biomarker levels, subsequent rates of new diagnosis and associated pharmaceutical usage increased by 20 to 40 percentage points, an order of magnitude above baseline. High blood glucose A1C was associated with a 2.2 % drop in weight and an increase in exercise among respondents without a previous diagnosis of diabetes. Notifications appear also to have altered health behaviors by spouses, suggesting household responses to health maintenance. Biomarker collection seems to have altered circumstances for an interesting minority of HRS respondents.     

1950年代:“本质—特征论”文学定义的形成及影响

1950年代形成了"本质—特征论"的文学定义,即先界定文学的意识形态本质,再界定文学是用形象的方式来反映社会生活、体现意识形态的特征。这一定义的思维方式是先界定事物的普遍性,再界定事物的特殊性,突出事物的普遍性关联,轻视事物的独特性质的揭示,使得文学研究本应着重研究文学的特殊性成为空话,不利于认识文学自身的规律。1980年代的文学审美论试图突破这种定义方式,但1990年代以来,反本质主义的文学语境论再次回到从事物的关联性定义事物的思维老路,文学自身本质问题受到质疑,弱化了文学与审美关联的重要性与必要性。     

Towards Uniformly Efficient Trend Estimation Under Weak/Strong Correlation and Non‐stationary Volatility

In this paper, we consider the deterministic trend model where the error process is allowed to be weakly or strongly correlated and subject to non‐stationary volatility. Extant estimators of the trend coefficient are analysed. We find that under heteroskedasticity, the Cochrane–Orcutt‐type estimator (with some initial condition) could be less efficient than Ordinary Least Squares (OLS) when the process is highly persistent, whereas it is asymptotically equivalent to OLS when the process is less persistent. An efficient non‐parametrically weighted Cochrane–Orcutt‐type estimator is then proposed. The efficiency is uniform over weak or strong serial correlation and non‐stationary volatility of unknown form. The feasible estimator relies on non‐parametric estimation of the volatility function, and the asymptotic theory is provided. We use the data‐dependent smoothing bandwidth that can automatically adjust for the strength of non‐stationarity in volatilities. The implementation does not require pretesting persistence of the process or specification of non‐stationary volatility. Finite‐sample evaluation via simulations and an empirical application demonstrates the good performance of proposed estimators.     

川东北地区须家河组二段储层差异性分析

随着勘探程度的深入，为了扩大四川盆地天然气勘探领域、寻找新的勘探接替区，四川盆地的勘探区域由盆内逐渐向盆缘延伸。在这种背景下，川东北地区须家河组二段相继取得新的勘探成果，但在勘探开发过程中逐渐暴露了诸如区块之间气井产能差异大，储层的碎屑组分、结构及厚度、物性、孔隙结构差异明显等问题，制约了勘探开发的步伐。针对上述问题，根据岩芯观察描述、分析化验资料及测井解释成果，从沉积、成岩方面入手，对比剖析了川东北龙岗和营山地区须二段储层特征的差异性及其成因，认为远离物源区和高能水体的反复淘洗是造成储层差异性的首要因素，强烈的压实作用和多期石英加大对储层差异性起关键作用，自生绿泥石衬边胶结和长石选择性溶蚀最终决定了储层差异性。从而解释了气藏勘探开发中遇到的诸多问题，对有效指导该区的下一步勘探开发工作具有重要意义。     

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.