Cyber Resilience through Real-Time Threat Analysis in Information Security

This paper examines how cybersecurity is developing and how it relates to more conventional information security. Although information security and cyber security are sometimes used synonymously, this study contends that they are not the same. The concept of cyber security is explored, which goes beyond protecting information resources to include a wider variety of assets, including people [1]. Protecting information assets is the main goal of traditional information security, with consideration to the human element and how people fit into the security process. On the other hand, cyber security adds a new level of complexity, as people might unintentionally contribute to or become targets of cyberattacks. This aspect presents moral questions since it is becoming more widely accepted that society has a duty to protect weaker members of society, including children [1]. The study emphasizes how important cyber security is on a larger scale, with many countries creating plans and laws to counteract cyberattacks. Nevertheless, a lot of these sources frequently neglect to define the differences or the relationship between information security and cyber security [1]. The paper focus on differentiating between cybersecurity and information security on a larger scale. The study also highlights other areas of cybersecurity which includes defending people, social norms, and vital infrastructure from threats that arise from online in addition to information and technology protection. It contends that ethical issues and the human factor are becoming more and more important in protecting assets in the digital age, and that cyber security is a paradigm shift in this regard [1].

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.

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.

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.

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.

Modeling and Statistical Properties Research on Online Real-Time Information Transmission Network

In this paper, the model of the online real-time information transmission network, such as wechat, micro-blog, and QQ network, is proposed and built, based on the connection properties between users of the online real-time information transmission network, and combined with the local world evolving characteristics in complex network, then the statistical topological properties of the network is obtained by numerical simulation. Furthermore, we simulated the process of information transmission on the network, according to the actual characteristics of the online real-time information transmission. Statistics show that the degree distribution presents the characteristics of scale free network, presenting power law distribution, while the average path length, the average clustering coefficient and the average size of the network also has a power-law relationship, moreover, the model parameters has no effect on power-law exponent. The spread of information on the network represents obvious fluctuation scaling, reflecting the characteristics that information transmission fluctuates over time.

Study on control information network and its real-time property

The control network is an important developmental orientation in the remote control system. As the control network and information network are comparatively alike in the framework and technology, we can build a control network which is similar to the common information network. In the era when the information network is becoming increasingly mature, it is a royal road to construct or rebuild a control information network in the development of the control network by relying on the achievements made in the information network or current information resources. This paper expounds the construction idea of the control information network, gives the idiographic realization method and then researches into the real-time problem encountered in the control information network, and presents a three-closed-loop control system based on virtualized reality. The feasibility of the idea is validated via experiments and simulations separately.

Effects of real-time traffic information systems on traffic performance under different network structures

The effects of real-time traffic information system (RTTIS) on traffic performance under parallel, grid and ring networks were investigated. The simulation results show that the effects of the proportion of RTTIS usage depend on the road network structures. For traffic on a parallel network, the performance of groups with and without RTTIS level is improved when the proportion of vehicles using RTTIS is greater than 0 and less than 30%, and a proportion of RTTIS usage higher than 90% would actually deteriorate the performance. For both grid and ring networks, a higher proportion of RTTIS usage always improves the performance of groups with and without RTTIS. For all three network structures, vehicles without RTTIS benefit from some proportion of RTTIS usage in a system.

DuFNet:Dual Flow Network of Real-Time Semantic Segmentation for Unmanned Driving Application of Internet of Things

