Searcharxiv⌕ Search

arXiv subjects

Tong Ye

Publications and source records attributed to Tong Ye.

At least 37 records · Page 2Linked to original sources

Enhancing Digital Hologram Reconstruction Using Reverse-Attention Loss for Untrained Physics-Driven Deep Learning Models with Uncertain Distance

Untrained Physics-based Deep Learning (DL) methods for digital holography have gained significant attention due to their benefits, such as not requiring an annotated training dataset, and providing interpretability since utilizing the governing laws of hologram formation. However, they are sensitive to the hard-to-obtain precise object distance from the imaging plane, posing the $\textit{Autofocusing}$ challenge. Conventional solutions involve reconstructing image stacks for different potential distances and applying focus metrics to select the best results, which apparently is computationally inefficient. In contrast, recently developed DL-based methods treat it as a supervised task, which again needs annotated data and lacks generalizability. To address this issue, we propose $\textit{reverse-attention loss}$, a weighted sum of losses for all possible candidates with learnable weights. This is a pioneering approach to addressing the Autofocusing challenge in untrained deep-learning methods. Both theoretical analysis and experiments demonstrate its superiority in efficiency and accuracy. Interestingly, our method presents a significant reconstruction performance over rival methods (i.e. alternating descent-like optimization, non-weighted loss integration, and random distance assignment) and even is almost equal to that achieved with a precisely known object distance. For example, the difference is less than 1dB in PSNR and 0.002 in SSIM for the target sample in our experiment.

cs.CV↗

Quantification of cardiac capillarization in single-immunostained myocardial slices using weakly supervised instance segmentation

Decreased myocardial capillary density has been reported as an important histopathological feature associated with various heart disorders. Quantitative assessment of cardiac capillarization typically involves double immunostaining of cardiomyocytes (CMs) and capillaries in myocardial slices. In contrast, single immunostaining of basement membrane components is a straightforward approach to simultaneously label CMs and capillaries, presenting fewer challenges in background staining. However, subsequent image analysis always requires manual work in identifying and segmenting CMs and capillaries. Here, we developed an image analysis tool, AutoQC, to automatically identify and segment CMs and capillaries in immunofluorescence images of collagen type IV, a predominant basement membrane protein within the myocardium. In addition, commonly used capillarization-related measurements can be derived from segmentation masks. AutoQC features a weakly supervised instance segmentation algorithm by leveraging the power of a pre-trained segmentation model via prompt engineering. AutoQC outperformed YOLOv8-Seg, a state-of-the-art instance segmentation model, in both instance segmentation and capillarization assessment. Furthermore, the training of AutoQC required only a small dataset with bounding box annotations instead of pixel-wise annotations, leading to a reduced workload during network training. AutoQC provides an automated solution for quantifying cardiac capillarization in basement-membrane-immunostained myocardial slices, eliminating the need for manual image analysis once it is trained.

eess.IV↗

CP-BCS: Binary Code Summarization Guided by Control Flow Graph and Pseudo Code

Automatically generating function summaries for binaries is an extremely valuable but challenging task, since it involves translating the execution behavior and semantics of the low-level language (assembly code) into human-readable natural language. However, most current works on understanding assembly code are oriented towards generating function names, which involve numerous abbreviations that make them still confusing. To bridge this gap, we focus on generating complete summaries for binary functions, especially for stripped binary (no symbol table and debug information in reality). To fully exploit the semantics of assembly code, we present a control flow graph and pseudo code guided binary code summarization framework called CP-BCS. CP-BCS utilizes a bidirectional instruction-level control flow graph and pseudo code that incorporates expert knowledge to learn the comprehensive binary function execution behavior and logic semantics. We evaluate CP-BCS on 3 different binary optimization levels (O1, O2, and O3) for 3 different computer architectures (X86, X64, and ARM). The evaluation results demonstrate CP-BCS is superior and significantly improves the efficiency of reverse engineering.

cs.PL↗

Efficient Uncertainty Estimation with Gaussian Process for Reliable Dialog Response Retrieval

