• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.3
• /
• pp.191-195
• /
• 2013

This paper proposes an automatic method for discovering cross-lingual links from English Wikipedia documents to Korean ones in order to increase connectivity among vast web resources. Compared to the existing methods roughly estimating link probability of phrases, candidate anchors are selected from English documents by using various information such as title lists and linking probability extracted from Wikipedia dumps and the results of named-entity recognition, and the anchors are translated into Korean words, and then the most suitable Korean documents with the words are selected as cross-lingual links. The experimental results showed 0.375 of MAP.

• Journal of Korean Society of Transportation
• /
• v.18 no.2
• /
• pp.63-71
• /
• 2000

One Problem of the choice Property in logit model is interpreted as the Problem of common links and common nodes in choice set. Common node Problem Plays important role in deciding the efficiency of network loading and common link problem is connected with choice Problem, both of which are to be solved to improve the logit choice model. Although much need has been pointed out for research on the topic, however, no Paper as yet considers these two factors at the same time. In the Paper we develop a new logit formulation, which is able to ease the logit Problem, widely known as the Problem of IIA(Independence of Irrelevant Alternatives). An example network is used to assess the Proposed model and compare it with other conventional models. From the results, we find out that the model is superior to others.

• Annual Conference on Human and Language Technology
• /
• 2007.10a
• /
• pp.282-289
• /
• 2007

통계를 이용한 품사 태깅에서는 자료부족 문제가 이슈가 된다. 한국어나 터키어와 같은 교착어는 어절(word)이 다수 형태소로 구성되어 있어서 자료부족 문제가 더 심각하다. 이러한 문제를 극복하고자 교착어 문장을 어절 열이 아니라 형태소의 열이라 가정한 연구도 있었으나, 어절 특성이 사라지기 때문에 파생에 의한 어절의 문법 범주 변화 등의 통계정보와 어절 간의 통계정보를 구하기 어렵다. 본 논문은 효율적인 어절 간 전이확률 계산 방법론을 고안함으로써 어절 단위의 정보를 유지하면서도 자료부족문제를 해결할 수 있는 확률 모델을 제안한다. 즉, 한국어의 형태통사적인 특성을 고려하면 앞 어절의 마지막 형태소와 함께 뒤 어절의 처음 혹은 끝 형태소-즉 두 개의 어절 간 전이 링크만으로도 어절 간 전이확률 계산 시 필요한 대부분 정보를 얻을 수 있고, 문맥에 따라 두 링크 중 하나만 필요하다는 관찰을 토대로 규칙을 이용해 두전이링크 중 하나를 선택해 전이확률 계산에 사용하는 '다이내믹 링크 모델'을 제안한다. 형태소 품사 bi-gram만을 사용하는 이 모델은 실험 말뭉치에 대해 96.60%의 정확도를 보인다. 이는 같은 말뭉치에 대해 형태소 품사 tri-gram 등의 더 많은 문맥 정보를 사용하는 다른 모델을 평가했을 때와 대등한 성능이다.

• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.752-758
• /
• 2011

In this paper, we perform a research on a message delivery link based on visible light communication using illumination light-emitting diodes (LEDs) for car-to-car communications and the link transmission success probability is analyzed for the link. The message delivery system is modeled and the signal-to-noise ratio is calculated from the received optical power. Then, the link transmission probability is estimated from the calculated bit error rates (BERs). The message delivery system has optical links from an LED transmitter near the rear lamp of a car ahead to a receiver near the headlamp of a car behind, whose positions are assumed to follow the normal Gaussian distribution. The link transmission success probability is calculated considering the physical characteristics of the optical link. The car positions are generated according to the normal distribution and the bit error rates are calculated for all links. The link transmission success probability is defined. For the unoptimized optical car-to-car message delivery links, it is shown that the link transmission success probability is larger than 0.9 with the transmitted optical power of 400 mW and the semi-angle at half power of 30 degree.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.177-185
• /
• 2002

