arXiv subjects

Peng Liu

Publications and source records attributed to Peng Liu.

At least 271 records · Page 15Linked to original sources

arXiv2023

Non-rigid Point Cloud Registration for Middle Ear Diagnostics with Endoscopic Optical Coherence Tomography

Purpose: Middle ear infection is the most prevalent inflammatory disease, especially among the pediatric population. Current diagnostic methods are subjective and depend on visual cues from an otoscope, which is limited for otologists to identify pathology. To address this shortcoming, endoscopic optical coherence tomography (OCT) provides both morphological and functional in-vivo measurements of the middle ear. However, due to the shadow of prior structures, interpretation of OCT images is challenging and time-consuming. To facilitate fast diagnosis and measurement, improvement in the readability of OCT data is achieved by merging morphological knowledge from ex-vivo middle ear models with OCT volumetric data, so that OCT applications can be further promoted in daily clinical settings. Methods: We propose C2P-Net: a two-staged non-rigid registration pipeline for complete to partial point clouds, which are sampled from ex-vivo and in-vivo OCT models, respectively. To overcome the lack of labeled training data, a fast and effective generation pipeline in Blender3D is designed to simulate middle ear shapes and extract in-vivo noisy and partial point clouds. Results: We evaluate the performance of C2P-Net through experiments on both synthetic and real OCT datasets. The results demonstrate that C2P-Net is generalized to unseen middle ear point clouds and capable of handling realistic noise and incompleteness in synthetic and real OCT data. Conclusion: In this work, we aim to enable diagnosis of middle ear structures with the assistance of OCT images. We propose C2P-Net: a two-staged non-rigid registration pipeline for point clouds to support the interpretation of in-vivo noisy and partial OCT images for the first time. Code is available at: https://gitlab.com/nct\_tso\_public/c2p-net.

cs.CV↗

arXiv2023

An Ethereum-compatible blockchain that explicates and ensures design-level safety properties for smart contracts

Smart contracts are crucial elements of decentralized technologies, but they face significant obstacles to trustworthiness due to security bugs and trapdoors. To address the core issue, we propose a technology that enables programmers to focus on design-level properties rather than specific low-level attack patterns. Our proposed technology, called Theorem-Carrying-Transaction (TCT), combines the benefits of runtime checking and symbolic proof. Under the TCT protocol, every transaction must carry a theorem that proves its adherence to the safety properties in the invoked contracts, and the blockchain checks the proof before executing the transaction. The unique design of TCT ensures that the theorems are provable and checkable in an efficient manner. We believe that TCT holds a great promise for enabling provably secure smart contracts in the future. As such, we call for collaboration toward this vision.

cs.CR↗

arXiv2023

Learning the black hole metric from holographic conductivity

We construct a neural network to learn the RN-AdS black hole metric based on the data of optical conductivity by holography. The linear perturbative equation for the Maxwell field is rewritten in terms of the optical conductivity such that the neural network is constructed based on the discretization of this differential equation. In contrast to all previous models in AdS/DL (deep learning) duality, the derivative of the metric function appears in the equation of motion and we propose distinct finite difference methods to discretize this function. The notion of the reduced conductivity is also proposed to avoid the divergence of the optical conductivity near the horizon.The dependence of the training outcomes on the location of the cutoff, the temperature as well as the frequency range is investigated in detail. This work provides a concrete example for the reconstruction of the bulk geometry with the given data on the boundary by deep learning.

hep-th↗

arXiv2023

Phased Progressive Learning with Coupling-Regulation-Imbalance Loss for Imbalanced Data Classification

Deep convolutional neural networks often perform poorly when faced with datasets that suffer from quantity imbalances and classification difficulties. Despite advances in the field, existing two-stage approaches still exhibit dataset bias or domain shift. To counter this, a phased progressive learning schedule has been proposed that gradually shifts the emphasis from representation learning to training the upper classifier. This approach is particularly beneficial for datasets with larger imbalances or fewer samples. Another new method a coupling-regulation-imbalance loss function is proposed, which combines three parts: a correction term, Focal loss, and LDAM loss. This loss is effective in addressing quantity imbalances and outliers, while regulating the focus of attention on samples with varying classification difficulties. These approaches have yielded satisfactory results on several benchmark datasets, including Imbalanced CIFAR10, Imbalanced CIFAR100, ImageNet-LT, and iNaturalist 2018, and can be easily generalized to other imbalanced classification models.

