• 제목/요약/키워드: Approximation Order

검색결과 1,077건 처리시간 0.027초

크리깅 근사모델을 이용한 마이크로 자이로스코프의 구조설계 (A Structural Design of Microgyroscope Using Kriging Approximation Model)

  • 김종규;이권희
    • 한국기계가공학회지
    • /
    • 제7권4호
    • /
    • pp.149-154
    • /
    • 2008
  • The concept of robust design was introduced by Dr. G. Taguchi in the late 1940s, and his technique has become commonly known as the Taguchi method or the robust design. In this research, a robust design procedure for microgyroscope is suggested based on the kriging and optimization approaches. The kriging interpolation method is introduced to obtain the surrogate approximation model of true function. Robustness is calculated by the kriging model to reduce real function calculations. For this, objective function is represented by the probability of success, thus facilitating robust optimization. The statistics such as mean and variance are obtained based on the reliable kriging model and the second-order statistical approximation method.

  • PDF

다각 근사화된 그리퍼 영상을 이용한 로봇의 위치 정렬 (Pose alignment control of robot using polygonal approximated gripper images)

  • 박광호;김남성;기석호;기창두
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 추계학술대회논문집A
    • /
    • pp.559-563
    • /
    • 2000
  • In this paper we describe a method for aligning a robot gripper using image information. The region of gripper is represented from HSI color model that has major advantage of brightness independence. In order to extract the feature points for vision based position control, we find the corners of gripper shape using polygonal approximation method which determines the segment size and curvature of each points. We apply the vision based scheme to the task of alignment of gripper to reach the desired position by 2 RGB cameras. Experiments are carried out to exhibit the effectiveness of vision based control using feature points from polygonal approximation of gripper.

  • PDF

Exponentially Fitted Error Correction Methods for Solving Initial Value Problems

  • Kim, Sang-Dong;Kim, Phil-Su
    • Kyungpook Mathematical Journal
    • /
    • 제52권2호
    • /
    • pp.167-177
    • /
    • 2012
  • In this article, we propose exponentially fitted error correction methods(EECM) which originate from the error correction methods recently developed by the authors (see [10, 11] for examples) for solving nonlinear stiff initial value problems. We reduce the computational cost of the error correction method by making a local approximation of exponential type. This exponential local approximation yields an EECM that is exponentially fitted, A-stable and L-stable, independent of the approximation scheme for the error correction. In particular, the classical explicit Runge-Kutta method for the error correction not only saves the computational cost that the error correction method requires but also gives the same convergence order as the error correction method does. Numerical evidence is provided to support the theoretical results.

연속음성에서 천이구간의 탐색, 추출, 근사합성에 관한 연구 (A Study on a Searching, Extraction and Approximation-Synthesis of Transition Segment in Continuous Speech)

  • 이시우
    • 한국정보처리학회논문지
    • /
    • 제7권4호
    • /
    • pp.1299-1304
    • /
    • 2000
  • In a speed coding system using excitation source of voiced and unvoiced, it would be involved a distortion of speech quality in case coexist with a voiced and an unvoiced consonants in a frame. So, I propose TSIUVC(Transition Segment Including UnVoiced Consonant) searching, extraction ad approximation-synthesis method in order to uncoexistent with a voiced and unvoiced consonants in a frame. This method based on a zerocrossing rate and pitch detector using FIR-STREAK Digital Filter. As a result, the extraction rates of TSIUVC are 84.8% (plosive), 94.9%(fricative), 92.3%(affricative) in female voice, and 88%(plosive), 94.9%(fricative), 92.3%(affricative) in male voice respectively, Also, I obain a high quality approximation-synthesis waveforms within TSIUVC by using frequency information of 0.547kHz below and 2.813kHz above. This method has the capability of being applied to speech coding of low bit rate, speech analysis and speech synthesis.

  • PDF

단일계단 지형에서 변분근사법과 고유함수 전개법에 의한 파랑변형 비교 (Comparison between Variational Approximation and Eigenfunction Expansion Method for Wave Transformation over a Step Bottom)

  • 서승남
    • 한국해안·해양공학회논문집
    • /
    • 제21권2호
    • /
    • pp.91-107
    • /
    • 2009
  • 단일 계단지형 위를 지나는 선형 파랑의 변형을 계산하기 위해 변분근사법과 고유함수 전개법을 사용하였다. 이들 수치해를 비교에서 반사율과 투과율 그리고 해면변위는 거의 일치한다. 그러나 계단 경계에서 유속 정합조건이 부여되었음에도 불구하고 계산된 x방향 유속의 수직구조는 차이를 보인다.

