• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.1645-1651
• /
• 2015

This paper describes the changes of shape accuracy in workpiece materials depending on the turning clearance angle. The experiments started from choosing three workpiece materials, SM45C(machine structural carbon steel), STS303(stainless steel) and SCM415 (chrome-molybdenum steel). The experiments showed specifically how features of selected materials changed when they were processed with diverse machining depths, 0.1 mm, 0.2 mm and 0.3 mm, with various negative angles, $0.0^{\circ}(-6.0^{\circ})$, $0.3^{\circ}(-6.3^{\circ})$ and $0.9^{\circ}(-6.9^{\circ})$, and called cutting edge inclination starting from a fixed rotational speed, 2,500 rpm, focusing on the feed rate, 0.07 mm/rev and 0.10 mm/rev. The results of the accuracy of processing, cylindricity, deviation from coaxiality, etc. were compared using the graph and table. The accuracy of cylindricity in the order of degree $0.0^{\circ}{\rightarrow}0.3^{\circ}{\rightarrow}0.9^{\circ}$ depending on the workpiece materials showed the best cylindricity when it was $0.9^{\circ}$. In conclusion, the accuracy improved in specific degrees irrespective of the quality of the materials when the bite negative angles increased. This means that workability improved in these experiments. In addition, the processing shape changed depending on depth of the cut and feed rate.

• Journal of Korean Society of Environmental Engineers
• /
• v.27 no.3
• /
• pp.262-272
• /
• 2005

This study was undertaken to obtain design concentrations for the natural system treating stream water flowing into estuarine lake(Sapgyo). This lake has three major, so called, national-class streams: one is Gokgyo flowing through two medium-size municipal areas and the others are Muhan and Sapgyo placed in mostly rural area nested with some small towns. The results of three year's investigation showed big changes in water quality during the period between dry and wet seasons. Nitrogen concentration usually decreases as the flow rate increases. The change of phosphorus concentration in Gokgyo was the same pattern as nitrogen, but in other two streams it was inversely related with flow rates. This is probably due to the chemical property of the particles washed out from the different stream basins during wet season. It was found that about 40 to 60% of the total nitrogen are in soluble form and on average, 35% of the total phosphorus consists of dissolved-P. Representative concentration of these streams has to be separately determined based on dry and wet season. TDS and SS could be indicating parameters useful to depict and characterize a change of water quality with respect to flow rate because their measurement is easy and also includes a small analytical error. TDS values measured during dry season are related with high nitrogen concentration while during wet season, SS values effectively reflect a high concentration of phosphorus. For design purpose, cumulative concentration distribution graph presented in this paper can be directly or indirectly applied to other streams through a brief comparative and verificative study.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.160-173
• /
• 2013

In this paper, we propose a new visual odometry technique by combining a forward-looking stereo camera and a backward-looking monocular camera. The main goal of the proposed technique is to identify the location of a moving vehicle which travels long distance and comes back to the initial position in urban road environments. While the vehicle is moving to the destination, a global 3D map is updated continuously by a stereo visual odometry technique using a graph theorem. Once the vehicle reaches the destination and begins to come back to the initial position, a map-based monocular visual odometry technqieu is used. To estimate the position of the returning vehicle accurately, 2D features in the backward-looking camera image and the global map are matched. In addition, we utilize the previous matching nodes to limit the search ranges of the next vehicle position in the global map. Through two navigation paths, we analyze the accuracy of the proposed method.

• The Journal of Society for e-Business Studies
• /
• v.23 no.2
• /
• pp.83-96
• /
• 2018

Extracting keywords representing documents is very important because it can be used for automated services such as document search, classification, recommendation system as well as quickly transmitting document information. However, when extracting keywords based on the frequency of words appearing in a web site documents and graph algorithms based on the co-occurrence of words, the problem of containing various words that are not related to the topic potentially in the web page structure, There is a difficulty in extracting the semantic keyword due to the limit of the performance of the Korean tokenizer. In this paper, we propose a method to select candidate keywords based on semantic similarity, and solve the problem that semantic keyword can not be extracted and the accuracy of Korean tokenizer analysis is poor. Finally, we use the technique of extracting final semantic keywords through filtering process to remove inconsistent keywords. Experimental results through real web pages of small business show that the performance of the proposed method is improved by 34.52% over the statistical similarity based keyword selection technique. Therefore, it is confirmed that the performance of extracting keywords from documents is improved by considering semantic similarity between words and removing inconsistent keywords.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.165-173
• /
• 2012

Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.103-114
• /
• 2013

