• Proceedings of the KIPE Conference
• /
• 2013.07a
• /
• pp.173-174
• /
• 2013

전기장만으로 에너지를 전송하는 전계결합형 비접촉 충전기술은 송수신부를 매개하는 AC링크를 구성하는 전극쌍의 정전용량확보에 한계가 있으므로, 이를 잘 활용하기 위한 송수신회로가 요구된다. 따라서 본 논문에서는 이를 감안하여 전계결합형 에너지전송에 적합한 매칭변압기를 사용한 E급 송수신회로 구조를 제안한다. 제안된 구조에서 AC-링크 캐패시터의 낮은 정전용량을 감안한 최적 설계방식을 제안하고 회로설계에 따른 성능을 모의실험을 통해 예측한다.

• Journal of Korean Society of Transportation
• /
• v.23 no.6 s.84
• /
• pp.91-102
• /
• 2005

When it comes to the process of information storage, people are likely to organize individual information into the forms of groups rather than independent attributes, and put them together in their brains. Likewise, in case of finding the shortest path, this study suggests that a Hierarchical Road Network(HRN) model should be selected to browse the most desirable route, since the HRN model takes the process mentioned above into account. Moreover, most of drivers make a decision to select a route from origin to destination by road hierarchy. It says that the drivers feel difference between the link travel tine which was measured by driving and the theoretical link travel time. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Stochastic Process model uses the historical patterns of travel time conditions on links. The HRN model has compared favorably with the conventional shortest path finding model in tern of calculated speeds. Even more, the result of the shortest path using the HRN model has more similar to the survey results which was conducted to the taxi drivers. Taxi drivers have a strong knowledge of road conditions on the road networks and they are more likely to select a shortest path according to the real common sense.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.794-798
• /
• 2010

Assuming that a wireless link is mostly used at the network edge and the wireless NIC driver keeps monitoring the error rate of its link, this paper proposes an enhanced TCP congestion control, TCP-L (TCP Link-Aware). TCP-L predicts true congestion losses occurred inside the wired link area by utilizing the wireless link error rate. As a result, it mitigates performance degradation caused from TCP congestion control actions when segments losses occur in a wireless link. Experimental results show that TCP-L provides better performance and fairness in lossy wireless links than existing TCP congestion control schemes. Our approach utilizing the characteristic of the link at TCP could be well adapted to new wireless environments such as Cognitive Radio and ACK-less IEEE 802.11, where a frame may be delivered with a very long delay or lost in the link.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.3
• /
• pp.73-78
• /
• 2019

Due to frequent topology changes in wireless networks, inter-node link disconnection and path re-establishment occur, causing problems such as overloading control messages in the network. In this paper, to solve the problems such as link disconnection and control message overload, we perform path setup in three steps of the neighbor node discovery process, the route discovery process, and the route management process in the wireless network environment. The link stability value is calculated using the information of the routing table. Then, when the zone master monitors the calculated link value and becomes less than the threshold value, it predicts the link disconnection and performs the path reset to the corresponding transmitting and receiving node. The proposed scheme shows a performance improvement over the existing OLSR protocol in terms of data throughput, average path setup time, and data throughput depending on the speed of the mobile node as the number of mobile nodes changes.

• Journal of Korean Society of Transportation
• /
• v.16 no.4
• /
• pp.153-166
• /
• 1998

본 연구에서는 도시 가로망에서의 구간 통행시간을 예측하기 위하여 time-frequency 분석의 일종인 웨이브렛변환과 RBF신경망 모형을 이용한 예측모형을 개발하였다. 웨이브렛 변환을 이용한 시계열 자료 분석을 통해서 통행시간에 내재되어 있는 다양한 패턴의 특징을 추출함으로써 오전/오후의 첨두현상, 신호교차로의 현시주기 등 주기적으로 발생되는 요인들에 의해서 통행시간 시계열 자료의 패턴에 나타나는 규칙성을 분석해 내었다. 분석된 패턴정보에 대한 규명은 카오스 이론을 근간으로한 시간지연좌표를 이용하여 시계열 자료의 규칙성을 시각적으로 판별하여 예측모형 구축에 활용하도록 하였다. 또, RBF신경망을 이용하여 예측범위의 공간적/시간적 확대에 따른 모형 구축에 소요되는 시간을 최소화하도록 하였으며, 시내버스 노선의 정류장간 운행시간 예측을 통해서 기존 연구에서 제기되었던 현실세계의 단순화, 다단계 예측시 정확성 등의 문제를 해결하였다. 예측실험결과 웨이브렛 변환을 데이터의 전처리 과정에 삽입하여 링크 통행시간의 패턴정보 예측에 활용할 경우, 기존의 예측모형에 비해서 훨씬 정확한 예측이 가능한 것으로 나타났으며, RBF 신경망은 짧은 학습시간에도 불구하고 역전파 신경망보다 우수한 예측력을 갖고 있는 것으로 밝혀졌다.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.367-372
• /
• 2001

