Dynamic Multi-Graph Spatio-Temporal Graph Traffic Flow Prediction in Bangkok:An Application of a Continuous Convolutional Neural Network

The ability to accurately predict urban traffic flows is crucial for optimising city operations.Consequently,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to understand complex mobility patterns.Deep learning techniques,such as graph neural networks(GNNs),are popular for their ability to capture spatio-temporal dependencies.However,these models often become overly complex due to the large number of hyper-parameters involved.In this study,we introduce Dynamic Multi-Graph Spatial-Temporal Graph Neural Ordinary Differential Equation Networks(DMST-GNODE),a framework based on ordinary differential equations(ODEs)that autonomously discovers effective spatial-temporal graph neural network(STGNN)architectures for traffic prediction tasks.The comparative analysis of DMST-GNODE and baseline models indicates that DMST-GNODE model demonstrates superior performance across multiple datasets,consistently achieving the lowest Root Mean Square Error(RMSE)and Mean Absolute Error(MAE)values,alongside the highest accuracy.On the BKK(Bangkok)dataset,it outperformed other models with an RMSE of 3.3165 and an accuracy of 0.9367 for a 20-min interval,maintaining this trend across 40 and 60 min.Similarly,on the PeMS08 dataset,DMST-GNODE achieved the best performance with an RMSE of 19.4863 and an accuracy of 0.9377 at 20 min,demonstrating its effectiveness over longer periods.The Los_Loop dataset results further emphasise this model’s advantage,with an RMSE of 3.3422 and an accuracy of 0.7643 at 20 min,consistently maintaining superiority across all time intervals.These numerical highlights indicate that DMST-GNODE not only outperforms baseline models but also achieves higher accuracy and lower errors across different time intervals and datasets.

Dynamic adaptive spatio-temporal graph network for COVID-19 forecasting

Appropriately characterising the mixed space-time relations of the contagion process caused by hybrid space and time factors remains the primary challenge in COVID-19 forecasting.However,in previous deep learning models for epidemic forecasting,spatial and temporal variations are captured separately.A unified model is developed to cover all spatio-temporal relations.However,this measure is insufficient for modelling the complex spatio-temporal relations of infectious disease transmission.A dynamic adaptive spatio-temporal graph network(DASTGN)is proposed based on attention mechanisms to improve prediction accuracy.In DASTGN,complex spatio-temporal relations are depicted by adaptively fusing the mixed space-time effects and dynamic space-time dependency structure.This dual-scale model considers the time-specific,space-specific,and direct effects of the propagation process at the fine-grained level.Furthermore,the model characterises impacts from various space-time neighbour blocks under time-varying interventions at the coarse-grained level.The performance comparisons on the three COVID-19 datasets reveal that DASTGN achieves state-of-the-art results with a maximum improvement of 17.092%in the root mean-square error and 11.563%in the mean absolute error.Experimental results indicate that the mechanisms of designing DASTGN can effectively detect some spreading characteristics of COVID-19.The spatio-temporal weight matrices learned in each proposed module reveal diffusion patterns in various scenarios.In conclusion,DASTGN has successfully captured the dynamic spatio-temporal variations of COVID-19,and considering multiple dynamic space-time relationships is essential in epidemic forecasting.

An Intelligent Framework for Resilience Recovery of FANETs with Spatio-Temporal Aggregation and Multi-Head Attention Mechanism

Due to the time-varying topology and possible disturbances in a conflict environment,it is still challenging to maintain the mission performance of flying Ad hoc networks(FANET),which limits the application of Unmanned Aerial Vehicle(UAV)swarms in harsh environments.This paper proposes an intelligent framework to quickly recover the cooperative coveragemission by aggregating the historical spatio-temporal network with the attention mechanism.The mission resilience metric is introduced in conjunction with connectivity and coverage status information to simplify the optimization model.A spatio-temporal node pooling method is proposed to ensure all node location features can be updated after destruction by capturing the temporal network structure.Combined with the corresponding Laplacian matrix as the hyperparameter,a recovery algorithm based on the multi-head attention graph network is designed to achieve rapid recovery.Simulation results showed that the proposed framework can facilitate rapid recovery of the connectivity and coverage more effectively compared to the existing studies.The results demonstrate that the average connectivity and coverage results is improved by 17.92%and 16.96%,respectively compared with the state-of-the-art model.Furthermore,by the ablation study,the contributions of each different improvement are compared.The proposed model can be used to support resilient network design for real-time mission execution.

