System-of-systems (SoS) evolution is a complex and unpredictable process. Although various principles to facilitate collaborative SoS evolution have been proposed, there is a lack of experimental data validating their effectiveness. To address these issues, we present an Agent-Based Model (ABM) for SoS evolution in the Internet of Vehicles (IoV) , serving as a quantitative analysis tool for SoS research. By integrating multiple complex and rational behaviors of individuals, we aim to simulate real-world scenarios as accurately as possible. To simulate the SoS evolution process, our model employs multiple agents with autonomous interactions and incorporates external environmental variables. Furthermore, we propose three evaluation metrics: evolutionary time, degree of variation, and evolutionary cost, to assess the performance of SoS evolution. Our study demonstrates that enhanced information transparency significantly improves the evolutionary performance of distributed SoS. Conversely, the adoption of uniform standards only brings limited performance enhancement to distributed SoSs. Although our proposed model has limitations, it stands out from other approaches that utilize Agent-Based Modeling to analyze SoS theories. Our model focuses on realistic problem contexts and simulates realistic interaction behaviors. This study enhances the comprehension of SoS evolution processes and provides valuable insights for the formulation of effective evolutionary strategies.

Over the years, the need for autonomous systems such as drones, also known as unmanned aerial vehicles (UAVs), has significantly increased in popularity across several industries, including the military. The Internet of Battlefield Things (IoBT) represents a modern technological advancement that significantly enhances the operational efficacy of defense systems. It establishes an integrated military force by connecting individuals to intelligent technology in drones, radios, equipment, antennas and ground stations. This is achieved through the utilization of cloud and edge computing, sensors, mobile devices, embedded systems, and IoT-based systems. However, IoBT security is significantly compromised by enemies that exploit the vulnerabilities and malicious intrusions that specifically target the external environment or to obtain sensitive data. In addition, a comprehensive understanding of cyberattacks and countermeasures is essential for assuring the security of IoBT. On the other hand, as cyber threats get more complicated, trust becomes increasingly important for the security of digital systems. Within this context, the zero trust architecture contends that the security of a complex network is inherently vulnerable to internal and external threats. In defense, UAV security system applications, for example, the primary purpose of the zero trust architecture is to limit the vulnerability of military UAV systems to cyberattacks, hence reducing the possibility of data breaches and illegal entry. This study conducts a systematic review aimed at identifying different aspects of cybersecurity strategies for protecting UAV systems within the IoBT domain. Furthermore, zero trust architecture is presented in the study as an effective prospective solution to the security issues that develop in defense UAV systems.

This project designed a set of network security mechanisms for cloud applications in VANETs. At present, cloud computing is one of the government’s development priorities in the industry. We divide cloud into public, private, and hybrid clouds in this project. Vehicles or passengers can access road conditions or public transport information through the public cloud; public transportation can access current driving records and users can access relevant enterprise information on the private cloud and hybrid cloud is a combination of public and private clouds. Both cloud computing or VANETs require network and information security. At present, many researches on VANETs security only focus on message communication, and neglect information storage. Researches on cloud computing security only focus on information protection, and neglect user privacy and anonymity. This project designed a set of network and information security mechanisms in line with the requirements of Confidentiality, Authentication, Non-repudiation, Conditional Anonymity, and Conditional Untraceability. This project primarily needs to achieve the following: 1.an authentication mechanism to verify the identity of each other between the passenger and the vehicle and to verify the identity with Single Sign-On; 2. vehicle or user privacy and anonymity, which need to be able to replace the anonymous ID and related parameters for the vehicle or the user; 3. a private communication mechanism, which enables any vehicle or user to communicate privately; and 4. an information security encryption method, which can encrypt the information on a cloud server to avoid unauthorized access by internal personnel or hackers.

Pipeline conflicts arising from data dependencies are a common issue encountered in the hardware implementation of layered QC-LDPC decoders. This paper proposes an efficient layered decoding architecture to reduce pipeline conflicts without introducing stall cycles, by reordering the processing order offline and using the patch method based on variable-to-check message. The experimental results on the LDPC code of the IEEE802.16 standard in the OFDM-PON system demonstrate that the proposed architecture has a sensitivity improvement of 0.125 dBm and 0.375 dBm, respectively, compared with our previous work and the method described in the other work.

Blockchain is the consensus-based technology to resolve the conflicts in Byzantine environments. Vehicles validate the messages received from the neighboring vehicles using Gradient Boosting Technique (GBT). Based on the validation results the message source vehicle generates the ratings that are to be uploaded to Road Side Units (RSUs) through that trust offset value can be calculated. All RSUs maintain the trust blockchain and each RSU tries to add their blocks to trust blockchain. We proposed a blockchain-based trust management model for VANET based on Tendermint. It eliminates the problem of malicious nodes entering the network and will also overcome the problem of power consumption. Simulation results also show that the proposed system is 7.8% and 15.6% effective and efficient in terms of Packet Delivery Ratio (PDR) and End-to-End Delay (EED) respectively to collect the trusted data between the vehicles.

Vehicular ad-hoc network (VANET) is a type of mobile network which is used for establishing connection between vehicles (M2M) and also between vehicles and nearby stationary equipment which are often road-side equipment. The main target of VANET is to provide security and convenience for the passengers. In order to achieve this goal, a special electronic device called OBU (On-Board Unit) is embedded in each vehicle which makes the connection between vehicles and between the vehicles and the road-side equipment possible. In this paper, the Location-Aware Clustering in Vehicular Ad-hoc Networks (LAC-VANET) is proposed. We try to achieve the main and major goal in VANET networks, i.e. fast propagation of security and urgent messages in ITS systems, using clustering and selecting the best cluster head based on Fuzzy logic such that the cluster head can transfer important information such as the obstacles and accidents detected on the road with a suitable speed and without creating a large traffic load in the vehicle network in order to notify other vehicles and prevent the danger and vehicle accidents. Moreover, LAC-VANET method is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the VANET network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), end to end delay, and packet loss rate.

It is a challenging issue to provide a secure and conditional anonymous authentication scheme in vehicle ad hoc networks(VANETs) with low storage space and computational cost. In 2008, Lu et al. [8] proposed an conditional privacy preservation scheme called ECPP protocol. The ECPP protocol provides conditional privacy preservation to vehicles in VANETs, that is, on one hand vehicles can achieve anonymous authentication in the network, on the other hand allow to be traced and revoked if necessary. However, ECPP scheme suffers from large storage and high computational cost. In our scheme, an improved protocol based on the concept of ECPP protocol has been proposed, which uses minimal interaction steps, little storage space and less computation overhead to achieve more efficiency conditional privacy preservation(MECPP) scheme in VANETs.

An explosive growth in vehicular wireless services and applications gives rise to spectrum resource starvation. Cognitive radio has been used to vehicular networks to mitigate the impending spectrum starvation problem by allowing vehicles to fully exploit spectrum opportunities unoccupied by licensed users. Efficient and effective detection of licensed user is a critical issue to realize cognitive radio applications. However, spectrum sensing in vehicular environments is a very challenging task due to vehicles mobility. For instance, vehicle mobility has a large effect on the wireless channel, thereby impacting the detection performance of spectrum sensing. Thus, gargantuan efforts have been made in order to analyze the fading properties of mobile radio channel in vehicular environments. Indeed, numerous studies have demonstrated that the wireless channel in vehicular environments can be characterized by a temporally correlated Rayleigh fading. In this paper, we focus on energy detection for spectrum sensing and a counting rule for cooperative sensing based on Neyman-Pearson criteria. Further, we go into the effect of the sensing and reporting channels condition on spectrum sensing performance under temporally correlated Rayleigh sensing channel. For local and cooperative sensing, we derive some alternative expressions for average probability of miss detection. The pertinent numerical and simulating results are provided to further validate our theoretical analyses under a variety of scenarios.

In this paper, in order to reduce the energy consumption and delay of data transmission, the non-orthogonal multiple access (NOMA) and edge caching technologies are jointly considered. As for the cache-assisted vehicular NOMA-MEC networks, a problem of minimizing the energy consumed by vehicles (mobile devices, MDs) is formulated under the latency and resource constraints, which jointly optimizes the computing resource allocation, subchannel selection, device association, offloading and caching decisions. To solve the formulated problem, we develop an effective joint computation offloading and task caching algorithm based on the twin delayed deep deterministic policy gradient (TD3) algorithm. Such a TD3-based offloading (TD3O) algorithm includes a designed action transformation (AT) algorithm used for transforming continuous action space into a discrete one. In addition, to solve the formulated problem in a non-iterative manner, an effective heuristic algorithm (HA) is also designed. As for the designed algorithms, we provide some detailed analyses of computation complexity and convergence, and give some meaningful insights through simulation. Simulation results show that the TD3O algorithm may achieve lower local energy consumption than several benchmark algorithms, and HA may achieve a lower one than the completely offloading algorithm and local execution algorithm.

Over the past few decades, the growth of the urban population has been remarkable. Nowadays, 50% of the population lives in urban areas, and forecasts point that by 2050 this number will reach 70%. Today, 64% of all travel made is within urban environments and the total amount of urban kilometers traveled is expected to triple by 2050. Thus, seeking novel solutions for urban mobility becomes paramount for 21st century society. In this work, we discuss the performance of vehicular networks. We consider the metric Delta Network. The Delta Network characterizes the connectivity of the vehicular network through the percentage of travel time in which vehicles are connected to roadside units. This article reviews the concept of Delta Network and extends its study through the presentation of a general heuristic based on the definition of scores to identify the areas of the road network that should receive coverage. After defining the general heuristic, we show how small changes in the score computation can generate very distinct (and interesting) patterns of coverage, each one suited to a given scenario. In order to exemplify such behavior, we propose three deployment strategies based on simply changing the computation of scores. The results show that the strategies derived from the general heuristic are very interesting, all of them deploying roadside units in a circle pattern around the traffic epicenter.

Vehicle to vehicle (V2V) and Vehicle to infrastructure (V2I) or briefly V2X communications are the one of hot topics in automotive industry. Therefore, this situation is providing many advantages of connected vehicles and infrastructures which bring to human life. For instance, vehicles and road infrastructures which shares information with each other, provides a neat flow regulation, more ordered traffic flow and therefore jammed traffic dependent accident’s percentage will be decreased. On the other hand, security is the most important issue for these systems because the operation of V2X networks is completely dependent on uninterrupted and accurate information sharing. In the light of these information, in this paper we review security issues and current solution architectures. We also propose some open problems in this lively field.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

The dynamics of surface and sub-surface water events can lead to slope instability resulting in anomalies such as slough slides on earthen levees. Early detection of these anomalies by a remote sensing approach could save time versus direct assessment. We have implemented a supervised Mahalanobis distance classification algorithm for the detection of slough slides on levees using complex polarimetric Synthetic Aperture Radar (polSAR) data. The classifier output was followed by a spatial majority filter post-processing step which improved the accuracy. The effectiveness of the algorithm is demonstrated using fully quad-polarimetric L-band Synthetic Aperture Radar (SAR) imagery from the NASA Jet Propulsion Laboratory’s (JPL’s) Uninhabited Aerial Vehicle Synthetic Aperture Radar (UAVSAR). The study area is a section of the lower Mississippi River valley in the southern USA. Slide detection accuracy of up to 98 percent was achieved, although the number of available slides examples was small.