Deep neural networks have achieved remarkable performance in retrieval-based dialogue systems, but they are shown to be ill calibrated. Though basic calibration methods like Monte Carlo Dropout and Ensemble can calibrate well, these methods are time-consuming in the training or inference stages. To tackle these challenges, we propose an efficient uncertainty calibration framework GPF-BERT for BERT-based conversational search, which employs a Gaussian Process layer and the focal loss on top of the BERT architecture to achieve a high-quality neural ranker. Extensive experiments are conducted to verify the effectiveness of our method. In comparison with basic calibration methods, GPF-BERT achieves the lowest empirical calibration error (ECE) in three in-domain datasets and the distributional shift tasks, while yielding the highest $R_{10}@1$ and MAP performance on most cases. In terms of time consumption, our GPF-BERT has an 8$\times$ speedup.

cs.CL↗

On the Calibration and Uncertainty with Pólya-Gamma Augmentation for Dialog Retrieval Models

Deep neural retrieval models have amply demonstrated their power but estimating the reliability of their predictions remains challenging. Most dialog response retrieval models output a single score for a response on how relevant it is to a given question. However, the bad calibration of deep neural network results in various uncertainty for the single score such that the unreliable predictions always misinform user decisions. To investigate these issues, we present an efficient calibration and uncertainty estimation framework PG-DRR for dialog response retrieval models which adds a Gaussian Process layer to a deterministic deep neural network and recovers conjugacy for tractable posterior inference by Pólya-Gamma augmentation. Finally, PG-DRR achieves the lowest empirical calibration error (ECE) in the in-domain datasets and the distributional shift task while keeping $R_{10}@1$ and MAP performance.

cs.CL↗

On 1-Persistent Retransmission in Grant-free Access for URLLC Service

Ultra-reliable and low-latency communication (URLLC) is one of three major application scenarios of the 5G new radio, which has strict latency and reliability requirements. Contention-based grant-free (GF) access protocols, such as Reactive, K-Repetition, and Proactive, have been proposed for uplink URLLC service. In the GF access, user equipment (UE) resends packet immediately after an unsuccessful transmission such that the latency requirement can be satisfied. Taking Reactive as an example, this paper studies the impact of 1- persistent retransmission (1-pR) on the distribution of user-plane delay. We define the number of UEs that try to send packets in each mini-slot as attempt rate. We show that the 1-pR makes the attempt rate seen by the packet in retransmission larger than that seen by the packet in the first transmission. As a result, the successful probability of retransmission is lower than that of the first transmission. Based on this observation, we derive the distribution of user-plane delay, which also takes into account the delay incurred by queueing process. We demonstrate that whether to include the effect of 1-pR and queueing process in the analysis would have a significant impact on the prediction accuracy of delay distribution.

cs.NI↗

Uncertainty Calibration for Deep Audio Classifiers

Although deep Neural Networks (DNNs) have achieved tremendous success in audio classification tasks, their uncertainty calibration are still under-explored. A well-calibrated model should be accurate when it is certain about its prediction and indicate high uncertainty when it is likely to be inaccurate. In this work, we investigate the uncertainty calibration for deep audio classifiers. In particular, we empirically study the performance of popular calibration methods: (i) Monte Carlo Dropout, (ii) ensemble, (iii) focal loss, and (iv) spectral-normalized Gaussian process (SNGP), on audio classification datasets. To this end, we evaluate (i-iv) for the tasks of environment sound and music genre classification. Results indicate that uncalibrated deep audio classifiers may be over-confident, and SNGP performs the best and is very efficient on the two datasets of this paper.

cs.SD↗

VU-BERT: A Unified framework for Visual Dialog

The visual dialog task attempts to train an agent to answer multi-turn questions given an image, which requires the deep understanding of interactions between the image and dialog history. Existing researches tend to employ the modality-specific modules to model the interactions, which might be troublesome to use. To fill in this gap, we propose a unified framework for image-text joint embedding, named VU-BERT, and apply patch projection to obtain vision embedding firstly in visual dialog tasks to simplify the model. The model is trained over two tasks: masked language modeling and next utterance retrieval. These tasks help in learning visual concepts, utterances dependence, and the relationships between these two modalities. Finally, our VU-BERT achieves competitive performance (0.7287 NDCG scores) on VisDial v1.0 Datasets.

cs.CL↗

Computation Rate Maximum for Mobile Terminals in UAV-assisted Wireless Powered MEC Networks with Fairness Constraint