cs.LG↗

arXiv2023

Recommending on graphs: a comprehensive review from a data perspective

Recent advances in graph-based learning approaches have demonstrated their effectiveness in modelling users' preferences and items' characteristics for Recommender Systems (RSS). Most of the data in RSS can be organized into graphs where various objects (e.g., users, items, and attributes) are explicitly or implicitly connected and influence each other via various relations. Such a graph-based organization brings benefits to exploiting potential properties in graph learning (e.g., random walk and network embedding) techniques to enrich the representations of the user and item nodes, which is an essential factor for successful recommendations. In this paper, we provide a comprehensive survey of Graph Learning-based Recommender Systems (GLRSs). Specifically, we start from a data-driven perspective to systematically categorize various graphs in GLRSs and analyze their characteristics. Then, we discuss the state-of-the-art frameworks with a focus on the graph learning module and how they address practical recommendation challenges such as scalability, fairness, diversity, explainability and so on. Finally, we share some potential research directions in this rapidly growing area.

cs.IR↗

arXiv2023

Approaching Shannon's One-Time Pad: Metrics, Architectures, and Enabling Technologies

The rapid development of advanced computing technologies such as quantum computing imposes new challenges to current wireless security mechanism which is based on cryptographic approaches. To deal with various attacks and realize long-lasting security, we are in urgent need of disruptive security solutions. In this article, novel security transmission paradigms are proposed to approach Shannon's one-time pad perfect secrecy. First, two metrics, termed as Degree-of-Approaching (DoA) and Degree-of-Synchronous-Approaching (DoSA), are developed to characterize the closeness between the achieved security strength and perfect secrecy. These two metrics also serve as a guideline for secure transmission protocol design. After that, we present two paths towards Shannon's one-time pad, i.e., an explicit-encryption based approach and an implicit-encryption based approach. For both of them, we discuss the architecture design, enabling technologies, as well as preliminary performance evaluation results. The techniques presented in this article provide promising security-enhancing solutions for future wireless networks.

cs.CR↗

arXiv2023

In-Situ Calibration of Antenna Arrays for Positioning With 5G Networks

Owing to the ubiquity of cellular communication signals, positioning with the fifth generation (5G) signal has emerged as a promising solution in global navigation satellite system-denied areas. Unfortunately, although the widely employed antenna arrays in 5G remote radio units (RRUs) facilitate the measurement of the direction of arrival (DOA), DOA-based positioning performance is severely degraded by array errors. This paper proposes an in-situ calibration framework with a user terminal transmitting 5G reference signals at several known positions in the actual operating environment and the accessible RRUs estimating their array errors from these reference signals. Further, since sub-6GHz small-cell RRUs deployed for indoor coverage generally have small-aperture antenna arrays, while 5G signals have plentiful bandwidth resources, this work segregates the multipath components via super-resolution delay estimation based on the maximum likelihood criteria. This differs significantly from existing in-situ calibration works which resolve multipaths in the spatial domain. The superiority of the proposed method is first verified by numerical simulations. We then demonstrate via field test with commercial 5G equipment that, a reduction of 46.7% for 1-$σ$ DOA estimation error can be achieved by in-situ calibration using the proposed method.

eess.SP↗

arXiv2023

Classifying Ambiguous Identities in Hidden-Role Stochastic Games with Multi-Agent Reinforcement Learning

