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.

Identify information sources with different start times in complex networks based on sparse observers

The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial moments.Although there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains unresolved.In this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start times.The proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread duration.The core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear programming.Extensive experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and efficiency.Furthermore,we find that our method maintains robustness irrespective of the number of sources and the average degree of network.Compared with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.

Impact of environmental factors on the coevolution of information-emotions-epidemic dynamics in activity-driven multiplex networks

During public health emergencies,the diffusion of negative information can exacerbate the transmission of adverse emotions,such as fear and anxiety.These emotions can adversely affect immune function and,consequently,influence the spread of the epidemic.In this study,we established a coupled model incorporating environmental factors to explore the coevolution dynamic process of information-emotions-epidemic dynamics in activity-driven multiplex networks.In this model,environmental factors refer to the external conditions or pressures that affect the spread of information,emotions,and epidemics.These factors include media coverage,public opinion,and the prevalence of diseases in the neighborhood.These layers are dynamically cross-coupled,where the environmental factors in the information layer are influenced by the emotional layer;the higher the levels of anxious states among neighboring individuals,the greater the likelihood of information diffusion.Although environmental factors in the emotional layer are influenced by both the information and epidemic layers,they come from the factors of global information and the proportion of local infections among surrounding neighbors.Subsequently,we utilized the microscopic Markov chain approach to describe the dynamic processes,thereby obtaining the epidemic threshold.Finally,conclusions are drawn through numerical modeling and analysis.The conclusions suggest that when negative information increases,the probability of the transmission of anxious states across the population increases.The transmission of anxious states increases the final size of the disease and decreases its outbreak threshold.Reducing the impact of environmental factors at both the informational and emotional levels is beneficial for controlling the scale of the spread of the epidemic.Our findings can provide a reference for improving public health awareness and behavioral decision-making,mitigating the adverse impacts of anxious states,and ultimately controlling the spread of epidemics.

Research on Fine-Grained Recognition Method for Sensitive Information in Social Networks Based on CLIP

With the emergence and development of social networks,people can stay in touch with friends,family,and colleagues more quickly and conveniently,regardless of their location.This ubiquitous digital internet environment has also led to large-scale disclosure of personal privacy.Due to the complexity and subtlety of sensitive information,traditional sensitive information identification technologies cannot thoroughly address the characteristics of each piece of data,thus weakening the deep connections between text and images.In this context,this paper adopts the CLIP model as a modality discriminator.By using comparative learning between sensitive image descriptions and images,the similarity between the images and the sensitive descriptions is obtained to determine whether the images contain sensitive information.This provides the basis for identifying sensitive information using different modalities.Specifically,if the original data does not contain sensitive information,only single-modality text-sensitive information identification is performed;if the original data contains sensitive information,multimodality sensitive information identification is conducted.This approach allows for differentiated processing of each piece of data,thereby achieving more accurate sensitive information identification.The aforementioned modality discriminator can address the limitations of existing sensitive information identification technologies,making the identification of sensitive information from the original data more appropriate and precise.

Studying the co-evolution of information diffusion,vaccination behavior and disease transmission in multilayer networks with local and global effects

Today,with the rapid development of the internet,a large amount of information often accompanies the rapid transmission of disease outbreaks,and increasing numbers of scholars are studying the relationship between information and the disease transmission process using complex networks.In fact,the disease transmission process is very complex.Besides this information,there will often be individual behavioral measures and other factors to consider.Most of the previous research has aimed to establish a two-layer network model to consider the impact of information on the transmission process of disease,rarely divided into information and behavior,respectively.To carry out a more in-depth analysis of the disease transmission process and the intrinsic influencing mechanism,this paper divides information and behavior into two layers and proposes the establishment of a complex network to study the dynamic co-evolution of information diffusion,vaccination behavior,and disease transmission.This is achieved by considering four influential relationships between adjacent layers in multilayer networks.In the information layer,the diffusion process of negative information is described,and the feedback effects of local and global vaccination are considered.In the behavioral layer,an individual's vaccination behavior is described,and the probability of an individual receiving a vaccination is influenced by two factors:the influence of negative information,and the influence of local and global disease severity.In the disease layer,individual susceptibility is considered to be influenced by vaccination behavior.The state transition equations are derived using the micro Markov chain approach(MMCA),and disease prevalence thresholds are obtained.It is demonstrated through simulation experiments that the negative information diffusion is less influenced by local vaccination behavior,and is mainly influenced by global vaccination behavior;vaccination behavior is mainly influenced by local disease conditions,and is less influenced by global disease conditions;the disease transmission threshold increases with the increasing vaccination rate;and the scale of disease transmission increases with the increasing negative information diffusion rate and decreases with the increasing vaccination rate.Finally,it is found that when individual vaccination behavior considers both the influence of negative information and disease,it can increase the disease transmission threshold and reduce the scale of disease transmission.Therefore,we should resist the diffusion of negative information,increase vaccination proportions,and take appropriate protective measures in time.

