Searcharxiv⌕ Search

arXiv subjects

Bin Tang

Publications and source records attributed to Bin Tang.

At least 37 records · Page 2Linked to original sources
arXiv2023

Wideband Power Spectrum Sensing: a Fast Practical Solution for Nyquist Folding Receiver

The limited availability of spectrum resources has been growing into a critical problem in wireless communications, remote sensing, and electronic surveillance, etc. To address the high-speed sampling bottleneck of wideband spectrum sensing, a fast and practical solution of power spectrum estimation for Nyquist folding receiver (NYFR) is proposed in this paper. The NYFR architectures is can theoretically achieve the full-band signal sensing with a hundred percent of probability of intercept. But the existing algorithm is difficult to realize in real-time due to its high complexity and complicated calculations. By exploring the sub-sampling principle inherent in NYFR, a computationally efficient method is introduced with compressive covariance sensing. That can be efficient implemented via only the non-uniform fast Fourier transform, fast Fourier transform, and some simple multiplication operations. Meanwhile, the state-of-the-art power spectrum reconstruction model for NYFR of time-domain and frequency-domain is constructed in this paper as a comparison. Furthermore, the computational complexity of the proposed method scales linearly with the Nyquist-rate sampled number of samples and the sparsity of spectrum occupancy. Simulation results and discussion demonstrate that the low complexity in sampling and computation is a more practical solution to meet the real-time wideband spectrum sensing applications.

eess.SP↗
arXiv2023

Distributed UAV Swarm Augmented Wideband Spectrum Sensing Using Nyquist Folding Receiver

Distributed unmanned aerial vehicle (UAV) swarms are formed by multiple UAVs with increased portability, higher levels of sensing capabilities, and more powerful autonomy. These features make them attractive for many recent applica-tions, potentially increasing the shortage of spectrum resources. In this paper, wideband spectrum sensing augmented technology is discussed for distributed UAV swarms to improve the utilization of spectrum. However, the sub-Nyquist sampling applied in existing schemes has high hardware complexity, power consumption, and low recovery efficiency for non-strictly sparse conditions. Thus, the Nyquist folding receiver (NYFR) is considered for the distributed UAV swarms, which can theoretically achieve full-band spectrum detection and reception using a single analog-to-digital converter (ADC) at low speed for all circuit components. There is a focus on the sensing model of two multichannel scenarios for the distributed UAV swarms, one with a complete functional receiver for the UAV swarm with RIS, and another with a decentralized UAV swarm equipped with a complete functional receiver for each UAV element. The key issue is to consider whether the application of RIS technology will bring advantages to spectrum sensing and the data fusion problem of decentralized UAV swarms based on the NYFR architecture. Therefore, the property for multiple pulse reconstruction is analyzed through the Gershgorin circle theorem, especially for very short pulses. Further, the block sparse recovery property is analyzed for wide bandwidth signals. The proposed technology can improve the processing capability for multiple signals and wide bandwidth signals while reducing interference from folded noise and subsampled harmonics. Experiment results show augmented spectrum sensing efficiency under non-strictly sparse conditions.

eess.SP↗
arXiv2023

Wideband Spectrum Acquisition for UAV Swarm Using the Sparse Coding Fourier Transform

As the trend towards small, safe, smart, speedy and swarm development grows, unmanned aerial vehicles (UAVs) are becoming increasingly popular for a wide range of applications. In this letter, the challenge of wideband spectrum acquisition for the UAV swarms is studied by proposing a processing method that features lower power consumption, higher compression rates, and a lower signal-to-noise ratio. Our system is equipped with multiple UAVs, each with a different sub-sampling rate. That allows for frequency backetization and estimation based on sparse Fourier transform theory. Unlike other techniques, the collisions and iterations caused by non-sparsity environ-ments are considered. We introduce sparse coding Fourier transform to address these issues. The key is to code the entire spectrum and decode it through spectrum correlation in the code. Simulation results show that our proposed method performs well in acquiring both narrowband and wideband signals simultaneously, compared to the other methods.

eess.SP↗
arXiv2023

Scribble-Supervised RGB-T Salient Object Detection

Salient object detection segments attractive objects in scenes. RGB and thermal modalities provide complementary information and scribble annotations alleviate large amounts of human labor. Based on the above facts, we propose a scribble-supervised RGB-T salient object detection model. By a four-step solution (expansion, prediction, aggregation, and supervision), label-sparse challenge of scribble-supervised method is solved. To expand scribble annotations, we collect the superpixels that foreground scribbles pass through in RGB and thermal images, respectively. The expanded multi-modal labels provide the coarse object boundary. To further polish the expanded labels, we propose a prediction module to alleviate the sharpness of boundary. To play the complementary roles of two modalities, we combine the two into aggregated pseudo labels. Supervised by scribble annotations and pseudo labels, our model achieves the state-of-the-art performance on the relabeled RGBT-S dataset. Furthermore, the model is applied to RGB-D and video scribble-supervised applications, achieving consistently excellent performance.

