Searcharxiv⌕ Search

arXiv subjects

Chenwei Wang

Publications and source records attributed to Chenwei Wang.

At least 19 recordsLinked to original sources

Detection of 2 MeV spectral bump and ~40 MeV emission line from GRB 221009A

Gamma-ray bursts (GRBs) are the most energetic transients in the Universe, but prompt MeV--sub-GeV observations remain challenging with current gamma-ray observatories. Here, using unsaturated HEPP-H measurements on board CSES-01 and cross-calibrating with likewise unsaturated GECAM-C data, we reconstruct the continuous spectral evolution of GRB 221009A over 2--255 MeV. We identify an unusual spectral bump at $\sim$2 MeV in the first light-curve peak. We also confirm a narrow emission line whose energy decreases from $\sim$40 MeV following a $t^{-1}$ evolution, and whose flux shows a ``rise-then-fall'' profile, implying weak emission from the central jet. These findings hint that a magnetically dominated, central-empty jet exists in the BOAT.

astro-ph.HE↗

Characterizing Social Media Behavior under Limited Observability: Retweet Link Prediction and Multimodal Intention Recognition

Social-media behavior can be observed through both interaction structure and multimodal content, yet each view is often incomplete. We study two complementary tasks on separate datasets: predicting retweet links from an extremely sparse graph without node attributes, and generating user intentions from text-image posts with limited annotations. For link prediction, we use a leakage-controlled transductive protocol to compare GCN and GraphSAGE, classical topology heuristics, and three node-input designs. Across repeated runs, a GCN with compact degree and strength features achieves an average precision of 0.9243 and an MCC of 0.7051. Under joint edge-label corruption, topology-based GCNs retain strong ranking performance, whereas fixed-threshold MCC degrades substantially; adding fixed random node identifiers does not improve overall robustness. For intention recognition, we retain the MIKO framework and evaluate LoRA adaptation of three language models together with distribution-aware sampling based on Pearson correlation, cosine similarity, and KL divergence. Fine-tuning consistently improves lexical-overlap metrics, while distribution-aware sampling produces more uniform performance across intention types. Together, the two studies characterize who interacts and why users post when social-media observations are sparse, noisy, or limited.

cs.SI↗

Two Companion $q$-Series Identities and Their Combinatorics

In this paper, we evaluate two companion $q$-series recently suggested for investigation by Andrews and El Bachraoui in the concluding remarks of their work. From these evaluations, we derive the corresponding partition identities and give combinatorial proofs.

math.CO↗

ActMem-VLA: Action-History Memory with Dual-Expert Denoising for Long-Horizon Vision-Language-Action Policies

Vision-language-action (VLA) models have driven rapid progress in robotic manipulation, demonstrating strong fine-grained control and promising performance on long-horizon tasks. However, many existing VLAs lack explicit access to interaction history, making them vulnerable to perceptual aliasing: similar current observations and robot states at different task stages may induce action ambiguity and lower success rate. Existing methods incorporate temporal or progress cues through feature conditioning, action-prior modification, or sampling guidance. However, methods that jointly fine-tune memory modules and the base VLA incur additional policy-training costs, motivating the separation of trainable history-conditioned steering from frozen base-policy refinement. We propose ActMem-VLA, a dual-expert handover architecture that augments a frozen, fine-tuned VLA with a memory plugin comprising a Mamba-based memory module and a lightweight PreAction Expert (PAE). Specifically, Mamba encodes executed-action history into memory that conditions PAE alongside current context. With these inputs, PAE steers task progression during early, high-noise denoising, then passes the partially denoised action to the frozen Action Expert (AE) to refine action details during the remaining low-noise steps. The fine-tuned base VLA remains frozen throughout training, while only the Mamba module and PAE are jointly optimized. On LIBERO-Mem, ActMem-VLA achieves 80.8\% average success across all ten tasks, compared with 65.2\% for $π_{0.5}$ and 49.5\% for MemoryVLA, while introducing only 3.45\% additional parameters. Across four real-world tasks, it improves the average success rate over $π_{0.5}$ by 28.8\%.

cs.RO↗

From Benchmark to Deployment: Shift-Robust Fabric Recognition for Industrial Textile Onboarding

