SearcharxivSearch

arXiv subjects

Peng Wang

Publications and source records attributed to Peng Wang.

At least 19 recordsLinked to original sources

The Cartan-Hadamard conjecture in dimension five

We show that the sharp Euclidean isoperimetric inequality holds for domains in complete simply connected Riemannian $5$-manifolds of nonpositive sectional curvature, which establishes the Cartan-Hadamard conjecture in that dimension. The main step is a sharp inequality for constant-mean-curvature hypersurfaces, proved via integrals over pairs of boundary points, in the spirit of Banchoff-Pohl, together with an estimate for Jacobi fields along geodesic chords. The inequality persists for boundaries of isoperimetric regions in geodesic balls, whose mean curvature is constant only on the free part. An isoperimetric-profile argument, after Kleiner, completes the proof. Our method also gives a new proof in dimension $3$.

math.DG

A Primal-Dual Formulation for Pricing Static Voltage Stability Services within a Unit Commitment Model

In modern power systems with high penetration of Inverter-Based Resources (IBR), most converters operate in Grid-Following (GFL) mode. Some buses exhibit inherently low Short-Circuit Ratios (SCRs), a property majorly shaped by network topology. The integration of GFL-IBR onto such weak buses thus demands attention to static voltage stability. To address this issue, market mechanisms have been proposed to incentivize generators to provide voltage stability services, such as commitment of synchronous generators for reducing the equivalent impedance at low SCR buses and adaptive reactive power support from GFL-IBR. To compute shadow prices for these services, previously proposed methods such as the `restricted' and `dispatchable' approaches may fail to guarantee operating cost recovery for voltage-stability service providers. As the resulting prices are determined purely from a social surplus maximization objective, the profitability of units is entirely overlooked. This suggests that new pricing methodologies are needed to satisfy cost-recovery requirements. Therefore, this paper proposes a pricing method based on a primal-dual formulation. Case studies demonstrate that the proposed method can consistently produce revenue-adequate shadow prices, enabling all participating units to recover their costs without supplementary uplift payments.

eess.SY

From Monolithic Blending to Agentic Orchestration: Dynamic Response for Conversational Assistants at Scale

Conversational assistants can blend retrieval, action selection, escalation, and wording in a single model path, or separate those roles. We report a production migration of a customer-support assistant at a large accommodation marketplace (millions of conversations per month, 11 languages, 10-second P90). Dynamic Response (DR) replaces a single Qwen3-235B-A22B blended responder with a bounded ReAct orchestrator over typed tools plus a smaller generator that writes from a backend-validated context contract. Because the migration also changed prompts, alignment, and serving, we attribute each effect to its cause and claim as architecture effects only those measured on identical replayed turns: typed entity selection moves the reservation selector to a precision-first operating point (precision 8.3% to 89.1%, recall 75.2% to 67.3%), and typed action IDs with a membership check remove observed structured-action hallucination (2.14% to 0.0%). A low-ramp A/B test reproduces the replay escalation reductions: hard-escalation responses fall from 5.60% to 3.08% and soft-escalation responses from 9.56% to 2.49%, while production handoff volume holds roughly steady; self-solve is directional (+5.1 points, 95% CI [-2, +12]). Serving optimizations cut orchestrator P90 latency from 3.87s to 2.24s on a GPU footprint reduced by roughly one-third, and self-hosting reduces estimated annual model-serving cost by more than an order of magnitude.

cs.AI

Terminal-Universe: Turning Agent Trajectories into Scalable Terminal Environments

As terminal-based code agents become prevalent, agent trajectories have accumulated at scale, while realistic, executable environments remain scarce. However, environments are what agent post-training actually requires: each can be re-queried into many verifiable tasks and provides execution feedback, whereas a trajectory is a single frozen demonstration. Rather than generating environments from scratch, we observe that the tool-execution history in existing trajectories exposes the structure and contents of the environments in which they ran, making it possible to reconstruct those environments from the trajectories themselves. Thus, we introduce Terminal-Universe, a framework which turns each trajectory into a reusable environment and explores it for synthesizing new tasks and continued interactions. Specifically, Terminal-Universe replays the file operations recorded in a trajectory to restore each file before the agent modified it, yielding a partial workspace; a completion agent then supplies the missing files and dependencies. On this recovered workspace, we both reconstruct the original intent task and synthesize entirely new ones. Besides, we also scale the tasks along two complementary axes: breadth and depth. For breadth, we mine directional dependency relations between related environments and synthesize cross-workspace queries spanning multiple codebases, as developers routinely do in real-world development. For depth, we extend the initial single-turn query into a multi-round session that captures iterative user feedback and requirement refinement via a user agent. Applied to public terminal agent trajectories, Terminal-Universe produces 37.3k task-sufficient environments. Supervised fine-tuning of Qwen3.5-27B on this corpus improves single-round performance on Terminal-Bench 2.1 by 11.9 points and multi-round performance on EvoCode-Bench v2 MT@4 by 13.8 points.

