• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.7
• /
• pp.1294-1303
• /
• 2009

This paper presents a new numerical algorithm for fault discrimination and fault location estimation when occur to arcing ground and arcing line to line on transmission lines. The object of this paper is developed from new numerical algorithm to calculate the fault distance and simultaneously to make a distinction between transient and permanent faults. so the first of object for propose algorithm would be distinguish the permanent from the transient faults. This arcing fault discrimination algorithm is used if calculated value of arc voltage amplitude is greater than product of arc voltage gradient and the length of the arc path, which is equal or greater than the flashover length of a suspension insulator string[1-3]. Also, each algorithm is separated from short distance and long distance. This is difference to with/without capacitance between short to long distance. To test the validity of the proposed algorithms, the results of algorithm testing through various computer simulations are given. The test was simulated in EMTP/ATP simulator under a number of scenarios and calculate of algorithm was used to MATLAB.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.7
• /
• pp.81-90
• /
• 2018

In this paper, reducing lense Vignetting effect and adaptive learning rate method are proposed to complement Scribner's neural network for nuc algorithm which is the effective algorithm in statistic SBNUC algorithm. Proposed reducing vignetting effect method is updated weight and bias each differently using different cost function. Proposed adaptive learning rate for updating weight and bias is using sobel edge detection method, which has good result for boundary condition of image. The ordinary statistic SBNUC algorithm has problem to compensate lense vignetting effect, because statistic algorithm is updated weight and bias by using gradient descent method, so it should not be effective for global weight problem same like, lense vignetting effect. We employ the proposed methods to Scribner's neural network method(NNM) and Torres's reducing ghosting correction for neural network nuc algorithm(improved NNM), and apply it to real-infrared detector image stream. The result of proposed algorithm shows that it has 10dB higher PSNR and 1.5 times faster convergence speed then the improved NNM Algorithm.

• Geophysics and Geophysical Exploration
• /
• v.21 no.1
• /
• pp.15-25
• /
• 2018

Seismic inversion is a high-resolution tool to delineate the subsurface structures which may contain oil or gas. On the other hand, marine controlled-source electromagnetic (mCSEM) inversion can be a direct tool to indicate hydrocarbon. Thus, the joint inversion using both EM and seismic data together not only reduces the uncertainties but also takes advantage of both data simultaneously. In this paper, we have developed a simultaneous joint inversion approach for the direct estimation of reservoir petrophysical parameters, by linking electromagnetic and seismic data through rock physics model. A cross-gradient constraint is used to enhance the resolution of the inversion image and the maximum likelihood principle is applied to the relative weighting factor which controls the balance between two disparate data. By applying the developed algorithm to the synthetic model simulating the simplified gas field, we could confirm that the high-resolution images of petrophysical parameters can be obtained. However, from the other test using the synthetic model simulating an anticline reservoir, we noticed that the joint inversion produced different images depending on the model constraint used. Therefore, we modified the algorithm which has different model weighting matrix depending on the type of model parameters. Smoothness constraint and Marquardt-Levenberg constraint were applied to the water-saturation and porosity, respectively. When the improved algorithm is applied to the anticline model again, reliable porosity and water-saturation of reservoir were obtained. The inversion results indicate that the developed joint inversion algorithm can be contributed to the calculation of the accurate oil and gas reserves directly.

• Korean Journal of Optics and Photonics
• /
• v.34 no.1
• /
• pp.1-12
• /
• 2023

In this study, we propose a hybrid phase-control algorithm for multi-channel coherent beam combining (CBC) system by combining the covariant matrix adaption evolution strategy (CMA-ES) and stochastic parallel gradient descent (SPGD) algorithms and analyze its operational performance. The proposed hybrid CMA-ES/SPGD algorithm is a sequential process which initially runs the CMA-ES algorithm until the combined final output intensity reaches a preset interim value, and then switches to running the SPGD algorithm to the end of the whole process. For ideal 7-channel and 19-channel all-fiber-based CBC systems, we have found that the mean convergence time can be reduced by about 10% in comparison with the case when the SPGD algorithm is implemented alone. Furthermore, we analyzed a more realistic situation in which some additional phase noise was introduced in the same CBC system. As a result, it is shown that the proposed algorithm reduces the mean convergence time by about 17% for a 7-channel CBC system and 16-27% for a 19-channel system compared to the existing SPGD alone algorithm. We expect that for implementing a CBC system in a real outdoor environment where phase noise cannot be ignored, the hybrid CMA-ES/SPGD algorithm proposed in this study will be exploited very usefully.

• Journal of Korean Society of Transportation
• /
• v.22 no.1 s.72
• /
• pp.43-62
• /
• 2004

