• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.123-134
• /
• 2010

In this paper we propose ubiquitous virtual reality framework and its application for fostering a sustainable content ecosystem in the convergence space of virtual reality and real space. The ubiquitous virtual reality framework supports fundamental infrastructure which consists of platforms for end-users and service providers and dual space management. The platform for the service provider allows experts to generate contents related to real objects while the platform for the end-users allows to consume, share and regenerate the contents contextually augmented over real objects. The dual space management stores, visualizes and provides the contents generated and extended by them for connecting different users and service providers. The proposed framework allows users to continuously generate, share and extend the contents and thus contribute to making multimedia service environment. We also implemented and evaluated the framework consisting of a desktop authoring platform, mobile authoring platform and a dual space management server. We then introduced a promising application scenario to show how the content ecosystem is empowered by ubiquitous virtual reality framework and is realized in our life. Consequently, we are expecting that the ubiquitous virtual reality technology will play a vital role in building continuously evolving multimedia service environment for the future computing environment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.12
• /
• pp.17-27
• /
• 2011

Most of the previous mobility management protocols such as IETF MIPv4/6 and its variants standardized by the IETF do not support global seamless handover because they require partially changes of the existing network infrastructure. In this article, we propose a simple mobility management protocol (SMMP) which can support global seamless handover between homogeneous or heterogeneous wireless networks. To do this, the SMMP employs separate location management function as DMMS to support global user and service mobility and the bidirectional tunnels are dynamically constructed to support seamless IP mobility by using the IEEE MIH extension server, which is extended the IEEE 802.21 MIH standards. The detailed architecture and functions of the SMMP have been designed. Finally, the mathematical analysis and the simulation have been done. The performance results show the proposed SMMP outperforms the existing MIPv6 and HMIPv6 in terms of handover latency, packet loss, pear signal noise ratio (PSNR).

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.363-369
• /
• 2002

가정 내에서의 초고속망 이용이 활성화되면서 가정 내에서의 활동은 매우 다양하고 복잡하며 그에 따른 서비스도 여러 가지 형태가 존재한다. 외부 인터넷망과 연동되는 홈 네트워크의 개념이 생기기 전부터 흠 오토메이션, 홈시큐리티 등의 서비스를 제공하기 위한 고립적인 형태의 망과 서비스 제공 시스템이 있었다. 월드 와이드 웹 서비스를 기본으로 한 인터넷의 폭발적인 활성화와 고속 인터넷망의 확산에 따라 가정 내에서 제공되는 서비스를 인터넷과 연계시키려는 시도가 보편화되었고 가정 내에서 사용되는 독립적인 기기들을 인터넷에 연결하여, 외부의 정보를 이용해서 활용하거나, 가전내의 기기들을 외부에서 액세스할 수 있게 되었다. 이렇게 하여 보다 풍부한 서비스를 제공하고, 사용상의 시간적인 제약을 완화할 수 있다. 예들 들어 인터넷상에서 조리법을 전송받아 전자레인지를 작동할 수 있으며, 외부에서 잘못 켜둔 가스밸브를 잠글 수도 있다. 가정 내에서 wrhd되던 이러한 서비스들은 서로 다른 하드웨어와 통신방법을 사용하고 있어, 이러한 서비스를 통합하여 운영, 관리할 수 있도록 하는 흠 서버의 개념이 대두되었다. 외부 인터넷 망과 연계된 흠 오토메이션, 홈 시큐리티등을 제공할 수 있는 기반이 마련되었고, 가정 내에서 독립적으로 제공되던 서비스들을 단일 홈 서버를 통해서 관리하려는 시도가 진행되었다. 그러나 홈 서버는 개발하는 업체의 보유기술에 따라 중심기능은 약간씩 차이를 보이고 있다. 홈 서버 응용 영역은 전문 지식을 소유한 인력과의 연계가 필요하고, 다양한 서비스 영역 행위가 아주 복잡하기 때문에 이들을 연결해 주는 자치 시스템을 필요로 한다. 또한 홈 서버 서비스 영역에서 정보는 각 영역 전문가가 가진 지식의 전달을 필요로 하기 때문에, 지식을 주고받는 멀티 에이전트의 시스템의 활용 영역으로 적당하다. 멀티 에이전트 시스템은 분산된 환경에서 에이전트간에 에이전트 통신 언어를 사용해서 대화를 하기도 하고, 상호 협력하는 에이전트들로 구성된 시스템을 뜻하며 흠 서버처럼 동적이고 고도의 자치성을 요구하는 영역에 적당하다. 멀티 에이전트 플랫폼으로는 FIPA(Foundation for Intelligent Physical Agents)가 제시한 에이전트 표준 플랫폼이 1997년부터 2000년에 이르기까지, 계속적으로 변화, 발전하고 있다. 본 연구는 FIPA에서 제시하는 플랫폼을 기반으로 홈 서버에 정보가전을 제어하는 에이전트를 두고 외부에서 다른 에이전트가 홈 서버에 위치하는 에이전트와의 통신을 통하기 정보가전을 지능적으로 제어하도록 하였다. 정보가전 에이전트는 가정 내 가전제품을 외부에서 제어하기 위한 에이전트이다. 단순한 관리가 아닌 에이전트로 하여금 지능적으로 가전제품 관리를 하게 한다. 정보가전 에이전트는 홈 서버에서 작동하는 에이전트와 PDA에서 작동하는 에이전트로 구성된다. 정보가전 에이전트는 전력량, 수도 사용량 제어와 가전제품 제어 기능과 보안 관련 서비스를 제공한다. 두 에이전트는 FIPA에서 정의된 규격에 맞게 만들어지기 때문에 FIPA명세서를 따르는 다른 에이전트와 자유로운 통신이 가능하다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.57-64
• /
• 2017