Automatic Extraction of Medical Latent Variables from ECG Signals Utilizing a Mutual Information-Based Technique and Capsular Neural Networks for Arrhythmia Detection

From a medical perspective,the 12 leads of the heart in an electrocardiogram(ECG)signal have functional dependencies with each other.Therefore,all these leads report different aspects of an arrhythmia.Their differences lie in the level of highlighting and displaying information about that arrhythmia.For example,although all leads show traces of atrial excitation,this function is more evident in lead II than in any other lead.In this article,a new model was proposed using ECG functional and structural dependencies between heart leads.In the prescreening stage,the ECG signals are segmented from the QRS point so that further analyzes can be performed on these segments in a more detailed manner.The mutual information indices were used to assess the relationship between leads.In order to calculate mutual information,the correlation between the 12 ECG leads has been calculated.The output of this step is a matrix containing all mutual information.Furthermore,to calculate the structural information of ECG signals,a capsule neural network was implemented to aid physicians in the automatic classification of cardiac arrhythmias.The architecture of this capsule neural network has been modified to perform the classification task.In the experimental results section,the proposed model was used to classify arrhythmias in ECG signals from the Chapman dataset.Numerical evaluations showed that this model has a precision of 97.02%,recall of 96.13%,F1-score of 96.57%and accuracy of 97.38%,indicating acceptable performance compared to other state-of-the-art methods.The proposed method shows an average accuracy of 2%superiority over similar works.

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network privacy.Therefore,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called AttNetNRI.Specifically,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept private.Moreover,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social networks.To evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social networks.The experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding parts.The experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

Wireless Information and Power Transfer in Underwater Acoustic Sensor Networks

Wireless information and power transfer(WIPT) enables simultaneously communications and sustainable power supplement without the erection of power supply lines and the replacement operation of the batteries for the terminals. The application of WIPT to the underwater acoustic sensor networks(UWASNs) not only retains the long range communication capabilities, but also provides an auxiliary and convenient energy supplement way for the terminal sensors, and thus is a promising scheme to solve the energy-limited problem for the UWASNs. In this paper, we propose the integration of WIPT into the UWASNs and provide an overview on various enabling techniques for the WIPT based UWASNs(WIPT-UWASNs) as well as pointing out future research challenges and opportunities for WIPT-UWASNs.

Research on Heterogeneous Information Network Link Prediction Based on Representation Learning

A heterogeneous information network,which is composed of various types of nodes and edges,has a complex structure and rich information content,and is widely used in social networks,academic networks,e-commerce,and other fields.Link prediction,as a key task to reveal the unobserved relationships in the network,is of great significance in heterogeneous information networks.This paper reviews the application of presentation-based learning methods in link prediction of heterogeneous information networks.This paper introduces the basic concepts of heterogeneous information networks,and the theoretical basis of representation learning,and discusses the specific application of the deep learning model in node embedding learning and link prediction in detail.The effectiveness and superiority of these methods on multiple real data sets are demonstrated by experimental verification.

Dynamic partition of urban network considering congestion evolution based on random walk

The successful application of perimeter control of urban traffic system strongly depends on the macroscopic fundamental diagram of the targeted region.Despite intensive studies on the partitioning of urban road networks,the dynamic partitioning of urban regions reflecting the propagation of congestion remains an open question.This paper proposes to partition the network into homogeneous sub-regions based on random walk algorithm.Starting from selected random walkers,the road network is partitioned from the early morning when congestion emerges.A modified Akaike information criterion is defined to find the optimal number of partitions.Region boundary adjustment algorithms are adopted to optimize the partitioning results to further ensure the correlation of partitions.The traffic data of Melbourne city are used to verify the effectiveness of the proposed partitioning method.

Research on College Network Information Security Protection in the Digital Economy Era

In the era of the digital economy,the informatization degree of various industries is getting deeper and deeper,and network information security has also come into people’s eyes.Colleges and universities are in the position of training applied talents,because of the needs of teaching and education,as well as the requirements of teaching reform,the information construction of colleges and universities has been gradually improved,but the problem of network information security is also worth causing people to ponder.The low security of the network environment will cause college network information security leaks,and even hackers will attack the official website of the university and leak the personal information of teachers and students.To solve such problems,this paper studies the protection of college network information security against the background of the digital economy era.This paper first analyzes the significance of network information security protection,then points out the current and moral problems,and finally puts forward specific countermeasures,hoping to create a safe learning environment for teachers and students for reference.

