• KIEE International Transactions on Power Engineering
• /
• v.5A no.1
• /
• pp.79-84
• /
• 2005

In many countries, the electric power industry is undergoing significant changes known as deregulation and restructuring. These alterations introduce competition in generation and retail and require open access to the transmission network. The competition of the electric power industry causes many issues to surface. Among them, unbundling of the transmission service is probably the most complicated as it is a single and integrated sector and the transmission revenue requirement must be allocated to market participants in a fair way. In these situations, it is valuable to research the methodologies to allocate transmission usage. The power tracing method offers useful information such as which generators supply a particular load or how much each generator (load) uses a particular transmission line. With this information, we can allocate required transmission revenue to market participants. Recently, several algorithms were proposed for tracing power flow but there is no dominant power tracing method. This paper proposes a power tracing method based on graph theory and complex-current distribution. For practicability, the proposed method for transmission usage allocation is applied to IEEE 30 buses and compared with the method proposed by Felix F.Wu.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2135-2141
• /
• 2015

Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.267-270
• /
• 2001

A lot of efforts have been made to analyze the performance of the vehicle equipped with automatic transmission through simulation. It might be necessary to understand the different types of transmissions, i.e., different power flows, for different models. If there is a module that can be applied to different types of automatic transmission, it could be helpful to transmission-related engineers. This study has started up from this idea. The common bond graph has been obtained from several types of the automatic transmission. The overall generalized equations and kinematic constraint equations have been derived using virtual power sources on common bond graph. They are used to derive state equations and constraints. These equations have been applied as an application to the vehicle equipped with two simple planetary gear set type of Ravigneaux gear type automatic transmission. The state equation, kinematic constraints, and dynamic constraints have been derived in every gear and shift operation using overall generalized equations and kinematic constraint equations. Simulations for constraint speed running, standing-start running, rolling-start running, and LA-4 mode have been conducted to analyze the performance of the vehicle powertrain using GVPS(Generalized Vehicle Powertrain Simulation) program wit pull down menus.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.37 no.3
• /
• pp.304-308
• /
• 2024

In this paper, in order to analyze the PMU data of the accident section, we collected the raw data of a total of 35 PMU installed at the Yeonggwang substation and tried to find a way to analyze the data, and analyzed the data using Excel format and formula. As a result, the three-phase voltage and current data of the PMU were calculated using formulas in Excel and interpreted as effective and reactive power, and it was possible to check the effective and reactive power of the accident section through the graph to see why it was different from before the accident. As a result, it was confirmed that each power was greatly reduced in the graph of the effective and reactive power of the accident section, and it was confirmed that the loss occurred as the power of the accident section was greatly reduced.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.1145-1153
• /
• 2014

Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and $x,y{\in}X$ ($x{\neq}y$) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ${\Delta}(G)$. The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(${\Delta}(G)$) is abelian if and only if ${\mid}G{\mid}{\leq}2$; ${\mid}Aut({\Delta}(G)){\mid}$ is of prime power if and only if ${\mid}G{\mid}{\leq}2$, and ${\mid}Aut({\Delta}(G)){\mid}$ is square-free if and only if ${\mid}G{\mid}{\leq}3$. Some new graphs that are useful in studying the automorphism group of ${\Delta}(G)$ are presented and their main properties are investigated.

• Journal of Korean Society for Quality Management
• /
• v.46 no.3
• /
• pp.651-658
• /
• 2018

Purpose: The algorithm described in Lim(1998) is available to determine the sample size directly given specified significance level, power and signal-to-noise ratio. We research on the efficient determination of the sample size by visual methods. Methods: We propose three graphs for investigating the mutual relationship between the sample size r, power $1-{\beta}$ and the detectable signal-to-noise ratio ${\Delta}$. First graph shows the relationship between ${\Delta}$ and $1-{\beta}$ for the given r and it can be checked whether the power is sufficient enough. Second graph shows the relationship between r and ${\Delta}$ for the given power $1-{\beta}$. Third graph shows the relationship between r and $1-{\beta}$ for the given ${\Delta}$. It can be checked that which effects are sensitive to the efficient sample size by investigating those graphs. Results: In factorial design, randomized block design and the split plot design how to determine the sample size directly given specified significance level, power and signal-to-noise ratio is programmed by using R. A experiment to study the split plot design in Hicks(1982) is used as an example. We compare the sample sizes calculated by randomized block design with those by split plot design. By using graphs, we can check the possibility of reducing the sample size efficiently. Conclusion: The proposed visual methods can help an engineer to make a proper plan to reduce the sample size.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.12
• /
• pp.224-232
• /
• 2009

Power plant start-up is a complicate process involving hundreds of operations that should be performed either automatically or manually. Several major operations should be proceeded in parallel and each major operation is again broken down into detailed operations that must be carried out in a strict sequence. Even though most of the operations are automated, still substantial portions of the operations are carried out manually and the operational status should be monitored by the crew members, which are quite stressful tasks to be performed in real time. In this paper, a data structure called an Event Sequence Monitoring Graph(ESMG) is proposed for monitoring a sequence of events involved in the power plant start-up process. The ESMG is currently being applied to a thermal power plant with a rated output of 500MW. An application example is shown with the boiler feed water pump system start-up process, which exhibits a good potential for future applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.261-277
• /
• 2005

We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

• Korean Institute of Interior Design Journal
• /
• v.23 no.2
• /
• pp.166-173
• /
• 2014

This study analyzed visual-perceptual centrality as a measure to solve the confusion that might occur in visitor's movement in analyzing contemporary museums that have recently expand. Also, this study proposed a new methodology to understand the relationships of the occurrence and convergence of visual-perceptual power. The existing visibility graph analysis mostly ends up in identifying nodes corresponding to the physical environment of museums while the newly proposed visibility graph analysis is a methodology that can analyze the landmark on which the visual-perceptual power occurs and converges, by setting visible space elements as analysis variables, which showed a possibility to draw more reliable results in parallel to the existing analysis, and the results of this analysis are as follows. A public museum located in downtown has a limitation that it cannot but be multi-layered as a way to enlarge for the accommodation of a variety of programs on a limited site. Also, this study found that the problem of visitor orientation occurring in the multi-layer process was solved by a major space which was visual-perceptually void. Also, its types can be summarized into two types: One is setting parameter spaces (ramps, staircases, hallways) linked visual-perceptually to the major space and the other is solving the confusion of the visitor's movement by composing a simple exhibition space. In particular, it is judged that the type solving the confusion of the visitor's movement by composing a simple exhibition space also had a relationship with changes in the characteristics of the exhibited works by period. In addition, it was found that the entrance also appeared in two types: dependent type and independent type in the major space according to the characteristics of the major space.