• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.55-60
• /
• 2015

This paper introduces a program structure that minimizes the client's business logic by reducing the client's specifications as a way of minimizing the limitations of online game platforms. The objective of this thesis is to design an online game that is based on a 3-tier client/server structure, and thus using this 3-tier structure to ultimately create an online Sutda game that anyone can enjoy. The progression of newly released games is highly based on the mobile market and the number of online games being launched is decreasing. As the mobile game market grows, more and more multi-platform games are being developed and target platforms within online games are greatly diversifying. Through these situations, this thesis minimizes the client's business logic through a 3-tier structure of application-middleware-database, and also proposes an online game client/server that allows three or more users to participate simultaneously through the server.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.3
• /
• pp.190-200
• /
• 2011

Android platform provides a content provider and a cursor mechanism to access the internal SQLite engine. Content providers not only store and retrieve data but also make it accessible to applications. Applications can only share data through content provider, since there's no common storage area that Android packages can access. Cursor is an interface that provides random read-write access to the result set returned by a database query. However, this cursor possesses two major limitations. First, a cursor does not support a join clause among cursors, since the cursor can only access a single table in the content provider. Second, the cursor is not capable of creating user-customized field in the predefined content providers. In this paper, we propose the unified cursor architecture that merges several cursors into a single virtual cursor. Cursor translation look-aside buffer (TLB), column windowing mechanism and virtual data management are the three major techniques we have adopted to implement our structure. And we also propose a delayed synchronization method between an application and a proposed unified cursor. An application can create a user-customized field and sort multiple tables using a unified cursor on Android platform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1022-1036
• /
• 2004

In mobile cellular network the ever-changing location of a mobile host necessitates the continuous tracking of its current position and efficient management of location information. A database called Home Location Register(HLR) plays a major role in location management in this distributed environment, providing table management, index management, and backup management facilities. The objectives of this paper are to identify the p개blems of the current HLR system through rigorous analysis, to suggest solutions to them, and to propose a new architecture for the HLR system. In the HLR system, a main memory database system is used to provide real-time accesses and updates of subscriber's information. Thus it is suggested that the improvement bemade to support better real-time facilities, to manage subscriber's information more reliably, and to accommodate more subscribers. In this paper, I propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the T-tree index method. Insertion md deletion overhead of the chained bucket hashing method is less than that of modified linear hashing method. In the proposed backup method, I use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration-location operations. Performance analysis has been performed to evaluate the proposed techniques based on a system with subscribers. The results show that, in comparison with the current techniques, the memory requirement is reduced by more than 62%,directory operations, and backup operation by more than 80%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.25-44
• /
• 2010

With the increasing popularity of mobile devices, it has become necessary to protect private information and content in these devices. Face recognition has been favored over conventional passwords or security keys, because it can be easily implemented using a built-in camera, while providing user convenience. However, because mobile devices can be used both indoors and outdoors, there can be many illumination changes, which can reduce the accuracy of face recognition. Therefore, we propose a new face recognition method on a mobile device robust to illumination variations. This research makes the following four original contributions. First, we compared the performance of face recognition with illumination variations on mobile devices for several illumination normalization procedures suitable for mobile devices with low processing power. These include the Retinex filter, histogram equalization and histogram stretching. Second, we compared the performance for global and local methods of face recognition such as PCA (Principal Component Analysis), LNMF (Local Non-negative Matrix Factorization) and LBP (Local Binary Pattern) using an integer-based kernel suitable for mobile devices having low processing power. Third, the characteristics of each method according to the illumination va iations are analyzed. Fourth, we use two matching scores for several methods of illumination normalization, Retinex and histogram stretching, which show the best and $2^{nd}$ best performances, respectively. These are used as the inputs of an SVM (Support Vector Machine) classifier, which can increase the accuracy of face recognition. Experimental results with two databases (data collected by a mobile device and the AR database) showed that the accuracy of face recognition achieved by the proposed method was superior to that of other methods.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.221-232
• /
• 2001

Due to rapid advance of wireless communication technology, demand on data services in mobile environment is gradually increasing. Caching at a mobile client could reduce bandwidth consumption and query response time, and yet a mobile client must maintain cache consistency. It could be efficient for the server to broadcast a periodic cache invalidation report for cache consistency in a cell. In case that long period of disconnection prevents a mobile client from checking validity of its cache based solely on the invalidation report received, the mobile client could request the server to check cache validity. In doing so, some schemes may be more efficient than others depending on the number of available channels and the mobile clients involved. In this paper, we propose new cache consistency schemes, effects, efficient especially (1) when channel capacity is enough to deal with the mobile clients involved or (2) when that is not the case, and evaluate their performance.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.235-242
• /
• 2002

