Biodiversity metrics on ecological networks: Demonstrated with animal gastrointestinal microbiomes

Biodiversity has become a terminology familiar to virtually every citizen in modern societies.It is said that ecology studies the economy of nature,and economy studies the ecology of humans;then measuring biodiversity should be similar with measuring national wealth.Indeed,there have been many parallels between ecology and economics,actually beyond analogies.For example,arguably the second most widely used biodiversity metric,Simpson(1949)’s diversity index,is a function of familiar Gini-index in economics.One of the biggest challenges has been the high“diversity”of diversity indexes due to their excessive“speciation”-there are so many indexes,similar to each country’s sovereign currency-leaving confused diversity practitioners in dilemma.In 1973,Hill introduced the concept of“numbers equivalent”,which is based on Renyi entropy and originated in economics,but possibly due to his abstruse interpretation of the concept,his message was not widely received by ecologists until nearly four decades later.What Hill suggested was similar to link the US dollar to gold at the rate of$35 per ounce under the Bretton Woods system.The Hill numbers now are considered most appropriate biodiversity metrics system,unifying Shannon,Simpson and other diversity indexes.Here,we approach to another paradigmatic shift-measuring biodiversity on ecological networks-demonstrated with animal gastrointestinal microbiomes representing four major invertebrate classes and all six vertebrate classes.The network diversity can reveal the diversity of species interactions,which is a necessary step for understanding the spatial and temporal structures and dynamics of biodiversity across environmental gradients.

Caching Strategies in NDN Based Wireless Ad Hoc Network:A Survey

Wireless Ad Hoc Networks consist of devices that are wirelessly connected.Mobile Ad Hoc Networks(MANETs),Internet of Things(IoT),and Vehicular Ad Hoc Networks(VANETs)are the main domains of wireless ad hoc network.Internet is used in wireless ad hoc network.Internet is based on Transmission Control Protocol(TCP)/Internet Protocol(IP)network where clients and servers interact with each other with the help of IP in a pre-defined environment.Internet fetches data from a fixed location.Data redundancy,mobility,and location dependency are the main issues of the IP network paradigm.All these factors result in poor performance of wireless ad hoc networks.The main disadvantage of IP is that,it does not provide in-network caching.Therefore,there is a need to move towards a new network that overcomes these limitations.Named Data Network(NDN)is a network that overcomes these limitations.NDN is a project of Information-centric Network(ICN).NDN provides in-network caching which helps in fast response to user queries.Implementing NDN in wireless ad hoc network provides many benefits such as caching,mobility,scalability,security,and privacy.By considering the certainty,in this survey paper,we present a comprehensive survey on Caching Strategies in NDN-based Wireless AdHocNetwork.Various cachingmechanism-based results are also described.In the last,we also shed light on the challenges and future directions of this promising field to provide a clear understanding of what caching-related problems exist in NDN-based wireless ad hoc networks.

Security Monitoring and Management for the Network Services in the Orchestration of SDN-NFV Environment Using Machine Learning Techniques

Software Defined Network(SDN)and Network Function Virtualization(NFV)technology promote several benefits to network operators,including reduced maintenance costs,increased network operational performance,simplified network lifecycle,and policies management.Network vulnerabilities try to modify services provided by Network Function Virtualization MANagement and Orchestration(NFV MANO),and malicious attacks in different scenarios disrupt the NFV Orchestrator(NFVO)and Virtualized Infrastructure Manager(VIM)lifecycle management related to network services or individual Virtualized Network Function(VNF).This paper proposes an anomaly detection mechanism that monitors threats in NFV MANO and manages promptly and adaptively to implement and handle security functions in order to enhance the quality of experience for end users.An anomaly detector investigates these identified risks and provides secure network services.It enables virtual network security functions and identifies anomalies in Kubernetes(a cloud-based platform).For training and testing purpose of the proposed approach,an intrusion-containing dataset is used that hold multiple malicious activities like a Smurf,Neptune,Teardrop,Pod,Land,IPsweep,etc.,categorized as Probing(Prob),Denial of Service(DoS),User to Root(U2R),and Remote to User(R2L)attacks.An anomaly detector is anticipated with the capabilities of a Machine Learning(ML)technique,making use of supervised learning techniques like Logistic Regression(LR),Support Vector Machine(SVM),Random Forest(RF),Naïve Bayes(NB),and Extreme Gradient Boosting(XGBoost).The proposed framework has been evaluated by deploying the identified ML algorithm on a Jupyter notebook in Kubeflow to simulate Kubernetes for validation purposes.RF classifier has shown better outcomes(99.90%accuracy)than other classifiers in detecting anomalies/intrusions in the containerized environment.

