• 한국지능시스템학회논문지
• /
• 제9권4호
• /
• pp.444-450
• /
• 1999

본 논문에서는 칼라로 입력된 문서 영상에서 문자 영역추출을 위하여 k-means을 이용한 클러스트링 알고리즘을 제안하였다. 칼라 영상의 클러스트링을 위해서 HIS 좌표계에 적합한 거리함수를 제안하였다. 이를 인식하기 위한 전처리 단계인 문자분리(segmentation)방법은 연결 화소를 이용한 개별문자 추출 알고리즘을 제안하였다. 본 알고리즘 에서는 문자분리방벙에서 접촉문자 (touching character)또는 겹친 문자(overlapped character)등과 같이 분리가 곤란한 문자를 개별문자로 분리하는 방법이다. 기존의 문자 분리방법에서는 투영(projection)dop 의한 방법과 외곽선(edge)추적에 의한 방법등을 사용하여 왔으나 제안된 방법은 문자열 추출후 한번의 투영으로 연결화소를 이용하여 개별문자를 추출한다. 문자 영역과 비 문자 영역을 구분하여 개발문자 추출을 한 결과 단순한 이진 영상이 아닌 칼라 영상에서의 문서 처리가 큰 의의가 있고 기존의 문서 처리기 보다 향상된 알고리즘인 것을 확인하였다.

• 천문학회지
• /
• 제53권2호
• /
• pp.43-48
• /
• 2020

We report an analysis of two poorly studied eclipsing binary stars, GSC 04396-00605 and GSC 04395-00485 (recently named V455 Dra and V454 Dra, respectively). Photometric data of the two stars were obtained using the 1-m Korean telescope of the LOAO operated by KASI while monitoring the cataclysmic variable DO Dra in the frame of the Inter-Longitude Astronomy (ILA) project. We derived periods of 0.434914 and 0.376833 days as well as initial epochs JD 2456480.04281 and JD 2456479.0523, respectively, more accurate than previously published values by factors 9 and 6. The phenomenological characteristics of the mean light curves were determined using the New Algol Variable (NAV) algorithm. The individual times of maxima/minima (ToM) were determined using the newly developed software MAVKA, which outputs accurate parameters using "asymptotic parabola" approximations. The light curves were approximated using phenomenological and physical models. In the NAV algorithm, the phenomenological parameters are well determined. We derived physical parameters using the Wilson-Devinney model. In this model, the best-fit parameters are highly correlated, thus some of them were fixed to reasonable values. For both systems, we find evidence for the presence of a cool spot and estimate its parameters. Both systems can be classified as overcontact binaries of EW type.

• Journal of Advanced Marine Engineering and Technology
• /
• 제3권1호
• /
• pp.19-31
• /
• 1979

Recently the adaptive control system, which keeps the control system always optimal by adjusting the control parameters automatically according to the variations of the plant parameters, have become very important in the field of control engineering. The adaptive control systems are usally composed of the plant identification, the decision of the optimal control parameters, and the adjustment of the control parameters. This paper deals with a method of the adaptive control system when PI or PID controller is used in the feed back control system. Its controlled object (the plant) is assumed to be described by the transfer function of $\frac{ke^{-LS}}{1+TS}$ where k, T and L are steady state gain, time constant and pure dead time respectively, and their values are variable in accordance with the change of environmental circumstance. It has been known that a pseudo-random binary signal is quite effective for the measurement of an impulse response of a plant. In adaptive control systems, however, the impulse response itself is not appropriate to determine the control parameters. In this paper, the authors propose a method to estimate directly the parameters of the plant k, T and L by means of the correlation technique using 3 level M-sequence signal as a test signal. The authors also propose a method to determine the optimal parameters of the PI or PID controller in the sense of minimizing the square integral of the control error in the feed back control system, and the values of the optimal parameters are computed numerically for various values of T and L, and the results are examined and compared with those of the conventional methods. Finally the above-mentioned two methods are combined and an algorithm to struct an adaptive control system is suggested. The experiments for the indicial responses by means of both the model of the temperature control system using SCR actuater and the analog simulations have shown good results as expected, and the effectiveness of the proposed method is verified. The M-sequence generator and the time delay circuit, which are manufactured for the experiments, are operated in quite a good condition.

