Long working hours and risk of coronary heart disease and stroke: a systematic review and meta-analysis of published and unpublished data for 603 838 individuals

Background: Long working hours might increase the risk of cardiovascular disease, but prospective evidence is scarce, imprecise, and mostly limited to coronary heart disease. We aimed to assess long working hours as a risk factor for incident coronary heart disease and stroke. 

Methods We identified published studies through a systematic review of PubMed and Embase from inception to Aug 20, 2014. We obtained unpublished data for 20 cohort studies from the Individual-Participant-Data Meta-analysis in Working Populations (IPD-Work) Consortium and open-access data archives. We used cumulative random-effects meta-analysis to combine effect estimates from published and unpublished data. 

Findings We included 25 studies from 24 cohorts in Europe, the USA, and Australia. The meta-analysis of coronary heart disease comprised data for 603 838 men and women who were free from coronary heart disease at baseline; the meta-analysis of stroke comprised data for 528 908 men and women who were free from stroke at baseline. Follow-up for coronary heart disease was 5·1 million person-years (mean 8·5 years), in which 4768 events were recorded, and for stroke was 3·8 million person-years (mean 7·2 years), in which 1722 events were recorded. In cumulative meta-analysis adjusted for age, sex, and socioeconomic status, compared with standard hours (35-40 h per week), working long hours (≥55 h per week) was associated with an increase in risk of incident coronary heart disease (relative risk [RR] 1·13, 95% CI 1·02-1·26; p=0·02) and incident stroke (1·33, 1·11-1·61; p=0·002). The excess risk of stroke remained unchanged in analyses that addressed reverse causation, multivariable adjustments for other risk factors, and different methods of stroke ascertainment (range of RR estimates 1·30-1·42). We recorded a dose-response association for stroke, with RR estimates of 1·10 (95% CI 0·94-1·28; p=0·24) for 41-48 working hours, 1·27 (1·03-1·56; p=0·03) for 49-54 working hours, and 1·33 (1·11-1·61; p=0·002) for 55 working hours or more per week compared with standard working hours (p_trend<0·0001).

Interpretation Employees who work long hours have a higher risk of stroke than those working standard hours; the association with coronary heart disease is weaker. These findings suggest that more attention should be paid to the management of vascular risk factors in individuals who work long hours. 

EARLY RADIO AND X-RAY OBSERVATIONS OF THE YOUNGEST NEARBY TYPE Ia SUPERNOVA PTF 11kly (SN 2011fe)

On 2011 August 24 (UT) the Palomar Transient Factory (PTF) discovered PTF11kly (SN 2011fe), the youngest and most nearby Type Ia supernova (SN Ia) in decades. We followed this event up in the radio (centimeter and millimeter bands) and X-ray bands, starting about a day after the estimated explosion time. We present our analysis of the radio and X-ray observations, yielding the tightest constraints yet placed on the pre-explosion mass-loss rate from the progenitor system of this supernova. We find a robust limit of from sensitive X-ray non-detections, as well as a similar limit from radio data, which depends, however, on assumptions about microphysical parameters. We discuss our results in the context of single-degenerate models for SNe Ia and find that our observations modestly disfavor symbiotic progenitor models involving a red giant donor, but cannot constrain systems accreting from main-sequence or sub-giant stars, including the popular supersoft channel. In view of the proximity of PTF11kly and the sensitivity of our prompt observations, we would have to wait for a long time (a decade or longer) in order to more meaningfully probe the circumstellar matter of SNe Ia.

Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others. Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule. In this paper we contrast two different views on interpreting the weights attached to rules. Under the first view, weights reflect the certainty with which we can conclude the head of a rule when its body is satisfied. Under the second view, weights reflect the certainty that a given rule restricts the considered epistemic states of an agent in a valid way, i.e. it is the certainty that the rule itself is correct. The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets.

Characterizing and Extending Answer Set Semantics using Possibility Theory

Answer Set Programming (ASP) is a popular framework for modelling combinatorial problems. However, ASP cannot be used easily for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, whereas this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.

