Network Behavior Research Articles

Adversarial nonnegative matrix factorization for temporal link prediction

Temporal link prediction has been extensively studied and widely applied in various applications, aiming to predict future network links based on the historical networks. However, most existing methods ignore the behavior of previous network updating information in temporal networks. To address these issues, we propose a novel link prediction model based on adversarial nonnegative matrix factorization, which fuses graph representation and adversarial learning to perform temporal link prediction. Specifically, we add a bounded adversary matrix to the input matrix to provide the robustness against real perturbations. Then, our model fully exploits the impact of snapshots by using communicability. Simultaneously, we utilize the cosine similarity to extract the node similarity and map it to low-dimensional latent representation to preserve the local structure. Additionally, we provide effective updating rules to learn the parameters of this model. Extensive experiments results on six real-world networks demonstrate that the proposed method outperforms several classical and the state-of-art matrix-based methods.

The Impact of Blind Box Economy on Consumer Behavior in Social Media Networks

Blind box is a kind of non-transparent box, consumers can not know in advance of the specific product style of the goods, and this random form of consumption is being sought after by a large number of young people. With the continuous enrichment of blind box products, in the era of social media, the blind box economy is growing stronger. Blind box economy, as a special consumption model, has risen rapidly in social media networks in recent years. This paper aims to explore the definition, characteristics, and effects of blind box economy on consumer behavior. Firstly, the definition and characteristics of blind box economy are introduced, including aesthetic experience, emotional value, social value, and second-hand value. Secondly, the influence path of blind box economy on consumer behavior is analyzed, and the interest groups, purchasing process, consumption behavior and symbol consumption are discussed. Finally, the positive and negative effects of blind box economy on consumer behavior are summarized, and relevant suggestions are put forward to promote the healthy development of blind box economy and the reasonable choice of consumers.

A Robust Model for Predicting Abnormal Behavior in Vehicular Networks using AdaBoost and Chi-Square

A Robust Model for Predicting Abnormal Behavior in Vehicular Networks using AdaBoost and Chi-Square

Machine learning applications of network security enhancement: review

Machine learning (ML) is being used to improve intrusion detection mechanisms and identification in cyber security. Network data volume scaling (with the help of Machine learning) — Automated analysis and pattern recognition for large amounts of network-data, thereby detection of anomalies / potentially malicious activities that escape current rule-based techniques. By training ML models on historical data, these models can learn benign network behavior as well the anomalies in them that may result from malicious activities. The purpose of this essay/report is to begin taking a look under the hood at how ML can be used for security threat detection and analysis in-networking on an ongoing basis. This paper covers the automation of ML algorithms to enhance network security. Given the current state of electronic threats and their evolution, traditional security methods are typically insufficient. ML can analyze large volumes of data, learn patterns from it and this makes it suitable to complement network defense mechanisms. It then discusses different ML applications in network cybersecurity: intrusion detection, anomaly detection, spam and malware analysis; which the paper characterizes. It analyzes the potential, benefits and constrains of major ML methods in network security like supervised learning; unsupervised learning and reinforcement-learning. Finally, this paper represents recent progress in the use and impact of ML techniques along with case studies.The paper discusses the existing difficulties in the field such as the necessity for datasets and the vulnerability of machine learning models to adversarial attacks.T he paper also highlights avenues for exploration by focusing on developing scalable security solutions based on machine learning that are resilient and flexible.The goal of this examination is to offer both researchers and industry professionals valuable perspectives into the opportunities and obstacles linked to utilizing machine learning, in the domain of network security. ML methods have potential to improve network security by addressing the challenges posed by the increasing cyber threats that traditional security measures struggle to combat effectively over time. One key strength of ML lies in its capacity to analyze datasets and identify intricate patterns efficiently. The research paper delves into applications of ML in enhancing network security. The list covers security tools like Intrusion Detection Systems (IDS) examining malware and phishing attempts as well as anomalies in network activity and user behavior analysis (UEBA). The study explores both supervised and unsupervised learning methods. How they are used for quick threat detection and response in real time scenarios.You will find case studies and recent developments that showcase the implementation and effectiveness of these strategies.In addition the article delves into the obstacles linked to using machine learning techniques in network security including the necessity, for datasets, The paper's goal is to give an enlightening summary to scholars and practitioners about how machine learning can be applied to network security in order to provide solutions that are robust, adaptive, and scalable. To this end, it touches on several relevant aspects. One is the threat posed by adversarial attacks on the sorts of models that are likely to be used in this context. Another is the imperative, deriving from both adversarial threat and model drift, that models needed in this context be available in a form usable for continuous update. Keywords: Network Security, machine learning (ML), Intrusion Detection Systems (IDS), entity behavior analytics (UEBA).

