• Title/Summary/Keyword: departure time

Search Result 304, Processing Time 0.025 seconds

Outcomes of Urgent Interhospital Transportation for Extracorporeal Membrane Oxygenation Patients

  • Jun Tae, Yang;Hyoung Soo, Kim;Kun Il, Kim;Ho Hyun, Ko;Jung Hyun, Lim;Hong Kyu, Lee;Yong Joon, Ra
    • Journal of Chest Surgery
    • /
    • v.55 no.6
    • /
    • pp.452-461
    • /
    • 2022
  • Background: Extracorporeal membrane oxygenation (ECMO) can be used in patients with refractory cardiogenic shock or respiratory failure. In South Korea, the need for transporting ECMO patients is increasing. Nonetheless, information on urgent transportation and its outcomes is scant. Methods: In this retrospective review of 5 years of experience in ECMO transportation at a single center, the clinical outcomes of transported patients were compared with those of in-hospital patients. The effects of transportation and the relationship between insertion-departure time and survival were also analyzed. Results: There were 323 cases of in-hospital ECMO (in-hospital group) and 29 cases transferred to Hallym University Sacred Heart Hospital without adverse events (mobile group). The median transportation time was 95 minutes (interquartile range [IQR], 36.5-119.5 minutes), whereas the median transportation distance was 115 km (IQR, 15-115 km). Transportation itself was not an independent risk factor for 28-day mortality (odds ratio [OR], 0.818; IQR, 0.381-1.755; p=0.605), long-term mortality (OR, 1.099; IQR, 0.680-1.777; p=0.700), and failure of ECMO weaning (OR, 1.003; IQR, 0.467-2.152; p=0.995) or survival to discharge (OR, 0.732; IQR, 0.337-1.586; p=0.429). After adjustment for covariates, no significant difference in the ECMO insertion-departure time was found between the survival and mortality groups (p=0.435). Conclusion: The outcomes of urgent transportation, with active involvement of the ECMO center before ECMO insertion and adherence to the transport protocol, were comparable to those of in-hospital ECMO patients.

A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo (최적 화물 선적을 위한 화주 에이전트 기반의 협상방법론)

  • Kim Hyun-Soo;Choi Hyung-Rim;Park Nam-Kyu;Cho Jae-Hyung
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.1
    • /
    • pp.75-93
    • /
    • 2006
  • The ship selection by consignors has two steps to carry their cargo. The first step is to select according to time schedule of ships and amount of cargo, and the second one is re-selection by concentrating different consignors' cargo into a unit that can be carried by single ship. Up to now, these steps are usually done by hands leading to inefficiency. The purpose of our paper is to form a logistics chain to minimize the overall sum of logistics cost by selecting ships for consignors' cargo using negotiation methodology between agents. Through concentration and distribution of cargo, maximization of global profit derived from searching optimal point in trade-off between inventory cost and freight rate cost. It is settled by the negotiation between consignors. In the experiments, two methods of the first-step of ship selection: EPDS(Earliest Possible Departure-Date Scheduling) and LPDS(Latest Possible Departure-Date Scheduling) coupled with the second-step ship concentration method using the negotiation were shown. From this, we deduced inventory cost, freight rates and logistics cost according SBF(Scheduling Bundle Factor) and analyzed the result. We found it will minimize the total logistics cost if we use negotiation method with EPDS.

  • PDF

A Study of Technician's Activity belonging to Gukjangdogam in Joseon (조선시대 국장도감 소속 공장의 활동 연구)

  • Park, Jong-min
    • Korean Journal of Heritage: History & Science
    • /
    • v.40
    • /
    • pp.325-355
    • /
    • 2007
  • A national funeral was a ceremony for king symbolizing a country in Joseon. The Gukjangdogam had three practical affairs: ibang and ibang, sambag. Each practial affairs was ready for various implement and finished a national funeral very well. So various important. The Daeyeo and the Gyeonyeo which carried directly the dead from a palace to a burial in the national funeral was a chief implements to handle with careful. All people had to carry heartily him as a Daehaewang which means a previous king. But three practical affairs belonging to the Gukjangdogam made various implements directly or indirectly related in a Daehaengwang and symbolized has authority. They were related in succeeding to the throne. The departure of a funeral in Joseon was a space and a time to appear his authority. The Gukjangdogam progressed it like going in and out the palace in the life. We knew it was ready for the departure of a funeral equalizing to the life and the death. The Gukjangdogam made the best of various implements using in going in and out the palace in the departure. We saw the Confucian view about living and dying through the implements used in the departure. The Gukjangdogam assembled many technicians around the country. They had to make various implements as high-level technicians at certain hour under the supervision of officials. The Gukjangdogam payed and compensated for their labors. There is an indissoluble connection between them. The technicians belonging to three practical affairs were ready for the implements for a national funeral: newly-made and repair, existed-implements use etc. So a national funeral can be called 'the feast of techniques' as well as complexity of techniques' in the Joseon.