The application of unmanned driving in the Internet of Things is one of the concrete manifestations of the application of artificial intelligence technology.Image semantic segmentation can help the unmanned driving system by achieving road accessibility analysis.Semantic segmentation is also a challenging technology for image understanding and scene parsing.We focused on the challenging task of real-time semantic segmentation in this paper.In this paper,we proposed a novel fast architecture for real-time semantic segmentation named DuFNet.Starting from the existing work of Bilateral Segmentation Network(BiSeNet),DuFNet proposes a novel Semantic Information Flow(SIF)structure for context information and a novel Fringe Information Flow(FIF)structure for spatial information.We also proposed two kinds of SIF with cascaded and paralleled structures,respectively.The SIF encodes the input stage by stage in the ResNet18 backbone and provides context information for the feature fusionmodule.Features from previous stages usually contain rich low-level details but high-level semantics for later stages.Themultiple convolutions embed in Parallel SIF aggregate the corresponding features among different stages and generate a powerful global context representation with less computational cost.The FIF consists of a pooling layer and an upsampling operator followed by projection convolution layer.The concise component provides more spatial details for the network.Compared with BiSeNet,our work achieved faster speed and comparable performance with 72.34%mIoU accuracy and 78 FPS on Cityscapes Dataset based on the ResNet18 backbone.

Essential proteins identification method based on four-order distances and subcellular localization information

Essential proteins are inseparable in cell growth and survival. The study of essential proteins is important for understanding cellular functions and biological mechanisms. Therefore, various computable methods have been proposed to identify essential proteins. Unfortunately, most methods based on network topology only consider the interactions between a protein and its neighboring proteins, and not the interactions with its higher-order distance proteins. In this paper, we propose the DSEP algorithm in which we integrated network topology properties and subcellular localization information in protein–protein interaction(PPI) networks based on four-order distances, and then used random walks to identify the essential proteins. We also propose a method to calculate the finite-order distance of the network, which can greatly reduce the time complexity of our algorithm. We conducted a comprehensive comparison of the DSEP algorithm with 11 existing classical algorithms to identify essential proteins with multiple evaluation methods. The results show that DSEP is superior to these 11 methods.

Bolzano Traffic: An Example of Open ITS Deployment for Advanced Traveller Information Services

This paper aims to present the experience gathered in the Italian alpine city of Bolzano within the project“Bolzano Traffic”whose goal is the introduction of an experimental open ITS platform for local service providers,fostering the diffusion of advanced traveller information services and the future deployment of cooperative mobility systems in the region.Several end-users applications targeted to the needs of different user groups have been developed in collaboration with local companies and research centers;a partnership with the EU Co-Cities project has been activated as well.The implemented services rely on real-time travel and traffic information collected by urban traffic monitoring systems or published by local stakeholders(e.g.public transportation operators).An active involvement of end-users,who have recently started testing these demo applications for free,is actually on-going.

A CNN-Based Single-Stage Occlusion Real-Time Target Detection Method

Aiming at the problem of low accuracy of traditional target detection methods for target detection in endoscopes in substation environments, a CNN-based real-time detection method for masked targets is proposed. The method adopts the overall design of backbone network, detection network and algorithmic parameter optimisation method, completes the model training on the self-constructed occlusion target dataset, and adopts the multi-scale perception method for target detection. The HNM algorithm is used to screen positive and negative samples during the training process, and the NMS algorithm is used to post-process the prediction results during the detection process to improve the detection efficiency. After experimental validation, the obtained model has the multi-class average predicted value (mAP) of the dataset. It has general advantages over traditional target detection methods. The detection time of a single target on FDDB dataset is 39 ms, which can meet the need of real-time target detection. In addition, the project team has successfully deployed the method into substations and put it into use in many places in Beijing, which is important for achieving the anomaly of occlusion target detection.

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.

Research on Network Cognition Model and Mechanism of Intelligent Information Network

Intellectualization has been an inevitable trend in the information network,allowing the network to achieve the capabilities of self-learning,self-optimization,and self-evolution in the dynamic environment.Due to the strong adaptability to the environment,the cognitive theory methods from psychology gradually become an excellent approach to construct the intelligent information network(IIN),making the traditional definition of the intelligent information network no longer appropriate.Moreover,the thinking capability of existing IINs is always limited.This paper redefines the intelligent information network and illustrates the required properties of the architecture,core theory,and critical technologies by analyzing the existing intelligent information network.Besides,we innovatively propose a novel network cognition model with the network knowledge to implement the intelligent information network.The proposed model can perceive the overall environment data of the network and extract the knowledge from the data.As the model’s core,the knowledge guides the model to generate the optimal decisions adapting to the environmental changes.At last,we present the critical technologies needed to accomplish the proposed network cognition model.