Vehicular traffic in urban areas continues to be a constant challenge today, due to the continuous population growth and the increase of vehicles in circulation. Vehicular congestion, as a recurrent problem, generates a negative impact on urban mobility and citizens’ quality of life. It is hypothesized that a dynamic clustering method of vehicle trajectory data can provide an accurate and up-to-date representation of real-time traffic behavior. To evaluate this hypothesis, data were collected from three different cities: San Francisco, Rome and Guayaquil. A dynamic clustering algorithm was applied to identify traffic congestion patterns and an indicator was applied to identify and evaluate the congestion conditions of the areas. The results show a high precision and recall in congestion classification compared to a method based on static cells.

A model of a single-server queuing-inventory system (QIS) with catastrophes and a finite waiting room for consumer customers (c-customers) has been developed. When a catastrophe occurs, all inventory in the system's warehouse is destroyed, but c-customers in the system are still waiting for restocking. In addition to c-customers, negative customers (n-customers) are also taken into account, which displaces one c-customers (if any). The policy (?, ?) is used to replenish stocks. If upon arrival of the c-customer the inventory level is zero, then according to Bernoulli’s scheme this c-customer is either lost or joining the queue. The mathematical model of the studied QIS is constructed in the form of a two-dimensional continuous-time Markov chain (2D CTMC). Exact and approximate methods for calculating the steady-state probabilities of constructed 2D CTMCs are developed and closed-form expressions are derived for calculating the performance measures. The results of numerical experiments are presented, demonstrating the high accuracy of the developed approximate formulas, as well as the behavior of performance indicators depending on the reorder point. In addition, an optimization problem is solved to obtain the optimal reorder point to minimize the expected total cost.

Cooperative localization under complex urban environments has become a solution to replace the Global Navigation Satellite System (GNSS) positioning. Due to utilizing distance measured and information exchanged between vehicles, cooperative localization results in high computational complexity and heavy communication overhead. This paper proposes a cooperative localization method based on evolutionary coalitional game theory, which implements vehicles' location estimation with less communication cost. We select the neighboring vehicles to form a coalition based on the node's square position error bound and communication cost. The location is obtained via exchanging information between vehicles. It is evident from the simulations and results that the proposed method holds low communication overhead while maintaining localization accuracy.

The Active Distribution Networks (ADNs) are Multi-Input Multi-Output (MIMO) systems with coupled dynamics which cause interactions among the control loops of the Distributed Energy Resources (DERs). This undesired effect lead to performance degradation in the voltage control. To mitigate the effects of these unavoidable coupling, the present paper proposes a systematic design procedure based on the analysis of the interaction's sources. In details, each DER is equipped with a double loop PI to control the active and reactive powers output by the Voltage Source Converter (VSC) which connects the DER to the network's node. Furthermore, to guarantee Ancillary Services (ASs), the two loops are coupled by a simple mechanism of cooperation of the active power to voltage regulation realized by a filtered droop law. To achieve voltage regulation with reduced loop interactions, the PI parameters and the filter's pulse are designed according to a two sequential steps procedure based on the (Internal Model Control) IMC technique. Simulation studies are finally presented to demonstrate that the proposed design method achieves both reduction of the loop interaction and robust voltage control in presence of model parameter uncertainty in the MIMO model.

The era of Internet of Things (IoT) has begun to evolve and with this the devices around us are getting more and more connected. Vehicular Ad-hoc NETworks (VANETs) is one of the applications of IoT. VANET allow vehicles within these networks to communicate effectively with each another. VANETs can provide an extensive range of applications that support and enhance passenger safety and comfort. It is important that VANETs are applied within a safe and reliable network topology; however, the challenging nature of reaching reliable and trustworthy agreement in such distributed systems is one of the most important issues in designing a fault-tolerant system. Therefore, protocols are required so that systems can still be correctly executed, reaching agreement on the same values in a distributed system, even if certain components in the system fail. In this study, the agreement problem is revisited in a VANET with multiple damages. The proposed protocol allows all fault-free nodes (vehicles) to reach agreement with minimal rounds of message exchanges, and tolerates the maximal number of allowable faulty components in the VANET.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

Image stitching is a crucial aspect of image processing. However, factors like perspective and environment often lead to irregular shapes in stitched images. Cropping or completion methods typically result in substantial loss of information. This paper proposes a method for rectifying irregularly images into rectangles using deformable meshes and residual networks. The method utilizes a convolutional neural network to quantify rigid structures of images. Choosing the most suitable mesh structure based on the extraction results, offering options such as triangular, rectangular, and hexagonal. Subsequently, the irregularly image, predefined mesh structure, and predicted mesh structure are input into a wide residual neural network for regression. The loss function comprises local and global, aimed at minimizing the loss of image information within the mesh and global target. This method not only significantly reduces information loss during rectification but also adapting to different images with various rigid structures. Validation on the DIR-D dataset shows this method outperforms state-of-the-art methods in image rectification.

This paper proposed an optimal tracking control scheme through adaptive dynamic programming(ADP) for a class of partially unknown discrete-time nonlinear systems based on radial basis function neural network(RBF-NN). In order to acquire the unknown system dynamics, we use two RBF-NNs, the one is used to construct the identifier, and the another is used to directly approximate the steady-state control input, where a novel adaptive law is proposed to update neural network weights. While the optimal feedback control and the cost function are derived via feedforward neural networks approximating, it is proposed to regulate the tracking error, the critic network and the actor network are then trained online to obtain the solution of the associated Hamilton–Jacobi–Bellman (HJB) equation being built under the ADP framework. Simulations verify the effectiveness of the optimal tracking control technique using the neural networks.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Nowadays the dynamism induced by the constant change of strategic decisions on the markets produces an extra difficulty in the management of an organization. The strategic decisions made by managers can become obsolete in a short period of time. One of the major difficulties in managing a commercial organization is to predict, with some precision degree, the impact some strategic decisions have on the financial results. Business Intelligence (BI) is an area widely used to help managers to make strategic decisions. But the methods used, behind the scenes, to achieve the conclusions are kept secret by BI company-based services. Modelling the environment can be a good option to study the impact of an action, provided by a strategic decision, in a real environment. A good model should give an approximate result of an action applied to a previous state of the environment. Artificial Neural Networks (ANNs) are proven to be excellent in modeling environments with some level of data noise. The same strategic action can have different results in different organizations. A tool that allows an evaluation of a strategic action applied to an environment should have a major importance in the management scope. Modeling the environment should save time and money for the organization to improve the performance of the strategic plan. If one evaluates the state of the environment after a strategic action being applied, it can be possible to mitigate the risk of failure of the strategic plan. As we will be able to verify, it is possible to use ANNs to model strategic environments that should allow the prediction of sales and operating results by the used strategies with some precision, although the level of success will be directly related with the user’s necessity.

Amid escalating urbanization, devising rational commercial space layouts is a critical challenge. Leveraging machine learning, this study uses a Back-propagation (BP) neural network to optimize commercial spaces in Weinan City's central urban area. The results indicate an increased number of commercial facilities with a trend of multi-centered agglomeration and outward expansion. Based on these findings, we propose a strategic framework for rational commercial space development emphasizing aggregation centers, development axes, and spatial guidelines. This strategy provides valuable insights for urban planners in small and medium-sized cities in the Yellow River Basin and metropolitan areas, ultimately showcasing the power of machine learning in enhancing urban planning.

One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

Given the recent advances in information technology, speed has become an important requirement in data transmission. Given that an LED (light emitting diode) can turn on and off several thousand or even millions of times per second, then LiFi (light fidelity) technology has strong advantages over WiFi (wireless fidelity) in terms of speed. In this research project, a consortium involving an academic institution decided to evaluate the maturity of LiFi technology and design a demonstrator that could be integrated in a vehicle via an intra-vehicle data transmission system. The demonstrator is to implement a two-way LiFi communication between the reading light of a vehicle and a portable device such as a tablet or smartphone. The nomadic device must display, via an interface, data in real time. The data is RNT (Digital Terrestrial Radio) and TNT (Digital Terrestrial Television) provided by an in-house antenna. LiFi depends on optical technology. The optical characteristics have significant influences on the system. The paper shows ways to improve the system’s throughput, communication range, and reception area. By replacing the reading light with a more powerful one with better optical characteristics, the communication range and reception area improve. By using symmetrical power supply, the throughput improves. Likewise, by using optical filters that eliminate noise, the throughput also improves. We have demonstrated that LiFi data transmission in the vehicle is feasible; low-definition videos were successfully transmitted. The paper acknowledges that there are still various avenues for this work’s improvement.

Previous high throughput screening studies indicated trans-eQTLs tend to be tissue specific. In this study, I probed if this feature can be used to identify tissue-specific gene regulatory networks. eQTL data (P<5e-8) for 16,259 genes were identified and their summary association statistics were obtained from the eQTLGene database. Next, eQTLs that display both cis and trans regulatory effects were selected and the association between their corresponding genes were examined using Mendelian randomization. A total of 169 genes that exerted trans-regulatory impacts on 692 genes were identified. 90% of the genes (N=749) aggregated into a gene regulatory network significantly enriched in hemo-immune processes. The robustness of finding was confirmed through simulation. The identified network displayed the scale-free topology. This provided the reason to examine the association of the network’s hub genes with the phenome. The outcome of analyses revealed GSDMB and ORMDL3 impact several disorders of immune origin and ALDH2 overexpression contributes to obesity. This study reports trans-eQTLs can be used to identify tissue-specific gene regulatory networks and describes a workflow to achieve this purpose. The network identified in this study showed scale-free topology indicating the hub genes of a GRN could be targeted to prevent disease outcomes.

Parkinson’s Disease (PD) is a neurodegenerative and progressive disease that impacts the nerve cells in the brain and varies from person to person. The exact cause of PD is still unknown, and the diagnosis of PD does not include a specific objective test with certainty. Although deep learning has made great progress in medical neuroimaging analysis, these methods are very susceptible to biases present in neuroimaging datasets. An innovative decorrelated deep learning technique is introduced to mitigate class bias and scanner bias while simultaneously focusing on finding distinguishing characteristics in resting-state functional MRI (rs-fMRI) data, which assist in recognizing the PD with good accuracy. The decorrelation function reduces the non-linear correlation between features and bias in order to learn bias-invariant features. The Parkinson’s Progression Markers Initiative (PPMI) dataset, referred to as a single scanner imbalanced dataset in this study used to validate our method. The imbalanced dataset problem affects the performance of the deep learning framework by overfitting to the majority class. To resolve this problem, we propose a new Decorrelated Convolutional Neural Networks (DcCNN) framework by applying decorrelation-based optimization to Convolutional Neural Networks(CNN). An analysis of evaluation metrics comparisons shows that integrating the decorrelation function boosts the performance of PD recognition by removing class bias. Specifically, our DcCNN model performs significantly better than existing traditional approaches to tackle the imbalance problem. Finally, the same framework can be extended to create scanner invariant features without significantly impacting the performance of a model. The obtained dataset is a multi-scanner dataset which leads to scanner bias due to the differences in acquisition protocols and scanners. The multi-scanner dataset is a combination of two datasets, namely PPMI and FTLDNI - frontotemporal lobar degeneration neuroimaging initiative (NIFD) dataset. The results of t-distributed stochastic neighbor embedding (t-SNE) and scanner classification accuracy of our proposed Feature Extraction-DcCNN (FE-DcCNN) model validated the effective removal of scanner bias. Our method achieves an average accuracy of 77.80% on a multi-scanner dataset for differentiating PD from healthy control, which is superior to the DcCNN model trained on a single scanner imbalanced dataset.

