• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.357-372
• /
• 1998

In this paper we introduce and study a new class of random completely generalized strongly nonlinear quasi -comple- mentarity problems with non-compact valued random fuzzy map-pings and construct some new iterative algorithms for this kind of random fuzzy quasi-complementarity problems. We also prove the existence of random solutions for this class of random fuzzy quasi-complementarity problems and the convergence of random iterative sequences generated by the algorithms.

• Communications of the Korean Mathematical Society
• /
• v.14 no.2
• /
• pp.295-299
• /
• 1999

Every quasi-random graph G(n) on n vertices consists of a giant component plus o(n) vertices, and every quasi-random graph G(n) with minimum degree (1+o(1))\ulcorner is connected.

• Korean Journal of Mathematics
• /
• v.11 no.1
• /
• pp.65-70
• /
• 2003

We show that every quasi-random graph $G(n)$ with $n$ vertices and minimum degree $(1+o(1))n/2$ has diameter either 2 or 3 and that every quasi-random graph $G(n)$ with n vertices has a clique number of $o(n)$ with wide spread.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.289-302
• /
• 2004

The asymptotic dependence between the central quasi-ranges and empirical quantiles was studied. The asymptotic dependence are obtained when the sample size is a positive integer valued random variable (r. v.). The dependence conditions and limit forms are obtained under generl conditions such as : the interrelation of the basic variables (the original random sample) and the random sample size is not restricted. In additition the normalizing constants do not depend on the random size.

• Korean Journal of Mathematics
• /
• v.10 no.1
• /
• pp.29-35
• /
• 2002

It is well known that a random graph $G_{1/2}(n)$ is Hamiltonian almost surely. In this paper, we show that every quasirandom graph $G(n)$ with minimum degree $(1+o(1))n/2$ is also Hamiltonian.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.4
• /
• pp.669-677
• /
• 2013

Quasi-Monte Carlo method is known to have lower convergence rate than the standard Monte Carlo method. Quasi-Monte Carlo methods are using low discrepancy sequences as quasi-random numbers. They include Halton sequence, Faure sequence, and Sobol sequence. In this article, we compared standard Monte Carlo method, quasi-Monte Carlo methods and three scrambling methods of Owen, Faure-Tezuka, Owen-Faure-Tezuka in valuation of multi-asset European call option through simulations. Moro inversion method is used in generating random numbers from normal distribution. It has been shown that three scrambling methods are superior in estimating option prices regardless of the number of assets, volatility, and correlations between assets. However, there are no big differences between them.

• The Korean Journal of Applied Statistics
• /
• v.32 no.1
• /
• pp.99-109
• /
• 2019

We compared the confidence intervals of estimators using various bootstrap methods for a Random Coefficient Autoregressive(RCA) model. We consider a Quasi score estimator and M-Quasi score estimator using Huber, Tukey, Andrew and Hempel functions as bounded functions, that do not have required assumption of distribution. A standard bootstrap method, percentile bootstrap method, studentized bootstrap method and hybrid bootstrap method were proposed for the estimations, respectively. In a simulation study, we compared the asymptotic confidence intervals of the Quasi score and M-Quasi score estimator with the bootstrap confidence intervals using the four bootstrap methods when the underlying distribution of the error term of the RCA model follows the normal distribution, the contaminated normal distribution and the double exponential distribution, respectively.

• Journal of the Korean Statistical Society
• /
• v.12 no.2
• /
• pp.69-80
• /
• 1983

The purpose of this paper is to obtain representation of the mathematical special functions and the numerical values of the mean square errors for the quasi-ranges in random small smaples ($n \leq 30$) from the Weibull distribution with a shape and a scale parameters, and to estimate the scale parameter by use of unbiased estimator based on the quasi-range. It will be shown that the jackknife estimator of the range is worse than the range of random samples from the given distribution in the sense of the mean square error.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.1
• /
• pp.147-155
• /
• 2017

A new endurance test-pattern generation on NAND-flash memory is proposed to improve test cost. We mainly focus on the correlation between the data-pattern and the device error-rate during endurance testing. The novelty is the development of testing method using quasi-random pattern based on device architectures in order to increase the test efficiency during time-consuming endurance testing. It has been proven by the experiments using the commercial 32 nm NAND flash-memory. Using the proposed method, the error-rate increases up to 18.6% compared to that of the conventional method which uses pseudo-random pattern. Endurance testing time using the proposed quasi-random pattern is faster than that of using the conventional pseudo-random pattern since it is possible to reach the target error rate quickly using the proposed one. Accordingly, the proposed method provides more low-cost testing solutions compared to the previous pseudo-random testing patterns.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.101-113
• /
• 2003

Quasi likelihood estimators defined by Wedderburn are derived for several nonlinear time series models. And also, the least squared estimator and Quasi-likelihood estimator are compared in sense of asymptotic relative efficiency at those models. Finally, we apply these estimations to a real data on exchanging rate and stock market prices.