• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.600-619
• /
• 2006

According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.620-626
• /
• 2004

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

• Korean Journal of Remote Sensing
• /
• v.37 no.6_1
• /
• pp.1709-1718
• /
• 2021

The waveform data of the Airborne Bathymetric LiDAR (ABL; LiDAR: Light Detection And Ranging) system provides data with improved accuracy, resolution, and reliability compared to the discrete-return data, and increases the user's control over data processing. Furthermore, we are able to extract additional information about the return signal. Waveform decomposition is a technique that separates each echo from the received waveform with a mixture of water surface and seabed reflections, waterbody backscattering, and various noises. In this study, a new waveform decomposition technique based on a Gaussian model was developed to improve the point extraction performance from the ABL waveform data. In the existing waveform decomposition techniques, the number of decomposed echoes and decomposition performance depend on the peak detection results because they use waveform peaks as initial values. However, in the study, we improved the approximation accuracy of the decomposition model by adding the estimated potential peak candidates to the initial peaks. As a result of an experiment using waveform data obtained from the East Coast from the Seahawk system, the precision of the decomposition model was improved by about 37% based on evaluating RMSE compared to the Gaussian decomposition method.

• Radiation Oncology Journal
• /
• v.20 no.4
• /
• pp.396-404
• /
• 2002

Purpose : Many papers support a correlation between rectal complications and rectal doses in uterine cervical cancer patients treated with radical radiotherapy. In vivo dosimetry in the rectum following the ICRU report 38 contributes to the quality assurance in HDR brachytherapy, especially in minimizing side effects. This study compares the rectal doses calculated in the radiation treatment planning system to that measured with a silicon diode the in vivo dosimetry system. Methods : Nine patients, with a uterine cervical carcinoma, treated with Iridium-192 high dose rate brachytherapy between June 2001 and Feb. 2002, were retrospectively analysed. Six to eight-fractions of high dose rate (HDR)-intracavitary radiotherapy (ICR) were delivered two times per week, with a total dose of $28\~32\;Gy$ to point A. In 44 applications, to the 9 patients, the measured rectal doses were analyzed and compared with the calculated rectal doses using the radiation treatment planning system. Using graphic approximation methods, in conjunction with localization radiographs, the expected dose values at the detector points of an intrarectal semiconductor dosimeter, were calculated. Results : There were significant differences between the calculated rectal doses, based on the simulation radiographs, and the calculated rectal doses, based on the radiographs in each fraction of the HDR ICR. Also, there were significant differences between the calculated and measured rectal doses based on the in-vivo diode dosimetry system. The rectal reference point on the anteroposterior line drawn through the lower end of the uterine sources, according to ICRU 38 report, received the maximum rectal doses in only 2 out of the nine patients $(22.2\%)$. Conclusion : In HDR ICR planning for conical cancer, optimization of the dose to the rectum by the computer-assisted planning system, using radiographs in simulation, is improper. This study showed that in vivo rectal dosimetry, using a diode detector during the HDR ICR, could have a useful role in quality control for HDR brachytherapy in cervical carcinomas. The importance of individual dosimeters for each HDR ICR is clear. In some departments that do not have the in vivo dosimetry system, the radiation oncologist has to find, from lateral fluoroscopic findings, the location of the rectal marker before each fractionated HDR brachytherapy, which is a necessary and important step of HDR brachytherapy for cervical cancer.