• Korean Journal of Remote Sensing
• /
• v.12 no.1
• /
• pp.17-25
• /
• 1996

This paper presents a GCP marking technique using scanned maps. Twelve maps with a scale of 1:250, 000 were scanned and stored as raster images. The distortion factors of scanned maps were modelled by polynomials. The coefficients of the polynomials were determined by a least squre fit. This technique does not require a bulky and expensive digitizing table so that it is suitable for a low-cost pre-processing system. The GCP marking using this technique showed a sufficient accuracy for KITSAT1, 2 narrow camera images.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.6
• /
• pp.534-543
• /
• 2015

This paper proposes an Energy Theft Traceback Protocol(ETTP) based on Logging and Marking that can trace Energy Theft back in Smart Grid Environment. The ETTP consists of the following three phases. First, it classifies Energy Theft Type into Measurement Rejection and Data Fabrication by generating an Energy Theft Tree. Second, it detects an Energy Theft by using the Energy Theft Tree. Finally, it trace an Energy Theft back by using the Logging Table of a Router and the Marking Information of a Packet. The result of its simulation shows that the Detection Ratio of Energy Theft is estimated at 92% and the Success Ratio of Energy Theft Traceback at 93%. Therefore, the ETTP not only reduces such risk factors as Forgery and Tampering about Billing information but also provides safe and reliable Smart Grid environment.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2323-2333
• /
• 1998

Software engineers generally analyze the program behavior under the test case that revealed the error, not under any teneric est case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The eficiency of this algorithm is evaluated on some developed program. results are shown by a marking table of execution history. Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph, Consequently, the efficiency of the proosed algorithm is also presented by the compariso with algorithm that was announced previously.

• Advances in nano research
• /
• v.16 no.4
• /
• pp.365-374
• /
• 2024

This study delves into the significant impact of integrating nanomaterials, specifically carbon and graphene nanoparticles, into the polymer matrix of aluminum alloy 356, utilizing the vortex casting technique, with the aim of improving the mechanical properties of table tennis equipment. Athletes and their coaching teams have long been on a quest for high-performance sports gear, recognizing its pivotal role in unlocking the full potential of players. The dedication of engineers to craft designs, select materials with precision, and uphold stringent testing standards reflects the commitment to meeting the demands of the sporting world. Yet, to remain at the forefront, sports engineering must continually align with contemporary technologies, and nanotechnology has emerged as a transformative force in this regard. This study not only underscores the meticulous efforts in material integration but also highlights the remarkable strides made possible by nanotechnology. Aluminum nanocomposites, particularly, showcase a groundbreaking fusion of exceptional strength and reduced weight, marking a notable achievement in sports equipment innovation. The research outcomes are compelling, revealing a substantial enhancement in the mechanical performance of the sports structures under scrutiny. This promising development hints at a potential paradigm shift in the manufacturing of sports equipment, promising a new era of elevated athlete performance and enhanced safety during the rigors of physical education training. This study stands as a testament to the tangible impact of nanotechnology on the ever-evolving landscape of sports equipment.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.2
• /
• pp.711-718
• /
• 2013

Traffic pavement markings are one of primary transportation facilities that provide drivers with various road information directly. Thus, a clear understanding of traffic pavement markings is utmost important to improve traffic safety as well as to establish a proper traffic culture. However, no past studies examined drivers' understanding of traffic pavement markings in Korea. Hence, this study investigated drivers' understanding of traffic pavement markings through an elaborated administrated survey, and analyzed the relationship between various drivers' characteristics and understanding regarding pavement marking via cross-classification table and logistic model. The analysis results show that drivers have limited understanding regarding the purpose of the markings. Specifically, the average understanding of pavement markings is 57.41%: the lowest understanding is 25.88% for yield pavement marking, and the highest understanding is 91.18% for advanced pedestrian crosswalk pavement marking. This study also revealed that the understanding of some pavement markings are somewhat influenced by user group such as drivers with suspended or revoked driver licenses, but the overall understanding of pavement markings are not significantly affected by drivers' characteristics such as gender and driving experiences at ${\alpha}$=0.05. Thus, it might be desirable for policy makers to establish pavement marking-related policies for overall drivers rather than specific drivers.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.193-206
• /
• 2012

