In this paper, a simulation model and practical testbed for green Internet of Things (IoT) edge devices are proposed based on solar harvester with constant voltage-maximum power point tracking (CV-MPPT) technique. Billions of connected edge devices represent the essential part of the IoT through the IP-enabled sensor networks based on IPv6 over Low power Wireless Personal Area Network (6LoWPAN). In traditional IoT edge devices, the stored energy in the non-rechargeable battery determines the node lifetime while it is being depleted with time. Therefore, purchasing billions of such batteries is costly and must be disposed of efficiently. This paper is aimed at simulating and implementing a new class of green IoT edge devices that can report

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

Recently, detecting dynamic patterns for growing communities in social networks have attracted significant attention. The objective of dynamic community detection is to analyze and identify clusters in complex networks that change over time. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of dynamic community detection. Although current evolutionary algorithms for identifying community structure can traverse extensive areas of partition space, they often become stuck in local minima. In addition, limited studies have addressed this issue by integrating local search strategies with evolutionary algorithms for community identification. This paper in