Evaluation of a digital textbook program in terms of implementation fidelity

Hyesook Kim,Anna Shin,Bokyung Kye 한국교육개발원 2018 KEDI Journal of Educational Policy Vol.15 No.1

The purpose of this study is to investigate the effect of a digital textbook program in terms of program implementation fidelity. The outcome variable of the program was defined as changes in pre- and post-scores of student competencies composed of self-directed learning (SDL) ability, creativity and innovative (CI) ability, and information literacy (IL) skill. The implementation fidelity of the digital textbook program was measured by three sub-factors: “dose,” “quality of delivery,” and “participant responsiveness”. For whole groups, changes in SDL ability and CI ability were not significant or were slightly decreased unexpectedly. Analysis of the groups by dividing them into upper and lower groups based on implementation fidelity showed that SDL and CI ability improved in the upper group at the level of implementation fidelity but were degraded in the lower group. The multi-level analysis showed that based on the total scores, SDL ability, CI ability, and IL skill all improved in classes with higher implementation fidelity. Among the sub-areas of implementation fidelity, a higher dose defined as the time and frequency of students’ use of digital textbooks induced a stronger effect compared with other sub-factors of implementation fidelity.

A Comparison of the Efficiency and Stability of Dialysis according to Hemodialysis Method: A Randomized Crossover Study

Hyesook Min,Sun Mi Cha 한국간호과학회 2023 한국간호과학회 학술대회 Vol.2023 No.11

A Quad-Trie Conditionally Merged with a Decision Tree for Packet Classification

Hyesook Lim,Youngju Choe,Miran Shim,Jungwon Lee IEEE 2014 IEEE communications letters Vol.18 No.4

<P>Trie-based algorithms and decision tree-based algorithms are well-known packet classification solutions which show trade-off between throughput performance and memory requirement. The trie-based algorithms require small memory since each rule is stored exactly once, but they do not provide high throughput because of rule comparison at every rule node. The decision tree-based algorithms provide high throughput since the number of rules compared with an input packet can be controlled as a limited number, but they require excessive amount of memory because of high degree of rule replication. This paper proposes to combine these two types of algorithms. The proposed algorithm primarily constructs a trie and then applies a decision tree for nodes having more rules than a threshold value. Simulation results show that the throughput performance is improved by up to 41 times compared with the trie, and the memory requirement is reduced by up to 38 times compared with the decision tree, so that the performance of both is within a tolerable range for practical implementation.</P>

Tuple Pruning Using Bloom Filters for Packet Classification

Hyesook Lim,So Yeon Kim IEEE 2010 IEEE micro Vol.30 No.3

<P>Tuple pruning for packet classification provides fast search and a low implementation complexity. The tuple pruning algorithm reduces the search space to a subset of tuples determined by individual field lookups that cause off-chip memory accesses. The authors propose a tuple-pruning algorithm that reduces the search space through Bloom filter queries, which do not require off-chip memory accesses.</P>

The Protective Effect of Cornus officinalis Fruit on the Cornea, Conjunctiva, Retina and Lacrimal Gland in Rats by Particulate Matter-Induced Ocular Dysfunctions

Hyesook Lee,Hyun Hwangbo,So Young Kim,Seon Yeong Ji,Min Yeong Kim,Da Hye Kim,Yung Hyun Choi 한국식품영양과학회 2021 한국식품영양과학회 학술대회발표집 Vol.2021 No.10

Cornus officinalis Sieb. et Zucc fruit (CF) has traditionally been used as therapeutic agents for tonifying the liver and kidney, immunoregulation, neuroprotection and cardiovascular protection. Particulate matter (PM) comprises a harmful toxic mixture, which on directly contact with the eye, caused the onset of dry eye disease (DED). In present study, we evaluate the effect of CF in DED rats which was induced by topically administered onto the both eyes with 5 mg/mL PM four times daily for 14 days. During the same period, 200 mg/kg of CF was orally administered once daily. Topical exposure of PM significantly reduced tear secretion and increased corneal fluorescein staining score, whereas this alteration was markedly reversed by CF administration. In addition, CF greatly improved he detachment of corneal epithelium, goblet cells loss of conjunctiva and inflammation of lacrimal gland followed by PM exposure. Furthermore, CF markedly increased the population of ganglion cells in the retina. These results are suggestive of the potential of CF as a therapeutic agent for threating PM-induced DED.

Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter

Hyesook Lim,Jungwon Lee,Changhoon Yim IEEE 2015 IEEE communications letters Vol.19 No.11

<P>The use of Bloom filters in network applications has increased rapidly. Since Bloom filters can produce false positives, the trueness of each positive needs to be identified by referring to an off-chip hash table. This letter proposes a new method for identifying the trueness of Bloom filter positives. We propose the use of an additional Bloom filter programmed for the complement set of the given set. In querying an input, if the complement Bloom filter produces a negative result, the input is a member of the given set since Bloom filters never produce a false negative. When both Bloom filters produce positives, a hash table needs to be referred to in our method. We provide a mathematical analysis, whereby the probability of referring to a hash table converges to the summation of the false positive probabilities of each Bloom filter. We provide the simulation result that the rate of referring to a hash table in our method is the order of 10<SUP>-5</SUP> for Bloom filter sizing factor 32.</P>

