Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
78works
0followers
28topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

78 published item(s)

preprint2026arXiv

DepthPilot: From Controllability to Interpretability in Colonoscopy Video Generation

Controllable medical video generation has achieved remarkable progress, but it still lacks interpretability, which requires the alignment of generated contents with physical priors and faithful clinical manifestations. To push the boundaries from mere controllability to interpretability, we propose DepthPilot, the first interpretable framework for colonoscopy video generation. This work takes a step toward trustworthy generation through two synergistic paradigms. To achieve explicit geometric grounding, DepthPilot devises a prior distribution alignment strategy, injecting depth constraints into the diffusion backbone via parameter-efficient fine-tuning to ensure anatomical fidelity. To enhance intrinsic nonlinear modeling under these geometric constraints, DepthPilot employs an adaptive spline denoising module, replacing fixed linear weights with learnable spline functions to capture complex spatio-temporal dynamics. Extensive evaluations across three public datasets and in-house clinical data confirm DepthPilot's robust ability to produce physically consistent videos. It achieves FID scores below 15 across all benchmarks and ranks first in clinician assessments, bridging the gap between "visually realistic" and "clinically interpretable". Moreover, DepthPilot-generated videos are expected to enable reliable 3D reconstruction, facilitating surgical navigation and blind region identification, and serve as a foundation toward the colorectal world model.

preprint2026arXiv

DisAgg: Distributed Aggregators for Efficient Secure Aggregation in Federated Learning

Federated learning enables collaborative model training across distributed clients, yet vanilla FL exposes client updates to the central server. Secure-aggregation schemes protect privacy against an honest-but-curious server, but existing approaches often suffer from many communication rounds, heavy public-key operations, or difficulty handling client dropouts. Recent methods like One-Shot Private Aggregation (OPA) cut rounds to a single server interaction per FL iteration, yet they impose substantial cryptographic and computational overhead on both server and clients. We propose a new protocol called DisAgg that leverages a small committee of clients called Aggregators to perform the aggregation itself: each client secret-shares its update vector to Aggregators, which locally compute partial sums and return only aggregated shares for server-side reconstruction. This design eliminates local masking and expensive homomorphic encryption, reducing endpoint computation while preserving privacy against a curious server and a limited fraction of colluding clients. By leveraging optimal trade-offs between communication and computation costs, DisAgg processes 100k-dimensional update vectors from 100k 5G clients with a 4.6x speedup compared to OPA, the previous best protocol.

preprint2026arXiv

OphMAE: Bridging Volumetric and Planar Imaging with a Foundation Model for Adaptive Ophthalmological Diagnosis

The advent of foundation models has heralded a new era in medical artificial intelligence (AI), enabling the extraction of generalizable representations from large-scale unlabeled datasets. However, current ophthalmic AI paradigms are predominantly constrained to single-modality inference, thereby creating a dissonance with clinical practice where diagnosis relies on the synthesis of complementary imaging modalities. Furthermore, the deployment of high-performance AI in resource-limited settings is frequently impeded by the unavailability of advanced three-dimensional imaging hardware. Here, we present the Ophthalmic multimodal Masked Autoencoder (OphMAE), a multi-imaging foundation model engineered to synergize the volumetric depth of 3D Optical Coherence Tomography (OCT) with the planar context of 2D en face OCT. By implementing a novel cross-modal fusion architecture and a unique adaptive inference mechanism, OphMAE was pre-trained on a massive dataset with of 183,875 paired OCT images derived from 32,765 patients. In a rigorous benchmark encompassing 17 diverse diagnostic tasks with 48,340 paired OCT images from 8,191 patients, the model demonstrated state-of-the-art performance, achieving an Area Under the Curve (AUC) of 96.9% for Age-related Macular Degeneration (AMD) and 97.2% for Diabetic Macular Edema (DME), consistently surpassing existing single-modal and multimodal foundation models. Crucially, OphMAE exhibits robust engineering adaptability: it maintains high diagnostic accuracy, such as 93.7\% AUC for AMD, even when restricted to single-modality 2D inputs, and demonstrates exceptional data efficiency by retaining 95.7% AUC with as few as 500 labeled samples. This work establishes a scalable and adaptable framework for ophthalmic AI, ensuring robust performance across different tasks.

preprint2024arXiv

Integrated Sensing, Communication, and Powering (ISCAP): Towards Multi-functional 6G Wireless Networks

This article presents a novel multi-functional system for a sixth-generation (6G) wireless network with integrated sensing, communication, and powering (ISCAP), which unifies integrated sensing and communication (ISAC) and wireless information and power transfer (WIPT) techniques. The multi-functional ISCAP network promises to enhance resource utilization efficiency, reduce network costs, and improve overall performance through versatile operational modes. Specifically, a multi-functional base station (BS) can enable multi-functional transmission, by exploiting the same radio signals to perform target/environment sensing, wireless communication, and wireless power transfer (WPT), simultaneously. Besides, the three functions can be intelligently coordinated to pursue mutual benefits,i.e., wireless sensing can be leveraged to enable light-training or even training-free WIPT by providing side-channel information, and the BS can utilize WPT to wirelessly charge low-power devices for ensuring sustainable ISAC. Furthermore, multiple multi-functional BSs can cooperate in both transmission and reception phases for efficient interference management, multi-static sensing, and distributed energy beamforming. For these operational modes, we discuss the technical challenges and potential solutions, particularly focusing on the fundamental performance tradeoff limits, transmission protocol design, as well as waveform and beamforming optimization. Finally, interesting research directions are identified.

preprint2023arXiv

Radio Frequency Fingerprints Extraction for LTE-V2X: A Channel Estimation Based Methodology

The vehicular-to-everything (V2X) technology has recently drawn a number of attentions from both academic and industrial areas. However, the openness of the wireless communication system makes it more vulnerable to identity impersonation and information tampering. How to employ the powerful radio frequency fingerprint (RFF) identification technology in V2X systems turns out to be a vital and also challenging task. In this paper, we propose a novel RFF extraction method for Long Term Evolution-V2X (LTE-V2X) systems. In order to conquer the difficulty of extracting transmitter RFF in the presence of wireless channel and receiver noise, we first estimate the wireless channel which excludes the RFF. Then, we remove the impact of the wireless channel based on the channel estimate and obtain initial RFF features. Finally, we conduct RFF denoising to enhance the quality of the initial RFF. Simulation and experiment results both demonstrate that our proposed RFF extraction scheme achieves a high identification accuracy. Furthermore, the performance is also robust to the vehicle speed.

preprint2023arXiv

The Conformal Laplacian and The Kazdan-Warner Problem: Zero First Eigenvalue Case

In this article, we first show that given a smooth function $ S $ either on closed manifolds $ (M, g) $ or compact manifolds $ (\bar{M}, g) $ with non-empty boundary, both for dimensions at least $ 3 $, the condition $ S \equiv 0 $, or $ S $ changes sign and $ \int_{M} S \dvol < 0 $ (with zero mean curvature if the boundary is not empty), is both the necessary and sufficient condition for prescribing scalar curvature problems within conformal class $ [g] $, provided that the first eigenvalue of the conformal Laplacian is zero. We then extend the same necessary and sufficient condition, in terms of prescribing Gauss curvature function and zero geodesic curvature, to compact Riemann surfaces with non-empty boundary, provided that the Euler characteristic is zero. These results are the first full extensions since the results of Kazdan and Warner \cite{KW2} on 2-dimensional torus, and of Escobar and Schoen \cite{ESS} on closed manifolds for dimensions $ 3 $ and $ 4 $. We then give results of prescribing nonzero scalar and mean curvature problems on $ (\bar{M}, g) $, still with zero first eigenvalue and dimensions at least $ 3 $. Analogously, results of prescribing Gauss and geodesic curvature problems on compact Riemann surfaces with boundary are given for zero Euler characteristic case. Lastly, we show a generalization of the Han-Li conjecture. Technically the key step for manifolds with dimensions at least $ 3 $ is to apply both the local variational methods, local Yamabe-type equations and a new version of the monotone iteration scheme. The key features include the smoothness of the upper solution, the technical difference between constant and non-constant prescribing scalar curvature functions, etc.

preprint2023arXiv

Towards High Performance One-Stage Human Pose Estimation

Making top-down human pose estimation method present both good performance and high efficiency is appealing. Mask RCNN can largely improve the efficiency by conducting person detection and pose estimation in a single framework, as the features provided by the backbone are able to be shared by the two tasks. However, the performance is not as good as traditional two-stage methods. In this paper, we aim to largely advance the human pose estimation results of Mask-RCNN and still keep the efficiency. Specifically, we make improvements on the whole process of pose estimation, which contains feature extraction and keypoint detection. The part of feature extraction is ensured to get enough and valuable information of pose. Then, we introduce a Global Context Module into the keypoints detection branch to enlarge the receptive field, as it is crucial to successful human pose estimation. On the COCO val2017 set, our model using the ResNet-50 backbone achieves an AP of 68.1, which is 2.6 higher than Mask RCNN (AP of 65.5). Compared to the classic two-stage top-down method SimpleBaseline, our model largely narrows the performance gap (68.1 AP vs. 68.9 AP) with a much faster inference speed (77 ms vs. 168 ms), demonstrating the effectiveness of the proposed method. Code is available at: https://github.com/lingl_space/maskrcnn_keypoint_refined.

preprint2023arXiv

Trichotomy Theorem for Prescribed Scalar and Mean Curvatures on Compact Manifolds with Boundaries

In this article, we give results of prescribing scalar and mean curvature functions for metrics either pointwise conformal or conformally equivalent to a Riemannian metric that is equipped on a compact manifold with boundary, with dimensions at least $ 3 $. The results are classified by the sign of the first eigenvalue of the conformal Laplacian. This leads to a &#34;Trichotomy Theorem&#34; in terms of both scalar and mean curvature functions, which is a full extension of the &#34;Trichotomy Theorem&#34; given by Kazdan and Warner. We also discuss prescribing Gauss and geodesic curvature problems on compact Riemann surfaces with boundary for metrics either pointwise conformal or conformally equivalent to the original metric, provided that the Euler characteristic is negative. The key step is a general version of monotone iteration scheme which handle the zeroth order nonlinear term on the boundary conditions.

preprint2022arXiv

Accelerated Policy Learning with Parallel Differentiable Simulation

Deep reinforcement learning can generate complex control policies, but requires large amounts of training data to work effectively. Recent work has attempted to address this issue by leveraging differentiable simulators. However, inherent problems such as local minima and exploding/vanishing numerical gradients prevent these methods from being generally applied to control tasks with complex contact-rich dynamics, such as humanoid locomotion in classical RL benchmarks. In this work we present a high-performance differentiable simulator and a new policy learning algorithm (SHAC) that can effectively leverage simulation gradients, even in the presence of non-smoothness. Our learning algorithm alleviates problems with local minima through a smooth critic function, avoids vanishing/exploding gradients through a truncated learning window, and allows many physical environments to be run in parallel. We evaluate our method on classical RL control tasks, and show substantial improvements in sample efficiency and wall-clock time over state-of-the-art RL and differentiable simulation-based algorithms. In addition, we demonstrate the scalability of our method by applying it to the challenging high-dimensional problem of muscle-actuated locomotion with a large action space, achieving a greater than 17x reduction in training time over the best-performing established RL algorithm.

