跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+101新增 AI 导读

arXiv 最近完成扫描:2026-11-14 23:29 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 00:12 — 2026-11-15 00:12(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-14 23:29最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 104 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-14 23:28(北京时间)
新论文 · v1arXiv:2611.17284

增强型混合电视服务:西班牙消费者的习惯、偏好、意见与期望

Augmented Hybrid TV Services. Habits, Preferences, Opinions and Expectations of Spanish Consumers

Fernando Boronat, Bernat Roig, Enric Sigalat, Santiago J. Flores

AI 速读 基于摘要

该研究提出“增强型混合电视服务”概念,并通过西班牙626名用户的调查,评估五个代表性用例的感知有用性与接受意愿。

cs.MM · cs.ET

查看原文摘要

The convergence of hybrid broadcast and broadband delivery, companion devices, and immersive technologies enables new forms of interactive, personalized, and accessible TV services. This paper introduces the concept of Augmented Hybrid TV services and presents an exploratory user requirements and preliminary acceptance assessment for 5 representative use cases. They were selected through an exploratory stakeholder consultation and 3 co-design workshops with audiovisual professionals and participants from organizations supporting people with visual or hearing impairments. They combine conventional TV with complementary content delivered to connected devices, including AR/VR HMD. They were subsequently evaluated through a cross-sectional CAWI survey of 626 Internet and connected TV users in Spain. Each participant viewed standardized video demonstrations of 2 randomly assigned cases and assessed their perceived usefulness, anticipated benefits/limitations, and interest in them. The results show substantial interest across all five use cases, ranging from 64.7% to 76.9%. Adaptive and personalized augmented subtitles received the highest level of interest and were particularly valued for their accessibility, language-learning, and personalization benefits. Immersive services involving complementary AR content, virtual screens, 3D objects, and 360 video were also evaluated positively, although participants identified device cost, ergonomics, connectivity, usability, and synchronization as anticipated limitations. The findings provide user-centered evidence that can inform the prioritization, design, and subsequent prototype-based evaluation of standards-compliant Augmented Hybrid TV services. Because the study assessed video-based scenarios rather than functional systems, the results represent perceived usefulness and stated interest rather than observed adoption or technically validated QoE.

新论文 · v1arXiv:2611.17097

Broadcast, Don't Replicate: Eliminating Weight HBM in Datacenter LLM Serving

Hannah Atmer, Yuan Yao, Thiemo Voigt, Stefanos Kaxiras

原文摘要

Large language model (LLM) inference at datacenter scale is fundamentally bottlenecked by memory capacity and bandwidth limits. Because model weights are read-only and identical across instances, conventional architectures that replicate these parameters across the local DRAM of tens of thousands of accelerators incur massive capital expenditures, significant static power dissipation, and redundant memory-fetch energy. A recent proposal to use optical fiber loops as delay-line memory alleviates these issues, but its recirculating loop must hold the whole model: loop length grows with model size, slack is fixed when the ring is built, and the layouts that serve modern Mixture of Experts (MoE) models efficiently do not fit in it. We propose Optical Broadcast Memory (OBM), an open-ended hierarchical Tap-and-Amplify fiber architecture that generalizes and replaces the optical ring paradigm. A centralized memory server continuously broadcasts weights to distributed inference nodes that passively tap the data stream using receive-only co-packaged optics, delivering parameters directly to compute units without intermediate buffering. To overcome the limitations of continuous weight streaming, we use dynamically-sized slack to accommodate large and variable context lengths. We show how removing the restrictions of the optical ring allows OBM to efficiently serve MoE models. Evaluated at a datacenter scale of 80,000 accelerators, OBM eliminates petabytes of HBM while being competitive or better in throughput and energy per token than an HBM-based system.

cs.AR · cs.DC · cs.ET · cs.NI

新论文 · v1arXiv:2611.17018

Exploring Socially Acceptable 3D Feedback Design for Inclusive Small-Group Conversation

Qianjie Wei, Yifan Li, Zhen Bai

原文摘要

Prior research has shown that providing feedback on group dynamics can improve the quality of small-group conversations. However, publicly delivered feedback that targets specific individuals may reduce social acceptability due to negative experiences such as social pressure, embarrassment, and resistance. This work investigates how public feedback can be designed to remain socially acceptable while maintaining its effectiveness in XR-based small-group conversations. Informed by social science and HCI literature, we identified three design strategies (incorporate humor, reduce social attention, and use indirectness) and proposed a set of metaphor- and agent-based 3D feedback probes. We then conducted a two-phase study: (1) an online survey with 50 participants to examine how such feedback designs are perceived under public and private delivery, and (2) follow-up interviews with 14 participants who completed the survey to better understand their interpretations and elicit additional insights. Results show that metaphor- and agent-based feedback can reduce social discomfort while maintaining effectiveness. Interview findings further highlighted the role of three strategies in making feedback easier to accept, while requiring careful balance. We also discussed design implications for creating socially acceptable 3D feedback to support inclusive small-group conversations in XR.

cs.HC · cs.ET

新论文 · v1arXiv:2611.16524

A Joint LLM and Optimization Agent Solution for Drone Scheduling in Victim Search Missions

Yinghao Zhang, Yalin Liu, Hong-Ning Dai, Yan Zhang, Qubeijian Wang, Bishenghui Tao, Yaohan Li

原文摘要

Victim search in wilderness areas is time-critical. Drones enable rapid area search, but scheduling them is challenging because victims may continue moving, detection results are uncertain, and effective decisions must combine structured mission information with unstructured contextual clues and domain knowledge. To address this, we propose an agent-aided drone scheduling system. The system employs an agent at the ground control station (GCS) to coordinate multiple drones over successive search cycles. In each cycle, the agent applies a scheduling policy that combines a large language model (LLM) for reasoning about where to search with an optimizer for determining how to dispatch the drones under energy constraints. Simulation results show that the proposed system consistently completes the victim-search mission, whereas none of the six non-LLM baselines does so and direct LLM scheduling is considerably less reliable. The source code is publicly available at https://github.com/1643204431/llm-uav-victim-search.

eess.SY · cs.AI · cs.ET

新论文 · v1arXiv:2611.16463

Digitally Supported Transitional Care Pathways for Older Adults: A Multi-Site Co-Design Study

Camilla Gabrielsen, Roberta Bevilacqua, Lorena Rossi, Eleonora Bonifazi, Margherita Osimani, Ovidiu Anchidin, Ancuta Nemes, Ionut Anghel 等 13 位作者

原文摘要

During transitions from hospital to home, older adults are frequently affected by fragmented communication, limited coordination between levels of care, and insufficient post-discharge follow-up. Digital technologies, including remote patient monitoring (RPM), digital communication, and artificial intelligence (AI), offer opportunities to improve continuity of care. However, their integration needs to reflect the organizational and clinical contexts of different healthcare systems. This study presents the development and early implementation of digitally supported transitional care pathways within the TransCare project. Care pathways were analyzed and redesigned across three pilot sites in Italy, Romania, and Norway. Existing clinical and organizational processes were mapped to identify challenges and opportunities for improvement. Technology-augmented pathway matrices were developed to integrate RPM, digital communication tools, and AI-supported analytics across the stages of assessment, hospitalization, discharge, and post-discharge follow-up. The pathways were iteratively refined through a co-design process involving healthcare professionals, patients, caregivers, and technical partners. Early implementation experiences were subsequently analyzed across the three sites. Common challenges included fragmented communication and poor care coordination, particularly during discharge and post-discharge follow-up. However, the underlying cause and required solutions differed across the pilot sites, reflecting variations in patient profiles, healthcare organizations, available resources, and digital maturity.

cs.ET

新论文 · v1arXiv:2611.16285

Scaling Pêlagos: Multi-GPU Orchestration for Relay Belief-Propagation Decoding

Xulong Tang, Dionysios Diamantopoulos, Tristan Müller, Apo Kayi, Nelson Mimura Gonzalez, Muhammad Osama, Seetharami Seelam, Haralampos Pozidis 等 10 位作者

原文摘要

Fault-tolerant quantum computing requires quantum error-correction (QEC) decoders that achieve low logical error rates under real-time operating constraints. These constraints motivate heuristic decoding algorithms whose error-correction performance must be evaluated through large-scale simulation. High-throughput decoding accelerates this evaluation and the exploration of decoder parameters. Using multiple graphics processing units (GPUs) is a natural way to scale these simulations, but naively distributing syndrome batches introduces host-side preprocessing and output-collection overheads that limit scaling. To address these limitations, we extend the Pêlagos relay belief-propagation (Relay-BP) decoder with process-isolated orchestration, parallel host preprocessing, and shared-memory output. We evaluate both one-gross ($[[144,12,12]]$) and two-gross ($[[288,12,18]]$) codes in a multi-GPU environment. Specifically, for the one-gross circuit at $R=50$, eight AMD Instinct MI300X GPUs and eight AMD Instinct MI355X GPUs achieve optimized end-to-end speedups of $5.68\times$ and $6.23\times$, respectively. For the two-gross circuit, the corresponding speedups are $6.92\times$ and $7.01\times$. When throughput is calculated using GPU decoding time, the corresponding two-gross speedups are $7.58\times$ and $7.45\times$, indicating near-linear GPU scaling. We deploy Pêlagos on Lux, Oak Ridge National Laboratory's AMD Instinct MI355X-based supercomputer, as a pathfinding application for high-throughput QEC simulation. This deployment provides a concrete quantum-computing use case for the AI + HPC infrastructure supporting the Genesis Mission's scientific-discovery goals. These end-to-end measurements demonstrate a practical path to accelerating large-scale QEC simulation through efficient multi-GPU decoding.

quant-ph · cs.ET

新论文 · v1arXiv:2611.16275

Demo: Matter-Based IoMT Telemetry and Security Analysis

Muhammad Hassan, Masooda Bashir, Carl Gunter

原文摘要

Connected health devices increasingly support health monitoring outside clinical settings, making secure and accessible physiological data important for patients and caregivers. However, device-specific applications and interfaces complicate the integration of readings from different devices. The Matter standard provides standardized device commissioning and protected communication, but its cluster library does not represent the health attribute measurement. We present a preliminary demo study of a Matter-based IoMT testbed with a specific HealthVitals cluster. Implemented in the connectedhomeip SDK on a Raspberry~Pi~5, the cluster exposes simulated heart rate, blood oxygen saturation, and body temperature. We examine commissioning, attribute retrieval, communication under simulated packet loss, and operational traffic through a reference controller. The study demonstrates that this custom telemetry model can operate within the tested Matter configuration without modifying commissioning or secure-session mechanisms. The resulting testbed gives researchers and device developers a concrete platform for investigating health-oriented extensions. It also supports exploration of local telemetry integration that could help patients and caregivers access readings across connected devices.

cs.AR · cs.ET · cs.RO

新论文 · v1arXiv:2611.16271

Hierarchical Decoding for Quantum Error Correction

Xulong Tang, Narges Alavisamani, Joan Camps, Matthew Cha, Elise Jennings, Jack O'Connor, Humberto Munoz Bauza, Josh Izaac 等 21 位作者

原文摘要

Fault-tolerant quantum computing requires classical decoders that can keep up with syndrome data streams and supply correction information and logical measurement outcomes to the quantum control system. Meeting these requirements at scale requires high throughput while controlling the end-to-end latency from readout to usable correction. In this paper, we organize decoding algorithms, execution strategies, and code constructions using common classifications and examine their performance and trade-offs under the reported evaluation conditions. We distinguish decoder-level hierarchy, where multiple decoding stages or resources cooperate to decode a single code, from code-level hierarchy, where the code construction itself introduces multiple decoding levels. We first review single-code hierarchical decoders and their cascaded predecoding and windowed, streaming, and distributed implementations. We then study hierarchical and concatenated codes, focusing on how decoding is coordinated across code levels through hard decisions, soft reliability information, or syndrome information. We also examine how qubit modalities shape decoding workloads and timing requirements, and review how different decoding platforms meet these requirements, including central processing units (CPUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and cryogenic platforms. By assessing design trade-offs, this paper clarifies connections across the literature and provides a shared foundation for QEC design exploration. It also identifies gaps in performance reporting and system integration to guide future research toward practical quantum error correction.

quant-ph · cs.ET

新论文 · v1arXiv:2611.16080

TGen-SQD: Physics-Informed Transferable Configuration Generator for Sample-Based Quantum Diagonalization

Niloy Deb Roy Mishu, Lei Jiang, Mohsen Heidari, Ruizhe Zhang, Fan Chen

原文摘要

Sample-based quantum diagonalization (SQD) avoids iterative variational circuit optimization, but its accuracy and cost depend on selecting a compact determinant subspace that captures the ground state. Existing machine-learning selectors use task-specific physical cues and typically retrain for each Hamiltonian. We introduce TGen-SQD, a physics-informed generator jointly trained across multiple Hamiltonians. It learns from configuration-interaction-weighted data and uses orbital- and system-level descriptors to guide generation. After training, its weights remain frozen for inference on seen and zero-shot geometries. On a 20-qubit H10 chain, TGen-SQD achieves mean energy errors of 40.18 +/- 1.52 and 43.97 +/- 1.20 mHa on seen and unseen geometries, respectively, 12.7% and 11.7% lower than the state-of-the-art PIGen-SQD baseline under matched shot and proposal budgets.

quant-ph · cs.ET · physics.chem-ph

版本更新 · v2arXiv:2609.11649

From Grid to Chip: Power Architecture, Stability, and Flexibility of AI Data Centers

Yubo Song, Rui Kong, Takuro Umihara, Pooya Davari, Frede Blaabjerg, Subham Sahoo

原文摘要

The rapid growth of artificial intelligence (AI) computing is transforming data centers into large, dynamic electrical loads. Their deployment is primarily constrained by energy availability and grid-connection capacity, which is further aggravated by the ability of power-delivery architectures, control systems, and computing workloads to operate reliably during fast grid disturbances. This article provides a comprehensive overview of forefront challenges and trends in the grid-to-chip framework, and presents a technological perspective on AI data centers as grid-interactive computing systems. First, it reviews grid-integration bottlenecks, evolving connection policies, grid-code requirements, which has fostered new technological trends via spatio-temporal flexibility available through workload orchestration, cooling systems, on-site resources, and energy storage. Second, it maps the evolution of power-delivery architectures from medium-voltage grid interfaces to chip-level, discussing higher-voltage DC distribution, solid-state transformers, wide-bandgap devices, advanced chip-level power delivery, and liquid cooling. Third, it establishes a three-level stability framework spanning rack-level DC-bus dynamics, facility-level converter interactions, and system-level grid-coupled behavior. The framework connects dominant instability mechanisms, including constant power load effects, impedance interactions, forced oscillations, and operating-mode transitions, with suitable modeling, assessment, and mitigation approaches. Synthesizing these topics, this article highlights grid-to-chip co-design as a central requirement for scalable AI infrastructure, linking computing workloads, power-delivery systems, energy buffers, and grid operation.

cs.ET · cs.AR · eess.SY

新论文 · v1arXiv:2611.15343

Hybrid Classical-Quantum Optimization for CVRPTW: A Systems Framework with Provable Feasibility and Empirical Hardware Limits

Syamasundar Gopasana, Swatantra Singh, Rohan Joydhar, Shubhashis Sengupta

原文摘要

Solving large-scale Capacitated Vehicle Routing Problems with Time Windows (CVRPTW) remains challenging because strict operational constraints and scale limit both exact and heuristic methods. We present a hybrid classical-quantum architecture combining Mixed Integer Linear Programming (MILP) with vehicle-level Quadratic Unconstrained Binary Optimization (QUBO), solved using Toshiba SQBM+ and QAOA on Rigetti Ankaa-3 and IQM Emerald quantum processors. The decomposition avoids the variable growth and constraint-enforcement difficulties of monolithic CVRPTW QUBO formulations. We evaluate the framework on five realistic benchmarks derived from London traffic and location data, spanning 10--70 customers, using a validation pipeline enforcing feasibility and monotone improvement over classical baselines. SQBM+ achieves verified fleet-distance reductions of 2.80% (7,927 m) for the 25-customer instance and 0.22% (1,186 m) for the 55-customer instance. QAOA experiments establish a current hardware boundary for reliable constraint satisfaction at subproblems of up to 4 customers (16 qubits). Diagnostic results identify assignment-level time-window tightness, rather than local route optimization, as the dominant scalability bottleneck. The results demonstrate a practical near-term role for hybrid classical-quantum optimization while establishing empirical limits for current quantum hardware.

quant-ph · cs.ET

版本更新 · v2arXiv:2606.10543

Flexible Flows for Biological Sequence Design

Yogesh Verma, Dani Korpela, Harri Lähdesmäki, Vikas Garg

原文摘要

Designing functional biological sequences requires navigating vast discrete spaces under strict evolutionary and biophysical constraints. Discrete Flow Matching (DFM) offers a generative framework over such spaces, but existing approaches rely on biologically uninformative couplings and offer limited flexibility for variable-length sequence generation and fine-grained control. We propose a structured coupling that encodes domain-specific preferences among sequence elements, biasing the source distribution toward plausible regions without modifying the flow objective or training procedure. Building on this, we introduce a latent edit-based rate parameterization that models variable-length generation via edit operations conditioned on a shared global latent, akin to a latent variable model, while remaining tractable. We further introduce a latent classifier-free guidance mechanism that steers generation coherently in continuous latent space, along with Dirichlet-prior temperature scaling for test-time control over edit operations. Our method achieves state-of-the-art performance across diverse biological sequence tasks, including density estimation, unconditional and conditional DNA sequence generation, and peptide sequence generation. Our code is available at https://github.com/Aalto-QuML/FlexFlow.

cs.LG · cs.AI · cs.ET · q-bio.QM

新论文 · v1arXiv:2611.14782

Bayesian inference with a polymer probabilistic computer

Travis Wanless, Yuriy Bandera, Lubomir Kostal, Stephen H. Foulger

原文摘要

Bayesian inference weighs competing explanations of noisy data by sampling from a posterior distribution, a task that deterministic hardware performs only by simulating randomness. Probabilistic bits (p-bits) supply this randomness physically, but the few hardware networks of p-bits built so far use inorganic devices, address optimization or learning, and are judged without reference to the spread expected from finite sampling. Here we report a probabilistic computer built from solution-processed conjugated-polymer memristors. Four polymer p-bits, tracked online for drift and coupled in a closed Gibbs-sampling loop, sample competing, degenerate and cooperative posteriors over sixteen states with statistics that fall within the range of ideal p-bits, both in their distribution and in their autocorrelation, without any parameter fitted to the target. This agreement extends to new simulated sensor readings whose outcome was predicted before each run, including readings that point away from the true answer. Reprogrammed in software, the same circuit and controller reproduces the invertible AND gate of earlier p-bit networks, with its temperature fixed in advance rather than fitted. Polymer p-bits thus open a route to printed, large-area probabilistic computers that infer alongside their sensors.

cs.ET · cond-mat.dis-nn · cond-mat.mtrl-sci · cond-mat.soft

版本更新 · v2arXiv:2607.01494

Insights from GitHub Community on the Matter Standard: Developer Perspectives and Challenges

Muhammad Hassan, Carl Gunter, Susan Landau, Masooda Bashir

原文摘要

Matter seeks to resolve longstanding interoperability problems in the Internet of Things (IoT), yet little is known about how developers experience the standard in day to day work. This paper examines over 13,000 issues from the official Project CHIP GitHub repository to understand the kinds of problems contributors report when implementing and integrating Matter. Using topic modeling and qualitative analysis, we identify four recurring areas of concern, Testing, Interoperability, Development, and Platform and Network, and describe how they manifest in the evolution of the codebase and tooling. The findings reveal systematic technical and integration challenges and point to concrete opportunities to refine Matter's test infrastructure, cross vendor guidance, and documentation as the standard continues to mature.

cs.SE · cs.ET · cs.HC · cs.SI

新论文 · v1arXiv:2611.14744

Beyond Ground States: Learning Many-Body Hamiltonians for p-Bit Invertible Arithmetic

Tian Feng, Xutang Fan, Yiyun Chen

原文摘要

Probabilistic-bit (p-bit) invertible logic encodes a Boolean relation as an energy whose ground states are its legal assignments, computing in any direction by sampling. Traditional constructions target ground-state membership and a wide minimum energy gap, yet finite-time samplers traverse excited states. We cast Hamiltonian design as inverse statistical mechanics: fit an energy with interactions up to order four whose Gibbs law approaches uniformity on each clamp case's legal states, under a gap floor keeping every legal state below every illegal one. Constrained maximum likelihood with pruning and refitting fits terms from a fixed pool, and every delivered energy is audited exactly on all cases. Each energy is scored by time to a verified solution under restarts with its best of nine tuned samplers. In underdetermined modes, learned multipliers factor in 0.55, 0.44, 0.52 and 0.46 [0.38, 0.56] of the hand-written encodings' updates from 4x4 to 7x7, faster within every family below 7x7 at no resolved work penalty; learned adders solve the reverse mode in 0.71 of the updates at 8 bits and about a quarter at 24 and 32 bits, at 0.55 of the work at 32 bits. At 5x5 under equal pool, budget and floor, a gap-maximizing fit reaches 0.79 [0.73, 0.88] in updates and 1.26 in work against the hand-written encoding, while likelihood fitting takes 0.55 [0.46, 0.58] and 0.58 [0.48, 0.61] of the gap fit's updates and work. Rounding coefficients to the narrowest exact integer words tested, we run both energies at each pair's common word on one FPGA color-sweep SSA core, bit-exact with software: learned multipliers take 0.41 of the hand-written encoding's cycles at 4x4 and 0.057 [0.045, 0.068] at 7x7, at up to 2.4 times its lookup tables. The method requires only a circuit's legal assignments; in determined modes, hand-written encodings take less work, and from 12 bits on the adder fewer updates.

cond-mat.dis-nn · cs.ET · physics.app-ph

新论文 · v1arXiv:2611.14422

在量子计算机中加载经典数据的能量代价

The energetic cost of loading classical data in quantum computers

Joao F. Doriguello, Alessandro Luongo, Harshit Verma

AI 速读 基于摘要

作者将经典数据加载视为硬件过程,量化超导处理器上QRAM查询的动态能量代价,并比较两种QRAM架构。

quant-ph · cs.ET

查看原文摘要

Quantum algorithms for machine learning, chemistry, and cryptanalysis often assume coherent access to classical data at negligible physical cost. We instead treat data loading as a hardware process and quantify the dynamic energetic cost of a quantum random access memory (QRAM) query on a superconducting processor. Using the metric-noise-resource framework, we relate query fidelity and power to gate duration, relative two-qubit drive strength, and the distribution of attenuation across a multi-stage refrigerator, while accounting for thermal photons and gate errors. We analyze the linear-depth multiplexer and the noise-resilient bucket-brigade architectures, adapting the latter to a native superconducting gate set and refining its fidelity analysis using the fully decomposed gate schedule. For a representative bucket-brigade QRAM query with a $12$-qubit address register we obtain a query fidelity of $0.969$. The query consumes $3.51\times10^{-4}\,\mathrm{J}$ of dynamic energy, corresponding to an average dynamic power of $4.38\,\mathrm{W}$ and a peak of $64.4\,\mathrm{W}$. Our optimization shows that, at fixed target fidelity, the operating point and attenuation profile can change the average power by a factor of two or more.

新论文 · v1arXiv:2611.14338

信息论视角下调节性T细胞定位作为IL-2干扰滤波器

An Information-Theoretic Perspective on Regulatory T Cell Localization as an IL-2 Interference Filter

Alexander Wietfeld, Kristina A. Ganzinger, Wolfgang Kellerer, Andrew W. Eckford

AI 速读 基于摘要

作者将相邻免疫激活位点建模为分子通信系统,用三维IL-2场耦合T细胞群体动力学,分析Treg聚集作为IL-2“汇”对邻近位点干扰的抑制效果。

cs.IT · cs.ET

查看原文摘要

Diffusible signals enable communication between immune cells but can also create interference between nearby activation sites. In lymph nodes, effector T cells (Teff) concentrate around antigen-presenting cells (APCs), release interleukin-2 (IL-2) following antigen recognition, and sense IL-2 through cell-surface receptors. Experiments show high-uptake regulatory T cells (Treg) clustered around IL-2-producing cells. However, it is unclear how strongly responses at neighboring activation sites are coupled through diffusible IL-2, and how this coupling is influenced by the spatial organization of Treg acting as IL-2 sinks. We interpret two neighboring sites as a molecular communication system and study the effect of clustering using a three-dimensional IL-2 field coupled to T cell population dynamics. Across a broad parameter sweep, clustering Treg produces a larger mean reduction in neighboring-site interference than adding dispersed Treg. Compared with no Treg, clustered Treg suppress interference while largely preserving the strong local response with corresponding consequences for population expansion and survival. Information-theoretic analysis shows improved discrimination between weak and strong local sources at short separation, whereas at larger separation clustering primarily reduces the remaining estimated neighboring-source information. These findings support a spatial-filtering role for Treg clustering in maintaining locally informative immune responses.

新论文 · v1arXiv:2611.14182

Quantum-Assisted Counterfactual Regret Minimization for Bounded-Payoff Imperfect-Information Games

Gabriel Maresch, Erik Schulze, Jnan Yalla

原文摘要

Imperfect-information games with a graded-reward structure present significant computational challenges for equilibrium computation, since the payoff expectations must be estimated across exponentially large strategy spaces. Counterfactual Regret Minimization over the years has proven effective for approximating Nash equilibria, but Monte Carlo variants create a large overhead of sampling costs when the counterfactual values are estimated from sampled game-tree trajectories. We propose a novel Quantum-Assisted Counterfactual Regret Minimization, a framework that uses Quantum Amplitude Estimation to reduce the computational complexity of the regret updates in bounded-payoff imperfect-information games, while preserving the convergence of its classical counterpart. We give a theoretical analysis of the resulting exploitability bound, discuss NISQ-compatible amplitude-estimation variants, the structure of their resource requirements, and outline what is needed to validate the potential advantage empirically.

quant-ph · cs.ET · cs.GT

新论文 · v1arXiv:2611.13876

Influence of the branching geometry on SPION propagation: coupling of experiment and simulation

Daniel Fleischhauer, Luiz C. P. Wille, Stefan Lyer, Jens Kirchner, Dietmar Drummer

原文摘要

Magnetic Drug Targeting (MDT) is an emerging therapeutic concept in cancer medicine, where superparamagnetic iron oxide nanoparticles (SPIONs) are used as carriers for medication. Their magnetic properties allow for the manipulation of particle transport within the vascular structure and thus targeted delivery to the tumor site. To develop effective concepts for particle steering and accumulation, a detailed understanding of the particle--flow interaction, especially at asymmetric vascular bifurcations, is needed. Based on hierarchical scaling laws, generalized bifurcation geometries with varying degrees of asymmetry were derived and additively manufactured. The particle distribution was investigated by in situ optical measurements under different flow conditions and magnetic field configurations and compared with Lagrangian particle and Volume of Fluid Simulations (VoFS). While the particle mass partition followed the hydraulic flow split in asymmetric bifurcations, density-driven stratification dominated in the symmetric bifurcation, where one daughter branch received only a minor fraction of the particle mass at low flow rates despite carrying half of the flow. The Lagrangian model reproduced the predominantly advective propagation, whereas only the VoFS approach captured the stratification-induced asymmetry. Magnetic actuation counteracted the stratification, reversed the passive branch preference and increased particle retention. From a molecular communication perspective, bifurcation geometry, collective volume effects and magnetic actuation thus jointly determine the received particle signal at vascular bifurcations.

cs.ET · q-bio.QM

新论文 · v1arXiv:2611.13840

Oscillatory Processing Units as a computing substrate for biomimetic intelligence

Alexander A. Wolf

原文摘要

Biological intelligence emerges from neural activity that connects sensation, memory and action. Synaptic plasticity, neuronal assemblies and oscillations provide principles for biomimetic computing, but translating them into reusable operations requires a defined computational unit. We introduce Oscillatory Processing Units (OPUs), groups of synthetic neurons sharing a rhythm. Their directed interactions transform incoming activity and prior receiving state into an Oscillatory Occupancy Space (OOS), which becomes available to subsequent computation. We show that source--receiver conditions and oscillatory organization shape these transformations, including their geometry, persistence and historical accessibility. An Atlas of measured relationships supports prospective composition with predicted response classes. Configured circuits perform logical and numerical operations, express associative recall and generate closed-loop decisions with fixed synaptic weights. OPUs and OOS establish a computing substrate for biomimetic intelligence in which experience remains part of the state through which new input becomes action.

cs.NE · cs.ET · cs.RO

新论文 · v1arXiv:2611.13778

Polynomial Quantum Recurrent Channels for Matrix Inverse Actions: Deferred-Reset Dynamics and Chebyshev Filtering

Vahid Tavakkoli, Kabeh Mohsenzadegan, Kyandoghere Kyamakya

原文摘要

We develop completely positive, trace-preserving polynomial recurrent channels for quantum solution-state preparation and derive fixed-point and time-varying tracking bounds. Across 2,880 synthetic configurations, resident Chebyshev recurrence improves accuracy-passing snapshot counts in 608 cases, ties in 2,271, and loses in one. A separate 360-scenario cost study shows that fresh recurrence is cheaper in all 184 jointly feasible scenarios (median resident-to-fresh cost ratio: 3.12), while resident recurrence uniquely satisfies accuracy requirements in 74 cases. At a logical noise rate of $10^-4$, neither recurrent method qualifies. Based on exact reduced-density simulations and assumed cost models, our results demonstrate conditional tracking advantages but no general end-to-end speedup or total-cost benefit.

quant-ph · cs.ET

新论文 · v1arXiv:2611.13774

AI-Adaptive Virtual Reality for STEM: Engagement, Retention, and Learning Outcomes

Srinivasa K G, Akshit Rana, Aman Singh, Kshitij Kumar Singh Chauhan

原文摘要

Virtual Reality (VR) presents a com pelling opportunity to transform STEM pedagogy; however, empirical evidence evaluating AI-driven adaptivity, objective engagement metrics, and long-term knowledge retention remains sparse. This paper proposes and evaluates an AI-adaptive VR based solar system learning module deployed on Meta Quest 2, wherein a machine learning model dynamically adjusts in structional difficulty based on real-time learner interaction logs including dwell time, gaze patterns, and response latency. A controlled between-subjects experiment was conducted involving 120 secondary school students (mean age 14.3 years) across three schools in India, randomly assigned to three conditions: AI adaptive VR, standard VR, and traditional classroom instruction. Engagement was measured objectively through eye-tracking fixation density and heart rate variability (HRV), alongside pre-test, immediate post-test, and delayed post-tests at one week and one month intervals. Statistical analyses encompassing paired t-tests, one-way ANOVA, and Structural Equation Modeling (SEM) reveal that the AI-adaptive VR cohort demonstrated significantly higher knowledge improvement scores (mean gain = 38.4 vs. 31.2 vs. 10.7), superior one-month retention (p < 0.001), and measurably elevated engagement across all biometric indicators. SEM confirmed immersion as a significant mediator between adaptive instruction and knowledge acquisition (\b{eta} = 0.63, p < 0.001). Post-session self-directed learning exploration was recorded at 80% among AI-adaptive VR participants versus 40% in the traditional group. These findings establish an evidence based framework for deploying AI-adaptive immersive learning environments in resource-varied STEM educational contexts.

cs.ET

新论文 · v1arXiv:2611.13549

Perspicacious: An Educational Intelligence Platform for Instructional Designers

Yumou Wei, Michael C Sutton, Paulo F. Carvalho

原文摘要

Designing effective instruction requires instructional designers to create assessment questions aligned with clearly defined knowledge components (KCs). These KCs represent specific knowledge or skills that students must acquire. This process is often time-consuming and relies heavily on expert labor. Although AI for education research has produced a growing body of automated question-generation and KC-discovery methods, few have moved beyond research prototypes into user-friendly tools that instructional designers can readily use. To bridge the research-to-practice gap, we developed and evaluated an educational intelligence platform that unifies question generation and KC discovery behind a single interface to support instructional content development. Named "Perspicacious," our platform aims to help instructional designers "see through" complex data and algorithms to derive instructional insights. A cost model calibrated on 17 production runs revealed a cost-time trade-off: extracting KCs from a 576-question bank cost US $1.98-4.11 and took 36-158 minutes to complete, depending on the budget. A formative, partially Wizard-of-Oz study with eight instructional designers found strong perceived usability (mean SUS 78.8) and surfaced concrete requirements that we treat as prerequisites for deployment.

cs.CY · cs.ET · cs.HC

版本更新 · v2arXiv:2609.07235

Asymmetric quantum error correction efficiently tackles application-specific noise effects

Abhishek Yadav, Peter K. Schuhmacher, Michael Epping

原文摘要

Noise is a major challenge for current quantum computers. It can be broadly categorized into bit-flip and phase-flip errors. These two types do not necessarily affect the executed algorithm, thus also the application, in the same way. We illustrate this general effect for the example of the quantum approximate optimization algorithm (QAOA) applied to a small instance of the flight-gate assignment (FGA) problem. We compare bit-flip and phase-flip Pauli noise under both layer-level and gate-level noise models, using two circuit decompositions of the same ideal QAOA unitary: a CNOT-based decomposition and a native-RZZ decomposition. For the six-qubit FGA instance considered here, bit-flip noise produces a larger degradation in the optimized QAOA performance across the investigated circuit depths and noise models. The asymmetry is most pronounced in the layer-level and native-RZZ simulations. We explain this behavior through the commutation and propagation properties of the errors and their effects on the final computational-basis measurements. Since these mechanisms are not specific to the considered FGA instance, we expect similar noise asymmetries to arise in other Ising-based QAOA applications, although this remains to be investigated. We then exploit these insights to tackle noise particularly efficiently using asymmetric error-correcting codes. As an illustration, we use the quantum parity code (QPC), a generalization of the 9-qubit Shor code, and show that a smaller asymmetric code can achieve nearly the same improvement as a larger symmetric choice. This suggests that allocating error-correction resources according to algorithmic noise sensitivity, rather than physical error rates alone, can be beneficial even when the physical noise is symmetric. Finally, we discuss how information about the noise obtained through calibration can be exploited in our approach.

quant-ph · cs.ET

版本更新 · v2arXiv:2611.08738

抗单粒子翻转的多上下文自旋电子FPGA

SEU Hardened Multi-Context Spintronic FPGA

Abdolah Amirany, HamidReza Imani, Samuel Farid, Tarek El-Ghazawi

AI 速读 基于摘要

提出一种利用MTJ非易失性实现内部多配置存储并具备SEU加固能力的自旋电子FPGA架构。

cs.ET

查看原文摘要

Due to susceptibility to radiation-induced soft errors and resource constraints implementing large and complex designs on field programmable gate arrays (FPGAs) in harsh environments is challenging. Therefore, to mitigate these issues, this paper proposes an innovative approach through the introduction of a single event upset (SEU)-hardened spintronic FPGA architecture that incorporates multi-context capabilities. Leveraging the non-volatile properties of magnetic tunnel junction (MTJ), the proposed design can store two/four distinct configurations internally, eliminating the dependence on external non-volatile memory which significantly boosts the system performance. Additionally, through post-layout simulation, we demonstrate our design immunity to SEU, which enhances its reliability and operational stability in environments susceptible to radiation-induced soft errors. The efficiency of the proposed design was also evaluated using the ROSSETA benchmark, which serves as a representative model for real-world FPGA applications.

版本更新 · v2arXiv:2611.08715

高效自旋电子随机传感内计算模块

Efficient Spintronic Stochastic In-Sensor Computing Modules

Abdolah Amirany, HamidReza Imani, Samuel Farid, Tarek El-Ghazawi

AI 速读 基于摘要

作者提出利用磁隧道结亚临界翻转区随机特性的自旋电子随机计算模块,用于资源受限的传感内处理系统。

cs.ET

查看原文摘要

In-sensor processing (ISP) is used in various fields, including autonomous driving automotive systems, wearable healthcare devices, environmental monitoring, wireless sensor networks, smart cities, and industrial control systems. One of the main features of most of these applications is energy and hardware restriction. This restriction amplifies the importance of using high-performance and low-energy consumption computing systems and methods. This paper proposes efficient spintronic stochastic computing modules for in-sensor computing systems to address this challenge. The proposed design utilized the stochastic behavior of the magnetic tunnel junction in the subcritical switching regime to generate a probability-adjustable random stream. Probability-adjustable random stream generation is the most important step in any stochastic system because it determines the quality of the final output. The simulation results indicate that the proposed design offers almost the same peak signal-to-noise ratio and structural similarity while occupying at least 62\% lower area and consuming 60\% lower energy. These advantages made the proposed design a good choice for ISP applications with limited energy.

新论文 · v1arXiv:2611.12671

GPS-Triggered Adaptive Trajectory Control and SDR-Based RF Jamming for UAV Geofencing

Muhammad Moazam Azeem, Abdul Rehman Khan Tareen, Muhammad Obaid Ullah

原文摘要

This paper presents a GPS-triggered geofencing and enforcement scheme that integrates real-time satellite positioning with Software-Defined Radio (SDR) based RF jamming to detect and neutralize unauthorized unmanned aerial vehicle (UAV) boundary violations. Conventional geofencing depends on onboard GPS and cooperative flight firmware. The proposed approach instead moves enforcement to a ground base station, so the response does not depend on the UAV. An ESP32- WROOM-32 microcontroller paired with a u-blox NEO-6M GPS receiver streams telemetry over Wi-Fi to a Python/GNU Radio base station. There, a lightweight Haversine boundary-violation algorithm computes the great-circle distance between the UAV and the geofence. This distance drives a piecewise-linear adaptive speed and altitude control law. The law progressively decelerates and descends the UAV inside a 1 km warning zone and brings it to a complete halt at the boundary. If the boundary is breached, a HackRF One SDR escalates to band-limited noise jamming of the 2.4 GHz control link. The hardware stack was integrated on a GoolRC S116 quadrotor with an end-to-end enforcement latency of about 1 s. Field trials achieved 95% disconnection accuracy within a 50 m radius, and u-center NMEA analysis confirmed sub-2-meter GPS positioning precision. Simulation over an 8-sector, 50 km geofence model confirms speed and altitude-invariant boundary enforcement for cruising speeds of 5 to 50 m/s and cruising altitudes up to 100 ft. A comparison against a PID baseline shows that the proposed law guarantees overshoot-free shutdown at the boundary without gain tuning. It also runs in constant time, which makes it well suited to low-cost, resource-constrained embedded platforms.

cs.ET

版本更新 · v3arXiv:2603.14527

DNA-MGC+: A versatile codec for reliable and resource-efficient data storage on synthetic DNA

Ramy Khabbaz, Jérémy Mateos, Marc Antonini, Serge Kas Hanna

原文摘要

The biochemical processes underlying DNA data storage, including synthesis, amplification, and sequencing, are inherently noisy, leading to insertion, deletion, and substitution errors as well as sequence dropouts that challenge reliable data retrieval. Here we introduce DNA-MGC+, a DNA storage codec designed for reliable and resource-efficient retrieval under diverse operating conditions. We evaluate DNA-MGC+ across various in silico and in vitro settings. In comparison with selected representative codecs, the results show that DNA-MGC+ consistently improves key performance metrics under explicit reliability constraints, including required sequencing depth, read cost, decoding time, storage density, and error-correction capability. In silico experiments show that DNA-MGC+ supports reliable decoding at error rates up to 24% for a 15-KB file, while separate scalability experiments demonstrate reliable decoding of files up to 200 MB at a 5% error rate. In vitro experiments involving a 24-KB file and electrochemical synthesis show that different DNA-MGC+ configurations achieve minimum sequencing depths below 3x and read costs below 3.5 nts/bit under both Illumina and Nanopore sequencing.

cs.IT · cs.ET

新论文 · v1arXiv:2611.11097

QoS-Aware Energy-Efficient Sub-THz Near-Field Multiuser Hybrid MIMO Systems Employing Circular Arrays

Priya Gupta, Prabhanshu Yadav, Suraj Srivastava

原文摘要

Near-field communications have emerged as a promising technology for future sixth-generation (6G) networks. However, designing energy-efficient hybrid beamfocusing schemes for multiuser (MU) systems remains challenging due to the non-convex quality-of-service (QoS) constraints and hardware limitations of hybrid architectures. In this paper, we investigate a hybrid massive multiple-input multiple-output (MIMO) architecture for a near-field sub-THz MU downlink system employing a large uniform circular array (UCA) at the base station. A QoS-aware transmit power minimization problem is formulated for energy-efficient beamfocusing and addressed through a two-stage penalty-driven joint optimization (PDJO) framework, where auxiliary variables are introduced to reformulate the QoS constraints into second-order cone (SOC) constraints. Furthermore, a near-field polar-domain codebook is developed via joint angle- and distance-domain sampling. We establish that the fully digital (FD) beamfocuser lies within the column space of the proposed codebook, enabling hybrid precoder design to be formulated as a multiple measurement vector (MMV)-based sparse approximation problem. The formulated problem is then solved using a low-complexity simultaneous orthogonal matching pursuit (SOMP) algorithm under hardware and transmit power constraints. Simulation results demonstrate that the proposed framework achieves spectral- and energy-efficiency performance close to the ideal FD beamfocusing scheme while providing a favorable trade-off between hardware complexity and system performance.

cs.IT · cs.ET

新论文 · v1arXiv:2611.10608

An LLM-Orchestrated Multi-Modal Chatbot for Tomato Disease Consultant

Ngoc-Son Le, Khanh-Nghi Phan, Ngoc Hong Tran

原文摘要

This paper introduces a chatbot developed to assist in diagnosing common diseases in tomato plants through natural language interaction. Users can describe symptoms in text. Then, the chatbot responds with the most likely disease, and basic treatment suggestions and related image-based reasoning. The system leverages pre-trained Mistral and Llama 3.2 large language models. The system is also built using LangChain and Streamlit to provide a lightweight and offline-friendly interface. This work targets to support tomato growers a fast and accessible tomato plant health guidance when the technical expertise is not available nearby, especially in the remote areas. The experimental results are promising and encourage further improvement of the chatbot for future real-world deployment.

cs.AI · cs.ET