• MALSORI
• /
• no.56
• /
• pp.225-235
• /
• 2005

Speech unit concatenation with a large database is presently the most popular method for speech synthesis. In this approach, the mismatches at the unit boundaries are unavoidable and become one of the reasons for quality degradation. This paper proposes an algorithm to reduce undesired discontinuities between the subsequent units. Optimal matching points are calculated in two steps. Firstly, the fullback-Leibler distance measurement is utilized for the spectral matching, then the unit sliding and the overlap windowing are used for the waveform matching. The proposed algorithm is implemented for the corpus-based unit concatenating Korean text-to-speech system that has an automatically labeled database. Experimental results show that our algorithm is fairly better than the raw concatenation or the overlap smoothing method.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.173-175
• /
• 2005

In this paper, we propose a data encoding algorithm for two-dimensional barcode system. In general, one-dimensional barcode is just a key which can access detailed information to the host computer database. But the two-dimensional barcode is a new technology which can obtain high density information without access to the host computer database. We implemented encoding algorithm for Data Matrix Barcode which is the most widely used among the many kind of two-dimensional barcodes. And we marked to a real object using Digital Signal Processor(DSP) Marking System. The performance of proposed algorithm is verified through the result of marking work.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.1
• /
• pp.25-33
• /
• 1998

This paepr presents an algorithm for searching an object in a fast way which contains a continuous moving object in multi-dimensional spatical databases. This algorithm improves the search method of R-tree for the case that a target object is continuously moving in a spatial database. It starts the searching from the current node instead of the root of R-tree. Thus, the algorithm will find the target object from the entries of current node or sibling nodes in the most cases. The performance analysis shows that it is more efficient than the existing algorithm for R-tree when search windows or target objects are continuously moving.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1733-1734
• /
• 2008

We develope a riding robot system named as "RideBot" for health-care and entertainments. An algorithm for estimating riding position and volition is proposed by using bio-signals. We analyze the riding position and volition in real-horse riding environments and build up the database. With this database and sensor informations, standard positions are made. For the volition estimation, we use the acceleration and deceleration sensor information and bridle information for direction change. We propose a hybrid control algorithm in which discrete-state and continuous-state controls are combined. The efficiency of the proposed algorithm is evaluated thru various experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.205-208
• /
• 2000

Conventional database retrieval system have problems of being able to select data out of database only if the data exactly equal to retrieval conditions offered by users. If there are no data in database which exactly equal to users retrieval conditionals, the system can not provide adequate data. To solve these problems, cluster increase of FCM and re-initialization of algorithm were suggested in this study. And by interlocking knowledge-based database, built with FCM, to image database, new retrieval system was built to provide the data which are most appropriate for the requirement of users. We applied this new retrieval system to gift selection database system in pamphlet of mail order, and confirmed its effectiveness.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.196-200
• /
• 2008

Recently, the query processing algorithm in spatial network database (SNDB) has attracted many interests. However, there is little research on route-based query processing algorithm in SNDB. Since the moving objects moves only in spatial networks, the route-based algorithm is very useful for LBS and Telematics applications. In this paper, we analyze In-Route Nearest Neighbor (IRNN) query, which is an typical one of route-based queries, and propose a new IRNN query processing algorithm with time constraint. In addition, we show from our performance analysis that our IRNN query processing algorithm with time constraint is better on retrieval performance than the existing IRNN query processing one.

• Journal of Integrative Natural Science
• /
• v.4 no.3
• /
• pp.238-242
• /
• 2011

For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. The system that uses the artificial neural network(ANN) falls in a local minima when it learns many nonlinear data, and its classification accuracy ratio becomes low. To make up for this risk, the SVM/ANN hybrid algorithm is proposed in this paper. The proposed algorithm is the method that ANN learns selectively after clustering the SNR data by SVM, then more improved performance estimation can be obtained than using ANN only and The proposed algorithm can make the higher classification accuracy by decreasing the nonlinearity of the massive data during the training procedure. Experimental results indicate that the proposed SVM/ANN hybrid algorithm generally outperforms ANN algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.19-30
• /
• 2008

Recently, the query processing algorithm in the field of spatial network database(SNDB) has been attracted by many Interests. But, there is little research on route-based queries. Since the moving objects move only in spatial networks, the efficient route-based query processing algorithms, like in-route nearest neighbor(IRNN), are essential for Location-based Service(LBS) and Telematics application. However, the existing IRNN query processing algorithm has a problem that it does not consider traffic jams in the road network. In this thesis, we propose an IRNN query processing algorithm which considers space restriction. Finally, we show that space-constrained IRNN query processing algorithm is efficient compared with the existing IRNN algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.11
• /
• pp.471-478
• /
• 2014

Database replication is utilized to increase credibility, availability and prevent overload of distributed databases. Two models currently exist for replication - Master/Slave and Multi-Master. Since the Multi-Master model has problems of increasing complexity and costs to interface among multiple databases for updates and inserts, the Master/Slave model is more appropriate when frequent data inserts and updates are required. However, Master/Slave model also has a problem of not having exact criteria when systems choose to connect between Master and Slave for transactions. Therefore, this research suggests a routing algorithm based on AOP (Aspect Oriented Programming) in the Master/Slave database model. The algorithm classifies applications as cross-cutting concerns based on AOP, modularizes each concern, and routes transactions among Master and Slave databases. This paper evaluates stability and performance of the suggested algorithm through integration tests based on scenarios.