This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and Reverse-delete algorithms verify whether the cycle occurs within the edges of the graph. For this reason, they have problems of unnecessarily performing extra algorithms from the edges, even though they've already obtained the minimum spanning tree. This paper, first of all, suggests the 1st method which reduces the no. of performances by introducing stop point criteria of algorithm, but at the same time, performs algorithms from all the edges, just like how Kruskal and Reverse-delete algorithms. Next, it suggests the 2nd method which finds the minimum spanning tree from the remaining edges after getting rid of all the unnecessary edges which are considered not to affect the minimum spanning tree. These suggested methods have an effect of terminating algorithm at least 1.4 times and at most 3.86times than Kruskal and Reverse-delete algorithms, when applied to the real graphs. We have found that the 2nd method of the Reverse-delete algorithm has the fastest speed in terminating an algorithm, among 4 algorithms which are results of the 2 suggested methods being applied to 2 algorithms.

• The Journal of Engineering Geology
• /
• v.21 no.1
• /
• pp.15-24
• /
• 2011

To clarify the distribution of joints and fracture zones in the Cheongju granitic mass, we analyzed drill-core and geophysical well-logging data obtained at two boreholes located 30 m from each other. Lithological properties were investigated from the drill-core data and the samples were classified based on the rock mass rating (RMR) and on rock quality designation (RQD). Subsurface discontinuities within soft and hard rocks were examined by geophysical well-logging and cross-hole seismic tomography. The velocity structures constructed from seismic tomography are well correlated with the profile of bedrock depth, previously mapped from a seismic refraction survey. Dynamic elastic moduli, obtained from full waveform sonic and ${\gamma}-{\gamma}$ logging, were interrelated with P-wave velocities to investigate the dynamic properties of the rock mass. Compared with the correlation graph between elastic moduli and velocities for hard rock at borehole BH-1, the correlation points for BH-2 data showed a wide scatter. These scattered points reflect the greater abundance of joints and fractures near borehole BH-2. This interpretation is supported by observations by acoustic televiewer (ATV) and optical televiewer (OTV) image loggings.

• Economic and Environmental Geology
• /
• v.47 no.1
• /
• pp.49-59
• /
• 2014

Rainfall-induced landslides are caused by reduction of effective stress and shear strength due to rainfall infiltration. In order to analyze the susceptibility of landslides, the statistical analysis approach has been used widely but this approach has the limitation which cannot take into account of landslide triggering mechanism. Therefore, the physically based model which can consider the process of landslide occurrence was proposed and commonly used. However, the most previous physically based model analyses evaluate and consider the strength characteristics for saturated soil only in the susceptibility analysis. But the strength parameters for unsaturated soil such as matric suction should be considered with the strength parameters for saturated soil since the shear strength in unsaturated soil also plays important role in the stability of slope. Consequently this study suggested the modified physically based slope model which can evaluate strength characteristics for both of saturated and unsaturated soils. In addition, this study evaluated the thickness of saturated part in slope with rainfall intensity and hydraulic characteristics of slope on the basis of physically based model. In order to evaluate the feasibility, the proposed model was applied to practical example in Jinbu area, Gangwon-do, which was experienced large amount of landslides in July 2006. The ROC graph analysis was used to evaluate the validation of the model, and the analysis results were compared with the results of the previous analysis approach.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.3
• /
• pp.39-49
• /
• 2017

Standards suitable for local conditions on deciding one-way road are desperately required to solve traffic congestions at the backside roads in the old downtown areas which were not designated as a road by urban planning. Therefore, this study intends to re-establish a standard to decide one-way road which is regarded to be of the greatest effect among traffic system control methods in order to control one-way road system more efficiently. Also, this paper suggests a standard for such decision to improve efficiency of using backside roads and expand designation of one-way road. AHP (analytic hierarchy process) was carried out among the traffic experts to find out the factors to decide one-way road system. Its result reveals that importance of causing accident to walking quantity and traffic was high. 10,000 cases out of all the possible scenarios of accident by combining detailed evaluation items and scales were extracted to draw the outcomes of analyzing the scenarios, which were schematized in a graph. As a result, division by three sections of point of inflection was verified into $1{\leq}$ section A<1.91, 1.9$1{\leq}$ section B<2.08, and $2.08{\leq}$ section C<3. In other words, priority of deciding one-way road should be given to section C, the highest total point, while posterior to section A, where relatively low points are distributed. The standard on deciding one-way road suggested in this paper may be used for designating one-way road and basic data to re-establish the relevant system in the future.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.401-407
• /
• 2016

We can consider the following problems for two given points p and q in a simple polygon P. (1) Compute the set of points of P which are visible from both p and q. (2) Compute the set of points of P which are visible from either p or q. They are corresponding to the problems which are to compute the intersection and the union of two visibility polygons. In this paper, we consider algorithms for solving these problems on a reconfigurable mesh(in short, RMESH). The algorithm in [1] can compute the intersection of two general polygons in constant time on an RMESH with size O($n^3$), where n is the total number of vertices of two polygons. In this paper, we construct the planar subdivision graph in constant time on an RMESH with size O($n^2$) using the properties of the visibility polygon for preprocessing. Then we present O($log^2n$) time algorithms for computing the union as well as the intersection of two visibility polygons, which improve the processor-time product from O($n^3$) to O($n^2log^2n$).