Weak and strong disjunction in possibilistic ASP

Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the current semantics of possibilistic disjunctive programs are not entirely satisfactory. The problem is twofold. First, the treatment of negation-as-failure in existing approaches follows an all-or-nothing scheme that is hard to match with the graded notion of proof underlying PASP. Second, we advocate that the notion of disjunction can be interpreted in several ways. In particular, in addition to the view of ordinary ASP where disjunctions are used to induce a non-deterministic choice, the possibilistic setting naturally leads to a more epistemic view of disjunction. In this paper, we propose a semantics for possibilistic disjunctive programs, discussing both views on disjunction. Extending our earlier work, we interpret such programs as sets of constraints on possibility distributions, whose least specific solutions correspond to answer sets.

Communicating ASP and the Polynomial Hierarchy

Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expressiveness of this framework crucially depends on the nature of the communication mechanism that is adopted. The communication mechanism we introduce in this paper allows us to focus on a sequence of programs, where each program in the sequence may successively eliminate some of the remaining models. The underlying intuition is that of leaders and followers: each agent’s decisions are limited by what its leaders have previously decided. We show that extending answer set programs in this way allows us to capture the entire polynomial hierarchy.

Possibilistic Answer Set Programming Revisited

Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP programs. We furthermore provide a syntactic counterpart, leading to a possibilistic generalization of the well-known Gelfond-Lifschitz reduct, and we show how our framework can readily be implemented using standard ASP solvers.

Communicating Answer Set Programs

Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been thoroughly studied. We show that allowing simple programs to talk to each other results in the same expressivity as adding negation-as-failure. Furthermore, we show that the ability to focus on one program in a network of simple programs results in the same expressivity as adding disjunction in the head of the rules.

Towards Possibilistic Fuzzy Answer Set Programming

Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to derive conclusions from imprecise information. To cope with this, we propose an extension of FASP based on possibility theory. The resulting framework allows us to reason about uncertain information in continuous domains, and thus also about information that is imprecise or vague. We propose a syntactic procedure, based on an immediate consequence operator, and provide a characterization in terms of minimal models, which allows us to straightforwardly implement our framework using existing FASP solvers.

Comparing Social Work Students' Perceptions of Risk Using Online Discussion Fora: Lessons Learned from a European Pilot Project

Comparisons of international child welfare systems have identified two basic orientations to practice; a ‘child protection’ orientation and a ‘child welfare’ orientation, which are founded upon fundamentally different values and assumptions regarding the family, the origins of child care problems, and the proper role of the state in relation to the family. This paper describes a project which sought to compare how undergraduate social work students from three European Universities perceive risk in referrals about the welfare of children and to explore the impact of different cultural, ideological and educational contexts on the way in which risk is constructed by students. Students from Northern Ireland, Germany and Poland examined three vignettes via ten online discussion fora each of which provided a narrative summary of their discussion. The paper presents some findings from the analysis of the qualitative data emerging from the student discussions and draws out the lessons learned in terms of how the project was designed and implemented using online discussion fora.

Fish product mislabelling: failings of traceability in the production chain and implications for illegal, unreported and unregulated (IUU) fishing

Increasing consumer demand for seafood, combined with concern over the health of our oceans, has led to many initiatives aimed at tackling destructive fishing practices and promoting the sustainability of fisheries. An important global threat to sustainable fisheries is Illegal, Unreported and Unregulated (IUU) fishing, and there is now an increased emphasis on the use of trade measures to prevent IUU-sourced fish and fish products from entering the international market. Initiatives encompass new legislation in the European Union requiring the inclusion of species names on catch labels throughout the distribution chain. Such certification measures do not, however, guarantee accuracy of species designation. Using two DNA-based methods to compare species descriptions with molecular ID, we examined 386 samples of white fish, or products labelled as primarily containing white fish, from major UK supermarket chains. Species specific real-time PCR probes were used for cod (Gadus morhua) and haddock (Melanogrammus aeglefinus) to provide a highly sensitive and species-specific test for the major species of white fish sold in the UK. Additionally, fish-specific primers were used to sequence the forensically validated barcoding gene, mitochondrial cytochrome oxidase I (COI). Overall levels of congruence between product label and genetic species identification were high, with 94.34% of samples correctly labelled, though a significant proportion in terms of potential volume, were mislabelled. Substitution was usually for a cheaper alternative and, in one case, extended to a tropical species. To our knowledge, this is the first published study encompassing a large-scale assessment of UK retailers, and if representative, indicates a potentially significant incidence of incorrect product designation.