Short message service (SMS) is one of the most important communication methods for people who use mobile phones. However, illegal advertising spam messages exploit people because they can be used without the need for friend registration. Recently, spam message filtering systems that use machine learning have been developed, but they have some disadvantages such as requiring many calculations. In this paper, we implemented a spam message filtering system using the set-based POI search algorithm and sentence similarity without servers. This algorithm can judge whether the input query is a spam message or not using only letter composition without any server computing. Therefore, we can filter the spam message although the input text message has been intentionally modified. We added a specific preprocessing option which aims to enable spam filtering. Based on the experimental results, we observe that our spam message filtering system shows better performance than the original set-based POI search algorithm. We evaluate the proposed system through extensive simulation. According to the simulation results, the proposed system can filter the text message and show high accuracy performance against the text message which cannot be filtered by the 3 major telecom companies.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.94-104
• /
• 2020

Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.101-108
• /
• 2015

This paper presents the implementation of a system that recommends empirical best routes based on classification of large trajectory data. As many location-based services are used, we expect the amount of location and trajectory data to become big data. Then, we believe we can extract the best empirical routes from the large trajectory repositories. Large trajectory data is clustered into similar route groups using Hadoop MapReduce framework. Clustered route groups are stored and managed by a DBMS, and thus it supports rapid response to the end-users' request. We aim to find the best routes based on collected real data, not the ideal shortest path on maps. We have implemented 1) an Android application that collects trajectories from users, 2) Apache Hadoop MapReduce program that can cluster large trajectory data, 3) a service application to query start-destination from a web server and to display the recommended routes on mobile phones. We validated our approach using real data we collected for five days and have compared the results with commercial navigation systems. Experimental results show that the empirical best route is better than routes recommended by commercial navigation systems.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.47-56
• /
• 2005

Recently, with the rapid development of mobile computing, wireless positioning technologies, and the generalization of wireless internet, LBS (Location Based Service) which utilizes location information of moving objects is serving in many fields. In order to serve LBS efficiently, the location data server that periodically stores location data of moving objects is required. Formerly, GIS servers have been used to store location data of moving objects. However, GIS servers are not suitable to store location data of moving objects because it was designed to store static data. Therefore, in this paper, we designed and implemented an extended SLDS(Short-term Location Data Subsystem) for real-time Location Based Services. The extended SLDS is extended from the SLDS which is a subsystem of the GALIS(Gracefully Aging Location Information System) architecture that was proposed as a cluster-based distributed computing system architecture for managing location data of moving objects. The extended SLDS guarantees real-time service capabilities using the TMO(Time-triggered Message-triggered Object) programming scheme and efficiently manages large volume of location data through distributing moving object data over multiple nodes. The extended SLDS also has a little search and update overhead because of managing location data in main memory. In addition, we proved that the extended SLDS stores location data and performs load distribution more efficiently than the original SLDS through the performance evaluation.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.67-75
• /
• 2015

According to the changes of the mobile environments, the usage and interest of the Android apps have been increased. But the usage of illegally-copied apps has been also increased. And the transparency and dependability of the app markets has been decreased. Therefore there are many cases for the copyright infringement of app developers. Although several methods for preventing illegally-copied apps have been studied, there may exist possible ways to bypass the methods. Since it is difficult to find out the first distributors of the illegally-copied apps, it is not easy to punish them legally. This paper proposes the method of detecting illegally-copied apps. The proposed detector can detect the illegally-copied apps using odex file, which is created when the app is installed. The detector can also find out the information of the first distributors based on forensic watermark technique. Since the illegally-copied app detector is running as a service on the system server, it is granted that the detector hides from the users. As an experiment result, the illegally-copied app detector takes on average within 0.2 seconds to detect and delete an illegally-copied app.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.5
• /
• pp.61-76
• /
• 2018

Everything is coming into the world of network where modern people are living. The Internet of Things that attach sensors to objects allows real-time data transfer to and from the network. Mobile devices, essential for modern humans, play an important role in keeping all traces of everyday life in real time. Through the social network services, information acquisition activities and communication activities are left in a huge network in real time. From the business point of view, customer needs analysis begins with SNS data. In this research, we want to build an automatic collection system of SNS contents of web environment in real time using Python. We want to help customers' needs analysis through the typical data collection system of Instagram, Twitter, and YouTube, which has a large number of users worldwide. It is stored in database through the exploitation process and NLP process by using the virtual web browser in the Python web server environment. According to the results of this study, we want to conduct service through the site, the desired data is automatically collected by the search function and the netizen's response can be confirmed in real time. Through time series data analysis. Also, since the search was performed within 5 seconds of the execution result, the advantage of the proposed algorithm is confirmed.