• 제목/요약/키워드: Computation Time

검색결과 3,144건 처리시간 0.035초

실시간 탄도 궤적 목표물 추적을 위한 GPU 기반 병렬적 입자군집최적화 기법 (Parallelized Particle Swarm Optimization with GPU for Real-Time Ballistic Target Tracking)

  • 한윤호;이헌철;권혁훈;최원석;정보라
    • 대한임베디드공학회논문지
    • /
    • 제17권6호
    • /
    • pp.355-365
    • /
    • 2022
  • This paper addresses the problem of real-time tracking a high-speed ballistic target. Particle filters can be considered to overcome the nonlinearity in motion and measurement models in the ballistic target. However, it is difficult to apply particle filters to real-time systems because particle filters generally require much computation time. This paper proposes an accelerated particle filter using graphics processing unit (GPU) for real-time ballistic target tracking. The real-time performance of the proposed method was tested and analyzed on a widely-used embedded system. The comparison results with the conventional particle filter on CPU (central processing unit) showed that the proposed method improved the real-time performance by reducing computation time significantly.

VARIABLE TIME-STEPPING HYBRID FINITE DIFFERENCE METHODS FOR PRICING BINARY OPTIONS

  • Kim, Hong-Joong;Moon, Kyoung-Sook
    • 대한수학회보
    • /
    • 제48권2호
    • /
    • pp.413-426
    • /
    • 2011
  • Two types of new methods with variable time steps are proposed in order to valuate binary options efficiently. Type I changes adaptively the size of the time step at each time based on the magnitude of the local error, while Type II combines two uniform meshes. The new methods are hybrid finite difference methods, namely starting the computation with a fully implicit finite difference method for a few time steps for accuracy then performing a ${\theta}$-method during the rest of computation for efficiency. Numerical experiments for standard European vanilla, binary and American options show that both Type I and II variable time step methods are much more efficient than the fully implicit method or hybrid methods with uniform time steps.

진화 연산을 이용한 실시간 자기동조 학습제어 (The Real-time Self-tuning Learning Control based on Evolutionary Computation)

  • 장성욱;이진걸
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집B
    • /
    • pp.105-109
    • /
    • 2001
  • This paper discuss the real-time self-tuning learning control based on evolutionary computation, which proves its the superiority in the finding of the optimal solution at the off-line learning method. The individuals are reduced in order to learn the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations are proposed. It possible to control the control object varied as time changes. As the state value of the control object is generated, applied evolutionary strategy each sampling time because the learning process of an estimation, selection, mutation in real-time. These algorithms can be applied, the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes.

  • PDF

무기체계 운용가용도 산정 모델에 관한 연구 (A Study on an Operational Availability Computation Model for Weapon Systems)

  • 김혜령;백순흠;최상영
    • 한국국방경영분석학회지
    • /
    • 제35권3호
    • /
    • pp.17-30
    • /
    • 2009
  • 본 연구에서는 무기체계 소요기획 단계에서 목표운용가용도를 산정할 때 활용할 수 있는 운용가용도 계산 모델을 제안한다. 운용가용도 계산 모델은 체계의 운용가용도 계산에 필요한 시간요소 정의와 시간 값 추정 방법으로 구성된다. 운용가용도 계산 시간요소는 총시간과 총비가동시간 요소로 구성된다. 시간요소는 운용형태종합 및 임무유형(OMS/MP : Operational Mode Summary/Mission Profile) 요소를 기초로 정의하였다. 총시간은 전시 작전기간 혹은 평시 365일이며, 총비가동시간은 총예방정비시간, 총고장정비시간, 총행정/군수지연시간으로 구성된다. 그리고 이러한 시간요소에 대하여 무기체계 유형별 시간 값 추정 방법을 제시하였다.

A Hybrid Algorithm to Reduce the Computation Time of Genetic Algorithm for Designing Binary Phase Holograms

  • Nguyen, The-Anh;An, Jun-Won;Choi, Jae-Kwang;Kim, Nam
    • Journal of the Optical Society of Korea
    • /
    • 제7권4호
    • /
    • pp.264-268
    • /
    • 2003
  • A new approach to design binary phase holograms, with less computation time and equal effi-ciency compared with the genetic algorithm method, is proposed. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are tested in computer simulation and experimentally demonstrated.

통신지연이 있는 분산처리의 최적화 (Optimal Distributed Computation with Communication Delays)

  • 김형중;지규인;이장규
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1991년도 하계학술대회 논문집
    • /
    • pp.748-752
    • /
    • 1991
  • Tree network consisting of communicating processors is considered. The objective is to minimize the computation time by distributing the processing load to other nodes. The effect of the order of load distribution on the processing time is addressed. An algorithm which optimally determines the order of load distribution is developed. It is shown that the order depends only on the channel capacity between nodes but not on the computing capability of each node.

  • PDF

FE Analysis of Hybrid Stepping Motor (HSM)

  • Jang Ki-Bong;Lee Ju
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • 제5B권1호
    • /
    • pp.39-42
    • /
    • 2005
  • Though full 3D analysis is the proper method to analyze the hybrid stepping motor (HSM), it has weak points in the areas of computation time and complexity. This paper introduces 2D FEA using a virtual magnetic barrier for the axial cross section to save computation time. For the purpose of 2D FEA, the virtual magnetic barrier and equivalent permanent magnet model of HSM are proposed. This result is compared with that of experimental and 3D analysis, considered as a reference result.

Steered Response Power를 위한 검색 공간 클러스터링 연구 (A Study of Search Space Clustering Algorithm for Steered Response Power)

  • 정재연;육동석
    • 대한음성학회:학술대회논문집
    • /
    • 대한음성학회 2006년도 추계학술대회 발표논문집
    • /
    • pp.88-91
    • /
    • 2006
  • Steered response power(SRP) based algorithm uses a focused beamformer which steers the array to various locations and searches for a peak in output power to localize sound sources. SRP-PHAT, a phase transformed SRP, shows high accuracy, but requires a large amount of computation time. This paper proposes an algorithm that clusters search spaces in advance to reduce computation time of SRP based algorithms.

  • PDF

CGH 생성을 위한 유전알고리즘의 최적화 시간단축 (A new approach to reduce the computation time of Genetic Algorithm for computer- generated holograms)

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • 한국광학회:학술대회논문집
    • /
    • 한국광학회 2003년도 제14회 정기총회 및 03년 동계학술발표회
    • /
    • pp.242-243
    • /
    • 2003
  • A CGH is a hologram generated by computer. It is widely applied to wavefront manipulation, synthesis, optical information processing and interferometer. Some methods have been used to determine the optimum phase pattern to achieve high diffraction efficiency and uniform intensity such as DBS (Direct Binary Search), SA (Simulated Annealing), GA(Genetic Algorithm). These methods require long computation time to generate a hologram. (omitted)

  • PDF

3차원 얼굴인식을 위한 픽셀 대 정점 맵 기반 얼굴 표현방법 (Face Representation Method Using Pixel-to-Vertex Map(PVM) for 3D Model Based Face Recognition)

  • 문현준;정강훈;홍태화
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.1031-1032
    • /
    • 2006
  • A 3D model based face recognition system is generally inefficient in computation time because 3D face model consists of a large number of vertices. In this paper, we propose a novel 3D face representation algorithm to reduce the number of vertices and optimize its computation time.

  • PDF