• 제목/요약/키워드: discrete system

검색결과 2,478건 처리시간 0.029초

구역전기사업자 구성을 위한 Phasor Discrete Particle Swarm Optimization 알고리즘 (Phasor Discrete Particle Swarm Optimization Algorithm to Configure Community Energy Systems)

  • 배인수;김진오
    • 조명전기설비학회논문지
    • /
    • 제23권9호
    • /
    • pp.55-61
    • /
    • 2009
  • 본 논문에서는 구역전기사업자를 구성하는데 적용하기 위해, 기존의 최적화 기법인 Discrete Particle Swarm Optimization (DPSO) 알고리즘을 개량한 Phasor DPSO (PDPSO) 알고리즘을 새롭게 제시한다. 구역전기사업자는 전력구입 뿐만 아니라 전력판매도 가능하고, 미리 계약한 수용가의 전력부하에게 전력을 공급할 의무가 있다. 하나의 배전계통에 다수의 구역전기사업자가 존재할 경우, 해당 배전계통 내의 모든 수용가에게 최소의 운영비용으로 전력을 공급하기 위해서는 다수 구역전기사업자 간에 구성형태를 조정할 필요가 있다. 이에 적용할 최적화 기법으로 본 논문은 PDPSO 알고리즘을 제안하며, 제안된 알고리즘의 각 개체는 기존의 다변수 벡터 대신 크기와 위상각으로 이루어진 다변수 페이저 값을 갖는다.

개인 적응형 이산 수학 학습을 위한 CAS 기반의 가상 학습 시스템 개발 (Development of a CAS-Based Virtual Learning System for Personalized Discrete Mathematics Learning)

  • 전영국;강윤수;김선홍;정인철
    • 한국학교수학회논문집
    • /
    • 제13권1호
    • /
    • pp.125-141
    • /
    • 2010
  • 본 연구의 목적은 컴퓨터대수시스템(CAS)를 활용하여 개인 적응용 이산수학 학습을 가능케하는 웹기반 가상 학습용 콘텐츠를 개발하는 것이다. 중등과정과 대학과정의 이산수학에서 공통적으로 등장하는 집합, 관계, 행렬, 그래프 등의 내용 요목을 중심으로 콘텐츠를 구성하였다. 이산수학의 특성상 컴퓨터를 사용한 이산구조를 즉각적으로 처리하여 그 결과를 시각적으로 제시하는 가상 학습용 콘텐츠 제작 환경을 제시하였다. 각 단원마다 동영상 기반의 강의 콘텐츠를 제공하였으며 강의 기반의 개념을 구체화할 수 있는 Mathematica 기반의 실습하기 기능을 추가하였다. 특히 행렬 단원 학습에서 학습구조도식을 이용한 콘텐츠 설계와 이에 따른 내용 요소별 베이지언 추론망 기반의 진단학습 모듈을 추가함으로써 구체적인 피드백을 통한 개인 적응형 학습이 가능하도록 설계하였다. 개발된 행렬 학습용 콘텐츠 중심으로 10명의 이공계 대학생이 실제 사용해 본 반응을 형성평가의 일환으로 분석하여 향후 수정 방향을 도출하였다.

  • PDF

Photovoltaic System Allocation Using Discrete Particle Swarm Optimization with Multi-level Quantization

  • Song, Hwa-Chang;Diolata, Ryan;Joo, Young-Hoon
    • Journal of Electrical Engineering and Technology
    • /
    • 제4권2호
    • /
    • pp.185-193
    • /
    • 2009
  • This paper presents a methodology for photovoltaic (PV) system allocation in distribution systems using a discrete particle swarm optimization (DPSO). The PV allocation problem is in the category of mixed integer nonlinear programming and its formulation may include multi-valued dis-crete variables. Thus, the PSO requires a scheme to deal with multi-valued discrete variables. This paper introduces a novel multi-level quantization scheme using a sigmoid function for discrete particle swarm optimization. The technique is employed to a standard PSO architecture; the same velocity update equation as in continuous versions of PSO is used but the particle's positions are updated in an alternative manner. The set of multi-level quantization is defined as integer multiples of powers-of-two terms to efficiently approximate the sigmoid function in transforming a particle's position into discrete values. A comparison with a genetic algorithm (GA) is performed to verify the quality of the solutions obtained.