Wireless Powered Communication Networks (WPCN), which has attracted much attention of researchers, also been recently recommended in 5^th generation (5G) wireless networks. With the help of the WPCN, the reliability and battery life of wireless low-power devices can be improved. In this paper, we investigate throughput and ergodic capacity in WPCN-assisted amplify-and-forward (AF) relaying system, considering two transmission modes including delay-tolerant and delay-limited. As important achievement, we propose symmetric energy harvesting protocol, namely time power switching relaying (TPSR) in order to find maximal throughput. In particular, both time switching and power switching coefficients in this schemes are considered. Unlike most of the previous works, we further focus on impact of outdated channel state information (CSI) in this WPCN. In order to evaluate information processing efficiency, the performance can be substantially improved by optimally harvesting time and power coefficients of the received signal at relay node for energy and information extraction, and by deploying several scenarios. By deploying Monte Carlo simulation, it is confirmed that the system performance is more sensitive to CSI estimation error, noise variance, signal-to-noise ratio (SNR) and resulting in other reasonable computations of TPSR need be deployed to obtain QoS requirement.

The intense motion of a ship can greatly impacts the comfort of crew members and the safety of the vessel. Therefore, accurately estimating and predicting ship attitudes has become an important issue. This paper introduces the latest development in functional deep learning model called DeepOnet. It takes wave height as input and ship motion as output, using a cause-to-result prediction approach. The modeling data used in this study is sourced from publicly available experimental data from the Iowa Institute of Hydraulic Research. Firstly, parameters system tuning was conducted for the neural network's hyperparameters to determine the appropriate combination of parameters. Secondly, the DeepOnet model for wave height and multi-degree-of-freedom motion was established, and the influence of increasing time steps on prediction accuracy was examined. Finally, a comparison was made between the DeepOnet model and the classical time series model LSTM. It was found that the DeepOnet model had a 10-fold improvement in accuracy for roll and heave attitudes. Moreover, as the forecast duration increased, the advantage of DeepOnet showed a trend of strengthening. As a functional prediction model, DeepOnet provides a new promising tool for very short-term prediction of ship motion.

Antimony (Sb) has gained significance as a critical raw material (CRM) within the European Union (EU) due to its strategic importance in various industrial sectors, particularly in the textile industry for flame retardants and as a component of Sb-based semiconductor materials. Moreover, Sb is emerging as a potential alternative for anodes used in lithium-ion batteries, a key element in the Energy transition. This study focused on exploring the feasibility of identifying and quantifying Sb mineralizations through the spectral signature of soils using reflectance spectroscopy, a non-invasive remote sensing technique, and by employing deep learning algorithms such as Convolutional Neural Networks (CNNs). Common signal preprocessing techniques were applied to the spectral data, and the soils were analyzed by Inductively Coupled Plasma Mass Spectrometry (ICP-MS). Despite achieving high R-squared values, the study faces a significant challenge of generalization of the model to new data. Despite the limitations, this study provides valuable insights into potential strategies for future research in this field.

Day by day, the share of renewable energy-based power plants such as offshore wind farms and photovoltaic power plants, in the present-day power systems is escalating. Nevertheless, most of these power-producing facilities have been located quite far away from the load centers. At this stage, HVDC power systems provide satisfactory options due to qualities such as reduced line losses, substantial controllability, and environmental advantages. Nevertheless, unique converter designs are required to combine asynchronous HVDC networks with each other and with already existing high voltage alternating current (HVAC) networks. In this study, based on the above special cases, a unique DC-DC modular multilevel converter (MMC) architecture is presented that provides an excellent solution for both integrating modern asynchronous HVDC networks and integrating these modern HVDC power systems with existing asynchronous HVAC power systems. The mathematical analysis of the recommended DC-DC MMC design has been examined in detail and the power transfer between two asynchronous power grids has been realized in a simulation environment. Efficient bilateral power transmission has been made achievable by the control system. The recommended DC-DC MMC topology has shown to be a highly successful approach, in the interconnection of HVDC power systems, according to the simulation results.

Optical artificial neural networks (ONNs) — analog computing hardware tailored for machine learning [1,2] — have significant potential for ultra-high computing speed and energy efficiency [3]. We propose a new approach to architectures for ONNs based on integrated Kerr micro-comb sources [4] that is programmable, highly scalable and capable of reaching ultra-high speeds. We experimentally demonstrate the building block of the ONN — a single neuron perceptron — by mapping synapses onto 49 wavelengths of a micro-comb to achieve a high single-unit throughput of 11.9 Giga-FLOPS at 8 bits per FLOP, corresponding to 95.2 Gbps. We test the perceptron on simple standard benchmark datasets — handwritten-digit recognition and cancer-cell detection — achieving over 90% and 85% accuracy, respectively. This performance is a direct result of the record small wavelength spacing (49GHz) for a coherent integrated microcomb source, which results in an unprecedented number of wavelengths for neuromorphic optics. Finally, we propose an approach to scaling the perceptron to a deep learning network using the same single micro-comb device and standard off-the-shelf telecommunications technology, for high-throughput operation involving full matrix multiplication for applications such as real-time massive data processing for unmanned vehicle and aircraft tracking.

The massive amount of human biological, imaging and clinical data produced by multiple and diverse sources, necessitates integrative modeling approaches able to summarize all this information into answers to specific clinical questions. In this paper, we present a hypermodeling scheme able to combine models of diverse cancer aspects regardless of their underlying method or scale. Describing tissue-scale cancer cell proliferation, biomechanical tumor growth, nutrient transport, genomic-scale aberrant cancer cell metabolism, and cell signaling pathways that regulate the cellular response to therapy, the hypermodel integrates mutation, miRNA expression, imaging, and clinical data. The constituting hypomodels as well as their orchestration and links are described. Two specific cancer types, Wilms tumor (nephroblastoma) and non-small cell lung cancer, are addressed as proof of concept study cases. Personalized simulations over the actual anatomy of a patient have been carried out. The hypermodel has also applied to predict tumor control after radiotherapy and the relationship between tumor proliferative activity and response to neoadjuvant chemotherapy. Our innovative hypermodel holds promise as a digital twin based clinical decision support system and the core of future in silico trial platforms, although additional retrospective adaptation and validation is necessary.

Change Detection (CD) of aerial images refers to identifying and analyzing changes between two or more aerial images of the same location taken at different times. The CD is a highly challenging task due to the need to distinguish relevant changes, such as urban expansion, deforestation, or post-disaster damage assessment, from irrelevant ones, such as light conditions, shadows, and seasonal variations. Many CD papers have recently been published, where most of the papers that proposed a new model contained a comparison between their proposed and state-of-the-art (SOTA) models. While many recent studies propose new deep learning (DL) models for improving CD performance, their comparative analyses are often restricted, lacking comprehensive insights into the proposed models' real-world generalizability, robustness, and performance trade-offs across diverse change characteristics. This paper presents a novel generic framework to systematically benchmark and assess DL-based CD models through three parallel pipelines: 1) cross-testing models on diverse benchmark datasets to evaluate generalization, 2) robustness analysis against different image corruptions, and 3) multi-faceted contour-level analytics evaluating detection sensitivity to change size/complexity. The framework is applied to comparatively evaluate five state-of-the-art DL-based CD models - Changeformer, BIT, Tiny, SNUNet, and CSA-CDGAN. Extensive experiments unveil each model's strengths, limitations and biases, highlighting their relative proficiencies in generalizing across data distributions, resilience to noise corruption, and discriminative capabilities for changes of varying characteristics. The proposed benchmarking framework demonstrates significant potential for guiding the selection of suitable CD models tailored to specific application requirements by comprehensively evaluating their generalizability, robustness, and detection capabilities across diverse real-world scenarios. This systematic evaluation approach can drive future research into developing more robust and versatile CD solutions aligned with practical needs.

Optical networks offer a wide range of benefits to the telecommunication sector world- wide with its provision of higher bandwidth which leads to faster data speed, longer transmission distance, and improved latency. Currently, the complexity associated with advancements in optical networks poses problems to network flexibility, reliability, and quality of service. Over the years, many reviews and proposals have been implemented by several literatures to provide solutions for optical networks using software-defined networks and network service orchestrators. This paper reviews the significant challenges in current optical network applications, the various solutions rendered by software-defined networks as well as network service orchestration, the impediments, and gaps in these software – defined networks. This paper will go a step further to look into the various improvements and implementations of software-defined networks tailored to solve specific optical network problems. This paper further proposes a flexible orchestration architecture for software-defined networks for solving flexibility and scalability problems in optical networks. This proposal uses Open Network System (ONOS) SDN controller, leveraging on dockerisation as well as kubernetes clusterisation and orchestration. This solution presents a more flexible, reliable, customable, and higher quality of service which is an improvement upon current solutions in literature.

The main purpose of this article is to identify brain diseases such as Alzheimer's and Parkinson's in an intelligent way using Python software and processing the function of neurons in the neural network areas of the brain, which are classified into different components, and the data is based on the information obtained from FMRI images using algorithms artificial intelligence can intelligently diagnose the type of disease. Therefore, by using spatial clustering based on the deep learning method with noise algorithm (DBSCAN), fMRI brain image and fMRI brain surface complexity are classified, and then image preprocessing will be applied to fMRI images by using artificial intelligence neural networks (ANN) algorithm. became. Then, by using the ANN algorithm and Deep CNN topology of the brain neural network, the type of disease in the brain can be diagnosed by simulating the performance of an artificial neural network (ANN) in Python software. Deep machine learning-based methods, especially algorithms based on neural networks, have shown great success in medical image analysis for various tasks including brain tumor detection, segmentation, and classification, and Alzheimer's and epilepsy. In this research, we propose an integrated model based on a convolutional neural network for simultaneous recognition and classification of brain diseases for intelligent diagnosis of tumors and epilepsy. The average accuracy obtained from our proposed model is 97.89 percent accuracy and 91.66 percent specificity.

With the widespread use of new equipment such as distributed photovoltaics, distributed energy storage, electric vehicles, and distributed wind power, the control of low-voltage distribution networks (LVDNs) has become increasingly complex. Acquiring the most recent topological structure is essential for conducting accurate analysis and real-time control of LVDNs. The signal-injection-based topology identification algorithm is favored for its speed and efficiency. This study proposes a new signal-injection-based topology identification algorithm aimed at solving the issues of reduced completeness and correctness of identification caused by missing feature signal records (FSRs). By analyzing the correlations between FSRs of different positions, the algorithm employs vertical and horizontal completion methods to effectively address missing data, combined with inclusion detection algorithms, to identify the topology of LVDNs. Based on the study of actual LVDN data, the results indicate that the algorithm not only significantly improves the completeness and correctness of topology identification for LVDNs but can also increase the number of devices in operation by evaluating the status of topological equipment, further enhancing the topology identification performance.

