• Korean Journal of Mathematics
• /
• v.26 no.2
• /
• pp.167-174
• /
• 2018

By acting the dihedral group $D_k$ on the set of k-tuple multi-partitions, we introduce k-gonal partitions for all positive integers k. We give generating functions for these new partition functions and investigate their arithmetic properties.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.151-161
• /
• 2005

For Internet service providers (ISPs), there are three common types of interconnection agreements : private peering, public peering and transit. One of the most important problems for a single ISP is to determine which other ISPs to interconnect with, and under which agreements. The problem can be then to find a set of private peering providers, transit providers and Internet exchanges (IXs) when the following input data are assumed to be given : a set of BGP addresses with traffic demands, and a set of potential service providers (Private peering/transit providers and IXs) with routing information, cost functions and capacities. The objective is to minimize the total interconnection cost. We show that the problem is NP-hard, give a mixed-integer programming model, and propose a heuristic algorithm. Computational experience with a set of test instances shows the remarkable performance of the proposed algorithm of rapidly generating near-optimal solutions.

• Journal of Power Electronics
• /
• v.13 no.5
• /
• pp.841-853
• /
• 2013

An application of doubly-fed induction generator (DFIG), which is one of adjustable speed generators, to a gas engine cogeneration system has been investigated. To operate during a blackout as an emergency power supply is one of important roles for the gas engine cogeneration system. However, the DFIG requires initial excitation for startup during a blackout because the DFIG has no excitation source. In this paper, we propose the "blackout start" as a new excitation method to generate a rated voltage at the primary side during a blackout. In addition, a stand-alone operation following a blackout has been investigated by using experimental setup with a real gas engine. Power flows in the generating set with the DFIG at the stand-alone operation have been investigated experimentally. Experimental investigation of the power flow suggests that the generating set with DFIG has optimal speed in minimizing whole system losses.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.571-582
• /
• 2008

This paper analyzes global convergence of the univariate dynamic encoding algorithm for searches (uDEAS) and provides an application result to function optimization. uDEAS is a more advanced optimization method than its predecessor in terms of the number of neighborhood points. This improvement should be validated through mathematical analysis for further research and application. Since uDEAS can be categorized into the generating set search method also established recently, the global convergence property of uDEAS is proved in the context of the direct search method. To show the strong performance of uDEAS, the global minima of four 30 dimensional benchmark functions are attempted to be located by uDEAS and the other direct search methods. The proof of global convergence and the successful optimization result guarantee that uDEAS is a reliable and effective global optimization method.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.4
• /
• pp.1438-1449
• /
• 2018

The importance of power system stability has been emphasized with an increase of wind energy penetration in the power system. Accordingly, the guarantee on various control capabilities, including active and reactive power control of wind farms, was regarded as the most important aspect for the connection to the grid. To control the wind farm active power, the wind farm controller was introduced. The wind farm controller decides the power set points for each wind turbine generating unit and each wind turbine generating unit controls its power according to the set points from the wind farm controller. Therefore, co-relationship between wind farm controller and wind turbine controllers are significantly important. This paper proposes some control methods of wind farm active power control based on modified wind turbine control for power system stability and structures to connect wind turbine controllers to wind farm controller. Besides, this paper contributes to development of control algorithm considering not only electrical components but also mechanical components. The proposed contributions were verified by full simulation including power electronics and turbulent wind speed. The scenario refers to the active power control regulations of the Eltra and Elkraft system in Denmark.

• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.29-35
• /
• 2013

In this paper, we suggest an improved Convex Hull algorithm considering sort in plane point set. This algorithm has low computational complexity since processing data are reduced by characteristic of extreme points. Also it obtains a complete convex set with just one processing using an convex vertex discrimination criterion. Initially it requires sorting of point set. However we can't quickly sort because of its heavy operations. This problem was solved by replacing value and index. We measure the execution time of algorithms by generating a random set of points. The results of the experiment show that it is about 2 times faster than the existing algorithm.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.477-484
• /
• 2004

The technique of sequential pattern mining means generating a set of inter-transaction patterns residing in time-dependent data. This paper proposes a new method for generating sequential patterns with the use of Hellinger measure. While the current methods are generating single dimensional sequential patterns within a single attribute, the proposed method is able to detect multi-dimensional patterns among different attributes. A number of heuristics, based on the characteristics of Hellinger measure, are proposed to reduce the computational complexity of the sequential pattern systems. Some experimental results are presented.

• Korean Management Science Review
• /
• v.22 no.1
• /
• pp.15-26
• /
• 2005

The bootstrap is a method of computational inference that simulates the creation of new data by resampling from a single data set. We propose a new job for the bootstrap: generating inputs from one historical trace using Threshold Bootstrap. In this regard, the most important quality of bootstrap samples is that they be functionally indistinguishable from independent samples of the same stochastic process. We describe a quantitative measure of difference between two time series, and demonstrate the sensitivity of this measure for discriminating between two data generating processes. Utilizing this distance measure for the task of generating inputs, we show a way of tuning the bootstrap using a single observed trace. This application of the threshold bootstrap will be a powerful tool for Monte Carlo simulation. Monte Carlo simulation analysis relies on built-in input generators. These generators make unrealistic assumptions about independence and marginal distributions. The alternative source of inputs, historical trace data, though realistic by definition, provides only a single input stream for simulation. One benefit of our method would be expanding the number of inputs achieving reality by driving system models with actual historical input series. Another benefit might be the automatic generation of lifelike scenarios for the field of finance.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.73-82
• /
• 2016

The utility of exponential generating functions is that they are relevant for combinatorial problems involving sets and subsets. Sequences of polynomials play a fundamental role in applied mathematics, such sequences can be described using the exponential generating functions. The actuarial polynomials ${\alpha}^{({\beta})}_n(x)$, n = 0, 1, 2, ${\cdots}$, which was suggested by Toscano, have the following exponential generating function: $${\limits\sum^{\infty}_{n=0}}{\frac{{\alpha}^{({\beta})}_n(x)}{n!}}t^n={\exp}({\beta}t+x(1-e^t))$$. A linear functional on polynomial space can be identified with a formal power series. The set of formal power series is usually given the structure of an algebra under formal addition and multiplication. This algebra structure, the additive part of which agree with the vector space structure on the space of linear functionals, which is transferred from the space of the linear functionals. The algebra so obtained is called the umbral algebra, and the umbral calculus is the study of this algebra. In this paper, we investigate some umbral representations in the actuarial polynomials.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.80-89
• /
• 2011

While detecting changes in XML documents has emerged as a major research area, the level of research on edit scripts, which are the result of the change detection, is not far from satisfactory. In this paper, we present X-treeESgen, the algorithm generating edit scripts used in X-treeDiff+, a change detection algorithm for XML documents. X-treeESgen shows the time complexity of O(n), and support move and copy operations in addition to the basic set that is update, insert, and delete operations. Note that no other change detection algorithm provide all the operations. Also, since the process of generating edit scripts in X-treeESgen is designed independent of the process of matching, various tuning techniques may be applied.