• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.569-584
• /
• 2016

In this paper, we present a spatial knowledge extractor implemented in Hadoop MapReduce parallel, distributed computing environment. From a large spatial dataset, this knowledge extractor automatically derives a qualitative spatial knowledge base, which consists of both topological and directional relations on pairs of two spatial objects. By using R-tree index and range queries over a distributed spatial data file on HDFS, the MapReduce-enabled spatial knowledge extractor, MRSPAKE, can produce a web-scale spatial knowledge base in highly efficient way. In experiments with the well-known open spatial dataset, Open Street Map (OSM), the proposed web-scale spatial knowledge extractor, MRSPAKE, showed high performance and scalability.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.54 no.1
• /
• pp.12-24
• /
• 2018

This study was conducted in order to improve opening efficiency of the miniaturized large-scale net for anchovy boat seine gear to reduce the fleet size. Field experiments were performed to observe geometry of nets by catcher boats. When the distances between the two ships were 150, 300 and 450 m, and the speeds of towing nets were 0.6, 0.9, and 1.2 k't, respectively. The vertical opening and actual opening of each part of the miniaturized large-scale net was as follows: the front part of the wing net, 8.7-13.3 m, 51-78%; the middle part of the wing net, 28.1-34.2 m, 55-67%; the entrance of the inside wing net, 31.3-38.5 m, 60-73%; the square and bosom, 22.7-29.6 m, 47-62%; the entrance of the body net, 20.9-26.4 m, 42-52%; the entrance of the bag net, 17.2-21 m, 72-89%; the flapper, 13.2-15.3 m, 78-83%; and the end of the bag net, 13.2-15.7 m, 72-75%. By connecting the net pendants with the front part of the wing net, the opening of the front part of the wing net was significantly improved compared to the traditional gear, which ensured both the wing net and the inside wing net with a normal net height. This, in turn, increased the efficiency of herding. The height of the body and bag nets was also higher than that of the tradition gear. In particular, the body net attached to the gear significantly improved the pocket shape of the gear and reduced the number of fish that were caught and escaped from the bag net, which increased the rate of fishing. The tension of towing nets was measured approximately between 2,958 and 7,110 kg, which indicates that the fleet can tow nets with 350 ps, the standard engine horse power. The fishing operation time was shortened compared with of the existent net, and the large-scale buoy attachment operation was also possible to operate the ship without fish detecting boat.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.514-520
• /
• 2018

Presence service provides various information about users such as locations, status of on/offline and network access methods, and number of presence resources required by each users increases largely in mobile environment. Therefore an effective method which can reduce load of presence servers is needed. In this paper, a large scale distributed presence service system which can distribute effectively total presence system load of presence servers using message control session has been presented. This large scale distributed presence service system provides various presence information for massive volumes of users. In this study, a new message control session architecture which can dynamically distribute loads of the presence servers to multiple servers has been presented, and a new presence information data architecture for controlling load of the presence servers has been designed. In this architecture, each presence server can exchange current load level in real time to get variance of the total system load change according to user numbers, and can distribute system load to maintain load level of each server evenly. The performance of the proposed large scale distributed presence service system has been analysed by experiments. The results has been showed that average presence resource subscription processing time reduced from 42.6% to 73.6%, and average presence notification processing time reduced from 37.6% to 64.8%.

• Clean Technology
• /
• v.17 no.3
• /
• pp.250-258
• /
• 2011

Thermal plasma has been presented for the decomposition of perfluorocompounds (PFCs) which are extensively used in the semiconductor manufacturing and display industry. We developed pilot-scale equipment to investigate the large scale treatment of PFCs and called it a "thermal plasma scrubber". PFCs such as $CF_4$, $C_2F_6$, $SF_6$, and $NF_3$ used in experiments were diluted with $N_2$. There were two different types of experiment setup related to the water spray direction inside the thermal plasma scrubber. The first type was that the water was sprayed directly into the gas outlet located at the exit of the reaction section. The second type was that the water was sprayed on the wall of the quenching section. More effective decomposition took place when the water was sprayed on the quenching section wall. For $C_2F_6$, $SF_6$, and $NF_3$ the maximum destruction and removal efficiency was nearly 100%, and for $CF_4$ was up to 93%.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.24 no.6
• /
• pp.400-403
• /
• 2012