지도제작, 해양생태감시, 기상관측, 및 우주환경감시 등의 분야에 이용되는 저궤도 위성을 관제(위성추적, 원격측정 및 명령)하기 위해 본 논문에서는 최적의 PM 변조지수를 결정하는 방법을 기술하고 수신 데이터의 성능을 평가한다. 이 저궤도 위성인 아리랑 위성은 한국에서는 첫 번째 저궤도 위성이며 1999년 12월 발사되어 현재 임무를 충실히 수행하고 있다. 아리랑 위성 관제시스템의 파라미터에 의해 위성링크를 설계하면, PB 원격측정 신호의 최적 변조지수는 Eb/No마진과 PFD마진의 교차점이 되며 1.92라디안으로 결정된다. 또한 위성의 통과시간에 따라 예측되는 BER은 RT모드에서 최고의 성능을 나타애고, RT+RNG모드에서 최악의 성능을 나타내기 때문에 데이터 전송순서를 위성의 통과시간에 따른 BER 성능 순서인 RT, PB, RT+RNG모드의 순서로 결정함으로써 수신성능을 높일 수 있다.

• Journal of Intelligence and Information Systems
• /
• v.27 no.4
• /
• pp.73-95
• /
• 2021

This study uses Node2vec graph embedding method and Light GBM link prediction to explore undeveloped export candidate countries in Korea's food and beverage industry. Node2vec is the method that improves the limit of the structural equivalence representation of the network, which is known to be relatively weak compared to the existing link prediction method based on the number of common neighbors of the network. Therefore, the method is known to show excellent performance in both community detection and structural equivalence of the network. The vector value obtained by embedding the network in this way operates under the condition of a constant length from an arbitrarily designated starting point node. Therefore, it has the advantage that it is easy to apply the sequence of nodes as an input value to the model for downstream tasks such as Logistic Regression, Support Vector Machine, and Random Forest. Based on these features of the Node2vec graph embedding method, this study applied the above method to the international trade information of the Korean food and beverage industry. Through this, we intend to contribute to creating the effect of extensive margin diversification in Korea in the global value chain relationship of the industry. The optimal predictive model derived from the results of this study recorded a precision of 0.95 and a recall of 0.79, and an F1 score of 0.86, showing excellent performance. This performance was shown to be superior to that of the binary classifier based on Logistic Regression set as the baseline model. In the baseline model, a precision of 0.95 and a recall of 0.73 were recorded, and an F1 score of 0.83 was recorded. In addition, the light GBM-based optimal prediction model derived from this study showed superior performance than the link prediction model of previous studies, which is set as a benchmarking model in this study. The predictive model of the previous study recorded only a recall rate of 0.75, but the proposed model of this study showed better performance which recall rate is 0.79. The difference in the performance of the prediction results between benchmarking model and this study model is due to the model learning strategy. In this study, groups were classified by the trade value scale, and prediction models were trained differently for these groups. Specific methods are (1) a method of randomly masking and learning a model for all trades without setting specific conditions for trade value, (2) arbitrarily masking a part of the trades with an average trade value or higher and using the model method, and (3) a method of arbitrarily masking some of the trades with the top 25% or higher trade value and learning the model. As a result of the experiment, it was confirmed that the performance of the model trained by randomly masking some of the trades with the above-average trade value in this method was the best and appeared stably. It was found that most of the results of potential export candidates for Korea derived through the above model appeared appropriate through additional investigation. Combining the above, this study could suggest the practical utility of the link prediction method applying Node2vec and Light GBM. In addition, useful implications could be derived for weight update strategies that can perform better link prediction while training the model. On the other hand, this study also has policy utility because it is applied to trade transactions that have not been performed much in the research related to link prediction based on graph embedding. The results of this study support a rapid response to changes in the global value chain such as the recent US-China trade conflict or Japan's export regulations, and I think that it has sufficient usefulness as a tool for policy decision-making.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.997-1005
• /
• 2010

Recently, there has been a growing interest in the use of WLAN technology due to its easy deployment, flexibility and so on. Examples of WLAN applications range from standard internet services such as Web access to real-time services with strict latency/throughput requirements such as multimedia video and voice over IP on wireless network environments. Fair and efficient distribution of the traffic loads among APs(Access Points) has become an important issue for improved utilization of WLAN. This paper focuses on an AP selection scheme for achieving better load balance, and hence increasing network resource utilization for each user on wireless network environments. This scheme makes use of active scan patterns and the network delay as main parameters of load measurement and AP selection. This scheme attempts to estimate the AP traffic loads by observing the up/down delay and utilize the results to maximize the link resource efficiency through load balancing. We compared the proposed scheme with the original SNR(Signal to Noise Ratio)-based scheme using the NS-2(Network Simulation.2). We found that the proposed scheme improves the throughput by 12.5% and lower the network up/down link delay by 36.84% and 60.42%, respectively. All in all, the new scheme can significantly increase overall network throughput and reduce up/down delay while providing excellent quality for voice and video services.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8S
• /
• pp.2608-2619
• /
• 2000

This paper proposes the Handover Scheme for the mobile and describes the result of the performance analysis. In the conventional scheme of handover request, the withdrawal of terminal may occur because handover request is performed based on fixed signal level without considering network load and terminal mobility. The proposed scheme offers the minimization of withdrawal and handover blocking probability by means of the handover request of terminal based on the network load and terminal mobility. Conventional handover scheme has the sequential procedure that network performs resource check and path rerouting on the handover by MT(Mobile Terminal). Proposed handover scheme pre-processes the resource check before the handover request by predicting the handover request timo so that handover latency can be reduced. Moreover, path optimization is executed after the completion of handover in order to reduce handover latency. The rdduction of handover latency prevents the dropping of service by minimizing backward handover blocking. In summary, we propose the prediction of handover request time and decision method based on terminal, validating the performance of proposed scheme considering various cases of simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1173-1181
• /
• 2007

A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.