Dynamic Offloading and Scheduling Strategy for Telematics Tasks Based on Latency Minimization

In current research on task offloading and resource scheduling in vehicular networks,vehicles are commonly assumed to maintain constant speed or relatively stationary states,and the impact of speed variations on task offloading is often overlooked.It is frequently assumed that vehicles can be accurately modeled during actual motion processes.However,in vehicular dynamic environments,both the tasks generated by the vehicles and the vehicles’surroundings are constantly changing,making it difficult to achieve real-time modeling for actual dynamic vehicular network scenarios.Taking into account the actual dynamic vehicular scenarios,this paper considers the real-time non-uniform movement of vehicles and proposes a vehicular task dynamic offloading and scheduling algorithm for single-task multi-vehicle vehicular network scenarios,attempting to solve the dynamic decision-making problem in task offloading process.The optimization objective is to minimize the average task completion time,which is formulated as a multi-constrained non-linear programming problem.Due to the mobility of vehicles,a constraint model is applied in the decision-making process to dynamically determine whether the communication range is sufficient for task offloading and transmission.Finally,the proposed vehicular task dynamic offloading and scheduling algorithm based on muti-agent deep deterministic policy gradient(MADDPG)is applied to solve the optimal solution of the optimization problem.Simulation results show that the algorithm proposed in this paper is able to achieve lower latency task computation offloading.Meanwhile,the average task completion time of the proposed algorithm in this paper can be improved by 7.6%compared to the performance of the MADDPG scheme and 51.1%compared to the performance of deep deterministic policy gradient(DDPG).

Vertex centrality of complex networks based on joint nonnegative matrix factorization and graph embedding

Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.

Reliability Analysis of Correlated Competitive and Dependent Components Considering Random Isolation Times

In the Internet of Things(IoT)system,relay communication is widely used to solve the problem of energy loss in long-distance transmission and improve transmission efficiency.In Body Sensor Network(BSN)systems,biosensors communicate with receiving devices through relay nodes to improve their limited energy efficiency.When the relay node fails,the biosensor can communicate directly with the receiving device by releasing more transmitting power.However,if the remaining battery power of the biosensor is insufficient to enable it to communicate directly with the receiving device,the biosensor will be isolated by the system.Therefore,a new combinatorial analysis method is proposed to analyze the influence of random isolation time(RIT)on system reliability,and the competition relationship between biosensor isolation and propagation failure is considered.This approach inherits the advantages of common combinatorial algorithms and provides a new approach to effectively address the impact of RIT on system reliability in IoT systems,which are affected by competing failures.Finally,the method is applied to the BSN system,and the effect of RIT on the system reliability is analyzed in detail.

Degree distribution and robustness of cooperative communication network with scale-free model

With the requirements of users enhanced for wireless communication, the cooperative communication will become a development trend in future. In this paper, a model based on complex networks with both preferential attachment is researched to solve an actual network CCN （Cooperative Communication Network）. Firstly, the evolution of CCN is given by four steps with different probabilities. At the same time, the rate equations of nodes degree are presented to analyze the evolution of CCN. Secondly, the degree distribution is analyzed by calculating the rate equation and numerical simulation. Finally, the robustness of CCN is studied by numerical simulation with random attack and intentional attack to analyze the effects of degree distribution and average path length. The results of this paper are more significant for building CCN to programme the resource of communication.

Real-Time 4-Mode MDM Transmission Using Commercial 400G OTN Transceivers and All-Fiber Mode Multiplexers