Social networks have captured the attention of many people worldwide. However, these services have also attracted a considerable number of malicious users whose purpose is to compromise digital assets of other members by using messages as an attack vector to execute different variants of cyberattacks against them. Therefore, this work presents an approach based on Natural Language Processing tools and a Convolutional Neural Network architecture to detect and classify, on social network messages, four types of cyberattacks, such as malware, phishing, spam, and even one whose purpose is deceiving the user into spreading malicious messages to other users, which in this work is identified as bot attacks. One notable feature of this work is that it analyzes textual content without depending on any characteristics from a specific social network, making its analysis independent from particular data sources. Finally, this work was tested on real data, demonstrating its results in two stages. The first detects the existence of any of the four cyberattacks within the message, obtaining an accuracy value of 0.91. After detecting a message as a cyberattack, the next stage is to classify it into one of the four types of cyberattack, achieving an accuracy value of 0.82.

In this paper we derive a unified perspective for Optimal Transport (OT) theory and Mean Field Control (MFC) theory to analyse the learning process for Neural Networks algorithms in a high-dimensional framework. We consider Mean Field Neural Networks in the context of MFC theory, specifically the mean field formulation of OT theory that allows the development of highly efficient algorithms while providing a powerful tool in the context of explainable Artificial Intelligence.

The human microbiome is an extremely complex ecosystem considering the amount of bacterial species, their interactions, and its variability over time. Here we untangle the complexity of the human microbiome for the Irritable Bowel Syndrome (IBS) that is the most prevalent functional gastrointestinal disorder in human populations. Based on a novel information theoretic network inference model we detect species interaction networks that are functionally and structurally different for healthy and unhealthy individuals. Healthy networks are characterized by a neutral symmetrical pattern of species interactions and scale-free topology versus random unhealthy networks. We detect an inverse scaling relationship between species total outgoing information flow, meaningful of node interactivity, and relative species abundance (RSA). The top ten interacting species are also the least relatively abundant for the healthy microbiome and the most detrimental. These findings support the idea about the diminishing role of network hubs and hubs should be defined considering the total outgoing information flow rather than the node degree. Macroecologically, the healthy microbiome is characterized by the highest total species diversity growth rate, the lowest species turnover, and the smallest variability of RSA for all species. This result challenges current views that posit a universal association between healthy states and the highest absolute species diversity in ecosystems. Additionally, we show how the transitory microbiome is unstable and microbiome criticality is not at the phase transition between healthy and unhealthy states. We stress out the importance of considering interacting pairs versus single node dynamics when characterizing the microbiome and of ranking these pairs in terms of their dynamics. Interactions (i.e. species collective behavior) shape transition from healthy to unhealthy states.\\ The macroecological characterization of the microbiome is useful for diagnostic purposes and disease etiognosis, while species-specific analyses can detect species that are more beneficial leading to personalized design of pre- and pro-biotic treatments and microbiome engineering.

In this paper, we examine two strategies for boosting the performance of ensembles of Siamese networks (SNNs) for image classification using two loss functions (Triplet and Binary Cross Entropy) and two methods for building the dissimilarity spaces (FULLY and DEEPER). With FULLY, the distance between a pattern and a prototype is calculated by comparing two images using the fully connected layer of the Siamese network. With DEEPER, each pattern is described using a deeper layer combined with dimensionality reduction. The basic design of the SNNs takes advantage of supervised k-means clustering for building the dissimilarity spaces that train a set of support vector machines, which are then combined by sum rule for a final decision. The robustness and versatility of this approach are demonstrated on several cross-domain image data sets, including a portrait data set, two bioimage and two animal vocalization data sets. Results show that the strategies employed in this work to increase the performance of dissimilarity image classification using SNN is closing the gap with standalone CNNs. Moreover, when our best system is combined with an ensemble of CNNs, the resulting performance is superior to an ensemble of CNNs, demonstrating that our new strategy is extracting additional information.

Substances that can modify the androgen receptor pathway in humans and animals are entering the environment and food chain with the proven ability to disrupt hormonal systems and leading to toxicity and adverse effects on reproduction, brain development, and prostate cancer, among others. State-of-the-art databases with experimental data of human, chimp, and rat effects by chemicals have been used to build machine learning classifiers and regressors and evaluate these on independent sets. Different featurizations, algorithms, and protein structures lead to dif- ferent results, with deep neural networks (DNNs) on user-defined physicochemically-relevant features developed for this work outperforming graph convolutional, random forest, and large featurizations. The results show that these user-provided structure-, ligand-, and statistically-based features and specific DNNs provided the best results as determined by AUC (0.87), MCC (0.47), and other metrics and by their interpretability and chemical meaning of the descriptors/features. In addition, the same features in the DNN method performed better than in a multivariate logistic model: validation MCC = 0.468 and training MCC = 0.868 for the present work compared to evalu- ation set MCC = 0.2036 and training set MCC = 0.5364 for the multivariate logistic regression on the full, unbalanced set. Techniques of this type may improve AR and toxicity description and predic- tion, improving assessment and design of compounds. Source code and data are available at https://github.com/AlfonsoTGarcia-Sosa/ML

Recently, the triple-network convergence system (TNCS) has emerged from the deep integration of the power grid, transportation network, and information network. Fault recovery research in the TNCS is important since this system's complexity and interactivity can expand the faults scale and increase faults impact. Currently, fault recovery focuses primarily on single power grids and cyber-physical systems, but there are certain shortcomings, such as ignoring uncertainties including generator start-up failures and the occurrence of new faults during recovery, energy supply-demand imbalances leading to system security issues and communication delay caused by network attacks. In this study, we propose a recovery method based on the improved TD3 algorithm, factoring in shortcomings of the existing research. Specifically, we establish a TNCS model to analyze interaction mechanisms and design a state matrix to represent the uncertainty changes in the TNCS, a negative reward to reflect the impact of unit start-up failures, a special reward to reflect the impact of communication delay and an improved Actor network update mechanism. Experimental results show that our method obtains the optimal recovery decisions, maximizes restoration benefit in power grid failure scenarios and demonstrates a strong resilience against communication delay caused by DoS attacks.

Communication between devices has transitioned from wired to unwired. Wireless networks have been in use widely around the globe since the advent of smartphones, IoT devices and other technologies that are compatible with wireless mode of communication. At the same time security issues have also increased in such communication methods. The aim of this paper is to propose security and privacy issues of the wireless networks and present them through comprehensive surveys. In context of security issues, there are 2 typical DDoS attacks - HTTP flood and SYN flood. Other than DDoS attacks, there are several other threats to wireless networks. One of the most prevalent include security issues in Internet of Things. In terms of privacy issues in a wireless network, location-based applications, individual data, cellular network and V2G (Vehicle to Grid) network are surveyed. The survey is hosted using questionnaire and responses of 70 participants is recorded. It is observed from the survey results that many groups of people lack the knowledge of security and privacy of wireless technologies and networks despite their increased use, however, students are relatively more aware and have strong knowledge of those issues. It is concluded from the results that an effective solution to these problems can be hosting campaigns for spreading the security and privacy laws to help the groups of people who are lagging behind in this domain of knowledge become more aware. A unique solution is also presented to overcome the security issues which include implementation of detection and mitigation techniques, implementing Blockchain in the IoT devices and implementing fog computing solutions. The unique solutions to overcome the privacy issues are proposed in the form of a privacy approach from the LBS server between pairs of users to increase the implementation of DSPM and blockchain as a solution.

This study addresses the prediction of recurring failures in water supply networks, a complex and costly task, but essential for the effective maintenance of these vital infrastructures. Using historical failure data provided by Companhia de Água e Esgotos da Paraíba (CAGEPA), the research focuses on predicting the time until the next failure at specific points in the network. The authors divided the failures into two categories: Occurrences of New Faults (ONF) and Recurrences of Faults (RF). To make the predictions, they used predictive models based on Machine Learning, more specifically on MLP (Multi Layer Perceptron) neural networks. The study revealed that, by analyzing data from past failures and considering factors such as altitude, number of failures on the same street and days between failures, it is possible to achieve an accuracy greater than 80% in predicting failures within a 90-day interval. This demonstrates the feasibility of using fault history to predict future water supply outages with significant accuracy. These forecasts allow water utilities to plan and optimize their maintenance, minimizing inconvenience and losses. The article contributes to the field of water infrastructure management by suggesting that the data-driven approach can be applied in other cities or in networks of different types, such as energy or communication networks. The conclusions highlight the importance of data collection and analysis in preventing failures and optimizing water utilities’ resources.

The recent COVID-19 pandemic has showcased the implications of using virtual private networks (VPNs) as home-working is now common. Establishing the current state of knowledge on VPNs and their processes is vital. This corroborates an up to date understanding on the fundamentals of VPNs and their usage in today’s society; it informs on how to better use VPNs too. Insight into the security issues VPNs face and possible solutions to these allows for the identification of gaps for potential future research. Addressing these gaps would then indicate how to further improve VPNs, making sure VPNs are indeed beneficial to users.

The phenomenon of dissipative self-organization is studied on the example of time-crystal networks. Particular attention was given to transient processes, attractor topologies, phase transitions, and asymptotic stability. New concepts were introduced, including topological phases, spinorial states, and bond flavors. Concepts such as ground states, chemical potentials, elastic forces, temperature, and statistical distributions were endowed with a new meaning associated with asymptotic stability. Phenomena usually attributed exclusively to quantum physics have been shown to occur in this essentially classical environment. They coexist with, and in some cases, such as charge quantization, are related to the phenomenon of time dilation. The approach was applied to model vacuum self-organization. We have shown that under the ac-tion of competing forces, such as gravity and antigravity, a cascade of phase transitions can transform an unorganized vacuum into phases in which interactions, fields and waves resemble electromagnetic, weak, and strong, and their elements can be used as building blocks for prototype particles. In addition, some interrelation field parameters and probabilities of particle transmutations were calculated, which are not predicted by the standard model. The results are consistent with the experiment. The presented material and methodology may be of interest for studying self-organization in different environments.

Over the past decade, research in the field of Deep Learning has brought about novel improvements in image generation and feature learning; one such example being a Generative Adversarial Network. However, these improvements have been coupled with an increasing demand on mathematical literacy and previous knowledge in the field. Therefore, in this literature review, I seek to introduce Generative Adversarial Networks (GANs) to a broader audience by explaining their background and intuition at a more foundational level. I begin by discussing the mathematical background of this architecture, specifically topics in linear algebra and probability theory. I then proceed to introduce GANs in a more theoretical framework, along with some of the literature on GANs, including their architectural improvements and image-generation capabilities. Finally, I cover state-of-the-art image generation through style-based methods, as well as their implications on society.

