• Title/Summary/Keyword: Fast Computation

Search Result 750, Processing Time 0.032 seconds

Calculation of Intersection between Z-map Vectors and Circularly Moving Filleted-end Mills (원호운동 필렛 엔드밀과 Z-맵 벡터의 교점 계산)

  • 맹승렬;백낙훈;신성용;최병규
    • Korean Journal of Computational Design and Engineering
    • /
    • v.8 no.4
    • /
    • pp.278-288
    • /
    • 2003
  • Presented in this paper is a numerical method for calculating the intersection points between Z-map vectors and the tool swept surface for circularly moving filleted-end mills. In numerically controlled(NC) machining simulation for large moulds and dies, a workpiece is frequently approximated as a set of z-axis aligned vectors, called Z-map vectors, and then the machining processes can be simulated through updating the Z-map with the intersection points. Circular motions are typically used for machining the free-form surfaces. For fast computation, we express each of intersection points with a single-variable non-linear equation and calculate the candidate interval in which the unique solution exists. Then, we prove the existence of a solution and its uniqueness in this candidate interval. Based on these properties, we can effectively apply numerical methods to finally calculate the solution of the nonlinear equation within a given precision. Experimental results are given for the case of a TV monitor and the hood of a car.

Inversion of Spread-Direction and Alternate Neighborhood System for Cellular Automata-Based Image Segmentation Framework

  • Lee, Kyungjae;Lee, Junhyeop;Hwang, Sangwon;Lee, Sangyoun
    • Journal of International Society for Simulation Surgery
    • /
    • v.4 no.1
    • /
    • pp.21-23
    • /
    • 2017
  • Purpose In this paper, we proposed alternate neighborhood system and reverse spread-direction approach for accurate and fast cellular automata-based image segmentation method. Materials and Methods On the basis of a simple but effective interactive image segmentation technique based on a cellular automaton, we propose an efficient algorithm by using Moore and designed neighborhood system alternately and reversing the direction of the reference pixels for spreading out to the surrounding pixels. Results In our experiments, the GrabCut database were used for evaluation. According to our experimental results, the proposed method allows cellular automata-based image segmentation method to faster while maintaining the segmentation quality. Conclusion Our results proved that proposed method improved accuracy and reduced computation time, and also could be applied to a large range of applications.

Discrete Cosine Transform Algorithms for the VLSI Parallel Implementation (VLSI 병렬 연산을 위한 여현 변환 알고리듬)

  • 조남익;이상욱
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.7
    • /
    • pp.851-858
    • /
    • 1988
  • In this paper, we propose two different VLSI architectures for the parallel computation of DCT (discrete cosine transform) algorithm. First, it is shown that the DCT algorithm can be implemented on the existing systolic architecture for the DFT(discrete fourier transform) by introducing some modification. Secondly, a new prime factor DCT algorithm based on the prime factor DFT algorithm is proposed. And it is shown that the proposed algorihtm can be implemented in parallel on the systolic architecture for the prime factor DFT. However, proposed algorithm is only applicable to the data length which can be decomposed into relatively prime and odd numbers. It is also found that the proposed systolic architecture requires less multipliers than the structures implementing FDCT(fast DCT) algorithms directly.

  • PDF

Specialized VLSI System Design for the Generalized Hough Transform (일반화된 Hough 변환을 위한 특수 목적 VLSI 시스템 설계에 관한 연구)

  • 채옥삼;이정헌
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.3
    • /
    • pp.66-76
    • /
    • 1995
  • In this research, a mesh connected VLSI structure is proposed for the real time computation of the generalized Hough transform(GHT). The purpose of the research is to design a generalized Hough transformer that can be realized as a single chip processor. The GHT has been modified to yield a highly parallel structure consisting of simple processing elements(PEs) and communication networks. In the proposed structure, the GHT can be computed by first assigning an image pixel to a PE and performing shift and add operations. The result of the CAD circuit simulation shows that it can be computed in the time proportional to the number of pixels in the pattern. In addition to the Hough transformer, the peak detector has been designed to reduce 1)the number of the I/O operations between the transformer and the host computer and 2) the host computer's burden for peak detection by transmitting only the local peaks detected from the transformed accumulator. It is expected that the proposed single chip Hough transformer with peak detector makes a fast and inexpensive edge based object recognition systems possible for many industrial and military applications.

  • PDF

Simulation Optimization for Optimal at Design of Stochastic Manufacturing System Using Genetic Algorithm (추계적 생산시스템의 최적 설계를 위한 전자 알고리즘을 애용한 시뮬레이션 최적화 기법 개발)

  • 이영해;유지용;정찬석
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.1
    • /
    • pp.93-108
    • /
    • 2000
  • The stochastic manufacturing system has one or more random variables as inputs that lead to random outputs. Since the outputs are random, they can be considered only as estimates of the true characteristics of the system. These estimates could greatly differ from the corresponding real characteristics for the system. Multiple replications are necessary to get reliable information on the system and output data should be analyzed to get optimal solution. It requires too much computation time practically, In this paper a GA method, named Stochastic Genetic Algorithm(SGA) is proposed and tested to find the optimal solution fast and efficiently by reducing the number of replications.

  • PDF

