Search

The traditional method for transformer moisture diagnosis is to establish empirical equations between feature parameters extracted from frequency domain spectroscopy (FDS) and the transformer’s moisture content. However, the established empirical equation may not be applicable to a novel testing environment, resulting in an unreliable evaluation result. In this regard, it is acknowledged that FDS combined with machine learning is more suitable for estimating moisture content in a variety of test environments. Nonetheless, the accuracy of the estimation results obtained using the existing method is limited by the algorithm’s inability to generalize. To address this issue, we propose an AdaBoost algorithm-enhanced back-propagation neural network (BP_AdaBoost). This study creates a database by extracting feature parameters from the FDS that characterize the insulation states of the prepared samples. Then, using the BP_AdaBoost algorithm and the newly constructed database, the moisture estimation models are trained. Finally, the results of the estimation are discussed in terms of laboratory and field transformers. By comparing the proposed BP_AdaBoost algorithm to other intelligence algorithms, it is demonstrated that it not only performs better in generalization, but also maintains a high level of accuracy. [ABSTRACT FROM AUTHOR]

Dirty paper coding (DPC) scheme is the capacity achieving transmission technique in multiuser MIMO downlink channels. As a suboptimal solution to DPC, successive zero-forcing DPC (SZF-DPC) has been proposed recently. The zero-interference constraint in designing the precoding matrices limits the number of supportable users. In this correspondence, we propose three low-complexity suboptimal user scheduling algorithms to exploit the multiuser diversity gain in SZF-DPC as the number of users grows. The first algorithm greedily maximizes the true sum rate. The second algorithm is based on eigenvalues. The third algorithm relies on the diagonal elements of the effective channel matrix since eigenvalues and diagonal entries of a Hermitian matrix have a strong relationship. Simulation results show that the proposed scheduling algorithms can obtain a significant fraction of sum rate of the optimal solution. Furthermore, the performance analysis is provided to prove that the proposed user selection algorithms can achieve the same asymptotic sum rate as that of DPC. [ABSTRACT FROM AUTHOR]

A new dirty paper coding technique that is robust against the gain attack is presented. Such a robustness is obtained by adopting a set of (orthogonal) equienergetic codewords and a correlation-based decoder. Due to the simple structure of orthogonal codes, we developed a simple yet powerful technique to embed the hidden message within the host signal. The proposed technique is an optimal one, in that the embedding distortion is minimized for a given robustness level, where robustness is measured through the maximum pairwise error probability in the presence of an additive Gaussian attack of given strength. The performance of the dirty coding algorithm is further improved by replacing orthogonal with quasi- orthogonal codes, namely, Gold sequences, and by concatenating them with an outer turbo code. To this aim, the inner decoder is modified to produce a soft estimate of the embedded message. Performance analysis is carried out by means of extensive simulations proving the validity of the novel watermarking scheme. [ABSTRACT FROM AUTHOR]

Presents a study which showed how curve and surface representations of fiber network, fiber wall and fiber lumen can be computed using distance transform based algorithms. Motive for analyzing volume images of paper; Uses of the representations; Levels of detail in which the analysis of paper and paper fibers can be divided.

This paper proposes and evaluates two robust sheet tension estimation algorithms based on unwind and rewind variables, respectively. The proper sheet tension estimation is guaranteed by a continuous monitoring of the differences between the actual estimated values and the values predicted from the last calibration of the estimation parameters. The evaluation was performed with the aid of a developed winder emulator that allowed the offline testing in a real-time field environment, including the initial setting of the estimation constants, and evaluation of both four- and six-shipping-roll cycles. The sheet tension estimation results confirm the precise and stable operation of the proposed robust estimation algorithms, in tests conducted with signals from a winder model, and with tests involving actual field signals from an operational winder. [ABSTRACT FROM AUTHOR]

Recently developed monitoring-systems show the need as also the possibilities for online- and offline-onsite-diagnostics. The limit in sensitivity for electrical pd-measurements according to IEC 60270 which is reached using filters for sinusoidal disturbances and compensation for corona impulses is still not satisfactory. The acoustic partial discharge measurement (pd-measurement) is also a well known and reliable method often used by transformer manufacturers in testing. In laboratory setups a gain in sensitivity of the acoustic in comparison to the electrical pd measurements could be established. This is reached by adapting the sensors to the propagation path, a modern but moderately priced acquisition hardware and the introduction of new signal processing algorithms. The developed sophisticated measuring, systems show remarkable results in online acoustic pd-measurements onsite. [ABSTRACT FROM AUTHOR]

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]

