• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.33-43
• /
• 2012

In With increase of a demand on the spatial data, the need of spatial data model which can effectively store and manege spatial objects becomes more important in many GIS applications. There are many researches on the spatial data model. Several data models were proposed for some special functions, however, there are still many problems in the management and applications. Digital Map is one of spatial data model which is being used in Korea. The existing Digital Map is based on the Tiles. This approach needs more cost in its construction and management. Therefore, in this paper, we propose a feature-based seamless data model with Digital map 2.0 which is based on Tiles. This model can be easily constructed and managed in the large databases so that it is able to apply to any systems. The proposed model uses the relationships between features to correct updated data and the Unique Feature IDentifier(UFID) also makes system to search and manage the feature data more easily and efficiently.

• Journal of Digital Convergence
• /
• v.15 no.8
• /
• pp.25-32
• /
• 2017

This study analyzes diverse research studies on psychomotricity as convergence of psychological and physical exercises and aims to identify challenges and provide solutions for more extensive future research. The study collected 50 papers published in Korea from 2013 to March 2017 through paper search systems and analyzed the distribution of the works by types and research subjects, and types of research design, types of dependent variables and the number of interventions involved. By research design, it was found that most number of papers were based on single-subject research, followed by quantitative research. Motor development appeared the most as a dependent variable, followed by sociality and emotional behavior. Most number of studies involved 21-30 times of interventions. The changes in the research results were analyzed in the order of sociality, motor development, and behavior change. Future psychomotricity studies need to expand study subjects and diversify research methods and variables, with active follow-up studies contributing to social service by providing comprehensive solutions.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.39-50
• /
• 2006

Rapid growth of the domestic economy caused a lot of the demand of land information. The land information system has to keep the records of the various data about land that includes its owner and usages. Also the system must present adequate results that have been accumulated upon a user's request. Since Korean Government enforces 'Law of National Land Usage and Management', the land in rural area was also tightly regulated as much as that in the urban area. In fact, when people wants to develop their land, then they realize that their land has many restrictions and regulations to use. Sometimes, they find many regulations and restrictions even in a parcel. Thus, many people quite often want to know all the laws, rules, regulations, and restrictions etc., whatever applicable on the land they are interested in. to use. The purpose of this paper is to show a legal service system that precisely presents all the related laws, regulations, and restrictions. for a piece of the land. It summarizes the search results on users' requests. It uses a knowledge-based expert system to figure out the users requests. In this paper, we designed the system architecture of the software, and implemented its prototype. The results on this system show more concise and user friendlier than those of the existing systems.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.85-96
• /
• 1999

In a number of predictive video compression standards, the motion is compensated by the block-based motion compensation (BMC). The effective motion field used for the prediction by the BMC is obviously discontinuous since one motion vector is used for the entire macro-block. The usage of discontinuous motion field for the prediction causes the blocky artifacts and one obvious approach for eliminating such artifacts is to use a smoothed motion field. The optimal procedure will depend on the type of motion within the video. In this paper, several procedures for the motion vectors are considered. For any interpolation or approaches, however, the motion vectors as provided by the block matching algorithm(BMA) are no longer optimal. The optimum motion vectors(still one per macro-block) must minimize the of the displaced frame difference (DFD). We propose a unified algorithm that computes the optimum motion vectors to minimize the of the DFD using a conjugate gradient search. The proposed algorithm has been implemented and tested for the affine transformation based motion compensation (ATMC), the bilinear transformation based motion compensation (BTMC) and our own filtered motion compensation(FMC). The performance of these different approaches will be compared against the BMC.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.31-46
• /
• 2008

A stacking yard of a container terminal is a space for temporarily storing the containers that are carried in or imported until they are carried out or exported. If the containers are stacked in an inappropriate way, the efficiency of operation at the time of loading decreases significantly due to the rehandlings. The remarshaling is the task of rearranging containers during the idle time of transfer crane for the effective loading operations. This paper proposes a method of planning for remarshaling in a yard block of an automated container terminal. Our method conducts a search in two stages. In the first stage, the target stacking configuration is determined in such a way that the throughput of loading is maximized. In the second stage, the crane schedule is determined so that the remarshaling task can be completed as fast as possible in moving the containers from the source configuration to the target configuration. Simulation experiments have been conducted to compare the efficiency of loading operations before and after remarshaling. The results show that our remarshaling plan is really effective in increasing the efficiency of loading operation.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.103-116
• /
• 2008

This paper proposes quay crane (QC) scheduling algorithms that determine the working sequence of QCs over ship bays in a container vessel in automated container terminals. We propose two scheduling algorithms that examine the distribution of export containers in the stacking yard and determine the sequence of ship bays to balance the workload distribution among the yard blocks. One of the algorithms is a simple heuristic algorithm which dynamically selects the next ship bay based on the entropy of workloads among yard blocks whenever a QC finishes loading containers at a ship bay and the other uses genetic algorithm to search the optimal sequence of ship bays. To evaluate the fitness of each chromosome in the genetic algorithm, we have devised a method that is able to calculate an approximation of loading time of container vessels considering the workloads among yard blocks. Simulation experiments have been carried out to compare the efficiency of the proposed algorithms. The results show that our QC scheduling algorithms are efficient in reducing the turn-around time of container vessels.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.6
• /
• pp.46-54
• /
• 2018

