• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.223-234
• /
• 2006

Branching and merging have been being the outstanding methods for SCM in terms of supporting parallel developments. Since well-known commercial merging tools based on textual merging have not detecting semantics conflicts, they can cause semantic errors in the result of merging. Although a lot of researches for detecting semantic conflict and merging up to recently, these researches have been doing individually. Therefore, it is necessary for a research detecting semantic conflict on textual merging and solving it. In this paper, we propose a new method for merging which preserve semantics on textual merging. The method merging two revisions from a source program is as follows : 1) defining changing operations, which include Update, Delete, and Insert operation, per line on two revisions corresponding to the line in source program, 2) detecting textual conflicts and semantic conflict in terms of executional behaviors, 3) solving these conflicts before merging. So, the proposed method can be regarded as a hybrid method that combines a method of textual merging and a behavioral semantic merging.

• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.787-801
• /
• 2006

Ontology merging describes the process of integrating two ontologies into a new ontology. How this is done best is a subject of ongoing research in the Semantic Web, Data Integration, Knowledge Management System, and other ontology-related application systems. Earlier research on ontology merging, however, has studied for developing effective ontology matching approaches but missed analyzing and solving methods of problems of merging two ontologies given correspondences between them. In this paper, we propose a specific ontology merging process and a generic operator, T-MERGE, for integrating two source ontologies into a new ontology. Also, we define a taxonomy of merging conflicts which is derived from differing representations between input ontologies and a method for detecting and resolving them. Our T-MERGE operator encapsulates the process of detection and resolution of conflicts and merging two entities based on given correspondences between them. We define a data structure, MergeLog, for logging the execution of T-MERGE operator. MergeLog is used to inform detailed results of execution of merging to users or recover errors. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Naver philosophy dictionary as input ontologies. Our experiments show that the automatic merging module compared with manual merging by a expert has advantages in terms of time and effort.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.795-800
• /
• 2010

Embedding a large vocabulary speech recognition system in mobile devices requires a reduced acoustic model obtained by eliminating redundant model parameters. In conventional optimization methods based on the minimum description length (MDL) criterion, a binary Gaussian tree is built at each state of a hidden Markov model by iteratively finding and merging similar mixture components. An optimal subset of the tree nodes is then selected to generate a downsized acoustic model. To obtain a better binary Gaussian tree by improving the process of finding the most similar Gaussian components, this paper proposes a new distance measure that exploits the difference in likelihood values for cases before and after two components are combined. The mixture weight of Gaussian components is also introduced in the component merging step. Experimental results show that the proposed method outperforms MDL-based optimization using either a Kullback-Leibler (KL) divergence or weighted KL divergence measure. The proposed method could also reduce the acoustic model size by 50% with less than a 1.5% increase in error rate compared to a baseline system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.186-191
• /
• 2020

In this paper, we proposed an optimization technique for efficiently placing vehicles on decks in a vehicle-carrying ship to efficiently handle loading and unloading. For this purpose, we utilized the transformation method of the XML data representing the ship's spatial information, merging and branching algorithm and genetic algorithm, and implemented the function to visualize the optimized vehicle placement results. The techniques of selection, crossover, mutation, and elite preservation, which are used in the conventional genetic algorithms, are used. In particular, the vehicle placement optimization method is proposed by merging and branching the ship space for the vehicle loading. The experimental results show that the proposed merging and branching method is effective for the optimization process that is difficult to optimize with the existing genetic algorithm alone. In addition, visualization results show vehicle layout results in the form of drawings so that experts can easily determine the efficiency of the layout results.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.5
• /
• pp.251-258
• /
• 2014

This paper proposes an efficient token flow design methodology for a decoder in the MPEG Reconfigurable Media Coding (RMC) framework. The MPEG RMC framework facilitates a decoder to be configured with a set of modules called functional units (FUs) that are connected by tokens. Such a modular design philosophy of the MPEG RMC framework enables the reusability and reconfigurability of FUs. One drawback of the MPEG RMC framework is that the decoder performance can be affected by increasing the token transmissions between FUs. The proposed method improves the design of the FU network in the RMC framework toward real-time decoder implementation. In the proposed method, the merging of FU, the separation of token flow, and the merging of token transactions are applied to minimize the token traffic between FUs. The experimental results of the MPEG-4 SP decoder show that the proposed method reduces the total decoding time by up to 77 percent compared to the design of the RMC simulation model.

• Spatial Information Research
• /
• v.13 no.2 s.33
• /
• pp.157-166
• /
• 2005

LiDAR(Light Detection And Ranging) can make terrain model where above the ground and the mixed data between SBES(Single Beam Echo Sounder) and SSS(Side Scan Sonar) can make terrain model where bottom of water. So this research suggest that how to merge data which are got ken different devices and we developed the software which can display 2D/3D graphic and water volume calculation. And we compared accuracy between the commercial software'Surfer'and LiDAR and SBES data Merging Program.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.179-187
• /
• 2017

The fourth industrial revolution is a phenomenon where productivity is improved in each field by the convergence of IT technology and existing industries. In the dental treatment process, prosthetic treatment time is drastically shortened through AI and expert software. Oral imaging, prosthesis design, and prosthesis manufacturing are performed continuously, so the treatment can be completed in a few hours. In this paper, we introduce the research trend of multimedia technology in the prosthetic process. We also propose a new method for accelerating the fusion of surface data during the optical impression. Proposed method enables high-speed optical impression and accelerates the overall automated production process of dental prosthesis.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.767-774
• /
• 2013

In this paper, a novel parallel Viterbi decoding scheme is proposed to decrease the decoding latency and power consumption for the software-defined radio (SDR) system. It implements a divide-and-conquer approach by first dividing a block into a series of subblocks, then performing independent Viterbi decoding for each subsequence, and finally merging the surviving subpaths into the final path. Moreover, a network-on-chip-based SDR platform is used to evaluate the performance of the proposed parallel Viterbi decoding scheme. The experiment results show that our scheme can speed up the Viterbi decoding process without increasing the BER, and it performs better than the current state-of-the-art methods.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.10 no.1
• /
• pp.55-69
• /
• 2007

The paper provides the approach to apply formal methods to the development and certification criteria of defense safety/security-critical software. RTCA/DO-178B is recognized as a do facto international standard for airworthiness certification but lack of concrete activities and vagueness of verification/certification criteria have been criticized. In the case of MoD Def Stan 00-55, the guidelines based on formal methods are concrete enough and structured for the defense safety-related software. Also Common Criteria Evaluation Assurance Level includes the strict requirements of formal methods for the certification of high-level security software. By analyzing the problems of DO-178B and comparing it with MoD Def Stan 00-55 and Common Criteria, we identity the important issues In safety and security space. And considering the identified issues, we carry out merging of DO-178B and CC EAL7 on the basis of formal methods. Also the actual case studies for formal methods applications are shown with respect to the verification and reuse of software components.

• Genomics & Informatics
• /
• v.15 no.3
• /
• pp.108-111
• /
• 2017

Recently developed computational methods allow the imputation of human leukocyte antigen (HLA) genes using intergenic single nucleotide polymorphism markers. To improve the imputation accuracy in HLA imputation, it is essential to increase the sample size and the diversity of alleles in the reference panel. Our software, MergeReference, helps achieve this goal by providing a streamlined pipeline for combining multiple reference panels into one.