• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.2
• /
• pp.138-146
• /
• 2011

With the increased use of GPS in the field of various applications including surveying, the request for fast and precise positional information has increased. Several countries such as USA, Canada, and Australia have already been operating Internet-based automatic GPS data analysis system using e-mail and FTP. Expanding GPS market, it is necessary to establish automatic GPS baseline processing system that is accessible via Internet. The system developed in this study is operating on the web, and it allows the users to access easily regardless of time and place. The main processing engines are Bernese V5.0 and PAGES. They process user data with three GPS CORS(Continuously Operating Reference Station), and then send the report to the users through e-mail. This system allows users to process high accurate GPS data easily. It is expected that this system will be used for various GPS applications such as monitoring large-scale structures and providing spatial information services in private sector.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1081-1094
• /
• 2016

KREONET is a principal national R&E network running by KISTI in Korea. It uniquely provides production research network services for around 200 non-profit research and educational organizations, based on hybrid (IP and non-IP) network infrastructure. However, KREONET is limited to meet various needs of new network services for advanced Science & Technology (S&T) users because its infrastructure is inherently derived form classical hardware-based, fixed and closed environments. So, KREONET-S is designed to provide advanced S&T services to catch up with time-to-research and time-to-collaboration. In this paper, we present a system architecture of KREONET-S based on network infrastructure that consists of data and control planes separately. Furthermore, we propose and describe VDN service which is capable of building a virtual dedicate & bandwidth-guaranteed network for S&T group dynamically. we implement VDN application on KREONET-S and then perform performance analysis for proving that KREONET-S system and VDN application can be a good solutions to cope with new network paradigms for various advanced S&T applications and users.

• Journal of Conservation Science
• /
• v.34 no.1
• /
• pp.59-67
• /
• 2018

This study investigated manufacturing technique and provenance of the Gilt-bronze Seated Bhaisajyaguru (Medicine Buddha) Statue of Janggoksa Temple. The statue had the following : Cu(68.8%)-Sn(10.4%)-Pb(17.1%), it is similar to other medium or large Buddha statue. As results of comparison lead isotope ratio of sample with the provenance data were plotted in zone 3 of the South Korean galena map. According to this result of Bronze Buddha could be made into galena of the located in same area the temple. The results of this study were compared with the Bronze Bodhisattva statue of Goseongsa Temple. The manufacturing techniques were different based on the characteristics of Buddha statues and thus could be made into galena of the located in same area the temple.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.681-687
• /
• 2007

Face recognition technique is very popular for a personal information security and user identification in recent years. However, the face recognition system is very hard to be implemented due to the difficulty where change in illumination, pose and facial expression. In this paper, we consider that an illumination change causing the variety of face appearance, virtual image data is generated and added to the D-LDA which was selected as the most suitable feature extractor. A less sensitive recognition system in illumination is represented in this paper. This way that consider nature of several illumination directions generate the virtual training image data that considered an illumination effect of the directions and the change of illumination density. As result of experiences, D-LDA has a less sensitive property in an illumination through ORL, Yale University and Pohang University face database.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.408-419
• /
• 2003

Data warehouses are usually dedicated to the processing of quires issued by decision support system(DSS). The response time of DSS queries is typically several orders of magnitude higher than the one of OLTP queries. Since DSS queries are often submitted interactively, techniques for reducing their response time are important. The caching of query results is one such technique particularly well suited to the DSS environment. In this paper, we present a cache manager for such an environment. Specifically, we define a canonical form of query. The cache manager looks up a query based on the exact query match or using a suggested query split process if the query is found is non-canonical form or in canonical form, respectively. It dynamically maintains the cache content by employing a profit function which reflects in an integrated manner the query execution cost, the size of query result, the reference rate, the maintenance cost of each result due to updates of their base tables, and the frequency of such updates. We performed the experimental evaluation and it positively shows the performance benefit of our cache manager.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.110-118
• /
• 2002

