• Proceedings of the Korean Association for Survey Research Conference
• /
• 2006.12a
• /
• pp.67-83
• /
• 2006

In successive sampling on two occasions the problem of estimating a finite population quantile has been considered. The theory developed aims at providing the optimum estimates by combining (i) three double sampling estimators viz. ratio-type, product-type and regression-type, from the matched portion of the sample and (ii) a simple quantile based on a random sample from the unmatched portion of the sample on the second occasion. The approximate variance formulae of the suggested estimators have been obtained. Optimal matching fraction is discussed. A simulation study is carried out in order to compare the three estimators and direct estimator. It is found that the performance of the regression-type estimator is the best among all the estimators discussed here.

• Journal of the Korean Statistical Society
• /
• v.36 no.4
• /
• pp.543-556
• /
• 2007

In successive sampling on two occasions the problem of estimating a finite population quantile has been considered. The theory developed aims at providing the optimum estimates by combining (i) three double sampling estimators viz. ratio-type, product-type and regression-type, from the matched portion of the sample and (ii) a simple quantile based on a random sample from the unmatched portion of the sample on the second occasion. The approximate variance formulae of the suggested estimators have been obtained. Optimal matching fraction is discussed. A simulation study is carried out in order to compare the three estimators and direct estimator. It is found that the performance of the regression-type estimator is the best among all the estimators discussed here.

• Journal of the Korea Society for Simulation
• /
• v.13 no.3
• /
• pp.1-10
• /
• 2004

The cell loss probability required in the ATM network is in the range of 10$^{-9}$ ∼10$^{-12}$ . If Monte Carlo simulation is used to analyze the performance of the ATM node, an enormous amount of computer time is required. To obtain large speed-up factors, importance sampling may be used. Since the Markov-modulated processes have been used to model various high-speed network traffic sources, we consider discrete time single server queueing systems with Markov-modulated arrival processes which can be used to model an ATM node. We apply importance sampling based on the Large Deviation Theory for the performance evaluation of, MMBP/D/1/K, ∑MMBP/D/1/K, and two stage tandem queueing networks with Markov-modulated arrival processes and deterministic service times. The simulation results show that the buffer overflow probabilities obtained by the importance sampling are very close to those obtained by the Monte Carlo simulation and the computer time can be reduced drastically.

• Kyungpook Mathematical Journal
• /
• v.59 no.3
• /
• pp.465-480
• /
• 2019

In the present article, we analyse the behaviour of a new family of Kantorovich type sampling operators $(K^{\varphi}_wf)_{w>0}$. First, we give a Voronovskaya type theorem for these Kantorovich generalized sampling series and a corresponding quantitative version in terms of the first order of modulus of continuity. Further, we study the order of approximation in $C({\mathbb{R}})$, the set of all uniformly continuous and bounded functions on ${\mathbb{R}}$ for the family $(K^{\varphi}_wf)_{w>0}$. Finally, we give some examples of kernels such as B-spline kernels and the Blackman-Harris kernel to which the theory can be applied.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.443-456
• /
• 2013

Compressive sensing (CS) is a novel sampling paradigm that samples signals in a much more efficient way than the established Nyquist sampling theorem. CS has recently gained a lot of attention due to its exploitation of signal sparsity. Sparsity, an inherent characteristic of many natural signals, enables the signal to be stored in few samples and subsequently be recovered accurately, courtesy of CS. This article gives a brief background on the origins of this idea, reviews the basic mathematical foundation of the theory and then goes on to highlight different areas of its application with a major emphasis on communications and network domain. Finally, the survey concludes by identifying new areas of research where CS could be beneficial.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.589-594
• /
• 2007

This paper is shown new method for durability assesment and design have been noticed to be very valuable has been successfully applied to predict concrete structures. This paper provides that a new approach for predicting the corrosion durability of reinforced concrete structures exposed to chloride attack. In this method, the prediction can be updated successive1y by the Bayesian theory when additional data are available. The stochastic properties of model parameters are explicitly taken into account into the model the probability of the durability limit is determined from the samples obtained from the Latin hypercube sampling technique. The new method may be very useful in designing important concrete structures and help to predict the remaining service life of existing concrete structures under chloride attack environments.

• Journal of Advanced Marine Engineering and Technology
• /
• v.12 no.4
• /
• pp.32-45
• /
• 1988

The scanning moire method, in which the master grating is replaced by the scanning line of television camera and in which the moire pattern is obtained by thining out some scanning line, is discussed by the sampling theory. It is determined also by the sampling theory that relationship between the fringe pattern. The programs that analyze the strain by the scanning moire method have been developed. For the simulation model in which we are able to calculate analytically the distribution of strains, the scanning moire method is discussed. It is shown that the small strains and the large strains are analyzed from the same picture by the thinning out technique and that the accuracy of analysis is improved by change of the phase in the thinning out technique.

• The Magazine of the IEIE
• /
• v.38 no.1
• /
• pp.56-67
• /
• 2011

As a result of quickly growing data, a digital transmission system is required to deal with the challenge of acquiring signals at a very high sampling rate, Fortunately, the CS (Compressed Sensing or Compressive Sensing) theory, a new concept based on theoretical results of signal reconstruction, can be employed to exploit the sparsity of the received signals. Then, they can be adequately reconstructed from a set of their random projections, leading to dramatic reduction in the sampling rate and in the use of ADC (Analog-to-Digital Converter) resources. The goal of this article is provide an overview of the basic CS theory and to survey some important compressed sensing applications in wireless communications.

• Journal of Satellite, Information and Communications
• /
• v.9 no.3
• /
• pp.59-63
• /
• 2014

This paper describes the basic principles of 3D broadcast system and proposes new 3D broadcast technology that reduces the amount of data by applying CS(Compressed Sensing). Differences between Sampling theory and the CS technology concept were described. Recently proposed CS algorithm AMP(Approximate Message Passing) and CoSaMP(Compressive Sampling Matched Pursuit) were described. This paper compared an accuracy between two algorithms and a calculation time that image data compressed and restored by these algorithms. As result determines a low complexity algorithm for 3D broadcast system.

• International Journal of Contents
• /
• v.2 no.2
• /
• pp.17-24
• /
• 2006

The work presented in this paper is divided into two parts. The first part presents finite urn problems which generate truncated negative binomial random variables. Some combinatorial identities that arose from the negative binomial sampling and truncated negative binomial sampling are established. These identities are constructed and serve important roles when we deal with these distributions and their characteristics. Other important results including cumulants and moments of the distributions are given in somewhat simple forms. Second, the distributions of the maximum of two chi-square variables and the distributions of the maximum correlated F-variables are then derived within the negative binomial sampling scheme. Although multinomial theory applied to order statistics and standard transformation techniques can be used to derive these distributions, the negative binomial sampling approach provides more information and deeper insight regarding the nature of the relationship between the sampling vehicle and the probability distributions of these functions of chi-square variables. We also provide an algorithm to compute the percentage points of these distributions. We supplement our findings with exact simple computational methods where no interpolations are involved.