SearcharxivSearch

arXiv subjects

Bo Guan

Publications and source records attributed to Bo Guan.

At least 19 recordsLinked to original sources

Sheet As Token: A Graph-Enhanced Representation for Multi-Sheet Spreadsheet Understanding

Workbook-scale spreadsheet understanding is increasingly important for language-model-based data analysis agents, but remains challenging because relevant information is often distributed across multiple sheets with heterogeneous schemas, layouts, and implicit relationships. Existing retrieval-augmented approaches typically decompose spreadsheets into rows, columns, or blocks to improve scalability; however, such chunk-centric representations can fragment worksheets into isolated text spans and weaken global sheet-level semantics. We propose Sheet As Token (SAT), a graph-enhanced framework that treats each worksheet as a unified semantic unit for multi-sheet spreadsheet retrieval. SAT serializes sparse schema-aware features, including sheet name, shape, and column headers, and encodes each worksheet into a compact dense token. Given a query, SAT retrieves candidates with a BGE-initialized Sheet Encoder and refines them with a gated relational GNN. In strict full-corpus evaluation, SAT reaches 0.9173 NDCG@5 on IndustryTab-614 and 0.9222 on IndustryTab-1K, relative improvements of 44.6% and 46.7% over zero-shot BGE RAG, respectively. SAT therefore improves both retrieval accuracy and serving efficiency: on IndustryTab-1K, it exceeds a Qwen3.5-9B RAG reranker by 12.5% while reducing online latency from 2.61 s to 9.24 ms, approximately 283X faster. These results show that SAT provides accurate and latency-efficient retrieval in the evaluated fixed-corpus setting. Code and data are available at https://github.com/SHITIANYU-hue/SheetasToken .

cs.AI

Designing Scalable Rate Limiting Systems: Algorithms, Architecture, and Distributed Solutions

Designing a rate limiter that is simultaneously accurate, available, and scalable presents a fundamental challenge in distributed systems, primarily due to the trade-offs between algorithmic precision, availability, consistency, and partition tolerance. This article presents a concrete architecture for a distributed rate limiting system in a production-grade environment. Our design chooses the in-memory cache database, the Redis, along with its Sorted Set data structure, which provides $O(log (N))$ time complexity operation for the key-value pair dataset with efficiency and low latency, and maintains precision. The core contribution is quantifying the accuracy and memory cost trade-off of the chosen Rolling Window as the implemented rate limiting algorithm against the Token Bucket and Fixed Window algorithms. In addition, we explain how server-side Lua scripting is critical to bundling cleanup, counting, and insertion into a single atomic operation, thereby eliminating race conditions in concurrent environments. In the system architecture, we propose a three-layer architecture that manages the storage and updating of the limit rules. Through script load by hashing the rule parameters, rules can be changed without modifying the cached scripts. Furthermore, we analyze the deployment of this architecture on a Redis Cluster, which provides the availability and scalability by data sharding and replication. We explain the acceptance of AP (Availability and Partition Tolerance) from the CAP theorem as the pragmatic engineering trade-off for this use case.

cs.DC

Fully nonlinear parabolic equations of real forms on Hermitian manifolds