이산예방보수 정책을 고려한 보증모형분석 (Warranty Models with Discrete Preventive Maintenance)

  • 김제숭
    • 산업공학
    • /
    • 제15권3호
    • /
    • pp.286-296
    • /
    • 2002
  • Products which are sold with warranty, preventive maintenance actions by manufacturers and/or buyers have an impact on the total costs for both parties. In this paper, we develop the models to study the expected warranty cost for products with free repairable warranty with three types of discrete preventive maintenance. We deal with by utilizing the concept that preventive maintenance reduces the virtual age of the system. We assume that the maintenance planning horizon can be segmented into k discrete and equally sized periods. In such a scenario, numerical examples are presented.

MULTIPLE VALUED ITERATIVE DYNAMICS MODELS OF NONLINEAR DISCRETE-TIME CONTROL DYNAMICAL SYSTEMS WITH DISTURBANCE

  • Kahng, Byungik
    • 대한수학회지
    • /
    • 제50권1호
    • /
    • pp.17-39
    • /
    • 2013
  • The study of nonlinear discrete-time control dynamical systems with disturbance is an important topic in control theory. In this paper, we concentrate our efforts to multiple valued iterative dynamical systems, which model the nonlinear discrete-time control dynamical systems with disturbance. After establishing the validity of such modeling, we study the invariant set theory of the multiple valued iterative dynamical systems, including the controllability/reachablity problems of the maximal invariant sets.

Solvability of Stochastic Discrete Algebraic Riccati Equation

  • Oh, Kyu-Kwon;Okuyama, Yoshifumi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.33.4-33
    • /
    • 2001
  • This paper considers a stochastic discrete algebraic Riccati equation, which is a generalized version of the well-known standard discrete algebraic Riccati equation, and has additional linear terms. Under controllability, observability and the assumption that the additional terms are not too large, the existence of a positive definite solution is guaranteed. It is shown that it arises in optimal control of a linear discrete-time system with multiplicative White noise and quadratic cost. A numerical example is given.

  • PDF

ERROR ESTIMATES OF FULLY DISCRETE DISCONTINUOUS GALERKIN APPROXIMATIONS FOR LINEAR SOBOLEV EQUATIONS

  • Ohm, M.R.;Shin, J.Y.;Lee, H.Y.
    • Journal of applied mathematics & informatics
    • /
    • 제27권5_6호
    • /
    • pp.1221-1234
    • /
    • 2009
  • In this paper, we construct fully discrete discontinuous Galerkin approximations to the solution of linear Sobolev equations. We apply a symmetric interior penalty method which has an interior penalty term to compensate the continuity on the edges of interelements. The optimal convergence of the fully discrete discontinuous Galerkin approximations in ${\ell}^{\infty}(L^2)$ norm is proved.

  • PDF

BOUNDEDNESS OF DISCRETE VOLTERRA SYSTEMS

  • Choi, Sung-Kyu;Goo, Yoon-Hoe;Koo, Nam-Jip
    • 대한수학회보
    • /
    • 제44권4호
    • /
    • pp.663-675
    • /
    • 2007
  • We investigate the representation of the solution of discrete linear Volterra difference systems by means of the resolvent matrix and fundamental matrix, respectively, and then study the boundedness of the solutions of discrete Volterra systems by improving the assumptions and the proofs of Medina#s results in [6].

STABILITY CONDITION OF DISCRETE-TIME $GEO^x$/G/1 QUEUE WITH PREEMPTIVE REPEAT PRIORITY

  • Lee, Yutae
    • Journal of applied mathematics & informatics
    • /
    • 제12권1_2호
    • /
    • pp.291-297
    • /
    • 2003
  • This paper considers discrete-time two-class Ge $o^{X/}$G/1 queues with preemptive repeat priority. Service times of messages of each priority class are i.i.d. according to a general discrete distribution function that may differ between two classes. Completion times are derived for the preemptive repeat identical and different priority disciplines. By using the completion time, the stability condition for our system is investigated.d.

Performance Analysis of a Discrete-Time Two-Phase Queueing System

  • Kim, Tae-Sung;Chang, Seok-Ho;Chae, Kyung-Chul
    • ETRI Journal
    • /
    • 제25권4호
    • /
    • pp.238-246
    • /
    • 2003
  • This paper introduces the modeling and analysis of a discrete-time, two-phase queueing system for both exhaustive batch service and gated batch service. Packets arrive at the system according to a Bernoulli process and receive batch service in the first phase and individual services in the second phase. We derive the probability generating function (PGF) of the system size and show that it is decomposed into two PGFs, one of which is the PGF of the system size in the standard discrete-time Geo/G/1 queue without vacations. We also present the PGF of the sojourn time. Based on these PGFs, we present useful performance measures, such as the mean number of packets in the system and the mean sojourn time of a packet.

  • PDF