Given the ever-increasing prevalence of type 2 diabetes and obesity, the pressure on global healthcare is expected to be colossal, especially in terms of blindness. Electroretinogram (ERG) has long been perceived as a first-use technique for diagnosing eye diseases, and some studies suggested its use for preventable risk factors of type 2 diabetes and thereby diabetic retinopathy (DR). Here, we show that in a non-evoked mode, ERG signals contain spontaneous oscillations that predict disease cases in rodent models of obesity and in people with overweight, obesity, and metabolic syndrome but not yet diabetes, using one single random forest-based model. Classification performance was both internally and externally validated, and correlation analysis showed that the spontaneous oscillations of the non-evoked ERG are altered before oscillatory potentials, which are the current gold-standard for early DR. Principal component and discriminant analysis suggested that the slow frequency (0.4–0.7 Hz) components are the main discriminators for our predictive model. In addition, we established that the optimal conditions to record these informative signals, are 5-minute duration recordings under daylight conditions, using any ERG sensors, including ones working with portative, non-mydriatic devices. Our study provides an early warning system with promising applications for prevention, monitoring and even the development of new therapies against type 2 diabetes.

No abstract

Abstract. We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of a given node. By contrast, the logic introduced in the present work can concisely express numerical bounds on any region, descendants or ancestors for instance. We prove that the logic is decidable in single exponential time even if the numerical constraints are in binary form.We also illustrate the usage of the logic in the description of numerical constraints on multi-directional path queries on XML documents. Furthermore, numerical restrictions on regular languages (XML schemas) can also be concisely described by the logic. This implies a characterization of decidable counting extensions of XPath queries and XML schemas. Moreover, as the logic is closed under negation, it can thus be used as an optimal reasoning framework for testing emptiness, containment and equivalence.

No abstract

No abstract