• 제목/요약/키워드: subspace

검색결과 740건 처리시간 0.046초

SMOOTH FUZZY CLOSURE AND TOPOLOGICAL SPACES

  • Kim, Yong Chan
    • Korean Journal of Mathematics
    • /
    • 제7권1호
    • /
    • pp.11-25
    • /
    • 1999
  • We will define a smooth fuzzy closure space and a subspace of it. We will investigate relationships between smooth fuzzy closure spaces and smooth fuzzy topological spaces. In particular, we will show that a subspace of a smooth fuzzy topological space can be obtained by the subspace of the smooth fuzzy closure space induced by it.

  • PDF

Time-Varying Subspace Tracking Algorithm for Nonstationary DOA Estimation in Passive Sensor Array

  • Lim, Junseok;Song, Joonil;Pyeon, Yongkug;Sung, Koengmo
    • The Journal of the Acoustical Society of Korea
    • /
    • 제20권1E호
    • /
    • pp.7-13
    • /
    • 2001
  • In this paper we propose a new subspace tracking algorithm based on the PASTd (Projection Approximation Subspace Tracking with deflation). The algorithm is obtained via introducing the variable forgetting factor which adapts itself to the time-varying subspace environments. The tracking capability of the proposed algorithm is demonstrated by computer simulations in an abruptly changing DOA scenario. The estimation results of the variable forgetting factor PASTd(VFF-PASTd) outperform those of the PASTd in the nonstationary case as well as in the stationary case.

  • PDF

Subspace distribution clustering hidden Markov model을 위한 codebook design (Codebook design for subspace distribution clustering hidden Markov model)

  • 조영규;육동석
    • 대한음성학회:학술대회논문집
    • /
    • 대한음성학회 2005년도 춘계 학술대회 발표논문집
    • /
    • pp.87-90
    • /
    • 2005
  • Today's state-of the-art speech recognition systems typically use continuous distribution hidden Markov models with the mixtures of Gaussian distributions. To obtain higher recognition accuracy, the hidden Markov models typically require huge number of Gaussian distributions. Such speech recognition systems have problems that they require too much memory to run, and are too slow for large applications. Many approaches are proposed for the design of compact acoustic models. One of those models is subspace distribution clustering hidden Markov model. Subspace distribution clustering hidden Markov model can represent original full-space distributions as some combinations of a small number of subspace distribution codebooks. Therefore, how to make the codebook is an important issue in this approach. In this paper, we report some experimental results on various quantization methods to make more accurate models.

  • PDF

유전자 알고리즘 기반 통합 앙상블 모형 (Genetic Algorithm based Hybrid Ensemble Model)

  • 민성환
    • Journal of Information Technology Applications and Management
    • /
    • 제23권1호
    • /
    • pp.45-59
    • /
    • 2016
  • An ensemble classifier is a method that combines output of multiple classifiers. It has been widely accepted that ensemble classifiers can improve the prediction accuracy. Recently, ensemble techniques have been successfully applied to the bankruptcy prediction. Bagging and random subspace are the most popular ensemble techniques. Bagging and random subspace have proved to be very effective in improving the generalization ability respectively. However, there are few studies which have focused on the integration of bagging and random subspace. In this study, we proposed a new hybrid ensemble model to integrate bagging and random subspace method using genetic algorithm for improving the performance of the model. The proposed model is applied to the bankruptcy prediction for Korean companies and compared with other models in this study. The experimental results showed that the proposed model performs better than the other models such as the single classifier, the original ensemble model and the simple hybrid model.

SIX SOLUTIONS FOR THE SEMILINEAR WAVE EQUATION WITH NONLINEARITY CROSSING THREE EIGENVALUES

  • Choi, Q-Heung;Jung, Tacksun
    • Korean Journal of Mathematics
    • /
    • 제20권3호
    • /
    • pp.361-369
    • /
    • 2012
  • We get a theorem which shows the existence of at least six solutions for the semilinear wave equation with nonlinearity crossing three eigenvalues. We obtain this result by the variational reduction method and the geometric mapping defined on the finite dimensional subspace. We use a contraction mapping principle to reduce the problem on the infinite dimensional space to that on the finite dimensional subspace. We construct a three-dimensional subspace with three axes spanned by three eigenvalues and a mapping from the finite dimensional subspace to the one-dimensional subspace.

GEOMETRIC RESULT FOR THE ELLIPTIC PROBLEM WITH NONLINEARITY CROSSING THREE EIGENVALUES

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • 제20권4호
    • /
    • pp.507-515
    • /
    • 2012
  • We investigate the number of the solutions for the elliptic boundary value problem. We obtain a theorem which shows the existence of six weak solutions for the elliptic problem with jumping nonlinearity crossing three eigenvalues. We get this result by using the geometric mapping defined on the finite dimensional subspace. We use the contraction mapping principle to reduce the problem on the infinite dimensional space to that on the finite dimensional subspace. We construct a three dimensional subspace with three axis spanned by three eigenvalues and a mapping from the finite dimensional subspace to the one dimensional subspace.