Conventionally the estimation method of the origin-destination Matrix has been developed by implementing the expansion of sampled data obtained from roadside interview and household travel survey. In the survey process, the bigger the sample size is, the higher the level of limitation, due to taking time for an error test for a cost and a time. Estimating the O-D matrix from observed traffic count data has been applied as methods of over-coming this limitation, and a gradient model is known as one of the most popular techniques. However, in case of the gradient model, although it may be capable of minimizing the error between the observed and estimated traffic volumes, a prior O-D matrix structure cannot maintained exactly. That is to say, unwanted changes may be occurred. For this reason, this study adopts a conjugate gradient algorithm to take into account two factors: estimation of the O-D matrix from the conjugate gradient algorithm while reflecting the prior O-D matrix structure maintained. This development of the O-D matrix estimation model is to minimize the error between observed and estimated traffic volumes. This study validates the model using the simple network, and then applies it to a large scale network. There are several findings through the tests. First, as the consequence of consistency, it is apparent that the upper level of this model plays a key role by the internal relationship with lower level. Secondly, as the respect of estimation precision, the estimation error is lied within the tolerance interval. Furthermore, the structure of the estimated O-D matrix has not changed too much, and even still has conserved some attributes.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.537-542
• /
• 2001

In recent engineering, the designer has become more and more dependent on computer simulation. But defining exact model using computer simulation is too expensive and time consuming in the complicate systems. Thus, designers often use approximation models, which express the relation between design variables and response variables. These models are called metamodel. In this paper, we introduce one of the metamodel, named Kriging. This model employs an interpolation scheme and is developed in the fields of spatial statistics and geostatistics. This class of interpolating model has flexibility to model response data with multiple local extreme. By reason of this multi modality, we can't use any gradient-based optimization algorithm to find global extreme value of this model. Thus we have to introduce global optimization algorithm. To do this, we introduce DE(Differential Evolution). DE algorithm is developed by Ken Price and Rainer Storn, and it has recently proven to be an efficient method for optimizing real-valued multi-modal objective functions. This algorithm is similar to GA(Genetic Algorithm) in populating points, crossing over, and mutating. But it introduces vector concept in populating process. So it is very simple and easy to use. Finally, we show how we determine Kriging metamodel and find global extreme value through two mathematical examples.

• Korean Journal of Artificial Intelligence
• /
• v.5 no.1
• /
• pp.18-28
• /
• 2017

Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a large number of entity. Less data set have large generalization errors due to overfitting. In order to minimize this generalization error, this study proposed DGA which can expect relatively high accuracy even though data with a less data set is applied to machine learning based genetic algorithm to deep learning based dropout. The idea of this paper is to determine the active state of the nodes. Using Gradient about loss function, A new fitness function is defined. Proposed Algorithm DGA is supplementing stochastic inconsistency about Dropout. Also DGA solved problem by the complexity of the fitness function and expression range of the model about Genetic Algorithm As a result of experiments using MNIST data proposed algorithm accuracy is 75.3%. Using only Dropout algorithm accuracy is 41.4%. It is shown that DGA is better than using only dropout.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.2 s.314
• /
• pp.11-18
• /
• 2007

Back propagation algorithm based on a gradient-decent method has been widely used to the training of a neural network. However, this algorithm have some problems such as dropping the minimum value in a local area according to an initial value and setting the number of units in a hidden layer when training the neural network. Accordingly, to solve the above-mentioned problems, this paper proposes a genetic algorithm using the training method of the neural network. Thus, the improved genetic algorithm using a new crossover and mutation method is proposed to discriminate 3 bit parity. Experiments confirm that the proposed system is effective for training speed after demonstrating for generation gap, the number of units in the hidden layer, and the number of individuals.

• Computers and Concrete
• /
• v.34 no.4
• /
• pp.477-487
• /
• 2024

The in-situ stresses of concrete are an essential index for assessing the safety performance of concrete structures. Conventional methods for pore pressure release often face challenges in selecting drilling ring parameters, uncontrollable stress release, and unstable detection accuracy. In this paper, the parameters affecting the results of the concrete ring hole stress release method are cross-combined, and finite elements are used to simulate the combined parameters and extract the stress release values to establish a training set. The GridSearchCV function is utilized to determine the optimal hyperparameters. The mean absolute error (MAE), root mean square error (RMSE), and coefficient of determination (R²) are used as evaluation indexes to train the gradient boosting decision tree (GBDT) algorithm, and the other three common algorithms are compared. The RMSE of the GBDT algorithm for the test set is 4.499, and the R² of the GBDT algorithm for the test set is 0.962, which is 9.66% higher than the R² of the best-performing comparison algorithm. The model generated by the GBDT algorithm can accurately calculate the concrete in-situ stresses based on the drilling ring parameters and the corresponding stress release values and has a high accuracy and generalization ability.

• Journal of Korea Multimedia Society
• /
• v.21 no.5
• /
• pp.617-625
• /
• 2018

Phishing website has become a crucial concern in cyber security applications. It is performed by fraudulently deceiving users with the aim of obtaining their sensitive information such as bank account information, credit card, username, and password. The threat has led to huge losses to online retailers, e-business platform, financial institutions, and to name but a few. One way to build anti-phishing detection mechanism is to construct classification algorithm based on machine learning techniques. The objective of this paper is to compare different classifier ensemble approaches, i.e. random forest, rotation forest, gradient boosted machine, and extreme gradient boosting against single classifiers, i.e. decision tree, classification and regression tree, and credal decision tree in the case of website phishing. Area under ROC curve (AUC) is employed as a performance metric, whilst statistical tests are used as baseline indicator of significance evaluation among classifiers. The paper contributes the existing literature on making a benchmark of classifier ensembles for web phishing detection.