• Journal of Intelligence and Information Systems
• /
• v.14 no.3
• /
• pp.59-76
• /
• 2008

In this paper, we propose an agent architecture called L-CAA that is quite effective in real-time dynamic environments. L-CAA is an extension of CAA, the behavior-based agent architecture which was also developed by our research group. In order to improve adaptability to the changing environment, it is extended by adding reinforcement learning capability. To obtain stable performance, however, behavior selection and execution in the L-CAA architecture do not entirely rely on learning. In L-CAA, learning is utilized merely as a complimentary means for behavior selection and execution. Behavior selection mechanism in this architecture consists of two phases. In the first phase, the behaviors are extracted from the behavior library by checking the user-defined applicable conditions and utility of each behavior. If multiple behaviors are extracted in the first phase, the single behavior is selected to execute in the help of reinforcement learning in the second phase. That is, the behavior with the highest expected reward is selected by comparing Q values of individual behaviors updated through reinforcement learning. L-CAA can monitor the maintainable conditions of the executing behavior and stop immediately the behavior when some of the conditions fail due to dynamic change of the environment. Additionally, L-CAA can suspend and then resume the current behavior whenever it encounters a higher utility behavior. In order to analyze effectiveness of the L-CAA architecture, we implement an L-CAA-enabled agent autonomously playing in an Unreal Tournament game that is a well-known dynamic virtual environment, and then conduct several experiments using it.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.457-464
• /
• 2008