In recent years, graph neural networks (GNNs) have become a promising method for analyzing data structured in graph format. By considering connections between entities in a graph, GNNs are able to extract valuable insights. One notable variation of GNN is the graph attention network (GAT), which employs the attention mechanism and has demonstrated promising performance in various applications. However, its ability to incorporate feature information from nodes beyond the immediate neighborhood is limited, leading to degraded performance on heterophilic data. To address this limitation, this thesis proposes a novel attention-based model, namely the Directional Graph Attention Network (DGAT). This model combines the feature-based attention with the global directional information extracted from the graph topology, as inspired by the Directional Graph Network (DGN). A new class of Laplacian matrices is proposed and an existing theoretical result on DGN is extended. This extension bridges a gap in the literature. The experimental results presented in the thesis, based on nine real-world benchmarks and ten synthetic data sets, demonstrate the superiority of the proposed DGAT model compared to the GAT baseline model. Particularly on heterophilic data sets, DGAT showed a notable average increase of approximately 35% in node classification tasks across all heterophilic real-world data sets. In addition, DGAT outperforms GAT by an average margin of around 51% in all ten synthetic data sets with various levels of heterophily

We explored the statistics of filtering of simple patterns on a number of deterministic and random graphs as a tractable simple example of information processing in complex systems. In this problem, multiple inputs map to the same output, and the statistics of filtering is represented by the distribution of this degeneracy. For a few simple filter patterns on a ring we obtained an exact solution of the problem and described numerically more difficult filter setups. For each of the filter patterns and networks we found a few numbers essentially describing the statistics of filtering and compared them for different networks. Our results for networks with diverse architectures appear to be essentially determined by two factors: whether the graphs structure is deterministic or random, and the vertex degree. We find that filtering in random graphs produces a much richer statistics than in deterministic graphs. This statistical richness is reduced by increasing the graph’s degree.

This work has its origin in intuitive physical and statistical considerations. The problem of optimizing an artificial neural network is treated as a physical system, composed of a conservative vector force field. The derived scalar potential is a measure of the potential energy of the network, a function of the distance between predictions and targets. Starting from some analogies with wave mechanics, the description of the sys-tem is justified with an eigenvalue equation that is a variant of the Schr˜odinger equation, in which the potential is defined by the mutual information between inputs and targets. The weights and parameters of the network, as well as those of the state function, are varied so as to minimize energy, using an equivalent of the variational theorem of wave mechanics. The minimum energy thus obtained implies the principle of minimum mutual information (MinMI). We also propose a definition of the potential work produced by the force field to bring a network from an arbitrary probability distribution to the potential-constrained system, which allows to establish a measure of the complexity of the system. At the end of the discussion we expose a recursive procedure that allows to refine the state function and bypass some initial assumptions, as well as a discussion of some topics in quantum mechanics applied to the formalism, such as the uncertainty principle and the temporal evolution of the system. Results demonstrate how the minimization of energy effectively leads to a decrease in the average error between network predictions and targets.

In recent years, wireless networks have undoubtedly become a convenient way to connect to the Internet and provide connection to everyone in any corner of the world. In fact, in this era, people are connected to the internet almost everyday and wireless networks give us this privilege in a seamless manner. A wireless network normally consists of access points and nodes where the access points are responsible to amplify the wireless signals, while the nodes are the gadgets that are receiving these signals. However, with such great convenience provided, many challenges are also faced by the users and stakeholders. With no physical connection to devices, wireless networks are evidently more vulnerable to invisible cyber attacks. In this research paper, it the security issues that cause issues in the wireless networks are discussed. Furthermore, an analytical review of privacy challenges found in these networks is performed; these challenges are segregated into security issues and privacy issues. The paper will then present the methods used in conducting a survey and gathering the research results along with further discussion on the results obtained through this study. Finally, a suitable solution is proposed to prevent and overcome the intrusions faced in terms of security and privacy in wireless network scenarios through detection and response mechanism for mitigation of the problems.

The rapid growth of network services, Internet of Things devices and online users on the Internet have led to an increase in the amount of data transmitted daily. As more and more information is stored and transmitted on the Internet, cybercriminals are trying to gain access to the information to achieve their goals, whether it is to sell it on the dark web or for other malicious intent. Through thorough literature study relating to the causes and issues that are brought from the security and privacy segment of wireless networks, it is observed that there are various factors that can cause the networks to be an insecure; especially factors that revolve around cybercriminals with their growing expertise and the lack of preparation and efforts to combat them by relevant bodies. The aim of this paper is to showcase major and frequent security as well as privacy issues in wireless networks along with specialized solutions that can assist the related organizations or the public to fathom how great of an impact these challenges can bring if every related stakeholder took a step in reducing them. Through this paper it is discovered that there are many ways these challenges can be mitigated, however, the lack of implementation of privacy and security solutions is still largely present due to the absence of practical application of these solutions by responsible parties in real world scenarios.

Defining measures of network efficiency and vulnerability for networks is a pivotal aspect in modern networking paradigms. We approach this problem from a game-theoretical perspective. We will consider networks in which actors have social or economic interests modeled by means of a cooperative game. This allows to define, for each network, a family of efficiency measures and another of vulnerability measures, parameterized by the game. The proposed measures use the within groups and the between groups Myerson values. These two values respectively measure which part of the classical allocation of Myerson corresponds to the productivity of players and which part to the intermediation costs. Also, which part of total centrality in social networks is due to communication or to beteewnness. In our proposal, the efficiency of a network is the proportion of the total productivity (or centrality) that players can retain using the network topology. The intermediation costs (and the betweenness centrality) can be viewed as a weakness with a negative impact. Then, we propose to calculate vulnerability as the proportion expent by players in intermediation payments. We explore the properties of these measures and we particularize them to several structures and particular games, also analyzing their asymptotic behaviour.

Applications for Wireless Sensor Networks (WSNs) range from monitoring the environment to automating factories. However, sustained and effective functioning is made more difficult by Sensor Nodes (SNs) limited energy supplies in which optimization is the main issue. So with the aim of increasing the lifespan by decreasing the energy consumption of WSN, Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol with Deep Learning (DL) algorithm is analyzed in this paper. LEACH is a hierarchical mechanism that elects Cluster Heads (CHs) and regularly rotates their positions in order to allocate energy use effectively by using the same amount of energy. However, Deep Learning (DL) method is used to further improve energy optimization. In many applications, the types of Deep Learning methods like Artificial Neural Networks (ANNs) have shown to be very useful. Using this method, WSNs may make more efficient decisions that reduce energy consumption. Data aggregation, duty cycling, and transmission protocols may all be optimized by Deep Learning model's ability to recognize patterns and forecast network behavior. This results in lower energy consumption, a longer lifespan for the network, and better overall performance.

Social networks have become an ubiquitous aspect of adolescents' life, providing new ways to connect and communicate with peers. However, little is known about the impact of social net-works on adolescents' emotional intelligence (EI), a crucial skill for social and identity development. The aim of the present study is to explore the time spent and reasons for using social net-works and their relationship with emotional intelligence in adolescents and young adults (15-19 years). After signing informed consent, participants completed a battery of questionnaires offered via secure online form. The results showed that teenagers spend more than 3 h/day on Whatsapp, more than 2 h/day on Instagram and less on Facebook (26m per day); girls prefer to use Whatsapp and Instagram, boys opt for Facebook. Most participants use social media when bored and/or to communicate with friends. Moreover, time spent on social media has a relationship with stress management with some aspects of EI (assertiveness, self-actualization, optimism, etc.). EI and social desirability have a significant relationship, especially in the sphere of adaptability. Based on the results obtained, future perspectives and training are suggested with the aim of adapting to the constant changes in the new technological reality.

A convolutional neural network (CNN) is sometimes understood as a black box in the sense that while it can approximate any function, studying its structure will not give us any insights into the nature of the function being approximated. In other terms, the discriminative ability does not reveal much about the latent representation of a network. This research aims to establish a framework for interpreting the CNNs by profiling them in terms of interpretable visual concepts and verifying them by means of Integrated Gradient. We also ask the question, "Do different input classes have a relationship or are they unrelated?" For instance, could there be an overlapping set of highly active neurons to identify different classes? Could there be a set of neurons that are useful for one input class whereas misleading for a different one? Intuition answers these questions positively, implying the existence of a structured set of neurons inclined to a particular class. Knowing this structure has significant values; it provides a principled way for identifying redundancies across the classes. Here the interpretability profiling has been done by evaluating the correspondence between individual hidden neurons and a set of human-understandable visual semantic concepts. We also propose an integrated gradient-based class-specific relevance mapping approach that takes the spatial position of the region of interest in the input image. Our relevance score verifies the interpretability scores in terms of neurons tuned to a particular concept/class. Further, we perform network ablation and measure the performance of the network based on our approach.

HD-Zip proteins are unique to plants, and contain a homeodomain closely linked to a leucine zipper motif, which are involved in dimerization and DNA binding. Based on homology in the HD-Zip domain, gene structure and the presence of additional motifs, HD-Zips are divided into four families, HD-Zip I–IV. Phylogenetic and bioinformatics analysis of HD-Zip genes using transcriptomic and genomic datasets from a wide range of plant species indicate that the HD-Zip protein class was already present in green algae. Later, HD-Zips experienced multiple duplication events that promoted neo- and sub-functionalizations. HD-Zip proteins are known to control key developmental and environmental responses, and a growing body of evidence indicates a strict link between members of the HD-Zip II and III families and the auxin machineries. Interactions of HD-Zip proteins with other hormones such as brassinolide and cytokinin have also been described. However, it is striking that among the genes regulated by REV, a HD-Zip III protein playing a key role in apical development, are genes that mediate ABA signaling. Furthermore, HAT1 and HAT3, two HD-Zip II proteins involved in key developmental processes, repress ABA biosynthesis and signaling, indicating an essential role of these factors in adjusting development to changing environment.

Radial basis function (RBF) networks are often viewed as instable when used in multi-layered architectures and therefore are mostly used in a single-layered manner. Universal approximation theorems for single-layered RBF networks further render deeper architectures useless. However, deep neural networks have proven their effectiveness on many different tasks. We show that deeper RBF architectures with multiple radial basis function layers are achievable and able to learn. We introduce an initialization scheme for deep RBF networks based on k-means clustering and covariance estimation. We further show how to make use of convolutions to speed up the calculation of a Mahalanobis distance in a partially-connected fashion, similar to convolutional neural networks (CNNs). Finally, we evaluate our approach on image classification as well as speech emotion recognition tasks. Our results show that deep RBF networks perform similar to simple CNNs.

We apply the stochastic thermodynamics formalism to describe the dynamics of systems of complex Langevin and Fokker-Planck equations. We provide in particular a simple and general recipe to calculate thermodynamical currents, dissipated and propagating heat for networks of nonlinear oscillators. By using the Hodge decomposition of thermodynamical forces and fluxes, we derive a formula for entropy production that generalises the notion of non-potential forces and makes transparent the breaking of detailed balance and of time reversal symmetry for states arbitrarily far from equilibrium. Our formalism is then applied to describe the off-equilibrium thermodynamics of a few examples, notably a continuum ferromagnet, a network of classical spin-oscillators and the Frenkel-Kontorova model of nano friction.