Multi-agent reinforcement learning (MARL) is a prevalent learning paradigm for solving stochastic games. In most MARL studies, agents in a game are defined as teammates or enemies beforehand, and the relationships among the agents remain fixed throughout the game. However, in real-world problems, the agent relationships are commonly unknown in advance or dynamically changing. Many multi-party interactions start off by asking: who is on my team? This question arises whether it is the first day at the stock exchange or the kindergarten. Therefore, training policies for such situations in the face of imperfect information and ambiguous identities is an important problem that needs to be addressed. In this work, we develop a novel identity detection reinforcement learning (IDRL) framework that allows an agent to dynamically infer the identities of nearby agents and select an appropriate policy to accomplish the task. In the IDRL framework, a relation network is constructed to deduce the identities of other agents by observing the behaviors of the agents. A danger network is optimized to estimate the risk of false-positive identifications. Beyond that, we propose an intrinsic reward that balances the need to maximize external rewards and accurate identification. After identifying the cooperation-competition pattern among the agents, IDRL applies one of the off-the-shelf MARL methods to learn the policy. To evaluate the proposed method, we conduct experiments on Red-10 card-shedding game, and the results show that IDRL achieves superior performance over other state-of-the-art MARL methods. Impressively, the relation network has the par performance to identify the identities of agents with top human players; the danger network reasonably avoids the risk of imperfect identification. The code to reproduce all the reported results is available online at https://github.com/MR-BENjie/IDRL.

cs.AI↗

arXiv2023

Quasinormal modes and Hawking radiation of a charged Weyl black hole

We investigate the scalar field system over a charged Weyl black hole, depicted by a parameter $λ$. It is found that the imaginary part of the quasinormal mode spectra is always negative and the perturbation does not increase with the time, indicating that the system is stable under scalar field perturbation. Furthermore, the quasinormal mode spectra and Hawking radiation exhibit a qualitatively similar characteristic in that they both rise with rising $λ$ and approach a constant when $λ$ is large enough. Especially, we would like to emphasize that an exponential decay obviously emerges in the phase of the ringing tail as $λ$ increases. It indicates that the characteristic parameter $λ$ has an obvious imprint on the ringing tail, which is expected to be detected by future observations.

gr-qc↗

arXiv2023

The mixed-state entanglement in holographic p-wave superconductor model

In this paper, we investigate the mixed-state entanglement in a model of p-wave superconductivity phase transition using holographic methods. We calculate several entanglement measures, including holographic entanglement entropy (HEE), mutual information (MI), and entanglement wedge cross-section (EWCS). Our results show that these measures display critical behavior at the phase transition points, with the EWCS exhibiting opposite temperature behavior compared to the HEE. Additionally, we find that the critical exponents of all entanglement measures are twice those of the condensate. Moreover, we find that the EWCS is a more sensitive indicator of the critical behavior of phase transitions than the HEE. Furthermore, we uncover a universal inequality in the growth rates of EWCS and MI near critical points in thermal phase transitions, such as p-wave and s-wave superconductivity, suggesting that MI captures more information than EWCS when a phase transition first occurs.

hep-th↗

arXiv2023

Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domain

Deep Reinforcement Learning (DRL) and Deep Multi-agent Reinforcement Learning (MARL) have achieved significant successes across a wide range of domains, including game AI, autonomous vehicles, robotics, and so on. However, DRL and deep MARL agents are widely known to be sample inefficient that millions of interactions are usually needed even for relatively simple problem settings, thus preventing the wide application and deployment in real-industry scenarios. One bottleneck challenge behind is the well-known exploration problem, i.e., how efficiently exploring the environment and collecting informative experiences that could benefit policy learning towards the optimal ones. This problem becomes more challenging in complex environments with sparse rewards, noisy distractions, long horizons, and non-stationary co-learners. In this paper, we conduct a comprehensive survey on existing exploration methods for both single-agent and multi-agent RL. We start the survey by identifying several key challenges to efficient exploration. Beyond the above two main branches, we also include other notable exploration methods with different ideas and techniques. In addition to algorithmic analysis, we provide a comprehensive and unified empirical comparison of different exploration methods for DRL on a set of commonly used benchmarks. According to our algorithmic and empirical investigation, we finally summarize the open problems of exploration in DRL and deep MARL and point out a few future directions.

cs.AI↗

arXiv2023

Broadband high-resolution integrated spectrometer architecture & data processing method

