• 제목/요약/키워드: start time

검색결과 1,584건 처리시간 0.03초

한약재 약욕요법이 소아 발열기간에 미치는 영향 : 체계적 문헌고찰 및 메타분석 (Effect of Herbal Bath for Duration of Pediatric Fever : a Systematic Review and Meta-analysis)

  • 김예지;박소현;서혜선;박슬기;이선행;이진용
    • 대한한방소아과학회지
    • /
    • 제35권3호
    • /
    • pp.53-66
    • /
    • 2021
  • Objective The purpose of this study is to evaluate whether herbal bath shortens the duration of pediatric fever. Methods Databases, such as Medline, EMBASE, Cochrane library, OASIS, KISS, KMBASE, CNKI, Wanfang Med Online were used to search randomized controlled trials. Those trials that included children younger than 18-year-old were evaluated for the clinical efficacy of herbal bath in fever by analyzing 'body temperature (BT) drop start time' and 'time to return to normal BT'. Results 12 studies or 1306 participants were analyzed in the study. When applying herbal bath in combination with the controlled treatment, 'BT drop start time' was decreased by 0.11 hours, and 'time to return to normal BT' was decreased by 10.94 hours compared to the controlled group. When comparing herbal bath with tepid bath, 'time to return to normal BT' was reduced by 8.19 hours in herbal bath group. In regards to safety, 3 studies out of 12 studies mentioned about its adverse events: 2 studies did not have any adverse events, and a minor needle-shaped bleeding had occurred in one of the studies. Conclusion Use of herbal bath as a treatment of fever in children was associated with shortened duration of fever. However, cautious interpretation is necessary due to its limited safety data.

A mean-absolute-deviation based method for optimizing skid sequence in shipyard subassembly

  • Lee, Kyung-Tae;Kwon, Yung-Keun
    • 한국컴퓨터정보학회논문지
    • /
    • 제27권12호
    • /
    • pp.277-284
    • /
    • 2022
  • 본 논문은 조선소 소조립 공정의 스키드 컨베이어 환경에서 전체 작업 시간을 최소화하기 위해 스키드 처리 순서를 최적화하는 방법을 제안한다. 소조립 공정은 일련의 정해진 작업들로 구성되며 스키드의 종류에 따라 요구되는 작업 시간이 다르다. 전체 작업 시간을 결정짓는 스키드의 컨베이어 투입 순서는 적절하게 최적화되어야 하며 문제 크기는 스키드 개수에 따라 지수적으로 증가한다. 이러한 점에서 UniDev라 불리우는 새로운 방법을 제안하는데 동시간에 진행되는 작업 소요 시간의 차이에 관한 평균절대편차를 정의하고 이를 점진적으로 개선한다. 다양한 스키드 개수와 공정의 개수에 대한 시뮬레이션 결과 제안된 방법이 Multi-Start 방법과 2-OPT 방법보다 전체 작업 소요 시간을 효과적으로 줄일 수 있음을 확인하였다.

Time-Cost Trade-Off by Lead-Time Adjustment in the PDM Network

  • Kim, Seon-Gyoo
    • Architectural research
    • /
    • 제11권2호
    • /
    • pp.43-49
    • /
    • 2009
  • Since the late 1980s, the schedule technique applied to the construction industry around the world has rapidly changed from the traditional ADM (Arrow Diagramming Method) to the PDM (Precedence Diagramming Method) technique. The main reason for this change is to overcome the limits and inconveniences of the traditional ADM technique. The time-cost trade-off is one of the core scheduling techniques to establish the best optimized combination plan in terms of a relationship between the cost and schedule. However, most of the schedule-related textbooks and research papers have discussed and proposed applications of a time-cost trade-off technique based only on the Finish to Start relationship. Therefore, there are almost no consideration and discussion of problems or restrictions that emerge when the time-cost trade-off technique is applied to the PDM network that has overlapping relationships. This paper proposes the lead-time adjustment method as a methodology for overcoming some restrictions that are encountered when the time-cost trade-off technique is applied to the overlapping relationships of the PDM network.

