Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
52works
0followers
30topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

52 published item(s)

preprint2026arXiv

A Comprehensive Survey of Website Fingerprinting Attacks and Defenses in Tor: Advances and Open Challenges

The Tor network provides users with strong anonymity by routing their internet traffic through multiple relays. While Tor encrypts traffic and hides IP addresses, it remains vulnerable to traffic analysis attacks such as the website fingerprinting (WF) attack, achieving increasingly high fingerprinting accuracy even under open-world conditions. In response, researchers have proposed a variety of defenses, ranging from adaptive padding, traffic regularization, and traffic morphing to adversarial perturbation, that seek to obfuscate or reshape traffic traces. However, these defenses often entail trade-offs between privacy, usability, and system performance. Despite extensive research, a comprehensive survey unifying WF datasets, attack methodologies, and defense strategies remains absent. This paper fills that gap by systematically categorizing existing WF research into three key domains: datasets, attack models, and defense mechanisms. We provide an in-depth comparative analysis of techniques, highlight their strengths and limitations under diverse threat models, and discuss emerging challenges such as multi-tab browsing and coarse-grained traffic features. By consolidating prior work and identifying open research directions, this survey serves as a foundation for advancing stronger privacy protection in Tor.

preprint2026arXiv

AMAP Agentic Planning Technical Report

We present STAgent, an agentic large language model tailored for spatio-temporal understanding, designed to solve complex tasks such as constrained point-of-interest discovery and itinerary planning. STAgent is a specialized model capable of interacting with ten distinct tools within spatio-temporal scenarios, enabling it to explore, verify, and refine intermediate steps during complex reasoning. Notably, STAgent effectively preserves its general capabilities. We empower STAgent with these capabilities through three key contributions: (1) a stable tool environment that supports over ten domain-specific tools, enabling asynchronous rollout and training; (2) a hierarchical data curation framework that identifies high-quality data like a needle in a haystack, curating high-quality queries by retaining less than 1\% of the raw data, emphasizing both diversity and difficulty; and (3) a cascaded training recipe that starts with a seed SFT stage acting as a guardian to measure query difficulty, followed by a second SFT stage fine-tuned on queries with high certainty, and an ultimate RL stage that leverages data of low certainty. Initialized with Qwen3-30B-A3B to establish a strong SFT foundation and leverage insights into sample difficulty, STAgent yields promising performance on TravelBench while maintaining its general capabilities across a wide range of general benchmarks, thereby demonstrating the effectiveness of our proposed agentic model.

preprint2026arXiv

DAST: Difficulty-Adaptive Slow-Thinking for Large Reasoning Models

Recent advancements in slow thinking reasoning models have shown exceptional performance in complex reasoning tasks. However, these models often exhibit overthinking (generating redundant reasoning steps for simple problems), leading to excessive computational resource usage. While current mitigation strategies uniformly reduce reasoning tokens, they risk degrading performance on challenging tasks that require extended reasoning. This paper introduces Difficulty-Adaptive Slow Thinking (DAST), a novel framework that enables models to autonomously adjust the length of Chain-of-Thought (CoT) based on problem difficulty. We first propose a Token Length Budget (TLB) metric to quantify difficulty, then leverage budget-aware reward shaping and budget preference optimization to implement DAST. DAST penalizes overlong responses for simple tasks while incentivizing sufficient reasoning for complex problems. Experiments on diverse datasets and model scales demonstrate that DAST effectively mitigates overthinking (reducing token usage by over 30\% on average) while preserving reasoning accuracy on complex problems. Our codes and models are available at https://github.com/AnonymousUser0520/AnonymousRepo01.

preprint2026arXiv

Denoising-GS: Gaussian Splatting with Spatial-aware Denoising

Recent advances in 3D Gaussian Splatting (3DGS) have achieved remarkable success in high-fidelity Novel View Synthesis (NVS), yet the optimization process inevitably introduces noisy Gaussian primitives due to the sparse and incomplete initialization from Structure-from-Motion (SfM) point clouds. Most existing methods focus solely on adjusting the positions of primitives during optimization, while neglecting the underlying spatial structure. To this end, we introduce a new perspective by formulating the optimization of 3DGS as a primitive denoising process and propose Denoising-GS, a spatial-aware denoising framework for Gaussian primitives by taking both the positions and spatial structure into consideration. Specifically, we design an optimizer that preserves the spatial optimization flow of primitives, facilitating coherent and directed denoising rather than random perturbations. Building upon this, the Spatial Gradient-based Denoising strategy jointly considers the spatial supports of primitives to ensure gradient-consistent updates. Furthermore, the Uncertainty-based Denoising module estimates primitive-wise uncertainty to prune redundant or noisy primitives, while the Spatial Coherence Refinement strategy selectively splits primitives in sparse regions to maintain structural completeness. Experiments conducted on three benchmark datasets demonstrate that Denoising-GS consistently enhances NVS fidelity while maintaining representation compactness, achieving state-of-the-art performance across all benchmarks. Source code and models will be made publicly available.

preprint2026arXiv

How Far Are We From True Auto-Research?

Recent auto-research systems can produce complete papers, but feasibility is not the same as quality, and the field still lacks a systematic study of how good agent-generated papers actually are. We introduce ResearchArena, a minimal scaffold that lets off-the-shelf agents (Claude Code using Opus 4.6, Codex using GPT-5.4, and Kimi Code using K2.5) carry out the full research loop themselves (ideation, experimentation, paper writing, self-refinement) under only lightweight guidance. Across 13 computer science seeds and 3 trials per agent-domain pair, ResearchArena yields 117 agent-generated papers, each evaluated under three complementary lenses: a manuscript-only reviewer (SAR), an artifact-aware peer review (PR) in which agents inspect the workspace alongside the manuscript, and an human conducted meta-review. Under SAR alone the picture is optimistic: Claude Code obtains the highest score, outperforms Analemma's FARS, and matches the weighted-average human ICLR 2025 submission, suggesting that minimally scaffolded agents can produce papers that look competitive on manuscript-only review. Manual inspection, however, reveals this picture is overstated: SAR scores are poorly aligned with its actual acceptance decisions and reward plausible framing without verifying experimental substance. Under artifact-aware PR scores drop sharply, and manual auditing identifies experimental rigor as the major bottleneck, decomposing into three failure modes (fabricated results, underpowered experiments, and plan/execution mismatch) that are highly agent-dependent: Codex 5%/8% paper-vs-artifact mismatch / fabricated references versus Kimi Code 77%/72%, a $\sim$15$\times$ spread that tracks distinct research personas the agents develop. None of the 117 agent-generated papers reaches the acceptance bar of a top-tier venue. This suggests that we are still gapped from the true auto-research.

