Multiple Networks Research Articles

Various exact solutions of the (4+1)-dimensional Boiti–Leon–Manna–Pempinelli-like equation by using bilinear neural network method

In this paper, Bilinear neural network method is used to investigate the (4+1)-dimensional Boiti–Leon–Manna–Pempinelli-like (BLMP-like) equation, which can be utilized to model wave phenomena in incompressible fluids and in the study of fluid mechanics. On the basis of the generalized bilinear operators, the generalized bilinear equation is formulated. In the bilinear neural network method, a variety of neural network structures, including the single hidden layer and multiple hidden layers neural network are employed to investigate the exact solutions. By considering the special values of the parameters involved, the dynamical behavior of the solution is analyzed graphically. The effective method adopted significantly contributes to the understanding of nonlinear evolution equations in various fields, including plasma physics, mathematical physics, electromagnetism, and fluid dynamics.

Deep learning‐based spectrum sharing in next generation multi‐operator cellular networks

SummaryOwing to the exponential increase in wireless network services and bandwidth requirements, sharing the radio spectrum among multiple network operators seems inevitable. In wireless networks, enabling efficient spectrum sharing for resource allocation is quite challenging due to several random factors, especially in multi‐operator spectrum sharing. While spectrum sensing can be useful in spectrum‐sharing networks, the chance of collision exists due to the inherent unreliability of wireless networks, making operators reluctant to use sensing‐based mechanisms for spectrum sharing. To circumvent these issues, we utilize an alternative approach, whereby we propose an efficient spectrum‐sharing mechanism leveraging a spectrum coordinator (SC) in a multi‐operator spectrum‐sharing scenario assisted by deep learning (DL). In our proposed scheme, before the beginning of each timeslot, the base station of each operator transmits the number of required resources based on the number of packets in the base station's queue to SC. In addition, base stations also transmit the list of available channels to SC. After gathering information from all base stations, SC distributes this collected information to all the base stations. Each base station then utilizes the DL‐based spectrum‐sharing algorithm and computes the number of resources it can use based on the number of packets in its queue and the number of packets in the queues of other operators. Furthermore, by leveraging DL, each operator also computes the cost it must pay to other operators for using their resources. We evaluate the performance of the proposed network through extensive simulations. It is shown that the proposed DL‐based spectrum‐sharing mechanism outperforms the conventional spectrum allocation scheme, thus paving the way for more dynamic and efficient multi‐operator spectrum sharing.

Coupled hydrogeophysical inversion through ensemble smoother with multiple data assimilation and convolutional neural network for contaminant plume reconstruction

In the field of groundwater, accurate delineation of contaminant plumes is critical for designing effective remediation strategies. Typically, this identification poses a challenge as it involves solving an inverse problem with limited concentration data available. To improve the understanding of contaminant behavior within aquifers, hydrogeophysics emerges as a powerful tool by enabling the combination of non-invasive geophysical techniques (i.e., electrical resistivity tomography—ERT) and hydrological variables. This paper investigates the potential of the Ensemble Smoother with Multiple Data Assimilation method to address the inverse problem at hand by simultaneously assimilating observed ERT data and scattered concentration values from monitoring wells. A novelty aspect is the integration of a Convolutional Neural Network (CNN) to replace and expedite the expensive geophysical forward model. The proposed approach is applied to a synthetic case study, simulating a tracer test in an unconfined aquifer. Five scenarios are compared, allowing to explore the effects of combining multiple data sources and their abundance. The outcomes highlight the efficacy of the proposed approach in estimating the spatial distribution of a concentration plume. Notably, the scenario integrating apparent resistivity with concentration values emerges as the most promising, as long as there are enough concentration data. This underlines the importance of adopting a comprehensive approach to tracer plume mapping by leveraging different types of information. Additionally, a comparison was conducted between the inverse procedure solved using the full geophysical forward model and the CNN model, showcasing comparable performance in terms of results, but with a significant acceleration in computational time.

Smccnet 2.0: a comprehensive tool for multi-omics network inference with shiny visualization