Keys play a fundamental role in all data models. They allow database systems to uniquely identify data items, and therefore, promote efficient data processing in many applications. Due to this, support is required to discover keys. These include keys that are semantically meaningful for the application domain, or are satisfied by a given database. We study the discovery of keys from SQL tables. We investigate the structural and computational properties of Armstrong tables for sets of SQL keys. Inspections of Armstrong tables enable data engineers to consolidate their understanding of semantically meaningful keys, and to communicate this understanding to other stake-holders. The stake-holders may want to make changes to the tables or provide entirely different tables to communicate their views to the data engineers. For such a purpose, we propose data mining algorithms that discover keys from a given SQL table. We combine the key mining algorithms with Armstrong table computations to generate informative Armstrong tables, that is, key-preserving semantic samples of existing SQL tables. Finally, we define formal measures to assess the distance between sets of SQL keys. The measures can be applied to validate the usefulness of Armstrong tables, and to automate the marking and feedback of non-multiple choice questions in database courses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.772-779
• /
• 2012

In the current MANET, DOS or DDOS attacks are increasing, but as MANET has limited bandwidth, computational resources and battery power, the existing traceback mechanisms can not be applied to it. Therefore, in case of traceback techniques being applied to MANET, the resource of each node must be used efficiently. However, in the traceback techniques applied to an existing ad hoc network, as a cluster head which represents all nodes in the cluster area manages the traceback, the overhead of the cluster head shortens each node's life. In addition, in case of multi-hop clustering, as one Cluster head manages more node than one, its problem is getting even worse. This paper proposes TNA(Traceback against Network Attacks) based on multihop clustering using the depth of tree structure in order to reduce the overhead of distributed information management.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2384-2392
• /
• 1999

Software engineers are used to analyse the error behavior of computer programs using test cases which are collected for the testing phase when software errors are detected. In actual software testing and debugging, it is important to adopt dynamic slicing technique which is concerned on all the statements to be affected by the variables of current inputs and to use technique of its implementations. The traditional dynamic slicing has focused on the single slicing criterion algorithm. It has been thought that it is needed to develope and implement algorithm for used multiple criteria variables program slicing, which finds every slicing criterion variable where it is used multiple criteria variables. In this paper, we propose an efficient algorithm to make dynamic program slices when it has used multiple criteria variables. The results of the implementation are presented by the making table on execution history and the dynamic dependence graph. Also we can find that the proposed dynamic program slicing approach using multiple criteria variables is more efficient than the traditional single case algorithm on the practical testing environment.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.1
• /
• pp.93-98
• /
• 2016

A large number of victims or witnesses to incidents and accidents should visit a police station and fill the decree stated. Stated decree workaround discomfort and hygienic problems in unnecessary step process using the fingerprint after you modify the modified portion when due modify the request as of the import or typos recognized that modifications and police in the. Stated decree in the investigation phase when creating KICS and electronic Resources investigation into the identity of the one-touch fingerprint reader linked with the introduction table system and thinning, which can simplify the day of the procedure.

• Korean Journal of Plant Taxonomy
• /
• v.52 no.4
• /
• pp.255-261
• /
• 2022

Clerodendrum ervatamioides C. Y. Wu was described in 1977 with its type locality in Yunnan, China. During our floristic investigation in the Muong Nhe Nature Reserve of Vietnam of Dien Bien province and in the Muong Te district of the Lai Chau province, we collected several specimens of Clerodendrum ervatamioides, marking the first record of its occurrence in Vietnam. In this paper, details of the morphological features, distribution, ecology, photo plates, and a table comparing the morphological features with its ally Clerodendrum garrettianum Craib are provided.