Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
39works
0followers
25topics
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

39 published item(s)

preprint2026arXiv

Self-Consistent Latent Reasoning: Long Latent Sequence Reasoning for Vision-Language Model

In language reasoning, longer chains of thought consistently yield better performance, which naturally suggests that visual latent reasoning may likewise benefit from longer latent sequences. However, we discover a counterintuitive phenomenon: the performance of existing latent visual reasoning methods systematically degrades as the latent sequence grows longer. We reveal the root cause: Information Gain Collapse -- autoregressive generation makes each step highly dependent on prior outputs, so subsequent tokens can barely introduce new information. We further identify that heavily pooled ($\geq 128\times$) image embeddings used as supervision targets provide no more signal than meaningless placeholders. Motivated by these insights, we propose SCOLAR (Self-COnsistent LAtent Reasoning), which introduces a lightweight detransformer that leverages the LLM's full-sequence hidden states to generate auxiliary visual tokens in a single shot, with each token independently anchored to the original visual space. Combined with three-stage SFT and ALPO reinforcement learning, SCOLAR extends acceptable latent CoT length by over $30\times$, achieves state-of-the-art among open-source models on real-world reasoning benchmarks (+14.12% over backbone), and demonstrates strong out-of-distribution generalization.

preprint2026arXiv

TIE: Time Interval Encoding for Video Generation over Events

Director-style prompting, robotic action prediction, and interactive video agents demand temporal grounding over concurrent events -- a regime in which 68% of general clips and over 99% of robotics/gameplay clips contain overlapping events, yet existing multi-event generators rest on a single-active-prompt assumption. However, modern video generators, such as Diffusion Transformers (DiT), represent time as discrete points through point-wise positional encodings. This formulation creates a fundamental dimension mismatch: temporally extended intervals and overlapping events are mathematically unrepresentable to the attention mechanism. In this paper, we propose Time Interval Encoding (TIE), a principled, plug-and-play interval-aware generalization of rotary embeddings that elevates time intervals to first-class primitives inside DiT cross-attention. Rather than introducing another heuristic interval embedding, we show that, within RoPE-compatible bilinear attention, TIE is characterized by two basic principles: Temporal Integrability, which requires an event to aggregate positional evidence over its full duration, and Duration Invariance, which removes the trivial bias toward longer intervals. Under a uniform kernel, this characterization yields an efficient closed-form sinc-based solution that preserves the standard attention interface and naturally attenuates boundary noise through interval integration. Empirically, TIE preserves the visual quality of the base DiT model while substantially improving temporal controllability. In our experiments on the OmniEvents dataset, it improves human-verified Temporal Constraint Satisfaction Rate from 77.34% to 96.03% and reduces temporal boundary error from 0.261s to 0.073s, while also improving trajectory-level temporal alignment metrics. The code and dataset are available at https://github.com/MatrixTeam-AI/TIE.

preprint2024arXiv

Lightweight Adaptive Feature De-drifting for Compressed Image Classification

JPEG is a widely used compression scheme to efficiently reduce the volume of transmitted images. The artifacts appear among blocks due to the information loss, which not only affects the quality of images but also harms the subsequent high-level tasks in terms of feature drifting. High-level vision models trained on high-quality images will suffer performance degradation when dealing with compressed images, especially on mobile devices. Numerous learning-based JPEG artifact removal methods have been proposed to handle visual artifacts. However, it is not an ideal choice to use these JPEG artifact removal methods as a pre-processing for compressed image classification for the following reasons: 1. These methods are designed for human vision rather than high-level vision models; 2. These methods are not efficient enough to serve as pre-processing on resource-constrained devices. To address these issues, this paper proposes a novel lightweight AFD module to boost the performance of pre-trained image classification models when facing compressed images. First, a FDE-Net is devised to generate the spatial-wise FDM in the DCT domain. Next, the estimated FDM is transmitted to the FE-Net to generate the mapping relationship between degraded features and corresponding high-quality features. A simple but effective RepConv block equipped with structural re-parameterization is utilized in FE-Net, which enriches feature representation in the training phase while maintaining efficiency in the deployment phase. After training on limited compressed images, the AFD-Module can serve as a "plug-and-play" model for pre-trained classification models to improve their performance on compressed images. Experiments demonstrate that our proposed AFD module can comprehensively improve the accuracy of the pre-trained classification models and significantly outperform the existing methods.

preprint2024arXiv

Topologically mildly mixing of higher orders along generalized polynomials

This paper is devoted to studying the multiple recurrent property of topologically mildly mixing systems along generalized polynomials. We show that if a minimal system is topologically mildly mixing, then it is mild mixing of higher orders along generalized polynomials. Precisely, suppose that $(X, T)$ is a topologically mildly mixing minimal system, $d\in \mathbb{N}$, $p_1, \dots, p_d$ are integer-valued generalized polynomials with $(p_1, \dots, p_d)$ non-degenerate. Then for all non-empty open subsets $U , V_1, \dots, V_d $ of $X$, $$\{n\in \Z: U\cap T^{-p_1(n) }V_1 \cap \dots \cap T^{-p_d(n) }V_d \neq \emptyset \}$$ is an IP$^*$-set.

preprint2023arXiv

From Ember to Blaze: Swift Interactive Video Adaptation via Meta-Reinforcement Learning