preprint2022arXiv

Affinity-Aware Resource Provisioning for Long-Running Applications in Shared Clusters

Resource provisioning plays a pivotal role in determining the right amount of infrastructure resource to run applications and target the global decarbonization goal. A significant portion of production clusters is now dedicated to long-running applications (LRAs), which are typically in the form of microservices and executed in the order of hours or even months. It is therefore practically important to plan ahead the placement of LRAs in a shared cluster so that the number of compute nodes required by them can be minimized to reduce carbon footprint and lower operational costs. Existing works on LRA scheduling are often application-agnostic, without particularly addressing the constraining requirements imposed by LRAs, such as co-location affinity constraints and time-varying resource requirements. In this paper, we present an affinity-aware resource provisioning approach for deploying large-scale LRAs in a shared cluster subject to multiple constraints, with the objective of minimizing the number of compute nodes in use. We investigate a broad range of solution algorithms which fall into three main categories: Application-Centric, Node-Centric, and Multi-Node approaches, and tune them for typical large-scale real-world scenarios. Experimental studies driven by the Alibaba Tianchi dataset show that our algorithms can achieve competitive scheduling effectiveness and running time, as compared with the heuristics used by the latest work including Medea and LraSched.

preprint2022arXiv

Amplify-and-Forward Relaying for Hierarchical Over-the-Air Computation

This paper studies a hierarchical over-the-air computation (AirComp) network over a large area, in which multiple relays are exploited to facilitate data aggregation from massive WDs. We present a two-phase amplify-and-forward (AF) relaying protocol. In the first phase, the WDs simultaneously send their data to the relays, while in the second phase, the relays amplify the respectively received signals and concurrently forward them to the fusion center (FC) for aggregation. Our objective is to minimize the computational mean squared error (MSE) at the FC, by jointly optimizing the WD transmit coefficients, the relay AF coefficients, and the FC de-noising factor, subject to their individual transmit power constraints. First, we consider the centralized design with global channel state information (CSI), in which the inter-relay signals can be exploited beneficially for data aggregation. In this case, we develop an alternating-optimization-based algorithm to obtain a high-quality solution to the computational MSE minimization problem. Next, to reduce the signaling overhead caused by the centralized design, we consider an alternative decentralized design with partial CSI, in which the relays and the FC make their own decisions by only requiring the channel power gain information across different relays. In this case, the relays and FC need to treat the inter-relay signals as harmful interference or noise. Accordingly, we optimize the transmit coefficients of the WDs associated with each relay, and the relay AF coefficients (together with the FC de-noising factor) in an iterative manner, which can be implemented efficiently in a decentralized way.

preprint2022arXiv

An Integrated Design Pipeline for Tactile Sensing Robotic Manipulators

Traditional robotic manipulator design methods require extensive, time-consuming, and manual trial and error to produce a viable design. During this process, engineers often spend their time redesigning or reshaping components as they discover better topologies for the robotic manipulator. Tactile sensors, while useful, often complicate the design due to their bulky form factor. We propose an integrated design pipeline to streamline the design and manufacturing of robotic manipulators with knitted, glove-like tactile sensors. The proposed pipeline allows a designer to assemble a collection of modular, open-source components by applying predefined graph grammar rules. The end result is an intuitive design paradigm that allows the creation of new virtual designs of manipulators in a matter of minutes. Our framework allows the designer to fine-tune the manipulator&#39;s shape through cage-based geometry deformation. Finally, the designer can select surfaces for adding tactile sensing. Once the manipulator design is finished, the program will automatically generate 3D printing and knitting files for manufacturing. We demonstrate the utility of this pipeline by creating four custom manipulators tested on real-world tasks: screwing in a wing screw, sorting water bottles, picking up an egg, and cutting paper with scissors.

preprint2022arXiv

An Overview on IEEE 802.11bf: WLAN Sensing

With recent advancements, the wireless local area network (WLAN) or wireless fidelity (Wi-Fi) technology has been successfully utilized to realize sensing functionalities such as detection, localization, and recognition. However, the WLANs standards are developed mainly for the purpose of communication, and thus may not be able to meet the stringent sensing requirements in emerging applications. To resolve this issue, a new Task Group (TG), namely IEEE 802.11bf, has been established by the IEEE 802.11 working group, with the objective of creating a new amendment to the WLAN standard to provide advanced sensing requirements while minimizing the effect on communications. This paper provides a comprehensive overview on the up-to-date efforts in the IEEE 802.11bf TG. First, we introduce the definition of the 802.11bf amendment and its standardization timeline. Then, we discuss the WLAN sensing procedure and framework used for measurement acquisition, by considering both conventional sensing at sub-7 GHz and directional multi-gigabit (DMG) sensing at 60 GHz, respectively. Next, we present various candidate technical features for IEEE 802.11bf, including waveform/sequence design, feedback types, quantization, as well as security and privacy. Finally, we describe the methodologies used by the IEEE 802.11bf TG to evaluate the alternative performance. It is desired that this overview paper provide useful insights on IEEE 802.11 WLAN sensing to people with great interests and promote the IEEE 802.11bf standard to be widely deployed.

preprint2022arXiv

An Overview on Over-the-Air Federated Edge Learning

Over-the-air federated edge learning (Air-FEEL) has emerged as a promising solution to support edge artificial intelligence (AI) in future beyond 5G (B5G) and 6G networks. In Air-FEEL, distributed edge devices use their local data to collaboratively train AI models while preserving data privacy, in which the over-the-air model/gradient aggregation is exploited for enhancing the learning efficiency. This article provides an overview on the state of the art of Air-FEEL. First, we present the basic principle of Air-FEEL, and introduce the technical challenges for Air-FEEL design due to the over-the-air aggregation errors, as well as the resource and data heterogeneities at edge devices. Next, we present the fundamental performance metrics for Air-FEEL, and review resource management solutions and design considerations for enhancing the Air-FEEL performance. Finally, several interesting research directions are pointed out to motivate future work.

preprint2022arXiv

Channel Knowledge Map (CKM)-Assisted Multi-UAV Wireless Network: CKM Construction and UAV Placement

Channel knowledge map (CKM) has recently emerged to facilitate the placement and trajectory optimization for unmanned aerial vehicle (UAV) communications. This paper investigates a CKM-assisted multi-UAV wireless network, by focusing on the construction and utilization of CKMs for multi-UAV placement optimization. First, we consider the CKM construction problem when data measurements for only a limited number of points are available. Towards this end, we exploit a data-driven interpolation technique to construct CKMs to characterize the signal propagation environments. Next, we study the multi-UAV placement optimization problem by utilizing the constructed CKMs, in which the multiple UAVs aim to optimize their placement locations to maximize the weighted sum rate with their respectively associated ground base stations (GBSs). However, the rate function based on the CKMs is generally non-differentiable. To tackle this issue, we propose a novel iterative algorithm based on derivative-free optimization, in which a series of quadratic functions are iteratively constructed to approximate the objective function under a set of interpolation conditions, and accordingly, the UAVs&#39; placement locations are updated by maximizing the approximate function subject to a trust region constraint. Finally, numerical results are presented to validate the proposed design achieves near-optimal performance, but with much lower implementation complexity.

preprint2022arXiv

Closed-Loop Control of Direct Ink Writing via Reinforcement Learning

Enabling additive manufacturing to employ a wide range of novel, functional materials can be a major boost to this technology. However, making such materials printable requires painstaking trial-and-error by an expert operator, as they typically tend to exhibit peculiar rheological or hysteresis properties. Even in the case of successfully finding the process parameters, there is no guarantee of print-to-print consistency due to material differences between batches. These challenges make closed-loop feedback an attractive option where the process parameters are adjusted on-the-fly. There are several challenges for designing an efficient controller: the deposition parameters are complex and highly coupled, artifacts occur after long time horizons, simulating the deposition is computationally costly, and learning on hardware is intractable. In this work, we demonstrate the feasibility of learning a closed-loop control policy for additive manufacturing using reinforcement learning. We show that approximate, but efficient, numerical simulation is sufficient as long as it allows learning the behavioral patterns of deposition that translate to real-world experiences. In combination with reinforcement learning, our model can be used to discover control policies that outperform baseline controllers. Furthermore, the recovered policies have a minimal sim-to-real gap. We showcase this by applying our control policy in-vivo on a single-layer, direct ink writing printer.

preprint2022arXiv

Coordinated Power Control for Network Integrated Sensing and Communication

This correspondence paper studies a network integrated sensing and communication (ISAC) system that unifies the interference channel for communication and distributed radar sensing. In this system, a set of distributed ISAC transmitters send individual messages to their respective communication users (CUs), and at the same time cooperate with multiple sensing receivers to estimate the location of one target. We exploit the coordinated power control among ISAC transmitters to minimize their total transmit power while ensuring the minimum signal-to-interference-plus-noise ratio (SINR) constraints at individual CUs and the maximum Cramér-Rao lower bound (CRLB) requirement for target location estimation. Although the formulated coordinated power control problem is non-convex and difficult to solve in general, we propose two efficient algorithms to obtain high-quality solutions based on the semi-definite relaxation (SDR) and CRLB approximation, respectively. Numerical results show that the proposed designs achieve substantial performance gains in terms of power reduction, as compared to the benchmark with a heuristic separate communication-sensing design.

preprint2022arXiv

Derivative-Free Placement Optimization for Multi-UAV Wireless Networks with Channel Knowledge Map

This paper studies a multi-UAV wireless network, in which multiple UAV users share the same spectrum to send individual messages to their respectively associated ground base stations (GBSs). The UAV users aim to optimize their locations to maximize the weighted sum rate. While most existing work considers simplified line-of-sight (LoS) or statistic air-to-ground (A2G) channel models, we exploit the location-specific channel knowledge map (CKM) to enhance the placement performance in practice. However, as the CKMs normally contain discrete site- and location-specific channel data without analytic model functions, the corresponding weighted sum rate function becomes non-differentiable in general. In this case, conventional optimization techniques relying on function derivatives are inapplicable to solve the resultant placement optimization problem. To address this issue, we propose a novel iterative algorithm based on the derivative-free optimization. In each iteration, we first construct a quadratic function to approximate the non-differentiable weighted sum rate under a set of interpolation conditions, and then update the UAVs&#39; placement locations by maximizing the approximate quadratic function subject to a trust region constraint. Numerical results show the convergence of the proposed algorithm. It is also shown that the proposed algorithm achieves a weighted sum rate close to the optimal design based on exhaustive search with much lower implementation complexity, and it significantly outperforms the conventional optimization method based on simplified LoS channel models and the heuristic design with each UAV hovering above its associated GBS.

preprint2022arXiv