In the real-world operational environment, most of text classification systems have the problems of insufficient training documents and no prior knowledge of feature space. In this regard, $Na{\ddot{i}ve$ Bayes is known to be an appropriate algorithm of operational text classification since the classification model can be evolved easily by incrementally updating its pre-learned classification model and feature space. This paper proposes the improving technique of $Na{\ddot{i}ve$ Bayes classifier through feature weighting strategy. The basic idea is that parameter estimation of $Na{\ddot{i}ve$ Bayes considers the degree of feature importance as well as feature distribution. We can develop a more accurate classification model by incorporating feature weights into Naive Bayes learning algorithm, not performing a learning process with a reduced feature set. In addition, we have extended a conventional feature update algorithm for incremental feature weighting in a dynamic operational environment. To evaluate the proposed method, we perform the experiments using the various document collections, and show that the traditional $Na{\ddot{i}ve$ Bayes classifier can be significantly improved by the proposed technique.

• Journal of Korea Game Society
• /
• v.10 no.6
• /
• pp.157-168
• /
• 2010

A terrain is an essential element for constructing a virtual world in which game characters and objects make various interactions with one another. Creating a terrain requires a great deal of time and repetitive editing processes. This paper presents a 3D terrain reconstruction system to create 3D terrain in virtual space based on real terrain data. In this system, it converts the coordinate system of the height maps which are generated from a stereo camera and a laser scanner from global GPS into 3D world using the x and z axis vectors of the global GPS coordinate system. It calculates the movement vectors and the rotation matrices frame by frame. Terrain meshes are dynamically generated and rendered in the virtual areas which are represented in an undirected graph. The rendering meshes are exactly created and updated by correcting terrain data errors. In our experiments, the FPS of the system was regularly checked until the terrain was reconstructed by our system, and the visualization quality of the terrain was reviewed. As a result, our system shows that it has 3 times higher FPS than other terrain management systems with Quadtree for small area, improves 40% than others for large area. The visualization of terrain data maintains the same shape as the contour of real terrain. This system could be used for the terrain system of realtime 3D games to generate terrain on real time, and for the terrain design work of CG Movies.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.1
• /
• pp.1-6
• /
• 2012

Web pages in a template-based web application (TWA) are automatically populated using a template shared by the pages with contents specific to the pages. So users can easily obtain information guided by a consistent structure of the template. Reduced duplicated code helps to increase the level of maintainability as well. However, TWA still has the interaction problem of classic web applications that each time a user clicks a hyperlink a new page is loaded, although a partial update of the page is desirable. This paper proposes a reengineering technique to transform the multi-page structure of legacy Java-based TWA to a single page one with partial page refresh. In this approach, hyperlinks in HTML code are refactored to AJAX-enabled event handlers to achieve the single page structure. In addition, JSP and Servlet code is transformed in order not to send data unnecessary for the partial update. The new single page consists of individual components that are updateable independently when interacting with a user. Therefore, our approach can improve interactivity and responsiveness towards a user while reducing CPU and network usage. The measurement of our technique applied to a typical TWA shows that our technique improves the response time of user requests over the TWA in the range from 1 to 87%.

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

In this paper, we propose a fast video retargeting method which preserves the contents of a video and converts the image size. Since the conventional Seam Carving which is the well-known content-aware image retargeting technique uses the dynamic programming method, the repetitive update procedure of the accumulation energy is absolutely needed to obtain seam. The energy update procedure cannot avoid the processing time delay because of many operations by the image full-searching. By applying the proposed method, frames which have similar features in video are classified into a scene, and the first frame of a scene is resized by the modified Seam Carving where multiple seams are extracted from candidate seams to reduce the repetitive update procedure. After resizing the first frame of a scene, all continuous frames of the same scene are resized with reference to the seam information stored in the previous frame without the calculation of the accumulation energy. Therefore, although the fast processing is possible with reducing complexity and without analyzing all frames of scene, the quality of an image can be analogously maintained with an existing method. The experimental results show that the proposed method can preserve the contents of an image and can be practically applied to retarget the image on real time.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.2
• /
• pp.117-124
• /
• 2019

Parallel sparse solvers are essential for solving large-scale finite element models. This paper introduces the combination of iterative and direct solver that can be applied efficiently to problems that require continuous solution for a subtly changing sequence of systems of equations. The iterative-direct sparse solver combination technique, proposed and implemented in the parallel sparse solver package, PARDISO, means that iterative sparse solver is applied for the newly updated linear system, but it uses the direct sparse solver's factorization of previous system matrix as a preconditioner. If the solution does not converge until the preset iterations, the solution will be sought by the direct sparse solver, and the last factorization results will be used as a preconditioner for subsequent updated system of equations. In this study, an improved method that sets the maximum number of iterations dynamically at the first Krylov iteration step is proposed and verified thereby enhancing calculation efficiency by the frequency domain analysis.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.4 no.3
• /
• pp.61-70
• /
• 2001

This paper presents a new method to extract semi-automatically roads from high spatial resolution satellite imagery. This method is based both on wavelet transform and on multiresolution analysis combined in the "$\grave{a}$ trous" algorithm. As an urban road network consists on different classes of streets, multiresolution processing allows to extract the streets class by class. The method was applied to a KVR-1000 image on a part of Busan Metropolitan City. The method was carried out for the road extraction of three different widths and it succeeded in extracting good fitted strips. The accuracy analysis for three types of streets was also performed. The overall accuracy in 4 pixels of width is 80.5%. The result suggests that this method can be used to update road networks in the studied urban network. In summary, the multiresolution approach based on the wavelet transform, used in this study, is regarded as one of effective methods to extract urban road network from high spatial resolution satellite images.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.299-308
• /
• 2011

In this study, we develop a pressure observer to measure the cylinder length of a harbor-construction robot. For the robot control, sensors are required to measure the length of a hydraulic cylinder. The cylinder-position sensor is relatively expensive when the operating environment prohibits external approaches for the measurement of the cylinder position. LVDT or linear scales are usually mounted on the outside of the cylinder, which causes poor durability on a construction site. We use a pressure sensor to indirectly estimate the length of the cylinder. The pressure sensor is mounted inside a hydraulic valve box so that it is protected by the box and easy to waterproof for an underwater robot. By treating oil as a compressible fluid, we derive the nonlinear pressure dynamics as a function of the cylinder position, velocity, and pressure. The recursive least squares (RLS) algorithm is applied to identify the dynamic parameters, and the pressure observer estimates the cylinder position through the pressure acting on the head and the rod of the hydraulic cylinder. The position accuracy is relatively low, but it is acceptable for a construction robot that handles large armor stones.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.1
• /
• pp.1-10
• /
• 2011

An optimization method is proposed for preform and billet shape designs in the forging process by using the Equivalent Static Loads (ESLs). The preform shape is an important factor in the forging process because the quality of the final forging is significantly influenced by it. The ESLSO is used to determine the shape of the preform. In the ESLSO, nonlinear dynamic loads are transformed to the ESLs and linear response optimization is performed using the ESLs. The design is updated in linear response optimization and nonlinear analysis is performed with the updated design. The examples in this paper show that optimization using the ESLs is useful and the design results are satisfactory. Consequently, the optimal preform and billet shapes which produce the desired final shape have been obtained. Nonlinear analysis and linear response optimization of the forging process are performed using the commercial software LS-DYNA and NASTRAN, respectively.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.374-385
• /
• 2009

Flash memory becomes increasingly popular as data storage for various devices because of its versatile features such as non-volatility, light weight, low power consumption, and shock resistance. Flash memory, however, has some distinct characteristics that make today's disk-based database technology unsuitable, such as no in-place update and the asymmetric speed of read and write operations. As a result, most traditional disk-based database systems may not provide the best attainable performance on flash memory. To maximize the database performance on flash memory, some approaches have been proposed where only the changes made to the database, i.e., logs, are written to another empty place that has born erased in advance. In this paper, we propose an efficient log management scheme for flash-based database systems. Unlike the previous approaches, the proposed approach stores logs in specially allocated blocks, called log blocks. By evenly distributing logs across log blocks, the proposed approach can significantly reduce the number of write and erase operations. Our performance evaluation shows that the proposed approaches can improve the overall system performance by reducing the number of write and erase operation compared to the previous ones.