• 한국지능시스템학회논문지
• /
• 제26권5호
• /
• pp.361-367
• /
• 2016

기존 디지털 출력 방식의 PIR 센서를 이용한 침입감지 시스템은 사람이 아닌 다른 물체에 대한 침입 탐지 오류가 많았다. 본 논문은 이를 극복하기 위하여 아날로그 출력 방식의 PIR 센서 기반 침입 감지 시스템을 제안한다. 아날로그 방식 PIR 센서는 임계값을 기준으로 이진 출력값 대신, 일정 범위 내의 다양한 전압 준위로 출력값을 내보낸다. 아날로그 PIR 센서를 이용하여 획득된 신호의 샘플링된 신호값으로부터 FFT(Fast Fourier Transform) 또는 MFCC(Mel-frequency cepstrum codfficents)을 이용하여 신호의 주파수 성분을 추출하여, 인공 신경회로망(Artificial Neural Network)의 특징벡터로 사용된다. 다양한 인간의 움직임과 애완동물의 움직임에 대한 신호 패턴들을 학습한 인공 신경회로망을 통해서 침입상황에서 침입한 객체가 사람인지 애완동물인지 판별하게 된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1098-1115
• /
• 2010

An inseparable challenge associated with every random access network is the design of an efficient Collision Resolution Algorithm (CRA), since collisions cannot be completely avoided in such network. To maximize the collision resolution efficiency of a popular CRA, namely Binary Exponential Backoff (BEB), we propose a reactive backoff algorithm. The proposed backoff algorithm is reactive in the sense that it updates the contention window based on the previously selected backoff value in the failed contention stage to avoid a typical type of collision, referred as cross-collision. Cross-collision would occur if the contention slot pointed by the currently selected backoff value appeared to be present in the overlapped portion of the adjacent (the previous and the current) windows. The proposed reactive algorithm contributes to significant performance improvements in the network since it offers a supplementary feature of Cross Collision Exclusion (XCE) and also retains the legacy collision mitigation features. We formulate a Markovian model to emulate the characteristics of the proposed algorithm. Based on the solution of the model, we then estimate the throughput and delay performances of WLAN following the signaling mechanisms of the Distributed Coordination Function (DCF) considering IEEE 802.11b system parameters. We validate the accuracy of the analytical performance estimation framework by comparing the analytically obtained results with the results that we obtain from the simulation experiments performed in ns-2. Through the rigorous analysis, based on the validated model, we show that the proposed reactive cross collision exclusionary backoff algorithm significantly enhances the throughput and reduces the average packet delay in the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5642-5670
• /
• 2017

Antivirus is an important issue to the security of virtual machine (VM). According to where the antivirus system resides, the existing approaches can be categorized into three classes: internal approach, external approach and hybrid approach. However, for the internal approach, it is susceptible to attacks and may cause antivirus storm and rollback vulnerability problems. On the other hand, for the external approach, the antivirus systems built upon virtual machine introspection (VMI) technology cannot find and prohibit viruses promptly. Although the hybrid approach performs virus scanning out of the virtual machine, it is still vulnerable to attacks since it completely depends on the agent and hooks to deliver events in the guest operating system. To solve the aforementioned problems, based on in-memory signature scanning, we propose an agentless runtime antivirus system VirtAV, which scans each piece of binary codes to execute in guest VMs on the VMM side to detect and prevent viruses. As an external approach, VirtAV does not rely on any hooks or agents in the guest OS, and exposes no attack surface to the outside world, so it guarantees the security of itself to the greatest extent. In addition, it solves the antivirus storm problem and the rollback vulnerability problem in virtualization environment. We implemented a prototype based on Qemu/KVM hypervisor and ClamAV antivirus engine. Experimental results demonstrate that VirtAV is able to detect both user-level and kernel-level virus programs inside Windows and Linux guest, no matter whether they are packed or not. From the performance aspect, the overhead of VirtAV on guest performance is acceptable. Especially, VirtAV has little impact on the performance of common desktop applications, such as video playing, web browsing and Microsoft Office series.

