• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.65-68
• /
• 2000

We design a new driving system of 5" true color FED using current controlled PWM method. Further more, we successfully developed a 5" FED panel, which resolution is 320$\times$240(Color). When we design a 5" FED driving circuit, FED tips are modeled as R-C for circuit simulator of FED driving circuit. In Video data processing, parallel R, G, B input signals is processed independently, so duty ratio increase and no noise, high quality performance is achieved in display of 5" FED. The luminance is about 100cd/$m^2$, the anode power consumption Is 2.1W and total power of the driving system is 21.54W

• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.37-38
• /
• 2014

최근 SNS의 발전으로 인해 데이터의 양이 급격히 증가하였으며, 이에 따라 빅데이터 처리를 위한 분산 DBMS 기반 질의 처리 연구가 활발히 진행되고 있다. 이를 위해 CUBRID는 CUBRID Shard 서비스를 통해 데이터베이스를 shard 단위로 수평 분할하여 각기 다른 물리 노드에 데이터를 분산 저장하도록 지원한다. 그러나 CUBRID Shard는 shard간 데이터가 독립적으로 관리되기 때문에 세타 조인 및 중첩 질의와 같이 다수 서버에서의 테이블 참조가 필요한 질의는 처리가 불가능하다. 따라서 본 논문에서는 분산 CUBRID 상에서 세타 조인 및 중첩 SQL를 지원하는 질의 재구성 기법을 제안한다.

• Management Science and Financial Engineering
• /
• v.9 no.2
• /
• pp.47-68
• /
• 2003

We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.9-16
• /
• 2016

Recently, many research groups have focused on GPGPUs in order to improve the performance of computing systems. GPGPUs can execute general-purpose applications as well as graphics applications by using parallel GPU hardware resources. GPGPUs can process thousands of threads based on warp scheduling and CTA scheduling. In this paper, we utilize the traditional CTA scheduler to assign a various number of CTAs to SMs. According to our simulation results, increasing the number of CTAs assigned to the SM statically does not improve the performance. To solve the problem in traditional CTA scheduling schemes, we propose a new IPC-based dynamic CTA scheduling scheme. Compared to traditional CTA scheduling schemes, the proposed dynamic CTA scheduling scheme can increase the GPU performance by up to 13.1%.

• International journal of advanced smart convergence
• /
• v.7 no.3
• /
• pp.8-14
• /
• 2018

In the field of surveillance cameras, it is possible to increase the people detection accuracy by using depth information indicating the distance between the camera and the object. In general, depth information is obtained by calculating the parallax information of the stereo camera. However, this method is difficult to operate in real time in the embedded environment due to the large amount of computation. Jetson TX2, released by NVIDIA in March 2017, is a high-performance embedded board with a GPU that enables parallel processing using the GPU. In this paper, a stereo camera is installed in Jetson TX2 to acquire depth information in real time, and we proposed a people counting method using acquired depth information. Experimental results show that the proposed method had a counting accuracy of 98.6% and operating in real time.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.81-90
• /
• 1994

This paper proposes a motphological fast reconstructive filter (FRF) using up/down sampling techniques for reconstructive opening and closing, and a parallel structure for fast multiresolution decomposition. Compuer simulation shows that, compared with the conventional RF, the proposed FRF can reduce the processing time up to 8 times while it maintains a similar performance in reconstructed shapes. Further reduction in the decomposition time achieved by the paralellized algorithm combined with the FRF, which can be applied in areas such as defect detection, image segmentation, pattern recognition, etc.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2002.10a
• /
• pp.287-294
• /
• 2002

CAES which is called as a compressed air energy storage was firstly developed at Huntorf, German in 1978. The capacity of that system was 290MW, and it can be treated as a first commercial power plant. CAES has a lot of merits, such as saving the unit price of power generation, averaging the peak demand, improvement of maintenance, enlarging the benefit of dynamic use. According to the literature survey, the unlined rock cavern should be proposed to be a reasonable storing style as a method of compressed air storage in Korea. We decided the hill of the Korea Institute of Geoscience and Mineral Resources as CAES site. If we construct the underground spaces in this site, the demand for electricity nearby Taejon should be considered. So we could determine the capacity of the power plant as a 350MW, This capacity needs a underground space of 200,000㎥, and we can conclude 4 parallel tunnels 550m deep from the surface through the numerical studies, Design parameters were achieved from 300m depth boring job and image processing job.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.103-105
• /
• 2017

Hadoop MapReduce is a processing framework in which users' job can be efficiently processed in parallel and distributed ways on the Hadoop cluster. MapReduce task schedulers are used to select target nodes and assigns user's tasks to them. Previous schedulers cannot fully utilize resources of Hadoop cluster because they does not consider dynamic characteristics of cluster based on nodes' availability. To increase utilization of Hadoop cluster, this paper proposes a novel task assignment policy for MapReduce that assigns a job tasks to dynamic cluster efficiently by considering availability of each node.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.5-8
• /
• 2014

This paper presents a parallel approach of formant synthesis method for haegeum on graphics processing units (GPU) using spectral modeling. Spectral modeling synthesis (SMS) is a technique that models time-varying spectra as a combination of sinusoids and a time-varying filtered noise component. A second-order digital resonator by the impulse-invariant transform (IIT) is applied to generate deterministic components and the results are band-pass filtered to adjust magnitude. The noise is calculated by first generating the sinusoids with formant synthesis, subtracting them from the original sound, and then removing some harmonics remained. The synthesized sounds are consequently by adding sinusoids, which are shown to be similar to the original Haegeum sounds. Furthermore, GPU accelerates the synthesis process enabling- real time music synthesis system development, supporting more sound effect, and multiple musical sound compositions.

• Water for future
• /
• v.29 no.4
• /
• pp.109-118
• /
• 1996

The neural network is a mathematical model of theorized brain activity which attempts to exploit the parallel local processing and distributed storage properties. The neural metwork is a good model to be applied for the classification problem, large combinatorial optimization and nonlinear mapping. A multi-layer neural network is constructed to predict rainfall. The network learns continuourvalued input and output data. Application of neural network to 1-hour real data in Seoul metropolitan area and the Soyang River basin shows slightly good predictions. Therefore, when good data is available, the neural network is expected to predict the complicated rainfall successfully.