• Communications of the Korean Mathematical Society
• /
• v.18 no.3
• /
• pp.393-427
• /
• 2003

마쓰 형식을 일반화하는 마쓰-야코비 형식의 개념을 소개하고 이 형식의 성질을 연구한다. 그리고 마쓰-야코비 형식의 연구와 관련된 중요한 문제들을 제시한다.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.15-22
• /
• 2004

Map services for cellular phone have problem for implementation, which are the limitation of a screen size. To effectively represent map data on screen of celluar phone, it need a process which translate a detailed map data into less detailed data using map generalization, and it should manipulate zoom in out quickly by leveling the generalized data. However, current spatial indexing methods supporting map generalization do not support all map generalization operations. In this paper, We propose a leveled spatial indexing method, LMG-tree, supporting map generalization and presents the results of performance evaluation.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.13 no.1
• /
• pp.77-83
• /
• 1995

This paper is concentrated on map generalization in digital environment for automated multi-scale map pro-duction using conventional hardcopy maps. Line generalization is urgently required process to prepare small scale digital map database when large scale map databases are available. This paper outlines a new approach to the line generalization when preparing small scale map on the basis of existing large scale distal map. Line generalizations are conducted based on zero-crossing algorithm using six sheets of 115,000 scale YEOSU area which produced by National Geographic Institute. The results are compared to Douglas-Peucker algorithm and manual method. The study gives full details of the data reduction rates and alternatives based on the proposed algorithm.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.107-123
• /
• 2006

We propose the Generalized Binary Second-order Recurrent Neural Networks(GBSRNNf) being equivalent to regular grammars and ?how the implementation of lexical analyzer recognizing the regular languages by using it. All the equivalent representations of regular grammars can be implemented in circuits by using GSBRNN, since it has binary-valued components and shows the structural relationship of a regular grammar. For a regular grammar with the number of symbols m, the number of terminals p, the number of nonterminals q, and the length of input string k, the size of the corresponding GBSRNN is $O(m(p+q)^2)$ and its parallel processing time is O(k) and its sequential processing time, $O(k(p+q)^2)$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.967-977
• /
• 2000

In this paper, we apply a mixed $H_2/H_{\infty}$ control to a generalized plant of inverted pendulum system represented by an LFR(Linear Fractional Representation). First, in order to obtain the generalized plant, the linear model of the inverted pendulum represented by an LFR(Linear fractional Representation) is derived. In LFR, we consider system uncertainties as three nonlinear components and a pendulum mass uncertainty. Augmenting the LFR model by adding weighting functions, we get a generalized plant. And then, we design a mixed $H_2/H_{\infty}$ controller for the generalized plant. In order to design the mixed $H_2/H_{\infty}$ controller, we use the LMI technique. To evaluate control performances and robust stability of the mixed $H_2/H_{\infty}$ controller designed, we compare it with the $H_{\infty}$ controller through the simulation and experiment. In the result, with the fewer feedback information, the mixed $H_2/H_{\infty}$ controller shows the better control performances and robust stability than the $H_{\infty}$ controller in the sense of pendulum angle.

• Annual Conference on Human and Language Technology
• /
• 1999.10e
• /
• pp.231-236
• /
• 1999

시간표현은 문장에서 다른 명사와 결합하여 복합어를 이루는 경우가 있고, 용언과 결합하여 시간 부사의 역할을 하는 경우가 있는데, 이는 구문 분석에 있어서 중의적 해석이 두드러지며, 그 결과 구문 분석의 오류를 빈번히 야기하기도 한다. 본 논문에서는 이러한 시간 관계의 표현을 대량의 말뭉치로부터 획득하고 이들을 부분문법(local grammar)으로 표현한 후, 이것을 FST(Finite State Transducer)를 이용하여 부분 구문분석을 하고자 한다. 이를 위해 5천만 어절의 말뭉치에서 259개의 시간 단어를 추출하였고, 시간 단어들의 의미적 또는 기능적 사용에 의해서 26개의 어휘 범주로 분류하고 각 범주들의 결합관계를 일반화하였다. 실험을 통하여 인식을 위한 시간표현의 결합관계는 최고 97.2%의 정확률을 보였고, 품사태깅에 있어서는 평균 96.8%의 정확률을 보였다. 이는 시간 표현의 결합관계가 부분 구문분석에 있어서 유용한 정보임을 보여준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.549-554
• /
• 2002

In this paper, for n=2m and odd prime p, new generalized bent functions from the finite field $F_{p^n}$ to the prime field $F_p$ are constructed from the partial spreads for $F_{p^n}$. Closed form expressions for the proposed generalized bent functions and their trace transform are derived in the form of the trace functions.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.586-588
• /
• 1999

간소화된 메쉬의 다중해상 표현은 실시간으로 원하는 해상 메쉬의 랜더링이 가능하고 저해상 메쉬에서 고해상 메쉬로의 전환이 시각적인 연속성을 갖는다. 또 메쉬의 공간마다 다른 해상도의 표현이 가능하다. 본 논문에서는 기존의 다중해상모델의 특징과 단점을 알아보고 다중모델링 이슈을 제시한다. 효율적인 가변 LOD를 위한 기존의 다중해상 모델을 일반화시킨 MT(MultiTriangulation)를 제시한다. MT의 구조적 특징, MT에서의 선택적 상세화와 시점과의 거리에 따른 가변 LOD 질의를 알아본다.

• Electronics and Telecommunications Trends
• /
• v.14 no.3 s.57
• /
• pp.120-122
• /
• 1999

문서의 내용을 효율적으로 표현하기 위해서는 문서를 문서구조와 형식으로 분리하는 것이 필요하다. 인터넷에서의 문서구조는 SGML(Standard Generalized Markup Language)에서 파생된 HTML로 표현하는 것이 일반화되었으며, 1996년에 이르러 문서형식 부분도 DSSSL(Document Style Semantics and Specification Language: ISO/IEC 10179)로 제정되었으나 아직 개발 사례는 없다. 동 기술은 DSSSL 형식에 따라 복합문서를 볼 수 있게 개발한 Library를 기반으로 SGML 기반 브라우저를 1998년 4월 세계 최초로 개발하였다.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.326-338
• /
• 2003

The objective of a neural network design and model selection is to construct an optimal network with a good generalization performance. However, training data include noises, and the number of training data is not sufficient, which results in the difference between the true probability distribution and the empirical one. The difference makes the teaming parameters to over-fit only to training data and to deviate from the true distribution of data, which is called the overfitting phenomenon. The overfilled neural network shows good approximations for the training data, but gives bad predictions to untrained new data. As the complexity of the neural network increases, this overfitting phenomenon also becomes more severe. In this paper, by taking statistical viewpoint, we proposed an integrative process for neural network design and model selection method in order to improve generalization performance. At first, by using the natural gradient learning with adaptive regularization, we try to obtain optimal parameters that are not overfilled to training data with fast convergence. By adopting the natural pruning to the obtained optimal parameters, we generate several candidates of network model with different sizes. Finally, we select an optimal model among candidate models based on the Bayesian Information Criteria. Through the computer simulation on benchmark problems, we confirm the generalization and structure optimization performance of the proposed integrative process of teaming and model selection.