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

검색결과 1,092건 처리시간 0.03초

중간 결과값 연산 모델을 위한 2차원 DCT 구조 (Two-dimensional DCT arcitecture for imprecise computation model)

  • 임강빈;정진군;신준호;최경희;정기현
    • 전자공학회논문지C
    • /
    • 제34C권9호
    • /
    • pp.22-32
    • /
    • 1997
  • This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

  • PDF

확률적 프로세스 트리 생성을 위한 타부 검색 -유전자 프로세스 마이닝 알고리즘 (Tabu Search-Genetic Process Mining Algorithm for Discovering Stochastic Process Tree)

  • 주우민;최진영
    • 산업경영시스템학회지
    • /
    • 제42권4호
    • /
    • pp.183-193
    • /
    • 2019
  • Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

리어 힌지 패널 스템핑의 유한요소해석 (Finite Element Analysis of Auto-body Panel Stamping)

  • 정동원;이장희;양동열
    • 한국소성가공학회:학술대회논문집
    • /
    • 한국소성가공학회 1996년도 자동차부품 제작기술의 진보
    • /
    • pp.97-109
    • /
    • 1996
  • In the present work computations are carried out for analysis of complicated sheet metal forming process such as forming of a rear hinge. Finite element formulation using dynamic explicit time integration scheme and step-wise combined Implicit/Explicit scheme are introduced for numerical analysis of sheet metal forming process. The rigid-plastic finite element method based on membrane elements has long been employed as a useful numerical technique for the analysis of sheet metal forming because of its time effectiveness. The explicit scheme in general use is based on the elastic-plastic modelling of material requiring large computation time. In finite element simulation of sheet metal forming processes, the robustness and stability of computation are important requirements since the computation time and convergency become major points of consideration besides the solution accuracy due to the complexity of geometry and boundary conditions. The implicit scheme employs a more reliable and rigorous scheme in considering the equilibrium at each step of deformation, while in the explicit scheme the problem of convergency is eliminated at the cost of solution accuracy. The explicit approach and the implicit approach have merits and demerits, respectively. In order to combine the merits of these two methods a step-wise combined implicit/explicit scheme has been developed.

초기 쇄파의 수치모사 (Numerical Simulation of Incipient Breaking Waves)

  • 김용직;김선기
    • 대한조선학회논문집
    • /
    • 제39권4호
    • /
    • pp.1-10
    • /
    • 2002
  • 초기쇄파의 수치모사에는 지금까지 경계적분법이 주로 쓰여왔고, 이 방법은 과도한 계산시간의 문제를 제외하고는 어느 정도 성공적이라고 할 수 있다. 본 논문에서는 쇄파실험을 수치모사하기 위한 새로운 수치기법을 보였다. 이 수치기법은 고차 스펙트럴/경계요소법과 경계적분법을 순차적으로 사용하며, 계산시간을 현저히 줄여준다. 조파 및 파 에너지 집중과정은 고차 스펙트럴/경계요소법에 의해 효율적으로 수치모사되고, 파의 전복과정만이 경계적분법에 의해 계산된다. 계산예에서 높은 입자속도와 가속도 등 쇄파의 두드러진 특성이 보여졌다.

병렬처리를 이용한 대규모 동적 시스템의 최적제어 (Optimal Control of Large-Scale Dynamic Systems using Parallel Processing)

  • 박기홍
    • 제어로봇시스템학회논문지
    • /
    • 제5권4호
    • /
    • pp.403-410
    • /
    • 1999
  • In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

  • PDF

병렬 처리를 이용한 용접 공정 유한 요소 해석 (Finite element analysis of welding process by parallel computation)

  • 임세영;김주완;최강혁;임재혁
    • 대한용접접합학회:학술대회논문집
    • /
    • 대한용접접합학회 2003년도 추계학술발표대회 개요집
    • /
    • pp.156-158
    • /
    • 2003
  • An implicit finite element implementation for Leblond's transformation plasticity constitutive equations, which are widely used in welded steel structure is proposed in the framework of parallel computing. The implementation is based upon the multiplicative decomposition of deformation gradient and hyper elastic formulation. We examine the efficiency of parallel computation for the finite element analysis of a welded structure using domain-wise multi-frontal solver.

  • PDF

