• Journal of the Korean Society for Library and Information Science
• /
• v.54 no.3
• /
• pp.165-186
• /
• 2020

Although BIBFRAME is recognized as a new bibliographic standard that can replace the existing MARC structure, the vastness of the descriptive items shows many limitations to be applied in library communities. Thus this study proposed separating the descriptive levels of BIBFRAME as a way to enhance the applicability of BIBFRAME. The descriptive level of BIBFRAME was divided into three stages: core, standard, and detailed levels based on the bibliographic area of ISBD 2011. This separation was semantically implemented using RDF/RDFS syntax. The levels of description in BIBFRAME was defined as Class Granularity and Class Element, and the Property Relation was defined for the linkage between the Classes defined and the BIBFRAME. By applying this syntactic structure, the relationships between the BIBFRAME descriptive items separated by each descriptive level could be linked with each other. This approach is expected to ensure applicability in the creation and sharing of bibliographic data using BIBFRAME.

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.263-272
• /
• 2007

This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.

• Journal of Auto-vehicle Safety Association
• /
• v.12 no.4
• /
• pp.61-69
• /
• 2020

As a sales volume of autonomous vehicle continually grows up, regulations on this new technology are being introduced around the world. For example, safety standards for the Level 3 automated driving system was promulgated in December 2019 by the Ministry of Land, Infrastructure and Transport of Korean government. In order to promote the development of autonomous vehicle technology and ensure its safety simultaneously, the regulations on the automated driving systems should be phased in to keep pace with technology progress and market expansion. However, according to SAE J3016, which is well known to classify the level of the autonomous vehicle technologies, the description for classification is rather abstract. Therefore it is necessary to describe the automated driving system in more detail in terms of the 'Level.' In this study, the functions and characteristics of automated driving system are carefully classified at each level based on the commentary in the Informal Working Group (IWG) of the UN WP29. In particular, regarding the Level 4, technical issues are characterized with respect to vehicle tasks, driver tasks, system performance and regulations. The important features of the autonomous vehicles to meet Level 4 are explored on the viewpoints of driver replacement, emergency response and connected driving performance.

• Journal of Multimedia Information System
• /
• v.6 no.4
• /
• pp.271-282
• /
• 2019

There is a description that you cannot manage what you do not measure. The Korea Ministry of National Defense (MND) is conducting evaluations in various fields to obtain meaningful effects from IT investments, and views that the evaluation of the defense informatization sector is divided into defense informatization policy evaluation and defense informatization project evaluation. The defense informatization level evaluation can measure the informatization level of MND and the armed forces or organizations. Since the evaluation system being studied to measure the level of defense informatization is composed mainly of qualitative metrics, it is necessary to reconstruct it based on quantitative metrics that can guarantee objectivity. In addition, for managing the level of change by evaluation objects, the evaluation system should be designed with a focus on homeostasis of metrics so that it can be measured periodically. Moreover, metrics need to be promoted in terms of performance against targets. To this end, this study proposes to measure the level of defense informatization by dividing it into defense information network, computer systems, interoperability and standardization, information security, information environment, and information system use, and suggests their metrics.

• Journal of Korean Neurosurgical Society
• /
• v.64 no.4
• /
• pp.473-485
• /
• 2021

Adolescent idiopathic scoliosis (AIS), which is associated with an extensive range of clinical and radiological presentations, is the one of the most challenging spinal disorders. The goals of surgery are to correct the deformity in 3 dimensions and to preserve motion segments while avoiding complications. Despite the ongoing evolution of classification systems and algorithms for the surgical treatment of AIS, there has been considerable debate regarding the selection of an appropriate fusion level in AIS. In addition, there is no consensus regarding the exact description, relationship, and risk factors of coronal decompensation following selective fusion. In this review, we summarize the current concepts of selection of the fusion level for AIS and review the available information about postoperative coronal decompensation.

• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.645-689
• /
• 2016

This article gives upper bounds on the number of Fourier-Jacobi coefficients that determine a paramodular cusp form in degree two. The level N of the paramodular group is completely general throughout. Additionally, spaces of Jacobi cusp forms are spanned by using the theory of theta blocks due to Gritsenko, Skoruppa and Zagier. We combine these two techniques to rigorously compute spaces of paramodular cusp forms and to verify the Paramodular Conjecture of Brumer and Kramer in many cases of low level. The proofs rely on a detailed description of the zero dimensional cusps for the subgroup of integral elements in each paramodular group.

• Proceedings of the KIPE Conference
• /
• 2015.07a
• /
• pp.357-358
• /
• 2015

This paper provides a comparison of power converter loss and thermal description for voltage source and current source type 5MW-class medium voltage topologies of wind turbines. Neutral-point clamped three-level converter is adopted for voltage source type topology while two-level converter is employed for current source type topology considering the popularity in the industry. In order to match the required voltage level of 4160V with the same switching device of IGCT as in voltage source converter, two active switches are connected in series for the case of current source converter. The loss analysis is confirmed through PLECS simulations. In addition, the loss factors due to di/dt and dv/dt snubber and ac input filter are presented. The comparison result shows that VSC-based wind turbine system has a higher efficiency than that of CSC under the rated operating conditions.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.1-7
• /
• 1998

High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.5
• /
• pp.149-157
• /
• 1994

This paper Presents an algorithm for synthesis of sequential statements described at RT level VHDL. The proposed algorithm transforms sequential statements in VHDL into data-flow description consisting of concurrent statements by local and global dependency analysis and output dependency elimination. Transformation into concurrent statements makes it possible to reduce the cost of the synthesized hardwares, thus to get optimal synthesis results that will befit the designer 's intention. This algorithm has been implemented on VSYN and experimental results show that more compact gate-level hardwares are generated compared with Power View system from ViewLogic and Design Analyzer from Synopsys.

• The Journal of Korea Robotics Society
• /
• v.14 no.2
• /
• pp.104-113
• /
• 2019

Object manipulation in cluttered environments remains an open hard problem. In cluttered environments, grasping objects often fails for various reasons. This paper proposes a novel task and motion planning scheme to grasp objects obstructed by other objects in cluttered environments. Task and motion planning (TAMP) aims to generate a sequence of task-level actions where its feasibility is verified in the motion space. The proposed scheme contains an open-loop consisting of three distinct phases: 1) Generation of a task-level skeleton plan with pose references, 2) Instantiation of pose references by motion-level search, and 3) Re-planning task based on the updated state description. By conducting experiments with simulated robots, we show the high efficiency of our scheme.