• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.537-541
• /
• 2008

Log-Structured File System(LFS) is a disk based file system that is optimized for improving the write performance. LFS gathers dirty data in memory as long as possible, and flushes all dirty data sequentially at once. In a real system, however, maintaining dirty data in memory should be flushed into a disk to meet file system consistency issues even if more memory is still available. This synchronizations increase the cleaner overhead of LFS and make LFS to write down more metadata into a disk. In this paper, by adapting Non-volatile RAM(NV-RAM) we modifies LFS and virtual memory subsystem to guarantee that LFS could gather enough dirty data in the memory and reduce small disk writes. By doing so, we improves the performance of LFS by around 2.5 times than the original LFS.

• Communications of Mathematical Education
• /
• v.37 no.3
• /
• pp.545-567
• /
• 2023

This study investigates effective ChatGPT prompts for solving mathematical problems, focusing on the chapters of quadratic equations and quadratic functions. A structured prompt was designed, following a sequence of 'Role-Rule-Example Solution-Problem-Process'. In this study, an artificial intelligence model combining GPT-4, Wolfram plugin, and Advanced Data Analysis was utilized. Wolfram was used as the primary tool for calculations to reduce computational errors. When using the structured prompt, the accuracy rate for problems from nine high school mathematics textbooks on quadratic equations and quadratic functions was 91%, showing higher performance compared to zero-shot prompts. This confirmed the effectiveness of the structured prompts in solving mathematical problems. The structured prompts designed in this study can contribute to the development of intelligent information systems for personalized and customized education.

• Journal of Intelligence and Information Systems
• /
• v.14 no.2
• /
• pp.83-102
• /
• 2008

Ubiquitous computing requires timely supply of contextual information in order to upgrade decision quality. In this sense, this study is aimed at proposing a multi-dynamic decision support system for highly ill-structured problems. Especially, it is very important for decision makers in the ubiquitous computing to coordinate conflicts among local goals and global goal harmoniously. The proposed Multi-Dynamic Decision Support System (MDDSS) is basically composed of both central structure and distributed structure, in which central structure supports multi objects decision making and distributed structure supports individual decision making. Its hybrid architecture consists of decision processor, multi-agent controller and intelligent knowledge management processor. Decision processor provides decision support using contexts which come from individual agents. Multi-agent controller coordinates tension among multi agents to resolve conflicts among them. Meanwhile, intelligent knowledge management processor manages knowledge to support decision making such as rules, knowledge, cases and so on. To prove the validity of the proposed MDDSS, we applied it to an u-fulfillment problem system in which many kinds of decision makers exist trying to satisfy their own objectives, and timely adjustment of action strategy is required. Therefore, the u-fulfillment problem is a highly ill-structured problem. We proved its effectiveness with the aid of multi-agent simulation comprising 60 customers and 10 vehicles under three experimental modes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.239-240
• /
• 2007

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.66-68
• /
• 2000

웹에서 공개하는 정보의 많은 부분이 문자에 의존해서 제공되고 있으며, 이렇게 단어의 여러 형태로 구성된 웹 문서에서 원하는 정보를 찾아 추출하기 위한 노력은 다양하게 시도되고 있다. 본 논문에서는 전자부품관련 정보 제공 사이트와 관련해서 텍스트 기반과 웹 문서가 갖는 특별한 형태의 태그를 포함하는 형태에서 테이블 형식의 정보 표현과 같이 반 구조적(semi-structured) 문서에서의 정보 추출 방법과 이를 적용한 시스템을 구성하여 정보 추출의 가능성을 제시하고자 한다.

• Korean Medical Education Review
• /
• v.19 no.1
• /
• pp.47-55
• /
• 2017