Up-to-date network telemetry is the key enabler for resource optimization by capacity scaling, fault recovery, and network reconfiguration among other means. Reliable optical performance monitoring in general and, specifically, the monitoring of the spectral profile of WDM signals in fixed- and flex- grid architectures across the entire C-band, remains challenging. This article describes a two-stage spectrometer architecture amenable to integration on a single chip that can measure quantitatively the spectrum across the entire C-band with a resolution of 1 GHz approximately. The first stage consists of a ring resonator with intra-ring phase shifter to provide a tuneable fine filter. The second stage makes use of an AWG subsystem and novel processing algorithm to synthesize a tuneable coarse filter with a flat passband which isolates individual resonances of a multiplicity of ring resonances. Due to its maturity and low loss, CMOS compatible Si$_3$N$_4$ is chosen for integration. A fabricated ring resonator functioning over the entire C-band with 1.3 GHz FWHM bandwidth resonances tunable over a complete free spectral range of 50 GHz is experimentally demonstrated. The complete system operation is demonstrated using an industry standard simulation tool and AWG constructor data. The operation of the circuit is invariant to the optical path length between individual components substantially improving robustness to fabrication process variations.

physics.optics↗

arXiv2022

Link-level simulator for 5G localization

Channel-state-information-based localization in 5G networks has been a promising way to obtain highly accurate positions compared to previous communication networks. However, there is no unified and effective platform to support the research on 5G localization algorithms. This paper releases a link-level simulator for 5G localization, which can depict realistic physical behaviors of the 5G positioning signal transmission. Specifically, we first develop a simulation architecture considering more elaborate parameter configuration and physical-layer processing. The architecture supports the link modeling at sub-6GHz and millimeter-wave (mmWave) frequency bands. Subsequently, the critical physical-layer components that determine the localization performance are designed and integrated. In particular, a lightweight new-radio channel model and hardware impairment functions that significantly limit the parameter estimation accuracy are developed. Finally, we present three application cases to evaluate the simulator, i.e. two-dimensional mobile terminal localization, mmWave beam sweeping, and beamforming-based angle estimation. The numerical results in the application cases present the performance diversity of localization algorithms in various impairment conditions.

eess.SP↗

arXiv2022

MPSN: Motion-aware Pseudo Siamese Network for Indoor Video Head Detection in Buildings

Head detection in the indoor video is an essential component of building occupancy detection. While deep models have achieved remarkable progress in general object detection, they are not satisfying enough in complex indoor scenes. The indoor surveillance video often includes cluttered background objects, among which heads have small scales and diverse poses. In this paper, we propose Motion-aware Pseudo Siamese Network (MPSN), an end-to-end approach that leverages head motion information to guide the deep model to extract effective head features in indoor scenarios. By taking the pixel-wise difference of adjacent frames as the auxiliary input, MPSN effectively enhances human head motion information and removes the irrelevant objects in the background. Compared with prior methods, it achieves superior performance on the two indoor video datasets. Our experiments show that MPSN successfully suppresses static background objects and highlights the moving instances, especially human heads in indoor videos. We also compare different methods to capture head motion, which demonstrates the simplicity and flexibility of MPSN. To validate the robustness of MPSN, we conduct adversarial experiments with a mathematical solution of small perturbations for robust model selection. Finally, for confirming its potential in building control systems, we apply MPSN to occupancy counting. Code is available at https://github.com/pl-share/MPSN.

cs.CV↗

arXiv2022

Learning-based Autonomous Channel Access in the Presence of Hidden Terminals

We consider the problem of autonomous channel access (AutoCA), where a group of terminals tries to discover a communication strategy with an access point (AP) via a common wireless channel in a distributed fashion. Due to the irregular topology and the limited communication range of terminals, a practical challenge for AutoCA is the hidden terminal problem, which is notorious in wireless networks for deteriorating the throughput and delay performances. To meet the challenge, this paper presents a new multi-agent deep reinforcement learning paradigm, dubbed MADRL-HT, tailored for AutoCA in the presence of hidden terminals. MADRL-HT exploits topological insights and transforms the observation space of each terminal into a scalable form independent of the number of terminals. To compensate for the partial observability, we put forth a look-back mechanism such that the terminals can infer behaviors of their hidden terminals from the carrier sensed channel states as well as feedback from the AP. A window-based global reward function is proposed, whereby the terminals are instructed to maximize the system throughput while balancing the terminals' transmission opportunities over the course of learning. Extensive numerical experiments verified the superior performance of our solution benchmarked against the legacy carrier-sense multiple access with collision avoidance (CSMA/CA) protocol.

