Searcharxiv⌕ Search

arXiv subjects

Pei Liu

Publications and source records attributed to Pei Liu.

At least 109 records · Page 6Linked to original sources

AdvMIL: Adversarial Multiple Instance Learning for the Survival Analysis on Whole-Slide Images

The survival analysis on histological whole-slide images (WSIs) is one of the most important means to estimate patient prognosis. Although many weakly-supervised deep learning models have been developed for gigapixel WSIs, their potential is generally restricted by classical survival analysis rules and fully-supervised learning requirements. As a result, these models provide patients only with a completely-certain point estimation of time-to-event, and they could only learn from the labeled WSI data currently at a small scale. To tackle these problems, we propose a novel adversarial multiple instance learning (AdvMIL) framework. This framework is based on adversarial time-to-event modeling, and integrates the multiple instance learning (MIL) that is much necessary for WSI representation learning. It is a plug-and-play one, so that most existing MIL-based end-to-end methods can be easily upgraded by applying this framework, gaining the improved abilities of survival distribution estimation and semi-supervised learning. Our extensive experiments show that AdvMIL not only could often bring performance improvement to mainstream WSI survival analysis methods at a relatively low computational cost, but also enables these methods to effectively utilize unlabeled data via semi-supervised learning. Moreover, it is observed that AdvMIL could help improving the robustness of models against patch occlusion and two representative image noises. The proposed AdvMIL framework could promote the research of survival analysis in computational pathology with its novel adversarial MIL paradigm.

eess.IV↗

DSCA: A Dual-Stream Network with Cross-Attention on Whole-Slide Image Pyramids for Cancer Prognosis

The cancer prognosis on gigapixel Whole-Slide Images (WSIs) has always been a challenging task. To further enhance WSI visual representations, existing methods have explored image pyramids, instead of single-resolution images, in WSIs. In spite of this, they still face two major problems: high computational cost and the unnoticed semantical gap in multi-resolution feature fusion. To tackle these problems, this paper proposes to efficiently exploit WSI pyramids from a new perspective, the dual-stream network with cross-attention (DSCA). Our key idea is to utilize two sub-streams to process the WSI patches with two resolutions, where a square pooling is devised in a high-resolution stream to significantly reduce computational costs, and a cross-attention-based method is proposed to properly handle the fusion of dual-stream features. We validate our DSCA on three publicly-available datasets with a total number of 3,101 WSIs from 1,911 patients. Our experiments and ablation studies verify that (i) the proposed DSCA could outperform existing state-of-the-art methods in cancer prognosis, by an average C-Index improvement of around 4.6%; (ii) our DSCA network is more efficient in computation -- it has more learnable parameters (6.31M vs. 860.18K) but less computational costs (2.51G vs. 4.94G), compared to a typical existing multi-resolution network. (iii) the key components of DSCA, dual-stream and cross-attention, indeed contribute to our model's performance, gaining an average C-Index rise of around 2.0% while maintaining a relatively-small computational load. Our DSCA could serve as an alternative and effective tool for WSI-based cancer prognosis.

eess.IV↗

Error per single-qubit gate below $10^{-4}$ in a superconducting qubit

Implementing arbitrary single-qubit gates with near perfect fidelity is among the most fundamental requirements in gate-based quantum information processing. In this work, we fabric a transmon qubit with long coherence times and demonstrate single-qubit gates with the average gate error below $10^{-4}$, i.e. $(7.42\pm0.04)\times10^{-5}$ by randomized benchmarking (RB). To understand the error sources, we experimentally obtain an error budget, consisting of the decoherence errors lower bounded by $(4.62\pm0.04)\times10^{-5}$ and the leakage rate per gate of $(1.16\pm0.04)\times10^{-5}$. Moreover, we reconstruct the process matrices for the single-qubit gates by the gate set tomography (GST), with which we simulate RB sequences and obtain single-qubit fedlities consistent with experimental results. We also observe non-Markovian behavior in the experiment of long-sequence GST, which may provide guidance for further calibration. The demonstration extends the upper limit that the average fidelity of single-qubit gates can reach in a transmon-qubit system, and thus can be an essential step towards practical and reliable quantum computation in the near future.

