• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.213-215
• /
• 2009

Using the object recognition processing on the captured images, we can inspect whether a packaging process is performed correctly in real time. So we realized the functions that acquire an image of each state of the packaging process using a camera, extract each object in the image, and inspect the packaging process using the extracted object data. In case an object shape is solid, for object search, a shape-based matching algorithm was used which searches the object utilizing the informations on the shape. In case an object shape is not solid, and Is flexible, gray-level difference of the pixels in the limited image region including the object was used to recognize the object.

• Journal of Industrial Technology
• /
• v.29 no.B
• /
• pp.47-56
• /
• 2009

University is very big scale among urban facilities as for single facilities and there is characteristic that accompany various university support functions in contiguity area. Width that have diverse spatial configuration generally our country university campus around was formed, this does function that connect university and ambit. Specially, formation enables change of spatial configuration that existent width system has if is new around university campus. Also, can form more animate and lively width spatial configuration by forming more various and complex width spatial configuration in width had formed in existing. It is that search special quality of university surrounding width spatial configuration analyzing existing width spatial configuration of Kangwon National University back gate by formation if this study is new in city and forecasts the change, and used space syntax by spatial configuration analysis method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.488-491
• /
• 1988

In this work, we developed a real-time versatile advanced control and supervisory software for a personal computer control. This software, basically, has background and foreground tasks which are performed in parallel at real time. First, background tasks are composed of controls of various kinds, reports and input-ouput of signals etc, which are performed every sampling time. Second, foreground tasks are observation of operation conditions, data search, regulation of controllers and graphical design and display of processes, which are performed by users request. Additionally, this software has the functions of transporting data and composing distributed control systems, and all background tasks are composed of combination of unit function blocks.

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

This paper considers a continuous-review two-echelon inventory control problem with one-to-one replenishment policy incorporated and with lost sales allowed where demand arrives In a stationary Poisson process The problem Is formulated using METRIC-approximation in a combined approach of pricing and (S-1.S) Inventory policy, for which an iterative solution algorithm is derived with respect to the corresponding one-warehouse multi-retailor supply chain. Specifically, decisions on retail pricing and warehouse inventory policies are made in integration to maximize total profit in the supply chain. The objective function of the model consists of sub-functions of revenue and cost (holding cost and penalty cost). To test the effectiveness and efficiency of the proposed algorithm, numerical experiments are performed The computational results show that the proposed algorithm is efficient and derives quite good decisions

• Journal of Mechanical Science and Technology
• /
• v.17 no.12
• /
• pp.1938-1948
• /
• 2003

This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.298-299
• /
• 2002

WERC (Wakasa Wan Energy Research Center) has started the proton cancer therapy since June 2002. We use Hitachi 3D treatment planning (version 1.6) that can calculate the proton dose distribution by use of the pencil beam algorithm as well as the broad beam algorithm practically fast. This treatment planning software satisfies almost functions required in the proton therapy and includes some advanced techniques such as the 3D region glowing function that can search the target region three-dimensionally based on the CT-values. In this paper, we will introduce this planning system and present our evaluation from point of view of both clinical usage and QA.

• The Journal of Society for e-Business Studies
• /
• v.7 no.1
• /
• pp.75-86
• /
• 2002

In this study, we proposed design issues and structure of a web mining system and develop a system for the purpose of knowledge integration under world wide web environments resulted from our developing experiences. The developed system consists of three main functions： 1) gathering documents utilizing a search agent; 2) determining similarity coefficients between any two documents from term frequencies; 3) clustering documents based on similarity coefficients. It is believed that the developed system can be utilized for discovery of knowledge in relatively narrow domains such as news classification, index term generation in knowledge management.

• Journal of IKEEE
• /
• v.13 no.3
• /
• pp.24-31
• /
• 2009

The computation time of FEA(finite element analysis) for one model may range from a few seconds up to several hours according to the complexity of the simulated model. If these FEA is used to calculate the objective and the constraint functions during the optimal solution search, it causes very excessive execution time. To resolve this problem, the distributed computing technique using internet web service is proposed in this paper. And the dynamic load balancing mechanisms are established to advance the performance of distributed computing. To verify its validity, this method is applied to a traditional mathematical optimization problem. And the proposed FEA-based optimization using internet distributed computing is applied to the optimal design of the permanent magnet dc motor(PMDCM) for automotive application.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.5
• /
• pp.624-629
• /
• 1998

Evolutionary computation techniques can solve search problems using simulated evolution based on the ‘survival of the fittest’. Recently, the genetic programming (GP) which evolves computer programs using the genetic algorithm was introduced. In this paper, the genetic programming technique is used in order to design a rule based controller consisting of condition-action rules for an unknown system. No a priori knowledge about the structure of the controller is needed. Representation of a solution, functions and terminals in GP are analyzed, and a method of constructing a fuzzy logic controller using the obtained rule based controller is described. A simulation example using a nonlinear system shows the validity and efficiency of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1680-1686
• /
• 1995

GAs, effective stochastic search algorithms based on the model of natural evolution and genetics, have been successfully applied to various optimization problems. When population size is not large, GAs often suffer from the phenomenon of premature convergence in which all chromosomes in the population lose the diversity of genes before they find the optimal solution. In this paper, we propose that a new heuristic that maintains the diversity of genes by adding some chromosomes with random mutation and selective mutation into population during evolution. And population size changes dynamically with supplement of new chromosomes. Experimental results for several test functions show that when population size is rather small and the length of chromosome is not long, this method is effective.