Automatically recognising a fabric's construction (jersey, twill, satin) is a bottleneck in textile sourcing, where incoming swatches are still typed by hand. Benchmark accuracy suggests the problem is solved, yet rarely survives deployment. On the \numClasses{}-class FabricFlow benchmark we expose three gaps that headline accuracy hides. First, a duplication audit reveals train/test leakage that inflates accuracy; we rebuild leakage-free splits that report the true difficulty. Second, on the clean data the binding failure is acquisition-source shift between catalogues, not the peripheral shortcuts one might fear: on an archive-exclusive hold-out, standard training holds 58.0\% Top-1 at a calibration error of 0.158, while a simple, architecture-agnostic central-texture recipe adds 13.5 Top-1 points and restores calibration. Third, because confusing one fabric family for another is costlier than a within-family slip, we optimise a taxonomic-severity cost: a confidence-gated routing policy auto-types confident swatches and refers only the uncertain minority to a human, sharply cutting onboarding cost. Throughout we report honest negatives: hierarchical classification, OCR fusion and zero-shot vision--language models all fail to help, yielding a concrete, calibrated, cost-aware recipe for deployable textile onboarding.

eess.SY↗

ReWeight: Leveraging Human Data for VLA Post-Training via Demonstration Retrieval and Sample Weighting

