Spatiotemporal Prediction of Urban Traffics Based on Deep GNN

Traffic prediction already plays a significant role in applications like traffic planning and urban management,but it is still difficult to capture the highly non-linear and complicated spatiotemporal correlations of traffic data.As well as to fulfil both long-termand short-termprediction objectives,a better representation of the temporal dependency and global spatial correlation of traffic data is needed.In order to do this,the Spatiotemporal Graph Neural Network(S-GNN)is proposed in this research as amethod for traffic prediction.The S-GNN simultaneously accepts various traffic data as inputs and investigates the non-linear correlations between the variables.In terms of modelling,the road network is initially represented as a spatiotemporal directed graph,with the features of the samples at the time step being captured by a convolution module.In order to assign varying attention weights to various adjacent area nodes of the target node,the adjacent areas information of nodes in the road network is then aggregated using a graph network.The data is output using a fully connected layer at the end.The findings show that S-GNN can improve short-and long-term traffic prediction accuracy to a greater extent;in comparison to the control model,the RMSE of S-GNN is reduced by about 0.571 to 9.288 and the MAE(Mean Absolute Error)by about 0.314 to 7.678.The experimental results on two real datasets,Pe MSD7(M)and PEMS-BAY,also support this claim.

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.

Generation of Low-Delay and High-Stability Multicast Tree

Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bility simultaneously.Given a general network,the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem,without a precise and efficient algorithm.To address these challenges,this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability,degree-constrained,edge-weighted for multicast(T-SDE).A class of algorithms was proposed which creates the multicast tree greedy on the ratio of fan-out to delay(RFD)and probability of stability of terminal to obtain a high performance in multicast.The proposed algorithms greedily select terminals with a large RFD and a high probability of stability as forwarding nodes in the generation of the multicast tree,where the larger RFD and higher stability of upstream nodes are beneficial to achieve a low transmission delay and high stability in multicast.The proposed RFD can be compatible with the original model,which can take advantage of network connectivity during the generation of a multicast tree.This paper carries out simulation experiments on Matlab R2016b to measure the performance of the proposed algorithm.Experimental results show that the proposed algorithm can provide a smaller height,higher stability,and a lower transmission delay of the resulting multicast tree than other solutions.The spanning tree of the proposed algorithms can support low transmission delay and high stability in multicast transmission.

A Systematic Review of Blockchain Technology for Government Information Sharing

Government information sharing(GIS)refers to that act of required or provided for duty government information,commercial information and public welfare information,and it is a basic issue of government services.However,the existing GIS has low transparency and is lack of flexibility between different departments.Aiming at such problems,this paper takes blockchain as a solusion,and systematically summarizes the development of digital GIS,the advantages and challenges of blockchain and its theoretical research and practical applications.Specifically,it reviews e-government interactive structure,big data and other solutions,analyses their imperfections,and puts forward blockchain-based solutions.The blockchain improves government service efficiency and data security,meanwhile it faces challenges in throughput and supervision.In order to meet these challenges,researchers propose solutions based on three data exchange scenarios:government-to-government,government-to-enterprise and government-toindividual.In addition to researches,blockchain-based GIS is put into use.The electronic licensing project of Nanjing(China)government is taken as an example to illustrate that blockchain has the ability to openly and securely verify,track,and exchange data,so as to improve management ability and public service level of government agencies.

Fast Verification of Network Configuration Updates

With the expansion of network services,large-scale networks have progressively become common.The network status changes rapidly in response to customer needs and configuration changes,so network configuration changes are also very frequent.However,no matter what changes,the network must ensure the correct conditions,such as isolating tenants from each other or guaranteeing essential services.Once changes occur,it is necessary to verify the after-changed network.Whereas,for the verification of large-scale network configuration changes,many current verifiers show poor efficiency.In order to solve the problem ofmultiple global verifications caused by frequent updates of local configurations in large networks,we present a fast configuration updates verification tool,FastCUV,for distributed control planes.FastCUV aims to enhance the efficiency of distributed control plane verification for medium and large networks while ensuring correctness.This paper presents a method to determine the network range affected by the configuration change.We present a flow model and graph structure to facilitate the design of verification algorithms and speed up verification.Our scheme verifies the network area affected by obtaining the change of the Forwarding Information Base(FIB)before and after.FastCUV supports rich network attributes,meanwhile,has high efficiency and correctness performance.After experimental verification and result analysis,our method outperforms the state-of-the-art method to a certain extent.

Performance Evaluation of Topologies for Multi-Domain Software-Defined Networking

