• Title/Summary/Keyword: 이산최적화

Search Result 189, Processing Time 0.039 seconds

Development of simulation-based ship production execution system(SPEXS) for a panel block assembly shop (판넬블록 생산관리를 위한 시뮬레이션 기반 조선생산실행시스템 개발)

  • Lee, Kwang-Kook;Kim, Young-Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.11
    • /
    • pp.2313-2320
    • /
    • 2011
  • The management of a panel block shop in a shipyard is a complex process that entails the largest amount of work and in which many decisions are involved. Shipbuilders have considered the process as a bottleneck since every panel for every ship and offshore hull structure must be processed through the shop. In order to maximize process productivity, simulation-based ship production execution system(SPEXS) is proposed for panel block operations utilising discrete-event simulation and simulated annealing. An application of panel block assembly shop, called SPEX-Panel supports production planners by general dispatching rules and metaheuristics to make better scheduling decisions on the shop floor. In addition, the system will help increase productivity in the yard with continuous improvement.

Noise Removal using a Convergence of the posteriori probability of the Bayesian techniques vocabulary recognition model to solve the problems of the prior probability based on HMM (HMM을 기반으로 한 사전 확률의 문제점을 해결하기 위해 베이시안 기법 어휘 인식 모델에의 사후 확률을 융합한 잡음 제거)

  • Oh, Sang-Yeob
    • Journal of Digital Convergence
    • /
    • v.13 no.8
    • /
    • pp.295-300
    • /
    • 2015
  • In vocabulary recognition using an HMM model which models the prior distribution for the observation of a discrete probability distribution indicates the advantages of low computational complexity, but relatively low recognition rate. The Bayesian techniques to improve vocabulary recognition model, it is proposed using a convergence of two methods to improve recognition noise-canceling recognition. In this paper, using a convergence of the prior probability method and techniques of Bayesian posterior probability based on HMM remove noise and improves the recognition rate. The result of applying the proposed method, the recognition rate of 97.9% in vocabulary recognition, respectively.

Multiple Reference Frame based Error-Resilient Video Coding (다중 레프런스 프레임 기반의 에러에 강인한 동영상 부호화 기법)

  • 정한승;김인철;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.10B
    • /
    • pp.1382-1389
    • /
    • 2001
  • 움직임 보상-이산 코사인 변환 (motion compensation-discrete cosine transform : MC-DCT) 기반의 동영상 부호화 기법이 부호화 효율성 및 구현의 단순성으로 인해 널리 사용되고 있으나, 에러 환경에서 구조적으로 취약한 면이 있다. 본 논문에서는 다중 메모리 움직임 보상 예측 (long-term memory motion compensated prediction : LTMP) 기반의 다중 레프런스 프레임을 사용하여 에러에 강인한 동영상 부호화 기법을 제안한다. 또한 제안하는 알고리듬에 기반한 에러 은닉 기법 (error concealment : EC)을 구현한다. 즉, R-D (rate-distortion) 최적화에 프레임간 움직임 벡터 (temporal motion vectors)의 확산 인자를 추가하여 에러에 대한 강인성 및 에러 은닉 기법의 효율성을 증가시켰다. 또한, 제안하는 알고리듬은 시간축상의 에러 전파를 피드백 정보 (negative acknowledgement : NAK)를 사용하여 억제한다. 즉, NAK는 채널 에러에 의해 손실된 영역과 에러가 전파된 영역을 추정하여 움직임 보상 영역에서 제외되도록 하는데 이용된다. 따라서, 제안하는 알고리듬은 PSNR 측면에서 FIU (forced intra update)에 근사하는 성능을 보이나, FIU와는 달리 비트율의 증가를 피할 수 있어 제한된 대역폭의 네트웍을 효율적으로 사용할 수 있다. 컴퓨터 모의 실험을 통해 제안하는 알고리듬이 기존의 H.263 및 LTMP 기반의 부호기에 비해 에러 환경에서 주관적 및 객관적 화질 측면에서 성능이 우수함을 보인다.

  • PDF

Development of a Read-time Voice Dialing System Using Discrete Hidden Markov Models (이산 HM을 이용한 실시간 음성인식 다이얼링 시스템 개발)

  • Lee, Se-Woong;Choi, Seung-Ho;Lee, Mi-Suk;Kim, Hong-Kook;Oh, Kwang-Cheol;Kim, Ki-Chul;Lee, Hwang-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.1E
    • /
    • pp.89-95
    • /
    • 1994
  • This paper describes development of a real-time voice dialing system which can recognize around one hundred word vocabularies in speaker independent mode. The voice recognition algorithm in this system is implemented on a DSP board with a telephone interface plugged in an IBM PC AT/486. In the DSP board, procedures for feature extraction, vector quantization(VQ), and end-point detection are performed simultaneously in every 10 msec frame interval to satisfy real-time constraints after detecting the word starting point. In addition, we optimize the VQ codebook size and the end-point detection procedure to reduce recognition time and memory requirement. The demonstration system has been displayed in MOBILAB of the Korean Mobile Telecom at the Taejon EXPO'93.

  • PDF

