SearcharxivSearch

arXiv subjects

Honghao Gao

Publications and source records attributed to Honghao Gao.

15 recordsLinked to original sources

Isomorphism in the augmentation category

Given a Legendrian submanifold in any dimension, we prove that two augmentations are isomorphic within the positive augmentation category exactly when they differ by a combination of a dga homotopy and a dilation. This extends the corresponding statement for Legendrian knots and links, but instead of relying on the dga for consistent copies, we make use of quantum flow tree techniques. Consequently, we can strengthen and clarify a result of the first author as follows: for knot contact homology, the augmentation category is not in general equivalent to the microlocal rank 1 sheaf category.

math.SG

A Lagrangian filling for every cluster seed

We show that each cluster seed in the augmentation variety is inhabited by an embedded exact Lagrangian filling. This resolves the matter of surjectivity of the map from Lagrangian fillings to cluster seeds. The main new technique to produce these Lagrangian fillings is the construction and study of a quiver with potential associated to curve configurations. We prove that its deformation space is trivial and show how to use it to manipulate Lagrangian fillings with $\mathbb{L}$-compressing systems via Lagrangian disk surgeries.

math.SG

TWIN-GPT: Digital Twins for Clinical Trials via Large Language Model

Clinical trials are indispensable for medical research and the development of new treatments. However, clinical trials often involve thousands of participants and can span several years to complete, with a high probability of failure during the process. Recently, there has been a burgeoning interest in virtual clinical trials, which simulate real-world scenarios and hold the potential to significantly enhance patient safety, expedite development, reduce costs, and contribute to the broader scientific knowledge in healthcare. Existing research often focuses on leveraging electronic health records (EHRs) to support clinical trial outcome prediction. Yet, trained with limited clinical trial outcome data, existing approaches frequently struggle to perform accurate predictions. Some research has attempted to generate EHRs to augment model development but has fallen short in personalizing the generation for individual patient profiles. Recently, the emergence of large language models has illuminated new possibilities, as their embedded comprehensive clinical knowledge has proven beneficial in addressing medical issues. In this paper, we propose a large language model-based digital twin creation approach, called TWIN-GPT. TWIN-GPT can establish cross-dataset associations of medical information given limited data, generating unique personalized digital twins for different patients, thereby preserving individual patient characteristics. Comprehensive experiments show that using digital twins created by TWIN-GPT can boost the clinical trial outcome prediction, exceeding various previous prediction approaches.

cs.LG

Augmentations, Fillings, and Clusters

We investigate positive braid Legendrian links via a Floer-theoretic approach and prove that their augmentation varieties are cluster K2 (aka. A-) varieties. Using the exact Lagrangian cobordisms of Legendrian links in [EHK16], we prove that a large family of exact Lagrangian fillings of positive braid Legendrian links correspond to cluster seeds of their augmentation varieties. We solve the infinite-filling problem for positive braid Legendrian links; i.e., whenever a positive braid Legendrian link is not of type ADE, it admits infinitely many exact Lagrangian fillings up to Hamiltonian isotopy.

math.SG

An Efficient Dynamic Multi-Sources To Single-Destination (DMS-SD) Algorithm In Smart City Navigation Using Adjacent Matrix

Dijkstra's algorithm is one of the most popular classic path planning algorithms, achieving optimal solutions across a wide range of challenging tasks. However, it only calculates the shortest distance from one vertex to another, which is hard to directly apply to the Dynamic Multi-Sources to Single-Destination (DMS-SD) problem. This paper proposes a modified Dijkstra algorithm to address the DMS-SD problem, where the destination can be dynamically changed. Our method deploys the concept of Adjacent Matrix from Floyd's algorithm and achieves the goal with mathematical calculations. We formally show that all-pairs shortest distance information in Floyd's algorithm is not required in our algorithm. Extensive experiments verify the scalability and optimality of the proposed method.

cs.DS

Augmentations and link group representations

We construct the augmentation representation. It is a representation of the fundamental group of the link complement associated to an augmentation of the framed cord algebra. This construction connects representations of two link invariants of different types. We also study properties of the augmentation representation.

math.GT

Infinitely many Lagrangian fillings

We prove that all maximal-tb Legendrian torus links (n,m) in the standard contact 3-sphere, except for (2,m),(3,3),(3,4) and (3,5), admit infinitely many Lagrangian fillings in the standard symplectic 4-ball. This is proven by constructing infinite order Lagrangian concordances which induce faithful actions of the modular group PSL(2,Z) and the mapping class group M(0,4) into the coordinate rings of algebraic varieties associated to Legendrian links. Our results imply that there exist Lagrangian concordance monoids with subgroups of exponential-growth, and yield Stein surfaces homotopic to a 2-sphere with infinitely many distinct exact Lagrangian surfaces of higher-genus. We also show that there exist infinitely many satellite and hyperbolic knots with Legendrian representatives admitting infinitely many exact Lagrangian fillings.