cs.AI

An algebraic proof of Colombo's difference-power determinant conjecture

Let $n\ge2$ be even, let $\lambda=(\lambda_1,\ldots,\lambda_n)\in\mathbb{R}^n$ have pairwise distinct coordinates, and define the difference-power matrix \[ A_d(\lambda) := \bigl[(\lambda_r-\lambda_s)^d\bigr]_{r,s=1}^n, \qquad d\in\mathbb{N}. \] In 1928, Colombo proved that $\det A_{n-1}(\lambda)\ne0$---and hence $\det A_{n-1}(\lambda)>0$---and that $\operatorname{rank} A_d(\lambda)=d+1$ for $0\le d<n-1$. He conjectured that \[ \det A_d(\lambda)\ne0 \qquad\text{for every } d\ge n-1. \] For even $d$, the conjectured nonsingularity follows from previously published results on distance-power matrices. The remaining open cases were therefore the supercritical odd exponents $d\ge n+1$. We prove nonsingularity for all these odd exponents, thereby completing Colombo's conjecture. Consequently, \[ \operatorname{rank} A_d(\lambda)=\min\{n,d+1\} \qquad(d\in\mathbb{N}). \] Our proof converts a hypothetical kernel vector into a real binary form having more projective real linear factors, counted with multiplicity, than its real Waring length permits.

cs.LG

Exact branch-transfer criterion for common-mode Thomson heat cancellation in thermoelectric couples

Thermoelectric p- and n-type legs are commonly paired by matching their Seebeck magnitudes, although a cooler responds to heat transported through its complete electrical and thermal network. We decompose the leg coefficients into differential thermopower $\alpha=S_p-S_n$ and common thermopower $M=(S_p+S_n)/2$. In a connected steady-state scalar thermoelectric network, a temperature-independent co-shift applied to every electrically active segment is an exact terminal null. A temperature-dependent perturbation of the legs relative to fixed leads is instead physical. At fixed current and shared isothermal endpoints, its first-order cold-port response is the action of $\Gamma_m=T\,dm/dT$ on the difference between the p- and n-branch oriented collection measures. We prove that every continuous $\Gamma_m$ cancels if and only if these measures are equal. In the constant-property, linear-common-mode limit, matching $R_i/K_i^{\rm leg}$ is sufficient and does not require identical legs. One- and two-dimensional calculations confirm the analytic reductions within their stated domains. For split thermal pads, the analysis gives the exact array law $\Delta Q_{c,\Sigma}=\sum_j C_jI_j\Delta T_{c,j}$ and, for series elements with isothermal hot pairs, $I\Delta V_\Sigma=-\Delta Q_{c,\Sigma}$. A representative seven-pair model gives corresponding increments of 7.87 mW and $-2.80$ mV. Branch transfer and endpoint topology therefore provide distinct material-pairing and device-test criteria for common-mode Thomson heat.

cond-mat.mtrl-sci

Giant bulk photovoltaic effect driven by interfacial symmetry breaking in MoS2/Ta2NiSe5 heterostructures

