• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1108-1113
• /
• 2004

‘Set’ is a tool that is used frequently in designing computer programs. Because of the reason, ‘set constraints languages’ have been developed recently. In this research, we introduce ‘(Ab)(Cl) set unification’ problem and implement it using the ‘set equation rewriting in Prolog’. In this research we shows that the set unification, that is considered to be difficult to be implemented in procedural languages, ran be implemented easily using the non-deterministic control structure and the list data structure in logic language like Prolog. Our research uses the Ciao Prolog with GNU GPL, this is compared with other existing implementations which used expensive commercial Prolog, so anyone can use the result freely. Currently the result is being used for implementing a set constraint language.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.353-366
• /
• 2005

In future telecommunications systems, behaviour will be defined by inexperienced users for many different purposes, often by specifying requirements in the form of policies. The call processing language (CPL) was developed by the IETF in order to make it possible to define telephony policies in an Internet telephony environment. However, user-defined policies can hide inconsistencies or feature interactions. In this paper, a method and a tool are proposed to flag inconsistencies in a set of policies and to assist the user in correcting them. These policies can be defined by the user in a user-friendly language or derived automatically from a CPL script. The approach builds on a pre-existing logic programming tool that is able to identify inconsistencies in feature definitions. Our new tool is capable of explaining in user-oriented terminology the inconsistencies flagged, to suggest possible solutions, and to implement the chosen solution. It is sensitive to the types of features and interactions that will be created by naive users. This tool is also capable of assembling a set of individual policies specified in a user-friendly manner into a single CPL script in an appropriate priority order for execution by telecommunication systems.

• The Mathematical Education
• /
• v.48 no.2
• /
• pp.149-167
• /
• 2009

This study was aimed to examine problem-solving ability of fifth graders on two types of mathematical essay problems, and to analyze the process of mathematical justification in solving the essay problems. For this purpose, a total of 14 mathematical essay problems were developed, in which half of the items were single tasks and the other half were data-provided tasks. Sixteen students with higher academic achievements in mathematics and the Korean language were chosen, and were given to solve the mathematical essay problems individually. They then were asked to justify their solution methods in groups of 4 and to reach a consensus through negotiation among group members. Students were good at understanding the given single tasks but they often revealed lack of logical thinking and representation. They also tended to use everyday language rather than mathematical language in explaining their solution processes. Some students experienced difficulty in understanding the meaning of data in the essay problems. With regard to mathematical justification, students employed more internal justification by experience or mathematical logic than external justification by authority. Given this, this paper includes implications for teachers on how they need to teach mathematics in order to foster students' logical thinking and communication.

• Journal of Digital Convergence
• /
• v.11 no.3
• /
• pp.285-292
• /
• 2013

The method of recent information retrieval passes into an semantic search to provide more accurate results than keyword-based search. But in common user case, they are still accustomed to using existing keyword-based search. Hence they are hard to create a typed structured query language. In this paper, we propose to ontology knowledge-base scheme for query interpretation of these user. The proposed scheme was designed based on the OWL-DL for description logic reasoning, it can provide a richer representation of the relationship between the object by using SWRL(Semantic Web Rule Language). Finally, we are describe the experimental results of the similarity measurement for verification of a user query semantic interpretation.

• Journal of English Language & Literature
• /
• v.64 no.2
• /
• pp.203-217
• /
• 2018

Both in terms of frequency and importance, sympathy is one of the most central themes that Mary Shelley's Frankenstein (1818) delves into. While not a few critics have written on the subject, one crucially important aspect has been overlooked in the previous discussions of sympathy in Frankenstein: Shelley's critical intervention in the term's long lasting association with the notion of one body from a single origin. Focusing on the novel's central theme of sympathy, my paper addresses this oversight in the existing Frankenstein scholarship. I argue that Shelley's main agenda regarding sympathy in the novel is to problematize the logic of self-reproduction implicit in the notion of sympathy as an essentially familial tie. The reading of the novel as a warning against human violation of nature has been prevalent both in academia and popular culture. Nonetheless, in terms of sympathy, this paper offers an alternative reading in which the novel questions, not valorizes, the naturalization of nature. Far from valorizing the inviolable sacredness of nature, I argue, Frankenstein is a literary project attempting to disassociate sympathy from the natural bond that one is born into, and instead, re-associate it with fellowship as a second-nature to be continuously reinvented and reeducated.

