• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1283-1287
• /
• 2003

Reverse engineering technology refers to the process that creates a CAD model of an existing part using measuring devices. Recently, non-contact scanning devices have become more accurate and the speed of data acquisition has increased drastically. However, they generate thousands of points per second and various types of point data. Therefore. it becomes a important to handle the huge amount and various types of point data to generate a surface model efficiently. This paper proposes a new triangular mesh generation method using 3D grids. The geometric information of a part can be obtained from point cloud data by estimating normal values of the points. In our research, the non-uniform 3D grids are generated first for feature based data reduction based on the geometric information. Then, triangulation is performed with the reduced point data. The grid structure is efficiently used not only for neighbor point search that can speed up the mesh generation process but also for getting surface connectivity information to result in same topology surface with the point data. Through this integrated approach, it is possible to create surface models from scanned point data efficiently.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.877-885
• /
• 2009

In this paper, we propose the SINDI-Grid which is a high-performance framework for scientific and technological knowledge discovery using the grid computing. By using the advantages of the grid computing providing data repository of large-volume and high-speed computing power, the SINDI-Grid framework provides a variety of grid services for distributed data analysis and scientific knowledge processing. And the SINDI-Workflow tool exploits these services so that performs the design and execution for scientific and technological knowledge discovery applications which integrate various information processing algorithms.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.2
• /
• pp.35-48
• /
• 2008

In this paper, we propose a Dynamic Heuristic to reduce the number of node accesses and improve quality of path in the client-based navigation service. The Dynamic Heuristic is to use heuristic data from server that is calculated with traffic data. The server-based navigation service provides a path searched on server and transmits it to client, but we propose that server only provide heuristic data to client. The proposed client searches a path with heuristic transmitted data from server. We present a new algorithm for using Dynamic Heuristic in the path-finding. The algorithm bases Grid Based Path-Finding, and has minimum speed data of edges in grid. It removes several grids whose minimum speed is less than limited speed.

• International Journal of Contents
• /
• v.6 no.1
• /
• pp.47-52
• /
• 2010

Skyline queries are an important new search capability for multi-dimensional databases. Most of the previous works have focused on processing skyline queries over static data set. However, most of the real applications deal with the dynamic data set. Since dynamic data set constantly changes as time passes, the continuous skyline computation over dynamic data set becomes ever more complicated. In this paper, we propose a multiple layer grids method for continuous skyline computation (MLGCS) that maintains multiple layer grids to manage the dynamic data set. The proposed method divides the work space into multiple layer grids and creates the skyline influence region in the grid of each layer. In the continuous environment, the continuous skyline queries are only handled when the updating data points are in the skyline influence region of each layer grid. Experiments based on various data distributions show that our proposed method outperforms the existing methods.

• The Journal of Information Systems
• /
• v.26 no.2
• /
• pp.1-23
• /
• 2017

Purpose Facebook is a social network service that has the highest number of Monthly Active Users around the world. Hence, marketers have selected Facebook as the most important platform to get customer engagement. With respect to the customer engagement enhancement, the most popular and engaging post type in the Facebook brand fan pages related to what was usually classified as 'sweepstakes'. Sweepstakes refer to a form of gambling where the entire prize may be awarded to the winner. Which makes customers more engaged with the brand. This study aims to explore sweepstakes-oriented social media marketing approaches based on the application of big data analytics. Design/methodology/approach we collect sweepstakes data from each company based on the data crawling from the Facebook brand fan pages. The output of this study explains how companies in each category of FCB grid can design and apply sweepstakes for their social media marketing. Findings The results show that they have one thing in common across the four quadrants of FCB grid. Regardless of the quadrants, most frequently observed type is 'Simple/Quiz or Comments/Quatrains [event type of sweepstakes] + Gifticon [type of reward prize] + Image [type of message display] + No URL [Link toother website] +Single-Gift-Offer [type of reward prize payment]'. So, if the position of the brand is hard to be defined by the FCB grid model, then this general rule can be applied to all types of brands. Also some differences between the quadrants of the FCB grid were observed. This study offers several research implications by analyzing Sweepstakes-oriented social media marketing approaches in Facebook brand fan pages. By using the FCB grid model, this study provides guidance on how companies can design their sweepstakes-oriented social media marketing approaches in the context of Facebook brand fan pages by considering their context.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1284-1286
• /
• 2003

