• Title/Summary/Keyword: Differential Path

Search Result 167, Processing Time 0.025 seconds

Analysis of Conducted Differential Mode EMI in Flyback Converter (플라이백 컨버터의 Differential Mode 전도전자파장해 분석)

  • Min, S.H.;Lee, D.Y.;Cho, B.H.;Lee, B.H.
    • Proceedings of the KIEE Conference
    • /
    • 1998.07f
    • /
    • pp.1879-1881
    • /
    • 1998
  • The conducted differential mode (DM) EMI in a flyback converter are analyzed. Circuit modeling of passive components and PCB pattern for the EMI simulation are presented. Using the model, high frequency noise path is analyzed. The analyses are verified with simulations by identifying the peakings of the EMI pattern.

  • PDF

Real-time Monitoring of Criteria Air Pollutants Using a DOAS System (DOAS 시스템을 이용한 대기 환경 기준물질 실시간 측정)

  • ;;Yujun Zhang
    • Proceedings of the Korea Air Pollution Research Association Conference
    • /
    • 2001.11a
    • /
    • pp.354-355
    • /
    • 2001
  • DOAS (Differential Optical Absorption Spectroscopy) System은 대기 중에 존재하는 기준물질들이 특정 파장영역에서 빛을 흡수하는 원리를 이용하고 있다. 현재 독일을 중심으로 한 유럽과 선진국에서는 대기 환경 기준물질의 모니터링 기술들이 주로 광 투과방식을 이용한 Open path의 모니터링 기술들을 개발하고 있다. 기존의 측정 방법과 Open Path 모니터링의 기법을 비교 할 때 Open path 시스템은 실시간 측정 및 분석이 가능하므로 기존의 화학적 측정방법에서 제기되어져왔던 화학 반응시의 방해 물질의 간섭제거 및 시간 분해도 향상등에 큰 장점이 있다. (중략)

  • PDF

Revisited Security Evaluation on Midori-64 against Differential Cryptanalysis

  • Guoyong Han;Hongluan Zhao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.2
    • /
    • pp.478-493
    • /
    • 2024
  • In this paper, the Mixed Integer Linear Programming (MILP) model is improved for searching differential characteristics of block cipher Midori-64, and 4 search strategies of differential path are given. By using strategy IV, set 1 S-box on the top of the distinguisher to be active, and set 3 S-boxes at the bottom to be active and the difference to be the same, then we obtain a 5-round differential characteristics. Based on the distinguisher, we attack 12-round Midori-64 with data and time complexities of 263 and 2103.83, respectively. To our best knowledge, these results are superior to current ones.

Real-Time System Design and Point-to-Point Path Tracking for Real-Time Mobile Robot

  • Wang, F.H.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.162-167
    • /
    • 2003
  • In this paper, a novel feasible real-time system was researched for a differential driven wheeled autonomous mobile robot so that the mobile robot can move in a smooth, safe and elegant way. Least Square Minimum Path Planning was well used for the system to generate a smooth executable path for the mobile robot, and the point-to-point tracking algorithm was presented as well as its application in arbitrary path tracking. In order to make sure the robot can run elegantly and safely, trapezoidal speed was integrated into the point-to-point path tracking algorithm. The application to guest following for the autonomous mobile robot shows its wide application of the algorithm. The novel design was successfully proved to be feasible by our experiments on our mobile robot Interactive Robot Usher (IRU) in National University of Singapore.

  • PDF

An Upper Bound of the Longest Impossible Differentials of Several Block Ciphers

  • Han, Guoyong;Zhang, Wenying;Zhao, Hongluan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.435-451
    • /
    • 2019
  • Impossible differential cryptanalysis is an essential cryptanalytic technique and its key point is whether there is an impossible differential path. The main factor of influencing impossible differential cryptanalysis is the length of the rounds of the impossible differential trail because the attack will be more close to the real encryption algorithm with the number becoming longer. We provide the upper bound of the longest impossible differential trails of several important block ciphers. We first analyse the national standard of the Russian Federation in 2015, Kuznyechik, which utilizes the 16-byte LFSR to achieve the linear transformation. We conclude that there is no any 3-round impossible differential trail of the Kuznyechik without the consideration of the specific S-boxes. Then we ascertain the longest impossible differential paths of several other important block ciphers by using the matrix method which can be extended to many other block ciphers. As a result, we show that, unless considering the details of the S-boxes, there is no any more than or equal to 5-round, 7-round and 9-round impossible differential paths for KLEIN, Midori64 and MIBS respectively.