Software-defined networking(SDN)is widely used in multiple types of data center networks,and these distributed data center networks can be integrated into a multi-domain SDN by utilizing multiple controllers.However,the network topology of each control domain of SDN will affect the performance of the multidomain network,so performance evaluation is required before the deployment of the multi-domain SDN.Besides,there is a high cost to build real multi-domain SDN networks with different topologies,so it is necessary to use simulation testing methods to evaluate the topological performance of the multi-domain SDN network.As there is a lack of existing methods to construct a multi-domain SDN simulation network for the tool to evaluate the topological performance automatically,this paper proposes an automated multi-domain SDN topology performance evaluation framework,which supports multiple types of SDN network topologies in cooperating to construct a multi-domain SDN network.The framework integrates existing single-domain SDN simulation tools with network performance testing tools to realize automated performance evaluation of multidomain SDN network topologies.We designed and implemented a Mininet-based simulation tool that can connect multiple controllers and run user-specified topologies in multiple SDN control domains to build and test multi-domain SDN networks faster.Then,we used the tool to perform performance tests on various data center network topologies in single-domain and multi-domain SDN simulation environments.Test results show that Space Shuffle has the most stable performance in a single-domain environment,and Fat-tree has the best performance in a multi-domain environment.Also,this tool has the characteristics of simplicity and stability,which can meet the needs of multi-domain SDN topology performance evaluation.

Research on Online Education of Talent Training and Young Teacher Growth Based on Multimedia Technology

Information technology education has played a more important role under the background of“Internet+”.However,a combination of education and information technology is only limited between online teaching platforms and massive open online courses(MOOC).This paper proposes a visual teaching system based on cloud computing and big data techniques via combing virtual and real techniques online and offline to provide rich teaching resources for students.It can also use the digital human-computer interaction answering function to address students’questions.Additionally,it can provide a medium for young teachers to quickly improve their professional teaching skills.This paper aims to achieve a multimedia system via integrating“Internet+”technology with education to help improve talent training and abilities of young teachers.

Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem

The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given.

A Time Series Intrusion Detection Method Based on SSAE,TCN and Bi-LSTM

In the fast-evolving landscape of digital networks,the incidence of network intrusions has escalated alarmingly.Simultaneously,the crucial role of time series data in intrusion detection remains largely underappreciated,with most systems failing to capture the time-bound nuances of network traffic.This leads to compromised detection accuracy and overlooked temporal patterns.Addressing this gap,we introduce a novel SSAE-TCN-BiLSTM(STL)model that integrates time series analysis,significantly enhancing detection capabilities.Our approach reduces feature dimensionalitywith a Stacked Sparse Autoencoder(SSAE)and extracts temporally relevant features through a Temporal Convolutional Network(TCN)and Bidirectional Long Short-term Memory Network(Bi-LSTM).By meticulously adjusting time steps,we underscore the significance of temporal data in bolstering detection accuracy.On the UNSW-NB15 dataset,ourmodel achieved an F1-score of 99.49%,Accuracy of 99.43%,Precision of 99.38%,Recall of 99.60%,and an inference time of 4.24 s.For the CICDS2017 dataset,we recorded an F1-score of 99.53%,Accuracy of 99.62%,Precision of 99.27%,Recall of 99.79%,and an inference time of 5.72 s.These findings not only confirm the STL model’s superior performance but also its operational efficiency,underpinning its significance in real-world cybersecurity scenarios where rapid response is paramount.Our contribution represents a significant advance in cybersecurity,proposing a model that excels in accuracy and adaptability to the dynamic nature of network traffic,setting a new benchmark for intrusion detection systems.

CMAES-WFD:Adversarial Website Fingerprinting Defense Based on Covariance Matrix Adaptation Evolution Strategy

Website fingerprinting,also known asWF,is a traffic analysis attack that enables local eavesdroppers to infer a user’s browsing destination,even when using the Tor anonymity network.While advanced attacks based on deep neural network(DNN)can performfeature engineering and attain accuracy rates of over 98%,research has demonstrated thatDNNis vulnerable to adversarial samples.As a result,many researchers have explored using adversarial samples as a defense mechanism against DNN-based WF attacks and have achieved considerable success.However,these methods suffer from high bandwidth overhead or require access to the target model,which is unrealistic.This paper proposes CMAES-WFD,a black-box WF defense based on adversarial samples.The process of generating adversarial examples is transformed into a constrained optimization problem solved by utilizing the Covariance Matrix Adaptation Evolution Strategy(CMAES)optimization algorithm.Perturbations are injected into the local parts of the original traffic to control bandwidth overhead.According to the experiment results,CMAES-WFD was able to significantly decrease the accuracy of Deep Fingerprinting(DF)and VarCnn to below 8.3%and the bandwidth overhead to a maximum of only 14.6%and 20.5%,respectively.Specially,for Automated Website Fingerprinting(AWF)with simple structure,CMAES-WFD reduced the classification accuracy to only 6.7%and the bandwidth overhead to less than 7.4%.Moreover,it was demonstrated that CMAES-WFD was robust against adversarial training to a certain extent.

