• Journal of Convergence for Information Technology
• /
• v.9 no.6
• /
• pp.1-6
• /
• 2019

In this study, the development of a weight estimation model of electronic scale with nonlinear characteristics is presented using polynomial regression analysis. The output voltage of the load cell was measured directly using the reference mass. And a polynomial regression model was obtained using the matrix and curve fitting function of MS Office Excel. The weight was measured in 100g units using a load cell electronic scale measuring up to 5kg and the polynomial regression model was obtained. The error was calculated for simple($1^{st}$), $2^{nd}$ and $3^{rd}$ order polynomial regression. To analyze the suitability of the regression function for each model, the coefficient of determination was presented to indicate the correlation between the estimated mass and the measured data. Using the third order polynomial model proposed here, a very accurate model was obtained with a standard deviation of 10g and the determinant coefficient of 1.0. Based on the theory of multi regression model presented here, it can be used in various statistical researches such as weather forecast, new drug development and economic indicators analysis using logistic regression analysis, which has been widely used in artificial intelligence fields.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.3-10
• /
• 2008

The choice of basis for representation of element in $GF(2^m)$ affects the efficiency of a multiplier. Among them, a multiplier using redundant representation efficiently supports trade-off between the area complexity and the time complexity since it can quickly carry out modular reduction. So time of a previous multiplier using redundant representation is faster than time of multiplier using others basis. But, the weakness of one has a upper space complexity compared to multiplier using others basis. In this paper, we propose a new efficient multiplier with consideration that polynomial exponentiation operations are frequently used in cryptographic hardwares. The proposed multiplier is suitable fer left-to-right exponentiation environment and provides efficiency between time and area complexity. And so, it has both time delay of $T_A+({\lceil}{\log}_2m{\rceil})T_x$ and area complexity of (2m-1)(m+s). As a result, the proposed multiplier reduces $2(ms+s^2)$ compared to the previous multiplier using equally-spaced polynomials in area complexity. In addition, it reduces $T_A+({\lceil}{\log}_2m+s{\rceil})T_x$ to $T_A+({\lceil}{\log}_2m{\rceil})T_x$ in the time complexity.($T_A$:Time delay of one AND gate, $T_x$:Time delay of one XOR gate, m:Degree of equally spaced irreducible polynomial, s:spacing factor)

• Journal of Korean Society of Environmental Engineers
• /
• v.31 no.9
• /
• pp.825-830
• /
• 2009

Pharmaceutical compounds enter the water environment through the diverse pathways. Because their concentration in the water environment was frequently detected in the level of ppt to ppb, the monitoring system should be optimized as much as possible for finding appropriate management policies and technical solutions. One Factor At a Time (OFAT) approach approximating the response with a single variable has been preferred for the optimization of LC-MS/MS operational conditions. However, it is common that variables in analytical instruments are interdependent. Therefore, the best condition could be found by using the statistical optimization method changing multiple variables at a time. In this research, response surface analysis (RSA) was applied to the LC-MS/MS analysis of emerging antibiotic compound, sulfamethoxazole, for the best sensitivity. In the screening test, fragmentation energy and collision voltage were selected as independent variables. They were changed simultaneously for the statistical optimization and a polynomial equation was fit to the data set. The correlation coefficient, $R^2$ valuerepresented 0.9947 and the error between the predicted and observed value showed only 3.41% at the random condition, fragmentation energy of 60 and collision voltage of 17 eV. Therefore, it was concluded that the model derived by RSA successfully predict the response. The optimal conditions identified by the model were fragmentation energy of 116.6 and collision voltage of 10.9 eV. This RSA can be extensively utilized for optimizing conditions of solid-phase extraction and liquid chromatography.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.4
• /
• pp.591-599
• /
• 2023

Due to the recent attack by Castryck-Decru, the private key of SIDH can be recovered in polynomial time so several methods have been proposed to prevent the attack. Among them, M-SIDH proposed by Fouotsa et al, counteracts the attack by masking the torsion point information during the key exchange. In this paper, we implement M-SIDH and evaluate its performance. To the best of our knowledge, this is the first implementation of M-SIDH in C language. Toward that end, we propose a method to select parameters for M-SIDH instantiation and propose a 1024-bit prime for implementation. We implemented the square-root Velu formula over the extension field for further optimization. As a result, 1129 ms is required for a key exchange in the case of MSIDH-1024, providing the classic 64-bit security level.

• Journal of Biomedical Engineering Research
• /
• v.32 no.3
• /
• pp.245-250
• /
• 2011

Parallel imaging technique can provide several advantages for a multitude of MRI applications. Especially, in SENSE technique, sensitivity maps were always required in order to determine the reconstruction matrix, therefore, a number of difference approaches using sensitivity information from coils have been demonstrated to improve of image quality. Moreover, many filtering methods were proposed such as adaptive matched filter and nonlinear diffusion technique to optimize the suppression of background noise and to improve of image quality. In this study, we performed SENSE reconstruction using computer simulations to confirm the most suitable method for the feasibility of filtering effect and according to changing order of polynomial fit that were applied on variation of spatial resolution of sensitivity map. The image was obtained at 0.32T(Magfinder II, Genpia, Korea) MRI system using spin-echo pulse sequence(TR/TE = 500/20 ms, FOV = 300 mm, matrix = $128{\times}128$, thickness = 8 mm). For the simulation, obtained image was multiplied with four linear-array coil sensitivities which were formed of 2D-gaussian distribution and the image was complex white gaussian noise was added. Image processing was separated to apply two methods which were polynomial fitting and filtering according to spatial resolution of sensitivity map and each coil image was subsampled corresponding to reduction factor(r-factor) of 2 and 4. The results were compared to mean value of geomety factor(g-factor) and artifact power(AP) according to r-factor 2 and 4. Our results were represented while changing of spatial resolution of sensitivity map and r-factor, polynomial fit methods were represented the better results compared with general filtering methods. Although our result had limitation of computer simulation study instead of applying to experiment and coil geometric array such as linear, our method may be useful for determination of optimal sensitivity map in a linear coil array.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.326-334
• /
• 2008

