• 제목/요약/키워드: Algorithm Model

검색결과 12,861건 처리시간 0.035초

DEVELOPMENT OF AN ORTHOGONAL DOUBLE-IMAGE PROCESSING ALGORITHM TO MEASURE BUBBLE VOLUME IN A TWO-PHASE FLOW

  • Kim, Seong-Jin;Park, Goon-Cherl
    • Nuclear Engineering and Technology
    • /
    • 제39권4호
    • /
    • pp.313-326
    • /
    • 2007
  • In this paper, an algorithm to reconstruct two orthogonal images into a three-dimensional image is developed in order to measure the bubble size and volume in a two-phase boiling flow. The central-active contour model originally proposed by P. $Szczypi\'{n}ski$ and P. Strumillo is modified to reduce the dependence on the initial reference point and to increase the contour stability. The modified model is then applied to the algorithm to extract the object boundary. This improved central contour model could be applied to obscure objects using a variable threshold value. The extracted boundaries from each image are merged into a three-dimensional image through the developed algorithm. It is shown that the object reconstructed using the developed algorithm is very similar or identical to the real object. Various values such as volume and surface area are calculated for the reconstructed images and the developed algorithm is qualitatively verified using real images from rubber clay experiments and quantitatively verified by simulation using imaginary images. Finally, the developed algorithm is applied to measure the size and volume of vapor bubbles condensing in a subcooled boiling flow.

BJT의 DC 해석 용 SPICE 모델 파라미터 추출 방법에 관한 연구 (A Study on the SPICE Model Parameter Extraction Method for the BJT DC Model)

  • 이은구
    • 전기학회논문지
    • /
    • 제58권9호
    • /
    • pp.1769-1774
    • /
    • 2009
  • An algorithm for extracting the BJT DC model parameter values for SPICE model is proposed. The nonlinear optimization method for analyzing the device I-V data using the Levenberg-Marquardt algorithm is proposed and the method for calculating initial conditions of model parameters to improve the convergence characteristics is proposed. The base current and collector current obtained from the proposed method shows the root mean square error of 6.04% compared with the measured data of the PNP BJT named 2SA1980.

최단경로문제에서 k개의 치명호를 찾는 방법 (A Method for finding the k Most Vital Arcs in the Shortest Path Problem)

  • 안재근;정호연;박순달
    • 한국경영과학회지
    • /
    • 제23권4호
    • /
    • pp.11-20
    • /
    • 1998
  • This paper deals with a mathematical model and an algorithm for the problem of determining k most vital arcs in the shortest path problem. First, we propose a 0-1 integer programming model for finding k most vital arcs in shortest path problem given the ordered set of paths with cardinality q. Next, we also propose an algorithm for finding k most vital arcs ln the shortest path problem which uses the 0-1 Integer programming model and shortest path algorithm and maximum flow algorithms repeatedly Malik et al. proposed a non-polynomial algorithm to solve the problem, but their algorithm was contradicted by Bar-Noy et al. with a counter example to the algorithm in 1995. But using our algorithm. the exact solution can be found differently from the algorithm of Malik et al.

  • PDF

ECM Algorithm for Fitting of Mixtures of Multivariate Skew t-Distribution

  • Kim, Seung-Gu
    • Communications for Statistical Applications and Methods
    • /
    • 제19권5호
    • /
    • pp.673-683
    • /
    • 2012
  • Cabral et al. (2012) defined a mixture model of multivariate skew t-distributions(STMM), and proposed the use of an ECME algorithm (a variation of a standard EM algorithm) to fit the model. Their estimation by the ECME algorithm is closely related to the estimation of the degree of freedoms in the STMM. With the ECME, their purpose is to escape from the calculation of a conditional expectation that is not provided by a closed form; however, their estimates are quite unstable during the procedure of the ECME algorithm. In this paper, we provide a conditional expectation as a closed form so that it can be easily calculated; in addition, we propose to use the ECM algorithm in order to stably fit the STMM.