Design of an Interconnection Architecture and Sizing of Two (2) EPC Core Networks: The Case of Orange-Guinea

With the arrival of the 4G and 5G,the telecommunications networks have experienced a large expansion of these networks.That enabled the integration of many services and adequate flow,thus enabling the operators to respond to the growing demand of users.This rapid evolution has given the operators to adapt,their methods to the new technologies that increase.This complexity becomes more important,when these networks include several technologies to access different from the heterogeneous network like in the 4G network.The dimensional new challenges tell the application and the considerable increase in demand for services and the compatibility with existing networks,the management of mobility intercellular of users and it offers a better quality of services.Thus,the proposed solution to meet these new requirements is the sizing of the EPC(Evolved Packet Core)core network to support the 5G access network.For the case of Orange Guinea,this involves setting up an architecture for interconnecting the core networks of Sonfonia and Camayenne.The objectives of our work are of two orders:(1)to propose these solutions and recommendations for the heart network EPC sizing and the deployment to be adopted;(2)supply and architectural interconnection in the heart network EPC and an existing heart network.In our work,the model of traffic in communication that we use to calculate the traffic generated with each technology has link in the network of the heart.

A multilayer network diffusion-based model for reviewer recommendation

With the rapid growth of manuscript submissions,finding eligible reviewers for every submission has become a heavy task.Recommender systems are powerful tools developed in computer science and information science to deal with this problem.However,most existing approaches resort to text mining techniques to match manuscripts with potential reviewers,which require high-quality textual information to perform well.In this paper,we propose a reviewer recommendation algorithm based on a network diffusion process on a scholar-paper multilayer network,with no requirement for textual information.The network incorporates the relationship of scholar-paper pairs,the collaboration among scholars,and the bibliographic coupling among papers.Experimental results show that our proposed algorithm outperforms other state-of-the-art recommendation methods that use graph random walk and matrix factorization and methods that use machine learning and natural language processing,with improvements of over 7.62%in recall,5.66%in hit rate,and 47.53%in ranking score.Our work sheds light on the effectiveness of multilayer network diffusion-based methods in the reviewer recommendation problem,which will help to facilitate the peer-review process and promote information retrieval research in other practical scenes.

Influencer identification of dynamical networks based on an information entropy dimension reduction method

Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.

Citation and bibliographic coupling between authors in the field of social network analysis

