• Nuclear Engineering and Technology
• /
• v.56 no.9
• /
• pp.3750-3757
• /
• 2024

Rapidly obtaining the coverage characteristics of leaching solution in In-situ Leaching Area of Sandstone Uranium Mines is a necessary condition for optimizing well locations reasonably. In the presented study, the improved algorithm of the Fast Marching Method (FMM) was studied for rapidly solving coverage characteristics to replace the groundwater numerical simulator. First, the effectiveness of the FMM was verified by simulating diffusion characteristics of the leaching solution in In-situ Leaching Area. Second, based on the radial flow pressure equation and the interaction mechanism of the front diffusion of production and injection well flow field, an improved FMM which is suitable for In-situ Leaching Mining, was developed to achieve the co-simulation of production and injection well. Finally, the improved algorithm was applied to engineering practice to guide the design and production. The results show that the improved algorithm can efficiently solve the coverage characteristics of leaching solution, which is consistent with those obtained from traditional numerical simulators. In engineering practice, the improved FMM can be used to rapidly analyze the leaching process, delineate Leaching Blind Spots, and evaluate the rationality of well pattern layout. Furthermore, it can help to achieve iterative optimization and rapid decision-making of production and injection well locations under largescale mining area models.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.647-656
• /
• 2003

In Webspace, mining traversal patterns is to understand user's path traversal patterns. On this mining, it has a unique characteristic which objects (for example, URLs) may be visited due to their positions rather than contents, because users move to other objects according to providing information services. As a consequence, it becomes very complex to extract meaningful information from these data. Recently discovering traversal patterns has been an important problem in data mining because there has been an increasing amount of research activity on various aspects of improving the quality of information services. This paper presents a Dynamic Link Recommendation (DLR) algorithm that recommends link sets on a Web site through mining frequent traversal patterns. It can be employed to any Web site with massive amounts of data. Our experimentation with two real Weblog data clearly validate that our method outperforms traditional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.208-218
• /
• 2006

In this paper, we introduce the creation methods of attack detection model using data mining technologies that can classify the latest attack types, and can detect the modification of existing attacks as well as the novel attacks. Also, we evaluate comparatively these attack detection models in the view of detection accuracy and detection time. As the important factors for creating detection models, there are data, attribute, and detection algorithm. Thus, we used NetFlow data gathered at the real network, and KDD Cup 1999 data for the experiment in large quantities. And for attribute selection, we used a heuristic method and a theoretical method using decision tree algorithm. We evaluate comparatively detection models using a single supervised/unsupervised data mining approach and a combined supervised data mining approach. As a result, although a combined supervised data mining approach required more modeling time, it had better detection rate. All models using data mining techniques could detect the attacks within 1 second, thus these approaches could prove the real-time detection. Also, our experimental results for anomaly detection showed that our approaches provided the detection possibility for novel attack, and especially SOM model provided the additional information about existing attack that is similar to novel attack.

• Analytical Science and Technology
• /
• v.7 no.4
• /
• pp.471-476
• /
• 1994

The capability of PIXE (Proton Induced X-ray Emission) method for the precision measurement of coating thickness has been tested by measuring several gold coated copper plates. Two different experimental methods are applied and compared. The results are compared with those by the weight measurement and proton RBS (Rutherford Backscattering Spectrometry). The advantage of the method is that it can be also used for the nondestructive thickness measurement of this layers on large-scaled samples or archeological samples which cannot be placed in a vacuum chamber.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.81-89
• /
• 2010

Biological data mining has been noticed as an issue as the volume of biological data is increasing extremely. Grid technology can share and utilize computing data and resources. In this paper, we propose a hybrid system that combines biological data mining with grid technology. Especially, we propose a decision range adjustment algorithm for processing efficiency of biological data mining. We obtain a reliable data mining recognition rate automatically and rapidly through this algorithm. And communication loads and resource allocation are key issues in grid environment because the resources are geographically distributed and interacted with themselves. Therefore, we propose a dynamic load balancing algorithm and apply it to the grid-based biological data mining method. For performance evaluation, we measure average processing time, average communication time, and average resource utilization. Experimental results show that this method provides many advantages in aspects of processing time and cost.

• Explosives and Blasting
• /
• v.42 no.2
• /
• pp.29-41
• /
• 2024

The increasing demand for metallic minerals due to global growth and the continued exploitation of near-surface minerals requires safe and efficient ways to mine ores present in deep mines. In deep mines, stresses concentrated around the cavity increase, which can lead to problems such as induced seismicity and rockbursts. In addition, the transfer of energy from blasting to deeply located faults can cause fault slip, which can lead to earthquakes, and controlling these events is key to deep mining methods. In this technical report, we will introduce the Underhand Closed Bench (UCB) mining method, which can control possible accidents and increase productivity when mining in deep mines.

• Geomechanics and Engineering
• /
• v.15 no.6
• /
• pp.1153-1160
• /
• 2018

Rockbursts, catastrophic events involving the violent release of elastic energy stored in rock features, remain a worldwide challenge for geoengineering. Especially at deep-mining sites, rockbursts can occur in hard, high-stress, brittle rock zones, and the associated risk depends on such factors as mining activity and the stress on surrounding rocks. Rockbursts are often sudden and destructive, but there is still no unified standard for predicting them. Based on previous studies, a new Bayesian multi-index model was introduced to predict and evaluate rockbursts. In this method, the rock strength index, energy release index, and surrounding rock stress are the basic factors. Values from 18 rock samples were obtained, and the potential rockburst risks were evaluated. The rockburst tendencies of the samples were modelled using three existing methods. The results were compared with those obtained by the new Bayesian model, which was observed to predict rockbursts more effectively than the current methods.

• Journal of Information Technology Applications and Management
• /
• v.26 no.3
• /
• pp.43-59
• /
• 2019

The goal of this paper is to investigate changes in North Korea's domestic and foreign policies through automated text analysis over North Korean new year addresses, one of most important and authoritative document publicly announced by North Korean government. Based on that data, we then analyze the status of text mining research, using a text mining technique to find the topics, methods, and trends of text mining research. We also investigate the characteristics and method of analysis of the text mining techniques, confirmed by analysis of the data. We propose a procedure to find meaningful tendencies based on a combination of text mining, cluster analysis, and co-occurrence networks. To demonstrate applicability and effectiveness of the proposed procedure, we analyzed the inaugural addresses of Kim Jung Un of the North Korea from 2017 to 2019. The main results of this study show that trends in the North Korean national policy agenda can be discovered based on clustering and visualization algorithms. We found that uncovered semantic structures of North Korean new year addresses closely follow major changes in North Korean government's positions toward their own people as well as outside audience such as USA and South Korea.

• Journal of Digital Convergence
• /
• v.12 no.11
• /
• pp.257-264
• /
• 2014

This paper is to construction of the data mining preprocessing tool for efficient database marketing. We compare and evaluate the often used data mining tools based on the access method to local and remote databases, and on the exchange of information resources between different computers. The evaluated preprocessing of data mining tools are Answer Tree, Climentine, Enterprise Miner, Kensington, and Weka. We propose a design principle for an efficient system for data preprocessing for data mining on the distributed networks. This system is based on Java technology including EJB(Enterprise Java Beans) and XML(eXtensible Markup Language).