SummarySparse multiple canonical correlation network analysis (SmCCNet) is a machine learning technique for integrating omics data along with a variable of interest (e.g., phenotype of complex disease), and reconstructing multi-omics networks that are specific to this variable. We present the second-generation SmCCNet (SmCCNet 2.0) that adeptly integrates single or multiple omics data types along with a quantitative or binary phenotype of interest. In addition, this new package offers a streamlined setup process that can be configured manually or automatically, ensuring a flexible and user-friendly experience.AvailabilityThis package is available in both CRAN: https://cran.r-project.org/web/packages/SmCCNet/index.html and Github: https://github.com/KechrisLab/SmCCNet under the MIT license. The network visualization tool is available at https://smccnet.shinyapps.io/smccnetnetwork/.

GoibhniUWE: A Lightweight and Modular Container-Based Cyber Range

Cyberattacks are rapidly evolving both in terms of techniques and frequency, from low-level attacks through to sophisticated Advanced Persistent Threats (APTs). There is a need to consider how testbed environments such as cyber ranges can be readily deployed to improve the examination of attack characteristics, as well as the assessment of defences. Whilst cyber ranges are not new, they can often be computationally expensive, require an extensive setup and configuration, or may not provide full support for areas such as logging or ongoing learning. In this paper, we propose GoibhniUWE, a container-based cyber range that provides a flexible platform for investigating the full lifecycle of a cyberattack. Adopting a modular approach, users can seamlessly switch out existing, containerised vulnerable services and deploying multiple different services at once, allowing for the creation of complex and realistic deployments. The range is fully instrumented with logging capabilities from a variety of sources including Intrusion Detection Systems (IDSs), service logging, and network traffic captures. To demonstrate the effectiveness of our approach, we deploy the GoibhniUWE range under multiple conditions to simulate various vulnerable environments, reporting on and comparing key metrics such as CPU and memory usage. We simulate complex attacks which span multiple services and networks, with logging at multiple levels, modelling an Advanced Persistent Threat (APT) and their associated Tactics, Techniques, and Procedures (TTPs). We find that even under continuous, active, and targeted deployment, GoibhniUWE averaged a CPU usage of less than 50%, in an environment using four single-core processors, and memory usage of less than 4.5 GB.

Manifold-based approach for neural network robustness analysis

It is important to understand the mathematical foundations of neural networks and to include robustness in model evaluation. Here, we introduce algorithms based on manifold curvature estimation to assess neural network robustness. These algorithms rely solely on training data and do not require regular or adversarial test data. Initially, a metric is proposed to measure the curvature of discrete data manifolds by introducing weighted angles concept between subspaces. Following this, a robustness measure is introduced that is independent of network architecture or model parameters. Lastly, two additional methods are introduced, utilizing curvature estimation of special manifolds formed by using gradient vectors between output and input network layers, alongside manifold curvature estimation. A comprehensive evaluation is provided on multiple network models using the CIFAR-10 dataset. Manifold geometry-based robustness analysis may lead to the development of not only accurate but also robust neural network models.

MSH-DTI: multi-graph convolution with self-supervised embedding and heterogeneous aggregation for drug-target interaction prediction

Background:The rise of network pharmacology has led to the widespread use of network-based computational methods in predicting drug target interaction (DTI). However, existing DTI prediction models typically rely on a limited amount of data to extract drug and target features, potentially affecting the comprehensiveness and robustness of features. In addition, although multiple networks are used for DTI prediction, the integration of heterogeneous information often involves simplistic aggregation and attention mechanisms, which may impose certain limitations.Results:MSH-DTI, a deep learning model for predicting drug-target interactions, is proposed in this paper. The model uses self-supervised learning methods to obtain drug and target structure features. A Heterogeneous Interaction-enhanced Feature Fusion Module is designed for multi-graph construction, and the graph convolutional networks are used to extract node features. With the help of an attention mechanism, the model focuses on the important parts of different features for prediction. Experimental results show that the AUROC and AUPR of MSH-DTI are 0.9620 and 0.9605 respectively, outperforming other models on the DTINet dataset.Conclusion:The proposed MSH-DTI is a helpful tool to discover drug-target interactions, which is also validated through case studies in predicting new DTIs.

Multi-granularity attribute similarity model for user alignment across social platforms under pre-aligned data sparsity