math.SG

D-Former: A U-shaped Dilated Transformer for 3D Medical Image Segmentation

Computer-aided medical image segmentation has been applied widely in diagnosis and treatment to obtain clinically useful information of shapes and volumes of target organs and tissues. In the past several years, convolutional neural network (CNN) based methods (e.g., U-Net) have dominated this area, but still suffered from inadequate long-range information capturing. Hence, recent work presented computer vision Transformer variants for medical image segmentation tasks and obtained promising performances. Such Transformers model long-range dependency by computing pair-wise patch relations. However, they incur prohibitive computational costs, especially on 3D medical images (e.g., CT and MRI). In this paper, we propose a new method called Dilated Transformer, which conducts self-attention for pair-wise patch relations captured alternately in local and global scopes. Inspired by dilated convolution kernels, we conduct the global self-attention in a dilated manner, enlarging receptive fields without increasing the patches involved and thus reducing computational costs. Based on this design of Dilated Transformer, we construct a U-shaped encoder-decoder hierarchical architecture called D-Former for 3D medical image segmentation. Experiments on the Synapse and ACDC datasets show that our D-Former model, trained from scratch, outperforms various competitive CNN-based or Transformer-based segmentation models at a low computational cost without time-consuming per-training process.

cs.CV

Augmentations and sheaves for links

We study the relation between augmentations and sheaves in the context of framed oriented links. In this set up, we find slightly more sheaves than augmentations. After removing the sporadic sheaves, we construct a bijective correspondence between augmentations of the framed cord algebra and simple sheaves that are micro-supported along the conormal bundle of the link.

math.SG

Non-fillable augmentations of twist knots

We establish new examples of augmentations of Legendrian twist knots that cannot be induced by orientable Lagrangian fillings. To do so, we use a version of the Seidel-Ekholm-Dimitroglou Rizell isomorphism with local coefficients to show that any Lagrangian filling point in the augmentation variety of a Legendrian knot must lie in the injective image of an algebraic torus with dimension equal to the first Betti number of the filling. This is a Floer-theoretic version of a result from microlocal sheaf theory. For the augmentations in question, we show that no such algebraic torus can exist.

math.SG

Com-DDPG: A Multiagent Reinforcement Learning-based Offloading Strategy for Mobile Edge Computing

The development of mobile services has impacted a variety of computation-intensive and time-sensitive applications, such as recommendation systems and daily payment methods. However, computing task competition involving limited resources increases the task processing latency and energy consumption of mobile devices, as well as time constraints. Mobile edge computing (MEC) has been widely used to address these problems. However, there are limitations to existing methods used during computation offloading. On the one hand, they focus on independent tasks rather than dependent tasks. The challenges of task dependency in the real world, especially task segmentation and integration, remain to be addressed. On the other hand, the multiuser scenarios related to resource allocation and the mutex access problem must be considered. In this paper, we propose a novel offloading approach, Com-DDPG, for MEC using multiagent reinforcement learning to enhance the offloading performance. First, we discuss the task dependency model, task priority model, energy consumption model, and average latency from the perspective of server clusters and multidependence on mobile tasks. Our method based on these models is introduced to formalize communication behavior among multiple agents; then, reinforcement learning is executed as an offloading strategy to obtain the results. Because of the incomplete state information, long short-term memory (LSTM) is employed as a decision-making tool to assess the internal state. Moreover, to optimize and support effective action, we consider using a bidirectional recurrent neural network (BRNN) to learn and enhance features obtained from agents' communication. Finally, we simulate experiments on the Alibaba cluster dataset. The results show that our method is better than other baselines in terms of energy consumption, load status and latency.

cs.DC

Simple Sheaves for Knot Conormals

We classify the simple sheaves microsupported along the conormal bundle of a knot. We also establish a correspondence between simple sheaves up to local systems and augmentations, explaining the underlying reason why knot contact homology representations detect augmentations.

math.GT

Radon Transform for Sheaves

We define the Radon transform functor for sheaves and prove that it is an equivalence after suitable microlocal localizations. As a result, the sheaf category associated to a Legendrian is invariant under the Radon transform. We also manage to place the Radon transform and other transforms in microlocal sheaf theory altogether in a diagram.

math.SG

Spherical Tiling by 12 Congruent Pentagons

The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this paper, we classify the simplest case, which is the edge-to-edge tilings of the 2-dimensional sphere by 12 congruent pentagons. We find one major class allowing two independent continuous parameters and four classes of isolated examples. The classification is done by first separately classifying the combinatorial, edge length, and angle aspects, and then combining the respective classifications together.

math.CO