• The Transactions of the Korean Institute of Power Electronics
• /
• v.11 no.4
• /
• pp.307-312
• /
• 2006

This paper proposes the SRM drive system, which accurately estimates the phase currents from the DC-link current to drive SRM instead of detecting the three-phase currents. In addition, the detecting circuit of DC-link current is also proposed to increase the resolution and decrease the off-set influence. Comparing with the general drive system based on the phase current, it is verified through the experiments that the proposed SRM drive system based on the DC-link current has the good performance in steady-state response of the speed control. Using the DC-link current, all of the 3-phase currents can be easily estimated for driving the SRM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.467-476
• /
• 2003

In this paper, we propose an efficient MAC scheduling algorithm for supporting Bluetooth scatternet operations. Our proposed algorithm improves overall performances of scatter mode［2, 3] and considers QoS requirements of each link of the bridge node of a scatternet. Scatter mode is based on time division scheduling and provides every links of a scatternet with fair service opportunities. However, since each Bluetooth devices has various traffic characteristics. fair allocation of service opportunities is not efficient and may cause extravagance of wireless resources. Therefore, we propose a new efficient inter-piconet scheduling algorithm compliant with the current Bluetooth specification［1］, and demonstrate its improved performances via computer simulations.

• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.51-56
• /
• 2008

A combination of VPNs and dial-up access, such as DSL and Cable, usually provides the cost-effective solution as the substitution of private networks on high-cost leased line. The business demand for high availability has increased with VPN spreading. This paper presents the schemes for a high availability of network access and a load balancing of network traffic in VPN gateways by using multiple links or multihoming capability based on active-active approach. The high availability and load balancing of network links can be achieved by duplicating external network access into multiple independent links. This can provide a continuous network connection to internal users even if one of the links is failed. Moreover, it can provide twice network bandwidth by distributing the traffic into the links. Static and dynamic algorithms are proposed as the load balancing algorithms.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.3
• /
• pp.59-72
• /
• 2017

As the part of study which handles the measure to use the individual vehicle information of taxi GPS data on signal controls in order to overcome the limitation of Loop detector-based collecting methods of real-time signal control system, this paper conducted series of evaluations and improvements on link travel time, queue vehicle time estimates and traffic condition decision algorithm from the research introduced in 2016. considering the control group and the other, the link travel time has enhanced the travel time and the length of queue vehicle has enhanced the estimated model taking account of the traffic situation. It is analyzed that the accuracy of the average link travel time and the length of queue vehicle are respectably both approximately 95 % and 85%. The traffic condition decision algorithm reflected the improved travel speed and vehicle length. Smoothing was performed to determine the trend of the traffic situation and reduce the fluctuation of the data, and the algorithms have refined so as to reflect the pass period on overflow judgment criterion.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.8
• /
• pp.74-84
• /
• 2010

In this paper, we propose a preference-based shortest path algorithm which is combined with Ant Colony Optimization (ACO) and A* heuristic algorithm. In recent years, with the development of ITS (Intelligent Transportation Systems), there has been a resurgence of interest in a shortest path search algorithm for use in car navigation systems. Most of the shortest path search algorithms such as Dijkstra and A* aim at finding the distance or time shortest paths. However, the shortest path is not always an optimum path for the drivers who prefer choosing a less short, but more reliable or flexible path. For this reason, we propose a preference-based shortest path search algorithm which uses the properties of the links of the map. The preferences of the links are specified by the user of the car navigation system. The proposed algorithm was implemented in C and experiments were performed upon the map that includes 64 nodes with 118 links. The experimental results show that the proposed algorithm is suitable to find preference-based shortest paths as well as distance shortest paths.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.14-28
• /
• 2009

