• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.1
• /
• pp.1-22
• /
• 2022

A tandem queue that consists of nodes with buffers of finite capacity and general blocking scheme is considered. The service time distribution of each node is exponential whose rate depends on the state of the node. The blocking scheme at a node may be different from that of other nodes. An approximation method for the system based on decomposition method is presented. The effectiveness of the method is investigated numerically.

• Journal of Dental Anesthesia and Pain Medicine
• /
• v.20 no.3
• /
• pp.173-178
• /
• 2020

We experienced a case of induction of general anesthesia without using neuromuscular blocking agents (NMBAs) in a 40-year-old woman with a history of anaphylaxis immediately after the administration of anesthetics lidocaine, propofol, and rocuronium to perform endoscopic sinus surgery 2 years before. The skin test showed a positive reaction to rocuronium and cis-atracurium. We induced general anesthesia without using NMBAs after inducing airway anesthesia with lidocaine (transtracheal injection and superior laryngeal nerve block). Deep general anesthesia was maintained with end-tidal 4 vol% sevoflurane. Hypotension was treated with phenylephrine infusion. The operation condition was excellent, and patient recovered without complications after surgery. Airway anesthesia with local anesthetics may be helpful when we cannot use NMBAs for any reason, including hypersensitivity to NMBA and surgery that needs neuromuscular monitoring.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.125-132
• /
• 2001

IBM developed the MPI-IO, we call it MPI-2, on the General Parallel File System. We designed and implemented various Matrix Multiplication Benchmarks to evaluate its performances. The MPI-IO on the General Parallel File System shows four kinds of data access methods : the non-collective and blocking, the collective and blocking, the non-collective and non-blocking, and the split collective operation. In this paper, we propose benchmarks to measure the IO time and the computation time for the data access methods. We describe not only its implementation but also the performance evaluation results.

• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.119-129
• /
• 2019

Although line production systems with finite buffers have been studied over several decades, except for some special cases there are no explicit expressions for system performances such as waiting times(or response time) and blocking probability. Recently, a max-plus algebraic approach for buffer-sharing systems with constant processing times was introduced and it can lead to analytic expressions for (higher) moment and tail probability of stationary waiting. Theoretically this approach can be applied to general processing times, but it cannot give a proper way for computing performance measures. To this end, in this study we developed simulation models using @RISK software and the expressions derived from max-plus algebra, and computed and compared blocking probability, waiting time (or response time) with respect to two blocking policies: communication(BBS: Blocking Before Service) and production(BAS: Blocking After Service). Moreover, an optimization problem which determines the minimum shared-buffer capacity satisfying a predetermined QoS(quality of service) is also considered.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.609-616
• /
• 2014

Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2023.05a
• /
• pp.147-148
• /
• 2023

Steel doors, which are common in general buildings, do not seal the gap between the door and the floor, so drafts, noise, dust, and lights flow from the outside, and shielding devices are installed in various materials and methods, such as adding magnetic gate paper to the side of the door or installing a gasket under the door, but performance is limited. Accordingly, in order to fundamentally solve these problems, we researched and developed a double gap blocking device that can improve fire resistance and airtightness performance in steel doors. Unlike general products, the double gap blocking device has the advantage of maximizing airtight performance by forming an air layer in the center when the door is closed, as well as greatly improving the fire resistance performance, which is the basic performance of the fire door.

• Journal of Practical Agriculture & Fisheries Research
• /
• v.22 no.1
• /
• pp.55-63
• /
• 2020

This study aimed to investigate responses of plant growth and photosynthesis to different kinds of covering materials with selective light transmit for red leaf lettuce (Lactuca sativa L.). Experimental pot design was attached UV blocking filter, red filter, blue filter, and green filter. The kinds of covering materials showed significant results for plant growth especially control, UV blocking filter, and red filter. The photosynthetic rate and anthocyanin content of red leaf lettuce were higher in control and UV blocking filter than others. The quality of red leaf lettuce was low in red, green, and blue film treatments because of too low anthocyanin content.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.383-390
• /
• 2008

Block based transform coding is most popular approach for image and video compression. However it suffers from severe quality degradation especially from blocking artifacts. The subjective quality degradation caused by such blocking artifacts in general does not agree well with an objecive quality measurement such as PSNR. Hence new quality evaluation technique is necessary. We propose a new image quality assessment method by measuring blocking artifacts for block based transform coded images. In order to characterize blocking artifacts, proposed method utilizes the facts that, blocking artifacts, when occur, have different pixel values along the block boundaries and such differences usually continuously span along the whole boundaries. This method does not require the original uncompressed image. It operates on single block boundary and quantifies the amount of blocking artifacts on it. Experiments on various compressed images various bitrates show that proposed quantitative measure of blocking artifacts matches well with the subjective quality of them judged by human visual system.

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.65-74
• /
• 2019

For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1988.10a
• /
• pp.14-14
• /
• 1988