Placing regenerators in optical networks to satisfy multiple sets of requests.

The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there are no more than d hops without meeting a regenerator. While most of the research has focused on heuristics and simulations, the first theoretical study of the problem has been recently provided in [10], where the considered cost function is the number of locations in the network hosting regenerators. Nevertheless, in many situations a more accurate estimation of the real cost of the network is given by the total number of regenerators placed at the nodes, and this is the cost function we consider. Furthermore, in our model we assume that we are given a finite set of p possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when d = 1 or p = 1, we prove that for any fixed d,p ≥ 2 it does not admit a PTASUnknown control sequence '\textsc', even if G has maximum degree at most 3 and the lightpaths have length O(d)(d). We complement this hardness result with a constant-factor approximation algorithm with ratio ln (d ·p). We then study the case where G is a path, proving that the problem is NP-hard for any d,p ≥ 2, even if there are two edges of the path such that any lightpath uses at least one of them. Interestingly, we show that the problem is polynomial-time solvable in paths when all the lightpaths share the first edge of the path, as well as when the number of lightpaths sharing an edge is bounded. Finally, we generalize our model in two natural directions, which allows us to capture the model of [10] as a particular case, and we settle some questions that were left open in [10]

Comparison of Cardiac and Non-Cardiac Biomarkers for Risk Stratification in Elderly Patients with Non-Massive Pulmonary Embolism.

Biomarkers unrelated to myocardial necrosis, such as cystatin C, copeptin, and mid-regional pro-adrenomedullin (MR-proADM), showed promise for cardiovascular risk prediction. Knowing whether they are comparable to cardiac biomarkers such as high-sensitive cardiac-troponin T (hs-cTnT) or N-terminal pro-Brain natriuretic peptide (NT-proBNP) in elderly patients with acute non-massive pulmonary embolism (NMPE) remains elusive. This study aims at comparing the prognostic accuracy of cardiac and non-cardiac biomarkers in patients with NMPE aged ≥65 years over time. In the context of the SWITCO65+ cohort, we evaluated 227 elderly patients with an available blood sample taken within one day from diagnosis. The primary study endpoint was defined as PE-related mortality and the secondary endpoint as PE-related complications. The biomarkers' predictive ability at 1, 3, 12 and 24 months was determined using C-statistics and Cox regression. For both study endpoints, C-statistics (95% confidence interval) were stable over time for all biomarkers, with the highest value for hs-cTnT, ranging between 0.84 (0.68-1.00) and 0.80 (0.70-0.90) for the primary endpoint, and between 0.74 (0.63-0.86) and 0.65 (0.57-0.73) for the secondary endpoint. For both study endpoints, cardiac biomarkers were found to be independently associated with risk, NT-proBNP displaying a negative predictive value of 100%. Among non-cardiac biomarkers, only copeptin and MR-proADM were independent predictors of PE-related mortality but they were not independent predictors of PE-related complications, and displayed lower negative predictive values. In elderly NMPE patients, cardiac biomarkers appear to be valuable prognostic to identify very low-risk individuals. ClinicalTrials.gov NCT00973596

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph

Traffic grooming is a major issue in optical networks. It refers to grouping low rate signals into higher speed streams, in order to reduce the equipment cost. In SONET WDM networks, this cost is mostly given by the number of electronic terminations, namely ADMs. We consider the case when the topology is a unidirectional ring. In graph-theoretical terms, the traffic grooming problem in this case consists in partitioning the edges of a request graph into subgraphs with a maximum number of edges, while minimizing the total number of vertices of the decomposition. We consider the case when the request graph has bounded maximum degree $\Delta$, and our aim is to design a network being able to support any request graph satisfying the degree constraints. The existing theoretical models in the literature are much more rigid, and do not allow such adaptability. We formalize the problem, and solve the cases $\Delta=2$ (for all values of $C$) and $\Delta = 3$ (except the case C=4). We also provide lower and upper bounds for the general case

Ultra-high bandwidth quantum secured data transmission

Quantum key distribution (QKD) provides an attractive means for securing communications in optical fibre networks. However, deployment of the technology has been hampered by the frequent need for dedicated dark fibres to segregate the very weak quantum signals from conventional traffic. Up until now the coexistence of QKD with data has been limited to bandwidths that are orders of magnitude below those commonly employed in fibre optic communication networks. Using an optimised wavelength divisional multiplexing scheme, we transport QKD and the prevalent 100 Gb/s data format in the forward direction over the same fibre for the first time. We show a full quantum encryption system operating with a bandwidth of 200 Gb/s over a 100 km fibre. Exploring the ultimate limits of the technology by experimental measurements of the Raman noise, we demonstrate it is feasible to combine QKD with 10 Tb/s of data over a 50 km link. These results suggest it will be possible to integrate QKD and other quantum photonic technologies into high bandwidth data communication infrastructures, thereby allowing their widespread deployment

Bridging Alone: Religious Conservatism, Marital Homogamy, and Voluntary Association Membership

This study characterizes social insularity of religiously conservative American married couples by examining patterns of voluntary associationmembership. Constructing a dataset of 3938 marital dyads from the second wave of the National Survey of Families and Households, the author investigates whether conservative religious homogamy encourages membership in religious voluntary groups and discourages membership in secular voluntary groups. Results indicate that couples’ shared affiliation with conservative denominations, paired with beliefs in biblical authority and inerrancy, increases the likelihood of religious group membership for husbands and wives and reduces the likelihood of secular group membership for wives, but not for husbands. The social insularity of conservative religious groups appears to be reinforced by homogamy—particularly by wives who share faith with husbands

Observation of an Excited Bc+ State

Using pp collision data corresponding to an integrated luminosity of 8.5 fb-1 recorded by the LHCb experiment at center-of-mass energies of s=7, 8, and 13 TeV, the observation of an excited Bc+ state in the Bc+π+π- invariant-mass spectrum is reported. The observed peak has a mass of 6841.2±0.6(stat)±0.1(syst)±0.8(Bc+) MeV/c2, where the last uncertainty is due to the limited knowledge of the Bc+ mass. It is consistent with expectations of the Bc∗(2S31)+ state reconstructed without the low-energy photon from the Bc∗(1S31)+→Bc+γ decay following Bc∗(2S31)+→Bc∗(1S31)+π+π-. A second state is seen with a global (local) statistical significance of 2.2σ (3.2σ) and a mass of 6872.1±1.3(stat)±0.1(syst)±0.8(Bc+) MeV/c2, and is consistent with the Bc(2S10)+ state. These mass measurements are the most precise to date

When work keeps us apart: a thematic analysis of the experience of business travellers

Whilst business travel is deemed important for organizational success and economic outcomes, little is known about the actual process of business travelling from the perspective of individuals who undertake such travel on a regular basis. Thus the current qualitative study examined how business travellers (three women and eight men) attempt to find a balance between work and family, by focusing on how time together and time apart are experienced. The results can be interpreted and framed within work/family border theory in that business travellers’ borders are less defined and less permeable, thus requiring them to border-cross more frequently. This necessitates a process of negotiation with key border-keepers (their spouse/partner). Business travellers also undertake compensatory behaviours to make up for their time away from family. In order to find a work/family balance they go through a process of adapting, negotiating and tailoring their lives around their work commitments to alleviate work-life conflict