preprint2026arXiv

Sub-barrier fusion enhancement due to positive Q-value four-neutron transfer

The influence of positive $Q$-value four-neutron transfer (PQ4NT) effects on the sub-barrier capture cross sections is systematically investigated using the empirical barrier distribution (EBD2) method. For 13 fusion reactions with $Q_{4n}>0$, sustained neutron-pair transfer is found to reduce barrier heights and enhance capture cross sections at sub-barrier energies. In contrast, reactions such as $^{18}$O+$^{58}$Ni, which have $Q_{2n}>0$ but $Q_{4n}<0$, exhibit no enhancement due to the stalling of subsequent neutron-pair transfer after the initial 2n transfer. By incorporating PQ4NT effects into EBD2 for systems with $Q_{4n}>0$, the average deviation between predicted and experimental capture cross sections (113 datasets) is significantly reduced by $20\%$. Additionally, comparing with the systems induced by $^{48}$Ca ($Q_{4n}<0$), much larger neutron pickup probabilities are observed in the quasi-elastic scattering of $^{40}$Ca-induced reactions ($Q_{4n}>0$) from the time-dependent Hartree-Fock (TDHF) calculations.

preprint2024arXiv

A Video Coding Method Based on Neural Network for CLIC2024

This paper presents a video coding scheme that combines traditional optimization methods with deep learning methods based on the Enhanced Compression Model (ECM). In this paper, the traditional optimization methods adaptively adjust the quantization parameter (QP). The key frame QP offset is set according to the video content characteristics, and the coding tree unit (CTU) level QP of all frames is also adjusted according to the spatial-temporal perception information. Block importance mapping technology (BIM) is also introduced, which adjusts the QP according to the block importance. Meanwhile, the deep learning methods propose a convolutional neural network-based loop filter (CNNLF), which is turned on/off based on the rate-distortion optimization at the CTU and frame level. Besides, intra-prediction using neural networks (NN-intra) is proposed to further improve compression quality, where 8 neural networks are used for predicting blocks of different sizes. The experimental results show that compared with ECM-3.0, the proposed traditional methods and adding deep learning methods improve the PSNR by 0.54 dB and 1 dB at 0.05Mbps, respectively; 0.38 dB and 0.71dB at 0.5 Mbps, respectively, which proves the superiority of our method.

preprint2023arXiv

Secure Communication for Spatially Correlated Massive MIMO with Low-Resolution DACs

In this paper, the performance of a secure massive multiple-input multiple-output (MIMO) system adopting low-resolution digital-to-analog converters (DACs) is analyzed over spatially correlated wireless channels. A tight lower bound for the achievable secrecy rate is derived with artificial noise (AN) transmitted in the null space of the user channels. Using the analytical results, the impact of spatial correlation on the secrecy rate is explicitly evaluated in the presence of low-resolution DACs. The analytical observations reveal that using low-resolution DACs can be beneficial to the secrecy performance compared with ideal DACs, when the channels are strongly correlated and optimal power allocation is not employed.

preprint2023arXiv

Unconventional ferroelectricity in half-filling states of antiparallel stacking of twisted WSe2

Abstract: We report on emergence of an abnormal electronic polarization in twisted double bilayer WSe2 in antiparallel interface stacking geometry, where local centrosymmetry of atomic registries at the twist interface does not favor the spontaneous electronic polarizations as recently observed in the parallel interface stacking geometry. The unconventional ferroelectric behaviors probed by electronic transport measurement occur at half filling insulating states at 1.5 K and gradually disappear at about 40 K. Single band Hubbard model based on the triangular moiré lattice and the interlayer charge transfer controlled by insulating phase transition are proposed to interpret the formation of electronic polarization states near half filling in twisted WSe2 devices. Our work highlights the prominent role of many-body electronic interaction in fostering novel quantum states in moiré-structured systems.

preprint2022arXiv

Adaptive Graph Convolutional Network Framework for Multidimensional Time Series Prediction

In the real world, long sequence time-series forecasting (LSTF) is needed in many cases, such as power consumption prediction and air quality prediction.Multi-dimensional long time series model has more strict requirements on the model, which not only needs to effectively capture the accurate long-term dependence between input and output, but also needs to capture the relationship between data of different dimensions.Recent research shows that the Informer model based on Transformer has achieved excellent performance in long time series prediction.However, this model still has some deficiencies in multidimensional prediction,it cannot capture the relationship between different dimensions well. We improved Informer to address its shortcomings in multidimensional forecasting. First,we introduce an adaptive graph neural network to capture hidden dimension dependencies in mostly time series prediction. Secondly,we integrate adaptive graph convolutional networks into various spatio-temporal series prediction models to solve the defect that they cannot capture the relationship between different dimensions. Thirdly,After experimental testing with multiple data sets, the accuracy of our framework improved by about 10\% after being introduced into the model.

preprint2022arXiv

An automated approach for consecutive tuning of quantum dot arrays

Recent progress has shown that the dramatically increased number of parameters has become a major issue in tuning of multi-quantum dot devices. The complicated interactions between quantum dots and gate electrodes cause the manual tuning process to no longer be efficient. Fortunately, machine learning techniques can automate and speed up the tuning of simple quantum dot systems. In this letter, we extend the techniques to tune multi-dot devices. We propose an automated approach that combines machine learning, virtual gates and a local-to-global method to realize the consecutive tuning of quantum dot arrays by dividing them into subsystems. After optimizing voltage configurations and establishing virtual gates to control each subsystem independently, a quantum dot array can be efficiently tuned to the few-electron regime with appropriate interdot tunnel coupling strength. Our experimental results show that this approach can consecutively tune quantum dot arrays into an appropriate voltage range without human intervention and possesses broad application prospects in large-scale quantum dot devices.

preprint2022arXiv

Content Distribution based on Joint V2I and V2V Scheduling in mmWave Vehicular Networks

With the explosive growth of vehicle applications, vehicular networks based on millimeter wave (mmWave) bands have attracted interests from both academia and industry. mmWave communications are able to utilize the huge available bandwidth to provide multiple Gbps transmission rates among vehicles. In this paper, we address the content distribution scheduling problem in mmWave vehicular networks. It has been challenging for all vehicles in the same network to complete content downloading due to the limited communication resources of roadside units (RSUs) and the high mobility of vehicles. We propose a joint vehicle-to-infrastructure (V2I) and vehicle-tovehicle (V2V) scheduling scheme to minimize the total number of content distribution time slots from a global optimization perspective. In the V2I phase, the RSU serially transmits integrity content to vehicles, which are selected according to the vehicular network topology and transmission scheduling scheme. In the V2V phase, full-duplex communications and concurrent transmissions are exploited to achieve content sharing between vehicles and improve transmission efficiency. Performance evaluations demonstrate that our proposed scheme reduces the number of time slots and significantly improves system throughput when compared with other schemes, especially under large-size file transfers and a large number of vehicles.