Weakly-coupled mode division multiplexing(MDM)technique is considered a promising candidate to enhance the capacity of an optical transmission system,in which mode multiplexers/demultiplexers(MMUX/MDEMUX)with low insertion loss and modal crosstalk are the key components.In this paper,a low-modal-crosstalk 4-mode MMUX/MDEMUX for the weakly-coupled triple-ring-core few-mode fiber(TRC-FMF)is designed and fabricated with side-polishing processing.The measurement results show that a pair of MMUX/MDEMUX and 25 km weakly-coupled TRC-FMF MDM link achieve low modal crosstalk of lower than−17.5 dB and insertion loss of lower than 11.56 dB for all the four modes.Based on the TRC-FMF and all-fiber MMUX/MDEMUX,an experiment for 25 km real-time 4-mode 3-λwavelength division multiplexing(WDM)-MDM transmission is conducted using commercial 400G optical transport network(OTN)transceivers.The experimental results prove weakly-coupled MDM techniques facilitate a smooth upgrade of the optical transmission system.

Effects of individual heterogeneity on social contagions

Despite having significant effects on social contagions,individual heterogeneity has frequently been overlooked in earlier studies.To better understand the complexity of social contagions,a non-Markovian model incorporating heterogeneous social influence and adoption thresholds is introduced.For theoretical analysis,a generalized edge-based compartmental theory which considers the heterogeneities of social influence and adoption thresholds is developed.Focusing on the final adoption size,the critical propagation probability,and the phase transition type,social contagions for adoption thresholds that follow normal distributions with various standard deviations,follow various distributions,and correlate with degrees are investigated.When thresholds follow normal distributions,a larger standard deviation results in a larger final adoption size when the information propagation probability is relatively low.However,when the information propagation probability is relatively high,a larger standard deviation results in a smaller final adoption size.When thresholds follow various distributions,crossover phenomena in phase transition are observed when investigating the relationship of the final adoption size versus the average adoption threshold for some threshold distributions.When thresholds are correlated with degrees,similar crossover phenomena occur when investigating the relationship of the final adoption size versus the degree correlation index.Additionally,we find that increasing the heterogeneity of social influence suppresses the effects of adoption threshold heterogeneity on social contagions in three cases.Our theory predictions agree well with the simulation results.

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.

A Holistic Secure Communication Mechanism Using a Multilayered Cryptographic Protocol to Enhanced Security

In an era characterized by digital pervasiveness and rapidly expanding datasets,ensuring the integrity and reliability of information is paramount.As cyber threats evolve in complexity,traditional cryptographic methods face increasingly sophisticated challenges.This article initiates an exploration into these challenges,focusing on key exchanges(encompassing their variety and subtleties),scalability,and the time metrics associated with various cryptographic processes.We propose a novel cryptographic approach underpinned by theoretical frameworks and practical engineering.Central to this approach is a thorough analysis of the interplay between Confidentiality and Integrity,foundational pillars of information security.Our method employs a phased strategy,beginning with a detailed examination of traditional cryptographic processes,including Elliptic Curve Diffie-Hellman(ECDH)key exchanges.We also delve into encrypt/decrypt paradigms,signature generation modes,and the hashes used for Message Authentication Codes(MACs).Each process is rigorously evaluated for performance and reliability.To gain a comprehensive understanding,a meticulously designed simulation was conducted,revealing the strengths and potential improvement areas of various techniques.Notably,our cryptographic protocol achieved a confidentiality metric of 9.13 in comprehensive simulation runs,marking a significant advancement over existing methods.Furthermore,with integrity metrics at 9.35,the protocol’s resilience is further affirmed.These metrics,derived from stringent testing,underscore the protocol’s efficacy in enhancing data security.

A Survey of Knowledge Graph Construction Using Machine Learning