There is a growing demand on remotely sensed and GIS data services in modern society. However, conventional WEB applications based on client/server pattern can not meet the criteria in the future . Grid computing provides a promising resolution for establishing spatial information system toward future applications. Here, a new architecture of the distributed environment for remotely sensed data processing based on the middleware technology was proposed. In addition, in order to utilize the new environment, a problem had to be algorithmically expressed as comprising a set of concurrently executing sub-problems or tasks. Experiment of the algorithm was implemented, and the results show that the new environmental can achieve high speedups for applications compared with conventional implementation.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.597-605
• /
• 2012

With the smart grid coming near, wide-area supervisory control and data acquisition (SCADA) becomes more and more important. However, traditional SCADA systems are not suitable for the openness and distribution requirements of smart grid. Distributed SCADA services should be openly composable and secure. Event-driven methodology makes service collaborations more real-time and flexible because of the space, time and control decoupling of event producer and consumer, which gives us an appropriate foundation. Our SCADA services are constructed and integrated based on distributed events in this paper. Unfortunately, an event-driven SCADA service does not know who consumes its events, and consumers do not know who produces the events either. In this environment, a SCADA service cannot directly control access because of anonymous and multicast interactions. In this paper, a distributed security framework is proposed to protect not only service operations but also data contents in smart grid environments. Finally, a security implementation scheme is given for SCADA services.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.4
• /
• pp.109-118
• /
• 2011

In this research estimated accuracies that were results in all the area of filtering of the plane equation that was used by whole data set, and regional of filtering that was driven by the plane equation for each vertual Grid. All of this estimates were based by all the area of filtering that deduced the plane equation by multiple linear regression analysis that was used by ground data set. Therefore, accuracy of all the area of filtering that used whole data set has been dropped about 2~3% when average of accuracy of all the area of filtering was based on ground data set while accuracy of Regional of filtering dropped 2~4% when based on virtual Grid. Moreover, as virtual Grid which was set 3~4 cm was difference about 2% of accuracy from standard data. Thus, it leads conclusion of set 3~4 times bigger size in virtual Grid filtering over LiDAR scan gap will be more appropriated. Hence, the result of this research allow us to conclude that there was difference in average accuracy has been noticed when we applied each different approaches, I strongly suggest that it need to research more about real topography for further filtering accuracy.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.169-176
• /
• 2009

Low-cost sensors have been widely used for mobile robot navigation in recent years. However, navigation performance based on low-cost sensors is not good enough to be practically used. Among many navigation techniques, building of an accurate map is a fundamental task for service robots, and mapping with low-cost IR sensors was investigated in this research. The robot's orientation uncertainty was considered for mapping by modifying the Bayesian update formula. Then, the data association scheme was investigated to improve the quality of a built map when the robot's pose uncertainty was large. Six low-cost IR sensors mounted on the robot could not give rich data enough to align the range data by the scan matching method, so a new sample-based method was proposed for data association. The real experiments indicated that the mapping method proposed in this research was able to generate a useful map for navigation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.948-952
• /
• 2009

Recently, a new distributed grid scheme, called DS-GRID(distributed S-GRID), has been proposed to manage the location information of moving objects in a spatial network[1]. However, because DS-GRID uses uniform grid cells, it cannot handle skewed data which frequently occur in the real application. To solve this problem, we propose a dynamic distributed grid scheme which splits a grid cell dynamically based on the density of moving objects. In addition, we propose a k-nearest neighbor processing algorithm for the proposed scheme. Finally, it is shown from the performance analysis that our scheme achieves better retrieval and update performance than the DS-GRID when the moving objects are skewed.