• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1385-1398
• /
• 2004

This paper discusses an effective processing of subsequence matching under time warping in time-series databases. Time warping is a trans-formation that enables finding of sequences with similar patterns even when they are of different lengths. Through a preliminary experiment, we first point out that the performance bottleneck of Naive-Scan, a basic method for processing of subsequence matching under time warping, is on the CPU processing step. Then, we propose a novel method that optimizes the CPU processing step of Naive-Scan. The proposed method maximizes the CPU performance by eliminating all the redundant calculations occurring in computing the time warping distance between the query sequence and data subsequences. We formally prove the proposed method does not incur false dismissals and also is the optimal one for processing Naive-Scan. Also, we discuss the we discuss to apply the proposed method to the post-processing step of LB-Scan and ST-Filter, the previous methods for processing of subsequence matching under time warping. Then, we quantitatively verify the performance improvement ef-fects obtained by the proposed method via extensive experiments. The result shows that the performance of all the three previous methods im-proves by employing the proposed method. Especially, Naive-Scan, which is known to show the worst performance, performs much better than LB-Scan as well as ST-Filter in all cases when it employs the proposed method for CPU processing. This result is so meaningful in that the performance inversion among Nive- Scan, LB-Scan, and ST-Filter has occurred by optimizing the CPU processing step, which is their perform-ance bottleneck.

• Korean Chemical Engineering Research
• /
• v.58 no.4
• /
• pp.588-595
• /
• 2020

Prediction and control of nitrogen oxides (NO_x) emission is of great interest in industry due to stricter environmental regulations. Herein, we propose an artificial intelligence (AI)-based framework for prediction of NO_x emission. The framework includes pre-processing of data for training of neural networks and evaluation of the AI-based models. In this work, Long-Short-Term Memory (LSTM), one of the recurrent neural networks, was adopted to reflect the time series characteristics of NO_x emissions. A decision tree was used to determine a time window of LSTM prior to training of the network. The neural network was trained with operational data from a heating furnace. The optimal model was obtained by optimizing hyper-parameters. The LSTM model provided a reliable prediction of NO_x emission for both training and test data, showing an accuracy of 93% or more. The application of the proposed AI-based framework will provide new opportunities for predicting the emission of various air pollutants with time series characteristics.

• Resources Recycling
• /
• v.27 no.5
• /
• pp.69-76
• /
• 2018

For the purpose of optimizing the counter current extraction process for separation of [Sm] and [Pr, Nd] group in hydrochloric acid solution using Cyanex 572 as an extractant, the theory of Xu Guangxian was derived for calculating the optimized extraction factors. From the basic batch test result, the separation factor of [Sm]/[Pr, Nd] was 14.59 at pH 1.75 in extraction process and 14.61 at 0.01 M HCl in scrubbing process. The process parameters can be calculated using a theory of optimum extraction ratio. From the result of calculation, the total extraction and scrubbing stage numbers at counter current process were 11 and for maintain extraction ratio the flow rate ratio of feed solution, solvent solution, scrubbing solution was 6.25 : 1.74 : 5.80 using 0.1 M HCl.

• The KIPS Transactions:PartB
• /
• v.14B no.7
• /
• pp.513-522
• /
• 2007

Clustering is to divide given data and automatically find out the hidden meanings in the data. It analyzes data, which are difficult for people to check in detail, and then, makes several clusters consisting of data with similar characteristics. On-Line Document Clustering System, which makes a group of similar documents by use of results of the search engine, is aimed to increase the convenience of information retrieval area. Document clustering is automatically done without human interference, and the number of clusters, which affect the result of clustering, should be decided automatically too. Also, the one of the characteristics of an on-line system is guarantying fast response time. This paper proposed a method of determining the number of clusters automatically by geometrical information. The proposed method composed of two stages. In the first stage, centers of clusters are projected on the low-dimensional plane, and in the second stage, clusters are combined by use of distance of centers of clusters in the low-dimensional plane. As a result of experimenting this method with real data, it was found that clustering performance became better and the response time is suitable to on-line circumstance.

• Journal of the Society of Cosmetic Scientists of Korea
• /
• v.42 no.1
• /
• pp.1-7
• /
• 2016

Highly porous polymethyl methacrylate (PMMA) microspheres impregnated by $TiO_2$ powder were prepared by spray drying method. The particle size and the porosity were controlled by optimizing the co-solvent ratio and the polymer concentration. $TiO_2$ powder was impregnated into the microspheres upto 74.6 wt% content based on the weight of the resultant $PMMA/TiO_2$ microspheres. SEM images showed that $TiO_2$ powder was well distributed throughout the inside of the microsphere. EDX mapping showed that the Ti signal was well detected from every part of the microspheres, which was the evidence of the formation of the $PMMA/TiO_2$ composite. Hg porosimetry result showed that the porosity was found to be over 50% regardless of the $TiO_2$ contents. The final product was found to have high oil-absorbing capacity and great hiding power, both of which are key properties in designing the microsphere materials for make-up cosmetics application.

