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

Find interested in the harmonization of variables and determinants of supply chain planning needs of the material, leading to the results start effective supply chain management, and end up quickly modify the sizes to suit the demand and turnover in the market. As well as identifying relationships between variables, and type of relationship used by the company with the processors and their feasibility, and indicate the level of interest and willingness to redesign the supply chain Company for Electrical Industries and build an integrated model for supply chain with the MRP system can be applied in the company.

Research depend on quantitative and descriptive method, It

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

Porous Silicon (PS) layer has been prepared from p-type silicon by electrochemical etching method. The morphology properties of PS samples that prepared with different current density has been study using atom force measurement (AFM) and it show that the Layer of pore has sponge like stricture and the average pore diameter of PS layer increase with etching current density increase .The x-ray diffraction (XRD) pattern indicated the nanocrystaline of the sample. Reflectivity of the sample surface is decrease when etching current density increases because of porosity increase on surface of sample. The photolumenses (PL) intensity increase with increase etching current density. The PL is affected by relative humidity (RH) level so we can use

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing