• 제목/요약/키워드: Approximate Technique

검색결과 422건 처리시간 0.027초

분할기법을 이용한 직렬 생산라인의 근사화 해석 (Approximate analysis of the serial production lines)

  • 서기성;강재현;이창훈;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.406-410
    • /
    • 1990
  • This paper presents an approximate analysis of the serial production lines using decomposition technique. A serial production line consists of a series of unreliable machines separated by finite buffers. The serial production line is evaluated by approximation method, the results of which are compared with those examined by the discrete time event simulation, based on this approximation method, a gradient technique is proposed, which improves the efficiency of an operation of production line through the re-allocation of buffers.

  • PDF

복합포아송 수요를 갖는 CONWIP 시스템의 주문관점에서의 성능평가 (Order Based Performance Evaluation of a CONWIP System with Compound Poisson Demands)

  • 박찬우;이효성
    • 한국경영과학회지
    • /
    • 제32권1호
    • /
    • pp.137-146
    • /
    • 2007
  • In this study we consider a CONWIP system studied in Park and Lee [1] in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied Immediately are either backordered or lost according to the number of demands that exist at their arrival instants. For this system using the results in [1] we develop an approximation method to calculate order based performance measures such as the mean time of fulfilling a customer order and the mean number of customer orders. To test the accuracy of the approximation method, the results obtained from the approximation method are compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.

