• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.651-659
• /
• 2008

Autoreclosing techniques have been used in power systems to maintain system stability and continuity of supply. Environmental and economical issues have driven significant increases in the development of distributed generation (DG). DG connected to distribution systems, however, may impose negative influences with respect to power quality, protection, and stability, because DG can cause some challenges to protection, especially to reclosing. For this reason, in order to improve the reliability and safety of the distribution system, the rules and guidelines suggest that the DG system needs to be rapidly disconnected from the system before reclosing. We present, in this paper, an adaptive reclosing algorithm considering the DG. The algorithm consists of an angle oscillation's judgment, the emergency extended equal-area criterion (EEEAC), the calculation of an optimal reclosing time, and a reconnection algorithm. Our simulation results for three different DG technologies with Electromagnetic Transient Program (EMTP) indicate that we can maintain transient stability while the DG is protected against disturbances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1182-1199
• /
• 2023

Fractional repetition (FR) codes can achieve exact uncoded repair for multiple failed nodes, with lower computational complexity and bandwidth overhead, and effectively improve repair performance in distributed storage systems (DSS). The actual distributed storage system is dynamic, that is, the parameters such as node storage overhead and number of storage nodes will change randomly and dynamically. Considering that traditional FR codes cannot be flexibly applied to dynamic distributed storage systems, a new construction scheme of adaptive-and-resolvable FR codes based on hypergraph coloring is proposed in this paper. Specifically, the linear uniform regular hypergraph can be constructed based on the heuristic algorithm of hypergraph coloring proposed in this paper. Then edges and vertices in hypergraph correspond to nodes and coded packets of FR codes respectively, further, FR codes is constructed. According to hypergraph coloring, the FR codes can achieve rapid repair for multiple failed nodes. Further, FR codes based on hypergraph coloring can be generalized to heterogeneous distributed storage systems. Compared with Reed-Solomon (RS) codes, simple regenerating codes (SRC) and locally repairable codes (LRC), adaptive-and-resolvable FR codes have significant advantages over repair locality, repair bandwidth overhead, computational complexity and time overhead during repairing failed nodes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1286-1290
• /
• 2004

This paper proposes a Distributed Autonomous Robotic System (DARS) based on an Artificial Immune Network (AIN) and a Classifier System (CS). The behaviors of robots in the system are divided into global behaviors and local behaviors. The global behaviors are actions to search tasks in environment. These actions are composed of two types: aggregation and dispersion. AIN decides one between these two actions, which robot should select and act on in the global. The local behaviors are actions to execute searched tasks. The robots learn the cooperative actions in these behaviors by the CS in the local. The relation between global and local increases the performance of system. Also, the proposed system is more adaptive than the existing system at the viewpoint that the robots learn and adapt the changing of tasks.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.5
• /
• pp.1002-1011
• /
• 2013

This paper proposes the new adaptive protection algorithm for inverse-time overcurrent relays (OCRs) to ensure their proper operating time and protective coordination. The application of the proposed algorithm requires digital protection relays with microcontroller and memory. The operating parameters of digital OCRs are adjusted based on the available data whenever system conditions (system with distributed generation (DG)) vary. Moreover, it can reduce the calculation time required to determine the operating parameters for achieving its purpose. To verify its effectiveness, several case studies are performed in time-domain simulation. The results show that the proposed adaptive protection algorithm can keep the proper operating time and provide the protective coordination time interval with fast response.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.315-321
• /
• 2010

In Ad-hoc networks, centralized power control is not suitable due to the absence of base stations, which perform the power control operation in the network to optimize the system performance. Therefore, each node should perform power control algorithm distributedly instead of the centralized one. The conventional distributed power control algorithm does not consider the adaptive bit loading operation to change the MCS (modulation and coding scheme) according to the received SINR (signal to interference and noise ratio), which limits the system throughput. In this paper, we propose a novel distributed bit loading and power control algorithm, which considers the adaptive bit loading operation to increase total system throughput and decrease outage probability. Simulation results show that the proposed algorithm performs much better than the conventional algorithm.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.461-465
• /
• 2009

Normally, a distributed computing environment is flexible in controlling complex embedded systems but their software components are becoming complex as these systems are equipped with several platforms and attached to various electronic devices, sensors, and actuators. These systems requires inter-object communication mechanisms to provide fault tolerant and QoS-enabled middleware service support in a distributed system. Generally, a middleware performs analysis of the parameters to ensure the availability and reliability of data dissemination. This paper focuses in particular to designing an application middleware for the specific scenario to improve the high availability and fault tolerance of data thus improving the QoS (Quality of Service) of a distributed system. The performance of an adaptive and highly reliable middleware can be significant based on the selection of vital parameters of the system.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.465-468
• /
• 2002

Today large corporations are constructing distributed server environment. Many corporations are respectively operating Web server, FTP server, Mail server and DB server on heterogeneous operation. However, there is the problem that a manager must manage each server individually. In this paper, we present distributed FTP server for log mining system on ACE. Proposed log mining system is based upon ACE (Adaptive Communication Environment) framework and data mining techniques. This system provides a united operation with distributed FTP server.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.59-64
• /
• 2002

In the sender-initiated load balancing algorithms, the sender continues to send an unnecessary request message fur load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver-initiated load balancing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, in this paper, we propose a genetic algorithm based approach fur improved sender-initiated and receiver-initiated load balancing. The proposed algorithm is used for new adaptive load balancing approach. Compared with the conventional sender-initiated and receiver-initiated load balancing algorithms, the proposed algorithm decreases the response time and increases the acceptance rate.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.2
• /
• pp.227-232
• /
• 2007

The autoreclosing is applied to power system for maintaining system stability and continuity of supply. Developments on distributed generation(DG) grows significantly by environmental issues and economical issues. If the DG is connected to distribution system, the DG influences the technical aspects such as power quality, protection and stability. It causes the challenges to protection, especially to reclosing. In order to achieve reliability and safety of the distribution system, the rules and guidelines suggest that the DG units should be rapidly disconnected from the network before the reclosing. If the DG is disconnected whenever the fault occurs, it cannot be utilized effectively. This paper presents the adaptive reclosing algorithm considering the DG. The algorithm consists of angle oscillation's judgment, EEEAC(Emergency Expanded Equal-Area Criterion), calculation of optimal reclosing time and re-connection algorithm. The simulation is implemented for the DG technology by using EMTP MODELS. The simulation results show that the transient stability is maintained and the DG is protected against disturbance.

• International Journal of Contents
• /
• v.2 no.1
• /
• pp.39-44
• /
• 2006

Load sharing is a critical resource in computer system. In sender-initiated load sharing algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver initiated load sharing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated and receiver-initiated load sharing in distributed systems. And we expand this algorithm to an adaptive load sharing algorithm. Compared with the conventional sender-initiated and receiver-initiated algorithms, the proposed algorithm decreases the response time and task processing time.