• Title/Summary/Keyword: Permutation Method

Search Result 120, Processing Time 0.023 seconds

Risk Assessment for a Bridge System Based upon Response Surface Method Compared with System Reliability (체계신뢰성 평가와 비교한 응답면기법에 의한 교량시스템의 위험성평가)

  • Cho, Tae-Jun;Moon, Jae-Woo;Kim, Jong-Tae
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.295-300
    • /
    • 2007
  • Probabilistic Risk Assessment considering statistically random variables is performed for the preliminary design of a Arch Bridge. Component reliabilities of girders have been evaluated using the response surfaces of the design variables at the selected critical sections based on the maximum shear and negative moment locations. Response Surface Method (RSM) is successfully applied for reliability analyses for this relatively small probability of failure of the complex structure, which is hard to be obtained by Monte-Carlo Simulations or by First Order Second Moment Method that can not easily calculate the derivative terms of implicit limit state functions. For the analysis of system reliability, parallel resistance system composed of girders is changed into parallel series connection system. The upper and lower probabilities of failure for the structural system have been evaluated and compared with the suggested prediction method for the combination of failure modes. The suggested prediction method for the combination of failure modes reveals the unexpected combinations of element failures in significant]y reduced time and efforts compared with the previous permutation method or system reliability analysis method.

  • PDF

Image Cryptographic Algorithm Based on the Property of Wavelet Packet Transform (웨이브렛 패킷 변환의 특성을 이용한 영상 암호화 알고리즘)

  • Shin, Jonghong
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.14 no.2
    • /
    • pp.49-59
    • /
    • 2018
  • Encryption of digital images has been requested various fields. In the meantime, many algorithms based on a text - based encryption algorithm have been proposed. In this paper, we propose a method of encryption in wavelet transform domain to utilize the characteristics of digital image. In particular, wavelet transform is used to reduce the association between the encrypted image and the original image. Wavelet packet transformations can be decomposed into more subband images than wavelet transform, and various position permutation, numerical transformation, and visual transformation are performed on the coefficients of this subband image. As a result, this paper proposes a method that satisfies the characteristics of high encryption strength than the conventional wavelet transform and reversibility. This method also satisfies the lossless symmetric key encryption and decryption algorithm. The performance of the proposed method is confirmed by visual and quantitative. Experimental results show that the visually encrypted image is seen as a completely different signal from the original image. We also confirmed that the proposed method shows lower values of cross correlation than conventional wavelet transform. And PSNR has a sufficiently high value in terms of decoding performance of the proposed method. In this paper, we also proposed that the degree of correlation of the encrypted image can be controlled by adjusting the number of wavelet transform steps according to the characteristics of the image.

A study on end-to-end speaker diarization system using single-label classification (단일 레이블 분류를 이용한 종단 간 화자 분할 시스템 성능 향상에 관한 연구)

  • Jaehee Jung;Wooil Kim
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.6
    • /
    • pp.536-543
    • /
    • 2023
  • Speaker diarization, which labels for "who spoken when?" in speech with multiple speakers, has been studied on a deep neural network-based end-to-end method for labeling on speech overlap and optimization of speaker diarization models. Most deep neural network-based end-to-end speaker diarization systems perform multi-label classification problem that predicts the labels of all speakers spoken in each frame of speech. However, the performance of the multi-label-based model varies greatly depending on what the threshold is set to. In this paper, it is studied a speaker diarization system using single-label classification so that speaker diarization can be performed without thresholds. The proposed model estimate labels from the output of the model by converting speaker labels into a single label. To consider speaker label permutations in the training, the proposed model is used a combination of Permutation Invariant Training (PIT) loss and cross-entropy loss. In addition, how to add the residual connection structures to model is studied for effective learning of speaker diarization models with deep structures. The experiment used the Librispech database to generate and use simulated noise data for two speakers. When compared with the proposed method and baseline model using the Diarization Error Rate (DER) performance the proposed method can be labeling without threshold, and it has improved performance by about 20.7 %.

Differential Evolution Algorithm for Job Shop Scheduling Problem

  • Wisittipanich, Warisa;Kachitvichyanukul, Voratas
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.3
    • /
    • pp.203-208
    • /
    • 2011
  • Job shop scheduling is well-known as one of the hardest combinatorial optimization problems and has been demonstrated to be NP-hard problem. In the past decades, several researchers have devoted their effort to develop evolutionary algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for job shop scheduling problem. Differential Evolution (DE) algorithm is a more recent evolutionary algorithm which has been widely applied and shown its strength in many application areas. However, the applications of DE on scheduling problems are still limited. This paper proposes a one-stage differential evolution algorithm (1ST-DE) for job shop scheduling problem. The proposed algorithm employs random key representation and permutation of m-job repetition to generate active schedules. The performance of proposed method is evaluated on a set of benchmark problems and compared with results from an existing PSO algorithm. The numerical results demonstrated that the proposed algorithm is able to provide good solutions especially for the large size problems with relatively fast computing time.

