• Journal of Korean Society of Rural Planning
• /
• v.15 no.4
• /
• pp.173-182
• /
• 2009

This study is a plan for the Jeju Sanghyo Botanical Garden construction, and it is prepared to maintain the identity of the local landscape by composing the garden using the local landscape resources. The goals of becoming one of world's best, garden centered botanical garden and at the same time one that represents culture of Jeju. Unusual species are included in the collection and with the general collection, special collection and exhibition by different kinds are planned to be offered to the public. The garden will demonstrate the world's various types of gardens in a compressed way. It is our endeavor to become center of culture beyond plant education and exhibition, drawing a large number of people to our garden. Moreover, conservation of Jeju's unique botanic resources will be carried out and the garden will show the garden culture. Due to the size of the site, different themes will be exhibited in one zone in a parallel. Unique combination of each local landscape resource will create own theme. The display will be divided into three different stages: the 1st stage is an educational exhibition, assisting more understanding of distinguishing different locations, the second is exhibition by various species and the final stage will show an ideal way to develop a garden with harmony of various plant species.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.7
• /
• pp.834-843
• /
• 2014

A two-stage electrostatic precipitator (ESP) using a carbon brush charger and a plate-plate parallel aluminum collector was developed and its application for removal of oil mist aerosols was investigated. Charge number per particle and particle collection efficiency at different applied voltage to the carbon brush charger were measured and compared to those obtained by theoretical calculations. A long-term operation of the ESP during 9 weeks was also performed to evaluate its performance durability for oil mists. Average charge number per mist particle increased with the applied voltage to the charger, and thus the collection efficiency of the mist particles also increased overall at the particle size range of 0.26 - 3 mm. The tendencies of the average charge number per particle and particle collection efficiency obtained from theoretical calculations were considerably consistent with those of the experimental results. Particle collection efficiency of ~99 % at 0.3 mm could be achieved by power consumption of only 0.0033 W/($m^3/h$) at the face velocity of 1 m/s and its collection performance maintained stably during every 8 hr operation per day for 9 weeks with little increase of pressure drop.

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.459-465
• /
• 2017

Although the performance of computer hardware is increasing due to the development of manycore technologies, software lacking a proportional increase in throughput. Functional languages can be a viable alternative to improve the performance of parallel programs since such languages have an inherent parallelism in evaluating pure expressions without side-effects. Specifically, Haskell is notably popular for parallel programming because it provides easy-to-use parallel constructs based on monads. However, the scalability of parallel programs in Haskell tends to fluctuate as the number of cores increases, and the garbage collector is suspected to be the source of this fluctuations because it affects both the space and the time needed to execute the programs. This paper uses the tuning tool, GC-Tune, to improve the scalability of the performance. Our experiment was conducted with a parallel plagiarism detection program, and the scalability improved. Specifically, the fluctuation range of the speedup was narrowed down by 39% compared to the original execution of the program without any tuning.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.567-581
• /
• 2008

As the size of the web is growing explosively, search engines are becoming increasingly important as the primary means to retrieve information from the Internet. A search engine periodically downloads web pages and stores them in the database to provide readers with up-to-date search results. The web crawler is a program that downloads and stores web pages for this purpose. A large-scale search engines uses a parallel web crawler to retrieve the collection of web pages maximizing the download rate. However, the service architecture or experimental analysis of parallel web crawlers has not been fully discussed in the literature. In this paper, we propose an architecture of the parallel web crawler and discuss implementation issues in detail. The proposed parallel web crawler is based on the coordinator/agent model using multiple machines to download web pages in parallel. The coordinator/agent model consists of multiple agent machines to collect web pages and a single coordinator machine to manage them. The parallel web crawler consists of three components: a crawling module for collecting web pages, a converting module for transforming the web pages into a database-friendly format, a ranking module for rating web pages based on their relative importance. We explain each component of the parallel web crawler and implementation methods in detail. Finally, we conduct extensive experiments to analyze the effectiveness of the parallel web crawler. The experimental results clarify the merit of our architecture in that the proposed parallel web crawler is scalable to the number of web pages to crawl and the number of machines used.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.147-156
• /
• 2015

