• Journal of Korean Home Economics Education Association
• /
• v.31 no.2
• /
• pp.67-77
• /
• 2019

The purpose of this study was to identify significant differences in dietary guidelines, emotional intelligence, resilience and violence according to the frequency of family meals for middle school students in Daegu. To achieve the purpose of this study, 241 data collected through self-administered questionnaires were analyzed. The collected data were analyzed using the SPSS (v25.0) program for frequency, percentage, standard deviation, reliability, one-way ANOVA and Duncan comparison. The results of this study were as follows. There was a significant difference in the level of the dietary guidelines practice, emotional intelligence and resilience according to the frequency of family meals of middle school students. Implications and suggestions based on the results of this study were as follows. First, family meal frequency is significantly related to middle school students' dietary guidelines practice, emotional intelligence, and resilience (p<0.05). Accordingly, personal efforts and social and institutional arrangements are required to increase the family meal frequency. Second, some of the core competences required in the 2015 revised curriculum were consistent with sub-areas of emotional intelligence and resilience, which can be predicted by the results that family meal experience of middle school students is also related to the development of core competences. In conclusion, increasing family meal frequency is important considering the trend of education, and is required for personality education.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.149-155
• /
• 2012

SSD is a storage device of having high-performance controller and cache buffer and consists of many NAND flash memories. Because NAND flash memory does not support in-place update, valid pages are invalidated when update and erase operations are issued in file system and then invalid pages are completely deleted via garbage collection. However, garbage collection performs many erase operations of long latency and then it reduces I/O performance and increases wear leveling in SSD. In this paper, we propose a new method of de-duplicating valid data and recycling invalid data. The method de-duplicates valid data and then recycles invalid data so that it improves de-duplication ratio. Due to reducing number of writes and garbage collection, the method could increase I/O performance and decrease wear leveling in SSD. Experimental result shows that it can reduce maximum 20% number of garbage collections and 9% I/O latency than those of general case.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.2
• /
• pp.223-233
• /
• 2023

Gauss Sieve is an algorithm for solving SVP and requires exponential time and space complexity. The terminationcondition of the Sieve is determined by the size of the constructed list and the number of collisions related to space complexity. The term 'collision' refers to the state in which the sampled vector is reduced to the vector that is already inthe list. if collisions occur more than a certain number of times, the algorithm terminates. When executing previous algorithms, we noticed that unnecessary operations continued even after the shortest vector was found. This means that the existing termination condition is set larger than necessary. In this paper, after identifying the point where unnecessary operations are repeated, optimization is performed on the number of operations required. The tests are conducted by adjusting the threshold of the collision that becomes the termination condition and the distribution in whichthe sample vector is generated. According to the experiments, the operation that occupies the largest proportion decreased by62.6%. The space and time complexity also decreased by 4.3 and 1.6%, respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.946-948
• /
• 2005

H.264/AVC는 SoC/IEC MPEG와 ITU-T Video Coding Experts Group에서 함께 발표한 비디오 코딩을 위한 가장 최근의 표준이다. 기존의 표준들 보다 적은 비트로 높은 압축률과 좋은 화질을 제공하고 있다. 그러나 1/4 화소 움직임 예측과 보상의 지원과 7가지의 가변블록에 대한 움직임예측과 블록모드별 RD(Rate-Distortion)를 수행하고 CAVLC등 H.264/AVC 표준에서 채택한 여러 가지 비디오 압축방식으로 인해 그 복잡도가 훨씬 증가하였다. 이 논문에서 H.264/AVC의 복호화기에서 복잡도의 약 $40\%$ 이상을 차지하는 움직임보상 모듈을 효율적으로 수행하고 최적화하기 위한 방법을 제안한다. 예측된 모션벡터에 따라 창조하는 프레임에서 매크로블록을 만들어 내는 움직임 보상 과정을 수행하는 데 있어서 접근 지연시간이 큰 외부 메모리 창조를 선인출 메커니즘을 이용하여 미리 예측하여 수행함으로써 전체 수행시간을 줄이는 기법을 적용하였다. 이를 통하여 가변길이 복호화 모듈과 움직임 보상모듈을 수정하여 반복적으로 읽고, 쓰기를 수행해야 하는 횟수를 줄였다. 실험 결과 본 논문에서 제안하는 방법을 이용하여 복호화 과정을 수행했을 때 PSNR(Peak Signal to Noise Ratio)의 손실은 전혀 없으면서 복호화기의 전체 실행시간을 약 $5\%$ 향상시키고, 핵심 모듈인 움직임 보상과정에서 약 $20\%$ 정도 실행시간을 향상시키는 등 높은 성능 향상을 보였다.

