• Tunnel and Underground Space
• /
• v.28 no.4
• /
• pp.358-371
• /
• 2018

The stability of openings in the underground mine is major concern in the operation of mines that must ensure productivity and safety. Among many rock conditions affecting cavities stability, the width and height of the opening is an important design factor. In this paper, we consider to determine the maximum unsupported span of a opening in a limestone mine by using the Q system among several rock classification schemes. In order to determine the span of the unsupported opening in the limestone mine, rock mass classifications were carried out at over 200 sites in the underground limestone mines. The relationships by using the Q system and the stability graph proposed by Mathews to determine the maximum span of the unsupported opening were derived and compared. We propose a new classification method that combines GSI and RMR rock classification systems to make it easy to use in a field.

• Proceedings of the Korean Fiber Society Conference
• /
• 2002.04a
• /
• pp.293-296
• /
• 2002

소수성인 폴리올레핀계를 친수성화하여 고분자의 표면특성을 개량하거나 고분자 재료 표면에 새로운 기능을 부여하고자 하는 연구가 1970년대부터 계속되고 있다. 이러한 고분자의 표면 특성개질에 대한 연구는 보통 고분자의 도장성, 인쇄성, 접착성, 젖음성 들을 개선하기 위한 것이다. 그 중 재료의 표면층 만을 효율적으로 개질 시키는 저온 플라즈마 처리법은 낮은 기압에서 행하는 글로우 방전법과 대기압 부근에서 행하는 코로나 방전법으로 나눌 수 있으며, 특히 대기압하에서 코로나 방전을 이용한 표면개질법은 산업현장에서 연속적이면서 고속으로 처리할 수 있고 취급이 용이하다는 장점 때문에 표면개질에 있어서 현재 널리 사용되고 있는 방법중 하나이다[1]. (중략)

• Journal of Korean Society of Environmental Engineers
• /
• v.27 no.2
• /
• pp.224-227
• /
• 2005

먹는물에서 염소소독 부산물로서 휘발성유기화합물인 디클로로아세트니트닐(DCAN), 트리클로로아세트니트릴(TCAN), 디브로모아세트니트릴(DBAN), 브로모클로로아세트니트릴(BCAN)의 4종류의 물질을 대상으로 탈기법(air stripping) 및 탈기법(air stripping)과 자외선에너지($8\;W{\times}6$)를 이용하여 분해시험을 행하였다. 물질들의 확인은 가스크로마토 그래프, 이온크로마토그래프 그리고 자외선분광광도계를 사용하였다. TCAN은 탈기법 이용한 방법에서 제거가 되었으며, DBAN과 BCAN에서는 자외선에너지에 의해 분해가 되었다.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.1
• /
• pp.471-476
• /
• 2024

With the spread of various smart devices and computing devices, big data generation is occurring widely. Machine learning is an algorithm that performs reasoning by learning data patterns. Among the various machine learning algorithms, the algorithm that attracts attention is deep learning based on neural networks. Deep learning is achieving rapid performance improvement with the release of various applications. Recently, among deep learning algorithms, attempts to analyze data using graph structures are increasing. In this study, we present a graph generation method for transferring to a deep learning network. This paper proposes a method of generalizing node properties and edge weights in the graph generation process and converting them into a structure for deep learning input by presenting a matricization We present a method of applying a linear transformation matrix that can preserve attribute and weight information in the graph generation process. Finally, we present a deep learning input structure of a general graph and present an approach for performance analysis.

• Geophysics and Geophysical Exploration
• /
• v.12 no.1
• /
• pp.105-113
• /
• 2009

The interpretation of observed waveform characteristics identified in refraction and wide-angle reflection data increases confidence in the crustal structure model obtained. When calculating traveltimes and raypaths, wavefront methods on a regular grid based on graph theory are robust even with complicated structures, but basically compute only first arrivals. In this paper, we develop new algorithms to compute traveltimes and raypaths not only for first arrivals, but also for fast and later reflection arrivals, later refraction arrivals, and converted waves between P and S, using the modified wavefront method based on slowness network nodes mapped on a multi-layer model. Using the new algorithm, we can interpret reflected arrivals, Pg-later arrivals, strong arrivals appearing behind Pn, triplicated Moho reflected arrivals (PmP) to obtain the shape of the Moho, and phases involving conversion between P and S. Using two models of an ocean-continent transition zone and an oceanic ridge or seamount, we show the usefulness of this algorithm, which is confirmed by synthetic seismograms using the 2D Finite Difference Method (2D-FDM). Characteristics of arrivals and raypaths of the two models differ from each other in that using only first-arrival traveltime data for crustal structure analysis involves risk of erroneous interpretation in the ocean-continent transition zone, or the region around a ridge or seamount.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.4
• /
• pp.427-432
• /
• 2016

The mnemonic-system in numbers is useful to remember numbers. In this mnemonic-system, the graph or image to apply many ways such as dot, line, bar, and etc is a rather neat mnemonic. Mnemonics related to numbers are concerned chiefly with translating information into a method that the brain can retain better than its original form. In Tracing the previous work of this paper, we suggested a simple graph algorithm and arranged image algorithm for the mnemonic-system in numbers. In this paper, we evaluate and implement the numerical information system based on the mnemonic system to apply previous algorithm in mobile environments.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.589-602
• /
• 1999

There are some advantages of developing applications based on the object oriented concepts. One os them is that it is possible to reuse the existing designs and products. This paper provides a formal method for the reorganization of class hierarchies for the object extension in the object oriented design phase. In this paper, we introduce classes, and edges to represent the inheritance and aggregation relationship between classes. Based on the graph, we define an order relation(called the object extension) between class hierarchy graphs. And also we present a set of five basic transformations preserving the object extension relation. The set is proven to be correct and complete. The results of this paper help form a theoretical basis for the extension and reorganization object-oriented application systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.63-73
• /
• 1988

In this paper, an algorithm is proposed to evaluate the source-to-terminal reliability, the probability that a source node can communicate with a terminal node, in a probabilistic derected graph. By using Satyanaratana's factoring $theorem^{(7)}$, the original graph can be partitioned into two reduced graphs obtained by contracting and deleting the edge connected to the source node in the probabilistic directed graph. The edge removal proposed in this paper and the general series-parallel reduction can then be applied to the reduced graph. This edge reduction can be applied recursively to the reduced graphs until a source node can be connected to a terminal node by one edge. A computer program which can be applied to evaluating the source-to-terminal reliability in a complex and large network has also been developed.

• 월간산업보건
• /
• s.84
• /
• pp.25-30
• /
• 1995

• Journal of the Korean School Mathematics Society
• /
• v.6 no.1
• /
• pp.101-113
• /
• 2003

The purpose of this study is to analyze students misunderstood types relate to trigonometric function and to devise its teaching method using GSP. To do this, we performed several steps as followings: First, we performed questionnaire survey to 70 students belong to second year at high school to find students comprehension degree about radian angle representation and trigonometric function graph. Second, we devised the teaching-learning materials relate to trigonometric function graph using GSP. And then, we used them in the class of 35 students who are at the time to learn trigonometric function in the first year at high school. Third, we conducted Questionnaire survey to students studied through teaching and learning materials using GSP. As a result of doing the survey, we found that general students were interested in the class using GSP and they could also operate computer without difficulty.