Van der Waals (vdW) heterostructures offer a versatile platform for engineering unconventional bulk photovoltaic (BPV) effect through interfacial symmetry breaking. However, the coexistence of multiple photophysical mechanisms, driven by structural complexity, spontaneous charge transfer, and strong interlayer coupling, often obscures the microscopic origin of the BPV response and hinders its rational optimization. Here, we demonstrate a pronounced BPV effect localized at the overlap region of a cross-bar MoS2/Ta2NiSe5 vdW heterostructure, where symmetry breaking induced by vertical stacking lifts the inversion center of MoS2. The orthogonal device geometry enables the independent probing of intralayer and interfacial photoresponse pathways, facilitating clear separation of competing mechanisms. Spontaneous interfacial charge transfer between MoS2 and Ta2NiSe5 further establishes a strong interlayer electronic coupling. By modulating the interlayer potential landscape through gate voltage and vertical electric fields, we achieve an optimized zero-bias photocurrent density of 247 A/cm2 and a BPV coefficient of 0.99 V-1. Supported by theoretical modelling, our results illustrate how minimalist device geometry can transform complex heterostructures into experimentally tractable platforms. This strategy paves the way for analyzing and optimizing interface-driven BPV effect, with implications for self-powered optoelectronics, broadband photodetection, and energy-harvesting nanodevices.

cond-mat.mes-hall

Group-Shared Low-Rank Approximation for Mobile-Efficient Pointwise Convolutions in Large-Kernel CNNs

Large-kernel Convolutional Neural Networks (CNNs) deliver remarkable performance in vision tasks by significantly expanding receptive fields, yet their quadratic parameter growth critically impedes storage-efficient edge deployment. While existing efficient architectures adopt parameter-efficient depthwise separable convolution backbones that leverage techniques like low-rank approximation and weight sharing to compress depthwise convolutions, we identify a critical oversight: pointwise convolutions dominate parameter volume (>87% in models like RepLKNet-31B) and constitute the primary deployment bottleneck on resource-constrained edge devices. This results in prohibitive storage costs and severe memory-loading constraints on resource-limited devices (e.g., smartphones with 4-12 GB Random Access Memory (RAM)). To overcome this, we propose Channel Group-Shared (CGS) low-rank approximation, a novel Singular Value Decomposition (SVD)-based parameter-sharing strategy. CGS constructs a structured low-rank paradigm isomorphic to SVD decomposition, comprising shared (high-parameter-cost) down/up-projection matrices across channel groups within a layer and channel-group-specific (low-parameter-cost) scalable diagonal matrices. This group-sharing design achieves significant parameter reduction. Extensive experiments demonstrate that large-kernel CNNs (RepLKNet, ConvNeXt, SLaK) enhanced with CGS strike an empirically favorable balance between competitive performance and substantially reduced storage costs. Crucially, by alleviating storage constraints, reducing memory bandwidth pressure during loading, and minimizing model loading latency, CGS enables the feasible deployment of pre-trained large-kernel CNN models on edge devices, thereby bridging the gap between high-performance vision models and practical edge deployment.

cs.LG

TAGR: Temporally Adaptive Generative Recommendation for Industrial Live-Streaming Advertising

Live-streaming advertising is an important monetization channel on short-video and e-commerce platforms, where rapidly changing live content, promoted products, and user feedback impose strong freshness requirements on recommendation models. Existing generative recommenders designed for static domains fail at three levels: static semantic IDs (SID) cannot track evolving live ads; single-scale behavior modeling misses shifting intent; preference optimization conflicts between fresh on-policy feedback and training stability. We propose TAGR, a generative recommendation framework with temporal adaptation at three levels: live-ad tokenization, user intent modeling, and preference alignment. At the token level, Live Semantic-Collaborative ID (LSID) periodically refreshes each active ad's SID based on its current live scene and promoted products, while retaining a stable hierarchical token vocabulary for autoregressive generation. At the intent level, Intent-Aware Generation (IAG) models live-room entry histories at multiple temporal granularities as the primary intent sequence, keeps auxiliary behaviors as separate inputs, and weights next-token prediction (NTP) using post-request intent evidence and business value. At the alignment level, Intermittent On-Policy Preference Optimization (IOPO) periodically samples fresh candidate groups from the current policy and performs behavior- and value-aligned preference updates interleaved with supervised NTP maintenance to preserve learned behavior distribution. Deployed on a large-scale e-commerce live-stream advertising platform, TAGR improves live-room entry and shopping-cart click rates by 8.5% and 7.4%, respectively, and achieves a 16.1% revenue lift over the production baseline. These results demonstrate the effectiveness and industrial viability of temporally adaptive generative recommendation for live-stream advertising.

cs.IR

Observational Evidence for the Kinematic Memory of Cosmic Filaments from Satellite Orbital Orientations