cs.CV↗
arXiv2023

HRTransNet: HRFormer-Driven Two-Modality Salient Object Detection

The High-Resolution Transformer (HRFormer) can maintain high-resolution representation and share global receptive fields. It is friendly towards salient object detection (SOD) in which the input and output have the same resolution. However, two critical problems need to be solved for two-modality SOD. One problem is two-modality fusion. The other problem is the HRFormer output's fusion. To address the first problem, a supplementary modality is injected into the primary modality by using global optimization and an attention mechanism to select and purify the modality at the input level. To solve the second problem, a dual-direction short connection fusion module is used to optimize the output features of HRFormer, thereby enhancing the detailed representation of objects at the output level. The proposed model, named HRTransNet, first introduces an auxiliary stream for feature extraction of supplementary modality. Then, features are injected into the primary modality at the beginning of each multi-resolution branch. Next, HRFormer is applied to achieve forwarding propagation. Finally, all the output features with different resolutions are aggregated by intra-feature and inter-feature interactive transformers. Application of the proposed model results in impressive improvement for driving two-modality SOD tasks, e.g., RGB-D, RGB-T, and light field SOD.https://github.com/liuzywen/HRTransNet

cs.CV↗
arXiv2022

Stochastic inviscid Leray-$α$ model with transport noise: convergence rates and CLT

We consider the stochastic inviscid Leray-$α$ model on the torus driven by transport noise. Under a suitable scaling of the noise, we prove that the weak solutions converge, in some negative Sobolev spaces, to the unique solution of the deterministic viscous Leray-$α$ model. This implies that transport noise regularizes the inviscid Leray-$α$ model so that it enjoys approximate weak uniqueness. Interpreting such limit result as a law of large numbers, we study the underlying central limit theorem and provide an explicit convergence rate.

math.PR↗
arXiv2022

Text Editing as Imitation Game

Text editing, such as grammatical error correction, arises naturally from imperfect textual data. Recent works frame text editing as a multi-round sequence tagging task, where operations -- such as insertion and substitution -- are represented as a sequence of tags. While achieving good results, this encoding is limited in flexibility as all actions are bound to token-level tags. In this work, we reformulate text editing as an imitation game using behavioral cloning. Specifically, we convert conventional sequence-to-sequence data into state-to-action demonstrations, where the action space can be as flexible as needed. Instead of generating the actions one at a time, we introduce a dual decoders structure to parallel the decoding while retaining the dependencies between action tokens, coupled with trajectory augmentation to alleviate the distribution shift that imitation learning often suffers. In experiments on a suite of Arithmetic Equation benchmarks, our model consistently outperforms the autoregressive baselines in terms of performance, efficiency, and robustness. We hope our findings will shed light on future studies in reinforcement learning applying sequence-level action generation to natural language processing.

cs.CL↗
arXiv2022

Contrastive Psudo-supervised Classification for Intra-Pulse Modulation of Radar Emitter Signals Using data augmentation

The automatic classification of radar waveform is a fundamental technique in electronic countermeasures (ECM).Recent supervised deep learning-based methods have achieved great success in a such classification task.However, those methods require enough labeled samples to work properly and in many circumstances, it is not available.To tackle this problem, in this paper, we propose a three-stages deep radar waveform clustering(DRSC) technique to automatically group the received signal samples without labels.Firstly, a pretext model is trained in a self-supervised way with the help of several data augmentation techniques to extract the class-dependent features.Next,the pseudo-supervised contrastive training is involved to further promote the separation between the extracted class-dependent features.And finally, the unsupervised problem is converted to a semi-supervised classification problem via pseudo label generation. The simulation results show that the proposed algorithm can effectively extract class-dependent features, outperforming several unsupervised clustering methods, even reaching performance on par with the supervised deep learning-based methods.

eess.SP↗
arXiv2021

A Unified Adaptive Recoding Framework for Batched Network Coding

Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt to random fluctuations in the number of erasures in individual batches, it is not optimal to recode and transmit the same number of packets for all batches. Different distributed optimization models, which are called adaptive recoding schemes, were formulated for this purpose. The key component of these optimization problems is the expected value of the rank distribution of a batch at the next network node, which is also known as the expected rank. In this paper, we put forth a unified adaptive recoding framework with an arbitrary recoding field size. We show that the expected rank functions are concave when the packet loss pattern is a stationary stochastic process, which covers but not limited to independent packet loss and Gilbert-Elliott packet loss model. Under this concavity assumption, we show that there always exists a solution which not only can minimize the randomness on the number of recoded packets but also can tolerate rank distribution errors due to inaccurate measurements or limited precision of the machine. We provide an algorithm to obtain such an optimal optimal solution, and propose tuning schemes that can turn any feasible solution into a desired optimal solution.

