• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.33-36
• /
• 2002

We implemented a robust Korean broadcast news transcription system for out-of-vocabulary (OOV), tested its performance. The occurrence of OOV words in the input speech is inevitable in large vocabulary continuous speech recognition (LVCSR). The known vocabulary will never be complete due to the existence of for instance neologisms, proper names, and compounds in some languages. The fixed vocabulary and language model of LVCSR system directly face with these OOV words. Therefore our Broadcast news recognition system has an offline OOV update module of language model and vocabulary to solve OOV problem and selects morpheme-based recognition unit (so called, pseudo-morpheme) for OOV robustness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2430-2437
• /
• 1999

This paper introduces an adaptive time-based location update scheme that dynamically determines when to perform location update based on moving distance of mobile station and incoming call arrival probability using fuzzy logic. Comparison with other schemes demonstrate that proposed scheme adapts well to the environment where the characteristics of mobility pattern of mobile station is changed all the time, and reveals better performance in the aspect of network signaling load.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.1
• /
• pp.122-128
• /
• 2019

This paper describe the method for maintaining initial azimuth of tactical grade IMU. The proposed method uses the zero velocity update (ZUPT) algorithm based on Kalman filter and the azimuth information previously obtained through transfer alignment. ZUPT technique can estimate and correct navigation attitude errors using the observed velocity error without the need of other sensors. Also, ZUPT combined pre-obtained azimuth information allows to maintain initial azimuth for tactical grade IMU. We verify the performance improvement of the proposed azimuth maintaining method by simulation and test.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.3
• /
• pp.113-121
• /
• 2019

Algorithms for geographical routing and location update attract the researchers' interests in wireless ad hoc networks. Even though many various schemes have been proposed, most of them cause scalability problem in small groups of nodes. To defeat this problem, flooding algorithm is widely utilized due to low complexity. However, there is no previous research work to evaluate flooding algorithm through implementation instead of simulation. In this paper, we present implementation of flooding algorithm on Raspberry Pi and performance evaluation results.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.505-515
• /
• 2004

One of the most important issue in location-aware computing is tracking moving objects efficiently. To this end, an efficient protocol which updates location information in a location server is highly needed. In fact, the performance of a location update strategy highly depends on the assumed mobility pattern. In most existing works, however, the mobility issue has been disregarded and too simplified as linear function of time. In this paper, we propose a new mobility model, called state-based mobility model (SMM) to provide more generalized framework for both describing the mobility and updating location information of complexly moving objects. We also introduce the state-based location update protocol (SLUP) based on this mobility model. Using experimental comparison, we illustrate that the proposed technique is many times better in reducing location update cost and the communication bandwidth consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.57-64
• /
• 2012

The existing protocols proposed in network mobility (NEMO) environment can require many computational costs and can bring about a delay of binding update. To solve these problems, in this paper we propose an authentication protocol supporting secure seamless handover in NEMO environment. The proposed protocol can handle quickly mutual authentication between a mobile router (MR) and an access router (AR), which uses group key among ARs and a master key (MK) issuing from key issuing server (KIS) for reducing the time of binding update as much as possible. In performance, the proposed protocol can process quickly binding update with little computational cost comparison with the existing binding update protocols and it results in robustness against existing attacks.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.395-401
• /
• 2008

In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and link state. The information is stored in Link State Database (LSDB) located in each router and managed. If link states information is changed, routers inform their neighbor of link state information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual link state information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.928-939
• /
• 2008

The grid database management system is used for large data processing, high availability and data integration by grid environment. It has a replica for processing performance and high availability in each node. The grid database has a problem of inconsistency, when the update is occurred with a coincidently frequent. To solve this problem, in this paper proposed a version management method for consistency in the grid database. Proposed version manager manages a version of each replica. The version manager keeps a consistency of update operation when is occurred at each node by using a pending queue and waiting queue. Also the node keeps a consistency using a priority queue. So, proposed method has stable and fast update propagation. The proposed method shows stable and faster update propagation than traditional method by performance evaluation.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.63-72
• /
• 2007

This paper introduces a load-balancing algorithm focusing on distributing web requests evenly into the web cluster servers. The load-balancing algorithms based on conventional periodic load-information update mechanism are not suitable for dynamic page applications, which are common in Cyber Foraging services, due to the problems caused by periodic synchronized load-information updating and the difficulties of work load estimation caused by embedded executing scripts of dynamic pages. Update-on-Finish algorithm solves this problem by using non-periodic load-update mechanism, and the web switch knows the servers' real load information only after their reporting and then distributes new loads according to the new load-information table, however it results in much communication overhead. Our proposed mechanism improve update-on-finish algorithm by using K-Percents-Finish mechanism and thus largely reduce the communication overhead. Furthermore, we consider the different capabilities of servers with a threshold Ti value and propose a load-balancing algorithm for servers with various capabilities. Simulation results show that the proposed K-Percents-Finish Reporting mechanism can at least reduce 50% communication overhead than update-on-finish approach while sustaining better load balancing performance than periodic mechanisms in related work.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.195-200
• /
• 2012

We present a new algorithm which can improve the tracking performance of the double-talk robust algorithm. A detection method of the echo path change and a modification method for the update equation of the conventional adaptive filter are proposed. A duration of the high error signal to scale parameter ratio varies according to the call status and this property is used to detect the echo path change. The proposed update equation of the adaptive filter improves the tracking performance by prohibiting wrong selection of the error signal. Simulations using real speech signals and echo paths of the ITU-T G.168 standard confirmed that as compared to the conventional algorithm, the proposed algorithm improved the tracking performance by more than 4 dB.