Maximizing quality of experience (QoE) for interactive video streaming has been a long-standing challenge, as its delay-sensitive nature makes it more vulnerable to bandwidth fluctuations. While reinforcement learning (RL) has demonstrated great potential, existing works are either limited by fixed models or require enormous data/time for online adaptation, which struggle to fit time-varying and diverse network states. Driven by these practical concerns, we perform large-scale measurements on WeChat for Business's interactive video service to study real-world network fluctuations. Surprisingly, our analysis shows that, compared to time-varying network metrics, network sequences exhibit noticeable short-term continuity, sufficient for few-shot learning requirements. We thus propose Fiammetta, the first meta-RL-based bitrate adaptation algorithm for interactive video streaming. Building on the short-term continuity, Fiammetta accumulates learning experiences through offline meta-training and enables fast online adaptation to changing network states through a few gradient updates. Moreover, Fiammetta innovatively incorporates a probing mechanism for real-time monitoring of network states, and proposes an adaptive meta-testing mechanism for seamless adaptation. We implement Fiammetta on a testbed whose end-to-end network follows the real-world WeChat for Business traces. The results show that Fiammetta outperforms prior algorithms significantly, improving video bitrate by 3.6%-16.2% without increasing stalling rate.

preprint2023arXiv

P3DC-Shot: Prior-Driven Discrete Data Calibration for Nearest-Neighbor Few-Shot Classification

Nearest-Neighbor (NN) classification has been proven as a simple and effective approach for few-shot learning. The query data can be classified efficiently by finding the nearest support class based on features extracted by pretrained deep models. However, NN-based methods are sensitive to the data distribution and may produce false prediction if the samples in the support set happen to lie around the distribution boundary of different classes. To solve this issue, we present P3DC-Shot, an improved nearest-neighbor based few-shot classification method empowered by prior-driven data calibration. Inspired by the distribution calibration technique which utilizes the distribution or statistics of the base classes to calibrate the data for few-shot tasks, we propose a novel discrete data calibration operation which is more suitable for NN-based few-shot classification. Specifically, we treat the prototypes representing each base class as priors and calibrate each support data based on its similarity to different base prototypes. Then, we perform NN classification using these discretely calibrated support data. Results from extensive experiments on various datasets show our efficient non-learning based method can outperform or at least comparable to SOTA methods which need additional learning steps.

preprint2022arXiv

Application of Data Encryption in Chinese Named Entity Recognition

Recently, with the continuous development of deep learning, the performance of named entity recognition tasks has been dramatically improved. However, the privacy and the confidentiality of data in some specific fields, such as biomedical and military, cause insufficient data to support the training of deep neural networks. In this paper, we propose an encryption learning framework to address the problems of data leakage and inconvenient disclosure of sensitive data in certain domains. We introduce multiple encryption algorithms to encrypt training data in the named entity recognition task for the first time. In other words, we train the deep neural network using the encrypted data. We conduct experiments on six Chinese datasets, three of which are constructed by ourselves. The experimental results show that the encryption method achieves satisfactory results. The performance of some models trained with encrypted data even exceeds the performance of the unencrypted method, which verifies the effectiveness of the introduced encryption method and solves the problem of data leakage to a certain extent.

preprint2022arXiv

Asymmetric Differential Privacy

Differential privacy (DP) is getting attention as a privacy definition when publishing statistics of a dataset. This paper focuses on the limitation that DP inevitably causes two-sided error, which is not desirable for epidemic analysis such as how many COVID-19 infected individuals visited location A. For example, consider publishing misinformation that many infected people did not visit location A, which may lead to miss decision-making that expands the epidemic. To fix this issue, we propose a relaxation of DP, called asymmetric differential privacy (ADP). We show that ADP can provide reasonable privacy protection while achieving one-sided error. Finally, we conduct experiments to evaluate the utility of proposed mechanisms for epidemic analysis using a real-world dataset, which shows the practicality of our mechanisms.

preprint2022arXiv

Background Activation Suppression for Weakly Supervised Object Localization

Weakly supervised object localization (WSOL) aims to localize objects using only image-level labels. Recently a new paradigm has emerged by generating a foreground prediction map (FPM) to achieve localization task. Existing FPM-based methods use cross-entropy (CE) to evaluate the foreground prediction map and to guide the learning of generator. We argue for using activation value to achieve more efficient learning. It is based on the experimental observation that, for a trained network, CE converges to zero when the foreground mask covers only part of the object region. While activation value increases until the mask expands to the object boundary, which indicates that more object areas can be learned by using activation value. In this paper, we propose a Background Activation Suppression (BAS) method. Specifically, an Activation Map Constraint module (AMC) is designed to facilitate the learning of generator by suppressing the background activation value. Meanwhile, by using the foreground region guidance and the area constraint, BAS can learn the whole region of the object. In the inference phase, we consider the prediction maps of different categories together to obtain the final localization results. Extensive experiments show that BAS achieves significant and consistent improvement over the baseline methods on the CUB-200-2011 and ILSVRC datasets. Code and models are available at https://github.com/wpy1999/BAS.

preprint2022arXiv

Experimental Performance Evaluation of Cell-free Massive MIMO Systems Using COTS RRU with OTA Reciprocity Calibration and Phase Synchronization

Downlink coherent multiuser transmission is an essential technique for cell-free massive multiple-input multiple output (MIMO) systems, and the availability of channel state information (CSI) at the transmitter is a basic requirement. To avoid CSI feedback in a time-division duplex system, the uplink channel parameters should be calibrated to obtain the downlink CSI due to the radio frequency circuit mismatch of the transceiver. In this paper, a design of a reference signal for over-the-air reciprocity calibration is proposed. The frequency domain generated reference signals can make full use of the flexible frame structure of the fifth generation (5G) new radio, which can be completely transparent to commercial off-the-shelf (COTS) remote radio units (RRUs) and commercial user equipments. To further obtain the calibration of multiple RRUs, an interleaved RRU grouping with a genetic algorithm is proposed, and an averaged Argos calibration algorithm is also presented. We develop a cell-free massive MIMO prototype system with COTS RRUs, demonstrate the statistical characteristics of the calibration error and the effectiveness of the calibration algorithm, and evaluate the impact of the calibration delay on the different cooperative transmission schemes.

