• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.7
• /
• pp.632-639
• /
• 2001

This paper proposes an improved architecture of web-based monitoring systems for monitor of processes in plants from the soft real-time point of view. The suggested model is designed to be able to guarantee the temporal and spatial consistency and transmit the monitoring data periodically via the intranet and the Internet. The model generates one thread for monitoring management, one DB thread, one common memory, and corresponding monitoring threads to clients. The monitoring thread is executed during the smaller time than the execution time of the process used in the conventional methods such as CGI and servlet method. The Java API for the server API, VRML, EAI(External Authoring Interface) and Java Applets for efficient dimensional WEB monitoring are used. The proposed model is implemented and tested for a FMS plant, Some examples show that the proposed model is useful one.

• Journal of Cadastre & Land InformatiX
• /
• v.45 no.1
• /
• pp.1-15
• /
• 2015

Korea's Spatial Information Policy has been institutionalized based by "National Spatial Data Infrastructure Act", "Act on Land Survey, Waterway Survey and Cadastral Records", "Spatial Data Industry Promotion Act". In year 2015, These acts were modified with new names and contents. It is critical that the definition of spatial information ought to be generalized. In addition, it is of paramount importance to review factors those contribute to the systematic development on coherent relation between Spatial Information Act and other acts. Examples of improvement area may include: Categorization of Spatial Information Concept, Systematization of Spatial Data Related Legislation, and Enhancement of Organization Specializing in Spatial Information. Furthermore, Legislation & Policy case of Germany, France and the United States were used as a basis for improvement.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.5
• /
• pp.253-260
• /
• 2014

European Space Agency has recognized Integrated Modular Avionics and ARINC specification 653 as avionics computer system for space application. Integrated Modular Avionics specification reduces the space by integrating a system composed of many electronic devices into a computer. recent researches have been studying how to apply the ARINC 653 into an open source operating system, such as Linux. These studies have concentrated on partition scheduling for time separation. However, requirements to guarantee spatial separation should be further analyzed to ensure deterministic execution time. Therefore, memory management is needed to verify spatial isolation on Linux systems. This research proposes a new method to accomplish spatial isolation for the ARINC 653 specification in Linux. We have added new data structures and system calls to handle functionalities for spatial separation. They are used during the partition startup process. The proposed method was evaluated on the LEON4 processor, which is the next generation microprocessor to be used in the future space missions. All implementations confirm that spatial isolation of the ARINC 653 specification was accomplished.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.418-429
• /
• 2001

Recently, a GIS has been applicable to the most important computer applications such as urban information systems and transportation information systems. These applications require spatial operations for an efficient management of a large volume of data. In particular, a spatial join among basic operations has the property that its response time is increased exponentially according to the number of spatial objects included in the operation. Therefore, it is not proper to the systems demanding the fast response time. To satisfy these requirements, the efficient parallel processing of spatial joins has been required. In this paper, the efficient method for creating and allocating tasks to balance statically the load of each processor in a parallel spatial join is presented. A task graph is developed in which a vertex weight is calculated by the cost model I have proposed. Then, it is partitioned through a graph partitioning algorithm. According to the experiments in CC16 parallel machine, our method made an improvement in the static load balance by decreasing the variance of a task execution time on each processor.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.23 no.3
• /
• pp.1-11
• /
• 2020

The purpose of this study is to conduct an analysis for classification of unexecuted urban planning facilities using the Geographic Information System(GIS) to prepare measures for systematic and efficient management of unexecuted urban planning facilities and to find ways to establish national territory information for continuous management and operation by database of spatial data of classified unexecuted urban planning facilities. For this purpose, the present state of urban management plan, thematic map, cadastral map, satellite image of Korea Land Information System(KLIS) were collected from Miryang City, and qualitative analysis of the execution and non-execution of urban planning facilities was conducted by combining the layer of urban planning facilities, satellite images, and continuous cadastral layers of cadastral maps with classified and processed owner attribute information. According to the analysis, the unexecuted facilities were derived as unexecuted facilities, as most of the private land, without any current status roads or facilities created in satellite imagery. In addition, although the current status road was opened, the facilities that included some private land were derived as facilities that were recognized and executed by the local government as the de facto controlling entity through public transportation. The derived unexecuted urban planning facilities were divided into layers of shape data and the unexecuted property data were organized to quickly and accurately identify the status of non-executed and statistical information. In this study, we proposed an analysis plan that introduced GIS technology for scientific and rational analysis of unexecuted urban planning facilities and the establishment of reliable spatial data, and proposed a plan to establish a database for connection with existing systems and use of information.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.1003-1012
• /
• 2005