In the rapidly evolving landscape of wireless communication, each successive generation of networks has achieved significant technological leaps, profoundly transforming the way we connect and interact. From the analog simplicity of 1G to the digital prowess of 5G, the journey of mobile networks has been marked by constant innovation and escalating demands for faster, more reliable, and more efficient communication systems. As 5G becomes a global reality, laying the foundation for an interconnected world, the quest for even more advanced networks leads us to the threshold of the sixth-generation (6G) era. This paper presents a hierarchical exploration of 6G networks, poised at the forefront of the next revolution in mobile wireless technology. This study delves into the technological advancements that underpin the need for 6G, examining its key features, benefits, and the key enabling technologies. We dissect the intricacies of cutting-edge innovations like terahertz communication, ultra-massive MIMO, artificial intelligence (AI), machine learning, quantum communication, and re-configurable intelligent surfaces. Through a meticulous analysis, we evaluate the strengths, weaknesses, and state-of-the-art research in these areas, offering a wider view of the current progress and potential applications of 6G networks. Central to our discussion is the transformative role of AI in shaping the future of 6G networks. By integrating AI and machine learning, 6G networks are expected to offer unprecedented capabilities, from enhanced mobile broadband to groundbreaking applications in areas like smart cities and autonomous systems. This integration heralds a new era of intelligent, self-optimizing networks that promise to redefine the parameters of connectivity and digital interaction. This paper also addresses critical challenges in the deployment of 6G, from technological hurdles to regulatory concerns, providing a holistic assessment of potential barriers. By highlighting the interplay between 6G and AI technologies, this study not only maps out the current landscape but also lights the path forward in this rapidly evolving domain. This paper aims to be a cornerstone resource, providing essential insights, addressing unresolved research questions, and stimulating further investigation into the multifaceted realm of 6G networks. By highlighting the synergy between 6G and AI(Artificial Intelligence) technologies, we aim to illuminate the path forward in this rapidly evolving field.

Image stitching is a crucial aspect of image processing. However, factors like perspective and environment often lead to irregular shapes in stitched images. Cropping or completion methods typically result in substantial loss of information. This paper proposes a method for rectifying irregularly images into rectangles using deformable meshes and residual networks. The method utilizes a convolutional neural network to quantify rigid structures of images. Choosing the most suitable mesh structure based on the extraction results, offering options such as triangular, rectangular, and hexagonal. Subsequently, the irregularly image, predefined mesh structure, and predicted mesh structure are input into a wide residual neural network for regression. The loss function comprises local and global, aimed at minimizing the loss of image information within the mesh and global target. This method not only significantly reduces information loss during rectification but also adapting to different images with various rigid structures. Validation on the DIR-D dataset shows this method outperforms state-of-the-art methods in image rectification.

OSI model used to be common network model for years. In the case of ad hoc networks with dynamic topology and difficult radio communications conditions, gradual departure is happening from the classical kind of OSI network model with a clear delineation of layers (physical, channel, network, transport, application) to the cross-layer approach. The layers of the network model in ad hoc networks strongly influence each other. Thus, the cross-layer approach can improve the performance of an ad hoc network by jointly developing protocols using interaction and collaborative optimisation of multiple layers. The existing cross-layer methods classification is too complicated, because it’s based on the whole manifold of network model layers combinations, regardless their importance. In this work, we review ad hoc networks cross-layer methods, propose the new useful classification of cross-layer methods, and show future research directions in ad hoc networks cross-layer methods development. The proposed classification can help to simplify the goal-oriented cross-layer protocol development.

Convolutional Neural Networks (CNNs) are largely hand-crafted, which leads to inefficiency in the constructed network. Various other algorithms have been proposed to address this issue, but the inefficiencies resulting from human intervention have not been addressed. Our proposed EvolveNet algorithm is a task-agnostic evolutionary search algorithm that can find optimal depth and width scales automatically in an efficient way. The optimal configurations are not found using grid search, instead evolved from an existing network. This eliminates inefficiencies that emanate from hand-crafting, thus reducing the drop in accuracy. The proposed algorithm is a framework to search through a large search space of subnetworks until a suitable configuration is found. Extensive experiments on the ImageNet dataset demonstrate the superiority of the proposed method by outperforming the state-of-the-art methods.

In the realm of computer vision, semantic segmentation is the task of recognizing objects in images at the pixel level. This is done by performing a classification of each pixel. The task is complex and requires sophisticated skills and knowledge about the context to identify objects’ boundaries. The importance of semantic segmentation in many domains is undisputed. In medical diagnostics, it simplifies the early detection of pathologies, thus mitigating the possible consequences. In this work, we provide a review of the literature on deep ensemble learning models for polyp segmentation and we develop new ensembles based on convolutional neural networks and transformers. The development of an effective ensemble entails ensuring diversity between its components. To this end, we combine different models (HarDNet-MSEG, Polyp-PVT, and HSNet) trained with different data augmentation techniques, optimization methods, and learning rates, which we experimentally demonstrate to be useful to form a better ensemble. Most importantly, we introduce a new method to obtain the segmentation mask which is more suitable for combining transformers in an ensemble. In our extensive experimental evaluation, the proposed ensembles exhibit state-of-the-art performance.

We study the brain segmentation by dividing the brain into multiple tissues. Given possible brain segmentation by deep, machine learning can be efficiently exploited to expedite the segmentation process in the clinical practice. To accomplish segmentation process, a MRI and tissues transfer using generative adversarial networks is proposed. Given the better result, we propose the transfer model using GAN. For the case of the brain tissues, white matter (WM), gray matter (GM) and cerebrospinal fluid (CSF) are segmented. Empirical results show that this proposed model significantly improved segmentation results compared to the stat-of-the-art results. Furthermore, a dice coefficient (DC) metric is used to evaluate the model performance.

The urban transportation network design problem involving exclusive bus lanes (XBLs) has been widely discussed and analyzed in recent years. An improved and more flexible transit lane management strategy—intermittent bus lanes (IBLs)—prove to be potentially more efficient and car-friendly than XBLs. The common benefit of XBLs and IBLs arises from the fact that they separate the bus and car traffic and hence can eliminate the impacts of slowly moving buses on the car traffic. This paper proposes a cell transmission model for separate car and bus traffic (CTM-SCB) in a network with some dedicated roadway segments reserved for buses. By encapsulating the CTM-SCB model, an XBL-based network design problem and an IBL-based network design problem are then formulated and solved, respectively, where the former model statically sets bus lanes while the later one allows a dynamic allocation of bus lanes. A synthetic freeway-arterial network and a real-world urban street network (where the latter was extracted from the Harbin South New Industrial City) are used as test networks for evaluating the proposed models and methods. The numerical results show that both XBLs and IBLs enjoy significant operational efficiency benefits compared to the situation of no protected bus lanes. However, we believe that the expected improvement from XBLs to IBLs need further tests and validations.

We present a first formal analysis of specific and complete local integration. Complete local integration was previously proposed as a criterion for detecting entities or wholes in distributed dynamical systems. Such entities in turn were conceived to form the basis of a theory of emergence of agents within dynamical systems. Here, we give a more thorough account of the underlying formal measures. The main contribution is the disintegration theorem which reveals a special role of completely locally integrated patterns (what we call ι-entities) within the trajectories they occur in. Apart from proving this theorem we introduce the disintegration hierarchy and its refinement-free version as a way to structure the patterns in a trajectory. Furthermore we construct the least upper bound and provide a candidate for the greatest lower bound of specific local integration. Finally, we calculate the i-entities in small example systems as a first sanity check and find that ι-entities largely fulfil simple expectations.

Optical networks, characterized by using optical fibers as a transmission medium, constitute the fundamental infrastructure employed today by network operators to deliver services to users. As network capacity is one of the key factors influencing optical network performance, it is important to comprehend its limitations and have the capability to estimate its value. In this context, we revisit the concept of capacity from various perspectives, including channel capacity, link capacity, and network capacity, thus providing an integrated view of the problem. Hence, we review the fundamental concepts behind optical networks, along with the basic physical phenomena present in optical fiber transmission and provide methodologies for estimating the different types of capacities, mainly using simple formulations. In particular, we propose a method to evaluate the network capacity that relies on the optical reach to account for physical layer aspects, in conjunction with capacitated routing techniques for traffic routing. We apply this method to three reference networks and obtain capacities ranging from tens to hundreds of Terabits/s. Whenever possible, we also compare our results with published experimental data to understand how they relate.

Alzheimer's disease (AD) is a progressive and evolving neurodegenerative disease with an insidious onset that can lead to memory loss and cognitive impairment. There is no effective treatment for this disease. However, early diagnosis plays an important role in treatment planning to slow down its progression, as treatment has the greatest impact in the early stages of the disease. Neurological images obtained through different imaging techniques provide powerful information and help diagnose the disease. With the wide application of deep learning techniques in disease diagnosis, especially the prominence of Convolutional Neural Networks (CNNs) in computer vision and image processing, more and more studies are proposing the use of this algorithm for the diagnosis of AD. In this paper, we first systematically introduce the impact of AD on people, detailing the biomarkers, early clinical symptoms, and risk factors of this disease. Secondly, it goes on to detail the development of CNNs, their form, and methods to help diagnose AD. It is proposed that CNNs can help diagnose AD by analyzing medical imaging data, particularly structural brain scans such as magnetic resonance imaging (MRI) and functional scans such as positron emission tomography (PET). Finally, it is concluded that CNNs are of great importance for the diagnosis of AD and that they are likely to play an increasingly important role in the early detection of the disease, the understanding of disease mechanisms, and ultimately, in the development of effective AD therapies and interventions. CNNs are playing an increasingly important role in the Their potential impact on healthcare emphasizes the importance of continued research and innovation in neural networks and medical imaging.

Image denoising has been one of the important problems in the field of computer vision, and it has a wide range of practical value in many applications, such as medical image processing, image enhancement, and computational photography. Traditional image denoising methods are usually based on hand-designed features and filters, but these methods perform poorly under complex noise and image structures. In recent years, the rapid development of neural network technology has revolutionized the image-denoising task. This paper introduces the knowledge about neural networks and image denoising, explores the impact of neural networks on image denoising, and how is it possible to denoise images by neural networks. It also summarises other image-denoising methods and finally points out the challenges and problems faced by image-denoising at present. Some possible new development directions are proposed to provide new solutions for image-denoising researchers and to promote the development of the field.

Security in IoT systems is extremely important, as an intrusion into an IoT device or network can affect not only our domestic lives, but also industrial assets, with the potential to cause enormous damage. We discuss IoT security issues as defined by the OWASP Foundation, focusing on network related aspects. After a brief description of SDN in general and OpenFlow in particular, we discuss how SDN technologies can greatly help in designing and deploying more secure IoT networks by enhancing the cryptographic capabilities of devices, isolating devices or networks, blocking access to unwanted services, redirecting traffic to deep inspection systems, monitoring packet flows and devices, etc. These capabilities can be implemented using open-source OpenFlow controllers such as Faucet.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

