• Journal of the Korean Association of Geographic Information Studies
• /
• v.25 no.4
• /
• pp.32-48
• /
• 2022

This study presented a spatial data serialization technique that can efficiently store and transmit large amounts of spatial data for precision road maps was designed and implemented. For efficient serialization, a binary spatial data structure is defined, and a coordinate value encoding technique without loss of information is designed using the Zigzag-Z-order curve. The spatial data serialization technique designed for precision road maps was tested, and the data size and encoding/decoding speed after encoding were compared with Protocol buffer and Geobuff. As a result, it was confirmed that the designed serialization method was excellent in data weight reduction performance and encoding speed. However, the decoding speed was inferior to other serialization techniques in linestring and polygon type spatial data. Through this study, it was confirmed that spatial data can be efficiently encoded, stored, and transmitted using binary serialization techniques.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.21 no.1
• /
• pp.96-105
• /
• 2018

The V-world, Spatial information open platform map service, provides various national spatial data. Recently, with the development of IT technology, demand for 3D geospatial data that can be merged with new industries such as Internet of Things(IoT) and autonomous vehicles is increasing. Because 3D geospatial data is large and complex, many computer resources are used to provide map services. Most of the 3D map services, such as Vworld, are constructed binary data in consideration of performance. However, this type of data is incompatible because it is difficult to use in other services if there is no precise understanding of the specification. In this paper, we propose a data serialization method to improve the compatibility of new Vworld 3D format which is constructed in binary form. The performance of binary data and serialized binary data is tested and compared. As a result, it is expected that the data using the serialization technique will be similar to the binary data and contribute to improve compatibility.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.75-87
• /
• 2011

Tactical Data Links are standardized radio communication data links for military armed forces and used to transmit and receive data. Because they are the core elements of achieving information superiority in a NCW environment, various kinds of TDL are used by the Korean armed forces. Operating various types of TDL is very helpful in getting more information; however, at the same time, it is hard to integrate and make them co-operate with other TDLs or C4ISR systems. In this paper, we propose a XML based messaging system to make various types of TDL interoperable in a NCW environment. For the messaging system between TDL and C4ISR systems, we define XML message processing interfaces and suggest binary XML for serialization to save transmission loads over constrained military communication bandwidth. Our experiment results show that the TDL message can be transformed into generalized XML data that is interoperable with other TDLs and binary XML serialization, and it saves parsing and transmission time.

• Smart Structures and Systems
• /
• v.1 no.1
• /
• pp.63-82
• /
• 2005

This paper introduces a technology for robust and low maintenance cost sensor network capable to detect accelerations below a micro-g in a wide frequency bandwidth (above 1,000 Hz). Sensor networks with such performance are critical for navigation, seismology, acoustic sensing, and for the health monitoring of civil structures. The approach is based on the fabrication of an array of high sensitivity accelerometers, each utilizing Fabry-Perot cavity with wavelength-dependent reflectivity to allow embedded optical detection and serialization. The unique feature of the approach is that no local power source is required for each individual sensor. Instead one global light source is used, providing an input optical signal which propagates through an optical fiber network from sensor-to-sensor. The information from each sensor is embedded onto the transmitted light as an intrinsic wavelength division multiplexed signal. This optical "rainbow" of data is then assessed providing real-time sensing information from each sensor node in the network. This paper introduces the Fabry-Perot based accelerometer and examines its critical features, including the effects of imperfections and resolution estimates. It then presents serialization techniques for the creation of systems of arrayed sensors and examines the effects of serialization on sensor response. Finally, a fabrication process is proposed to create test structures for the critical components of the device, which are dynamically characterized.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.95-107
• /
• 2003

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and mews updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose the efficient concurrency control for query transaction in broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also use the serialization graph scheme to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.140-149
• /
• 2004