quant-ph↗

NCS4CVR: Neuron-Connection Sharing for Multi-Task Learning in Video Conversion Rate Prediction

Click-through rate (CTR) and post-click conversion rate (CVR) predictions are two fundamental modules in industrial ranking systems such as recommender systems, advertising, and search engines. Since CVR involves much fewer samples than CTR (known as the CVR data sparsity problem), most of the existing works try to leverage CTR&CVR multi-task learning to improve CVR performance. However, typical coarse-grained sub-network/layer sharing methods may introduce conflicts and lead to performance degradation, since not every neuron or neuron connection in one layer should be shared between CVR and CTR tasks. This is because users may have different fine-grained content feature preferences between deep consumption and click behavior, represented by CVR and CTR, respectively. To address this sharing&conflict problem, we propose a novel multi-task CVR modeling scheme with neuron-connection level sharing named NCS4CVR, which can automatically and flexibly learn which neuron weights are shared or not shared without artificial experience. Compared with previous layer-level sharing methods, this is the first time that a fine-grained CTR&CVR sharing method at the neuron connection level is proposed, which is a research paradigm shift in the sharing level. Both offline and online experiments demonstrate that our method outperforms both the single-task model and the layer-level sharing model. Our proposed method has now been successfully deployed in an industry video recommender system serving major traffic.

cs.IR↗

A First Look at CI/CD Adoptions in Open-Source Android Apps

Continuous Integration (CI) and Continuous Delivery (CD) have been demonstrated to be effective in facilitating software building, testing, and deployment. Many research studies have investigated and subsequently improved their working processes. Unfortunately, such research efforts have largely not touched on the usage of CI/CD in the development of Android apps. We fill this gap by conducting an exploratory study of CI/CD adoption in open-source Android apps. We start by collecting a set of 84,475 open-source Android apps from the most popular three online code hosting sites, namely Github, GitLab, and Bitbucket. We then look into those apps and find that (1) only around 10\% of apps have leveraged CI/CD services, i.e., the majority of open-source Android apps are developed without accessing CI/CD services, (2) a small number of apps (291) has even adopted multiple CI/CD services, (3) nearly half of the apps adopted CI/CD services have not really used them, and (4) CI/CD services are useful to improve the popularity of projects.

cs.SE↗

Mining Android API Usage to Generate Unit Test Cases for Pinpointing Compatibility Issues

Despite being one of the largest and most popular projects, the official Android framework has only provided test cases for less than 30% of its APIs. Such a poor test case coverage rate has led to many compatibility issues that can cause apps to crash at runtime on specific Android devices, resulting in poor user experiences for both apps and the Android ecosystem. To mitigate this impact, various approaches have been proposed to automatically detect such compatibility issues. Unfortunately, these approaches have only focused on detecting signature-induced compatibility issues (i.e., a certain API does not exist in certain Android versions), leaving other equally important types of compatibility issues unresolved. In this work, we propose a novel prototype tool, JUnitTestGen, to fill this gap by mining existing Android API usage to generate unit test cases. After locating Android API usage in given real-world Android apps, JUnitTestGen performs inter-procedural backward data-flow analysis to generate a minimal executable code snippet (i.e., test case). Experimental results on thousands of real-world Android apps show that JUnitTestGen is effective in generating valid unit test cases for Android APIs. We show that these generated test cases are indeed helpful for pinpointing compatibility issues, including ones involving semantic code changes.

cs.SE↗

Energetic Variational Approach for Prediction of Thermal Electrokinetics in Charging and Discharging Processes of Electrical Double Layer Capacitors

This work proposes a new variational, thermodynamically consistent model to predict thermal electrokinetics in electric double layer capacitors (EDLCs) by using an energetic variational approach. The least action principle and maximum dissipation principle from the non-equilibrium thermodynamics are employed to develop modified Nernst-Planck equations for non-isothermal ion transport with temperature inhomogeneity. Laws of thermodynamics are employed to derive a temperature evolution equation with heat sources due to thermal pressure and electrostatic interactions. Numerical simulations successfully predict temperature oscillation in the charging-discharging processes of EDLCs, indicating that the developed model is able to capture reversible and irreversible heat generations. The impact of ionic sizes and scan rate of surface potential on ion transport, heat generation, and charge current is systematically assessed in cyclic voltammetry simulations. It is found that the thermal electrokinetics in EDLCs cannot follow the surface potential with fast scan rates, showing delayed dynamics with hysteresis diagrams. Our work thus provides a useful tool for physics-based prediction of thermal electrokinetics in EDLCs.

