arXiv subjects

Yanjun Yang

Publications and source records attributed to Yanjun Yang.

4 recordsLinked to original sources

arXiv2025

Views: a hardware-friendly graph database model for storing semantic information

The graph database (GDB) is an increasingly common storage model for data involving relationships between entries. Beyond its widespread usage in database industries, the advantages of GDBs indicate a strong potential in constructing symbolic artificial intelligences (AIs) and retrieval-augmented generation (RAG), where knowledge of data inter-relationships takes a critical role in implementation. However, current GDB models are not optimised for hardware acceleration, leading to bottlenecks in storage capacity and computational efficiency. In this paper, we propose a hardware-friendly GDB model, called Views. We show its data structure and organisation tailored for efficient storage and retrieval of graph data and demonstrate its functional equivalence and storage performance advantage compared to represent traditional graph representations. We further demonstrate its symbolic processing abilities in semantic reasoning and cognitive modelling with practical examples and provide a short perspective on future developments.

cs.DB↗

arXiv2023

Recommending Analogical APIs via Knowledge Graph Embedding

Library migration, which re-implements the same software behavior by using a different library instead of using the current one, has been widely observed in software evolution. One essential part of library migration is to find an analogical API that could provide the same functionality as current ones. However, given the large number of libraries/APIs, manually finding an analogical API could be very time-consuming and error-prone. Researchers have developed multiple automated analogical API recommendation techniques. Documentation-based methods have particularly attracted significant interest. Despite their potential, these methods have limitations, such as a lack of comprehensive semantic understanding in documentation and scalability challenges. In this work, we propose KGE4AR, a novel documentation-based approach that leverages knowledge graph (KG) embedding to recommend analogical APIs during library migration. Specifically, KGE4AR proposes a novel unified API KG to comprehensively and structurally represent three types of knowledge in documentation, which can better capture the high-level semantics. Moreover, KGE4AR then proposes to embed the unified API KG into vectors, enabling more effective and scalable similarity calculation. We build KGE4AR' s unified API KG for 35,773 Java libraries and assess it in two API recommendation scenarios: with and without target libraries. Our results show that KGE4AR substantially outperforms state-of-the-art documentation-based techniques in both evaluation scenarios in terms of all metrics (e.g., 47.1%-143.0% and 11.7%-80.6% MRR improvements in each scenario). Additionally, we explore KGE4AR' s scalability, confirming its effective scaling with the growing number of libraries.

cs.SE↗

arXiv2020

Fast List Decoders for Polarization-Adjusted Convolutional (PAC) Codes

A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near-bound performance, the list size of list decoding needs to be excessively large, which leads to insufferable latency. In this paper, to improve the speed of list decoding, fast list decoders for PAC codes are proposed. We define four types of constituent nodes and provide fast list decoding algorithms for each of them. Simulation results present that fast list decoding with three types of constituent nodes can yield exactly the same error-correction performance as list decoding, and reduce more than 50% time steps for the code (128,64). Moreover, fast list decoding with four types of constituent nodes can further reduce decoding latency with negligible performance degradation.

cs.IT↗

arXiv2020

Leader-cell-driven epithelial sheet fingering

Collective cell migration is crucial in many biological processes such as wound healing, tissue morphogenesis, and tumor progression. The leading front of a collective migrating epithelial cell layer often destabilizes into multicellular finger-like protrusions, each of which is guided by a leader cell at the fingertip. Here, we develop a subcellular-element-based model of this fingering instability, which incorporates leader cells and other related properties of a monolayer of epithelial cells. Our model recovers multiple aspects of the dynamics, especially the traction force patterns and velocity fields, observed in experiments on MDCK cells. Our model predicts the necessity of the leader cell and its minimal functions for the formation and maintenance of a stable finger pattern. Meanwhile, our model allows for an analysis of the role of supra-cellular actin cable on the leading front, predicting that while this observed structure helps maintain the shape of the finger, it is not required in order to form a finger. In addition, we also study the driving instability in the context of continuum active fluid model, which justifies some of our assumptions in the computational approach. In particular, we show that in our model no finger protrusions would emerge in a phenotypically homogenous active fluid and hence the role of the leader cell and its followers are often critical.

physics.bio-ph↗