Cross-platform User Alignment (UA) aims to identify accounts belonging to the same individual across multiple social network platforms. This study seeks to enhance the performance of UA tasks while reducing the required sample data. Previous research has focused excessively on model design, lacking optimization throughout the entire process, making it challenging to achieve performance without heavy reliance on labeled data. This paper proposes a semi-supervised Multi-Granularity Attribute Similarity Model (MGASM). First, MGASM optimizes the embedding process through multi-granularity modeling at the levels of characters, words, articles, structures, and labels, and enhances missing data by leveraging adjacent text attributes. Next, MGASM quantifies the correlation between attributes of the same granularity by constructing Multi-Granularity Attribute Cosine Distance Distribution Vectors (MA-CDDVs). These vectors form the basis for a binary classification similarity model trained to calculate similarity scores for user pairs. Additionally, an attribute reappearance score correction (ARSC) mechanism is introduced to further refine the ranking of candidate users. Extensive experiments on the Weibo-Douban and DBLP17-DBLP19 datasets demonstrate that compared to state-of-the-art methods, The hit-precision of the MGASM series has significantly improved by 68.15% and 27.02%, almost reaching 100% precision. The F1 score has increased by 37.6% and 21.4%.

Multiple anthropogenic environmental stressors structure soil bacterial diversity and community network

Microbial communities in many ecosystems are suffering a wide range of environmental stressors induced by anthropogenic perturbations. While the impacts of a single stressor have been extensively estimated in numerous studies, the responses of microbial communities to multiple environmental stressors simultaneously are still poorly understood. In the current study, we investigated the taxonomic diversity, community resistance, and co-occurrence interaction of soil bacterial communities treated with different numbers of environmental stressors by conducting 136 microcosms. We found that the richness and Shannon diversity of the soil community decreased significantly from 1430 to 6.54 in the mono-factor treatments to 920 and 5.77 in the hepta-factor treatments. The counts of nodes and edges of the soil microbial networks decreased with the increasing stressor number, potentially indicating that multiple stressors can reduce the network size. Multiple stressors increased the community resistance potential to environmental disturbance. Additionally, the network cohesion suggested that the cooperative and competitive behaviors between microorganisms were induced by multiple stressors. The observation could be potentially due to the enrichment of the generalists by multiple environmental stressors. Although only a handful of stressors were included, our study still indicated that multiple environmental stressors would lead to diversity loss via deterministic processes.

Leaf venation network architecture coordinates functional trade-offs across vein spatial scales: evidence for multiple alternative designs.

Variation in leaf venation network architecture may reflect trade-offs among multiple functions including efficiency, resilience, support, cost, and resistance to drought and herbivory. However, our knowledge about architecture-function trade-offs is mostly based on studies examining a small number of functional axes, so we still lack a more integrative picture of multidimensional trade-offs. Here, we measured architecture and functional traits on 122 ferns and angiosperms species to describe how trade-offs vary across phylogenetic groups and vein spatial scales (small, medium, and large vein width) and determine whether architecture traits at each scale have independent or integrated effects on each function. We found that generalized architecture-function trade-offs are weak. Architecture strongly predicts leaf support and damage resistance axes but weakly predicts efficiency and resilience axes. Architecture traits at different spatial scales contribute to different functional axes, allowing plants to independently modulate different functions by varying network properties at each scale. This independence of vein architecture traits within and across spatial scales may enable evolution of multiple alternative leaf network designs with similar functioning.

FLORAH: a generative model for halo assembly histories

ABSTRACT The mass assembly history (MAH) of dark matter haloes plays a crucial role in shaping the formation and evolution of galaxies. MAHs are used extensively in semi-analytic and empirical models of galaxy formation, yet current analytic methods to generate them are inaccurate and unable to capture their relationship with the halo internal structure and large-scale environment. This paper introduces florah (FLOw-based Recurrent model for Assembly Histories), a machine-learning framework for generating assembly histories of ensembles of dark matter haloes. We train florah on the assembly histories from the Gadget at Ultra-high Redshift with Extra Fine Time-steps and vsmdplN-body simulations and demonstrate its ability to recover key properties such as the time evolution of mass and concentration. We obtain similar results for the galaxy stellar mass versus halo mass relation and its residuals when we run the Santa Cruz semi-analytic model on florah-generated assembly histories and halo formation histories extracted from an N-body simulation. We further show that florah also reproduces the dependence of clustering on properties other than mass (assembly bias), which is not captured by other analytic methods. By combining multiple networks trained on a suite of simulations with different redshift ranges and mass resolutions, we are able to construct accurate main progenitor branches with a wide dynamic mass range from $z=0$ up to an ultra-high redshift $z \approx 20$, currently far beyond that of a single N-body simulation. florah is the first step towards a machine learning-based framework for planting full merger trees; this will enable the exploration of different galaxy formation scenarios with great computational efficiency at unprecedented accuracy.