Identification of dynamic networks community by fusing deep learning and evolutionary clustering

Community detection is a critical component of network analysis and a hot topic in social computing. Detecting community structure in dynamic networks has important theoretical and practical implications for understanding the intrinsic function of networks and predicting network behavior. However, the majority of existing dynamic community detection methods adopt shallow models, which have limited ability to excavate complex non-linear structures and tend to generate undesirable community structures. In order to obtain an accurate and robust community structure in dynamic networks, we are inspired by network representation learning and utilize the deep learning to detect evolving communities in dynamic networks. In this paper, we propose a novel dynamic community detection method by fusing Deep Learning and Evolutionary Clustering (DLEC). This work attempts to combine deep learning and evolutionary clustering into a unified framework. First, we propose a matrix construction strategy to fully reveal the inherent community structures via the underlying community memberships. Then, we develop a novel multi-layer deep autoencoder framework that consists of multiple non-linear functions to extract the latent deep representation of the dynamic network. Based on the evolutionary clustering framework, a graph regularization term is introduced to ensure the smoothness of the community evolution. Finally, we employ the K-means clustering algorithm on the low-dimensional network space to obtain the community structure. Extensive experimental results on synthetic and real-world networks show that the proposed DLEC algorithm can effectively detect high-quality communities in dynamic networks.

Influences of short-term and long-term plasticity of memristive synapse on firing activity of neuronal network

Abstract Synaptic plasticity can greatly affect the firing behavior of neural networks, and it specifically refers to changes in the strength, morphology, and function of synaptic connections. In this paper, a novel memristor model, which can be configured as a volatile and nonvolatile memristor by adjusting its internal parameter, is proposed to mimic the short-term and long-term synaptic plasticity. Then, a bi-neuron network model, with the proposed memristor serving as a coupling synapse and the external electromagnetic radiation being emulated by the flux-controlled memristors, is established to elucidate the effects of short-term and long-term synaptic plasticity on firing activity of the neuron network. The resultant 7D neuron network has no equilibrium point and its hidden dynamical behavior is revealed by phase diagram, time series, bifurcation diagram, Lyapunov exponent spectrum and two-dimensional dynamic map. Our results show the short-term and long-term plasticity can induce different bifurcation scenarios when the coupling strength increases. In addition, memristor synaptic plasticity has a great influence on the distribution of firing patterns in the parameter space. More interestingly, when exploring the synchronous firing behavior of two neurons, the two neurons can gradually achieve phase synchronization as the coupling strength increases along the opposite directions under two different memory attributes. Finally, a microcontroller-based hardware system is implemented to verify the numerical simulation results.

Investigation of Different Throat Concepts for Precipitation Processes in Saturated Pore-Network Models

