• Title/Summary/Keyword: Deterministic Algorithm

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

On the generalized truncated least squares adaptive algorithm and two-stage design method with application to adaptive control

  • Yamamoto, Yoshihiro;Nikiforuk, Peter-N.;Gupta, Madam-M.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.7-12
    • /
    • 1993
  • This paper presents a generalized truncated least, squares adaptive algorithm and a two-stage design method. The proposed algorithm is directly derived from the normal equation of the generalized truncated least squares method (GTLSM). The special case of the GTLSM, the truncated least squares (TLS) adaptive algorithm, has a distinct features which includes the case of minimum steps estimator. This algorithm seemed to be best in the deterministic case. For real applications in the presence of disturbances, the GTLS adaptive algorithm is more effective. The two-stage design method proposed here combines the adaptive control system design with a conventional control design method and each can be treated independently. Using this method, the validity of the presented algorithms are examined by the simulation studies of an indirect adaptive control.

  • PDF

Probabilistic shear-lag analysis of structures using Systematic RSM

  • Cheng, Jin;Cai, C.S.;Xiao, Ru-Cheng
    • Structural Engineering and Mechanics
    • /
    • 제21권5호
    • /
    • pp.507-518
    • /
    • 2005
  • In the shear-lag analysis of structures deterministic procedure is insufficient to provide complete information. Probabilistic analysis is a holistic approach for analyzing shear-lag effects considering uncertainties in structural parameters. This paper proposes an efficient and accurate algorithm to analyze shear-lag effects of structures with parameter uncertainties. The proposed algorithm integrated the advantages of the response surface method (RSM), finite element method (FEM) and Monte Carlo simulation (MCS). Uncertainties in the structural parameters can be taken into account in this algorithm. The algorithm is verified using independently generated finite element data. The proposed algorithm is then used to analyze the shear-lag effects of a simply supported beam with parameter uncertainties. The results show that the proposed algorithm based on the central composite design is the most promising one in view of its accuracy and efficiency. Finally, a parametric study was conducted to investigate the effect of each of the random variables on the statistical moment of structural stress response.

Sub-Sum Constraint Function을 이용한 동적 실시간 VBR 트래픽 특성화 (Dynamic rt-VBR Traffic Characterization using Sub-Sum Constraint Function)

  • 김중연;정재일
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
    • /
    • pp.217-220
    • /
    • 2000
  • This paper studies a real-time VBR traffic characterization. There are two big approaches to determine traffic. One is a statistic approach and the other is a deterministic approach. This paper proposes a new constraint function, what we called “Sub-Sum Constraint Function”(SSCF). This function is mainly based on a deterministic approach and uses a statistic approach. It predicts and calculates the next rate with a present information about the stream. SSCF captures the intuitive bounded by a rate lower than its peak rate and closer to its long-term average rate. This model makes a order of the constraint function much less than any other works (O(n)). It can also be mapped on a token bucket algorithm which consists of r (token rate) and b (token depth). We use a concept, EB(effective bandwidth) for a utility of our function and comparing with other techniques such as CBR, average VBR. We simulated 21 multimedia sources for verifying the utility of our function.

  • PDF

부분부재고를 고려한 경제적 생산량모델에 관한 연구 (A study on the economic production quantity model with partial backorders)

  • 남상진;김정자
    • 한국경영과학회지
    • /
    • 제19권3호
    • /
    • pp.81-91
    • /
    • 1994
  • This paper is to build an economic production quantity model for situations, in which, during the stockout period, a fraction .betha.(backorder ratio) of the demand is backordered and remaining fraction (1-.betha.) is lost. This paper develops an objective function representing the average annual cost of a production system by defining a time-weighted backorder cost and a lost sales penalty cost per unit lost under the assumptions of deterministic demand rate and deterministic production rate, and provides an algorithm for its optimal solution. At the extreme .betha.= 1, the presented model reduces to the Fabrycky's model with complete backorders.

  • PDF

Global Optimization of Clusters in Gene Expression Data of DNA Microarrays by Deterministic Annealing

  • Lee, Kwon Moo;Chung, Tae Su;Kim, Ju Han
    • Genomics & Informatics
    • /
    • 제1권1호
    • /
    • pp.20-24
    • /
    • 2003
  • The analysis of DNA microarry data is one of the most important things for functional genomics research. The matrix representation of microarray data and its successive 'optimal' incisional hyperplanes is a useful platform for developing optimization algorithms to determine the optimal partitioning of pairwise proximity matrix representing completely connected and weighted graph. We developed Deterministic Annealing (DA) approach to determine the successive optimal binary partitioning. DA algorithm demonstrated good performance with the ability to find the 'globally optimal' binary partitions. In addition, the objects that have not been clustered at small non­zero temperature, are considered to be very sensitive to even small randomness, and can be used to estimate the reliability of the clustering.

Quasi-Deadbeat Minimax Estimation for Deterministic Generic Linear Models

  • Lee, Kwan-Ho;Han, Soo-Hee;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.45.5-45
    • /
    • 2002
  • In this paper, a quasi-deadbeat minimax estimation (QME) is proposed as a new class of time-domain parameter estimations for deterministic generic linear models. Linearity, quasi-deadbeat property, FIR structure, and independency of the initial parameter information will be required in advance, in addition to a new performance criterion of a worst case gain between the disturbances and the current estimation error. The proposed QME is obtained in a closed form by directly solving an optimization problem. The QME is represented in both a batch form and an iterative form. A fast algorithm for the suggested estimation is also presented, which is remarkable in view...

  • PDF