The Internet of Things (IoT) is an environment in which various devices provide services to users through communications. Because of the nature of the IoT, data are stored and distributed in heterogeneous information systems. In this situation, IoT end applications should be able to access data without having information on where the data are or what the type of storage is. This mechanism is called Service Discovery (SD). However, some problems arise, since the current SD architectures search for data in physical devices. First, turnaround time increases from searching for services based on physical location. Second, there is a need for a data structure to manage devices and services separately. These increase the administrator's service configuration complexity. As a result, the device-oriented SD structure is not suitable to the IoT. Therefore, we propose an SD structure called Name-based Service-centric Service Discovery (NSSD). NSSD provides name-based centralized SD and uses the IoT edge gateway as a cache server to speed up service discovery. Simulation results show that NSSD provides about twice the improvement in average turnaround time, compared to existing domain name system and distributed hash table SD architectures.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2014.02a
• /
• pp.92-92
• /
• 2014

Recently, many state-of-art spectroscopy techniques are used to unravel the mysteries of condensed matters. And numerous heterostructures have provided a new avenue to search for new emergent phenomena. Especially, near the interface, various forms of symmetry-breaking can appear, which induces many novel phenomena. Although these intriguing phenomena can be emerged at the interface, by using conventional measurement techniques, the experimental investigations have been limited due to the buried nature of interface. One of the ways to overcome this limitation is in situ investigation of the layer-by-layer evolution of the electronic structure with increasing of the thickness. Namely, with very thin layer, we can measure the electronic structure strongly affected by the interface effect, but with thick layer, the bulk property becomes strong. Angle-resolved photoemission spectroscopy (ARPES) is powerful tool to directly obtain electronic structure, and it is very surface sensitive. Thus, the layer-by-layer evolution of the electronic structure in oxide heterostructure can be investigated by using in situ ARPES. LaNiO3 (LNO) heterostructures have recently attracted much attention due to theoretical predictions for many intriguing quantum phenomena. The theories suggest that, by tuning external parameters such as misfit strain and dimensionality in LNO heterostructure, the latent orders, which is absent in bulk, including charge disproportionation, spin-density-wave order and Mott insulator, could be emerged in LNO heterostructure. Here, we performed in situ ARPES studies on LNO films with varying the misfit strain and thickness. (1) By using LaAlO3 (-1.3%), NdGaO3 (+0.3%), and SrTiO3 (+1.7%) substrates, we could obtain LNO films under compressive strain, nearly strain-free, and tensile strain, respectively. As strain state changes from compressive to tensile, the Ni eg bands are rearranged and cross the Fermi level, which induces a change of Fermi surface (FS) topology. Additionally, two different FS superstructures are observed depending on strain states, which are attributed to signatures of latent charge and spin orderings in LNO films. (2) We also deposited LNO ultrathin films under tensile strain with thickness between 1 and 10 unit-cells. We found that the Fermi surface nesting effect becomes strong in two-dimensions and significantly enhances spin-density-wave order. The further details are discussed more in presentation. This work was collaborated with Hyang Keun Yoo, Seung Ill Hyun, Eli Rotenberg, Ji Hoon Shim, Young Jun Chang and Hyeong-Do Kim.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.6
• /
• pp.268-278
• /
• 2005

We consider constructing the generalized suffix way of strings A and B when the suffix arrays of A and B are given, j.e., merging two suffix arrays of A and B. There are efficient algorithms to merge some special suffix arrays such as the odd array and the even array. However, for the general case that A and B are arbitrary strings, no efficient merging algorithms have been developed. Thus, one had to construct the generalized suffix arrays of A and B by constructing the suffix array of A$\#$B$\$$ from scratch, even though the suffix ways of A and B are given. In this paper, we Present efficient merging algorithms for the suffix arrays of two arbitrary strings A and B drawn from constant and integer alphabets. The experimental results show that merging two suffix ways of A and B are about 5 times faster than constructing the suffix way of A$\#$B$\$$ from scratch for constant alphabets. Our algorithms include searching all suffixes of string B in the suffix array of A. To do this, we use suffix links in suffix ways and we developed efficient algorithms for computing the suffix links. Efficient computation of suffix links is another contribution of this paper because it can be used to solve other problems occurred in bioinformatics that should search all suffixes of a given string in the suffix array of another string such as computing matching statistics, finding longest common substrings, and so on. The experimental results show that our methods for computing suffix links is about 3-4 times faster than the previous fastest methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.