• 한국산업정보학회논문지
• /
• 제19권6호
• /
• pp.33-41
• /
• 2014

본 논문에서는 QCA(quantum-dot cellular automata) 클록킹(clocking) 방식의 D 플립 플롭의 구조를 제안하고, 이를 이용하여 프로그램 가능한 양자점 셀(programmable quantum-dot cell: QPCA) 구조를 설계한다. 기존의 QCA 상에서 제안된 D 플립플롭은 클록 펄스의 신호로 동작을 수행하기 때문에 이에 대한 입력 값을 임의로 설정해야 하고, QCA 클록킹과 중복되어 사용하기 때문에 낭비되는 출력 값들이 존재했다. 이러한 단점을 개선하기 위해서 이진 배선과 클록킹 기법을 이용하여 새로운 형태의 D 플립플롭을 제안하고, 이를 이용하여 QPCA 구조를 설계한다. 이 구조는 입력을 제어하는 배선 제어 회로, 규칙 제어 회로, D 플립플롭, 그리고 XOR 논리 게이트로 구성된다. 설계된 QPCA 구조는 QCADesigner를 이용하여 시뮬레이션을 수행하고, 그 결과를 기존의 D 플립플롭을 이용하여 설계한 것과 비교 분석하여 효율성을 확인한다.

• 한국산업정보학회논문지
• /
• 제24권6호
• /
• pp.55-65
• /
• 2019

4차 산업혁명의 도래와 교육 환경의 변화에 따라 대학 수업에서 팀 단위의 과제 수행이 증가하고 있다. 팀 기반의 수업에서 효과적인 팀의 편성은 학생들의 만족도와 교육의 효과에 영향을 미치는 중요한 문제이지만, 기존의 연구들은 팀 편성의 결과에 대한 사후분석에 중점을 두고 있어서 실제 수업에서 활용하기는 어려웠다. 본 연구에서는 학생들의 능력을 비롯한 여러 특성들을 반영하여 균형적인 팀을 편성하는 방법에 대한 수리적 모형을 제시하였다. 배정의 기준이 되는 특성값들은 학생들의 능력값 처럼 점수일 수도 있고, 성별과 같이 2진값, 그리고 학년이나 학과와 같이 다중값인 경우를 포함한다. 이 문제는 균형배분문제의 일종으로 0-1 정수계획법의 형태를 가지며, 목적함수는 균형을 달성하는 방법에 따라 선형 또는 비선형이 된다. 본 연구에서 제시한 기본 모형이나 확장된 모형은 실제 수업에서 다양한 요소들을 고려하여 팀을 균형 있게 편성하는 상황에 응용이 가능하다.

• Korean Chemical Engineering Research
• /
• 제53권2호
• /
• pp.193-198
• /
• 2015

Polycaprolactone, Dichloromethane, 이산화탄소로 구성된 3성분계 고압 시스템의 상거동 측정 실험은 가변 부피 셀 장치를 이용해서 측정했다. 실험의 온도범위는 313.15 K에서 353.15 K, 압력은 약 300 bar까지 측정했으며 실험결과는 Polycaprolactone의 질량 분율이 1.0%, 2.0%, 3.0%일 때 온도와 이산화탄소/Dichloromethane의 질량 분율로 정리했다. 또한 실험 결과는 hybrid 상태방정식 (Peng-Robinson 상태방정식과 SAFT 상태방정식의 혼합형태) 을 이용하여 열역학적으로 검증하였으며, 혼합규칙은 반데르 발스의 단일 유체 혼합규칙을 사용했다. 이 다성분계 시스템에서 이원 상호 작용 파라미터 등, 각종 파라미터는 심플렉스 알고리즘을 통해 최적화했다.

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.602-611
• /
• 2011

The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.