This paper presents a 3-D graphic database system based on XML that supports content-based retrievals of 3-D images, Most of graphics application systems are currently centered around the processing of 2-D images and research works on 3-D graphics are mainly concerned about the visualization aspects of 3-D image. They do not support the semantic modeling of 3-D objects and their spatial relations. In our data model, 3-D images are represented as compositions of 3-D graphic objects with associated spatial relations. Complex 3-D objects are mode]ed using a set of primitive 3-D objects rather than the lines and polygons that are found in traditional graphic systems. This model supports content-based retrievals of scenes containing a particular object or those satisfying certain spatial relations among the objects contained in them. 3-D images are stored in the database as XML documents using 3DGML DTD that are developed for modeling 3-D graphic data. Finally, this paper describes some examples of query executed in our Web-based prototype database system.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.422-433
• /
• 2009

As an effort to secure Semantic Web, in this paper, we introduce an RDF access authorization model based on an ontology hierarchy and an RDF triple pattern. In addition, we apply the authorization model to RDF query validation for approved access authorizations. A subscribed SPARQL or RQL query, which has RDF triple patterns, can be denied or granted according to the corresponding access authorizations which have an RDF triple pattern. In order to efficiently perform the query validation process, we first analyze some primary authorization conflict conditions under RDF subsumption inference, and then we introduce an efficient query validation algorithm using the conflict conditions and Dewey graph labeling technique. Through experiments, we also show that the proposed validation algorithm provides a reasonable validation time and when data and authorizations increase it has scalability.

• Current Research on Agriculture and Life Sciences
• /
• v.32 no.3
• /
• pp.159-163
• /
• 2014

Agricultural unmanned helicopters have become a new paradigm for aerial application. Yet, such agricultural helicopters require easy and affordable attitude control systems. Therefore, this study presents an affordable attitude measurement system using a DCM (direction cosine matrix) algorithm that would be applied to agricultural unmanned helicopters. An IMU using a low-cost MEMS and an algorithm to estimate the attitude of the helicopter were applied in a gimbals structure to evaluate the accuracy of the attitude measurements. The estimation errors in the attitude were determined in comparison with the true angles determined by absolute position encoders. The DCM algorithm and sensors showed an accuracy of about 1.1% for the roll and pitch angle estimation. However, the accuracy of the yaw angle estimation at 3.7% was relatively larger. Such errors may be due to the magnetic field of the stepping motor and encoder system. Notwithstanding, since the intrinsic behavior of the agricultural helicopter remains steady, the determination of attitude would be reliable and practical.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.309-321
• /
• 2009

Nowadays, requests of connecting to the Internet while moving are increasing more and more, and various technologies have been developed for satisfying those requests. The IETF nemo WG standardized "Network Mobility Basic Support Protocol" for supporting mobile network through extending existing MIPv6 protocol for supporting host mobility. But, mobile networks can be nested while they are changing their location. And if they are multi -level nested, that causes some problems because of protocol characteristic. In this paper, we try to solve the problem that is complicated routing path caused by multi-level nesting of mobile networks with our limited prefix delegation method. We give a little modification to the standard protocol and add some functions to mobile router. With results from analysis, we could say that our method has better performance than other proposed methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.33-41
• /
• 2021

This paper proposes heuristic greedy algorithm that can be find the solution within polynomial time with solution finding rule for the capacitated minimum spanning tree(CMST) problem, known as NP-hard. The CMST problem can be solved by computer-aided meta-heuristic because of the Esau-Williams heuristic polynomial time algorithm has a poor performance. Nevertheless the meta-heuristic methods has a limit performance that can't find optimal solution. This paper suggests visual by handed solution-finding rule for CMST. The proposed algorithm firstly construct MST, and initial feasible solution of CMST from MST, then optimizes the CMST with the subtree gates more adjacent to root node. As a result of total 30 cases of OR-LIB 10 data, Q=3,5,10, the proposed algorithm gets the best performance.