Multi-party Password-Authenticated Key Exchange Scheme with Privacy Preservation for Mobile Environment

  • Lu, Chung-Fu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.5135-5149
    • /
    • 2015
  • Communications among multi-party must be fast, cost effective and secure. Today's computing environments such as internet conference, multi-user games and many more applications involve multi-party. All participants together establish a common session key to enable multi-party and secure exchange of messages. Multi-party password-based authenticated key exchange scheme allows users to communicate securely over an insecure network by using easy-to-remember password. Kwon et al. proposed a practical three-party password-based authenticated key exchange (3-PAKE) scheme to allow two users to establish a session key through a server without pre-sharing a password between users. However, Kwon et al.'s scheme cannot meet the security requirements of key authentication, key confirmation and anonymity. In this paper, we present a novel, simple and efficient multi-party password-based authenticated key exchange (M-PAKE) scheme based on the elliptic curve cryptography for mobile environment. Our proposed scheme only requires two round-messages. Furthermore, the proposed scheme not only satisfies security requirements for PAKE scheme but also achieves efficient computation and communication.

Prediction of received power and delay speread in urban cross-roads for microcell design (마이크로셀 설계를 위한 도심지 교차로의 수신전력과 지연확산 예측)

  • 정백호;김채영;김한호
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.11
    • /
    • pp.78-87
    • /
    • 1996
  • in urban cross-roads with dense buildings, receiving power and delay spread were computed when doing these, we were able to develope codes to be executed in a very fast time by combining image method and algorithm for propagation paths compairing with ray launching technique. And receiving power and delay spread could be viewed in 3-dimensional picture by virtue of computing electric fields in arbitrary receiving point. For numerical computation, receiving power of wide and anrrow band and delay spread were computed, and extension method of ray numbers was facilitated for handling infinite number of rays.

  • PDF

Convergence Acceleration of the LMS Algorithm Using Successive Data Orthogonalization (입력 신호의 연속적인 직교화를 통한 LMS 알고리즘의 수렴 속도 향상)

  • Shin, Hyun-Chool
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.90-94
    • /
    • 2008
  • It is well-blown that the convergence rate gets worse when an input signal to an adaptive filter is correlated. In this paper we propose a new adaptive filtering algorithm that makes the convergence rate much improved even for highly correlated input signals. By introducing an orthogonal constraint between successive input signal vectors we overcome the slow convergence problem of the LMS algorithm with the correlated input signal. Simulation results show that the proposed algerian yields fast convergence speed and excellent tracking capability under both time-invariant and time-varying environments, while keeping both computation and implementation simple.

The analysis of flow over the bridge using preconditioned Navier-Stokes code (예조건화 Navier-Stokes 코드를 이용한 교각 유동해석)

  • Yoo, Il-Yong;Lee, Seung-Soo;Park, Si-Hyong
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2008.03b
    • /
    • pp.13-16
    • /
    • 2008
  • After the collapse of the Tacoma bay bridge at Tacoma Washington, the accurate prediction of aerodynamics became crucial to the sound design of bridges. CFD(Computational Fluid Dynamics) becomes important tool for the prediction on wind effects on the bridge due to the recent development of CFD. The usage of CFD is further prompted by the advantages in using CFD, such as low-cost and fast feed-back of design. In this paper, an unsteady compressible Reynolds averaged Navier-Stokes code is used for the computation of the flow over bridges. Coakley's ��q-${\omega}$ �� two-equation turbulence model is used for the turbulent eddy viscosity. For accurate and stable computations, the local preconditioning method is adapted to the code. Aerodynamic characteristics of a couple bridges are presented to show the validity and the accuracy of the method.

  • PDF

Design of a real Time Adaptive Controller for Industrial Robot Using Digital Signal Processor (디지털 신호처리기를 사용한 산업용 로봇의 실시간 적응제어기 설계)

  • 최근국
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.154-161
    • /
    • 1999
  • This paper presents a new approach to the design of adaptive control system using DSPs(TMS320C30) for robotic manipulators to achieve trajectory tracking by the joint angles. Digital signal processors are used in implementing real time adaptive control algorithms to provide an enhanced motion control for robotic manipulators. In the proposed control scheme, adaptation laws are derived from the improved Lyapunov second stability analysis method based on the adaptive model reference control theory. The adaptive controller consists of an adaptive feedforward controller, feedback controller, and PID type time-varying auxillary control elements. The proposed adaptive control scheme is simple in structure, fast in computation, and suitable for implementation of real-time control. Moreover, this scheme does not require an accurate dynamic modeling, nor values of manipulator parameters and payload. Performance of the adaptive controller is illustrated by simulation and experimental results for a SCARA robot.

  • PDF