• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1573-1576
• /
• 2005

인터넷의 발전과 함께 유해사이트의 급속한 증가로 유해사이트 분류의 신뢰도를 높일 필요성이 높아지고 있다. 기존의 유해사이트 분류방식에는 텍스트 기반의 분류방식과 Skin-Color Detection 알고리즘을 이용한 이미지 기반 방식이 있으며, 현재 텍스트 기반의 사이트 분류방식이 보편적으로 사용되고 있다. 본 논문은 기존 유해사이트 분류의 신뢰도를 높이기 위하여 유해사이트에 포함된 링크 정보를 기반으로 유해사이트 분류의 정확성을 검증할 수 있음을 증명하였다.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.56-66
• /
• 2008

Contention-based forwarding in wireless ad-hoc networks reduces transmission failure rate by selecting one receiver with good channel among multiple receivers. However, contention-based forwarding may increase transmission latency due to the collision problem caused by the simultaneous transmission among multiple receivers. In this paper, we present an analytic model that reflects the delay and collision rate of contention-based forwarding in lossy wireless links. Through the analytic model, we calculate the expected delay and progress in one-hop transmission under given wireless link model and delay model. Based on the analytic results, we observe that delay model should be adapted to wireless link model for optimal performance in contention-based forwarding.

• The Journal of the Convergence on Culture Technology
• /
• v.5 no.2
• /
• pp.381-388
• /
• 2019

In this paper, we propose a new wireless transport network, which is named as Mobile Xhaul Network(MXN), that is enable to bring cost efficiency of fronthaul, midhaul and backhaul and to make easy installation of 5G Radio Access Network(RAN). For this purpose, we design XDU discovery and xhaul link setup mechanism with MXN architecture and operational procedure. Especially, in this paper, we propose various types of beam discovery mechanisms for mmWave based radio access on XDU and evaluate proposed schemes. The Simulation result shows that threshold based scheme and information based scheme have less than about 50% beam discovery latency compared to full search scheme.

• Journal of Korean Society of Transportation
• /
• v.31 no.3
• /
• pp.45-54
• /
• 2013

Korea Expressway Corporation has been utilizing vehicles equipped with dedicated short range communication (DSRC) based on-board equipment (OBE) for collecting path travel times. A path based method (PBM) estimates the path travel time using probe vehicles traveling whole links on the path, so it is not always possible to obtain sufficient samples for calculating path travel time in the DSRC system. Having this problem in utilizing DSRC for travel time information, this study attempted to estimate path travel time with the help of a link based method (LBM) and examined whether the LBM can be used for obtaining reliable path travel times. Some comparisons were made and identified that the MAPE difference between the LBM and the PBM estimates are less than 3%, signaling that LBM can be used as a proxy for PBM in case of sparse sample conditions. Some limitations and a future research agenda have also been proposed.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.2
• /
• pp.35-42
• /
• 2010

DFT spread OFDM은 OFDM 방식의 주요한 장점을 보유하면서 낮은 cubic metric 특성을 가지는 전송 방식이다. 이러한 특성으로 인해 DFT spread OFDM은 3GPP LTE 시스템의 상향 링크 기본 전송 방식으로 채택되었으며, 3GPP LTE-Advanced 시스템에서도 이의 확장된 형태의 전송 기술이 기반이 되어 표준화가 진행되고 있다. 또한 LTE-Advanced 상향 링크에서는 성능 향상을 위해 MIMO 전송을 지원하는데, MIMO 전송에 있어서도 DFT spread OFDM의 낮은 cubic metric 특성을 유지하기 위해, 하향 링크 MIMO 방식과는 다소 다른 형태로 표준이 진행되고 있다. 본 고에서는 이러한 관점에서 3GPP LTE 시스템의 상향 링크 전송 기술인 DFT spread OFDM 기술을 소개하고, LTE-Advanced 시스템의 상향 링크 표준화 동향을 소개한다.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.708-714
• /
• 2006

The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.58-68
• /
• 2010

In this paper, we propose an efficient link protection switching scheme for provider backbone bridge systems with a spanning tree for backup links exclusively, and evaluate its performance. The proposed scheme offers guaranteed QoS flows even when a link fault occurrs in the primary link by flooding the flows over the profiled spanning tree. The flooding mechanism over the spanning tree can also provide low latency and remove the loopback flows. We also derive the efficiency of bandwidth usage for the normal flows and the number of lost frames during the link restoration. For evaluating its feasibility, we implement a prototype of PBB-TE systems based on the Linux bridge codes, which can support both link protection switching capability with CCM and MAC-in-MAC encapsulation. A related protocol analyzer is also developed. One can see that the proposed scheme and the prototype can be useful for developing carrier class Ethernet systems based on PBB-TE.

• KIISE Transactions on Computing Practices
• /
• v.22 no.5
• /
• pp.235-239
• /
• 2016

'Commit-bug link', the link between commit history and bug reports, is used for software maintenance and defect prediction in bug tracking systems. Previous studies have shown that the links are automatically detected based on text similarity, time interval, and keyword. Existing approaches depend on the quality of commit history and could thus miss several links. In this paper, we proposed a technique to link commit and bug report using not only messages of commit history, but also the similarity of files in the commit history coupled with bug reports. The experimental results demonstrated the applicability of the suggested approach.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.749-750
• /
• 2020

링크 예측은 주어진 그래프에서 가까운 미래에 발생할 가능성이 높은 새로운 링크를 예측하는 문제이다. 본 논문에서는 유사도 기반 링크 예측의 정확도를 향상시키는 전처리 기법을 제안한다. 제안하는 기법은 유사도 기반으로 예측한 링크들을 그래프에 추가하고, 이 추가된 링크들을 포함하는 그래프를 기반으로 다시 새로운 링크들을 예측하여 추가하는 점진적 추가 방식을 채택한다. 실세계 데이터를 이용한 실험을 통하여, 제안하는 전처리 기법이 기존 링크 예측의 정확도를 향상시킬 수 있는 것을 확인하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.273-277
• /
• 1998

인터넷의 발전으로 많은 웹 기반 정보 검색 시스템의 구축은 사용자들에게 다양한 정보를 제공하고 있으나, 방대한 정보의 양을 사용자들은 효율적으로 이용하지 못하고 있다. 그러므로 본 논문에서는 웹 기반 정보 검색 시스템에서 의미에 따른 문서 검색 기법을 제공하기 위해 의미 링크에 대해 알아보고, 의미 링크를 이용한 웹 기반 정보 검색 시스템인 불교 문화재 답사시스템을 웹과 데이터베이스 연동 방식에 따라 분류하여 구현해 본다. 앞으로의 연구 방향은 일반적인 정보 검색 시스템에서 로봇을 통하여 데이터들의 의미를 파악함으로써 의미에 따른 검색 기법을 제공하는 것이다.