DiffCloth: Differentiable Cloth Simulation with Dry Frictional Contact

Cloth simulation has wide applications in computer animation, garment design, and robot-assisted dressing. This work presents a differentiable cloth simulator whose additional gradient information facilitates cloth-related applications. Our differentiable simulator extends a state-of-the-art cloth simulator based on Projective Dynamics (PD) and with dry frictional contact. We draw inspiration from previous work to propose a fast and novel method for deriving gradients in PD-based cloth simulation with dry frictional contact. Furthermore, we conduct a comprehensive analysis and evaluation of the usefulness of gradients in contact-rich cloth simulation. Finally, we demonstrate the efficacy of our simulator in a number of downstream applications, including system identification, trajectory optimization for assisted dressing, closed-loop control, inverse design, and real-to-sim transfer. We observe a substantial speedup obtained from using our gradient information in solving most of these applications.

preprint2022arXiv

Energy Efficiency Maximization of Massive MIMO Communications With Dynamic Metasurface Antennas

Future wireless communications are largely inclined to deploy massive numbers of antennas at the base stations (BSs) by leveraging cost- and energy-efficient as well as environmentally friendly antenna arrays. The emerging technology of dynamic metasurface antennas (DMAs) is promising to realize such massive antenna arrays with reduced physical size, hardware cost, and power consumption. The goal of this paper is the optimization of the energy efficiency (EE) performance of DMA-assisted massive multiple-input multiple-output (MIMO) wireless communications. Focusing on the uplink, we propose an algorithmic framework for designing the transmit precoding of each multi-antenna user and the DMA tuning strategy at the BS to maximize the EE performance, considering the availability of either instantaneous or statistical channel state information (CSI). Specifically, the proposed framework is shaped around Dinkelbach&#39;s transform, alternating optimization, and deterministic equivalent methods. In addition, we obtain a closed-form solution to the optimal transmit signal directions for the statistical CSI case, which simplifies the corresponding transmission design for the multiple-antenna case. Our numerical results verify the good convergence behavior of the proposed algorithms, and showcase the considerable EE performance gains of the DMA-assisted massive MIMO transmissions over the baseline schemes.

preprint2022arXiv

Energy-Efficient Transmit Beamforming and Antenna Selection with Non-Linear PA Efficiency

This letter studies the energy-efficient design in a downlink multi-antenna multi-user system consisting of a multi-antenna base station (BS) and multiple single-antenna users, by considering the practical non-linear power amplifier (PA) efficiency and the on-off power consumption of radio frequency (RF) chain at each transmit antenna. Under this setup, we jointly optimize the transmit beamforming and antenna on/off selection at the BS to minimize its total power consumption while ensuring the individual signal-to-interference-plus-noise ratio (SINR) constraints at the users. However, due to the non-linear PA efficiency and the on-off RF chain power consumption, the formulated SINR-constrained power minimization problem is highly non-convex and difficult to solve. To tackle this issue, we propose an efficient algorithm to obtain a high-quality solution based on the technique of sequential convex approximation (SCA). We provide numerical results to validate the performance of our proposed design. It is shown that at the optimized solution, the BS tends to activate fewer antennas and use higher power transmission at each antenna to exploit the non-linear PA efficiency.

preprint2022arXiv

Evolution Gym: A Large-Scale Benchmark for Evolving Soft Robots

Both the design and control of a robot play equally important roles in its task performance. However, while optimal control is well studied in the machine learning and robotics community, less attention is placed on finding the optimal robot design. This is mainly because co-optimizing design and control in robotics is characterized as a challenging problem, and more importantly, a comprehensive evaluation benchmark for co-optimization does not exist. In this paper, we propose Evolution Gym, the first large-scale benchmark for co-optimizing the design and control of soft robots. In our benchmark, each robot is composed of different types of voxels (e.g., soft, rigid, actuators), resulting in a modular and expressive robot design space. Our benchmark environments span a wide range of tasks, including locomotion on various types of terrains and manipulation. Furthermore, we develop several robot co-evolution algorithms by combining state-of-the-art design optimization methods and deep reinforcement learning techniques. Evaluating the algorithms on our benchmark platform, we observe robots exhibiting increasingly complex behaviors as evolution progresses, with the best evolved designs solving many of our proposed tasks. Additionally, even though robot designs are evolved autonomously from scratch without prior knowledge, they often grow to resemble existing natural creatures while outperforming hand-designed robots. Nevertheless, all tested algorithms fail to find robots that succeed in our hardest environments. This suggests that more advanced algorithms are required to explore the high-dimensional design space and evolve increasingly intelligent robots -- an area of research in which we hope Evolution Gym will accelerate progress. Our website with code, environments, documentation, and tutorials is available at http://evogym.csail.mit.edu.

preprint2022arXiv

FedSEAL: Semi-Supervised Federated Learning with Self-Ensemble Learning and Negative Learning

Federated learning (FL), a popular decentralized and privacy-preserving machine learning (FL) framework, has received extensive research attention in recent years. The majority of existing works focus on supervised learning (SL) problems where it is assumed that clients carry labeled datasets while the server has no data. However, in realistic scenarios, clients are often unable to label their data due to the lack of expertise and motivation while the server may host a small amount of labeled data. How to reasonably utilize the server labeled data and the clients&#39; unlabeled data is thus of paramount practical importance. In this paper, we propose a new FL algorithm, called FedSEAL, to solve this Semi-Supervised Federated Learning (SSFL) problem. Our algorithm utilizes self-ensemble learning and complementary negative learning to enhance both the accuracy and the efficiency of clients&#39; unsupervised learning on unlabeled data, and orchestrates the model training on both the server side and the clients&#39; side. Our experimental results on Fashion-MNIST and CIFAR10 datasets in the SSFL setting validate the effectiveness of our method, which outperforms the state-of-the-art SSFL methods by a large margin.

preprint2022arXiv

Frame hydrodynamics of biaxial nematics from molecular-theory-based tensor models

Starting from a dynamic tensor model about two second-order tensors, we derive the frame hydrodynamics for the biaxial nematic phase using the Hilbert expansion. The coefficients in the frame model are derived from those in the tensor model. The energy dissipation of the tensor model is maintained in the frame model. The model is reduced to the Ericksen--Leslie model if the biaxial bulk energy minimum of the tensor model is reduced to a uniaxial one.

preprint2022arXiv

Fundamental CRB-Rate Tradeoff in Multi-antenna Multicast Channel with ISAC

This paper studies the multi-antenna multicast channel with integrated sensing and communication (ISAC), in which a multi-antenna base station (BS) sends common messages to a set of single-antenna communication users (CUs) and simultaneously estimates the parameters of an extended target via radar sensing. We investigate the fundamental performance limits of this ISAC system, in terms of the achievable rate for communication and the estimation Cramér-Rao bound (CRB) for sensing. First, we derive the optimal transmit covariance in semi-closed form to balance the CRB-rate (C-R) tradeoff, and accordingly characterize the outer bound of a so-called C-R region. It is shown that the optimal transmit covariance should be of full rank, consisting of both information-carrying and dedicated sensing signals in general. Next, we consider a practical joint information and sensing beamforming design, and propose an efficient approach to optimize the joint beamforming for balancing the C-R tradeoff. Numerical results are presented to show the C-R region achieved by the optimal transmit covariance and the joint beamforming, as compared to other benchmark schemes.

preprint2022arXiv

Impact of Third Order Dispersion on Dissipative Soliton Resonance

Dissipative soliton resonance (DSR) is a promising way for high-energy pulse generation typically having a symmetrical square pulse profile. While this method is well known, the impact of third order dispersion (TOD) on DSR is yet to be fully addressed in the literature. In this article, the impact of TOD on DSR is numerically investigated under the frame of the complex cubic-quintic Ginzburg-Landau equation (CQGLE). Our numerical investigations indicate that DSR can stably exist under TOD with nearly the same pulse amplitude, but with a (significantly) different pulse duration. Depending on the value of chromatic dispersion, the pulse duration can be notably longer or shorter due to the presence of TOD. The TOD effect also alters the dependence of pulse duration on the nonlinear gain. Another impact of TOD on DSR is that the DSR exists with an asymmetric pulse profile, leading to steepening of one edge of the DSR pulse, while flattening of the other. Our results indicate that TOD has a critical role for realizing DSR in mode-locked lasers and it should be taken into consideration during design and development of DSR-based lasers.

preprint2022arXiv

Joint transmit and reflective beamforming for IRS-assisted integrated sensing and communication

This paper studies an intelligent reflecting surface (IRS)-assisted integrated sensing and communication (ISAC) system, in which one IRS is deployed to not only assist the wireless communication from a multi-antenna base station (BS) to a single-antenna communication user (CU), but also create virtual line-of-sight (LoS) links for sensing targets at areas with LoS links blocked. We consider that the BS transmits combined information and sensing signals for ISAC. Under this setup, we jointly optimize the transmit information and sensing beamforming at the BS and the reflective beamforming at the IRS, to maximize the IRS&#39;s minimum beampattern gain towards the desired sensing angles, subject to the minimum signal-to-noise ratio (SNR) requirement at the CU and the maximum transmit power constraint at the BS. Although the formulated SNR-constrained beampattern gain maximization problem is non-convex and difficult to solve, we present an efficient algorithm to obtain a high-quality solution using alternating optimization and semi-definite relaxation (SDR). Numerical results show that the proposed joint beamforming design achieves improved sensing performance while ensuring the communication requirement as compared to benchmarks without such joint optimization. It is also shown that the use of dedicated sensing beams is beneficial in enhancing the performance for IRS-assisted ISAC.

preprint2022arXiv

Microwave excitations and hysteretic magnetization dynamics of stripe domain films

FeNi films with the stripe domain (SD) pattern are prepared by electrodeposition and sputtering methods. The magnetic domain, static magnetic parameters, and quality factor, as well as dynamic properties of the two films, are respectively performed. The results show the magnetizations of the film were dependent on the direction of SD, and the rotation of the SD is lagging behind the magnetization reversal. The microwave properties of the SD emerge dynamic hysteresis before the saturation magnetic field. These microwave properties are selectively excited with acoustic mode, optical mode, and spin-wave mode. The frequency and intensity of different resonance modes of stripe domain are determined by the local magnetization. The magnetization variations and the rotation of SD of different modes are further illuminated by the micromagnetic simulation. The magnetic anisotropy and the resonance intensity of permeability of different modes were finally described by the modified resonance equations.

preprint2022arXiv

MIMO Integrated Sensing and Communication with Extended Target: CRB-Rate Tradeoff

