Search

Objective: To establish an inventory of children’s, adolescents’, and their parents’ attitudes about Digital Health Interventions (DHI). Method: A scoping review following PRISMA’s recommendations was performed using the MEDLINE, EMBASE and PsycINFO databases. The research was conducted using three key concepts: “child and adolescent mental health service users”, “digital health interventions” and “attitudes”. Data extracted included the name of the publishing journal, the methodology used, the target population, the DHI studied, and the principal results.

International audience; Alcohol use disorders (AUD) is a major public health concern. General practitioners (GP) must play a key role in identifying this disorder and offering appropriate interventions. The authors conducted a survey among French GP in the Provence – Alpes – Côte-d’Azur (PACA) region to better understand their practices regarding AUD. Random sampling was used to enrol 101 GP in a 15-minute survey. A Computer-Assisted Telephone Interview exploring demographic and professional characteristics was conducted using a questionnaire. One third (31.7%) of the participants systematically addressed alcohol use with their patients whereas six (5.9%) never addressed it. Logistic regression analyses showed that after adjustment for the number of AUD patients followed up (odds ratio [OR] = 1.92; 95% confidence interval [CI] [1.19, 3.08]) and GP interest in addiction medicine (5.41 [2.17, 13.40]), GP who systematically screened patients for AUD were more likely to accept controlled drinking as a therapeutic goal (5.41 [2.17, 13.33]), and to perceive patient denial of AUD as a major barrier to care (1.39 [0.60, 3.22]). GP providing care for AUD were more likely to monitor tobacco cessation (9.08 [2.60, 31.64]) and to prescribe opioid maintenance treatment (7.35 [2.52, 21.41]). Alcohol screening is insufficient in general practice in France. Providing updated guidelines is essential to foster experience in this field among GP.

International audience; We consider an offshore wind farm defined by the location of the wind turbines and the amount of energy supplied per turbine, as well as the location of the central station responsible for redistributing the collected energy to users on the power grid. Knowing the power injected at each node, the capacities, susceptance and costs of the cables that can be used, the goal is to determine the least expensive cabling to route the energy supplied by the wind turbines to the central station. This cabling must respect the capacity constraints on the cables as well as the electrical constraints of Load Flow defined at each node of the network. In a second step, we look for a cabling that is also robust in case of failure of a cable, the notion of robustness being seen here as the protection again the worst case of failure. This work was carried out in collaboration with EDF Energies renouvelables. We give a mathematical model of the problem taking into account all the constraints of capacity, connectivity, load flow, cable types and incompatibility between edges, in the form of a mixed integer quadratic program that can be linearized and solved using a MIP solver. We then propose two mathematical models for the robust problem, formulation inspired by the previous one and a bi-level program where the second level is a max min program. Finally we present the results of our tests which provide solutions for real data up to about 50 nodes, before concluding.

International audience

Les réactions allergiques aux acariens domestiques prennent une part grandissante dans les maladies allergiques. Ce trouble du système immunitaire est responsable de rhinites et d'asthme allergique qui ont un impact important sur la qualité de vie des patients atteints. L'une des bases du traitement repose sur l'éviction des allergènes. Dans le cas où ces mesures d'éviction ne permettent pas un contrôle suffisant des symptômes, un traitement médicamenteux peut être mis en place. Le traitement symptomatique repose sur des antihistaminiques ainsi que sur des traitements antiasthmatiques. Le traitement curatif repose sur l'immunothérapie, il permet d'induire une tolérance spécifique au long cours. Plus récemment l'évolution de l'immunothérapie a conduit au développement de la première spécialité d'immunothérapie allergénique disponible en officine. Actuellement d'autres études sont en cours avec notamment le développement de vaccins contre cet allergène. Le pharmacien d'officine a donc une place prépondérante dans la prise en charge globale du patient allergique, en terme de conseil, d'écoute, d'encouragement et d'accompagnement.

International audience

International audience; Discrete tomography deals with the reconstruction of discrete homogenous objects from their projections. The reader is referred to the book of Hermann and Kuba [2] for an overview on discrete tomography. The image reconstruction problem is important since its solution is required for developing efficient procedures in image processing, data bases, crystallography, statistics, data compressing,... It can be formulated as follows: given a rectangular array where entries represent the pixels of a digitalized image coloured with k different colors, we consider the problem of reconstructing an image from the number of occurrences of each colour in every column and in every row. The problem is known to be polynomial for k=1, NP-complete for k=3 [1] and its complexity is still open for k=2. Here, we shall consider a graph colouring problem which generalizes both the well known basic graph colouring problem and the above image reconstruction problem. We are given a graph G=(V,E) and a collection P of p subsets Pi of vertices of G. We are also given a set of colours 1, 2, ..,k as well as a collection of p vectors h(Pi) of integers. The problem is to find a k-partition, i.e. a k-colouring, of V such that the number of vertices of Pi coloured with colour j is equal to the jth entry of the vector h(Pi), for all j=1,..,k and all i=1,..,p. The basic graph colouring problem deals with different colour assigned to adjacent vertices: we will call this a "proper" k-colouring otherwise we will call this simply a k-colouring. In this talk, we will consider colouring as well as proper colouring. Let us consider the special case where the graph G is a grid graph, the vertices, denoted by Xrs, are located on row r and column s, r=1,..,m and s=1,..,n, and P is the collection of the m+n chains corresponding to the rows and columns: the problem of finding a k-colouring of G corresponds exactly to the image reconstruction problem. In this talk we will consider some extensions by taking more general classes of graphs such as trees or bipartite graphs. We will restrict our attention to the case where each Pi is a chain in G. We call "cover index" of P, c(P), the maximum number of members of P which may cover a single element of V, i.e. which have a non empty intersection. We call "nested" a family P such that, for any pair of subsets, either one subset is included in the other or they are disjoint; then, the "nesticity" of P, nest(P), is the smallest number of nested families in a partition of P into nested families. First we will give several basic conditions for a solution to exist. Then, we will classify the problems according to the number of colours, the values of c(P) and nest(P), the class of the graph, the diameter of the graph, and so on. For each problem, either we will propose a polynomial time algorithm or we will give complexity results. For instance, we will prove that when G is a tree, the 2-colouring problem and the proper 3-colouring problems are NP-complete even if the maximum degree of G is bounded by 3; but we will propose a polynomial time algorithm solving the k-colouring problem when G is a tree and when any two Pi intersect in at most one vertex. All our results will be summarized in a table.

International audience