preprint2022arXiv

Cooperative Reflection and Synchronization Design for Distributed Multiple-RIS Communications

To reap the promised gain achieved by distributed reconfigurable intelligent surfaces (RISs)-enhanced communications in a wireless network, timing synchronization among these metasurfaces is an essential prerequisite in practice. This paper proposes a unified framework for the joint estimation of the unknown timing offsets and the RIS channel parameters, as well as the design of cooperative reflection and synchronization algorithm for the distributed multiple-RIS communication. Considering that RIS is usually a passive device with limited capability of signal processing, the individual timing offset and channel gains of each hop of the RIS links cannot be directly estimated. To make the estimation tractable, we propose to estimate the cascaded channels and timing offsets jointly by deriving a maximum likelihood estimator. Furthermore, we theoretically characterize the Cramer-Rao lower bound (CRLB) to evaluate the accuracy of this estimator. By using the proposed estimator and the derived CRLBs, an efficient resynchronization algorithm is devised jointly at the RISs and the destination to compensate the multiple timing offsets. Based on the majorization-minimization framework, the proposed algorithm admits semi-closed and closed form solutions for the RIS reflection matrices and the timing offset equalizer, respectively. Simulation results verify that our theoretical analysis well matches the numerical tests and validate the effectiveness of the proposed resynchronization algorithm.

preprint2022arXiv

Coverage Probability Analysis of RIS-Assisted High-Speed Train Communications

Reconfigurable intelligent surface (RIS) has received increasing attention due to its capability of extending cell coverage by reflecting signals toward receivers. This paper considers a RIS-assisted high-speed train (HST) communication system to improve the coverage probability. We derive the closed-form expression of coverage probability. Moreover, we analyze impacts of some key system parameters, including transmission power, signal-to-noise ratio threshold, and horizontal distance between base station and RIS. Simulation results verify the efficiency of RIS-assisted HST communications in terms of coverage probability.

preprint2022arXiv

Deep Adaptive Arbitrary Polynomial Chaos Expansion: A Mini-data-driven Semi-supervised Method for Uncertainty Quantification

The surrogate model-based uncertainty quantification method has drawn much attention in many engineering fields. Polynomial chaos expansion (PCE) and deep learning (DL) are powerful methods for building a surrogate model. However, PCE needs to increase the expansion order to improve the accuracy of the surrogate model, which causes more labeled data to solve the expansion coefficients, and DL also requires a lot of labeled data to train the deep neural network (DNN). First of all, this paper proposes the adaptive arbitrary polynomial chaos (aPC) and proves two properties about the adaptive expansion coefficients. Based on the adaptive aPC, a semi-supervised deep adaptive arbitrary polynomial chaos expansion (Deep aPCE) method is proposed to reduce the training data cost and improve the surrogate model accuracy. For one hand, the Deep aPCE method uses two properties of the adaptive aPC to assist in training the DNN based on only a small amount of labeled data and many unlabeled data, significantly reducing the training data cost. On the other hand, the Deep aPCE method adopts the DNN to fine-tune the adaptive expansion coefficients dynamically, improving the Deep aPCE model accuracy with lower expansion order. Besides, the Deep aPCE method can directly construct accurate surrogate models of the high dimensional stochastic systems without complex dimension-reduction and model decomposition operations. Five numerical examples and an actual engineering problem are used to verify the effectiveness of the Deep aPCE method.

preprint2022arXiv

Deep Joint Source-Channel Coding for CSI Feedback: An End-to-End Approach

The increased throughput brought by MIMO technology relies on the knowledge of channel state information (CSI) acquired in the base station (BS). To make the CSI feedback overhead affordable for the evolution of MIMO technology (e.g., massive MIMO and ultra-massive MIMO), deep learning (DL) is introduced to deal with the CSI compression task. Based on the separation principle in existing communication systems, DL based CSI compression is used as source coding. However, this separate source-channel coding (SSCC) scheme is inferior to the joint source-channel coding (JSCC) scheme in the finite blocklength regime. In this paper, we propose a deep joint source-channel coding (DJSCC) based framework for the CSI feedback task. In particular, the proposed method can simultaneously learn from the CSI source and the wireless channel. Instead of truncating CSI via Fourier transform in the delay domain in existing methods, we apply non-linear transform networks to compress the CSI. Furthermore, we adopt an SNR adaption mechanism to deal with the wireless channel variations. The extensive experiments demonstrate the validity, adaptability, and generality of the proposed framework.

preprint2022arXiv

Deep Reinforcement Learning Coordinated Receiver Beamforming for Millimeter-Wave Train-ground Communications

As more and more people choose high-speed rail (HSR) as a means of transportation for short trips, there is ever growing demand of high quality of multimedia services. With its rich spectrum resources, millimeter wave (mm-wave) communications can satisfy the high network capacity requirements for HSR. Also, it is possible for receivers (RXs) to be equipped with antenna arrays in mm-wave communication systems due to its short wavelength. However, as HSRs run with high speed, the received signal power (RSP) varies rapidly over a cell and it is the lowest at the edge of the cell compared to other locations. Consequently, it is necessary to conduct research on RX beamforming for HSR in mm-wave band to improve the quality of the received signal. In this paper, we focus on RX beamforming for a mm-wave train-ground communication system. To improve the RSP, we propose an effective RX beamforming scheme based on deep reinforcement learning (DRL), and develop a deep Q-network (DQN) algorithm to train and determine the optimal RX beam direction with the purpose of maximizing average RSP. Through extensive simulations, we demonstrate that the proposed scheme has better performance than the four baseline schemes in terms of average RSP at most positions on the railway.

preprint2022arXiv

Distributed Neural Precoding for Hybrid mmWave MIMO Communications with Limited Feedback

Hybrid precoding is a cost-efficient technique for millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) communications. This paper proposes a deep learning approach by using a distributed neural network for hybrid analog-and-digital precoding design with limited feedback. The proposed distributed neural precoding network, called DNet, is committed to achieving two objectives. First, the DNet realizes channel state information (CSI) compression with a distributed architecture of neural networks, which enables practical deployment on multiple users. Specifically, this neural network is composed of multiple independent sub-networks with the same structure and parameters, which reduces both the number of training parameters and network complexity. Secondly, DNet learns the calculation of hybrid precoding from reconstructed CSI from limited feedback. Different from existing black-box neural network design, the DNet is specifically designed according to the data form of the matrix calculation of hybrid precoding. Simulation results show that the proposed DNet significantly improves the performance up to nearly 50% compared to traditional limited feedback precoding methods under the tests with various CSI compression ratios.