Multi-Scale Location Attention Model for Spatio-Temporal Prediction of Disease Incidence

Due to the increasingly severe challenges brought by various epidemic diseases,people urgently need intelligent outbreak trend prediction.Predicting disease onset is very important to assist decision-making.Most of the exist-ing work fails to make full use of the temporal and spatial characteristics of epidemics,and also relies on multi-variate data for prediction.In this paper,we propose a Multi-Scale Location Attention Graph Neural Networks(MSLAGNN)based on a large number of Centers for Disease Control and Prevention(CDC)patient electronic medical records research sequence source data sets.In order to understand the geography and timeliness of infec-tious diseases,specific neural networks are used to extract the geography and timeliness of infectious diseases.In the model framework,the features of different periods are extracted by a multi-scale convolution module.At the same time,the propagation effects between regions are simulated by graph convolution and attention mechan-isms.We compare the proposed method with the most advanced statistical methods and deep learning models.Meanwhile,we conduct comparative experiments on data sets with different time lengths to observe the predic-tion performance of the model in the face of different degrees of data collection.We conduct extensive experi-ments on real-world epidemic-related data sets.The method has strong prediction performance and can be readily used for epidemic prediction.

A Secure Microgrid Data Storage Strategy with Directed Acyclic Graph Consensus Mechanism

The wide application of intelligent terminals in microgrids has fueled the surge of data amount in recent years.In real-world scenarios,microgrids must store large amounts of data efficiently while also being able to withstand malicious cyberattacks.To meet the high hardware resource requirements,address the vulnerability to network attacks and poor reliability in the tradi-tional centralized data storage schemes,this paper proposes a secure storage management method for microgrid data that considers node trust and directed acyclic graph(DAG)consensus mechanism.Firstly,the microgrid data storage model is designed based on the edge computing technology.The blockchain,deployed on the edge computing server and combined with cloud storage,ensures reliable data storage in the microgrid.Secondly,a blockchain consen-sus algorithm based on directed acyclic graph data structure is then proposed to effectively improve the data storage timeliness and avoid disadvantages in traditional blockchain topology such as long chain construction time and low consensus efficiency.Finally,considering the tolerance differences among the candidate chain-building nodes to network attacks,a hash value update mechanism of blockchain header with node trust identification to ensure data storage security is proposed.Experimental results from the microgrid data storage platform show that the proposed method can achieve a private key update time of less than 5 milliseconds.When the number of blockchain nodes is less than 25,the blockchain construction takes no more than 80 mins,and the data throughput is close to 300 kbps.Compared with the traditional chain-topology-based consensus methods that do not consider node trust,the proposed method has higher efficiency in data storage and better resistance to network attacks.

Predictive Prefetching for Parallel Hybrid Storage Systems

In this paper, we present a predictive prefetching mechanism that is based on probability graph approach to perform prefetching between different levels in a parallel hybrid storage system. The fundamental concept of our approach is to invoke parallel hybrid storage system’s parallelism and prefetch data among multiple storage levels (e.g. solid state disks, and hard disk drives) in parallel with the application’s on-demand I/O reading requests. In this study, we show that a predictive prefetching across multiple storage levels is an efficient technique for placing near future needed data blocks in the uppermost levels near the application. Our PPHSS approach extends previous ideas of predictive prefetching in two ways: (1) our approach reduces applications’ execution elapsed time by keeping data blocks that are predicted to be accessed in the near future cached in the uppermost level;(2) we propose a parallel data fetching scheme in which multiple fetching mechanisms (i.e. predictive prefetching and application’s on-demand data requests) can work in parallel;where the first one fetches data blocks among the different levels of the hybrid storage systems (i.e. low-level (slow) to high-level (fast) storage devices) and the other one fetches the data from the storage system to the application. Our PPHSS strategy integrated with the predictive prefetching mechanism significantly reduces overall I/O access time in a hybrid storage system. Finally, we developed a simulator to evaluate the performance of the proposed predictive prefetching scheme in the context of hybrid storage systems. Our results show that our PPHSS can improve system performance by 4% across real-world I/O traces without the need of using large size caches.

A Comparison Study between Informed and Predictive Prefetching Mechanisms for I/O Storage Systems