Blind Adaptive Multiuser Detection for the MC-CDMA Systems Using Orthogonalized Subspace Tracking

  • Ali, Imran;Kim, Doug-Nyun;Lim, Jong-Soo
    • ETRI Journal
    • /
    • 제31권2호
    • /
    • pp.193-200
    • /
    • 2009
  • In this paper, we study the performance of subspace-based multiuser detection techniques for multicarrier code-division multiple access (MC-CDMA) systems. We propose an improvement in the PASTd algorithm by cascading it with the classical Gram-Schmidt procedure to orthonormalize the eigenvectors after their sequential extraction. The tracking of signal subspace using this algorithm, which we call OPASTd, has a faster convergence as the eigenvectors are orthonormalized at each discrete time sample. This improved PASTd algorithm is then used to implement the subspace blind adaptive multiuser detection for MC-CDMA. We also show that, for multiuser detection, the complexity of the proposed scheme is lower than that of many other orthogonalization schemes found in the literature. Extensive simulation results are presented and discussed to demonstrate the performance of the proposed scheme.

  • PDF

자동차 충돌문제에 MDO를 적용하기 위한 시스템 해석 방법 개발 (Development of System Analysis for the Application of MDO to Crashworthiness)

  • 신문균;김창희;박경진
    • 한국자동차공학회논문집
    • /
    • 제11권5호
    • /
    • pp.210-218
    • /
    • 2003
  • MDO (multidisciplinary design optimization) technology has been proposed and applied to solve large and complex optimization problems where multiple disciplinaries are involved. In this research. an MDO problem is defined for automobile design which has crashworthiness analyses. Crash model which are consisted of airbag, belt integrated seat (BIS), energy absorbing steering system .and safety belt is selected as a practical example for MDO application to vehicle system. Through disciplinary analysis, vehicle system is decomposed into structure subspace and occupant subspace, and coupling variables are identified. Before subspace optimization, values of coupling variables at given design point must be determined with system analysis. The system analysis in MDO is very important in that the coupling between disciplines can be temporary disconnected through the system analysis. As a result of system analysis, subspace optimizations are independently conducted. However, in vehicle crash, system analysis methods such as Newton method and fixed-point iteration can not be applied to one. Therefore, new system analysis algorithm is developed to apply to crashworthiness. It is conducted for system analysis to determine values of coupling variables. MDO algorithm which is applied to vehicle crash is MDOIS (Multidisciplinary Design Optimization Based on Independent Subspaces). Then, structure and occupant subspaces are independently optimized by using MDOIS.

Subspace Projection을 이용한 전파방해신호 제거와 다중경로 간섭신호 제거 GNSS 수신기 설계 (On Construction of Anti-jam and Multipath Mitigation GNSS receiver by Subspace Projection)

  • 신정환;허준
    • 대한전자공학회논문지TC
    • /
    • 제43권12호
    • /
    • pp.24-30
    • /
    • 2006
  • 본 논문에서는 다중 안테나를 갖는 위성항법시스템 (GNSS) 수신기에서의 subspace projection을 이용한 전파방해신호 제거와 다중경로 간섭신호 제거에 대한 방법을 기술한다. 우리는 수신기에 들어온 신호를 두 번의 subspace projection을 통해 전파방해신호와 다중경로 간섭신호가 없는 noise subspace로 투영함으로써 GNSS 신호와 noise 만으로 구성된 신호 얻게 되고, 이 신호에 Beamformer를 적용하여 최대의 신호 대 잡음비를 갖는 수신기 출력 신호를 얻게 된다. 컴퓨터 시뮬레이션을 통하여 수신기가 효과적으로 전파방해신호와 다중경로간섭신호를 제거하고 신호 대 잡음비를 최대한으로 증가시킬 수 있음을 보여준다.

부분공간법에 의한 페루프 시스템의 동정 (Identification of Closed Loop System by Subspace Method)

  • 이동철;배종일;홍순일;김종경;조봉관
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 하계학술대회 논문집 D
    • /
    • pp.2143-2145
    • /
    • 2003
  • In the linear system identification using the discrete time constant coefficients, there is a subspace method based on 4SID recently much suggested instead of the parametric method like as the maximum likelihood method. The subspace method is not related with the impulse response and difference equation in its input-output equation, but with the system matrix of the direct state space model from the input-output data. The subspace method is a very useful tool to adopt in the multivariable system identification, but it has a shortage unable to adopt in the closed-loop system identification. In this paper, we are suggested the methods to get rid of the shortage of the subspace method in the closed-loop system identification. The subspace method is used in the estimate of the output prediction values from the estimating of the state space vector. And we have compared the results with the outputs of the recursive least square method in the numerical simulation.

  • PDF