Laboratory experiments were conducted for tsunami inundation to an urban area with large building roughness. The waterfront portion of the city of Seaside which is located on the US Pacific Northwest coast, was replicated in 1/50 scale in the wave basin. Tsunami heights and velocities on the inundated land were measured at approximately 31 locations for one incident tsunami heights with an inundation height of approximately 10 m (prototype) near the shoreline. The inundation pattern and speed were more severe and faster in some areas due to the arrangement of the large buildings. Momentum fluxes along the roads were estimated using measure tsunami inundation heights and horizontal fluid velocities. As expected, the maximum momentum flux was near the shoreline and decreased landward. Inundation heights and momentum flux were slowly decreased through the road with buildings on each side. The results from this study showed that the horizontal inundation velocity is an important factor for the external force of coastal structures.

• Atmosphere
• /
• v.26 no.1
• /
• pp.85-95
• /
• 2016

In this study, we investigated the variabilities of wind speed of 850 hPa and precipitable water over the East Asia region using the NCEP Final Analysis data from December 2001 to November 2011. A large variance of wind speed was observed in northern and eastern China during the winter period. During summer, the regions of the East China Sea, the South Sea of Japan and the East Sea show large variances in the wind speed caused by an extended North Pacific High and typhoon activities. The large variances in the wind speed in the regions are shown to be correlated with the inter-annual variability of precipitable water over the inland region of windward side of the Korean Peninsula. Based on the investigation, sensitivity tests to the domain size were performed using the WRF model version 3.6 for heavy precipitation events over the Korean Peninsula for 26 and 27 July 2011. Numerical experiments of different domain sizes were set up with 5 km horizontal and 50 levels vertical resolutions for the control and the first experimental run, and 9 km horizontal for the second experimental run. We found that the major rainfalls correspond to shortwave troughs with baroclinic structure over Northeast China and extended North Pacific High. The correlation analysis between the observation and experiments for 1-h precipitation indicated that the second experiment with the largest domain had the best performance with the correlation coefficient of 0.79 due to the synoptic-scale systems such as short-wave troughs and North Pacific High.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.672-678
• /
• 2020

Ogive parts of large-caliber ammunition in Korea are manufactured by the Press Nosing method, but this method has the disadvantage of requiring additional processes such as lubrication before and after the press process. This study proposes the possibility of applying the Swaging method to improve these shortcomings. A large-diameter shell body was manufactured in sub-scale and plastic working experiments using a swaging process were performed. We investigated whether plastic processing is possible up to 75 % of the diameter reduction rate that satisfies the final molding dimension, and whether the dimensions of the product produced by swaging molding are satisfactory as the hardness changes according to the diameter reduction rate and the increase in thickness. The test using the prototype confirmed that the hardness increased proportionally with the diameter reduction rate and by more than HV 335 at the reduction rate of 75 %. The material thickness variation tended to be similar to the theoretical calculated value, and the thickness increase rate was proportional to 65.4 % at the reduction rate of 75 %.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.383-391
• /
• 2017

As we enter a new era of Big Data, the amount of semantic data has rapidly increased. In order to derive meaningful information from this large semantic data, studies that utilize the SWRL(Semantic Web Rule Language) are being actively conducted. SWRL rules are based on data extracted from a user's empirical knowledge. However, conventional reasoning systems developed on single machines cannot process large scale data. Similarly, multi-node based reasoning systems have performance degradation problems due to network shuffling. Therefore, this paper overcomes the limitations of existing systems and proposes more efficient distributed inference methods. It also introduces data partitioning strategies to minimize network shuffling. In addition, it describes a method for optimizing the incremental reasoning process through data selection and determining the rule order. In order to evaluate the proposed methods, the experiments were conducted using WiseKB consisting of 200 million triples with 83 user defined rules and the overall reasoning task was completed in 32.7 minutes. Also, the experiment results using LUBM bench datasets showed that our approach could perform reasoning twice as fast as MapReduce based reasoning systems.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.293-298
• /
• 2014

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1131-1143
• /
• 2016

How can we effectively compress big graphs composed of billions of edges? By concentrating non-zeros in the adjacency matrix through vertex rearrangement, we can compress big graphs more efficiently. Also, we can boost the performance of several graph mining algorithms such as PageRank. SlashBurn is a state-of-the-art vertex rearrangement method. It processes real-world graphs effectively by utilizing the power-law characteristic of the real-world networks. However, the original SlashBurn algorithm displays a noticeable slowdown for large-scale graphs, and cannot be used at all when graphs are too large to fit in a single machine since it is designed to run on a single machine. In this paper, we propose a distributed SlashBurn algorithm to overcome these limitations. Distributed SlashBurn processes big graphs much faster than the original SlashBurn algorithm does. In addition, it scales up well by performing the large-scale vertex rearrangement process in a distributed fashion. In our experiments using real-world big graphs, the proposed distributed SlashBurn algorithm was found to run more than 45 times faster than the single machine counterpart, and process graphs that are 16 times bigger compared to the original method.