AbstractThe development of reliable mathematical models and numerical discretization methods is important for the understanding of salt precipitation in porous media, which is relevant for environmental problems like soil salinization. Models on the pore scale are necessary to represent local heterogeneities in precipitation and to include the influence of solution-air-solid interfaces. A pore-network model for saturated flow, which includes the precipitation reaction of salt, is presented. It is implemented in the open-source simulator DuMu$$^{\textrm{X}}$$ X . In this paper, we restrict ourselves to one-phase flow as a first step. Since the throat transmissibilities determine the flow behaviour in the pore network, different concepts for the decreasing throat transmissibility due to precipitation are investigated. We consider four concepts for the amount of precipitation in the throats. Three concepts use information from the adjacent pore bodies, and one employs a pore-throat model obtained by averaging the resolved pore-scale model in a thin-tube. They lead to different permeability developments, which are caused by the different distribution of the precipitate between the pore bodies and throats. We additionally apply two different concepts for the calculation of the transmissibility. One obtains the precipitate distribution from analytical assumptions, the other from a geometric minimization principle using a phase-field evolution equation. The two concepts do not show substantial differences for the permeability development as long as simple pore-throat geometries are used. Finally, advantages and disadvantages of the concepts are discussed in the context of the considered physical problem and a reasonable effort for the implementation and computational costs.

Hybrid Intelligent Anomaly Detection System Using Attention based Deep Learning Approach for Cyber Attacks Prevention

Objectives: Network Intrusion Detection System (NIDS) plays an important role in finding and preventing cyber-attacks, which helps to improve the entire security posture of an organization’s network infrastructure. The development of Deep Learning (DL) techniques possess the ability of IDS to detect attacks without delay and protects from intrusions even in real-time environment. Methods: The present study proposes an improved IDS framework called Enhanced Gated Recurrent Unit Hyper-Model combined Attention Bidirectional Long-Short Term Memory (EGHAB) approach, to effectively address the detection of attacks with maximum accuracy and minimal error rate. The proposed model is enhanced by using methods like numericalization and normalisation for pre-processing the input data, Genetic Algorithm (GA) for extracting intricate features from the input data, and the EGHAB classifier, which works on the principles of both Gated Recurrent Unit (GRU) and Bidirectional Long-Short Term Memory (BiLSTM) models along with attention mechanism. Findings: The EGHAB model efficiently learns the abnormal behaviour of network and classified the attack and non-attack data using the publicly available NSL-KDD dataset and a generated real time data set, scapy. And it achieved 99.94% accuracy over NSL KDD dataset during multiclass classification and 93.3% on real time data set with reduced Error rate. Additionally, to examine the efficacy, the proposed approach is compared with other existing methods and proved its improved performance. Novelty: A combined ensemble classifier with GRU, BiLSTM and attention mechanism is designed to predict the attacks in earlier stage rather than due over. The model achieved better accuracy and reduced false assumption using anomaly prediction mechanism. Keywords: Cyber Attack, Anomaly Detection, Deep learning, Gated Recurrent Unit, Bi­ Directional Long­-Short Term Memory, Attention mechanism

Data Mining Techniques used for Evaluation an Efficient DDoS Attack Detection System: A Deep-Learning Model

Developed recently to solve the shortcomings of traditional networks, software-defined networking is a new paradigm (SDN). Decoupling the control plane from the data plane, which is the SDN's core property, makes network management simpler and promotes effective programmability. The new design, on the other hand, is vulnerable to a number of attacks that could exhaust the system's resources and prohibit the SDN controller from offering services to authorized users. One of these threats, the Distributed Denial of Service (DDoS) assault is one that is gaining popularity. A DDoS assault has a severe negative effect on emphasize servers have no ability to access their network facilities as a result. accommodate legitimate users. We introduce DDoS Net, a DDoS attacks system for intrusion detection for SDN systems. Our approach is based on data mining software (Rapdiminer) and neural networks working along with auto encoders. As a result, we have a lot of faith in protecting these networks thanks to our methods. We assess the CICIDS 2019 dataset, which includes network behavior associated with DDoS threat and benign network activity, is publicly available, and satisfies certain requirements. It evaluates a variety of data mining algorithms' efficacy as well as internet usage characteristics to determine the best attributes for spotting the most typical assault kinds.