An Algorithm for the Traveling Salesperson Problem with Time Windows and Lateness Costs

  • Suh, Byung-Kyoo;Kim, Jong-Soo
    • 산업경영시스템학회지
    • /
    • 제22권53호
    • /
    • pp.13-22
    • /
    • 1999
  • This paper presents a model and dynamic programming based algorithm for the Traveling Salesperson Problem with Time Windows (TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are far more flexible and realistic. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at the node. But, in real business practices, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we propose a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. An algorithm introduced for the model is extensively tested to verify the accuracy and efficiency.

  • PDF

철송 크레인 일정계획문제에 관한 연구 (A Study on Rail Crane Scheduling Problem at Rail Terminal)

  • 김광태;김경민;김동희
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2011년도 춘계학술대회 논문집
    • /
    • pp.269-276
    • /
    • 2011
  • This paper considers the rail crane scheduling problem with minimizing the sum of the range of order completion time and make-span of rail crane simultaneously. The range of order completion time implies the difference between the maximum of completion time and minimum of start time. Make-span refers to the time when all the tasks are completed. At a rail terminal, logistics companies wish to concentrate on their task of loading and unloading container on/from rail freight train at a time in order to increase the efficiency of their equipment such as reach stacker. In other words, they want to reduce the range of their order completion time. As a part of efforts to meet the needs, the crane schedule is rearranged based on worker's experience. We formulate the problem as a mixed integer program. To validate the effectiveness of the model, computational experiments were conducted using a set of data randomly generated.

  • PDF

The Analysis of the M/M/1 Queue with Impatient Customers

  • Lee, EuiYong;Lim, Kyung Eun
    • Communications for Statistical Applications and Methods
    • /
    • 제7권2호
    • /
    • pp.489-497
    • /
    • 2000
  • The M/M/1 queue with impatient customers is studied. Impatient customers wait for service only for limited time K/0 and leave the system if their services do not start during that time. Notice that in the analysis of virtual waiting time, the impatient customer can be considered as the customer who enters the system only when his/her waiting time does not exceed K. In this paper, we apply martingale methods to the virtual waiting time and obtain the expected period from origin to the point where the virtual waiting time crosses over K or reaches 0, and the variance of this period. With this results, we obtain the expected busy period of the queue, the distribution, expectation and variance of the number of times the virtual waiting time exceeding level K during a busy period, and the probability of there being no impatient customers in a busy period.

  • PDF

Empirical Equations for the Analysis of the Time Dependence of the Luminance Properties of LCD Panels and Backlights for TV Applications

  • Ryu, Jin-Sun;Kim, Su-Jin;Park, Seung-Mi;Ko, Jea-Hyeon
    • Journal of Information Display
    • /
    • 제11권2호
    • /
    • pp.39-44
    • /
    • 2010
  • The time dependences of the luminance properties of 55-inch CCFL and LED backlights and 32-inch FFL backlights with LCD panels were investigated during the warm-up time from the cold start. The long-term luminance maintenance curve of a standard CCFL was examined in a time window up to 5000 hours. These two time dependences are important characteristics from the viewpoint of initial picture quality and lifetime reliability, respectively. Empirical equations were suggested for the analysis of the time dependence of these luminance data. These approaches are expected to be helpful in predicting the luminance properties of backlights based on the luminance data obtained in a limited time window.

Real-Time Motion Blur Using Triangular Motion Paths

  • Hong, MinhPhuoc;Oh, Kyoungsu
    • Journal of Information Processing Systems
    • /
    • 제13권4호
    • /
    • pp.818-833
    • /
    • 2017
  • This paper introduces a new algorithm that renders motion blur using triangular motion paths. A triangle occupies a set of pixels when moving from a position in the start of a frame to another position in the end of a frame. This is a motion path of a moving triangle. For a given pixel, we use a motion path of each moving triangle to find a range of time that this moving triangle is visible to the camera. Then, we sort visible time ranges in the depth-time dimensions and use bitwise operations to solve the occlusion problem. Thereafter, we compute an average color of each moving triangle based on its visible time range. Finally, we accumulate an average color of each moving triangle in the front-to-back order to produce the final pixel color. Thus, our algorithm performs shading after the visibility test and renders motion blur in real time.

통합연료필터의 저온유동성 시험장치 핵심기술개발 (Core Technology Development of Low Temperature Fluidity Test System with Composited Fuel Filter)

  • 윤석창;조상;윤달환
    • 전기전자학회논문지
    • /
    • 제18권3호
    • /
    • pp.420-426
    • /
    • 2014
  • 본 연구에서는 저온유동성 성능검사 시스템 구현을 통해 디젤 차량용 통합형 연료필터의 성능을 평가한다. 저온유동성시험 장치의 시험조건은 경유(또는 등유)를 사용하고, 상온, -20 및 $-30^{\circ}C$ 에서 경유공급압력 $3.4kgf/cm^2$, 연료공급량 60 l/H, 설정전류 30 A 및 전압은 $13V_{dc}$를 사용한다. 시료시험으로 통합필터를 지그에 장착하고, 경유(또는 등유)를 일정압력과 유량으로 설정하여 챔버 탱크와 필터에 채운 후, 설정시간 동안 설정온도로 냉각한 후, 필터 전후에 따라 유압과 시동시간, 히터의 소모전류 및 전력을 측정한다.

연안 수훈력학 모난를 위한 시간진행 및 조화 유한요소모형 특성 (Characteristics of Time Stepping and Harmonic Finite Element Models for Coastal Hydrodynamic Simulation)

  • 서승원
    • 한국해안해양공학회지
    • /
    • 제5권4호
    • /
    • pp.406-413
    • /
    • 1993
  • 수심적분의 2차원 연안수동역학 모형중 시간진행의 방법과 조화해석 방법에 의하여 전개한 유한요소모형을 비교검토하여 각 모형의 특성을 파악하고 오차를 해석하기 위하여 본 연구를 수행 하였는데 이에 이용된 모형은 ADCIRC, STEPM, FUNDY 그리고 TEA이다. 비교방법으로 해석적 해를 구할 수 있는 4분환원의 형상에서 영역내 특정점에 대한 수치해의 변화추이와 전영역에 관하여 해석해와의 정규오차의 비교를 통해 각 특성을 살펴보았다. 그 결과 전반적으로 조화모형이 시간진행모형에 비하여 매우 우수하고 거의 해석적 해와 일치되는 결과를 보이는 반면, 시간진행모형인 STEPM은 조화모형에 비하여 약 7배, ADCIRC는 STEPM에 비하여 5배 가량 정도가 떨어지는 것으로 나타났다. 이렇게 오차에 지대한 영향을 미치는 것은 초기조건으로 설정한 cold start의 영향 때문에 발생되는 phase lag와 비선형항의 영향인 것으로 추론되었다.

  • PDF