Search

In monitoring transmission line external damage prevention, due to the limited memory computing power of the equipment, the image needs to be transmitted to the data center at regular intervals, resulting in a high false negative rate. Therefore, this paper proposes a target detection method based on lightweight YOLOv5s. First, DSConv and improved E‐ELAN are used in Backbone to reduce the model's parameters. Then, GSConv and VoV‐GSCSP are introduced in Neck to reduce the complexity of the model. Finally, the Mish activation function achieves more effective feature transfer. According to the experimental findings, the proposed model's parameters are about 37% smaller than the original model's, and the calculation amount is about 53% smaller. The detection accuracy on the self‐built data set is the same, which proves that the proposed algorithm can reduce the model while maintaining high detection performance. It has specific practical significance for the terminal real‐time detection of external mechanical damage targets. © 2024 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

YOLOv7 is one of the most effective algorithms for one‐stage detectors. However, when it is applied to pedestrian detection tasks in the industrial scene, it is still challenging for complex environments and multi‐scale changes of pedestrians. This paper proposes a new pedestrian detector for the industrial scene based on improved YOLOv7‐tiny and named as GP‐YOLO. First, the neck of YOLOv7‐tiny is replaced by RepGFPN structure, make full use of multi‐scale features to enhance the detection accuracy of objects with large‐scale changes. Second, a new gnconv branch is added to the feature fusion module, and the high‐order spatial interaction capability is introduced to further enhance the target detection accuracy. Finally, a lightweight method based on PModule is proposed, on this basis, a PConv bottleneck is designed to reduce the FLOPs and enhance the feature extraction. Experiments on a self‐made Industrial Pedestrian Data set show that before lightweight, the proposed algorithm achieves a 3.2% improvement in mAP@0.5:0.95 and a 3.7% improvement in Recall compared to the baseline YOLOv7‐tiny. After lightweight GP‐YOLO, compared to non‐lightweight, parameters and FLOPs are decreased by 26% and 23%, respectively, the mAP@0.5:0.95 is decreased by only 1.1% and the Recall is decreased by only 1.3%, which remains at a high level. Compared with baseline YOLOv7‐tiny, the lightweight GP‐YOLO has similar parameters and FLOPs, but the mAP@0.5:0.95 is increased by 2.1%, and the Recall is increased by 2.4%. © 2024 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

In this paper, a new dual mode blind equalization method using neighborhood symbol‐based decision and decision‐directed (NSBD‐DD) algorithm is proposed to equalize the satellite communication signals. The proposed algorithm adopts the combined cost function to employ the advantages of symbol decision algorithm and the decision‐directed algorithm, which can further improve the universality of the proposed algorithm. Compared with the conventional blind equalization algorithm, the compensation ability of intersymbol interference and convergence speed of the proposed algorithm can be improved simultaneously. To verify the performance of the proposed algorithm, the computer simulation is performed, and the simulation results show that the residual intersymbol interference of the 64QAM signals can be decreased to −50 dB under the satellite channel, which has 30 dB lower than multi‐modulus algorithm (MMA), 26 dB lower than NSBD algorithm, and 10 dB lower than SBD algorithm. And compared with SBD algorithm, the number of iterations required for the NSBD‐DD algorithm can be decreased from 8000 iterations to 6000 iterations, which convergence speed is increased by 25%. © 2023 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Machine learning (ML) has become a rising sophisticated technological application trend in the electrical industry in recent years. Such innovation provides optional methodologies for many existing applications, such as power and load profile forecasting, reliability evaluation, substation behavior detection and state observation of electrical equipment, and so on. This paper presents a review of various supervised and unsupervised ML techniques and applications for electrical power systems, including generation, transmission, distribution and micro‐grid. The algorithms and applications are mainly summarized from IEEE journals and the interest of this paper shows the roles and developments of most used algorithms and its corresponding extensions and performance in different applications. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