In this paper, we present a comparative study between informed and predictive prefetching mechanisms that were presented to leverage the performance gap between I/O storage systems and CPU. In particular, we will focus on transparent informed prefetching (TIP) and predictive prefetching using probability graph approach (PG). Our main objective is to show the main features, motivations, and implementation overview of each mechanism. We also conducted a performance evaluation discussion that shows a comparison between both mechanisms performance when using different cache size values.

面向远程内存图数据库的应用感知分离式存储设计

图数据在各种应用中日益普及,其因涵盖多种实体类型和存在丰富的关联关系而备受关注.对于图数据库用户而言,高效的图查询服务是保障系统性能的关键因素.随着数据量增加,单机图数据库很难满足将所有数据存储在内存中的需求,而分布式图数据库在拓展性和资源利用率方面受到挑战.基于RDMA的远程内存系统的引入为克服这些挑战提供了一种新的选择,通过分离计算和存储资源,实现了更为灵活的内存使用方式.然而,在使用远程内存的情况下如何最大程度地优化图查询性能成为了当前研究的重点问题.文中首先分析了利用操作系统分页机制透明使用远程内存构建图数据库存在的问题,并在应用层次上设计了远程内存图数据库的存储模型.根据不同数据的特点和访问模式,设计了属性图在远程内存中的存储结构,优化了数据布局和访问路径.实验结果表明,在本地内存受限的情况下,与透明使用远程内存相比,应用感知的设计方式的端到端性能最高提升了12倍.

Building a High-Performance Graph Storage on Top of Tree-Structured Key-Value Stores

Graph databases have gained widespread adoption in various industries and have been utilized in a range of applications,including financial risk assessment,commodity recommendation,and data lineage tracking.While the principles and design of these databases have been the subject of some investigation,there remains a lack of comprehensive examination of aspects such as storage layout,query language,and deployment.The present study focuses on the design and implementation of graph storage layout,with a particular emphasis on tree-structured key-value stores.We also examine different design choices in the graph storage layer and present our findings through the development of TuGraph,a highly efficient single-machine graph database that significantly outperforms well-known Graph DataBase Management System(GDBMS).Additionally,TuGraph demonstrates superior performance in the Linked Data Benchmark Council(LDBC)Social Network Benchmark(SNB)interactive benchmark.

An attention graph stacked autoencoder for anomaly detection of electro-mechanical actuator using spatio-temporal multivariate signals

Health monitoring of electro-mechanical actuator(EMA)is critical to ensure the security of airplanes.It is difficult or even impossible to collect enough labeled failure or degradation data from actual EMA.The autoencoder based on reconstruction loss is a popular model that can carry out anomaly detection with only consideration of normal training data,while it fails to capture spatio-temporal information from multivariate time series signals of multiple monitoring sensors.To mine the spatio-temporal information from multivariate time series signals,this paper proposes an attention graph stacked autoencoder for EMA anomaly detection.Firstly,attention graph con-volution is introduced into autoencoder to convolve temporal information from neighbor features to current features based on different weight attentions.Secondly,stacked autoencoder is applied to mine spatial information from those new aggregated temporal features.Finally,based on the bench-mark reconstruction loss of normal training data,different health thresholds calculated by several statistic indicators can carry out anomaly detection for new testing data.In comparison with tra-ditional stacked autoencoder,the proposed model could obtain higher fault detection rate and lower false alarm rate in EMA anomaly detection experiment.

Optimizing segmented trajectory data storage with HBase for improved spatio-temporal query efficiency

The surging accumulation of trajectory data has yielded invaluable insights into urban systems,but it has also presented challenges for data storage and management systems.In response,specialized storage systems based on non-relational databases have been developed to support large data quantities in distributed approaches.However,these systems often utilize storage by point or storage by trajectory methods,both of which have drawbacks.In this study,we evaluate the effectiveness of segmented trajectory data storage with HBase optimizations for spatio-temporal queries.We develop a prototype system that includes trajectory segmentation,serialization,and spatio-temporal indexing and apply it to taxi trajectory data in Beijing.Ourfindings indicate that the segmented system provides enhanced query speed and reduced memory usage compared to the Geomesa system.

DCRL-KG: Distributed Multi-Modal Knowledge Graph Retrieval Platform Based on Collaborative Representation Learning

