• Title/Summary/Keyword: Bypass Algorithm

Search Result 50, Processing Time 0.023 seconds

Location Estimation for Multiple Targets Using Expanded DFS Algorithm (확장된 깊이-우선 탐색 알고리듬을 적용한 다중표적 위치 좌표 추정 기법)

  • Park, So Ryoung;Noh, Sanguk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.12
    • /
    • pp.1207-1215
    • /
    • 2013
  • This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots in consideration of obstacles. In order to match up targets with measured azimuths, to add to the depth-first search (DFS) algorithms in free-obstacle environment, we suggest the expanded DFS (EDS) algorithm including bypass path search, partial path search, middle level ending, and the supplementation of decision metric. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the error rate of estimated location, mean number of calculating nodes, and mean distance between real coordinates and estimated coordinates of the proposed algorithms.

Fault-Tolerant Multicasting in MIN-based Multicomputers using Cube Encoding Scheme (큐브 부호화 방식을 사용하는 다단계 상호연결망 기반의 다중컴퓨터에서 고장 허영 멀티캐스팅)

  • Kim, Jin-Soo;Park, Jae-Hyung;Kim, Myung-Kyun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.2
    • /
    • pp.99-106
    • /
    • 2001
  • In this paper, we study fault-tolerant multicasting in multicomputers based on multistage interconnection networks (MIN’s). In addition to one-to-one routing among processing nodes, efficient multicasting has an important effect on the performance of multicomputers. This paper presents a multicasting algorithm to tolerate faulty switching elements. The proposed algorithm uses the cube encoding scheme to represent multicast destinations in MIN, and is based on a recursive scheme in order to bypass faults. This algorithm can route any multicast message to its own destinations in only two passes through the MIN containing several faulty switching elements. Moreover, we prove the correctness of our algorithm by exploiting well-known nonblocking property of MIN.

  • PDF

Improved Global Maximum Power Point Tracking Method Based on Voltage Interval for PV Array under Partially Shaded Conditions

  • Ding, Kun;Wang, Xiang;Zhai, Quan-Xin;Xu, Jun-Wei;Zhang, Jing-Wei;Liu, Hai-Hao
    • Journal of Power Electronics
    • /
    • v.14 no.4
    • /
    • pp.722-732
    • /
    • 2014
  • The power-voltage (P-V) curve of photovoltaic (PV) arrays connected in parallel to bypass diodes would have several local maximum power points (LMPP) under partial shading conditions (PSC). Conventional maximum power point tracking (MPPT) methods fail to search for the global maximum power point (MPP) because the searched peak point may remain at the LMPP on the P-V curve under PSC. This study proposes an improved MPPT algorithm to ensure that PV arrays operate at global maximum power point (GMPP) under PSC. The proposed algorithm is based on a critical study and a series of observations of PV characteristics under PSC. Results show the regularity of voltage interval between LMPPs. The algorithm has the advantages of rapidly reaching GMPP, maintaining stability, and recovering GMPP quickly when the operating condition changes. Simulation and experimental results demonstrate the feasibility of the proposed algorithm.

An Optimal Design Strategy for a Thomson Coil Actuator

  • Lim, Dong-Kuk;Jung, Sang-Yong;Jung, Hyun-Kyo;Ro, Jong-Suk
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.182-188
    • /
    • 2017
  • An arc eliminator allows a surge current bypass rapidly into the earth to facilitate the circuit breaking process and increase the stability of the load circuit. Thomson coil actuator (TCA) is a type of actuator that can function as an arc eliminator. The TCA has a simple structure and significantly rapid speed compared to the other types of actuators. In this paper, significant variables, which have a dominant effect on the performance of the TCA, are investigated in detail. Using these variables and an optimization algorithm, an optimal design strategy for the TCA is proposed in this research. The efficacy of the proposed optimal design strategy and the feasibility of the application of the designed TCA for a high power circuit breaker as the arc eliminators are validated through the experiment.

Simulation for Pitch Angle Control Strategies of a Grid-Connected Wind Turbine System on MATLAB/Simulink

  • Ro, Kyoung-Soo;Choi, Joon-Ho
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.1
    • /
    • pp.91-97
    • /
    • 2007
  • This paper presents a pitch angle controller of a grid-connected wind turbine system for extracting maximum power from wind and implements a modeling and simulation of the wind turbine system on MATLAB/Simulink. It discusses the maximum power control algorithm for the wind turbine and presents, in a graphical form, the relationship of wind turbine output, rotor speed, and power coefficient with wind speed when the wind turbine is operated under the maximum power control algorithm. The objective of pitch angle control is to extract maximum power from wind and is achieved by regulating the blade pitch angle during above-rated wind speeds in order to bypass excessive energy in the wind. Case studies demonstrate that the pitch angle control is carried out to achieve maximum power extraction during above-rated wind speeds and effectiveness of the proposed controller would be satisfactory.

