Lignin biomarkers as tracers of mercury sources in lakes water column

This study presents the role of specific terrigenous organic compounds as important vectors of mercury (Hg) transported from watersheds to lakes of the Canadian boreal forest. In order to differentiate the autochthonous from the allochthonous organic matter (OM), lignin derived biomarker signatures [Lambda, S/V, C/V, P/(V ? S), 3,5-Bd/V and (Ad/Al)v] were used. Since lignin is exclusively produced by terrigenous plants, this approach can give a non equivocal picture of the watershed inputs to the lakes. Moreover, it allows a characterization of the source of OM and its state of degradation. The water column of six lakes from the Canadian Shield was sampled monthly between June and September 2005. Lake total dissolved Hg concentrations and Lambda were positively correlated, meaning that Hg and ligneous inputs are linked (dissolved OM r2 = 0.62, p\0.0001; particulate OM r2 = 0.76, p\0.0001). Ratios of P/(V ? S) and 3,5-Bd/V from both dissolved OM and particulate OM of the water column suggest an inverse relationship between the progressive state of pedogenesis and maturation of the OM in soil before entering the lake, and the Hg concentrations in the water column. No relation was found between Hg levels in the lakes and the watershed flora composition—angiosperm versus gymnosperm or woody versus non-woody compounds. This study has significant implications for watershed management of ecosystems since limiting fresh terrestrial OM inputs should reduce Hg inputs to the aquatic systems. This is particularly the case for largescale land-use impacts, such as deforestation, agriculture and urbanization, associated to large quantities of soil OM being transferred to aquatic systems

Computational classifiers for predicting the short-term course of Multiple sclerosis

The aim of this study was to assess the diagnostic accuracy (sensitivity and specificity) of clinical, imaging and motor evoked potentials (MEP) for predicting the short-term prognosis of multiple sclerosis (MS). METHODS: We obtained clinical data, MRI and MEP from a prospective cohort of 51 patients and 20 matched controls followed for two years. Clinical end-points recorded were: 1) expanded disability status scale (EDSS), 2) disability progression, and 3) new relapses. We constructed computational classifiers (Bayesian, random decision-trees, simple logistic-linear regression-and neural networks) and calculated their accuracy by means of a 10-fold cross-validation method. We also validated our findings with a second cohort of 96 MS patients from a second center. RESULTS: We found that disability at baseline, grey matter volume and MEP were the variables that better correlated with clinical end-points, although their diagnostic accuracy was low. However, classifiers combining the most informative variables, namely baseline disability (EDSS), MRI lesion load and central motor conduction time (CMCT), were much more accurate in predicting future disability. Using the most informative variables (especially EDSS and CMCT) we developed a neural network (NNet) that attained a good performance for predicting the EDSS change. The predictive ability of the neural network was validated in an independent cohort obtaining similar accuracy (80%) for predicting the change in the EDSS two years later. CONCLUSIONS: The usefulness of clinical variables for predicting the course of MS on an individual basis is limited, despite being associated with the disease course. By training a NNet with the most informative variables we achieved a good accuracy for predicting short-term disability

Navigable networks as Nash equilibria of navigation games

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network