Using machine learning to dissect host kinases required for Leishmania internalization and development

The Leishmania life cycle alternates between promastigotes, found in the sandfly, and amastigotes, found in mammals. When an infected sandfly bites a host, promastigotes are engulfed by phagocytes (i.e., neutrophils, dendritic cells, and macrophages) to establish infection. When these phagocytes die or break down, amastigotes must be re-internalized to survive within the acidic phagolysosome and establish disease. To define host kinase regulators of Leishmania promastigote and amastigote uptake and survival within macrophages, we performed an image-based kinase regression screen using a panel of 38 kinase inhibitors with unique yet overlapping kinase targets. We also targeted inert beads to complement receptor 3 (CR3) or Fcγ receptors (FcR) as controls by coating them with complement/C3bi or IgG respectively. Through this approach, we identified several putative host kinases that regulate receptor-mediated phagocytosis and/or the uptake of L. amazonensis. Findings included kinases previously implicated in Leishmania uptake (such as Src family kinases (SFK), Abl family kinases (ABL1/c-Abl, ABL2/Arg), and spleen tyrosine kinase (SYK)), but we also uncovered many novel kinases. Our methods also predicted host kinases necessary for promastigotes to convert to amastigotes or for amastigotes to survive within macrophages. Overall, our results suggest that the concerted action of multiple interconnected networks of host kinases are needed over the course of Leishmania infection, and that the kinases required for the parasite’s life cycle may differ substantially depending on which receptors are bound and the life cycle stage that is internalized. In addition, using our screen, we identified kinases that appear to preferentially regulate the uptake of parasites over beads, indicating that the methods required for Leishmania to be internalized by macrophages may differ from generalized phagocytic mechanisms. Our findings are intended to be used as a hypothesis generation resource for the broader scientific community studying the roles of kinases in host-pathogen interactions.

Functional Network Connectivity for Components of Depression-Related Psychological Fragility.

Psychological resilience (PR) is known to be inversely associated with depression. While there is a growing body of research examining how depression alters activity across multiple functional neural networks, how differences in PR affect these networks is largely unexplored. This study examines the relationship between PR and functional connectivity in the alpha and beta bands within (and between) eighteen established cortical nodes in the default mode network, the central executive network, and the salience network. Resting-state EEG data from 99 adult participants (32 depressed, 67 non-depressed) were used to measure the correlation between the five factors of PR sourced from the Connor-Davidson Resilience Scale and eLORETA-based measures of coherence and phase synchronisation. Distinct functional connectivity patterns were seen across each resilience factor, with a notable absence of overlapping positive results across the depressed and non-depressed samples. These results indicate that depression may modulate how resilience is expressed in terms of fundamental neural activity.

NJGCG: A node-based joint Gaussian copula graphical model for gene networks inference across multiple states

Inferring the interactions between genes is essential for understanding the mechanisms underlying biological processes. Gene networks will change along with the change of environment and state. The accumulation of gene expression data from multiple states makes it possible to estimate the gene networks in various states based on computational methods. However, most existing gene network inference methods focus on estimating a gene network from a single state, ignoring the similarities between networks in different but related states. Moreover, in addition to individual edges, similarities and differences between different networks may also be driven by hub genes. But existing network inference methods rarely consider hub genes, which affects the accuracy of network estimation. In this paper, we propose a novel node-based joint Gaussian copula graphical (NJGCG) model to infer multiple gene networks from gene expression data containing heterogeneous samples jointly. Our model can handle various gene expression data with missing values. Furthermore, a tree-structured group lasso penalty is designed to identify the common and specific hub genes in different gene networks. Simulation studies show that our proposed method outperforms other compared methods in all cases. We also apply NJGCG to infer the gene networks for different stages of differentiation in mouse embryonic stem cells and different subtypes of breast cancer, and explore changes in gene networks across different stages of differentiation or different subtypes of breast cancer. The common and specific hub genes in the estimated gene networks are closely related to stem cell differentiation processes and heterogeneity within breast cancers.

