• 대한간호학회지
• /
• 제17권2호
• /
• pp.110-115
• /
• 1987

This study was done in order to help alleviate or prevent the anxiety resulting from cardiac catheterization among adult patients. This goal may be re-ached through providing relaxation techenique to the patients. Such an informativeness would make it possible to establish a basis for comprehensive nursing intervention. The results of this study are summarized as fellows: 1. The first hypothesis:“The experimental group with relaxation informativeness will have less score of state anxiety level before cardiac catheterization than the control group without relaxation informativeness”was accepted. (t=3.72, p=.001). 2. The second hypothesis: “The experimental group with relaxation technique informativeness will have less score of distress level during the procedure than the control group without relaxation technique informativeness”was accepted. (t=2.36, p=.023) 3. Additional analysis; It is seen that most cardiac patients were satisfied with precardiac catheterization procedure information provided by medical teams. (experimental group: 90%, control group: 85%) The relaxation technique informativeness contributed to the decrease of anxiety level. Patients showed interest in reusing the relaxation technique informativeness in the event of further need. In conclusion, the researcher thinks that it is necessary that nurses provide Patients with relaxation technique to reduce the anxiety level with cardiac catheterigation. This will enable them to practice effective comprehensive nursing.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.60-64
• /
• 2001

In this paper, a new learning methodology for Kernel Methods is suggested that results in a sparse representation of kernel space from the training patterns for classification problems. Among the traditional algorithms of linear discriminant function(perceptron, relaxation, LMS(least mean squared), pseudoinverse), this paper shows that the relaxation procedure can obtain the maximum margin separating hyperplane of linearly separable pattern classification problem as SVM(Support Vector Machine) classifier does. The original relaxation method gives only the necessary condition of SV patterns. We suggest the sufficient condition to identify the SV patterns in the learning epochs. Experiment results show the new methods have the higher or equivalent performance compared to the conventional approach.

• 대한전자공학회논문지SD
• /
• 제37권4호
• /
• pp.15-24
• /
• 2000

고유전 커패시터의 유전완화 특성은 시간영역에서 나타나는 커패시터의 동적특성으로 이해될 수 있으며 이것은 DRAM의 재충전 시간동안 충전된 전하를 잃어버리는 가장 주된 요인으로 인식된다. 그러므로 DRAM 동작에 미치는 영향을 고려하기 위하여 고유전 커패시터의 유전완화에 대한 등가회로를 만드는 것이 필수적이다. 그러나 아직까지 등가회로를 만들 수 있는 일반적이고 이론적인 방법이 제시되지 않고 있다. 근 본 연구에서는 고유전 커패시터의 등가회로를 주파수 영역에서 모델링하는 새로운 방법을 개발하였다. 이 방법은 이론적인 체계를 갖춘 일반적인 방법이다. 또한, 본 연구에서는 실험과정을 통해서 이 방법의 타당성으로 확인하였고, 궁극적으로 새로운 방법으로 얻어진 등가회로를 활용하여 유전완화가 DRAM 동작에 미치는 영향을 고찰하였다.

• 대한토목학회논문집
• /
• 제14권3호
• /
• pp.487-493
• /
• 1994

강절(剛節) 뼈대 구조물(構造物)의 해석(解析)에 적용하는 모멘트 분배법은 총조정(總調整) 모멘트라는 개념을 이용하여 연립방정식(聯立方程式)으로 간단히 표현된다. 이 방정식(方程式)은 간단한 손계산기(hand calculator)로 직접 작성되고 쉽게 풀어질 수 있다. 이 방정식(조정방정식(調整方程式))은 무한번의 분배 과정을 완료한 상태를 나타내며 그 해는 소거법(消去法)으로 풀 수도 있으나 일종의 이완방정식(弛緩方程式)으로써 되풀이 산법을 사용하면 간단히 풀어진다. 이 방법이 연속량(連續梁)의 휨 모멘트 계산이나 영향선(影響線) 해석(解析)에 어떻게 이용될 수 있는 지를 두개의 예제로서 설명하였다. 특히 영향선의 해법은 전산에 편리하도록 행렬(行列)로 표현하였다.

• 한국지능시스템학회논문지
• /
• 제11권9호
• /
• pp.817-821
• /
• 2001

본 논문은 분류 문제의 훈련 패턴으로부터 형성되는 커널 공간의 저밀도 표현을 가능하게 하는 커널 방법에 대한 새로운 학습방법론을 제안한다. 선형 판별 함수에 대한 기존의 학습법 중에서 이완 절차가 SVM(Support Vector Machine) 분류기와 동등하게 선형분리 가능 패턴분류 문제의 최대 마진 분리 초평면을 얻을 수 있다. 기존의 이완 절차는 지원 백터에 대한 필요 조건을 만족한다. 본 논문에서는 학습 중 지원 벡터를 확인하기 위한 충분 조건을 제시한다. 순차적 학습을 위하여 기존의 SVM을 확장하고 커널 판별함수를 정의한 후에 체계적인 학습방법을 제시한다. 실험 결과는 새 방법이 기존의 방법과 동등하거나 우수한 분류 성능을 갖고있음을 보여준다.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.250-255
• /
• 2004

In this paper, we established baseline information and insight on residual stress relief mechanism associated with furnaced and local PWHT(post weld heat treatment) operation. Based on FEM analysis results, we suggested that furnaced PWHT stress relief mechanism was based on creep relaxation and local PWHT stress relief mechanism involved complicated interactions between plasticity and creep. In case of furnaced PWHT, significant stress relaxation was occurred in the early stage of PWHT. In case of local PWHT, stress relaxation magnitude was increased as PWHT time increased. Finally, We have proposed that detailed furnaced and local PWHT procedure, and qualification criteria to support current codes of practices.

• 대한전자공학회논문지
• /
• 제24권6호
• /
• pp.1056-1067
• /
• 1987

This paper presents a design procedure for building block integrated circuits that is based on the digraph relaxation model. A set of optimization procedure is prosented for a minimum area and routing-fecsible placement of IC building blocks. Chip area optimization is subject to perimeter and area constraints on the component rectangles in the dissection.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.383-405
• /
• 2004

We study the incomprssible Navier Stokes equations for the flow inside contraction geometry. The governing equations are expressed in the vorticity-stream function formulations. A rectangular computational domain is arised by elliptic grid generation technique. The numerical solution is based on a technique of automatic numerical generation of acurvilinear coordinate system by transforming the governing equation into computational plane. The transformed equations are approximated using central differences and solved simultaneously by successive over relaxation iteration. The time dependent of the vorticity equation solved by using explicit marching procedure. We will apply the technique on several irregular-shapes.

• Management Science and Financial Engineering
• /
• 제18권2호
• /
• pp.13-17
• /
• 2012

Set covering has widely been accepted as a staple tool for feature selection in data mining. We present a generalized version of this classical combinatorial optimization model to make it better suited for the purpose and propose a surrogate relaxation-based procedure for its meta-heuristic solution. Mathematically and also numerically with experiments on 25 set covering instances, we demonstrate the utility of the proposed model and the proposed solution method.