• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.42.2-42
• /
• 2002

We discuss a neural network solver for the inverse optimization problem. The problem is that find functional relations between input and output data, which are include defects. Finding the relations, predictions of the defect parts are also required. The part of finding the defects in the input data is an inverse problem . We consider the meanings to solve the problem on the neural network system at first. Next, we consider the network structure of the system, the learning scheme of the network, and at last, examine the precision on the numerical calculations. In the paper, we proposed the high-precision learning method for plural three-layer neural network system that is series-connect...

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.727-734
• /
• 1999

Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.76-80
• /
• 2003

The procedure of finding operating conditions minimizing qualify loss is proposed with a real industry example. The procedure consists or major two parts - the selection or process variables critical to the response and He determination or operating conditions. The coefficients or ridge regression and the and stores or partial least squares are applied to select important process variables. Functional approach and Non-functional approach are used to find proper operating conditions of important process variables.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.468-471
• /
• 2003

The A＊ algorithm is usually used in game programming, mainly because it is fast in finding a optimal path to goal. In this paper. This algorithm was utilized for path finding, HIMM(Histogramic In-Motion Mapping) method is used in map-building. Map is updated continuously with range data sampled by PSD sensors From the map, A＊ algorithm finds a optimal path and sends subsequently the most suitable point to the Eyebot. A＊ algorithm has been tested on the Eyebot in various unknown maps of unknown and proved to work well. It could escape the local minimum, also.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1998년도 춘계학술대회 논문집
• /
• pp.274-280
• /
• 1998

The welding technology and qualities are developed significantly, in recent years, in the use of automated processing technology and welding robot systems. But these automated welding technologies have many difficulties for finding the optimal welding parameter conditions. Because of the lack of mathematical model for determination of optimal welding process parameters. In this study, the sensitivity analysis of the empirical equations for finding weld bead width, height and penetration depth by using the published formulae. The selected major welding process parameters effected to weld bead geometries are the welding speed, current, voltage and weld wire diameter.

• 한국공간정보시스템학회:학술대회논문집
• /
• 한국공간정보시스템학회 2004년도 춘계 학술발표회 논문집 제1권1호(통권1호)
• /
• pp.230-237
• /
• 2004

In this study, equation of finite element is formulated to analyze relations of large deformation-small deformation considering geometrical nonlinear for membrane structure. Total Lagrangian Formulation(TLF) is introduced to formulate theory and equation of motion considering Triangular Constant Strain(TCS) element in finite, element analysis is formulated. Finite element program is made by equation of motion considering TLF. This study analyzed a variety of examples, so compared with the past results.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1986년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 17-18 Oct. 1986
• /
• pp.383-386
• /
• 1986

In this paper, ultrasonic range finding module for the self-contained robot, INHAE-1, is presented. This system is processed, using Z-80 microprocessor, a much of information on the surrounding condition in real time and is realted a sensor for many side data acqusition with a stepping motor. Also this system can obtain the more correct edge of the obstacle using the standard deviation of the least-square method. In this experiment, it gives more correct information to mobile robot of the blind guidance and improves the orientation of the robot path.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.199-202
• /
• 2003

In the research for Unmaned Air Vehicles(UAVs), the use of Vision-sensor has been increased. It is possible to calculate the position information of air vehicle by finding a horizontal line. In this paper, we proposed a vision-based algorithm for finding the horizontal line. Experimental results show that the proposed algorithm is faster than an existing algorithm.

• 가정과삶의질연구
• /
• 제15권3호
• /
• pp.83-94
• /
• 1997

This article aims to investigate the perceptions of mistreatment of elderly among the married men and women. The subjects of this study are 291 married men and women. The major finding is that the increased stress of caregiver may lead to elder abuse of neglect. According to the above finding, it may be appropriate to offer various assistance to the suspected abuser. That is, education, couseling and social support services may help alleviate the caregiving stress contributing to the mistreatment.

• 대한수학회지
• /
• 제31권3호
• /
• pp.477-492
• /
• 1994

For the eigenvalue problem of $Au = \lambda u$ where A is considered as a semi-bounded self-adjoint operator on a Hilbert space, we are used to apply two complentary methods finding upper bounds and lower bounds to the eigenvalues. The most popular method for finding upper bounds may be the Rayleigh-Ritz method which was developed in the 19th century while a method for computing lower bounds may be the method of intermediate eigenvalue problems which has been developed since 1950's. In the method of intermediate eigenvalue problems (IEP), we consider the original operator eigenvalue problem as a perturbation of a simpler, resolvable, self-adjoint eigenvalue problem, called a base problem, that gives rough lower bounds.