Purpose:We analyzed the structure of a community of authors working in the field of social network analysis(SNA)based on citation indicators:direct citation and bibliographic coupling metrics.We observed patterns at the micro,meso,and macro levels of analysis.Design/methodology/approach:We used bibliometric network analysis,including the“temporal quantities”approach proposed to study temporal networks.Using a two-mode network linking publications with authors and a one-mode network of citations between the works,we constructed and analyzed the networks of citation and bibliographic coupling among authors.We used an iterated saturation data collection approach.Findings:At the macro-level,we observed the global structural features of citations between authors,showing that 80%of authors have not more than 15 citations from other works.At the meso-level,we extracted the groups of authors citing each other and similar to each other according to their citation patterns.We have seen a division of authors in SNA into groups of social scientists and physicists,as well as into other groups of authors from different disciplines.We found some examples of brokerage between different groups that maintained the common identity of the field.At the micro-level,we extracted authors with extremely high values of received citations,who can be considered as the most prominent authors in the field.We examined the temporal properties of the most popular authors.Research limitations:The main challenge in this approach is the resolution of the author’s name(synonyms and homonyms).We faced the author disambiguation,or“multiple personalities”(Harzing,2015)problem.To remain consistent and comparable with our previously published articles,we used the same SNA data collected up to 2018.The analysis and conclusions on the activity,productivity,and visibility of the authors are relative only to the field of SNA.Practical implications:The proposed approach can be utilized for similar objectives and identifying key structures and characteristics in other disciplines.This may potentially inspire the application of network approaches in other research areas,creating more authors collaborating in the field of SNA.Originality/value:We identified and applied an innovative approach and methods to study the structure of scientific communities,which allowed us to get the findings going beyond those obtained with other methods.We used a new approach to temporal network analysis,which is an important addition to the analysis as it provides detailed information on different measures for the authors and pairs of authors over time.

Theoretical Framework for a Polymorphic Network Environment

The question of whether an ideal network exists with global scalability in its full life cycle has always been a first-principles problem in the research of network systems and architectures.Thus far,it has not been possible to scientifically practice the design criteria of an ideal network in a unimorphic network system,making it difficult to adapt to known services with clear application scenarios while supporting the ever-growing future services with unexpected characteristics.Here,we theoretically prove that no unimorphic network system can simultaneously meet the scalability requirement in a full cycle in three dimensions—the service-level agreement(S),multiplexity(M),and variousness(V)—which we name as the“impossible SMV triangle”dilemma.It is only by transforming the current network development paradigm that the contradiction between global scalability and a unified network infrastructure can be resolved from the perspectives of thinking,methodology,and practice norms.In this paper,we propose a theoretical framework called the polymorphic network environment(PNE),the first principle of which is to separate or decouple application network systems from the infrastructure environment and,under the given resource conditions,use core technologies such as the elementization of network baselines,the dynamic aggregation of resources,and collaborative software and hardware arrangements to generate the capability of the“network of networks.”This makes it possible to construct an ideal network system that is designed for change and capable of symbiosis and coexistence with the generative network morpha in the spatiotemporal dimensions.An environment test for principle verification shows that the generated representative application network modalities can not only coexist without mutual influence but also independently match well-defined multimedia services or custom services under the constraints of technical and economic indicators.

Network Traffic Synthesis and Simulation Framework for Cybersecurity Exercise Systems

In the rapidly evolving field of cybersecurity,the challenge of providing realistic exercise scenarios that accurately mimic real-world threats has become increasingly critical.Traditional methods often fall short in capturing the dynamic and complex nature of modern cyber threats.To address this gap,we propose a comprehensive framework designed to create authentic network environments tailored for cybersecurity exercise systems.Our framework leverages advanced simulation techniques to generate scenarios that mirror actual network conditions faced by professionals in the field.The cornerstone of our approach is the use of a conditional tabular generative adversarial network(CTGAN),a sophisticated tool that synthesizes realistic synthetic network traffic by learning fromreal data patterns.This technology allows us to handle technical components and sensitive information with high fidelity,ensuring that the synthetic data maintains statistical characteristics similar to those observed in real network environments.By meticulously analyzing the data collected from various network layers and translating these into structured tabular formats,our framework can generate network traffic that closely resembles that found in actual scenarios.An integral part of our process involves deploying this synthetic data within a simulated network environment,structured on software-defined networking(SDN)principles,to test and refine the traffic patterns.This simulation not only facilitates a direct comparison between the synthetic and real traffic but also enables us to identify discrepancies and refine the accuracy of our simulations.Our initial findings indicate an error rate of approximately 29.28%between the synthetic and real traffic data,highlighting areas for further improvement and adjustment.By providing a diverse array of network scenarios through our framework,we aim to enhance the exercise systems used by cybersecurity professionals.This not only improves their ability to respond to actual cyber threats but also ensures that the exercise is cost-effective and efficient.

