• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1462-1470
• /
• 2003

According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.6
• /
• pp.118-133
• /
• 2020

Research interest in the Mobility-as-a-Service (MaaS) concept for enhancing users' mobility experience is increasing. In particular, dynamic pricing techniques based on reinforcement learning have emerged since adjusting prices based on the demand is expected to help mobility services, such as taxi and car-sharing services, to gain more profit. This paper provides a simulation framework that considers more practical factors, such as demand density per location, preferred prices, the distance between users and drivers, and distance to the destination that critically affect the probability of matching between the users and the mobility service providers (e.g., drivers). The aforementioned new practical features are reflected on a data structure referred to as the Matching Matrix. Using an efficient algorithm of computing the probability of matching between the users and drivers and given a set of precisely identified high-demand locations using HDBSCAN, this study developed a better reward function that can gear the reinforcement learning process towards finding more realistic dynamic pricing policies.

• Journal of Power System Engineering
• /
• v.14 no.6
• /
• pp.83-88
• /
• 2010

The wear behavior of epoxy matrix composites filled with nano sized silica particles is discussed in this paper. Especially, the variation of the coefficient of friction and the wear resistance according to the change of apply load and sliding velocity were investigated for these materials. Wear tests of pin-on-disc mode were carried out and the wear test results exhibited as following ; The epoxy matrix composites showed lower coefficient of friction compared to the neat epoxy through the whole sliding distance. As increasing the sliding velocity the epoxy matrix composites indicated lower coefficient of friction, whereas the neat epoxy showed higher coefficient of friction as increasing the sliding velocity. The specific friction work of both materials were increased with apply load. In case of the epoxy matrix composites, the running in periods of friction were reduced as increase in apply load. The epoxy matrix composites were improved the wear resistance by adding the nano silica particles remarkably. It is expected that the load carrying capacity of the epoxy matrix composites will be improved by increase of Pv factor.

• Geomechanics and Engineering
• /
• v.37 no.4
• /
• pp.395-418
• /
• 2024

The epicentral region of earthquakes is typically where liquefaction-related damage takes place. To determine the maximum distance, such as maximum epicentral distance (R_e), maximum fault distance (R_f), or maximum hypocentral distance (R_h), at which an earthquake can inflict damage, given its magnitude, this study, using a recently updated global liquefaction database, multiple ML models are built to predict the limiting distances (R_e, R_f, or R_h) required for an earthquake of a given magnitude to cause damage. Four machine learning models LSTM (Long Short-Term Memory), BiLSTM (Bidirectional Long Short-Term Memory), CNN (Convolutional Neural Network), and XGB (Extreme Gradient Boosting) are developed using the Python programming language. All four proposed ML models performed better than empirical models for limiting distance assessment. Among these models, the XGB model outperformed all the models. In order to determine how well the suggested models can predict limiting distances, a number of statistical parameters have been studied. To compare the accuracy of the proposed models, rank analysis, error matrix, and Taylor diagram have been developed. The ML models proposed in this paper are more robust than other current models and may be used to assess the minimal energy of a liquefaction disaster caused by an earthquake or to estimate the maximum distance of a liquefied site provided an earthquake in rapid disaster mapping.

• Journal of Broadcast Engineering
• /
• v.24 no.4
• /
• pp.580-591
• /
• 2019

This paper focuses on to improving object detection performance using the camera and LiDAR on autonomous vehicle platforms by fusing detected objects from individual sensors through a late fusion approach. In the case of object detection using camera sensor, YOLOv3 model was employed as a one-stage detection process. Furthermore, the distance estimation of the detected objects is based on the formulations of Perspective matrix. On the other hand, the object detection using LiDAR is based on K-means clustering method. The camera and LiDAR calibration was carried out by PnP-Ransac in order to calculate the rotation and translation matrix between two sensors. For Sensor fusion, intersection over union(IoU) on the image plane with respective to the distance and angle on world coordinate were estimated. Additionally, all the three attributes i.e; IoU, distance and angle were fused using logistic regression. The performance evaluation in the sensor fusion scenario has shown an effective 5% improvement in object detection performance compared to the usage of single sensor.

