• Korean Journal of Computational Design and Engineering
• /
• v.6 no.2
• /
• pp.101-110
• /
• 2001

The maximum intersection of spherical convex polygons are to find spherical regions owned by the maximum number of the polygons, which is applicable for determining the feasibility in manufacturing problems such mould design and numerical controlled machining. In this paper, an efficient method for partitioning a sphere with the polygons into faces is presented for the maximum intersection. The maximum intersection is determined by examining the ownerships of partitioned faces, which represent how many polygons contain the faces. We take the approach of edge-based partition, in which, rather than the ownerships of faces, those of their edges are manipulated as the sphere is partitioned incrementally by each of the polygons. Finally, gathering the split edges with the maximum number of ownerships as the form of discrete data, we approximately obtain the centroids of all solution faces without constructing their boundaries. Our approach is analyzed to have an efficient time complexity Ο(nv), where n and v, respectively, are the numbers of polygons and all vertices. Futhermore, it is practical from the view of implementation since it can compute numerical values robustly and deal with all degenerate cases.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.8 no.5
• /
• pp.423-433
• /
• 2016

In this paper, we consider the cybersecurity issue of ship information system (SIS) from a new perspective which is called opacity. For a SIS, its confidential information (named as "secret") may be leaked through the working behaviors of each Distributed Control Unit (DCU) from an outside observer called an "intruder" which is able to determine ship's mission state by detecting the source of each data flow from the corresponding DCUs in SIS. Therefore we proposed a dual layer mechanism to enforce opacity by activating non-essential DCU during secret mission. This mechanism is calculated by two types of insertion functions: Safety-assured insertion function ($f_{IS}$) and Admissibility-assured insertion function ($f_{IA}$). Due to different objectives, $f_{IS}$ is designed to confuse intruder by constructing a non-secret behaviors from a unsafe one, and the division of $f_{IA}$ is to polish the modified output behaviors back to normal. We define the property of "$I_2$-Enforceability" that dual layer insertion functions has the ability to enforce opacity. By a given mission map of SIS and the marked secret missions, we propose an algorithm to select $f_{IS}$ and compute its matchable $f_{IA}$ and then the DCUs which should be activated to release non-essential data flow in each step is calculable.

• Annual Conference on Human and Language Technology
• /
• 1996.10a
• /
• pp.145-152
• /
• 1996

연속음성인식 시스템을 개발하기 위해서는 언어가 갖는 문법적 제약을 이용한 언어모델이 요구된다. 문법적 규칙을 이용한 언어모델은 전문가가 일일이 문법 규칙을 만들어 주어야 하는 단점이 있다. 통계적 언어 모델에서는 문법적인 정보를 수작업으로 만들어 주지 않는 대신 그러한 모든 정보를 학습을 통해서 훈련해야 하기 때문에 이를 위해 요구되는 학습 데이터도 엄청나게 증가한다. 따라서 적은 양의 데이터로도 이와 유사한 효과를 보일 수 있는 것이 클래스에 의거한 언어 모델이다. 또 이 모델은 음성 인식과 연계시에 탐색 공간을 줄여 주기 때문에 실시간 시스템 구현에 매우 유용한 모델이다. 여기서는 자동으로 클래스를 찾아주는 알고리즘을 호텔예약시스템의 corpus에 적용, 분석해 보았다. Corpus 자체가 문법규칙이 뚜렷한 특성을 갖고 있기 때문에 heuristic하게 클래스를 준 것과 유사한 결과를 보였지만 corpus 크기가 커질 경우에는 매우 유용할 것이며, initial map을 heuristic하게 주고 그 알고리즘을 적용한 결과 약간의 성능향상을 볼 수 있었다. 끝으로 음성인식시스템과 접합해 본 결과 유사한 결과를 얻었으며 언어모델에도 음향학적 특성을 반영할 수 있는 연구가 요구됨을 알 수 있었다.

• The Korean Journal of Health Service Management
• /
• v.11 no.4
• /
• pp.213-224
• /
• 2017

Objectives : The purpose of this study was to analyze representative topics and topic trends of papers in Korean Society and Health Service Management(KSHSM) Journal. Methods : We collected English abstracts and key words of 516 papers in KSHSM Journal from 2007 to 2017. We utilized Python web scraping programs for collecting the papers from Korea Citation Index web site, and RStudio software for topic analysis based on latent Dirichlet allocation algorithm. Results : 9 topics were decided as the best number of topics by perplexity analysis and the resultant 9 topics for all the papers were extracted using Gibbs sampling method. We could refine 9 topics to 5 topics by deep consideration of meanings of each topics and analysis of intertopic distance map. In topic trends analysis from 2007 to 2017, we could verify 'Health Management' and 'Hospital Service' were two representative topics, and 'Hospital Service' was prevalent topic by 2011, but the ratio of the two topics became to be similar from 2012. Conclusions : We discovered 5 topics were the best number of topics and the topic trends reflected the main issues of KSHSM Journal, such as name revision of the society in 2012.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.9
• /
• pp.907-914
• /
• 2009

An approach to 3D visualization of multiple sound sources has been developed with the application of a moving array technique. Frequency domain beamforming algorithm is used to generate a beam power map and the sound source is modeled as a point source. When a conventional delay and sum beamformer is used, it is considered that 2D distribution of sensors leads to have deficiency in spatial resolution along a measurement distance. The goal of moving an array in this study is to form 3D array aperture surrounding multiple sound sources so that the improved spatial resolution in a virtual space can be expected. Numerical simulation was made to examine source localization capabilities of various shapes of array. The 3D beam power maps of hemispherical and spherical distribution are found to have very sharp resolution. For experiments, several sound sources were placed in the middle of defined virtual space and arc-shaped line array was rotated around the sources. It is observed that spherical array shows the most accurate determination of multiple sources' positions.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.82.1-82.1
• /
• 2010