Knowledge graph(KG)serves as a specialized semantic network that encapsulates intricate relationships among real-world entities within a structured framework.This framework facilitates a transformation in information retrieval,transitioning it from mere string matching to far more sophisticated entity matching.In this transformative process,the advancement of artificial intelligence and intelligent information services is invigorated.Meanwhile,the role ofmachine learningmethod in the construction of KG is important,and these techniques have already achieved initial success.This article embarks on a comprehensive journey through the last strides in the field of KG via machine learning.With a profound amalgamation of cutting-edge research in machine learning,this article undertakes a systematical exploration of KG construction methods in three distinct phases:entity learning,ontology learning,and knowledge reasoning.Especially,a meticulous dissection of machine learningdriven algorithms is conducted,spotlighting their contributions to critical facets such as entity extraction,relation extraction,entity linking,and link prediction.Moreover,this article also provides an analysis of the unresolved challenges and emerging trajectories that beckon within the expansive application of machine learning-fueled,large-scale KG construction.

GP‐FMLNet:A feature matrix learning network enhanced by glyph and phonetic information for Chinese sentiment analysis

Sentiment analysis is a fine‐grained analysis task that aims to identify the sentiment polarity of a specified sentence.Existing methods in Chinese sentiment analysis tasks only consider sentiment features from a single pole and scale and thus cannot fully exploit and utilise sentiment feature information,making their performance less than ideal.To resolve the problem,the authors propose a new method,GP‐FMLNet,that integrates both glyph and phonetic information and design a novel feature matrix learning process for phonetic features with which to model words that have the same pinyin information but different glyph information.Our method solves the problem of misspelling words influencing sentiment polarity prediction results.Specifically,the authors iteratively mine character,glyph,and pinyin features from the input comments sentences.Then,the authors use soft attention and matrix compound modules to model the phonetic features,which empowers their model to keep on zeroing in on the dynamic‐setting words in various positions and to dispense with the impacts of the deceptive‐setting ones.Ex-periments on six public datasets prove that the proposed model fully utilises the glyph and phonetic information and improves on the performance of existing Chinese senti-ment analysis algorithms.

Heterogeneous Task Allocation Model and Algorithm for Intelligent Connected Vehicles

With the development of vehicles towards intelligence and connectivity,vehicular data is diversifying and growing dramatically.A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle(ICV)applications are proposed for the dispersed computing network composed of heterogeneous task vehicles and Network Computing Points(NCPs).Considering the amount of task data and the idle resources of NCPs,a computing resource scheduling model for NCPs is established.Taking the heterogeneous task execution delay threshold as a constraint,the optimization problem is described as the problem of maximizing the utilization of computing resources by NCPs.The proposed problem is proven to be NP-hard by using the method of reduction to a 0-1 knapsack problem.A many-to-many matching algorithm based on resource preferences is proposed.The algorithm first establishes the mutual preference lists based on the adaptability of the task requirements and the resources provided by NCPs.This enables the filtering out of un-schedulable NCPs in the initial stage of matching,reducing the solution space dimension.To solve the matching problem between ICVs and NCPs,a new manyto-many matching algorithm is proposed to obtain a unique and stable optimal matching result.The simulation results demonstrate that the proposed scheme can improve the resource utilization of NCPs by an average of 9.6%compared to the reference scheme,and the total performance can be improved by up to 15.9%.

Machine learning design of 400 MPa grade biodegradable Zn-Mn based alloys with appropriate corrosion rates

The commonly used trial-and-error method of biodegradable Zn alloys is costly and blindness.In this study,based on the self-built database of biodegradable Zn alloys,two machine learning models are established by the first time to predict the ultimate tensile strength(UTS)and immersion corrosion rate(CR)of biodegradable Zn alloys.A real-time visualization interface has been established to design Zn-Mn based alloys;a representative alloy is Zn-0.4Mn-0.4Li-0.05Mg.Through tensile mechanical properties and immersion corrosion rate tests,its UTS reaches 420 MPa,and the prediction error is only 0.95%.CR is 73μm/a and the prediction error is 5.5%,which elevates 50 MPa grade of UTS and owns appropriate corrosion rate.Finally,influences of the selected features on UTS and CR are discussed in detail.The combined application of UTS and CR model provides a new strategy for synergistically regulating comprehens-ive properties of biodegradable Zn alloys.