This paper proposes an approach to mitigate adverse effects of the fault management of closed/ring grids with high shares of distributed generation (DG). The approach refers to conventional distance protection relays in particular. The rising share of DG, especially in distribution systems, can lead to overloadings and intolerable voltages. Closed-ring structures increase the grid capacity for DG due to more balanced load and voltages profiles. However, malfunctions of protection relays may occur because fault locating and selective fault clearing can be disturbed. This paper presents a distance protection algorithm for feeder relays that complies with the requirements of closed/ring grids with inter/infeeds. The proposed current comparison method (CCM) bases on the comparison of negative/sequence currents. It needs no voltage measurement and remains unaffected from inter/infeeds and fault resistances. Additionally, for relays located at the ring coupler, where the ring can be opened, a coupling relay method (CRM) is proposed. It locates unsymmetrical faults in closed/ring grids with inter/infeeds and enables fast and selective opening of the ring. This helps maintaining reliable power supply for customers in closed rings. Finally, the paper presents a grading strategy reducing the average fault clearing time. Lab tests prove the capability of both proposed algorithms. [ABSTRACT FROM AUTHOR]

As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]

Unavoidably, the controlsystem of any permanent magnet synchronous motor (PMSM) is subjected to perturbations, e.g., motor nonidealities and inverter nonlinearities. To reject these perturbations, a new super-twisting (ST) control variant, called speed adaptive super-twisting (S-AST) control, is proposed in this paper. In the S-AST control, a proportional-integral (PI) and a ST controllers are merged using an adaptive law that is based on the motor speed measurement. This is done to reduce the chattering problems that the standard ST control presents. In addition, a mathematical design for the S-AST control is proposed, where the relationship between the chattering amplitude, the switching frequency and the system perturbations is shown. The main contribution in this paper is the application of the S-AST controller to reduce the total harmonic distortion (THDi) of the PMSM currents. By comparing the S-AST control against PI control, the THDi is reduced from 9.9% to 1.27%, in simulation, and the THDi is reduced from 22.79% to 1.56%, experimentally. These results demonstrate how the S-AST control is an excellent alternative to improve the waveform of the PMSM currents. [ABSTRACT FROM AUTHOR]

The problem of range estimation based on noisy measurements with phase ambiguity can be solved using signals across multiple frequencies by existing algorithms based on either the Chinese Remainder Theorem or lattice theory. The performances of these algorithms are constrained by the trade-off between SNR of measurements and required estimation accuracy. In this paper, we firstly propose an algorithm to find a set of wavelengths satisfying the conditions to apply the closed-form lattice algorithm from a given interval. Then we propose an enhanced lattice algorithm for range estimation based on existing lattice approaches. In the conventional lattice algorithm, the selection of an integer vector by the estimator often fails to be the ground truth because of noise. As a result, the true value can be a neighbouring lattice point of the estimated point where neighbours are defined in terms of a distance depending on the noise characteristics. In this paper, all neighbouring lattice points of the estimated point obtained by a conventional lattice algorithm are regarded as candidates for the new estimate. Then an efficient estimator is presented to choose one of those candidates to be the new estimate. The performance of the proposed algorithm, i.e. the successful probability of reconstruction, is derived mathematically. Additionally, a computation-reduced algorithm is presented to reduce the overhead of computation. The calculated probability and simulation results demonstrate the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a novel bit loading algorithm to multicarrier non-orthogonal multiple access (NOMA) systems to maximize the system total throughput while satisfying the users’ individual quality of service (QoS) constraints. Although bit loading is generally a non-deterministic polynomial-time (NP)-hard problem, even for orthogonal multiple access (OMA), the mutual interference between the users, and the dependence of power coefficients and modulation orders are additional challenges that add substantial complexity to the optimization problem. Therefore, in this paper, we propose an efficient bit loading algorithm for multicarrier NOMA systems and compare the complexity and throughput with a corresponding OMA system. The obtained results show that for the case of NOMA, bit loading provides an additional degree of freedom that allows non-uniform spectrum sharing among the users. In particular scenarios, the system may experience hybrid modes of operation, where the system switches between NOMA and OMA. The obtained numerical results show that NOMA can outperform OMA by 100% in terms of spectral efficiency, for a two-user scenario. The complexity of the loading process for NOMA is noticeably higher than OMA, which is due to the high complexity associated with the bit error rate (BER) computation in the case of NOMA. [ABSTRACT FROM AUTHOR]

The Unlimited Sensing Framework (USF) was recently introduced to overcome the sensor saturation bottleneck in conventional digital acquisition systems. At its core, the USF converts a continuous-time high-dynamic-range (HDR) signal into folded, low-dynamic-range, modulo samples and allows the recovery of the HDR signal via algorithmic unfolding. In hardware, however, implementing ideal modulo folding requires careful calibration, analog design and high precision. At the interface of theory and practice, this paper explores a computational sampling strategy that relaxes strict hardware requirements via a novel, mathematically guaranteed reconstruction. We start with a generalized model for USF with two new parameters modeling hysteresis and folding transients in addition to the modulo threshold. Hysteresis accounts for mismatches between the reset threshold and the amplitude displacement at the folding time and the folding transient is a continuous transition period in the implementation of a reset. Both these effects are motivated by our hardware experiments and also occur in previous, domain-specific applications. We show that hysteresis is beneficial for USF and leverage it to derive the first recovery guarantees in the context of our generalized USF model for a certain sampling rate regime. Additionally, we show how the sampling rate requirement can be greatly reduced via a direct generalization of the proposed recovery. Our theoretical work is corroborated by hardware experiments with a hysteresis enabled, modulo ADC testbed comprising off-the-shelf electronic components. Thus, by capitalizing on a collaboration between hardware and algorithms, our paper enables an end-to-end pipeline for HDR sampling allowing more flexible hardware implementations. [ABSTRACT FROM AUTHOR]

