• 한국산업정보학회논문지
• /
• 제3권1호
• /
• pp.258-268
• /
• 1998

This paper presents two sequential advanced split and merge algorithms and a parallel image segmentation algorithm based on them. First, the two advanced methods are obtained from the combination of edge detection and classic split and merge to solve the inherent problems of the classical method. Besides, the parallel image segmentation algorithm on mesh-connected MIMD system considers three types in the merge stage to reduce the communication overhead between processors, such as intraprocessor merge, interprocessor with boundary merge, and interprocessor without boundary merge. Finally , we prove that the proposed algorithms achieve the improved performance by implementing them.

• Journal of Electrical Engineering and information Science
• /
• 제2권5호
• /
• pp.1-8
• /
• 1997

The main purpose of the Boolean equivalence problem is to verify that two Boolean expressions have the same functionality. Simulation has been extensively used as the standard method for the equivalence problem. Obviously, the number of tests required to perform a satisfactory coverage grows exponentially with the number of input variables. However, formal methods as opposed to simulation are getting more attention from the community. We propose a new algorithm called the Cover-Merge Algorithm based on a derivational method using the concept of cover and merge for the equivalence problem and investigate its theoretical aspects. Because of the difficulty of the problem, we emphasize simplification techniques in order to reduce the search space or problem size. Heuristics based on types of merges are developed to speed up the derivation process by allowing simplifications. In comparison with widely used technique called Binary Decision Diagram or BDD, the algorithm proposed outperforms BDD in nearly all cases of input including standard benchmark problems.

• 경영과학
• /
• 제32권2호
• /
• pp.91-109
• /
• 2015

The M&A of firms has been emerged as the effective means of fast diversification and growth in dynamic environment. However, the empirical research about M&A in Korea has not been implemented rich due to the difficulty of obtaining M&A data. In this research, we empirically investigate the relationships among M&A, environment and firms' performance focused on Korean manufacturing firms, understanding the current practice of M&A in Korea. We use the Manufacturing Productivity Panel Survey Data, which are collected by Korea Productivity Center in 2013. The sample size is 575 and the sample is divided into M&A group and non-M&A group. We conduct logit analysis with the independent variables of environment factors (munificence, dynamic, uncertainty), and firms' performance (sales growth, ROS, labor productivity and Inventory turnover), and dependent variable of M&A group or non M&A group. The results show that M&A is closely related to environment feature and firm performance: M&A firms are likely to be the higher munificence and dynamic and the lower sales growth and higher profitability than non-M&A group. In addition, we also examine the characteristics of firms by M&A types (competitors, customer/supplier and firms from unrelated industry). These results imply that if firms confront the pressure of uncertainty (dynamic) and the lower growth, they tend to choose M&A. Futhermore, to profoundly understand the behavior of firms about M&A, it is required to classify the M&A firms by merge types.

• 전산구조공학
• /
• 제9권1호
• /
• pp.23-32
• /
• 1996

본 논문에서는 건물 기초 설계의 자동화를 위한 규칙 기반 시스템을 개발하였다. 상부구조의 설계 결과와 지반 조사 보고서로부터의 지반에 관한 자료를 읽어 들여 허용지내력을 추정하고 주어진 상황에 적절한 기초형식을 추론하는 방법을 제안하였다. 허용지내력은 표준관입시험치로부터 추정하였고, 이를 바탕으로 각 기중과 벽체의 기초형식은 우선 독립기초와 벽체기초라고 가정하여 그 크기를 계산하고 각 기초의 중첩여부를 조사하여 중첩되는 기초들은 본 논문에서 개발한 기초 합병의 방법을 이용하여 새로운 기초형식으로 변경되도록 하였다. 개발된 시스템은 주어진 상부구조 설계결과와 지반조건에 대하여 적절한 기초형식을 선정하여 그에 따른 배근 설계를 쉽게 할 수 있도록 해준다.

• 한국인터넷방송통신학회논문지
• /
• 제22권4호
• /
• pp.17-22
• /
• 2022

최근 웹 서비스의 확산과 함께 데이터의 형태는 더욱 다양해지고 있다. 이미지, 동영상, 텍스트 등 데이터를 저장하는 형태 뿐 아니라 해당 데이터를 표현하는 속성 및 메타데이터 등도 개수 및 형태가 데이터 별로 상이하다. 이러한 비정형 데이터를 효율적으로 처리하기 위해 키밸류 스토어(Key-Value Store)의 사용이 확산되고 있다. LSM-Tree(Log Structured Merge Tree)는 다양한 상용 키밸류 스토어의 핵심 자료구조이다. LSM-Tree 는 모든 쓰기 및 삭제 연산을 로그 방식으로 기록함으로써 소량의 쓰기에 높은 성능을 제공하도록 최적화 되어 있다. 그러나 최근 유효성 만료 데이터의 대용량 삭제 연산이 LSM-Tree에 특수 키밸류 데이터로 삽입됨에 따라 사용자 요청의 지연시간 및 처리속도가 저하된다는 문제점이 있다. 본 논문은 기존 LSM-Tree의 장점을 모두 유지하면서도 삭제된 키를 주요 트리 구조에서 분리하여 상기 문제를 해결하는 Filtered LSM-Tree (FLSM-Tree)를 제안한다. 제안하는 기법은 상용 키밸류 저장소인 LevelDB에 구현되었으며 성능 평가에서 읽기 성능이 최대 47% 향상됨을 보인다.

