• Title/Summary/Keyword: Square root algorithm

Search Result 332, Processing Time 0.023 seconds

Ultrasonic Inspection of Internal Defects of Potatoes (초음파를 이용한 감자의 내부결함검사)

  • Kim, In-Hoon;Jung, Kyu-Hong;Jang, Kyung-Young;Seo, Ryun;Kim, Man-Soo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.3
    • /
    • pp.82-88
    • /
    • 2003
  • The nondestructive internal quality evaluation of agricultural products has been strongly required from the needs for individual inspection. Recently, the ultrasonic wave has been considered as a solution fur this problem, and an ultrasonic system was constructed for the ultrasonic NDE of fruits and vegetables in our previous work. In this paper, the practical applicability of our ultrasonic system is tested fur the inspection of internal defects (central cavity) in Atlantic potato. Sound speed and RMS of transmitted ultrasonic wave signal were measured and classification algorithm using 2 dimensional stochastic analysis. was presented. Experimental results showed greater value of sound speed and RMS (root mean square) of transmitted signal in normal samples than in abnormal samples with cavity. Also a stochastic method to distinguish normal and abnormal showed fault detection rate less than 5%.

A Consideration on Verification and Extension of Fermat's Factorization (페르마 인수분해 방법의 확장과 검증에 대한 고찰)

  • Jung, Seo-Hyun;Jung, Sou-Hwan
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.3
    • /
    • pp.3-8
    • /
    • 2010
  • There are some efficient brute force algorithm for factorization. Fermat's factorization is one of the way of brute force attack. Fermat's method works best when there is factor near the square-root. This paper shows that why Fermat's method is effective and verify that there are only one answer. Because there are only one answer, we can start Fermat's factorization anywhere. Also, we convert from factorization to finding square number.

Two Cubic Polynomials Selection for the Number Field Sieve (Number Field Sieve에서의 두 삼차 다항식 선택)

  • Jo, Gooc-Hwa;Koo, Nam-Hun;Kwon, Soon-Hak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10C
    • /
    • pp.614-620
    • /
    • 2011
  • RSA, the most commonly used public-key cryptosystem, is based on the difficulty of factoring very large integers. The fastest known factoring algorithm is the Number Field Sieve(NFS). NFS first chooses two polynomials having common root modulo N and consists of the following four major steps; 1. Polynomial Selection 2. Sieving 3. Matrix 4. Square Root, of which the most time consuming step is the Sieving step. However, in recent years, the importance of the Polynomial Selection step has been studied widely, because one can save a lot of time and memory in sieving and matrix step if one chooses optimal polynomial for NFS. One of the ideal ways of choosing sieving polynomial is to choose two polynomials with same degree. Montgomery proposed the method of selecting two (nonlinear) quadratic sieving polynomials. We proposed two cubic polynomials using 5-term geometric progression.

A Modulation and Channel State Estimation Algorithm Using the Received Signal Analysis in the Blind Channel (블라인드 채널에서 수신 신호 분석 기법을 사용한 변조 및 채널 상태 추정 알고리즘)

  • Cho, Minhwan;Nam, Haewoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1406-1409
    • /
    • 2016
  • In this paper, we propose the heuristic signal grouping algorithm to estimate channel state value over full blind communication situation which means that there is no information about the modulation scheme and the channel state information between the transmitter and the receiver. Hereafter, using the constellation rotation method and the probability density function(pdf) the modulation scheme is determined to perform automatic modulation classification(AMC). Furthermore, the modulation type and a channel state value estimation capability is evaluated by comparing the proposed scheme with other conventional techniques from the simulation results in terms of the symbol error rate(SER) and the root mean square error (RMSE).

A Study on Current Ripple Reduction Due to Offset Error in SRF-PLL for Single-phase Grid-connected Inverters (단상 계통연계형 인버터의 SRF-PLL 옵셋 오차로 인한 전류 맥동 저감에 관한 연구)

  • Hwang, Seon-Hwan;Hwang, Young-Gi;Kwon, Soon-Kurl
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.28 no.11
    • /
    • pp.68-76
    • /
    • 2014
  • This paper presents an offset error compensation algorithm for the accurate phase angle of the grid voltage in single-phase grid-connected inverters. The offset error generated from the grid voltage measurement process cause the fundamental harmonic component with grid frequency in the synchronous reference frame phase lock loop (PLL). As a result, the grid angle is distorted and the power quality in power systems is degraded. In addition, the dq-axis currents in the synchronous reference frame and phase current have the dc component, first and second order ripples compared with the grid frequency under the distorted grid angle. In this paper, the effects of the offset and scaling errors are analyzed based on the synchronous reference frame PLL. Particularly, the offset error can be estimated from the integrator output of the synchronous reference frame PLL and compensated by using proportional-integral controller. Moreover, the RMS (Root Mean Square) function is proposed to detect the offset error component. The effectiveness of the proposed algorithm is verified through simulation and experiment results.