This paper studies a multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) sends unified wireless signals to estimate an extended target and communicate with a multi-antenna communication user (CU) at the same time. We investigate the fundamental tradeoff between the estimation Cramér-Rao bound (CRB) for sensing and the data rate for communication, by characterizing the Pareto boundary of the achievable CRB-rate (C-R) region. Towards this end, we formulate a new MIMO rate maximization problem by optimizing the transmit covariance matrix at the BS, subject to a new form of maximum CRB constraint together with a maximum transmit power constraint. We derive the optimal transmit covariance solution in a semi-closed form, by first implementing the singular-value decomposition (SVD) to diagonalize the communication channel and then properly allocating the transmit power over these subchannels for communication and other orthogonal subchannels (if any) for dedicated sensing. It is shown that the optimal transmit covariance is of full rank, which unifies the conventional rate maximization design with water-filling power allocation and the CRB minimization design with isotropic transmission. Numerical results are provided to validate the performance achieved by our proposed optimal design, in comparison with other benchmark schemes.

preprint2022arXiv

Multi-level Feature Learning for Contrastive Multi-view Clustering

Multi-view clustering can explore common semantics from multiple views and has attracted increasing attention. However, existing works punish multiple objectives in the same feature space, where they ignore the conflict between learning consistent common semantics and reconstructing inconsistent view-private information. In this paper, we propose a new framework of multi-level feature learning for contrastive multi-view clustering to address the aforementioned issue. Our method learns different levels of features from the raw features, including low-level features, high-level features, and semantic labels/features in a fusion-free manner, so that it can effectively achieve the reconstruction objective and the consistency objectives in different feature spaces. Specifically, the reconstruction objective is conducted on the low-level features. Two consistency objectives based on contrastive learning are conducted on the high-level features and the semantic labels, respectively. They make the high-level features effectively explore the common semantics and the semantic labels achieve the multi-view clustering. As a result, the proposed framework can reduce the adverse influence of view-private information. Extensive experiments on public datasets demonstrate that our method achieves state-of-the-art clustering effectiveness.

preprint2022arXiv

Observation of anomalous amplitude modes in the kagome metal CsV$_3$Sb$_5$

The charge-density wave (CDW) phase is often accompanied by the condensation of a soft acoustic phonon mode, giving rise to lattice distortion and charge density modulation. This picture was challenged for the recently discovered kagome metal CsV$_3$Sb$_5$, based on the evidence of absence of soft phonons. Here we report the observation of Raman-active CDW amplitude modes in this material, which are collective excitations typically thought to emerge out of frozen soft phonons. The amplitude modes strongly hybridize with other superlattice modes, imparting them with clear temperature-dependent frequency shift and broadening, rarely seen in other known CDW materials. Both the mode mixing and the large amplitude mode frequencies suggest that the CDW exhibits the character of strong electron-phonon coupling, a regime in which acoustic phonon softening can cease to exist. The observation of amplitude modes in the absence of soft phonons highlights the unconventional nature of the CDW in CsV$_3$Sb$_5$.

preprint2022arXiv

On Federated Learning with Energy Harvesting Clients

Catering to the proliferation of Internet of Things devices and distributed machine learning at the edge, we propose an energy harvesting federated learning (EHFL) framework in this paper. The introduction of EH implies that a client&#39;s availability to participate in any FL round cannot be guaranteed, which complicates the theoretical analysis. We derive novel convergence bounds that capture the impact of time-varying device availabilities due to the random EH characteristics of the participating clients, for both parallel and local stochastic gradient descent (SGD) with non-convex loss functions. The results suggest that having a uniform client scheduling that maximizes the minimum number of clients throughout the FL process is desirable, which is further corroborated by the numerical experiments using a real-world FL task and a state-of-the-art EH scheduler.

preprint2022arXiv

On the Convergence of Multi-Server Federated Learning with Overlapping Area

Multi-server Federated learning (FL) has been considered as a promising solution to address the limited communication resource problem of single-server FL. We consider a typical multi-server FL architecture, where the coverage areas of regional servers may overlap. The key point of this architecture is that the clients located in the overlapping areas update their local models based on the average model of all accessible regional models, which enables indirect model sharing among different regional servers. Due to the complicated network topology, the convergence analysis is much more challenging than single-server FL. In this paper, we firstly propose a novel MS-FedAvg algorithm for this multi-server FL architecture and analyze its convergence on non-iid datasets for general non-convex settings. Since the number of clients located in each regional server is much less than in single-server FL, the bandwidth of each client should be large enough to successfully communicate training models with the server, which indicates that full client participation can work in multi-server FL. Also, we provide the convergence analysis of the partial client participation scheme and develop a new biased partial participation strategy to further accelerate convergence. Our results indicate that the convergence results highly depend on the ratio of the number of clients in each area type to the total number of clients in all three strategies. The extensive experiments show remarkable performance and support our theoretical results.

preprint2022arXiv

Over-the-Air Computation with Imperfect Channel State Information

This paper investigates the effect of imperfect channel state information (CSI) on the over-the-air computation (AirComp) system, in which multiple wireless devices (WDs) send individual messages to one access point (AP) for distributed functional computation. By particularly considering the channel estimation errors, we jointly design the transmit coefficients at the WDs and the receive strategy at the AP, for minimizing the computation mean squared error (MSE). First, we consider the single-input single-output (SISO) case with each WD and AP equipped with one single antenna, in which the globally optimal solution to the computation MSE minimization problem is obtained in closed form. Next, we consider the single-input multiple-output (SIMO) case with multiple receive antennas at the AP, in which a high-quality solution is obtained based on alternating optimization and convex optimization. For both cases, the optimized power control solution at the WDs follows a threshold-based regularized channel inversion structure; while for the SIMO case, the receive beamforming at the AP follows a sum-minimum MSE (MMSE) structure. It is shown that with finite receive antennas, a non-zero computation MSE is inevitable due to the channel estimation errors even when the WDs&#39; transmit powers become infinity; while with massive receive antennas, a vanishing MSE is achievable when the channel vectors are independent and identically distributed. Finally, numerical results are provided to demonstrate the effectiveness of the proposed designs.

preprint2022arXiv

Prescribed Scalar Curvature on Compact Manifolds Under Conformal Deformation

We give sufficient and &#34;almost&#34; necessary conditions for the prescribed scalar curvature problems within the conformal class of a Riemannian metric $ g $ for both closed manifolds and compact manifolds with boundary, including the interesting cases $ \mathbb{S}^{n} $ or some quotient of $ \mathbb{S}^{n} $, in dimensions $ n \geqslant 3 $, provided that the first eigenvalues of conformal Laplacian (with appropriate boundary conditions if necessary) are positive. When the manifold is not some quotient of $ \mathbb{S}^{n} $, we show that, on one hand, any smooth function that is a positive constant within some open subset of the manifold with arbitrary positive measure, and has no restriction on the rest of the manifold, is a prescribed scalar curvature function of some metric under conformal change; on the other hand, any smooth function $ S $ is almost a prescribed scalar curvature function of Yamabe metric within the conformal class $ [g] $ in the sense that an appropriate perturbation of $ S $ that defers with $ S $ within an arbitrarily small open subset is a prescribed scalar curvature function of Yamabe metric. When the manifold is either $ \mathbb{S}^{n} $ or $ \mathbb{S}^n / Γ$ with Kleinian group $ Γ$ we show that any positive function that satisfies a technical analytical condition, called CONDITION B, can be realized as a prescribed scalar curvature functions on these manifolds.

preprint2022arXiv

Prescribed Scalar Curvature Problem under Conformal Deformation of A Riemannian Metric with Dirichlet Boundary Condition

In this article, we first show that for all compact Riemannian manifolds with non-empty smooth boundary and dimension at least 3, there exists a metric, pointwise conformal to the original metric, with constant scalar curvature in the interior, and constant scalar curvature on the boundary by considering the boundary as a manifold of its own with dimension at least 2. We then show a series of prescribed scalar curvature results in the interior and on the boundary, with pointwise conformal deformation. These type of results is both an analogy and an extension of Kazdan and Warner&#39;s &#34;Trichotomy Theorem&#34; on a different type of manifolds. The key step of these problems is to obtain a positive, smooth solution of a Yamabe equation with Dirichlet boundary conditions.

preprint2022arXiv

Realization of broadband index-near-zero modes in nonreciprocal magneto-optical heterostructures

Epsilon-near-zero (ENZ) metamaterial with the relative permittivity approaching zero has been a hot research subject in the past decades. The wave in the ENZ region has infinite phase velocity ($v=1/\sqrt{\varepsilonμ}$), whereas it cannot efficiently travel into the other devices or air due to the impedance mismatch or near-zero group velocity. In this paper, we demonstrate that the tunable index-near-zero (INZ) modes with vanishing wavenumbers ($k=0$) and nonzero group velocities ($v_\mathrm{g} \neq 0$) can be achieved in nonreciprocal magneto-optical systems. This kind of INZ modes has been experimentally demonstrated in the photonic crystals at Dirac point frequencies and that impedance-matching effect has been observed as well. Our theoretical analysis reveals that the INZ modes exhibit tunability when changing the parameter of the one-way (nonreciprocal) waveguides. Moreover, owing to the zero-phase-shift characteristic and decreasing $v_\mathrm{g}$ of the INZ modes, several perfect optical buffers (POBs) are proposed in the microwave and terahertz regimes. The theoretical results are further verified by the numerical simulations performed by the finite element method. Our findings may open the new avenues for research in the areas of ultra -strong or -fast nonlinearity, perfect cloaking, high-resolution holographic imaging and wireless communications.

preprint2022arXiv

Rigorous biaxial limit of a molecular-theory-based two-tensor hydrodynamics

We consider a two-tensor hydrodynamics derived from the molecular model, where high-order tensors are determined by closure approximation through the maximum entropy state or the quasi-entropy. We prove the existence and uniqueness of local in time smooth solutions to the two-tensor system. Then, we rigorously justify the connection between the molecular-theory-based two-tensor hydrodynamics and the biaxial frame hydrodynamics. More specifically, in the framework of Hilbert expansion, we show the convergence of the solution to the two-tensor hydrodynamics to the solution to the frame hydrodynamics.

preprint2022arXiv

Robust Transmit Beamforming for Secure Integrated Sensing and Communication

This paper studies a downlink secure integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) transmits confidential messages to a single-antenna communication user (CU) while performing sensing on targets that may act as suspicious eavesdroppers. To ensure the quality of target sensing while preventing their potential eavesdropping, the BS combines the transmit confidential information signals with additional dedicated sensing signals, which play a dual role of artificial noise (AN) for degrading the qualities of eavesdropping channels. Under this setup, we jointly design the transmit information and sensing beamforming, with the objective of minimizing the weighted sum of beampattern matching errors and cross-correlation patterns for sensing subject to secure communication constraints. The robust design takes into account the channel state information (CSI) imperfectness of the eavesdroppers in two practical CSI error scenarios. First, we consider the scenario with bounded CSI errors of eavesdroppers, in which the worst-case secrecy rate constraint is adopted to ensure secure communication performance. In this scenario, we present the optimal solution to the worst-case secrecy rate constrained sensing beampattern optimization problem, by adopting the techniques of S-procedure, semi-definite relaxation (SDR), and a one-dimensional (1D) search, for which the tightness of the SDR is rigorously proved. Next, we consider the scenario with Gaussian CSI errors of eavesdroppers, in which the secrecy outage probability constraint is adopted. In this scenario, we present an efficient algorithm to solve the more challenging secrecy outage-constrained sensing beampattern optimization problem, by exploiting the convex restriction technique based on the Bernstein-type inequality, together with the SDR and 1D search.