• 지식경영연구
• /
• 제14권1호
• /
• pp.95-119
• /
• 2013

Although merger and acquisition (M&A) has been considered as an important means to improve firm performance, most prior empirical research have failed to prove the relationship between M&A and firm performance. In order to fill this gap, this study attempts to identify the effect of M&A on firm performance based on knowledge resources relatedness and complementarity theory. For this purpose, this study examines complementarity patterns of knowledge resources and their impacts on acquirer's performance using M&A announcements of electronic commerce industry from 2001 to 2007. The results of this study indicate complementarity among knowledge resources are positively related with acquirer's market value. This study contributes to expand knowledge management research by identifying the relationship among knowledge resources and their impacts on firm performance.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 1998년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.201-206
• /
• 1998

In this paper, we have considered the method for clustering land cover types over the East Asia from AVHRR data. The feature vectors such that maximum NDVI, amplitude of NDVI, mean NDVI, and NDVI threshold are extracted from the 10-day composite by maximum value composite(MVC) for reducing the effect of cloud contaninations. To find the land cover clusters given by the feature vectors, we are adapted the self-organizing feature map(SOFM) clustering which is the mapping of an input vector space of n-dimensions into a one - or two-dimensional grid of output layer. The approach is to find first the clusters by the first layer SOFM and then merge several clusters of the first layer to a large cluster by the second layer SOFM. In experiments, we were used the 8-km AVHRR data for two years(1992-1993) over the East Asia.

• Journal of information and communication convergence engineering
• /
• 제8권4호
• /
• pp.377-382
• /
• 2010

With the advent of flash memory based new storage device (SSD), there is considerable interest within the computer industry in using flash memory based storage devices for many different types of application. The dynamic index structure of large text collections has been a primary issue in the Information Retrieval Applications among them. Previous studies have proven the three approaches to be effective: In- Place, merge-based index structure and a combination of both. The above-mentioned strategies have been researched with the traditional storage device (HDD) which has a constraint on how keep the contiguity of dynamic data. However, in case of the new storage device, we don' have any constraint contiguity problems due to its low access latency time. But, although the new storage device has superiority such as low access latency and improved I/O throughput speeds, it is still not well suited for traditional dynamic index structures because of the poor random write throughput in practical systems. Therefore, using the experimental performance evaluation of various index maintenance schemes on the new storage device, we propose an efficient index structure for new storage device that improves significantly the index maintenance speed without degradation of query performance.

• 전자공학회논문지
• /
• 제54권2호
• /
• pp.61-67
• /
• 2017

이 논문에서는 협대역과 낮은 전송속도의 제약을 가진 수중의 다양한 환경에 적응적인 MAC 기법을 제안하였다. 이미 발표된 Underwater Packet Flow Control (UPFC) 기법은 전송회수와 전송시간을 이용한 세 가지 전송타입을 제안하여 일반전송, 블럭전송, 병렬전송이 가능하도록 설계되었으나 기존 머지전송을 보완하여 최대전송가능 페이로드를 기준으로 효율적인 큐잉방법에 대한 기법 Effective Queuing-UPFC (EQ-UPFC)을 제안하였다. 제안한 기법의 전송효율의 검증을 위해 수학적 모델을 제시하였으며 시뮬레이션을 수행하여 전송회수 및 전송량 대비 효율성의 증가를 검증하였다.

• 대한음성학회지:말소리
• /
• 제60호
• /
• pp.165-180
• /
• 2006

In this paper, we present several confidence measures (CM) for speech recognition systems to evaluate the reliability of recognition results. We propose heuristic CMs such as mean log-likelihood score, N-best word log-likelihood ratio, likelihood sequence fluctuation and likelihood ratio testing(LRT)-based CMs using several types of anti-models. Furthermore, we propose new algorithms to add weighting terms on phone-level log-likelihood ratio to merge word-level log-likelihood ratios. These weighting terms are computed from the distance between acoustic models and knowledge-based phoneme classifications. LRT-based CMs show better performance than heuristic CMs excessively, and LRT-based CMs using phonetic information show that the relative reduction in equal error rate ranges between $8{\sim}13%$ compared to the baseline LRT-based CMs. We use the support vector machine to fuse several CMs and improve the performance of utterance verification. From our experiments, we know that selection of CMs with low correlation is more effective than CMs with high correlation.