preprint2022arXiv

Driving Potential and Fission-Fragment Charge Distributions

We propose an efficient approach to describe the fission-fragment charge yields for actinides based on the driving potential of fissioning system. Considering the properties of primary fission fragments at their ground states, the driving potential, which represents the potential energies of the system around scission configuration and closely relates to the yields of fragments, can be unambiguously and quickly obtained from the Skyrme energy-density functional together with the Weizsaecker-Skyrme mass model. The fission-fragment charge distributions for thermal-neutroninduced fission and spontaneous fission of a series of actinides, especially the odd-even staggering in charge distributions can be well reproduced. Nuclear dynamical deformations and pairing corrections of fragments play an important role in the charge distributions.

preprint2022arXiv

Intelligent MIMO Detection Using Meta Learning

In a K-best detector for multiple-input-multiple-output(MIMO) systems, the value of K needs to be sufficiently large to achieve near-maximum-likelihood (ML) performance. By treating K as a variable that can be adjusted according to a fitting function of some learnable coefficients, an intelligent MIMO detection network based on deep neural networks (DNN) is proposed to reduce complexity of the detection algorithm with little performance degradation. In particular, the proposed intelligent detection algorithm uses meta learning to learn the coefficients of the fitting function for K to circumvent the problem of learning K directly. The idea of network fusion is used to combine the learning results of the meta learning component networks. Simulation results show that the proposed scheme achieves near-ML detection performance while its complexity is close to that of linear detectors. Besides, it also exhibits strong ability of fast training.

preprint2022arXiv

M2R2: Missing-Modality Robust emotion Recognition framework with iterative data augmentation

This paper deals with the utterance-level modalities missing problem with uncertain patterns on emotion recognition in conversation (ERC) task. Present models generally predict the speaker&#39;s emotions by its current utterance and context, which is degraded by modality missing considerably. Our work proposes a framework Missing-Modality Robust emotion Recognition (M2R2), which trains emotion recognition model with iterative data augmentation by learned common representation. Firstly, a network called Party Attentive Network (PANet) is designed to classify emotions, which tracks all the speakers&#39; states and context. Attention mechanism between speaker with other participants and dialogue topic is used to decentralize dependence on multi-time and multi-party utterances instead of the possible incomplete one. Moreover, the Common Representation Learning (CRL) problem is defined for modality-missing problem. Data imputation methods improved by the adversarial strategy are used here to construct extra features to augment data. Extensive experiments and case studies validate the effectiveness of our methods over baselines for modality-missing emotion recognition on two different datasets.

preprint2022arXiv

Mobility Support for Millimeter Wave Communications: Opportunities and Challenges

Millimeter-wave (mmWave) communication technology offers a potential and promising solution to support 5G and B5G wireless networks in dynamic scenarios and applications. However, mobility introduces many challenges as well as opportunities to mmWave applications. To address these problems, we conduct a survey of the opportunities and technologies to support mmWave communications in mobile scenarios. Firstly, we summarize the mobile scenarios where mmWave communications are exploited, including indoor wireless local area network (WLAN) or wireless personal area network (WPAN), cellular access, vehicle-to-everything (V2X), high speed train (HST), unmanned aerial vehicle (UAV), and the new space-air-ground-sea communication scenarios. Then, to address users&#39; mobility impact on the system performance in different application scenarios, we introduce several representative mobility models in mmWave systems, including human mobility, vehicular mobility, high speed train mobility and ship mobility. Next we survey the key challenges and existing solutions to mmWave applications, such as channel modeling, channel estimation, anti-blockage, and capacity improvement. Lastly, we discuss the open issues concerning mobility-aware mmWave communications that deserve further investigation. In particular, we highlight future heterogeneous mobile networks, dynamic resource management, artificial intelligence (AI) for mobility and integration of geographical information, deployment of large intelligent surface and reconfigurable antenna technology, and finally, the evolution to Terahertz (THz) communications.

preprint2022arXiv

Nodal and nematic superconducting phases in NbSe2 monolayers from competing superconducting channels

Transition metal dichalcogenides like 2H-NbSe2 in their two-dimensional (2D) form exhibit Ising superconductivity with the quasiparticle spins are firmly pinned in the direction perpendicular to the basal plane. This enables them to withstand exceptionally high magnetic fields beyond the Pauli limit for superconductivity. Using field-angle-resolved magnetoresistance experiments for fields rotated in the basal plane we investigate the field-angle dependence of the upper critical field (Hc2), which directly reflects the symmetry of the superconducting order parameter. We observe a six-fold nodal symmetry superposed on a two-fold symmetry. This agrees with theoretical predictions of a nodal topological superconducting phase near Hc2, together with a nematic superconducting state. We demonstrate that in NbSe2 such unconventional superconducting states can arise from the presence of several competing superconducting channels.

preprint2022arXiv

NTIRE 2022 Challenge on Super-Resolution and Quality Enhancement of Compressed Video: Dataset, Methods and Results

This paper reviews the NTIRE 2022 Challenge on Super-Resolution and Quality Enhancement of Compressed Video. In this challenge, we proposed the LDV 2.0 dataset, which includes the LDV dataset (240 videos) and 95 additional videos. This challenge includes three tracks. Track 1 aims at enhancing the videos compressed by HEVC at a fixed QP. Track 2 and Track 3 target both the super-resolution and quality enhancement of HEVC compressed video. They require x2 and x4 super-resolution, respectively. The three tracks totally attract more than 600 registrations. In the test phase, 8 teams, 8 teams and 12 teams submitted the final results to Tracks 1, 2 and 3, respectively. The proposed methods and solutions gauge the state-of-the-art of super-resolution and quality enhancement of compressed video. The proposed LDV 2.0 dataset is available at https://github.com/RenYang-home/LDV_dataset. The homepage of this challenge (including open-sourced codes) is at https://github.com/RenYang-home/NTIRE22_VEnh_SR.

preprint2022arXiv

Reconfigurable Intelligent Surface With Energy Harvesting Assisted Cooperative Ambient Backscatter Communications

The performance of cooperative ambient backscatter communications (CABC) can be enhanced by employing reconfigurable intelligent surface (RIS) to assist backscatter transmitters. Since the RIS power consumption is a non-negligible issue, we consider a RIS assisted CABC system where the RIS with energy harvesting circuit can not only reflect signal but also harvest wireless energy. We study a transmission design problem to minimize the RIS power consumption with the quality of service constraints for both active and backscatter transmissions. The optimization problem is a mixed-integer non-convex programming problem which is NP-hard. To tackle it, an algorithm is proposed by employing the block coordinate descent, semidefinite relaxation and alternating direction method of multipliers techniques. Simulation results demonstrate the effectiveness of the proposed algorithm.