A Searching Algorithm for Minimum Bandpass Sampling Frequency in Simultaneous Down-Conversion of Multiple RF Signals

  • Bae, Jung-Hwa;Park, Jin-Woo
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.55-62
    • /
    • 2008
  • Bandpass sampling (BPS) techniques for the direct down-conversion of RF bandpass signals have become an essential technique for software defined radio (SDR), due to their advantage of minimizing the radio frequency (RF) front-end hardware dependency. This paper proposes an algorithm for finding the minimum BPS frequency for simultaneously down-converting multiple RF signals through full permutation over all the valid sampling ranges found for the multiple RF signals. We also present a scheme for reducing the computational complexity resulting from the large scale of the purmutation calculation involved in searching for the minimum BPS frequency. In addition, we investigate the BPS frequency allowing for the guard-band between adajacent down-converted signals, which help lessen the severe requirements in practical implementations. The performance of the proposed method is compared with those of other pre-reported methods to prove its effectiveness.

A Two Sample Test for Functional Data

  • Lee, Jong Soo;Cox, Dennis D.;Follen, Michele
    • Communications for Statistical Applications and Methods
    • /
    • v.22 no.2
    • /
    • pp.121-135
    • /
    • 2015
  • We consider testing equality of mean functions from two samples of functional data. A novel test based on the adaptive Neyman methodology applied to the Hotelling's T-squared statistic is proposed. Under the enlarged null hypothesis that the distributions of the two populations are the same, randomization methods are proposed to find a null distribution which gives accurate significance levels. An extensive simulation study is presented which shows that the proposed test works very well in comparison with several other methods under a variety of alternatives and is one of the best methods for all alternatives, whereas the other methods all show weak power at some alternatives. An application to a real-world data set demonstrates the applicability of the method.

A New Online Calibration Algorithm for Array Antenna using Independent Component Analysis

  • Suk, Mi-Kyung;Lee, Jong-Hyun;Chun, Joo-Hwan;Park, Jin-Kyu;Kim, Yong-Hwan
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1568-1572
    • /
    • 2004
  • This paper proposes a new online calibration algorithm for the array antenna system. As you know, the several previous calibration methods for the mutual coupling did not estimate but measure mutual coupling effect at the real or test-bed system directly. Therefore we suggest some idea to compensate the calibration errors due to mutual coupling effect and mismatch in cables and electronic modules without the off-line calibration. In this work, we can calibrate the array antenna system under the operation of the system using Independent Component Analysis(ICA). This is what is called an online calibration. As you know, the ICA method has permutation and scaling problems. However, we solve problems of the ICA method and apply it to the calibration of an array antenna. The method simultaneously estimates the DOA(Direction of Arrival) of the signals, and calibrates the array for that specific angle. The proposed algorithm is evaluated by computer simulation and its behavior is illustrated by a numerical example.

  • PDF

A Fast Algorithm for evaluating the Security of Substitution and Permutation Networks against Differential attack and Linear attack (SPN구조 블록 암호의 차분 공격 및 선형 공격에 대한 안전성을 측정하는 고속 알고리즘)

  • 박상우;지성택;박춘식;성수학
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.3
    • /
    • pp.45-52
    • /
    • 2001
  • In this paper, we examine the method for evaluating the security of SPN structures against differential cryptanalysis and linear cryptanalysis. We present an example of SPN structures in which there is a considerable difference between the differential probabilities and the characteristic probabilities. Then we 7pose an algorithm for estimating the maximum differential probabilities and the maximum linear hull probabilities of SPN structures and an useful method for accelerating the proposed algorithm. By using this method, we obain the maximum differential probabilities and the maximum linear probabilities of round function F of block cipher E2.

Identification of Superior Single Nucleotide Polymorphisms (SNP) Combinations Related to Economic Traits by Genotype Matrix Mapping (GMM) in Hanwoo (Korean Cattle)

  • Lee, Yoon-Seok;Oh, Dong-Yep;Lee, Yong-Won;Yeo, Jung-Sou;Lee, Jea-Young
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.24 no.11
    • /
    • pp.1504-1513
    • /
    • 2011
  • It is important to identify genetic interactions related to human diseases or animal traits. Many linear statistical models have been reported but they did not consider genetic interactions. Genotype matrix mapping (GMM) has been developed to identify genetic interactions. This study uses the GMM method to detect superior SNP combinations of the CCDC158 gene that influences average daily gain, marbling score, cold carcass weight and longissimus muscle dorsi area traits in Hanwoo. We evaluated the statistical significance of the major SNP combinations selected by implementing the permutation test of the F-measure. The effect of g.34425+102 A>T (AA), g.8778G>A (GG) and g.4102+36T>G (GT) SNP combinations produced higher performance of average daily gain, marbling score, cold carcass weight and the longissimus muscle dorsi area traits than the effect of a single SNP. GMM is a fast and reliable method for multiple SNP analysis with potential application in marker-assisted selection. GMM may prospectively be used for genetic assessment of quantitative traits after further development.