X-대역 마이크로 스트? 방향성 결합기의 설계 (Design of X band Microstrip Directional Couplers)

  • 양인응;홍완희
    • 대한전자공학회논문지
    • /
    • 제12권4호
    • /
    • pp.7-14
    • /
    • 1975
  • 본 논문은 대칭 (단자 단로망이론을 근거로 분포정수 회로에 대한 매트릭스식에 의해서 결합기의 결합도와 특성임피던스간의 관계식을 얻어내었고 마이크로스트립 전송선로에 대한 칭전기학적 접근방식에 의해 등각사상법의 적용방식을 밝히고 경계치조건을 만족시키는 특성임피이던스식과 유전체 경계면상에서의 위상속도와 우수모드 및 기수모드 시의 유효유전율의 관계에 의해서 결합영역의 길이를 결정하는 식을 유도하였다. 결과식을 이용하여 원하는 방향성 결합기의 칫수를 콤퓨타 프로그램에 의하여 설계하였으며 설계한 결합기의 칫수에 따라 양면 유전체기판 Custom High K 707L-2.5을 사용하여 7개의 결합기를 제작하였다. 이 제작된 결합기는 실험에 의해서 이론치와 비교 고찰하였으며 10dB에서 20dB까지의 요구되는 결합기는 비교적 좋은 결과를 얻었다. A significant new technique in the dsvelopment of micro-wave circuits is the process of untilization of coupled lines in the transverse electro-magnetic field. The bases for this technique are the application of even-and odd-mode characteristic impedances of the transmission line. This article describes the properties of directional couplers and explains a prccfdure usrd to design micro-strip directional couplers with the aid of the computer. The article also describes the experimental results obtained from seven microstrip couplers, which were built to verify the computer program and the approximate solutions. It can be seen that in cases at X-band where couplings of 10 to 20dB are required, the computer program and approximate solutions will produce good results.

  • PDF

Secure Blocking + Secure Matching = Secure Record Linkage

  • Karakasidis, Alexandros;Verykios, Vassilios S.
    • Journal of Computing Science and Engineering
    • /
    • 제5권3호
    • /
    • pp.223-235
    • /
    • 2011
  • Performing approximate data matching has always been an intriguing problem for both industry and academia. This task becomes even more challenging when the requirement of data privacy rises. In this paper, we propose a novel technique to address the problem of efficient privacy-preserving approximate record linkage. The secure framework we propose consists of two basic components. First, we utilize a secure blocking component based on phonetic algorithms statistically enhanced to improve security. Second, we use a secure matching component where actual approximate matching is performed using a novel private approach of the Levenshtein Distance algorithm. Our goal is to combine the speed of private blocking with the increased accuracy of approximate secure matching.

효율적인 부분 곱 감소를 이용한 고집적·저전력·고속 근사 곱셈기 (Approximate Multiplier with High Density, Low Power and High Speed using Efficient Partial Product Reduction)

  • 서호성;김대익
    • 한국전자통신학회논문지
    • /
    • 제17권4호
    • /
    • pp.671-678
    • /
    • 2022
  • 근사 컴퓨팅은 정확한 결과 대신에 허용 가능한 정도의 부정확한 결과를 도출하는 연산 기법이다. 근사 곱셈은 고성능, 저전력 컴퓨팅을 위한 근사 컴퓨팅 방식 중 하나이다. 본 논문에서는 근사 4-2 compressor와 향상된 전가산기를 사용하여 고집적·저전력·고속 근사 곱셈기를 제안하였다. 근사 4-2 compressor를 사용한 근사 곱셈기는 정확, 근사, 상수 수정 영역의 3개 영역으로 구성되어 있으며, 효율적인 부분 곱 감소 방식을 적용하여 각 영역의 크기를 조절하면서 성능을 비교하였다. 제안한 근사 곱셈기는 Verilog HDL로 설계하였고, 25nm CMOS 공정에서 Synopsys Design Compiler(DC)를 이용하여 면적, 전력, 지연시간을 분석하였으며, 기존의 근사 곱셈기에 비해 면적을 10.47%, 전력을 26.11%, 지연시간을 13% 줄였다.

인터넷 기반 근사 형상최적설계의 분산처리 (Distributed Process of Approximate Shape Optimization Based on the Internet)

  • 임오강;최은호;김우현
    • 한국전산구조공학회논문집
    • /
    • 제21권4호
    • /
    • pp.317-324
    • /
    • 2008
  • 대형 구조물에 대한 최적설계를 고려할 때 구조해석에 많은 시간과 노력이 소비된다. 한대의 개인용 컴퓨터에 의한 대형 구조물의 구조해석은 대용량의 기억장치와 많은 계산시간이 요구되므로 반복적 해석이 필요한 대형 구조물의 설계에 효율적으로 이용되기 어렵다. 따라서 본 논문에서는 이러한 문제의 대안으로 인터넷이 연결된 다수의 개인용 컴퓨터들로 고성능 병렬연산시스템을 구성하여 구조해석을 분산 처리하여 계산시간을 절감하였다. 아울러 반응표면의 근사를 위해 요구되는 구조해석을 상용 구조해석 어플리케이션으로 해결할 수 있다면 상용성이 확보되어 일반 구조물에 대하여도 반응표면법을 이용한 최적설계를 수행할 수 있을 것이다.

Area and Power Efficient VLSI Architecture for Two Dimensional 16-point Modified Gate Diffusion Input Discrete Cosine Transform

  • Thiruveni, M.;Shanthi, D.
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제16권4호
    • /
    • pp.497-505
    • /
    • 2016
  • The two-dimensional (2D) Discrete Cosine Transform (DCT) is used widely in image and video processing systems. The perception of human visualization permits us to design approximate rather than exact DCT. In this paper, we propose a digital implementation of 16-point approximate 2D DCT architecture based on one-dimensional (1D) DCT and Modified Gate Diffusion Input (MGDI) technique. The 8-point 1D Approximate DCT architecture requires only 12 additions for realization in digital VLSI. Additions can be performed using the proposed 8 transistor (8T) MGDI Full Adder which reduces 2 transistors than the existing 10 transistor (10T) MGDI Full Adder. The Approximate MGDI 2D DCT using 8T MGDI Full adders is simulated in Tanner SPICE for $0.18{\mu}m$ CMOS process technology at 100MHZ.The simulation result shows that 13.9% of area and 15.08 % of power is reduced in the 8-point approximate 2D DCT, 10.63 % of area and 15.48% of power is reduced in case of 16-point approximate 2D DCT using 8 Transistor MGDI Full Adder than 10 Transistor MGDI Full Adder. The proposed architecture enhances results in terms of hardware complexity, regularity and modularity with a little compromise in accuracy.

Shape Optimization Technique for Thin Walled Beam of Automotive Structures Considering Vibration

  • Lee, Sang-Beom;Yim, Hong-Jae;Pyun, Sung-Don
    • The Journal of the Acoustical Society of Korea
    • /
    • 제21권2E호
    • /
    • pp.63-70
    • /
    • 2002
  • In this paper, an optimization technique for thin walled beams of vehicle body structure is proposed. Stiffness of thin walled beam structure is characterized by the thickness and typical section shape of the beam structure. Approximate functions for the section properties such as area, area moment of inertia, and torsional constant are derived by using the response surface method. The approximate functions can be used for the optimal design of the vehicle body that consists of complicated thin walled beams. A passenger car body structure is optimized to demonstrate the proposed technique.

Fault-tree 확률계산을 위한 근사적 방법 (An approximate approach for Computing Fault-tree probabilities)

  • 이근희;이동형
    • 품질경영학회지
    • /
    • 제18권2호
    • /
    • pp.25-32
    • /
    • 1990
  • This paper presents an approximate algorithm for computing Fault-tree probabilities. The method is essentially composed of three steps. In the first step, a Fault-tree is converted into a network form. In the second step, We change the network into a parallelized diagram. In the third step, the approximate fault-tree probability is calculated from the parallelized diagram. In this paper, in order to verify the method two hypothetical Fault-tree is used by examples. The results show that the method is very useful, even though it is an approximate technique, since it needs not to search the minimal cut sets and has the simple computing rontines.

  • PDF

모드중첩법에 의한 고유모드의 유효성 및 연속체 근사 고유모드의 적용에 관한 연구 (A Study on the Effectiveness of Eigen Modes by Modal Analysis and Application of Approximate Eigen Modes for Continuum)

  • 김진기;문창훈;한상을
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1997년도 가을 학술발표회 논문집
    • /
    • pp.270-278
    • /
    • 1997
  • The purpose of this paper is to evaluate the effectiveness of eigen modes by modal analysis and the application of approximate eigen modes for continuum. This study proposes the appropriate selection technique of eigen modes by modal analysis and the method for the reasonable survey of post-buckling path. And the buckling characteristics of a latticed dome is studied by the application of these approximate eigen modes which have sufficient accuracy and praticallity for response analysis in symmetric and anti-symmetric state of continuous shell. To prove the effectiveness of eigen modes and application of approximate eigen modes for continuum, these results are compared with those of direct method.

  • PDF