preprint2022arXiv

Exploring Sequence Feature Alignment for Domain Adaptive Detection Transformers

Detection transformers have recently shown promising object detection results and attracted increasing attention. However, how to develop effective domain adaptation techniques to improve its cross-domain performance remains unexplored and unclear. In this paper, we delve into this topic and empirically find that direct feature distribution alignment on the CNN backbone only brings limited improvements, as it does not guarantee domain-invariant sequence features in the transformer for prediction. To address this issue, we propose a novel Sequence Feature Alignment (SFA) method that is specially designed for the adaptation of detection transformers. Technically, SFA consists of a domain query-based feature alignment (DQFA) module and a token-wise feature alignment (TDA) module. In DQFA, a novel domain query is used to aggregate and align global context from the token sequence of both domains. DQFA reduces the domain discrepancy in global feature representations and object relations when deploying in the transformer encoder and decoder, respectively. Meanwhile, TDA aligns token features in the sequence from both domains, which reduces the domain gaps in local and instance-level feature representations in the transformer encoder and decoder, respectively. Besides, a novel bipartite matching consistency loss is proposed to enhance the feature discriminability for robust object detection. Experiments on three challenging benchmarks show that SFA outperforms state-of-the-art domain adaptive object detection methods. Code has been made available at: https://github.com/encounter1997/SFA.

preprint2022arXiv

FAMLP: A Frequency-Aware MLP-Like Architecture For Domain Generalization

MLP-like models built entirely upon multi-layer perceptrons have recently been revisited, exhibiting the comparable performance with transformers. It is one of most promising architectures due to the excellent trade-off between network capability and efficiency in the large-scale recognition tasks. However, its generalization performance to heterogeneous tasks is inferior to other architectures (e.g., CNNs and transformers) due to the extensive retention of domain information. To address this problem, we propose a novel frequency-aware MLP architecture, in which the domain-specific features are filtered out in the transformed frequency domain, augmenting the invariant descriptor for label prediction. Specifically, we design an adaptive Fourier filter layer, in which a learnable frequency filter is utilized to adjust the amplitude distribution by optimizing both the real and imaginary parts. A low-rank enhancement module is further proposed to rectify the filtered features by adding the low-frequency components from SVD decomposition. Finally, a momentum update strategy is utilized to stabilize the optimization to fluctuation of model parameters and inputs by the output distillation with weighted historical states. To our best knowledge, we are the first to propose a MLP-like backbone for domain generalization. Extensive experiments on three benchmarks demonstrate significant generalization performance, outperforming the state-of-the-art methods by a margin of 3%, 4% and 9%, respectively.

preprint2022arXiv

HDPView: Differentially Private Materialized View for Exploring High Dimensional Relational Data

How can we explore the unknown properties of high-dimensional sensitive relational data while preserving privacy? We study how to construct an explorable privacy-preserving materialized view under differential privacy. No existing state-of-the-art methods simultaneously satisfy the following essential properties in data exploration: workload independence, analytical reliability (i.e., providing error bound for each search query), applicability to high-dimensional data, and space efficiency. To solve the above issues, we propose HDPView, which creates a differentially private materialized view by well-designed recursive bisected partitioning on an original data cube, i.e., count tensor. Our method searches for block partitioning to minimize the error for the counting query, in addition to randomizing the convergence, by choosing the effective cutting points in a differentially private way, resulting in a less noisy and compact view. Furthermore, we ensure formal privacy guarantee and analytical reliability by providing the error bound for arbitrary counting queries on the materialized views. HDPView has the following desirable properties: (a) Workload independence, (b) Analytical reliability, (c) Noise resistance on high-dimensional data, (d) Space efficiency. To demonstrate the above properties and the suitability for data exploration, we conduct extensive experiments with eight types of range counting queries on eight real datasets. HDPView outperforms the state-of-the-art methods in these evaluations.

preprint2022arXiv

Learning Affordance Grounding from Exocentric Images

Affordance grounding, a task to ground (i.e., localize) action possibility region in objects, which faces the challenge of establishing an explicit link with object parts due to the diversity of interactive affordance. Human has the ability that transform the various exocentric interactions to invariant egocentric affordance so as to counter the impact of interactive diversity. To empower an agent with such ability, this paper proposes a task of affordance grounding from exocentric view, i.e., given exocentric human-object interaction and egocentric object images, learning the affordance knowledge of the object and transferring it to the egocentric image using only the affordance label as supervision. To this end, we devise a cross-view knowledge transfer framework that extracts affordance-specific features from exocentric interactions and enhances the perception of affordance regions by preserving affordance correlation. Specifically, an Affordance Invariance Mining module is devised to extract specific clues by minimizing the intra-class differences originated from interaction habits in exocentric images. Besides, an Affordance Co-relation Preserving strategy is presented to perceive and localize affordance by aligning the co-relation matrix of predicted results between the two views. Particularly, an affordance grounding dataset named AGD20K is constructed by collecting and labeling over 20K images from 36 affordance categories. Experimental results demonstrate that our method outperforms the representative models in terms of objective metrics and visual quality. Code: github.com/lhc1224/Cross-View-AG.

