• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.847-854
• /
• 2005

Many of scheduling algorithms that provide a pre-defined bandwidth to a traffic flow fall into a category of Latency-rate (LR) server, the delay of whose network can be simply calculated by adding up individual 'latencies' of each LR servers. Deficit Round Robin (DRR) is one of such LR servers and the simplest one to implement, so that it is adopted in many real systems. In this research we suggest an improved version of DRR, the DRR with Instant Service (DRR-IS), and analyze it. We have proved that the DRR-IS is still an LR sewer and have obtained its latency. The DRR-IS, compared with DRR, turns out to have the same complexity while provide about $30\%$ better latency.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.5
• /
• pp.1-9
• /
• 2017

Recently, flash memory has been in a great demand from embedded system sectors for storage devices. However, program/erase (P/E) cycles per block are limited on flash memory. For the limited number of P/E cycles, many wear leveling techniques are studied. They prolonged the life time of flash memory using information tables. As one of the techniques, block erase table (BET) method using a bit array table was studied for embedded devices. However, it has a disadvantage in that performance of wear leveling is sharply low, when the consumption of memory is reduced. To solve this problem, we propose a novel wear leveling technique using Sampling-based Block Erase Table (SBET). SBET relates one bit of the bit array table to each block by using exclusive OR operation with round robin function. Accordingly, SBET enhances accuracy of cold block information and can prevent to decrease the performance of wear leveling. In our experiment, SBET prolongs life time of flash memory by up to 88%, compared with previous techniques which use a bit array table.

• Korean Journal of Human Ecology
• /
• v.10 no.1
• /
• pp.37-48
• /
• 2007

The purpose of this study was to investigate the proper combination of ensemble suit details for the body silhouette of elderly women. In this study, the principal component analysis was used to search for the proper combination of suit details for covering defects of body which has been changed unbalanced. The designs of evaluated suits were manipulated in 18 different kinds by the essential elements such as collars, neckline(round neckline, shirt collar, tailored collar), types of one-piece dress(pleats type, gather type, flare type), and opening(opened, closed). The data evaluated by a multiple ranking test was analyzed by mean, paired t-test, ANOVA and Duncan's multiple ranged test. The results were summarized as follows: In case of normal body type, it had complementary effects for upper body with closed round neckline jacket or shirt collar jacket, and for lower and the whole body with a combination of closed tailored collar jacket or shirt collar jacket with pleats or gored type one piece dress. The visual effect for elderly women's body shape was different in opened or closed jacket. And that enhanced by Jacket with collar.

• Journal of Veterinary Clinics
• /
• v.36 no.2
• /
• pp.129-131
• /
• 2019

A 15-year-old intact Yorkshire terrier was presented with anorexia, lethargy, and a pale mucous membrane. A physical examination one year ago revealed right testis mass and subcutaneous petechia. Blood work revealed severe thrombocytopenia and mild anemia, and no abnormalities were found in serum chemistry or ultrasonography. The preoperative serum estrogen concentration was moderately elevated. The enlarged testis was surgically removed. A well-encapsulated mass composed of polyhedral or round with abundant eosinophilic cytoplasm containing fine granular or vacuolation were found in a histological examination of the removed tissue. The nuclei of tumor cells were round, and mitotic figures were low but neoplastic cells showed a mild invasive tendency to adjacent tissues with contained neoplastic cell emboli in one lymphatic lumen. A diagnosis of a malignant Leydig cell tumor was made. The patient recovered from surgery uneventfully, but his condition worsened despite repeated transfusions and supportive therapy, and he was euthanized according to the owner's decision. Leydig cell tumor should be included in estrogen toxicity associated with testicular mass.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.165-168
• /
• 2000

A hardware architecture to implement the SEED block cipher algorithm into one chip is described. Each functional unit is designed with VHDL hardware description language and synthesis tools. The designed hardware receives a 128-bit block of plain text input and a 128-bit key, and generates a 128-bit cipher block after 16-round operations after 8 clocks. The encryption time is within 20 nsec.

