A new signal processing-based islanding detection method using pyramidal algorithm with undecimated wavelet transform for distributed generators of hydrogen energy

Machine learning-based fault detection methods are frequently combined with wavelet transform (WT) to detect an unintentional islanding condition. In contrast to this condition, these methods have long detection and computation time. Thus, selecting a useful signal processing-based approach is required for reliable islanding detection, especially in real-time applications. This paper presents a new modified signal processing-based islanding detection method (IDM) for real-time applications of hydrogen energy-based distributed generators. In the study, a new IDM using a modified pyramidal algorithm approach with an undecimated wavelet transform (UWT) is presented. The proposed method is performed with different grid conditions with the presence of electric noise in real-time. Experimental results show that oscillations in the acquired signal can be reduced by the UWT, and noise sensitivity is lower than other WT-based methods. The non-detection zone is zero and the maximum detection and computational time is also 75 ms at a close power match.     

控制爆破法处理卡钻事故

介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。     

2.3–21 GHz broadband and high linearity distributed low noise amplifier

This paper focuses on the design of a 2.3–21 GHz Distributed Low Noise Amplifier (LNA) with low noise figure (NF), high gain (S₂₁), and high linearity (IIP3) for broadband applications. This distributed amplifier (DA) includes S/C/X/Ku/K-band, which makes it very suitable for heterodyne receivers. The proposed DA uses a 0.18 μm GaAs pHEMT process (OMMIC ED02AH) in cascade architecture with lines adaptation and equalization of phase velocity techniques, to absorb their parasitic capacitances into the gate and drain transmission lines in order to achieve wide bandwidth and to enhance gain and linearity. The proposed broadband DA achieved an excellent gain in the flatness of 13.5 ± 0.2 dB, a low noise figure of 3.44 ± 1.12 dB, and a small group delay variation of ±19.721 ps over the range of 2.3–21 GHz. The input and output reflection coefficients S₁₁ and S₂₂ are less than −10 dB. The input compression point (P_1dB) and input third-order intercept point (IIP3) are −1.5 dBm and 11.5 dBm, respectively at 13 GHz. The dissipated power is 282 mW and the core layout size is 2.2 × 0.8 mm².     

A distributed state estimation method for power systems incorporating linear and nonlinear models

High-voltage transmission networks are commonly equipped with phasor measurement units (PMU), and some of them are PMU observable. However, PMUs are seldom installed in distribution networks due to budget limitations. The state estimation equations of PMU observable areas are linear, while those of other areas remain nonlinear. This paper proposes a new distributed state estimation method for solving multi-area state estimation problems, in which linear models are used for high-voltage transmission network, while nonlinear models are adopted for other areas. In PMU observable area, we select coordinating variables as generalized cost functions which accurately represent the sensitivity between the linear SE objective function and boundary states. Consequently, SE results identical to a centralized estimator can be obtained without iterations at the coordination level. This paper presents the problem model and theoretical analysis of the proposed method, and shows its effectiveness by numerical tests.     

Distributed wireless power transfer in sensor networks with multiple Mobile Chargers

We investigate the problem of efficient wireless power transfer in wireless sensor networks. In our approach, special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient charging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.     

Complexities of digital technology use and the teaching and learning of function

Many argue that digital technologies have the potential to enhance the teaching and learning of mathematics. However, the availability of technology is not sufficient to realise this potential. The study reported takes a detailed approach to investigate the utility of the particular offerings of the available technologies in the teaching and learning of a specific area of mathematics, functions. Sixteen affordances identified in the data are described. The complexity of the process involved in resolving a situation where particular affordances would be useful so as they are perceived and enacted is detailed. Finally, a grounded theory framework arising from the data analysis from this study that can be used to explain, predict and guide action in other digital environments is presented.     

Optimal resilient power grid operation during the course of a progressing wildfire

We study a two-stage stochastic and nonlinear optimization model for operating a power grid exposed to a natural disaster. Although this approach can be generalized to any natural hazard of continuous (and not instantaneous) nature, our focus is on wildfires. We assume that an approaching wildfire impacts the power grid by reducing the transmission capacity of its overhead lines. At the time when proactive decisions have to be taken, the severity of the wildfire is not known. This introduces uncertainty. In this paper, we extend previous work by more realistically capturing this uncertainty and by strengthening the mathematical programming formulation through standard reformulation techniques. With these reformulation techniques, the resulting two-stage, convex mixed-integer quadratically constrained programming formulation can be efficiently solved using commercial quadratic programming solvers as demonstrated on a case study on a modified version of the IEEE 123-bus test system with 100 scenarios. We also quantify the uncertainties through a second case study using the following three standard metrics of two-stage stochastic optimization: the expected value of perfect information, the expected result of using the expected value solution and the value of the stochastic solution.     

Event-triggered distributed receding horizon control for tracking and formation of homogeneous multi-agent systems

This paper proposes an event-triggered distributed receding horizon control (DRHC) approach for the formation and tracking problems of homogeneous multi-agent systems. For each agent, an event-triggering condition, based on assumed predictive information of the neighbours, is derived from stability analysis. Considering the uncertain deviation between the assumed and true predictive information, we design a time-varying compatibility constraint for the individual optimization problem. In the event-triggered DRHC algorithm, each agent solves the optimization problem and communicates with its neighbours only when the event-triggering condition is satisfied, so the communication and computation burden are reduced. Moreover, guarantees for the recursive feasibility and asymptotic stability of the overall system are proved. A simulation example is provided to illustrate effectiveness of the proposed approach.     

Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.