점 데이타의 Rational B-spline 근사를 통한 역공학 (Rational B-spline Approximation of Point Data For Reverse Engineering)

  • 이현직;고태조;김희술
    • 한국정밀공학회지
    • /
    • 제16권5호통권98호
    • /
    • pp.160-168
    • /
    • 1999
  • This paper describes one method of reverse engineering that machines a free form shape without descriptive model. A portable five-axes 3D CMM was used to digitize point data from physical model. After approximation by rational B-spline curve from digitized point data of a geometric shape, a surface was constructed by the skinning method of the cross-sectional design technique. Since a surface patch was segmented by fifteen part, surface merging was also implemented to assure the surface boundary continuity. Finally, composite surface was transferred to commercial CAD/CAM system through IFES translation in order to machine the modeled geometric shape.

  • PDF

웨이블렛 영역에서 근사 계수의 증감정보를 이용한 블라인드 워터마크 (A Blind Watermarking Technique Using Difference of Approximation Coefficients in Wavelet Domain)

  • 윤혜진;최태선
    • 대한전자공학회논문지SP
    • /
    • 제41권2호
    • /
    • pp.65-72
    • /
    • 2004
  • 본 논문에서는 강인성과 인지성을 함께 발전시킨 블라인드 워터마킹 방법에 대해 언급한다. 워터마크의 삽입 위치를 선정하기 위해 영상을 이산 웨이블렛 변환한 후 이웃한 관사 계수간의 증감 정보를 이용한다. 제안된 방법을 시험하기 위해 실험 영상에 워터마크를 삽입한 후 JPEG 손실 압축과 여러 필터의 적용과 같은 변형을 가하여 삽입한 워터마크를 다시 찾아내는 실험을 실시한다. 실험 결과는 제안된 워터마킹 방법이 비인지성을 유지하면서도 여러 가지 공격(attack)에 강인함을 보여준다.

실험계획법과 크리깅 근사모델에 의한 게이트밸브 최적화 (Optimization of a Gate Valve using Design of Experiments and the Kriging Based Approximation Model)

  • 강정호;강진;박영철
    • 한국공작기계학회논문집
    • /
    • 제14권6호
    • /
    • pp.125-131
    • /
    • 2005
  • The purpose of this study is an optimization of gate valve made by forging method instead of welding method. In this study, we propose an optimal shape design to improve the mechanical efficiency of gate valve. In order to optimize more efficiently and reliably, the meta-modeling technique has been developed to solve such a complex problems combined with the DACE (Design and Analysis of Computer Experiments). The DACE modeling, known as the one of Kriging interpolation, is introduced to obtain the surrogate approximation model of the function. Also, we prove reliability of the DACE model's application to gate valve by computer simulations using FEM(Finite Element Method).

전동기 제어시스템 기계정수의 점근적 추정에 관한 연구 (A Study on Successive Approximation Measurement of Mechanical Parameters for Motor Control System)

  • 안종건;박승규;안호균
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2001년도 전력전자학술대회 논문집
    • /
    • pp.138-141
    • /
    • 2001
  • This paper presents a study on successive approximation measurement of mechanical parameters for motor control system. At the first step of servo system installation, control system gain tuning is troublesome work. Recently, autotuning method of motion controller for motor drive system is based on parameter measurement and identification. On the case of first order mechanical system (mechanical parameters are modified by simple inertia and friction), it is necessary for good response to get the accurate measurement or identification of the mechanical parameters . In this paper, novel method applies the binary successive approximation measurement to the inertia and friction coefficient. Computer simulation and experiment for the proposed method will show verification of accuracy and usefulness.

  • PDF

Approximation Algorithms for Scheduling Parallel Jobs with More Machines

  • Kim, Jae-Hoon
    • Journal of information and communication convergence engineering
    • /
    • 제9권4호
    • /
    • pp.471-474
    • /
    • 2011
  • In parallel job scheduling, each job can be executed simultaneously on multiple machines at a time. Thus in the input instance, a job $J_i$ requires the number $m_i$ of machines on which it shall be processed. The algorithm should determine not only the execution order of jobs but also the machines on which the jobs are executed. In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem. We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.