Multilabel learning goes beyond standard supervised learning models by associating a sample with more than one class label. Among the many techniques developed in the last decade to handle multilabel learning best approaches are those harnessing the power of ensembles and deep learners. This work proposes merging both methods by combining a set of gated recurrent units, temporal convolutional neural networks, and long short-term memory networks trained with variants of the Adam optimization approach. We examine many Adam variants, each fundamentally based on the difference between present and past gradients, with step size adjusted for each parameter. We also combine Incorporating Multiple Clustering Centers and a bootstrap-aggregated decision trees ensemble, which is shown to further boost classification performance. In addition, we provide an ablation study for assessing the performance improvement that each module of our ensemble produces. Multiple experiments on a large set of datasets representing a wide variety of multilabel tasks demonstrate the robustness of our best ensemble, which is shown to outperform the state-of-the-art. The MATLAB code for generating the best ensembles in the experimental section will be made available at https://github.com/LorisNanni.

Numerous approaches address over-fitting in neural networks: by imposing a penalty on the parameters of the network (L1, L2, etc); by changing the network stochastically (drop-out, Gaussian noise, etc.); or by transforming the input data (batch normalization, etc.). In contrast, we aim to ensure that a minimum amount of supporting evidence is present when fitting the model parameters to the training data. This, at the single neuron level, is equivalent to ensuring that both sides of the separating hyperplane (for a standard artificial neuron) have a minimum number of data points — noting that these points need not belong to the same class for the inner layers. We firstly benchmark the results of this approach on the standard Fashion-MINST dataset, comparing it to various regularization techniques. Interestingly, we note that by nudging each neuron to divide, at least in part, its input data, the resulting networks make use of each neuron, avoiding a hyperplane completely on one side of its input data (which is equivalent to a constant into the next layers). To illustrate this point, we study the prevalence of saturated nodes throughout training, showing that neurons are activated more frequently and earlier in training when using this regularization approach. A direct consequence of the improved neuron activation is that deep networks are now easier to train. This is crucially important when the network topology is not known a priori and fitting often remains stuck in a suboptimal local minima. We demonstrate this property by training a network of increasing depth (and constant width): most regularization approaches will result in increasingly frequent training failures (over different random seeds) whilst the proposed evidence-based regularization significantly outperforms in its ability to train deep networks.

This paper designed a miniaturized Planer Inverted-F Antenna for 5G communication networks including Long Term Evolution Advanced mobile communication services. With showing the radiation pattern, voltage standing wave ratio, and antenna gain of the designed Planer Inverted-F Antenna, this paper evaluates its performance. To show the key characteristics of the Planer Inverted-F Antenna, this paper modeled and simulated it with various variances. Moreover, the real Planer Inverted-F Antenna is fabricated, and measurements were done to validate the simulated characteristics of the internal antenna.

Activation Functions are crucial parts of the Deep Learning Artificial Neural Networks. From the Biological point of view, a neuron is just a node with many inputs and one output. A neural network consists of many interconnected neurons. It is a “simple” device that receives data at the input and provides a response. The function of neurons is to process and transmit information; the neuron is the basic unit in the nervous system. Carly Vandergriendt (2018) stated the human brain at birth consists of an estimated 100 billion Neurons. The ability of a machine to mimic human intelligence is called Machine Learning. Deep Learning Artificial Neural Networks was designed to work like a human brain with the aid of arbitrary choice of Non-linear Activation Functions. Currently, there is no rule of thumb on the choice of Activation Functions, “Try out different things and see what combinations lead to the best performance”, however, sincerely; the choice of Activation Functions should not be Trial and error. Jamilu (2019) proposed that Activation Functions shall be emanated from AI-ML-Purified Data Set and its choice shall satisfy Jameel’s ANNAF Stochastic and or Deterministic Criterion. The objectives of this paper are to propose instances where Deep Learning Artificial Neural Networks are SUPERINTELLIGENT. Using Jameel’s ANNAF Stochastic and or Deterministic Criterion, the paper proposed four classes where Deep Learning Artificial Neural Networks are Superintelligent namely; Stochastic Superintelligent, Deterministic Superintelligent, and Stochastic-Deterministic 1^st and 2^nd Levels Superintelligence. Also, a Normal Probabilistic-Deterministic case was proposed.

Hardy Cross originally proposed a method for analysis of flow in networks of conduits or conductors in 1936. His method was the first really useful engineering method in the field of pipe network calculation. Only electrical analogs of hydraulic networks were used before the Hardy Cross method. A problem with the flow resistance versus the electrical resistance makes these electrical analog methods obsolete. The method by Hardy Cross is taught extensively at faculties and it still remains an important tool for analysis of looped pipe systems. Engineers today mostly use a modified Hardy Cross method which threats the whole looped network of pipes simultaneously (use of these methods without computers is practically impossible). A method from the Russian practice published during 1930s, which is similar to the Hardy Cross method, is described, too. Some notes from the life of Hardy Cross are also shown. Finally, an improved version of the Hardy Cross method, which significantly reduces number of iterations, is presented and discussed. Also we tested multi-point iterative methods which can be used as substitution for the Newton-Raphson approach used by Hardy Cross, but this approach didn’t reduce number of required iterations to reach the final balanced solution. Although, many new models have been developed since the time of Hardy Cross, main purpose of this paper is to illustrate the very beginning of modeling of gas and water pipe networks or ventilation systems.

In computer networks, loss of data packets is inevitable, in particular, because of the buffer memory overflow of at least one of the nodes located on the path from the source to the receiver, including the latter. Such losses associated with overflows are hereinafter referred to as congestion of network nodes. There are many ways to prevent and eliminate overloads; these methods, in the majority, are based on the management of data flows. A special place is taken by the maintenance of packages, taking into account their priorities. The article considers a number of original technical solutions to improve the quality of control and reduce the required amount of buffer memory of network nodes. The ideas of these solutions are quite simple for their implementation in the development of appropriate software and hardware for telecommunication devices.

Trends such as Industrial Internet of Things (IIoT) and Industry 4.0 have increased the need to use powerfull network technologies in industrial automation. The growing communication in industrial automation is harnessing the productivity and efficiency of manufacturing and process automation with minimum human intervention. Due to the ongoing evolution of industrial networks from Fieldbus technologies to Ethernet, the new opportunity has emerged to integrate the Software Defined Networking (SDN) technique. In this paper, we provide a brief overview of SDN in the domain of industrial automation. We propose a network architecture called Software Defined Industrial Automation Network (SDIAN), with the objective of improving network scalability and efficiency. To match the specific considerations and requirements of having a deterministic system in an industrial network, we propose two solutions for flow creation: Pro-active Flow Installation Scheme (PFIS) and Hybrid Flow-Installation Scheme (HFIS). We analytically quantify the proposed solutions in alleviating the overhead incurred from the flow setup cost. The analytical model is verified through monte carlo simulations. We also evaluate the SDIAN architecture and analyze the network performance of the modified topology using an emulator called Mininet. We further list and motivate SDIAN features and in particular report on an experimental food processing plant demonstration featuring Raspberry PIs (RPIs) instead of traditional Programmable Logic Controllers (PLCs). Our demonstration exemplifies the characteristics of SDIAN.

Abstract: Background: epileptic encephalopathies (EE) are characterized by severe drug-resistant seizures, early-onset, and unfavorable developmental outcome. We describe a cohort of pediatric patients with EE who underwent intravenous methylprednisolone (IVMP) pulse therapy to examine its efficacy/tolerability. Methods: This is a retrospective study from 2020 to 2023. Inclusion criteria were: ≤18 years at the time of IVMP pulse therapy and at least 6 months of follow-up. Efficacy and outcome, defined as seizure reduction >50% (responder rate), were evaluated at 6 and 9 months of therapy, and 6 months after therapy suspension; quality of Life (QoL) was also assessed. Variables predicting positive post-IVMP outcomes were identified using statistical analysis. Results: Twenty-one patients were included. The responding rate was 85.7% at 6 and 9 months of therapy, and 80.9% at 6 months after therapy suspension. Genetic etiology and encephalopathy related to status epilepticus during NREM sleep (ESES) were predictive of efficacy (p=0.0475). The fourth month of therapy was the minimum time point to establish the effectiveness of the treatment. All patients showed improvements in QoL, EEG tracing and postural-motor development. No relevant adverse events were observed. Conclusions: Our study confirms the efficacy and tolerability of pulse IVMP treatment in pediatric patients with EE, especially with genetic etiology and ESES. The fourth month of therapy was the minimum time point to establish its effectiveness. QoL, EEG and postural-motor development also showed improvement.