We have investigated the spatial configuration of stars within the tidal radius of metal poor globular cluster NGC 6626 in the bulge direction. Data were obtained in near-IR J,H,Ks bands with wide-field ($20'\times20'$) detector, WIRCam at CFHT. To trace the stellar density around target cluster, we sorted cluster's member stars by using a mask filtering algorithm and weighting the stars on the color-magnitude diagram. From the weighted surface density map, we found that the stellar spatial distributions within the tidal radius appear asymmetric and distorted features. Especially, we found that more prominent over-density features are extending toward the direction of Galactic plane rather than toward the directions of the Galactic center and its orbital motion. This orientation of the stellar density distribution can be interpreted with result of disk-shock effect of the Galaxy that the cluster had been experienced. Indeed, this over-density feature are well represented in the radial surface density profile for different angular sections. As one of the metal poor globular clusters with extended horizontal branch (EHB) in the bulge direction, NGC 6626 is kinematically decoupled from the normal clusters and known to have disk motion of peculiar motion. Thus, our result will be able to add further constraints to understand the origin of this cluster and the formation of bulge region in early universe.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.38-38
• /
• 2001

본 논문에서는 웨이브릿 영역에서의 영역 분류와 대역간 예측 및 선택적 벡터 양자화를 이용한 다분광 화상테이타 압축 기법을 제안하였다. 이 방법에서는 각 대역을 웨이브릿 변환 후, 각 대역의 기저밴드의 대역별 특성을 이용하여 영역 분류를 행하였다. 그리고, 다른 대역과 해상도가 동일하고 공간적 분산이 작으며 분광적 상관성이 큰 기준대역 (reference channel)을 결정한 뒤, 이를 영역별 스칼라 및 분류별 가변 벡터 양자화를 행하여 부호화 하였다. 또한 기준대역과의 대역간 상관성이 큰 대역들에 대해서는 영역별 대역간 예측을 행한 후, 활동도가 높은 블록에 대해서만 선택적 벡터 양자화로 부호화를 행하였다. 이때, 활동도가 높은 블록들의 위치정보는 기준대역으로부터 얻어지는 임계치 지도 (threshold map; THMAP)를 이용하였다. 즉, 제안한 방법에서는 각 대역에 대해 웨이브릿 영역에서의 영역 분류 후 영역별 대역간 예측을 행함으로써 다분광 화상데이타에 존재하는 대역간 중복성을 제거하고 선택적 벡터 양자화를 행함으로써 대역내 중복성을 효과적으로 제거하여 압축효율을 향상시킨다. 실제 원격 센싱된 인공위성 화상데이타에 대한 실험을 통하여 제안한 기법의 부호화 효율이 기존의 기법에 비하여 우수함을 확인하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.12
• /
• pp.46-54
• /
• 2015

SAR is a Radar to obtain the video information using a radio wave. Platform emit the radio wave, depending backscattered waves returned from the target object the signal to the distance, to create a topographical map is recorded in two-dimensional image. In this paper, through a simulation to apply a variety of window in the SAR image processing for SAR image recovery is to study the application effect of the window, as a result, at the side of the signal of the SNR, Flattop window to improve the best performance it was confirmed to show.

• Proceedings of the KIEE Conference
• /
• 2005.11a
• /
• pp.9-11
• /
• 2005

본 연구는 GIS 진단신뢰성 향상기술 개발을 목적으로, 16개의 인위적 결함을 이용하여 부분방전 신호를 발생시키고 검출하여 그 패턴인식 확률을 높이기 위하여 신경망에 Genetic Algorithm (GA) 을 적용하였다. 이를 위하여 다음과 같은 5가지 서로 다른 신경망 모델을 선택하였다: Back Propagation (BP), Jordan-Elman Network (JEN), Principal Component Analysis (PCA), Self-Organizing Feature Map (SOFM) 및 Support Vector Machine (SVM). 이와 같이 선택된 모델에 동일한 데이터를 학습 시키고 패턴인식 확률을 비교 및 분석하였다. 실험 결과에 의하면, BP의 인식률이 가장 높고 다음으로 JEN의 인식률이 높이 나타났으며, 후자의 경우 모든 결함에 대하여 정확한 패턴분류를 한 반면에 전자의 경우 1.8% 의 분류 오차가 발생하였다. 따라서 인식률이 높은 신경망이 더 정확한 패턴분류를 보장하지 못한다는 실험적 결과를 고려 할 때, 인식률이 높은 두 개의 모델을 선정하여 각각의 출력에 일정한 가중치를 주고 합산하여 새로운 출력을 얻는 방법을 제안한다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.1
• /
• pp.32-41
• /
• 2010

DEA(Data Envelopment Analysis) is the relative efficiency measure among homogeneous DMU(Decision- Making Units) which can be used to useful tool to improve performance through efficiency evaluation and benchmarking. However, the general case of DEA was considered as unrealistic since it consists a benchmarking regardless of DMU characteristic by input and output elements and the high efficiency gap in benchmarking for inefficient DMU. To solve this problem, stratification method for benchmarking was suggested, but simply presented benchmarking path in repeatedly applying level. In this paper, we suggest a new method that inefficient DMU can choice the optimal path to benchmark the most efficient DMU base on the similarity among the input elements. For this, we propose a route choice method that combined a stratification benchmarking algorithm and SOM (Self-Organizing Map). An implementation on real environment is also presented.