• KOMUNHWA
• /
• no.69
• /
• pp.63-89
• /
• 2007

The Archaeological sites of so called Round Clay Rim Pottery (Jeomtodaetogi : 점토대토기) culture in Kangwon region have been rarely excavated in proper form. Since most cases belong to those of ground surface gatherings, it is difficult to certify the nature and the association with other artifacts. Therefore, researches on that culture have been limited to simply set the chronological order in the Bronze Age in realtion with the Plain Pottery culture. However, a comparative study trying to explain the Round Clay Rim Pottery culture in both Yeongseo(영서) and Yeongdong(영동) has become possible thanks to recent excavation results from the sites of Chilgeon-dong(칠전동) in Chunchon City(춘천시) and Songrim-ri(송림리) in Kangneung City(강릉시), for example. Certain difference can be observed in form and amount of artifacts in between Yeongseo and Yeongdong. Such difference can be seen as individual localization in different places diffused from a common source, rather than showing different stages of unilineal developmental process of one culture. The Round Clay Rim Pottery culture seems to have been coexisted with the Rim-Perforated Pottery(공렬토기) and Dolmen(지석묘) culture. According to the radiocarbondatings, the upper time limit of the Round Clay Rim Pottery culture goes back considerably beyond the alleged upper limit of either the late fourth century or the second century B.C.. However, both cultures absorbed into the Iron Culture during the same period.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1082-1092
• /
• 2008

In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.325-336
• /
• 2020

Nonlinear Invariant Attack is an attack that should be considered when constructing lightweight block ciphers with relatively simple key schedule. A shortcut to prove a block cipher's resistance against nonlinear invariant attack is checking the smallest dimension of linear layer-invariant linear subspace which contains all known differences between round keys is equal to the block size. In this paper, we presents the following results. We identify the structure and number of optimal bit-permutations which require only one known difference between round keys for a designer to show that the corresponding block cipher is resistant against nonlinear invariant attack. Moreover, we show that PRESENT-like block ciphers need at least two known differences between round keys by checking all PRESENT-like bit-permutations. Additionally, we verify that the variants of PRESENT-like bit-permutations requiring the only two known differences between round keys do not conflict with the resistance against differential attack by comparing the best differential trails. Finally, through the distribution of the invariant factors of all bit-permutations that maintain BOGI logic with GIFT S-box, GIFT-variant block ciphers require at least 8 known differences between round keys for the resistance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3663-3679
• /
• 2020

Scheduling plays a dynamic role in cloud computing in generating as well as in efficient distribution of the resources of each task. The principle goal of scheduling is to limit resource starvation and to guarantee fairness among the parties using the resources. The demand for resources fluctuates dynamically hence the prearranging of resources is a challenging task. Many task-scheduling approaches have been used in the cloud-computing environment. Security in cloud computing environment is one of the core issue in distributed computing. We have designed a deep learning-based security model for scheduling tasks in cloud computing and it has been implemented using CloudSim 3.0 simulator written in Java and verification of the results from different perspectives, such as response time with and without security factors, makespan, cost, CPU utilization, I/O utilization, Memory utilization, and execution time is compared with Round Robin (RR) and Waited Round Robin (WRR) algorithms.

• Communications for Statistical Applications and Methods
• /
• v.19 no.1
• /
• pp.117-128
• /
• 2012

In Baccarat, the gambler can bet on either the Player or Banker. The only gambler's strategy is to consider the previous winning history on the round. The winning probabilities of Player or Banker are calculated by simulation using R. Conditional winning probabilities given that Player or Banker has won i consecutive times are also calculated by simulation. Conditional winning probability implies that the sequence of Baccarat results is an almost independent sequence of events. It has been shown that the total amount of returns in each round of games is almost identical to a random walk. Thus, one possible strategy is to catch the trend(the Player or the Banker) of the random walk and to bet on that side of the trend.