• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1172-1180
• /
• 2017

The application of Monte Carlo (MC) to large-scale fixed-source problems has recently become possible with new hybrid methods that automate generation of parameters for variance reduction techniques. Two common variance reduction techniques, weight windows and source biasing, have been automated and popularized by the consistent adjoint-driven importance sampling (CADIS) method. This method uses the adjoint solution from an inexpensive deterministic calculation to define a consistent set of weight windows and source particles for a subsequent MC calculation. One of the motivations for source consistency is to avoid the splitting or rouletting of particles at birth, which requires computational resources. However, it is not always possible or desirable to implement such consistency, which results in inconsistent source biasing. This paper develops an original framework that mathematically expresses the coupling of the weight window and source biasing techniques, allowing the authors to explore the impact of inconsistent source sampling on the variance of MC results. A numerical experiment supports this new framework and suggests that certain classes of problems may be relatively insensitive to inconsistent source sampling schemes with moderate levels of splitting and rouletting.

• Journal of Korean Clinical Nursing Research
• /
• v.17 no.3
• /
• pp.399-410
• /
• 2011

Purpose: This study was conducted to investigate the incidence of blood hemolysis and repeated blood sampling and to identify factors contributing to hemolysis and repeated blood sampling in the emergency department. Methods: A cross-sectional descriptive design was used. Participants were the patients who came to emergency department and are required a blood sampling for electrolyte level. All blood samples were collected by emergency department nurses and determined for hemolysis by experienced laboratory technologists. Data were analyzed using $x^2$-test, Fisher's exact test, Mann-Whitney u test and Binary Logistic Regression to determine significant differences. Results: A total of 402 valid samples were collected. Of these, 30 blood samples (7.5%) were found to be hemolyzed and 9 (2.2%) to be recollected. Statistically significant factors affecting on hemolysis and repeated blood sampling included the time of bloods sampling (night), the time of tourniquet application, and too-fast blood draw into the test tube. Conclusion: We recommend that nurses who take the blood sampling to consider the findings of the study and take the related factors into account as they set up the standardized care protocol in order for nursing quality improvement.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.285-301
• /
• 2022

In this paper, we mainly study the random sampling and reconstruction of signals living in the subspace V^p(𝚽, 𝚲) of L^p(ℝ^d), which is generated by a family of molecules 𝚽 located on a relatively separated subset 𝚲 ⊂ ℝ^d. The space V^p(𝚽, 𝚲) is used to model signals with finite rate of innovation, such as stream of pulses in GPS applications, cellular radio and ultra wide-band communication. The sampling set is independently and randomly drawn from a general probability distribution over ℝ^d. Under some proper conditions for the generators 𝚽 = {𝜙_λ : λ ∈ 𝚲} and the probability density function 𝜌, we first approximate V^p(𝚽, 𝚲) by a finite dimensional subspace V^p_N (𝚽, 𝚲) on any bounded domains. Then, we prove that the random sampling stability holds with high probability for all signals in V^p(𝚽, 𝚲) whose energy concentrate on a cube when the sampling size is large enough. Finally, a reconstruction algorithm based on random samples is given for signals in V^p_N (𝚽, 𝚲).

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.3
• /
• pp.193-202
• /
• 2014

This paper presents a new method of sampling the climatic data for infrared signature analysis. Historical hourly data from a stationary marine buoy of KMA(Korean Meteorological Administration) are used to select a small number of sample points (N=100) to adequately cover the range of statistics(PDF, CDF) displayed by the original data set (S=56,670). The method uses a coarse bin to subdivide the variable space ($3^5$=243 bins) to make sample points cover the original data range, and a single-point ranking system to select individual points so that uniform coverage (1/N = 0.01) is obtained for each variable. The principal component analysis is used to calculate a joint probability of the coupled climatic variables. The selected sample data show good agreement to the original data set in statistical distribution and they will be used for statistical analysis of infrared signature and susceptibility of naval ships.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.256-261
• /
• 2014

The problem of top-${\kappa}$ set similarity joins finds the top-${\kappa}$ pairs of records ranked by their similarities between two sets of input records. We propose an efficient algorithm to return top-${\kappa}$ similarity join pairs using a sampling technique. From a sample of the input records, we construct a histogram of set similarity joins, and then compute an estimated similarity threshold in the histogram for top-${\kappa}$ join pairs within the error bound of 95% confidence level based on statistical inference. Finally, the estimated threshold is applied to the traditional similarity join algorithm which uses the min-heap structure to get top-${\kappa}$ similarity joins. The experimental results show the good performance of the proposed algorithm on large real datasets.

• Proceedings of the KIEE Conference
• /
• 2008.04c
• /
• pp.65-67
• /
• 2008

An adaptive response surface method with Latin Hypercube sampling strategy is employed to optimize a magnet pole shape of large scale BLDC motor to minimize the cogging torque. The proposed algorithm consists of the multi-objective Pareto optimization and ($1+{\lambda}$) evolution strategy to find the global optimal points with relatively fewer sampling data. In the adaptive RSM, an adaptive sampling point insertion method is developed utilizing the design sensitivities computed by using finite element method to set a reasonable response surface with a relatively small number of sampling points. The developed algorithm is applied to the shape optimization of PM poles for 6MW BLDC motor.

• Journal of the Korean Statistical Society
• /
• v.35 no.2
• /
• pp.157-166
• /
• 2006

This research proposes an efficient Monte Carlo algorithm for computing error probability in high performance digital communication st stems. It characterizes special features of the problem and suggests an importance sampling algorithm specially designed to handle the problem. It uses a shifted exponential density as the importance sampling density, and shows an adaptive way of choosing the rate and the origin of the shifted exponential density. Instead of equal allocation, an intelligent allocation of the samples is proposed so that more samples are allocated to more important part of the error probability. The algorithm uses the nested feature of the error space and avoids redundancy in estimating the probability. The algorithm is applied to an example data set and shows a great improvement in accuracy of the error probability estimation.

• Journal of Mechanical Science and Technology
• /
• v.17 no.12
• /
• pp.1986-1993
• /
• 2003

The spatially resolved spray volume fractions from both line-of-sight data of direct measuring cells and a laser diffraction particle analyzer (LDPA) are tomographically reconstructed by the Convolution Fourier transformation, respectively. Asymmetric sprays generated from a twin-hole injector are tested with 12 equiangular projections of measurements. For each projection angle, a line-of-sight integrated injection rate was measured using a direct sampling method and also a liquid volume fraction from a set of line-of-sight Fraunhofer diffraction measurements was measured using a light extinction method. Interpolated data between the projection angles effectively increase the number of projections, significantly enhancing the signal-to-noise level in the reconstructed data. The reconstructed volume fractions from the direct sampling cells were used as reference data for evaluating the accuracy of the volume fractions from the LDPA.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.541-547
• /
• 1992

The phased array antenna has the ability to perform adaptive sampling by directing the radar beam without inertia in any direction. The adaptive sampling capability of the phased array antenna allows each sampling time interval to be varied for each target, depending on the acceleration of each target at any time. In this paper we design a three-dimensional adaptive tracking algorithm for the phased array radar system with a given set of measurement parameters. The tracking algorithm avoids taking unnecessarily frequent samples, while keeping the angular prediction error within a fraction of antenna beamwidth so that the probability of detection will not be degraded during a track update illuminations. In our algorithm, the target model and the sampling rate are selected depending on the target range and the target maneuver status which is determined by a maneuver detector. A detailed simulation is conducted to test the validity of our tracking algorithm for encounter geometries under various conditions of maneuver.