• Tuberculosis and Respiratory Diseases
• /
• v.67 no.5
• /
• pp.409-412
• /
• 2009

Background: Several large outbreaks have demonstrated the threat of community-associated methicillin-resistant Staphylococcus aureus (CA-MRSA) in close-contact environments, such as occurs during training and quartering of military recruits training. In South Korea, which is a hospital or healthcare-associated MRSA prevalent area, military service is compulsory for all healthy young men. We surveyed and determined the extent of CA-MRSA colonization in the upper respiratory tracts of Korean military recruits. Methods: The Korean military recruits who were enrolled in a military training facility from November 2004 to March 2005 were eligible for this study. Sputum or nasopharyngeal swap was obtained from randomly selected subjects who displayed upper respiratory tract symptoms. Results: Of the 181 participants, 32 participants (17.7%) were colonized with S. aureus, and 12 participants (6.6%) were colonized with MRSA. Among the cases that were colonized with S. aureus, 37.5% (12/32) were colonized with MRSA. Antimicrobial susceptibility testing showed resistant patterns that were suggestive of the CA-MRSA strains for all of the MRSA isolates. Conclusion: This study of Korean military recruits found a great deal of showed MRSA colonization in them, and the antimicrobial resistant profile that was suggestive of a CA-MRSA strain. Further efforts to prevent the spread of MRSA infections and careful monitoring for CA-MRSA outbreaks are warranted, especially in a high risk group such as military recruits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.429-434
• /
• 2017

In a graph G=(V, E) with n vertices, there is an unique box which is finally laid on each vertex. Thus each vertex and box is both numbered from 1 to n and the box i should be laid on the vertex i. But, the box ${\pi}$(i) is initially located on the vertex i according to a permutation ${\pi}$. In each step, the robot can walk along an edge of G and can carry at most one box at a time. Also when arriving at a vertex, the robot can swap the box placed there with the box it is carrying. The problem is to minimize the total step so that every vertex has its own box, that is, the shuffled boxes are sorted. In this paper, we shall find an upper bound of the minimum number of steps and show that the movement of the robot is found in $O(n^2)$ time when G is a cycle.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.481-493
• /
• 2011

Multiple-input multiple-output (MIMO) technology provides high data rate and enhanced quality of service for wireless communications. Since the benefits from MIMO result in a heavy computational load in detectors, the design of low-complexity suboptimum receivers is currently an active area of research. Lattice-reduction-aided detection (LRAD) has been shown to be an effective low-complexity method with near-maximum-likelihood performance. In this paper, we advocate the use of systolic array architectures for MIMO receivers, and in particular we exhibit one of them based on LRAD. The "Lenstra-Lenstra-Lov$\acute{a}$sz (LLL) lattice reduction algorithm" and the ensuing linear detections or successive spatial-interference cancellations can be located in the same array, which is considerably hardware-efficient. Since the conventional form of the LLL algorithm is not immediately suitable for parallel processing, two modified LLL algorithms are considered here for the systolic array. LLL algorithm with full-size reduction-LLL is one of the versions more suitable for parallel processing. Another variant is the all-swap lattice-reduction (ASLR) algorithm for complex-valued lattices, which processes all lattice basis vectors simultaneously within one iteration. Our novel systolic array can operate both algorithms with different external logic controls. In order to simplify the systolic array design, we replace the Lov$\acute{a}$sz condition in the definition of LLL-reduced lattice with the looser Siegel condition. Simulation results show that for LR-aided linear detections, the bit-error-rate performance is still maintained with this relaxation. Comparisons between the two algorithms in terms of bit-error-rate performance, and average field-programmable gate array processing time in the systolic array are made, which shows that ASLR is a better choice for a systolic architecture, especially for systems with a large number of antennas.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.391-406
• /
• 2002

In order to realize a practical VOD system, it is necessary for a high-capacity and cost-effective hierarchical VOD server based on tertiary storages such as DVD jukebox. In such a system, it is possible to transfer multiple streams to users by alternatively swapping DVDs using the fixed number of drives. But it takes a long time for loading DVD to a drive. In this paper, we propose a primitive pipelined loading mechanism for hiding the loading time to swap DVDs in a hierarchical VOD server based on DVD jukebox. We also propose a enhanced pipelined loading mechanism for increasing the maximum admittable streams with the fixed number of drives. The enhanced mechanism caches the initial segment of each stream on a disk storage allowing faster data transfer. The performance analysis shows that the proposed mechanisms can admit the maximum allowed stream capacity under the fixed number of disk drives.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.71-76
• /
• 2021