physics.chem-ph↗

Identifying and Characterizing Silently-Evolved Methods in the Android API

With over 500,000 commits and more than 700 contributors, the Android platform is undoubtedly one of the largest industrial-scale software projects. This project provides the Android API, and developers heavily rely on this API to develop their Android apps. Unfortunately, because the Android platform and its API evolve at an extremely rapid pace, app developers need to continually monitor API changes to avoid compatibility issues in their apps (\ie issues that prevent apps from working as expected when running on newer versions of the API). Despite a large number of studies on compatibility issues in the Android API, the research community has not yet investigated issues related to silently-evolved methods (SEMs). These methods are functions whose behavior might have changed but the corresponding documentation did not change accordingly. Because app developers rely on the provided documentation to evolve their apps, changes to methods that are not suitably documented may lead to unexpected failures in the apps using these methods. To shed light on this type of issue, we conducted a large-scale empirical study in which we identified and characterized SEMs across ten versions of the Android API. In the study, we identified SEMs, characterized the nature of the changes, and analyzed the impact of SEMs on a set of 1,000 real-world Android apps. Our experimental results show that SEMs do exist in the Android API, and that 957 of the apps we considered use at least one SEM. Based on these results, we argue that the Android platform developers should take actions to avoid introducing SEMs, especially those involving semantic changes. This situation highlights the need for automated techniques and tools to help Android practitioners in this task.

cs.SE↗

Do Customized Android Frameworks Keep Pace with Android?

To satisfy varying customer needs, device vendors and OS providers often rely on the open-source nature of the Android OS and offer customized versions of the Android OS. When a new version of the Android OS is released, device vendors and OS providers need to merge the changes from the Android OS into their customizations to account for its bug fixes, security patches, and new features. Because developers of customized OSs might have made changes to code locations that were also modified by the developers of the Android OS, the merge task can be characterized by conflicts, which can be time-consuming and error-prone to resolve. To provide more insight into this critical aspect of the Android ecosystem, we present an empirical study that investigates how eight open-source customizations of the Android OS merge the changes from the Android OS into their projects. The study analyzes how often the developers from the customized OSs merge changes from the Android OS, how often the developers experience textual merge conflicts, and the characteristics of these conflicts. Furthermore, to analyze the effect of the conflicts, the study also analyzes how the conflicts can affect a randomly selected sample of 1,000 apps. After analyzing 1,148 merge operations, we identified that developers perform these operations for 9.7\% of the released versions of the Android OS, developers will encounter at least one conflict in 41.3\% of the merge operations, 58.1\% of the conflicts required developers to change the customized OSs, and 64.4\% of the apps considered use at least one method affected by a conflict. In addition to detailing our results, the paper also discusses the implications of our findings and provides insights for researchers and practitioners working with Android and its customizations.

cs.SE↗

Automatically Detecting API-induced Compatibility Issues in Android Apps: A Comparative Analysis (Replicability Study)

Fragmentation is a serious problem in the Android ecosystem. This problem is mainly caused by the fast evolution of the system itself and the various customizations independently maintained by different smartphone manufacturers. Many efforts have attempted to mitigate its impact via approaches to automatically pinpoint compatibility issues in Android apps. Unfortunately, at this stage, it is still unknown if this objective has been fulfilled, and the existing approaches can indeed be replicated and reliably leveraged to pinpoint compatibility issues in the wild. We, therefore, propose to fill this gap by first conducting a literature review within this topic to identify all the available approaches. Among the nine identified approaches, we then try our best to reproduce them based on their original datasets. After that, we go one step further to empirically compare those approaches against common datasets with real-world apps containing compatibility issues. Experimental results show that existing tools can indeed be reproduced, but their capabilities are quite distinct, as confirmed by the fact that there is only a small overlap of the results reported by the selected tools. This evidence suggests that more efforts should be spent by our community to achieve sound compatibility issues detection.