• The Korean Journal of Applied Statistics
• /
• v.25 no.3
• /
• pp.531-541
• /
• 2012

In this study, we consider various methods to estimate the weights of a pairwise comparison matrix in the Analytic Hierarchy Process widely applied in various decision-making fields. This paper uses a data dependent simulation to evaluate the statistical accuracy, minimum violation and minimum norm of the obtaining weight methods from a reciprocal symmetric matrix. No method dominates others in all criteria. Least squares methods perform best in point of mean squared errors; however, the eigenvectors method has an advantage in the minimum norm.

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.11
• /
• pp.57-60
• /
• 1991

A new approach to texture classification for ultrasound liver diagnosis using run difference matrix was developed. The run difference matrix consists of the gray level difference along with distance. From this run difference matrix, we defined several parameters such as LDE, LDEL, NUF, SMO, SMG, SHP etc. and three vectors namely DOD, DGD and DAD. Each parameter value calculated in fatty cirrhotic, chronic hepatitic and normal liver mage was plotted in two dimensional plane. We compared our results with run length method. There are several advantages of run difference matrix method over the run lengths. 1) It is more sensitive to small difference of gray level distribution. 2) The parameters provide more statistically significant value. Images were classified with the extracted parameters to each diseases using neural networks. In preliminary clinical exprements, this approach showed satisfying results.

• Journal of the Korean Statistical Society
• /
• v.36 no.4
• /
• pp.457-469
• /
• 2007

Many procedures are available to identify a single outlier or an isolated influential point in linear regression and logistic regression. But the detection of influential points or multiple outliers is more difficult, owing to masking and swamping problems. The multiple outlier detection methods for logistic regression have not been studied from the points of direct procedure yet. In this paper we consider the direct methods for logistic regression by extending the $Pe\tilde{n}a$ and Yohai (1995) influence matrix algorithm. We define the influence matrix in logistic regression by using Cook's distance in logistic regression, and test multiple outliers by using the mean shift model. To show accuracy of the proposed multiple outlier detection algorithm, we simulate artificial data including multiple outliers with masking and swamping.

• Journal of the Korean Magnetics Society
• /
• v.5 no.5
• /
• pp.376-379
• /
• 1995

Employing the muffin-tin-orbital theory combined with pseudo-potential concepts, we have evaluated hybridization matrix elements between R and T sites in $RT_{2}$ compounds. The matrix elements are calculated with two parameters, the interatomic distance between R and T atoms from the crystal structure data, and the expectation values of the radial distances for the radial wave functions of the ground state charge densities, which are obtained from the linearized muffin-tin orbital band method within the local density approximation. It is found that the R 4f/T 3d hybridization matrix elements decrease with an increasing atomic number from R=Ce to Gd, and that they are smaller in $RNi_{2}$ than in $RCo_{2}$, which are consistent with trends observed in recent photoemission spectroscopy experiments. It is also found that the magnitudes of the hybridization matrix elements in $RFe_{2}$ are comparable to those in $RNi_{2}$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.3
• /
• pp.107-116
• /
• 2021

We introduce optimization algorithms using Bregman Divergence for solving non-negative matrix factorization (NMF) problems. Bregman divergence is known a generalization of some divergences such as Frobenius norm and KL divergence and etc. Some algorithms can be applicable to not only NMF with Frobenius norm but also NMF with more general Bregman divergence. Matrix Factorization is a popular non-convex optimization problem, for which alternating minimization schemes are mostly used. We develop the Bregman proximal gradient method applicable for all NMF formulated in any Bregman divergences. In the derivation of NMF algorithm for Bregman divergence, we need to use majorization/minimization(MM) for a proper auxiliary function. We present algorithmic aspects of NMF for Bregman divergence by using MM of auxiliary function.