• Journal of Welding and Joining
• /
• v.26 no.2
• /
• pp.85-91
• /
• 2008

In general, the quality of a welding process tends to vary with depending on the work environment or external disturbances. Hence, in order to achieve the desirable quality of welding, we should have the optimal welding condition that is not significantly affected by these changes in the environment or external disturbances. In this study, we used a dual response surface method in consideration of both the mean output variables and the standard deviation in order to optimize the V-groove arc welding process. The input variables for GMA welding process with the dual response surface are welding voltage, welding current and welding speed. The output variables are the welding quality function using the shape factor of bead geometry. First, we performed welding experiment on the interested area according to the central composite design. From the results obtained, we derived the regression model on the mean and standard deviation between the input and output variables of the welding process and then obtained the dual response surface. Finally, using the grid search method, we obtained the input variables that minimize the object function which led to the optimal V-groove arc welding process.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.4
• /
• pp.407-414
• /
• 2008

This study introduces an automatic image matching algorithm that can be applied for the scale different image pairs consisting of the satellite pushbroom images and the aerial frame images. The proposed method is based on several image processing techniques such as pre-processing, filtering, edge thinning, interest point extraction, and key-descriptor matching, in order to enhance the matching accuracy and the processing speed. The proposed method utilizes various characteristics, such as the different geometry of image acquisition and the different radiometric characteristics, of the multi-sensor images. In addition, the suggested method uses the sensor model to minimize search area and eliminate false-matching points automatically.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.13 no.5
• /
• pp.163-170
• /
• 2005

Urban transit is a complex system that is combined electrically and mechanically, it is necessary to construct maintenance system for securing safety accompanying high-speed driving and maintaining promptly. Expert system is a computer program which uses numerical or non-numerical domain-specific knowledge to solve problems. In this research, we intend to develop the expert system which diagnose failure causes quickly and display measures. For the development of expert system, standardization of failure code classification system and creation of BOM(Bill Of Materials) have been first performed. Through the analysis of failure history and maintenance manuals, knowledge base has been constructed. Also, for retrieving the procedure of failure diagnosis and repair linking with the knowledge base, we have built RBR(Rule Based Reasoning) engine by pattern matching technique and CBR(Case Based Reasoning) engine by similarity search method. This system has been developed based on web to maximize the accessibility.

• International Journal of Aeronautical and Space Sciences
• /
• v.11 no.1
• /
• pp.10-18
• /
• 2010

The purpose of this paper deals with direct multiple-shooting method (DMS) to resolve helicopter maneuver problems of helicopters. The maneuver problem is transformed into nonlinear problems and solved DMS technique. The DMS method is easy in handling constraints and it has large convergence radius compared to other strategies. When parameterized with piecewise constant controls, the problems become most effectively tractable because the search direction is easily estimated by solving the structured Karush-Kuhn-Tucker (KKT) system. However, generally the computation of function, gradients and Hessian matrices has considerably time-consuming for complex system such as helicopter. This study focused on the approximation of the KKT system using the matrix exponential and its integrals. The propose method is validated by solving optimal control problems for the linear system where the KKT system is exactly expressed with the matrix exponential and its integrals. The trajectory tracking problem of various maneuvers like bob up, sidestep near hovering flight speed and hurdle hop, slalom, transient turn, acceleration and deceleration are analyzed to investigate the effects of algorithmic details. The results show the matrix exponential approach to compute gradients and the Hessian matrix is most efficient among the implemented methods when combined with the mixed time integration method for the system dynamics. The analyses with the proposed method show good convergence and capability of tracking the prescribed trajectory. Therefore, it can be used to solve critical areas of helicopter flight dynamic problems.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.739-745
• /
• 2017