This paper investigates an unmanned aerial vehicle (UAV)-assisted wireless powered mobile-edge computing (MEC) system, where the UAV powers the mobile terminals by wireless power transfer (WPT) and provides computation service for them. We aim to maximize the computation rate of terminals while ensuring fairness among them. Considering the random trajectories of mobile terminals, we propose a soft actor-critic (SAC)-based UAV trajectory planning and resource allocation (SAC-TR) algorithm, which combines off-policy and maximum entropy reinforcement learning to promote the convergence of the algorithm. We design the reward as a heterogeneous function of computation rate, fairness, and reaching of destination. Simulation results show that SAC-TR can quickly adapt to varying network environments and outperform representative benchmarks in a variety of situations.

cs.NI↗

Interlayer-Exciton Based Nonvolatile Valleytronic Memory

Analogous to conventional charge-based electronics, valleytronics aims at encoding data via the valley degree of freedom, enabling new routes for information processing. Long-lived interlayer excitons (IXs) in van der Waals heterostructures (HSs) stacked by transition metal dichalcogenides (TMDs) carry valley-polarized information and thus could find promising applications in valleytronic devices. Although great progress of studies on valleytronic devices has been achieved, nonvolatile valleytronic memory, an indispensable device in valleytronics, is still lacking up to date. Here, we demonstrate an IX-based nonvolatile valleytronic memory in a WS2/WSe2 HS. In this device, the emission characteristics of IXs exhibit a large excitonic/valleytronic hysteresis upon cyclic-voltage sweeping, which is ascribed to the chemical-doping of O2/H2O redox couple trapped between the TMDs and substrate. Taking advantage of the large hysteresis, the first nonvolatile valleytronic memory has been successfully made, which shows a good performance with retention time exceeding 60 minutes. These findings open up an avenue for nonvolatile valleytronic memory and could stimulate more investigations on valleytronic devices.

physics.app-ph↗

Designing and Analysis of A Wi-Fi Data Offloading Strategy Catering for the Preference of Mobile Users

In recent years, offloading mobile traffic through Wi-Fi has emerged as a potential solution to lower down the communication cost for mobile users. Users hope to reduce the cost while keeping the delay in an acceptable range through Wi-Fi offloading. Also, different users have different sensitivities to the cost and the delay performance. How to make a proper cost-delay tradeoff according to the user's preference is the key issue in the design of the offloading strategy. To address this issue, we propose a preference-oriented offloading strategy for current commercial terminals, which transmit traffic only via one channel simultaneously. We model the strategy as a three-state M/MMSP/1 queueing system, of which the service process is a Markov modulated service process (MMSP), and obtain the structured solutions by establishing a hybrid embedded Markov chain. Our analysis shows that, given the user's preference, there exists an optimal deadline to maximize the utility, which is defined as the linear combination of the cost and the delay. We also provide a method to select the optimal deadline. Our simulation demonstrates that this strategy with the optimal deadline can achieve a good performance.

cs.NI↗

Modular WSS-based OXCs for Large-Scale Optical Networks

The explosive growth of broadband applications calls for large-scale optical cross-connects (OXCs). However, the classical wavelength selective switch (WSS) based OXC is not scalable in terms of the size of employed WSSs and the cabling complexity. To solve this problem, we propose a three-phase approach to construct a modular WSS-based OXC. In phase 1, we factorize the interconnection network between the input stage and the output stage of the traditional OXC into a set of small-size interconnection networks. In phase 2, we decompose each WSS into a two-stage cascaded structure of small-size WSSs. In phase 3, we combine the small-size interconnection networks with the small-size WSSs to form a set of small-size OXC modules. At last, we obtain a modular OXC, which is a network of small-size OXCs. Similar to the classical OXC, the modular OXC is nonblocking at each wavelength and possesses a self-routing property. Our analysis shows that the modular OXC has small cabling complexity and acceptable physical-layer performance.

cs.NI↗

Throughput and Delay Analysis of Slotted Aloha with Batch Service

In this paper, we study the throughput and delay performances of the slotted Aloha with batch service, which has wide applications in random access networks. Different from the classical slotted Aloha, each node in the slotted Aloha with batch service can transmit up to M packets once it succeeds in channel competition. The throughput is substantially improved because up to M packets jointly undertake the overhead due to contention. In an innovative vacation model developed in this paper, we consider each batch of data transmission as a busy period of each node, and the process between two successive busy periods as a vacation period. We then formulate the number of arrivals during a vacation period in a renewal-type equation, which characterizes the dependency between busy periods and vacation periods. Based on this formulation, we derive the mean waiting time of a packet and the bounded delay region for the slotted Aloha with batch service. Our results indicate the throughput and delay performances are substantially improved with the increase of batch sizeM, and the bounded delay region is enlarged accordingly. As M goes to infinity, we find the saturated throughput can approach 100% of channel capacity, and the system remains stable irrespective of the population size and transmission probability.

cs.PF↗

AWG-based Nonblocking Shuffle-Exchange Networks

Optical shuffle-exchange networks (SENs) have wide application in different kinds of interconnection networks. This paper proposes an approach to construct modular optical SENs, using a set of arrayed waveguide gratings (AWGs) and tunable wavelength converters (TWCs). According to the wavelength routing property of AWGs, we demonstrate for the first time that an AWG is functionally equivalent to a classical shuffle network by nature. Based on this result, we devise a systematic method to design a large-scale wavelength-division-multiplexing (WDM) shuffle network using a set of small-size AWGs associated with the same wavelength set. Combining the AWG-based WDM shuffle networks and the TWCs with small conversion range, we finally obtain an AWG-based WDM SEN, which not only is scalable in several ways, but also can achieve 100% utilization when the input wavelength channels are all busy. We also study the routing and wavelength assignment (RWA) problem of the AWG-based WDM SEN, and prove that the self-routing property and the nonblocking routing conditions of classical SENs are preserved in such AWG-based WDM SEN.

cs.NI↗

The Effect of Mobility on Delayed Data Offloading

Delayed offloading is a widely accepted solution for mobile users to offload their traffic through Wi-Fi when they are moving in urban areas. However, delayed offloading enhances offloading efficiency at the expense of delay performance. Previous works mainly focus on the improvement of offloading efficiency while keeping delay performance in an acceptable region. In this paper, we study the impact of the user mobility on delayed data offloading in respect to the tradeoff between offloading efficiency and delay performance. We model a mobile terminal with delayed data offloading as an M/MMSP/1 queuing system with three service states. To be practical, we consider the feature of currently commercial mobile terminals in our analysis. Our analytical result shows that the mobility of the users can reduce the queueing delay incurred by the delayed offloading, and suggests that delayed offloading strategies can be optimized according to the mobility of the terminals once the delay requirement is given.

cs.NI↗

Modular AWG-based Optical Shuffle Network

This paper proposes an arrayed-waveguide grating (AWG) based wavelength-division-multiplexing (WDM) shuffle network. Compared with previous optical shuffle networks, our proposal is compact, easy to implement, highly scalable, and cost effective.

cs.OH↗

Optimum Transmission Window for EPONs with Gated-Limited Service

This paper studies the Ethernet Passive Optical Network (EPON) with gated-limited service. The transmission window (TW) is limited in this system to guaranteeing a bounded delay experienced by disciplined users, and to constrain malicious users from monopolizing the transmission channel. Thus, selecting an appropriate TW size is critical to the performance of EPON with gated-limited service discipline. To investigate the impact of TW size on packet delay, we derive a generalized mean waiting time formula for M/G/1 queue with vacation times and gated-limited service discipline. A distinguished feature of this model is that there are two queues in the buffer of each optical network unit (ONU): one queue is inside the gate and the other one is outside the gate. Furthermore, based on the Chernoff bound of queue length, we provide a simple rule to determine an optimum TW size for gated-limited service EPONs. Analytic results reported in this paper are all verified by simulations.

cs.NI↗

Power Efficiency and Delay Tradeoff of 10GBase-T Energy Efficient Ethernet Protocol

In this paper, we study the power efficiency and delay performance of the IEEE 802.3az Energy Efficient Ethernet (EEE) protocol. A new approach is proposed to analyze the M/G/1 queue with the vacation time that is governed by the arrival process and the parameter τ and N of the BTR strategy. Our key idea is to establish the connection between the vacation time and the arrival process to account for their dependency. We first derive the distribution of the number of arrivals during a vacation time based on an event tree of the BTR strategy, from which we obtain the mean vacation time and the power efficiency. Next, from the condition on the number of arrivals at the end of a vacation period, we derive a generalized P-K formula of the mean delay for EEE systems, and prove that the classical P-K formula of the vacation model is only a special case when the vacation time is independent of the arrival process. Our analysis demonstrates that the τ policy and N policy of the BTR strategy are compensating each other. The τ policy ensures the frame delay is bounded when the traffic load is light, while the N policy ensures the queue length at the end of vacation is bounded when the traffic load is heavy. These results, in turn, provide the rules to select appropriate τ and N. Our analytical results are confirmed by simulations.

cs.NI↗