• Title/Summary/Keyword: DE algorithm

Search Result 487, Processing Time 0.033 seconds

THE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX

  • LEE, JAEJIN
    • Korean Journal of Mathematics
    • /
    • v.23 no.3
    • /
    • pp.427-438
    • /
    • 2015
  • The Schensted algorithm first described by Robinson [5] is a remarkable combinatorial correspondence associated with the theory of symmetric functions. $Sch{\ddot{u}}tzenberger's$ jeu de taquin[10] can be used to give alternative descriptions of both P- and Q-tableaux of the Schensted algorithm as well as the ordinary and dual Knuth relations. In this paper we describe the jeu de taquin on shifted rim hook tableaux using the switching rule, which shows that the sum of the weights of the shifted rim hook tableaux of a given shape and content does not depend on the order of the content if content parts are all odd.

Study on Flexural Damage of FRP Laminates (FRP 적층판의 휨 손상에 관한 연구)

  • Park, Sung-Jin
    • Journal of Urban Science
    • /
    • v.6 no.2
    • /
    • pp.49-57
    • /
    • 2017
  • A new Fiber Bragg Grating (FBG) wavelength demodulation scheme is studied in the paper, which consists of an improved de-noising method and Gaussian fitting peak searching algorithm. The improved translational invariant wavelet without threshold adjust factor is proposed to get a better de-noising performance for FBG sensor signal and overcome the drawbacks of soft or hard threshold wavelets. In order to get a high wavelength demodulation precision of FBG sensor signal, this de-noising method is designed to combine with Gaussian fitting peak searching algorithm. The simulation results show that the wavelength maximum measurement error is lower than 1pm, and can get a much higher accuracy.

  • PDF

The ASIC Design of the Adaptive De-interlacing Algorithm with Improved Horizontal and Vertical Edges (수평 및 수직 윤곽선을 개선한 ADI(Adaptive De-interlacing) 보간 알고리즘의 ASIC 설계)

  • 한병혁;박노경;배준석;박상봉
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.139-142
    • /
    • 2000
  • In this paper, the ADI (Adaptive De-interlacing) algorithm is proposed, which improves visually and subjectively horizontal and vertical edges of the image processed by the ELA(Edge Line-based Average) method. This paper also proposes a VLSI architecture for the proposed algorithm and designed the architecture through the full custom CMOS layout process. The proposed algorithm is verified using C and Matlab and implemented using 0.6$\mu\textrm{m}$ 2-poly 3-metal CMOS standard libraries. For the circuit and logic simulation, Cadence tool is used.

  • PDF

A general convergence condition of the Newton-Raphson algorithm applied to compressible hyperelasticity

  • Peyraut, Francois;Feng, Zhi-Qiang;Labed, Nadia
    • Structural Engineering and Mechanics
    • /
    • v.21 no.2
    • /
    • pp.121-136
    • /
    • 2005
  • This paper presents the implementation of the Blatz-Ko hyperelastic compressible model in a finite element program to deal with large deformation problems. We show analytically and numerically that the minimum number of increment steps in the Newton-Raphson algorithm depends on material properties and applied loads. We also show that this dependence is related to the orientation preservation principle. So we propose a convergence criteria based on the sign of eigenvalues of the deformation gradient matrix.

An Efficient Deinterlacing Algorithm Using New Edge-Directed Interpolation (새로운 에지 방향 보간법을 이용한 효율적인 디인터레이싱 알고리듬)

  • Kim, Min-Ki;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.12 no.2
    • /
    • pp.185-192
    • /
    • 2007
  • The interpolation is used in many image processing applications such as image enhancement, de-interlacing/scan-rate conversion, wavelet transforms based on the lifting scheme, and so on. Among these, de-interlacing and scan-rate conversion are proposed for the digital TV applications. The de-interlacing algorithm can be classified into two categories. The first one uses only one field, called intra-field de-interlacing, and the other uses multiple field, called inter-field de-interlacing. In this paper, an efficient de-interlacing algorithm using spatial domain information is proposed far the interpolation of interlaced images. By efficiently estimating the directional correlations, improved interpolation accuracy has been achieved. In addition, the proposed method is simply structured and is easy to implement. Extensive simulations conducted for various images and video sequences have shown the efficacy of the proposed method with significant improvement over the previous intra-field do-interlacing methods in terms of the objective image quality as well as the subjective image quality.

Global Optimization Using Kriging Metamodel and DE algorithm (크리깅 메타모델과 미분진화 알고리듬을 이용한 전역최적설계)

  • Lee, Chang-Jin;Jung, Jae-Jun;Lee, Kwang-Ki;Lee, Tae-Hee
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.537-542
    • /
    • 2001
  • In recent engineering, the designer has become more and more dependent on computer simulation. But defining exact model using computer simulation is too expensive and time consuming in the complicate systems. Thus, designers often use approximation models, which express the relation between design variables and response variables. These models are called metamodel. In this paper, we introduce one of the metamodel, named Kriging. This model employs an interpolation scheme and is developed in the fields of spatial statistics and geostatistics. This class of interpolating model has flexibility to model response data with multiple local extreme. By reason of this multi modality, we can't use any gradient-based optimization algorithm to find global extreme value of this model. Thus we have to introduce global optimization algorithm. To do this, we introduce DE(Differential Evolution). DE algorithm is developed by Ken Price and Rainer Storn, and it has recently proven to be an efficient method for optimizing real-valued multi-modal objective functions. This algorithm is similar to GA(Genetic Algorithm) in populating points, crossing over, and mutating. But it introduces vector concept in populating process. So it is very simple and easy to use. Finally, we show how we determine Kriging metamodel and find global extreme value through two mathematical examples.

  • PDF

