• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1586-1593
• /
• 2010

Vocabulary recognition error correction method has probabilistic pattern matting and dynamic pattern matting. In it's a sentences to based on key-word by semantic analysis. Therefore it has problem with key-word not semantic analysis for morphological changes shape. Recognition rate improve of vocabulary unrecognized reduced this paper is propose. In syllable restoration algorithm find out semantic of a phoneme recognized by a phoneme semantic analysis process. Using to sentences restoration that morphological analysis and morphological analysis. Find out error correction rate using phoneme likelihood and confidence for system parse. When vocabulary recognition perform error correction for error proved vocabulary. system performance comparison as a result of recognition improve represent 2.0% by method using error pattern learning and error pattern matting, vocabulary mean pattern base on method.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.23-28
• /
• 2002

A fundamental problem in building an intelligent agent is that an agent does not understand the meaning of its perception or its action. One reason that an agent cannot understand the world is partially caused by a syntactic approach that converts a semantic feature into a simple string. To solve this problem, Cohen introduces a semantic approach that an agent autonomously learns a meaningful representation of physical schemas, on which some advanced conceptual structures are built, from physically interacting with environment using its own sensors and effectors. However, Cohen does not deal with a meta level of conceptual primitive that makes recognizing a schema possible. We propose that negation is a meta schema that enables an agent to recognize a physical schema. We prove some semantic aspects of negation.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.81-90
• /
• 2014

As mobile devices have become widely used and developed, PC based malwares can be moving towards mobile-based units. In particular, mobile Botnet reuses powerful malicious behavior of PC-based Botnet or add new malicious techniques. Different from existing PC-based Botnet detection schemes, mobile Botnet detection schemes are generally host-based. It is because mobile Botnet has various attack vectors and it is difficult to inspect all the attack vector at the same time. In this paper, to overcome limitations of host-based scheme, we compare two network-based schemes which detect mobile Botnet by applying HMM and SVM techniques. Through the verification analysis under real Botnet attacks, we present detection rates and detection properties of two schemes.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1374-1375
• /
• 2008

본 논문은 3상 일괄형 GIS의 부분방전 진단을 위해 새롭게 개발한 진단 알고리즘에 관한 것이다. 진단 알고리즘 개발을 위해, 먼저 실시간 부분방전 데이터를 행벡터 및 열벡터로 구성하고 각각의 벡터에서 통계 특징량 및 질감 특징량을 추출하였다. 다음으로 이들 특징량을 GA-NN(Genetic Algorithm - Neural Network) 학습에 적용하여 진단 알고리즘을 구성하였다. 또한 진단 알고리즘의 위상독립성은 부분방전 신호의 위상변화에 관계없이 진단결과가 일치하는 것을 확인함으로써 검증하였다. 개발한 진단알고리즘의 실증 평가를 위해, 부분방전이 발생되고 있는 국내 3상 일괄형 GIS 변전소에 적용하였다. 적용 결과, 위상에 관계없이 부분방전 발생원을 정확히 진단함을 확인하였고, 이를 통해 개발 알고리즘의 우수성을 입증하였다.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.34-43
• /
• 2006

This paper shows modeling methods for VBR video trace. It is well known that VBR video trace is characterized as longterm correlated and highly intermittent burst data. To analyze this, we attempt to model it using neural network with auxiliary linear structures derived from residual threshold. For testing purpose, we generate VBR video trace from chaotic nonlinear function combined with the geometric random noise. The modeling result of the generated data shows that the attempted method represents more accurately than the traditional neural network. However, we also found that combining hRU to the attempted modeling method can yield a closer agreement to statistical features of the generated data than the attempted modeling method alone.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.94-100
• /
• 2010

Data Mining is mainly used for pattern extracting and information discovery from collected data. However previous methods is difficult to reflect changing patterns with time. In this paper, we introduce Streaming Decision Tree(SDT) analyzing data with continuity, large scale, and changed patterns. SDT defines continuity data as blocks and extracts rules using a Decision Tree's learning method. The extracted rules are combined considering time of occurrence, frequency, and contradiction. In experiment, we applied time series data and confirmed resonable result.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.343-347
• /
• 2012

