• Journal of the Korea Institute of Building Construction
• /
• v.21 no.6
• /
• pp.677-687
• /
• 2021

If a fire breaks out in a building, occupants can evacuate more rapidly if they are able to identify the location of the fire, the exits, and themselves. This study derives the requirements of system development, such as distance non-limitation, a non-additional device, a non-centralized server system, and low power for an emergency, to identify information about the fire and the location of evacuees. The objective is to receive and transmit information and reduce the time and effort of the database for location tracking. Accordingly, this study develops a server-independent system that collects information related to a building fire and an evacuee's location and provides information to the evacuee on their mobile device. The system is composed of a transmitting unit to disseminate fire location information and a mobile device application to determine the locations of the fire and the evacuee. The developed system can contribute to reducing the damage to humans because evacuees can identify the location of the fire, exits, and themselves regardless of the impaired server system by fire, the interruption of power source, and the evacuee's location. Furthermore, this study proposes a theoretical basis for reducing the effort required for database construction of the k-nearest neighbor fingerprint.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.25-37
• /
• 2005

Recently, with the development of wireless communications and mobile computing, interest about mobile computing is rising. Mobile computing can be regarded as an environment where a user carries mobile devices, such as a PDA or a notebook, and shares resources with a server computer via wireless communications. A mobile database refers to a database which is used in these mobile devices. The mobile database can be used in the fields of insurance business, banking business, medical treatment, and so on. Especially, LBS(Location Based Service) which utilizes location information of users becomes an essential field of mobile computing. In order to support LBS in the mobile environment, there must be an Embedded Spatial MMDBMS(Main-Memory Database Management System) that can efficiently manage large spatial data in spatial mobile devices. Therefore, in this paper, we designed and implemented the Embedded Spatial MMDBMS, extended from the HSQLDB which is an existing MMDBMS for PC, to manage spatial data efficiently in spatial mobile devices. The Embedded Spatial MMDBMS adopted the spatial data model proposed by ISO(International Organization for Standardization), provided the arithmetic coding method that is suitable for spatial data, and supported the efficient spatial index which uses the MBR compression and hashing method suitable for spatial mobile devices. In addition, the system offered the spatial data display capability in low-performance processors of spatial mobile devices and supported the data caching and synchronization capability for performance improvement of spatial data import/export between the Embedded Spatial MMDBMS and the GIS server.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.4
• /
• pp.123-128
• /
• 2020

As the use of digital devices is becoming more commonplace, digital forensics techniques recover data to collect physical evidence during the investigation. Among them, the file forensics technique recovers deleted files, therefore, it can recover the database by recovering all files which compose the database itself. However, if the record is deleted from the database, the modified record contents will not be restored even if the file is recovered. For this reason, the database forensics technique is required to recover deleted records. Database forensics obtains metadata from database configuration files and recovers deleted records from data files. However, record recovery is difficult if database metadata such as block size cannot be obtained from the database. In this paper, we propose three methods for obtaining block size, which is database metadata. The first method uses the maximum size of free space in the block, and the second method uses the location where the block appears. The third method improves the second method to find the block size faster. The experimental results show that three methods can correctly find the block size of three DBMSes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.8
• /
• pp.793-800
• /
• 2016

The efficient materials management in construction field is a very important work required for designing and demolishing building. As the waste amount caused by the building demolition is increased, the concern related to the treatment method, recyclability, and effect on the environment have been gradually increased. In general, the conventional databases for the construction materials management does not consider the reuse of the construction materials on steps for the building demolition and reconstruction, but they only consider managing the type and input amount of them. In this paper, we propose the database system for efficiently managing the various construction materials informations including the location and condition of each construction materials for the efficient reuse of them on the building demolition and reconstruction. The considered informations are obtained the RFID(: Radio Frequency IDentification) system with on-board the location estimation module. Using the reuse management of construction materials, based on the proposed database, we expect the reduction of the construction cost and time.

• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.35-46
• /
• 2000

One of the main chalenges in personal communication services (PCS) is to locate many mobile terminals that may move frequently from place to place. Such a system operation is called location management. Many network signaling traffic, and database queries are required to achieve such a task. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current location on mobile terminals, and are vulnerable to failure of the location registers. In this paper, we propose a fault-tolerant pointer forwarding with distributed home location register (FT-RFDHLR) to tolerate the failure of location registers. The performance of the proposed method is evaluated by an analytical model, and is compared with thew pointer forwarding with the single home location register (PFSHLR), the pointer forwarding with distributed home location register (PFDHLR), Biaz's bypass forwarding strategy (BFS) and two-path forwarding strategy (TPFS).

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.85-94
• /
• 2010

In this paper, we propose a location-prediction structure that can provide user service in advance. It consists of seven steps and supplies intelligent services which can forecast user's location. Context information collected from physical sensors and a history database is so difficult that it can't present importance of data and abstraction of data because of heterogeneous data type. Hence, we offer the location-prediction that change data type from heterogeneous data to homogeneous data. Extracted data is clustered by SOFM, then it gets user's location information by ARIMA and realizes the services by a reasoning engine. In order to validate the proposed location-prediction, we built a test-bed and test it by the scenario.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.618-627
• /
• 2014

Nowadays mobile users are using a popular service called Location-Based Services (LBS). LBS is very helpful for a mobile user in finding various Point of Interests (POIs) in their vicinity. To get these services, users must provide their personal information, such as user identity or current location, which severely risks the location privacy of the user. Many researchers are developing schemes that enable a user to use these LBS services anonymously, but these approaches have some limitations (i.e., either the privacy prevention mechanism is weak or the cost of the solution is too much). As such, we are presenting a robust scheme for mobile users that allows them to use LBS anonymously. Our scheme involves a client side application that interacts with an untrusted LBS server to find the nearest POI for a service required by a user. The scheme is not only efficient in its approach, but is also very practical with respect to the computations that are done on a client's resource constrained device. With our scheme, not only can a client anonymously use LBS without any use of a trusted third party, but also a server's database is completely secure from the client. We performed experiments by developing and testing an Android-based client side smartphone application to support our argument.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.65-74
• /
• 2003

Location-based service is an important spatiotemporal database application area that provides the location-aware information of wireless terminals via positioning devices such as GPS. With the rapid advances of wireless communication systems, the requirement of mobile application areas including traffic, mobile commerce and supply chaining management became the center of attention for various research issues in spatiotemporal databases. In this paper we present the A-Quadtree, an efficient indexing method for answering location-based queries where the movement vector information (e.g., speed and velocity) is not presented. We implement the A-Quadtree with an index structure for object identifiers as a.Net component to apply the component to multiplatforms. We present our approach and describe the performance evaluation through various experiments. In our experiments, we compare the performance with previous approaches and show the enhanced efficiency of our method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.109-115
• /
• 2011

As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So artificial neural network(ANN) clustering algorithm is applied to improve KNN, which is the KNN/ANN hybrid algorithm presented in this paper. For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of ANN based on SNR. Then, the k RPs are classified into different clusters through ANN based on SNR. Experimental results indicate that the proposed KNN/ANN hybrid algorithm generally outperforms KNN algorithm when the locations error is less than 2m.

• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.153-161
• /
• 2015

We propose a privacy-preserving location-based service (LBS) which supports top-k search service. The previous schemes hurt the privacy of either the user and the location of the objects because they are sent to the LBS server in a plaintext form. In the proposed method, by encrypting them with the fully-homomorphic encryption, we achieved the top-k search is possible while the information on them is not given to the LBS server. We performed a simulation on the proposed scheme with 16 locations where k is 3. The required time is 270 hours in a conventional desktop machine, which seems infeasible to be used in practice. However, as the progress of the hardware, the performance will be improved.