• Journal of the Korea Organic Resources Recycling Association
• /
• v.19 no.1
• /
• pp.93-101
• /
• 2011

The modeling of SDR was carried out for the application of the solid waste incineration system. To find optimum operating condition for removal of acidic gases, computation fluid dynamic(CFD) model was used. In this study, the temperature profile of SDR(spray dry reactor) and the gas velocity profile for different models were investigated. In this model, the diameter of SDR was 3 meter and the height of SDR was 9 meter. The amount of inlet combustion gas of SDR was $6,125Nm^3/hr$ and the inlet temperature of SDR was 493 K. The amount of lime injection of SDR was 151 kg/hr. When the inlet shape of SDR was changed, the temperatur of SDR was changed and the gas velocity of SDR was 0.48 m/sec to 1.17m/sec and the outlet gas velocity of SDR was 6.9 m/sec to 7.42m/sec As a result of modeling, the average velocities in SDR and outlet were 0.489 m/sec and 7.424 m/sec, respectively, in which the temperature of outlet in SDR was 448 K.

• Journal of Convergence for Information Technology
• /
• v.11 no.10
• /
• pp.36-44
• /
• 2021

Estimation on SW Sizing applied to fintech is very difficult, a task requiring long time, it is difficult for client companies and developer companies to accurately calculate the size of software development. The size is generally estimated based on the experience of project managers and the general functional scoring method. In this paper, propose a model that can be applied to fintech development projects by quantitatively calculating the required functions from the user's point of view, measuring the scale, and calculating the scale in real time. Through the proposed model, the amount of work can be estimated prior to development and the size can be measured, and the M/M and the estimated quotation amount can be calculated based on the program list by each layer. In future studies, by securing size computation data on existing the Fintech Project in mass, research on accurate size computation would be required.

• The Journal of Korean Institute of Information Technology
• /
• v.16 no.12
• /
• pp.85-92
• /
• 2018

When using complicated image processing algorithms, we use superpixels to reduce computational complexity. Superpixel segmentation is a method of grouping pixels having similar characteristics into one group. Since superpixel is used as a preprocessing of image processing, it should be generated quickly, and the edge components of the image should be well preserved. In this paper, we propose a method of generating superpixels with a small amount of computation while preserving edge components well. In the proposed method, superpixels of an image are generated by using the existing k-mean method, and similar superpixels among the generated superpixels are merged to make final superpixels. When merging superpixels, the similarity is calculated only for superpixels. Therefore, the amount of computation is maintained small. It is shown by experimental results that the superpixel images produced by the proposed method are conserving edge information of the original image better than those produced by the existing method.

• Journal of Digital Convergence
• /
• v.19 no.5
• /
• pp.307-313
• /
• 2021

In this paper, a lightweight network with fewer parameters compared to the existing object detection method is proposed. In the case of the currently used detection model, the network complexity has been greatly increased to improve accuracy. Therefore, the proposed network uses EfficientNet as a feature extraction network, and the subsequent layers are formed in a pyramid structure to utilize low-level detailed features and high-level semantic features. An attention process was applied between pyramid structures to suppress unnecessary noise for prediction. All computational processes of the network are replaced by depth-wise and point-wise convolutions to minimize the amount of computation. The proposed network was trained and evaluated using the PASCAL VOC dataset. The features fused through the experiment showed robust properties for various objects through a refinement process. Compared with the CNN-based detection model, detection accuracy is improved with a small amount of computation. It is considered necessary to adjust the anchor ratio according to the size of the object as a future study.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.4
• /
• pp.419-425
• /
• 2022

This paper aims to evaluate the acoustic detection performance for the deployment of the source and receiver positions of a bi-static sonar. In contrast with a mono-static sonar, a bi-static sonar has a large amount of computation and complexity for deployment. Therefore, in this study, we propose an assessment method that reduces the amount of computation while considering the variability of the ocean environment as a method to apply to the placement of the source and receiver of a bi-static sonar. First, we assume the representative ocean environment in the shallow and deep water. The signal excess is calculated with the source to receiver ranges and sensor depths. And the result is compared with the proposed assessment method of acoustic detection performance.