Adaptive control of recurrent neural networks using conceptors.

Recurrent neural networks excel at predicting and generating complex high-dimensional temporal patterns. Due to their inherent nonlinear dynamics and memory, they can learn unbounded temporal dependencies from data. In a machine learning setting, the network's parameters are adapted during a training phase to match the requirements of a given task/problem increasing its computational capabilities. After the training, the network parameters are kept fixed to exploit the learned computations. The static parameters, therefore, render the network unadaptive to changing conditions, such as an external or internal perturbation. In this paper, we demonstrate how keeping parts of the network adaptive even after the training enhances its functionality and robustness. Here, we utilize the conceptor framework and conceptualize an adaptive control loop analyzing the network's behavior continuously and adjusting its time-varying internal representation to follow a desired target. We demonstrate how the added adaptivity of the network supports the computational functionality in three distinct tasks: interpolation of temporal patterns, stabilization against partial network degradation, and robustness against input distortion. Our results highlight the potential of adaptive networks in machine learning beyond training, enabling them to not only learn complex patterns but also dynamically adjust to changing environments, ultimately broadening their applicability.

A Novel Approach Integrating the Method of Characteristics with Large Time-Step Scheme (MOC-LTS) for Efficient Transient Flow Simulation in Liquid Pipelines

Water hammer incidents pose a significant risk to the safety and stability of pipeline operations. Therefore, rapid and precise transient flow simulation is essential for efficiently developing scientific water hammer control strategies. Nevertheless, the prevailing transient flow simulation methods for liquid pipelines predominantly employ explicit schemes to solve transient flow control equations, necessitating adherence to the stability criterion of Courant-Friedrichs-Lewy (CFL) ≤ 1. This results in limited time step sizes, which in turn constrains computational efficiency, particularly when simulating hydraulic behavior in large-scale pipeline networks. In this paper, a novel approach integrating the method of characteristics (MOC) with a large time-step scheme (LTS) is proposed to enable rapid and accurate simulation of transient flow in liquid pipelines. The proposed approach discretizes the computational domain into contiguous control volumes, ategorizing them as either boundary or internal control volumes depending on whether they are affected by boundary conditions within a large time step. For internal control volumes, an LTS scheme based on the first-order Godunov format is employed to improve computational efficiency. For boundary control volumes, MOC is applied iteratively to accurately capture boundary dynamics until the simulated time matches that of the internal control volumes. Quantitative analysis is conducted to verify the performance of the proposed approach. The results confirm that the proposed approach outperforms the MOC in computational efficiency while maintaining minimal accuracy loss.

Dynamics of two feed forward genetic motifs in the presence of molecular noise

Understanding the function of common motifs in gene regulatory networks is an important goal of systems biology. Feed forward loops (FFLs) are an example of such a motif. In FFLs, a gene (X) regulates another gene (Z) both directly and via an intermediary gene (Y). Previous theoretical studies have suggested several possible functions for FFLs, based on their transient responses to changes in input signals (using deterministic models) and their fluctuations around steady state (using stochastic models). In this paper we study stochastic models of the two most common FFLs, “coherent type 1” and “incoherent type 1”. We incorporate molecular noise by treating DNA binding, transcription, translation, and decay as stochastic processes. By comparing the dynamics of these loops with models of alternative networks (in which X does not regulate Y), we explore how FFLs act to process information in the presence of noise. This work highlights the importance of incorporating realistic molecular noise in studying both the transient and steady-state behavior of gene regulatory networks.

Dynamically equivalent disjunctive networks

The study of the dynamical behavior of Boolean networks with different update schedules has so far focused primarily on the possible dynamics and equivalent networks that can be obtained. However, few studies have been done about which networks can be obtained from another network with a non-parallel schedule.In this article, we define the problem of finding a Boolean network that is dynamically equivalent to another network. For the general case, it is shown that the problem is NP-Hard. However, if the problem is restricted to disjunctive Boolean networks, it can be solved in polynomial time.

