• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.117-128
• /
• 2006

For the legacy IEEE 802.15.3 WPAN protocol, an unpredictable piconet coordinator(PNC) leaving from a piconet without a proper handoff procedure causes an absence of PNC, and thus the piconet gets collapsed. In addition, several beacons from PNCs in adjacent piconets may be collided on a device(DEV) located between those piconets. This beacon collision eventually makes the DEV leave from the piconet. To remedy these two problems, we here propose an Active Seamless Coordinator Switching(ASCS) scheme and a PNC HB based Beacon Alignment(PHBA) one. In the ASCS scheme, a PNC assigns a number of DEVs as next possible PNCs in sequence for provisioning against the abrupt breakdown of the current active PNC. Each nominated DEV proactively sends a probe frame to confirm the operation status of the active PNC. For the case of no response from the PNC, the nominated DEV tries to become a new PNC immediately. In the second PHBA scheme, each PNC is allow to broadcast a special Heart Beat(HB) frame randomly during a superframe period. When a DEV receives a HB frame from other PNC, it promptly sends the related PNCs a special Hiccup Beat(HCB) frame with the superframe information of its associated PNC. As a result, the HCB frame makes both PNCs align their superframe beginning time in order to yield no more beacon collisions. For these two proposed schemes, we show the performance by simulations. We can confirm the enhancement of throughput for each superframe and average frame transfer delay, since each scheme can reduce the duration of piconet collapse. Finally, it is worth while to note that the proposed schemes can be operated with frames those are permitted in the legacy WPAN standard.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.161-168
• /
• 2014

The optimal solution of minimum cost for aircraft landing problem(ALP) is very difficult problem because the approached aircraft are random time interval. Therefore this problem has been applied by various meta heuristic methods. This paper suggests O(nlog n) polynomial time heuristic algorithm to obtain the optimal solution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then we apply the optimization of change the landing sequence take account of separation time and the cost of landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data until the number of runway m that the total landing cost is 0. We can be obtain the optimal solution for all of the 25 data. Especially we can be improve the known optimal solution for m = 1of Airland8.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.634-641
• /
• 2009

The goal of OSIC-series detection methods is to approach the ML performance with feasible complexity. However, since they sometimes suffer from the empty vector problem, they can not achieve the soft-output ML performance or many candidate vectors are required to achieve the soft-output ML performance. In this paper, we propose the novel detection method, which can generate the reliable soft-outputs without suffering from empty vector problem. The proposed detector can approach the near soft-output ML performance as well as hard-output. Further, the complexity study shows that the proposed detection method has the lowest complexity compared to the other detectors having the near ML performance.

• Journal of Intelligence and Information Systems
• /
• v.9 no.3
• /
• pp.117-135
• /
• 2003

This study is to propose a procedure solving scale problem of traditional collaborative filtering (CF) approach. The CF approach generally uses some similarity measures like correlation coefficient. So, as the user of the Website increases, the complexity of computation increases exponentially. To solve the scale problem, this study suggests a clustering model-based approach using Self-Organizing Map (SOM) and RFM (Recency, Frequency, Momentary) method. SOM clusters users into some user groups. The preference score of each item in a group is computed using RFM method. The items are sorted and stored in their preference score order. If an active user logins in the system, SOM determines a user group according to the user's characteristics. And the system recommends items to the user using the stored information for the group. If the user evaluates the recommended items, the system determines whether it will be updated or not. Experimental results applied to MovieLens dataset show that the proposed method outperforms than the traditional CF method comparatively in the recommendation performance and the computation complexity.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.5
• /
• pp.437-444
• /
• 2010

This paper deals with the attitude control of an underactuated spacecraft that has one single-gimbal variable-speed CMG. An underactuated spacecraft may not converge to arbitrary attitudes if its total angular momentum is not zero. To stabilize a spacecraft, the CMG has to align with the angular momentum in the inertial frame. Four different install configurations for the CMG have been considered and controllable angular momentums have been analyzed. Also, based on the backstepping method, stabilizing control laws have been presented and their properties have been compared.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.942-950
• /
• 1998

Extraction of knowledge, especially in the form of rules, from raw data is very important in data mining, the aim of which is to help users who feel the lack of knowledge in spite of the abundance of data. Logic minimization tools are ones which derive optimized knowledge given ON set and DC set. First, the parallel expansion scheme of logic minimization is extracted and used to obtain intial knowledge to get final rules, which are successfully applicable to real world data. The prototype system based on this new approach has been experimented with real world data to show that it is as practical as conventional long studied decision tree methods like C4.5 system.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.38 no.6
• /
• pp.513-523
• /
• 2014

A fluid transport technique is a key issue for the development of microfluidic systems. In this study, the movement of a droplet on horizontal hydrophilic/hydrophobic surfaces, which is a new concept to transport droplets without external power sources that was recently proposed by the author, was simulated using an in-house solution code(PowerCFD). This code employs an unstructured cell-centered method based on a conservative pressure-based finite-volume method with interface capturing method(CICSAM) in a volume of fluid(VOF) scheme for phase interface capturing. The droplet transport mechanism is examined through numerical results that include velocity vectors, pressure contours, and total kinetic energy inside and around the droplet.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.924-927
• /
• 2017

통계 모형에 기반을 둔 구문분석기는 자료 부족 문제에 취약하거나 장거리 의존관계와 같은 특정 언어현상에 대한 처리가 어렵다는 단점이 있다. 이러한 한계점을 극복하고자 본 연구진은 규칙에 기반을 둔 한국어 구문분석기를 개발하고 있다. 다른 구문 분석기와 다르게 형태소 단위 구문분석을 시도하며 생성 가능한 모든 구문분석 후보를 보여주는 것이 특징이다. 본 연구진의 기존 연구에서 개발한 한국어 구문분석기는 형태소의 입력순서와 구문분석 후보의 생성 순서에 의존하여 구문분석 후보를 순서화하였다. 그러나 생성되는 구문분석 후보 중 가장 정답에 가까운 구문분석 후보의 순위를 낮추기 위해서는 각 구문분석 트리가 특정한 점수를 가질 필요가 있다. 본 논문에서는 품사 태거(tagger)에서 출력하는 어절별 형태소의 순위에 따른 가중치, 수식 거리에 따른 가중치, 특정한 지배-의존 관계에 대한 가중치를 이용해 가중치 합을 가지는 구문분석 후보를 구성하고 이를 정렬하여 이전 연구보다 향상된 성능을 가진 한국어 구문분석기 모델을 제안한다. 실험은 본 연구진이 직접 구축한 평가데이터를 기반으로 진행하였으며 기존의 Unlabeled Attachment Score(UAS) 87.86%에서 제안 모델의 UAS 93.34%로 약 5.48의 성능향상을 확인할 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.73-80
• /
• 2004

In this paper, we propose a medical image processing method for detection of periodontal disease. The proposed method is the method of an automatic image alignment and detection of minute changes, to overcome defects in the conventional subtraction radiography by digital image processing technique, that is necessary for getting subtraction image and ROI(Region of Interest) focused on a selection method using the structured features in target images. And the method services accuracy, consistency and objective information or data to results. In result, easily and visually we can identify minute differences in the affected parts whether they have problems or not, and using application system.