preprint2022arXiv

Resource Allocation and Computation Offloading in a Millimeter-Wave Train-Ground Network

In this paper, we consider an mmWave-based trainground communication system in the high-speed railway (HSR) scenario, where the computation tasks of users can be partially offloaded to the rail-side base station (BS) or the mobile relays (MRs) deployed on the roof of the train. The MRs operate in the full-duplex (FD) mode to achieve high spectrum utilization. We formulate the problem of minimizing the average task execution latency of all users, under local device and MRs energy consumption constraints. We propose a joint resource allocation and computation offloading scheme (JRACO) to solve the problem. It consists of a resource allocation and computation offloading (RACO) algorithm and an MR Energy constraint algorithm. RACO utilizes the matching game theory to iterate between two subproblems, i.e., data segmentation and user association and sub-channel allocation. With the RACO results, the MR energy constraint algorithm ensures that the MR energy consumption constraint is satisfied. Extensive simulations validate that JRACO can effectively reduce the average latency and increase the number of served users compared with three baseline schemes.

preprint2022arXiv

RIS-Assisted Quasi-Static Broad Coverage for Wideband mmWave Massive MIMO Systems

Reconfigurable intelligent surfaces (RISs) can establish favorable wireless environments to combat the severe attenuation and blockages in millimeter-wave (mmWave) bands. However, to achieve the optimal enhancement of performance, the instantaneous channel state information (CSI) needs to be estimated at the cost of a large overhead that scales with the number of RIS elements and the number of users. In this paper, we design a quasi-static broad coverage at the RIS with the reduced overhead based on the statistical CSI. We propose a design framework to synthesize the power pattern reflected by the RIS that meets the customized requirements of broad coverage. For the communication of broadcast channels, we generalize the broad coverage of the single transmit stream to the scenario of multiple streams. Moreover, we employ the quasi-static broad coverage for a multiuser orthogonal frequency division multiplexing access (OFDMA) system, and derive the analytical expression of the downlink rate, which is proved to increase logarithmically with the power gain reflected by the RIS. By taking into account the overhead of channel estimation, the proposed quasi-static broad coverage even outperforms the design method that optimizes the RIS phases using the instantaneous CSI. Numerical simulations are conducted to verify these observations.

preprint2022arXiv

Robust Transmission Scheduling for UAV-assisted Millimeter-Wave Train-Ground Communication System

With the explosive growth of mobile data, the demand of high-speed railway (HSR) passengers for broadband wireless access services urgently needs the support of ultra-highspeed scenario broadband wireless communication. Millimeterwave (mmWave) can achieve high data transmission rates, but it is accompanied by high propagation loss and vulnerability to blockage. To address this issue, developments of directional antennas and unmanned aerial vehicles (UAVs) enhance the robustness of the mmWave train-ground communication system. In this paper, we propose a UAV and MRs relay assistance (UMRA) algorithm to effectively overcome link blockage, which can maximize the number of transmission flows on the premise of meeting QoS requirements and channel qualities. First, we formulate a mixed integer nonlinear programming (MINLP) problem for UAV trajectory design and transmission scheduling in the full-duplex (FD) mode. Then, in UMRA, the relay decision algorithm and transmission scheduling algorithm based on graph theory are proposed, which make a good tradeoff between computation complexity and system performance. Extensive simulation results show that a suitable UAV position will greatly improve the performance of the UMRA algorithm and make it close to the optimal solution. Compared with the other two existing benchmark schemes, with the high channel quality requirements and large-area blockage, UMRA can greatly improve the number of completed flows and system throughput.

preprint2022arXiv

Scheduling of UAV-assisted Millimeter Wave Communications for High-Speed Railway

To exploit richer spectrum resources for even better service quality, millimeter wave (mmWave) communication has been considered for high-speed railway (HSR) communication systems. In this paper, we focus on scheduling as many flows as possible while satisfying their QoS requirements. Due to interference, eavesdropping, or other problems, some flows may not be directly transmitted from the track-side BS. In this paper, we propose an UAV-assisted scheduling scheme which utilizes a UAV to serve as relay for such flows. The proposed scheme also utilize two mmWave bands, one for the BS links and the other for the UAV links. The proposed algorithm aims to maximize the number of flows with their QoS requirements satisfied. Simulations demonstrate that the proposed scheme achieves a superior performance on the number of completed flows and the system throughput over two baseline schemes.

preprint2022arXiv

Spatial Parsing and Dynamic Temporal Pooling networks for Human-Object Interaction detection

The key of Human-Object Interaction(HOI) recognition is to infer the relationship between human and objects. Recently, the image&#39;s Human-Object Interaction(HOI) detection has made significant progress. However, there is still room for improvement in video HOI detection performance. Existing one-stage methods use well-designed end-to-end networks to detect a video segment and directly predict an interaction. It makes the model learning and further optimization of the network more complex. This paper introduces the Spatial Parsing and Dynamic Temporal Pooling (SPDTP) network, which takes the entire video as a spatio-temporal graph with human and object nodes as input. Unlike existing methods, our proposed network predicts the difference between interactive and non-interactive pairs through explicit spatial parsing, and then performs interaction recognition. Moreover, we propose a learnable and differentiable Dynamic Temporal Module(DTM) to emphasize the keyframes of the video and suppress the redundant frame. Furthermore, the experimental results show that SPDTP can pay more attention to active human-object pairs and valid keyframes. Overall, we achieve state-of-the-art performance on CAD-120 dataset and Something-Else dataset.

preprint2022arXiv

The bipartite Turan number and spectral extremum for linear forests

The bipartite Turán number of a graph $H$, denoted by $ex(m,n; H)$, is the maximum number of edges in any bipartite graph $G=(X,Y; E)$ with $|X|=m$ and $|Y|=n$ which does not contain $H$ as a subgraph. In this paper, we determined $ex(m,n; F_{\ell})$ for arbitrary $\ell$ and appropriately large $n$ with comparing to $m$ and $\ell$, where $F_\ell$ is a linear forest which consists of $\ell$ vertex disjoint paths. Moreover, the extremal graphs have been characterized. Furthermore, these results are used to obtain the maximum spectral radius of bipartite graphs which does not contain $F_{\ell}$ as a subgraph and characterize all extremal graphs which attain the maximum spectral radius.

preprint2022arXiv

Transport Model Comparison Studies of Intermediate-Energy Heavy-Ion Collisions