The knowledge graph with relational abundant information has been widely used as the basic data support for the retrieval platforms.Image and text descriptions added to the knowledge graph enrich the node information,which accounts for the advantage of the multi-modal knowledge graph.In the field of cross-modal retrieval platforms,multi-modal knowledge graphs can help to improve retrieval accuracy and efficiency because of the abundant relational infor-mation provided by knowledge graphs.The representation learning method is sig-nificant to the application of multi-modal knowledge graphs.This paper proposes a distributed collaborative vector retrieval platform(DCRL-KG)using the multi-modal knowledge graph VisualSem as the foundation to achieve efficient and high-precision multimodal data retrieval.Firstly,use distributed technology to classify and store the data in the knowledge graph to improve retrieval efficiency.Secondly,this paper uses BabelNet to expand the knowledge graph through multi-ple filtering processes and increase the diversification of information.Finally,this paper builds a variety of retrieval models to achieve the fusion of retrieval results through linear combination methods to achieve high-precision language retrieval and image retrieval.The paper uses sentence retrieval and image retrieval experi-ments to prove that the platform can optimize the storage structure of the multi-modal knowledge graph and have good performance in multi-modal space.

An Arrhythmia Intelligent Recognition Method Based on a Multimodal Information and Spatio-Temporal Hybrid Neural Network Model

Electrocardiogram (ECG) analysis is critical for detecting arrhythmias, but traditional methods struggle with large-scale Electrocardiogram data and rare arrhythmia events in imbalanced datasets. These methods fail to perform multi-perspective learning of temporal signals and Electrocardiogram images, nor can they fully extract the latent information within the data, falling short of the accuracy required by clinicians. Therefore, this paper proposes an innovative hybrid multimodal spatiotemporal neural network to address these challenges. The model employs a multimodal data augmentation framework integrating visual and signal-based features to enhance the classification performance of rare arrhythmias in imbalanced datasets. Additionally, the spatiotemporal fusion module incorporates a spatiotemporal graph convolutional network to jointly model temporal and spatial features, uncovering complex dependencies within the Electrocardiogram data and improving the model’s ability to represent complex patterns. In experiments conducted on the MIT-BIH arrhythmia dataset, the model achieved 99.95% accuracy, 99.80% recall, and a 99.78% F1 score. The model was further validated for generalization using the clinical INCART arrhythmia dataset, and the results demonstrated its effectiveness in terms of both generalization and robustness.

知识图谱特征重构下无线传感网络数据存储恢复

为了提升无线传感网络数据存储恢复成功率,保障无线传感网络数据存储安全性,提出知识图谱特征重构下无线传感网络数据存储恢复方法。通过基于知识图谱的特征重构方法优化数据存储结构;利用BP神经网络和LEACH算法,对特征重构后的数据进行融合。最后,结合多级网络编码和纠删码的原理,构建多级编码矩阵对融合数据进行多级编码,并生成多份数据副本进行存储,实现无线传感网络数据存储恢复。实验结果表明,该方法能够提升数据存储恢复成功率至90%以上,通信代价低于1.5×10^(5) Mbit/s,存储恢复时间低于0.7 ms,可以在提升恢复成功率的同时,降低存储通信代价和存储恢复时间。

Minimal Realization of Linear Graph Models for Multi-physics Systems

An engineering system may consist of several different types of components,belonging to such physical"domains"as mechanical,electrical,fluid,and thermal.It is termed a multi-domain(or multi-physics)system.The present paper concerns the use of linear graphs(LGs)to generate a minimal model for a multi-physics system.A state-space model has to be a minimal realization.Specifically,the number of state variables in the model should be the minimum number that can completely represent the dynamic state of the system.This choice is not straightforward.Initially,state variables are assigned to all the energy-storage elements of the system.However,some of the energy storage elements may not be independent,and then some of the chosen state variables will be redundant.An approach is presented in the paper,with illustrative examples in the mixed fluid-mechanical domains,to illustrate a way to recognize dependent energy storage elements and thereby obtain a minimal state-space model.System analysis in the frequency domain is known to be more convenient than in the time domain,mainly because the relevant operations are algebraic rather than differential.For achieving this objective,the state space model has to be converted into a transfer function.The direct way is to first convert the state-space model into the input-output differential equation,and then substitute the time derivative by the Laplace variable.This approach is shown in the paper.The same result can be obtained through the transfer function linear graph(TF LG)of the system.In a multi-physics system,first the physical domains have to be converted into an equivalent single domain(preferably,the output domain of the system),when using the method of TFLG.This procedure is illustrated as well,in the present paper.