preprint2022arXiv

Semi-Supervised Keypoint Detector and Descriptor for Retinal Image Matching

For retinal image matching (RIM), we propose SuperRetina, the first end-to-end method with jointly trainable keypoint detector and descriptor. SuperRetina is trained in a novel semi-supervised manner. A small set of (nearly 100) images are incompletely labeled and used to supervise the network to detect keypoints on the vascular tree. To attack the incompleteness of manual labeling, we propose Progressive Keypoint Expansion to enrich the keypoint labels at each training epoch. By utilizing a keypoint-based improved triplet loss as its description loss, SuperRetina produces highly discriminative descriptors at full input image size. Extensive experiments on multiple real-world datasets justify the viability of SuperRetina. Even with manual labeling replaced by auto labeling and thus making the training process fully manual-annotation free, SuperRetina compares favorably against a number of strong baselines for two RIM tasks, i.e. image registration and identity verification. SuperRetina will be open source.

preprint2022arXiv

Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI

This paper studies a new multi-device edge artificial-intelligent (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) to enable low-latency intelligent services at the network edge. In this system, multiple ISAC devices perform radar sensing to obtain multi-view data, and then offload the quantized version of extracted features to a centralized edge server, which conducts model inference based on the cascaded feature vectors. Under this setup and by considering classification tasks, we measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain, which is defined as the distance of two classes in the Euclidean feature space under normalized covariance. To maximize the discriminant gain, we first quantify the influence of the sensing, computation, and communication processes on it with a derived closed-form expression. Then, an end-to-end task-oriented resource management approach is developed by integrating the three processes into a joint design. This integrated sensing, computation, and communication (ISCC) design approach, however, leads to a challenging non-convex optimization problem, due to the complicated form of discriminant gain and the device heterogeneity in terms of channel gain, quantization level, and generated feature subsets. Remarkably, the considered non-convex problem can be optimally solved based on the sum-of-ratios method. This gives the optimal ISCC scheme, that jointly determines the transmit power and time allocation at multiple devices for sensing and communication, as well as their quantization bits allocation for computation distortion control. By using human motions recognition as a concrete AI inference task, extensive experiments are conducted to verify the performance of our derived optimal ISCC scheme.

preprint2022arXiv

Uniqueness of global weak solutions to the frame hydrodynamics for biaxial nematic phases in $\mathbb{R}^2$

We consider the hydrodynamics for biaxial nematic phases described by a field of orthonormal frame, which can be derived from a molecular-theory-based tensor model. We prove the uniqueness of global weak solutions to the Cauchy problem of the frame hydrodynamics in dimensional two. The proof is mainly based on the suitable weaker energy estimates within the Littlewood--Paley analysis. We take full advantage of the estimates of nonlinear terms with rotational derivatives on $SO(3)$, together with cancellation relations and dissipative structures of the biaxial frame system.

preprint2022arXiv

Vertical Federated Edge Learning with Distributed Integrated Sensing and Communication

This letter studies a vertical federated edge learning (FEEL) system for collaborative objects/human motion recognition by exploiting the distributed integrated sensing and communication (ISAC). In this system, distributed edge devices first send wireless signals to sense targeted objects/human, and then exchange intermediate computed vectors (instead of raw sensing data) for collaborative recognition while preserving data privacy. To boost the spectrum and hardware utilization efficiency for FEEL, we exploit ISAC for both target sensing and data exchange, by employing dedicated frequency-modulated continuous-wave (FMCW) signals at each edge device. Under this setup, we propose a vertical FEEL framework for realizing the recognition based on the collected multi-view wireless sensing data. In this framework, each edge device owns an individual local L-model to transform its sensing data into an intermediate vector with relatively low dimensions, which is then transmitted to a coordinating edge device for final output via a common downstream S-model. By considering a human motion recognition task, experimental results show that our vertical FEEL based approach achieves recognition accuracy up to 98\% with an improvement up to 8\% compared to the benchmarks, including on-device training and horizontal FEEL.

preprint2022arXiv

Well-posedness of frame hydrodynamics for biaxial nematic liquid crystals

We consider the hydrodynamics for the biaxial nematic phase characterized by a field of orthonormal frame, which can be derived from a molecular-theory-based tensor model. In dimension two and three, we establish the local well-posedness and the blow-up criterion for smooth solutions to the frame hydrodynamic model. Furthermore, we prove the global existence of weak solutions in $\mathbb{R}^2$ which are nonsmooth at finitely many singular times.

preprint2021arXiv

Autodidactic Neurosurgeon: Collaborative Deep Inference for Mobile Edge Intelligence via Online Learning

Recent breakthroughs in deep learning (DL) have led to the emergence of many intelligent mobile applications and services, but in the meanwhile also pose unprecedented computing challenges on resource-constrained mobile devices. This paper builds a collaborative deep inference system between a resource-constrained mobile device and a powerful edge server, aiming at joining the power of both on-device processing and computation offloading. The basic idea of this system is to partition a deep neural network (DNN) into a front-end part running on the mobile device and a back-end part running on the edge server, with the key challenge being how to locate the optimal partition point to minimize the end-to-end inference delay. Unlike existing efforts on DNN partitioning that rely heavily on a dedicated offline profiling stage to search for the optimal partition point, our system has a built-in online learning module, called Autodidactic Neurosurgeon (ANS), to automatically learn the optimal partition point on-the-fly. Therefore, ANS is able to closely follow the changes of the system environment by generating new knowledge for adaptive decision making. The core of ANS is a novel contextual bandit learning algorithm, called $μ$LinUCB, which not only has provable theoretical learning performance guarantee but also is ultra-lightweight for easy real-world implementation. We implement our system on a video stream object detection testbed to validate the design of ANS and evaluate its performance. The experiments show that ANS significantly outperforms state-of-the-art benchmarks in terms of tracking system changes and reducing the end-to-end inference delay.

preprint2021arXiv

Bandwidth Allocation for Multiple Federated Learning Services in Wireless Edge Networks

This paper studies a federated learning (FL) system, where \textit{multiple} FL services co-exist in a wireless network and share common wireless resources. It fills the void of wireless resource allocation for multiple simultaneous FL services in the existing literature. Our method designs a two-level resource allocation framework comprising \emph{intra-service} resource allocation and \emph{inter-service} resource allocation. The intra-service resource allocation problem aims to minimize the length of FL rounds by optimizing the bandwidth allocation among the clients of each FL service. Based on this, an inter-service resource allocation problem is further considered, which distributes bandwidth resources among multiple simultaneous FL services. We consider both cooperative and selfish providers of the FL services. For cooperative FL service providers, we design a distributed bandwidth allocation algorithm to optimize the overall performance of multiple FL services, meanwhile cater to the fairness among FL services and the privacy of clients. For selfish FL service providers, a new auction scheme is designed with the FL service owners as the bidders and the network provider as the auctioneer. The designed auction scheme strikes a balance between the overall FL performance and fairness. Our simulation results show that the proposed algorithms outperform other benchmarks under various network conditions.

preprint2021arXiv

Defect-induced nonlinearity in 2D nanoparticles

Optical nonlinearity depends on symmetry and symmetries vanish in the presence of defects. Vaccancy defects in centrosymmetric crystals and thin films are a well-known source of even-order optical nonlinearity, e.g. causing second harmonic generation. The emerging ability to manipulate defects in two-dimensional materials and nanoparticles provides an opportunity for engineering of optical nonlinearity. Here, we demonstrate the effect of defects on the nonlinear optical response of two-dimensional dielectric nanoparticles. Using a toy model, where bound optical electrons of linear atoms are coupled by nonlinear Coulomb interactions, we model defect-induced nonlinearity. We find that defects at particle edges contribute strongly to even-order optical nonlinearity and that unique nonlinear signatures of different defect states could provide the smallest conceivable QR-codes and extremely high density optical data storage, in principle approaching 1 bit per atom.

preprint2021arXiv

K-Core Decomposition on Super Large Graphs with Limited Resources

K-core decomposition is a commonly used metric to analyze graph structure or study the relative importance of nodes in complex graphs. Recent years have seen rapid growth in the scale of the graph, especially in industrial settings. For example, our industrial partner runs popular social applications with billions of users and is able to gather a rich set of user data. As a result, applying K-core decomposition on large graphs has attracted more and more attention from academics and the industry. A simple but effective method to deal with large graphs is to train them in the distributed settings, and some distributed K-core decomposition algorithms are also proposed. Despite their effectiveness, we experimentally and theoretically observe that these algorithms consume too many resources and become unstable on super-large-scale graphs, especially when the given resources are limited. In this paper, we deal with those super-large-scale graphs and propose a divide-and-conquer strategy on top of the distributed K-core decomposition algorithm. We evaluate our approach on three large graphs. The experimental results show that the consumption of resources can be significantly reduced, and the calculation on large-scale graphs becomes more stable than the existing methods. For example, the distributed K-core decomposition algorithm can scale to a large graph with 136 billion edges without losing correctness with our divide-and-conquer technique.

preprint2021arXiv

Passenger Mobility Prediction via Representation Learning for Dynamic Directed and Weighted Graph

In recent years, ride-hailing services have been increasingly prevalent as they provide huge convenience for passengers. As a fundamental problem, the timely prediction of passenger demands in different regions is vital for effective traffic flow control and route planning. As both spatial and temporal patterns are indispensable passenger demand prediction, relevant research has evolved from pure time series to graph-structured data for modeling historical passenger demand data, where a snapshot graph is constructed for each time slot by connecting region nodes via different relational edges (e.g., origin-destination relationship, geographical distance, etc.). Consequently, the spatiotemporal passenger demand records naturally carry dynamic patterns in the constructed graphs, where the edges also encode important information about the directions and volume (i.e., weights) of passenger demands between two connected regions. However, existing graph-based solutions fail to simultaneously consider those three crucial aspects of dynamic, directed, and weighted (DDW) graphs, leading to limited expressiveness when learning graph representations for passenger demand prediction. Therefore, we propose a novel spatiotemporal graph attention network, namely Gallat (Graph prediction with all attention) as a solution. In Gallat, by comprehensively incorporating those three intrinsic properties of DDW graphs, we build three attention layers to fully capture the spatiotemporal dependencies among different regions across all historical time slots. Moreover, the model employs a subtask to conduct pretraining so that it can obtain accurate results more quickly. We evaluate the proposed model on real-world datasets, and our experimental results demonstrate that Gallat outperforms the state-of-the-art approaches.

preprint2021arXiv

Personalized Education in the AI Era: What to Expect Next?

