• Title/Summary/Keyword: Differential Search Algorithm

Search Result 54, Processing Time 0.029 seconds

Calibration of flush air data sensing systems for a satellite launch vehicle

  • Mehta, R.C.
    • Advances in aircraft and spacecraft science
    • /
    • v.9 no.1
    • /
    • pp.1-15
    • /
    • 2022
  • This paper presents calibration of flush air data sensing systems during ascent period of a satellite launch vehicle. Aerodynamic results are numerically computed by solving three-dimensional time dependent compressible Euler equations over a payload shroud of a satellite launch vehicle. The flush air data system consists of four pressure ports flushed on a blunt-cone section of the payload shroud and connected to on board differential pressure transducers. The inverse algorithm uses calibration charts which are based on computed and measured data. A controlled random search method coupled with neural network technique is employed to estimate pitch and yaw angles from measured transient differential pressure history. The algorithm predicts the flow direction stepwise with the function of flight Mach numbers and can be termed as an online method. Flow direction of the launch vehicle is compared with the reconstructed trajectory data. The estimated values of the flow direction are in good agreement with them.

Differential Fault Attack on SSB Cipher (SSB 암호 알고리즘에 대한 차분 오류 공격)

  • Kang, HyungChul;Lee, Changhoon
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.1
    • /
    • pp.48-52
    • /
    • 2015
  • In this paper, we propose a differential fault analysis on SSB having same structure in encryption and decryption proposed in 2011. The target algorithm was designed using advanced encryption standard and has advantage about hardware implementations. The differential fault analysis is one of side channel attacks, combination of the fault injection attacks with the differential cryptanalysis. Because SSB is suitable for hardware, it must be secure for the differential fault analysis. However, using proposed differential fault attack in this paper, we can recover the 128 bit secret key of SSB through only one random byte fault injection and an exhausted search of $2^8$. This is the first cryptanalytic result on SSB having same structure in encryption and decryption.

A Study on Optimal Operation Method of Multiple Microgrid System Considering Line Flow Limits (선로제약을 고려한 복수개의 마이크로그리드 최적운영 기법에 관한 연구)

  • Park, Si-Na;An, Jeong-Yeol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.7
    • /
    • pp.258-264
    • /
    • 2018
  • This paper presents application of a differential search (DS) meta-heuristic optimization algorithm for optimal operation of a micro grid system. The DS algorithm simulates the Brownian-like random-walk movement used by an organism to migrate. The micro grid system consists of a wind turbine, a diesel generator, a fuel cell, and a photovoltaic system. The wind turbine generator is modeled by considering the characteristics of variable output. Optimization is aimed at minimizing the cost function of the system, including fuel costs and maximizing fuel efficiency to generate electric power. The simulation was applied to a micro grid system only. This study applies the DS algorithm with excellence and efficiency in terms of coding simplicity, fast convergence speed, and accuracy in the optimal operation of micro grids based on renewable energy resources, and we compared its optimum value to other algorithms to prove its superiority.

Optimum Design of Piled Raft Foundations using Genetic Algorithm (유전자 알고리즘을 이용한 Piled Raft 기초의 최적설계)

  • 김홍택;강인규;황정순;전응진;고용일
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 1999.10a
    • /
    • pp.415-422
    • /
    • 1999
  • This paper describes a new optimum design approach for piled raft foundations using the genetic algorithm. The objective function considered is the cost-based total weight of raft and piles. The genetic algorithm is a search or optimization technique based on nature selection. Successive generation evolves more fit individuals on the basis of the Darwinism survival of the fittest. In formulating the genetic algorithm-based optimum design procedure, the analysis of piled raft foundations is peformed based on the 'hybrid'approach developed by Clancy(1993), and also the simple genetic algorithm proposed by the Goldberg(1989) is used. To evaluate a validity of the optimum design procedure proposed based on the genetic algorithm, comparisons regarding optimal pile placement for minimizing differential settlements by Kim et at.(1999) are made. In addition using proposed design procedure, design examples are presented.

  • PDF

