• Journal of the Ergonomics Society of Korea
• /
• v.24 no.3
• /
• pp.35-41
• /
• 2005

The KOSHA codes H-31 and H-30 provide general guidelines to establish a prevention program for work-related musculoskeletal disorders(WMSD). Understanding of the components and practitioner needs for a WMSD prevention program is necessary for effective revision and implementation of the KOSHA codes. The present study established a comprehensive structure for a WMSD prevention program and surveyed practitioner needs for the KOSHA codes. The comprehensive prevention program structure, consisting of 7 parts(organization, education, risk management, medical management, program evaluation, and record keeping) and 90 items, was constructed by analyzing WMSD prevention guidelines published by various government agencies such as KOSHA, OSHA and NIOSH. Next, 20 practitioners, from four industry sectors(auto manufacturing, auto part manufacturing, shipbuilding, and machinery), working in a safety and health department or labor union, were interviewed to collect opinions for the KOSHA codes in terms of relevance, government support, and additional information needed. Guidelines of the KOSHA codes requiring modifications and government supports were identified, which can be used to revise the KOSHA codes and to establish a government policy to promote the implementation of the KOSHA codes. Lastly, the survey revealed that integrated, customized, quantitative, and case information for WMSD prevention is additionally needed, which can be used as design guidelines for a WMSD prevention program manual for practitioners.

• Journal of Preventive Medicine and Public Health
• /
• v.33 no.4
• /
• pp.393-401
• /
• 2000

Objectives : To evaluate the impacts of the DRG payment system on the behavior of medical insurance claimants. Specifically, we evaluated the case-mix index, the numbers of diagnosis and procedure codes utilized, and the corresponding rate of diagnosis codes before, during and after implementation of the DRG payment system. Methods : In order to evaluate the case-mix index, the number of diagnosis and procedure codes utilized, we used medical insurance claim data from all medical facilities that participated in the DRG-based Prospective Payment Demonstration Program. This medical insurance claim data consisted of both pre-demonstration program data (fee-for-service, from November, 1998 to January, 1999) and post-demonstration program data (DRG-based Prospective Payment, from February, 1999 to April, 1999). And in order to evaluate the corresponding rate of diagnosis codes utilized, we reviewed 820 medical records from 20 medical institutes that were selected by random sampling methods. Results : The case-mix index rate decreased after the DRG-based Prospective Payment Demonstration Program was introduced. The average numbers of different claim diagnosis codes used decreased (new DRGs from 2.22 to 1.24, and previous DRGs from 1.69 to 1.21), as did the average number of claim procedure codes used (new DRGs from 3.02 to 2.16, and previous DRGs from 2.97 to 2.43). With respect to the time of participation in the program, the change in number of claim procedure codes was significant, but the change in number of claim diagnosis codes was not. The corresponding rate of claim diagnosis codes increased (from 57.5% to 82.6%), as did the exclusion rate of claim diagnosis codes (from 16.5% to 25.1%). Conclusions : After the implementation of the DRG payment system, the corresponding rate of insurance claim codes and the corresponding exclusion rate of claim diagnosis codes both increased, because the inducement system for entering the codes for claim review was changed.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.4
• /
• pp.148-155
• /
• 1996

A loop structure optimization algorithm is proposed for generting a set of efficient codes for loop structure in order to optimize RISC compiler codes. Since there are so many loop structure in the program, most of the execution time is used to process looping codes. Thus, reduction of loop instructions is more effective than optimizing codes outside the loop. The proposed algorithm presents a method to combine several different loops into a simple loop. Therefore, rather than executing each loop independently, loops in the program are serached, analyzed, and finally created some relative informtion such as dependency and range. In doing so, the loops in the program can efficiently be recombined and restructured. As a result, the overall execution time for the program of the sequential programming language is reduced.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1128-1136
• /
• 1989

The power spectral densities of run-length-limited(RLL) minimum-bandwidth(MB) line codes are obtained for some values of the zero probability of input data. They can be obtianed by implementing a computer program for the G.L. Cariolaro's algorithm. Using the program we calculate the power spectra of the known RLL MB line codes, such as VDB5, TIB5, VMDB5, RMD35, DRMD35, RMD45, and RMD33, and compare the characteristics of them. Specially, the relationship between eye widths and power spectra is analyzed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.119-119
• /
• 2000