Path Planning of the Low Altitude Flight Unmanned Aerial Vehicle for the Neutralization of the Enemy Firepower (대화력전 임무수행을 위한 저고도 비행 무인공격기의 경로계획)

  • Yang, Kwang-Jin;Kim, Si-Tai;Jung, Dae-Han
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.4
    • /
    • pp.424-434
    • /
    • 2012
  • This paper presents a path planning algorithm of the unmanned aerial vehicle for the neutralization of the enemy firepower. The long range firepower of the ememy is usually located at the rear side of the mountain which is difficult to bomb. The path planner not only consider the differential constraints of the Unmanned Aerial Vehicle (UAV) but also consider the final approaching angle constraint. This problem is easily solved by incorporating the analytical upper bounded continuous curvature path smoothing algorithm into the Rapidly Exploring Random Tree (RRT) planner. The proposed algorithm can build a feasible path satisfying the kinematic constraints of the UAV on the fly. In addition, the curvatures of the path are continuous over the whole path. Simulation results show that the proposed algorithm can generate a feasible path of the UAV for the bombing mission regardless of the posture of the tunnel.

Simultaneous path tracking and orientation control for three-wheeled omni-directional robots (삼륜형 전방향 이동로봇을 위한 경로추종 및 방위제어)

  • Choi, Han-Soo;Kim, Dong-Il;Song, Jae-Bok
    • The Journal of Korea Robotics Society
    • /
    • v.10 no.3
    • /
    • pp.154-161
    • /
    • 2015
  • Conventional path tracking methods designed for two-wheeled differential drive robots are not suitable for omni-directional robots. In this study, we present a controller which can accomplish more accurate path tracking and orientation correction by exploiting the unconstrained movement capability of omni-directional robots. The proposed controller is proven to be stable using a Lyapunov stability criterion. Various experiments in real environments show that performance of path tracking and orientation correction has improved in the proposed controller.

Accurate Transmission Loss Allocation Algorithm Based on the Virtual Transaction Strategy: Comparison of Path-integral with Discrete Integral Methods

  • Min, Kyung-Il;Moon, Young-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.4
    • /
    • pp.511-521
    • /
    • 2010
  • This paper presents a new algorithm to determine accurate bus-wise transmission loss allocation utilizing path-integrals dictated by the transaction strategy. For any transaction strategy, the total sum of the allocated transmission losses of all buses is equal to the actual loss given by the AC power-flow calculation considering the distributed slack. In this paper, the bus-wise allocation of the transmission loss is calculated by integrating the differential loss along a path determined by the transaction strategy. The proposed algorithm is also compared with Galiana's method, which is the well-known transmission loss allocation algorithm based on integration. The performance of the proposed algorithm is evaluated by case studies carried out on the WSCC 9-bus, IEEE 14-bus, New England 39-bus, and IEEE 118-bus systems. The simulation results show that the proposed algorithm is fast and accurate with a large step size.

Bayesian Inference of the Stochastic Gompertz Growth Model for Tumor Growth

  • Paek, Jayeong;Choi, Ilsu
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.6
    • /
    • pp.521-528
    • /
    • 2014
  • A stochastic Gompertz diffusion model for tumor growth is a topic of active interest as cancer is a leading cause of death in Korea. The direct maximum likelihood estimation of stochastic differential equations would be possible based on the continuous path likelihood on condition that a continuous sample path of the process is recorded over the interval. This likelihood is useful in providing a basis for the so-called continuous record or infill likelihood function and infill asymptotic. In practice, we do not have fully continuous data except a few special cases. As a result, the exact ML method is not applicable. In this paper we proposed a method of parameter estimation of stochastic Gompertz differential equation via Markov chain Monte Carlo methods that is applicable for several data structures. We compared a Markov transition data structure with a data structure that have an initial point.