A 2 : Towards Accelerator Level Parallelism for Autonomous Micromobility Systems

Autonomous micromobility systems (AMS) such as low-speed minicabs and robots are thriving. In AMS, multiple Deep Neural Networks execute in parallel on heterogeneous AI accelerators. An emerging paradigm called Accelerator Level Parallelism (ALP) suggests managing accelerators holistically. However, there lacks a specialized and practical solution populating ALP for an AMS, where the varying real-time requirements under different working scenarios bring an opportunity to dynamically tradeoff between latency and efficiency. Furthermore, accelerator heterogeneity introduces enormous configuration space, and the shared-memory architecture results in dynamic bandwidth interference. In this paper, we propose A 2 , a novel AMS resource manager optimizing energy and memory space efficiency under variable latency constraints. We gain insight from prior Learn&Control scheme to design an Analyze&Adapt scheme specialized for heterogeneous AI accelerators under shared-memory architecture. It features analyzing the system thoroughly offline to support two-step adaptation online. We build a prototype of A 2 and evaluate it on a commercial edge platform. We show that A 2 achieves 32.8% improvements in power and 13.8% in memory compared with control-based methods. As for timeliness enhancement, A 2 reduces the deadline violation rate by 9.2 percentage points (12.8% → 3.6%) on average compared to directly porting Learn&Control methods.

An adversarial-based domain generalization method for the health evaluation of axial piston pumps

Abstract The axial piston pump is the power component in hydraulic systems and evaluating its health status is of great importance to the safe operation of hydraulic systems. Discharge pressure signals are common monitoring signals for axial piston pumps, but it is difficult to obtain satisfactory health evaluation results by directly using raw discharge pressure signals since the degradation information lies in some specific frequency bands. Furthermore, the axial piston pump often operates under different operating conditions and most existing deep learning models have low diagnostic accuracies due to the problems of insufficient degradation data and different data distribution. This paper proposes an adversarial-based domain generalization (DG) method by integrating time-frequency analysis and data augmentation, to accurately predict the health status of axial piston pumps under unknown working conditions. First, discharge pressure signals under various operating conditions are decomposed by using the complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN), and effective intrinsic mode functions (IMFs) are selected to train multiple convolutional neural network (CNN) models. Second, a novel data augmentation method based on the modified discrete cosine transform-composite spectrum (DCS) algorithm is introduced to fuse the IMFs from different domains and generate pseudo data sets. Finally, the adversarial training is adopted between the real data and the pseudo data to capture domain-generalized features. The discharge pressure signal of an actual axial piston pump at different health levels were collected on a test bench to verify the effectiveness of the proposed method. Results indicate that the proposed method has a higher prediction accuracy than the comparative methods.

Multi-modal deep learning framework for damage detection in social media posts.

In crisis management, quickly identifying and helping affected individuals is key, especially when there is limited information about the survivors' conditions. Traditional emergency systems often face issues with reachability and handling large volumes of requests. Social media has become crucial in disaster response, providing important information and aiding in rescues when standard communication systems fail. Due to the large amount of data generated on social media during emergencies, there is a need for automated systems to process this information effectively and help improve emergency responses, potentially saving lives. Therefore, accurately understanding visual scenes and their meanings is important for identifying damage and obtaining useful information. Our research introduces a framework for detecting damage in social media posts, combining the Bidirectional Encoder Representations from Transformers (BERT) architecture with advanced convolutional processing. This framework includes a BERT-based network for analyzing text and multiple convolutional neural network blocks for processing images. The results show that this combination is very effective, outperforming existing methods in accuracy, recall, and F1 score. In the future, this method could be enhanced by including more types of information, such as human voices or background sounds, to improve its prediction efficiency.

ε-Nash Equilibrium of Pursuer–Evader–Defender Missile Navigation Dynamic Games

