• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.707-716
• /
• 2006

When the regression function is discontinuous at a point, the variance function is usually discontinuous at the point. In this case, we had better propose a test for the existence of a discontinuity point with the regression function rather than the variance function. In this paper we consider that the variance function only has a discontinuity point. We propose a nonparametric test for the existence of a discontinuity point with the second moment function since the variance function and the second moment function have the same location and jump size of the discontinuity point. The proposed method is based on the asymptotic distribution of the estimated jump size.

• Journal of the Optical Society of Korea
• /
• v.16 no.3
• /
• pp.256-262
• /
• 2012

We derive the point-spread function of the reconstructed image from a point-source complex hologram, which includes phase error caused by polarization components, in the longitudinal direction of the point-spread function and analyze the effect of the error sources of polarization components having influence on image reconstruction of a point-source complex hologram in incoherent triangular holography.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.103-108
• /
• 2002

We consider an estimation of discontinuous variance function in nonparametric heteroscedastic random design regression model. We first propose estimators of a change point and jump size in variance function and then construct an estimator of entire variance function. We examine the rates of convergence of these estimators and give results on their asymptotics. Numerical work reveals that the effectiveness of change point analysis in variance function estimation is quite significant.

• The Pure and Applied Mathematics
• /
• v.27 no.2
• /
• pp.97-108
• /
• 2020

In this paper, we prove common fixed point theorems for two mappings by using simulation function on fuzzy metric spaces. We also deduce some consequences in modular metric spaces.

• The Journal of Society for e-Business Studies
• /
• v.7 no.2
• /
• pp.173-190
• /
• 2002

Over the past decade, numerous software managers and engineers have been concerned with measuring the size and complexity of software systems. Function point analysis technique is one of the most popular software sizing techniques. A reasonable software development plan through cost and time estimation should be a prerequisite for the successful project at the beginning stage of the project. It is generally known that software size measurement is useful for this kind of estimation and the function point analysis technique would be more effective than the others. However, it is difficult to apply the technique to object-oriented methodology widely used in the software industry. Thus, the purpose of this study is to present a case study on how to apply function point analysis technique to sizing of the software systems based on UML. The results of this study can be useful to managers and engineers.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.225-232
• /
• 2009

Function Point Method have been applied to measure software size estimation in industry because it supports to estimate the software's size by user's view not developer's. However, the current function point method has some problems for example complexity's upper limit etc. So, In this paper, an enhanced function point model. Micro FP model, was suggested. Using this model, software effort estimation can be more efficiently because this model has some regression equation. This model specially can be applied to estimate in detail the large application system's size Analysis results show that measured software size by this Micro FP model has the advantage with more correlative between the one of LOC, as of 10 applications operated in an large organization.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.929-937
• /
• 2003

Kernel type estimations of discontinuity point at an unknown location in regression function or its derivatives have been developed. It is known that the discontinuity point estimator based on $Gasser-M\ddot{u}ller$ regression estimator with a one-sided kernel function which has a zero value at the point 0 makes a poor asymptotic behavior. Further, the asymptotic variance of $Gasser-M\ddot{u}ller$ regression estimator in the random design case is 1.5 times larger that the one in the corresponding fixed design case, while those two are identical for the local polynomial regression estimator. Although $Gasser-M\ddot{u}ller$ regression estimator with a one-sided kernel function which has a non-zero value at the point 0 for the modification is used, computer simulation show that this phenomenon is also appeared in the discontinuity point estimation.

• East Asian mathematical journal
• /
• v.29 no.3
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.75-86
• /
• 2002

We consider the problem of estimating the change-point in mean change model with one change-point. Gombay and Huskova(1998) derived a class of change-point estimators with the score function of rank. A change-point estimator with the log score function of rank is suggested and is shown to be involved in the class of Gombay and Huskova(1988). The simulation results show that the proposed estimator has smaller rose, larger proportion of matching the true change-point than the other estimators considered in the experiment when the change-point occurs in the middle of the sample.