• Title/Summary/Keyword: Switching algorithm

Search Result 1,009, Processing Time 0.029 seconds

A Study on the Transmission Overload Relief by Fast Switching (고속 스위칭에 의한 송전선로 과부하 해소 연구)

  • Cho, Yoon-Sung;Lee, Han-Sang;Jang, Gilsoo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.8
    • /
    • pp.1053-1058
    • /
    • 2013
  • Because of computational burden and complex topology of substation, a transmission overload relief using circuit-breaker switching was very complex and difficult. However, a on-line algorithm for reducing the overloads in transmission lines has made progress due to the advance of IT technology. This paper describes the methodology for alleviating the overloads in transmission lines by circuit-breaker switching. First, the severe contingency lists and substations were selected from the results of contingency analysis. Then the switch combinations are determined using circuit-breakers of the selected substation. The topology changes are limited to equipment outage, bus split, island split, bus merge and island merge. Finally, the fast screening and full analysis methods are used to analyze the overload in transmission lines. To verify the performance of the proposed methodology, we performed a comprehensive test for both test system and large-scale power systems. The results of these tests showed that the proposed methodology can accurately alleviate the overloads in transmission lines from online data and can be applied to on-line applications.

Object Classification based on Weakly Supervised E2LSH and Saliency map Weighting

  • Zhao, Yongwei;Li, Bicheng;Liu, Xin;Ke, Shengcai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.364-380
    • /
    • 2016
  • The most popular approach in object classification is based on the bag of visual-words model, which has several fundamental problems that restricting the performance of this method, such as low time efficiency, the synonym and polysemy of visual words, and the lack of spatial information between visual words. In view of this, an object classification based on weakly supervised E2LSH and saliency map weighting is proposed. Firstly, E2LSH (Exact Euclidean Locality Sensitive Hashing) is employed to generate a group of weakly randomized visual dictionary by clustering SIFT features of the training dataset, and the selecting process of hash functions is effectively supervised inspired by the random forest ideas to reduce the randomcity of E2LSH. Secondly, graph-based visual saliency (GBVS) algorithm is applied to detect the saliency map of different images and weight the visual words according to the saliency prior. Finally, saliency map weighted visual language model is carried out to accomplish object classification. Experimental results datasets of Pascal 2007 and Caltech-256 indicate that the distinguishability of objects is effectively improved and our method is superior to the state-of-the-art object classification methods.

Robust Positioning-Sensing for n Ubiquitous Mobile Robot (유비쿼터스 모바일 로봇의 강인한 위치 추정 기법)

  • Choi, Hyo-Sik;Hwang, Jin-Ah;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.11
    • /
    • pp.1139-1145
    • /
    • 2008
  • A robust position sensing system is proposed in this paper for a ubiquitous mobile robot which moves indoors as well as outdoors. The Differential GPS (DGPS) which has a position estimation error of less than 5 m is a general solution when the mobile robot is moving outdoor, while an active beacon system (ABS) with embedded ultrasonic sensors is reliable as an indoor positioning system. The switching from the outdoor to indoor or vice versa causes unstable measurements on account of the reference coordinates and algorithm changes. To minimize the switching time in the position estimation and to stabilize the measurement, a robust position sensing system is proposed. In the system, to minimize the switching delay, the door positions are stored and updated in a database. Using the database, the approaching status of the mobile robot from indoor to outdoor or vice versa has been checked and the switching conditions are prepared before the mobile robot actually moves out or moves into the door. The reliability and accuracy of the robust positioning system based on DGPS and ABS are verified and demonstrated through the real experiments using a mobile robot prepared for this research.

Estimating Spot Prices of Restructured Electricity Markets in the United States (미국 전기도매시장의 전기가격 추정)

  • Yoo, Shiyong
    • Environmental and Resource Economics Review
    • /
    • v.13 no.3
    • /
    • pp.417-440
    • /
    • 2004
  • For the behavior of the wholesale spot price, a regime switching model with time-varying transition probabilities was estimated using the data from the PJM (Pennsylvania-New Jersey-Maryland) market. By including the temperature as an explanatory variable in the transition probability equations, the threshold effect of changing regime is clearly enhanced. And hence the predictability of the price spikes was improved. This means that the model showed a very clear threshold effect, with a low probability of switching for low loads and low temperatures and a high probability for high loads and high temperatures. And temperature showed a clearer threshold effect than load does. This implies that weather-related contracts may help to hedge against the risk in the cost of buying electricity during a summer.

  • PDF

A two-stage cascaded foreground seeds generation for parametric min-cuts

  • Li, Shao-Mei;Zhu, Jun-Guang;Gao, Chao;Li, Chun-Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5563-5582
    • /
    • 2016
  • Parametric min-cuts is an object proposal algorithm, which can be used for accurate image segmentation. In parametric min-cuts, foreground seeds generation plays an important role since the number and quality of foreground seeds have great effect on its efficiency and accuracy. To improve the performance of parametric min-cuts, this paper proposes a new framework for foreground seeds generation. First, to increase the odds of finding objects, saliency detection at multiple scales is used to generate a large set of diverse candidate seeds. Second, to further select good-quality seeds, a two-stage cascaded ranking classifier is used to filter and rank the candidates based on their appearance features. Experimental results show that parametric min-cuts using our seeding strategy can obtain a relative small pool of proposals with high accuracy.

An Anti-Boundary Switching Digital Delay-Locked Loop (안티-바운드리 스위칭 디지털 지연고정루프)

  • Yoon, Junsub;Kim, Jongsun
    • Journal of IKEEE
    • /
    • v.21 no.4
    • /
    • pp.416-419
    • /
    • 2017
  • In this paper, we propose a new digital delay-locked loop (DLL) for high-speed DDR3/DDR4 SDRAMs. The proposed digital DLL adopts a fine delay line using phase interpolation to eliminate the jitter increase problem due to the boundary switching problem. In addition, the proposed digital DLL utilizes a new gradual search algorithm to eliminate the harmonic lock problem. The proposed digital DLL is designed with a 1.1 V, 38-nm CMOS DRAM process and has a frequency operating range of 0.25-2.0 GHz. It has a peak-to-peak jitter of 1.1 ps at 2.0 GHz and has a power consumption of about 13 mW.

Trade-Off Strategies in Designing Capacitor Voltage Balancing Schemes for Modular Multilevel Converter HVDC

  • Nam, Taesik;Kim, Heejin;Kim, Sangmin;Son, Gum Tae;Chung, Yong-Ho;Park, Jung-Wook;Kim, Chan-Ki;Hur, Kyeon
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.829-838
    • /
    • 2016
  • This paper focuses on the engineering trade-offs in designing capacitor voltage balancing schemes for modular multilevel converters (MMC) HVDC: regulation performance and switching loss. MMC is driven by the on/off switch operation of numerous submodules and the key design concern is balancing submodule capacitor voltages minimizing switching transition among submodules because it represents the voltage regulation performance and system loss. This paper first introduces the state-of-the-art MMC-HVDC submodule capacitor voltage balancing methods reported in the literatures and discusses the trade-offs in designing these methods for HVDC application. This paper further proposes a submodule capacitor balancing scheme exploiting a control signal to flexibly interchange between the on-state and the off-state submodules. The proposed scheme enables desired performance-based voltage regulation and avoids unnecessary switching transitions among submodules, consequently reducing the switching loss. The flexibility and controllability particularly fit in high-level MMC HVDC applications where the aforementioned design trade-offs become more crucial. Simulation studies for MMC HVDC are performed to demonstrate the validity and effectiveness of the proposed capacitor voltage balancing algorithm.

Topology-aware Virtual Network Embedding Using Multiple Characteristics

  • Liao, Jianxin;Feng, Min;Li, Tonghong;Wang, Jingyu;Qing, Sude
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.145-164
    • /
    • 2014
  • Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.

EDGE: An Enticing Deceptive-content GEnerator as Defensive Deception

  • Li, Huanruo;Guo, Yunfei;Huo, Shumin;Ding, Yuehang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1891-1908
    • /
    • 2021
  • Cyber deception defense mitigates Advanced Persistent Threats (APTs) with deploying deceptive entities, such as the Honeyfile. The Honeyfile distracts attackers from valuable digital documents and attracts unauthorized access by deliberately exposing fake content. The effectiveness of distraction and trap lies in the enticement of fake content. However, existing studies on the Honeyfile focus less on this perspective. In this work, we seek to improve the enticement of fake text content through enhancing its readability, indistinguishability, and believability. Hence, an enticing deceptive-content generator, EDGE, is presented. The EDGE is constructed with three steps: extracting key concepts with a semantics-aware K-means clustering algorithm, searching for candidate deceptive concepts within the Word2Vec model, and generating deceptive text content under the Integrated Readability Index (IR). Furthermore, the readability and believability performance analyses are undertaken. The experimental results show that EDGE generates indistinguishable deceptive text content without decreasing readability. In all, EDGE proves effective to generate enticing deceptive text content as deception defense against APTs.

A Robust PID Control Algorithm for a Servo Manipulator with Friction

  • Jin, Jae-Hyun;Park, Byung-Suk;Lee, Hyo-Jik;Yoon, Ji-Sup
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2275-2278
    • /
    • 2005
  • In this paper, a control algorithm for a servo manipulator is focused on. A servo manipulator system has been developed for remotely handling radioactive materials in a hot cell. It is driven by servo motors. The torque from a servo motor is transferred through a reducer to the corresponding axis. The PID control algorithm is a simple and effective algorithm for such application. However, since friction degrades the algorithm's performance, friction has to be considered and compensated. The major aberrations are the positional tracking errors and the limit cycle. The authors have considered a switching term to a conventional PID algorithm to reduce the friction's effect. It has been tested by a hardware test.

  • PDF