Non-linear equalization techniques using decision feedback structure are highly demanded for cancellation of intersymbol interferences occurred in severe channel environments. In this paper decision feedback structure is applied to the linear blind equalizer algorithm that is based on information theoretic learning and a randomly generated symbol set. At the decision feedback equalizer (DFE) the random symbols are generated to have the same probability density function (PDF) as that of the transmitted symbols. By minimizing difference between the PDF of blind DFE output and that of randomly generated symbols, the proposed DFE algorithm produces equalized output signal. From the simulation results, the proposed method has shown enhanced convergence and error performance compared to its linear counterpart.

• Journal of the Korean Society for Library and Information Science
• /
• v.46 no.4
• /
• pp.311-339
• /
• 2012

The purpose of this study is to develop a model of a liaison training program for academic librarians in Korea. The liaison training program model has been developed based upon the literature review and surveys about liaison training practices in foreign countries Expert interviews and case analyses were conducted to demonstrated its feasibility and applicability. This study found that this model identifies core competencies of academic liaison librarians and it helped developing guidelines by the level of each task: basic and advanced exercises, references, and worksheets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.534-540
• /
• 1996

This paper presents an Adaptive Time-Delay Recurrent Neural Network (ATRN) for learning and recognition of temporal correlations of temporal patterns. The ATRN employs adaptive time-delays and recurrent connections, which are inspired from neurobiology. In the ATRN, the adaptive time-delays make the ATRN choose the optimal values of time-delays for the temporal location of the important information in the input parrerns, and the recurrent connections enable the network to encode and integrate temporal information of sequences which have arbitrary interval time and arbitrary length of temporal context. The ATRN described in this paper, ATNN proposed by Lin, and TDNN introduced by Waibel were simulated and applied to the chaotic time series preditcion of Mackey-Glass delay-differential equation. The simulation results show that the normalized mean square error (NMSE) of ATRN is 0.0026, while the NMSE values of ATNN and TDNN are 0.014, 0.0117, respectively, and in temporal learning, employing recurrent links in the network is more effective than putting multiple time-delays into the neurons. The best performance is attained bythe ATRN. This ATRN will be sell applicable for temporally continuous domains, such as speech recognition, moving object recognition, motor control, and time-series prediction.

• Information and Communications Magazine
• /
• v.9 no.11
• /
• pp.34-36
• /
• 1992

여러 개의 문자(혹은 여러 개의 자소로 구성된 한개의 문자)를 인식할때에는 문자(혹은 자소) 상호간에 영향을 미쳐서 오인식이 발생할 가능성이 높다. 개개의 숫자인식에 기초한 숫자열 인식이나, 개개의 자소인식을 바탕으로한 필기체 한글인식이 그 좋은 보기일 것이다. 예를 들어 단순한 한글 '그'를 Neocognitron으로 인식한다고 생각해 보자, 조합 가능한 글자를 모두 기억시키려면 방대한 규모의 회로가 필요하므로 현실적으로 불가능하다. 따라서 기본 자소(자음 14개, 모음 10개)를 인식하도록 학습시키고 이를 바탕으로 한글을 인식하는 것이 효율적이다. 이때, 회로의 각 세포가 보는 receptive field가 유한하여 '?'의 끝 세로부분 'I'가 '?'에 영향을 미쳐서 '?'로 인식된다 즉, 자소간의 섭동에 의해 '그'가 '고'로 인식되는 것이다. 이와같은 예는 '니'가 '넉'으로, '41'이 '4H'로 인식되는 등 매우 많지만 그 해결에 대한 연구는 거의 없다. 이 논문에서는 필기체 한글 자소를 인식하는 Necognitron외에 자소간의 섭동현상을 제거하기 위한 high-level constraint 회로를 Lotka-Volterra동역학에 기초하여 설계하였다. 이로써 off-line필기체 한글인식을 보다 효과적으로 할 수 있음을 컴퓨터 시뮬레이션으로 보인다.