This study was conducted to analyze the strengths and weaknesses of a 3-week family medicine clerkship program based on the results of an online survey taken by the students (N=127) and a structured interview with a focus group (n=10), aimed to improve the quality of the clerkship program. The online survey contained questions pertaining to goals, schedule, contents, arrangement, atmosphere, environment, evaluation, and satisfaction regarding the clerkship. The focus group interview addressed the schedule and achievements of the program. Scores were reported on a 5-point Likert scale. Most students were highly satisfied with the overall quality of the clerkship. The structured interview results showed that 97.6% of the clerkship program was executed according to the schedule. The focus group reported a perfect score of 5 points on several measures including: accomplishment of the educational goals of the family medicine clerkship, providing many chances to obtain medical histories and perform physical examinations on real patients, experience with various symptoms and diseases, positive attitudes of faculty members when teaching, notification of the guidelines for evaluation beforehand, well-constructed and effective clerkship schedule, and reflection of student feedback. However, the focus group gave low scores on: support for health accidents of students, access to patient information, enough opportunities to practice clinical skills, appropriate rest facilities for students, and fairness of clerkship evaluation process. In conclusion, the structured evaluation performed after the 3-week clerkship program motivated students and helped them ensure an efficient clerkship. This structured evaluation also suggested basic data to make the professor who is subject of the assessment. This study shows that structured assessment is an effective method which can be used to improve the quality of clerkships.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.69-77
• /
• 2008

An algorithm for tracking the trace of structured light is proposed to obtain depth information accurately. The technique is based on the fact that the pixel location of light in an image has a unique association with the object depth. However, sometimes the projected light is dim or invisible due to the absorption and reflection on the surface of the object. A dynamic programming approach is proposed to solve such a problem. In this paper, necessary mathematics for implementing the algorithm is presented and the projected laser light is tracked utilizing a dynamic programming technique. Advantage is that the trace remains integrity while many parts of the laser beam are dim or invisible. Experimental results as well as the 3-D restoration are reported.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.1
• /
• pp.117-135
• /
• 2010

We designed a structured folksonomy system in which queries can be expanded through tag control; equivalent, synonym or related tags are bound together, in order to improve the retrieval efficiency (recall and precision) of image data. Then, we evaluated the proposed system by comparing it to a tag-based system without tag control in terms of recall, precision, and user satisfaction. Furthermore, we also investigated which query expansion method is the most efficient in terms of retrieval performance. The experimental results showed that the recall, precision, and user satisfaction rates of the proposed system are statistically higher than the rates of the tag-based system, respectively. On the other hand, there are significant differences among the precision rates of query expansion methods but there are no significant differences among their recall rates. The proposed system can be utilized as a guide on how to effectively index and retrieve the digital content of digital library systems in the Library 2.0 era.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.8
• /
• pp.1089-1098
• /
• 2001

Structure information contained in a structured document supports various access paths to document. In order to use structure information contained in a structured document, it is required to construct an index structural on document structures. Content indexing and structure indexing per document require high memory overhead. Therefore, processing of pure structure queries based on document structure like relationship between elements or element orders, low memory overhead for indexing are required. This paper suggests the GDIT(Global Document Instance Tree) data structure and indexing scheme about structure of document which supports low memory overhead for indexing and powerful types of user queries. The structure indexing scheme only index the lowest level element of document and does not effect number of document having retrieval element. Based on the index structure, we propose an query processing algorithm about pure structure, proof the indexing schemes keeps up indexing efficient in terms of space. The proposed index structure bases GDR concept and uses index technique based on GDIT.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.4
• /
• pp.75-94
• /
• 2010

This study designed a pilot system in which queries can be expanded through a tag ontology where equivalent, synonymous, or related tags are bound together, in order to improve the retrieval effectiveness of videos. We evaluated the proposed pilot system by comparing it to a tag-based system without tag control, in terms of recall and precision rates. Our study results showed that the mean recall rate in the structured folksonomy-based system was statistically higher than that in the tag-based system. On the other hand, the mean precision rate in the structured folksonomy-based system was not statistically higher than that in the tag-based system. The result of this study can be utilized as a guide on how to effectively use tags as social metadata of digital video libraries.