preprint2022arXiv

Location-Free Camouflage Generation Network

Camouflage is a common visual phenomenon, which refers to hiding the foreground objects into the background images, making them briefly invisible to the human eye. Previous work has typically been implemented by an iterative optimization process. However, these methods struggle in 1) efficiently generating camouflage images using foreground and background with arbitrary structure; 2) camouflaging foreground objects to regions with multiple appearances (e.g. the junction of the vegetation and the mountains), which limit their practical application. To address these problems, this paper proposes a novel Location-free Camouflage Generation Network (LCG-Net) that fuse high-level features of foreground and background image, and generate result by one inference. Specifically, a Position-aligned Structure Fusion (PSF) module is devised to guide structure feature fusion based on the point-to-point structure similarity of foreground and background, and introduce local appearance features point-by-point. To retain the necessary identifiable features, a new immerse loss is adopted under our pipeline, while a background patch appearance loss is utilized to ensure that the hidden objects look continuous and natural at regions with multiple appearances. Experiments show that our method has results as satisfactory as state-of-the-art in the single-appearance regions and are less likely to be completely invisible, but far exceed the quality of the state-of-the-art in the multi-appearance regions. Moreover, our method is hundreds of times faster than previous methods. Benefitting from the unique advantages of our method, we provide some downstream applications for camouflage generation, which show its potential. The related code and dataset will be released at https://github.com/Tale17/LCG-Net.

preprint2022arXiv

Network Shuffling: Privacy Amplification via Random Walks

Recently, it is shown that shuffling can amplify the central differential privacy guarantees of data randomized with local differential privacy. Within this setup, a centralized, trusted shuffler is responsible for shuffling by keeping the identities of data anonymous, which subsequently leads to stronger privacy guarantees for systems. However, introducing a centralized entity to the originally local privacy model loses some appeals of not having any centralized entity as in local differential privacy. Moreover, implementing a shuffler in a reliable way is not trivial due to known security issues and/or requirements of advanced hardware or secure computation technology. Motivated by these practical considerations, we rethink the shuffle model to relax the assumption of requiring a centralized, trusted shuffler. We introduce network shuffling, a decentralized mechanism where users exchange data in a random-walk fashion on a network/graph, as an alternative of achieving privacy amplification via anonymity. We analyze the threat model under such a setting, and propose distributed protocols of network shuffling that is straightforward to implement in practice. Furthermore, we show that the privacy amplification rate is similar to other privacy amplification techniques such as uniform shuffling. To our best knowledge, among the recently studied intermediate trust models that leverage privacy amplification techniques, our work is the first that is not relying on any centralized entity to achieve privacy amplification.

preprint2022arXiv

Out-of-equilibrium criticalities in graphene superlattices

In thermodynamic equilibrium, current in metallic systems is carried by electronic states near the Fermi energy whereas the filled bands underneath contribute little to conduction. Here we describe a very different regime in which carrier distribution in graphene and its superlattices is shifted so far from equilibrium that the filled bands start playing an essential role, leading to a critical-current behavior. The criticalities develop upon the velocity of electron flow reaching the Fermi velocity. Key signatures of the out-of-equilibrium state are current-voltage characteristics resembling those of superconductors, sharp peaks in differential resistance, sign reversal of the Hall effect, and a marked anomaly caused by the Schwinger-like production of hot electron-hole plasma. The observed behavior is expected to be common for all graphene-based superlattices.

preprint2022arXiv

P3GM: Private High-Dimensional Data Release via Privacy Preserving Phased Generative Model

How can we release a massive volume of sensitive data while mitigating privacy risks? Privacy-preserving data synthesis enables the data holder to outsource analytical tasks to an untrusted third party. The state-of-the-art approach for this problem is to build a generative model under differential privacy, which offers a rigorous privacy guarantee. However, the existing method cannot adequately handle high dimensional data. In particular, when the input dataset contains a large number of features, the existing techniques require injecting a prohibitive amount of noise to satisfy differential privacy, which results in the outsourced data analysis meaningless. To address the above issue, this paper proposes privacy-preserving phased generative model (P3GM), which is a differentially private generative model for releasing such sensitive data. P3GM employs the two-phase learning process to make it robust against the noise, and to increase learning efficiency (e.g., easy to converge). We give theoretical analyses about the learning complexity and privacy loss in P3GM. We further experimentally evaluate our proposed method and demonstrate that P3GM significantly outperforms existing solutions. Compared with the state-of-the-art methods, our generated samples look fewer noises and closer to the original data in terms of data diversity. Besides, in several data mining tasks with synthesized data, our model outperforms the competitors in terms of accuracy.

preprint2022arXiv

Phrase-Based Affordance Detection via Cyclic Bilateral Interaction

Affordance detection, which refers to perceiving objects with potential action possibilities in images, is a challenging task since the possible affordance depends on the person's purpose in real-world application scenarios. The existing works mainly extract the inherent human-object dependencies from image/video to accommodate affordance properties that change dynamically. In this paper, we explore to perceive affordance from a vision-language perspective and consider the challenging phrase-based affordance detection problem,i.e., given a set of phrases describing the action purposes, all the object regions in a scene with the same affordance should be detected. To this end, we propose a cyclic bilateral consistency enhancement network (CBCE-Net) to align language and vision features progressively. Specifically, the presented CBCE-Net consists of a mutual guided vision-language module that updates the common features of vision and language in a progressive manner, and a cyclic interaction module (CIM) that facilitates the perception of possible interaction with objects in a cyclic manner. In addition, we extend the public Purpose-driven Affordance Dataset (PAD) by annotating affordance categories with short phrases. The contrastive experimental results demonstrate the superiority of our method over nine typical methods from four relevant fields in terms of both objective metrics and visual quality. The related code and dataset will be released at \url{https://github.com/lulsheng/CBCE-Net}.