본 논문의 목적은 링크통행시간 자료를 수집하는 시스템에서 소요 프로브차량대수에 영향을 주는 요소들을 규명하고. 최적의 소요 프로브차량대수를 결정하는 모형을 개발하는데 있다. 자가용승용차, 택시, 버스, 택배차량 등 여러 종류의 차량들이 프로브차량으로 사용될 수 있다. 그러나 일정한 정확도 이상의 교통정보를 수집하기 위해서 얼마나 많은 프로브차량이 필요한지에 대한 연구는 그다지 깊이 있게 이루어지지 않았다. 적정 소요 프로브차량대수는 링크통행시간 자료수집 기술 수집대상 링크의 공간적 범위, 프로브차량의 종류 및 운행 특성, 자료수집 시스템의 신뢰도, 수집되는 자료의 정확도 등에 영향을 받게 된다. 소요 프로브차량대수를 결정하는 링크당 평균 통행시간 자료수, 프로브차량 밀도의 최소 확률, 그리고 자료 미수집링크의 허용비율의 3가지 결정기준이 정의되었다. 또한 이러한 결정기준에 대해 소요 프로브차량대수를 산출하는 모형이 개발되었다. 일반적으로 주기당, 링크당 평균 필요 통행시간 자료수$(d_R)$, 단위길이당 프로브차량의 대수 또는 밀도$(n_{min} or {\alpha})$, 일정 프로브차량밀도 이상의 확률($\beta$), 그리고 자료 미수집링크의 비율($\gamma$)이 클수록 소요 프로브차량대수는 증가한다. 민간 교통정보회사의 통행시간 수집시스템에서 소요 프로브차량대수를 산정하는 사례연구가 수행되었으며, 여러가지 조건에서 소요 프로브차량대수가 산출되었다.

• The Korean Journal of Applied Statistics
• /
• v.14 no.1
• /
• pp.25-37
• /
• 2001

The marginal model is proposed for the analysis of data which have c(2: 3) categories in the 3 x 3 cross-over trials with three periods and three treatments. This model could be used for the counterpart of the Kenward-Jones' joint probability one and should be the generalization of Balagtas et ai's univariate marginal logits one, which analyze the treatment effects in the 3 x 3 cross-over trials with binary response variables[Kenward and Jones(1991), Balagtas et al(1995)]. The model equations for the marginal probability are constructed by the three types of link functions. The methods would be given for making of the link function matrices and model ones, and the estimation of parameters shall be discussed. The proposed model is applied to the analysis of Kenward and Jones' data.

• Journal of Aerospace System Engineering
• /
• v.17 no.5
• /
• pp.63-75
• /
• 2023

The antenna radiation pattern was simulated by arranging the mounted antennae of the transport drone in 5 locations where radio interference was expected to be low, and they could be mounted. Depending on the mounting location, the probability that the link margin was less than 0 dB was (5.41 - 26.92) %. When two antennae were mounted and one was selected, the probability was (0.11 - 3.3) %. Among the arrangements, placing one antenna in the upper part of the front and one in the lower part of the rear showed the lowest link fail probability. In this case, it was analyzed that if the attitude roll and pitch of the aircraft were limited, link fail would not occur at an operating distance of 12 km or less. An antenna selection formula for this case was derived, and a method of reducing frequent alternation of antennae was applied to maintain a stable link.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.2
• /
• pp.89-95
• /
• 2003

This paper proposes downlink blocking model and approximation equation using lower bound approximation in order to determine the proper guard band between cdma2000 1X and WCDMA in handover areas. The frequency sharing conditions obtained by the model and approximation equation on blocking probability proposed in the paper, are co-site of base station and guard band higher than 1 MHz. Also, the proposed equation is in the form of Q-function. It is an analytical solution overcoming the drawback of recalculation, belonged to Monte-Carlo technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.5
• /
• pp.393-400
• /
• 2013

In conventional single-tier networks, downlink based association is the best association scheme for the uplink association because all macro base stations have the same physical specification. However, in uplink heterogeneous cellular networks, a downlink based cell association cannot be the best for uplink any more because of the difference of physical specification between the different base station. In this paper, we will propose a uplink based cell association scheme, and devise performance metric for describing a uplink performance in heterogeneous cellular networks. Then, we will discuss the necessity of the uplink based association by observing outage probability, delay constraint outage probability, delay constraint outage capacity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.169-171
• /
• 2003

웹에서의 검색 방법에는 크게 Text-Based 기법과 Link-Based 기법이 있다. 본 논문은 그 중에서 Link-Based 기법의 하나인 PageRank 알고리즘에 대해 연구 하고자 한다. 이 PageRank 알고리즘은 각 페이지의 중요성을 수치로 계산하는 방법이다. 하지만 이 알고리즘에서는 페이지에서 페이지로 링크를 따라갈 확률의 값을 일정하게 주어서 모든 페이지의 값을 획일적으로 계산하였기 때문에 각 페이지의 검색 효율성에 문제가 있다고 판단하여, 이를 해결하고자 본 논문은 페이지사이의 유사도를 측정하여 유사도에 따라 링크를 따라가는 확률 값인 Damping factor값을 다르게 부여하여 검색의 효율성을 높였다. 이를 위하여 두 가지 방법의 실험을 통하여 구현, 증명하였다.