• The KIPS Transactions:PartA
• /
• v.19A no.3
• /
• pp.113-120
• /
• 2012

The visibility for signals in designs is required for their analysis and debug during the verification process. It could be achieved through the signal dumping for designs during the execution of HDL simulation. However, such signal dumping, in general, degrades the speed of simulation significantly, or can result in the number of simulation runs. In this paper, we have proposed an efficient and fast simulation method for dumping based on the design checkpoint, and shown its effectiveness by applying it to industrial SOC designs.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.10 no.1
• /
• pp.15-20
• /
• 1999

Objective：This study was designed to investigate the difference between executive function of Attention Deficit/Hyperactivity Disorder(ADHD) group and that of neurotics, and to investigate the developmental aspects of ADHD group's executive function. Method：Executive function between ADHD(N=87) and Neurotics(N=19) was evaluated through their performance on the Wisconsin Card Sorting Test. The results were analyzed by 2-way ANOVA and t-test. Results：The results revealed group difference between ADHD and neurotics in total correct reponses, total error responses, nonperseverative errors, number of categories completed, conceptual level responses. There was no significant difference between the performance of 8-12 aged group and 13-15 aged group. But 7-8 aged group showed significantly poor performance than 8-12 aged in total responses, total error responses, perseverative responses, perseverative error responses, nonperseverative error responses. Conclusions：In comparison to the neurotics group, the children of ADHD group are suggested to be lacking the ability to correct their responses according to the external feedback and they probably respond randomly without self-control. However, as there is no difference between perseverative errors and perseverative responses, the interpretation of this finding warrants caution. It also suggests that the developmental aspects should be considered in the studies of executive functions because there are differences in the performance of executive functions by ages.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.550-560
• /
• 2002

External sort on cluster computers requires not only fast internal sorting computation but also careful scheduling of disk input and output and interprocessor communication through networks. This is because the overall time for the execution is determined by reflecting the times for all the jobs involved, and the portion for interprocessor communication and disk I/O operations is significant. In this paper, we improve the sorting performance (sorting throughput) on a cluster of PCs with a low-speed network by developing a new algorithm that enables even distribution of load among processors, and optimizes the disk read and write operations with other computation/communication activities during the sort. Experimental results support the effectiveness of the algorithm. We observe the algorithm reduces the sort time by 45% compared to the previous NOW-sort[1], and provides more scalability in the expansion of the computing nodes of the cluster as well.

• Journal of dental hygiene science
• /
• v.6 no.3
• /
• pp.201-206
• /
• 2006

Purpose: The purpose of this study was to analyze level of dental health knowledge and behavior in elementary student, school health educators should encourage students to have continuous dental care habits for lifelong dental health with practical education. Methods: The subjects in this study were 490 students of four-year, fifth-year and sixth-year from elementary school in Daegu areas. The data was collected through a structured questionnaire from 26, June to 27, June 2006. Collected data were analyzed into frequency and Chi-square test using Spss 10.0 program. Result: Level of dental health knowledge were high as 57.8% in high groups, dental health behavior were high as twice a day in toothbrushing, over three times in visiting frequency of dental clinic for one years and once time of a day in intake frequency of cariogenic food. dental health knowledge by an academic years and sex were significant difference all of four-year, fifth-year and sixth-year. dental health behavior by an academic years and sex were significant difference in visiting frequency of dental clinic for one years and in intake frequency of cariogenic food by an academic years, male and female were significant difference in toothbrushing of a day. relationships of dental health knowledge and behavior were significant difference in intake frequency of cariogenic food.