• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.4
• /
• pp.68-74
• /
• 1999

Ths paper does acoustic detection of partial discharge using acoustic sensor in polymer. Time sequential rreasurement of acoustic emission characteristic obtained acoustic sensor deal with statistics process. and 5 characteristic quantities were introduced into this paper. Resulting fann analysis of $\psi$-AEA-n pattern (phase-acoustic emission amplitude-pulse number) and AE quantities ,it can know useful statistics quantities that AE average inception amplitude TEX>$(\overline{AEA_{inc}})$ and AE average maximum amplitude TEX>$(\overline{AEA_{max}})$ make diagnosis of the middle stage of deterioration, AE pulse number and AE average maximum phase $(\overline{\theta{max}})$ make diagnosis of the last stage of deterioration. it obtained that these AE quantities are useful for dias,mosis deterioration form experiment results.esults.

• Journal of Communications and Networks
• /
• v.14 no.5
• /
• pp.481-486
• /
• 2012

Accurate and efficient estimation of the number of sources is critical for providing the parameter of targets in problems of array signal processing and blind source separation among other such problems. When conventional estimators work in unfavorable scenarios, e.g., at low signal-to-noise ratio (SNR), with a small number of snapshots, or for sources with a different strength, it is challenging to maintain good performance. In this paper, the detection limit of the minimum description length (MDL) estimator and the signal strength required for reliable detection are first discussed. Though a comparison, we analyze the reason that performances of classical estimators deteriorate completely in unfavorable scenarios. After discussing the limiting distribution of eigenvalues of the sample covariance matrix, we propose a new approach for estimating the number of sources which is based on a sequential hypothesis test. The new estimator performs better in unfavorable scenarios and is consistent in the traditional asymptotic sense. Finally, numerical evaluations indicate that the proposed estimator performs well when compared with other traditional estimators at low SNR and in the finite sample size case, especially when weak signals are superimposed on the strong signals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3771-3792
• /
• 2021

With the rapid development of science and technology, several high-performance networks have emerged with various new applications. Consequently, financially or socially motivated attacks on specific networks have also steadily become more complicated and sophisticated. To reduce the damage caused by such attacks, administration of network traffic flow in real-time and precise analysis of past attack traffic have become imperative. Although various traffic analysis methods have been studied recently, they continue to suffer from performance limitations and are generally too complicated to apply in existing systems. To address this problem, we propose a method to calculate the correlation between the malicious and normal flows and classify attack traffics based on the corresponding correlation values. In order to evaluate the performance of the proposed method, we conducted several experiments using examples of real malicious traffic and normal traffic. The evaluation was performed with respect to three metrics: recall, precision, and f-measure. The experimental results verified high performance of the proposed method with respect to first two metrics.

• The Korean Journal of Applied Statistics
• /
• v.35 no.1
• /
• pp.63-75
• /
• 2022

This paper proposes the so-called MOSUM-based sparse projection method for change points detection in high-dimensional time series. Our method is inspired by Wang and Samworth (2018), however, our method improves their method in two ways. One is to find change points all at once, so it minimizes sequential error. The other is localized so that more robust to the mean changes offsetting each other. We also propose data-driven threshold selection using block wild bootstrap. A comprehensive simulation study shows that our method performs reasonably well in finite samples. We also illustrate our method to stock prices consisting of S&P 500 index, and found four change points in recent 6 years.

• Journal of Korea Multimedia Society
• /
• v.25 no.9
• /
• pp.1257-1265
• /
• 2022

Recognition of sign language is challenging due to the occlusion of hands, accuracy of hand gestures, and high computational costs. In recent years, deep learning techniques have made significant advances in this field. Although these methods are larger and more complex, they cannot manage long-term sequential data and lack the ability to capture useful information through efficient information processing with faster convergence. In order to overcome these challenges, we propose a word-level sign language recognition (SLR) system that combines a real-time human pose detection library with the minimized version of the gated recurrent unit (GRU) model. Each gate unit is optimized by discarding the depth-weighted reset gate in GRU cells and considering only current input. Furthermore, we use sigmoid rather than hyperbolic tangent activation in standard GRUs due to performance loss associated with the former in deeper networks. Experimental results demonstrate that our pose-based optimized GRU (Pose-OGRU) outperforms the standard GRU model in terms of prediction accuracy, convergency, and information processing capability.