Multiplex network infomax:Multiplex network embedding via information fusion

For networking of big data applications,an essential issue is how to represent networks in vector space for further mining and analysis tasks,e.g.,node classification,clustering,link prediction,and visualization.Most existing studies on this subject mainly concentrate on monoplex networks considering a single type of relation among nodes.However,numerous real-world networks are naturally composed of multiple layers with different relation types;such a network is called a multiplex network.The majority of existing multiplex network embedding methods either overlook node attributes,resort to node labels for training,or underutilize underlying information shared across multiple layers.In this paper,we propose Multiplex Network Infomax(MNI),an unsupervised embedding framework to represent information of multiple layers into a unified embedding space.To be more specific,we aim to maximize the mutual information between the unified embedding and node embeddings of each layer.On the basis of this framework,we present an unsupervised network embedding method for attributed multiplex networks.Experimental results show that our method achieves competitive performance on not only node-related tasks,such as node classification,clustering,and similarity search,but also a typical edge-related task,i.e.,link prediction,at times even outperforming relevant supervised methods,despite that MNI is fully unsupervised.

Intervention against information diffusion in static and temporal coupling networks

Information diffusion in complex networks has become quite an active research topic.As an important part of this field,intervention against information diffusion processes is attracting ever-increasing attention from network and control engineers.In particular,it is urgent to design intervention schemes for the coevolutionary dynamics between information diffusion processes and coupled networks.For this purpose,we comprehensively study the problem of information diffusion intervention over static and temporal coupling networks.First,individual interactions are described by a modified activitydriven network(ADN)model.Then,we establish a novel node-based susceptible-infected-recovered-susceptible(SIRS)model to characterize the information diffusion dynamics.On these bases,three synergetic intervention strategies are formulated.Second,we derive the critical threshold of the controlled-SIRS system via stability analysis.Accordingly,we exploit a spectral optimization scheme to minimize the outbreak risk or the required budget.Third,we develop an optimal control scheme of dynamically allocating resources to minimize both system loss and intervention expense,in which the optimal intervention inputs are obtained through optimal control theory and a forward-backward sweep algorithm.Finally,extensive simulation results validate the accuracy of theoretical derivation and the performance of our proposed intervention schemes.

Real-Time Prediction Algorithm for Intelligent Edge Networks with Federated Learning-Based Modeling

Intelligent healthcare networks represent a significant component in digital applications,where the requirements hold within quality-of-service(QoS)reliability and safeguarding privacy.This paper addresses these requirements through the integration of enabler paradigms,including federated learning(FL),cloud/edge computing,softwaredefined/virtualized networking infrastructure,and converged prediction algorithms.The study focuses on achieving reliability and efficiency in real-time prediction models,which depend on the interaction flows and network topology.In response to these challenges,we introduce a modified version of federated logistic regression(FLR)that takes into account convergence latencies and the accuracy of the final FL model within healthcare networks.To establish the FLR framework for mission-critical healthcare applications,we provide a comprehensive workflow in this paper,introducing framework setup,iterative round communications,and model evaluation/deployment.Our optimization process delves into the formulation of loss functions and gradients within the domain of federated optimization,which concludes with the generation of service experience batches for model deployment.To assess the practicality of our approach,we conducted experiments using a hypertension prediction model with data sourced from the 2019 annual dataset(Version 2.0.1)of the Korea Medical Panel Survey.Performance metrics,including end-to-end execution delays,model drop/delivery ratios,and final model accuracies,are captured and compared between the proposed FLR framework and other baseline schemes.Our study offers an FLR framework setup for the enhancement of real-time prediction modeling within intelligent healthcare networks,addressing the critical demands of QoS reliability and privacy preservation.

