• Geophysics and Geophysical Exploration
• /
• v.22 no.2
• /
• pp.56-61
• /
• 2019

In this paper, we studied efficient modeling strategies when we simulate the 3D time-domain acoustic wave propagation using a cell-based finite difference method which can handle the variations of both P-wave velocity and density. The standard finite difference method assigns physical properties such as velocities of elastic waves and density to grid points; on the other hand, the cell-based finite difference method assigns physical properties to cells between grid points. The cell-based finite difference method uses average physical properties of adjacent cells to calculate the finite difference equation centered at a grid point. This feature increases the computational cost of the cell-based finite difference method compared to the standard finite different method. In this study, we used additional memory to mitigate the computational overburden and thus reduced the calculation time by more than 30 %. Furthermore, we were able to enhance the performance of the modeling on several media with limited density variations by using the cell-based and standard finite difference methods together.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1998.03a
• /
• pp.168-174
• /
• 1998

In the present study, a method for measuring the relative density by the hardness measurement was proposed for sintered metal powder compacts. It is based on the indentation force equation, by which the relative density is related with the hardness, that was obtained by the finite element analysis of rigid-ball indentation on sintered metal powder compacts. For verifying the method, it was applied to prediction of density distributions in sintered and sintered-and-forged Fe-0.5%C-2%Cu powder compacts.

• Proceedings of the Korean Geotechical Society Conference
• /
• 1999.03a
• /
• pp.357-364
• /
• 1999

The purpose of this study is to analysis the grain distribution and compaction characteristics of structural backfill with reclaimed soil. Five(5) reclaimed soil samples which passed #200 sieve have been used in the test. The study showed that the maximum dry density and the bearing value rate turned out to be becoming smaller when the more the quantity passed #200 sieve, the smaller the soil grain. The maximum dry density value calculated from the compaction md relative density test showed wet method > compaction method > dry method. The correlation coefficient between Rc and Dr based on the grain distribution and the compaction characteristics showed that the maximum dry density value by the wet method is little higher than the compaction method and dry method.

• Journal of the Korean Statistical Society
• /
• v.27 no.1
• /
• pp.91-100
• /
• 1998

A method of estimating probability density using regression tools is presented here. It is based on equal-length binning and locally weighted approximate likelihood for bin counts. The method is particularly useful for densities with bounded supports, where it automatically corrects edge effects without using boundary kernels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.3815-3835
• /
• 2022

Density-based outlier detection is one of the hot issues in data mining. A point is determined as outlier on basis of the density of points near them. The existing density-based detection algorithms have high time complexity, in order to reduce the time complexity, a new outlier detection algorithm DODMD (Density-based Outlier Detection in Multidimensional Datasets) is proposed. Firstly, on the basis of ZH-tree, the concept of micro-cluster is introduced. Each leaf node is regarded as a micro-cluster, and the micro-cluster is calculated to achieve the purpose of batch filtering. In order to obtain n sets of approximate outliers quickly, a greedy method is used to calculate the boundary of LOF and mark the minimum value as LOF_min. Secondly, the outliers can filtered out by LOF_min, the real outliers are calculated, and then the result set is updated to make the boundary closer. Finally, the accuracy and efficiency of DODMD algorithm are verified on real dataset and synthetic dataset respectively.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.260-262
• /
• 2004

Spatial database system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to visit unnecessary node by applying pruning technique. But this method access more disk than necessary while pruning unnecessary node. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN object using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit fewer disks than MINMAX method by the factor of maximum $22\%\;and\;average\;6\%.$

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.453-459
• /
• 2017

Users tend to check in and post their statuses in location-based social networks (LBSNs) to describe that their interests are related to a point-of-interest (POI). While previous studies on discovering area-of-interests (AOIs) were conducted mostly on the basis of density-based clustering methods with the collection of geo-tagged photos from LBSNs, we focus on estimating a POI boundary, which corresponds to only one cluster containing its POI center. Using geo-tagged tweets recorded from Twitter users, this paper introduces a density-based low-complexity two-phase method to estimate a POI boundary by finding a suitable radius reachable from the POI center. We estimate a boundary of the POI as the convex hull of selected geo-tags through our two-phase density-based estimation, where each phase proceeds with different sizes of radius increment. It is shown that our method outperforms the conventional density-based clustering method in terms of computational complexity.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.183-192
• /
• 2017

k-nearest neighbor (K-NN) is a well-known classification algorithm, being feature space-based on nearest-neighbor training examples in machine learning. However, K-NN, as we know, is a lazy learning method. Therefore, if a K-NN-based system very much depends on a huge amount of history data to achieve an accurate prediction result for a particular task, it gradually faces a processing-time performance-degradation problem. We have noticed that many researchers usually contemplate only classification accuracy. But estimation speed also plays an essential role in real-time prediction systems. To compensate for this weakness, this paper proposes correlation coefficient-based clustering (CCC) aimed at upgrading the performance of K-NN by leveraging processing-time speed and plurality rule-based density (PRD) to improve estimation accuracy. For experiments, we used real datasets (on breast cancer, breast tissue, heart, and the iris) from the University of California, Irvine (UCI) machine learning repository. Moreover, real traffic data collected from Ojana Junction, Route 58, Okinawa, Japan, was also utilized to lay bare the efficiency of this method. By using these datasets, we proved better processing-time performance with the new approach by comparing it with classical K-NN. Besides, via experiments on real-world datasets, we compared the prediction accuracy of our approach with density peaks clustering based on K-NN and principal component analysis (DPC-KNN-PCA).

• Journal of Microbiology and Biotechnology
• /
• v.22 no.7
• /
• pp.967-974
• /
• 2012

Cultivation of Spirulina platensis using ammonium salts or wastewater containing ammonium as alternative nitrogen sources is considered as a commercial way to reduce the production cost. In this research, by analyzing the relationship between biomass production and ammonium-N consumption in the fed-batch culture of Spirulina platensis using ammonium bicarbonate as a nitrogen nutrient source, an online adaptive control strategy based on optical density (OD) measurements for controlling ammonium feeding was presented. The ammonium concentration was successfully controlled between the cell growth inhibitory and limiting concentrations using this OD-based feedback feeding method. As a result, the maximum biomass concentration (2.98 g/l), productivity (0.237 g/l d), nitrogen-to-cell conversion factor (7.32 gX/gN), and contents of protein (64.1%) and chlorophyll (13.4mg/g) obtained by using the OD-based feedback feeding method were higher than those using the constant and variable feeding methods. The OD-based feedback feeding method could be recognized as an applicable way to control ammonium feeding and a benefit for Spirulina platensis cultivations.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.41 no.5
• /
• pp.381-389
• /
• 2017

The kernel density was determined based on sampling points obtained in a Markov chain simulation and was assumed to be an important sampling function. A Kriging metamodel was constructed in more detail in the vicinity of a limit state. The failure probability was calculated based on importance sampling, which was performed for the Kriging metamodel. A pre-existing method was modified to obtain more sampling points for a kernel density in the vicinity of a limit state. A stable numerical method was proposed to find a parameter of the kernel density. To assess the completeness of the Kriging metamodel, the possibility of changes in the calculated failure probability due to the uncertainty of the Kriging metamodel was calculated.