• Journal of the Korean Association of Geographic Information Studies
• /
• v.15 no.1
• /
• pp.87-98
• /
• 2012

A river boundary is defined as the intersection between a main stream of a river and the land. Mapping of the river boundary is important for the protection of the properties in river areas, the prevention of flooding and the monitoring of the topographic changes in river areas. However, the utilization of the ground surveying technologies is not efficient for the mapping of the river boundary due to the irregular surfaces of river zones and the dynamic changes of water level of a river stream. Recently, the spatial information data sets such as the airborne LiDAR and aerial images are widely used for coastal mapping due to the acquisition of the topographic information without human accessibility. Due to these advantages, this research proposes a semi-automatic method for mapping of the river boundary using the spatial information data set such as the airborne LiDAR and the aerial photographs. Multiple image processing technologies such as the image segmentation algorithm and the edge detection algorithm are applied for the generation of the 3D river boundary using the aerial photographs and airborne topographic LiDAR data. Check points determined by the experienced expert are used for the measurement of the horizontal and vertical accuracy of the generated 3D river boundary. Statistical results show that the generated river boundary has a high accuracy in horizontal and vertical direction.

• Journal of Computing Science and Engineering
• /
• v.2 no.1
• /
• pp.44-73
• /
• 2008

There is general agreement that the problem of data semantics has to be addressed for XML data to become machine-processable. This problem can be tackled by defining a semantic mapping between an XML schema and an ontology. Unfortunately, creating such mappings is a tedious, time-consuming, and error-prone task. To alleviate this problem, we present a solution that heuristically discovers semantic mappings between XML schemas and ontologies. The solution takes as input an initial set of simple correspondences between element attributes in an XML schema and class attributes in an ontology, and then generates a set of mapping formulas. Once such a mapping is created, it is important and necessary to maintain the consistency of the mapping when the associated XML schema and ontology evolve. In this paper, we first offer a mapping formalism to represent semantic mappings. Second, we present our heuristic mapping discovery algorithm. Third, we show through an empirical study that considerable effort can be saved when discovering complex mappings by using our prototype tool. Finally, we propose a mapping maintenance plan dealing with schema evolution. Our study provides a set of effective solutions for building sustainable semantic integration systems for XML data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.486-494
• /
• 2006

In this paper, we introduce a new solution for the load balancing problem, an important issue in parallel processing. Our heuristic load balancing technique called MGA effectively combines the benefit of both mean-field annealing (MFA) and genetic algorithms (GA). We compare the proposed MGA algorithm with other mapping algorithms (MFA, GA-l, and GA-2). A multiprocessor mapping algorithm simulation has been developed to measure performance improvement ratio of these algorithms. Our experimental results show that our new technique, the composition of heuristic mapping methods improves performance over the conventional ones, in terms of solution quality with a longer run time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10B
• /
• pp.1252-1257
• /
• 2011

In this paper, efficient functions for audio spectrum mapping with visible spectrum are proposed. Through mapping overall hearing frequency band with visible frequency band, emotional lighting might be possible. We propose a basic linear mapping function and non-linear mapping functions emphasizing specific audio frequency bands. For the algorithm implementation, spectrum analysis method and filter method are introduced. Especially, in this paper, a prototype LED lighting equipment using the digital filter method is implemented. The proposed lighting method can be applied to many LED lighting area using music.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2002.03a
• /
• pp.119-126
• /
• 2002

Fractures, especially faults have most significant influence on the difficulties encountered in various engineering and mining works, because they can give rise to inevitable reductions in shear strength as well as large increase in permeability. Thus, before underground access is possible, it is desirable to estimate the distribution and geometry of fractures in advance, if reliable structural data from e.g. Televiewer tool are available. To this end, fracture face mapping is just the evaluation method used to form a fracture image determined by intersecting of each fracture plane with a selected plane section of a rock mass, assuming that all fractures be planar with fixed-aperture. Although many fractures are geometrically complex and others are altered chemically, according to the abundant experiments in recent years, it would seem that the technique could be applied to benefit the design of numerous engineering works such as slope stability, tunnel excavations, dam foundation and diverse environmental works. This paper presents at first an evaluation algorithm for fracture face mapping and then concludes with various representative examples of applications.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.161-166
• /
• 2006

In this paper, CPLD low power technology mapping using reuse module selection under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.677-684
• /
• 2009

With various sensor network and ubiquitous technologies, we can extend interaction area from a virtual domain to physical space domain. This spatial interaction is differ in that traditional interaction is mainly processed by direct interaction with the computer machine which is a target machine or provides interaction tools and the spatial interaction is performed indirectly between users with smart interaction tools and many distributed components of space. So, this interaction gives methods to users to control whole manageable space components by registering and recognizing objects. Finally, this paper provides an effective spatial interaction method with template-based task mapping algorithm which is sorted by historical interaction data for support of users' intended task. And then, we analyze how much the system performance would be improved with the task mapping algorithm and conclude with an introduction of a GUI method to visualize results of spatial interaction.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• pp.72-76
• /
• 1996

We propose a novel algorithm for fractal video sequence coding, based on the circular prediction mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM is similar to the block matching algorithm in the motion compensation techniques, and the advantages of this similarity are discussed. Also we show that the CPM can be combined with non-contractive inter-frame mapping (NCIM), improving the performance of the fractal sequence coder further. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, ranging from 40 Kbps to 250 Kbps.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.15-24
• /
• 1999

In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result. it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB.