• Journal of Internet Computing and Services
• /
• v.13 no.1
• /
• pp.125-134
• /
• 2012

As the social networking service (SNS), Facebook, and Cyworld, is developing, the social network game and social business commerce based on this service is activated. Especially, the Social Network Game (SNG) is getting explosive interests and it becomes popular, because it is small scale and user can enjoy the game among close friends. The market for this game is getting larger every year, but still it has some limitations in developing the game. Especially, the current game engine is aiming for developing online or console game, and there is no exclusive game engine for developing SNG. Therefore, it takes lots of time for developing SNG with this game engine. In this paper, we described a design and development of the game engine optimized for developing SNG, which not only adapts the main characteristics of the previous game engine, but also considers the specific characteristics of the SNG. The engine also supports map for the simulation game that is the most popular game in SNG, and also provides modules and tools for developing character animation easily. The evaluation standard for the performance of the game engine is the output generation speed of image, text and character. And the results showed reasonable output speed for developing the SNG in generation of image, text, and character.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• The KIPS Transactions:PartB
• /
• v.19B no.3
• /
• pp.189-194
• /
• 2012

In this paper, we propose a query expansion method based on word graphs using pseudo-relevant and pseudo non-relevant documents to achieve performance improvement in information retrieval. The initially retrieved documents are classified into a core cluster when a document includes core query terms extracted by query term combinations and the degree of query term proximity. Otherwise, documents are classified into a non-core cluster. The documents that belong to a core query cluster can be seen as pseudo-relevant documents, and the documents that belong to a non-core cluster can be seen as pseudo non-relevant documents. Each cluster is represented as a graph which has nodes and edges. Each node represents a term and each edge represents proximity between the term and a query term. The term weight is calculated by subtracting the term weight in the non-core cluster graph from the term weight in the core cluster graph. It means that a term with a high weight in a non-core cluster graph should not be considered as an expanded term. Expansion terms are selected according to the term weights. Experimental results on TREC WT10g test collection show that the proposed method achieves 9.4% improvement over the language model in mean average precision.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.307-319
• /
• 2015

Current ontology studies use the Hadoop distributed storage framework to perform map-reduce algorithm-based reasoning for scalable ontologies. In this paper, however, we propose a novel approach for scalable Web Ontology Language (OWL) Horst Lite ontology reasoning, based on distributed cluster memories. Rule-based reasoning, which is frequently used for scalable ontologies, iteratively executes triple-format ontology rules, until the inferred data no longer exists. Therefore, when the scalable ontology reasoning is performed on computer hard drives, the ontology reasoner suffers from performance limitations. In order to overcome this drawback, we propose an approach that loads the ontologies into distributed cluster memories, using Spark (a memory-based distributed computing framework), which executes the ontology reasoning. In order to implement an appropriate OWL Horst Lite ontology reasoning system on Spark, our method divides the scalable ontologies into blocks, loads each block into the cluster nodes, and subsequently handles the data in the distributed memories. We used the Lehigh University Benchmark, which is used to evaluate ontology inference and search speed, to experimentally evaluate the methods suggested in this paper, which we applied to LUBM8000 (1.1 billion triples, 155 gigabytes). When compared with WebPIE, a representative mapreduce algorithm-based scalable ontology reasoner, the proposed approach showed a throughput improvement of 320% (62k/s) over WebPIE (19k/s).

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.8
• /
• pp.632-638
• /
• 2013

This paper describes on the flame stability and combustion instability of coal derived synthetic gas especially for gases of Buggenum IGCC in Netherlands and Taean IGCC in Korea. These combustion characteristics were observed by conducting ambient-pressure elevated-temperature combustion tests in GE7EA model combustor when varying heat input and nitrogen dilution ratio. Flame stability map is plotted according to the flame structure by dividing all regimes into six, and only regime I and II are identified to be stable. Both syngases of Taean and Buggenum with nitrogen integration corresponds to regime II in which syngas burnt stably and flame coupled with outer recirculation flow. Stable regime of Buggenum is larger than that of Taean when considering only $H_2$/CO ratio due to higher content of hydrogen. However, when considering nitrogen dilution, syngas of Taean is burnt more stably than that of Buggenum since more nitrogen in Buggenum has negative effect on the stability of flame.

• The Journal of the Korea Contents Association
• /
• v.13 no.12
• /
• pp.38-47
• /
• 2013