HVDC grid protection with adequate speed and reliability is required to minimise the impact of DC faults. In particular, fast breaker failure backup protection algorithms are needed to meet the expected reliability requirements of HVDC grids. In this paper, existing breaker failure backup protection algorithms are shown inadequate to detect partial failures like a single module failure of breakers with a modular structure. This paper proposes a backup protection algorithm which rapidly detects a DC breaker failure based on estimating the counter-voltage created by the energy absorption branch during an interruption. The performance of the proposed algorithm is evaluated using a four-terminal test network with both hybrid and mechanical DC breaker technologies. The simulation results show that the proposed algorithm is able to quickly detect both complete and partial failures of the two breaker technologies even considering measurement errors, noise and ageing of the energy absorption components. [ABSTRACT FROM AUTHOR]

Adversarial attacks have been extensively studied in recent years since they can identify the vulnerability of deep learning models before deployed. In this paper, we consider the black-box adversarial setting, where the adversary needs to craft adversarial examples without access to the gradients of a target model. Previous methods attempted to approximate the true gradient either by using the transfer gradient of a surrogate white-box model or based on the feedback of model queries. However, the existing methods inevitably suffer from low attack success rates or poor query efficiency since it is difficult to estimate the gradient in a high-dimensional input space with limited information. To address these problems and improve black-box attacks, we propose two prior-guided random gradient-free (PRGF) algorithms based on biased sampling and gradient averaging, respectively. Our methods can take the advantage of a transfer-based prior given by the gradient of a surrogate model and the query information simultaneously. Through theoretical analyses, the transfer-based prior is appropriately integrated with model queries by an optimal coefficient in each method. Extensive experiments demonstrate that, in comparison with the alternative state-of-the-arts, both of our methods require much fewer queries to attack black-box models with higher success rates. [ABSTRACT FROM AUTHOR]

Adversarial attacks have been extensively studied in recent years since they can identify the vulnerability of deep learning models before deployed. In this paper, we consider the black-box adversarial setting, where the adversary needs to craft adversarial examples without access to the gradients of a target model. Previous methods attempted to approximate the true gradient either by using the transfer gradient of a surrogate white-box model or based on the feedback of model queries. However, the existing methods inevitably suffer from low attack success rates or poor query efficiency since it is difficult to estimate the gradient in a high-dimensional input space with limited information. To address these problems and improve black-box attacks, we propose two prior-guided random gradient-free (PRGF) algorithms based on biased sampling and gradient averaging, respectively. Our methods can take the advantage of a transfer-based prior given by the gradient of a surrogate model and the query information simultaneously. Through theoretical analyses, the transfer-based prior is appropriately integrated with model queries by an optimal coefficient in each method. Extensive experiments demonstrate that, in comparison with the alternative state-of-the-arts, both of our methods require much fewer queries to attack black-box models with higher success rates. [ABSTRACT FROM AUTHOR]

Long short-term memory (LSTM) is a type of powerful deep neural network that has been widely used in many sequence analysis and modeling applications. However, the large model size problem of LSTM networks make their practical deployment still very challenging, especially for the video recognition tasks that require high-dimensional input data. Aiming to overcome this limitation and fully unlock the potentials of LSTM models, in this paper we propose to perform algorithm and hardware co-design towards high-performance energy-efficient LSTM networks. At algorithm level, we propose to develop fully decomposed hierarchical Tucker (FDHT) structure-based LSTM, namely FDHT-LSTM, which enjoys ultra-low model complexity while still achieving high accuracy. In order to fully reap such attractive algorithmic benefit, we further develop the corresponding customized hardware architecture to support the efficient execution of the proposed FDHT-LSTM model. With the delicate design of memory access scheme, the complicated matrix transformation can be efficiently supported by the underlying hardware without any access conflict in an on-the-fly way. Our evaluation results show that both the proposed ultra-compact FDHT-LSTM models and the corresponding hardware accelerator achieve very high performance. Compared with the state-of-the-art compressed LSTM models, FDHT-LSTM enjoys both order-of-magnitude reduction (more than $1000 \times$ 1000 × ) in model size and significant accuracy improvement (0.6% to 12.7%) across different video recognition datasets. Meanwhile, compared with the state-of-the-art tensor decomposed model-oriented hardware TIE, our proposed FDHT-LSTM architecture achieve $2.5\times$ 2. 5 × , $1.46\times$ 1. 46 × and $2.41\times$ 2. 41 × increase in throughput, area efficiency and energy efficiency, respectively on LSTM-Youtube workload. For LSTM-UCF workload, our proposed design also outperforms TIE with $1.9\times$ 1. 9 × higher throughput, $1.83\times$ 1. 83 × higher energy efficiency and comparable area efficiency. [ABSTRACT FROM AUTHOR]