Analysis of the M/Gb/1 Queue by the Arrival Time Approach (도착시점방법에 의한 M/Gb/1 대기행렬의 분석)

  • Chae, Kyung-Chul;Chang, Seok-Ho;Lee, Ho-Woo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.1
    • /
    • pp.36-43
    • /
    • 2002
  • We analyze bulk service $M/G^{b}/1$ queues using the arrival time approach of Chae et al. (2001). As a result, the decomposition property of the M/G/1 queue with generalized vacations is extended to the $M/G^{b}/1$ queue in which the batch size is exactly a constant b. We also demonstrate that the arrival time approach is useful for relating the time-average queue length PGF to that of the departure time, both for the $M/G^{b}/1$queue in which the batch size is as big as possible but up to the maximum of constant b. The case that the batch size is a random variable is also briefly mentioned.

Long-term Prediction of Bus Travel Time Using Bus Information System Data (BIS 자료를 이용한 중장기 버스 통행시간 예측)

  • LEE, Jooyoung;Gu, Eunmo;KIM, Hyungjoo;JANG, Kitae
    • Journal of Korean Society of Transportation
    • /
    • v.35 no.4
    • /
    • pp.348-359
    • /
    • 2017
  • Recently, various public transportation activation policies are being implemented in order to mitigate traffic congestion in metropolitan areas. Especially in the metropolitan area, the bus information system has been introduced to provide information on the current location of the bus and the estimated arrival time. However, it is difficult to predict the travel time due to repetitive traffic congestion in buses passing through complex urban areas due to repetitive traffic congestion and bus bunching. The previous bus travel time study has difficulties in providing information on route travel time of bus users and information on long-term travel time due to short-term travel time prediction based on the data-driven method. In this study, the path based long-term bus travel time prediction methodology is studied. For this purpose, the training data is composed of 2015 bus travel information and the 2016 data are composed of verification data. We analyze bus travel information and factors affecting bus travel time were classified into departure time, day of week, and weather factors. These factors were used into clusters with similar patterns using self organizing map. Based on the derived clusters, the reference table for bus travel time by day and departure time for sunny and rainy days were constructed. The accuracy of bus travel time derived from this study was verified using the verification data. It is expected that the prediction algorithm of this paper could overcome the limitation of the existing intuitive and empirical approach, and it is possible to improve bus user satisfaction and to establish flexible public transportation policy by improving prediction accuracy.

k-OUT-OF-n-SYSTEM WITH REPAIR : T-POLICY

  • Krishnamoorthy, A.;Rekha, A.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.199-212
    • /
    • 2001
  • We consider a k-out-of-n system with repair under T-policy. Life time of each component is exponentially distributed with parameter $\lambda$. Server is called to the system after the elapse of T time units since his departure after completion of repair of all failed units in the previous cycle or until accumulation of n-k failed units, whichever occurs first. Service time is assumed to be exponential with rate ${\mu}$. T is also exponentially distributed with parameter ${\alpha}$. System state probabilities in finite time and long run are derived for (i) cold (ii) warm (iii) hot systems. Several characteristics of these systems are obtained. A control problem is also investigated and numerical illustrations are provided. It is proved that the expected profit to the system is concave in ${\alpha}$ and hence global maximum exists.

Development and Performance Evaluation of a Car Assignment and Routing Algorithm for Reducing Transportation Cost in a Logistics System (물류시스템에서 운송비를 줄이기 위한 차량 할당 및 경로 설정 알고리즘 개발 및 성능평가)

  • 조병헌
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.3
    • /
    • pp.91-103
    • /
    • 1999
  • This paper proposes an algorithm which reduces transportation cost while goods are delivered in time in a logistics system. The logistics system assumed in this paper is the system in which multiple cars moves various goods from spatially distributed warehouses to stores. For reducing transportation cost, the car assignment algorithm which allocates goods to minimal cars employs the BF method; routing of each car is modelled as the TSP and is solved by using the genetic algorithm. For evaluating the proposed algorithm, the logistics system is modelled and simulated by using the DEVS formalism. The DEVS formalism specifies discrete event systems in a hierarchical, modular manner. During simulation, each car is modelled as a message and traverses warehouse and stores. When a car arrives at a warehouse or a store, predetermined amount of goods are loaded or unloaded. The arrival time and departure time of cars are analyzed and eventually whether goods are delivered in the desired time bound is verified.

  • PDF