Route Temporal⁃Spatial Information Based Residual Neural Networks for Bus Arrival Time Prediction

Bus arrival time prediction contributes to the quality improvement of public transport services.Passengers can arrange departure time effectively if they know the accurate bus arrival time in advance.We proposed a machine⁃learning approach,RTSI⁃ResNet,to forecast the bus arrival time at target stations.The residual neural network framework was employed to model the bus route temporal⁃spatial information.It was found that the bus travel time on a segment between two stations not only had correlation with the preceding buses,but also had common change trends with nearby downstream/upstream segments.Two features about bus travel time and headway were extracted from bus route including target section in both forward and reverse directions to constitute the route temporal⁃spatial information,which reflects the road traffic conditions comprehensively.Experiments on the bus trajectory data of route No.10 in Shenzhen public transport system demonstrated that the proposed RTSI⁃ResNet outperformed other well⁃known methods(e.g.,RNN/LSTM,SVM).Specifically,the advantage was more significant when the distance between bus and the target station was farther.

Multi-Generator Discriminator Network Using Texture-Edge Information

In the proposed paper,a parallel structure type Generative Adversarial Network(GAN)using edge and texture information is proposed.In the existing GAN-based model,many learning iterations had to be given to obtaining an output that was somewhat close to the original data,and noise and distortion occurred in the output image even when learning was performed.To solve this problem,the proposed model consists of two generators and three discriminators to propose a network in the form of a parallel structure.In the network,each edge information and texture information were received as inputs,learning was performed,and each character was combined and outputted through the Combine Discriminator.Through this,edge information and distortion of the output image were improved even with fewer iterations than DCGAN,which is the existing GAN-based model.As a result of learning on the network of the proposed model,a clear image with improved contour and distortion of objects in the image was output from about 50,000 iterations.

The Immense Impact of Reverse Edges on Large Hierarchical Networks

Hierarchical networks are frequently encountered in animal groups,gene networks,and artificial engineering systems such as multiple robots,unmanned vehicle systems,smart grids,wind farm networks,and so forth.The structure of a large directed hierarchical network is often strongly influenced by reverse edges from lower-to higher-level nodes,such as lagging birds’howl in a flock or the opinions of lowerlevel individuals feeding back to higher-level ones in a social group.This study reveals that,for most large-scale real hierarchical networks,the majority of the reverse edges do not affect the synchronization process of the entire network;the synchronization process is influenced only by a small part of these reverse edges along specific paths.More surprisingly,a single effective reverse edge can slow down the synchronization of a huge hierarchical network by over 60%.The effect of such edges depends not on the network size but only on the average in-degree of the involved subnetwork.The overwhelming majority of active reverse edges turn out to have some kind of“bunching”effect on the information flows of hierarchical networks,which slows down synchronization processes.This finding refines the current understanding of the role of reverse edges in many natural,social,and engineering hierarchical networks,which might be beneficial for precisely tuning the synchronization rhythms of these networks.Our study also proposes an effective way to attack a hierarchical network by adding a malicious reverse edge to it and provides some guidance for protecting a network by screening out the specific small proportion of vulnerable nodes.

Subtle role of latency for information diffusion in online social networks

Information diffusion in online social networks is induced by the event of forwarding information for users, and latency exists widely in user spreading behaviors. Little work has been done to reveal the effect of latency on the diffusion process. In this paper, we propose a propagation model in which nodes may suspend their spreading actions for a waiting period of stochastic length. These latent nodes may recover their activity again. Meanwhile, the mechanism of forwarding information is also introduced into the diffusion model. Mean-field analysis and numerical simulations indicate that our model has three nontrivial results. First, the spreading threshold does not correlate with latency in neither homogeneous nor heterogeneous networks, but depends on the spreading and refractory parameter. Furthermore, latency affects the diffusion process and changes the infection scale. A large or small latency parameter leads to a larger final diffusion extent, but the intrinsic dynamics is different. Large latency implies forwarding information rapidly, while small latency prevents nodes from dropping out of interactions. In addition, the betweenness is a better descriptor to identify influential nodes in the model with latency, compared with the coreness and degree. These results are helpful in understanding some collective phenomena of the diffusion process and taking measures to restrain a rumor in social networks.

Social Network Information Propagation Model Based on Individual Behavior