• Journal of Internet Computing and Services
• /
• v.16 no.3
• /
• pp.33-41
• /
• 2015

In this paper, the simplification procedure of Karnaugh Map, which is essential to design digital logic circuits, was implemented as web-based educational Java applets. The learners will be able to experience interesting learning process by executing the proposed Java applets. In addition, since the proposed Java applets were designed to contain educational technologies by step-by-step procedure, the maximization of learning efficiency can be obtained. The learners can make virtual experiments on the simplification of digital logic circuits by clicking on some buttons or filling out some text fields. Furthermore, the Boolean expression and its schematic diagram occurred in the simplification process will be displayed on the separate frame so that the learners can learn effectively. The schematic diagram enables them to check out if the logic circuit is correctly connected or not. Finally, since the simplification algorithm used in the proposed Java applet is based on the modified Quine-McCluskey minimization technique, the proposed Java applets will show more encouraging result in view of learning efficiency if it is used as assistants of the on-campus offline class.

• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.411-419
• /
• 2009

In order to derive hidden Information (concept subsumption, concept satisfiability and realization) of OWL ontologies, a number of OWL reasoners have been introduced. Most of the reasoners were implemented to be based on tableau algorithm. However this approach has certain limitation. This paper presents architecture for Medusa. The Medusa is an extended DL-reasoner for SWRL(Semantic Web Rule Language) reasoning under well-founded semantics with ontologies specified in Description Logic. Description logic based ontology reasoners theoretically explore knowledge representation and its reasoning in concept languages. However these logics are not equipped with rule-based reasoning mechanisms for assertional knowledge base; specifically, rule and facts in logic programming, or interaction of rules and facts with terminology. In order to deal with the enriched reasoning, The Medusa provides combining DL-knowledge base and rule based reasoner. The described prototype uses $Prot{\acute{e}}g{\acute{e}}$ API[1] for controlling communication with the ontology reasoner.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.781-788
• /
• 2017

This paper proposes a new algorithm for comparing amplitude between multiple digital input signals and its digital logic architecture. After simultaneously comparing multiple inputs, the proposed algorithm can provide the information of the largest (or smallest) value among them by using a simple digital logic function. The drawback of the method is to increase hardware resource. To overcome this we propose a reuse method of the overlapped logic operation. The proposed method focuses on enhancing the operational clock frequency, in other words decreasing combinational delay time. After implementing the comparing method with HDL (hardware description language), we experiment on it with environment of Cyclone III EP3C40F324A7 FPGA of Altera Inc. In case of 4 input signals, it can increase the operational speed as mush as 1.66 times with 1.20 times the hardware resource. In case of 8, it can also have 2.29 times the clock frequency and 2.15 times the hardware resource.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2679-2689
• /
• 1997

In this paper, a multimedia authoring system using temporal/spatial synchronization manager is designed and implemented to support easy and efficient generation of multimedia title. For this goal, a flowchart-oriented logic generator which represents a title author's design intent into a practical title composition logic without extra translation process, and a logic interpreter which translate and implement the generated title logic, are designed. Furthermore, a temporal/spatial synchronization manager which manages temporal/spatial synchronization information between media data for multimedia representation, is designed. Especially, a temporal specification model and MRL, a formal language for the model, are designed to synchronize the temporal relation between media objects. The MRL represents a complex temporal relation by simple and clear form, and synchronizes efficiently multimedia representation according to the author's intent. A presentation frame editor which makes coincidence between visible size of representation media and attachment point, is implemented for spatial synchronization.

• Journal of The Korean Association of Information Education
• /
• v.22 no.2
• /
• pp.205-212
• /
• 2018

As a way to improve the software education ability of the pre - service teachers, we conducted programming learning using two types of programming tools (Python and Scratch) at the regular course time. In programming learning, various types of errors, which are factors that continuously hinder interest, achievement and creativity, were collected and analyzed by type. By using the analyzed data, it is possible to improve the ability of pre-service teachers to cope with the errors that can occur in the software education to be taught in the elementary school, and to improve the learning effect. In this study, logic error (37.63%) was the most frequent type that caused the most errors in programming in both conventional language that input text and language that assembles block. In addition, the detailed errors that show a lot of differences in the two languages are the errors of Python (14.3%) and scratch (3.5%) due to insufficient use of grammar and other errors.