• 제목/요약/키워드: Optimal computation

검색결과 636건 처리시간 0.023초

Optimizing Energy-Latency Tradeoff for Computation Offloading in SDIN-Enabled MEC-based IIoT

  • Zhang, Xinchang;Xia, Changsen;Ma, Tinghuai;Zhang, Lejun;Jin, Zilong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권12호
    • /
    • pp.4081-4098
    • /
    • 2022
  • With the aim of tackling the contradiction between computation intensive industrial applications and resource-weak Edge Devices (EDs) in Industrial Internet of Things (IIoT), a novel computation task offloading scheme in SDIN-enabled MEC based IIoT is proposed in this paper. With the aim of reducing the task accomplished latency and energy consumption of EDs, a joint optimization method is proposed for optimizing the local CPU-cycle frequency, offloading decision, and wireless and computation resources allocation jointly. Based on the optimization, the task offloading problem is formulated into a Mixed Integer Nonlinear Programming (MINLP) problem which is a large-scale NP-hard problem. In order to solve this problem in an accessible time complexity, a sub-optimal algorithm GPCOA, which is based on hybrid evolutionary computation, is proposed. Outcomes of emulation revel that the proposed method outperforms other baseline methods, and the optimization result shows that the latency-related weight is efficient for reducing the task execution delay and improving the energy efficiency.

반복 변환을 이용한 준최적 프랙탈 부호화 기법 (Sub-optimal fractal Coding Scheme Using Iterative Transformation)

  • 강현수;홍성훈
    • 한국통신학회논문지
    • /
    • 제27권3A호
    • /
    • pp.231-239
    • /
    • 2002
  • 본 논문은 반복적인 부호화 과정을 수행함으로써 준최적 변환 (sub-optimal transformation)을 얻을 수 있는 새로운 프랙탈 부호화 기법에 대해 기술한다. 최적 변환 (optimal transformation)은 원영상과 가장 가까운 끌개(attractor)를 생성시키는 변환으로 정의될 수 있다. 불행히도, 최적 변환을 찾는 것은 과다한 계산량으로 인해 실제적으로 불가능한 것으로 알려져 있다. 그러나, 본 논문에서는 프랙탈 변환 및 끌개에 관련된 몇 가지 새로운 정리들을 통해 특수한 경우에 대해 최적 변환을 얻을 수 있을 뿐만 아니라 좀 더 일반적인 경우에 대해서는 준최적 변환을 얻을 수 있음을 보인다. 그 정리들에 기초한 제안된 방법은 복호화 시 수행하는 반복적인 과정과 유사한 과정을 수행함으로써 준최적 변환을 얻는다. 그래서 제안된 방법은 계산량이 많아지는 단점을 가지지만 복원화질 면에서 우수한 특징을 가진다. 실제 영상에 대한 실험결과는 제안된 방법이 최적 방법에 가까우며, 기존의 방법에 비해 우수함을 입증한다.

조작성에 근거한 스튜엇트 플렛폼의 기구학적 최적설계 (Kinematic Optimal Design of a Stewart Platform based on Dexterity)

  • 김한성;최용제
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1996년도 춘계학술대회 논문집
    • /
    • pp.771-777
    • /
    • 1996
  • In this paper, an optimal design technique for a Stewart platform has been presented considering workspace and dexterity. In the definition of a design objective function, previously suggested dexterity index was used to be maximized. In this optimal design process, the workspace can be used as design constraint when necessary. An algorithm for workspace computation has been briefly described. Finally, optimal desigm results for some example cases have been presented.

  • PDF

A Study on the Convergency Property of the Auxiliary Problem Principle

  • Kim, Balho-H.
    • Journal of Electrical Engineering and Technology
    • /
    • 제1권4호
    • /
    • pp.455-460
    • /
    • 2006
  • This paper presents the convergency property of the Auxiliary Problem Principle when it is applied to large-scale Optimal Power Flow problems with Distributed or Parallel computation features. The key features and factors affecting the convergence ratio and solution stability of APP are also analyzed.

최적경로 추적을 위한 MUSIC 알고리즘의 계산량 감소 기법 (A Computation Reduction Technique of MUSIC Algorithm for Optimal Path Tracking)

  • 김용국;박해규;유흥균
    • 한국통신학회논문지
    • /
    • 제39A권4호
    • /
    • pp.188-194
    • /
    • 2014
  • V2I(Vehicular to Infrastructure) 통신 시스템은 유선으로 연결된 기지국과 이동체간의 통신하는 시스템이다. V2I 통신은 기본적으로 이동체가 빠르게 이동하기 때문에 원하는 통신 성능을 얻기가 어렵다. 이러한 문제점을 극복하기 위해 빔포밍 기술을 이용하여 최적의 경로를 찾는 방식을 통해서 통신 성능을 높일 수 있다. 빔포밍 기술 중 도래각 추정을 위한 MUSIC 알고리즘이 있다. MUSIC 알고리즘은 수신 신호의 방향벡터와 신호부공간의 고유벡터간의 직교하는 성질을 이용해 도래각을 추정하는 알고리즘이다. V2I 통신 환경에서는 최적 경로가 실시간으로 변하기 때문에 MUSIC 알고리즘의 높은 계산 복잡도로 인해 추정 오차가 발생하게 된다. 추정 오차를 줄이기 위해서 MUSIC 알고리즘의 추정 시간을 단축시켜야 한다. 따라서 본 논문에서는 MUSIC 알고리즘의 계산 복잡도를 낮추기 위한 알고리즘을 제안한다.

