• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.9
• /
• pp.55-61
• /
• 2009

This paper presents a modified Phasor Discrete Particle Swarm Optimization (PDPSO) algorithm to configure Community Energy Systems(CESs) in the distribution system. The CES obtains electric power from its own Distributed Generations(DGs) and purchases insufficient power from the competitive power market, to supply power for customers contracted with the CES. When there are two or more CESs in a network, the CESs will continue the competitive expansion to reduce the total operation cost. The particles of the proposed PDPSO algorithm have magnitude and phase angle values, and move within a circle area. In the case study, the results by PDPSO algorithm was compared with that by the conventional DPSO algorithm.

• Journal of the Korean School Mathematics Society
• /
• v.13 no.1
• /
• pp.125-141
• /
• 2010

The aim of this paper is to develop a web-based Virtual Learning System for discrete mathematics learning using CAS (Computer Algebra System), The system contains a series of contents that are common between secondary und university curriculum in discrete mathematics such as sets, relations, matrices, graphs etc. We designed and developed web-based virtual learning contents contained in the proposed system based on Mathematia, webMathematica and phpMath taking advantages of rapid computation and visualization. The virtual learning system for discrete math provides movie lectures and 'practice mode' authored with phpMath in order to enhance conceptual understanding of each movie lesson. In particular, matrix learning is facilitated with conceptual diagram that provides interactive quizzes. Once the quiz results are submitted, Bayesian inference network diagnoses strong and weak parts of learning nodes for generating diagnostic reports to facilitate personalized learning. As part of formative evaluation, the overall responses were collected for future revision of the system with 10 university students.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.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.

• IE interfaces
• /
• v.15 no.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.

• Journal of the Korean Mathematical Society
• /
• v.50 no.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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• 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.

• Journal of applied mathematics & informatics
• /
• v.27 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.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].

• Journal of applied mathematics & informatics
• /
• v.12 no.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.

• ETRI Journal
• /
• v.25 no.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.