Therapeutic hypothermia in acute ischemic stroke

2011 ◽  
Vol 30 (6) ◽  
pp. E17 ◽  
Author(s):  
Leonid I. Groysman ◽  
Benjamin A. Emanuel ◽  
May A. Kim-Tenser ◽  
Gene Y. Sung ◽  
William J. Mack
Keyword(s):  
Acute Stroke ◽  
Therapeutic Hypothermia ◽  
Time Window ◽  
Time Windows ◽  
Optimal Time ◽  
Ischemic Cerebrovascular Disease ◽  
The Past ◽  
Clinical Indications ◽  
Temperature Regimen ◽  
Translational Studies

Induced hypothermia has been used for neuroprotection in cardiac and neurovascular procedures. Experimental and translational studies provide evidence for its utility in the treatment of ischemic cerebrovascular disease. Over the past decade, these principles have been applied to the clinical management of acute stroke. Varying induction methods, time windows, clinical indications, and adjuvant therapies have been studied. In this article the authors review the mechanisms and techniques for achieving therapeutic hypothermia in the setting of acute stroke, and they outline pertinent side effects and complications. The manuscript summarizes and examines the relevant clinical trials to date. Despite a reasonable amount of existing data, this review suggests that additional trials are warranted to define the optimal time window, temperature regimen, and precise clinical indications for induction of therapeutic hypothermia in the setting of acute stroke.

The Robust Vehicle Routing Problem with Time Window Assignments

2021 ◽  
Vol 55 (2) ◽  
pp. 395-413
Author(s):  
Maaike Hoogeboom ◽  
Yossiri Adulyasak ◽  
Wout Dullaert ◽  
Patrick Jaillet
Keyword(s):  
Travel Time ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Service Providers ◽  
Time Window ◽  
Time Windows ◽  
Branch And Cut ◽  
Optimal Time ◽  
Routing Problem ◽  
Solution Approach

In practice, there are several applications in which logistics service providers determine the service time windows at the customers, for example, in parcel delivery, retail, and repair services. These companies face uncertain travel times and service times that have to be taken into account when determining the time windows and routes prior to departure. The objective of the proposed robust vehicle routing problem with time window assignments (RVRP-TWA) is to simultaneously determine routes and time window assignments such that the expected travel time and the risk of violating the time windows are minimized. We assume that the travel time probability distributions are not completely known but that some statistics, such as the mean, minimum, and maximum, can be estimated. We extend the robust framework based on the requirements’ violation index, which was originally developed for the case where the specific requirements (time windows) are given as inputs, to the case where they are also part of the decisions. The subproblem of finding the optimal time window assignment for the customers in a given route is shown to be convex, and the subgradients can be derived. The RVRP-TWA is solved by iteratively generating subgradient cuts from the subproblem that are added in a branch-and-cut fashion. Experiments address the performance of the proposed solution approach and examine the trade-off between expected travel time and risk of violating the time windows.

scholarly journals An Optimization Method of Time Window Based on Travel Time and Reliability

2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Fengjie Fu ◽  
Dongfang Ma ◽  
Dianhai Wang ◽  
Wei Qian
Keyword(s):  
Travel Time ◽  
Real Time ◽  
Time Window ◽  
Time Windows ◽  
Time Estimation ◽  
Optimization Method ◽  
Time Change ◽  
Basic Unit ◽  
Optimal Time ◽  
Travel Time Estimation

The dynamic change of urban road travel time was analyzed using video image detector data, and it showed cyclic variation, so the signal cycle length at the upstream intersection was conducted as the basic unit of time window; there was some evidence of bimodality in the actual travel time distributions; therefore, the fitting parameters of the travel time bimodal distribution were estimated using the EM algorithm. Then the weighted average value of the two means was indicated as the travel time estimation value, and the Modified Buffer Time Index (MBIT) was expressed as travel time variability; based on the characteristics of travel time change and MBIT along with different time windows, the time window was optimized dynamically for minimum MBIT, requiring that the travel time change be lower than the threshold value and traffic incidents can be detected real time; finally, travel times on Shandong Road in Qingdao were estimated every 10 s, 120 s, optimal time windows, and 480 s and the comparisons demonstrated that travel time estimation in optimal time windows can exactly and steadily reflect the real-time traffic. It verifies the effectiveness of the optimization method.

scholarly journals Real-Time Driving Behavior Identification Based on Multi-Source Data Fusion