The objective of personalized learning is to design an effective knowledge acquisition track that matches the learner&#39;s strengths and bypasses her weaknesses to ultimately meet her desired goal. This concept emerged several years ago and is being adopted by a rapidly-growing number of educational institutions around the globe. In recent years, the boost of artificial intelligence (AI) and machine learning (ML), together with the advances in big data analysis, has unfolded novel perspectives to enhance personalized education in numerous dimensions. By taking advantage of AI/ML methods, the educational platform precisely acquires the student&#39;s characteristics. This is done, in part, by observing the past experiences as well as analyzing the available big data through exploring the learners&#39; features and similarities. It can, for example, recommend the most appropriate content among numerous accessible ones, advise a well-designed long-term curriculum, connect appropriate learners by suggestion, accurate performance evaluation, and the like. Still, several aspects of AI-based personalized education remain unexplored. These include, among others, compensating for the adverse effects of the absence of peers, creating and maintaining motivations for learning, increasing diversity, removing the biases induced by the data and algorithms, and the like. In this paper, while providing a brief review of state-of-the-art research, we investigate the challenges of AI/ML-based personalized education and discuss potential solutions.

preprint2021arXiv

Realization of broadband truly rainbow trapping in gradient-index heterostructures

Unidirectionally propagating waves (UPW) such as topologically protected edge modes and surface magnetoplasmons (SMPs) has been a research hotspot in the last decades. In the study of UPW, metals are usually treated as perfect electric conductors (PECs) which, in general, are the boundary conditions. However, it was reported that the transverse resonance condition induced by the PEC wall(s) may significantly narrow up the complete one-way propagation (COWP) band. In this paper, we propose two ways to achieve ultra-broadband one-way waveguide in terahertz regime. The first way is utilizing the epsilon negative (ENG) metamaterial (MM) and the other one is replacing the PEC boundary with perfect magnetic conductor (PMC) boundary. In both conditions, the total bandwidth of the COWP bands can be efficiently broadened by more than three times. Moreover, based on the ultra-broadband one-way configurations, gradient-index metamaterial-based one-way waveguides are proposed to achieve broadband truly rainbow trapping (TRT). By utilizing the finite element method, the realization of the broadband TRT without backward reflection is verified in gradient-index structures. Besides, giant electric field enhancement is observed in a PMC-based one-way structure with an ultra-subwavelength ($\approx 10^{-4} λ_0$, $λ_0$ is the wavelength in vaccum) terminal, and the amplitude of the electric field is enormously enhanced by five orders of magnitude. Our findings are beneficial for researches on broadband terahertz communication, energy harvesting and strong-field devices.

preprint2021arXiv

Toy model of harmonic and sum frequency generation in 2D nanostructures

Optical nonlinearities of matter are often associated with the response of individual atoms. Here, using a toy oscillator model, we show that in the confined geometry of a two-dimensional dielectric nanoparticle a collective nonlinear response of the atomic array can arise from the Coulomb interactions of the bound optical electrons, even if the individual atoms exhibit no nonlinearity. We determine the multipole contributions to the nonlinear response of nanoparticles and demonstrate that the odd order and even order nonlinear electric dipole moments scale with the area and perimeter of the nanoparticle, respectively.

preprint2021arXiv

UAV-Enabled Wireless Power Transfer: A Tutorial Overview

Unmanned aerial vehicle (UAV)-enabled wireless power transfer (WPT) has recently emerged as a promising technique to provide sustainable energy supply for widely distributed low-power ground devices (GDs) in large-scale wireless networks. Compared with the energy transmitters (ETs) in conventional WPT systems which are deployed at fixed locations, UAV-mounted aerial ETs can fly flexibly in the three-dimensional (3D) space to charge nearby GDs more efficiently. This paper provides a tutorial overview on UAV-enabled WPT and its appealing applications, in particular focusing on how to exploit UAVs&#39; controllable mobility via their 3D trajectory design to maximize the amounts of energy transferred to all GDs in a wireless network with fairness. First, we consider the single-UAV-enabled WPT scenario with one UAV wirelessly charging multiple GDs at known locations. To solve the energy maximization problem in this case, we present a general trajectory design framework consisting of three innovative approaches to optimize the UAV trajectory, which are multi-location hovering, successive-hover-and-fly, and time-quantization-based optimization, respectively. Next, we consider the multi-UAV-enabled WPT scenario where multiple UAVs cooperatively charge many GDs in a large area. Building upon the single-UAV trajectory design, we propose two efficient schemes to jointly optimize multiple UAVs&#39; trajectories, based on the principles of UAV swarming and GD clustering, respectively. Furthermore, we consider two important extensions of UAV-enabled WPT, namely UAV-enabled wireless powered communication networks (WPCN) and UAV-enabled wireless powered mobile edge computing (MEC).

preprint2021arXiv

Unfolding the Neutron Spectra from a Water-Pumping-Injection Multi-layered Concentric Sphere Neutron Spectrometer Using a Self-Adaptive Differential Evolution Algorithm

A self-adaptive differential evolution neutron spectrum unfolding algorithm (SDENUA) was established in this paper to unfold the neutron spectra obtained from a Water-pumping-injection Multi-layered concentric sphere Neutron Spectrometer (WMNS). Specifically, the neutron fluence bounds were estimated to accelerate the algorithm convergence, the minimum error between the optimal solution and the input neutron counts with relative uncertainties was limited to 10-6 to avoid useless calculation. Furthermore, the crossover probability and scaling factor were controlled self-adaptively. FLUKA Monte Carlo was used to simulate the readings of the WMNS under (1) a spectrum of Cf-252 and (2) its spectrum after being moderated, (3) a spectrum used for BNCT, and (4) a reactor spectrum, and the measured neutron counts unfolded by using the SDENUA. The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA, which does not require complex parameter tuning and the priori default spectrum. Results indicate that the solutions of the SDENUA are more in agreement with the IAEA spectra than that of the MAXED and GRAVEL in UMG 3.1, and the errors of the final results calculated by SDENUA are under 12%. The established SDENUA has potential applications for unfolding spectra from the WMNS.

preprint2020arXiv

A Deep Reinforcement Learning Based Multi-Criteria Decision Support System for Textile Manufacturing Process Optimization

Textile manufacturing is a typical traditional industry involving high complexity in interconnected processes with limited capacity on the application of modern technologies. Decision-making in this domain generally takes multiple criteria into consideration, which usually arouses more complexity. To address this issue, the present paper proposes a decision support system that combines the intelligent data-based random forest (RF) models and a human knowledge based analytical hierarchical process (AHP) multi-criteria structure in accordance to the objective and the subjective factors of the textile manufacturing process. More importantly, the textile manufacturing process is described as the Markov decision process (MDP) paradigm, and a deep reinforcement learning scheme, the Deep Q-networks (DQN), is employed to optimize it. The effectiveness of this system has been validated in a case study of optimizing a textile ozonation process, showing that it can better master the challenging decision-making tasks in textile manufacturing processes.

preprint2020arXiv

A Survey of Prototype and Experiment for UAV Communications

Unmanned aerial vehicle (UAV) communications have attracted significant attention from both academia and industry. To facilitate the large-scale usage of UAVs for various applications in practice, we provide a comprehensive survey on the prototype and experiment for UAV communications. To this end, we first provide an overview on the general architecture of the prototype and experiment for UAV communications, and then present experimental verification for air-to-ground channel models and UAV energy consumption models. Next, we discuss measurement experiments on two promising paradigms of UAV communications, namely cellular-connected UAVs and UAV-enabled aerial communication platforms. For the former, we focus on the feasibility study and address the interference mitigation issue. For UAV-enabled aerial communication platforms, we present three scenarios, namely UAV-enabled aerial base stations, UAV-enabled aerial relays and UAV-enabled aerial data collection/dissemination. Finally, we point out some promising future directions for prototype and experimental measurements for UAV communications.

preprint2020arXiv

A(DP)$^2$SGD: Asynchronous Decentralized Parallel Stochastic Gradient Descent with Differential Privacy

As deep learning models are usually massive and complex, distributed learning is essential for increasing training efficiency. Moreover, in many real-world application scenarios like healthcare, distributed learning can also keep the data local and protect privacy. A popular distributed learning strategy is federated learning, where there is a central server storing the global model and a set of local computing nodes updating the model parameters with their corresponding data. The updated model parameters will be processed and transmitted to the central server, which leads to heavy communication costs. Recently, asynchronous decentralized distributed learning has been proposed and demonstrated to be a more efficient and practical strategy where there is no central server, so that each computing node only communicates with its neighbors. Although no raw data will be transmitted across different local nodes, there is still a risk of information leak during the communication process for malicious participants to make attacks. In this paper, we present a differentially private version of asynchronous decentralized parallel SGD (ADPSGD) framework, or A(DP)$^2$SGD for short, which maintains communication efficiency of ADPSGD and prevents the inference from malicious participants. Specifically, R{é}nyi differential privacy is used to provide tighter privacy analysis for our composite Gaussian mechanisms while the convergence rate is consistent with the non-private version. Theoretical analysis shows A(DP)$^2$SGD also converges at the optimal $\mathcal{O}(1/\sqrt{T})$ rate as SGD. Empirically, A(DP)$^2$SGD achieves comparable model accuracy as the differentially private version of Synchronous SGD (SSGD) but runs much faster than SSGD in heterogeneous computing environments.

preprint2020arXiv

Adversarial Machine Learning based Partial-model Attack in IoT

As Internet of Things (IoT) has emerged as the next logical stage of the Internet, it has become imperative to understand the vulnerabilities of the IoT systems when supporting diverse applications. Because machine learning has been applied in many IoT systems, the security implications of machine learning need to be studied following an adversarial machine learning approach. In this paper, we propose an adversarial machine learning based partial-model attack in the data fusion/aggregation process of IoT by only controlling a small part of the sensing devices. Our numerical results demonstrate the feasibility of this attack to disrupt the decision making in data fusion with limited control of IoT devices, e.g., the attack success rate reaches 83\% when the adversary tampers with only 8 out of 20 IoT devices. These results show that the machine learning engine of IoT system is highly vulnerable to attacks even when the adversary manipulates a small portion of IoT devices, and the outcome of these attacks severely disrupts IoT system operations.

preprint2020arXiv

Central Limit Theorems on Compact Metric Spaces

We produce a series of Central Limit Theorems (CLTs) associated to compact metric measure spaces $(K,d,η)$, with $η$ a reasonable probability measure. For the first CLT, we can ignore $η$ by isometrically embedding $K$ into ${\mathcal C}(K)$, the space of continuous functions on $K$ with the sup norm, and then applying known CLTs for sample means on Banach spaces (Theorem 3.1). However, the sample mean makes no sense back on $K$, so using $η$ we develop a CLT for the sample Fréchet mean (Corollary 4.1). This involves working on the closed convex hull of the embedded image of $K$. To work in the easier Hilbert space setting of $L^2(K,η)$, we have to modify the metric $d$ to a related metric $d_η$. We obtain an $L^2$-CLT for both the sample mean and the sample Fréchet mean (Theorem 5.1), and we relate the Fréchet sample and population means on the closed convex hull to the Fréchet means on the image of $K$. Since the $L^2$ and $L^\infty$ norms play important roles, in Section 6 we develop a metric-measure criterion relating $d$ and $η$ under which all $L^p$ norms are equivalent.