Evolution and Governance of the Structure of Marine Economic Networks in China’s Coastal Areas: Based on Sea-related A-share Listed Companies

Data on discrete,isolated attributes of the marine economy are often used in traditional marine economic research.However,as the focus of urban research shifts from internal static attributes to external dynamic linkages,the importance of marine economic net-work research is beginning to emerge.The construction of the marine economic network in China’s coastal areas is necessary to change the flow of land and sea resources and optimize regional marine economic development.Employing data from headquarters and branches of sea-related A-share listed enterprises to construct the marine economic network in China,we use social network analysis(SNA)to discuss the characteristics of its evolution as of 2010,2015,and 2020 and its governance.The following results were obtained.1)In terms of topological characteristics,the scale of the marine economic network in China’s coastal areas has accelerated and expan-ded,and the connections have become increasingly close;thus,this development has complex network characteristics.2)In terms of spatial structure,the intensity of the connection fluctuates and does not form stable development support;the group structure gradually becomes clear,but the overall pattern is fragmented;there are spatial differences in marine economic agglomeration radiation;the radi-ation effect of the eastern marine economic circle is obvious;and the polarization effect of northern and southern marine economic circles is significant.On this basis,we construct a framework for the governance of a marine economic network with the market,the government,and industry as the three governing bodies.By clarifying the driving factors and building objectives of marine economic network construction,this study aims to foster the high-quality development of China’s marine economy.

Service Function Chain Migration in LEO Satellite Networks

With the advancements of software defined network(SDN)and network function virtualization(NFV),service function chain(SFC)placement becomes a crucial enabler for flexible resource scheduling in low earth orbit(LEO)satellite networks.While due to the scarcity of bandwidth resources and dynamic topology of LEO satellites,the static SFC placement schemes may cause performance degradation,resource waste and even service failure.In this paper,we consider migration and establish an online migration model,especially considering the dynamic topology.Given the scarcity of bandwidth resources,the model aims to maximize the total number of accepted SFCs while incurring as little bandwidth cost of SFC transmission and migration as possible.Due to its NP-hardness,we propose a heuristic minimized dynamic SFC migration(MDSM)algorithm that only triggers the migration procedure when new SFCs are rejected.Simulation results demonstrate that MDSM achieves a performance close to the upper bound with lower complexity.

Threshold-Based Software-Defined Networking(SDN)Solution for Healthcare Systems against Intrusion Attacks

The healthcare sector holds valuable and sensitive data.The amount of this data and the need to handle,exchange,and protect it,has been increasing at a fast pace.Due to their nature,software-defined networks(SDNs)are widely used in healthcare systems,as they ensure effective resource utilization,safety,great network management,and monitoring.In this sector,due to the value of thedata,SDNs faceamajor challengeposed byawide range of attacks,such as distributed denial of service(DDoS)and probe attacks.These attacks reduce network performance,causing the degradation of different key performance indicators(KPIs)or,in the worst cases,a network failure which can threaten human lives.This can be significant,especially with the current expansion of portable healthcare that supports mobile and wireless devices for what is called mobile health,or m-health.In this study,we examine the effectiveness of using SDNs for defense against DDoS,as well as their effects on different network KPIs under various scenarios.We propose a threshold-based DDoS classifier(TBDC)technique to classify DDoS attacks in healthcare SDNs,aiming to block traffic considered a hazard in the form of a DDoS attack.We then evaluate the accuracy and performance of the proposed TBDC approach.Our technique shows outstanding performance,increasing the mean throughput by 190.3%,reducing the mean delay by 95%,and reducing packet loss by 99.7%relative to normal,with DDoS attack traffic.

Downlink network-coded multiple access with diverse power