This paper introduces the concept of intermittently connected sensor networks where sensors are sleep most of time and become active randomly and rarely. In the networks, packet collision probability and power consumption can be reduced. Meanwhile, the delivery delay increases with the use of the low activation values. In this paper, we design the energy‐efficient intermittently connected sensor networks, considering this trade‐off of activation control. We first provide the algorithm that computes the optimal packet forwarding rule achieving the minimum delivery delay, which can be calculated using the activation rates. We then propose the activation rate control methods, which control the activation rates of the sensors based on the density of the sensors and/or the number of wake‐ups of sensors having relay packets. By doing this, we can improve the delay performance, while suppressing the increase in the packet collision probability and the power consumption of sensors. Through simulation experiments, we demonstrate the effectiveness of our activation control methods in the intermittently connected sensor networks. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Missing data is a prevailing problem in predictive analytics. In this paper, a winner‐take‐all (WTA) autoencoder‐based piecewise linear model is developed to solve the nonlinear regression problem under the missing value scenario, which consists of two parts: an overcomplete WTA autoencoder and a gated linear network. The overcomplete WTA autoencoder is a stacked denoising autoencoder (SDAE) designed to play two roles: (1) to estimate the missing values; (2) to realize a sophisticated partitioning by generating a broad set of binary gate control sequences. Besides, an iterative algorithm with renewed teacher signals is developed to train the SDAE. On the other hand, the gated linear network with the generated binary gate control sequences implements a flexible piecewise linear model for nonlinear regression. By composing a quasi‐linear kernel based on the gate control sequences, the piecewise linear model is then identified in the same way as a support vector regression. Experimental results have shown that our proposed hybrid model has a better performance than traditional models. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

A new image dehazing algorithm based on adaptive sky region is proposed in this paper, which shows good fidelity in sky region and satisfying visual effect in non‐sky region. For robust sky segmentation, we propose a rough‐to‐fine method that can make a balance between efficiency and accuracy. Considering distribution of haze is inconsistent, we divide the input image into three parts and calculate their atmospheric lights respectively. To solve the problem of invalid dark channel prior, we make an improvement for the transmission estimation. Finally, image fusion is taken as a post processing that can solve the problem of partial darkness and ensure a visual pleasing result. The experimental results for both synthetic and natural hazy images demonstrate that our algorithm performs comparable or even better results than the state‐of‐the‐art methods in terms of various measurement indexes, such as the PSNR, SSIM, and so forth. Besides, the proposed algorithm can be also applied in FPGA platform due to the optimized performance. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

In this paper, a new method is proposed to identify the parameters of roll motion equation using the response data of ship in regular waves. The proposed method is based on the fact that if the estimated parameters are close to the true parameters, then, its response are also close to the true response. Therefore, the parameter identification is achieved via minimizing the mean square error between the true response and the estimated response. To effectively solving the parameter minimization problem, an improved imperialist competition algorithm (ICA), called opposition based learning Gaussian bare bone imperialist competition algorithm (OBL‐GBBICA) is proposed. The proposed OBL‐GBBICA integrates the opposition learning and Gaussian sampling technique into ICA to enhance its exploration ability and speed up its convergence. Experimental results show that the proposed method can accurately identify the parameters of roll motion equation. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

This paper presents a novel distributed method for dynamic economic dispatch (DED) problems with cubic fuel cost functions based on the dual alternating direction method of multipliers (D‐ADMM) and interior point method (IPM). This scheme enables us to combine the excellent parallelism of ADMM with the superior convergence properties of the IPM. The idea adopted by the proposed algorithm is that the outer‐loop uses ADMM decoupling, and the inner‐loop uses IPM to solve the cubic polynomial optimization subproblems. When the unit set is divided into multiple partitions, D‐ADMM also has the nice central processing unit (CPU) runtime as the well as the number of iterations. In addition, we use a Decoupling‐Decomposition‐Backtracking and parallel improved multiple centrality corrections decoupling interior point method (DDB‐PIMCCD) to solve the aforementioned larger subproblems more efficiently. Finally, the numerical results, in both serial and parallel modes, on a set of 22 DED cases with the range of units from 8 to 1000 units show that the proposed method is very promising for large scale distributed DED problems. Because it can keep the unit information about each subset in secret to suit the market environment and can obtain high‐quality solutions with reasonable time. © 2020 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