cs.LG↗

arXiv2022

Fast Detection of Burst Jamming for Delay-Sensitive Internet-of-Things Applications

In this paper, we investigate the design of a burst jamming detection method for delay-sensitive Internet-of-Things (IoT) applications. In order to obtain a timely detection of burst jamming, we propose an online principal direction anomaly detection (OPDAD) method. We consider the one-ring scatter channel model, where the base station equipped with a large number of antennas is elevated at a high altitude. In this case, since the angular spread of the legitimate IoT transmitter or the jammer is restricted within a narrow region, there is a distinct difference of the principal direction of the signal space between the jamming attack and the normal state. Unlike existing statistical features based batching methods, the proposed OPDAD method adopts an online iterative processing mode, which can quickly detect the exact attack time block instance by analyzing the newly coming signal. In addition, our detection method does not rely on the prior knowledge of the attacker, because it only cares the abrupt change in the principal direction of the signal space. Moreover, based on the high spatial resolution and the narrow angular spread, we provide the convergence rate estimate and derive a nearly optimal finite sample error bound for the proposed OPDAD method. Numerical results show the excellent real time capability and detection performance of our proposed method.

cs.CR↗

arXiv2022

Remapped Cache Layout: Thwarting Cache-Based Side-Channel Attacks with a Hardware Defense

As cache-based side-channel attacks become serious security problems, various defenses have been proposed and deployed in both software and hardware. Consequently, cache-based side-channel attacks on processes co-residing on the same core are becoming extremely difficult. Most of recent attacks then shift their focus to the last-level cache (LLC). Although cache partitioning is currently the most promising defense against the attacks abusing LLC, it is ineffective in thwarting the side-channel attacks that automatically create eviction sets or bypass the user address space layout randomization. In fact, these attacks are largely undefended in current computer systems. We propose Remapped Cache Layout (\textsf{RCL}) -- a pure hardware defense against a broad range of conflict-based side-channel attacks. \textsf{RCL} obfuscates the mapping from address to cache sets; therefore, an attacker cannot accurately infer the location of her data in caches or using a cache set to infer her victim's data. To our best knowledge, it is the first defense to thwart the aforementioned largely undefended side-channel attacks . \textsf{RCL} has been implemented in a superscalar processor and detailed evaluation results show that \textsf{RCL} incurs only small costs in area, frequency and execution time.

cs.CR↗

arXiv2022

Nowhere to Hide: A Lightweight Unsupervised Detector against Adversarial Examples

Although deep neural networks (DNNs) have shown impressive performance on many perceptual tasks, they are vulnerable to adversarial examples that are generated by adding slight but maliciously crafted perturbations to benign images. Adversarial detection is an important technique for identifying adversarial examples before they are entered into target DNNs. Previous studies to detect adversarial examples either targeted specific attacks or required expensive computation. How design a lightweight unsupervised detector is still a challenging problem. In this paper, we propose an AutoEncoder-based Adversarial Examples (AEAE) detector, that can guard DNN models by detecting adversarial examples with low computation in an unsupervised manner. The AEAE includes only a shallow autoencoder but plays two roles. First, a well-trained autoencoder has learned the manifold of benign examples. This autoencoder can produce a large reconstruction error for adversarial images with large perturbations, so we can detect significantly perturbed adversarial examples based on the reconstruction error. Second, the autoencoder can filter out the small noise and change the DNN's prediction on adversarial examples with small perturbations. It helps to detect slightly perturbed adversarial examples based on the prediction distance. To cover these two cases, we utilize the reconstruction error and prediction distance from benign images to construct a two-tuple feature set and train an adversarial detector using the isolation forest algorithm. We show empirically that the AEAE is unsupervised and inexpensive against the most state-of-the-art attacks. Through the detection in these two cases, there is nowhere to hide adversarial examples.

cs.LG↗