5축 볼엔드밀 가공 NC 데이터의 최적 공구 길이 계산 (Optimal Tool Length Computation of NC Data for 5-axis Ball-ended Milling)

  • 조현욱;박정환
    • 한국CDE학회논문집
    • /
    • 제15권5호
    • /
    • pp.354-361
    • /
    • 2010
  • The paper presents an efficient computation of optimal tool length for 5-axis mold & die machining. The implemented procedure processes an NC file as an initial input, where the NC data is generated by another commercial CAM system. A commercial CAM system generates 5-axis machining NC data which, in its own way, is optimal based on pre-defined machining condition such as tool-path pattern, tool-axis control via inclination angles, etc. The proper tool-length should also be provided. The tool-length should be as small as possible in order to enhance machinability as well as surface finish. A feasible tool-length at each NC block can be obtained by checking interference between workpiece and tool components, usually when the tool-axis is not modified at this stage for most CAM systems. Then the minimum feasible tool-length for an NC file consisting of N blocks is the maximum of N tool-length values. However, it can be noted that slight modification of tool-axis at each block may reduce the minimum feasible tool-length in mold & die machining. This approach can effectively be applied in machining feature regions such as steep wall or deep cavity. It has been implemented and is used at a molding die manufacturing company in Korea.

Digital Implementation of Optimal Phase Calculation for Buck-Boost LLC Converters

  • Qian, Qinsong;Ren, Bowen;Liu, Qi;Zhan, Chengwang;Sun, Weifeng
    • Journal of Power Electronics
    • /
    • 제19권6호
    • /
    • pp.1429-1439
    • /
    • 2019
  • Buck-Boost LLC (BBLLC) converters based on a PWM + phase control strategy are good candidates for high efficiency, high power density and wide input range applications. Nevertheless, they suffer from large computational complexity when it comes to calculating the optimal phase for ZVS of all the switches. In this paper, a method is proposed for a microcontroller unit (MCU) to calculate the optimal phase quickly and accurately. Firstly, a 2-D lookup table of the phase is established with an index of the input voltage and output current. Then, a bilinear interpolation method is applied to improve the accuracy. Meanwhile, simplification of the phase equation is presented to reduce the computational complexity. When compared with conventional curve-fitting and LUT methods, the proposed method makes the best tradeoff among the accuracy of the optimal phase, the computation time and the memory consumption of the MCU. Finally, A 350V-420V input, 24V/30A output experimental prototype is built to verify the proposed method. The efficiency can be improved by 1% when compared with the LUT method, and the computation time can be reduced by 13.5% when compared with the curve-fitting method.

Energy-Efficient Resource Allocation for Application Including Dependent Tasks in Mobile Edge Computing

  • Li, Yang;Xu, Gaochao;Ge, Jiaqi;Liu, Peng;Fu, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권6호
    • /
    • pp.2422-2443
    • /
    • 2020
  • This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

진화 연산을 이용한 DC 모터 퍼지 제어기 구현 (Implementation of Fuzzy Controller of DC Motor Using Evolutionary Computation)

  • 황기현;김형수;문경준;이화석;박준호;황창선
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1995년도 추계학술대회 논문집 학회본부
    • /
    • pp.189-191
    • /
    • 1995
  • This paper proposes a design of self-tuning fuzzy controller based on evolutionary computation. Optimal membership functions are found by using evolutionary computation. Genetic algorithms and evolution strategy are used for tuning of fuzzy membership function. An arbitrarily speed trajectory is selected to show the performance of the proposed methods. Experiment results show the good performance in the DC motor control system with the self-tuning fuzzy controller based on evolutionary computation.

  • PDF

연산지연을 가진 이산시간 레규레이터에 대한 강인한 안정성 유계 (Robust Stability Bounds for Discrete-Time Regulators with Computation Delays)

  • 배종일
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제22권2호
    • /
    • pp.174-180
    • /
    • 1998
  • Robust stability of discrete-time regulators which utilize state predictors to compensate computation delays is considered. Novel expressions for the return difference matrices and the complementary sensitivity matrices at the input and the output of the regulator are found to obtain simple bounds for unstructured perturbations. Robust stability for pertubations of the system matrix and /or the gain matrix is also considered. under certain restriction on the nominal system simple bounds for the pertubations are obtained directly from the characteristic equation. It is shown that as far as the effect of the computation delays concerns these bounds have explicit relation to those for the unstructured pertubations.

  • PDF