Inversion of Oceanic Parameters Represented by CTD Utilizing Seismic Multi-Attributes Based on Convolutional Neural Network

In Recent years,seismic data have been widely used in seismic oceanography for the inversion of oceanic parameters represented by conductivity temperature depth(CTD).Using this technique,researchers can identify the water structure with high horizontal resolution,which compensates for the deficiencies of CTD data.However,conventional inversion methods are modeldriven,such as constrained sparse spike inversion(CSSI)and full waveform inversion(FWI),and typically require prior deterministic mapping operators.In this paper,we propose a novel inversion method based on a convolutional neural network(CNN),which is purely data-driven.To solve the problem of multiple solutions,we use stepwise regression to select the optimal attributes and their combination and take two-dimensional images of the selected attributes as input data.To prevent vanishing gradients,we use the rectified linear unit(ReLU)function as the activation function of the hidden layer.Moreover,the Adam and mini-batch algorithms are combined to improve stability and efficiency.The inversion results of field data indicate that the proposed method is a robust tool for accurately predicting oceanic parameters.

Selecting proper sites for underground dam construction using Multi-Attribute Utility Theory in arid and semi-arid regions

Although the construction of underground dams is one of the best methods to conserve water resources in arid and semi-arid regions,applying efficient methods for the selection of suitable sites for subsurface dam construction remains a challenge.Due to the costly and time-consuming methods of site selection for underground dam construction,this study aimed to present a new method using geographic information systems techniques and decision-making processes.The exclusionary criteria including fault,slope,hypsometry,land use,soil,stream,geology,and chemical properties of groundwater were selected for site selection of dam construction and inappropriate regions were omitted by integration and scoring layers in ArcGIS based on the Boolean logic.Finally,appropriate sites were prioritized using the Multi-Attribute Utility Theory.According to the results of the utility coefficient,seven sites were selected as the region for underground dam construction based on all criteria and experts’opinions.The site of Nazarabad dam was the best location for underground dam construction with a utility coefficient of 0.7137 followed by sites of Akhavan with a utility coefficient of 0.4633 and Mirshamsi with a utility coefficient of 0.4083.This study proposed a new approach for the construction of the subsurface dam at the proper site and help managers and decision-makers achieve sustainable water resources with limited facilities and capital and avoid wasting national capital.

Fermatean Hesitant Fuzzy Prioritized Heronian Mean Operator and Its Application in Multi-Attribute Decision Making

In real life,incomplete information,inaccurate data,and the preferences of decision-makers during qualitative judgment would impact the process of decision-making.As a technical instrument that can successfully handle uncertain information,Fermatean fuzzy sets have recently been used to solve the multi-attribute decision-making(MADM)problems.This paper proposes a Fermatean hesitant fuzzy information aggregation method to address the problem of fusion where the membership,non-membership,and priority are considered simultaneously.Combining the Fermatean hesitant fuzzy sets with Heronian Mean operators,this paper proposes the Fermatean hesitant fuzzy Heronian mean(FHFHM)operator and the Fermatean hesitant fuzzyweighted Heronian mean(FHFWHM)operator.Then,considering the priority relationship between attributes is often easier to obtain than the weight of attributes,this paper defines a new Fermatean hesitant fuzzy prioritized Heronian mean operator(FHFPHM),and discusses its elegant properties such as idempotency,boundedness and monotonicity in detail.Later,for problems with unknown weights and the Fermatean hesitant fuzzy information,aMADM approach based on prioritized attributes is proposed,which can effectively depict the correlation between attributes and avoid the influence of subjective factors on the results.Finally,a numerical example of multi-sensor electronic surveillance is applied to verify the feasibility and validity of the method proposed in this paper.

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.

A Multi-Attribute Decision-Making Method Using Belief-Based Probabilistic Linguistic Term Sets and Its Application in Emergency Decision-Making