Maximum entropy-based modeling of community-level hazard responses for civil infrastructures

Perturbed by natural hazards, community-level infrastructure networks operate like many-body systems, with behaviors emerging from coupling individual component dynamics with group correlations and interactions. It follows that we can borrow methods from statistical physics to study the response of infrastructure systems to natural disasters. This study aims to construct a joint probability distribution model to describe the post-hazard state of infrastructure networks and propose an efficient surrogate model of the joint distribution for large-scale systems. Specifically, we present maximum entropy modeling of the regional impact of natural hazards on civil infrastructures. Provided with the current state of knowledge, the principle of maximum entropy yields the “most unbiased“ joint distribution model for the performances of infrastructures. In the general form, the model can handle multivariate performance states and higher-order correlations. In a particular yet typical scenario of binary performance state variables with knowledge of their mean and pairwise correlation, the joint distribution reduces to the Ising model in statistical physics. In this context, we propose using a dichotomized Gaussian model as an efficient surrogate for the maximum entropy model, facilitating the application to large systems. Using the proposed method, we investigate the seismic collective behavior of a large-scale road network (with 8,694 nodes and 26,964 links) in San Francisco, showcasing the non-trivial collective behaviors of infrastructure systems.

Structure-Reactivity Relationships in a Small Library of Imine-Type Dynamic Covalent Materials: Determination of Rate and Equilibrium Constants Enables Model Prediction and Validation of a Unique Mechanical Softening in Dynamic Hydrogels.

The development of next generation soft and recyclable materials prominently features dynamic (reversible) chemistries such as host-guest, supramolecular, and dynamic covalent. Dynamic systems enable injectability, reprocessability, and time-dependent mechanical properties. These properties arise from the inherent relationship between the rate and equilibrium constants (RECs) of molecular junctions (cross-links) and the resulting macroscopic behavior of dynamic networks. However, few examples explicitly measure RECs while exploring this connection between molecular and material properties, particularly for polymeric hydrogel systems. Here we use dynamic covalent imine formation to study how single-point compositional changes in NH2-terminated nucleophiles affect binding constants and resulting hydrogel mechanical properties. We explored both model small molecule studies and model polymeric macromers, and found >3-decade change in RECs. Leveraging established relationships in the literature, we then developed a simple model to describe the cross-linking equilibrium and predict changes in hydrogel mechanical properties. Interestingly, we observed that a narrow ≈2-decade range of Keq's determine the bound fraction of imines. Our model allowed us to uncover a regime where adding cross-linker before saturation can decrease the cross-link density of a hydrogel. We then demonstrated the veracity of this predicted behavior experimentally. Notably this emergent behavior is not accounted for in covalent hydrogel theory. This study expands upon structure-reactivity relationships for imine formation, highlighting how quantitative determination of RECs facilitates predicting macroscopic behavior. Furthermore, while the present study focuses on dynamic covalent imine formation, the underlying principles of this work are applicable to the general bottom-up design of soft and recyclable dynamic materials.

Recent achievements in nonlinear dynamics, synchronization, and networks.

This Focus Issue covers recent developments in the broad areas of nonlinear dynamics, synchronization, and emergent behavior in dynamical networks. It targets current progress on issues such as time series analysis and data-driven modeling from real data such as climate, brain, and social dynamics. Predicting and detecting early warning signals of extreme climate conditions, epileptic seizures, or other catastrophic conditions are the primary tasks from real or experimental data. Exploring machine-based learning from real data for the purpose of modeling and prediction is an emerging area. Application of the evolutionary game theory in biological systems (eco-evolutionary game theory) is a developing direction for future research for the purpose of understanding the interactions between species. Recent progress of research on bifurcations, time series analysis, control, and time-delay systems is also discussed.