cs.SE↗

Vacuum-gap transmon qubits realized using flip-chip technology

Significant progress has been made in building large-scale superconducting quantum processors based on flip-chip technology. In this work, we use the flip-chip technology to realize a modified transmon qubit, donated as the "flipmon", whose large shunt capacitor is replaced by a vacuum-gap parallel plate capacitor. To further reduce the qubit footprint, we place one of the qubit pads and a single Josephson junction on the bottom chip and the other pad on the top chip which is galvanically connected with the single Josephson junction through an indium bump. The electric field participation ratio can arrive at nearly 53% in air when the vacuum-gap is about 5 microns, and thus potentially leading to a lower dielectric loss. The coherence times of the flipmons are measured in the range of 30-60 microseconds, which are comparable with that of traditional transmons with similar fabrication processes. The electric field simulation indicates that the metal-air interface's participation ratio increases significantly and may dominate the qubit's decoherence. This suggests that more careful surface treatment needs to be considered. No evidence shows that the indium bumps inside the flipmons cause significant decoherence. With well-designed geometry and good surface treatment, the coherence of the flipmons can be further improved.

quant-ph↗

Machine Learning Enabled Preamble Collision Resolution in Distributed Massive MIMO

Preamble collision is a bottleneck that impairs the performance of random access (RA) user equipment (UE) in grant-free RA (GFRA). In this paper, by leveraging distributed massive multiple input multiple output (mMIMO) together with machine learning, a novel machine learning based framework solution is proposed to address the preamble collision problem in GFRA. The key idea is to identify and employ the neighboring access points (APs) of a collided RA UE for its data decoding rather than all the APs, so that the mutual interference among collided RA UEs can be effectively mitigated. To this end, we first design a tailored deep neural network (DNN) to enable the preamble multiplicity estimation in GFRA, where an energy detection (ED) method is also proposed for performance comparison. With the estimated preamble multiplicity, we then propose a K-means AP clustering algorithm to cluster the neighboring APs of collided RA UEs and organize each AP cluster to decode the received data individually. Simulation results show that a decent performance of preamble multiplicity estimation in terms of accuracy and reliability can be achieved by the proposed DNN, and confirm that the proposed schemes are effective in preamble collision resolution in GFRA, which are able to achieve a near-optimal performance in terms of uplink achievable rate per collided RA UE, and offer significant performance improvement over traditional schemes.

eess.SP↗

Field Theory of Reaction-Diffusion: Mass Action with an Energetic Variational Approach

We extend the energetic variational approach so it can be applied to a chemical reaction system with general mass action kinetics. Our approach starts with an energy-dissipation law. We show that the chemical equilibrium is determined by the choice of the free energy and the dynamics of the chemical reaction is determined by the choice of the dissipation. This approach enables us to couple chemical reactions with other effects, such as diffusion and drift in an electric field. As an illustration, we apply our approach to a non-equilibrium reaction-diffusion system in a specific but canonical set-up. We show by numerical simulation that the input-output relation of such a system depends on the choice of the dissipation.

physics.chem-ph↗

Ion-dependent DNA Configuration in Bacteriophage Capsids

Bacteriophages densely pack their long dsDNA genome inside a protein capsid. The conformation of the viral genome inside the capsid is consistent with a hexagonal liquid crystalline structure. Experiments have confirmed that the details of the hexagonal packing depend on the electrochemistry of the capsid and its environment. In this work, we propose a biophysical model that quantifies the relationship between DNA configurations inside bacteriophage capsids and the types and concentrations of ions present in a biological system. We introduce an expression for the free energy which combines the electrostatic energy with contributions from bending of individual segments of DNA and Lennard-Jones-type interactions between these segments. The equilibrium points of this energy solve a partial differential equation that defines the distributions of DNA and the ions inside the capsid. We develop a computational approach that allows us to simulate much larger systems than what is currently possible using the existing simulations, typically done at a molecular level. In particular, we are able to estimate bending and repulsion between DNA segments as well as the full electrochemistry of the solution, both inside and outside of the capsid. The numerical results show good agreement with existing experiments and molecular dynamics simulations for small capsids.