This paper proposes a method for generating a basis translation matrix between isomorphic extension fields. To generate a basis translation matrix, we need the equality correspondence of a basis between the isomorphic extension fields. Consider an extension field $F_{p^m}$ where p is characteristic. As a brute force method, when $p^m$ is small, we can check the equality correspondence by using the minimal polynomial of a basis element; however, when $p^m$ is large, it becomes too difficult. The proposed methods are based on the fact that Type I and Type II optimal normal bases (ONBs) can be easily identified in each isomorphic extension field. The proposed methods efficiently use Type I and Type II ONBs and can generate a pair of basis translation matrices within 15 ms on Pentium 4 (3.6 GHz) when $mlog_2p$ = 160.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.159-167
• /
• 2006

The transform domain characterization of cyclic codes over finite fields using Discrete Fourier Transform(DFT) over an appropriate extension field is well known. In this paper, we extend this transform domain characterization for cyclic codes over $F_p + uF_p +... + u^{k-l}F_p$. We give a way to characterize cyclic codes over $F_p + uF_p +... + u^{k-l}F_p$ by Mattson-Solomon polynomials and multiple defining sets.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.4
• /
• pp.682-691
• /
• 2017

In this paper, we propose the fusion design methodology of both pedestrian detection and object tracking system realized with the aid of HOG-PCA based RBFNN pattern classifier. The proposed system includes detection and tracking parts. In the detection part, HOG features are extracted from input images for pedestrian detection. Dimension reduction is also dealt with in order to improve detection performance as well as processing speed by using PCA which is known as a typical dimension reduction method. The reduced features can be used as the input of the FCM-based RBFNNs pattern classifier to carry out the pedestrian detection. FCM-based RBFNNs pattern classifier consists of condition, conclusion, and inference parts. FCM clustering algorithm is used as the activation function of hidden layer. In the conclusion part of network, polynomial functions such as constant, linear, quadratic and modified quadratic are regarded as connection weights and their coefficients of polynomial function are estimated by LSE-based learning. In the tracking part, object tracking algorithms such as mean shift(MS) and cam shift(CS) leads to trace one of the pedestrian candidates nominated in the detection part. Finally, INRIA person database is used in order to evaluate the performance of the pedestrian detection of the proposed system while MIT pedestrian video as well as indoor and outdoor videos obtained from IC&CI laboratory in Suwon University are exploited to evaluate the performance of tracking.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.80-80
• /
• 2013

대규모 광도곡선 자료에서 다양한 주기변광성들의 정확한 주기를 효율적으로 검출하는 실험을 시도하였다. 실험을 위해 OGLE-III 맥동 변광성(RR Lyrae, Delta Scuti, Cepheid) 목록 중, I 필터로 관측된 총 31,324개의 광도 곡선을 사용하였다. 이 실험에 사용한 주기분석 알고리즘 MS_Period(Multi-Step period searching method)는 주기를 놓치지 않기 위해 두 가지 다른 방법(Multi Polynomial function, Phase Dispersion)으로 후보 주기를 구하고 정밀주기를 도출하기 위해 후보 주기 주변부를 Spline fitting을 통해 재탐색하는 방법이다. 기존의 MS_Period 방식은 주기 탐색 간격(dP/P)이 일정하였으나, 우리는 탐색 주기 구간을 나누고 짧은 주기에서는 작은 간격으로, 긴 주기에서는 보다 넓은 간격으로 주기를 탐색하는 과정을 추가하였다. 그 결과 98% 이상의 별에서 OGLE-III와 거의 일치하는 주기를 얻었으며, 긴 주기에서의 불필요한 정밀 탐색을 회피함으로써 분석시간도 단축되었다. 주기 결정이 어려운 경우들은 주로 1) periodogram에서 실제 주기가 아닌 1일 근처에서 noise보다 큰 peak가 보이는 경우, 2) 하나의 별에 대해 여러 주기가 비슷한 Phase diagram을 보이고, periodogram에서도 비슷한 peak를 갖는 경우, 3) OGLE-III의 주기와 전혀 다른 주기만 찾은 경우, 4) OGLE-III에서 제시하지 않은 혼합된 주기의 존재가 의심되는 경우인 것을 확인하였고, 각 사례들의 특징을 살펴보았다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.950-975
• /
• 2016

Device-to-Device (D2D) communication underlaying cellular networks is a promising add-on component for future radio communication systems. It provides more access opportunities for local device pairs and enhances system throughput (ST), especially when mobile relays (MR) are further enabled to facilitate D2D links when the channel condition of their desired links is unfavorable. However, mutual interference is inevitable due to spectral reuse, and moreover, selecting a suitable transmission mode to benefit the correlated resource allocation (RA) is another difficult problem. We aim to optimize ST of the hybrid system via joint consideration of mode selection (MS) and RA, which includes admission control (AC), power control (PC), channel assignment (CA) and relay selection (RS). However, the original problem is generally NP-hard; therefore, we decompose it into two parts where a hierarchical structure exists: (i) PC is mode-dependent, but its optimality can be perfectly addressed for any given mode with additional AC design to achieve individual quality-of-service requirements. (ii) Based on that optimality, the joint design of MS, CA and RS can be viewed from the graph perspective and transferred into the maximum weighted independent set problem, which is then approximated by our greedy algorithm in polynomial-time. Thanks to the numerical results, we elucidate the efficacy of our mechanism and observe a resulting gain in MR-aided D2D communication.