용접공정 유한요소 해석의 병렬 처리 적용 (Application for parallel computation for finite element analysis of welding processes)

  • 임세영;김주완;최강혁
    • 대한용접접합학회:학술대회논문집
    • /
    • 대한용접접합학회 2004년도 춘계 학술발표대회 개요집
    • /
    • pp.273-275
    • /
    • 2004
  • A parallel multi-frontal solver is developed for finite element analysis of an arc-welding process, which entails phase evolution, heat transfer, and deformations of structure. We verify the code via comparison to a commercial code,SYSWELD. Attention is focused on the implementation of the parallel solver using MPI library, on the speedup by parallel computation, and on the effectiveness of the solver in welding application

  • PDF

선형논리의 통사론 (The syntax of Linear logic)

  • 정계섭
    • 한국수학사학회지
    • /
    • 제25권3호
    • /
    • pp.29-39
    • /
    • 2012
  • 선형논리는 현대 증명이론의 산물로서 1987년 프랑스 Marseille대학 Jean-Yves Girard 교수가 프로그래밍 언어의 개발을 위해 직관주의 논리학 (Intuitional logic) 을 정교하게 보완하여 고안한 새로운 논리학이다. 그래서 선형논리의 연결사들은 정보배열 (Sequentiality)과 병행처리 (Parallel computation) 등 정보처리와 관련된 해석을 갖는다. 예컨대, A${\otimes}$B는 두 과정 A와 B를 차례차례 수행하는 것을 나타내고, A&B는 내적미결정과 관련되어 관찰자가 A 또는 B를 선택할 수 있으며, A${\oplus}$B는 외적인 미결정으로서, 관찰자는 A 또는 B라는 사실을 알지만 어느 것이 될지는 알지 못한다. 그리고 A${\wp}$B는 A과정과 B과정의 병행처리를 의미한다. 선형부정은 동시화(Synchronization)를 나타내어, 하나의 과정 A가 수행되기 위해서는 A와 $A^{\bot}$가 동시에 이루어져야 한다. 국내에 선형논리에 대한 연구가 활성화되지 않아서 이 글은 이에 대한 관심을 제고하기 위해 우선 선형논리의 통사론만을 취급했으며, 의미론과 증명망 등은 차후의 연구에서 다루고자 한다.

A Bayesian Approach for Record Value Statistics Model Using Nonhomogeneous Poisson Process

  • Kiheon Choi;Hee chual Kim
    • Communications for Statistical Applications and Methods
    • /
    • 제4권1호
    • /
    • pp.259-269
    • /
    • 1997
  • Bayesian inference for a record value statistics(RVS) model of nonhomogeneous Poisson process is considered. We seal with Bayesian inference for double exponential, Gamma, Rayleigh, Gumble RVS models using Gibbs sampling and Metropolis algorithm and also explore Bayesian computation and model selection.

  • PDF

기계 구조의 합성적 자동생성을 위한 진화연산 (Evolutionary computation approach for automated synthesis design of mechanical structures)

  • 이인호;차주헌;김재정
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2002년도 춘계학술대회 논문집
    • /
    • pp.643-646
    • /
    • 2002
  • This paper proposes an evolutionary computation approach for automated design of mechanical structures especially in its early stage of design phases. Due to the known characteristics of the stage, the approach basically involves a synthetic design method with the composition of building blocks representing the elements of mechanical objects. In order for the building blocks to be more suitable for representation and evolution of mechanical structures, Elementary Cell Blocks (ECBs) are introduced as new building blocks. A new Darwinian evolution process for the new building blocks is also necessarily involved in the approach. We have demonstrated the implementation of the approach with the design of multi-step gear systems.

  • PDF