cs.IT↗
arXiv2021

TriTransNet: RGB-D Salient Object Detection with a Triplet Transformer Embedding Network

Salient object detection is the pixel-level dense prediction task which can highlight the prominent object in the scene. Recently U-Net framework is widely used, and continuous convolution and pooling operations generate multi-level features which are complementary with each other. In view of the more contribution of high-level features for the performance, we propose a triplet transformer embedding module to enhance them by learning long-range dependencies across layers. It is the first to use three transformer encoders with shared weights to enhance multi-level features. By further designing scale adjustment module to process the input, devising three-stream decoder to process the output and attaching depth features to color features for the multi-modal fusion, the proposed triplet transformer embedding network (TriTransNet) achieves the state-of-the-art performance in RGB-D salient object detection, and pushes the performance to a new level. Experimental results demonstrate the effectiveness of the proposed modules and the competition of TriTransNet.

cs.CV↗
arXiv2020

Tracing the main elements and electron orbitals that induce superconducting phase transition

The experimental determination of the superconducting transition requires the observation of the emergence of zero-resistance and perfect diamagnetism state. Based on the close relationship between superconducting transition temperature (Tc) and electron density of states (DOS), we take two typical superconducting materials Hg and ZrTe3 as samples and calculate their DOS versus temperature under different pressures by using the first-principle molecular dynamics simulations. According to the analysis of the calculation results, the main contributors that induce superconducting transitions are deduced by tracing the variation of partial density of states near Tc. In particular, the microscopic mechanism of pressure increasing Tc is further analyzed.

cond-mat.supr-con↗
arXiv2019

Quantum Efficiency Enhancement by Mie Resonance from GaAs Photocathodes Structured with Surface Nanopillar Arrays

A new type of negative electron affinity (NEA) photocathode based on GaAs nanopillar array (NPA) Mie-type resonators was demonstrated for the first time. For visible wavelengths, the Mie resonances in GaAs NPA reduced light reflectivity to less than 6 percent compared to a typical value great then 35 percent. Other benefits of NPA resonators include an enhanced density of optical states due to increased light concentration and increased electron emission area. These features resulted in improved photoemission performance at the resonance wavelength demonstrating maximum quantum efficiency 3.5 times greater than a GaAs wafer photocathode without the NPA structure. This optically dark photocathode (sub-percentage light reflectance over visible wavelengths) but possessing electrically high-brightness (enhanced electron emission) provides new opportunities for practical applications such as large-scale electron accelerators, high-resolution night-vision imaging and low energy electron microscopy.

physics.optics↗
arXiv2019

Construction of Subexponential-Size Optical Priority Queues with Switches and Fiber Delay Lines

All-optical switching has been considered as a natural choice to keep pace with growing fiber link capacity. One key research issue of all-optical switching is the design of optical buffers for packet contention resolution. One of the most general buffering schemes is optical priority queue, where every packet is associated with a unique priority upon its arrival and departs the queue in order of priority, and the packet with the lowest priority is always dropped when a new packet arrives but the buffer is full. In this paper, we focus on the feedback construction of an optical priority queue with a single $\boldsymbol{(M+2)\times (M+2)}$ optical crossbar Switch and $\boldsymbol{M}$ fiber Delay Lines (SDL) connecting $\boldsymbol{M}$ inputs and $\boldsymbol{M}$ outputs of the switch. We propose a novel construction of an optical priority queue with buffer $\boldsymbol{2^{Θ(\sqrt{M})}}$, which improves substantially over all previous constructions that only have buffers of $\boldsymbol{O(M^c)}$ size for constant integer $\boldsymbol{c}$. The key ideas behind our construction include (i) the use of first in first out multiplexers, which admit efficient SDL constructions, for feeding back packets to the switch instead of fiber delay lines, and (ii) the use of a routing policy that is similar to self-routing, where each packet entering the switch is routed to some multiplexer mainly determined by the current ranking of its priority.

cs.IT↗
arXiv2019

Heterogeneity-aware Gradient Coding for Straggler Tolerance

