• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.559-570
• /
• 2003

Automation of programming-error detection is an important part of intelligent programming language tutoring systems. In this paper, a new programming error detection approach for novice programmers is proposed by plan matching and program execution. Program execution result is used to resolve the restricted programming plan representation and to provide a confirming evidence for the plan matching differences. By checking the values of shared variable between the related plans, we can detect the cause-effect relationship between the plans. With this relationship and the test data, we can explain the program's unexpected behaviors according to the bug's cause and resulting effects.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.23 no.3
• /
• pp.331-340
• /
• 2005

Digital map is very important digital geographic information which is the base for various fields such as building and using the geographic information system (GIS), planing the regional development, and etc. Therefore, it needs high accuracy. Then we offer the advanced technique which minimizes errors on digital maps, using the automated inspection through the whole figures. In addition this new technique raises the economical efficiency as well as accuracy applying the automated error detection method which can recognize, search and classify errors automatically.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.461-471
• /
• 2004

In recent years, large volumes of data are transferred between a computer system and various subsystems through digital logic circuits and interconnected wires. And there always exist potential errors when data are transferred due to electrical noise, device malfunction, or even timing errors. In general, parity checking circuits are usually employed for detection of single-bit errors. However, it is not sufficient to enhance system reliability and availability for efficient error detection. It is necessary to detect and further correct errors up to a certain level within the affordable cost. In this paper, we report a generation of 3-distance code using the characteristic matrix of a PBCA.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.44-50
• /
• 2017

Pedestrian detection, an important component of autonomous driving and driving assistant system, has been extensively studied for many years. In particular, image based pedestrian detection methods such as Hierarchical classifier or HOG and, deep models such as ConvNet are well studied. The evaluation score has increased by the various methods. However, pedestrian detection requires high sensitivity to errors, since small error can lead to life or death problems. Consequently, further reduction in pedestrian detection error rate of autonomous systems is required. We proposed a new method to detect pedestrians and reduce the error rate by using the Faster R-CNN with new developed pedestrian training data sets. Finally, we compared the proposed method with the previous models, in order to show the improvement of our method.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.143-152
• /
• 2007

In this paper, we propose a time-varying modified minimum mean-squared error (MMSE) detector for the detection of higher data rate signals in a multirate asynchronous code-division multiple-access (CDMA) system which is signaled in a fast Rayleigh fading channel. The interference viewed by a higher data rate symbol will be periodic due to the presence of a lower data rate symbol which spans multiple higher data rate symbols. The detection is carried out on the basis of a modified MMSE criterion which incorporates differential detection and the ratio of channel coefficients in two consecutive observation intervals inherently compensating the fast variation of the channel due to fading. The numerical results obtained by the MMSE detector with time-varying detection show around 3 dB (M=2) and 6 dB (M=4) performance improvement at a BER of $10^{-3}$ in the AWGN channel, while introducing more computational complexity than the MMSE detector without time-varying detection. At a higher $E_b/N_0$, the proposed scheme can achieve a BER of approximately $10^{-3}$ in the presence of fast channel variation which is an improvement over other schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.3889-3903
• /
• 2022

To address the problem of low detection accuracy due to training noise caused by mislabeling when Tri-training for network intrusion detection (NID), we propose a Tri-training algorithm based on cross entropy and K-nearest neighbors (TCK) for network intrusion detection. The proposed algorithm uses cross-entropy to replace the classification error rate to better identify the difference between the practical and predicted distributions of the model and reduce the prediction bias of mislabeled data to unlabeled data; K-nearest neighbors are used to remove the mislabeled data and reduce the number of mislabeled data. In order to verify the effectiveness of the algorithm proposed in this paper, experiments were conducted on 12 UCI datasets and NSL-KDD network intrusion datasets, and four indexes including accuracy, recall, F-measure and precision were used for comparison. The experimental results revealed that the TCK has superior performance than the conventional Tri-training algorithms and the Tri-training algorithms using only cross-entropy or K-nearest neighbor strategy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.600-619
• /
• 2015

