• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.56-70
• /
• 2005

The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.86-94
• /
• 2009

Currently, positioning methods for LBS(Location Based Service) are GPS and network-based positioning techniques that use mobile communication networks. In these methods, however, the accuracy of positioning decreases due to the propagation delay caused by the non-line-of-sight(NLOS) effect and the repeater. To address this disadvantage, the CDMA system uses Pattern Matching algorithm. The Pattern Matching algorithm constructs a database of the propagation characteristics of the RF signals measured during the GPS positioning along with the positioned locations, so that the location can be provided by comparing the propagation characteristics of the received signals and the database, upon a user's request. In the area where GPS signals are not received, however, a database cannot be constructed. There are problem that the accuracy of positioning decreases due to the area without a database Because Pattern Matching algorithm depend on database existence. Therefore, this paper proposed a pilot signal strength prediction algorithm to enable construction of databases for areas without databases, so as to improve the performance of the Pattern Matching algorithm. The database was constructed by predicting the pilot signals in the area without a database using the proposed algorithm, and the Pattern Matching algorithm analysed positioning performance.

• Korean Journal of Clinical Laboratory Science
• /
• v.52 no.3
• /
• pp.202-213
• /
• 2020

Although technological advances have allowed the efficient collection of large amounts of microbiome data for microbiological studies, proper analysis tools for such big data are still lacking. Additionally, analyses of microbial communities using poor databases can lead to misleading results. Hence, this study aimed to design an appropriate method for the analysis of big microbial databases. Bacteria were collected from the fingertips and personal belongings (mobile phones and laptop keyboards) of individuals. The genomic DNA was extracted from these bacteria and subjected to next-generation sequencing by targeting the 16S rRNA gene. The accuracy of the bacterial matching percentage between the fingertips and personal belongings was verified using a formula and an environment-related and human-related database. To design appropriate analysis, the bacterial matching accuracy was calculated based on the following three categories: comparison between qualitative and quantitative analysis, comparisons within same-gender participants as well as all participants regardless of gender, and comparison between the use of a human-related bacterial database (hDB) and environment-related bacterial database (eDB). The results showed that qualitative analysis, comparisons within same-gender participants, and the use of hDB provided relatively accurate results. This study provides an analytical method to obtain accurate results when conducting studies involving big microbiological data using human-derived microorganisms.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.51-62
• /
• 2004

Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1188-1190
• /
• 2003

Taipei Watershed Management Bureau (WRATB) is a government agency entitled for water resources protection at two major watersheds in order to provide drinking water for about four millions population in Taipei on a sustainable basis. At WRATB, there are two major public sewage treatment facilities which can convert sewage in each watershed into an acceptable state before they were discharged into rivers. More than 82% of household wastewater have been collected and treated by the two public sewage systems. However, households at remote area still need more effective sewage management prescriptions. The objective of this paper is to implement geographic information systems in order to provide more effective approaches that sewage management can be easier and cost effective. ArcIMS was implemented for Internet browsing and map server of those sewage facilities on personal computers, laptop computers. In the open field, ArcPAD was implemented with personal digital assistant (PDA) such that compact flash type's global positioning systems (GPS) and digital camera can be utilized with PDA. All sewage facilities digital files were convert into ArcMap format files. MapObjects and visual BASIC were used to create sewage application modules to meet every single technician personal flavor. ASP.NET was implemented for Internet database manipulations of all sewage databases. Mobile GIS was the key component of GIS applications in the open field for sewage management on a basis of house by house. Houses at remote area, which can not cover by the two public sewage systems, were managed by PDA and laptop computers with GPS and digital camera. Sewage management at Taipei Watershed Management Bureau is easier both in the open field and in the office. Integration of GPS, GIS, and PDA makes sewage management in the open field much easier. ArcIMS, MapObjects, ASP.NET and visual BASIC make sewage management can be done in the office and over Internet.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.37-48
• /
• 2004

The SyncML, the standard synchronization protocol, supports the synchronization of various application services between a client and a server such as an address book, a calendar. Even with this standard protocol, SyncML application developers usually spend a long time and efforts implementing service specific logics and databases. This paper designed and implemented the SDE(Service Development Environment) which is an integrated development environment for SyncML server developers to develop an application service rapidly and correctly. The SDE consists of two components i.e., the Sync Library and the SEG(Sync Engine Generator) tool. To prove the applicability of this study we implemented a SyncML server by using the SDE and also carried out the correctness tests and the performance test. We hope this system helps developers implement mobile application services more efficiently.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.70-83
• /
• 2007

Most of works for skyline queries have focused on static data objects. With the advance in mobile applications, however, the need of continuous skyline queries for moving objects has been increasing. To process continuous skyline queries, the 4-phased decision method of skyline regions has been proposed recently. However, it is not feasible for a large number of data because of the high cost of computing skyline regions. To solve this problem, this paper first provides a theoretical analysis of the 4-phased decision method. Then we propose a progressive decision method of skyline regions for the 4-phased decision method, which consists of a distance-based pruning and an extent shrinking of region decision lines. The proposed method can efficiently reduce the cost of the decision of skyline region in the 4-phased decision method. This paper also presents the experimental results to show the effectiveness of the proposed method.

• KIISE Transactions on Computing Practices
• /
• v.22 no.11
• /
• pp.583-590
• /
• 2016

Recently, the rapidly increasing interest in IoT in almost all areas of casual human life has led to wide acceptance of speech recognition as a means of HCI. Simultaneously, the demand for speech recognition systems for mobile environments is increasing rapidly. The server-based speech recognition systems are typically fast and show high recognition rates; however, an internet connection is necessary, and complicated server computation is required since a voice is recognized by units of words that are stored in server databases. In this paper, we present a novel method for recognizing the Korean vowel 'ㅗ', as a part of a phoneme based Korean speech recognition system. The proposed method involves analyses of waveform patterns in the time domain instead of the frequency domain, with consequent reduction in computational cost. Elementary algorithms for detecting typical waveform patterns of 'ㅗ' are presented and combined to make final decisions. The experimental results show that the proposed method can achieve 89.9% recognition accuracy.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.