A Hybrid Genetic Ant Colony Optimization Algorithm with an Embedded Cloud Model for Continuous Optimization

  • Wang, Peng;Bai, Jiyun;Meng, Jun
    • Journal of Information Processing Systems
    • /
    • 제16권5호
    • /
    • pp.1169-1182
    • /
    • 2020
  • The ant colony optimization (ACO) algorithm is a classical metaheuristic optimization algorithm. However, the conventional ACO was liable to trap in the local minimum and has an inherent slow rate of convergence. In this work, we propose a novel combinatorial ACO algorithm (CG-ACO) to alleviate these limitations. The genetic algorithm and the cloud model were embedded into the ACO to find better initial solutions and the optimal parameters. In the experiment section, we compared CG-ACO with the state-of-the-art methods and discussed the parameter stability of CG-ACO. The experiment results showed that the CG-ACO achieved better performance than ACOR, simple genetic algorithm (SGA), CQPSO and CAFSA and was more likely to reach the global optimal solution.

단일변이 탐색법과 유전 알고리즘에 의한 탱크모형 매개변수 결정 비교 연구 (Comparison of Estimating Parameters by Univariate Search and Genetic Algorithm using Tank Model)

  • 이성용;김태곤;이제명;이은정;강문성;박승우;이정재
    • 한국농공학회논문집
    • /
    • 제51권3호
    • /
    • pp.1-8
    • /
    • 2009
  • The objectives of this study are to apply univariate search and genetic algorithm to tank model, and compare the two optimization methods. Hydrologic data of Baran watershed during 1996 and 1997 were used for correction the tank model, and the data of 1999 to 2000 were used for validation. RMSE and R2 were used for the tank model's optimization. Genetic algorithm showed better result than univariate search. Genetic algorithm converges to general optima, and more population of potential solution made better result. Univariate search was easy to apply and simple but had a problem of convergence to local optima, and the problem was not solved although search the solution more minutely. Therefore, this study recommend genetic algorithm to optimize tank model rather than univariate search.

Adaptive control with multiple model (using genetic algorithm)

  • Kwon, Seong-Chul;Park, Juhyun;Won, Sangchul
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.331-334
    • /
    • 1996
  • It is a well-known problem that the adaptive control has a poor transient response. In order to improve this problem, the scheme that model-reference adaptive control (MRAC) uses the genetic algorithm (GA) in the search for parameters is proposed. Use genetic algorithm (GA) in the searching for controller's parameters set and conventional gradient method for fine tuning. And show the reduction of the oscillations in transient response comparing with the conventional MRAC.

  • PDF

캔 인쇄 불량 검사 시스템을 위한 알고리즘 (An Algorithm for Inspection System of Can Print-Errors)

  • 이현민;김만진;이칠우
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2275-2278
    • /
    • 2003
  • In this paper, we propose a visual inspection algorithm to detect can print-errors by using multi-camera and image valuing algorithm. The features of the algorithm are to use four cameras that are arranged with 90$^{\circ}$ between each other and to adopt a synthesized image model which represents whole surface of a can. Using the model, detection process is straight forward, namely it is comparing a partial region of the can to a specific region of the model where is previously marked.

  • PDF

건설재해 사전 예측을 위한 부스팅 알고리즘 적용 (Application of Boosting Algorithm to Construction Accident Prediction)

  • 조예림;신윤석;김광희
    • 한국건축시공학회:학술대회논문집
    • /
    • 한국건축시공학회 2016년도 추계 학술논문 발표대회
    • /
    • pp.73-74
    • /
    • 2016
  • Although various research is being carried out to prevent the construction accidents, the number of victims of construction site is increasing continuously. Therefore, the purpose of this study is construction accidents prediction applying the boosting algorithm to the construction domains. Boosting algorithm was applied to construct construction accident prediction model and application of the model was examined using actual accident cases. It is possible to support safety manager to manage and prevent accidents in priority using the model.

  • PDF

상호작용 다중 모델 알고리듬을 이용한 표적 추적 (Target Tracking using Interacting Multilple Model Algorithm)

  • 구현철;서진헌
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1996년도 하계학술대회 논문집 B
    • /
    • pp.943-945
    • /
    • 1996
  • In this paper, we present an algorithm that allows tracking of a target using measurements obtained from a sensor with limited resolution. The Interacting Multiple Model (IMM) algorithm has been shown to be one of the most cost-effective estimation schemes for hybrid systems. The approach consists of IMM algorithm combined with a coupled version of the Joint Probabilistic Data Association Filter for the target that splits into two targets.

  • PDF