{This study investigates the coordinated behaviors and the underlying collective intelligence in biological groups, particularly those led by informed leaders. By establishing new convergence criteria based on real biological group experiments, this research introduces the concept of a volitional term and heterogeneous networks, constructing a coupled force Cucker-Smale model with informed leaders. The inclusion of the informed leader aspect distinctively characterizes the dynamics of leaders and followers, enabling a more accurate representation of biological group behavior. The paper then proposes the Flock Leadership Hierarchy Network (FLH), a model reflecting real biological interactions. By employing time slicing and rolling time windows, the study methodically analyses group behavior stages, using volatility and convergence time as metrics to examine the relationship between group consistency and interactions. Comparative experiments show the FLH network's superior performance. The Kolmogorov-Smirnov test indicates that the FLH network follows a power-law distribution, highlighting the evolutionary intelligence of biological groups. This research offers new perspectives on the evolution of biological groups, contributing to our understanding of both natural and artificial systems, such as animal migration and autonomous drone operations.

Next-generation cancer and oncology research needs to take full advantage of the multi-modal structured, or graph, information, with the graph datatypes ranging from molecular structures to spatially resolved imaging and digital pathology to biological networks to knowledge graphs. Graph Neural Networks (GNNs) efficiently combine the graph structure representations with the high predictive performance of deep learning, especially on the large multi-modal datasets. In this review article, we survey the landscape of recent (2020-present) GNN applications in the context of cancer and oncology research, and delineate six currently predominant research areas. Subsequently, we identify the most promising directions for future research. We compare GNNs with graphical models and "non-structured" deep learning, and devise the guidelines for cancer and oncology researchers or physician-scientists asking the question of whether they should adopt the GNN methodology in their research pipelines.

Accent is on determination of appropriate friction factor of the pipes and on selection of the representative equation for water or natural gas flow which is valuable for existing conditions in the looped network of pipelines. Note that in a municipal gas pipeline, natural gas can be treated as incompressible fluid (liquid) i.e. as water or oil. Even under this circumstance, calculation of water pipelines cannot be literary copied and applied for calculation of gas pipelines. Inappropriate friction factor, equally as e.g. inappropriate usage of water flow equations for calculation of gas networks can lead to inaccurate final results. Few iterative methods for determining the optimal hydraulic solution of water- and gas- looped pipeline networks, such as, Hardy Cross, modified Hardy Cross, node-loop method, node and M.M. Andrijashev method, will be shown. Speed of convergence will be compared and discussed using a simple network with three loops.

IoTs and WSNs utilize their connectivity to enable solutions supporting a spectrum of industries in different and volatile environments. To effectively enhance the security and quality of service of networks, empirical research should take into account a variety of factors and be structured in a replicable manner. This will not only ensure scalability but also enable verification of conclusions, leading to more constructive outcomes. Cooja offers limited performance analysis capabilities of simulations, which are often extracted and calculated manually. In this paper, we introduce a framework and a toolkit that enable researchers to conduct structured and conclusive experiments considering different factors and metrics, experiment design to results analysis. Besides, this tool summarizes multiple network metrics and allows multiple scenarios. As proof of concept, this paper studies the flooding attacks on IoT and illustrates their impact on the network, leveraging the proposed framework and tools.

Over the years, network analysis became a promising strategy to analyze complex system, i.e. systems composed by a large number of interacting elements. In particular, multilayer networks have emerged as a powerful framework for modelling and analysing complex systems with multiple types of interactions. Network analysis can be applied to pharmacogenomics to gain insights into the interactions between genes, drugs, and diseases. By integrating network analysis techniques with pharmacogenomic data, the goal consists to uncover complex relationships and identify key genes to use in pathway enrichment analysis to figure out biological pathways involved in drug response and adverse reactions. In this study, we model omics, diseases and drugs data together through the multilayer network representation. Then, we mined the multilayer network with a community detection algorithm by obtaining top communities. After that, we used the identified list of genes from the communities to perform pathway enrichment analysis (PEA) to figure out the biological function affected form the selected genes. The results show that the genes forming the top community have the multiple roles through different pathways.

With the exponential growth of machine learning and development of Artificial Neural Network (ANNs) in recent years, there is great opportunity to leverage this approach and accelarate bio-logical discoveries through applications on the analysis of bioinformatics data. Various types of datasets including for example protein or gene interaction networks, molecular structures and cellular signalling pathways, have already been used for machine learning by training ANNs for inference and pattern classification. However, unlike regular data structures that are commonly used in the computer science and engineering fields, bioinformatics datasets present challenges that require unique algorithmic approaches. The recent development of the geometric and deep learning approach within the machine learning field, is very promising towards accelerating analysis complex bioinformatics datasets. The principles of ANNs and their importance for bio-informatics machine learning is demonstrated herein, through presentation of the undelying mathematical and statistical foundations from group theory, symmetry, linear algebra. Further-more, the structure and functions of ANN algorithms that form the core principles of artificial intelligence are explained, in relation to the bioinformatics data domain. Overall, the manuscript provides guidance for researchers to understand the principles required for practicing machine learning and artificial intelligence, with the special considerations towards bioinformatics applications.

Abstract: In network science and big data, the concept of finding meaningful infrastructures in networks has emerged as a method of finding groups of entities with similar properties within very complex systems. The whole concept is generally based on finding subnetworks which have more properties (links) amongst nodes belonging to the same cluster than nodes in other groups (A concept presented by Girvan and Newman, 2002). Today meaningful infrastructure identification is applied in all types of networks from computer networks, to social networks to biological networks. In this article we will look at how meaningful infrastructure identification is applied in biological networks. This concept is important in biological networks as it helps scientist discover patterns in proteins or drugs which helps in solving many medical mysteries. This article will encompass the different algorithms that are used for meaningful infrastructure identification in biological networks. These include Genetic Algorithm, Differential Evolution, Water Cycle Algorithm (WCA), Walktrap Algorithm, Connect Intensity Iteration Algorithm (CIIA), Firefly algorithms and Overlapping Multiple Label Propagation Algorithm. These al-gorithms are compared with using performance measurement parameters such as the Mod-ularity, Normalized Mutual Information, Functional Enrichment, Recall and Precision, Re-dundancy, Purity and Surprise, which we will also discuss here.

The accurate prediction of molecular properties such as lipophilicity and aqueous solubility are of great importance and pose challenges in several stages of the drug discovery pipeline. Machine learning methods like graph-based neural networks (GNNs) have shown exceptionally good performance in predicting these properties. In this work, we introduce a novel GNN architecture, called directed edge graph isomorphism network (D-GIN). It is composed of two distinct sub-architectures (D-MPNN, GIN) and achieves an improvement in accuracy over its sub-architectures employing various learning, and featurization strategies. We argue that combining models with different key aspects help make graph neural networks deeper and simultaneously increase their predictive power. Furthermore, we address current limitations in assessment of deep-learning models, namely, comparison of single training run performance metrics, and offer a more robust solution.

Autonomous image recognition has numerous potential applications in the field of planetary science and geology. For instance, having the ability to classify images of rocks would allow geologists to have immediate feedback without having to bring back samples to the laboratory. Also, planetary rovers could classify rocks in remote places and even in other planets without needing human intervention. Shu et al. classified 9 different types of rock images using a Support Vector Machine (SVM) with the image features extracted autonomously. Through this method, the authors achieved a test accuracy of 96.71%. In this research, Convolutional Neural Networks(CNN) have been used to classify the same set of rock images. Results show that a 3-layer network obtains an average accuracy of 99.60% across 10 trials on the test set. A version of Self-taught Learning was also implemented to prove the generalizability of the features extracted by the CNN. Finally, one model has been chosen to be deployed on a mobile device to demonstrate practicality and portability. The deployed model achieves a perfect classification accuracy on the test set, while taking only 0.068 seconds to make a prediction, equivalent to about 14 frames per second.

In this article, we investigate limitations of importing methods based on algorithmic information theory from monoplex networks into multidimensional networks (such as multilayer networks) that have a large number of extra dimensions (i.e., aspects). In the worst-case scenario, it has been previously shown that node-aligned multidimensional networks with non-uniform multidimensional spaces can display exponentially larger algorithmic information (or lossless compressibility) distortions with respect to their isomorphic monoplex networks, so that these distortions grow at least linearly with the number of extra dimensions. In the present article, we demonstrate that node-unaligned multidimensional networks, either with uniform or non-uniform multidimensional spaces, can also display exponentially larger algorithmic information distortions with respect to their isomorphic monoplex networks. However, unlike the node-aligned non-uniform case studied in previous work, these distortions in the node-unaligned case grow at least exponentially with the number of extra dimensions. On the other hand, for node-aligned multidimensional networks with uniform multidimensional spaces, we demonstrate that any distortion can only grow up to a logarithmic order of the number of extra dimensions. Thus, these results establish that isomorphisms between finite multidimensional networks and finite monoplex networks do not preserve algorithmic information in general and highlight that the algorithmic information of the multidimensional space itself needs to be taken into account in multidimensional network complexity analysis.

This work describes and compares the backpropagation algorithm with the Extended Kalman filter, a second-order training method which can be applied to the problem of learning neural network parameters and is known to converge in only a few iterations. The algorithms are compared with respect to their effectiveness and speed of convergence using simulated data for both, a regression and a classification task.

This paper details the evolution of access network sharing models from legacy DSL to the most recent fibre-based technology and the main challenges faced from a technical and business perspectives. We first give an overview of existing access sharing models, that span physical local loop unbundling and virtual unbundled local access. We then describe different types of optical access technologies and highlight how they support network sharing. Next, we examine how the concept of SDN and network virtualization has been pivotal in enabling the idea of “true multi-tenancy”, through the use of programmability, flexible architecture and resource isolation. We give examples of recent developments of cloud central office and OLT virtualization. Finally, we provide an insight into the role that novel business models, such as blockchain and smart contract technology, could play in 5G networks. We discuss how these might evolve, to provide flexibility and dynamic operations that are needed in the data and control planes.

Polarization in online social networks has gathered a significant amount of attention in the research community and in the public sphere due to stark disagreements with millions of participants in topics surrounding politics, climate, the economy and other areas where an agreement is required. There are multiple approaches to investigating the scenarios in which polarization occurs and given that polarization is not a new phenomenon but that its virality may be supported by the low cost and latency messaging offered by online social media platforms; an investigation into the intrinsic dynamics of online opinion evolution is presented for complete networks. Extending a model which utilizes the Binary Voter Model (BVM) to examine the effect of the degree of freedom for selecting contacts based upon homophily, simulations show that different opinions are reinforced for a period of time when users have a greater range of choice for association. The facility of discussion threads and groups formed upon common views further delays the rate in which a consensus can form between all members of the network. This can temporarily incubate members from interacting with those who can present an alternative opinion where a voter model would then proceed to produce a homogeneous opinion based upon pairwise interactions.

Load balancing, energy efficiency and fault tolerance are among the most important data dissemination issues in Wireless Sensor Networks (WSNs). In order to successfully cope with the mentioned issues, two main approaches (namely, Data-centric Storage and Distributed Data Storage) have been proposed in the literature. Both approaches suffer from data loss due to memory and/or energy depletion in the storage nodes. Even though several techniques have been proposed so far to overcome the mentioned problems, the proposed solutions typically focus on one issue at a time. In this paper, we integrate the Data-centric Storage (DCS) features into Distributed Data Storage (DDS) mechanisms and present a novel approach, denoted as Collaborative Memory and Energy Management (CoMEM), to overcome both problems and bring memory and energy efficiency to the data loss mechanism of WSNs. We also propose analytical and simulation frameworks for performance evaluation. Our results show that the proposed method outperforms existing approaches in various WSN scenarios.

In the fifth generation communication system, millimeter wave (mmWave) networks will coexist with traditional micro wave (μWave) networks, which allows for higher data transmission rate and better user experience. In this paper, we give a comprehensive framework of mathematical models and analytical methods for multi-tier mmWave and μWave hybrid caching networks based on stochastic geometry. We propose an association strategy by assuming average biased-received power association and Rayleigh fading. Accordingly, by using a D-ball approximating blockage model of mmWave networks, expressions of the cell association probability and the coverage probability of the hybrid networks are derived. Also, we use the average successful delivery probability as the performance metric to analyze the existing caching placement strategies. Simulation results validate the accuracy of our analytical conclusions.

Wireless Sensor Networks (WSNs) are being increasingly adopted in critical applications, where verifying the correct operation of sensor nodes is a major concern. Undesired events may undermine the mission of the WSNs. Hence their effects need to be properly assessed before deployment to obtain a good level of expected performance and during the operation in order to avoid dangerous unexpected results. In this paper we propose a methodology to support design and deployment of dependable WSNs by means of an event-based formal verification technique. The methodology includes a process to guide designers towards the realization of a dependable WSN and a tool ("ADVISES") to simplify its adoption. The tool allows to generate automatically formal specifications used to check correctness properties and evaluate dependability metrics at design time and at runtime. During the runtime we can check the behavior of theWSN accordingly to the results obtained at design time and we can detect sudden and unexpected failures, in order to trigger recovery procedures. The effectiveness of the methodology is shown in the context of two case studies, aiming to illustrate how the tool is helpful to drive design choices and to check the correctness properties of theWSN at runtime

This paper investigates the dynamic properties of artificial neural networks using differential equations and explores the influence of parameters on stability and neural oscillations. By analyzing the equilibrium point of the differential equations, we identify conditions for asymptotic stability and criteria for oscillation in artificial neural networks. Furthermore, we demonstrate how adjusting synaptic weights between neurons can effectively control stability and oscillation. The proposed model offers potential insights into the malfunctioning mechanisms of biological neural networks implicated in neurological disorders like Parkinson's disease tremors and epilepsy seizures, which are characterized by abnormal oscillations.