Normally,in the downlink Network-Coded Multiple Access(NCMA)system,the same power is allocated to different users.However,equal power allocation is unsuitable for some scenarios,such as when user devices have different Quality of Service(QoS)requirements.Hence,we study the power allocation in the downlink NCMA system in this paper,and propose a downlink Network-Coded Multiple Access with Diverse Power(NCMA-DP),wherein different amounts of power are allocated to different users.In terms of the Bit Error Rate(BER)of the multi-user decoder,and the number of packets required to correctly decode the message,the performance of the user with more allocated power is greatly improved compared to the Conventional NCMA(NCMA-C).Meanwhile,the performance of the user with less allocated power is still much better than NCMA-C.Furthermore,the overall throughput of NCMA-DP is greatly improved compared to that of NCMA-C.The simulation results demonstrate the remarkable performance of the proposed NCMA-DP.

Verifying hierarchical network nonlocality in general quantum networks

Recently, a class of innovative notions on quantum network nonlocality(QNN), called full quantum network nonlocality(FQNN), have been proposed in Phys. Rev. Lett. 128 010403(2022). As the generalization of full network nonlocality(FNN), l-level quantum network nonlocality(l-QNN) was defined in arxiv. 2306.15717 quant-ph(2024). FQNN is a NN that can be generated only from a network with all sources being non-classical. This is beyond the existing standard network nonlocality, which may be generated from a network with only a non-classical source. One of the challenging tasks is to establish corresponding Bell-like inequalities to demonstrate the FQNN or l-QNN. Up to now, the inequality criteria for FQNN and l-QNN have only been established for star and chain networks. In this paper, we devote ourselves to establishing Bell-like inequalities for networks with more complex structures. Note that star and chain networks are special kinds of tree-shaped networks. We first establish the Bell-like inequalities for verifying l-QNN in k-forked tree-shaped networks. Such results generalize the existing inequalities for star and chain networks. Furthermore, we find the Bell-like inequality criteria for l-QNN for general acyclic and cyclic networks. Finally, we discuss the demonstration of l-QNN in the well-known butterfly networks.

Weighted Forwarding in Graph Convolution Networks for Recommendation Information Systems

Recommendation Information Systems(RIS)are pivotal in helping users in swiftly locating desired content from the vast amount of information available on the Internet.Graph Convolution Network(GCN)algorithms have been employed to implement the RIS efficiently.However,the GCN algorithm faces limitations in terms of performance enhancement owing to the due to the embedding value-vanishing problem that occurs during the learning process.To address this issue,we propose a Weighted Forwarding method using the GCN(WF-GCN)algorithm.The proposed method involves multiplying the embedding results with different weights for each hop layer during graph learning.By applying the WF-GCN algorithm,which adjusts weights for each hop layer before forwarding to the next,nodes with many neighbors achieve higher embedding values.This approach facilitates the learning of more hop layers within the GCN framework.The efficacy of the WF-GCN was demonstrated through its application to various datasets.In the MovieLens dataset,the implementation of WF-GCN in LightGCN resulted in significant performance improvements,with recall and NDCG increasing by up to+163.64%and+132.04%,respectively.Similarly,in the Last.FM dataset,LightGCN using WF-GCN enhanced with WF-GCN showed substantial improvements,with the recall and NDCG metrics rising by up to+174.40%and+169.95%,respectively.Furthermore,the application of WF-GCN to Self-supervised Graph Learning(SGL)and Simple Graph Contrastive Learning(SimGCL)also demonstrated notable enhancements in both recall and NDCG across these datasets.

An End-To-End Hyperbolic Deep Graph Convolutional Neural Network Framework