optimization and synthesis of $TiO_2$ for for the high efficiency DSSC (고효율 염료감응 태양전지를 위한 $TiO_2$의 합성 및 최적화)

  • Park, A-Reum;Ki, Hyun-Chul;Jin, En Mei;Gu, Hal-Bon
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 2011.11a
    • /
    • pp.56.2-56.2
    • /
    • 2011
  • 고효율 염료감응 태양전지를 제작하기 위해 Sol-gel법을 사용하여 $TiO_2$ 분말을 제조하였다. 제조 과정 중 다양한 양의 nitric acid를 첨가하여 pH를 조절하였다. Sol-gel법을 위한 출발 물질로 titanium (IV) isopropoxide(TTIP)와 DI water를 사용하였으며 nitric acid은 0, 0.05, 0.1, 0.15의 몰비(nitric acid/TTIP)로 첨가하였다. 첨가한 결과 pH는 $22^{\circ}C$에서 각각 5.52, 2.26, 1.68, 1.38이었다. 얻어진 $TiO_2$ 콜로이드 용액은 결정성 있는 분말로 제조 후 $5{\times}5[mm^2]$ 크기의 염료감응 태양전지를 제작하는데 사용 되였다. $TiO_2$의 결정구조 및 형태는 cell의 XRD와 FE-SEM으로 분석되었고 전기화학적 특성을 분석하기 위해 irradiation of AM 1.5 ($100mW/cm^2$) simulatedsunlight에서 I-V 곡선을 측정하였다. 측정 결과 몰비(nitric acid/TTIP) 0.05, pH가 2.26일 때 가장 우수한 효율 특성을 보였다.

  • PDF

Design of Singularly Perturbed Delta Operator Systems with Low Sensitivity (낮은 민감도를 지니는 특이섭동 델타연산자 시스템의 설계)

  • Shim, Kyu-Hong;Sawan, M.E.;Lee, Kyung-Tae
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.32 no.7
    • /
    • pp.76-82
    • /
    • 2004
  • A method of designing a state feedback gam achieving a specified insensitivity of the closed-loop trajectory by the singularly perturbed unified system using the operators is proposed. The order of system is reduced by the singular perturbation technique by ignoring the fast mode in it. The proposed method takes care of the actual trajectory variations over the range of the singular perturbation parameter. Necessary conditions for optimality are also derived. The previous study was done in the continuous time system The present paper extends the previous study to the discrete system and the ${\delta}-operating$ system that unifies the continuous and discrete systems. Advantages of the proposed method are shown in the numerical example.

Formulations of Sensitivity Analyses for Topological Optimum Modelings (위상학적 최적구조 모델링을 위한 민감도해석의 공식화)

  • Lee, Dong-Kyu;Shin, Soo-Mi
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.12 no.6
    • /
    • pp.241-248
    • /
    • 2008
  • The objective of sensitivity analyses is to identify critical variables of structural models and how their variability impacts mechanical response results. The sensitivity analyses have been used as significant basis data for practical applications of measuring and reinforcing fragile building structures. This study presents several sensitivity analysis methods for topological optimum designs of linear elastostatic structural systems. Numerical examples for structural analyses and topological optimum modeling demonstrate the reliability of sensitivities formulated in the present study.

Optimal Periodic Replacement Policy Under Discrete Time Frame (이산 시간을 고려한 시스템의 교체와 수리 비용 최적화 연구)

  • Lee, Jinpyo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.1
    • /
    • pp.61-69
    • /
    • 2020
  • Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

Minimum Weight Design of Transverse Frames of Oil Tankers by Generalized Slope Deflection Method (일반화 경사처짐법에 의한 유조선 횡강도 부재의 최소 중량 설계)

  • Chang-Doo Jang;Seung-Soo Na
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.33 no.3
    • /
    • pp.103-111
    • /
    • 1996
  • A generalized slope deflection method has already been developed by the authors from the existing one, and applied to the 3-dimensional structural analysis of tankers idealized as frame models to verify the effectiveness of the method from the analysis viewpoint. In this study, a minimum hull weight design program of tankers is developed to verify the effectiveness of the method from the design viewpoint by the combination of generalized slope deflection method and optimization method considering discrete design variables. By this program, it is possible to determine the scantling of each member of actual tankers that give minimum weight under given constraints. Also, a considerable weight saving has been found compared with existing ship.

  • PDF

A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem (다중 배낭 문제를 위한 라그랑지안 휴리스틱)

  • Yoon, You-Rim;Kim, Yong-Hyuk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.6
    • /
    • pp.755-760
    • /
    • 2010
  • In general, Lagrangian method for discrete optimization is a kind of technique to easily manage constraints. It is traditionally used for finding upper bounds in the branch-and-bound method. In this paper, we propose a new Lagrangian search method for the 0-1 knapsack problem with multiple constraints. A novel feature of the proposed method different from existing Lagrangian approaches is that it can find high-quality lower bounds, i.e., feasible solutions, efficiently based on a new property of Lagrangian vector. We show the performance improvement of the proposed Lagrangian method over existing ones through experiments on well-known large scale benchmark data.