cond-mat.soft↗

MMSE Channel Estimation for Two-Port Demodulation Reference Signals in New Radio

Two-port demodulation reference signals (DMRS) have been employed in new radio (NR) recently. In this paper, we firstly propose a minimum mean square error (MMSE) scheme with full priori knowledge (F-MMSE) to achieve the channel estimation of two-port DMRS in NR. When the two ports are assigned to different users, the full priori knowledge of two ports is not easy to be obtained for one user. Then, we present a MMSE scheme with partial priori knowledge (P-MMSE). Finally, numerical results show that the proposed schemes achieve satisfactory channel estimation performance. Moreover, for both mean square error and bit error ratio metrics, the proposed schemes can achieve better performance compared with the classical discrete Fourier transform based channel estimation. Particularly, P-MMSE scheme delivers almost the same performance compared with F-MMSE scheme by a small amount of prior knowledge.

eess.SP↗

Global Existence of the Non-isothermal Poisson-Nernst-Planck-Fourier System

In this paper, we consider a non-isothermal electrokinetic model, which is derived from the Energetic Variational Approach. The charge transport is described through the Poisson-Nernst-Planck equations with variable temperature, and the heat flux satisfies the Fourier's law. This Poisson-Nernst-Planck-Fourier model satisfies both the first law and second law of thermodynamics as well as the Onsager's reciprocal relations, thus it is thermodynamic-consistent. Finally, we prove the global well-posedness for this model under the smallness assumption of the initial data by the energy method.

math.AP↗

Deep Anomaly Detection in Packet Payload

With the widespread adoption of cloud services, especially the extensive deployment of plenty of Web applications, it is important and challenging to detect anomalies from the packet payload. For example, the anomalies in the packet payload can be expressed as a number of specific strings which may cause attacks. Although some approaches have achieved remarkable progress, they are with limited applications since they are dependent on in-depth expert knowledge, e.g., signatures describing anomalies or communication protocol at the application level. Moreover, they might fail to detect the payload anomalies that have long-term dependency relationships. To overcome these limitations and adaptively detect anomalies from the packet payload, we propose a deep learning based framework which consists of two steps. First, a novel feature engineering method is proposed to obtain the block-based features via block sequence extraction and block embedding. The block-based features could encapsulate both the high-dimension information and the underlying sequential information which facilitate the anomaly detection. Second, a neural network is designed to learn the representation of packet payload based on Long Short-Term Memory (LSTM) and Convolutional Neural Networks (CNN). Furthermore, we cast the anomaly detection as a classification problem and stack a Multi-Layer Perception (MLP) on the above representation learning network to detect anomalies. Extensive experimental results on three public datasets indicate that our model could achieve a higher detection rate, while keeping a lower false positive rate compared with five state-of-the-art methods.

eess.SP↗

Spectral Efficiency Analysis of Cell-Free Massive MIMO Systems with Zero-Forcing Detector

In this paper, we firstly derive two approximations of the achievable uplink rate with the perfect/imperfect channel state information (CSI) in cell-free massive multi-input multi-output (MIMO) systems, and all these approximations are not only in the simple, but also converge into the classical bounds achieved in conventional massive MIMO systems where the base-station (BS) antennas are co-located. It is worth noting that the obtained two approximations with perfect CSI could be regarded as the special cases of the obtained two approximations with imperfect CSI when the pilot sequence power becomes infinite, respectively. Moreover, the theory analysis shows that all obtained approximations with perfect/imperfect CSI have an asymptotic lower bound $\fracα{2}\log_2 L$ thanks to the extra {\emph {distance diversity}} offered by massively distributed antennas, where $L$ is the number of BS antennas and the path-loss factor $α>2$, except for the free space environment. Obviously, these results indicate that the cell-free massive MIMO system has huge potential of spectral efficiency than the conventional massive MIMO system with the asymptotically tight bound $\log_2 L$.

cs.IT↗