Mitigation of Optical Multipath Interference Algorithms in IM-DD Transmission System

This paper aimed to propose two algorithms,DA-M and RF-M,of reducing the impact of multipath interference(MPI)on intensity modulation direct detection(IM-DD)systems,particularly for four-level pulse amplitude modulation(PAM4)systems.DA-M reduced the fluctuation by averaging the signal in blocks,RF-M estimated MPI by subtracting the decision value of the corresponding block from the mean value of a signal block,and then generated interference-reduced samples by subtracting the interference signal from the product of the corresponding MPI estimate and then weighting factor.This paper firstly proposed to separate the signal before decision-making into multiple blocks,which significantly reduced the complexity of DA-M and RF-M.Simulation results showed that the MPI noise of 28 GBaud IMDD system under the linewidths of 1e5 Hz,1e6 Hz and 10e6 Hz can be effectively alleviated.

Scheme Based on Multi-Level Patch Attention and Lesion Localization for Diabetic Retinopathy Grading

Early screening of diabetes retinopathy(DR)plays an important role in preventing irreversible blindness.Existing research has failed to fully explore effective DR lesion information in fundus maps.Besides,traditional attention schemes have not considered the impact of lesion type differences on grading,resulting in unreasonable extraction of important lesion features.Therefore,this paper proposes a DR diagnosis scheme that integrates a multi-level patch attention generator(MPAG)and a lesion localization module(LLM).Firstly,MPAGis used to predict patches of different sizes and generate a weighted attention map based on the prediction score and the types of lesions contained in the patches,fully considering the impact of lesion type differences on grading,solving the problem that the attention maps of lesions cannot be further refined and then adapted to the final DR diagnosis task.Secondly,the LLM generates a global attention map based on localization.Finally,the weighted attention map and global attention map are weighted with the fundus map to fully explore effective DR lesion information and increase the attention of the classification network to lesion details.This paper demonstrates the effectiveness of the proposed method through extensive experiments on the public DDR dataset,obtaining an accuracy of 0.8064.

Artificial intelligence in physiological characteristics recognition for internet of things authentication

Effective user authentication is key to ensuring equipment security,data privacy,and personalized services in Internet of Things(IoT)systems.However,conventional mode-based authentication methods(e.g.,passwords and smart cards)may be vulnerable to a broad range of attacks(e.g.,eavesdropping and side-channel attacks).Hence,there have been attempts to design biometric-based authentication solutions,which rely on physiological and behavioral characteristics.Behavioral characteristics need continuous monitoring and specific environmental settings,which can be challenging to implement in practice.However,we can also leverage Artificial Intelligence(AI)in the extraction and classification of physiological characteristics from IoT devices processing to facilitate authentication.Thus,we review the literature on the use of AI in physiological characteristics recognition pub-lished after 2015.We use the three-layer architecture of the IoT(i.e.,sensing layer,feature layer,and algorithm layer)to guide the discussion of existing approaches and their limitations.We also identify a number of future research opportunities,which will hopefully guide the design of next generation solutions.

Unmanned aerial vehicles towards future Industrial Internet:Roles and opportunities

Unmanned Aerial Vehicles(UAVs)are gaining increasing attention in many fields,such as military,logistics,and hazardous site mapping.Utilizing UAVs to assist communications is one of the promising applications and research directions.The future Industrial Internet places higher demands on communication quality.The easy deployment,dynamic mobility,and low cost of UAVs make them a viable tool for wireless communication in the Industrial Internet.Therefore,UAVs are considered as an integral part of Industry 4.0.In this article,three typical use cases of UAVs-assisted communications in Industrial Internet are first summarized.Then,the state-of-the-art technologies for drone-assisted communication in support of the Industrial Internet are presented.According to the current research,it can be assumed that UAV-assisted communication can support the future Industrial Internet to a certain extent.Finally,the potential research directions and open challenges in UAV-assisted communications in the upcoming future Industrial Internet are discussed.