preprint2020arXiv

Client Selection and Bandwidth Allocation in Wireless Federated Learning Networks: A Long-Term Perspective

This paper studies federated learning (FL) in a classic wireless network, where learning clients share a common wireless link to a coordinating server to perform federated model training using their local data. In such wireless federated learning networks (WFLNs), optimizing the learning performance depends crucially on how clients are selected and how bandwidth is allocated among the selected clients in every learning round, as both radio and client energy resources are limited. While existing works have made some attempts to allocate the limited wireless resources to optimize FL, they focus on the problem in individual learning rounds, overlooking an inherent yet critical feature of federated learning. This paper brings a new long-term perspective to resource allocation in WFLNs, realizing that learning rounds are not only temporally interdependent but also have varying significance towards the final learning outcome. To this end, we first design data-driven experiments to show that different temporal client selection patterns lead to considerably different learning performance. With the obtained insights, we formulate a stochastic optimization problem for joint client selection and bandwidth allocation under long-term client energy constraints, and develop a new algorithm that utilizes only currently available wireless channel information but can achieve long-term performance guarantee. Further experiments show that our algorithm results in the desired temporal client selection pattern, is adaptive to changing network environments and far outperforms benchmarks that ignore the long-term effect of FL.

preprint2020arXiv

Cooperative Interference Management for Over-the-Air Computation Networks

This paper considers a multi-cell AirComp network and investigates the optimal power control policies over multiple cells to regulate the effect of inter-cell interference. First, we consider the scenario of centralized multi-cell power control, where we characterize the Pareto boundary of the multi-cell MSE region by minimizing the sum MSE subject to a set of constraints on individual MSEs. Though the sum-MSE minimization problem is non-convex and its direct solution intractable, we optimally solve this problem via equivalently solving a sequence of convex second-order cone program feasibility problems together with a bisection search. Next, we consider distributed power control in the other scenario without a centralized controller, for which an alternative IT-based method is proposed to characterize the same MSE Pareto boundary, and enable a decentralized power control algorithm. Accordingly, each AP only needs to individually control the power of its associated devices, but subject to a set of IT constraints on their interference to neighboring cells, while different APs can cooperate in iteratively updating the IT levels by pairwise information exchange, to achieve a Pareto-optimal MSE tuple. Last, simulation results demonstrate that cooperative power control using the proposed algorithms can substantially reduce the sum MSE of AirComp networks.

preprint2020arXiv

D2D-Enabled Data Sharing for Distributed Machine Learning at Wireless Network Edge

Mobile edge learning is an emerging technique that enables distributed edge devices to collaborate in training shared machine learning models by exploiting their local data samples and communication and computation resources. To deal with the straggler dilemma issue faced in this technique, this paper proposes a new device to device enabled data sharing approach, in which different edge devices share their data samples among each other over communication links, in order to properly adjust their computation loads for increasing the training speed. Under this setup, we optimize the radio resource allocation for both data sharing and distributed training, with the objective of minimizing the total training delay under fixed numbers of local and global iterations. Numerical results show that the proposed data sharing design significantly reduces the training delay, and also enhances the training accuracy when the data samples are non independent and identically distributed among edge devices.

preprint2020arXiv

Enabling Cross-chain Transactions: A Decentralized Cryptocurrency Exchange Protocol

Inspired by Bitcoin, many different kinds of cryptocurrencies based on blockchain technology have turned up on the market. Due to the special structure of the blockchain, it has been deemed impossible to directly trade between traditional currencies and cryptocurrencies or between different types of cryptocurrencies. Generally, trading between different currencies is conducted through a centralized third-party platform. However, it has the problem of a single point of failure, which is vulnerable to attacks and thus affects the security of the transactions. In this paper, we propose a distributed cryptocurrency trading scheme to solve the problem of centralized exchanges, which can achieve trading between different types of cryptocurrencies. Our scheme is implemented with smart contracts on the Ethereum blockchain and deployed on the Ethereum test network. We not only implement transactions between individual users, but also allow transactions between multiple users. The experimental result proves that the cost of our scheme is acceptable.

preprint2020arXiv

Energy-Efficient Federated Edge Learning with Joint Communication and Computation Design

This paper studies a federated edge learning system, in which an edge server coordinates a set of edge devices to train a shared machine learning model based on their locally distributed data samples. During the distributed training, we exploit the joint communication and computation design for improving the system energy efficiency, in which both the communication resource allocation for global ML parameters aggregation and the computation resource allocation for locally updating MLparameters are jointly optimized. In particular, we consider two transmission protocols for edge devices to upload ML parameters to edge server, based on the non orthogonal multiple access and time division multiple access, respectively. Under both protocols, we minimize the total energy consumption at all edge devices over a particular finite training duration subject to a given training accuracy, by jointly optimizing the transmission power and rates at edge devices for uploading MLparameters and their central processing unit frequencies for local update. We propose efficient algorithms to optimally solve the formulated energy minimization problems by using the techniques from convex optimization. Numerical results show that as compared to other benchmark schemes, our proposed joint communication and computation design significantly improves the energy efficiency of the federated edge learning system, by properly balancing the energy tradeoff between communication and computation.

preprint2020arXiv

Federated Learning for Healthcare Informatics

With the rapid development of computer software and hardware technologies, more and more healthcare data are becoming readily available from clinical institutions, patients, insurance companies and pharmaceutical industries, among others. This access provides an unprecedented opportunity for data science technologies to derive data-driven insights and improve the quality of care delivery. Healthcare data, however, are usually fragmented and private making it difficult to generate robust results across populations. For example, different hospitals own the electronic health records (EHR) of different patient populations and these records are difficult to share across hospitals because of their sensitive nature. This creates a big barrier for developing effective analytical approaches that are generalizable, which need diverse, &#34;big data&#34;. Federated learning, a mechanism of training a shared global model with a central server while keeping all the sensitive data in local institutions where the data belong, provides great promise to connect the fragmented healthcare data sources with privacy-preservation. The goal of this survey is to provide a review for federated learning technologies, particularly within the biomedical space. In particular, we summarize the general solutions to the statistical challenges, system challenges and privacy issues in federated learning, and point out the implications and potentials in healthcare.

preprint2020arXiv

Hybrid Beamforming for Massive MIMO Over-the-Air Computation

Over-the-air computation (AirComp) has been recognized as a promising technique in Internet-of-Things (IoT) networks for fast data aggregation from a large number of wireless devices. However, as the number of devices becomes large, the computational accuracy of AirComp would seriously degrade due to the vanishing signal-to-noise ratio (SNR). To address this issue, we exploit the massive multiple-input multiple-output (MIMO) with hybrid beamforming, in order to enhance the computational accuracy of AirComp in a cost-effective manner. In particular, we consider the scenario with a large number of multi-antenna devices simultaneously sending data to an access point (AP) equipped with massive antennas for functional computation over the air. Under this setup, we jointly optimize the transmit digital beamforming at the wireless devices and the receive hybrid beamforming at the AP, with the objective of minimizing the computational mean-squared error (MSE) subject to the individual transmit power constraints at the wireless devices. To solve the non-convex hybrid beamforming design optimization problem, we propose an alternating-optimization-based approach. In particular, we propose two computationally efficient algorithms to handle the challenging receive analog beamforming problem, by exploiting the techniques of successive convex approximation (SCA) and block coordinate descent (BCD), respectively. It is shown that for the special case with a fully-digital receiver at the AP, the achieved MSE of the massive MIMO AirComp system is inversely proportional to the number of receive antennas. Furthermore, numerical results show that the proposed hybrid beamforming design substantially enhances the computation MSE performance as compared to other benchmark schemes, while the SCA-based algorithm performs closely to the performance upper bound achieved by the fully-digital beamforming.

preprint2020arXiv

Iterative Methods for Globally Lipschitz Nonlinear Laplace Equations

We introduce an iterative method to prove the existence and uniqueness of the complex-valued nonlinear elliptic PDE of the form $ -Δu + F(u) = f $ with Dirichlet or Neumann boundary conditions on a precompact domain $ Ω\subset \mathbb{R}^{n}$, where $ F : \mathbb{C} \rightarrow \mathbb{C} $ is Lipschitz. The same method gives a solution to $ - Δ_{g} u + F(u) = f $ for these boundary conditions on a smooth, compact Riemannian manifold $ (M, g) $ with $ \mathcal{C}^{1} $ boundary, where $ - Δ_{g} $ is the Laplace-Beltrami operator. We also apply parametrix methods to discuss an integral version of these PDEs.

preprint2020arXiv

Max-Min Fairness in IRS-Aided Multi-Cell MISO Systems via Joint Transmit and Reflective Beamforming

This paper investigates an intelligent reflecting surface (IRS)-aided multi-cell multiple-input single-output (MISO) system consisting of several multi-antenna base stations (BSs) each communicating with a single-antenna user, in which an IRS is dedicatedly deployed for assisting the wireless transmission and suppressing the inter-cell interference. Under this setup, we jointly optimize the coordinated transmit beamforming at the BSs and the reflective beamforming at the IRS, for the purpose of maximizing the minimum weighted received signal-to-interference-plus-noise ratio (SINR) at users, subject to the individual maximum transmit power constraints at the BSs and the reflection constraints at the IRS. To solve the difficult non-convex minimum SINR maximization problem, we propose efficient algorithms based on alternating optimization, in which the transmit and reflective beamforming vectors are optimized in an alternating manner. In particular, we use the second-order-cone programming (SOCP) for optimizing the coordinated transmit beamforming, and develop two efficient designs for updating the reflective beamforming based on the techniques of semi-definite relaxation (SDR) and successive convex approximation (SCA), respectively. Numerical results show that the use of IRS leads to significantly higher SINR values than benchmark schemes without IRS or without proper reflective beamforming optimization; while the developed SCA-based solution outperforms the SDR-based one with lower implementation complexity.

preprint2020arXiv

Online Maneuver Design for UAV-Enabled NOMA Systems via Reinforcement Learning

This paper considers an unmanned aerial vehicle enabled-up link non-orthogonal multiple-access system, where multiple mobile users on the ground send independent messages to a unmanned aerial vehicle in the sky via non-orthogonal multiple-access transmission. Our objective is to design the unmanned aerial vehicle dynamic maneuver for maximizing the sum-rate throughput of all mobile ground users over a finite time horizon.

preprint2020arXiv

Optimal Energy Allocation and Task Offloading Policy for Wireless Powered Mobile Edge Computing Systems

