• Journal of the Korea Society of Computer and Information
• /
• v.18 no.1
• /
• pp.83-91
• /
• 2013

As humans perform many tasks using computers, HCI(Human-Computer Interaction) has received much attention these days. One objective of HCI research is to propose how to design more consistent systems. In order to evaluate the consistency of HCI devices from the user's perspective, several models such as TAG(Task Action Grammar), GOMS(Goals-Operators-Methods-Selection Rule), and GTN(General Transition Network) have been developed. TAG specifies actions to perform tasks in terms of rule schema. It has been verified that the less the number of rule schema is, the better users perform the tasks due to assumably higher consistency. This paper hypothesizes that the consistency of systems depends not only on the number of rule schema but also on the distances between rule schema. That is, the closer the rule schema are, the easier it is to acquire the whole set of rule schema. An experiment supported this hypothesis. Therefore, distances between rule schema should be considered as well as the number of rule schema when designing systems.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.9-15
• /
• 2007

As the information of the internet increased, importance of sematic web for collecting and integration of these informations to support decision making of some group or ordinary people are growing as well. Basis structure that composes semantic web is ontology and languages like XML, RDF/RDF schema and OWL are basis means that compose ontology schema. When composes and manages Ontology schema, one of the important consideration point is that schema is changed as times go by. Therefore, change of domain of schema, change of data concept or change of relation between resource etc. are reflected in the ontology system. In this study, we suggest semantic web schema management skill in terms of version management. We categorized version change forms and created version graph for checking of version transition. With created version graph, we define transitivity rule and propose schema tag for detail application which enables extending of applicable version schema.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.2
• /
• pp.167-178
• /
• 2002

XML documents used for exchanging structured documents between heterogeneous distributed systems are spreading among B2B and the industrial world rapidly. This condition brings an object-oriented visualization tool for modeling XML documents. It is hard to apply for DTD - the rule for declaring document type, which is employed in XML, to various industrial field. Thus, W3C announced Recommendation for XML Schema - the rule for declaring new document type which is adaptable to XML and satisfy to user. Document Type which has high reusability and flexibility can be defined owing to that XML Schema is designed by utilization of Object-Oriented-Modelling technique(UML). This document is proposed the specification and an algorithm for mapping XML Schema to UML.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.7-10
• /
• 2005

본 논문에서는 관계형 데이터베이스를 이용하여 XML Schema 문서를 저장 및 갱신 시 유효성이 유지되는 저장 모델을 설계하였다. 기존의 XML Schema 저장 모델은 갱신 시 유효성 검증을 위해 XML Schema 를 파일로 추출하여 변경한 후 XML Parser 를 이용하는 복잡한 과정을 필요로 한다. 이 논문에서 설계한 모델은 슈퍼타입 서브타입을 이용한 모델링과 관계형 데이터베이스에서 제공 하는 참조 키, NOT NULL, Default, Check(Rule), Trigger 등의 제약 조건을 사용하므로 다른 응용 프로그램의 의존 없이 저장 및 갱신 데이터의 유효성을 간단하게 검증할 수 있다. 그러므로 이 저장 모델을 이용하면 XML Schema 문서가 데이터베이스에 저장이 되어 있는 그 자체로 유효한 스키 마임을 보장할 수 있어 저장 및 갱신의 효율을 높일 수 있는 장점이 있다. 본 논문에서 설계한 저장 모델은 상용 관계데이터베이스인 SQL 서버 2000 에 적용하여 테이블과 제약조건을 설정한 후 데이터 갱신과정을 실험하였으며, 실험결과 XML Schema의 작성규칙에 위배되는 변경 시도는 설정한 제약조건에 의해 사전 방지되어 데이터의 유효성이 유지됨을 확인하였다.

• Proceedings of the CALSEC Conference
• /
• 2003.09a
• /
• pp.142-147
• /
• 2003

