arXiv subjects

Guodong Jin

Publications and source records attributed to Guodong Jin.

6 recordsLinked to original sources

arXiv2024

Blockchain-Enabled IoV: Secure Communication and Trustworthy Decision-Making

The Internet of Vehicles (IoV), which enables interactions between vehicles, infrastructure, and the environment, faces challenges in maintaining communication security and reliable automated decisions. This paper introduces a decentralized framework comprising a primary layer for managing inter-vehicle communication and a sub-layer for securing intra-vehicle interactions. By implementing blockchain-based protocols like Blockchain-integrated Secure Authentication (BiSA) and Decentralized Blockchain Name Resolution (DBNR), the framework ensures secure, decentralized identity management and reliable data exchanges, thereby supporting safe and efficient autonomous vehicle operations.

cs.CR↗

arXiv2024

BeerReview: A Blockchain-enabled Peer Review Platform

In an era of increasing concerns over intellectual property rights, traditional peer review systems face challenges including plagiarism, malicious attacks, and unauthorized data access. BeerReview, a blockchain-enabled peer review platform, offers a robust solution, enabling experts and scholars to participate actively in the review process without concerns about plagiarism or security threats. Following the completion of its alpha testing, BeerReview demonstrates the potential for expanded deployment. This platform offers improved convenience and more robust intellectual property protection within the peer review process with open source initiative.

cs.DC↗

arXiv2024

Non-invasive magnetocardiography of living rat based on diamond quantum sensor

Magnetocardiography (MCG) has emerged as a sensitive and precise method to diagnose cardiovascular diseases, providing more diagnostic information than traditional technology. However, the sensor limitations of conventional MCG systems, such as large size and cryogenic requirement, have hindered the widespread application and in-depth understanding of this technology. In this study, we present a high-sensitivity, room-temperature MCG system based on the negatively charged Nitrogen-Vacancy (NV) centers in diamond. The magnetic cardiac signal of a living rat, characterized by an approximately 20 pT amplitude in the R-wave, is successfully captured through non-invasive measurement using this innovative solid-state spin sensor. To detect these extremely weak biomagnetic signals, we utilize sensitivity-enhancing techniques such as magnetic flux concentration. These approaches have enabled us to simultaneously achieve a magnetometry sensitivity of 9 $\text{pT}\cdot \text{Hz}^{-1/2}$ and a sensor scale of 5 $\text{mm}$. By extending the sensing scale of the NV centers from cellular and molecular level to macroscopic level of living creatures, we have opened the future of solid-state quantum sensing technologies in clinical environments.

physics.med-ph↗

arXiv2024

AeonG: An Efficient Built-in Temporal Support in Graph Databases

Real world graphs are often dynamic and evolve over time. It is crucial for storing and querying graph evolution in graph databases. However, existing works either suffer from high storage overhead or lack efficient temporal query support, or both. In this paper, we propose AeonG, a new graph database with built-in temporal support. AeonG is based on a novel temporal graph model. To fit this model, we design a storage engine and a query engine. Our storage engine is hybrid, with one current storage to manage the most recent versions of graph objects, and another historical storage to manage the previous versions of graph objects. This separation makes the performance degradation of querying the most recent graph object versions as slight as possible. To reduce the historical storage overhead, we propose a novel anchor+delta strategy, in which we periodically create a complete version (namely anchor) of a graph object, and maintain every change (namely delta) between two adjacent anchors of the same object. To boost temporal query processing, we propose an anchor-based version retrieval technique in the query engine to skip unnecessary historical version traversals. Extensive experiments are conducted on both real and synthetic datasets. The results show that AeonG achieves up to 5.73X lower storage consumption and 2.57X lower temporal query latency against state-of-the-art approaches, while introducing only 9.74% performance degradation for supporting temporal features

cs.DB↗

arXiv2021

Making RDBMSs Efficient on Graph Workloads Through Predefined Joins

Joins in native graph database management systems (GDBMSs) are predefined to the system as edges, which are indexed in adjacency list indices and serve as pointers. This contrasts with and can be more performant than value-based joins in RDBMSs and has lead researchers to investigate ways to integrate predefined joins directly into RDBMSs. Existing approaches adopt a strict separation of graph and relational data and processors, where a graph-specific processor uses left-deep and index nested loop joins for a subset of joins. This may be suboptimal, and may lead to non-sequential scans of data in some queries. We propose a purely relational approach to integrate predefined joins in columnar RDBMSs that uses row IDs (RIDs) of tuples as pointers. Users can predefine equality joins between any two tables, which leads to materializing RIDs in extended tables and optionally in RID indices. Instead of using the RID index to perform the join directly, we use it primarily in hash joins to generate semi-join filters that can be passed to scans using sideways information passing, ensuring sequential scans. In some settings, we also use RID indices to reduce the number of joins in query plans. Our approach does not introduce any graph-specific system components, can execute predefined joins on any join plan, and can improve performance on any workload that contains equality joins that can be predefined. We integrated our approach to DuckDB and call the resulting system {\em GRainDB}. We demonstrate that GRainDB far improves the performance of DuckDB on relational and graph workloads with large many-to-many joins, making it competitive with a state-of-the-art GDBMS, and incurs no major overheads otherwise.

cs.DB↗

arXiv2015

Clustering and relative velocities of heavy particles under gravitational settling in isotropic turbulent flows

Spatial clustering and intermittency in the relative velocity of heavy particles of the same size settling in turbulent flows can be strongly affected by gravity. We present a model for the timescale of the fluid velocity gradient seen by particle pairs and propose an effective Kubo number based on this timescale to explain the mechanism of gravity-enhanced clustering. We explore the mechanisms of the gravity-induced reduction or enhancement of the intermittency in the particle radial relative velocity (RRV) at different Stokes numbers based on backward-in-time relative dispersion and preferential sampling of the fluid field. These effects of gravity on clustering and the RRV must be parameterized in the geometric collision kernel.

physics.flu-dyn↗