The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

Tor (The Onion Routing) network was designed to enable users to browse the Internet anonymously. It is known for its anonymity and privacy security feature against many agents who desire to observe the area of users or chase users’ browsing conventions. This anonymity stems from the encryption and decryption of Tor traffic. That is, the client’s traffic should be subject to encryption and decryption before the sending and receiving process, which leads to delay and even interruption in data flow. The exchange of cryptographic keys between network devices plays a pivotal and critical role in facilitating secure communication and ensuring the integrity of cryptographic procedures. This essential process is time-consuming, which causes del

Realizing the full potential of wireless sensor networks (WSNs) highlights many design issues, particularly the trade-offs concerning multiple conflicting improvements such as maximizing the route overlapping for efficient data aggregation and minimizing the total link cost. While the issues of data aggregation routing protocols and link cost function in a WSNs have been comprehensively considered in the literature, a trade-off improvement between these two has not yet been addressed. In this paper, a comprehensive weight for trade-off between different objectives has been employed, the so-called weighted data aggregation routing strategy (WDARS) which aims to maximize the overlap routes for efficient data aggregation and link cost

An impressed current cathodic protection system (ICCP) requires measurements of extremely low-level quantities of its electrical characteristics. The current experimental work utilized the Adafruit INA219 sensor module for acquiring the values for voltage, current, and power of a default load, which consumes quite low power and simulates an ICCP system. The main problem is the adaptation of the INA219 sensor to the LabVIEW environment due to the absence of the library of this sensor. This work is devoted to the adaptation of the Adafruit INA219 sensor module in the LabVIEW environment through creating, developing, and successfully testing a Sub VI to be ready for employment in an ICCP system. The sensor output was monitored with an Ardui

يتطلب نظام الحماية الكاثودية للتيار القسري (ICCP) قياسات كميات منخفضة للغاية من الخصائص الكهربائية. استخدم العمل التجريبي الحالي وحدة مستشعر Adafruit INA219 للحصول على  قيم الجهد والتيار وقدرة  الحمل الافتراضي الذي يستهلك طاقة منخفضة جدًا تحاكي نظام ICCP. تكمن المشكلة الرئيسية في تكييف مستشعر INA219 مع بيئة LabVIEW بسبب عدم وجود مكتبة المستشعر هذا. تم تخصيص هذا العمل لتكييف وحدة استشعار Adafruit INA219 في بيئة LabVIEW من خلال إنشاء

An impressed current cathodic protection system (ICCP) requires measurements of extremely low-level quantities of its electrical characteristics. The current experimental work utilized the Adafruit INA219 sensor module for acquiring the values for voltage, current, and power of a default load, which consumes quite low power and simulates an ICCP system. The main problem is the adaptation of the INA219 sensor to the LabVIEW environment due to the absence of the library of this sensor. This work is devoted to the adaptation of the Adafruit INA219 sensor module in the LabVIEW environment through creating, developing, and successfully testing a Sub VI to be ready for employment in an ICCP system. The sensor output was monitored with an Arduino

In this paper, we use concepts and results from percolation theory to investigate and characterize the effects of multi-channels on the connectivity of Dynamic Spectrum Access networks. In particular, we focus on the scenario where the secondary nodes have plenty of vacant channels to choose from-a phenomenon which we define as channel abundance. To cope with the existence of multi-channels, we use two types of rendezvous protocols: naive ones which do not guarantee a common channel and advanced ones which do. We show that, with more channel abundance, even with the use of either type of rendezvous protocol, it becomes difficult for two nodes to agree on a common channel, thereby potentially remaining invisible to each other. We model this

In the last two decades, networks had been changed according to the rapid changing in its requirements. The current Data Center Networks have large number of hosts (tens or thousands) with special needs of bandwidth as the cloud network and the multimedia content computing is increased. The conventional Data Center Networks (DCNs) are highlighted by the increased number of users and bandwidth requirements which in turn have many implementation limitations. The current networking devices with its control and forwarding planes coupling result in network architectures are not suitable for dynamic computing and storage needs. Software Defined networking (SDN) is introduced to change this notion of traditional networks by decoupling control and

Cognitive radio technology is used to improve spectrum efficiency by having the cognitive radios act as secondary users to access primary frequency bands when they are not currently being used. In general conditions, cognitive secondary users are mobile nodes powered by battery and consuming power is one of the most important problem that facing cognitive networks; therefore, the power consumption is considered as a main constraint. In this paper, we study the performance of cognitive radio networks considering the sensing parameters as well as power constraint. The power constraint is integrated into the objective function named power efficiency which is a combination of the main system parameters of the cognitive network. We prove the exi