We present an observational study of the kinematic coherence between satellite orbital planes and the cosmic web. Using the SDSS DR12 galaxy sample combined with the Bisous filament catalogue, we investigate whether the orbital motion of satellites preserves the memory of filamentary accretion. For each satellite system, we define a projected orbital-normal vector using galaxy sky positions and line-of-sight velocity offsets. By measuring the angle $\theta$ between this vector and the local projected filament direction, we detect a distinctive preferred orientation: satellite orbital planes tend to contain or lie parallel to the filament axis. This signal deviates from the isotropic expectation at a high significance level of $12.8\sigma$. The strength of this kinematic connection depend strongly on environment and host properties. The preference for orbital planes to track the filament direction is most pronounced for groups in close distance to the filament spine and for more massive hosts. Conversely, at intermediate distances from the filament and at large group-centric radii, the signal reverses, indicating a tendency for orbital planes to be oriented perpendicular to the filament. Our findings provide direct observational evidence for the two-phase model of filamentary accretion, where a transition from initial perpendicular collapse toward the filament spine to subsequent parallel streamwise infall into dark matter haloes governs the orientation of satellite orbital angular momentum and galaxy spin. The observed transition may further trace the characteristic radial scale of filaments, offering a dynamical perspective on the internal structure and assembly of the cosmic filament.

astro-ph.GA

Whose readiness counts? Disagreement within and between sectors in perceived AI and robotics preparedness

AI and Industry 4.0 readiness assessments often summarise preparedness using a single score for an organisation, application domain or sector. Those summaries can conceal disagreement about the same technology and variation among applications grouped under one sector label. We test how much information is lost through this aggregation using a card-based survey in which 982 respondents provided 15,200 readiness evaluations across 17 named AI and robotics challenges. Readiness is perceived community preparedness and available resources, not personal willingness or audited organisational capability. Respondents frequently disagreed about identical challenges, with card-level readiness standard deviations of $1.03$-$1.26$ on a five-point scale. A crossed decomposition attributes 32.7% of observed variation to stable respondent differences, 7.3% to differences among challenges, and 60.0% to response-level variation that also contains measurement error. Differences among challenge-family means account for only about 2% of variation, with substantially more variation among people, applications and person-family judgements. Manufacturing has the highest mean readiness, yet shop-floor robotics, process-optimisation AI and general decision-support applications are judged differently. Computer-science and AI/ML respondents report higher readiness than non-technical respondents across challenge families, whereas engineering respondents do not report higher Manufacturing readiness. Sector rankings are therefore best used as portfolio summaries rather than evidence that an industry is uniformly ready or behind. Readiness reporting should retain application-level disagreement, disclose whose judgements form the average, and consider ethics, cyber security, literacy and capability needs without collapsing them into a single score.

cs.CY

From a Static Multi-Level Small Semantic Codebook to a Dynamic Single-Level Large Semantic Codebook for Generative Recommendation

Generative recommendation represents each item with a sequence of discrete Semantic IDs (SIDs) and predicts the sequence to retrieve the next item. Typical systems use multi-level residual quantization, which increases autoregressive decoding cost and creates a large hierarchical space that may be sparsely occupied. Static codebooks also become misaligned with current traffic as new items arrive and exposure distributions change. We propose a single-level large semantic codebook that replaces multiple residual semantic codes with one semantic token while retaining a separate collaborative disambiguation token to reduce item collisions. We further introduce an exposure-aware dynamic update mechanism based on temporal weight decay, exponential moving-average center updates, and an exposure-weighted penalty on SID changes. We also develop an offline evaluation framework covering representation quality, code utilization, cluster load, full-SID collision, and temporal stability. On two public datasets, the two-level SID improves mean Recall@10 by 5.0%-8.8% and mean NDCG@10 by 4.1%-5.1% for OneRec-V1, and by 7.1%-8.7% and 3.8%-8.5%, respectively, for OneRec-V2. Dynamic updating provides further gains on KuaiRec. Across three serving architectures, the shorter SID reduces estimated autoregressive-decoding FLOPs by 47.93%-48.70% and increases single-card QPS by 28.57%-47.0%. A five-day online A/B test serving 2.5% of production traffic improves the primary consumption metric by 0.792%.

cs.IR

Ready for What? Rethinking AI and Robotics Preparedness for Adoption and Policy

