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]).

Most Internet of Vehicles (IoV) applications are delay-sensitive and require resources for data storage and tasks processing, which is very difficult to afford by vehicles. Such tasks are often offloaded to more powerful entities, like cloud and fog servers. Fog computing is decentralized infrastructure located between data source and cloud, supplies several benefits that make it a non-frivolous extension of the cloud. The high volume data which is generated by vehicles’ sensors and also the limited computation capabilities of vehicles have imposed several challenges on VANETs systems. Therefore, VANETs is integrated with fog computing to form a paradigm namely Vehicular Fog Computing (VFC) which provide low-latency services to mo

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

The water quality index is the most common mathematical way of monitoring water characteristics due to the reasons for the water parameters to identify the type of water and the validity of its use, whether for drinking, agricultural, or industrial purposes. The water arithmetic indicator method was used to evaluate the drinking water of the Al-Muthana project, where the design capacity was (40000) m3/day, and it consists of traditional units used to treat raw water. Based on the water parameters (Turb, TDS, TH, SO4, NO2, NO3, Cl, Mg, and Ca), the evaluation results were that the quality of drinking water is within the second category of the requirements of the WHO (86.658%) and the first category of the standard has not been met du

Classification of imbalanced data is an important issue. Many algorithms have been developed for classification, such as Back Propagation (BP) neural networks, decision tree, Bayesian networks etc., and have been used repeatedly in many fields. These algorithms speak of the problem of imbalanced data, where there are situations that belong to more classes than others. Imbalanced data result in poor performance and bias to a class without other classes. In this paper, we proposed three techniques based on the Over-Sampling (O.S.) technique for processing imbalanced dataset and redistributing it and converting it into balanced dataset. These techniques are (Improved Synthetic Minority Over-Sampling Technique (Improved SMOTE),  Border

In this paper, our purpose is to study the classical continuous optimal control (CCOC)  for quaternary nonlinear parabolic boundary value problems (QNLPBVPs). The existence and uniqueness theorem (EUTh) for the quaternary state vector solution (QSVS) of the weak form (WF) for the QNLPBVPs with a given quaternary classical continuous control vector (QCCCV) is stated and proved via the Galerkin Method (GM) and the first compactness theorem under suitable assumptions(ASSUMS). Furthermore, the continuity operator for the existence theorem of a QCCCV dominated by the QNLPBVPs is stated and proved under suitable conditions.

Cyber-attacks keep growing. Because of that, we need stronger ways to protect pictures. This paper talks about DGEN, a Dynamic Generative Encryption Network. It mixes Generative Adversarial Networks with a key system that can change with context. The method may potentially mean it can adjust itself when new threats appear, instead of a fixed lock like AES. It tries to block brute‑force, statistical tricks, or quantum attacks. The design adds randomness, uses learning, and makes keys that depend on each image. That should give very good security, some flexibility, and keep compute cost low. Tests still ran on several public image sets. Results show DGEN beats AES, chaos tricks, and other GAN ideas. Entropy reached 7.99 bits per pix

In this work, a deep computational study has been conducted to assign several qualities for the graph ⁠. Furthermore, determine the amount of the dihedral subgroups in the Held simple group He through utilizing the attributes of gamma.