The Monitoring System of Photovoltaic Module using Fault Diagnosis Sensor (태양전지 모듈 고장진단센서를 이용한 모니터링 시스템)

  • Park, Yuna;Kang, Gihwan;Ju, Youngchul;Kim, Soohyun;Ko, Sukwhan;Jang, Gilsoo
    • Journal of the Korean Solar Energy Society
    • /
    • v.36 no.5
    • /
    • pp.91-100
    • /
    • 2016
  • This paper proposes the PV module fault diagnosis sensor which is applied to Zigbee wireless network, and monitoring system using the developed sensor. It is designed with embedded sensor in junction box. The diagnosis elements for algorithm were voltage and temperature. For that reason, It is able to reduce the price and separate the fault of bypass diode from shading differently from other monitoring systems. This fault diagnosis algorithm verified through the Field-installed operations of PV module.

Topology Aggregation for Hierarchical Wireless Tactical Networks

  • Pak, Woo-Guil;Choi, Young-June
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.344-358
    • /
    • 2011
  • Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

An Innovative Fast Relay Coordination Method to Bypass the Time Consumption of Optimization Algorithms in Relay Protection Coordination

  • Kheshti, Mostafa;Kang, Xiaoning;Jiao, Zaibin
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.612-620
    • /
    • 2017
  • Relay coordination in power system is a complex problem and so far, meta-heuristic algorithms and other methods as an alternative approach may not properly deal with large scale relay coordination due to their huge time consuming computation. In some cases the relay coordination could be unachievable. As the urgency for a proper approach is essential, in this paper an innovative and simple relay coordination method is introduced that is able to be applied on optimization algorithms for relay protection coordination. The objective function equation of operating time of relays are divided into two separate functions with less constraints. As the analytical results show here, this equivalent method has a remarkable speed with high accuracy to coordinate directional relays. Two distribution systems including directional overcurrent relays are studied in DigSILENT software and the collected data are examined in MATLAB. The relay settings of this method are compared with particle swarm optimization and genetic algorithm. The analytical results show the correctness of this mathematical and practical approach. This fast coordination method has a proper velocity of convergence with low iteration that can be used in large scale systems in practice and also to provide a feasible solution for protection coordination in smart grids as online or offline protection coordination.

A Study on Buffer Scheme enhancing Performance In Intrusion Detection System (침입탐지시스템의 성능 향상을 위한 버퍼구조에 관한 연구)

  • 최인수;장덕성
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.2
    • /
    • pp.44-50
    • /
    • 2003
  • Even though algorithm of intrusion detection is superior to other algorithm in intrusion detection system, it is supposed that captured packet happened hostly lead to lose packet in system architecture when a buffer is full. If packet lost concerned to be hacked, it might impact to system all over. In this paper, try to focus on performance improvement of detection system. Buffer with threshold value could classify normal packet and hacked packet. The buffer accept normal packet and supposed to be hacked packet until critical value. When buffer reached at threshold value, destroyed packet is only normal packet. Proposed method can complement weakness that bypass hacked packet.

  • PDF

Sixteen years progress in recanalization of chronic carotid artery occlusion: A comprehensive review

  • Stanishevskiy Artem;Babichev Konstantin;Savello Alexander;Gizatullin Shamil;Svistov Dmitriy;Davydov Denis
    • Journal of Cerebrovascular and Endovascular Neurosurgery
    • /
    • v.25 no.1
    • /
    • pp.1-12
    • /
    • 2023
  • Objective: Although chronic carotid artery occlusion seems to be associated with significant risk of ischemic stroke, revascularization techniques are neither well established nor widespread. In contrast, extracranial-intracranial bypass is common despite the lack of evidence regarding neurological improvement or prevention of ischemic events. The aim of current review is to evaluate the effectiveness of various methods of recanalization of chronic carotid artery occlusion. Methods: Comprehensive literature search through PubMed, Scopus, Cochrane and Web of Science databases performed. Various parameters were assessed among patients underwent surgical, endovascular and hybrid recanalization for chronic carotid artery occlusion. Results: 40 publications from 2005 to 2021 with total of more than 1300 cases of revascularization of chronic carotid artery occlusion have been reviewed. Further parameters were assessed among patients underwent surgical, endovascular and hybrid recanalization for chronic carotid artery occlusion: mean age, male to female ratio, mean duration of occlusion before treatment, rate of successful recanalization, frequency of restenosis and reocclusion, prevalence of ischemic stroke postoperatively, neurological or other symptoms improvement and complications. Based on proposed through reviewed literature indications for revascularization and predictive factors of various recanalizing procedures, an algorithm for clinical decision making have been formulated. Conclusions: Although treatment of chronic carotid artery occlusion remains challenging, current literature suggests revascularization as single option for verified neurological improvement and prevention of ischemic events. Surgical and endovascular procedures should be taken into account when treating patients with symptomatic chronic carotid artery occlusion.