Post-training vision-language-action (VLA) models for specific robots and tasks requires in-domain demonstrations, yet collecting diverse robot data is costly. Egocentric human demonstrations provide a scalable alternative, but directly mixing human and robot data can introduce cross-embodiment discrepancies and degrade policy performance. To address this challenge, we introduce ReWeight, a framework that incorporates human data into VLA post-training through demonstration-level retrieval and sample-level weighting. ReWeight learns a cross-embodiment visuomotor representation that combines visual observations with future actions to measure behavioral similarity between human and robot demonstrations. Based on optimal transport, it retrieves human demonstrations relevant to the target robot data and assigns larger weights to samples with smaller cross-embodiment discrepancies. We evaluate ReWeight using $π_{0.5}$ across eight simulation tasks and four real-world tasks under both clean and randomized settings. In simulation, ReWeight improves the average success rate of post-trained $π_{0.5}$ from 39% with only robot data and 44% with randomly mixed human-robot data to 57%. In the physical experimental setting, it achieves an average success rate of 68.8%, outperforming the baselines by 28.8% and 13.8%, respectively. Overall, ReWeight provides an effective paradigm for transforming abundant egocentric human experience into transferable supervision for robot learning. (Project webpage: https://reweight-vla.github.io/)

cs.RO↗

Cost-Aware Vision--Language Model Arbitration for Fabric Structure Recognition A Deployable Multi-Agent System

Recognizing a fabric's structure is a prerequisite for translating textile-specific material information into structured digital form for downstream supply-chain systems. Pure CNN classifiers are cost-efficient but fail on visually ambiguous categories; vision--language models (VLMs) generalize more broadly but cost much more per image and are unstable on specialist domains. We present a multi-agent system in which a CNN cascade handles the easy majority and a VLM is invoked only as a selective arbiter, constrained to a top-3 taxonomy-consistent choice. The fabric taxonomy performs as a constraint for the whole recognition process to increase the accuracy and reduce the VLM calls. Meanwhile, the CNN cascade is distilled to a small parameter size to reduce the inference time and meet the needs of practical deployment. On a newly curated 14-class benchmark, a flat ConvNeXt-Tiny baseline reaches $90.45\,\%$ top-1 and $76.9\,\%$ on the four hardest classes; \method's hierarchical cascade reaches $93.94\,\%$ top-1 and $94.50\,\%$ hard ($+17.6$\,pp). Tightening the VLM trigger from $60\,\%$ to $<\!10\,\%$ cuts API cost by ${\sim}90\,\%$ with no measurable accuracy loss. CPU inference is $\le\!93$\,ms without a VLM call ($9.3$\,ms distilled). Each prediction carries a machine-readable reasoning record, offered as an entry point for future supply-chain documentation.

eess.IV↗

PPO-STGNN: A Proximal Policy Optimization Approach with Spatio-Temporal Graph Neural Networks for DAG Task Scheduling in Cloud-Edge-End Computing

With the rapid development of the Internet of Things, computation intensive directed acyclic graph (DAG) tasks have become increasingly common in cloud-edge-end collaborative environments. However, cloud, edge, and end nodes are highly heterogeneous in computing capacity, network bandwidth, and energy consumption, which makes the efficient scheduling of tasks with complex dependencies an NP-hard problem. Traditional heuristic algorithms and conventional reinforcement-learning methods often fail to capture the spatio-temporal dynamics of system resources. This paper proposes PPO-STGNN, a DAG task-scheduling algorithm that integrates proximal policy optimization (PPO) with spatio-temporal graph neural networks (STGNNs). The method uses an STGNN to extract features from both the DAG task topology and the physical cloud-edge-end resource graph, and then optimizes the scheduling policy through PPO to minimize makespan and schedule length ratio (SLR) while improving CPU and memory load balancing. To accelerate convergence, a multi-teacher behavior-cloning mechanism is introduced for pretraining. Experimental results show that PPO-STGNN significantly improves load balancing while maintaining a low completion time, making it suitable for dynamic and heterogeneous cloud-edge- end DAG scheduling scenarios.

cs.AI↗

Lightweight Soft X-ray Imager (LSXI) with glass-based coded mask

The coded mask technique has been widely used in X-ray and Gamma-ray imagers, especially in space astronomy. However, the traditional design of coded mask imagers usually has problems with large size and heavy weight. Here, we propose a novel design for a coded mask imager made of glass based on microchannel plate (MCP) technology, making it lightweight (within 1 kg), compact, and self-supporting, which is very suitable for space exploration satellites. The design is initially demonstrated by reconstructing encoded patterns from measurements at the X-ray beamline. Monte Carlo simulations of the module integrated into a 6U CubeSat are conducted to assess its in-orbit detector performance, including sensitivity and source localization.

astro-ph.IM↗

Pointing-VLA: Typed Spatial Grounding Interfaces for Vision-Language-Action Manipulation

Vision-language-action (VLA) models often expose spatial grounding through autoregressive text coordinates or opaque action tokens, creating brittle interfaces between multimodal reasoning and robot execution. We present Pointing-VLA, a typed hidden-state spatial readout built on Embodied-R1. Geometry-specific heads predict normalized points, object-functional grounding (OFG) heatmaps, and visual trajectories without serializing geometry as text. For the evaluated Bridge/WidowX and physical pick-place deployments, an explicit execution contract assigns PICK to source-conditioned OFG and PLACE to Pointing, providing direct stage-aligned spatial targets. Pointing-VLA achieves SOTA performance on Bridge/WidowX, averaging 72.9\% across the evaluated four-task set without Bridge-specific finetuning under collision-enabled CuRobo execution. Pointing and OFG show complementary strengths across native and cross-dataset evaluations. The OFG/contact readout transfers to NORA-1.5, preserving or improving success while reducing recorded controller time by more than 20$\times$; typed heads are also 6.68--6.90$\times$ faster than Embodied-R1 text decoding on a shared external suite. When integrated as spatial guidance for a $π_{0.5}$ action policy, Pointing-VLA raises autonomous real-robot success from 52.7\% to 80.7\% across three visual contexts. These results establish typed spatial readouts as an efficient, inspectable interface between embodied reasoning and robot execution.

cs.RO↗

Think Only When Needed: Prompt-Authority Control for Selective Slow-Path Intervention in Vision-Language-Action Manipulation

Retrieval can efficiently and effectively augment a frozen vision--language--action (VLA) policy without retraining, yet retrieved text becomes a control intervention once it enters the executed prompt. In a matched audit, raw appended text reduces mean success from 92.47\% to 3.00\%, while meaningful and length-matched meaningless appends both fail on all 500 states. This result identifies \emph{prompt-form collapse}: changing the instruction form, rather than adding useful semantics, can dominate execution. We introduce TOWN-VLA (Think Only When Needed), a prompt-authority interface that separates candidate generation from permission to alter the policy input. A fixed compatibility rule authorizes a canonical compact instruction; otherwise, the interface restores the original Base prompt exactly. Across 900 audited routes, every route follows this contract: 525 routes recover Base with matching hashes, and all 375 authorized prompts preserve the task signature. On a matched $4\times7$ LIBERO-Plus evaluation with 10{,}030 episodes per method, success rises from 69.5\% to 73.1\% ($+362$ episodes; 95\% CI 1.89--5.45 points), improving on six perturbation axes and all four suites. On a physical PiPER arm with a frozen \pizerofive{} checkpoint, success rises from 52.7\% to 78.7\% over 150 trials per method ($p=3.16\times10^{-6}$). Prompt authority is enforceable for a frozen controller; oracle-free admission calibration is the next deployment target.

cs.RO↗

Signed Counting on Restricted Partitions and Combinatorial Proofs of Three Identities

Signed enumerations of l-regular partitions by the parity of the number of parts are known to correspond to partitions with congruence conditions. Inspired by the recent combinatorial approaches of Ballantine-Merca and Liu for such identities, we provide combinatorial proofs of three identities for l-regular partitions and their variants. Two of these were originally established analytically by Hickerson and Robbins, respectively.

math.CO↗

MSTF-Net: A UAV-Oriented Multi-Spectral Video Segmentation Method via Modality-Robust, Scale-Adaptive, and Consistent Fusion

Multi-spectral video segmentation is essential for robust scene understanding in unmanned aerial vehicle (UAV) applications such as city planning, land use monitoring, traffic monitoring, and crowd estimation. While the fusion of RGB and thermal modalities offers complementary information for perception under varying lighting and visibility conditions, two fundamental challenges remain: (1) the modal fusion dilemma, arising from significant discrepancies between RGB and thermal features that obscure complementary cues, and (2) temporal variation, induced by rapid motion and viewpoint changes on UAV platforms, which leads to appearance inconsistency and misalignment across frames. To address these issues, this study proposed MSTF-Net, a modality-robust scale-adaptive fusion framework for multi-spectral video segmentation that effectively models cross-modal fusion and temporal consistency. The Modality Spatial Complementary Suppression and Enhancement (MSCSE) module generates unified instance queries via cross-modal attention and suppresses modality-specific noise using residual-guided discrepancy filtering and consistency constraints. To model temporal dynamics, the Multi-scale Temporal Cross-modality Semantic Consistency (MTCSC) module adaptively adjusts the temporal receptive field based on frame distance, capturing both coarse global context and fine local structure across time. Extensive ablation experiments on public RGB-T datasets demonstrate that MSTF-Net achieves state-of-the-art segmentation performance, especially under challenging conditions such as small targets, occlusion, and modality degradation. Specifically, reached 56.42\% mIoU on the MVSeg dataset and 51.80\% mIoU on the CART dataset, respectively.

eess.IV↗

GRB 250424A: A Case Study of Energy Injection with Multiwavelength Observations

We present a comprehensive multiwavelength analysis of the long-duration gamma-ray burst (GRB) 250424A. Our dataset spans from the prompt gamma-ray emission to late-time optical monitoring, including spectra obtained with the Keck 10\,m telescope. We find that the afterglow light curves display a prominent, simultaneous shallow decay phase in both X-ray and optical bands, followed by an achromatic transition to a standard decay regime. The broadband spectral energy distributions are well-modeled by a single power-law function, indicating a common synchrotron origin for the emission across frequencies. We interpret the afterglow evolution within the framework of a relativistic forward shock refreshed by continuous energy injection. This scenario successfully reproduces the observed temporal and spectral behavior, yielding an isotropic equivalent kinetic energy of $E_{\rm K,iso} \approx 5.5 \times 10^{52}$ erg and an injection index of $q\approx 0.34$ in a constant-density circumburst environment. The shallow decay phase is consistent with sustained energy injection lasting $\sim$ 9 ks. Despite the relatively low redshift, late-time optical observations reveal no distinct supernova component; however, our derived upper limits do not strictly rule out the presence of a typical GRB-associated supernova.

astro-ph.HE↗

Recover Cell Tensor: Diffusion-Equivalent Tensor Completion for Fluorescence Microscopy Imaging

Fluorescence microscopy (FM) imaging is a fundamental technique for observing live cell division, one of the most essential processes in the cycle of life and death. Observing 3D live cells requires scanning through the cell volume while minimizing lethal phototoxicity. That limits acquisition time and results in sparsely sampled volumes with anisotropic resolution and high noise. Existing image restoration methods, primarily based on inverse problem modeling, assume known and stable degradation processes and struggle under such conditions, especially in the absence of high-quality reference volumes. In this paper, from a new perspective, we propose a novel tensor completion framework tailored to the nature of FM imaging, which inherently involves nonlinear signal degradation and incomplete observations. Specifically, FM imaging with equidistant Z-axis sampling is essentially a tensor completion task under a uniformly random sampling condition. On one hand, we derive the theoretical lower bound for exact cell tensor completion, validating the feasibility of accurately recovering 3D cell tensor. On the other hand, we reformulate the tensor completion problem as a mathematically equivalent score-based generative model. By incorporating structural consistency priors, the generative trajectory is effectively guided toward denoised and geometrically coherent reconstructions. Our method demonstrates state-of-the-art performance on SR-CACO-2 and three real \textit{in vivo} cellular datasets, showing substantial improvements in both signal-to-noise ratio and structural fidelity.

eess.IV↗

CTransformer: Deep-transformer-based 3D cell membrane tracking with subcellular-resolved molecular quantification

Deep learning segmentation and fluorescence imaging techniques allow the cellular morphology of living embryos to be constructed spatiotemporally. These development processes involve numerous molecules distributed at the subcellular scale, such as cell adhesion (E-cadherin), which accumulate at cell-cell interfaces to regulate intercellular connection. However, quantifying molecular distributions within specific subcellular regions across the entire embryo, where cell movement and molecular redistribution occur rapidly, is challenging due to the need for simultaneous cell morphology reconstruction and lineage tracing due to photobleaching and phototoxicity. We report a transformer-based pipeline, CTransformer, that establishes a 4D cellular morphology map before the 550-cell (late) stage. CTransformer constructed 4D cellular morphology atlases, reaching 80% accuracy at the 550-cell stage. Through this advanced architecture, we use only one channel to reconstruct cell morphology and achieve cell tracing. With each cell's morphology as a reference, the distribution of specific molecules throughout the cell body and at cell interfaces can be quantitatively measured in another fluorescence channel. We apply this methodology to track E-cadherin during embryonic development of the worm Caenorhabditis elegans, from fertilization to gastrulation. Our results reveal that E-cadherin is tightly regulated across individual embryos, both within single cells and at cell-cell interfaces, displaying an anterior-posterior gradient and cell- and lineage-specific patterns. Furthermore, its spatiotemporal heterogeneity influences cell mechanics and embryonic morphogenesis, helping explain how C. elegans achieves stereotypical developmental patterns at cellular resolution.

physics.bio-ph↗

EP250207b is not a collapsar fast X-ray transient. Is it due to a compact object merger?

Fast X-ray Transients (FXTs) are short-lived extra-galactic X-ray sources. Recent progress through multi-wavelength follow-up of Einstein Probe discovered FXTs has shown that several are related to collapsars, which can also produce gamma-ray bursts (GRBs). In this paper we investigate the nature of the FXT EP250207b. The VLT/MUSE spectra of a nearby (15.9 kpc in projection) lenticular galaxy reveal no signs of recent star formation. If this galaxy is indeed the host, EP250207b lies at a redshift of z=0.082, implying a peak observed absolute magnitude for the optical counterpart of M_r=-14.5. At the time when supernovae (SNe) would peak, it is substantially fainter than all SN types. These results are inconsistent with a collapsar origin for EP250207b. The properties favour a binary compact object merger driven origin. The X-ray, optical and radio observations are compared with predictions of several types of extra-galactic transients, including afterglow and kilonova models. The data can be fit with a slightly off-axis viewing angle afterglow. However, the late-time (~30 day) optical/NIR counterpart is too bright for the afterglow and also for conventional kilonova models. This could be remedied if that late emission is due to a globular cluster or the core of a (tidally disrupted) dwarf galaxy. If confirmed, this would be the first case where the multi-wavelength properties of an FXT are found to be consistent with a compact object merger origin, increasing the parallels between FXTs and GRBs. We finally discuss if the source could originate in a higher redshift host galaxy.

astro-ph.HE↗

Align-Then-stEer: Adapting the Vision-Language Action Models through Unified Latent Guidance

Vision-Language-Action (VLA) models pre-trained on large, diverse datasets show remarkable potential for general-purpose robotic manipulation. However, a primary bottleneck remains in adapting these models to downstream tasks, especially when the robot's embodiment or the task itself differs from the pre-training data. This discrepancy leads to a significant mismatch in action distributions, demanding extensive data and compute for effective fine-tuning. To address this challenge, we introduce \textbf{Align-Then-stEer (\texttt{ATE})}, a novel, data-efficient, and plug-and-play adaptation framework. \texttt{ATE} first aligns disparate action spaces by constructing a unified latent space, where a variational autoencoder constrained by reverse KL divergence embeds adaptation actions into modes of the pre-training action latent distribution. Subsequently, it steers the diffusion- or flow-based VLA's generation process during fine-tuning via a guidance mechanism that pushes the model's output distribution towards the target domain. We conduct extensive experiments on cross-embodiment and cross-task manipulation in both simulation and real world. Compared to direct fine-tuning of representative VLAs, our method improves the average multi-task success rate by up to \textbf{9.8\%} in simulation and achieves a striking \textbf{32\% success rate gain} in a real-world cross-embodiment setting. Our work presents a general and lightweight solution that greatly enhances the practicality of deploying VLA models to new robotic platforms and tasks.

cs.RO↗