• Journal of KIISE:Software and Applications
• /
• v.34 no.8
• /
• pp.731-742
• /
• 2007

Self-growing software is a software system that has the capability of evolving its functionalities and configurations by itself based on dynamically monitored situations. Self-growing software is especially necessary for intelligent service robots, which must have the capability to monitor their surrounding environments and provide appropriate behaviors for human users. However, it is hard to anticipate all situations that robots face with, and it is hard to make robots have all functionalities for various environments. In addition, robots have limited internal capacity. To support self-growing software for intelligent service robots, we are developing a cell-based distributed repository system that allows robots and developers transparently to share robot functionalities. To accomplish the creation of evolutionary repositories, we invented the concept of a cell, which is a logical group of distributed repositories based upon the functionalities of components. In addition, a cell can be used as a unit for the evolutionary growth of the components within the repositories. In this paper, we describe the requirements and architecture of the cell-based repository system for self-growing software. We also present a prototype implementation and experiment of the repository system. Through the cell-based repositories, we achieve improved performance of self-growing actions for robots and efficient sharing of components among robots and developers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.73-85
• /
• 2004

SIn this paper, we introduce our experience for designing and implementing new concept of a global XML-based Peer-to-Peer (P2P) engine to support various P2P applications, and interconnection among PC, Web and mobile computing environments. The proposed P2P engine can support to heterogeneous data exchanges and web interconnection by facilitating with the text-base XML while message exchange are necessary. It is also to provide multi-level security functions as well as to apply different types of security algorithms. The system consist of four modules; a message dispatcher to scheduling and filtering the message, a SecureNet to providing security services and data transmission, a Discovery Manager to constructing peer-to-peer networking, and a Repository Manager to processing data management including XML documents. As a feasibility test, we implement various P2P services such as chatting as a communication service, white-board as an authoring tool set during collaborative working, and a file system as a file sharing service. We also compared the proposed system to a Gnutella in order to measure performance of the systems.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.857-862
• /
• 2005

