• Title/Summary/Keyword: Converge

Search Result 921, Processing Time 0.021 seconds

An Analysis on the Regional Convergence of Social Welfare Services in Korea (우리나라 사회복지서비스의 지역 간 수렴 분석)

  • Kim, Sung Tai
    • Journal of the Korea Convergence Society
    • /
    • v.7 no.4
    • /
    • pp.217-227
    • /
    • 2016
  • This paper analyzes whether social welfare services converge across the regions. We tested whether local social welfare services converge considering the congestion rate of local social welfare services during the 1985-2013 periods in Korea, using the sixteen higher level local governments panel data. The main findings are as follows. First, the absolute level of local social welfare services converge so that the -convergence exists. Second, the growth rate of local social welfare services increases as the intial level of local social welfare services is lower so that there exists -convergence. The policy implications of our findings are as follows. The local government had better consider the presence of local social welfare services in policy decision making. Also, fundamentally the social welfare policies had better be executed by the central government rather than local governments, since the national minimum welfare must be provided.

A Study on the Timing Recovery using Peak Detector in Underwater Acoustic Communication (수중음향통신에서 Peak Detector를 갖는 시간동기회복에 관한 연구)

  • Han, Min-Su;Kim, Ki-Man
    • Journal of Navigation and Port Research
    • /
    • v.36 no.5
    • /
    • pp.371-378
    • /
    • 2012
  • This paper presents a timing recovery method using Gardner TED (Timing Error Detector) with a Peak Detector using Parabola Peak Interpolation in underwater acoustic communication. This method will have an eye to improve phase converge speed of timing recovery and reduced amount of Tx data. The OQPSK(Offset Quadrature Phase Shift Keying) modulation technique was considered. The proposed algorithm has faster recovery speed and more accurate than Gardner TED because the sampling values in the proposed algorithm are moved persistingly to maximum or minimum point using parabolic peak interpolation. when simulation performed using Preposed method, it improved BER (Bit Error Rate) performance about 23% And to evaluate the performances of the proposed algorithm the sea trial was performed in the Korean East Sea. And distance of a transmitter-receiver is 3 km each other. As a result, the proposed algorithm outperforms better BER performance about 20% of timing recovery than the Gardner method. Also Proposed method improved converge speed of timing recovery about 1.4 times better than Gardner method.

BCG-LIKE METHODS FOR SOLVING NONSYMMETRIC LINEAR SYSTEMS

  • Yun, Jae Heon;Joo, Myung Suk
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.8 no.1
    • /
    • pp.55-69
    • /
    • 1995
  • This paper proposes two variants of BCG-like method for solving nonsymmetric linear sytems. It is shown that these new algorithms converge faster and more smoothly than the existing BCG and BiCGSTAB algorithms for problems tested in this paper.

  • PDF

Conjugate Gradient Method for Solving a Quadratic Matrix Equation

  • 김현민
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.3.1-3
    • /
    • 2003
  • We show how the minimization can be used to solve the quadratic matrix equattion. We then compare two different types of conjugate gradient method and show Polak and Ribire version converge more rapidly than Fletcher and Reeves version in several examples.

  • PDF

ON SCATTERING BY SEVERAL OCNVEX BODIES

  • Ikawa, Mitsuru
    • Journal of the Korean Mathematical Society
    • /
    • v.37 no.6
    • /
    • pp.991-1005
    • /
    • 2000
  • We consider a zeta function of the classical dynamics in the exterior of several convex bodies. The main result is that the poles of the zeta function cannot converge to the line of absolute convergence if the abscissa of absolute convergence of the zeta function is positive.

  • PDF

Convergence of nonlinear algorithms

  • Lee, Young-S.;Simeon Reich
    • Journal of the Korean Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.115-139
    • /
    • 1995
  • Our purpose in this paper is to prove a new version of the nonlinear Chernoff theorem and to discuss the equivalence between resolvent consistency and converge nce for nonlinear algorithms acting on different Banach spaces. Such results are useful in the numerical treatment of partial differential equations via difference schemes.

  • PDF

EISENSTEIN SERIES WITH NON-UNITARY TWISTS

  • Deitmar, Anton;Monheim, Frank
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.507-530
    • /
    • 2018
  • It is shown that for a non-unitary twist of a Fuchsian group, which is unitary at the cusps, Eisenstein series converge in some half-plane. It is shown that invariant integral operators provide a spectral decomposition of the space of cusp forms and that Eisenstein series admit a meromorphic continuation.

Recursive Parameter estimation algorithm of the Probability (확률밀도함수의 축차모수추정 방법)

  • 한영열;박진수
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1984.04a
    • /
    • pp.42-45
    • /
    • 1984
  • we propose a new parameter estimation algorithm that converge with probability one and in mean square, If the mean is the function of parameter of the probability density function. This recursive algorithm is applicable also ever the parameters we estimate are multiparameter case. And the results are shown by the computer simulation.

  • PDF