• 말소리와 음성과학
• /
• 제6권1호
• /
• pp.77-83
• /
• 2014

This paper proposes a speaker and environment clustering method in order to overcome the degradation of the speech recognition performance caused by various noise and speaker characteristics. In this paper, instead of using the distance between Gaussian mixture model (GMM) weight vectors as in the Google's approach, the distance between the adapted mean vectors based on the modified maximum a posteriori (MAP) adaptation is used as a distance measure for vector quantization (VQ) clustering. According to our experiments on the simulation data generated by adding noise to clean speech, the proposed clustering method yields error rate reduction of 10.6% compared with baseline speaker-independent (SI) model, which is slightly better performance than the Google's approach.

• Communications for Statistical Applications and Methods
• /
• 제19권6호
• /
• pp.899-904
• /
• 2012

High-dimensional categorical data models with small sample sizes have not been used extensively in genomic sequences that involve count (or discrete) or purely qualitative responses. A basic task is to identify differentially expressed genes (or positions) among a number of genes. It requires an appropriate test statistics and a corresponding multiple testing procedure so that a multivariate analysis of variance should not be feasible. A family wise error rate(FWER) is not appropriate to test thousands of genes simultaneously in a multiple testing procedure. False discovery rate(FDR) is better than FWER in multiple testing problems. The data from the 2002-2003 SARS epidemic shows that a conventional FDR procedure and a proposed test statistic based on a pseudo-marginal approach with Hamming distance performs better.

• 한국시뮬레이션학회논문지
• /
• 제14권3호
• /
• pp.137-146
• /
• 2005

In parametric approach to a signature verification, it generally uses so many redundant features unsuitable for each individual signature that it causes harm, instead. This paper proposes a method of determining personalized weights of a feature set in signature verification with parametric approach by identifying the characteristics of each feature. For an individual signature, we define a degree of how difficult it is for any other person to forge the one's (called 'DFD' as the Degree of Forgery Difficulty). According to the statistical characteristics and the intuitional characteristics of each feature, the standard features are classified into four types. Four types of DFD functions are defined and applied into the distance calculation as a personalized weight factor. Using this method, the error rate of signature verification is reduced and the variation of the performance is less sensitive to the changes of decision threshold.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2013년도 추계학술대회 논문집
• /
• pp.346-353
• /
• 2013

Industrial processes need to be monitored in real-time based on the input-output data observed during their operation. Abnormalities in an induction motor should be detected early in order to avoid costly breakdowns. To early identify induction motor faults, this paper effectively estimates spectral envelopes of each induction motor fault by utilizing a linear prediction coding (LPC) analysis technique and an expectation maximization (EM) algorithm. Moreover, this paper classifies induction motor faults into their corresponding categories by calculating Mahalanobis distance using the estimated spectral envelopes and finding the minimum distance. Experimental results shows that the proposed approach yields higher classification accuracies than the state-of-the-art approach for both noiseless and noisy environments for identifying the induction motor faults.

• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1613-1622
• /
• 2005

Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.

• Journal of Computing Science and Engineering
• /
• 제3권4호
• /
• pp.195-215
• /
• 2009

Worst-case execution time (WCET) analysis is critical for hard real-time systems to ensure that different tasks can meet their respective deadlines. While significant progress has been made for WCET analysis of instruction caches, the data cache timing analysis, especially for set-associative data caches, is rather limited. This paper proposes an approach to safely and tightly bounding data cache performance by computing the worst-case stack distance of data cache accesses. Our approach can not only be applied to direct-mapped caches, but also be used for set-associative or even fully-associative caches without increasing the complexity of analysis. Moreover, the proposed approach can statically categorize worst-case data cache misses into cold, conflict, and capacity misses, which can provide useful insights for designers to enhance the worst-case data cache performance. Our evaluation shows that the proposed data cache timing analysis technique can safely and accurately estimate the worst-case data cache performance, and the overestimation as compared to the observed worst-case data cache misses is within 1% on average.

• International Journal of Computer Science & Network Security
• /
• 제22권9호
• /
• pp.300-306
• /
• 2022

The theoretical analysis and synthesis of prospects for the development of distance learning in Ukraine, the main topical problems of distance education in Ukraine are considered, the main factors that hinder the introduction of distance learning are analyzed, to pay attention to the need to increase the level of computer literacy among Ukrainian educators and the formation of modern methodology of distance learning, in particular, a single, systematic, national approach of organization, coordination and control in this area. Research methods: analytical method, method of structural and functional analysis, phenomenological method, content analysis method, philosophical reflection method, sociological methods (questionnaire, interview).

• 한국GIS학회:학술대회논문집
• /
• 한국GIS학회 2008년도 공동추계학술대회
• /
• pp.270-271
• /
• 2008

The positioning technology for a moving object is an important and essential component of ubiquitous communication computing environment and applications, for which Radio Frequency IDentification Identification(RFID) is has been considered as also a core technology for ubiquitous wireless communication. RFID-based positioning system calculates the position of moving object based on k-nearest neighbor(k-nn) algorithm using detected k-tags which have known coordinates and k can be determined according to the detection range of RFID system. In this paper, RFID-based positioning system determines the position of moving object not using weight factor which depends on received signal strength but assuming that tags within the detection range always operate and have same weight value. Because the latter system is much more economical than the former one. The geometries of tags were determined with considerations in huge buildings like office buildings, shopping malls and warehouses, so they were determined as the line in 1-Dimensional space, the square in 2-Dimensional space and the cubic in 3-Dimensional space. In 1-Dimensional space, the optimal detection range is determined as 125% of the tag spacing distance through the analytical and numerical approach. Here, the analytical approach means a mathematical proof and the numerical approach means a simulation using matlab. But the analytical approach is very difficult in 2- and 3-Dimensional space, so through the numerical approach, the optimal detection range is determined as 134% of the tag spacing distance in 2-Dimensional space and 143% of the tag spacing distance in 3-Dimensional space. This result can be used as a fundamental study for designing RFID-based positioning system.

• Communications for Statistical Applications and Methods
• /
• 제22권1호
• /
• pp.55-67
• /
• 2015

An important problem in cluster analysis is the selection of variables that define cluster structure that also eliminate noisy variables that mask cluster structure; in addition, outlier detection is a fundamental task for cluster analysis. Here we provide an automated K-means clustering process combined with variable selection and outlier identification. The Automated K-means clustering procedure consists of three processes: (i) automatically calculating the cluster number and initial cluster center whenever a new variable is added, (ii) identifying outliers for each cluster depending on used variables, (iii) selecting variables defining cluster structure in a forward manner. To select variables, we applied VS-KM (variable-selection heuristic for K-means clustering) procedure (Brusco and Cradit, 2001). To identify outliers, we used a hybrid approach combining a clustering based approach and distance based approach. Simulation results indicate that the proposed automated K-means clustering procedure is effective to select variables and identify outliers. The implemented R program can be obtained at http://www.knou.ac.kr/~sskim/SVOKmeans.r.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.196-198
• /
• 2002

This paper represents a new approach for the protective relay of power transmission lines using a Artificial Neural Network(ANN). A different fault on transmission lines need to be detected, classified and located accurately and cleared as fast as possible. However, The protection range of the distance relay is always designed on the basis of fixed settings, and unfortunately these approach do not have the ability to adapt dynamically to the system operating condition. ANN is suitable for the adaptive relaying and the detection of complex faults. The backpropagation algorithm based multi-layer perceptron is utilized for the learning process. It allows to make control to various protection functions. As expected, the simulation result demonstrate that this approach is useful and satisfactory.