Efforts to accelerate AI and robotics adoption require evidence about where communities are ready to act and where support is still needed. Yet averages across stakeholder groups can obscure relationships that emerge when the same person evaluates different challenges. We analyse a repeated card-based survey in which 982 participants provided 15,200 evaluations of 17 AI and robotics challenges. Each challenge was rated on 1-5 measures of significance, complexity and readiness, where readiness refers to perceived community preparedness and available resources rather than personal competence or realised adoption. Because participants evaluated multiple challenges, the design separates stable between-person differences from challenge-specific within-person deviations. Within the same respondent, a challenge rated one point more complex than usual is associated with about 0.21 points lower readiness (p less than 0.001). By contrast, respondents who generally rate challenges as more complex do not systematically report lower readiness (p=0.29). Significance is positively associated with readiness, while unusually high complexity modestly weakens this alignment. These relationships vary across challenge families, and professional background remains associated with adjusted preparedness. On applied cards, confidence, trust and related perceptions add substantial information about readiness, including for held-out participants. For policymakers and organisations, averaging across stakeholders can hide challenge-specific barriers. Readiness assessments should preserve both differences between stakeholder groups and variation within the same stakeholders across challenges. Effective adoption and literacy strategies should ask not only who appears ready, but which challenges they find unusually difficult and whether the likely constraint concerns implementation, capability, assurance or resources.

cs.CY

Intent-Driven Situation Tracking for User-Centric Multi-Turn Agents

User-centric multi-turn agents must act on an evolving task situation shaped by changing user intents, accumulated tool-grounded facts, missing information, and execution constraints. Existing context-management methods improve the use of past interaction history, but rarely maintain an explicit situation state that separates grounded facts from task-state judgments. As a result, agents often need to infer fine-grained attributes, task dependencies, and constraint satisfaction implicitly from dialogue traces. We propose Intent-Driven Situation States (IDSS), a training-free framework that maintains an explicit situation state alongside the dialogue. IDSS parses tool returns into provenance-aware entities and attributes, tracks user intents, required variables, constraints, and execution status, and propagates new facts to task constraints to update action executability. This allows agents to avoid infeasible actions, advance dependent goals, and reuse relevant information without repeatedly searching raw history. Experiments on three interactive benchmarks across eight LLMs show that IDSS improves task completion, preference elicitation, and interaction efficiency, with clear gains on tasks involving multi-entity coordination, evolving user constraints, and constraint-aware replanning. Ablations and error analyses show that these improvements come from the interaction between fact persistence, intent-centered state tracking, and constraint modeling. These results suggest that explicit situation tracking offers an effective alternative to history-centric context management for reliable user-centric multi-turn agents.

cs.AI

Multi-tracer mass bias in matched cosmic voids from SDSS DR7 and the ELUCID constrained simulation

Cosmic voids provide a unique environment for studying the relationship between galaxies, subhaloes, and dark matter in the underdense Universe. Using the SDSS galaxy catalogue and the ELUCID constrained simulation, we establish an observationally anchored framework for measuring multi-tracer mass bias within matched cosmic voids. A sample of 102 matched void pairs is constructed to directly compare galaxy, subhalo, and dark matter mass distributions within an observationally constrained realisation of the local Universe. We find that both the galaxy-to-dark matter and subhalo-to-dark matter mass ratios decrease toward void centres, indicating that luminous and halo tracers become increasingly depleted relative to the underlying matter distribution in the deepest underdensities. In contrast, the galaxy-to-subhalo mass ratio exhibits substantially larger statistical uncertainties within the inner void regions ($r/R_{\rm v}\lesssim0.5$). By comparing measurements obtained using independent and common coordinate frameworks, we show that coordinate offsets contribute to the observed scatter but cannot fully account for the large uncertainties. The remaining uncertainty primarily arises from the severe scarcity of massive subhaloes ($\log_{10}(M_{\rm sub}/h^{-1}M_\odot)\ge11.8$) within void interiors, which greatly reduces the number of statistically valid measurements near void centres. Our results provide a direct measurement of multi-tracer mass bias in observationally constrained cosmic environments and highlight the fundamental statistical limitations of multi-tracer studies in extreme underdense regions.

astro-ph.CO

REATS: LLM Reasoning-based Ensemble Learning for Adaptive Time Series Forecasting