Probabilistic linguistic term sets(PLTSs)are an effective tool for expressing subjective human cognition that offer advantages in the field ofmulti-attribute decision-making(MADM).However,studies have found that PLTSs have lost their ability to accurately capture the views of decision-makers(DMs)in certain circumstances,such as when the DM hesitates between multiple linguistic terms or the decision information is incomplete,thus affecting their role in the decision-making process.Belief function theory is a leading streamof thought in uncertainty processing that is suitable for dealing with the limitations of PLTS.Therefore,the purpose of this study is to extend PLTS to incorporate belief function theory.First,we provide the basic concepts of the extended PLTS(i.e.,belief-based PLTS)through case analyses.Second,the aggregation operator of belief-based PLTS is defined with the ordered weighted average(OWA)-based soft likelihood function,which is improved by considering the reliability of the information source.Third,to measure the magnitude of different belief-based PLTSs,the belief interval of singleton is calculated,and the comparison method of belief-based PLTS is constructed based on probabilities.On the basis of the preceding discussion,we further develop an emergency decision framework that includes several novel techniques,such as attribute weight determination and decision information aggregation.Finally,the usefulness of the framework is demonstrated through a case study,and its effectiveness is illustrated through a series of comparisons.

Insights into microbiota community dynamics and flavor development mechanism during golden pomfret(Trachinotus ovatus)fermentation based on single-molecule real-time sequencing and molecular networking analysis

Popular fermented golden pomfret(Trachinotus ovatus)is prepared via spontaneous fermentation;however,the mechanisms underlying the regulation of its flavor development remain unclear.This study shows the roles of the complex microbiota and the dynamic changes in microbial community and flavor compounds during fish fermentation.Single-molecule real-time sequencing and molecular networking analysis revealed the correlations among different microbial genera and the relationships between microbial taxa and volatile compounds.Mechanisms underlying flavor development were also elucidated via KEGG based functional annotations.Clostridium,Shewanella,and Staphylococcus were the dominant microbial genera.Forty-nine volatile compounds were detected in the fermented fish samples,with thirteen identified as characteristic volatile compounds(ROAV>1).Volatile profiles resulted from the interactions among the microorganisms and derived enzymes,with the main metabolic pathways being amino acid biosynthesis/metabolism,carbon metabolism,and glycolysis/gluconeogenesis.This study demonstrated the approaches for distinguishing key microbiota associated with volatile compounds and monitoring the industrial production of high-quality fermented fish products.

Two-Sided Matching Decision Making with Multi-Attribute Probabilistic Hesitant Fuzzy Sets

In previous research on two-sided matching(TSM)decision,agents’preferences were often given in the form of exact values of ordinal numbers and linguistic phrase term sets.Nowdays,the matching agent cannot perform the exact evaluation in the TSM situations due to the great fuzziness of human thought and the complexity of reality.Probability hesitant fuzzy sets,however,have grown in popularity due to their advantages in communicating complex information.Therefore,this paper develops a TSM decision-making approach with multi-attribute probability hesitant fuzzy sets and unknown attribute weight information.The agent attribute weight vector should be obtained by using the maximum deviation method and Hamming distance.The probabilistic hesitancy fuzzy information matrix of each agent is then arranged to determine the comprehensive evaluation of two matching agent sets.The agent satisfaction degree is calculated using the technique for order preference by similarity to ideal solution(TOPSIS).Additionally,the multi-object programming technique is used to establish a TSM method with the objective of maximizing the agent satisfaction of two-sided agents,and the matching schemes are then established by solving the built model.The study concludes by providing a real-world supply-demand scenario to illustrate the effectiveness of the proposed method.The proposed method is more flexible than prior research since it expresses evaluation information using probability hesitating fuzzy sets and can be used in scenarios when attribute weight information is unclear.

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.

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.

Source localization in signed networks with effective distance

While progress has been made in information source localization,it has overlooked the prevalent friend and adversarial relationships in social networks.This paper addresses this gap by focusing on source localization in signed network models.Leveraging the topological characteristics of signed networks and transforming the propagation probability into effective distance,we propose an optimization method for observer selection.Additionally,by using the reverse propagation algorithm we present a method for information source localization in signed networks.Extensive experimental results demonstrate that a higher proportion of positive edges within signed networks contributes to more favorable source localization,and the higher the ratio of propagation rates between positive and negative edges,the more accurate the source localization becomes.Interestingly,this aligns with our observation that,in reality,the number of friends tends to be greater than the number of adversaries,and the likelihood of information propagation among friends is often higher than among adversaries.In addition,the source located at the periphery of the network is not easy to identify.Furthermore,our proposed observer selection method based on effective distance achieves higher operational efficiency and exhibits higher accuracy in information source localization,compared with three strategies for observer selection based on the classical full-order neighbor coverage.