• Communications for Statistical Applications and Methods
• /
• v.30 no.4
• /
• pp.369-388
• /
• 2023

In this paper, we develop the two-step procedure that detects and estimates the position of structural changes for multivariate nonstationary time series, either on mean parameters or second-order structures. We first investigate the presence of mean structural change by monitoring data through the aggregated cumulative sum (CUSUM) type statistic, a sequential procedure identifying the likely position of the change point on its trend. If no mean change point is detected, the proposed method proceeds to scan the second-order structural change by modeling the multivariate nonstationary time series with a multivariate locally stationary Wavelet process, allowing the time-localized auto-correlation and cross-dependence. Under this framework, the estimated dynamic spectral matrices derived from the local wavelet periodogram capture the time-evolving scale-specific auto- and cross-dependence features of data. We then monitor the change point from the lower-dimensional approximated space of the spectral matrices over time by applying the dynamic principal component analysis. Different from existing methods requiring prior information on the type of changes between mean and covariance structures as an input for the implementation, the proposed algorithm provides the output indicating the type of change and the estimated location of its occurrence. The performance of the proposed method is demonstrated in simulations and the analysis of two real finance datasets.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.1
• /
• pp.133-146
• /
• 2015

Ever sophisticated e-finance fraud techniques have led to an increasing number of reported phishing incidents. Financial authorities, in response, have recommended that we enhance existing Fraud Detection Systems (FDS) of banks and other financial institutions. FDSs are systems designed to prevent e-finance accidents through real-time access and validity checks on client transactions. The effectiveness of an FDS depends largely on how fast it can analyze and detect abnormalities in large amounts of customer transaction data. In this study we detect fraudulent transaction patterns and establish detection rules through e-finance accident data analyses. Abnormalities are flagged by comparing individual client transaction patterns with client profiles, using the ruleset. We propose an effective flagging method that uses decision trees to normalize detection rules. In demonstration, we extracted customer usage patterns, customer profile informations and detection rules from the e-finance accident data of an actual domestic(Korean) bank. We then compared the results of our decision tree-normalized detection rules with the results of a sequential detection and confirmed the efficiency of our methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1485-1488
• /
• 1997

The capacity of memory chip has increased vert quickly and 64MDRAM becomes main product in semiconductor manufacturing lines consists of many sequential processes, including etching process. although it needs direct sensing of wafer state for the accurae detching, it depends on indirect esnsing and sample test because of the complexity of the plasma etching. This equipment receives the inner light of etch chamber through the viewport and convets it to the voltage inetnsity. In this paper, EDP voltage signal has a new role to detect etching failure. First, we gathered data(EPD sigal, etching time and etchrate) and then analyzed the relationships between the signal variatin and the etch rate using two neural network modeling. These methods enable to predict whether ething state is good or not per wafer. For experiments, it is used High Density Inductive coupled Plasma(HDICP) ethcing equipment. Experiments and results proved to be abled to determine the etching state of wafer on-line and analyze the causes by modeling and EPD signal data.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.217-220
• /
• 2005

이 논문에서는 새로운 약신호 검파 기법을 얻어, 그 기법과 국소 최적 검파 기법을 바탕으로 순차 검파 방식을 이끌어낸다. 먼저, 새로운 약신호 검파 기법을 제안하고, 흥미로운 문턱값 성질을 몇가지 밝힌다. 제안한 순차 검파 방식에서 쓰는 두 문턱값은 어떤 단계에 이르면 크기가 바뀌어, 결정을 무한히 미룰 때도 있는 순차 확률비 검파 방식이 지닌 문제점을 풀어준다.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.417-420
• /
• 1998

A heuristic sweeping algorithm for an autonomous smearing robot which executes the area filling task is proposed. This algorithm searches tracking points with the obstacle andenvironment wall while the robot tracking whole workspace, and finds sequential tracking line by sequentally connecting the tracking points in such a way that (1) the line should be never crossed, (2) the total tracking points should be is linked as short as possible, and (3) the tracking link should be cross over the obstacle in the work-space. If the line pass through the obstacle, hierarchical collision free algorithm proposed is implied. The proposed algorithm consists of (1) collision detection procedure, (2) obstacle map making procedures, (3) tracking points generation procedures for subgosls, (4) tracking points scanning procedures, and (5) obstacle avoidance procedure.