The PageRank algorithm is an important component for ranking Web pages in Google and other search engines. While many improvements for the original PageRank algorithm have been proposed, it is unclear which variations (and their combinations) provide the "best" ranked results. In this paper, we evaluate the ranking quality of the well-known variations of the original PageRank algorithm and their combinations. In order to do this, we first classify the variations into link-based approaches, which exploit the link structure of the Web, and knowledge-based approaches, which exploit the semantics of the Web. We then propose algorithms that combine the ranking algorithms in these two approaches and implement both the variations and their combinations. For our evaluation, we perform extensive experiments using a real data set of one million Web pages. Through the experiments, we find the algorithms that provide the best ranked results from either the variations or their combinations.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.39-47
• /
• 2018

The Dial Algorithm, based on single link based calculation, is unable to reflect cyclic paths arising in actual urban transportation networks. At the same time, redefining the paths more efficiently can, by strict standards, lead to irrational results stemming from reduction in the size of the network to be analyzed. To solve these two problems of the Dial algorithm, the research herein proposes a vine network method applied to a link based Dial Algorithm, in which the original three step alogrithm is modified into a vine network-based three step process. Also, an analysis of two case study networks show feasible replication of the predicted cyclic path, unrealistic flow, and unsteady transit, as well as alleviation of the problem of irrational path allocation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1283-1286
• /
• 2006

본 논문에서는 관찰된 채널의 유휴 시간을 이용하여, ACK(Acknowledgement) 기반의 링크 적응 기술의 단점을 극복하는 새로운 알고리즘인 COLA 를 제안한다. COLA 는 광범위한 채널과 부하 상황에서 최적의 성능을 얻으며 RTS/CTS 메커니즘이나 하드웨어를 이용한 채널 SNR 측정과 같은 추가적인 옵션 혹은 별도의 프로토콜 메커니즘의 지원이 필요하지 않다. 또한 COLA 알고리즘은 단지 짧은 10 개의 critical 한 명령어를 사용함으로써 부하를 줄이며, 실제 동작 시 수반되는 heuristic 한 매개변수로부터 자유롭고, 따라서 실제 사용 시 장점을 가진다.

• Journal of the Korean Society for information Management
• /
• v.39 no.2
• /
• pp.233-254
• /
• 2022

Link reduction algorithms such as pathfinder network are the widely used methods to overcome problems with the visualization of weighted networks for knowledge domain analysis. This study proposed NetRSQ, an indicator to measure the goodness of fit of a link reduction algorithm for the network visualization. NetRSQ is developed to calculate the fitness of a network based on the rank correlation between the path length and the degree of association between entities. The validity of NetRSQ was investigated with data from previous research which qualitatively evaluated several network generation algorithms. As the primary test result, the higher degree of NetRSQ appeared in the network with better intellectual structures in the quality evaluation of networks built by various methods. The performance of 4 link reduction algorithms was tested in 40 datasets from various domains and compared with NetRSQ. The test shows that there is no specific link reduction algorithm that performs better over others in all cases. Therefore, the NetRSQ can be a useful tool as a basis of reliability to select the most fitting algorithm for the network visualization of intellectual structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.103-112
• /
• 2010

In this paper, we propose a coarse and fine frequency synchronization method which is suitable for the 3GPP(3rd Generation Partnership Project) LTE(Long Term Evolution) FDD(Frequency Division Duplexing) / TDD(Time Division Duplexing) dual mode system. In general, PSS(Primary Synchronization Signal) correlation based estimation method and CP(Cyclic Prefix) correlation based tracking loop are applied for coarse and fine frequency synchronization in 3GPP LTE OFDMA(Orthogonal Frequency Division Multiple Access) system, respectively. However, the conventional coarse frequency synchronization method has performance degradation caused by fading channel and squaring loss. Also, the conventional fine frequency synchronization method cannot guarantee stable operation in TDD mode because of signal power difference between uplink and downlink subframe. Therefore, in this paper, we propose enhanced coarse and fine frequency synchronization methods which can estimate more accurately in multi-path fading channel and high speed channel environments and has stable operation for TDD frame structure, respectively. By computer simulation, we show that the proposed methods outperform the conventional methods, and verify that the proposed frequency synchronization method can guarantee stable operation in 3GPP LTE FDD/TDD dual mode downlink receiver.