Search

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]

In a recent paper published in this very journal, the "Bounded fuzzy possibilistic method" (BFPM) was proposed. We point out that there are some critical flaws in the said algorithm, which makes the results presented therein highly questionable. In particular, the method does not generate meaningful cluster membership degrees and fails to converge when run on some well-known benchmark data sets. [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]

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]

A review, recently published in this journal by Fang (2019), showed that methods trained for the prediction of protein stability changes upon mutation have a very critical bias: they neglect that a protein variation (A- > B) and its reverse (B- > A) must have the opposite value of the free energy difference (ΔΔGAB = − ΔΔGBA). In this letter, we complement the Fang's paper presenting a more general view of the problem. In particular, a machine learning-based method, published in 2015 (INPS), addressed the bias issue directly. We include the analysis of the missing method, showing that INPS is nearly insensitive to the addressed problem. [ABSTRACT FROM AUTHOR]