A typical solid-state drive contains several independent channels that can be operated in parallel. To exploit this channel-level parallelism, a variety of works proposed to split consecutive write sequences into small segments and schedule them to different channels. This scheme exploits the parallelism but breaks the spatial locality of write traffic; thus, it is able to significantly degrade the efficiency of garbage collection. This paper proposes a channel-aware write reordering (CAWR) mechanism to schedule write requests to different channels more intelligently. The novel mechanism encapsulates correlated pages into a cluster beforehand. All pages belonging to a cluster are scheduled to the same channels to exploit spatial locality, while different clusters are scheduled to different channels to exploit the parallelism. As CAWR covers both garbage collection and I/O performance, it outperforms existing schemes significantly. Trace-driven simulation results demonstrate that the CAWR mechanism reduces the average response time by 26% on average and decreases the valid page copies by 10% on average, while achieving a similar hit ratio to that of existing mechanisms.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.4
• /
• pp.153-161
• /
• 2021

Real-time access is required to handle continuous and unstructured data and should be flexible in management under dynamic state. Platform can be built to allow data collection, storage, and processing from local-server or multi-server. Although the former centralize method is easy to control, it creates an overload problem because it proceeds all the processing in one unit, and the latter distributed method performs parallel processing, so it is fast to respond and can easily scale system capacity, but the design is complex. This paper provides data collection and processing on one platform to derive significant insights from various data held by an enterprise or agency in the latter manner, which is intuitively available on dashboards and utilizes Spark to improve distributed processing performance. All service utilize dockers to distribute and management. The data used in this study was 100% collected from Kafka, showing that when the file size is 4.4 gigabytes, the data processing speed in spark cluster mode is 2 minute 15 seconds, about 3 minutes 19 seconds faster than the local mode.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.538-540
• /
• 2004

Electrical currents generated by human heart activities create magnetic fields represented by MCG(MagnetoCardioGram). Since an MCG signal acquisition system requires precise and stable operation, the system adopts hundreds of SQUID(Superconducting QUantum Interface Device) sensors for signal acquisition. Such a system requires fast real-time data acquisition in a required sampling interval, i.e., 1 mili-second for each sensor. This paper presents designed hardware to acquire data from 256-channel analog signal with 1 ksamples/sec speed, using 12-bit 8-channel ADC devices, SPI interfaces, parallel interfaces, 8-bit microprocessors, and a DSP processor. We implemented SPI interface between ADCs and a microprocessor, parallel interfaces between microprocessors. Our result concludes that the data collection can be done in $168{\mu}sec$ time-interval for 256 SQUID sensors, which can be interpreted to 6 ksamples/sec speed.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.147-156
• /
• 2002

Aligned parallel corpora have proved very useful in many natural language processing tasks, including statistical machine translation and word sense disambiguation. In this paper, we describe an alignment technique for extracting transfer mapping from the parallel corpus. During building our system and data collection, we observe that there are three types of translation approaches can be used. We especially focuses on Traditional Chinese and Simplified Chinese text lexical translation and a method for extracting transfer mappings for machine translation.

• Communications for Statistical Applications and Methods
• /
• v.15 no.1
• /
• pp.87-94
• /
• 2008

Andrews (1972) proposed to combine trigonometric functions to represent n observations of p variates, where the coefficients in linear sums are taken from the values of corresponding observation's respective variates. By viewing Andrews' plot as a collection of n trajectories of p-dimensional objects (observations) as a weighting point loaded with dimensional weights moves along a certain path on the hyper-dimensional sphere, we develop graphical techniques for further uses in data visualization. Specifically, we show that the parallel coordinate plot is a special case of Andrews' plot and we demonstrate the versatility of Andrews' plot with a projection pursuit engine.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.11
• /
• pp.907-915
• /
• 2002

We present a state-space approach to design a passivity-based dynamic output feedback control of a finite collection of non-square linear systems. We first determine a squaring gain matrix and an additional dynamics that is connected to the systems in a feedforward way, then a static passivating (i.e. rendering passive) control law is designed. Consequently, the actual feedback controller will be the static control law combined with the feedforward dynamics. A necessary and sufficient condition for the existence of the parallel feedfornward compensator (PFC) is given by the static output feedback fomulation, which enables to utilize linear matrix inequality (LMI). The effectiveness of the proposed method is illustrated by some examples including the systems which can be stabilized by the proprotional-derivative (PD) control law.