MND(Ministry of National Defense) has developed MND AF(Ministry of National Defense Architecture Framework) and CADM(Core Architecture Data Model to guarantee interoperability among defense information systems. But, it is very difficult to manage architecture product documented through MND AF and CADM. So, there Is necessity for development of modeling tool and repository system which can develop architecture products and manage architecture product informations in common repository In this paper, we developed architecture product management system which supports development and management of meta model and architecture product of MND AF and CADM. Through architecture product management system architect of each agency can construct architecture product in a more effective and efficient way with modeling method and a user can search and refer useful architecture product informations using query function. Also, architecture product management system provides the basis for system integration and interoperability with integration, analysis and comparison of architecture product.

• Journal of Broadcast Engineering
• /
• v.23 no.1
• /
• pp.26-35
• /
• 2018

The recent development of overlay network technology enables distributed sharing of various types of contents. Although overlay network has great advantages as a huge content repository, it is practically difficult to directly provide such Internet service as streaming of contents. On the other hand, the media server, which is specialized in content services, has excellent service capabilities, but it suffers from the huge contents that are constantly created and requires large expansion of severs and storages, and thus requires much effort for efficient management of the huge repository. Hence, the association of an overlay network of huge storage with a media server of high performance content service will show a great synergy effect. In this paper, a location-aware scheme of constructing overlay networks and associating it with media server is proposed, and then cache-based contents management and service policy are proposed for efficient content service. The performance is analysed for one of the content services, streaming service.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.39-52
• /
• 2005

GML (Geography Markup Language) has become the widely adopted standard for transport and storage of geographic information. So, various researches such as modeling, storage, query, and etc have been studied to provide the interoperability of geographic information in web environments. Especially, there are increased needs to store semi-structured data such as GML documents efficiently. Therefore, in this paper, we design and implement a GML repository to store GML documents on the basis of GML schema using spatial database system. GML Schema is converted into directed GML schema graph and the schema mapping technique from directed schema graph to spatial schema is presented. Also, we define the conversion rules on spatial schema to preserve the constraints of GML schema. GML repository using spatial database system is useful to provide the interoperability of geographic information and to store and manage enormous GML documents.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.391-396
• /
• 2003

This paper proposes a new approach that converts continuous-valued attributes to categorical-valued ones considering the distribution of target attributes(classes). In this approach, It can be possible to get optimal interval boundaries by considering the distribution of data itself without any requirements of parameters. For each attributes, the distribution of target attributes is projected to one-dimensional space. And this space is clustered according to the criteria like as the density value of each target attributes and the amount of overlapped areas among each density values of target attributes. Clusters which are made in this ways are based on the probabilities that can predict a target attribute of instances. Therefore it has an interval boundaries that minimize a loss of information of original data. An improved performance of proposed discretization method can be validated using C4.5 algorithm and UCI Machine Learning Data Repository data sets.

• Journal of Radiation Protection and Research
• /
• v.26 no.2
• /
• pp.119-132
• /
• 2001

This paper provides the basic technical and safety criteria to guide establishing the reference HLW geological repository system that has been developing based on the recommendations from the international organizations such as IAEA and ICRP as well as the comparison of the regulations of several leading countries in HLW disposal. The proposed criteria and guidelines were categorized by the basic principles and general criteria for the radiological safety and the functional criteria of the repository system components. They would be useful for the development of the national regulations and criteria for HLW disposal in the future. They, of course, will be revised based on the deep geological investigation in Korean Peninsular which will be implemented in the future.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.485-490
• /
• 2004

In data representation, the clustering performs a grouping process which combines given data into some similar clusters. The various similarity measures have been used in many researches. But, the validity of clustering results is subjective and ambiguous, because of difficulty and shortage about objective criterion of clustering. The fuzzy clustering provides a good method for subjective clustering problems. It performs clustering through the similarity matrix which has fuzzy membership value for assigning each object. In this paper, for objective fuzzy clustering, the clustering algorithm which joins principal components analysis as a dimension reduction model with bayesian learning as a statistical learning theory. For performance evaluation of proposed algorithm, Iris and Glass identification data from UCI Machine Learning repository are used. The experimental results shows a happy outcome of proposed model.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.11-22
• /
• 2006

As we are to deal with more and more XML documents, research on storing and managing XML documents in databases are actively conducted. Employing RDBMS or ORDBMS as a repository of XML documents is currently regarded as most practical. The query results out of XML documents stored in databases could be cached for query performance though the cost of cache consistency against the update of the underlying data is incurred. In this paper, we assume that an ORDBMS is used as a repository for the XML query cache as well as its underlying XML documents, and that XML query cache is refreshed in a deferred way with the update log. When the same XML document was updated multiple times, the deferred refresh of the XML query cache may Bet inefficient. We propose an algorithm that removes or filters such duplicate updates. Based on that, the optimal SQL statements that are to be executed for XML query cache consistency are generated. Through experiments, we show the efficiency of our proposed deferred refresh of XML query cache.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.227-240
• /
• 2003

When we develop and use the java-based distributed object system, the system developer must deploy distributed object, which is implemented to predefined interface, to network and the system user acquires reference about distributed object and changes reference to interface type. Sharing of interface is essential for these works In this paper, we propose the IRSJ(interface repository service based on jim) to improve efficiency of interface sharing at the JINI system development. the IRSJ is consisted of the java classes for JINI system and interface sharing service. If development teams perform collaborative work in short distance, the IRSJ can search interface file without information of lookup server or interface writer If development teams perform collaborative work in long distance, the IRJS can search interface with only an address of server that executes lookup service. Although the interface object not requires additional search, the interface object that failed search interface can download interface and use interface using remote event model. When the message service fails in interface search, the message service sends interface request message to a development team member who use the IRSJ automatically, so that interface sharing may be possible in short time.