• The Journal of Pediatrics of Korean Medicine
• /
• v.35 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.277-284
• /
• 2022

In this paper, we proposes a method of optimizing the processing order of skids to minimize the span time in a conveyor environment of the shipbuilding subassembly process. The subassembly process consists of a series of fixed tasks where the required work time is varied according to the skid type. The loading order of skids on a conveyor which determines the span time should be properly optimized and the problem size exponentially increases with the number of skids. In this regard, we propose a novel method called UniDev by defining a measure of the mean-absolute-deviation about the time difference among simultaneously processed tasks and iteratively improving it. Through simulations with various numbers of skids and processes, it was observed that our proposed method can efficiently reduce the overall work time compared with the multi-start and the 2-OPT methods.

• Architectural research
• /
• v.11 no.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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.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.

• Proceedings of the KSR Conference
• /
• 2011.05a
• /
• 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.

• Communications for Statistical Applications and Methods
• /
• v.7 no.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.

• Journal of Information Display
• /
• v.11 no.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.

• Journal of Information Processing Systems
• /
• v.13 no.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.

• Journal of IKEEE
• /
• v.18 no.3
• /
• pp.420-426
• /
• 2014

In this paper, we have implemented the low temperature fluidity test system with the composited fuel filter and heater, which has tested the low temperature fluidity of gasoline, an engine start time, the consumption of electricity and power to evaluate the system performance. The test condition have used the diesel fuel, the normal temperature, the diesel fuel supply pressure $3.4kgf/cm^2$ at $-20{\sim}-30^{\circ}C$, the fuel supply quantization 60 l/H, the setting current 30 A and the voltage $13V_{dc}$. In order to simulate the operation of diesel fuel filter, we will establish the composited fuel filter into test jig, and be filled with chamber tank and filter by a constant flow quantization and pressure. After these, it shall be cold for setting time. And then we have measured the consumption current and power of heater, an operating time and pressure of filter.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.5 no.4
• /
• pp.406-413
• /
• 1993

Among 2-dimensional coastal hydrodynamic finite element models time stepping ADCIRC and STEPM. and harmonic FUNDY and TEA models were compared in order to find out their characteristics and analyze ernr. General feasibility and capability of models were studied by comparing model results with an analytical solution on some reference points and L$_2$norm error in quarter annular domain where analytical solution can be obtained. According to these tests harmonic models FUNDY and TEA were nearly coinciding with analytical solutions and gave better results than time stepping models. STEPM was at least 5 times better than ADCIRC in L$_2$norm error test and it was 7 times worse than harmonic models. It was expected and concluded that these errors might come from phase lag due to cold start condition and nonlinear effect in basic equations of time stepping models.