Information Freshness-Oriented Trajectory Planning and Resource Allocation for UAV-Assisted Vehicular Networks

In this paper,multi-UAV trajectory planning and resource allocation are jointly investigated to improve the information freshness for vehicular networks,where the vehicles collect time-critical traffic information by on-board sensors and upload to the UAVs through their allocated spectrum resource.We adopt the expected sum age of information(ESAoI)to measure the network-wide information freshness.ESAoI is jointly affected by both the UAVs trajectory and the resource allocation,which are coupled with each other and make the analysis of ESAoI challenging.To tackle this challenge,we introduce a joint trajectory planning and resource allocation procedure,where the UAVs firstly fly to their destinations and then hover to allocate resource blocks(RBs)during a time-slot.Based on this procedure,we formulate a trajectory planning and resource allocation problem for ESAoI minimization.To solve the mixed integer nonlinear programming(MINLP)problem with hybrid decision variables,we propose a TD3 trajectory planning and Round-robin resource allocation(TTPRRA).Specifically,we exploit the exploration and learning ability of the twin delayed deep deterministic policy gradient algorithm(TD3)for UAVs trajectory planning,and utilize Round Robin rule for the optimal resource allocation.With TTP-RRA,the UAVs obtain their flight velocities by sensing the locations and the age of information(AoI)of the vehicles,then allocate the RBs to the vehicles in a descending order of AoI until the remaining RBs are not sufficient to support another successful uploading.Simulation results demonstrate that TTP-RRA outperforms the baseline approaches in terms of ESAoI and average AoI(AAoI).

CoLM^(2)S:Contrastive self‐supervised learning on attributed multiplex graph network with multi‐scale information

Contrastive self‐supervised representation learning on attributed graph networks with Graph Neural Networks has attracted considerable research interest recently.However,there are still two challenges.First,most of the real‐word system are multiple relations,where entities are linked by different types of relations,and each relation is a view of the graph network.Second,the rich multi‐scale information(structure‐level and feature‐level)of the graph network can be seen as self‐supervised signals,which are not fully exploited.A novel contrastive self‐supervised representation learning framework on attributed multiplex graph networks with multi‐scale(named CoLM^(2)S)information is presented in this study.It mainly contains two components:intra‐relation contrast learning and interrelation contrastive learning.Specifically,the contrastive self‐supervised representation learning framework on attributed single‐layer graph networks with multi‐scale information(CoLMS)framework with the graph convolutional network as encoder to capture the intra‐relation information with multi‐scale structure‐level and feature‐level selfsupervised signals is introduced first.The structure‐level information includes the edge structure and sub‐graph structure,and the feature‐level information represents the output of different graph convolutional layer.Second,according to the consensus assumption among inter‐relations,the CoLM^(2)S framework is proposed to jointly learn various graph relations in attributed multiplex graph network to achieve global consensus node embedding.The proposed method can fully distil the graph information.Extensive experiments on unsupervised node clustering and graph visualisation tasks demonstrate the effectiveness of our methods,and it outperforms existing competitive baselines.

Application of graph neural network and feature information enhancement in relation inference of sparse knowledge graph

At present,knowledge embedding methods are widely used in the field of knowledge graph(KG)reasoning,and have been successfully applied to those with large entities and relationships.However,in research and production environments,there are a large number of KGs with a small number of entities and relations,which are called sparse KGs.Limited by the performance of knowledge extraction methods or some other reasons(some common-sense information does not appear in the natural corpus),the relation between entities is often incomplete.To solve this problem,a method of the graph neural network and information enhancement is proposed.The improved method increases the mean reciprocal rank(MRR)and Hit@3 by 1.6%and 1.7%,respectively,when the sparsity of the FB15K-237 dataset is 10%.When the sparsity is 50%,the evaluation indexes MRR and Hit@10 are increased by 0.8%and 1.8%,respectively.