Spatial and Contextual Path Network for Image Inpainting

Image inpainting is a kind of use known area of information technology to repair the loss or damage to the area.Image feature extraction is the core of image restoration.Getting enough space for information and a larger receptive field is very important to realize high-precision image inpainting.However,in the process of feature extraction,it is difficult to meet the two requirements of obtaining sufficient spatial information and large receptive fields at the same time.In order to obtain more spatial information and a larger receptive field at the same time,we put forward a kind of image restoration based on space path and context path network.For the space path,we stack three convolution layers for 1/8 of the figure,the figure retained the rich spatial details.For the context path,we use the global average pooling layer,where the accept field is the maximum of the backbone network,and the pooling module can provide global context information for the maximum accept field.In order to better integrate the features extracted from the spatial and contextual paths,we study the fusion module of the two paths.Features fusionmodule first path output of the space and context path,and then through themass normalization to balance the scale of the characteristics,finally the characteristics of the pool will be connected into a feature vector and calculate the weight vector.Features of images in order to extract context information,we add attention to the context path refinement module.Attention modules respectively from channel dimension and space dimension to weighted images,in order to obtain more effective information.Experiments show that our method is better than the existing technology in the quality and quantity of themethod,and further to expand our network to other inpainting networks,in order to achieve consistent performance improvements.

A Stackelberg Differential Game Based Bandwidth Allocation in Satellite Communication Network

In this paper, a Stackelberg differential game based approach is proposed to solve the bandwidth allocation problems in satellite communication network. All the satellites are divided into two groups, one has high download requirements, and the other one has low download requirements. Each satellites group has its own controller for bandwidth allocation, and can get payments from the satellites for the allocated resources. The relationships between the controllers and satellites are formed as a Stackelberg game. In our model, differential equation is introduced to describe the bandwidth dynamics for the whole satellite communication network. Combine the differential equation and Stackelberg game together, we can formulate the bandwidth allocation problems in satellite communication network as a Stackelber differential game. The solutions to the proposed game is solved based the Bellman dynamic equations. Numerical simulations are given to prove the effeteness and correctness of the proposed approach.

Security and privacy issues of physical objects in the IoT:Challenges and opportunities

In the Internet of Things(IoT),security and privacy issues of physical objects are crucial to the related applications.In order to clarify the complicated security and privacy issues,the life cycle of a physical object is divided into three stages of pre-working,in-working,and post-working.On this basis,a physical object-based security architecture for the IoT is put forward.According to the security architecture,security and privacy requirements and related protecting technologies for physical objects in different working stages are analyzed in detail.Considering the development of IoT technologies,potential security and privacy challenges that IoT objects may face in the pervasive computing environment are summarized.At the same time,possible directions for dealing with these challenges are also pointed out.

Performance Analysis of Intelligent CR-NOMA Model for Industrial IoT Communications

Aiming for ultra-reliable low-latency wireless communications required in industrial internet of things(IIoT)applications,this paper studies a simple cognitive radio non-orthogonal multiple access(CR-NOMA)downlink system.This system consists of two secondary users(SUs)dynamically interfered by the primary user(PU),and its performance is characterized by the outage probability of the SU communications.This outage probability is calculated under two conditions where,a)the transmission of PU starts after the channel state information(CSI)is acquired,so the base station(BS)is oblivious of the interference,and b)when the BS is aware of the PU interference,and the NOMA transmission is adapted to the more comprehensive knowledge of the signal to interference plus noise ratio(SINR).These results are verified by simulations,and their good agreement suggests our calculations can be used to reduce the complexity of future analysis.We find the outage probability is reduced when the SUs move further away from the primary transmitter or when the signal from PU is less powerful,and the BS always has better performance when it is aware of the interference.The findings thus emphasize the importance of monitoring the channel quality and realtime feedback to optimize the performance of CR-NOMA system.