• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.832-837
• /
• 2015

The group method of data handling (GMDH) algorithm has proven to be a powerful and effective way to extract rules or polynomials from an electric load pattern. However, because it is nonstationary, the load pattern needs to be decomposed using a discrete wavelet transform. In addition, if a load pattern has a complicated curve pattern, GMDH should use a higher polynomial, which requires complex computing and consumes a lot of time. This paper suggests a method for short-term electric load forecasting that uses a wavelet transform and a GMDH algorithm. Case studies with the proposed algorithm were carried out for one-day-ahead forecasting of hourly electric loads using data during the years 2008-2011. To prove the effectiveness of our proposed approach, the results were evaluated and compared with those obtained by Holt-Winters method and artificial neural network. Our suggested method resulted in better performance than either comparison group.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.42 no.2
• /
• pp.71-77
• /
• 2000

A multi-region model for solute transport through saturated soils has been developed to describe preferential flow. The model consists of numerous discrete pore groups, which are characterized by a discrete dispersion coefficient, flow velocity, and porosity . The hydraulic properties for each pore group are derived from a soil's hydraluic conductivity and soil water characteristic functions . Flow in pore group is described by the classical advection-disersion equation (ADE). An implict finite difference scheme was applied to the governing equation that results in a block-tridiagonal system of equations that is very efficient and allows the soil to be divided into any number of pore groups. The numerical technique is derived from methods used to solve coupled equations in fluid dynamics problems and can also be applied to the transport of interacting solutes. The results of the model are compared to the experimental data from published papers. This paper contributes on the characteristics of the method when applied to the parallel porosity model to describe preferential flow of solutes in soil.

• Communications of the Korean Mathematical Society
• /
• v.9 no.2
• /
• pp.271-274
• /
• 1994

The concept of a continuous module is a generalization of that of an injective module, and conditions ($C_1$), (C$_2$) and ($C_3$) are given for this concept in [4]. In this paper, we study modules with properties that are dual to continuity. These will be called discrete and we discuss discrete abelian groups. Throughout R is a ring with identity, M is a module over R, G is an abelian group of finite rank, E is the ring of endomorphisms of G and S is the center of E. Dual to the notion of essential submodules, we define small submodules of a module M over R.(omitted)

• Journal of the Korean Mathematical Society
• /
• v.43 no.6
• /
• pp.1269-1287
• /
• 2006

As a continuation of computing the zeta function of a regular covering graph by Mizuno and Sato in [9], we derive in this paper computational formulae for the zeta functions of a graph bundle and of any (regular or irregular) covering of a graph. If the voltages to derive them lie in an abelian or dihedral group and its fibre is a regular graph, those formulae can be simplified. As a by-product, the zeta function of the cartesian product of a graph and a regular graph is obtained. The same work is also done for a discrete torus and for a discrete Klein bottle.

• Management Science and Financial Engineering
• /
• v.17 no.1
• /
• pp.65-78
• /
• 2011

In the continuous review (Q, r) model one continuously monitors inventory level and places a replenishment order when the inventory position reaches the reorder point. In many business practices, however, inventory decreases in a discrete fashion. As a result, replenishment orders are usually placed after the inventory position gets far below the reorder point. This makes a chance of shortage more likely and the service level lower than designed. Such a discrepancy can be compensated for by raising the reorder point to some extent. The question is how much the reorder point should be raised in order to compensate for a potential shortage. In this study, we present experimental analyses for this question. Regression models are also proposed for on-site use.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.1-12
• /
• 2016

In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

• Honam Mathematical Journal
• /
• v.32 no.2
• /
• pp.227-237
• /
• 2010

For a discrete group G, the kernel of a homomorphism from bounded cohomology $\hat{H}^*(G)$ of G to the ordinary cohomology $H^*(G)$ of G is called the singular part of $\hat{H}^*(G)$. We give some results on the space of the singular part of the second bounded cohomology of G. Also some results on the second bounded cohomology of a uniformly perfect group are given.

• Communications of the Korean Mathematical Society
• /
• v.13 no.1
• /
• pp.29-36
• /
• 1998

We show that if M is a $II_1$-factor and a countable discrete group G acts outerly on M then Jones' index $[M:M^G]$ of a pair of $II_1^-factors is equal to the order $\mid$G$\mid$ of G. It is also shown that for a subgroup H of G Jones' index $[M^H:M^G]$ is equal to the group index [G:H] under certain conditions.

• Journal of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.555-571
• /
• 2005

A pair of pants $\Sigma(0,3)$ is a building block of oriented surfaces. The purpose of this paper is to formulate the matrix presentations of elements of the Teichmuller space of a pair of pants. In the level of the matrix group $SL(2,\mathbb{R})$, we shall show that an odd number of traces of matrix presentations of the generators of the fundamental group of $\Sigma(0,3)$ should be negative.

• Honam Mathematical Journal
• /
• v.41 no.3
• /
• pp.631-650
• /
• 2019

In this paper, for discrete groups G and K, we show that the bounded cohomology group of $G{\times}K$ is isomorphic to the cohomology group of the complex of the projective tensor product $B^*(G){\hat{\otimes}}B^*(K)$, where $B^*(G)$ and $B^*(G)$ are the complexes of bounded cochains with real coefficients ${\mathbb{R}}$ of G and K, respectively.