Over many decades fully nonlinear PDEs, and the complex Monge-Amp\`ere equation in particular played a central role in the study of complex manifolds. Most previous works focused on problems that can be expressed through equations involving real $(1, 1)$ forms. As many important questions, especially those linked to higher cohomology classes in complex geometry involve real $(p, p)$ forms for $p > 1$, there is a strong need to develop PDE techniques to study them. In this paper we consider a fully nonlinear equation for $(p, p)$ forms on compact Hermitian manifolds. We establish the existence of classical solutions for a large class of these equations by a parabolic approach, proving the long-time existence and convergence of solutions to the elliptic case.

math.AP

Mapping New Realities: Ground Truth Image Creation with Pix2Pix Image-to-Image Translation

Generative Adversarial Networks (GANs) have significantly advanced image processing, with Pix2Pix being a notable framework for image-to-image translation. This paper explores a novel application of Pix2Pix to transform abstract map images into realistic ground truth images, addressing the scarcity of such images crucial for domains like urban planning and autonomous vehicle training. We detail the Pix2Pix model's utilization for generating high-fidelity datasets, supported by a dataset of paired map and aerial images, and enhanced by a tailored training regimen. The results demonstrate the model's capability to accurately render complex urban features, establishing its efficacy and potential for broad real-world applications.

cs.CV

Reinforcement Learning Approach for Integrating Compressed Contexts into Knowledge Graphs

The widespread use of knowledge graphs in various fields has brought about a challenge in effectively integrating and updating information within them. When it comes to incorporating contexts, conventional methods often rely on rules or basic machine learning models, which may not fully grasp the complexity and fluidity of context information. This research suggests an approach based on reinforcement learning (RL), specifically utilizing Deep Q Networks (DQN) to enhance the process of integrating contexts into knowledge graphs. By considering the state of the knowledge graph as environment states defining actions as operations for integrating contexts and using a reward function to gauge the improvement in knowledge graph quality post-integration, this method aims to automatically develop strategies for optimal context integration. Our DQN model utilizes networks as function approximators, continually updating Q values to estimate the action value function, thus enabling effective integration of intricate and dynamic context information. Initial experimental findings show that our RL method outperforms techniques in achieving precise context integration across various standard knowledge graph datasets, highlighting the potential and effectiveness of reinforcement learning in enhancing and managing knowledge graphs.

cs.AI

Fully nonlinear elliptic equations on Hermitian manifolds for symmetric functions of partial Laplacians

We consider a class of fully nonlinear second order elliptic equations on Hermitian manifolds closely related to the general notion of $\bfG$-plurisubharmonicity of Harvey-Lawson and an equation treated by Székelyhidi-Tosatti-Weinkove in the proof of Gauduchon conjecture. Under fairly general assumptions we derive interior estimates and establish the existence of smooth solutions for the Dirichlet problem as well as for equations on closed manifolds.

math.AP

Superstring-Based Sequence Obfuscation to Thwart Pattern Matching Attacks

User privacy can be compromised by matching user data traces to records of their previous behavior. The matching of the statistical characteristics of traces to prior user behavior has been widely studied. However, an adversary can also identify a user deterministically by searching data traces for a pattern that is unique to that user. Our goal is to thwart such an adversary by applying small artificial distortions to data traces such that each potentially identifying pattern is shared by a large number of users. Importantly, in contrast to statistical approaches, we develop data-independent algorithms that require no assumptions on the model by which the traces are generated. By relating the problem to a set of combinatorial questions on sequence construction, we are able to provide provable guarantees for our proposed constructions. We also introduce data-dependent approaches for the same problem. The algorithms are evaluated on synthetic data traces and on the Reality Mining Dataset to demonstrate their utility.

cs.CR

Second order estimates for fully nonlinear elliptic equations with gradient terms on Hermitian manifolds

We derive a priori second order estimates for fully nonlinear elliptic equations which depend on the gradients of solutions in critical ways on Hermitian manifolds. The global estimates we obtained apply to an equation arising from a conjecture by Gauduchon which extends the Calabi conjecture; this was one of the original motivations to this work. We were also motivated by the fact that there had been increasing interests in fully nonlinear pde's from complex geometry in recent years, and aimed to develop general methods to cover as wide a class of equations as possible.

math.AP

The Dirichlet problem for fully nonlinear elliptic equations on Riemannian manifolds

We solve the Dirichlet problem for fully nonlinear elliptic equations on Riemannian manifolds under essentially optimal structure conditions, especially with no restrictions to the curvature of the underlying manifold and the second fundamental form of its boundary. The main result (Theorem 1.1) includes a new (and optimal) result in the Euclidean case. We introduce some new ideas and methods in deriving a priori estimates, which can be used to treat other types of fully nonlinear elliptic and parabolic equations on real or complex manifolds.

math.AP

Second order estimates for Hessian type fully nonlinear elliptic equations on Riemannian manifolds

We derive a priori estimates for second order derivatives of solutions to a wide calss of fully nonlinear elliptic equations on Riemannian manifolds. The equations we consider naturally appear in geometric problems and other applications such as optimal transportation. There are some fundamental assumptions in the literature to ensure the equations to be elliptic and that one can apply Evans-Krylov theorem once estimates up to second derivatives are derived. However, in previous work one needed extra assumptions which are more technical in nature to overcome various difficulties. In this paper we are able to remove most of these technical assumptions. Indeed, we derive the estimates under conditions which are almost optimal, and prove existence results for the Dirichlet problem which are new even for bounded domains in Euclidean space. Moreover, our methods can be applied to other types of nonlinear elliptic and parabolic equations, including those on complex manifolds.

math.AP

The Dirichlet Problem for a Complex Monge-Ampere Type Equation on Hermitian Manifolds

We are concerned with fully nonlinear elliptic equations on complex manifolds and search for technical tools to overcome difficulties in deriving a priori estimates which arise due to the nontrivial torsion and curvature, as well as the general (non-pseudoconvex) shape of the boundary. We present our methods, which work for more general equations, by considering a specific equation which resembles the complex Monge-Ampere equation in many ways but with crucial differences. Our work is motivated by recent increasing interests in fully nonlinear equations on complex manifolds from geometric problems.

math.AP

On a class of fully nonlinear elliptic equations on Hermitian manifolds

We derive a priori $C^2$ estimates for a class of complex Monge-Ampere type equations on Hermitian manifolds. As an application we solve the Dirichlet problem for these equations under the assumption of existence of a subsolution; the existence result, as well as the second order boundary estimates, is new even for bounded domains in $\bfC^n$.

math.AP

Second Order Estimates and Regularity for Fully Nonlinear Elliptic Equations on Riemannian Manifolds

We derive a priori second order estimates for solutions of a class of fully nonlinear elliptic equations on Riemannian manifolds under some very general structure conditions. We treat both equations on closed manifolds, and the Dirichlet problem on manifolds with boundary without any geometric restrictions to the boundary except being smooth and compact. As applications of these estimates we obtain results on regularity and existence.

math.AP

Interior curvature estimates and the asymptotic plateau problem in hyperbolic space

We show that for a very general class of curvature functions defined in the positive cone, the problem of finding a complete strictly locally convex hypersurface in $H^n+1$ satisfying $f(κ)=σ\in(0, 1)$ with a prescribed asymptotic boundary $Γ$ at infinity has at least one smooth solution with uniformly bounded hyperbolic principal curvatures. Moreover if $Γ$ is (Euclidean) starshaped, the solution is unique and also (Euclidean) starshaped while if $Γ$ is mean convex the solution is unique. We also show via a strong duality theorem that analogous results hold in De Sitter space. A novel feature of our approach is a "global interior curvature estimate".

math.DG

Hypersurfaces of constant curvature in Hyperbolic space

We show that for a very general and natural class of curvature functions, the problem of finding a complete strictly convex hypersurface satisfying f(κ) = σ over (0,1) with a prescribed asymptotic boundary Γ at infinity has at least one solution which is a "vertical graph" over the interior (or the exterior) of Γ. There is uniqueness for a certain subclass of these curvature functions and as σ varies between 0 and 1, these hypersurfaces foliate the two components of the complement of the hyperbolic convex hull of Γ.

math.AP