• 제목/요약/키워드: 1991 AMS Mathematical Subject Classification

검색결과 10건 처리시간 0.017초

SCALE-INVARIANT TRANSFORM

  • Oh, Choon-Suk
    • Journal of applied mathematics & informatics
    • /
    • 제2권1호
    • /
    • pp.11-16
    • /
    • 1995
  • Scale Invariant Transforms are defined for both one- and two- dimensioned input functions. These have the desirable properties of linearity and invariance to scale change of the input.

A NOTE ON PROJECTIVE AND INJECTIBVE AUTOMATA

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • 제3권1호
    • /
    • pp.79-88
    • /
    • 1996
  • In this paper we define a new short exact sequence of automata and we investigate module-like properties on projective and injective automata

FUZZY SELECTION AND EXISTENCE OF FUZZY FIXED POINT

  • Kim, Won-Kyu;Park, Kyoo-Hong;Lee, Kyoung-Hee
    • Journal of applied mathematics & informatics
    • /
    • 제2권1호
    • /
    • pp.17-24
    • /
    • 1995
  • In this paper we shall prove a new fuzzy continuous selec-tion theorem in a compact convex set and next a fixed point theorem for fuzzy mappings is established.

ESTIMATION OF SCALE PARAMETER FROM RAYLEIGH DISTRIBUTION UNDER ENTROPY LOSS

  • Chung, Youn-Shik
    • Journal of applied mathematics & informatics
    • /
    • 제2권1호
    • /
    • pp.33-40
    • /
    • 1995
  • Entropy loss is derived by the scale parameter of Rayleigh distribution. Under this entropy loss we obtain the best invariant estimators and the Bayes estimators of the scale parameter. Also we compare MLE with the proposed estimators.

선형 음의 사분 종속확률변수에서 가중합에 대한 수렴성 연구 (Convergence of weighted sums of linearly negative quadrant dependent random variables)

  • 이승우;백종일
    • 한국신뢰성학회지:신뢰성응용연구
    • /
    • 제12권4호
    • /
    • pp.265-274
    • /
    • 2012
  • We in this paper discuss the strong law of large numbers for weighted sums of arrays of rowwise LNQD random variables by using a new exponential inequality of LNQD r.v.'s under suitable conditions and we obtain one of corollary.

구간적 2차 BEZIER 곡선에 의한 3차 BEZIER 곡선의 근사 (THE APPROXIMATION OF CUBIC BEZIER CURVE BY A PIECEWISE QUADRATIC BEZIER CURVES)

  • 박윤범
    • Journal of applied mathematics & informatics
    • /
    • 제2권2호
    • /
    • pp.75-82
    • /
    • 1995
  • 4대의 제어점에 의해 정의되는 3차 Bezier 곡선을 구간적 (piecewise) 2차 Bezier 곡선으로 근사 하는 기하적인 알고리듬을 제시한다. 또한 제시한알고리듬의 오차해석을 통하여 수정된 알 고리듬을 구성한다. 분확방법을 동시에 사용하여 주어진 허용오차 이내의 구간적 2차 근사 곡선을 구할수 있다. 제시한 알고리듬은 오차해석을 이용하여 필요한 분활의 수행회수를 미 리 결정할수있는장점을 가지고있다.

ON THE EXPONENTIAL APPROXIMATIONS IN EVALUATION OF FUNCTIONS

  • Yu, Dong-Won;Lee, Hyoung
    • Journal of applied mathematics & informatics
    • /
    • 제2권2호
    • /
    • pp.13-20
    • /
    • 1995
  • The goal of this paper is to show that the linear approxi-mation in evaluation of functions may be effectively replaced by the ex-ponential approximation formulas obtained by numerical quadratures and in the instance the relative errors can be estimated without know-ing the true values.

3단계 표본 추출에 있어서 부차표본(m,k)의 최상 선택 (THE BEST CHOICE OF SUBSAMPLE SIZE (m,k) IN 3 STAGE SAMPLING)

  • 정훈조
    • Journal of applied mathematics & informatics
    • /
    • 제3권1호
    • /
    • pp.101-115
    • /
    • 1996
  • In this paper we extend the best choice of subsample size m in the 2-stage sampling which suggested by Mohammad(1986) to the 3-stage sampling in cases of known and of unknown cost and variance ratio. We find the subsample size m.k which ensures more than the relative efficiency 90% Also we see that the choice of 3-stage subsample size depends on the design parameters using in 2-stage sampling.

A SIMPLEX TYPE METHOD USING MULTIPLE UPDATINGS FOR SPECIALLY STRUCTURED LINEAR PROGRAMS

  • Oh, Seyoung;Chung, Seiyoung
    • Journal of applied mathematics & informatics
    • /
    • 제3권1호
    • /
    • pp.25-34
    • /
    • 1996
  • Many important large-scale linear programs with special structures lead to special computational procedures which are more ef-ficient than the ordinary procedure of the generalized methods. Prob-lems and their solvers taking advantage of multiple updatings of the basis in the dual simplex type method are presented. Computational results run by the efficient algorithm and a presented. Computational results run by the efficient algorithm and a standard code MINOS for the test problems are compared and analyzed. It is shown that the amount of work for the optimal solution for the prblem can be re-duced by the new algorithm.