Transport models are the main method to obtain physics information from low to relativistic-energy heavy-ion collisions. The Transport Model Evaluation Project (TMEP) has been pursued to test the robustness of transport model predictions in reaching consistent conclusions from the same type of physical model. Calculations under controlled conditions of physical input and set-up were performed with various participating codes. These included both calculations of nuclear matter in a box with periodic boundary conditions, and more realistic calculations of heavy-ion collisions. In this intermediate review, we summarize and discuss the present status of the project. We also provide condensed descriptions of the 26 participating codes, which contributed to some part of the project. These include the major codes in use today. We review the main results of the studies completed so far. They show, that in box calculations the differences between the codes can be well understood and a convergence of the results can be reached. These studies also highlight the systematic differences between the two families of transport codes, known as BUU and QMD type codes. However, when the codes were compared in full heavy-ion collisions using different physical models, as recently for pion production, they still yielded substantially different results. This calls for further comparisons of heavy-ion collisions with controlled models and of box comparisons of important ingredients, like momentum-dependent fields, which are currently underway. We often indicate improved strategies in performing transport simulations and thus provide guidance to code developers. Results of transport simulations of heavy-ion collisions from a given code will have more significance if the code can be validated against benchmark calculations such as the ones summarized in this review.

preprint2022arXiv

Triple-Band Scheduling with Millimeter Wave and Terahertz Bands for Wireless Backhaul

With the explosive growth of mobile traffic demand, densely deployed small cells underlying macrocells have great potential for 5G and beyond wireless networks. In this paper, we consider the problem of supporting traffic flows with diverse QoS requirements by exploiting three high frequency bands, i.e., the 28GHz band, the E-band, and the Terahertz (THz) band. The cooperation of the three bands is helpful for maximizing the number of flows with their QoS requirements satisfied. To solve the formulated nonlinear integer programming problem, we propose a triple-band scheduling scheme which can select the optimum scheduling band for each flow among three different frequency bands. The proposed scheme also efficiently utilizes the resource to schedule flow transmissions in time slots. Extensive simulations demonstrate the superior performance of the proposed scheme over three baseline schemes with respect to the number of completed flows and the system throughput.

preprint2021arXiv

Bridging the gap between atomically thin semiconductors and metal leads

Electrically interfacing atomically thin transition metal dichalcogenide semiconductors (TMDSCs) with metal leads is challenging because of undesired interface barriers, which have drastically constrained the electrical performance of TMDSC devices for exploring their unconventional physical properties and realizing potential electronic applications. Here we demonstrate a strategy to achieve nearly barrier-free electrical contacts with few-layer TMDSCs by engineering interfacial bonding distortion. The carrier-injection efficiency of such electrical junction is substantially increased with robust ohmic behaviors from room to cryogenic temperatures. The performance enhancements of TMDSC field-effect transistors are well reflected by the ultralow contact resistance (down to 90 Ohm um in MoS2, towards the quantum limit), the ultrahigh field-effect mobility (up to 358,000 cm2V-1s-1 in WSe2) and the prominent transport characteristics at cryogenic temperatures. This method also offers new possibilities of the local manipulation of structures and electronic properties for TMDSC device design.

preprint2021arXiv

Current-induced magnetization switching in a chemically disordered A1 CoPt single layer

We report the first demonstration of the current-induced magnetization switching in a perpendicularly magnetized A1 CoPt single layer. We show that good perpendicular magnetic anisotropy can be obtained in a wide composition range of the A1 Co1-xPtx single layers, which allows to fabricate perpendicularly magnetized CoPt single layer with composition gradient to break the inversion symmetry of the structure. By fabricating the gradient CoPt single layer, we have evaluated the SOT efficiency and successfully realized the SOT-induced magnetization switching. Our study provides an approach to realize the current-induced magnetization in the ferromagnetic single layers without attaching SOT source materials.

preprint2021arXiv

Explainable CNN-attention Networks (C-Attention Network) for Automated Detection of Alzheimer&#39;s Disease

In this work, we propose three explainable deep learning architectures to automatically detect patients with Alzheimer`s disease based on their language abilities. The architectures use: (1) only the part-of-speech features; (2) only language embedding features and (3) both of these feature classes via a unified architecture. We use self-attention mechanisms and interpretable 1-dimensional ConvolutionalNeural Network (CNN) to generate two types of explanations of the model`s action: intra-class explanation and inter-class explanation. The inter-class explanation captures the relative importance of each of the different features in that class, while the inter-class explanation captures the relative importance between the classes. Note that although we have considered two classes of features in this paper, the architecture is easily expandable to more classes because of its modularity. Extensive experimentation and comparison with several recent models show that our method outperforms these methods with an accuracy of 92.2% and F1 score of 0.952on the DementiaBank dataset while being able to generate explanations. We show by examples, how to generate these explanations using attention values.

preprint2021arXiv

Optimal Lockdown Policy for Covid-19: A Modelling Study

As the COVID19 spreads across the world, prevention measures are becoming the essential weapons to combat the pandemic in the period of crisis. The lockdown measure is the most controversial one as it imposes an overwhelming impact on our economy and society. Especially when and how to enforce the lockdown measures are the most challenging questions considering both economic and epidemiological costs. In this paper, we extend the classic SIR model to find optimal decision making to balance between economy and people&#39;s health during the outbreak of COVID-19. In our model, we intend to solve a two phases optimization problem: policymakers control the lockdown rate to maximize the overall welfare of the society; people in different health statuses take different decisions on their working hours and consumption to maximize their utility. We develop a novel method to estimate parameters for the model through various additional sources of data. We use the Cournot equilibrium to model people&#39;s behavior and also consider the cost of death in order to leverage between economic and epidemic costs. The analysis of simulation results provides scientific suggestions for policymakers to make critical decisions on when to start the lockdown and how strong it should be during the whole period of the outbreak. Although the model is originally proposed for the COVID19 pandemic, it can be generalized to address similar problems to control the outbreak of other infectious diseases with lockdown measures.

preprint2021arXiv

Symmetry-Protected Topological relationship between $SU(3)$ and $SU(2)\times{U(1)}$ in Two Dimension

Symmetry-protected topological $\left(SPT\right)$ phases are gapped short-range entangled states with symmetry $G$, which can be systematically described by group cohomology theory. $SU(3)$ and $SU(2)\times{U(1)}$ are considered as the basic groups of Quantum Chromodynamics and Weak-Electromagnetic unification, respectively. In two dimension $(2D)$, nonlinear-sigma models with a quantized topological Theta term can be used to describe nontrivial SPT phases. By coupling the system to a probe field and integrating out the group variables, the Theta term becomes the effective action of Chern-Simons theory which can derive the response current density. As a result, the current shows a spin Hall effect, and the quantized number of the spin Hall conductance of SPT phases $SU(3)$ and $SU(2)\times{U(1)}$ are same. In addition, relationships between $SU(3)$ and $SU(2)\times{U(1)}$ which maps $SU(3)$ to $SU(2)$ with a rotation $U(1)$ will be given.