Data broadcast has received much attention as a very efficient method for disseminating data items in mobile environment with large number of mobile clients. In this approach, a database server periodically and continuously broadcasts data items through wireless channels and clients perform read-only transactions by accessing necessary data items from the air. While broadcasting, the server must also process update transactions on the database, which raises an obstacle for client's accessing consistent data. In this research, we propose a new algorithm SCDSC(Serialization Checking with DirtySet on Commit) which is an alternative for solving the concurrency control problem efficiently. The SCDSC is a kind of optimistic concurrency control in that a client checks the consistency of data using a DirtySet as a part of data broadcast when it commits its transaction. In each broadcast cycle, the server updates and disseminates the DirtySet with newly changed data items for last few cycles in the sliding window approach. We perform an analysis and a simulation study to evaluate the performance of our SCDSC algorithm in terms of data consistency and data currency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.1
• /
• pp.15-28
• /
• 1999

In Multilevel Secure Database Management System(MLS/DBMS), we assume that system has a security clearance level for each user and a classification level for each data item in system and the objective of these systems is to protect secure information from unauthorized user. Many algorithms which have been researched have focus on removing covert channel by modifying conventional lock-based algorithm or timestamp-based algorithm. but there is high-level starvation problem that high level transaction is aborted by low level transaction repeatedly. In order to solve this problem, we propose an algorithm to reduce high-level starvation using dynamic adjustment of serialization order, which is basically using orange lock. Because our algorithm is based on a single version unlike conventional secure algorithms which are performed on multiversion, it can get high degree of concurrency control. we also show that it guarantees the serializability of concurrent execution, and satisfies secure properties of MLS/DBMS.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.4
• /
• pp.162-167
• /
• 2015

This paper describes the reason and the problem solving for the double-layer pattern of a Daejeon correlator operated in Korea-Japan Correlation Center. When the electric power of an input signal in the correlator is charged small enough to be buried in the noise, it is hard to see a signal with a specific pattern in the input signal, but when the electric power is large, a specific one is reported to be seen. By comparing data from observation with one from software correlator, it was confirmed from the analysis using the AIPS software that the amplitude gain of a source signal was affected about 3%. Therefore, in order to solve the problem of double-layer patterns, we found that a problem in the memory management module responsible for both the data input and the data serialization of the correlator is a cause for the double-layer pattern detected periodically. In other words, while data is serialized and read repeatedly in the memory area assigned to serialize the data from the serialization module, redundant last data is generated and an overlap for the memory allocation is occurred. Therefore, by modifying the program of the FPGA memory sections on serialization module to correct the problem, we confirmed that double-layer pattern is disappeared and correlation results are normally acquired.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.520-530
• /
• 2004

A multidatabase system (MDBS) is designed to provide universal access to distributed data across multiple autonomous, heterogeneous local database systems (LDBSs). In this paper, we propose a global concurrency control (GCC) algorithm in MDBS. The proposed GCC algorithm adopts the idea of message ordering in group communication messaging system. A necessary condition of GCC algorithm is that global transactions are serialized in the same order at all LDBSs that they execute. n all operations of a transaction are bundled in a single message and the message arrives at LDBSs in the same order using message ordering property, each LDBS can perform subtransactions in the same order. As a result, message ordering allows to determine easily the relative serialization order of global transactions, and then it can support a local autonomy without any information about the serialization order of transactions executing locally.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.159-165
• /
• 2005

The proposed optical transmitter is composed of FF(flip flop) , PLL (phase locked loop), reference clock generator, serializer and LD driver 10x250 Mb/s data arrays are translated to the 2.5 Gb/s data signal by serializer. In this case, 1 data bus is allocated usually as a reference clock for synchronization. In this proposed optical transmitter, 125 MHz reference clock is generated from 10x250 Mb/s data arrays by reference clock generator. From this method. absent of reference clock bus is available and more data transmission become possible. To achieve high speed operation, the serializer circuit is designed as two stacks. For 10:1 serialization, 10 clocks that have 1/10 lambda differences is essential, so the VCO (voltage controlled oscillator) composed of 10 delay buffers is designed. PLL is for runing at 250 MHz, and dual PFD(phase frequency detector) is adopted for fast locking time. The optical transmitter is designed by using 0.35 um CMOS technology.