• Convergence Security Journal
• /
• v.23 no.1
• /
• pp.45-54
• /
• 2023

Recently, with the development of the Internet of Things, research on protocols that can easily connect devices without a UI to the network has been steadily conducted. To this end, the Wi-Fi Alliance announced Wi-Fi Easy Connect, which can connect to a network using a QR code. However, since Wi-Fi Easy Connect requires a large amount of computation for safety, it is difficult to apply to low-power and miniaturized IoT devices. In addition, Wi-Fi Easy Connect considering scalability is designed to operate in a wired environment, but problems such as duplicate encryption occur because it does not consider a security environment like TLS. Therefore, in this paper, we analyze the Wi-Fi Easy Connect protocol and propose a protocol that can operate efficiently in the TLS environment. It was confirmed that the proposed protocol satisfies the existing security requirements and at the same time reduces about 67% of ECC scalar multiplication operations with a large amount of computation.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.15 no.2
• /
• pp.65-73
• /
• 2007

The use of an Exhaust Gas Recirculation(EGR) for a diesel engine with variable geometry turbocharger(VGT) has confronted how to obtain the amount of EGR for NOx reduction requirement at wide operating range and less side effect. Through a combined effort of modeling(wave action simulation) and experiment, an investigation into the effect of EGR area ratio and pipe length on EGR characteristics of common rail diesel engine with VGT has been performed. For accurate computation, calibration of constants involved in empirical and semi-empirical correlations has been performed at a specific operating point, before of its use for engine simulation. From the results of this study, it was found that EGR rate is sharply increased with increasing EGR area ratio until area ratio of 0.3. However, the effect of EGR area ratio on EGR rate is negligible beyond this criteria. This study also investigates the effect of EGR pipe length on a EGR amount and pulsating flow characteristics at EGR junction. The results showed that the longer EGR pipe length, the lower EGR amount was achieved due to the flow loss resulting in lower amplitude of pressure wave.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1142-1148
• /
• 2005

We proposes an algorithm of measuring computation loads to distribute workload of clients. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers in relocating intrinsically. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include processing speeds of different nodes, the current load state of both sender and receiver, and the processing demands of tasks eligible for relocation. We also propose a load state measurement scheme which is designed particularly for heterogeneous systems. Based on this analysis, we design new algorithm for supporting heterogeneous distributed web server system, and compare their performance against other existing algorithms. We show that the new algorithm improve the performance of CPU utilization and response time.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.05a
• /
• pp.345-349
• /
• 2005

Massive amount of satellite image processing such asglobal/continental-level analysis and monitoring requires automated and speedy georegistration. There could be two major automated approaches: (1) rigid mathematical modeling using sensor model and ephemeris data; (2) heuristic co-registration approach with respect to existing reference image. In case of ETM+, the accuracy of the first approach is known as RMSE 250m, which is far below requested accuracy level for most of satellite image processing. On the other hands, the second approach is to find identical points between new image and reference image and use heuristic regression model for registration. The latter shows better accuracy but has problems with expensive computation. To improve efficiency of the coregistration approach, the author proposed a pre-qualified matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with correlation coefficient. Throughout the pre-qualification approach, the computation time was significantly improved and make the registration accuracy is improved. A prototype was implemented and tested with the proposed algorithm. The performance test of 14 TM/ETM+ images in the U.S. showed: (1) average RMSE error of the approach was 0.47 dependent upon terrain and features; (2) the number average matching points were over 15,000; (3) the time complexity was 12 min per image with 3.2GHz Intel Pentium 4 and 1G Ram.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.800-807
• /
• 2017

A large amount of computation is required to generate a hologram using a computer. In order to accelerate the computation, many methods of acceleration by parallel programming using GPGPU(General Purpose computing on Graphic Process Unit) have been researched. In this paper, we propose a method of reducing the bottleneck caused by hologram pixel based parallel processing and using the shareable variables. We also propose how to optimize using Visual Profiler supported by nVidia's CUDA to make threads work optimally. The experimental results show that the proposed method reduces the calculation time by up to 40% compared with the existing research.