Spiking activities in small neural networks induced by external forcing.

Neurons in an excitable mode do not show spiking activity and, therefore, do not contribute to information transfer transmission and its processing. However, some external influences, coupling, or time delay can lead to the appearance of oscillations in individual systems or networks. The main goal of this paper is to uncover the connection parameters and parameters of external influences that lead to the arising of spiking behavior in a small network of locally coupled FitzHugh-Nagumo oscillators. In this study, we analyze the dynamics of a small network in the absence and presence of several types of external influences. First, we consider the impact of periodic-pulse exposure generated as a periodic sequence of Gaussian pulses. Second, we show what behavior can be induced by far less regular pulsed influence (Lévy noise) and its special case called white Gaussian noise. For all types of influences, we have identified the appropriate parameters (local coupling strength, intensity, and frequency) that induce spiking activity in the small network.

Novel image-analytic approach reveals new insights in fine-tuning of slime mould network adaptation.

This study introduces a novel methodology to explore the network dynamics of Physarum polycephalum, an organism celebrated for its remarkable adaptive capabilities. We used two innovative techniques to analyse its growth behaviour and network modifications under stress conditions, including starvation and differential epinephrine exposures. The first method provided a quantitative assessment of growth and exploration over time. The second method provided a detailed examination of vein diameter and contraction patterns, illuminating the physiological adjustments P. polycephalum undergoes in response to environmental challenges. By integrating these approaches, we were able to estimate the total network volume of the organism, with a focus on the normalized estimated volume, unveiling insightful aspects of its structural adaptations. While starvation reduced the volume, indicating a significant structural compromise, low and high epinephrine concentrations maintained a volume-to-area ratio comparable with the control. Determining the fractal dimension of the networks over time revealed a fine-tuning of the network complexity in response to environmental conditions, with significant reductions under stress indicating a constrained network adaptation strategy. These methods, novel in their application to P. polycephalum, provide a framework for future studies and a basis for exploring complex network behaviours with potential applications in bioengineering and adaptive network design.

Mathematical analysis of busy tone in full-duplex optical MAC for hidden node mitigation

This article provides the mathematical analysis of carrier sense multiple access with collision avoidance (CSMA/CA) media access control (MAC) protocol of IEEE 802.15.7 optical wireless communication (OWC). While the prior works have performed the OWC CSMA/CA mathematical analysis using the Markov models, deviation from the simulation results has been observed. We address this by improving the Markov model calculations, which display a mere 0.2% throughput deviation, nearly matching the simulation results. Furthermore, we work on the hidden node problem of the OWC networks. This problem is solved in literature by using various full-duplex communication methods, such as bi-directional data transmission and the busy tone signal; the latter is employed in our previous work on full-duplex optical MAC (FD-OMAC). These techniques increase the coverage area of the nodes by utilizing an access point (AP) as a relay node. However, the AP response is delayed by the processing time, causing an unexpected network behavior. The quantitative effect of this delay remains unexplored, which is critical for optimizing the OWC network. We bridge this gap by extending the proposed Markov analysis to model CSMA/CA and the aforementioned full-duplex techniques. This work equips readers with mathematical insights for future OWC MAC layer enhancements.

AI Telco Research: Advancements in Telecommunications Scientific Discovery

This article explores the transformative impact of Artificial Intelligence (AI) on telecommunications research and development. It examines how the integration of AI technologies is revolutionizing various aspects of the industry, including network optimization, spectrum management, and scientific discovery. The article highlights the synergy between human expertise and AI capabilities in enhancing research processes, improving data analysis, and driving innovation. Key areas of focus include AI-powered data analysis, network behavior simulation, signal processing enhancements, and the evolving nature of human-AI collaboration in telco research. The article also addresses challenges such as data privacy and algorithmic bias, while emphasizing the potential of AI to unlock new possibilities in telecommunications, from self-optimizing networks to quantum communication systems.