2021 ◽  
Vol 19 (1) ◽  
pp. 348
Author(s):  
Yongfeng Ma ◽  
Zhuopeng Xie ◽  
Shuyan Chen ◽  
Ying Wu ◽  
Fengxiang Qiao
Keyword(s):  
Real Time ◽  
Short Term Memory ◽  
Time Window ◽  
Time Windows ◽  
Driving Behavior ◽  
Optimal Time ◽  
Lane Changing ◽  
Kinematic Data ◽  
Wide Range ◽  
Driving Assistance

Real-time driving behavior identification has a wide range of applications in monitoring driver states and predicting driving risks. In contrast to the traditional approaches that were mostly based on a single data source with poor identification capabilities, this paper innovatively integrates driver expression into driving behavior identification. First, 12-day online car-hailing driving data were collected in a non-intrusive manner. Then, with vehicle kinematic data and driver expression data as inputs, a stacked Long Short-Term Memory (S-LSTM) network was constructed to identify five kinds of driving behaviors, namely, lane keeping, acceleration, deceleration, turning, and lane changing. The Artificial Neural Network (ANN) and XGBoost algorithms were also employed as a comparison. Additionally, ten sliding time windows of different lengths were introduced to generate driving behavior identification samples. The results show that, using all sources of data yields better results than using the kinematic data only, with the average F1 value improved by 0.041, while the S-LSTM algorithm is better than the ANN and XGBoost algorithms. Furthermore, the optimal time window length is 3.5 s, with an average F1 of 0.877. This study provides an effective method for real-time driving behavior identification, and thereby supports the driving pattern analysis and Advanced Driving Assistance System.

Increase associated risk of gynaecological cancer due to long-term exposure to high concentration of atmospheric SO2 industrial pollutant

2021 ◽  
pp. 1420326X2110036
Author(s):  
Qian Xu ◽  
Chan Lu ◽  
Rachael Gakii Murithi ◽  
Lanqin Cao
Keyword(s):  
Time Windows ◽  
Air Pollutant ◽  
Gynaecological Cancer ◽  
High Concentration ◽  
The Past ◽  
Short And Long Term ◽  
Using Data ◽  
Air Quality Monitoring Stations ◽  
Control Study

A cohort case–control study was conducted in XiangYa Hospital, Changsha, China, which involved 305 patients and 399 healthy women, from June 2010 to December 2018, to evaluate the association between Chinese women’s short- and long-term exposure to industrial air pollutant, SO2 and gynaecological cancer (GC). We obtained personal and family information from the XiangYa Hospital electronic computer medical records. Using data obtained from the air quality monitoring stations in Changsha, we estimated each woman’s exposure to the industrial air pollutant, sulphur dioxide (SO2), for different time windows, including the past 1, 5, 10 and 15 years before diagnosis of the disease. A multiple logistic regression model was used to assess the association between GC and SO2 exposure. GC was significantly associated with long-term SO2 exposure, with adjusted odds ratio (95% confidence interval) = 1.56 (1.10–2.21) and 1.81 (1.07–3.06) for a per interquartile range increase in the past 10 and 15 years, respectively. Sensitivity analysis showed that different groups reacted in different ways to long-term SO2 exposure. We concluded that long-term exposure to high concentration of industrial pollutant, SO2 is associated with the development of GC. This finding has implications for the prevention and reduction of GC.

scholarly journals A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

2021 ◽  
Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Ant Colony ◽  
Routing Problem ◽  
Multiple Strategies ◽  
Hard Time ◽  
Mutation Operation

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.

scholarly journals The last-mile vehicle routing problem with delivery options

OR Spectrum ◽  
2021 ◽  
Author(s):  
Christian Tilk ◽  
Katharina Olkis ◽  
Stefan Irnich
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Resource Constraints ◽  
Time Window ◽  
Time Windows ◽  
Service Level ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Common Location ◽  
Delivery Options

AbstractThe ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers’ overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17 new optimal solutions for the benchmark set for the VRP with roaming delivery locations.

scholarly journals Impact of COVID-19 pandemic on HIV viremia: a single-center cohort study in northern Italy

2021 ◽  
Vol 18 (1) ◽  
Author(s):  
Ilaria Izzo ◽  
Canio Carriero ◽  
Giulia Gardini ◽  
Benedetta Fumarola ◽  
Erika Chiari ◽  
...  
Keyword(s):  
Time Window ◽  
Time Windows ◽  
Continuum Of Care ◽  
Northern Italy ◽  
Hiv Diagnosis ◽  
Hiv Patients ◽  
Before And After ◽  
Missed Visits ◽  
Hiv Continuum Of Care ◽  
The Impact

