• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.543-553
• /
• 1995

While RAID 5 disk arrays offer advantages of performance and reliability on wide variety of applications, they suffer from the performance degradation with write jobs. To reduce the effect of this problem, parity logging scheme was suggested. This scheme reduces disk busy time by transforming many small random accesses into large sequential accesses. This paper presents a new parity logging technique which prevents parity update image from redundant storing in the disk buffer and reduces parity maintenance overhead. A analytical model and several simulation results of our proposed scheme are presented.

• Journal of Mechanical Science and Technology
• /
• v.15 no.7
• /
• pp.876-888
• /
• 2001

For a large scaled optimization based on response surface methods, an efficient quadratic approximation method is presented in the context of the trust region model management strategy. If the number of design variables is η, the proposed method requires only 2η+1 design points for one approximation, which are a center point and tow additional axial points within a systematically adjusted trust region. These design points are used to uniquely determine the main effect terms such as the linear and quadratic regression coefficients. A quasi-Newton formula then uses these linear and quadratic coefficients to progressively update the two-factor interaction effect terms as the sequential approximate optimization progresses. In order to show the numerical performance of the proposed method, a typical unconstrained optimization problem and two dynamic response optimization problems with multiple objective are solved. Finally, their optimization results compared with those of the central composite designs (CCD) or the over-determined D-optimality criterion show that the proposed method gives more efficient results than others.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.425-432
• /
• 2003

In personal communication systems, location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is introduced, which is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. We propose the decision criterion of the first paging area by comparing the cost against zone-based strategy. For an incoming call. we perform the sequential paging by the order of the first paging area and the rest of cells in the location area called by the second paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than existing strategy using anchor cell in the location area because it reflects various residence patterns of mobile terminals.

• Journal of the Korean earth science society
• /
• v.23 no.1
• /
• pp.15-29
• /
• 2002

Bayesian inversion for gravity and resistivity data was performed to investigate the cavity structure appearing as a lava tunnel in Cheju Island, Korea. Dipole-dipole DC resistivity data were proposed for a prior information of gravity data and we applied the geostatistical techniques such as kriging and simulation algorithms to provide a prior model information and covariance matrix in data domain. The inverted resistivity section gave the indicator variogram modeling for each threshold and it provided spatial uncertainty to give a prior PDF by sequential indicator simulations. We also presented a more objective way to make data covariance matrix that reflects the state of the achieved field data by geostatistical technique, cross-validation. Then Gaussian approximation was adopted for the inference of characteristics of the marginal distributions of model parameters and Broyden update for simple calculation of sensitivity matrix and SVD was applied. Generally cavity investigation by geophysical exploration is difficult and success is hard to be achieved. However, this exotic multiple interpretations showed remarkable improvement and stability for interpretation when compared to data-fit alone results, and suggested the possibility of diverse application for Bayesian inversion in geophysical inverse problem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.638-642
• /
• 2001

In this paper we propose a noise reduction algorithm which based on cellular automata with the local median rule. It is supposed that there is no information about the features of the image that must be improved. The proposed method behavior is to locally increase or decrease the gray level differences of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is completely determined by Lyapunov operators for sequential and parallel update. We have found that the automata present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuss the advantage and efficiency.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.18 no.4
• /
• pp.337-347
• /
• 2009

Generally, finite element models used in structural analysis have some uncertainties of the geometric dimensions, applied loads and boundary conditions, as well as in material properties due to the manufacturability of aluminum intensive body. Therefore, it is very important to refine or update a finite element model by correlating it with dynamic and static tests. The structural optimization problems of automotive body are considered for mechanical structures with initial stiffness due to preloading and in operation condition or manufacturing. As the mean compliance and deflection under preloading are chosen as the objective function and constraints, their sensitivities must be derived. The optimization problem is iteratively solved by a sequential convex approximation method in the commercial software. The design variables are corrected by the strain energy scale factor in the element levels. This paper presents an updated method based on the sensitivities of structural responses and the residual error vectors between experimental and simulation models.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.2
• /
• pp.343-348
• /
• 2001

In this paper we propose a noise reduction algorithm which based on cellular automata with the local median rule. It is supposed that there is no information about the features of the image that must be improved. The proposed method behavior is to locally increase or decrease the gray level differences of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is completely determined by Lyapunov operators for sequential and parallel update. We have found that the automata present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuss the advantage and efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.327-335
• /
• 2003

Cellular Automata is discrete dynamical systems which natural phenomena may be specified completely in terms of local relation. In this Paper we Propose noise removal and edge detection algorithm using a Potts Automata which is based on Cellular Automata. The proposed method is aimed to locally increase or decrease the differences in gray level values between pixel of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is determined by Lyapunov operators for sequential and parallel update. We have found that proposed automata rules Present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuses the advantage and efficiency.

• Journal of IKEEE
• /
• v.24 no.4
• /
• pp.991-997
• /
• 2020

Reinforcement learning has been applied mainly in sequential decision-making problems. Especially in recent years, reinforcement learning combined with neural networks has brought successful results in previously unsolved fields. However, reinforcement learning using deep neural networks has the disadvantage that it is too complex for immediate use in the field. In this paper, we implemented path planning algorithm for mobile robots using Q-learning, one of the easy-to-learn reinforcement learning algorithms. We used real-time Q-learning to update the Q-table in real-time since the Q-learning method of generating Q-tables in advance has obvious limitations. By adjusting the exploration strategy, we were able to obtain the learning speed required for real-time Q-learning. Finally, we compared the performance of real-time Q-learning and DQN.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1118-1130
• /
• 2006

Existed pattern analysis algorithms in data streams environment have researched performance improvement and effective memory usage. But when new data streams come, existed pattern analysis algorithms have to analyze patterns again and have to generate pattern tree again. This approach needs many calculations in real situation that needs real time pattern analysis. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. This method analyzes patterns fast, and thereafter obtains real time patterns by updating previously analyzed patterns. The incoming data streams are divided into several sequences based on time based window. Informations of the sequences are inputted into a hash table. When the number of the sequences are over predefined bound, patterns are analyzed from the hash table. The patterns form a pattern tree, and later created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree. During pattern analysis, suffixes of both new pattern and existed pattern in the tree can be same. Then a pointer is created from the new pattern to the existed pattern. This method reduce calculation time during duplicated pattern analysis. And old patterns in the tree are deleted easily by FIFO method. The advantage of our algorithm is proved by performance comparison with existed method, MILE, in a condition that pattern is changed continuously. And we look around performance variation by changing several variable in the algorithm.