preprint2022arXiv

Self-Sustaining Representation Expansion for Non-Exemplar Class-Incremental Learning

Non-exemplar class-incremental learning is to recognize both the old and new classes when old class samples cannot be saved. It is a challenging task since representation optimization and feature retention can only be achieved under supervision from new classes. To address this problem, we propose a novel self-sustaining representation expansion scheme. Our scheme consists of a structure reorganization strategy that fuses main-branch expansion and side-branch updating to maintain the old features, and a main-branch distillation scheme to transfer the invariant knowledge. Furthermore, a prototype selection mechanism is proposed to enhance the discrimination between the old and new classes by selectively incorporating new samples into the distillation process. Extensive experiments on three benchmarks demonstrate significant incremental performance, outperforming the state-of-the-art methods by a margin of 3%, 3% and 6%, respectively.

preprint2022arXiv

Towards Data-Efficient Detection Transformers

Detection Transformers have achieved competitive performance on the sample-rich COCO dataset. However, we show most of them suffer from significant performance drops on small-size datasets, like Cityscapes. In other words, the detection transformers are generally data-hungry. To tackle this problem, we empirically analyze the factors that affect data efficiency, through a step-by-step transition from a data-efficient RCNN variant to the representative DETR. The empirical results suggest that sparse feature sampling from local image areas holds the key. Based on this observation, we alleviate the data-hungry issue of existing detection transformers by simply alternating how key and value sequences are constructed in the cross-attention layer, with minimum modifications to the original models. Besides, we introduce a simple yet effective label augmentation method to provide richer supervision and improve data efficiency. Experiments show that our method can be readily applied to different detection transformers and improve their performance on both small-size and sample-rich datasets. Code will be made publicly available at \url{https://github.com/encounter1997/DE-DETRs}.

preprint2021arXiv

Add drop multiplexers for terahertz communications using two-wire waveguide based plasmonic circuits

Terahertz (THz) band is considered as the next frontier in wireless communications. The emerging THz multiplexing techniques are expected to dramatically increase the information capacity of THz communications far beyond a single channel limit. In this work, we explore the THz frequency-division multiplexing modality enabled by novel add-drop multiplexer (ADM) design. Based on modular two-wire plasmonic waveguides fabricated using additive manufacturing and metallization techniques, we demonstrate four-port THz ADMs containing grating-loaded side couplers for operation at ~140 GHz carrier frequency. Particular attention is payed to the design of plasmonic waveguide Bragg gratings and directional couplers capable of splitting broadband THz light in spectral and spatial domains, respectively. Finally, we demonstrate multiplexing and demultiplexing of THz signals with bit rates up to 6 Gbps using the developed ADMs. We believe that proposed plasmonic circuits hold strong potential to provide robust integrated solutions for analogue signal processing in the upcoming THz communications.

preprint2021arXiv

Local large temperature difference and ultra-wideband photothermoelectric response of the silver nanostructure film/carbon nanotube film heterostructure

Photothermoelectric materials have important applications in many fields. Here, we joined a silver nanostructure film (AgNSF) and a carbon nanotube film (CNTF) by van der Waals force to form a AgNSF/CNTF heterojunction, which shows excellent photothermal and photoelectric conversion properties. The local temperature difference and the output photovoltage increase rapidly when the heterojunction is irradiated by lasers with wavelengths ranging from ultraviolet to terahertz. The maximum of the local temperature difference reaches 205.9 K, which is significantly higher than that of other photothermoelectric materials reported in literatures. The photothermal and photoelectric responsivity depend on the wavelength of lasers, which are 175-601 K/W and 9.35-40.4 mV/W, respectively. We demonstrate that light absorption of the carbon nanotube is enhanced by local surface plasmons, and the output photovoltage is dominated by Seebeck effect. The AgNSF/CNTF heterostructure can be used as high-efficiency sensitive photothermal materials or as ultra-wideband fast-response photoelectric material.

preprint2021arXiv

PCT-TEE: Trajectory-based Private Contact Tracing System with Trusted Execution Environment

Existing Bluetooth-based Private Contact Tracing (PCT) systems can privately detect whether people have come into direct contact with COVID-19 patients. However, we find that the existing systems lack functionality and flexibility, which may hurt the success of the contact tracing. Specifically, they cannot detect indirect contact (e.g., people may be exposed to coronavirus because of used the same elevator even without direct contact); they also cannot flexibly change the rules of "risky contact", such as how many hours of exposure or how close to a COVID-19 patient that is considered as risk exposure, which may be changed with the environmental situation. In this paper, we propose an efficient and secure contact tracing system that enables both direct contact and indirect contact. To address the above problems, we need to utilize users' trajectory data for private contact tracing, which we call trajectory-based PCT. We formalize this problem as Spatiotemporal Private Set Intersection. By analyzing different approaches such as homomorphic encryption that could be extended to solve this problem, we identify that Trusted Execution Environment (TEE) is a proposing method to achieve our requirements. The major challenge is how to design algorithms for spatiotemporal private set intersection under limited secure memory of TEE. To this end, we design a TEE-based system with flexible trajectory data encoding algorithms. Our experiments on real-world data show that the proposed system can process thousands of queries on tens of million records of trajectory data in a few seconds.

preprint2020arXiv

Arithmetic purity of strong approximation for semi-simple simply connected groups

In this article we establish the arithmetic purity of strong approximation for certain semi-simple simply connected $k$-simple linear algebraic groups and their homogeneous spaces over a number field $k$. For instance, for any such group $G$ and for any open subset $U$ of $G$ with codim$(G\setminus U, G)\geq 2$, we prove that (i) if $G$ is $k$-isotropic, then $U$ satisfies strong approximation off any one (hence any finitely many) place; (ii) if $G$ is the spin group of a non-degenerate quadratic form which is non-compact over archimedean places, then $U$ satisfies strong approximation off all archimedean places. As a consequence, we prove that the same property holds for affine quadratic hypersurfaces. Our approach combines a fibration method with subgroup actions developed for induction on the codimension of $G\setminus U$, and an affine combinatorial sieve which allows to produce integral points with almost prime polynomial values.

preprint2020arXiv

Dispersion Limited versus Power Limited Terahertz Transmission Links Using Solid Core Subwavelength Dielectric Fibers

In this work, we present an in-depth experimental and numerical study of the short-range THz communications links that use subwavelength dielectric fibers for information transmission and define main challenges and tradeoffs in the link implementation. Particularly, we use air or foam-cladded polypropylene-core subwavelength dielectric THz fibers of various diameters (0.57-1.75 mm) to study link performance as a function of the link length of up to ~10 m, and data bitrates of up to 6 Gbps at the carrier frequency of 128 GHz (2.34 mm wavelength). We find that depending on the fiber diameter, the quality of the transmitted signal is mostly limited either by the modal propagation loss or by the fiber velocity dispersion (GVD). An error-free transmission over 10 meters is achieved for the bit rate of 4 Gbps using the fiber of smaller 0.57 mm diameter. Furthermore, since the fields of subwavelength fibers are weakly confined and extend deep into the air cladding, we study the modal field extent outside of the fiber core, as well as fiber bending loss. Finally, the power budget of the rod-in-air subwavelength THz fiber-based links is compared to that of free space communication links and we demonstrate that fiber links offer an excellent solution for various short-range applications.

preprint2020arXiv

Effects of high-$j$ orbitals, pairing and deformed neutron shells on upbendings of ground-state bands in neutron-rich even-even isotopes $^{170-184}$Hf

The ground-state bands (GSBs) in the even-even hafnium isotopes $^{170-184}$Hf are investigated by using the cranked shell model (CSM) with pairing correlations treated by the particle-number conserving (PNC) method. The experimental kinematic moments of inertia are reproduced very well by theoretical calculations. The second upbending of the GSB at high frequency $\hbarω\approx0.5$ MeV observed (predicted) in $^{172}$Hf ($^{170,174-178}$Hf) attributes to the sudden alignments of the proton high-$j$ orbitals $\pi1i_{13/2}$ $(1/2^{+}[660])$, $\pi1h_{9/2}$ $(1/2^{-}[541])$ and orbital $\pi1h_{11/2}$ $(7/2^{-}[523])$. The first upbendings of GSBs at low frequency $\hbarω=0.2-0.3$ MeV in $^{170-178}$Hf, which locate below the deformed neutron shell $N=108$, attribute to the alignment of the neutron orbital $\nu1i_{13/2}$. For the heavier even-even isotopes $^{180-184}$Hf, compared to the lighter isotopes, the first band-crossing is delayed to the high frequency due to the existence of the deformed shells $N=108,116$. The upbendings of GSBs in $^{180-184}$Hf are predicted to occur at $\hbarω\approx0.5$MeV, which come from the sharp raise of the simultaneous alignments of both proton $\pi1i_{13/2}$, $\pi1h_{9/2}$ and neutron $\nu2g_{9/2}$ orbitals. The pairing correlation plays a very important role in the rotational properties of GSBs in even-even isotopes $^{180-184}$Hf. Its effects on upbendings and band-crossing frequencies are investigated.

preprint2020arXiv

Evidence of Flat Bands and Correlated States in Buckled Graphene Superlattices

Two-dimensional atomic crystals can radically change their properties in response to external influences such as substrate orientation or strain, resulting in essentially new materials in terms of the electronic structure. A striking example is the creation of flat-bands in bilayer-graphene for certain 'magic' twist-angles between the orientations of the two layers. The quenched kinetic-energy in these flat-bands promotes electron-electron interactions and facilitates the emergence of strongly-correlated phases such as superconductivity and correlated-insulators. However, the exquisite fine-tuning required for finding the magic-angle where flat-bands appear in twisted-bilayer graphene, poses challenges to fabrication and scalability. Here we present an alternative route to creating flat-bands that does not involve fine tuning. Using scanning tunneling microscopy and spectroscopy, together with numerical simulations, we demonstrate that graphene monolayers placed on an atomically-flat substrate can be forced to undergo a buckling-transition, resulting in a periodically modulated pseudo-magnetic field, which in turn creates a post-graphene material with flat electronic bands. Bringing the Fermi-level into these flat-bands by electrostatic doping, we observe a pseudogap-like depletion in the density-of-states, which signals the emergence of a correlated-state. The described approach of 2D crystal buckling offers a strategy for creating other superlattice systems and, in particular, for exploring interaction phenomena characteristic of flat-bands.

preprint2020arXiv

FedSel: Federated SGD under Local Differential Privacy with Top-k Dimension Selection

As massive data are produced from small gadgets, federated learning on mobile devices has become an emerging trend. In the federated setting, Stochastic Gradient Descent (SGD) has been widely used in federated learning for various machine learning models. To prevent privacy leakages from gradients that are calculated on users' sensitive data, local differential privacy (LDP) has been considered as a privacy guarantee in federated SGD recently. However, the existing solutions have a dimension dependency problem: the injected noise is substantially proportional to the dimension $d$. In this work, we propose a two-stage framework FedSel for federated SGD under LDP to relieve this problem. Our key idea is that not all dimensions are equally important so that we privately select Top-k dimensions according to their contributions in each iteration of federated SGD. Specifically, we propose three private dimension selection mechanisms and adapt the gradient accumulation technique to stabilize the learning process with noisy updates. We also theoretically analyze privacy, accuracy and time complexity of FedSel, which outperforms the state-of-the-art solutions. Experiments on real-world and synthetic datasets verify the effectiveness and efficiency of our framework.

preprint2020arXiv

Finding Acceptable Parameter Regions of Stochastic Hill functions for Multisite Phosphorylation Mechanism

Multisite phosphorylation plays an important role in regulating switchlike protein activity and has been used widely in mathematical models. With the development of new experimental techniques and more molecular data, molecular phosphorylation processes emerge in many systems with increasing complexity and sizes. These developments call for simple yet valid stochastic models to describe various multisite phosphorylation processes, especially in large and complex biochemical networks. To reduce model complexity, this work aims to simplify the multisite phosphorylation mechanism by a stochastic Hill function model. Further, this work optimizes regions of parameter space to match simulation results from the stochastic Hill function with the distributive multisite phosphorylation process. While traditional parameter optimization methods have been focusing on finding the best parameter vector, in most circumstances modelers would like to find a set of parameter vectors that generate similar system dynamics and results. This paper proposes a general $α$-$β$-$γ$ rule to return an acceptable parameter region of the stochastic Hill function based on a quasi-Newton stochastic optimization (QNSTOP) algorithm. Different objective functions are investigated characterizing different features of the simulation-based empirical data, among which the approximate maximum log-likelihood method is recommended for general applications. Numerical results demonstrate that with an appropriate parameter vector value, the stochastic Hill function model depicts the multisite phosphorylation process well except the initial (transient) period.

preprint2020arXiv

Non-Hermitian Bulk-Boundary Correspondence in Periodically Driven System

Bulk-boundary correspondence, connecting the bulk topology and the edge states, is an essential principle of the topological phases. However, the bulk-boundary correspondence is broken down in general non-Hermitian systems. In this paper, we construct one-dimensional non-Hermitian Su-Schrieffer-Heeger model with periodic driving that exhibits non-Hermitian skin effect: all the eigenstates are localized at the boundary of the systems, whether the bulk states or the zero and the $π$ modes. To capture the topological properties, the non-Bloch winding numbers are defined by the non-Bloch periodized evolution operators based on the generalized Brillouin zone. Furthermore, the non-Hermitian bulk-boundary correspondence is established: the non-Bloch winding numbers ($W_{0,π}$) characterize the edge states with quasienergies $ε=0, π$. In our non-Hermitian system, a novel phenomenon can emerge that the robust edge states can appear even when the Floquet bands are topological trivial with zero non-Bloch band invariant, which is defined in terms of the non-Bloch effective Hamiltonian. We also show that the relation between the non-Bloch winding numbers ($W_{0,π}$) and the non-Bloch band invariant ($\mathcal{W}$): $\mathcal{W}= W_{0}- W_π$.

preprint2020arXiv

One-Shot Texture Retrieval with Global Context Metric

In this paper, we tackle one-shot texture retrieval: given an example of a new reference texture, detect and segment all the pixels of the same texture category within an arbitrary image. To address this problem, we present an OS-TR network to encode both reference and query image, leading to achieve texture segmentation towards the reference category. Unlike the existing texture encoding methods that integrate CNN with orderless pooling, we propose a directionality-aware module to capture the texture variations at each direction, resulting in spatially invariant representation. To segment new categories given only few examples, we incorporate a self-gating mechanism into relation network to exploit global context information for adjusting per-channel modulation weights of local relation features. Extensive experiments on benchmark texture datasets and real scenarios demonstrate the above-par segmentation performance and robust generalization across domains of our proposed method.

preprint2020arXiv

PANDA: Policy-aware Location Privacy for Epidemic Surveillance

In this demonstration, we present a privacy-preserving epidemic surveillance system. Recently, many countries that suffer from coronavirus crises attempt to access citizen's location data to eliminate the outbreak. However, it raises privacy concerns and may open the doors to more invasive forms of surveillance in the name of public health. It also brings a challenge for privacy protection techniques: how can we leverage people's mobile data to help combat the pandemic without scarifying our location privacy. We demonstrate that we can have the best of the two worlds by implementing policy-based location privacy for epidemic surveillance. Specifically, we formalize the privacy policy using graphs in light of differential privacy, called policy graph. Our system has three primary functions for epidemic surveillance: location monitoring, epidemic analysis, and contact tracing. We provide an interactive tool allowing the attendees to explore and examine the usability of our system: (1) the utility of location monitor and disease transmission model estimation, (2) the procedure of contact tracing in our systems, and (3) the privacy-utility trade-offs w.r.t. different policy graphs. The attendees can find that it is possible to have the full functionality of epidemic surveillance while preserving location privacy.

preprint2020arXiv

PGLP: Customizable and Rigorous Location Privacy through Policy Graph

Location privacy has been extensively studied in the literature. However, existing location privacy models are either not rigorous or not customizable, which limits the trade-off between privacy and utility in many real-world applications. To address this issue, we propose a new location privacy notion called PGLP, i.e., \textit{Policy Graph based Location Privacy}, providing a rich interface to release private locations with customizable and rigorous privacy guarantee. First, we design the privacy metrics of PGLP by extending differential privacy. Specifically, we formalize a user's location privacy requirements using a \textit{location policy graph}, which is expressive and customizable. Second, we investigate how to satisfy an arbitrarily given location policy graph under adversarial knowledge. We find that a location policy graph may not always be viable and may suffer \textit{location exposure} when the attacker knows the user's mobility pattern. We propose efficient methods to detect location exposure and repair the policy graph with optimal utility. Third, we design a private location trace release framework that pipelines the detection of location exposure, policy graph repair, and private trajectory release with customizable and rigorous location privacy. Finally, we conduct experiments on real-world datasets to verify the effectiveness of the privacy-utility trade-off and the efficiency of the proposed algorithms.

preprint2020arXiv

Protecting Spatiotemporal Event Privacy in Continuous Location-Based Services

Location privacy-preserving mechanisms (LPPMs) have been extensively studied for protecting users' location privacy by releasing a perturbed location to third parties such as location-based service providers. However, when a user's perturbed locations are released continuously, existing LPPMs may not protect the sensitive information about the user's spatiotemporal activities, such as "visited hospital in the last week" or "regularly commuting between Address 1 and Address 2" (it is easy to infer that Addresses 1 and 2 may be home and office), which we call it \textit{spatiotemporal event}. In this paper, we first formally define {spatiotemporal event} as Boolean expressions between location and time predicates, and then we define $ ε$-\textit{spatiotemporal event privacy} by extending the notion of differential privacy. Second, to understand how much spatiotemporal event privacy that existing LPPMs can provide, we design computationally efficient algorithms to quantify the privacy leakage of state-of-the-art LPPMs when an adversary has prior knowledge of the user's initial probability over possible locations. It turns out that the existing LPPMs cannot adequately protect spatiotemporal event privacy. Third, we propose a framework, PriSTE, to transform an existing LPPM into one protecting spatiotemporal event privacy against adversaries with \textit{any} prior knowledge. Our experiments on real-life and synthetic data verified that the proposed method is effective and efficient.

preprint2020arXiv

Providing Input-Discriminative Protection for Local Differential Privacy

Local Differential Privacy (LDP) provides provable privacy protection for data collection without the assumption of the trusted data server. In the real-world scenario, different data have different privacy requirements due to the distinct sensitivity levels. However, LDP provides the same protection for all data. In this paper, we tackle the challenge of providing input-discriminative protection to reflect the distinct privacy requirements of different inputs. We first present the Input-Discriminative LDP (ID-LDP) privacy notion and focus on a specific version termed MinID-LDP, which is shown to be a fine-grained version of LDP. Then, we focus on the application of frequency estimation and develop the IDUE mechanism based on Unary Encoding for single-item input and the extended mechanism IDUE-PS (with Padding-and-Sampling protocol) for item-set input. The results on both synthetic and real-world datasets validate the correctness of our theoretical analysis and show that the proposed mechanisms satisfying MinID-LDP have better utility than the state-of-the-art mechanisms satisfying LDP due to the input-discriminative protection.

preprint2020arXiv

Sous-groupe de Brauer invariant et obstruction de descente itérée

For a quasi-projective smooth geometrically integral variety over a number field $k$, we prove that the iterated descent obstruction is equivalent to the descent obstruction. This generalizes a result of Skorobogatov, and this answers an open question of Poonen. The key idea is the notion of invariant Brauer subgroup and the notion of invariant étale Brauer-Manin obstruction for a $k$-variety equipped with an action of a connected linear algebraic group.

preprint2020arXiv

Voice-Indistinguishability: Protecting Voiceprint in Privacy-Preserving Speech Data Release

With the development of smart devices, such as the Amazon Echo and Apple's HomePod, speech data have become a new dimension of big data. However, privacy and security concerns may hinder the collection and sharing of real-world speech data, which contain the speaker's identifiable information, i.e., voiceprint, which is considered a type of biometric identifier. Current studies on voiceprint privacy protection do not provide either a meaningful privacy-utility trade-off or a formal and rigorous definition of privacy. In this study, we design a novel and rigorous privacy metric for voiceprint privacy, which is referred to as voice-indistinguishability, by extending differential privacy. We also propose mechanisms and frameworks for privacy-preserving speech data release satisfying voice-indistinguishability. Experiments on public datasets verify the effectiveness and efficiency of the proposed methods.

preprint2017arXiv

Quantifying Differential Privacy under Temporal Correlations

Differential Privacy (DP) has received increased attention as a rigorous privacy framework. Existing studies employ traditional DP mechanisms (e.g., the Laplace mechanism) as primitives, which assume that the data are independent, or that adversaries do not have knowledge of the data correlations. However, continuously generated data in the real world tend to be temporally correlated, and such correlations can be acquired by adversaries. In this paper, we investigate the potential privacy loss of a traditional DP mechanism under temporal correlations in the context of continuous data release. First, we model the temporal correlations using Markov model and analyze the privacy leakage of a DP mechanism when adversaries have knowledge of such temporal correlations. Our analysis reveals that the privacy leakage of a DP mechanism may accumulate and increase over time. We call it temporal privacy leakage. Second, to measure such privacy leakage, we design an efficient algorithm for calculating it in polynomial time. Although the temporal privacy leakage may increase over time, we also show that its supremum may exist in some cases. Third, to bound the privacy loss, we propose mechanisms that convert any existing DP mechanism into one against temporal privacy leakage. Experiments with synthetic data confirm that our approach is efficient and effective.