Abstract Background Brescia Province, northern Italy, was one of the worst epicenters of the COVID-19 pandemic. The division of infectious diseases of ASST (Azienda Socio Sanitaria Territoriale) Spedali Civili Hospital of Brescia had to face a great number of inpatients with severe COVID-19 infection and to ensure the continuum of care for almost 4000 outpatients with HIV infection actively followed by us. In a recent manuscript we described the impact of the pandemic on continuum of care in our HIV cohort expressed as number of missed visits, number of new HIV diagnosis, drop in ART (antiretroviral therapy) dispensation and number of hospitalized HIV patients due to SARS-CoV-2 infection. In this short communication, we completed the previous article with data of HIV plasmatic viremia of the same cohort before and during pandemic. Methods We considered all HIV-patients in stable ART for at least 6 months and with at least 1 available HIV viremia in the time window March 01–November 30, 2019, and another group of HIV patients with the same two requisites but in different time windows of the COVID-19 period (March 01–May 31, 2020, and June 01–November 30, 2020). For patients with positive viremia (PV) during COVID-19 period, we reported also the values of viral load (VL) just before and after PV. Results: the percentage of patients with PV during COVID-19 period was lower than the previous year (2.8% vs 7%). Only 1% of our outpatients surely suffered from pandemic in term of loss of previous viral suppression. Conclusions Our efforts to limit the impact of pandemic on our HIV outpatients were effective to ensure HIV continuum of care.

Study on Vehicle Logistics Routing Path Problem with Time Windows Based on Particle Swarm Optimization

2014 ◽  
Vol 687-691 ◽  
pp. 5161-5164
Author(s):  
Lian Zhou Gao
Keyword(s):  
Particle Swarm Optimization ◽  
World Economy ◽  
Time Window ◽  
Time Windows ◽  
Particle Swarm ◽  
Modern Logistics ◽  
Swarm Optimization ◽  
Logistics Industry ◽  
Search Speed ◽  
Simulation Results

As the development of world economy, how to realize the reasonable vehicle logistics routing path problem with time window constrain is the key issue in promoting the prosperity and development of modern logistics industry. Through the research of vehicle logistics routing path 's demand, particle swarm optimization with a novel particle presentation is designed to solve the problem which is improved, effective and adept to the normal vehicle logistics routing. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability.

Procedural Complications During Early Versus Late Endovascular Treatment in Acute Stroke

Stroke ◽  
2021 ◽  
Author(s):  
Errikos Maslias ◽  
Stefania Nannoni ◽  
Federico Ricciardi ◽  
Bruno Bartolini ◽  
Davide Strambo ◽  
...  
Keyword(s):  
Endovascular Treatment ◽  
Acute Stroke ◽  
Time Window ◽  
National Institutes Of Health ◽  
Late Time ◽  
Short Term ◽  
Term Outcome ◽  
Stroke Registry ◽  
Short Term Outcome ◽  
Procedural Complications

Background and Purpose: Endovascular treatment (EVT) in acute ischemic stroke is effective in the late time window in selected patients. However, the frequency and clinical impact of procedural complications in the early versus late time window has received little attention. Methods: We retrospectively studied all acute ischemic strokes from 2015 to 2019 receiving EVT in the Acute Stroke Registry and Analysis of Lausanne. We compared the procedural EVT complications in the early (<6 hours) versus late (6–24 hours) window and correlated them with short-term clinical outcome. Results: Among 695 acute ischemic strokes receiving EVT (of which 202 were in the late window), 113 (16.3%) had at least one procedural complication. The frequency of each single, and for overall procedural complications was similar for early versus late EVT (16.2% versus 16.3%, P adj =0.90). Procedural complications lead to a significantly less favorable short-term outcome, reflected by the absence of National Institutes of Health Stroke Scale improvement in late EVT (delta-National Institutes of Health Stroke Scale-24 hours, −2.5 versus 2, P adj =0.01). Conclusions: In this retrospective analysis of consecutive EVT, the frequency of procedural complications was similar for early and late EVT patients but very short-term outcome seemed less favorable in late EVT patients with complications.

Sign in / Sign up

Export Citation Format

Share Document