We propose an advanced transaction scheduling protocol for concurrency control of multilevel secure databases in wireless mobile network environment. Wireless communication is characterized by frequent spurious disconnections. So short-lived transaction must quickly access database without any delay by long-lived one. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure databases in wireless mobile network environment. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of a1truism has also been deployed for extended a1truistic locking. This is in a way that scope of data to he early released is enlarged to include even data initially not intended to be donated. Our protocol is based on extended altruistic locking, but a new method, namely bi-directional donation locking for multilevel secure databases (MLBiDL), is additionally used in order to satisfy security requirements and concurrency. We showed the Simulation experiments that MLBiDL outperforms the other locking protocols in terms of the degree of throughput and average waiting time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.290-295
• /
• 2007

최근 인터넷의 발달로 디지털 콘텐츠 및 UCC(User Created Contents) 산업이 발전하고 있다. 그러나 이로 인한 부작용도 많이 발생한다. 대표적인 문제는 디지털 콘텐츠의 무단 불법복제나 무료배포행위이다. 이는 디지털 콘텐츠 산업의 성장과 UCC 제작자의 창작의지 를 저해하여 웹2.0시대의 중심인 양질의 콘텐츠 생산을 방해한다. 본 논문에서는 위의 문제를 해결하기 위하여 멀티미디어 콘텐츠의 경매 시스템 과 경매 프로세스를 제시하였다. 본 논문에서는 멀티미디어 콘텐츠에 중고의 개념을 도입하였다. 특히, 모바일 상에서 경매가 가능하도록 새로운 시스템 구조를 제안하고, 멀티미디어 콘텐츠의 경매거래 프로세스를 새롭게 제안하였다. 시스템의 성능 분석 결과 주요 경매프로세스는 성능 분석 과정을 통하여 $\theta$ (logN) 의 정수 배(m)의 시간을 사용하는 알고리즘임을 소개하고 사용자나 콘텐츠의 양이 폭발적으로 증가하는 경우에도 시스템의 성능에 크게 영향을 받지 않는다는 것을 보인다.

• The Research Journal of the Costume Culture
• /
• v.22 no.2
• /
• pp.313-325
• /
• 2014

This study seeks to establish a ubiquitous wardrobe with a clothing management function through detailed and subdivided integration research. To create a database, a survey was conducted, and the output data were analyzed and used as the basic data. In particular, this study researched clothing management programs and companies' standards of clothing product classification systems. First, through an in-depth analysis centering on specialists, we established the contents of a ubiquitous wardrobe and used the concept of cloud computing to support the wardrobe contents and smart phone applications. Second, this research found significant differences between individuals, schools, and enterprises in their applications of, and the importance they attach to, design images. A detailed database composed of various categories was established to present the ubiquitous wardrobe contents with efficient functions. Third, we facilitated the search process by designating clothes with QR codes, which is one of the functions of contents. Fourth, the code numbers generated in the process of entering clothes into the database were utilized as RFID information as a way to arrange the products in a simpler manner. The ubiquitous wardrobe was constructed as a web-style hybrid, and its contents areavailable through mobile applications and QR codes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.103-112
• /
• 2008

In this paper we present two databases for two different systems each having novel implementation ideas: a u-Healthcare system with a mobile gateway and MAGI network monitoring system. u-Healthcare system is capturing and monitoring vital sign data without restrictions of location and time using body sensor network and a mobile gateway. MAGI is a system which has a dynamic firewall function and solves problems of existing traffic monitoring tools. In addition to presenting the design principles behind these two systems, we describe the respective database schemas together with detailed information of the data stored within the databases. We will also show and discuss performance measurements and calculations for both systems. Based on the performance data we will discuss the systems' suitability for their intended uses.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.4
• /
• pp.795-804
• /
• 2009

An HSS(Home Subscriber Server) system requires a main-memory database on main-memory unit for the real-tine management of the subscriber information in the mobile communication service, in that the system controls not only basic data for handling calls of users, but also additional service data related to user authentication and operational data. Nonetheless, HSS-DBS system, requiring the reliability and stability, need more secure data store method and a back-up technique because the system have a long startup time and the big problem on the failures of main-memory. This paper proposes an efficient back-up replication technique, on the basis of enhancing the stability and performance of HSS system. The proposed shadowing back-up technique adopting the delayed recovery process, can help minimize the real-time back-up overloads by location registration, while the proposed backup replication method enables more stable system operations with replicating the data to remote server in real time.