This paper studies a wireless powered mobile edge computing (MEC) system with fluctuating channels and dynamic task arrivals over time. We jointly optimize the transmission energy allocation at the energy transmitter (ET) for WPT and the task allocation at the user for local computing and offloading over a particular finite horizon, with the objective of minimizing the total transmission energy consumption at the ET while ensuring the user&#39;s successful task execution. First, in order to characterize the fundamental performance limit, we consider the offline optimization by assuming that the perfect knowledge of channel state information and task state information (i.e., task arrival timing and amounts) is known a-priori. In this case, we obtain the well-structured optimal solution in a closed form to the energy minimization problem via convex optimization techniques. Next, inspired by the structured offline solutions obtained above, we develop heuristic online designs for the joint energy and task allocation when the knowledge of CSI/TSI is only causally known. Finally, numerical results are provided to show that the proposed joint designs achieve significantly smaller energy consumption than benchmark schemes with only local computing or full offloading at the user, and the proposed heuristic online designs perform close to the optimal offline solutions.

preprint2020arXiv

Optimized Power Control for Over-the-Air Computation in Fading Channels

In this paper, we study the power control problem for Over-the-air computation (AirComp) over fading channels. Our objective is to minimize the computation error by jointly optimizing the transmit power at the power-constrained devices and a signal scaling factor (called denoising factor) at the fusion center (FC). The problem is generally non-convex due to the coupling of the transmit power over devices and denoising factor at the FC. To tackle the challenge, we first consider the special case with static channels, for which we derive the optimal solution in closed form. The optimal power control exhibits a threshold-based structure. Specifically, for each device, if the product of the channel quality and power budget, called quality indicator, exceeds an optimized threshold, this device applies channel-inversion power control; otherwise, it performs full power transmission. Building on the results, we proceed to consider the general case with time-varying channels. To solve the more challenging non-convex power control problem, we use the Lagrange-duality method via exploiting its &#34;time-sharing&#34; property. The derived optimal power control exhibits a regularized channel inversion structure, where the regularization has the function of balancing the tradeoff between the signal-magnitude alignment and noise suppression. Moreover, for the special case with only one device being power limited, we show that the optimal power control for the power-limited device has an interesting channel-inversion water-filling structure, while those for other devices (with sufficient power budgets) reduce to channel-inversion power control over all fading states.

preprint2020arXiv

Outage Probability Minimization for UAV-Enabled Data Collection with Distributed Beamforming

This paper studies an unmanned aerial vehicle (UAV)-enabled wireless sensor network, in which one UAV flies in the sky to collect the data transmitted from a set of sensors via distributed beamforming. We consider the delay-sensitive application scenario, in which the sensors transmit the common/shared messages by using fixed data rates and adaptive transmit powers. Under this setup, we jointly optimize the UAV&#39;s trajectory design and the sensors&#39; transmit power allocation, in order to minimize the transmission outage probability, subject to the UAV&#39;s flight speed constraints and the sensors&#39; individual average power constraints. However, the formulated outage probability minimization problem is non-convex and thus difficult to be optimally solved in general. To tackle this issue, we first consider the special problem in the ideal case with the UAV&#39;s flight speed constraints ignored, for which the well-structured optimal solution is obtained to reveal the fundamental performance upper bound. Next, for the general problem with the UAV&#39;s flight speed constraints considered, we propose an efficient algorithm to solve it sub-optimally by using the techniques of convex optimization and approximation. Finally, numerical results show that our proposed design achieves significantly reduced outage probability than other benchmark schemes.

preprint2020arXiv

Real-Time Resource Allocation for Wireless Powered Multiuser Mobile Edge Computing With Energy and Task Causality

This paper considers a wireless powered multiuser mobile edge computing (MEC) system, in which a multi-antenna hybrid access point (AP) wirelessly charges multiple users, and each user relies on the harvested energy to execute computation tasks. We jointly optimize the energy beamforming and remote task execution at the AP, as well as the local computing and task offloading, aiming to minimize the total system energy consumption over a finite time horizon, subject to causality constraints for both energy harvesting and task arrival at the users. In particular, we consider a practical scenario with casual task state information (TSI) and channel state information (CSI), i.e., only the current and previous TSI and CSI are available, but the future TSI and CSI can only be predicted subject to certain errors. To solve this real-time resource allocation problem, we propose an offline-optimization inspired online design approach. First, we consider the offline optimization case by assuming that the TSI and CSI are perfectly known a-priori. In this case, the energy minimization problem corresponds to a convex problem, for which the semi-closed-form optimal solution is obtained via the Lagrange duality method. Next, inspired by the optimal offline solution, we propose a sliding-window based online resource allocation design in practical cases by integrating with the sequential optimization. Finally, numerical results show that the proposed joint wireless powered MEC designs significantly improve the system&#39;s energy efficiency, as compared with the benchmark schemes that consider a sliding window of size one or without such joint optimization.

preprint2020arXiv

Time-Division Energy Beamforming for Multiuser Wireless Power Transfer with Non-Linear Energy Harvesting

Energy beamforming has emerged as a promising technique for enhancing the energy transfer efficiency of wireless power transfer (WPT). However, the performance of conventional energy beamforming may seriously degrade due to the non-linear radio frequency (RF) to direct current (DC) conversion at energy receivers (ERs). To tackle this issue, this letter proposes a new time-division energy beamforming, in which different energy beamforming matrices (of high ranks in general) are time shared to exploit the &#34;convex-concave&#34; shape of the RF-DC power relation at ERs. By considering a particular time duration for WPT, we maximize the minimum harvested DC energy among all ERs, by jointly optimizing the energy beamforming matrices and the corresponding time allocation. In order to solve the non-convex min-DC-energy maximization problem, we propose an efficient solution by using the techniques of alternating optimization and successive convex approximation (SCA). Numerical results show that the proposed time-division energy beamforming design indeed outperforms the conventional multi-beam and time-division-multiple-access (TDMA)-based energy transmissions.

preprint2020arXiv

Wave Approximation of Backward Heat Equation with Ricci Flow

In this paper, we consider solutions of the backward heat equation with Ricci flow on manifolds as a type of infinite dimensional limit of solutions of a wave equation on a larger manifold with an analysis of wavefront set. Specifically, the projection of the solution of the wave equation $ \left(\frac{2t}{N} \cdot \frac{\partial^{2}}{\partial t^{2}} + \frac{tR(t, x)}{N} \frac{\partial}{\partial t} - Δ_{\tilde{g}^{(N)}(t)} \right) u = R(t, x) $ outside its wavefront set onto $ \mathbb{R}_{t} \times M_{x, g(t)} $ solves the backward heat equation $ \partial_{t} u + Δ_{x, g(t)} u = -R(t, x) $ within some appropriate time interval. We discuss this approximation starting from Euclidean case, and then extend to the open Riemannian manifold situation. This idea partially comes from Perelman&#39;s original papers in proving Poincaré conjecture as well as Terence Tao&#39;s Notes in UCLA.

preprint2020arXiv

When Attackers Meet AI: Learning-empowered Attacks in Cooperative Spectrum Sensing

Defense strategies have been well studied to combat Byzantine attacks that aim to disrupt cooperative spectrum sensing by sending falsified versions of spectrum sensing data to a fusion center. However, existing studies usually assume network or attackers as passive entities, e.g., assuming the prior knowledge of attacks is known or fixed. In practice, attackers can actively adopt arbitrary behaviors and avoid pre-assumed patterns or assumptions used by defense strategies. In this paper, we revisit this security vulnerability as an adversarial machine learning problem and propose a novel learning-empowered attack framework named Learning-Evaluation-Beating (LEB) to mislead the fusion center. Based on the black-box nature of the fusion center in cooperative spectrum sensing, our new perspective is to make the adversarial use of machine learning to construct a surrogate model of the fusion center&#39;s decision model. We propose a generic algorithm to create malicious sensing data using this surrogate model. Our real-world experiments show that the LEB attack is effective to beat a wide range of existing defense strategies with an up to 82% of success ratio. Given the gap between the proposed LEB attack and existing defenses, we introduce a non-invasive method named as influence-limiting defense, which can coexist with existing defenses to defend against LEB attack or other similar attacks. We show that this defense is highly effective and reduces the overall disruption ratio of LEB attack by up to 80%.

preprint2019arXiv

Fundamental Rate Limits of UAV-Enabled Multiple Access Channel with Trajectory Optimization

This paper studies an unmanned aerial vehicle (UAV)-enabled multiple access channel (MAC), in which multiple ground users transmit individual messages to a mobile UAV in the sky. We consider a linear topology scenario, where these users locate in a straight line and the UAV flies at a fixed altitude above the line connecting them. Under this setup, we jointly optimize the one-dimensional (1D) UAV trajectory and wireless resource allocation to reveal the fundamental rate limits of the UAV-enabled MAC, under the users&#39; individual maximum power constraints and the UAV&#39;s maximum flight speed constraints. First, we consider the capacity-achieving non-orthogonal multiple access (NOMA) transmission with successive interference cancellation (SIC) at the UAV receiver. In this case, we characterize the capacity region by maximizing the average sum-rate of users subject to rate profile constraints. To optimally solve this highly non-convex problem, we transform the original speed-constrained trajectory optimization problem into a speed-free problem that is optimally solvable via the Lagrange dual decomposition. It is rigorously proved that the optimal 1D trajectory solution follows the successive hover-and-fly (SHF) structure. Next, we consider two orthogonal multiple access (OMA) transmission schemes, i.e., frequency-division multiple access (FDMA) and time-division multiple access (TDMA). We maximize the achievable rate regions in the two cases by jointly optimizing the 1D trajectory design and wireless resource (frequency/time) allocation. It is shown that the optimal trajectory solutions still follow the SHF structure but with different hovering locations. Finally, numerical results show that the proposed optimal trajectory designs achieve considerable rate gains over other benchmark schemes, and the capacity region achieved by NOMA significantly outperforms the rate regions by FDMA and TDMA.

preprint2019arXiv

Joint 3D Maneuver and Power Adaptation for Secure UAV Communication with CoMP Reception

This paper studies a secrecy unmanned aerial vehicle (UAV) communication system with coordinated multi-point (CoMP) reception, in which one UAV sends confidential messages to a set of cooperative ground receivers (GRs), in the presence of several suspicious eavesdroppers. In particular, we consider two types of eavesdroppers that are non-colluding and colluding, respectively. Under this setup, we exploit the UAV&#39;s maneuver in three dimensional (3D) space together with transmit power adaptation for optimizing the secrecy communication performance. First, we consider the quasi-stationary UAV scenario, where we jointly optimize the UAV&#39;s 3D placement and transmit power control to maximize the secrecy rate. Under both non-colluding and colluding eavesdroppers, we obtain the optimal solutions to the joint 3D placement and transmit power control problems in well structures. Next, we consider the mobile UAV scenario, where we jointly optimize the UAV&#39;s 3D trajectory and transmit power allocation to maximize the average secrecy rate during the whole communication period. To deal with the difficult joint 3D trajectory and transmit power allocation problems, we present alternating-optimization-based approaches to obtain high-quality solutions. Finally, we provide numerical results to validate the performance of our proposed designs. It is shown that due to the consideration of CoMP reception, our proposed design with 3D maneuver significantly outperforms the conventional design with two dimensional (2D) (horizontal) maneuver only, by exploiting the additional degrees of freedom in altitudes. It is also shown that the non-colluding and colluding eavesdroppers lead to distinct 3D UAV maneuver behaviors.