• The Korean Journal of Pain
• /
• v.37 no.1
• /
• pp.59-72
• /
• 2024

Background: This study assessed the postoperative analgesic efficacy and safety of the quadratus lumborum block (QLB) in pediatric patients. Methods: Electronic databases were searched for studies comparing the QLB to conventional analgesic techniques in pediatric patients. The primary outcome was the need for rescue analgesia 12 and 24 hours after surgery. Secondary outcomes covered the Face-Legs-Activity-Cry-Consolability Scale (FLACC) scores at various time points; parental satisfaction; time to the first rescue analgesia; hospitalization time; block execution time; block failure rates, and adverse events. Results: Sixteen randomized controlled trials were analyzed involving 1,061 patients. The QLB significantly reduced the need for rescue analgesia both at 12 and 24 hours after surgery (12 hours, relative risk [RR]: 0.45; 95% confidence interval [CI]: 0.01, 0.88; 24 hours, RR: 0.51; 95% CI: 0.31, 0.70). In case of 24 hours after surgery, type 1 QLB significantly reduced the need for rescue analgesia (RR: 0.56; 95% CI: 0.36, 0.76). The QLB also exhibited lower FLACC scores at 1 hour (standardized mean difference [SMD]: -0.87; 95% CI: -1.56, -0.18) and 6 hours (SMD: -1.27; 95% CI: -2.33, -0.21) following surgery when compared to non-QLB. Among QLBs, type 2 QLB significantly extended the time until the first rescue analgesia (SMD: 1.25; 95% CI: 0.84, 1.67). No significant differences were observed in terms of parental satisfaction, hospitalization time, block execution time, block failure, or adverse events between QLB and non-QLB groups. Conclusions: The QLB provides non-inferior analgesic efficacy and safety to conventional methods in pediatric patients.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.4
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

• Journal of Industrial Technology
• /
• v.18
• /
• pp.385-397
• /
• 1998

The firing system for the detonators called ordinary blasting caps have almost completely been substituted by safer and more trust worthy systems that can be classified in two groups ; Electric systems, and Non-electric systems. The characteristics of the different initiation devices for both group will be discussed, along with other useful elements for the correct execution of blastings. These detonators are commercialized in several countries under different names such as HiNEL, Nonel, Anodet, Detaline etc. A great advantage is that they do not initiate blasting agents such as slurries and ANFO, allowing bottom priming to be carried out.

• International Journal of Contents
• /
• v.5 no.3
• /
• pp.8-13
• /
• 2009

The recent Web service field emerges as the fastest growing IT paradigm as a result of the increasing interest in SOA (Services-Oriented Architecture) and the expansion of B2B market. With an increasing number of Web service that provide similar features, it becomes more important to provide the most appropriate service for the user's request. A service user in general requires the quality information of Web service when selecting a service among a number of similar Web services. Yet, finding a service through UDDI (Universal Description, Discovery and Integration) does not consider the non-functional aspects of users because it is only based on the functional aspects. That is, the quality, non-functional aspect will be an important factor for the mutual success of the user and provider. Using 3 factors in the Qos factors of the existing studies: the execution cost, reliability, and the quality level, the QoS of Web service is saved and the factors for the QoS are recorded in order to consider non-functional factors when selecting a Web service in this study. The Quality Broker determines the rank and shows the desired result of the service for users. The Quality Broker suggested in this thesis can be used to select a Web Service that considers the user-oriented and non-functional factors.

• The KIPS Transactions:PartA
• /
• v.17A no.1
• /
• pp.9-18
• /
• 2010

Races that occur in shared-memory parallel programs such as OpenMP programs must be detected for debugging because of causing unintended non-deterministic results. Previous works which verify the existence of these races on-the-fly are limited to the programs without internal non-determinism. But in the programs with internal non-determinism, such works need at least N! execution instances for each critical section to verify the existence of races, where N is the degree of maximum parallelism. This paper presents a preprocessor that statically analyzes the locations of non-deterministic accesses using program slicing and can detect apparent races as well as potential races through single execution using the analyzed information. The suggested tool can deterministically monitor non-deterministic accesses to occur in OpenMP programs so that this tool can verify the existence of races even if it is used any race detection protocol which can apply to programs with critical section. To prove empirically this tool, we have experimented using a set of benchmark programs such as synthetic programs that involve non-deterministic accesses, OpenMP Microbenchmark, NAS Parallel Benchmark, and OpenMP application programs.

• KIEAE Journal
• /
• v.14 no.4
• /
• pp.53-60
• /
• 2014

Current supervision systems have been changed by the demands of social, physical and institutional environment, and have a role of preventing safety accident and in improving the construct ability through the analysis of issues in quality, time, construction, safety, and environmental management. The public sector "Construction Technology Management Act", a general and private sector "Building Act" and "Certified Architects Act", the residential building "Housing Act" are dealt with supervision systems, respectively, but private small building construction is excluded from the discussion of the main targets because of their relatively small scale and the lack of social interests, Thus, this study focused on the small buildings for improving the non-resident supervision systems. Survey results revealed that the non-resident supervisor needs to be selected not by clients but by officers in order to obtain its publicity. Based on the proper selection and execution of the supervision system suggested in this study, the potential effects can be summarized as 1) recovering of publicity, 2) correcting abnormal practice, and 3) realizing design intention for increasing the public value of buildings. In addition, findings in this study will be effective to amend current non-resident supervision systems for improving the quality of buildings and communities as well as for adopting the environmental-friendly energy-efficient smart building technologies.

• Journal of Computing Science and Engineering
• /
• v.1 no.1
• /
• pp.56-73
• /
• 2007

Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.866-874
• /
• 2006

This paper proposes a new Dynamic Voltage Scaling(DVS) algorithm to achieve low-power scheduling of aperiodic hard real-time tasks. Aperiodic tasks schedulingcannot be applied to the conventional DVS algorithm and result in consuming energy more than periodic tasks because they have no period, non predictable worst case execution time, and release time. In this paper, we defined Virtual Periodic Task Set(VTS) which has constant period and worst case execution time, and released aperiodic tasks are assigned to this VTS. The period and worst case execution time of the virtual task can be obtained by calculating task utilization rate of both periodic and aperiodic tasks. The proposed DVS algorithm scales the frequency of both periodic and aperiodic tasks in VTS. Simulation results show that the energy consumption of the proposed algorithm is reduced by 11% over the conventional DVS algorithm for only periodic task.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.1
• /
• pp.93-103
• /
• 2005

Since the most program execution time is consumed in a loop structure, extracting parallelism from sequential loop programs is critical for the faster program execution. Conventional studies for extracting the parallelism are focused mostly on a uniform data dependence distance. In this paper, we proposed data dependency elimination method for a nested loop and extended data dependency elimination method to extract parallelism from the loop with procedure calls. The data dependency elimination method and the extended data dependency elimination method can be applied to uniform and non-uniform data dependency distance. We compared our method with conventional methods using CRAY-T3E for the performance evaluation. The results show that the proposed algorithms are very effective.