Gradient descent algorithms are widely used in machine learning. In order to deal with huge volume of data, we consider the implementation of gradient descent algorithms in a distributed computing setting where multiple workers compute the gradient over some partial data and the master node aggregates their results to obtain the gradient over the whole data. However, its performance can be severely affected by straggler workers. Recently, some coding-based approaches are introduced to mitigate the straggler problem, but they are efficient only when the workers are homogeneous, i.e., having the same computation capabilities. In this paper, we consider that the workers are heterogeneous which are common in modern distributed systems. We propose a novel heterogeneity-aware gradient coding scheme which can not only tolerate a predetermined number of stragglers but also fully utilize the computation capabilities of heterogeneous workers. We show that this scheme is optimal when the computation capabilities of workers are estimated accurately. A variant of this scheme is further proposed to improve the performance when the estimations of the computation capabilities are not so accurate. We conduct our schemes for gradient descent based image classification on QingCloud clusters. Evaluation results show that our schemes can reduce the whole computation time by up to $3\times$ compared with a state-of-the-art coding scheme.

cs.DC↗
arXiv2018

Efficient Clear Air Turbulence Avoidance Algorithms using IoT for Commercial Aviation

With the growth of commercial aviation over the last few decades there have been many applications designed to improve the efficiency of flight operations as well as safety and security. A number of these applications are based on the gathered data from flights; the data is usually acquired from the various sensors available on the aircraft. There are numerous sensors among the electrical and electronics devices on an aircraft, most of which are essential for the proper functioning of the same. With the sensors being operational throughout the time of movement of the aircraft, a large amount of data is collected during each flight. Normally, most of the gathered data are stored on a storage device on the aircraft, and are analyzed and studied later off-site for research purposes focusing on improving airline operation and efficiently maintaining the same. In certain cases, when there is data transfer during the flight, it is between the aircraft and an air-traffic-control (ATC) tower, which serves as the base station. The aircraft equipped with all these sensors, which can gather and exchange data, form a framework of Internet of things (IoT). Detecting and avoiding any form of turbulence for an aircraft is vital; it adds to the safety of both passengers and aircraft while reducing the operating cost of the airline. Therefore, in this paper, we study techniques to detect and avoid Clear Air Turbulence (CAT), which is a specific type of turbulence, based on the IoT framework of aircraft. We propose algorithms that consider both direct and indirect communication between aircraft within a specific region. Using simulation results, we show that our proposed techniques of direct communication using the IoT framework is faster than conventional techniques involving radio communication via both single ATC tower and multiple ATC towers.

cs.NI↗
arXiv2017

Interrogating the Escherichia coli cell cycle by cell dimension perturbations

Bacteria tightly regulate and coordinate the various events in their cell cycles to duplicate themselves accurately and to control their cell sizes. Growth of Escherichia coli, in particular, follows a relation known as Schaechter 's growth law. This law says that the average cell volume scales exponentially with growth rate, with a scaling exponent equal to the time from initiation of a round of DNA replication to the cell division at which the corresponding sister chromosomes segregate. Here, we sought to test the robustness of the growth law to systematic perturbations in cell dimensions achieved by varying the expression levels of mreB and ftsZ. We found that decreasing the mreB level resulted in increased cell width, with little change in cell length, whereas decreasing the ftsZ level resulted in increased cell length. Furthermore, the time from replication termination to cell division increased with the perturbed dimension in both cases. Moreover, the growth law remained valid over a range of growth conditions and dimension perturbations. The growth law can be quantitatively interpreted as a consequence of a tight coupling of cell division to replication initiation. Thus, its robustness to perturbations in cell dimensions strongly supports models in which the timing of replication initiation governs that of cell division, and cell volume is the key phenomenological variable governing the timing of replication initiation. These conclusions are discussed in the context of our recently proposed adder-per-origin model, in which cells add a constant volume per origin between initiations and divide a constant time after initiation.

q-bio.CB↗
arXiv2016

Constructing Sub-exponentially Large Optical Priority Queues with Switches and Fiber Delay Lines

Optical switching has been considered as a natural choice to keep pace with growing fiber link capacity. One key research issue of all-optical switching is the design of optical queues by using optical crossbar switches and fiber delay lines (SDL). In this paper, we focus on the construction of an optical priority queue with a single $(M+2)\times (M+2)$ crossbar switch and $M$ fiber delay lines, and evaluate it in terms of the buffer size of the priority queue. Currently, the best known upper bound of the buffer size is $O(2^M)$, while existing methods can only construct a priority queue with buffer $O(M^3)$. In this paper, we make a great step towards closing the above huge gap. We propose a very efficient construction of priority queues with buffer $2^{Θ(\sqrt{M})}$. We use 4-to-1 multiplexers with different buffer sizes, which can be constructed efficiently with SDL, as intermediate building blocks to simplify the design. The key idea in our construction is to route each packet entering the switch to some group of four 4-to-1 multiplexers according to its current priority, which is shown to be collision-free.

cs.IT↗