This paper presents and discusses an implementation of the GPU shifted sorting method to find approximate k nearest neighbors which executes within "warp", the minimum execution unit in GPU parallel architecture. Also, this paper presents the comparison results with other two common nearest neighbor searching methods, GPU-based kd-tree and ANN (Approximate Nearest Neighbor) library. The proposed implementation focuses on the cases when k is small, i.e. 2, 4, 8, and 16, which are handled efficiently within warp to consider it is very common for applications to handle small k's. Also, this paper discusses optimization ways to implementation by improving memory management in a loop for the CUB open library and adopting CUDA commands which are supported by GPU hardware. The proposed implementation shows more than 16-fold speed-up against GPU-based other methods in the tests, implying that the improvement would become higher for more larger input data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.4
• /
• pp.71-80
• /
• 1996

This paper presents stabilization and position control of the Inverted-Pendulum system with cart by using Evolution Strategies that is one of the Evolutionary Computation and is effective in searching real number. The control input of the Inverted-Pendulum is the element of chromosome corresponding to the divided space of Inverted-Pendulum state variable x, x, 0, 0 . In general, the larger the length of the chromosome is, the longer the time of evolution to search optimal solution is. So in this paper, we propose a scheme that reduce the state space by half by taking the method, that is, converting only the sign of the control input without obtaining separately for the symmetrical sections of the Inverted-Pendulum to improve the speed of Evolution, and improved the efficiency of the entire system in addition to the improvement of the chromosome's evolution time by carrying out the chromosome's evolutional process by two steps one of which is that cart is positioned near the control point and the other cart is positioned far from that point. We propose another method that is Neural Network-Evolution StrategiedNN-ES) Controller. We verify the effectiveness of the proposed control scheme by computer simulations.

• Progress in Medical Physics
• /
• v.23 no.4
• /
• pp.303-308
• /
• 2012

The Geant4 based Monte Carlo code for the application of stereotactic radiosurgery was developed. The probability density function and cumulative density function to determine the incident photon energy were calculated from pre-calculated energy spectrum for the linac by multiplying the weighting factors corresponding to the energy bins. The messenger class to transfer the various MLC fields generated by the planning system was used. The rotation matrix of rotateX and rotateY were used for simulating gantry and table rotation respectively. We construct accelerator world and phantom world in the main world coordinate to rotate accelerator and phantom world independently. We used dicomHandler class object to convert from the dicom binary file to the text file which contains the matrix number, pixel size, pixel's HU, bit size, padding value and high bits order. We reconstruct this class object to work fine. We also reconstruct the PrimaryGeneratorAction class to speed up the calculation time. because of the huge calculation time we discard search process of the ThitsMap and used direct access method from the first to the last element to produce the result files.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.215-223
• /
• 2007

On-Line Shopping mall is becoming important strategic environment that decide corporation's competitive advantages because of that can achieve quality of customer service and offer speed elevation through both-way communication effectively. Accordingly, as interest about electronic commerce rises, various research had been gone. But, most researches are applying off-line market's quality of service measurement tool just as it is doing not consider special quality of internet. Consider and prescribe by system quality, and saw that thing with grasp relation with customer satisfaction along with qualify of service is important for factor that environmental element influences in customer satisfaction as existing commercial transaction in this research hereupon. That is, wished to present quality strategy necessary to examine whether some quality factor of system quality and quality of service affects more customer satisfaction, and satisfy various customer's needs accordingly after ermine whether it are switching and some relation that search purchase alteration availability of market that is different from loyalty which recommend internet shopping mall to another person who is system quality factor and quality of service factor and customer satisfaction factor actively.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.213-219
• /
• 2005

In order to move NPC's to target location at game maps, various algorithm including A* has been used. The most frequently used algorithm among them is A* with fast finding speed. But A* has the following problems. The first problem is that at randomly changing map, it is necessary to calculate all things again whenever there are any changes. And when calculation is wrong, it is not possible to search for target. The second problem is that it is difficult to move avoiding dangerous locations damaging NPC such as an obstruction. Although it is possible to avoid moving to locations with high weight by giving weight to dangerous factors. it is difficult to control in case NPC moves nearby dangerous factors. In order to solve such problems, in this thesis, the researcher applied Dynamic Programming to path-finding algorithm. As the result of its application, the researcher could confirm that the programming was suitable for changes at the map with random change and NPC's avoided the factors being dangerous to them far away. In addition. when compared to A*, there were good results.