In this work, an efficient energy management (EEM) approach is proposed to merge IoT technology to enhance electric smart meters by working together to satisfy the best result of the electricity customer's consumption. This proposed system is called an integrated Internet of things for electrical smart meter (2IOT-ESM) architecture. The electric smart meter (ESM) is the first and most important technique used to measure the active power, current, and energy consumption for the house’s loads. At the same time, the effectiveness of this work includes equipping ESM with an additional storage capacity that ensures that the measurements are not lost in the event of a failure or sudden outage in WiFi network. Then then these

In this work, an efficient energy management (EEM) approach is proposed to merge IoT technology to enhance electric smart meters by working together to satisfy the best result of the electricity customer's consumption. This proposed system is called an integrated Internet of things for electrical smart meter (2IOT-ESM) architecture. The electric smart meter (ESM) is the first and most important technique used to measure the active power, current, and energy consumption for the house’s loads. At the same time, the effectiveness of this work includes equipping ESM with an additional storage capacity that ensures that the measurements are not lost in the event of a failure or sudden outage in WiFi network. Then then these measurement

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

An Optimal Algorithm for HTML Page Building Process

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t