• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.217-223
• /
• 2022

Subspace clustering for online data streams requires a large amount of memory resources as all subsets of data dimensions must be examined. In order to track the continuous change of clusters for a data stream in a finite memory space, in this paper, we propose a grid-based subspace clustering algorithm that effectively uses memory resources. Given an n-dimensional data stream, the distribution information of data items in data space is monitored by a grid-cell list. When the frequency of data items in the grid-cell list of the first level is high and it becomes a unit grid-cell, the grid-cell list of the next level is created as a child node in order to find clusters of all possible subspaces from the grid-cell. In this way, a maximum n-level grid-cell subspace tree is constructed, and a k-dimensional subspace cluster can be found at the k^th level of the subspace grid-cell tree. Through experiments, it was confirmed that the proposed method uses computing resources more efficiently by expanding only the dense space while maintaining the same accuracy as the existing method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1926-1945
• /
• 2014

In this paper, we propose a distributed signal subspace interference alignment algorithm for single beam K-user ($3K{\geq}$) MIMO interference channel based on sum rate maximization and game theory. A framework of game theory is provided to study relationship between interference signal subspace and altruistic-egoistic bayesian game cost function. We demonstrate that the asymptotic interference alignment under proposed scheme can be realized through a numerical algorithm using local channel state information at transmitters and receivers. Simulation results show that the proposed scheme can achieve the total degrees of freedom that is equivalent to the Cadambe-Jafar interference alignment algorithms with perfect channel state information. Furthermore, proposed scheme can effectively minimize leakage interference in desired signal subspace at each receiver and obtain a moderate average sum rate performance compared with several existing interference alignment schemes.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.182-191
• /
• 2008

Most of previous works for skyline queries have focused only on static attributes of target objects. With the advance in mobile applications, however, the need of continuous skyline queries for moving objects has been increasing. Even though several techniques to process continuous skyline queries have been proposed recently, they cannot process subspace queries, which use only the subset of attribute dimensions. Therefore it is not feasible to utilize those methods for mobile applications which must consider moving objects and subspaces simultaneously. In this paper, we propose a dominant object-based pruning method to compute subspace skyline of moving objects efficiently at query time and present the experimental results to show the effectiveness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11B
• /
• pp.1510-1521
• /
• 2001

In this paper a subspace-based blind interference cancellation is proposed and its performance is analyzed. Then the blind adaptive implementation is devolped using the improved natural power method which is the signal subspace tracking algorithm. The theoretical analysis shows that when the exact covariance matrix is kown the performance of the proposed detector is the same as that of the decorrelating detector. And when the covariance matrix is estimated the asymptotic results are examined. The results of computer simulation demonstrate that the proposed detector outperforms the previous blind adaptive RLS MOE detector.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.436-441
• /
• 2008

One of important factors in designing array-type MEMS resonators is obtaining a desired frequency response function (FRF) within a specific range. In this paper Krylov subspace-based model order reduction using moment-matching with non-zero expansion points is represented to calculate the FRF of array-type resonators. By matching moments at a frequency around a specific range of the array-type resonators, required FRFs can be efficiently calculated with significantly reduced systems regardless of their operating frequencies. In addition, because of the characteristics of moment-matching method, a minimal order of reduced system with a specified accuracy can be determined through an error indicator using successive reduced models, which is very useful to automate the order reduction process and FRF calculation for structural optimization iterations.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.189-198
• /
• 2002

Precoder has been shown to be able to provide source diversity and design flexibility. In this paper we employ precoding techniques for block transmission based on a multirate filterbank structure. To accommodate multiuser communication with variable data rates, different precoders with corresponding coefficients and up/down sampling rates are used. However, due to unknown multipath distortion, different interferences may exist in the received data, such as multiuser interference, intersymbol interference and interblock interference. To estimate channel parameters for a desired user, we employ all structured signature waveforms associated with different symbols of that user and apply subspace techniques. Therefore better performance of channel estimator can be achieved than the conventional subspace method based only on the signature of the current symbol. The delay for that user can also be jointly estimated. Channel identifiability conditions and asymptotic channel estimation error are investigated in detail. Numerical examples are provided to justify the proposed method. gest either multicode (MC) or multiple processing gain (MPG) mechanism [2], while requiring data rates to be integral multiples of some basic low-rate. In order to support variable rate transmission however, a comprehensive scheme needs to be investigated.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1131-1141
• /
• 2010

We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Some numerical experiments are given to show the efficiency of the preconditioner.

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.13-21
• /
• 2006

Ryu et al. proposed a multiple target angle tracking algorithm using the angular measurement obtained from the signal subspace estimated by the output of sensor array. Ryu's algorithm has good features that it has no data association problem and simple structure. But its performance is seriously degraded in the low signal-to-noise ratio, and it uses the angular measurement obtained from the signal subspace of sampling time, even though the signal subspace is continuously updated by the output of sensor array. For improving the tracking performance of Ryu's algorithm, a measurement fusion method is derived based on ML(Maximum Likelihood) in this paper, and it admits us to use the angular measurements obtained form the adjacent signal subspaces as well as the signal subspace of sampling time. The new target angle tracking algorithm is proposed using the derived measurement fusion method. The proposed algorithm has a better tracking performance than that of Ryu's algorithm and it sustains the good features of Ryu's algorithm.

• Smart Structures and Systems
• /
• v.10 no.4_5
• /
• pp.331-351
• /
• 2012

In this study an output-only system identification technique for civil structures under ambient vibrations is carried out, mainly focused on using the Stochastic Subspace Identification (SSI) based algorithms. A newly developed signal processing technique, called Singular Spectrum Analysis (SSA), capable to smooth a noisy signal, is adopted for preprocessing the measurement data. An SSA-based SSI algorithm with the aim of finding accurate and true modal parameters is developed through stabilization diagram which is constructed by plotting the identified system poles with increasing the size of data matrix. First, comparative study between different approaches, with and without using SSA to pre-process the data, on determining the model order and selecting the true system poles is examined in this study through numerical simulation. Finally, application of the proposed system identification task to the real large scale structure: Canton Tower, a benchmark problem for structural health monitoring of high-rise slender structures, using SSA-based SSI algorithm is carried out to extract the dynamic characteristics of the tower from output-only measurements.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.211-230
• /
• 2008

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.