• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2014.05a
• /
• pp.236-237
• /
• 2014

Recently, it changes to the frame construction in the wall type structure for the life span improvement of the apartment house of our country. The execution of the light panel increased while the execution of the frame construction increased. Therefore, the density and absorption ratio of the magnesium oxide matrix according to the wood flour amount of addition ratio property try to be analyze for the lightweight of the surface material of the light panel. The test result, the density has been declined as the addition ratio increase of the wood flour. In the case of the water absorption ratio, water absorption ratio has been increased as addition ratio increase of wood flour. However, wood flour addition ratio 15% determined the most appropriate when considering the density and water absorption ratio.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.1-7
• /
• 2019

Previously, parallel computing was mainly used in areas requiring high computing performance, but nowadays, multicore CPUs and GPUs have become widespread, and parallel programming advantages can be obtained even in a PC environment. Various parallel programming frameworks using multicore CPUs such as OpenMP and PPL have been announced. Nvidia and AMD have developed parallel programming platforms and APIs for program developers to take advantage of multicore GPUs on their graphics cards. In this paper, we develop digital image transformation programs that runs on each of the major parallel programming frameworks, and measure the execution time. We analyze the characteristics of each framework through the execution time comparison. Also a constant K indicating the ratio of program execution time between different parallel computing environments is presented. Using this, it is possible to predict rough execution time without implementing a parallel program.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.12-20
• /
• 2006

In scheduling of real-time tasks, the required hardware performance for a given set of tasks is determined based on the worst case execution time. For soft real-time tasks as multimedia applications, a lower performance hardware can service the tasks. Since the execution time of a task can vary in time, we can reclaim the slacks of early completed tasks for those of longer than average execution times. Then, the average ratio of deadline-miss can be lowered. This paper presents an algorithm, Aggressive Slack Reclamation (ASR), that tasks share slacks aggressively. A simulation result shows that ASR enhances the deadline-miss ratio and number of context switches than previous results.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2002.11a
• /
• pp.307-312
• /
• 2002

For accuracy of an experiment, measure changing of grounding resistance by short period after construction and investigated the efficiency of grounding's different methode of parallel connection. We could confirm on measurement's accuracy, error through comparing the theoretical value and measured value. Therefore, reduction ratio can be expected from execution measurement to receive a target resistance value. By the result, we could evaluate the method of rod grounding electrode's proper execution

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.224-240
• /
• 1996

It is common sense for at least one or more levels of cache memory to be used in these day's computer systems. In this paper, the impact of the internal cache memory organization on the performance of the computer is investigated by using a simulator program, which is wirtten by authors and run on SUN SPARC workstation, with several real execution, with several real execution trace files. 280 cache organizations have been simulated using n-way set associative mapping and LRU(Least Recently Used) replacement algorithm with write allocation policy. As a result, 16-way setassociative cache is the best configuration, and when we select 256KB cache memory and 64 byte line size, the bus traffic ratio was decreased compared to that of the noncache system so that a single bus could support almost 7 processors without any delay and degradationof high ratio(hit ratio was 99.21%). The smaller the line size we choose, the little lower hit ratio we can get, but the more processors can be supported by a single bus(maximum 18 processors). Therefore, using a proper cache memory organization can make a single bus structure be able to support multiple processors without any performance degradation.

• Journal of muscle and joint health
• /
• v.24 no.2
• /
• pp.101-109
• /
• 2017

Purpose: The purpose of this study was to identify factors influencing in intention and execution of blood donation among nursing college students. Methods: A total of 241 nursing students in D city participated in this cross-sectional study. Participants completed a questionnaire regarding intention, execution, knowledge, and motivation of and attitude toward blood donation. Data were analyzed with t-tests, $x^2$ test, Pearson correlation coefficients, and linear and logistic regression. Results: There were significant correlations among intention and motivation of blood donation attitudes toward donation, and altruism. The results of regression analyses, intention of blood donation ($R^2=.14$) was significantly associated with motivation. In addition, execution of blood donation was significantly associated with knowledge (Odds Ratio [OR]=2.24, 95% CI 1.13~4.44, p=.021), motivation (OR=2.25, 95% CI 1.03~4.88, p=.041), and intention (OR=2.41, 95% CI 1.20~4.84, p=.013) of blood donation. Conclusion: Therefore, the knowledge, motivation, and intention of blood donation should be considered to encourage blood donation programs for college students.

• Korean System Dynamics Review
• /
• v.13 no.1
• /
• pp.159-182
• /
• 2012

Strategic decision on the execution of national security improvement project is greatly important for the present and future national security. Though, the importance of strategic decision, decision making process has been executed under one-way thinking framework. This research provides a decision-making tool with make-or-buy approach for the national security improvement policy execution methods: foreign purchase and military R&D project, and, via simulation, confirms dynamic change of military capability index respect to change in ratio of foreign purchase and military R&D. A result shows that current ratio of foreign purchases and military R&D is insufficient for national security improvement policy goal. Applying the model from this research provides an appropriate ratio for short term and long term defense strategy and policy goal, and consequent result of increase in national security capability. Thus, this research model can be effectively utilized for national security improvement project.

• Korean Journal of Applied Biomechanics
• /
• v.13 no.3
• /
• pp.199-215
• /
• 2003

The purpose of this study was to attempt new starting motion and supply present starting motion in the 500M short track speed skating according to the center of gravity position. The center of gravity position ratio was divided starting motion into five(type A : front 80%-back 20%, type B front 70%-back 30%, type C : front 50%-back 50%, type D : front 30%-back 70%, type E : front 20%-back 80%). The three dimension motion analysis with DLT(direct linear transformation) method was executed using two video cameras. The following conclusion was that It was appear that reaction and execution time in starting motion was the most short in type B. It was characteristic that step of skaters was shorten and center of gravity position ratio was not effect to change of the step in each event. It was appear that the displacement of type D and type E were longer than that type A and type B during the starting motion. It was appear that skill types of center of gravity position ratio to the front were lower than that to the back and contract a posture. Observing the above, it was conclusion that skill type B of center of gravity position ratio to the tent was more effect than that to the back. But it is important that these skill type was most used to the competition and estimate the result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.586-599
• /
• 2012

This paper proposes a fast face detection and tracking method which uses depth images as well as RGB images. It consists of the face detection procedure and the face tracking procedure. The face detection method basically uses an existing method, Adaboost, but it reduces the size of the search area by using the depth image. The proposed face tracking method uses a template matching technique and incorporates an early-termination scheme to reduce the execution time further. The results from implementing and experimenting the proposed methods showed that the proposed face detection method takes only about 39% of the execution time of the existing method. The proposed tracking method takes only 2.48ms per frame with $640{\times}480$ resolution. For the exactness, the proposed detection method showed a little lower in detection ratio but in the error ratio, which is for the cases when a detected one as a face is not really a face, the proposed method showed only about 38% of that of the previous method. The proposed face tracking method turned out to have a trade-off relationship between the execution time and the exactness. In all the cases except a special one, the tracking error ratio is as low as about 1%. Therefore, we expect the proposed face detection and tracking methods can be used individually or in combined for many applications that need fast execution and exact detection or tracking.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2204-2218
• /
• 2000

This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.