Analyzing Passenger Arrival Behavior Based on the Spent Time for Airport Access (공항접근시간에 따른 여객의 공항도착 행태분석)

  • 오성열;김원규;박용화
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.4
    • /
    • pp.17-27
    • /
    • 2003
  • In general, an airport access system has influenced on airport terminal operation. The congestion and delay in service facilities at an airport are definitely depended on the patterns of passenger arrival behavior and time spent in a terminal. Therefore, it is necessary to analyze the passenger arrival behavior at an airport to improve the operations at passenger terminal. Passenger arrival patterns to an airport are mainly depended on factors such as the length of access time. reliability of access time. and provision of transport modes, etc. The focus of this paper is to estimate the relationship between the length of access time and passenger's total time spent to board aeroplane. For this, passenger surveys were conducted at the Gimpo International Airport for a large airport and Sacheon Airport for a small size airport. The mathematical relationship between arrival time at an airport prior to the scheduled time of departure(STD) and access time spent was then estimated. It is considered that the results of this study can be used to reduce congestion and delays, thereby to improve the efficiency of the passenger services at the airports.

LDWS Performance Study Based on the Vehicle Type (차량종류에 따른 LDWS 성능에 관한 연구)

  • Park, Hwan-Seo;Lee, Hong-Guk;Chang, Kyung-Jin;Yoo, Song-Min
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.20 no.6
    • /
    • pp.39-45
    • /
    • 2012
  • More than 80 percent of traffic accidents related with lane departure believed to be the result of crossing the lane due to either negligence or drowsiness of the driver. Lane-departure related accident in the highway usually involve high fatality. Even though LDWS is believed to prevent accident 25% and reduce fatalities by 15% respectively, its effectiveness in performance is yet to be confirmed in many aspects. In this study, the vehicle lateral locations relative to warning zone envelop (earliest and latest warning zone) defined in ISO standard, ECE and NHTSA regulations are compared with respect to various factors including delays, vehicle speed and vehicle heading angle with respect to the lane. Since LDWS is designed to be activated at the speed over 60 km/h, vehicle speed range for the study is set to be from 60 to 100 km/h. The vehicle heading angle (yaw angle) is set to be up to 5 degree away from the lane (abrupt lane change) considering standard for lane change test using double lane-change test specification. The TLC is calculated using factors like vehicle speed, yaw angle and reaction time. In addition, the effect of vehicle type has been considered to assess LDWS safety.

Study on the characteristics During Saturated Pool Nucleate Boiling of Refrigennt Binary Mixtures (냉매 이성분 혼합물의 포화 풀핵비등 특성에 관한 연구)

  • Kim Jeong Bae;Lee Han Choon;Kim Moo Hwan
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.29 no.5 s.236
    • /
    • pp.643-652
    • /
    • 2005
  • Saturated nucleate pool boiling experiments for binary mixtures, which are consisted of refrigerant R11 and R113, were performed with constant wall temperature condition. Results for binary mixtures were also compared with pure fluids. A microscale heater array and Wheatstone bridge circuits were used to maintain the constant temperature of the heating surface and to obtain heat flow rate measurements with high temporal and spatial resolutions. Bubble growth images were captured using a high speed CCD camera synchronized with the heat flow rate measurements. The departure time for binary mixtures was longer than that for pure fluids, and binary mixtures had a higher onset of nucleate boiling (ONB) temperature than pure fluids. In the asymptotic growth region, the bubble growth rate was proportional to a value between $t^{\frac{1}{6}}$ and $t^{\frac{1}{4}}$. The bubble growth behavior was analyzed to permit comparisons with binary mixtures and pure fluids at the same scale using dimensionless parameters. There was no discernable difference in the bubble growth behavior between binary mixtures and pure fluids for a given ONB temperature. And the departure radius and time were well predicted within a ${\pm}30{\%}$ error. The minimum heat transfer coefficient of binary mixtures occurred near the maximum ${\mid}y-x{\mid}$ value, and the average required heat flux during bubble growth did not depend on the mass fraction of R11 as more volatile component in binary mixtures. Finally, the results showed that for binary mixtures, a higher ONB temperature had the greatest effect on reducing the heat transfer coefficient.