Priority Tries for IP Address Lookup

Hyesook Lim,Changhoon Yim,Swartzlander, Earl E IEEE 2010 IEEE Transactions on Computers Vol.59 No.6

<P>High-speed IP address lookup is essential to achieve wire speed packet forwarding in Internet routers. The longest prefix matching for IP address lookup is more complex than exact matching because it involves dual dimensions: length and value. This paper presents a new formulation for IP address lookup problem using range representation of prefixes and proposes an efficient binary trie structure named a priority trie. In this range representation, prefixes are represented as ranges on a number line between 0 and 1 without expanding to the maximum length. The best match to a given input address is the smallest range that includes the input. The priority trie is based on the trie structure, with empty internal nodes in the trie replaced by the priority prefix which is the longest among those in the subtrie rooted by the empty nodes. The search ends when an input matches a priority prefix, which significantly improves the search performance. Performance evaluation using real routing data shows that the proposed priority trie is very good in performance metrics such as lookup speed, memory size, update performance, and scalability.</P>

Dietary Reference Intakes for Koreans with special consideration to older adults

Hyesook Kim,Ji-Yun Hwang,Oran Kwon 한국영양학회 2022 Nutrition Research and Practice Vol.16 No.no.sup1

BACKGROUND/OBJECTIVES: The Dietary Reference Intakes for Koreans (KDRIs) were revised in 2020. Due to the rapidly aging Korean population, special consideration was given to reclassify the KDRI age group categories of older adults. This article examines the evidence for modifying the current KDRI age group ranges of older adults (65-74 and ≥ 75 yrs). SUBJECTS/METHODS: We first reviewed the domestic and international data on the elderly, following which we received expert opinions on age classification from the KDRI Advisory Committee. Finally, the 6th and 7th (2013-2017) Korea National Health and Nutrition Examination Survey (KNHANES) data were used to analyze the nutritional intake statuses by considering the age of older adults. RESULTS: According to the review results of domestic and international data and the inputs received from the expert advisory committee, the minimum age considered for the elderly was maintained at 65 yrs. However, the KNHANES data was analyzed to review whether there was a need to subdivide the later periods. Examining the differences in nutrient intakes by age group through the interaction effect term of the piecewise linear regression model revealed the interaction effect was maximum in the groups divided by 65 yrs (50-64 and 65-80), as compared to the groups divided by 70 yrs (50-69 and 70-80) and 75 yrs (50-74 and 75-80). The mean adequacy ratio was calculated per 1 yr of age, and a 3-yr (age) moving average analysis was performed to examine the change in the trends of overall nutrient intake. However, it was challenging to secure a scientific basis for subdivision into age groups in older adults from the results obtained. CONCLUSIONS: This study could not find any scientific evidence for modifying the KDRI age groups for older adults.

The Relationships of WTC and Motivation in Korean EFL Learners’ Oral Communicative Competence

( Hyesook Park ),( Ho Jung Lee ) 대한영어영문학회 2013 영어영문학연구 Vol.39 No.1

This study took an aim to explore the relationships among willingness to communicate (WTC), motivation and English oral communicative competence of Korean EFL learners. The participants were 65 Korean college students who took English speaking classes in 2012. Questionnaires related to WTC and motivation were given to the participants and their oral communicative competence was assessed by TOEIC speaking test. The results of analyses showed that WTC was most closely linked with Korean English learners’ oral communicative competence, and that WTC, and instrumentality were significantly positive predictors for Korean EFL learners’ oral communicative competence, while ought-to self was a negative predictor. The results of correlation showed that integrativeness and ideal self had more closely significant correlations with WTC than others. From these findings, suggestions for enhancing Korean EFL learners’ WTC and oral communicative competence were given. (Kunsan Nat’l University · Woosuk University)

On Adding Bloom Filters to Longest Prefix Matching Algorithms

Hyesook Lim,Kyuhee Lim,Nara Lee,Kyong-Hye Park IEEE 2014 IEEE Transactions on Computers Vol. No.

<P>High-speed IP address lookup is essential to achieve wire-speed packet forwarding in Internet routers. Ternary content addressable memory (TCAM) technology has been adopted to solve the IP address lookup problem because of its ability to perform fast parallel matching. However, the applicability of TCAMs presents difficulties due to cost and power dissipation issues. Various algorithms and hardware architectures have been proposed to perform the IP address lookup using ordinary memories such as SRAMs or DRAMs without using TCAMs. Among the algorithms, we focus on two efficient algorithms providing high-speed IP address lookup: parallel multiple-hashing (PMH) algorithm and binary search on level algorithm. This paper shows how effectively an on-chip Bloom filter can improve those algorithms. A performance evaluation using actual backbone routing data with 15,000-220,000 prefixes shows that by adding a Bloom filter, the complicated hardware for parallel access is removed without search performance penalty in parallel-multiple hashing algorithm. Search speed has been improved by 30-40 percent by adding a Bloom filter in binary search on level algorithm.</P>