A Design and Analysis of the Block Cipher Circle-g Using the Modified Feistel Structure (변형된 Feistel 구조를 이용한 Circle-g의 설계와 분석)

  • 임웅택;전문석
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.3
    • /
    • pp.405-414
    • /
    • 2004
  • In this paper, we designed a 128-bits block cipher, Circle-g, which has 18-rounds modified Feistel structure and analyzed its secureness by the differential cryptanalysis and linear cryptanalysis. We could have full diffusion effect from the two rounds of the Circle-g. Because of the strong diffusion effect of the F-function of the algorithm, we could get a 9-rounds DC characteristic with probability 2^{-144} and a 12-rounds LC characteristic with probability 2^{-144}. For the Circle-g with 128-bit key, there is no shortcut attack, which is more efficient than the exhaustive key search, for more than 12 rounds of the algorithm.

  • PDF

Structural health monitoring through meta-heuristics - comparative performance study

  • Pholdee, Nantiwat;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • v.1 no.4
    • /
    • pp.315-327
    • /
    • 2016
  • Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.

Control of balancing weight for IWR biped robot by genetic algorithm (유전 알고리즘을 이용한 IWR 이족 보행 로보트의 균형추 제어)

  • 심경흠;이보희;김진걸
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1185-1188
    • /
    • 1996
  • In this paper we present a genetic approach for trajectory control algorithm of balancing weight for IWR biped walking robot. The biped walking robot, IWR that was made by Automatic Control Lab. of Inha University has a trunk which stabilizes its walking by generating compensation moment. Trunk is composed of a revolute and a prismatic joint which roles balancing weight. The motion of balancing weight is determined by the gait of legs and represented by two linear second order ordinary differential equations. The solution of this equation must satisfy some constraints simultaneously to have a physical meaning. Genetic algorithm search for this feasible motion of balancing weight under some constraints. Simulation results show that feasible motion of balancing weight can be obtained by genetic algorithm.

  • PDF

Optimal Operation Method of Microgrid System Using DS Algorithm (DS 알고리즘을 이용한 마이크로 그리드 최적운영기법)

  • Park, Si-Na;Rhee, Sang-Bong
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.29 no.5
    • /
    • pp.34-40
    • /
    • 2015
  • This paper presents an application of Differential Search (DS) meta-heuristic optimization algorithm for optimal operation of micro grid system. DS algorithm has the benefit of high convergence rate and precision compared to other optimization methods. The micro grid system consists of a wind turbine, a diesel generator, and a fuel cell. The simulation is applied to micro grid system only. The wind turbine generator is modeled by considering the characteristics of variable output. One day load data which is divided every 20 minute and wind resource for wind turbine generator are used for the study. The method using the proposed DS algorithm is easy to implement, and the results of the convergence performance are better than other optimization algorithms.

A Hierarchical Block Matching Algorithm Based on Camera Panning Compensation (카메라 패닝 보상에 기반한 계층적 블록 정합 알고리즘)

  • Gwak, No-Yun;Hwang, Byeong-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2271-2280
    • /
    • 1999
  • In this paper, a variable motion estimation scheme based on HBMA(Hierarchical Block Matching Algorithm) to improve the performance and to reduce heavy computational and transmission load, is presented. The proposed algorithm is composed of four steps. First, block activity for each block is defined using the edge information of differential image between two sequential images, and then average block activity of the present image is found by taking the mean of block activity. Secondly, camera pan compensation is carried out, according to the average activity of the image, in the hierarchical pyramid structure constructed by wavelet transform. Next, the LUT classifying each block into one among Moving, No Moving, Semi-Moving Block according to the block activity compensated camera pan is obtained. Finally, as varying the block size and adaptively selecting the initial search layer and the search range referring to LUT, the proposed variable HBMA can effectively carries out fast motion estimation in the hierarchical pyramid structure. The cost function needed above-mentioned each step is only the block activity defined by the edge information of the differential image in the sequential images.

  • PDF

Determination of flight route using optimal control theory (최적 제어 이론을 사용한 비행 경로 선정)

  • 김을곤
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.407-411
    • /
    • 1992
  • A method for optimal route planning is presented with the assumption that the overall defended area is known in terms of threat potential function. This approach employes tangent plane to reduce the dimension of the state space for optimal programming problems with a state equality constraint. One-dimensional search algorithm is used to select the optimal route among the extermal fields which are obtained by integrating three differential equations from the initial values. In addition to being useful for the route planning through threat potential area, the trajectory planning will be suitable for general two-dimensional searching problems.

  • PDF