Blockchain technologies can enable secure computing environments among mistrusting parties. Permissioned blockchains are particularly enlightened by companies, enterprises, and government agencies due to their efficiency, customizability, and governance-friendly features. Obviously, seamlessly fusing blockchain and cloud computing can significantly benefit permissioned blockchains; nevertheless, most blockchains implemented on clouds are originally designed for loosely-coupled networks where nodes communicate asynchronously, failing to take advantages of the closely-coupled nature of cloud servers. In this paper, we propose an innovative cloud-oriented blockchain – CloudChain, which is a modularized three-layer system composed of the network layer, consensus layer, and blockchain layer. CloudChain is based on a shared-memory model where nodes communicate synchronously by direct memory accesses. We realize the shared-memory model with the Remote Direct Memory Access technology, based on which we propose a shared-memory consensus algorithm to ensure presistence and liveness, the two crucial blockchain security properties countering Byzantine nodes. We also implement a CloudChain prototype based on a RoCEv2-based testbed to experimentally validate our design, and the results verify the feasibility and efficiency of CloudChain. [ABSTRACT FROM AUTHOR]

A flat-field correction method is proposed for multiple measured hyperspectral microscopy imaging in this paper. As the most crucial preprocessing process in quantitative microscopic analysis, flat-field correction solves the uneven illumination caused by vignetting in microscopic images, and guarantees the precision of spatial and spectral information in hyperspectral microscopic imaging. In order to carry out flat-field correction and extract uneven illumination among groups of hyperspectral microscopic data containing hundreds of bands simultaneously, two properties of vignetting have been exploited: i) low-rank property is reflected by little information contained in vignetting; ii) local smoothness can be observed as a gradual change in brightness of vignetting, which is typically equivalent to the sparseness in spatial frequency domain. Combining the two properties above, a novel Low Rank Smooth Flat-field Correction (LRSFC) model modified from common orthogonal basis extraction is proposed, while an optimization is solved based on alternating direction multiplier method (ADMM), obtaining a unique flat-field term with low-rank and smooth properties. Qualitative and quantitative experimental assessments indicate that LRSFC does not add extra cell texture to the extracted flat-field term, whose performance appears prior to other state-of-the-art flat-field correction methods. [ABSTRACT FROM AUTHOR]

Nonconvex constraints are valuable regularizers in many optimization problems. In particular, sparsity constraints have had a significant impact on sampling theory, where they are used in compressed sensing and allow structured signals to be sampled far below the rate traditionally prescribed. Nearly, all of the theory developed for compressed sensing signal recovery assumes that samples are taken using linear measurements. In this paper, we instead address the compressed sensing recovery problem in a setting where the observations are nonlinear. We show that, under conditions similar to those required in the linear setting, the iterative hard thresholding algorithm can be used to accurately recover sparse or structured signals from few nonlinear observations. Similar ideas can also be developed in a more general nonlinear optimization framework. In the second part of this paper, we therefore present related result that shows how this can be done under sparsity and union of subspaces constraints, whenever a generalization of the restricted isometry property traditionally imposed on the compressed sensing system holds. [ABSTRACT FROM PUBLISHER]

The integration of the variable renewable energies makes the operation conditions of the power system ever-changeable. Consequently, the power system operational reliability evaluation is increasingly important. This paper introduces the concept of decision-dependent uncertainty (DDU) in the operational reliability evaluation. Unlike the exogenous uncertainties, DDU reveals that the decisions of the system operation could significantly affect the resolution of the uncertainties which influence the reliability metrics. In this paper, the proposed DDU modeling method links the device reliability indices, i.e., the forced outage rate, and the operational-decision variables. The impacts of DDU on operational reliability are analyzed based on a reliability-constrained stochastic unit commitment (UC) model. An adaptive reliability improvement UC (ARIUC) algorithm is proposed to efficiently solve the problem. Case studies underline the necessity of considering DDU in power system operational reliability evaluations. [ABSTRACT FROM AUTHOR]

Co-simulation of heterogeneous systems allows for in-depth analysis of various aspects of power systems’ operation while staying within the environments of the simulation tools that are best fit to represent their respective domains. Equipped with a proprietary co-simulation platform, the paper focuses on the issue of power-conjugate coupling between parts of power grids modeled in transient stability and electromagnetic transient simulation tools. The problems of co-simulation stability and precision in presence of delays are tackled by means of designing a proper coupling interface. It is shown that two established interface methods – the V-I method and the Transmission Line Interface – are special cases of a generalized interface framework proposed in the paper. Moreover, a new interface algorithm is described by parametrizing the generalized framework. Analytical tools are also formulated to aid in the analysis of interface stability and precision via the concepts of passivity and transparency. Simulation results of benchmark systems of various complexity demonstrate the application of the developed power coupling interface. [ABSTRACT FROM AUTHOR]