We propose a cost-efficient hybrid algorithm for online location updates that efficiently combines feature point detection with the online trajectory-based sampling algorithm. Our algorithm is designed to minimize the average trajectory error with the minimal number of sample points. The algorithm is composed of 3 steps. First, we choose corner points from the map as sample points because they will most likely cause fewer trajectory errors. By employing the online trajectory sampling algorithm as the second step, our algorithm detects several missing and important sample points to prevent unwanted trajectory errors. The final step improves cost efficiency by eliminating redundant sample points on straight paths. We evaluate the proposed algorithm with real GPS trajectory data for various bus routes and compare our algorithm with the existing one. Simulation results show that our algorithm decreases the average trajectory error 28% compared to the existing one. In terms of cost efficiency, simulation results show that our algorithm is 29% more cost efficient than the existing one with real GPS trajectory data.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.2
• /
• pp.199-207
• /
• 2010

Recently, large amount of information in IDS(Intrusion Detection System) can be un manageable and also be mixed with false prediction error. In this paper, we propose a data mining methodology for IDS, which contains uncertainty based on training process and post-processing analysis additionally. Our system is trained to classify the existing attack for misuse detection, to detect the new attack pattern for anomaly detection, and to define border patter between attack and normal pattern. In experimental results show that our approach improve the performance against existing attacks and new attacks, from 0.62 to 0.84 about 35%.

• Korean Journal of Remote Sensing
• /
• v.38 no.5_3
• /
• pp.967-977
• /
• 2022

The occurrence and intensity of wildfires are increasing with climate change. Emissions from forest fire smoke are recognized as one of the major causes affecting air quality and the greenhouse effect. The use of satellite product and machine learning is essential for detection of forest fire smoke. Until now, research on forest fire smoke detection has had difficulties due to difficulties in cloud identification and vague standards of boundaries. The purpose of this study is to detect forest fire smoke using Level 1 and Level 2 data of Geostationary Environment Monitoring Spectrometer (GEMS), a Korean environmental satellite sensor, and machine learning. In March 2022, the forest fire in Gangwon-do was selected as a case. Smoke pixel classification modeling was performed by producing wildfire smoke label images and inputting GEMS Level 1 and Level 2 data to the random forest model. In the trained model, the importance of input variables is Aerosol Optical Depth (AOD), 380 nm and 340 nm radiance difference, Ultra-Violet Aerosol Index (UVAI), Visible Aerosol Index (VisAI), Single Scattering Albedo (SSA), formaldehyde (HCHO), nitrogen dioxide (NO₂), 380 nm radiance, and 340 nm radiance were shown in that order. In addition, in the estimation of the forest fire smoke probability (0 ≤ p ≤ 1) for 2,704 pixels, Mean Bias Error (MBE) is -0.002, Mean Absolute Error (MAE) is 0.026, Root Mean Square Error (RMSE) is 0.087, and Correlation Coefficient (CC) showed an accuracy of 0.981.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.133-140
• /
• 2016

In active sonar field, a target detection and localization based on a distributed sensor network has been much studied for the underwater surveillance of the coast. Zhou et al. proposed a target localization method utilizing the positions of target-detected sensors in distributed sensor network which consists of detection-only sensors. In contrast with a conventional method, Zhou's method dose not require to estimate the propagation model parameters of detection signal. Also it needs the lower computational complexity, and to transmit less data between network nodes. However, it has large target localization error. So it has been modified for reducing localization error by Ryu. Modified Zhou's method has better estimation performance than Zhou's method, but still relatively large estimation error. In this paper, a target localization method based on modified Zhou's method is proposed for reducing the localization error. The proposed method utilizes the geometry of the positions of target-detected sensors and a line that represents the bearing of target, a line can be found by modified Zhou's method. This paper shows that the proposed method has better target position estimation performance than Zhou's and modified Zhou's method by computer simulations.