Graph Convolutional Neural Networks(GCNs)have been widely used in various fields due to their powerful capabilities in processing graph-structured data.However,GCNs encounter significant challenges when applied to scale-free graphs with power-law distributions,resulting in substantial distortions.Moreover,most of the existing GCN models are shallow structures,which restricts their ability to capture dependencies among distant nodes and more refined high-order node features in scale-free graphs with hierarchical structures.To more broadly and precisely apply GCNs to real-world graphs exhibiting scale-free or hierarchical structures and utilize multi-level aggregation of GCNs for capturing high-level information in local representations,we propose the Hyperbolic Deep Graph Convolutional Neural Network(HDGCNN),an end-to-end deep graph representation learning framework that can map scale-free graphs from Euclidean space to hyperbolic space.In HDGCNN,we define the fundamental operations of deep graph convolutional neural networks in hyperbolic space.Additionally,we introduce a hyperbolic feature transformation method based on identity mapping and a dense connection scheme based on a novel non-local message passing framework.In addition,we present a neighborhood aggregation method that combines initial structural featureswith hyperbolic attention coefficients.Through the above methods,HDGCNN effectively leverages both the structural features and node features of graph data,enabling enhanced exploration of non-local structural features and more refined node features in scale-free or hierarchical graphs.Experimental results demonstrate that HDGCNN achieves remarkable performance improvements over state-ofthe-art GCNs in node classification and link prediction tasks,even when utilizing low-dimensional embedding representations.Furthermore,when compared to shallow hyperbolic graph convolutional neural network models,HDGCNN exhibits notable advantages and performance enhancements.

Screening biomarkers for spinal cord injury using weighted gene co-expression network analysis and machine learning

Immune changes and inflammatory responses have been identified as central events in the pathological process of spinal co rd injury.They can greatly affect nerve regeneration and functional recovery.However,there is still limited understanding of the peripheral immune inflammato ry response in spinal cord inju ry.In this study.we obtained microRNA expression profiles from the peripheral blood of patients with spinal co rd injury using high-throughput sequencing.We also obtained the mRNA expression profile of spinal cord injury patients from the Gene Expression Omnibus(GEO)database(GSE151371).We identified 54 differentially expressed microRNAs and 1656 diffe rentially expressed genes using bioinformatics approaches.Functional enrichment analysis revealed that various common immune and inflammation-related signaling pathways,such as neutrophil extracellular trap formation pathway,T cell receptor signaling pathway,and nuclear factor-κB signal pathway,we re abnormally activated or inhibited in spinal cord inju ry patient samples.We applied an integrated strategy that combines weighted gene co-expression network analysis,LASSO logistic regression,and SVM-RFE algorithm and identified three biomarke rs associated with spinal cord injury:ANO10,BST1,and ZFP36L2.We verified the expression levels and diagnostic perfo rmance of these three genes in the original training dataset and clinical samples through the receiver operating characteristic curve.Quantitative polymerase chain reaction results showed that ANO20 and BST1 mRNA levels were increased and ZFP36L2 mRNA was decreased in the peripheral blood of spinal cord injury patients.We also constructed a small RNA-mRNA interaction network using Cytoscape.Additionally,we evaluated the proportion of 22 types of immune cells in the peripheral blood of spinal co rd injury patients using the CIBERSORT tool.The proportions of naive B cells,plasma cells,monocytes,and neutrophils were increased while the proportions of memory B cells,CD8^(+)T cells,resting natural killer cells,resting dendritic cells,and eosinophils were markedly decreased in spinal cord injury patients increased compared with healthy subjects,and ANO10,BST1 and ZFP26L2we re closely related to the proportion of certain immune cell types.The findings from this study provide new directions for the development of treatment strategies related to immune inflammation in spinal co rd inju ry and suggest that ANO10,BST2,and ZFP36L2 are potential biomarkers for spinal cord injury.The study was registe red in the Chinese Clinical Trial Registry(registration No.ChiCTR2200066985,December 12,2022).

Pluggable multitask diffractive neural networks based on cascaded metasurfaces