This paper presents a distributionally robust network-constrained unit commitment (DR-NCUC) model considering AC network modeling and uncertainties of demands and renewable productions. The proposed model characterizes uncertain parameters using a data-driven ambiguity set constructed by training samples. The non-convex AC power flow equations are approximated by convex quadratic and McCormick relaxations. Since the proposed min-max-min DR-NCUC problem cannot be solved directly by available solvers, a new decomposition algorithm with proof of convergence is reported in this paper. The master problem of this algorithm is solved using both primal and dual cuts, while the max-min sub-problem is solved using the primal-dual hybrid gradient method, obviating the need for using duality theory. Also, an active set strategy is proposed to enhance the tractability of the decomposition algorithm by ignoring the subset of inactive constraints. The proposed model is applied to a 6-bus test system and the IEEE 118-bus test system under different conditions. These case studies illustrate the performance of the proposed DR-NCUC model to characterize uncertainties and the superiority of the proposed decomposition algorithm over other decomposition approaches using either primal or dual cuts. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the convergence speed of the Arimoto-Blahut algorithm. For many channel matrices, the convergence speed is exponential, but for some channel matrices it is slower than exponential. By analyzing the Taylor expansion of the defining function of the Arimoto-Blahut algorithm, we will make the conditions clear for the exponential or slower convergence. The analysis of the slow convergence in this paper is new. Based on this analysis, we will compare the convergence speeds of the Arimoto-Blahut algorithm numerically with the values obtained in our theorems for several channel matrices. The purpose of this paper is to obtain a complete understanding of the convergence speed of the Arimoto-Blahut algorithm. [ABSTRACT FROM AUTHOR]

Flexible DC distribution networks have been widely developed because of their advantages of high efficiency, low cost, and easy access to renewable energy. However, as distribution networks have more ends than the two-terminal transmission line, it is more challenging to protect them and locate their faults. Therefore, this paper proposes a modified T-source circuit breaker to protect against DC faults. Based on the proposed circuit breaker, an integral fault location method using double-terminal asynchronous data is proposed. The accuracy of the algorithm is not affected by the fault resistance. There are no differential terms in the algorithm, which greatly reduces the sensitivity to noise. The integral algorithm can remain steady when the voltage and current are zero in oscillation and attenuation periods. This constitutes the main contribution of this paper. Finally, it is verified by simulation and experiment that the proposed circuit breaker can isolate the power source within a short time in the typical DC distribution network. Under a noise of 30 dB for simulation, the location error of the proposed algorithm is <0.4% when the fault resistance is 0.5 Ω–500 Ω. [ABSTRACT FROM AUTHOR]

This paper proposes a novel inertia-enhanced distributed control method to complement the inertia of microgrids. The rate of change of frequency (RoCoF) and the rate of change of voltage (RoCoV) are employed in this paper to quantify the frequency inertia and voltage inertia, respectively. Then, a fully distributed algorithm with constrained changing rates is proposed. By bounding the changing rates of frequency and voltage during the consensus control, the algorithm can address the consensus problem while enhancing the inertia of microgrids. Compared with most inertia control methods, the proposed method can utilize the reserve power of scattered DGs to supply inertia. Besides, it performs better under disturbances and delays than conventional distributed control methods. The effectiveness of the proposed method is validated by several cases in MATLAB/Simulation and a hardware experiment. [ABSTRACT FROM AUTHOR]

This paper studies an unmanned aerial vehicle (UAV)-assisted wireless powered IoT network, where a rotary-wing UAV adopts fly-hover-communicate protocol to successively visit IoT devices in demand. During the hovering periods, the UAV works on full-duplex mode to simultaneously collect data from the target device and charge other devices within its coverage. Practical propulsion power consumption model and non-linear energy harvesting model are taken into account. We formulate a multi-objective optimization problem to jointly optimize three objectives: maximization of sum data rate, maximization of total harvested energy and minimization of UAV’s energy consumption over a particular mission period. These three objectives are in conflict with each other partly and weight parameters are given to describe associated importance. Since IoT devices keep gathering information from the physical surrounding environment and their requirements to upload data change dynamically, online path planning of the UAV is required. In this paper, we apply deep reinforcement learning algorithm to achieve online decision. An extended deep deterministic policy gradient (DDPG) algorithm is proposed to learn control policies of UAV over multiple objectives. While training, the agent learns to produce optimal policies under given weights conditions on the basis of achieving timely data collection according to the requirement priority and avoiding devices’ data overflow. The verification results show that the proposed MODDPG (multi-objective DDPG) algorithm achieves joint optimization of three objectives and optimal policies can be adjusted according to weight parameters among optimization objectives. [ABSTRACT FROM AUTHOR]

