Search results for "ALGORITHMS"
showing 10 items of 1716 documents
ALDEN, an Algorithm for Assessment of Drug Causality in Stevens–Johnson Syndrome and Toxic Epidermal Necrolysis: Comparison With Case–Control Analysis
2010
Epidermal necrolysis (EN)--either Stevens-Johnson syndrome (SJS) or toxic EN (TEN)--is a severe drug reaction. We constructed and evaluated a specific algorithm, algorithm of drug causality for EN (ALDEN), in order to improve the individual assessment of drug causality in EN. ALDEN causality scores were compared with those from the French pharmacovigilance method in 100 cases and the case-control results of the EuroSCAR study. Scores attributed by ALDEN segregated widely. ALDEN pointed to a "probable" or "very probable" causality in 69/100 cases as compared to 23/100 with the French method (P < 0.001). It scored "very unlikely" causality for 64% of medications vs. none with the French metho…
Assessing the risk to health care staff from long-term exposure to anticancer drugs--the case of monoclonal antibodies.
2010
Today the occupational health and safety risk involved when handling most anticancer drugs is well recognized and, as a result of regulatory requirements, safety measures have been established. There is little knowledge about the occupational hazard posed by handling monoclonal antibodies assigned to ATC Class L01XC. The aim of our study was to evaluate the occupational risk of monoclonal antibodies. Using the information obtained in a systematic review of the literature, the potentially dangerous properties of the active drug substances were assessed using a specially devised algorithm. As a result, all monoclonal antibodies in question were categorized as substances with developmental to…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
Inferring slowly-changing dynamic gene-regulatory networks
2015
Dynamic gene-regulatory networks are complex since the interaction patterns between their components mean that it is impossible to study parts of the network in separation. This holistic character of gene-regulatory networks poses a real challenge to any type of modelling. Graphical models are a class of models that connect the network with a conditional independence relationships between random variables. By interpreting these random variables as gene activities and the conditional independence relationships as functional non-relatedness, graphical models have been used to describe gene-regulatory networks. Whereas the literature has been focused on static networks, most time-course experi…
Hub-Centered Gene Network Reconstruction Using Automatic Relevance Determination
2012
Network inference deals with the reconstruction of biological networks from experimental data. A variety of different reverse engineering techniques are available; they differ in the underlying assumptions and mathematical models used. One common problem for all approaches stems from the complexity of the task, due to the combinatorial explosion of different network topologies for increasing network size. To handle this problem, constraints are frequently used, for example on the node degree, number of edges, or constraints on regulation functions between network components. We propose to exploit topological considerations in the inference of gene regulatory networks. Such systems are often…
On the Non-Intrusive Load Monitoring in dwellings: a feasibility perspective
2021
The oncoming modernization process of the power grids, driven above all by decarbonisation objectives and the continuous improvement of digital technologies, is encouraging active participation in the electricity market by consumers through the Demand-Response mechanism. From this perspective, the introduction of smart meters and energy consumption monitoring devices plays a fundamental role, being able to give benefits to consumers, suppliers and the electricity grid itself. This paper proposes a supervised method of non-intrusive load monitoring (NILM) based on the recognition of patterns in the time domain with the Dynamic Time Warping algorithm which is suitable for low-cost smart meter…
An Online Time Warping based Map Matching for Vulnerable Road Users’ Safety
2018
International audience; High penetration rate of Smartphones and their increased capabilities to sense, compute, store and communicate have made the devices vital components of intelligent transportation systems. However, their GPS positions accuracy remains insufficient for a lot of location-based applications especially traffic safety ones. In this paper, we developed a new algorithm which is able to improve smartphones GPS accuracy for vulnerable road users' traffic safety. It is a two-stage algorithm: in the first stage GPS readings obtained from smartphones are passed through Kalman filter to smooth deviated reading. Then an adaptive online time warping based map matching is applied to…
Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
2012
Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [1] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree di…
Feigenbaum graphs: a complex network perspective of chaos
2011
The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a natural graph-theoretical description of nonlinear systems with qualities in the spirit of symbolic dynamics. We support our claim via the case study of the period-doubling and band-splitting attractor cascades that characterize unimodal maps. We provide a universal analytical description of this classic scenario in terms of the horizontal visibility graphs associated with the dynamics within the attractors, that we call Feigenbaum graphs, independent of map…
An ethical algorithm for rationing life sustaining treatment during the COVID-19 pandemic
2020
The burning ethical question raised by the COVID-19 pandemic is how to deal fairly and ethically with a large number of patients simultaneously becoming critically unwell. Across the world, in both developed and developing countries, health systems are grappling with the possibility or the reality that the demand for intensive medical care will outstrip availability. There is a need for ethical guidelines on how to allocate treatment, but such guidelines are potentially highly controversial.1 In this commentary, we set out a simple algorithm (Figure 1), including what we take to be the essential ethical principles that ought to guide resource allocation in any country or setting as well as …