Deterministic intermediate Sampling과 Yen's algorithm을 이용한 Urey-Miller 반응 경로 제시

  • 김진우;김연준;김우연
    • EDISON SW 활용 경진대회 논문집
    • /
    • 제4회(2015년)
    • /
    • pp.6-13
    • /
    • 2015
  • 이 연구는 초기 지구의 대기 환경에서 유기화합물(glycine)이 합성되는 실험(Urey-Miller 실험)에서의 반응 경로를 Deterministic한 방법의 중간체 sampling 방법으로 반응 네트워크를 구성하고 Yen's알고리즘으로 네트워크 내의 최단경로를 제시함으로써 반응물과 생성물이 결정되어 있을 때 최소한의 화학적 직관만을 이용하여 제시하는 것이 목표이다. 이 연구 결과는 2014년도 Nature Chemistry에 발표된 다른 방법론을 적용하여 제시된 Urey-Miller reaction path와 비교해 어떠한 반응이 상대적으로 더 타당한 경로를 제시했을지 알아보았다. 이 연구에서 나온 reaction path에서의 중간체들에 대해 GAMESS를 이용한 B3LYP/6-31g(d,p) DFT계산을 수행하였다. 결과를 분석해보면서 어떤 부분이 부족하며 이 연구에 적용한 방법론을 어떻게 발전시켜나가야 더 나은 결과를 얻을 수 있을지를 함께 고려해 보았다.

  • PDF

Application of artificial neural networks to the response prediction of geometrically nonlinear truss structures

  • Cheng, Jin;Cai, C.S.;Xiao, Ru-Cheng
    • Structural Engineering and Mechanics
    • /
    • 제26권3호
    • /
    • pp.251-262
    • /
    • 2007
  • This paper examines the application of artificial neural networks (ANN) to the response prediction of geometrically nonlinear truss structures. Two types of analysis (deterministic and probabilistic analyses) are considered. A three-layer feed-forward backpropagation network with three input nodes, five hidden layer nodes and two output nodes is firstly developed for the deterministic response analysis. Then a back propagation training algorithm with Bayesian regularization is used to train the network. The trained network is then successfully combined with a direct Monte Carlo Simulation (MCS) to perform a probabilistic response analysis of geometrically nonlinear truss structures. Finally, the proposed ANN is applied to predict the response of a geometrically nonlinear truss structure. It is found that the proposed ANN is very efficient and reasonable in predicting the response of geometrically nonlinear truss structures.

Minimum Disturbance 기법을 적용한 AM-SCS-MMA 적응 등화 알고리즘의 성능 해석 (A Performance Analysis of AM-SCS-MMA Adaptive Equalization Algorithm based on the Minimum Disturbance Technique)

  • 임승각
    • 한국인터넷방송통신학회논문지
    • /
    • 제16권3호
    • /
    • pp.81-87
    • /
    • 2016
  • 본 논문에서는 기존 MMA 적응 등화 알고리즘의 안정성과 낮은 신호대 잡음비에서 robustness를 개선하기 위해 adaptive modulus와 miniumum-disturbance 기법을 적용한 AM-SCS-MMA (Adaptive Modulus-Soft Constraint Satisfaction-MMA) 알고리즘의 성능을 해석하였다. AM-SCS-MMA는 적응 등화를 비용 함수를 최소화하기 위해 adaptive modulus와 기존의 LMS 나 gradient descent algorithm 대신 deterministic optimization problem의 minimum-disturbance 기법을 적용하여 탭 계수를 갱신하므로서 채널에서 발생되는 진폭과 위상 찌그러짐에 의한 부호간 간섭을 동시에 줄이면서 등화 필터의 안정성 및 다양한 잡음에 대한 roburstness를 개선시킬 수 있다. 이의 개선 성능을 확인하기 위해 시뮬레이션을 수행하였으며 등화기 출력 성상도, 잔류 isi, MSE와 채널 추적 능력을 나타내는 EMSE (Excess MSE) 및 SER을 적용하였다. 컴퓨터 시뮬레이션의 결과 AM-SCS-MMA는 MMA보다 잔류 isi와 MSE에서는 수렴 속도는 늦지만 정상 상태 이후 잔여량이 감소되고 열악한 신호대 잡음비에서 robustness가 있었지만, 채널 추적 능력에서는 열화됨을 확인하였다.

후향전파 알고리즘과 동적터널링 시스템을 조합한 다층신경망의 새로운 학습방법 (A new training method of multilayer neural networks using a hybrid of backpropagation algorithm and dynamic tunneling system)

  • 조용현
    • 전자공학회논문지B
    • /
    • 제33B권4호
    • /
    • pp.201-208
    • /
    • 1996
  • This paper proposes an efficient method for improving the training performance of the neural network using a hybrid of backpropagation algorithm and dynamic tunneling system.The backpropagation algorithm, which is the fast gradient descent method, is applied for high-speed optimization. The dynamic tunneling system, which is the deterministic method iwth a tunneling phenomenone, is applied for blobal optimization. Converging to the local minima by using the backpropagation algorithm, the approximate initial point for escaping the local minima is estimated by the pattern classification, and the simulation results show that the performance of proposed method is superior th that of backpropagation algorithm with randomized initial point settings.

  • PDF