Impact of different interaction behavior on epidemic spreading in time-dependent social networks

We investigate the impact of pairwise and group interactions on the spread of epidemics through an activity-driven model based on time-dependent networks.The effects of pairwise/group interaction proportion and pairwise/group interaction intensity are explored by extensive simulation and theoretical analysis.It is demonstrated that altering the group interaction proportion can either hinder or enhance the spread of epidemics,depending on the relative social intensity of group and pairwise interactions.As the group interaction proportion decreases,the impact of reducing group social intensity diminishes.The ratio of group and pairwise social intensity can affect the effect of group interaction proportion on the scale of infection.A weak heterogeneous activity distribution can raise the epidemic threshold,and reduce the scale of infection.These results benefit the design of epidemic control strategy.

Reliability Assessment of a New General Matching Composed Network

The reliability of a network is an important indicator for maintaining communication and ensuring its stable operation. Therefore, the assessment of reliability in underlying interconnection networks has become an increasingly important research issue. However, at present, the reliability assessment of many interconnected networks is not yet accurate,which inevitably weakens their fault tolerance and diagnostic capabilities. To improve network reliability,researchers have proposed various methods and strategies for precise assessment. This paper introduces a novel family of interconnection networks called general matching composed networks(gMCNs), which is based on the common characteristics of network topology structure. After analyzing the topological properties of gMCNs, we establish a relationship between super connectivity and conditional diagnosability of gMCNs. Furthermore, we assess the reliability of g MCNs, and determine the conditional diagnosability of many interconnection networks.

Innovation and Firm Co-ownership Network in China’s Electric Vehicle Industry

Firms are embedded in complex networks,where diverse ideas combine and generate new ideas.Shareholders of firms are of-ten seen as critical external resources that have significant influence on firm innovation.The current literature tends to focus on the rela-tionship between firms and their shareholders,while paying less attention to the connections between firms with the same shareholders.This article identifies two types of network spillover effects,intra-city network effect and inter-city network effect,by visualizing the co-ownership networks in China’s electric vehicle(EV)industry.We find that firms with the same shareholders,which are defined as co-owned EV firms,are more innovative than non-co-owned ones.Furthermore,there are two dominant types of firm co-ownership ties formed by corporate and financial institution shareholders.While corporate shareholders help exploiting local tacit knowledge,financial institutions are more active in bridging inter-city connections.The conclusion is confirmed at both firm and city levels.This paper theor-izes the firm co-ownership network as a new form of institutional proximity and tested the result empirically.For policy consideration,we have emphasized the importance of building formal or informal inter-firm network,and the government should further enhance the knowledge flow channel by institutional construction.

Migration Networks Pattern of China’s Floating Population from the Perspective of Complex Network

Since China’s reform and opening-up,the growing disparity between urban and rural areas and regions has led to massive migration.With China’s Rural Revitalization Strategy and the industrial transfer from the eastern coastal areas to the inland,the migration direction and pattern of the floating population have undergone certain changes.Using the 2017 China Migrants Dynamic Survey(CMDS),excluding Hong Kong,Macao,and Taiwan regions of China,organized by China’s National Health Commission,the relationship matrix of the floating population is constructed according to the inflow place of the interviewees and their outflow place(the location of the registered residence)in the questionnaire survey.We then apply the complex network model to analyze the migration direction and network pattern of China’s floating population from the city scale.The migration network shows an obvious hierarchical agglomeration.The first-,second-,third-and fourth-tier distribution cities are municipalities directly under the central government,provincial capital cities,major cities in the central and western regions and ordinary cities in all provinces,respectively.The migration trend is from the central and western regions to the eastern coastal areas.The migration network has‘small world’characteristics,forming nine communities.It shows that most node cities in the same community are closely linked and geographically close,indicating that the migration network of floating population is still affected by geographical proximity.Narrowing the urban-rural and regional differences will promote the rational distribution this population.It is necessary to strengthen the reform of the registered residence system,so that the floating population can enjoy urban public services comparable to other populations,and allow migrants to live and work in peace.

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.

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.