In this research an induction motor vector control system was developed using Simulink and RTW(Real Time Workshop). On the Simulink window, control system is designed in the form of block diagrams, program codes are produced automatically with the RTW, then c compiler compiles the program codes. With this automatic real time program producing mechanism rapid prototyping is realized without the time-consuming manual program coding procedures. To show effectiveness of the proposed designing scheme a DSP-based induction motor vector control system was constructed and implemented

• Journal of Korean Biological Nursing Science
• /
• v.26 no.1
• /
• pp.16-25
• /
• 2024

Purpose: This study aimed to investigate the effect of a video-based enteral nutrition education program using QR codes on the perception, knowledge, and performance of enteral nutrition for intensive care unit (ICU) nurses. Methods: This was a quasi-experimental study with a nonequivalent control group pre- and post-test design. The participants were nurses working at six ICUs within a single university hospital, with 55 nurses in the experimental group and 55 nurses in the control group. The video-based enteral nutrition education program using QR codes was repeated three times to the experimental group. Results: There was a statistically significant pre-post difference in perceptions between the two groups (Z = -4.04, p < .001) with 2.00 points (± 5.57) for the control group and 7.89 points (± 7.95) for the experimental group, in knowledge (Z = -7.48, p < .001) with 0.02 points (± 1.91) for the control and 4.18 points (± 2.33) for the experimental, and in performance (Z = -2.20, p = .028) with 0.06 points (± 3.96) for the control and 2.00 points (± 5.14) for the experimental. Conclusion: The video-based enteral nutrition education program using QR codes was effective in improving the perceptions, knowledge, and performance of enteral nutrition among ICU nurses. This enteral nutrition education program using QR codes in clinical education can contribute to evidence-based nursing practice by improving perceptions and knowledge of enteral nutrition.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.373-380
• /
• 2014

Malicious codes uses generic unpacking technique to make it hard for analyzers to detect their programs. Recently their has been several researches about generic packet to prevent or detect these techniques. And they try to focus on the codes that repeats while generic packing is doing compression because generic packing technique executes after it is decompressed. And they try to focus on the codes that repeats while generic packing is doing compression because generic packing technique executes after it is decompressed. Therefore, this makes a interesting performance which shows a similar address value from the codes which are repeated several times what is different from the normal program codes. By dividing these codes into regularly separated areas we can find that the generic unpacking codes have a small entropy value compared to normal codes. Using this method, it is possible to identify any program if it is a generic unpacking code or not even though we do not know what kind of algorithm it uses. This paper suggests a way of disarming the generic codes by using the low value entropy value which comes out from the Opcode addresses when generic unpacking codes try to decompress.

• Journal of KIISE:Software and Applications
• /
• v.35 no.7
• /
• pp.442-451
• /
• 2008

Most plagiarism detection systems evaluate the similarity of source codes and detect plagiarized program pairs. If we use the source codes in plagiarism detection, the source code security can be a significant problem. Plagiarism detection based on target code can be used for protecting the security of source codes. In this paper, we propose a new plagiarism detection technique for Java programs using bytecodes without referring their source codes. The plagiarism detection procedure using bytecode consists of two major steps. First, we generate the token sequences from the Java class file by analyzing the code area of methods. Then, we evaluate the similarity between token sequences using the adaptive local alignment. According to the experimental results, we can find the distributions of similarities of the source codes and that of bytecodes are very similar. Also, the correlation between the similarities of source code pairs and those of bytecode pairs is high enough for typical test data. The plagiarism detection system using bytecode can be used as a preliminary verifying tool before detecting the plagiarism by source code comparison.

• Journal of the Korean Institute of Oriental Medical Informatics
• /
• v.11 no.2
• /
• pp.65-82
• /
• 2005

The findings from this study are summarized as follows: 1. Hangul 2004 has 16,023 Chinese Character codes. Among them, 15,231 Chinese Character codes are searched by DB, the others are unsearchable codes. 2. Among 15,231 Chinese Character codes of Hangul 2004, 2,471 Chinese Character codes are converted into 2,232 Simplified Chinese Character codes by Traditional and Simplified Chinese Character Converting program in Hangul 2004. 3. The 5th edition TCM-MeSH has 6,385 thesauruses and 2,142 kinds of Chinese Characters. 4. If we use Simplified Chinese Character of Hangul 2004 to search for TCM-MeSH, we will find 94.3% of TCM-MeSH. But If we use Traditional Chinese Character of Hangul 2004 to search for TCM-MeSH, we will find only 34.2% of TCM-MeSH.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.809-817
• /
• 2008

Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.