• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1199-1204
• /
• 2007

In a cost based pool market, the generation capacity can be used as strategic bids by generation companies (Gencos) with the cost functions open to the market. Competition using strategic capacities is modeled by Cournot and Perfect Competiton (PC) model, and transformed into two by two payoff matrix game with Gencos' decision variables of Cournot and PC model. The payoff matrices vary when capacity payments are given to Gencos in accordance with their capacity bids. Nash Equilibrium (NE) in the matrices also moves with capacity price changes. In order to maximize social welfare of the market, NE should locate in a certain position of the payoff matrices, which corresponds to a PC NE. A concept of a critical capacity price is proposed and calculated in this paper that is defined as a minimum capacity price leading to PC NE. The critical capacity price is verified to work as a tool for suppressing a strategic capacity withholding in simulations of a test system.

• Proceedings of the KIEE Conference
• /
• 1994.11a
• /
• pp.12-14
• /
• 1994

Traditionally one convex cost function for each generation is assumed in economic power dispatch. However, it is more realistic to represent the cost function as a piecewise quadratic function rather than one convex function. This paper presents evolutionary algorithm approaches to solve the problems of economic power dispatch with quadratic cost functions and piecewise quadratic cost functions. To improve GA, EP and ES characteristics. optimization methods combining GA with ES and EP with ES are proposed. The results for the proposed algorithms are compared with those of numerical method and show the better solutions in the ELD problem.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.180-187
• /
• 2010

In this paper, a global path generation method is suggested using multiple grid maps connected with the mission type of unmanned combat vehicle(UCV). In order to carry out a mission for UCV, it is essential to find a global path which is coincident with the characteristics of the mission. This can be done by considering various combat circumstances represented as grid maps such as velocity map, threat map and communication map. Cost functions of multiple grid maps are linearly combined and normalized to them simultaneously for the path generation. The proposed method is realized using $A^*$, a well known search algorithm, and cost functions are normalized in the ratio of the traverse time which is one of critical information should be provided with the operators using the velocity map. By the experiments, it is checked found global paths match with the mission type by reflecting input data of grid maps properly and the computation time is short enough to regenerate paths in real time as combat circumstances change.

• Journal of information and communication convergence engineering
• /
• v.17 no.3
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.161-170
• /
• 2007

The purpose of this study is to find the solution that overcomes the existing assumption of symmetric cost functions in multi-class assignment. In the assignment problem, the assumption of a symmetric cost function means that the link cost is determined by each unique mode and is not affected by any other modes. In this study, the authors have applied a diagonalized algorithm and a heuristic model based on column generation to a multi-class assignment model and analyzed the result. Through the study, the authors found that the diagonalized algorithm produces equilibrium solutions by the initial convergence condition. In contrast to the diagonalized algorithm, the column generation algorithm has improved the solution model to overcome the problem of equilibrium solutions in the diagonalized algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.275-279
• /
• 2005

In this paper, we analyses of a traffic for authentication signaling in third generation mobile sensor network. In universal mobile telecommunication system, authentication functions are utilized to identify and authentication a mobile station and validate the service request network services. The authenticating parties are the authentication the serving general packet radio service support node access the authentication center to obtain the authentication with the mobile station. In this paper, we propose that the automatic cost-effective solution size of the authentication vector array.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.6
• /
• pp.259-264
• /
• 2006

This paper addresses the collusive bidding that functions as a potential obstacle to a fully competitive wholesale electricity market. Cooperative game is formulated and the equation of its Nash Equilibrium (NE) is derived on the basis of the supply function model. Gencos' willingness to selectively collude is expressed through a bargain theory. A Collusion Incentive Index(CII) for representing the willingness is defined through computing the Gencos' profits at NE. In order to keep the market non-cooperative, the market operator has to know the highest potentially collusive combination among the Gencos. Another index, which will be called the Collusion Monitoring Index(CMI), is suggested to detect the highest potential collusion and it is calculated using the marginal cost functions of the Gencos without any computation of NE. The effectiveness of CMI for detecting the highest potential collusion is verified through application on many test market cases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.257-266
• /
• 2015

There is no polynomial-time algorithm that can be obtain the optimal solution for economic load dispatch problem with non-convex fuel cost functions. Therefore, electrical field uses quadratic fuel cost function unavoidably. This paper proposes a valve-point optimization (VPO) algorithm for economic load dispatch problem with non-convex fuel cost functions. This algorithm sets the initial values to maximum powers $P_i{\leftarrow}P_i^{max}$ for each generator. It then reduces the generation power of generator i with an average power cost of $_{max}\bar{c}_i$ to a valve point power $P_{ik}$. The proposed algorithm has been found to perform better than the extant heuristic methods when applied to 13 and 40-generator benchmark data. This paper consequently proves that the optimal solution to economic load dispatch problem with non-convex fuel cost functions converges to the valve-point power of each generator.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.25 no.2
• /
• pp.80-86
• /
• 2011

This paper presents an integrated variable amplitude high voltage pulse generation circuit with low power and small size for driving industrial piezoelectric printer heads. To solve the problems of large size and power overhead of conventional pulse generators that usually assembled with multiple high-cost discrete ICs on a PCB board, we have designed a new integrated circuit (IC) chip. Since all the functions are integrated on to a single-chip it can achieve low cost and control the high-voltage output pulse with variable amplitudes as well. It can also digitally control the rising and falling times of an output high voltage pulse by using programmable RC time control of the output buffer. The proposed circuit has been designed and simulatedd in a 180[nm] Bipolar-CMOS-DMOS (BCD) technology using HSPICE and Cadence Virtuoso Tools. The proposed single-chip pulse generation circuit is suitable for use in industrial printer heads requiring a variable high voltage driving capability.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_2
• /
• pp.1251-1260
• /
• 2018

High-quality sea-ice surface models generated from aerial images can be used effectively as field data for developing satellite-based remote sensing methods but also as analysis data for understanding geometric variations of Arctic sea-ice. However, the lack of texture information on sea-ice surfaces can reduce the accuracy of image matching. In this paper, we analyze the performance of matching cost functions for homogeneous sea-ice surfaces as a part of high-quality sea-ice surface model generation. The matching cost functions include sum of squared differences (SSD), normalized cross-correlation (NCC), and zero-mean normalized cross-correlation (ZNCC) in image domain and phase correlation (PC), orientation correlation (OC), and gradient correlation (GC) in frequency domain. In order to analyze the matching performance for texture changes clearly and objectively, a new evaluation methodology based on the principle of object-space matching technique was introduced. Experimental results showed that it is possible to secure reliability and accuracy of image matching only when optimal search windows are variably applied to each matching point in textureless regions such as sea-ice surfaces. Among the matching cost functions, NCC and ZNCC showed the best performance for texture changes.