Binary Program Vulnerability Mining Based on Neural Network

Software security analysts typically only have access to the executable program and cannot directly access the source code of the program.This poses significant challenges to security analysis.While it is crucial to identify vulnerabilities in such non-source code programs,there exists a limited set of generalized tools due to the low versatility of current vulnerability mining methods.However,these tools suffer from some shortcomings.In terms of targeted fuzzing,the path searching for target points is not streamlined enough,and the completely random testing leads to an excessively large search space.Additionally,when it comes to code similarity analysis,there are issues with incomplete code feature extraction,which may result in information loss.In this paper,we propose a cross-platform and cross-architecture approach to exploit vulnerabilities using neural network obfuscation techniques.By leveraging the Angr framework,a deobfuscation technique is introduced,along with the adoption of a VEX-IR-based intermediate language conversion method.This combination allows for the unified handling of binary programs across various architectures,compilers,and compilation options.Subsequently,binary programs are processed to extract multi-level spatial features using a combination of a skip-gram model with self-attention mechanism and a bidirectional Long Short-Term Memory(LSTM)network.Finally,the graph embedding network is utilized to evaluate the similarity of program functionalities.Based on these similarity scores,a target function is determined,and symbolic execution is applied to solve the target function.The solved content serves as the initial seed for targeted fuzzing.The binary program is processed by using the de-obfuscation technique and intermediate language transformation method,and then the similarity of program functions is evaluated by using a graph embedding network,and symbolic execution is performed based on these similarity scores.This approach facilitates cross-architecture analysis of executable programs without their source codes and concurrently reduces the risk of symbolic execution path explosion.

Deep Learning Social Network Access Control Model Based on User Preferences

A deep learning access controlmodel based on user preferences is proposed to address the issue of personal privacy leakage in social networks.Firstly,socialusers andsocialdata entities are extractedfromthe social networkandused to construct homogeneous and heterogeneous graphs.Secondly,a graph neural networkmodel is designed based on user daily social behavior and daily social data to simulate the dissemination and changes of user social preferences and user personal preferences in the social network.Then,high-order neighbor nodes,hidden neighbor nodes,displayed neighbor nodes,and social data nodes are used to update user nodes to expand the depth and breadth of user preferences.Finally,a multi-layer attention network is used to classify user nodes in the homogeneous graph into two classes:allow access and deny access.The fine-grained access control problem in social networks is transformed into a node classification problem in a graph neural network.The model is validated using a dataset and compared with other methods without losing generality.The model improved accuracy by 2.18%compared to the baseline method GraphSAGE,and improved F1 score by 1.45%compared to the baseline method,verifying the effectiveness of the model.

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.

Multi-Level Parallel Network for Brain Tumor Segmentation

Accurate automatic segmentation of gliomas in various sub-regions,including peritumoral edema,necrotic core,and enhancing and non-enhancing tumor core from 3D multimodal MRI images,is challenging because of its highly heterogeneous appearance and shape.Deep convolution neural networks(CNNs)have recently improved glioma segmentation performance.However,extensive down-sampling such as pooling or stridden convolution in CNNs significantly decreases the initial image resolution,resulting in the loss of accurate spatial and object parts information,especially information on the small sub-region tumors,affecting segmentation performance.Hence,this paper proposes a novel multi-level parallel network comprising three different level parallel subnetworks to fully use low-level,mid-level,and high-level information and improve the performance of brain tumor segmentation.We also introduce the Combo loss function to address input class imbalance and false positives and negatives imbalance in deep learning.The proposed method is trained and validated on the BraTS 2020 training and validation dataset.On the validation dataset,ourmethod achieved a mean Dice score of 0.907,0.830,and 0.787 for the whole tumor,tumor core,and enhancing tumor core,respectively.Compared with state-of-the-art methods,the multi-level parallel network has achieved competitive results on the validation dataset.