Dynamic spectrum access (DSA) is one of the pivotal technologies that is widely recognized to be able to cope with the massive demand for limited spectrum resources by massive data in 5G/B5G networks. To address spectrum fragmentation and sharing in 5G/B5G cognitive radio ad hoc networks (CRAHNs), based on the DSA technique, this paper proposes an optimal matched channel selection strategy with finite buffer (OMCS-FB). In the OMCS-FB, a cognitive user (CU) with the transmission request selects the channel whose idle time optimally matches its transmission time rather than selecting the channel with the longest idle time; if the CU fails to access the channel, the CU enters the buffer and waits for the next transmission opportunity. A (K+1)-layer continuous-time Markov chain (CTMC) with the number of primary users (PUs) and CUs in primary channels and the number of CUs in the buffer as 3-D metrics is established, which can effectively portray the activity behavior of users and the occupancy states of primary channels under the OMCS-FB. The CTMC rate steady-state equations are then solved using the successive over-relaxation (SOR) iterative algorithm to obtain the system steady-state probability distributions and performance metrics. The results show that the OMCS-FB effectively suppresses spectrum fragmentation of the MAC layer in the time dimension and enables efficient spectrum sharing among CUs and PUs, as verified by Monte Carlo simulation.

Sihang Zeng, Kai Tian, Kaiyan Zhang, Yuru Wang, Junqi Gao, Runze Liu, Sa Yang, Jingxuan Li, Xinwei Long, Jiaheng Ma, Biqing Qi, Bowen Zhou. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.

Large language models (LLMs) have taken a great step towards AGI. Meanwhile, an increasing number of domain-specific problems such as math and programming boost these general-purpose models to continuously evolve via learning deeper expertise. Now is thus the time further to extend the diversity of specialized applications for knowledgeable LLMs, though collecting high quality data with unexpected and informative tasks is challenging. In this paper, we propose to use advertisement (ad) videos as a challenging test-bed to probe the ability of LLMs in perceiving beyond the objective physical content of common visual domain. Our motivation is to take full advantage of the clue-rich and information-dense ad videos' traits, e.g., marketing logic, persuasive strategies, and audience engagement. Our contribution is three-fold: (1) To our knowledge, this is the first attempt to use ad videos with well-designed tasks to evaluate LLMs. We contribute AdsQA, a challenging ad Video QA benchmark derived from 1,544 ad videos with 10,962 clips, totaling 22.7 hours, providing 5 challenging tasks. (2) We propose ReAd-R, a Deepseek-R1 styled RL model that reflects on questions, and generates answers via reward-driven optimization. (3) We benchmark 14 top-tier LLMs on AdsQA, and our \texttt{ReAd-R}~achieves the state-of-the-art outperforming strong competitors equipped with long-chain reasoning capabilities by a clear margin.

A hardware-friendly bisection neural network (BNN) topology is proposed in this work for approximately implementing massive pieces of complex functions in arbitrary on-chip configurations. Instead of the conventional reconfigurable fully connected neural network (FC-NN) circuit topology, the proposed hardware-friendly topology performs NN behaviors in a bisection structure, in which each neuron includes two constant synapse connections for both inputs and outputs. Compared with the FC-NN one, the reconfiguration of the BNN circuit topology eliminates the remarkable amount of dummy synapse connections in hardware. As the main target application, this work aims at building a general-purpose BNN circuit topology that offers a great amount of NN regressions. To achieve this target, we prove that the NN behaviors of the FC-NN circuit topologies can be migrated to the BNN circuit topologies equivalently. We introduce two approaches including the refining training algorithm and the inverted-pyramidal strategy to further reduce the number of neurons and synapses. Finally, we conduct the inaccuracy tolerance analysis to suggest the guideline for ultra-efficient hardware implementations. Compared with the state-of-the-art FC-NN circuit topology-based TrueNorth baseline, the proposed design can achieve 17.8- 22.2× hardware reduction and less than 1% inaccuracy.