基于煤矿井下不安全行为知识图谱构建方法

虽然知识图谱已广泛应用于各个领域,但在煤矿安全方面,尤其在煤矿井下不安全行为方面的研究较少。构建了一种自底向上的煤矿井下不安全行为知识图谱。首先,采用传统机器学习和深度学习算法相结合的方法进行命名实体识别,采用RoBERTa进行词语向量化,采用双向长短时记忆网络(BiLSTM)对向量进行标注,提高网络模型对上下文特征的捕捉能力,通过多层感知机(MLP)解决煤矿井下不安全行为数据集数据量不足的问题,采用条件随机场(CRF)模型解决前面存在的单词关系不识别问题,并捕获全文信息和预测结果。其次,根据语句的结构特点,设计了基于知识“实体-关系-实体”三元组的依存句法树结构,对井下不安全行为领域的知识资源进行知识抽取与表示。最后,构建面向井下不安全行为的知识图谱。实验结果表明:(1) RoBERTaBiLSTM-MLP-CRF模型对于导致结果、违反性行为、错误性行为及粗心性行为4类实体类别具有较好的识别效果,其准确率分别为86.7%,80.3%,80.7%,77.4%。(2)在相同的数据集下,RoBERTa-BiLSTM-MLP-CRF模型训练的准确率、召回率、F1值较RoBERTa-BiLSTM-CRF模型分别提高了1.6%,1.5%,1.6%。

基于知识图谱的存储系统单元教学设计

针对存储系统教学单元概念复杂、术语众多以及理解难度大等特点,提出一种基于知识图谱的教学设计方法。该方法通过知识图谱将碎片化的知识点体系化、可视化,从教学内容分析、知识图谱构建、重难点分析及对策设计、教学策略设计、教学过程设计和过程性考核设计等多个环节进行教学设计,并融入思政元素、职业素养,促进“德法知技”综合育人。

SL-tgStore:新的时序知识图谱存储模型

为了解决时序知识图谱的存储问题,提出结合快照和日志模式的时序知识图谱存储模型SL-tgStore.模型由若干时间桶组成,每个时间桶由一系列的时间窗口组成.在首个时间窗口引入初始快照作为时序知识图谱存储和处理的基本单元,在接下来的时间窗口存储为增量日志.提出相应的阈值来确定初始快照的生成,即生成一个新的时间桶,以达到初始快照数量与增量日志数量的平衡,并提出临时快照生成算法.所提模型能够有效解决快照存储模式消耗内存大,日志存储模式查询效率低的问题.为了对SL-tgStore模型进行高效查询,在此基础上提出4种索引结构.在4个真实数据集上进行实验,理论研究与实验结果表明所提出的SL-tgStore存储模型具有高效性.

基于图数据库的汽车质量追溯数据存储研究

汽车产业已经成为当前国民经济中的支柱产业,为了应对汽车零部件生产中的质量问题,目前产业界在生产过程中广泛引入质量追溯系统。现有的质量追溯系统大多基于关系型数据库构建,而传统的数据库在处理复杂的关系型数据时存在局限性,无法灵活应对质量追溯的多层次和复杂需求。因此,提出了一种基于图数据库的汽车质量追溯数据存储方法,选择图数据库作为数据存储方案,并设计了高度灵活的数据模型,包括汽车、部件、工序等之间的关联关系,以更好地满足汽车零部件生产质量追溯需求。实验结果表明,相较于传统数据库系统,基于图数据库的方法在查询性能以及数据插入效率方面均表现出显著优势。

基于Neo4j的城市地下管道信息知识图谱构建研究

为更好地支撑城市地下管道的探测作业,更系统、灵活地管理地下管道知识数据库,以相关国内标准、规范为研究基础,通过实体提取、知识整合等过程,建立城市地下管道信息知识图谱。将知识图谱存储在图数据库Neo4j中,提出基于数据-知识融合的辅助探测决策应用框架,进而提供实时、精准的知识查询接口。研究结果表明:构建的知识图谱可以辅助地下管道开挖工程的探测决策过程,一定程度上为推进地下管道数据-知识融合探测体系建成提供参考。