In both the research and engineering fields, missing data is a serious problem that cannot be overlooked. Therefore, available datasets with missing data are a challenge to be modeled by conventional global prediction models. In this paper, we propose a hybrid model consisting of an autoencoder and a gated linear network for solving the regression problem under missing value scenario. A sophisticated modeling and identifying algorithm is developed. First, an extended affinity propagation (AP) clustering algorithm is applied to obtain a self‐organized competitive net dividing the datasets into several clusters. Second, a multiple imputation tool with top p% winner‐take‐all denoising autoencoders (DAE) is introduced to realize better predictions of missing values, in which rough estimates of missing values by using the mean imputation and similarity method within the clusters are used as teacher signals of DAE. Finally, a gated linear network is designed to construct a piecewise linear regression model with interpolations in the exact same way as a support vector regression with a quasilinear kernel composed using the cluster information obtained in the AP clustering step. Based on the experiments of five datasets, our proposed method demonstrates its effectiveness and robustness compared with other traditional kernels and state‐of‐the‐art methods, even on datasets with a large percentage of missing values. © 2020 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

The conventional artificial neural network (ANN) model is an effective way to detect harmonic signals. However, the solution of the model cannot converge when the initial value of the excitation function (IVEF) is not suitable, causing a large error in harmonic detection, especially in the case of power system noise. We improve the back propagation (BP) neural network (BNN) model by using an adjustable excitation function and the basic inertial algorithm in this paper. Based on this model and combined with the glowworm swarm optimization (GSO) algorithm, a harmonic/inter‐harmonic detection method is proposed. The network first uses an improved GSO algorithm with an adaptive step to optimize the IVEF of BNN. Then, BNN is trained at this initial value, so that amplitude, phase, and frequency of harmonics/inter‐harmonics can be obtained. The simulation data analyses show that that the method has good stability, convergence, strong anti‐noise ability, and ultrahigh detection accuracy. It can accurately separate the integer and non‐integer harmonics. Compared with the traditional ANN algorithm and Hanning‐FFT, the detection accuracy of this algorithm can be improved by 2–4 orders of magnitude. © 2020 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

The maximum correntropy criterion (MCC) algorithm has popularly been used in suppressing impulsive noise. It mainly relies on the choice of step size and kernel width. With the study of step size, this paper proposes a novel algorithm that updates the step size based on constructing a variable step size function that uses the moving weighted average algorithm to keep performance stable and sigmoid function to speed the convergence rate. The proposed algorithm is robust against impulsive noises and generates a large step size to accelerate the convergence in iteration beginning, and system mutation makes the system identification performance more stable when the error is small. Based on the improved variable kernel width maximum entropy criterion (IVKW‐MCC) algorithm, which overcomes the shortcoming of how to choose a reliable kernel width in the MCC algorithm, simulation results are compared with other MCC algorithms under impulsive noise interference. Simulations in the system identification scenarios show that the proposed algorithm has better performance in improving the convergence speed over other algorithms. © 2020 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Evolutionary algorithm (EA) is a generic term for optimization algorithms inspired by biological optimization processes in the natural world. Although EAs are widely applied to complex real‐world problems because they do not require mathematical expression of target problems, theoretical design methods of EAs have not been established. To solve this issue, this paper proposes an approach of designing EAs within an algorithm framework in which mathematical characteristics are derived, and it also presents a concrete framework for that purpose. The presented framework, Regulated Evolution Strategies (RES) provides a stability analysis result that contributes to designing algorithms with expected behavior. The RES framework has a high degree of freedom in designing algorithms, so that it is possible to incorporate various contrivances such as local improvement of samples and reduction of constraint violations in RES‐based algorithms while maintaining the stability analysis result. Numerical experiments prove that the RES framework has a capability for designing high‐performance EAs. © 2020 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Recently, multiperson tracking across non‐overlapping camera views is gaining increasing attention in the video surveillance field due to its importance for public security. Most existing methods find a correspondence of person images individually across each pair of adjacent two cameras. However, in such a naive approach, redundant matching where one of the person images is selected for the matching pair for several times, often occurs. It leads to tracking failure. To overcome this problem, in this paper, by considering the matching problem as an instance of the "marriage problem" that is well known in Economics, we propose a simultaneous image matching method for multiple persons based on the stable marriage algorithm. We confirmed that the proposed method outperforms some of the existing state‐of‐the‐art methods on several well‐known public datasets. © 2020 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]