Weighted Distance De-interlacing Algorithm Based on EDI and NAL (EDI와 NAL 알고리듬을 기반으로 한 거리 가중치 비월주사 방식 알고리듬)

  • Lee, Se-Young;Ku, Su-Il;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9C
    • /
    • pp.704-711
    • /
    • 2008
  • This paper proposes a new de-interlacing method which results in efficient visual improvement. In the proposed algorithm, the distance weight was considered and the previously developed the EDI (Edge Dependent Interpolation) algorithm and the NAL (New Adaptive Linear interpolation) algorithm were used as a basis. The do-interlacing method was divided into two main parts. First, the edge direction was found by using information of closer pixels. Then, missing pixels were interpolated along with the decided edge direction. In this paper, after predicting the edge through the EDI algorithm, missing pixels were interpolated by using the weighted distance based on the NAL algorithm. Experimental results indicate that the proposed algorithm be superior to the conventional algorithms in terms of the objective and subjective criteria.

Developing Smart Grids Based on GPRS and ZigBee Technologies Using Queueing Modeling-Based Optimization Algorithm

  • de Castro Souza, Gustavo Batista;Vieira, Flavio Henrique Teles;Lima, Claudio Ribeiro;de Deus, Getulio Antero Junior;de Castro, Marcelo Stehling;de Araujo, Sergio Granato;Vasques, Thiago Lara
    • ETRI Journal
    • /
    • v.38 no.1
    • /
    • pp.41-51
    • /
    • 2016
  • Smart metering systems have become widespread around the world. RF mesh communication systems have contributed to the creation of smarter and more reliable power systems. This paper presents an algorithm for positioning GPRS concentrators to attain delay constraints for a ZigBee-based mesh network. The proposed algorithm determines the number and placement of concentrators using integer linear programming and a queueing model for the given mesh network. The solutions given by the proposed algorithm are validated by verifying the communication network performance through simulations.

Quantum Cryptanalysis for DES Through Attack Cost Estimation of Grover's Algorithm (Grover 알고리즘 공격 비용 추정을 통한 DES에 대한 양자 암호 분석)

  • Jang, Kyung-bae;Kim, Hyun-Ji;Song, Gyeong-Ju;Sim, Min-Ju;Woo, Eum-Si;Seo, Hwa-Jeong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.6
    • /
    • pp.1149-1156
    • /
    • 2021
  • The Grover algorithm, which accelerates the brute force attack, is applicable to key recovery of symmetric key cryptography, and NIST uses the Grover attack cost for symmetric key cryptography to estimate the post-quantum security strength. In this paper, we estimate the attack cost of Grover's algorithm by implementing DES as a quantum circuit. NIST estimates the post-quantum security strength based on the attack cost of AES for symmetric key cryptography using 128, 192, and 256-bit keys. The estimated attack cost for DES can be analyzed to see how resistant DES is to attacks from quantum computers. Currently, since there is no post-quantum security index for symmetric key ciphers using 64-bit keys, the Grover attack cost for DES using 64-bit keys estimated in this paper can be used as a standard. ProjectQ, a quantum programming tool, was used to analyze the suitability and attack cost of the quantum circuit implementation of the proposed DES.

Study of concrete de-bonding assessment technique for containment liner plates in nuclear power plants using ultrasonic guided wave approach

  • Lee, Yonghee;Yun, Hyunmin;Cho, Younho
    • Nuclear Engineering and Technology
    • /
    • v.54 no.4
    • /
    • pp.1221-1229
    • /
    • 2022
  • In this work, the guided wave de-bonding area-detecting technique was studied for application to containment liner plates in nuclear power plant areas. To apply this technique, an appropriate Lamb wave mode, symmetric and longitudinal dominance, was verified by the frequency shifting technique. The S0 2.7 MHz mm Lamb wave mode was chosen to realize quantitative experimental results and their visualization. Results of the bulk wave, longitudinal wave mode, and comparison experiments indicate that the wave mode was able to distinguish between the de-bonded and bonded areas. Similar to the bulk wave cases, the bonded region could be distinguished from the de-bonded region using the Lamb wave approach. The Lamb wave technique results showed significant correlation to the de-bonding area. As the de-bonding area increased, the Lamb wave energy attenuation effect decreased, which was a prominent factor in the realization of quantitative tomographic visualization. The feasibility of tomographic visualization was studied via the application of Lamb waves. The reconstruction algorithm for the probabilistic inspection of damage (RAPID) technique was applied to the containment liner plate to verify and visualize the de-bonding condition. The results obtained using the tomography image indicated that the Lamb wave-based RAPID algorithm was capable of delineating debonding areas.