The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1756-1776
• /
• 2012

Wireless sensor networks (WSNs) are likely to be more prevalent as their cost-effectiveness improves. The spectrum of applications for WSNs spans multiple domains. In environmental sciences, in particular, they are on the way to become an essential technology for monitoring the natural environment and the dynamic behavior of transient physical phenomena over space. Existing sensor network query processors (SNQPs) have also demonstrated that in-network processing is an effective and efficient means of interaction with WSNs for performing queries over live data. Inspired by these findings, this paper investigates the question as to whether spatio-temporal and historical analysis can be carried over WSNs using distributed query-processing techniques. The emphasis of this work is on the spatial, temporal and historical aspects of sensed data, which are not adequately addressed in existing SNQPs. This paper surveys the novel approaches of storing the data and execution of spatio-temporal and historical queries. We introduce the challenges and opportunities of research in the field of in-network storage and in-network spatio-temporal query processing as well as illustrate the current status of research in this field. We also present new areas where the spatio-temporal and historical query processing can be of significant importance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.453-456
• /
• 2003

Spatial database systems achieve filtering steps with MBR(Minimum founding Rectangle) for efficient query processing, and then carry out refinement steps for candidate objects. While most operations require fast execution of filtering, it is necessary to increase the filtering rates and reduce the number of refinement steps in the low computing powered devices. The compact representation method is also needed in the mobile devices with low storage capacity. The paper proposes various approximation methods for efficient spatial operations in the multiplatform environments. This paper also designs a compression technique for MBR, which occupies almost 80% of index data in the two dimensional case. We also analyze the advantages and drawbacks of each method in terms of space utilization, filtering efficiency and speed.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.2
• /
• pp.103-116
• /
• 2017

In this paper, we present the design and implementation of a large-scale qualitative spatial reasoner, which can derive new qualitative spatial knowledge representing both topological and directional relationships between two arbitrary spatial objects in efficient way using Aparch Spark SQL. Apache Spark SQL is well known as a distributed parallel programming environment which provides both efficient join operations and query processing functions over a variety of data in Hadoop cluster computer systems. In our spatial reasoner, the overall reasoning process is divided into 6 jobs such as knowledge encoding, inverse reasoning, equal reasoning, transitive reasoning, relation refining, knowledge decoding, and then the execution order over the reasoning jobs is determined in consideration of both logical causal relationships and computational efficiency. The knowledge encoding job reduces the size of knowledge base to reason over by transforming the input knowledge of XML/RDF form into one of more precise form. Repeat of the transitive reasoning job and the relation refining job usually consumes most of computational time and storage for the overall reasoning process. In order to improve the jobs, our reasoner finds out the minimal disjunctive relations for qualitative spatial reasoning, and then, based upon them, it not only reduces the composition table to be used for the transitive reasoning job, but also optimizes the relation refining job. Through experiments using a large-scale benchmarking spatial knowledge base, the proposed reasoner showed high performance and scalability.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.117-124
• /
• 2004

Various multimedia systems have been developed and their application areas widely proliferate. Thus, the interoperability is getting important among various networks and devices. The video transcoding is a technology to solve this interoperability problem among various coding standards. Transcoding can be defined as the conversion of one compressed coded data to another. In this paper, MPEG-2 to MPEG-4 transcoder in the spatial domain is compared with that in the DCT domain. The transcoder is very useful when a video sequence that is originally encoded for digital TV, DVD or satellite broadcasting is served in mobile environment. In order to compare two transcoders, all modules except motion compensation and down sampling are implemented identically. In addition, both transcoders do not search for motion vector. Instead, the decoded information is reused to the encoder. The experimental results show that the transcoder in the spatial domain is usually better than that in the DCT domain with respect to PSNR (Peak Signal-to-Noise Ratio), bitrate and execution time.