Searcharxiv⌕ Search

arXiv subjects

Yitian Wang

Publications and source records attributed to Yitian Wang.

11 recordsLinked to original sources

HamFormer: A Hamiltonian Flow-based SE(3)-Transformer for Conformation Optimization

The Transformer architecture plays a central role in modern deep learning, and its SE(3)-equivariant variants have been widely applied to molecular conformation modeling and optimization. Given its importance, many methods attempt to interpret and improve the Transformer through the lens of dynamics. However, they mainly focus on a single attention head rather than the full Transformer architecture and seldom consider SE(3)-equivariance in their proposed models. In this study, we propose an improved SE(3)-Transformer architecture, called HamFormer, which revisits the design of SE(3)-Transformer through the lens of Hamiltonian flow. In particular, we define a parametrized Hamiltonian flow in the phase space of position and velocity, corresponding to optimizing an energy functional that combines an optimal transport-based potential with a damped momentum. The Lie-Trotter splitting framework of the Hamiltonian flow leads to the proposed HamFormer architecture, whose feedforward computation achieves the optimization step of the proposed energy functional. Furthermore, we combine HamFormer with Equivariant Graph Neural Network (EGNN), build a new model for molecular conformation optimization. Extensive experiments on molecular ground-state conformation prediction show that HamFormer provides a strong and physically interpretable surrogate for classic SE(3)-Transformer and generally outperforms state-of-the-art competitors.

cs.LG↗

Well-posedness for $p(x)$-Laplacian parabolic equations under a multiple-regime setting on an annulus

This paper proposes an energy-variational framework for the well-posedness of the initial boundary value problem of the parabolic equation with variable exponents on an annulus, under the multiple-regime setting consisting of the subcritical, critical and supercritical regimes of the variable exponents. The multiple-regime setting leads to the appearance of the critical and supercritical regions of positive measure, which cause the failure of the classical Sobolev embedding and the lack of compactness. To address the challenges posed by multiple regimes to well-posedness within the energy framework, we recover the compact Sobolev embedding for a class of radially symmetric functions by the Strauss inequality and obtain the local existence of the solution via the combination of the subdifferential technique and the Principle of Symmetric Criticality for any given radially symmetric initial data. Additionally, the uniqueness result is also given with the recovered Sobolev embedding. Moreover, examining the impact on well-posedness of solutions caused by the variable exponents crossing three sensitive regions, we establish a variational structure of the potential well theory for the evolution equation under the multiple-regime setting on the annulus. For subcritical and critical initial energy levels, we consider the non-positive and positive initial energy cases separately. We obtain the finite-time blow-up of the solution with non-positive initial energy and the threshold condition for global existence and finite-time blow-up of the solution with positive initial energy. For supercritical initial energy level, several sufficient criteria for the global existence and finite-time blow-up of the solution are given. Finally, the above results, including global existence and finite-time blow-up, are generalized to a more general locally symmetric domain containing an annulus.

math.AP↗

DC-Flow: Target-Conditioned Cyclic Peptide Design via Delayed-Coupling Flow Matching

Target-conditioned cyclic peptide design requires coordinating interfacial side chains with macrocyclic closure. Existing end-to-end generators concurrently update geometric and chemical variables from noise, assigning residues to disordered coordinates. Meanwhile, predictor-assisted workflows often get stuck in local traps because they lack feedback in the propose-and-filter stage and ignore 3D structural proposals during sequence search. To overcome the drawbacks of these two paradigms, we propose DC-FLOW, a staged generative framework built around Delayed-Coupling Flow Matching. In principle, DC-FLOW postpones sequence and side-chain activation until a target-conditioned backbone takes shape, resolving structural ambiguity before chemical assignment. Then, it feeds delayed activations back into the backbone, achieving co-evolution of backbone geometry and emerging residue identities by coupling their flows. This mechanism enables more reliable macrocyclic closure and favorable interface packing. For predictor-assisted workflows, DC-FLOW supplies 3D proposals with in-trajectory guidance, enabling cascaded test-time scaling to prune redundant backbones and terminate unpromising refinement early. Extensive experiments show that DC-FLOW improves cyclization fidelity, diversity, and interface energetics, substantially increasing the yield of confident cyclic peptide binders under a fixed final-candidate budget. Our code is available at https://github.com/mianqiu00/DCFlow.

cs.LG↗

MuCO: Generative Peptide Cyclization Empowered by Multi-stage Conformation Optimization