An image coding based on MRC model, a kind of multi-layer image model, first segments a screen image into foreground, mask, and background layers, and then compresses each layer using a codec that is suitable to the layer. The mask layer defines the position of foreground regions such as textual and graphical contents. The colour signal of the foreground (background) region is saved in the foreground (background) layer. The mask layer which contains the segmentation result of foreground and background regions is of importance since its accuracy directly affects the overall coding performance of the codec. This paper proposes a new layer segmentation algorithm for the MRC based image coding. The proposed method extracts text pixels from the background using morphological top hat filtering. The application of white or black top hat transformation to local blocks is controlled by the information of relative brightness of text compared to the background. In the proposed method, the boundary information of text that is extracted from the edge map of the block is used for the robust decision on the relative brightness of text. Simulation results show that the proposed method is superior to the conventional methods.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.322-331
• /
• 2009

This paper proposes an efficient data representation of stereo images using edge-based mesh optimization. Mash-based two dimensional warping for stereo images mainly depends on the performance of a node selection and a disparity estimation of selected nodes. Therefore, the proposed method first of all constructs the feature map which consists of both strong edges and boundary lines of objects for node selection and then generates a grid-based mesh structure using initial nodes. The displacement of each nodal position is iteratively estimated by minimizing the predicted errors between target image and predicted image after two dimensional warping for local area. Generally, iterative two dimensional warping for optimized nodal position required a high time complexity. To overcome this problem, we assume that input stereo images are only horizontal disparity and that optimal nodal position is located on the edge include object boundary lines. Therefore, proposed iterative warping method performs searching process to find optimal nodal position only on edge lines along the horizontal lines. In the experiments, we compare our proposed method with the other mesh-based methods with respect to the quality by using Peak Signal to Noise Ratio (PSNR) according to the number of nodes. Furthermore, computational complexity for an optimal mesh generation is also estimated. Therefore, we have the results that our proposed method provides an efficient stereo image representation not only fast optimal mesh generation but also decreasing of quality deterioration in spite of a small number of nodes through our experiments.

• Journal of Navigation and Port Research
• /
• v.40 no.4
• /
• pp.207-212
• /
• 2016

The box-counting(BC) method is one of the most commonly used methods for fractal dimension calculation of binary images in the fields of Engineering, Science, Medical Science, Geology, etc due to its simplicity and reliability. It deals with only square images with each size equal to the power of 2 to prevent it from discarding unused pixels for images of arbitrary size. In this paper, we presents a more efficient BC method based on the original one, which is applicable to images of arbitrary size. The proposed approach allows the number of the counting boxes to be real to improve the estimation accuracy. The mean absolute error performance is computed on two deterministic fractal images whose theoretical dimensions are well known to compare with those of the existing BC method and triangular BC method. The experimental results show that the proposed method can outperform the two methods and assess the complexity of coastline images of Korea and Chodo island taken from the Google map.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.4
• /
• pp.229-240
• /
• 2019

3D geo-spatial model have been widely used in the field of Civil Engineering, Medical, Computer Graphics, Urban Management and many other. Especially, the demand for high quality 3D spatial information such as precise road map construction has explosively increased, MMS and UAV techniques have been actively used to acquire them more easily and conveniently in surveying and geo-spatial field. However, in order to perform 3D modeling by integrating the two data set from MMS and UAV, its so needed an proper registration method is required to efficiently correct the difference between the raw data acquisition sensor, the point cloud data generation method, and the observation accuracy occurred when the two techniques are applied. In this study, we obtained UAV point colud data in Yeouido area as the study area in order to determine the automatic registration performance between MMS and UAV point cloud data using ICP(Iterative Closet Point) method. MMS observations was then performed in the study area by dividing 4 zones according to the level of overlap ratio and observation noise with based on UAV data. After we manually registered the MMS data to the UAV data, then compared the results which automatic registered using ICP method. In conclusion, the higher the overlap ratio and the lower the noise level, can bring the more accurate results in the automatic registration using ICP method.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.23 no.2
• /
• pp.95-105
• /
• 2020

In order to promote efficient coastal management, it is important to continuously monitor the characteristics of the terrain, which are changed by various factors. In this study, time series UAV images were taken of Gyeokpo beach. And the standard deviation of ±11cm(X), ±10cm(Y), and ±15cm(Z) was obtained as a result of comparing with the VRS measurement performance for UAV position accuracy evaluation. Therefore, it was confirmed that the tolerance of the digital map work rule was satisfied. In addition, as a result of monitoring the erosion and sedimentation changes using the DSM(digital surface model) constructed through UAV images, an average of 0.01 m deposition occurred between June 2018 and December 2018, and in December 2018 and June 2019. It was analyzed that 0.03m of erosion occurred. Therefore, 0.02m of erosion occurred between June 2018 and June 2019. From the topographical change analysis results, the area of erosion and sediment height was analyzed, and the area of erosion and sedimentation was widely distributed in the ±0.5m section. If we continuously monitor the topographical changes in the coastal regions by using the 3D terrain modeling results using the time series UAV images presented in this study, we can support the coastal management tasks such as supplement or dredging of sand.