In this paper, we discuss building an information dissemination model based on individual behavior. We analyze the individual behavior related to information dissemination and the factors that affect the sharing behavior of individuals, and we define and quantify these factors. We consider these factors as characteristic attributes and use a Bayesian classifier to classify individuals. Considering the forwarding delay characteristics of information dissemination, we present a random time generation method that simulates the delay of information dissemination. Given time and other constraints, a user might not look at all the information that his/her friends published. Therefore, this paper proposes an algorithm to predict information visibility, i.e., it estimates the probability that an individual will see the information. Based on the classification of individual behavior and combined with our random time generation and information visibility prediction method, we propose an information dissemination model based on individual behavior. The model can be used to predict the scale and speed of information propagation. We use data sets from Sina Weibo to validate and analyze the prediction methods of the individual behavior and information dissemination model based on individual behavior. A previously proposedinformation dissemination model provides the foundation for a subsequent study on the evolution of the network and social network analysis. Predicting the scale and speed of information dissemination can also be used for public opinion monitoring.

Cultivated land information extraction in UAV imagery based on deep convolutional neural network and transfer learning

The development of precision agriculture demands high accuracy and efficiency of cultivated land information extraction. As a new means of monitoring the ground in recent years, unmanned aerial vehicle （UAV） low-height remote sensing technique, which is flexible, efficient with low cost and with high resolution, is widely applied to investing various resources. Based on this, a novel extraction method for cultivated land information based on Deep Convolutional Neural Network and Transfer Learning （DTCLE） was proposed. First, linear features （roads and ridges etc.） were excluded based on Deep Convolutional Neural Network （DCNN）. Next, feature extraction method learned from DCNN was used to cultivated land information extraction by introducing transfer learning mechanism. Last, cultivated land information extraction results were completed by the DTCLE and eCognifion for cultivated land information extraction （ECLE）. The location of the Pengzhou County and Guanghan County, Sichuan Province were selected for the experimental purpose. The experimental results showed that the overall precision for the experimental image 1, 2 and 3 （of extracting cultivated land） with the DTCLE method was 91.7%, 88.1% and 88.2% respectively, and the overall precision of ECLE is 9o.7%, 90.5% and 87.0%, respectively. Accuracy of DTCLE was equivalent to that of ECLE, and also outperformed ECLE in terms of integrity and continuity.

Uncertain information fusion with robust adaptive neural networks-fuzzy reasoning

In practical multi-sensor information fusion systems, there exists uncertainty about the network structure, active state of sensors, and information itself （including fuzziness, randomness, incompleteness as well as roughness, etc）. Hence it requires investigating the problem of uncertain information fusion. Robust learning algorithm which adapts to complex environment and the fuzzy inference algorithm which disposes fuzzy information are explored to solve the problem. Based on the fusion technology of neural networks and fuzzy inference algorithm, a multi-sensor uncertain information fusion system is modeled. Also RANFIS learning algorithm and fusing weight synthesized inference algorithm are developed from the ANFIS algorithm according to the concept of robust neural networks. This fusion system mainly consists of RANFIS confidence estimator, fusing weight synthesized inference knowledge base and weighted fusion section. The simulation result demonstrates that the proposed fusion model and algorithm have the capability of uncertain information fusion, thus is obviously advantageous compared with the conventional Kalman weighted fusion algorithm.

Expert recommendation system based on analyzing expertise and networks of human resources in National Science & Technology Information Service

This work aims to implement expert and collaborative group recommendation services through an analysis of expertise and network relations NTIS. First of all, expertise database has been constructed by extracting keywords after indexing national R＆D information in Korea （human resources, project and outcome） and applying expertise calculation algorithm. In consideration of the characteristics of national R＆D information, weight values have been selected. Then, expertise points were calculated by applying weighted values. In addition, joint research and collaborative relations were implemented in a knowledge map format through network analysis using national R＆D information.

Distributed Information Flow Verification for Secure Service Composition in Smart Sensor Network

Accelerate processor, efficient software and pervasive connections provide sensor nodes with more powerful computation and storage ability, which can offer various services to user. Based on these atomic services, different sensor nodes can cooperate and compose with each other to complete more complicated tasks for user. However, because of the regional characteristic of sensor nodes, merging data with different sensitivities become a primary requirement to the composite services, and information flow security should be intensively considered during service composition. In order to mitigate the great cost caused by the complexity of modeling and the heavy load of single-node verification to the energy-limited sensor node, in this paper, we propose a new distributed verification framework to enforce information flow security on composite services of smart sensor network. We analyze the information flows in composite services and specify security constraints for each service participant. Then we propose an algorithm over the distributed verification framework involving each sensor node to participate in the composite service verification based on the security constraints. The experimental results indicate that our approach can reduce the cost of verification and provide a better load balance.