Modeling peptide cyclization is critical for the virtual screening of candidate peptides with desirable physical and pharmaceutical properties. This task is challenging because a cyclic peptide often exhibits diverse, ring-shaped conformations, which cannot be well captured by deterministic prediction models derived from linear peptide folding. In this study, we propose MuCO (Multi-stage Conformation Optimization), a generative peptide cyclization method that models the distribution of cyclic peptide conformations conditioned on the corresponding linear peptide. In principle, MuCO decouples the peptide cyclization task into three stages: topology-aware backbone design, generative side-chain packing, and physics-aware all-atom optimization, thereby generating and optimizing conformations of cyclic peptides in a coarse-to-fine manner. This multi-stage framework enables an efficient parallel sampling strategy for conformation generation and allows for rapid exploration of diverse, low-energy conformations. Experiments on the large-scale CPSea dataset demonstrate that MuCO significantly and consistently outperforms state-of-the-art methods in physical stability, structural diversity, secondary structure recovery, and computational efficiency, making it a promising computational tool for exploring and designing cyclic peptides. The demo of the proposed method can be found at https://github.com/mianqiu00/MuCO.

q-bio.BM↗

Systematizing Blockchain Research Themes and Design Patterns: Insights from the University Blockchain Research Initiative (UBRI)

The rapid expansion of blockchain and digital asset ecosystems has intensified the challenge of translating academic research into deployable systems and regulatory frameworks. While advances in cryptography, consensus, digital assets, and governance are substantial, institutional mechanisms that sustain research-to-deployment translation at ecosystem scale remain comparatively under-theorized. This paper examines the architectural and coordination patterns that enable such translation, using the University Blockchain Research Initiative (UBRI) network as a representative case of long-term academic and industry collaboration. Drawing on research outputs and convenings from 2022 to 2025, we synthesize recurring design tensions across technical and institutional domains, including scalability versus security, decentralization versus governance, and privacy versus compliance. Rather than cataloging individual projects, we abstract system-level themes that connect research contributions to deployment constraints and policy adaptation, providing a structured lens for understanding how academic research informs production architectures, regulatory development, and ecosystem resilience in emerging decentralized infrastructures.

cs.DC↗

Enshrined Proposer Builder Separation in the presence of Maximal Extractable Value

In blockchain systems operating under the Proof-of-Stake (PoS) consensus mechanism, fairness in transaction processing is essential to preserving decentralization and maintaining user trust. However, with the emergence of Maximal Extractable Value (MEV), concerns about economic centralization and content manipulation have intensified. To address these vulnerabilities, the Ethereum community has introduced Proposer Builder Separation (PBS), which separates block construction from block proposal. Later, enshrined Proposer Builder Separation (ePBS) was also proposed in EIP-7732, which embeds PBS directly into the Ethereum consensus layer. Our work identifies key limitations of ePBS by developing a formal framework that combines mathematical analysis and agent-based simulations to evaluate its auction-based block-building mechanism, with particular emphasis on MEV dynamics. Our results reveal that, although ePBS redistributes responsibilities between builders and proposers, it significantly amplifies profit and content centralization: the Gini coefficient for profits rises from 0.1749 under standard PoS without ePBS to 0.8358 under ePBS. This sharp increase indicates that a small number of efficient builders capture most value via MEV-driven auctions. Moreover, 95.4% of the block value is rewarded to proposers in ePBS, revealing a strong economic bias despite their limited role in block assembly. These findings highlight that ePBS exacerbates incentives for builders to adopt aggressive MEV strategies, suggesting the need for future research into mechanism designs that better balance decentralization, fairness, and MEV mitigation.

cs.DC↗

Disco Intelligent Omni-Surfaces: 360-degree Fully-Passive Jamming Attacks

Intelligent omni-surfaces (IOSs) with 360-degree electromagnetic radiation significantly improves the performance of wireless systems, while an adversarial IOS also poses a significant potential risk for physical layer security. In this paper, we propose a "DISCO" IOS (DIOS) based fully-passive jammer (FPJ) that can launch omnidirectional fully-passive jamming attacks. In the proposed DIOS-based FPJ, the interrelated refractive and reflective (R&R) coefficients of the adversarial IOS are randomly generated, acting like a "DISCO" that distributes wireless energy radiated by the base station. By introducing active channel aging (ACA) during channel coherence time, the DIOS-based FPJ can perform omnidirectional fully-passive jamming without neither jamming power nor channel knowledge of legitimate users (LUs). To characterize the impact of the DIOS-based PFJ, we derive the statistical characteristics of DIOS-jammed channels based on two widely-used IOS models, i.e., the constant-amplitude model and the variable-amplitude model. Consequently, the asymptotic analysis of the ergodic achievable sum rates under the DIOS-based omnidirectional fully-passive jamming is given based on the derived stochastic characteristics for both the two IOS models. Based on the derived analysis, the omnidirectional jamming impact of the proposed DIOS-based FPJ implemented by a constant-amplitude IOS does not depend on either the quantization number or the stochastic distribution of the DIOS coefficients, while the conclusion does not hold on when a variable-amplitude IOS is used. Numerical results based on one-bit quantization of the IOS phase shifts are provided to verify the effectiveness of the derived theoretical analysis. The proposed DIOS-based FPJ can not only launch omnidirectional fully-passive jamming, but also improve the jamming impact by about 55% at 10 dBm transmit power per LU.