Due to the diversity of real-world time series, no single forecasting model consistently dominates across all samples. Ensemble learning addresses this by combining complementary model strengths, yet existing methods rely on fixed rules or black-box models based solely on numerical inputs, failing to leverage LLM reasoning for interpretable weighting decisions. We propose REATS, which leverages LLM reasoning capabilities as an intelligent ensemble router that jointly processes textual temporal pattern descriptions and numerical features to produce interpretable, sample-adaptive ensemble weights through chain-of-thought reasoning. To enable effective LLM-based ensembling, we study its key design choices and propose: (i) a structured input pipeline that transforms raw time series into hybrid textual--numerical representations with fixed token cost, enabling rule-based chain-of-thought construction without API dependency, augmented with retrieved similar-sample priors; (ii) a diverse multi-row weight supervision scheme coupled with a token-efficient percentage-table format that reduces numerical complexity and mitigates LLM hallucinations; and (iii) a two-stage fine-tuning framework combining SFT with GRPO, where a reciprocal reward mapping transforms the continuous unbounded MSE gap into bounded signals with amplified near-oracle sensitivity, addressing the uniform sensitivity and outlier-dominated advantage compression inherent in naive reward designs for regression-based GRPO. Experiments on eight benchmarks demonstrate that REATS outperforms competitive ensemble baselines while providing natural language explanations and demonstrating strong transfer learning and out-of-domain generalization to unseen candidate models.

cs.LG

MEC-Patch: Visible-Infrared Cross-Modal Adversarial Attack Driven by Intrinsic Material Emissivity Laws

With the widespread deployment of visible-infrared multimodal perception systems in safety-critical domains such as autonomous driving, evaluating their cross-modal adversarial robustness has become increasingly vital. However, existing approaches exhibit significant limitations in approximating the intrinsic laws of imaging. Most studies either focus on a single modality, failing to bypass cross-modal verification, or simplify infrared modeling into heuristic pixel-intensity distributions, neglecting the impact of ambient temperature fluctuations on adversarial stability. To bridge this gap, this paper proposes MEC-Patch, a cross-modal adversarial attack framework driven by intrinsic physical laws. By leveraging the Stefan-Boltzmann Law, we establish a physics-grounded cross-spectral mapping that explicitly links material emissivity to thermal radiation. Building on this formulation, we reveal that, under a fixed emissivity distribution, ambient temperature variations induce consistent global scaling while preserving relative emissivity-induced contrast. We exploit this property to construct temperature-robust adversarial perturbations whose discriminative patterns remain stable in the infrared modality, thereby fundamentally mitigating environmental sensitivity. Furthermore, we employ the physics-constrained NSGA-II algorithm to synergistically optimize the material-distribution-based patch parameters effective across both modalities, while enhancing generalization through a Dynamic Adversarial Resampling (DAR) strategy. Experimental results demonstrate that MEC-Patch effectively deceives state-of-the-art multimodal detectors and exhibits high robustness within high-fidelity, physically-consistent, and multi-scene simulation environments. This research provides a physical-law-driven perspective for the security assessment of multimodal perception systems.

cs.MM

Teaching MLLMs to Say No: Generalized Referring Expression Comprehension via Refusal Calibrated GRPO

We tackle the challenging yet underexplored task of Generalized Referring Expression Comprehension (GREC), which requires a model to localize the object described by a textual expression when it exists (positive sample) and to refuse output when it does not (negative sample). Although Multimodal Large Language Models (MLLMs) excel at localizing existing objects, they often fail to reject nonexistent ones due to the absence of negative samples during training, producing hallucinated bounding boxes. Existing post-training approaches such as supervised fine-tuning (SFT) and reinforcement learning (RL) enhance refusal behavior but usually degrade localization accuracy on positive samples, undermining the model's core competence. To address this, we propose Refusal-Calibrated Group Relative Policy Optimization (RC-GRPO), a calibrated RL strategy that strengthens the refusal ability of MLLMs while preserving localization performance. It enforces "None" outputs in rollouts for valid advantage estimation on negative samples and applies a penalty to prevent over-refusal on positives, achieving a balanced trade-off between accuracy and reliability. A second-stage reasoning reinforcement further consolidates causal understanding and interpretability. Experiments on three GREC benchmarks demonstrate that RC-GRPO attains superior localization accuracy while maintaining strong refusal capability.

cs.CV