Optical neural networks have significant advantages in terms of power consumption,parallelism,and high computing speed,which has intrigued extensive attention in both academic and engineering communities.It has been considered as one of the powerful tools in promoting the fields of imaging processing and object recognition.However,the existing optical system architecture cannot be reconstructed to the realization of multi-functional artificial intelligence systems simultaneously.To push the development of this issue,we propose the pluggable diffractive neural networks(P-DNN),a general paradigm resorting to the cascaded metasurfaces,which can be applied to recognize various tasks by switching internal plug-ins.As the proof-of-principle,the recognition functions of six types of handwritten digits and six types of fashions are numerical simulated and experimental demonstrated at near-infrared regimes.Encouragingly,the proposed paradigm not only improves the flexibility of the optical neural networks but paves the new route for achieving high-speed,low-power and versatile artificial intelligence systems.

Mapping Network-Coordinated Stacked Gated Recurrent Units for Turbulence Prediction

Accurately predicting fluid forces acting on the sur-face of a structure is crucial in engineering design.However,this task becomes particularly challenging in turbulent flow,due to the complex and irregular changes in the flow field.In this study,we propose a novel deep learning method,named mapping net-work-coordinated stacked gated recurrent units(MSU),for pre-dicting pressure on a circular cylinder from velocity data.Specifi-cally,our coordinated learning strategy is designed to extract the most critical velocity point for prediction,a process that has not been explored before.In our experiments,MSU extracts one point from a velocity field containing 121 points and utilizes this point to accurately predict 100 pressure points on the cylinder.This method significantly reduces the workload of data measure-ment in practical engineering applications.Our experimental results demonstrate that MSU predictions are highly similar to the real turbulent data in both spatio-temporal and individual aspects.Furthermore,the comparison results show that MSU predicts more precise results,even outperforming models that use all velocity field points.Compared with state-of-the-art methods,MSU has an average improvement of more than 45%in various indicators such as root mean square error(RMSE).Through comprehensive and authoritative physical verification,we estab-lished that MSU’s prediction results closely align with pressure field data obtained in real turbulence fields.This confirmation underscores the considerable potential of MSU for practical applications in real engineering scenarios.The code is available at https://github.com/zhangzm0128/MSU.

Applying an Improved Dung Beetle Optimizer Algorithm to Network Traffic Identification

Network traffic identification is critical for maintaining network security and further meeting various demands of network applications.However,network traffic data typically possesses high dimensionality and complexity,leading to practical problems in traffic identification data analytics.Since the original Dung Beetle Optimizer(DBO)algorithm,Grey Wolf Optimization(GWO)algorithm,Whale Optimization Algorithm(WOA),and Particle Swarm Optimization(PSO)algorithm have the shortcomings of slow convergence and easily fall into the local optimal solution,an Improved Dung Beetle Optimizer(IDBO)algorithm is proposed for network traffic identification.Firstly,the Sobol sequence is utilized to initialize the dung beetle population,laying the foundation for finding the global optimal solution.Next,an integration of levy flight and golden sine strategy is suggested to give dung beetles a greater probability of exploring unvisited areas,escaping from the local optimal solution,and converging more effectively towards a global optimal solution.Finally,an adaptive weight factor is utilized to enhance the search capabilities of the original DBO algorithm and accelerate convergence.With the improvements above,the proposed IDBO algorithm is then applied to traffic identification data analytics and feature selection,as so to find the optimal subset for K-Nearest Neighbor(KNN)classification.The simulation experiments use the CICIDS2017 dataset to verify the effectiveness of the proposed IDBO algorithm and compare it with the original DBO,GWO,WOA,and PSO algorithms.The experimental results show that,compared with other algorithms,the accuracy and recall are improved by 1.53%and 0.88%in binary classification,and the Distributed Denial of Service(DDoS)class identification is the most effective in multi-classification,with an improvement of 5.80%and 0.33%for accuracy and recall,respectively.Therefore,the proposed IDBO algorithm is effective in increasing the efficiency of traffic identification and solving the problem of the original DBO algorithm that converges slowly and falls into the local optimal solution when dealing with high-dimensional data analytics and feature selection for network traffic identification.