• Korean Journal of Optics and Photonics
• /
• v.21 no.6
• /
• pp.247-253
• /
• 2010

A dual-layer light guide plate (DLGP) was designed and a simulation was done to optimize the structure of the light guide plates used at backlight units while maintaining the luminance, uniformity and viewing angle by reducing the optical sheet. The characteristic of DLGP with prism pattern with curvature on the top surface is simulated and the luminance and uniformity are obtained. In order to improve the uniformity, the V groove prism pattern on the bottom surface was turned by an angle of $90^{\circ}$. In particular, we used the pitch calculation program to select the value of the ratio (Max : Min) between the pitch at the extreme outside and the pitch at the middle, the number of V groove lines and the variance at the bottom pattern of DLGP. After that, the optimum distance between V grooves was determined. For optimizing the DLGP, we examined the uniformity again by changing the number of pattern grooves on the bottom surface of DLGP. As a result of the simulation, we find that the BLU with DLGP has a uniformity of 90.6% and viewing angle $145^{\circ}$.

• Korean Journal of Optics and Photonics
• /
• v.31 no.5
• /
• pp.223-230
• /
• 2020

In this paper, we have studied the characteristics of stimulated Brillouin scattering (SBS) and mode instability (MI) in a ytterbium-doped polarization-maintaining fiber laser with master oscillator power amplifier configuration. We measured the laser output power and back-reflection spectrum for a variety of ytterbium-doped fibers and seed lights, to investigate the power-scaling limits of fiber lasers. By optimizing the laser structure, we demonstrated an all-fiber high-power polarization-maintaining fiber laser with near-diffraction-limited beam quality. The output power of 1.5 kW was achieved with a linewidth of 10 GHz, generated by pseudo-random binary sequence (PRBS) phase modulation. The beam quality M² was about 1.15 at the maximum output power. The polarization extinction ratio (PER) was greater than 17 dB.

• Spatial Information Research
• /
• v.19 no.5
• /
• pp.63-74
• /
• 2011

Recently, there has been much interest in the spatial query which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. The centralized approach which performs the spatial query at a server after acquiring all sensor readings, though simple, it incurs high wireless transmission cost in accessing all sensor nodes. In order to remove the high wireless transmission cost, various in-network spatial indexing schemes have been proposed. They have focused on reducing the transmission cost by performing distributed spatial filtering on sensor nodes. However, these in-network spatial indexing schemes have a problem which cannot optimize both the spatial filtering and the wireless routing among sensor nodes, because these schemes have been developed by simply applying the existing spatial indexing schemes into the in-network environment. Therefore, we propose a new distributed spatial indexing scheme of the GR-tree. The GR-tree which form s a MBR-based tree structure, can reduce the wireless transmission cost by optimizing both the efficient spatial filtering and the wireless routing. Finally, we compare the existing spatial indexing scheme through extensive experiments and clarify our approach's distinguished features.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.11-21
• /
• 2013

Recently operating a large scale computing resource like a data center becomes easier because of the virtualization technology that virtualize servers and enable flexible resource provision. The most of public cloud services provides automatic scaling in the form of scale-in or scale-out and these scaling approaches works well to satisfy the service level agreement (SLA) of users. However, a novel scaling approach is required to operate private clouds that has smaller amount of computing resources than vast resources of public clouds. In this paper, we propose a hybrid server scaling architecture and related algorithms using both scale-in and scale-out to achieve higher resource utilization rate for private clouds. We uses dynamic resource allocation and live migration to run our proposed algorithm. Our propose system aims to provide a fine-grain resource scaling by steps. Thus private cloud systems are able to keep stable service and to reduce server management cost by optimizing server utilization. The experiment results show that our proposed approach performs better in resource utilization than the scale-out approach based on the number of users.

• Journal of Korea Port Economic Association
• /
• v.26 no.3
• /
• pp.42-55
• /
• 2010

This paper primarily deals with a decision-making for determining the number of voyages in each ship size under a specific port structure in order to minimize the total transport cost consisting of transport cost at sea, queuing cost in port, and inventory cost in yard. As a result of computer simulation using queuing model characterized by inter-arrival time distribution, we were able to find out some combination of voyage numbers of 3 ship-size(50,000-ton, 100,000-ton, and 200,000-ton), where the total transport cost can be minimized under a specific port structure. The simulation model also allows us to figure out any trade-off relationship among sea transport cost, queuing cost in port, and inventory cost in yard. Put it differently, an attempt to reduce the sea transport cost by increasing the number of voyages of the largest ship size, the transport cost incurred in both port and yard is hypothesized to be increased and vice versa. Consequently, Port managers are required to adjust the number of annual number of voyages allocated in each ship size, put into the sea lines for importing raw materials, in order to optimize the transport costs incurred under the specific port system. We may consider a net present value(NPV) model for performing an economic feasibility analysis on port investment project. If a total discounted net benefit, including cost savings, exceeds the initial investment for an additional berth construction, then we accept the port investment project. Otherwise, we reject the proposed port investment plan.