요즈음의 전자상거래 환경하에서 ebXML 및 XML/EDI보금이 원활하게 되면서 여러 가지로 표준화 문서의 XML문서와와 문성화된 XML문서를 해독하고 작성하는 부분에 대한 내용이 주요 ISSUE사항이 될 것이다. 위 사항과 관련하여 XML/EDI 및 ebXML내에서의 사용 가능한 XML화된 표준문서의 Schema생성과 생성된 Schema의 성능을 Test한 결를 제시하고자 함.(중략)

• Proceedings of the CALSEC Conference
• /
• 2004.02a
• /
• pp.318-326
• /
• 2004

The ebXML (Electronic Business using eXtensible Markup Language) Specification Schema is to provide nominal set of specification elements necessary to specify a collaboration between business partners based on XML. As a part of ebXML Specification Schema, BPSS (Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPSS is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification is insufficient to specify formal semantic constraints of modeling elements completely. In this study, we propose a classification schema for the BPSS semantic constraints and describe how to represent those semantic constraints formally using OCL (Object Constraint Language). As a way to verify a Business Process Specification (BPS) with the formal semantic constraint modeling, we suggest a rule-based approach to represent the formal constraints and to use the rule-based constraints specification to verify BPSs in a CLIPS prototype implementation.

• Journal of Information Technology Applications and Management
• /
• v.9 no.3
• /
• pp.13-30
• /
• 2002

ebXML (Electronic Business using extensible Markup language), sponsored by UN/CEFACT and OASIS, is a modular suite of specifications that enables enterprises of any size and in any geographical location to conduct business over the Internet. Using ebXML, companies now have a standard method to exchange business messages, conduct trading relationships, communicate data In common terms and define and resistor business processes. It is the mission of ebXML that provides an open XML-based infrastructure enabling the global use of electronic business information in an interoperable, secure and consistent manner by all parties for creating a single e1ectronic electronic market. This paper briefly overviews the concept of core component, context, assembly rule and context rule. Then, It designs by standard specifications of ebXML core component commonly used in an industry and among industries, and assembles business messages by using XML schema. Therefore, it suggests the mechanism which effectively exchanges business messages among the trading partners. This paper designs core component by using only three business messages of retail industry : orders, dispatch report, sales report.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1274-1276
• /
• 1993

We have designed a multiple-valued fuzzy Approximate Analogical-Reseaning system (AARS). The system uses a similarity measure of fuzzy sets and a threshold of similarity ST to determine whether a rule should be fired, with a Modification Function inferred from the Similarity Measure to deduce a consequent. Multiple-valued basic fuzzy blocks are used to construct the system. A description of the system is presented to illustrate the operation of the schema. The results of simulations show that the system can perform about 3.5 x 106 inferences per second. Finally, we compare the system with Yamakawa's chip which is based on the Compositional Rule of Inference (CRI) with Mamdani's implication.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.228-233
• /
• 2004

Nowadays, the robot with various and complex functions is required. previous algorithms, however, cannot satisfy the requirement. In order to solve these problems, we introduce the 2-Layer Fuzzy Controller, which has a small number of fuzzy rules corresponding to various inputs and outputs. Also, it controls robustly and effectively an object. The main problem in the fuzzy controller is how to design the fuzzy rule. This paper designs the optimal 2-layer fuzzy controller using the Schema Co-Evolutionary Algorithm. The schema co-evolutionary algorithm can find more rapidly and excellently than simple genetic algorithm does.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.1
• /
• pp.93-101
• /
• 2010

Currently lots of studies to solve meta-data interoperability in between schema attributes are conducted. But the accuracy in previous schema mapping studies is low since the studies just use the similarity in between attributes. So the studies are not suitable for the schema mapping such as document conversion, system integration, etc. In this paper, we propose a method which can conduct the schema mapping interactively using frequent pattern mining. The method can conduct more accurate mapping process because the method use the description element which is an element among each schema element for the metadata standard. A performance study has been conducted to compare the accuracy performance of the method using metadata standards.