Institute of Electrical and Electronics Engineers (IEEE) 802.11ax Spatial Reuse (SR) is a new feature in the IEEE 802.11 family, aiming at improving the spectrum efficiency and the network performance in dense deployments. The main and perhaps the only SR technique in that amendment is the Basic Service Set (BSS) Color. It aims at increasing the number of concurrent transmissions in a specific area, based on a newly defined Overlapping BSS/Preamble-Detection threshold. In this paper, we overview the latest developments introduced in the IEEE 802.11ax for the SR and propose a rate control algorithm developed to exploit the BSS Color scheme. Our proposed algorithm, Damysus is specifically designed to function in dense environments where other off-the-shelf algorithms show poor performance. Simulation results in various dense scenarios, show a clear performance improvement of up to 113% gain in throughput over the well known MinstrelHT algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the properties of the superior solution set search (SSSS) problem and point out the structural similarities between it and the multiobjective optimization problem. Based on the analyzed properties, we propose a new Firefly algorithm (FA) based on superior relations, which can search for the superior solution set by using the user's quantitative desire level as a search strategy. By introducing the distance of the problem space into the moving mechanism, FA makes it possible to search for multiple local optimal solutions by dividing the solution set into multiple groups. By analyzing this property of FA, we clarify the affinity between FA and the SSSS problem. We subsequently analyze the SSSS problem and FA, and discuss their properties together in a similar problem setting. We propose an FA based on superior relations as a new optimization technique for the superior solution set problem based on these analyses. Numerical experiments are then conducted using the SSSS problem and demonstrate the usefulness of the proposed method by comparing the performance of the proposed method with the conventional FA. © 2019 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]

Differential evolution algorithms have become one of the most competitive evolutionary algorithms, among which a chaotic differential evolution (CJADE) is a recently proposed state‐of‐the‐art variant. But CJADE still suffers from the premature convergence problem. This paper further improves CJADE by innovatively incorporating a success‐intensity‐based roulette wheel selection method into it. The resultant algorithm called SCJADE shows its superiority over its peer in terms of solution quality and convergence speed on IEEE CEC2017 optimization test suit. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Abstract: With the increased installation of renewable energy based distributed generations (DGs) in distribution systems, it brings about a change in the fault current level of the system and causes many problems in the current protection system. Hence, effective protection schemes are required to ensure safe and selective protection relay coordination in the power distribution system with DG units. In this paper, a novel adaptive protection scheme is proposed by integrating fault location with protection relay coordination strategies. An automated fault location method is developed using a two stage radial basis function neural network (RBFNN) in which the first RBFNN determines the fault distance from each source while the second RBFNN identifies the exact faulty line. After identifying the exact faulty line, then protection relay coordination is implemented. A new protection coordination strategy using the backtracking algorithm is proposed in which it considers the main protection algorithm to coordinate the operating states of relays so as to isolate the faulty line. Then a backup protection algorithm is considered to complete the protection coordination scheme for isolating the malfunction relays of the main protection system. Several case studies have been used to validate the accuracy of the proposed adaptive protection schemes. The results illustrate that the adaptive protection scheme is able to accurately identify faulty line and coordinate the relays in a power distribution system with DG units. The developed adaptive protection scheme is useful for assisting power engineers in performing service restoration quickly so as to decrease the total down time during faults. [Copyright &y& Elsevier]

Distributed, generation-based micro-grids are increasingly being used in the build-up of the modern power system. However, the protection of these micro-grids has many challenges. One of the important challenges is the coordination of directional overcurrent (DOC) relays. The optimization of the coordination of DOC relays is considered a nonlinear programming problem with pre-defined constrains. In this paper, the problem of the optimal coordination of DOC relays is solved using a multi-verse optimization (MVO) algorithm which is inspired from cosmology science. The proposed algorithm is tested by applying it to Institute of Electrical and Electronics Engineers (IEEE) 3 bus and IEEE 9 bus networks. The performance of the proposed algorithm is compared with the particle swarm optimization (PSO) algorithm when applied to both networks. All results show that the performance of the MVO algorithm is better than PSO in terms of its reduction of both the overall operating time (OT) of DOC relays and the computational burden of the computer solving the optimization problem. [ABSTRACT FROM AUTHOR]

Information about several papers discussed at 30th IEEE International Conference on Data Engineering (ICDE) which held in Chicago, Illinois in the U.S. from March 31, 2014 to April 4, 2014 is presented. Topics discussed include method to deploy hardware transactional memory (HTM) for concurrency control on database transactions, issues faced during exploratory search of large databases, and pattern containment and algorithms to answer graph pattern queries.