• Proceedings of the Korea Society of Costume Conference
• /
• 2001.08a
• /
• pp.122-122
• /
• 2001

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.839-846
• /
• 1995

In this paper, the spelling errors which are made by human being in the real word processors are collected and analyzed. Based on these data, we make a prototype which can perform spell aid function providing candidate words. The number of candidate characters are minimized by the frequency of Jaso and character, so the number of candidate words could be minimized. The average number of candidate words presented are 3.2 to 8, and 62.1 % to 84.1% of the correct words are presented in the candidate words.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.3-5
• /
• 2006

Recent advances in the internet infrastructure have resulted in a large number of huge Web sites and portals worldwide. These Web sites are being visited by various types of users in many different ways. Among all the web page access sequences from different users, some of them occur so frequently that may need an attention from those who are interested. We call them frequent access patterns and access sequences that can be frequent the candidate patterns. Since these candidate patterns play an important role in the incremental Web mining, it is important to efficiently generate, add, delete, and search for them. This thesis presents a novel tree structure that can efficiently store the candidate patterns and a related set of algorithms for generating the tree structure adding new patterns, deleting unnecessary patterns, and searching for the needed ones. The proposed tree structure has a kind of the 3 dimensional link structure and its nodes are layered.

• Communications for Statistical Applications and Methods
• /
• v.29 no.6
• /
• pp.721-733
• /
• 2022

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.

• International journal of advanced smart convergence
• /
• v.13 no.2
• /
• pp.88-93
• /
• 2024

The main problem with existing edge detection techniques is that they have many limitations in detecting edges for complex and diverse images that exist in the real world. This is because only edges of a defined shape are discovered based on an accurate definition of the edge. One of the methods to solve this problem is the cost minimization method. In the cost minimization method, cost elements and cost functions are defined and used. The cost function calculates the cost for the candidate edge model generated according to the candidate edge generation strategy, and if the cost is found to be satisfactory, the candidate edge model becomes the edge for the image. In this study, we proposed an enhanced candidate edge generation strategy to discover edges for more diverse types of images in order to improve the shortcoming of the cost minimization method, which is that it only discovers edges of a defined type. As a result, improved edge detection results were confirmed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.585-588
• /
• 1997

This paper presents a construction method of logic-based switching control system which operates in widely changing environments. The logic-based switching controller is composed of a family of candidate controllers together with a supervisor. The system does not require any identification schemes of environments. Switching from one candidate controller to another is carried out based on monitoring the output of the system. The basic ideas of adaptation are as follows: (1)each candidate controller is prepared for each environment in advance; (2)the supervisor applies a sequence of speculative controls to a plant with candidate controllers just after the control has started and just after the change of the environment has been detected. It is important that each candidate controller can keep the system stable during a sequence of speculative controls, and the most appropriate candidate controller for the environment to which the system is exposed can be selected before the last speculative control is ended. An application to an antiskid braking system clarifies the effectiveness of the proposed method.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.99-106
• /
• 2004

The syllable restoration is a process restoring a phonetic value recognized in a speech recognition device with the notation form that a vocalization is former. In this paper a syllable restoration rule was composed of a based on standard pronunciation for a syllable restoration process. A syllable restoring regulation was used, and a generation method of a notation candidate set was researched. Also, A study is held to reduce the number of created notation candidate. Three phases of reduction processes were suggested. Reduction of a notation candidate has the non-notation syllable, non-vocabulary syllable and non-stem syllable. As a result of experiment, an average of 74％ notation candidate decrease rates were shown.

• Journal of the Optical Society of Korea
• /
• v.13 no.1
• /
• pp.116-122
• /
• 2009

In this paper, a robust method is developed to locate the irises of both eyes. The method doesn't put any restrictions on the background. The method is based on the AdaBoost algorithm for face and eye candidate points detection. Candidate points are tuned such that two candidate points are exactly in the centers of the irises. Mean crossing function and convolution template are proposed to filter out candidate points and select the iris pair. The advantage of using this kind of hybrid method is that AdaBoost is robust to different illumination conditions and backgrounds. The tuning step improves the precision of iris localization while the convolution filter and mean crossing function reliably filter out candidate points and select the iris pair. The proposed structure is evaluated on three public databases, Bern, Yale and BioID. Extensive experimental results verified the robustness and accuracy of the proposed method. Using the Bern database, the performance of the proposed algorithm is also compared with some of the existing methods.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.12
• /
• pp.1679-1690
• /
• 2002

This paper, describe about a generation of a syllable restoration regulation for a post processing of a speech recognition and a decrease of a restoration candidate. It created a syllable restoration regulation to create a restoration candidate pronounced with phonetic value recognized through a post processing of the formula system that was a tone to recognize syllable unit phonetic value for a performance enhancement of a dialogue serial speech recognition. Also, I presented a plan to remove a regulation to create unused notation from a real life in a restoration regulation with a plan to reduce number candidate of a restoration meeting. A design implemented a restoration candidate set generator in order a syllable restoration regulation display that it created a proper restoration candidate set. The proper notation meeting that as a result of having proved about a standard pronunciation example and a word extracted from a pronunciation dictionary at random, the notation that an utterance was former was included in proved with what a generation became.

• Asian-Australasian Journal of Animal Sciences
• /
• v.25 no.5
• /
• pp.613-620
• /
• 2012

Marbling from intramuscular fat is an important trait of meat quality and has an economic benefit for the beef industry. Quantitative trait loci (QTL) fine mapping was performed to identify the marbling trait in 266 Hanwoo steers using a 10K single nucleotide polymorphism panel with the combined linkage and linkage disequilibrium method. As a result, we found nine putative QTL regions for marbling: three on BTA6, two on BTA17, two on BTA22, and two on BTA29. We detected candidate genes for marbling within 1 cM of either side of the putative QTL regions. Additionally, to understand the functions of these candidate genes at the molecular level, we conducted a functional categorization using gene ontology and pathway analyses for those genes involved in lipid metabolism or fat deposition. In these putative QTL regions, we found 95 candidate genes for marbling. Using these candidate genes, we found five genes that had a direct interaction with the candidate genes. We also found SCARB1 as a putative candidate gene for marbling that involves fat deposition related to cholesterol transport.