This paper presents a nonlinear dynamic simulation model of an ultracapacitor (UC) bank and the associated control system. The control system at hand consists of two levels: the lower level controls the inverter of the UC bank, while the upper control level is responsible for providing charging/discharging active power set points to be followed by the lower control level. This paper focuses on the development of the upper control level for frequency control. Specifically, two simulation case studies are developed so as to assess the performance of the proposed control framework. In the first case study the upper control level is developed using a classical Proportional-Integral-Derivative (PID) controller. In the second case study the upper control level is devised using a Model Predictive Control (MPC) algorithm based on internal linear prediction model of a nonlinear UC bank. In both cases, a nonlinear UC bank simulation model is used. The simulation case studies are modelled and tested in Matlab/Simulink. The response of the MPC-controlled UC bank is compared to the 3 existing PID-control algorithms for frequency control. The simulation results show that the MPC algorithm outperforms the conventional PID controllers. [ABSTRACT FROM AUTHOR]

Conventional model predictive control (MPC) for three-level active neutral point clamped converter (ANPC) utilizes weighting factors to achieve the optimal control of multiple control objectives in a single cost function. However, the selection of these weighting factors has an impact on the performance of the controlled objectives significantly. Tuning of weighting factors is usually tedious and lacks theoretical background. Moreover, the predictive and evaluation process for multiple objectives optimization have to be carried out by enumerating all admissible switching states within one loop. To simplify the complexity of this process and eliminate the effect of weighting factors, this paper proposes a cascaded predictive control scheme for a 3L-ANPC inverter fed induction machine (IM) drive. With the proposed approach, three separate cost functions for three control objectives, stator flux vector, neutral point voltage and device loss distribution are evaluated in a cascaded way, so that the optimization of these control objectives is performed independently. A 3L-ANPC inverter driven IM drive is studied in this paper to verify the effectiveness of the proposed algorithm. Experimental results in different operating conditions confirm that the proposed method achieves satisfactory steady-state and transient performances comparable to the conventional predictive control approach. The weighting factors used in the conventional method are eliminated and the computational effort is reduced by 68% compared to the conventional method without any sacrifice in the drive performance. [ABSTRACT FROM AUTHOR]

Deadbeat predictive current control (DPCC) can predict motor behavior based on SPMSM model. However, during the operation of motor system, motor parameters (such as stator inductance and flux linkage) vary frequently according to different working conditions, which may lead to controller parameter mismatch, causing current harmonic content to increase and efficiency to decrease. In order to solve these problems caused by parameter variation, first, this paper proposes a current prediction error model by considering uncertainties of model parameters. Second, stator inductance and flux linkage are decoupled based on current prediction error model, which can reduce the interaction between parameters. Finally, the Kalman Filter (KF) algorithm is presented to filter the decoupled parameters. It is shown that the stator inductance and flux linkage can be identified accurately and the complexity of computation can be simplified. The traditional DPCC method, Extended Kalman Filter (EKF) based DPCC method and the proposed DPCC method are comparatively analyzed in this paper. Simulation and experiment indicate that the proposed parameter decoupling identification method can effectively reduce current harmonic content, current fluctuation and current tracking errors caused by parameter mismatch. [ABSTRACT FROM AUTHOR]

This paper presents a simple pulse width modulation algorithm for control of an ultracapacitor based energy storage system used for source and load support applications. As opposed to dual loop control philosophy that is widely used for backup applications, this paper presents a simple single loop current control that is only useful for controlling the ultracapacitor based DC/DC converters used in source and load support applications. The proposed PWM blocking method necessitates the DC/DC converter to operate in five states and takes into consideration the essential operational limits associated with the ultracapacitors. The performance of the proposed algorithm is verified experimentally using a 24 V laboratory prototype setup. Further, the shortcomings of dual loop control when applied to source and load support applications are demonstrated. [ABSTRACT FROM AUTHOR]

This paper presents an overview of the geometric partitioning mode (GPM) algorithm that is a part of the most recent Versatile Video Coding (VVC) standard. The GPM algorithm aims to increase the partitioning precision of moving objects using non-rectangular and asymmetric rectangular partitions on top of the conventional rectangular block partitioning structure of VVC. Novel features of GPM contributing to the increase in coding efficiency and the reduction in encoder and decoder complexity are detailed and analyzed in this paper. Evaluated with VVC test model version 8.0 under the joint video experts team common test conditions, experimental results show that the presented GPM algorithm provides luma Bjøntegaard Delta rate reduction of 0.70% for random access and of 1.55% for low delay with B slices configurations, with roughly 3% to 5% additional encoding time and negligible decoder runtime change. Furthermore, as GPM provides more precise partitions for the boundaries of the moving objects, an improvement of visual quality is seen in GPM coded sequences. [ABSTRACT FROM AUTHOR]

