• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.569-584
• /
• 2016

In this paper, we present a spatial knowledge extractor implemented in Hadoop MapReduce parallel, distributed computing environment. From a large spatial dataset, this knowledge extractor automatically derives a qualitative spatial knowledge base, which consists of both topological and directional relations on pairs of two spatial objects. By using R-tree index and range queries over a distributed spatial data file on HDFS, the MapReduce-enabled spatial knowledge extractor, MRSPAKE, can produce a web-scale spatial knowledge base in highly efficient way. In experiments with the well-known open spatial dataset, Open Street Map (OSM), the proposed web-scale spatial knowledge extractor, MRSPAKE, showed high performance and scalability.

• Transactions of Materials Processing
• /
• v.12 no.5
• /
• pp.493-497
• /
• 2003

The present investigation aims at visualizing the crack tip stress field using a mechanoluminescence material. The well known compound $SrAl_2O_4$:$Eu^{2+}$ was adopted as a mechanolurninescence material. Two more trivalent rare-earth elements such as Dy and Nd were taken into consideration as codopants to provide the appropriate trap levels. Samples of a variety of compositions were prepared by varing $Eu^{2+}$, $Dy^{3+}$, and $Nd^{3+}$ doping contents, for which the combinatorial chemistry method was used. In order to search for the optimum composition for the highest mechanoluminescence, the luminescence induced by a compressive device including a CCD camera. In parallel, a compact tension specimen was prepared by mixing the luminescence powders of optimum composition and epoxy resin. Crack initiation from the mechanically machined sharp note tip and its growth during loading were found to be associated with the extent of light emission from $SrAl_2O_4$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2090-2094
• /
• 2007

Film bulk acoustic wave resonator(FBAR) technology has attracted a great attention as a promising technology to fabricate the next-generation RF filters mainly because the FBAR technology can be integrated with current Si processing. The RF filters are basically composed of several FBAR devices connected in parallel and in series, and their characteristics depend highly on the FBAR device characteristics. Thus, it is important to design high quality FBAR devices by device or process optimization. This kind of effort may enhance the FBAR device characteristics, eventually leading to FBAR filters of high performance. In this paper, we describe the methods to more effectively improve the resonance characteristics of the FBAR devices.

• Advances in robotics research
• /
• v.1 no.1
• /
• pp.101-126
• /
• 2014

In this article we present modular neural control for a leg-wheel hybrid robot consisting of three legs with omnidirectional wheels. This neural control has four main modules having their functional origin in biological neural systems. A minimal recurrent control (MRC) module is for sensory signal processing and state memorization. Its outputs drive two front wheels while the rear wheel is controlled through a velocity regulating network (VRN) module. In parallel, a neural oscillator network module serves as a central pattern generator (CPG) controls leg movements for sidestepping. Stepping directions are achieved by a phase switching network (PSN) module. The combination of these modules generates various locomotion patterns and a reactive obstacle avoidance behavior. The behavior is driven by sensor inputs, to which additional neural preprocessing networks are applied. The complete neural circuitry is developed and tested using a physics simulation environment. This study verifies that the neural modules can serve a general purpose regardless of the robot's specific embodiment. We also believe that our neural modules can be important components for locomotion generation in other complex robotic systems or they can serve as useful modules for other module-based neural control applications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.2
• /
• pp.3-12
• /
• 2001

Currently, the superscalar architecture dominates todays microprocessor marketplase. As, more transistors are integrated onto larger die, however, an on-chip multiprocessor is regarded as a promising alternative to the superscalar microprocessor. This paper examines the behavior of the next generation block encryption algorithms RC6 and Rijndael on the on-chip multiprocessing microprocessor. Based on the simulation results by using a program-driven simulator, the on-chip multiprocessor can exploit thread level parallelism effectively and overcome the limitation of instruction level parallelism in the next generation block encryption algorithms.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.2
• /
• pp.151-159
• /
• 2022

In this paper, we implement a digital multi-beamformer using FPGA(Field Programmable Gate Array) which has advantages in parallel and real-time data processing. This is accomplished through the use of not only high-speed data communication but also multiple beam forming, which is currently required by MFR(Multi Function Radar). As a result, the beamformer can process 24 Gbps throughput in real-time and form 5 digital beams at the same time. It is also compared to the results of Matlab simulations. We demonstrate how an implemented beamformer can be used in an MFR system by using a digital array antenna.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2823-2834
• /
• 1998

This paper deals with the problem of one-to-one mapping of $2^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. The repeated mapping scheme is shown to be highly effective on a number of test task graphs, it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.419-428
• /
• 2001

Advances in circuit and integration technology are continuously boosting the speed of processors. One of the main challenges presented by such developments is the effective use of powerful processors in shared memory multiprocessor system. We believe that the interconnection problem is not solved even for small scale shared memory multiprocessor, since the speed of shared buses is unlikely to keep up with the bandwidth requirements of new powerful processors. In the past few years, point-to-point unidirectional connection have emerged as a very promising interconnection technology. The single slotted ring is the simplest form point-to-point interconnection. The main limitation of the single slotted ring architecture is that latency of access increase linearly with the number of the processors in the ring. Because of this, we proposed the dual slotted ring as an alternative to single slotted ring for cache-based multiprocessor system. In this paper, we analyze the proposed dual slotted ring architecture using new snooping protocol and enforce simulation to compare it with single slotted ring.

• KIISE Transactions on Computing Practices
• /
• v.21 no.5
• /
• pp.387-392
• /
• 2015

MapReduce is a framework used to process large data sets in parallel on a large cluster. A group-by query is a query that partitions the input data into groups based on the values of the specified attributes, and then evaluates the value of the specified aggregate function for each group. In this paper, we propose an efficient method for processing multiple group-by queries using MapReduce. Instead of computing each group-by query independently, the proposed method computes multiple group-by queries in stages with one or more MapReduce jobs in order to reduce the total execution cost. We compared the performance of this method with the performance of a less sophisticated method that computes each group-by query independently. This comparison showed that the proposed method offers better performance in terms of execution time.