Authenticated Digital Currency Redaction with Stronger Privacy and Usability

With the promotion of digital currency,how to effectively solve the authenticity,privacy and usability of digital currency issuance has been a key problem.Redactable signature scheme(RSS)can provide the verification of the integrity and source of the generated sub-documents and solve the privacy problem in digital currency by removing blocks from the signed documents.Unfortunately,it has not realized the consolidation of signed documents,which can not solve the problem of merging two digital currencies.Now,we introduce the concept of weight based on the threshold secret sharing scheme(TSSS)and present a redactable signature scheme with merge algorithm(RSS-MA)using the quasi-commutative accumulator.Our scheme can reduce the communication overhead by utilizing the merge algorithm when transmitting multiple digital currency signatures.Furthermore,this can effectively hide the scale of users’private monetary assets and the number of transactions between users.While meeting the three properties of digital currency issuance,in order to ensure the availability of digital currency after redacting,editors shall not remove the relevant identification information block form digital currency.Finally,our security proof and the analysis of efficiency show that RSS-MA greatly improves the communication and computation efficiency when transmitting multiple signatures.

Dynamical behaviors in discrete memristor-coupled small-world neuronal networks

The brain is a complex network system in which a large number of neurons are widely connected to each other and transmit signals to each other.The memory characteristic of memristors makes them suitable for simulating neuronal synapses with plasticity.In this paper,a memristor is used to simulate a synapse,a discrete small-world neuronal network is constructed based on Rulkov neurons and its dynamical behavior is explored.We explore the influence of system parameters on the dynamical behaviors of the discrete small-world network,and the system shows a variety of firing patterns such as spiking firing and triangular burst firing when the neuronal parameterαis changed.The results of a numerical simulation based on Matlab show that the network topology can affect the synchronous firing behavior of the neuronal network,and the higher the reconnection probability and number of the nearest neurons,the more significant the synchronization state of the neurons.In addition,by increasing the coupling strength of memristor synapses,synchronization performance is promoted.The results of this paper can boost research into complex neuronal networks coupled with memristor synapses and further promote the development of neuroscience.

Differentially Private Support Vector Machines with Knowledge Aggregation

With the widespread data collection and processing,privacy-preserving machine learning has become increasingly important in addressing privacy risks related to individuals.Support vector machine(SVM)is one of the most elementary learning models of machine learning.Privacy issues surrounding SVM classifier training have attracted increasing attention.In this paper,we investigate Differential Privacy-compliant Federated Machine Learning with Dimensionality Reduction,called FedDPDR-DPML,which greatly improves data utility while providing strong privacy guarantees.Considering in distributed learning scenarios,multiple participants usually hold unbalanced or small amounts of data.Therefore,FedDPDR-DPML enables multiple participants to collaboratively learn a global model based on weighted model averaging and knowledge aggregation and then the server distributes the global model to each participant to improve local data utility.Aiming at high-dimensional data,we adopt differential privacy in both the principal component analysis(PCA)-based dimensionality reduction phase and SVM classifiers training phase,which improves model accuracy while achieving strict differential privacy protection.Besides,we train Differential privacy(DP)-compliant SVM classifiers by adding noise to the objective function itself,thus leading to better data utility.Extensive experiments on three high-dimensional datasets demonstrate that FedDPDR-DPML can achieve high accuracy while ensuring strong privacy protection.

RESTlogic: Detecting Logic Vulnerabilities in Cloud REST APIs

logical testing model and resource lifecycle information,generate test cases and complete parameters,and alleviate inconsistency issues through parameter inference.Once again,we propose a method of analyzing test results using joint state codes and call stack information,which compensates for the shortcomings of traditional analysis methods.We will apply our method to testing REST services,including OpenStack,an open source cloud operating platform for experimental evaluation.We have found a series of inconsistencies,known vulnerabilities,and new unknown logical defects.

A Survey on Blockchain-Based Federated Learning:Categorization,Application and Analysis

Federated Learning(FL),as an emergent paradigm in privacy-preserving machine learning,has garnered significant interest from scholars and engineers across both academic and industrial spheres.Despite its innovative approach to model training across distributed networks,FL has its vulnerabilities;the centralized server-client architecture introduces risks of single-point failures.Moreover,the integrity of the global model—a cornerstone of FL—is susceptible to compromise through poisoning attacks by malicious actors.Such attacks and the potential for privacy leakage via inference starkly undermine FL’s foundational privacy and security goals.For these reasons,some participants unwilling use their private data to train a model,which is a bottleneck in the development and industrialization of federated learning.Blockchain technology,characterized by its decentralized ledger system,offers a compelling solution to these issues.It inherently prevents single-point failures and,through its incentive mechanisms,motivates participants to contribute computing power.Thus,blockchain-based FL(BCFL)emerges as a natural progression to address FL’s challenges.This study begins with concise introductions to federated learning and blockchain technologies,followed by a formal analysis of the specific problems that FL encounters.It discusses the challenges of combining the two technologies and presents an overview of the latest cryptographic solutions that prevent privacy leakage during communication and incentives in BCFL.In addition,this research examines the use of BCFL in various fields,such as the Internet of Things and the Internet of Vehicles.Finally,it assesses the effectiveness of these solutions.

Rapid Prototype Development Approach for Genetic Programming

Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals.

Privacy Protection Algorithm for the Internet of Vehicles Based on Local Differential Privacy and Game Model

In recent years,with the continuous advancement of the intelligent process of the Internet of Vehicles(IoV),the problem of privacy leakage in IoV has become increasingly prominent.The research on the privacy protection of the IoV has become the focus of the society.This paper analyzes the advantages and disadvantages of the existing location privacy protection system structure and algorithms,proposes a privacy protection system structure based on untrusted data collection server,and designs a vehicle location acquisition algorithm based on a local differential privacy and game model.The algorithm first meshes the road network space.Then,the dynamic game model is introduced into the game user location privacy protection model and the attacker location semantic inference model,thereby minimizing the possibility of exposing the regional semantic privacy of the k-location set while maximizing the availability of the service.On this basis,a statistical method is designed,which satisfies the local differential privacy of k-location sets and obtains unbiased estimation of traffic density in different regions.Finally,this paper verifies the algorithm based on the data set of mobile vehicles in Shanghai.The experimental results show that the algorithm can guarantee the user’s location privacy and location semantic privacy while satisfying the service quality requirements,and provide better privacy protection and service for the users of the IoV.

Ripple+:An Improved Scheme of Ripple Consensus Protocol in Deployability,Liveness and Timing Assumption

Ripple acts as a real-time settlement and payment system to connect banks and payment providers.As the consensus support of the Ripple network to ensure network consistency,Ripple consensus protocol has been widely concerned in recent years.Compared with those Byzantine fault tolerant protocols,Ripple has a significant difference that the system can reach an agreement under decentralized trust model.However,Ripple has many problems both in theory and practice,which arementioned in the previous researches.This paper presents Ripple+,an improved scheme of Ripple consensus protocol,which improves Ripple fromthree aspects:(1)Ripple+employs a specific trustmodel and a corresponding guideline for Unique Node List selection,which makes it easy to deploy in practice to meet the safety and liveness condition;(2)the primary and viewchangemechanismare joined to solve the problem discussed by the previous research that Ripple may lose liveness in some extreme scenarios;(3)we remove the strong synchrony clock and timeout during consensus periods to make it suitable for weak synchrony assumption.We implemented a prototype of Ripple+and conducted experiments to show that Ripple+can achieve the throughput of tens of thousands of transactions per second with no more than half a minute latency,and the view change mechanism hardly incurs additional cost.

Predictive modeling of 30-day readmission risk of diabetes patients by logistic regression,artificial neural network,and EasyEnsemble

Objective:To determine the most influential data features and to develop machine learning approaches that best predict hospital readmissions among patients with diabetes.Methods:In this retrospective cohort study,we surveyed patient statistics and performed feature analysis to identify the most influential data features associated with readmissions.Classification of all-cause,30-day readmission outcomes were modeled using logistic regression,artificial neural network,and Easy Ensemble.F1 statistic,sensitivity,and positive predictive value were used to evaluate the model performance.Results:We identified 14 most influential data features(4 numeric features and 10 categorical features)and evaluated 3 machine learning models with numerous sampling methods(oversampling,undersampling,and hybrid techniques).The deep learning model offered no improvement over traditional models(logistic regression and Easy Ensemble)for predicting readmission,whereas the other two algorithms led to much smaller differences between the training and testing datasets.Conclusions:Machine learning approaches to record electronic health data offer a promising method for improving readmission prediction in patients with diabetes.But more work is needed to construct datasets with more clinical variables beyond the standard risk factors and to fine-tune and optimize machine learning models.

The Proof of the 3X + 1 Conjecture

In this paper, we use two new effective tools and ingenious methods to prove the 3X + 1 conjecture. By using the recursive method, we firstly prove that any positive integer can be turned into an element of fourth column of the infinite-row-six-column-matrix after a finite times operation, thus we convert “the 3X + 1 conjecture” into an equivalent conjecture, which is: Any positive integer n must become 1 after finite operations under formation of σ(n) , where Then, with the help of the infinite-row-four-column-matrix, we continue to use the recursive method to prove this conjecture strictly.