This paper presents a new method for selecting a patient specific forward model to compensate for anatomical variations in electrical impedance tomography (EIT) monitoring of neonates. The method uses a combination of shape sensors and absolute reconstruction. It takes advantage of a probabilistic approach which automatically selects the best estimated forward model fit from pre-stored library models. Absolute/static image reconstruction is performed as the core of the posterior probability calculations. The validity and reliability of the algorithm in detecting a suitable model in the presence of measurement noise is studied with simulated and measured data from 11 patients. The paper also demonstrates the potential improvements on the clinical parameters extracted from EIT images by considering a unique case study with a neonate patient undergoing computed tomography imaging as clinical indication prior to EIT monitoring. Two well-known image reconstruction techniques, namely GREIT and tSVD, are implemented to create the final tidal images. The impacts of appropriate model selection on the clinical extracted parameters such as center of ventilation and silent spaces are investigated. The results show significant improvements to the final reconstructed images and more importantly to the clinical EIT parameters extracted from the images that are crucial for decision-making and further interventions. [ABSTRACT FROM AUTHOR]

This paper proposes on-driving experience sharing algorithms at junctions in infrastructure-assisted vehicles-to-everything networks. For the purpose, a millimeter-wave (mmWave) technology is used because it provides multi-Gbps data rates which is helpful for handling users’ short stay times at junctions and spatial reuse due to high beam directionality which is helpful for interference-avoidance among densely deployed vehicles at junctions. To realize on-driving experience sharing, the proposed algorithms focus on joint resource allocation and scheduling for 3GPP-compliant multiple unicast vehicle-to-vehicle (V2V) communications where the vehicles are group leaders (GLs) in 3GPP Mode 4(d). The resource allocation stands for the roadside unit (RSU) allocation to scheduled V2V GL links where RSU is essentially required for overcoming blockage by establishing two-hop relaying. Because vehicles stay for short times at junctions, this paper designs two algorithms without or with delay considerations. Without delay considerations, the joint optimization of RSU allocation and scheduling was originally formulated as mixed 0-1 non-convex optimization. However our proposed algorithm reformulates the problem into mixed 0-1 convex optimization, which is computationally easier to solve. With delay considerations, our proposed algorithm dynamically controls video contents frame rates for time-average on-driving video sharing quality maximization subject to delay constraints, inspired by Lyapunov optimization. Extensive simulation results demonstrate that our algorithms can significantly outperform in a variety of scenarios. Furthermore, we conduct the cost analysis for the proposed algorithms in terms of capital expenditure (CAPEX) and operating expenditure (OPEX). [ABSTRACT FROM AUTHOR]

The combination of non-orthogonal multiple access (NOMA) and intelligent reflecting surface (IRS) is an efficient solution to significantly enhance the energy efficiency of the wireless communication system. In this paper, a downlink multi-cluster NOMA network is considered, where each cluster is supported by one IRS. This paper aims to minimize the transmit power by jointly optimizing the beamforming, the power allocation and the phase shift of each IRS. The formulated problem is non-convex and challenging to be solved due to the coupled variables, i.e., the beamforming vector, the power allocation coefficient and the phase shift matrix. To address this non-convex problem, an alternating optimization based algorithm is proposed. Specifically, the primal problem is divided into two subproblems for beamforming optimization and phase shifting feasiblity, where the two subproblems are solved iteratively. Moreover, to guarantee the feasibility of the beamforming optimization problem, an iterative algorithm is proposed to search the feasible initial points. To reduce the complexity, a simplified algorithm based on partial exhaustive search for this system model is also proposed. Simulation results demonstrate that the proposed alternating algorithm can yield a better performance gain than the partial exhaustive search algorithm, NOMA with random IRS phase shift scheme and OMA-IRS scheme. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of instrument current transformers technical state assessment based on machine learning methods. The introductory parts of the paper provide a detailed analysis of modern methods and approaches for technical state assessment of high-voltage power equipment of power plants and substations as well as a review of modern software tools and the latest trends in the given field of study. Justification of the relevance of the presented research aimed at instrument current transformers technical state assessment is provided along with the motivation for machine learning methods application for improvement of the accuracy and quality of high-voltage equipment state classification. Within the framework of the study, a comparative analysis of gradient boosting on decision trees and random forest algorithms was carried out for a given mathematical problem formulation. The main stages of processing the initial dataset are proposed as a step-by-step procedure, including feature extraction, feature transformation, feature interactions, etc. The outperforming efficiency of gradient boosting on decision trees algorithm was validated for real power equipment fleet. The resulting classification quality metrics of current transformers technical state assessment, Precision and Recall, are estimated to be 87.1% and 83.7%, correspondingly. [ABSTRACT FROM AUTHOR]