preprint2020arXiv

AlphaBlock: An Evaluation Framework for Blockchain Consensus Protocols

Consensus protocols play a pivotal role to balance security and efficiency in blockchain systems. In this paper, we propose an evaluation framework for blockchain consensus protocols termed as AlphaBlock. In this framework, we compare the overall performance of Byzantine Fault Tolerant (BFT) consensus and Nakamoto Consensus (NC). BFT consensus is reached by multiple rounds of quorum votes from the supermajority, while NC is reached by accumulating credibility with the implicit voting from appending blocks. AlphaBlock incorporates the key concepts of Hotstu BFT (HBFT) and Proof-of-authority (PoA) as the case study of BFT and NC. Using this framework, we compare the throughput and latency of HBFT and PoA with practical network and blockchain configurations. Our results show that the performance of HBFT dominates PoA in most scenarios due to the absence of forks in HBFT. Moreover, we find out a set of optimal configurations in AlphaBlock, which sheds a light for improving the performance of blockchain consensus algorithms.

preprint2020arXiv

Cascaded Regression Tracking: Towards Online Hard Distractor Discrimination

Visual tracking can be easily disturbed by similar surrounding objects. Such objects as hard distractors, even though being the minority among negative samples, increase the risk of target drift and model corruption, which deserve additional attention in online tracking and model update. To enhance the tracking robustness, in this paper, we propose a cascaded regression tracker with two sequential stages. In the first stage, we filter out abundant easily-identified negative candidates via an efficient convolutional regression. In the second stage, a discrete sampling based ridge regression is designed to double-check the remaining ambiguous hard samples, which serves as an alternative of fully-connected layers and benefits from the closed-form solver for efficient learning. Extensive experiments are conducted on 11 challenging tracking benchmarks including OTB-2013, OTB-2015, VOT2018, VOT2019, UAV123, Temple-Color, NfS, TrackingNet, LaSOT, UAV20L, and OxUvA. The proposed method achieves state-of-the-art performance on prevalent benchmarks, while running in a real-time speed.

preprint2020arXiv

Exciton solid in bilayer two dimensional electron-hole systems

We propose a state of excitonic solid for double layer two dimensional electron hole systems in transition metal dicalcogenides stacked on opposite sides of thin layers of BN. Properties of the exciton lattice such as its Lindemann ratio and possible supersolid behaviour are studied. We found that the solid can be stabilized relative to the fluid by the potential due to the BN.

preprint2020arXiv

Explainable Rumor Detection using Inter and Intra-feature Attention Networks

With social media becoming ubiquitous, information consumption from this media has also increased. However, one of the serious problems that have emerged with this increase, is the propagation of rumors. Therefore, rumor identification is a very critical task with significant implications to economy, democracy as well as public health and safety. We tackle the problem of automated detection of rumors in social media in this paper by designing a modular explainable architecture that uses both latent and handcrafted features and can be expanded to as many new classes of features as desired. This approach will allow the end user to not only determine whether the piece of information on the social media is real of a rumor, but also give explanations on why the algorithm arrived at its conclusion. Using attention mechanisms, we are able to interpret the relative importance of each of these features as well as the relative importance of the feature classes themselves. The advantage of this approach is that the architecture is expandable to more handcrafted features as they become available and also to conduct extensive testing to determine the relative influences of these features in the final decision. Extensive experimentation on popular datasets and benchmarking against eleven contemporary algorithms, show that our approach performs significantly better in terms of F-score and accuracy while also being interpretable.

preprint2020arXiv

KCN: Knowledge Centric Networking

The advent of multi-domain and multi-requirement digital services requires an underlying network ecosystem able to understand service-specific contexts. In this work, we propose Knowledge Centric Networking (KCN), a paradigm in which knowledge is positioned at the center of the networking landscape. KCN enables approaches by which in-network knowledge generation and distribution can be used to support advanced network control intelligence that is essential to handle complexity and uncertainty in these emerging digital services. In this paper, we introduce the principles of KCN and present an architecture for its realization that enables in-network knowledge creation, distribution, storage and processing, both within a single domain/player and across potentially heterogeneous domains/players.

preprint2020arXiv

NAS-FCOS: Fast Neural Architecture Search for Object Detection

The success of deep neural networks relies on significant architecture engineering. Recently neural architecture search (NAS) has emerged as a promise to greatly reduce manual effort in network design by automatically searching for optimal architectures, although typically such algorithms need an excessive amount of computational resources, e.g., a few thousand GPU-days. To date, on challenging vision tasks such as object detection, NAS, especially fast versions of NAS, is less studied. Here we propose to search for the decoder structure of object detectors with search efficiency being taken into consideration. To be more specific, we aim to efficiently search for the feature pyramid network (FPN) as well as the prediction head of a simple anchor-free object detector, namely FCOS, using a tailored reinforcement learning paradigm. With carefully designed search space, search algorithms and strategies for evaluating network quality, we are able to efficiently search a top-performing detection architecture within 4 days using 8 V100 GPUs. The discovered architecture surpasses state-of-the-art object detection models (such as Faster R-CNN, RetinaNet and FCOS) by 1.5 to 3.5 points in AP on the COCO dataset, with comparable computation complexity and memory footprint, demonstrating the efficacy of the proposed NAS for object detection.

preprint2020arXiv

Negative compressibility in MoS2 capacitance

Large capacitance enhancement is useful for increasing the gate capacitance of field-effect transistors (FETs) to produce low-energy-consuming devices with improved gate controllability. We report strong capacitance enhancement effects in a newly emerged two-dimensional channel material, molybdenum disulfide (MoS2). The enhancement effects are due to strong electron-electron interaction at the low carrier density regime in MoS2. We achieve about 50% capacitance enhancement in monolayer devices and 10% capacitance enhancement in bilayer devices. However, the enhancement effect is not obvious in multilayer (layer number >3) devices. Using the Hartree-Fock approximation, we illustrate the same trend in our inverse compressibility data.

preprint2020arXiv

Personalized Early Stage Alzheimer&#39;s Disease Detection: A Case Study of President Reagan&#39;s Speeches

Alzheimer`s disease (AD)-related global healthcare cost is estimated to be $1 trillion by 2050. Currently, there is no cure for this disease; however, clinical studies show that early diagnosis and intervention helps to extend the quality of life and inform technologies for personalized mental healthcare. Clinical research indicates that the onset and progression of Alzheimer`s disease lead to dementia and other mental health issues. As a result, the language capabilities of patient start to decline. In this paper, we show that machine learning-based unsupervised clustering of and anomaly detection with linguistic biomarkers are promising approaches for intuitive visualization and personalized early stage detection of Alzheimer`s disease. We demonstrate this approach on 10 year`s (1980 to 1989) of President Ronald Reagan`s speech data set. Key linguistic biomarkers that indicate early-stage AD are identified. Experimental results show that Reagan had early onset of Alzheimer`s sometime between 1983 and 1987. This finding is corroborated by prior work that analyzed his interviews using a statistical technique. The proposed technique also identifies the exact speeches that reflect linguistic biomarkers for early stage AD.

