• Journal of Information Technology Applications and Management
• /
• v.10 no.3
• /
• pp.55-74
• /
• 2003

Due to the evolution of computer systems and the proliferation of Internet, numerous information resources have been constructed. The deluge of information makes the need to integrate information, which are distributed on the internet and are handled in heterogeneous systems. Recently, most of the XML -based information integration systems use XML DTD(Document Type Definition) for describing integrated global schema. However, DTD has some limitations in modeling local information resources such as datatypes. Although W3C's XML Schema is more flexible and powerful than XML DTD in specifying integrated global schema, it has more complex problems in resolving conflicts than using DTD. In this paper, we provide a taxonomy of conflict problems in integration information resources using XML Schema, and propose conflict resolution mechanism using XQuery.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.129-134
• /
• 2004

XML is the new universal format for structured documents and data on the World Wide Web. As the Web becomes a major means of disseminating and sharing information and as the amount of XML data increases substantially, there are increased needs to manage and design such XML document in a novel yet efficient way. Moreover a demand of XML Schema(W3C XML Schema Spec.) that verifies XML document becomes increasing recently. However, XML Schema has a weak point for design because of its complication despite of various data and abundant expressiveness. Thus, it is difficult to design a complex document reflecting the usability, global and local facility and ability of expansion. This paper shows a simple way of modeling for XML document using a fundamental means for database design, the Entity-Relationship model. The design from the Entity-Relationship model to XML Schema can not be directly on account of discordance between the two models. So we present some algorithms to generate XML Schema from the Entity-Relationship model. The algorithms produce XML Schema codes using a hierarchical view representation. An important objective of this modeling is to preserve XML Schema's object-oriented concepts such as reusability, global and local ability. In addition to, implementation procedure and evaluation of the proposed design method are described.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.645-654
• /
• 1995

A distributed DBMS integrates local schemas that are independently designed, maintained, and managed by different users at each site providing a global virtual schema. This global schema supports users at a specific site to transparently utilize local database at different sites. The security features of the local schema should also not be changed in the global schema integrating security features of each local schema. Researches on the integration of security features into local schema in distributed DBMS environment, however, are very rate. This pater using the multilevel secure object-oriented database model(as the model for the definition of a local schema in distributed environment) which is an extension of the object-oriented models. It also suggests eight integration methods that can maintain the security features of local schemas. The eight methods are classified by the object classes and by relationships among them.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.1-12
• /
• 2005

The XML is emerging as standard language for data exchange on the Web. Therefore a demand of XML Schema(W3C MLL Schema Spec.) that verifies XML document becomes increasing. However, XML Schema has a weak point for design because of its complication despiteof various data and abundant expressiveness. This paper shows a simple way of design for XML Schema using a fundamental means for database design, the Entity-Relationship model. The conversion from the Entity-Relationship model to XML Schema can not be directly on account of discordance between the two models. So we present some algorithms to generate XML Schema from the Entity-Relationship model. The algorithms produce XML Schema codes using a hierarchical view representation. An important objective of this automatic generation is to preserve XML Schema's characteristics such as reusability, global and local ability, ability of expansion and various type changes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.667-673
• /
• 2004

The XML is emerging as standard language for data exchange on the Web. Therefore the demand of XML Schema(W3C XML Schema Spec.) that verifies XML document becomes increasing. However, XML Schema has a weak point for design because of its complication despite of various data and abundant expressiveness. This paper shows a simple way of design for XML Schema using a fundamental means for database design, the Entity-Relationship model. The conversion from the Entity-Relationship model to XML Schema can not be directly on account of discordance between the two models. So we present some algorithms to generate XML Schema from the Entity-Relationship model. The algorithms produce XML Schema codes using a hierarchical view representation. An important objective of this automatic generation is to preserve XML Schema's characteristics such as reusability, global and local ability, ability of expansion and various type changes.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.134-137
• /
• 2000

Genetic algorithms(GAs) have been widely used as a method to solve optimization problems. This is because GAs have simple and elegant tools with reproduction, crossover, and mutation to rapidly discover good solutions for difficult high-dimensional problems. They, however, do not guarantee the convergence of global optima in GA-hard problems such as deceptive problems. Therefore we proposed a Schema Co-Evolutionary Algorithm(SCEA) and derived extended schema 76988theorem from it. Using co-evolution between the first population made up of the candidates of solution and the second population consisting of a set of schemata, the SCEA works better and converges on global optima more rapidly than GAs. In this paper, we show advantages and efficiency of the SCEA by applying it to some problems.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.78-80
• /
• 1999

멀티데이터베이스를 구축하기 위해서는 전역스키마 (global schema) 구축이 필수적이며, 지역스키마(local schema) 간 충돌 해결과 스키마 통합 정보는 질의 처리 및 질의 결과를 사용자에게 보여주기 위해 필요하다. 전역스키마 생성 및 충돌 해결 방법은 많이 연구가 되어 왔다. 하지만, 스키마 통합을 위한 정보가 어떻게 표현되고, 어떻게 사용되는지에 대한 연구는 부족하다. 본 논문에서는 지역스키마와 전역스키마를 XML DTD 및 XML 문서로 표현하고, 이를 이용하여 멀티데이터베이스를 위한 스키마 통합 방법을 제안한다. 스키마 통합정보와 멀티데이터베이스와 지역데이터베이스들간 데이터교환을 XML을 이용함으로써 이기종간 데이터 교환이 쉽고, 멀티데이터베이스 시스템의 확장 및 다른 시스템으로의 전환이 용이하게 된다.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.3
• /
• pp.403-410
• /
• 2005

Nowadays, versatile robots are developed around the world. Novel algorithms are needed for controlling such robots. A 2-Layer fuzzy controller can deal with many inputs as well as many outputs, and its overall structure is much simpler than that of a general fuzzy controller. The main problem encountered in fuzzy control is the design of the fuzzy controller. In this paper, the fuzzy controller is designed by the schema co-evolutionary algorithm. This algorithm can quickly and easily find a global solution. Therefore, the schema co-evolutionary algorithm is used to design a 2-layer fuzzy controller in this study. We apply it to a mobile robot and verify the efficacy of the 2-layer fuzzy controller and the schema co-evolutionary algorithm through the experiments.

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.165-194
• /
• 1996

Data distribution is one of the most important steps in distributed database design. This paper proposes a methodology for distributing database by using a relational schema as an input. A design support system called DBDD (Database Distribution Design) is implemented within the framework of this methodology. The methodology consists of three phases such as (i) schema analysis, (ii) fragmentation, and (iii) allocation. In the schema analysis phase, all the table names are acquired from a global relational schema. In the fragmentation phase, fragments are generated according to transaction retrieval patterns. Furthermore, DBDD enhances the design quality by allocating fragments in a progressive manner. A real-life case is illustrated to demonstrate the practical usefulness of the DBDD.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1013-1016
• /
• 1999

Simple Genetic Algorithm(SGA) proposed by J. H. Holland is a population-based optimization method based on the principle of the Darwinian natural selection. The theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. Although GA does well in many applications as an optimization method, still it does not guarantee the convergence to a global optimum in GA-hard problems and deceptive problems. Therefore as an alternative scheme, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve. In this paper we propose an extended schema theorem associated with a schema co-evolutionary algorithm(SCEA), which explains why the co-evolutionary algorithm works better than SGA. The experimental results show that the SCEA works well in optimization problems including deceptive functions.