The Real-Time Distance Relay Algorithm Using fault Location Estimation Information for Parallel Transmission Line (병행 2회선 송전선로에서 고장점 위치 추정정보를 이용한 실시간 거리계전 알고리즘)

  • 이재규;유석구
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.3
    • /
    • pp.183-192
    • /
    • 2003
  • This paper presents the real-time implemented distance relay algorithm which the fault distance is estimated with only local terminal information. When a single-phase-to-earth fault on a two-parallel transmission line occurs, the reach accuracy of distance relay is considerably affected by the unknown variables which are fault resistance, fault current at the fault point and zero- sequence current of sound line The zero-sequence current of sound line is estimated by using the zero sequence voltage which is measured by relaying location Also. the fault resistance is removed at the Process of numerical formula expansion. Lastly, the fault current through a fault point is expressed as a function of the zero-sequence current of fault line, zero-sequence current of sound line, and line, and fault distance. Therefore, the fault phase voltage can be expressed as the quadratic equation of the fault distance. The solution of this Quadratic equation is obtained by using a coefficient of the modified quadratic equation instead of using the square root solution method. After tile accurate fault distance is estimated. the mote accurate impedance is measured by using such an information.

Performance and Root Mean Squared Error of Kernel Relaxation by the Dynamic Change of the Moment (모멘트의 동적 변환에 의한 Kernel Relaxation의 성능과 RMSE)

  • 김은미;이배호
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.5
    • /
    • pp.788-796
    • /
    • 2003
  • This paper proposes using dynamic momentum for squential learning method. Using The dynamic momentum improves convergence speed and performance by the variable momentum, also can identify it in the RMSE(root mean squared error). The proposed method is reflected using variable momentum according to current state. While static momentum is equally influenced on the whole, dynamic momentum algorithm can control the convergence rate and performance. According to the variable change of momentum by training. Unlike former classification and regression problems, this paper confirms both performance and regression rate of the dynamic momentum. Using RMSE(root mean square error ), which is one of the regression methods. The proposed dynamic momentum has been applied to the kernel adatron and kernel relaxation as the new sequential learning method of support vector machine presented recently. In order to show the efficiency of the proposed algorithm, SONAR data, the neural network classifier standard evaluation data, are used. The simulation result using the dynamic momentum has a better convergence rate, performance and RMSE than those using the static moment, respectively.

  • PDF

Mean Square Projection Error Gradient-based Variable Forgetting Factor FAPI Algorithm (평균 제곱 투영 오차의 기울기에 기반한 가변 망각 인자 FAPI 알고리즘)

  • Seo, YoungKwang;Shin, Jong-Woo;Seo, Won-Gi;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.177-187
    • /
    • 2014
  • This paper proposes a fast subspace tracking methods, which is called GVFF FAPI, based on FAPI (Fast Approximated Power Iteration) method and GVFF RLS (Gradient-based Variable Forgetting Factor Recursive Lease Squares). Since the conventional FAPI uses a constant forgetting factor for estimating covariance matrix of source signals, it has difficulty in applying to non-stationary environments such as continuously changing DOAs of source signals. To overcome the drawback of conventioanl FAPI method, the GVFF FAPI uses the gradient-based variable forgetting factor derived from an improved means square error (MSE) analysis of RLS. In order to achieve the decreased subspace error in non-stationary environments, the GVFF-FAPI algorithm used an improved forgetting factor updating equation that can produce a fast decreasing forgetting factor when the gradient is positive and a slowly increasing forgetting factor when the gradient is negative. Our numerical simulations show that GVFF-FAPI algorithm offers lower subspace error and RMSE (Root Mean Square Error) of tracked DOAs of source signals than conventional FAPI based MUSIC (MUltiple SIgnal Classification).

Modeling of Co(II) adsorption by artificial bee colony and genetic algorithm

  • Ozturk, Nurcan;Senturk, Hasan Basri;Gundogdu, Ali;Duran, Celal
    • Membrane and Water Treatment
    • /
    • v.9 no.5
    • /
    • pp.363-371
    • /
    • 2018
  • In this work, it was investigated the usability of artificial bee colony (ABC) and genetic algorithm (GA) in modeling adsorption of Co(II) onto drinking water treatment sludge (DWTS). DWTS, obtained as inevitable byproduct at the end of drinking water treatment stages, was used as an adsorbent without any physical or chemical pre-treatment in the adsorption experiments. Firstly, DWTS was characterized employing various analytical procedures such as elemental, FT-IR, SEM-EDS, XRD, XRF and TGA/DTA analysis. Then, adsorption experiments were carried out in a batch system and DWTS's Co(II) removal potential was modelled via ABC and GA methods considering the effects of certain experimental parameters (initial pH, contact time, initial Co(II) concentration, DWTS dosage) called as the input parameters. The accuracy of ABC and GA method was determined and these methods were applied to four different functions: quadratic, exponential, linear and power. Some statistical indices (sum square error, root mean square error, mean absolute error, average relative error, and determination coefficient) were used to evaluate the performance of these models. The ABC and GA method with quadratic forms obtained better prediction. As a result, it was shown ABC and GA can be used optimization of the regression function coefficients in modeling adsorption experiments.

A 3-Level Endpoint Detection Algorithm for Isolated Speech Using Time and Frequency-based Features

  • Eng, Goh Kia;Ahmad, Abdul Manan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1291-1295
    • /
    • 2004
  • This paper proposed a new approach for endpoint detection of isolated speech, which proves to significantly improve the endpoint detection performance. The proposed algorithm relies on the root mean square energy (rms energy), zero crossing rate and spectral characteristics of the speech signal where the Euclidean distance measure is adopted using cepstral coefficients to accurately detect the endpoint of isolated speech. The algorithm offers better performance than traditional energy-based algorithm. The vocabulary for the experiment includes English digit from one to nine. These experimental results were conducted by 360 utterances from a male speaker. Experimental results show that the accuracy of the algorithm is quite acceptable. Moreover, the computation overload of this algorithm is low since the cepstral coefficients parameters will be used in feature extraction later of speech recognition procedure.

  • PDF