• Title/Summary/Keyword: computation

Search Result 8,007, Processing Time 0.032 seconds

ED-FEM multi-scale computation procedure for localized failure

  • Rukavina, Ivan;Ibrahimbegovic, Adnan;Do, Xuan Nam;Markovic, Damijan
    • Coupled systems mechanics
    • /
    • v.8 no.2
    • /
    • pp.111-127
    • /
    • 2019
  • In this paper, we present a 2D multi-scale coupling computation procedure for localized failure. When modeling the behavior of a structure by a multi-scale method, the macro-scale is used to describe the homogenized response of the structure, and the micro-scale to describe the details of the behavior on the smaller scale of the material where some inelastic mechanisms, like damage or plasticity, can be defined. The micro-scale mesh is defined for each multi-scale element in a way to fit entirely inside it. The two scales are coupled by imposing the constraint on the displacement field over their interface. An embedded discontinuity is implemented in the macro-scale element to capture the softening behavior happening on the micro-scale. The computation is performed using the operator split solution procedure on both scales.

Real-time implementation and performance evaluation of speech classifiers in speech analysis-synthesis

  • Kumar, Sandeep
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.82-94
    • /
    • 2021
  • In this work, six voiced/unvoiced speech classifiers based on the autocorrelation function (ACF), average magnitude difference function (AMDF), cepstrum, weighted ACF (WACF), zero crossing rate and energy of the signal (ZCR-E), and neural networks (NNs) have been simulated and implemented in real time using the TMS320C6713 DSP starter kit. These speech classifiers have been integrated into a linear-predictive-coding-based speech analysis-synthesis system and their performance has been compared in terms of the percentage of the voiced/unvoiced classification accuracy, speech quality, and computation time. The results of the percentage of the voiced/unvoiced classification accuracy and speech quality show that the NN-based speech classifier performs better than the ACF-, AMDF-, cepstrum-, WACF- and ZCR-E-based speech classifiers for both clean and noisy environments. The computation time results show that the AMDF-based speech classifier is computationally simple, and thus its computation time is less than that of other speech classifiers, while that of the NN-based speech classifier is greater compared with other classifiers.

A Study on an Intelligent Control of Manufacturing with Dual Arm Robot Based on Neural Network for Smart Factory Implementation (스마트팩토리 실현을 위한 뉴럴네트워크 기반 이중 아암을 갖는 제조용 로봇의 지능제어에 관한 연구)

  • Jung, Kum Jun;Kim, Dong Ho;Kim, Hee Jin;Jang, Gi Wong;Han, Sung Hyun
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.24 no.3
    • /
    • pp.351-361
    • /
    • 2021
  • This study proposes an intelligent control of manufacturing robot with dual arm based on neural network for smart factory implementation. In the control method of robot system, the perspectron structure of single layer based on neural network is useful for simple computation. However, the limitations of computation are emerging in areas that require complex computations. To overcome limitation of complex parameters computation a new intelligent control technology is proposed in this study. The performance is illustrated by simulation and experiments for manufacturing robot dual arm robot with eight axes.

Current Trend and Direction of Deep Learning Method to Railroad Defect Detection and Inspection

  • Han, Seokmin
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.3
    • /
    • pp.149-154
    • /
    • 2022
  • In recent years, the application of deep learning method to computer vision has shown to achieve great performances. Thus, many research projects have also applied deep learning technology to railroad defect detection. In this paper, we have reviewed the researches that applied computer vision based deep learning method to railroad defect detection and inspection, and have discussed the current trend and the direction of those researches. Many research projects were targeted to operate automatically without visual inspection of human and to work in real-time. Therefore, methods to speed up the computation were also investigated. The reduction of the number of learning parameters was considered important to improve computation efficiency. In addition to computation speed issue, the problem of annotation was also discussed in some research projects. To alleviate the problem of time consuming annotation, some kinds of automatic segmentation of the railroad defect or self-supervised methods have been suggested.

Computation Offloading with Resource Allocation Based on DDPG in MEC

  • Sungwon Moon;Yujin Lim
    • Journal of Information Processing Systems
    • /
    • v.20 no.2
    • /
    • pp.226-238
    • /
    • 2024
  • Recently, multi-access edge computing (MEC) has emerged as a promising technology to alleviate the computing burden of vehicular terminals and efficiently facilitate vehicular applications. The vehicle can improve the quality of experience of applications by offloading their tasks to MEC servers. However, channel conditions are time-varying due to channel interference among vehicles, and path loss is time-varying due to the mobility of vehicles. The task arrival of vehicles is also stochastic. Therefore, it is difficult to determine an optimal offloading with resource allocation decision in the dynamic MEC system because offloading is affected by wireless data transmission. In this paper, we study computation offloading with resource allocation in the dynamic MEC system. The objective is to minimize power consumption and maximize throughput while meeting the delay constraints of tasks. Therefore, it allocates resources for local execution and transmission power for offloading. We define the problem as a Markov decision process, and propose an offloading method using deep reinforcement learning named deep deterministic policy gradient. Simulation shows that, compared with existing methods, the proposed method outperforms in terms of throughput and satisfaction of delay constraints.

Improvement of Disparity Map using Loopy Belief Propagation based on Color and Edge (Disparity 보정을 위한 컬러와 윤곽선 기반 루피 신뢰도 전파 기법)

  • Kim, Eun Kyeong;Cho, Hyunhak;Lee, Hansoo;Wibowo, Suryo Adhi;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.5
    • /
    • pp.502-508
    • /
    • 2015
  • Stereo images have an advantage of calculating depth(distance) values which can not analyze from 2-D images. However, depth information obtained by stereo images has due to following reasons: it can be obtained by computation process; mismatching occurs when stereo matching is processing in occlusion which has an effect on accuracy of calculating depth information. Also, if global method is used for stereo matching, it needs a lot of computation. Therefore, this paper proposes the method obtaining disparity map which can reduce computation time and has higher accuracy than established method. Edge extraction which is image segmentation based on feature is used for improving accuracy and reducing computation time. Color K-Means method which is image segmentation based on color estimates correlation of objects in an image. And it extracts region of interest for applying Loopy Belief Propagation(LBP). For this, disparity map can be compensated by considering correlation of objects in the image. And it can reduce computation time because of calculating region of interest not all pixels. As a result, disparity map has more accurate and the proposed method reduces computation time.

ABS ALGORITHMS FOR DIOPHANTINE LINEAR EQUATIONS AND INTEGER LP PROBLEMS

  • ZOU MEI FENG;XIA ZUN QUAN
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.93-107
    • /
    • 2005
  • Based on the recently developed ABS algorithm for solving linear Diophantine equations, we present a special ABS algorithm for solving such equations which is effective in computation and storage, not requiring the computation of the greatest common divisor. A class of equations always solvable in integers is identified. Using this result, we discuss the ILP problem with upper and lower bounds on the variables.

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
    • /
    • v.7 no.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.

The computation algorithm for angular rate using GPS carrier phase (GPS의 반송파 위상을 이용한 각속도 계산 알고리즘)

  • 박준구;김진원;이장규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1338-1341
    • /
    • 1997
  • In this paper, we propose angular rate computation algorithm using GPS carrier phase. A direct angylar rate masurement has not previously been available form GRS, although its availability is highly desirable for use in state feedback control. So we propose angular rate computationalgorithm which derive angular rate from the velocity of differentiated carrier phase og GPS. The proposed algorithm contains attitude determination using double-differentiated carrier phase and 2 baseline configuration whcih provide more practical applications than 3 baseline.

  • PDF

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

  • Park, Ki-Hong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.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