Recently, as the size of IoT data grows, the memory power consumption of real-time systems increases rapidly. This is because real-time systems always place entire tasks in memory, which increases the demand of DRAM significantly. In this paper, we adopt emerging fast storage media and move a certain portion of real-time tasks from DRAM to storage. The part of tasks in storage are, then, loaded into memory when they are actually used. We incorporate our memory/storage power-saving into the dynamic voltage/frequency scaling of processors, thereby optimizing power consumptions in CPU and memory simultaneously. Specifically, the proposed technique aims at minimizing the CPU idle time and the DRAM memory size by determining appropriate voltage modes of CPU and the swap ratio of memory, without violating the deadlines of all tasks. Through simulation experiments, we show that the proposed technique significantly reduces the power consumption of real-time systems.

• Journal of Korea Multimedia Society
• /
• v.22 no.5
• /
• pp.535-546
• /
• 2019

Recently, there have been a lot of researches on the whole face replacement system, but it is not easy to obtain stable results due to various attitudes, angles and facial diversity. To produce a natural synthesis result when replacing the face shown in the video image, technologies such as face area detection, feature extraction, face alignment, face area segmentation, 3D attitude adjustment and facial transposition should all operate at a precise level. And each technology must be able to be interdependently combined. The results of our analysis show that the difficulty of implementing the technology and contribution to the system in facial replacement technology has increased in facial feature point extraction and facial alignment technology. On the other hand, the difficulty of the facial transposition technique and the three-dimensional posture adjustment technique were low, but showed the need for development. In this paper, we propose four facial replacement models such as 2-D Faceswap, OpenPose, Deekfake, and Cycle GAN, which are suitable for the Cox platform. These models have the following features; i.e. these models include a suitable model for front face pose image conversion, face pose image with active body movement, and face movement with right and left side by 15 degrees, Generative Adversarial Network.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.10
• /
• pp.419-426
• /
• 2022

In this paper, we propose a method to improve the accuracy of 3D human pose estimation model in various move motions. Existing human pose estimation models have some problems of jitter, inversion, swap, miss that cause miss coordinates when estimating human poses. These problems cause low accuracy of pose estimation models to detect exact coordinates of human poses. We propose a method that consists of detection and correction methods to handle with these problems. Deep learning-based outlier detection method detects outlier of human pose coordinates in move motion effectively and rule-based correction method corrects the outlier according to a simple rule. We have shown that the proposed method is effective in various motions with the experiments using 2D golf swing motion data and have shown the possibility of expansion from 2D to 3D coordinates.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Parasites, Hosts and Diseases
• /
• v.61 no.1
• /
• pp.84-88
• /
• 2023

This study aimed to evaluate the positive rates for Enterobius vermicularis eggs among preschool children in Yeosu-si, Jeollanam-do, the Republic of Korea (Korea) over a period of 5 years (2017-2021). Perianal swab samples, obtained using cellotape, from 10,392 preschool children in 26 districts were examined microscopically for E. vermicularis eggs. The test results were notified through the local health center, and the families of children who tested positive were advised to provide them anthelmintics treatment. The annual positive rates were 5.0%, 5.2%, 4.4%, 2.2%, and 1.0% in 2017, 2018, 2019, 2020, and 2021, respectively. The overall positive rate was higher in boys than in girls (P< 0.05), and children aged 5-7 years were at a higher risk of being infected than those aged 0-4 years (P< 0.05). Although the rates of infection by E. vermicularis in the survey area, Yeosu-si, were still in the 1% range , the results of this study suggest that they can be significantly reduced through continuous intervention centered around the test-treatment strategy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1611-1633
• /
• 2022

At EUROCRYPT 2019, a new block cipher algorithm called BISON was proposed by Canteaut et al. which uses a novel structure named as Whitened Swap-Or-Not (WSN). Unlike the traditional wide trail strategy, the differential and linear properties of this algorithm can be easily determined. However, the encryption speed of the BISON algorithm is quite low due to a large number of iterative rounds needed to ensure certain security margins. Commonly, denoting by n is the data block length, this design requires 3n encryption rounds. Moreover, the block size n of BISON is always odd, which is not convenient for operations performed on a byte level. In order to overcome these issues, we propose a new block cipher, named DBISON, which more efficiently employs the ideas of double layers typical to the BISON-like construction. More precisely, DBISON divides the input into two parts of size n/2 bits and performs the round computations in parallel, which leads to an increased encryption speed. In particular, the data block length n of DBISON can be even, which gives certain additional implementation benefits over BISON. Furthermore, the resistance of DBISON against differential and linear attacks is also investigated. It is shown the maximal differential probability (MDP) is 1/2^n-1 for n encryption rounds and that the maximal linear probability (MLP) is strictly less than 1/2^n-1 when (n/2+3) iterative encryption rounds are used. These estimates are very close to the ideal values when n is close to 256.