preprint2020arXiv

Progress of Quantum Molecular Dynamics model and its applications in Heavy Ion Collisions

In this review article, we first briefly introduce the transport theory and quantum molecular dynamics model applied in the study of the heavy ion collisions from low to intermediate energies. The developments of improved quantum molecular dynamics model (ImQMD) and ultra-relativistic quantum molecular dynamics model (UrQMD), are reviewed. The reaction mechanism and phenomena related to the fusion, multinucleon transfer, fragmentation, collective flow and particle production are reviewed and discussed within the framework of the two models. The constraints on the isospin asymmetric nuclear equation of state and in-medium nucleon-nucleon cross sections by comparing the heavy ion collision data with transport models calculations in last decades are also discussed, and the uncertainties of these constraints are analyzed as well. Finally, we discuss the future direction of the development of the transport models for improving the understanding of the reaction mechanism, the descriptions of various observables, the constraint on the nuclear equation of state, as well as for the constraint on in-medium nucleon-nucleon cross sections.

preprint2020arXiv

Recurrent Feature Reasoning for Image Inpainting

Existing inpainting methods have achieved promising performance for recovering regular or small image defects. However, filling in large continuous holes remains difficult due to the lack of constraints for the hole center. In this paper, we devise a Recurrent Feature Reasoning (RFR) network which is mainly constructed by a plug-and-play Recurrent Feature Reasoning module and a Knowledge Consistent Attention (KCA) module. Analogous to how humans solve puzzles (i.e., first solve the easier parts and then use the results as additional information to solve difficult parts), the RFR module recurrently infers the hole boundaries of the convolutional feature maps and then uses them as clues for further inference. The module progressively strengthens the constraints for the hole center and the results become explicit. To capture information from distant places in the feature map for RFR, we further develop KCA and incorporate it in RFR. Empirically, we first compare the proposed RFR-Net with existing backbones, demonstrating that RFR-Net is more efficient (e.g., a 4\% SSIM improvement for the same model size). We then place the network in the context of the current state-of-the-art, where it exhibits improved performance. The corresponding source code is available at: https://github.com/jingyuanli001/RFR-Inpainting

preprint2020arXiv

Unsupervised Deep Representation Learning for Real-Time Tracking

The advancement of visual tracking has continuously been brought by deep learning models. Typically, supervised learning is employed to train these models with expensive labeled data. In order to reduce the workload of manual annotations and learn to track arbitrary objects, we propose an unsupervised learning method for visual tracking. The motivation of our unsupervised learning is that a robust tracker should be effective in bidirectional tracking. Specifically, the tracker is able to forward localize a target object in successive frames and backtrace to its initial position in the first frame. Based on such a motivation, in the training process, we measure the consistency between forward and backward trajectories to learn a robust tracker from scratch merely using unlabeled videos. We build our framework on a Siamese correlation filter network, and propose a multi-frame validation scheme and a cost-sensitive loss to facilitate unsupervised learning. Without bells and whistles, the proposed unsupervised tracker achieves the baseline accuracy as classic fully supervised trackers while achieving a real-time speed. Furthermore, our unsupervised framework exhibits a potential in leveraging more unlabeled or weakly labeled data to further improve the tracking accuracy.

preprint2019arXiv

Plasmonic Heterodyne Spectrometry for Resolving the Spectral Signatures of Ammonia over a 1-5 THz Frequency Range

We present a heterodyne terahertz spectrometry platform based on plasmonic photomixing, which enables the resolution of narrow spectral signatures of gases over a broad terahertz frequency range. This plasmonic heterodyne spectrometer replaces the terahertz mixer and local oscillator of conventional heterodyne spectrometers with a plasmonic photomixer and a heterodyning optical pump beam, respectively. The heterodyning optical pump beam is formed by two continuous-wave, wavelength-tunable lasers with a broadly tunable terahertz beat frequency. This broadly tunable terahertz beat frequency enables spectrometry over a broad bandwidth, which is not restricted by the bandwidth limitations of conventional terahertz mixers and local oscillators. We use this plasmonic heterodyne spectrometry platform to resolve the spectral signatures of ammonia over a 1-5 THz frequency range.

preprint2019arXiv

Real-Time Correlation Tracking via Joint Model Compression and Transfer

Correlation filters (CF) have received considerable attention in visual tracking because of their computational efficiency. Leveraging deep features via off-the-shelf CNN models (e.g., VGG), CF trackers achieve state-of-the-art performance while consuming a large number of computing resources. This limits deep CF trackers to be deployed to many mobile platforms on which only a single-core CPU is available. In this paper, we propose to jointly compress and transfer off-the-shelf CNN models within a knowledge distillation framework. We formulate a CNN model pretrained from the image classification task as a teacher network, and distill this teacher network into a lightweight student network as the feature extractor to speed up CF trackers. In the distillation process, we propose a fidelity loss to enable the student network to maintain the representation capability of the teacher network. Meanwhile, we design a tracking loss to adapt the objective of the student network from object recognition to visual tracking. The distillation process is performed offline on multiple layers and adaptively updates the student network using a background-aware online learning scheme. Extensive experiments on five challenging datasets demonstrate that the lightweight student network accelerates the speed of state-of-the-art deep CF trackers to real-time on a single-core CPU while maintaining almost the same tracking accuracy.

preprint2018arXiv

Intrinsic valley Hall transport in atomically thin MoS2

Electrons hopping in two-dimensional honeycomb lattices possess a valley degree of freedom in addition to charge and spin. In the absence of inversion symmetry, these systems were predicted to exhibit opposite Hall effects for electrons from different valleys. Such valley Hall effects have been achieved only by extrinsic means, such as substrate coupling, dual gating, and light illuminating. Here, we report the first observation of intrinsic valley Hall transport without any extrinsic symmetry breaking in the non-centrosymmetric monolayer and trilayer MoS2, evidenced by considerable nonlocal resistance that scales cubically with local resistance. Such a hallmark survives even at room temperature with a valley diffusion length at micron scale. By contrast, no valley Hall signal is observed in the centrosymmetric bilayer MoS2. Our work elucidates the topological quantum origin of valley Hall effects and marks a significant step towards the purely electrical control of valley degree of freedom in topological valleytronics.