eess.SP↗

DiffuserLite: Towards Real-time Diffusion Planning

Diffusion planning has been recognized as an effective decision-making paradigm in various domains. The capability of generating high-quality long-horizon trajectories makes it a promising research direction. However, existing diffusion planning methods suffer from low decision-making frequencies due to the expensive iterative sampling cost. To alleviate this, we introduce DiffuserLite, a super fast and lightweight diffusion planning framework, which employs a planning refinement process (PRP) to generate coarse-to-fine-grained trajectories, significantly reducing the modeling of redundant information and leading to notable increases in decision-making frequency. Our experimental results demonstrate that DiffuserLite achieves a decision-making frequency of 122.2Hz (112.7x faster than predominant frameworks) and reaches state-of-the-art performance on D4RL, Robomimic, and FinRL benchmarks. In addition, DiffuserLite can also serve as a flexible plugin to increase the decision-making frequency of other diffusion planning algorithms, providing a structural design reference for future works. More details and visualizations are available at https://diffuserlite.github.io/.

cs.AI↗

Research on Stable Obstacle Avoidance Control Strategy for Tracked Intelligent Transportation Vehicles in Non-structural Environment Based on Deep Learning

Existing intelligent driving technology often has a problem in balancing smooth driving and fast obstacle avoidance, especially when the vehicle is in a non-structural environment, and is prone to instability in emergency situations. Therefore, this study proposed an autonomous obstacle avoidance control strategy that can effectively guarantee vehicle stability based on Attention-long short-term memory (Attention-LSTM) deep learning model with the idea of humanoid driving. First, we designed the autonomous obstacle avoidance control rules to guarantee the safety of unmanned vehicles. Second, we improved the autonomous obstacle avoidance control strategy combined with the stability analysis of special vehicles. Third, we constructed a deep learning obstacle avoidance control through experiments, and the average relative error of this system was 15%. Finally, the stability and accuracy of this control strategy were verified numerically and experimentally. The method proposed in this study can ensure that the unmanned vehicle can successfully avoid the obstacles while driving smoothly.

cs.RO↗

A categorification for the signed chromatic polynomial

By coloring a signed graph by signed colors, one obtains the signed chromatic polynomial of the signed graph. For each signed graph we construct graded cohomology groups whose graded Euler characteristic yields the signed chromatic polynomial of the signed graph. We show that the cohomology groups satisfy a long exact sequence which corresponds to signed deletion-contraction rule. This work is motivated by Helme-Guizon and Rong's construction of the categorification for the chromatic polynomial of unsigned graphs.

math.CO↗

SAMSON: Spectral Absorption-fluorescence Microscopy System for ON-site-imaging of algae

This paper presents SAMSON, a Spectral Absorption-fluorescence Microscopy System for ON-site-imaging of algae within a water sample. Designed to be portable and low-cost for on-site use, the optical sub-system of SAMSON consists of a mixture of low-cost optics and electronics, designed specifically to capture both fluorescent and absorption responses from a water sample. The graphical user interface (GUI) sub-system of SAMSON was designed to enable flexible visualisation of algae in the water sample in real-time, with the ability to perform fine-grained exposure control and illumination wavelength selection. We demonstrate SAMSON's capabilities by equipping the system with two fluorescent illumination sources and seven absorption illumination sources to enable the capture of multispectral data from six different algae species (three from the Cyanophyta phylum (blue-green algae) and three from the Chlorophyta phylum (green algae)). The key benefit of SAMSON is the ability to perform rapid acquisition of fluorescence and absorption data at different wavelengths and magnification levels, thus opening the door for machine learning methods to automatically identify and enumerate different algae in water samples using this rich wealth of data.

physics.ins-det↗