This research is dedicated to developing a min–max robust control strategy for a dynamic game involving pursuers, evaders, and defenders in a multiple-missile scenario. The approach employs neural dynamic programming, utilizing multiple continuous differential neural networks (DNNs). The competitive controller devised addresses the robust optimization of a joint cost function that relies on the trajectories of the pursuer–evader–defender system, accommodating an uncertain mathematical model while adhering to control restrictions. The dynamic programming min–max formulation facilitates robust control by accounting for bounded modeling uncertainties and external disturbances for each game component. The value function of the Hamilton–Jacobi–Bellman (HJB) equation is approximated by a DNN, enabling the estimation of the closed-loop formulation for the joint dynamic game with state restrictions. The controller’s design is grounded in estimating the state trajectory under the worst possible uncertainties and perturbations, providing a robustness factor through the robust neural controller. The learning law class for the time-varying weights in the DNN is generated by studying the HJB partial differential equation for the missile motion for each player in the dynamic game. The controller incorporates the solution of the obtained learning laws and a time-varying Riccati equation, offering an online solution to the control implementation. A recurrent algorithm, based on the Kiefer–Wolfowitz method, adjusts the initial conditions for the weights to satisfy the final condition of the given cost function for the dynamic game. A numerical example is presented to validate the proposed robust control methodology, confirming the optimization solution based on the DNN approximation for Bellman’s value function.

A Novel Two-Step Channel Estimation Method for RIS-Assisted mmWave Systems.

In this work, we resolve the cascaded channel estimation problem and the reflected channel estimation problem for the reconfigurable intelligent surface (RIS)-assisted millimeter-wave (mmWave) systems. The novel two-step method contains modified multiple population genetic algorithm (MMPGA), least squares (LS), residual network (ResNet), and multi-task regression model. In the first step, the proposed MMPGA-LS optimizes the crossover strategy and mutation strategy. Besides, the ResNet achieves cascaded channel estimation by learning the relationship between the cascaded channel obtained by the MMPGA-LS and the channel of the user (UE)-RIS-base station (BS). Then, the proposed multi-task-ResNet (MTRnet) is introduced for the reflected channel estimation. Relying on the output of ResNet, the MTRnet with multiple output layers estimates the coefficients of reflected channels and reconstructs the channel of UE-RIS and RIS-BS. Remarkably, the proposed MTRnet is capable of using a lower optimization model to estimate multiple reflected channels compared with the classical neural network with the single output layer. A series of experimental results validate the superiority of the proposed method in terms of a lower norm mean square error (NMSE). Besides, the proposed method also obtains a low NMSE in the RIS with the formulation of the uniform planar array.

A Cross-Working Condition-Bearing Diagnosis Method Based on Image Fusion and a Residual Network Incorporating the Kolmogorov–Arnold Representation Theorem

With the optimization and advancement of industrial production and manufacturing, the application scenarios of bearings have become increasingly diverse and highly coupled. This complexity poses significant challenges for the extraction of bearing fault features, consequently affecting the accuracy of cross-condition fault diagnosis methods. To improve the extraction and recognition of fault features and enhance the diagnostic accuracy of models across different conditions, this paper proposes a cross-condition bearing diagnosis method. This method, named MCR-KAResNet-TLDAF, is based on image fusion and a residual network that incorporates the Kolmogorov–Arnold representation theorem. Firstly, the one-dimensional vibration signals of the bearing are processed using Markov transition field (MTF), continuous wavelet transform (CWT), and recurrence plot (RP) methods, converting the resulting images to grayscale. These grayscale images are then multiplied by corresponding coefficients and fed into the R, G, and B channels for image fusion. Subsequently, fault features are extracted using a residual network enhanced by the Kolmogorov–Arnold representation theorem. Additionally, a domain adaptation algorithm combining multiple kernel maximum mean discrepancy (MK-MMD ) and conditional domain adversarial network with entropy conditioning (CDAN+E ) is employed to align the source and target domains, thereby enhancing the model’s cross-condition diagnostic accuracy. The proposed method was experimentally validated on the Case Western Reserve University (CWRU) dataset and the Jiangnan University (JUN) dataset, which include the 6205-2RS JEM SKF, N205, and NU205 bearing models. The method achieved accuracy rates of 99.36% and 99.889% on the two datasets, respectively. Comparative experiments from various perspectives further confirm the superiority and effectiveness of the proposed model.