This paper presents an overview of the decoder-side motion vector refinement (DMVR) algorithm in the Versatile Video Coding (VVC) standard. The proposed DMVR algorithm aims to increase the prediction accuracy of the blocks coded in merge mode using the bilateral matching-based refinement method. Compared with previous decoder-side motion vector derivation approaches, the proposed method significantly increases the coding efficiency without signaling additional side information. Furthermore, the hardware implementation considerations of the DMVR design are particularly focused in this study. This paper details and analyzes the novel features of DMVR contributing to the increase in coding efficiency and the reduction in computational complexity and implementation difficulty. Experimental results based on the VVC test model version 8.0 demonstrate that average Bjøntegaard Delta rate savings of 0.80 % and 2.81 % are achieved for the “tool-off” and “tool-on” test configurations, respectively. Moreover, 4 % additional decoding time and negligible additional external memory bandwidth requirements of DMVR based on the common test conditions for VVC are reported. [ABSTRACT FROM AUTHOR]

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is well known to be achievable with dirty paper coding (DPC), we are interested in the simpler linearly precoded transmission schemes. In particular, we focus on linear precoding schemes combined with rate-splitting (RS). First, we derive an achievable rate region with minimum mean square error (MMSE) precoding at the transmitter and joint decoding of the sub-messages at the receivers. Then, we study the achievable sum rate of this scheme and obtain two findings: 1) an analytically tractable upper bound on the sum rate that is shown numerically to be a close approximation, and 2) how to reduce the number of active streams – crucial to the overall complexity – while preserving the sum rate to within a constant loss. The latter results in two practical algorithms: a stream elimination algorithm and a stream ordering algorithm. Finally, we investigate the constant-gap optimality of linearly precoded RS with respect to the capacity. Our result reveals that, while the achievable rate of linear precoding alone can be arbitrarily far from the capacity, the introduction of RS can help achieve the capacity region to within a constant gap in the two-user case. Nevertheless, we prove that the RS scheme’s constant-gap optimality does not extend to the three-user case. Specifically, we show, through a pathological example, that the gap between the sum rate and the sum capacity can be unbounded. [ABSTRACT FROM AUTHOR]

In this paper, we present a low-complexity recursive approach for massive and scalable code-domain nonorthogonal multiple access (NOMA) with applications to emerging low-capacity scenarios. The problem definition in this paper is inspired by three major requirements of the next generations of wireless networks. Firstly, the proposed scheme is particularly beneficial in low-capacity regimes which is important in practical scenarios of utmost interest such as the Internet-of-Things (IoT) and massive machine-type communication (mMTC). Secondly, we employ code-domain NOMA to efficiently share the scarce common resources among the users. Finally, the proposed recursive approach enables code-domain NOMA with low-complexity detection algorithms that are scalable with the number of users to satisfy the requirements of massive connectivity. To this end, we propose a novel encoding and decoding scheme for code-domain NOMA based on factorizing the pattern matrix, for assigning the available resource elements to the users, as the Kronecker product of several smaller factor matrices. As a result, both the pattern matrix design at the transmitter side and the mixed symbols’ detection at the receiver side can be performed over matrices with dimensions that are much smaller than the overall pattern matrix. Consequently, this leads to significant reduction in both the complexity and the latency of the detection. We present the detection algorithm for the general case of factor matrices. The proposed algorithm involves several recursions each involving certain sets of equations corresponding to a certain factor matrix. We then characterize the system performance in terms of average sum rate, latency, and detection complexity. Our latency and complexity analysis confirm the superiority of our proposed scheme in enabling large pattern matrices. Moreover, our numerical results for the average sum rate show that the proposed scheme provides better performance compared to straightforward code-domain NOMA with comparable complexity, especially at low-capacity regimes. [ABSTRACT FROM AUTHOR]

Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are still under investigation. This paper covers some of the recent developments regarding the weight enumerator and the capacity-achieving properties of RM codes, as well as some of the algorithmic developments. In particular, the paper discusses the recent connections established between RM codes, thresholds of Boolean functions, polarization theory, hypercontractivity, and the techniques of approximating low weight codewords using lower degree polynomials (when codewords are viewed as evaluation vectors of degree r polynomials in m variables). It then overviews some of the algorithms for decoding RM codes. It covers both algorithms with provable performance guarantees for every block length, as well as algorithms with state-of-the-art performances in practical regimes, which do not perform as well for large block length. Finally, the paper concludes with a few open problems. [ABSTRACT FROM AUTHOR]

High-performance multicast packet switching technologies are evolving to meet the growing demand for scalability on the Internet and datacenters, etc. Implementing a high-performance switch/router relies on a polynomial-time group membership query algorithm within the Packet Forwarding Engines (PFEs) to determine whether a packet is forwarded through an egress. Among these, Bloom filter (BF)-based and Residue Number System (RNS)-based are being considered as two representatives of the membership query algorithms. However, both approaches suffer from some fatal weaknesses such as false-positive probability and time inefficiencies, especially for a carrier-grade PFE with high port-density features. According to similar properties of the RNS, we propose a simplified forwarding algorithm in this paper, named Per-Port Prime Filter Array (P3FA). The simulation results indicate that the P3FA can significantly improve space efficiencies under specific lower egress-diversities conditions. Under the same space constraints, P3FA improves multicast and unicast time efficiency by 1 to 4 orders of magnitude in the port-density 16–1024 range compared to previous works. Although it comes at the expense of hardware cost, it is still acceptable compared to recently improved previous work. [ABSTRACT FROM AUTHOR]