Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
78works
0followers
44topics
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

COSMOS: Model-Agnostic Personalized Federated Learning with Clustered Server Models and Pseudo-Label-Only Communication

Federated learning (FL) in heterogeneous environments remains challenging because client models often differ in both architecture and data distribution. While recent approaches attempt to address this challenge through client clustering and knowledge distillation, simultaneously handling architectural and statistical heterogeneity remains difficult. We introduce COSMOS, a model-agnostic framework that enables server-side personalization using only pseudo-label communication. Clients train local models and predict on the public data; the server clusters clients by prediction similarity, trains a cluster-specific model for each group using its own compute, and distills the resulting models back to clients. We provide the first theoretical analysis showing that distillation from the learned cluster models can yield exponential personalization risk contraction, going beyond the convergence-to-stationarity guarantees typically provided in model-agnostic FL. Experiments across benchmarks demonstrate that COSMOS consistently outperforms all model-agnostic FL baselines while remaining competitive with state-of-the-art personalized FL methods. More broadly, our results highlight personalized server-side learning with pseudo-labels as a promising paradigm for scalable and model-agnostic federated learning in highly heterogeneous environments.

preprint2026arXiv

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar

This paper investigates a Halpern acceleration of the inexact proximal point method for solving maximal monotone inclusion problems in Hilbert spaces. The proposed Halpern inexact proximal point method (HiPPM) is shown to be globally convergent, and a unified framework is developed to analyze its worst-case convergence behavior. Under mild conditions on the inexactness tolerances, HiPPM achieves an $\mathcal{O}(1/k^{2})$ convergence rate in terms of the squared fixed-point residual. Moreover, under additional well-studied regularity conditions, the method attains a fast linear convergence rate. Building on this framework, we further extend the Halpern acceleration to the inexact augmented Lagrangian method for constrained convex optimization. In the spirit of Rockafellar's classical results, the resulting accelerated inexact augmented Lagrangian method inherits the convergence rate and iteration complexity guarantees of HiPPM. Numerical experiments are provided to support the theoretical findings.

preprint2026arXiv

Low Rank Adaptation for Adversarial Perturbation

Low-Rank Adaptation (LoRA), which leverages the insight that model updates typically reside in a low-dimensional space, has significantly improved the training efficiency of Large Language Models (LLMs) by updating neural network layers using low-rank matrices. Since the generation of adversarial examples is an optimization process analogous to model training, this naturally raises the question: Do adversarial perturbations exhibit a similar low-rank structure? In this paper, we provide both theoretical analysis and extensive empirical investigation across various attack methods, model architectures, and datasets to show that adversarial perturbations indeed possess an inherently low-rank structure. This insight opens up new opportunities for improving both adversarial attacks and defenses. We mainly focus on leveraging this low-rank property to improve the efficiency and effectiveness of black-box adversarial attacks, which often suffer from excessive query requirements. Our method follows a two-step approach. First, we use a reference model and auxiliary data to guide the projection of gradients into a low-dimensional subspace. Next, we confine the perturbation search in black-box attacks to this low-rank subspace, significantly improving the efficiency and effectiveness of the adversarial attacks. We evaluated our approach across a range of attack methods, benchmark models, datasets, and threat models. The results demonstrate substantial and consistent improvements in the performance of our low-rank adversarial attacks compared to conventional methods.

preprint2026arXiv

MoCapAnything V2: End-to-End Motion Capture for Arbitrary Skeletons

Recent methods for arbitrary-skeleton motion capture from monocular video follow a factorized pipeline, where a Video-to-Pose network predicts joint positions and an analytical inverse-kinematics (IK) stage recovers joint rotations. While effective, this design is inherently limited, since joint positions do not fully determine rotations and leave degrees of freedom such as bone-axis twist ambiguous, and the non-differentiable IK stage prevents the system from adapting to noisy predictions or optimizing for the final animation objective. In this work, we present the first fully end-to-end framework in which both Video-to-Pose and Pose-to-Rotation are learnable and jointly optimized. We observe that the ambiguity in pose-to-rotation mapping arises from missing coordinate system information: the same joint positions can correspond to different rotations under different rest poses and local axis conventions. To resolve this, we introduce a reference pose-rotation pair from the target asset, which, together with the rest pose, not only anchors the mapping but also defines the underlying rotation coordinate system. This formulation turns rotation prediction into a well-constrained conditional problem and enables effective learning. In addition, our model predicts joint positions directly from video without relying on mesh intermediates, improving both robustness and efficiency. Both stages share a skeleton-aware Global-Local Graph-guided Multi-Head Attention (GL-GMHA) module for joint-level local reasoning and global coordination. Experiments on Truebones Zoo and Objaverse show that our method reduces rotation error from ~17 degrees to ~10 degrees, and to 6.54 degrees on unseen skeletons, while achieving ~20x faster inference than mesh-based pipelines. Project page: https://animotionlab.github.io/MoCapAnythingV2/

preprint2026arXiv

ReasAlign: Reasoning Enhanced Safety Alignment against Prompt Injection Attack

Large Language Models (LLMs) have enabled the development of powerful agentic systems capable of automating complex workflows across various fields. However, these systems are highly vulnerable to indirect prompt injection attacks, where malicious instructions embedded in external data can hijack agent behavior. In this work, we present ReasAlign, a model-level solution to improve safety alignment against indirect prompt injection attacks. The core idea of ReasAlign is to incorporate structured reasoning steps to analyze user queries, detect conflicting instructions, and preserve the continuity of the user's intended tasks to defend against indirect injection attacks. To further ensure reasoning logic and accuracy, we introduce a test-time scaling mechanism with a preference-optimized judge model that scores reasoning steps and selects the best trajectory. Comprehensive evaluations across various benchmarks show that ReasAlign maintains utility comparable to an undefended model while consistently outperforming Meta SecAlign, the strongest prior guardrail. On the representative open-ended CyberSecEval2 benchmark, which includes multiple prompt-injected tasks, ReasAlign achieves 94.6% utility and only 3.6% ASR, far surpassing the state-of-the-art defensive model of Meta SecAlign (56.4% utility and 74.4% ASR). These results demonstrate that ReasAlign achieves the best trade-off between security and utility, establishing a robust and practical defense against prompt injection attacks in real-world agentic systems. Our code and experimental results could be found at https://github.com/leolee99/ReasAlign.

preprint2026arXiv

UHR-Micro: Diagnosing and Mitigating the Resolution Illusion in Earth Observation VLMs

Vision-Language Models (VLMs) increasingly operate on ultra-high-resolution (UHR) Earth observation imagery, yet they remain vulnerable to a severe scale mismatch between large-scale scene context and micro-scale targets. We refer to this empirical gap as a "resolution illusion": higher input resolution provides the appearance of richer visual detail, but does not necessarily yield reliable perception of spatially small, task-relevant evidence. To benchmark this challenge, we introduce UHR-Micro, a benchmark comprising 11,253 instructions grounded in 1,212 UHR images, designed to evaluate VLMs at the spatial limits of native Earth observation imagery. UHR-Micro spans diverse micro-target scales, context requirements, task families, and visual conditions, and provides diagnostic annotations that support controlled evaluation and fine-grained error attribution. Experiments with representative high-resolution VLMs show substantial failures in spatial grounding and evidence parsing, despite access to high-resolution inputs. Further analysis suggests that these failures are not fully resolved by increasing model capacity, but are closely tied to insufficient guidance in locating and using task-relevant micro-evidence. Motivated by this finding, we propose Micro-evidence Active Perception (MAP), a reference agent that decomposes queries into evidence-seeking steps, actively inspects candidate regions, and grounds its answers in localized observations. MAP-Agent improves micro-level perception by making high-resolution reasoning evidence-centered rather than image-centered. Together, UHR-Micro and MAP-Agent provide a diagnostic platform for evaluating, understanding, and advancing high-resolution reasoning in Earth observation VLMs. Datasets and source code were released at https://github.com/MiliLab/UHR-Micro.

preprint2023arXiv

Artificial intelligence for diagnosing and predicting survival of patients with renal cell carcinoma: Retrospective multi-center study

Background: Clear cell renal cell carcinoma (ccRCC) is the most common renal-related tumor with high heterogeneity. There is still an urgent need for novel diagnostic and prognostic biomarkers for ccRCC. Methods: We proposed a weakly-supervised deep learning strategy using conventional histology of 1752 whole slide images from multiple centers. Our study was demonstrated through internal cross-validation and external validations for the deep learning-based models. Results: Automatic diagnosis for ccRCC through intelligent subtyping of renal cell carcinoma was proved in this study. Our graderisk achieved aera the curve (AUC) of 0.840 (95% confidence interval: 0.805-0.871) in the TCGA cohort, 0.840 (0.805-0.871) in the General cohort, and 0.840 (0.805-0.871) in the CPTAC cohort for the recognition of high-grade tumor. The OSrisk for the prediction of 5-year survival status achieved AUC of 0.784 (0.746-0.819) in the TCGA cohort, which was further verified in the independent General cohort and the CPTAC cohort, with AUC of 0.774 (0.723-0.820) and 0.702 (0.632-0.765), respectively. Cox regression analysis indicated that graderisk, OSrisk, tumor grade, and tumor stage were found to be independent prognostic factors, which were further incorporated into the competing-risk nomogram (CRN). Kaplan-Meier survival analyses further illustrated that our CRN could significantly distinguish patients with high survival risk, with hazard ratio of 5.664 (3.893-8.239, p < 0.0001) in the TCGA cohort, 35.740 (5.889-216.900, p < 0.0001) in the General cohort and 6.107 (1.815 to 20.540, p < 0.0001) in the CPTAC cohort. Comparison analyses conformed that our CRN outperformed current prognosis indicators in the prediction of survival status, with higher concordance index for clinical prognosis.

preprint2023arXiv

Beef up mmWave Dense Cellular Networks with D2D-Assisted Cooperative Edge Caching

Edge caching is emerging as the most promising solution to reduce the content retrieval delay and relieve the huge burden on the backhaul links in the ultra-dense networks by proactive caching popular contents in the small base station (SBS). However, constraint cache resource of individual SBSs significantly throttles the performance of edge caching. In this paper, we propose a device-to-device (D2D) assisted cooperative edge caching (DCEC) policy for millimeter (mmWave) dense networks, which cooperatively utilizes the cache resource of users and SBSs in proximity. In the proposed DCEC policy, a content can be cached in either users&#39; devices or SBSs according to the content popularity, and a user can retrieve the requested content from neighboring users via D2D links or the neighboring SBSs via cellular links to efficiently exploit the cache diversity. Unlike existing cooperative caching policies in the lower frequency bands that require complex interference management techniques to suppress interference, we take advantage of directional antenna in mmWave systems to ensure high transmission rate whereas mitigating interference footprint. Taking the practical directional antenna model and the network density into consideration, we derive closed-form expressions of the backhaul offloading performance and content retrieval delay based on the stochastic information of network topology. In addition, analytical results indicate that, with the increase of the network density, the content retrieval delay via D2D links increases significantly while that via cellular links increases slightly. Comprehensive simulations validate our theoretical analysis and demonstrate that the proposed policy can achieve higher performance in offloading the backhaul traffic and reducing the content retrieval delay compared with the state-of-the-art most popular caching (MPC) policy.

preprint2023arXiv

HSTFormer: Hierarchical Spatial-Temporal Transformers for 3D Human Pose Estimation

Transformer-based approaches have been successfully proposed for 3D human pose estimation (HPE) from 2D pose sequence and achieved state-of-the-art (SOTA) performance. However, current SOTAs have difficulties in modeling spatial-temporal correlations of joints at different levels simultaneously. This is due to the poses&#39; spatial-temporal complexity. Poses move at various speeds temporarily with various joints and body-parts movement spatially. Hence, a cookie-cutter transformer is non-adaptable and can hardly meet the &#34;in-the-wild&#34; requirement. To mitigate this issue, we propose Hierarchical Spatial-Temporal transFormers (HSTFormer) to capture multi-level joints&#39; spatial-temporal correlations from local to global gradually for accurate 3D HPE. HSTFormer consists of four transformer encoders (TEs) and a fusion module. To the best of our knowledge, HSTFormer is the first to study hierarchical TEs with multi-level fusion. Extensive experiments on three datasets (i.e., Human3.6M, MPI-INF-3DHP, and HumanEva) demonstrate that HSTFormer achieves competitive and consistent performance on benchmarks with various scales and difficulties. Specifically, it surpasses recent SOTAs on the challenging MPI-INF-3DHP dataset and small-scale HumanEva dataset, with a highly generalized systematic approach. The code is available at: https://github.com/qianxiaoye825/HSTFormer.

preprint2023arXiv

Performance Analysis and Enhancement of Beamforming Training in 802.11ad

Beamforming (BF) training is crucial to establishing reliable millimeter-wave communication connections between stations (STAs) and an access point. In IEEE 802.11ad BF training protocol, all STAs contend for limited BF training opportunities, i.e., associated BF training (A-BFT) slots, which results in severe collisions and significant BF training latency, especially in dense user scenarios. In this paper, we first develop an analytical model to evaluate the BF training protocol performance. Our analytical model accounts for various protocol components, including user density, the number of A-BFT slots, and protocol parameters, i.e., retry limit and contention window size. We then derive the average successful BF training probability, the BF training efficiency and latency. Since the derived BF training efficiency is an implicit function, to reveal the relationship between system parameters and BF training performance, we also derive an approximate expression of BF training efficiency. Theoretical analysis indicates that the BF training efficiency degrades drastically in dense user scenarios. To address this issue, we propose an enhancement scheme which adaptively adjusts the protocol parameters in tune with user density, to improve the BF training performance in dense user scenarios. Extensive simulations are carried out to validate the accuracy of the developed analytical model. In addition, simulation results show that the proposed enhancement scheme can improve the BF training efficiency by 35% in dense user scenarios.

preprint2022arXiv

A Knowledge-Based Decision Support System for In Vitro Fertilization Treatment

In Vitro Fertilization (IVF) is the most widely used Assisted Reproductive Technology (ART). IVF usually involves controlled ovarian stimulation, oocyte retrieval, fertilization in the laboratory with subsequent embryo transfer. The first two steps correspond with follicular phase of females and ovulation in their menstrual cycle. Therefore, we refer to it as the treatment cycle in our paper. The treatment cycle is crucial because the stimulation medications in IVF treatment are applied directly on patients. In order to optimize the stimulation effects and lower the side effects of the stimulation medications, prompt treatment adjustments are in need. In addition, the quality and quantity of the retrieved oocytes have a significant effect on the outcome of the following procedures. To improve the IVF success rate, we propose a knowledge-based decision support system that can provide medical advice on the treatment protocol and medication adjustment for each patient visit during IVF treatment cycle. Our system is efficient in data processing and light-weighted which can be easily embedded into electronic medical record systems. Moreover, an oocyte retrieval oriented evaluation demonstrates that our system performs well in terms of accuracy of advice for the protocols and medications.

preprint2022arXiv

A Multi-factor Multi-level and Interaction based (M2I) Authentication Framework for Internet of Things (IoT) Applications

Existing authentication solutions proposed for Internet of Things (IoT) provide a single Level of Assurance (LoA) regardless of the sensitivity levels of the resources or interactions between IoT devices being protected. For effective (with adequate level of protection) and efficient (with as low overhead costs as possible) protections, it may be desirable to tailor the protection level in response to the sensitivity level of the resources, as a stronger protection level typically imposes a higher level of overheads costs. In this paper, we investigate how to facilitate multi-LoA authentication for IoT by proposing a multi-factor multi-level and interaction based (M2I) authentication framework. The framework implements LoA linked and interaction based authentication. Two interaction modes are investigated, P2P (Peer-to-Peer) and O2M (One-to-Many) via the design of two corresponding protocols. Evaluation results show that adopting the O2M interaction mode in authentication can cut communication cost significantly; compared with that of the Kerberos protocol, the O2M protocol reduces the communication cost by 42% ~ 45%. The protocols also introduce less computational cost. The P2P and O2M protocol, respectively, reduce the computational cost by 70% ~ 72% and 81% ~ 82% in comparison with that of Kerberos. Evaluation results also show that the two factor authentication option costs twice as much as that of the one-factor option.

preprint2022arXiv

A Survey on Metaverse: Fundamentals, Security, and Privacy

Metaverse, as an evolving paradigm of the next-generation Internet, aims to build a fully immersive, hyper spatiotemporal, and self-sustaining virtual shared space for humans to play, work, and socialize. Driven by recent advances in emerging technologies such as extended reality, artificial intelligence, and blockchain, metaverse is stepping from science fiction to an upcoming reality. However, severe privacy invasions and security breaches (inherited from underlying technologies or emerged in the new digital ecology) of metaverse can impede its wide deployment. At the same time, a series of fundamental challenges (e.g., scalability and interoperability) can arise in metaverse security provisioning owing to the intrinsic characteristics of metaverse, such as immersive realism, hyper spatiotemporality, sustainability, and heterogeneity. In this paper, we present a comprehensive survey of the fundamentals, security, and privacy of metaverse. Specifically, we first investigate a novel distributed metaverse architecture and its key characteristics with ternary-world interactions. Then, we discuss the security and privacy threats, present the critical challenges of metaverse systems, and review the state-of-the-art countermeasures. Finally, we draw open research directions for building future metaverse systems.

preprint2022arXiv

Accurate and Robust Lesion RECIST Diameter Prediction and Segmentation with Transformers

Automatically measuring lesion/tumor size with RECIST (Response Evaluation Criteria In Solid Tumors) diameters and segmentation is important for computer-aided diagnosis. Although it has been studied in recent years, there is still space to improve its accuracy and robustness, such as (1) enhancing features by incorporating rich contextual information while keeping a high spatial resolution and (2) involving new tasks and losses for joint optimization. To reach this goal, this paper proposes a transformer-based network (MeaFormer, Measurement transFormer) for lesion RECIST diameter prediction and segmentation (LRDPS). It is formulated as three correlative and complementary tasks: lesion segmentation, heatmap prediction, and keypoint regression. To the best of our knowledge, it is the first time to use keypoint regression for RECIST diameter prediction. MeaFormer can enhance high-resolution features by employing transformers to capture their long-range dependencies. Two consistency losses are introduced to explicitly build relationships among these tasks for better optimization. Experiments show that MeaFormer achieves the state-of-the-art performance of LRDPS on the large-scale DeepLesion dataset and produces promising results of two downstream clinic-relevant tasks, i.e., 3D lesion segmentation and RECIST assessment in longitudinal studies.

preprint2022arXiv

Age of Information with Hybrid-ARQ: A Unified Explicit Result

Delivering timely status updates in a timeliness-critical communication system is of paramount importance to assist accurate and efficient decision making. Therefore, the topic of analyzing Age of Information has aroused new research interest. This paper contributes to new results in this area by systematically analyzing the AoI of two types of Hybrid Automatic Repeat reQuest (HARQ) techniques that have been newly standardized in the Release-16 5G New Radio (NR) specifications, namely reactive HARQ and proactive HARQ. Under a code-based status update system with non-trivial coding delay, transmission delay, propagation delay, decoding delay, and feedback delay, we derive unified closed-form average AoI and average Peak AoI expressions for reactive HARQ and proactive HARQ, respectively. Based on the obtained explicit expressions, we formulate an AoI minimization problem to investigate the age-optimal codeblock assignment strategy in the finite block-length (FBL) regime. Through case studies and analytical results, we provide comparative insights between reactive HARQ and proactive HARQ from a perspective of freshness of information. The numerical results and optimization solutions show that proactive HARQ draws its strength from both age performance and system robustness, thus enabling the potential to provide new system advancement of a freshness-critical status update system.

preprint2022arXiv

CommerceMM: Large-Scale Commerce MultiModal Representation Learning with Omni Retrieval

We introduce CommerceMM - a multimodal model capable of providing a diverse and granular understanding of commerce topics associated to the given piece of content (image, text, image+text), and having the capability to generalize to a wide range of tasks, including Multimodal Categorization, Image-Text Retrieval, Query-to-Product Retrieval, Image-to-Product Retrieval, etc. We follow the pre-training + fine-tuning training regime and present 5 effective pre-training tasks on image-text pairs. To embrace more common and diverse commerce data with text-to-multimodal, image-to-multimodal, and multimodal-to-multimodal mapping, we propose another 9 novel cross-modal and cross-pair retrieval tasks, called Omni-Retrieval pre-training. The pre-training is conducted in an efficient manner with only two forward/backward updates for the combined 14 tasks. Extensive experiments and analysis show the effectiveness of each task. When combining all pre-training tasks, our model achieves state-of-the-art performance on 7 commerce-related downstream tasks after fine-tuning. Additionally, we propose a novel approach of modality randomization to dynamically adjust our model under different efficiency constraints.

preprint2022arXiv

Cost-Effective Two-Stage Network Slicing for Edge-Cloud Orchestrated Vehicular Networks

In this paper, we study a network slicing problem for edge-cloud orchestrated vehicular networks, in which the edge and cloud servers are orchestrated to process computation tasks for reducing network slicing cost while satisfying the quality of service requirements. We propose a two-stage network slicing framework, which consists of 1) network planning stage in a large timescale to perform slice deployment, edge resource provisioning, and cloud resource provisioning, and 2) network operation stage in a small timescale to perform resource allocation and task dispatching. Particularly, we formulate the network slicing problem as a two-timescale stochastic optimization problem to minimize the network slicing cost. Since the problem is NP-hard due to coupled network planning and network operation stages, we develop a Two timescAle netWork Slicing (TAWS) algorithm by collaboratively integrating reinforcement learning (RL) and optimization methods, which can jointly make network planning and operation decisions. Specifically, by leveraging the timescale separation property of decisions, we decouple the problem into a large-timescale network planning subproblem and a small-timescale network operation subproblem. The former is solved by an RL method, and the latter is solved by an optimization method. Simulation results based on real-world vehicle traffic traces show that the TAWS can effectively reduce the network slicing cost as compared to the benchmark scheme.

preprint2022arXiv

Counteracting Dark Web Text-Based CAPTCHA with Generative Adversarial Learning for Proactive Cyber Threat Intelligence

Automated monitoring of dark web (DW) platforms on a large scale is the first step toward developing proactive Cyber Threat Intelligence (CTI). While there are efficient methods for collecting data from the surface web, large-scale dark web data collection is often hindered by anti-crawling measures. In particular, text-based CAPTCHA serves as the most prevalent and prohibiting type of these measures in the dark web. Text-based CAPTCHA identifies and blocks automated crawlers by forcing the user to enter a combination of hard-to-recognize alphanumeric characters. In the dark web, CAPTCHA images are meticulously designed with additional background noise and variable character length to prevent automated CAPTCHA breaking. Existing automated CAPTCHA breaking methods have difficulties in overcoming these dark web challenges. As such, solving dark web text-based CAPTCHA has been relying heavily on human involvement, which is labor-intensive and time-consuming. In this study, we propose a novel framework for automated breaking of dark web CAPTCHA to facilitate dark web data collection. This framework encompasses a novel generative method to recognize dark web text-based CAPTCHA with noisy background and variable character length. To eliminate the need for human involvement, the proposed framework utilizes Generative Adversarial Network (GAN) to counteract dark web background noise and leverages an enhanced character segmentation algorithm to handle CAPTCHA images with variable character length. Our proposed framework, DW-GAN, was systematically evaluated on multiple dark web CAPTCHA testbeds. DW-GAN significantly outperformed the state-of-the-art benchmark methods on all datasets, achieving over 94.4% success rate on a carefully collected real-world dark web dataset...

preprint2022arXiv

D3PG: Dirichlet DDPG for Task Partitioning and Offloading with Constrained Hybrid Action Space in Mobile Edge Computing

Mobile Edge Computing (MEC) has been regarded as a promising paradigm to reduce service latency for data processing in the Internet of Things, by provisioning computing resources at the network edge. In this work, we jointly optimize the task partitioning and computational power allocation for computation offloading in a dynamic environment with multiple IoT devices and multiple edge servers. We formulate the problem as a Markov decision process with constrained hybrid action space, which cannot be well handled by existing deep reinforcement learning (DRL) algorithms. Therefore, we develop a novel Deep Reinforcement Learning called Dirichlet Deep Deterministic Policy Gradient (D3PG), which is built on Deep Deterministic Policy Gradient (DDPG) to solve the problem. The developed model can learn to solve multi-objective optimization, including maximizing the number of tasks processed before expiration and minimizing the energy cost and service latency.} More importantly, D3PG can effectively deal with constrained distribution-continuous hybrid action space, where the distribution variables are for the task partitioning and offloading, while the continuous variables are for computational frequency control. Moreover, the D3PG can address many similar issues in MEC and general reinforcement learning problems. Extensive simulation results show that the proposed D3PG outperforms the state-of-art methods.

preprint2022arXiv

DistrEdge: Speeding up Convolutional Neural Network Inference on Distributed Edge Devices

As the number of edge devices with computing resources (e.g., embedded GPUs, mobile phones, and laptops) increases, recent studies demonstrate that it can be beneficial to collaboratively run convolutional neural network (CNN) inference on more than one edge device. However, these studies make strong assumptions on the devices&#39; conditions, and their application is far from practical. In this work, we propose a general method, called DistrEdge, to provide CNN inference distribution strategies in environments with multiple IoT edge devices. By addressing heterogeneity in devices, network conditions, and nonlinear characters of CNN computation, DistrEdge is adaptive to a wide range of cases (e.g., with different network conditions, various device types) using deep reinforcement learning technology. We utilize the latest embedded AI computing devices (e.g., NVIDIA Jetson products) to construct cases of heterogeneous devices&#39; types in the experiment. Based on our evaluations, DistrEdge can properly adjust the distribution strategy according to the devices&#39; computing characters and the network conditions. It achieves 1.1 to 3x speedup compared to state-of-the-art methods.

preprint2022arXiv

Enabling Long-Term Cooperation in Cross-Silo Federated Learning: A Repeated Game Perspective

Cross-silo federated learning (FL) is a distributed learning approach where clients of the same interest train a global model cooperatively while keeping their local data private. The success of a cross-silo FL process requires active participation of many clients. Clients in cross-silo FL aim to optimize their long-term benefits by selfishly choosing their participation levels. While there has been some work on incentivizing clients to join FL, the analysis of clients&#39; long-term selfish participation behaviors in cross-silo FL remains largely unexplored. In this paper, we analyze the selfish participation behaviors of heterogeneous clients in cross-silo FL. Specifically, we model clients&#39; long-term selfish participation behaviors as an infinitely repeated game. For the stage game SPFL, we derive the unique Nash equilibrium (NE), and propose a distributed algorithm for each client to calculate its equilibrium participation strategy. We show that at the NE, clients fall into at most three categories: (i) free riders, (ii) a unique partial contributor (if exists), and (iii) contributors. For the long-term interactions among clients, we derive a cooperative strategy for clients which minimizes the number of free riders while increasing the amount of local data for model training. We show that enforced by a punishment strategy, such a cooperative strategy is a subgame perfect Nash equilibrium (SPNE) of the infinitely repeated game, under which some clients who are free riders at the NE of the stage game choose to be (partial) contributors. We further propose an algorithm to calculate the optimal SPNE which minimizes the number of free riders while maximizing the amount of local data for model training. Simulation results show that our derived optimal SPNE can effectively reduce the number of free riders by up to 99.3% and increase the amount of local data for model training by up to 82.3%.

preprint2022arXiv

FadMan: Federated Anomaly Detection across Multiple Attributed Networks

Anomaly subgraph detection has been widely used in various applications, ranging from cyber attack in computer networks to malicious activities in social networks. Despite an increasing need for federated anomaly detection across multiple attributed networks, only a limited number of approaches are available for this problem. Federated anomaly detection faces two major challenges. One is that isolated data in most industries are restricted share with others for data privacy and security. The other is most of the centralized approaches training based on data integration. The main idea of federated anomaly detection is aligning private anomalies from local data owners on the public anomalies from the attributed network in the server through public anomalies to federate local anomalies. In each private attributed network, the detected anomaly subgraph is aligned with an anomaly subgraph in the public attributed network. The significant public anomaly subgraphs are selected for federated private anomalies while preventing local private data leakage. The proposed algorithm FadMan is a vertical federated learning framework for public node aligned with many private nodes of different features, and is validated on two tasks correlated anomaly detection on multiple attributed networks and anomaly detection on an attributeless network using five real-world datasets. In the first scenario, FadMan outperforms competitive methods by at least 12% accuracy at 10% noise level. In the second scenario, by analyzing the distribution of abnormal nodes, we find that the nodes of traffic anomalies are associated with the event of postgraduate entrance examination on the same day.

preprint2022arXiv

Gridless Multisnapshot Variational Line Spectral Estimation from Coarsely Quantized Samples

Due to the increasing demand for low power and higher sampling rates, low resolution quantization for data acquisition has drawn great attention recently. Consequently, line spectral estimation (LSE) with multiple measurement vectors (MMVs) from coarsely quantized samples is of vital importance in cutting edge array signal processing applications such as range estimation and DOA estimation in millimeter wave radar systems. In this paper, we combine the low complexity gridless variational line spectral estimation (VALSE) and expectation propagation (EP) and propose an MVALSE-EP algorithm to estimate the frequencies from coarsely quantized samples. In addition, the Cramér Rao bound (CRB) is derived as a benchmark performance of the proposed algorithm, and insights are provided to reveal the effects of system parameters on estimation performance. It is shown that snapshots benefits the frequency estimation, especially in coarsely quantized scenarios. Numerical experiments are conducted to demonstrate the effectiveness of MVALSE-EP, including real data set.

preprint2022arXiv

Hierarchical BERT for Medical Document Understanding

Medical document understanding has gained much attention recently. One representative task is the International Classification of Disease (ICD) diagnosis code assignment. Existing work adopts either RNN or CNN as the backbone network because the vanilla BERT cannot handle well long documents (>2000 to kens). One issue shared across all these approaches is that they are over specific to the ICD code assignment task, losing generality to give the whole document-level and sentence-level embedding. As a result, it is not straight-forward to direct them to other downstream NLU tasks. Motivated by these observations, we propose Medical Document BERT (MDBERT) for long medical document understanding tasks. MDBERT is not only effective in learning representations at different levels of semantics but efficient in encoding long documents by leveraging a bottom-up hierarchical architecture. Compared to vanilla BERT solutions: 1, MDBERT boosts the performance up to relatively 20% on the MIMIC-III dataset, making it comparable to current SOTA solutions; 2, it cuts the computational complexity on self-attention modules to less than 1/100. Other than the ICD code assignment, we conduct a variety of other NLU tasks on a large commercial dataset named as TrialTrove, to showcase MDBERT&#39;s strength in delivering different levels of semantics.

preprint2022arXiv

Holomorphic line bundles on the loop space of the Riemann sphere

The loop space $L\mathbb{P}_1$ of the Riemann sphere consisting of all $C^k$ or Sobolev $W^{k,p}$ maps from the circle $S^1$ to $\mathbb{P}_1$ is an infinite dimensional complex manifold. The loop group $LPGL(2,\mathbb{C})$ acts on $L\mathbb{P}_1$ . We prove that the group of $LPGL(2,\mathbb{C})$ invariant holomorphic line bundles on $L\mathbb{P}_1$ is isomorphic to an infinite dimensional Lie group. Further, we prove that the space of holomorphic sections of these bundles is finite dimensional, and compute the dimension for a generic bundle.

preprint2022arXiv

Integration of Blockchain and Edge Computing in Internet of Things: A Survey

As an important technology to ensure data security, consistency, traceability, etc., blockchain has been increasingly used in Internet of Things (IoT) applications. The integration of blockchain and edge computing can further improve the resource utilization in terms of network, computing, storage, and security. This paper aims to present a survey on the integration of blockchain and edge computing. In particular, we first give an overview of blockchain and edge computing. We then present a general architecture of an integration of blockchain and edge computing system. We next study how to utilize blockchain to benefit edge computing, as well as how to use edge computing to benefit blockchain. We also discuss the issues brought by the integration of blockchain and edge computing system and solutions from perspectives of resource management, joint optimization, data management, computation offloading and security mechanism. Finally, we analyze and summarize the existing challenges posed by the integration of blockchain and edge computing system and the potential solutions in the future.

preprint2022arXiv

LoopITR: Combining Dual and Cross Encoder Architectures for Image-Text Retrieval

Dual encoders and cross encoders have been widely used for image-text retrieval. Between the two, the dual encoder encodes the image and text independently followed by a dot product, while the cross encoder jointly feeds image and text as the input and performs dense multi-modal fusion. These two architectures are typically modeled separately without interaction. In this work, we propose LoopITR, which combines them in the same network for joint learning. Specifically, we let the dual encoder provide hard negatives to the cross encoder, and use the more discriminative cross encoder to distill its predictions back to the dual encoder. Both steps are efficiently performed together in the same model. Our work centers on empirical analyses of this combined architecture, putting the main focus on the design of the distillation objective. Our experimental results highlight the benefits of training the two encoders in the same network, and demonstrate that distillation can be quite effective with just a few hard negative examples. Experiments on two standard datasets (Flickr30K and COCO) show our approach achieves state-of-the-art dual encoder performance when compared with approaches using a similar amount of data.

preprint2022arXiv

Mobile Wireless Rechargeable UAV Networks: Challenges and Solutions

Unmanned aerial vehicles (UAVs) can help facilitate cost-effective and flexible service provisioning in future smart cities. Nevertheless, UAV applications generally suffer severe flight time limitations due to constrained onboard battery capacity, causing a necessity of frequent battery recharging or replacement when performing persistent missions. Utilizing wireless mobile chargers, such as vehicles with wireless charging equipment for on-demand self-recharging has been envisioned as a promising solution to address this issue. In this article, we present a comprehensive study of \underline{v}ehicle-assisted \underline{w}ireless rechargeable \underline{U}AV \underline{n}etworks (VWUNs) to promote on-demand, secure, and efficient UAV recharging services. Specifically, we first discuss the opportunities and challenges of deploying VWUNs and review state-of-the-art solutions in this field. We then propose a secure and privacy-preserving VWUN framework for UAVs and ground vehicles based on differential privacy (DP). Within this framework, an online double auction mechanism is developed for optimal charging scheduling, and a two-phase DP algorithm is devised to preserve the sensitive bidding and energy trading information of participants. Experimental results demonstrate that the proposed framework can effectively enhance charging efficiency and security. Finally, we outline promising directions for future research in this emerging field.

preprint2022arXiv

New Upper Bounds on the Error Probability under ML Decoding for Spinal Codes and the Joint Transmission-Decoding System Design

Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to analyze the bounds on the error probability of Spinal codes and design a joint transmission-decoding system. First, in the finite block-length regime, we derive new upper bounds on the Maximum Likelihood (ML) decoding error probability for Spinal codes over both the AWGN channel and the BSC. Then, based on the derived bounds, we formulate a rate maximization problem. As the solution exhibits an incremental-tail-transmission pattern, we propose an improved transmission scheme, referred to as the thresholded incremental tail transmission (TITT) scheme. Moreover, we also develop a dynamic TITT-matching decoding algorithm, called the bubble decoding with memory (BD-M) algorithm, to reduce the decoding time complexity. The TITT scheme at the transmitter and the BD-M algorithm at the receiver jointly constitute a dynamic transmission-decoding system for Spinal code, improving its rate performance and decoding throughput. Theoretical analysis and simulation results are provided to verify the superiority of the derived bounds and the proposed joint transmission-decoding system design.

preprint2022arXiv

Non-Markovian quantum thermometry

The rapidly developing quantum technologies and thermodynamics have put forward a requirement to precisely control and measure the temperature of microscopic matter at the quantum level. Many quantum thermometry schemes have been proposed. However, precisely measuring low temperature is still challenging because the obtained sensing errors generally tend to diverge with decreasing temperature. Using a continuous-variable system as a thermometer, we propose non-Markovian quantum thermometry to measure the temperature of a quantum reservoir. A mechanism to make the sensing error $δT$ scale with the temperature $T$ as the Landau bound $δT\simeq T$ in the full-temperature regime is discovered. Our analysis reveals that it is the quantum criticality of the total thermometer-reservoir system that causes this enhanced sensitivity. Efficiently avoiding the error-divergence problem, our result gives an efficient way to precisely measure the low temperature of quantum systems.

preprint2022arXiv

Nuclear spin self compensation system for moving MEG sensing with optical pumped atomic spin co-magnetometer

Recording the moving MEGs of a person in which a person&#39;s head could move freely as we record the brain&#39;s magnetic field is a hot topic in recent years. Traditionally, atomic magnetometers are utilized for moving MEGs recording and a large compensation coil system is utilized for background magnetic field compensation. Here we described a new potential candidate: an optically pumped atomic co-magnetometer(OPACM) for moving MEGs recording. In the OPACM, hyper-polarized nuclear spins could produce a magnetic field which will shield the background fluctuation low frequency magnetic field noise while the the fast changing MEGs signal could be recorded. The nuclear spins look like an automatic magnetic field shields and dynamically compensate the fluctuated background magnetic field noise. In this article, the magnetic field compensation is studied theoretically and we find that the compensation is closely related to several parameters such as the electron spin magnetic field, the nuclear spin magnetic field and the holding magnetic field. Based on the model, the magnetic field compensation could be optimized. We also experimentally studied the magnetic field compensation and the responses of the OPACM to different frequencies of magnetic field are measured. We show that the OPACM owns a clear suppression of low frequency magnetic field under 1Hz and response to magnetic field&#39;s frequencies around the band of the MEGs. Magnetic field sensitivity of $3fT/Hz^{1/2}$ has been achieved. Finally, we do a simulation for the OPACM as it is utilized for moving MEGs recording. For comparison, the traditional compensation system for moving MEGs recording is based on a coil which is around 2m in dimension while our compensation system is only 2mm in dimension. Moreover, our compensation system could work in situ and will not affect each other.

preprint2022arXiv

Reconfigurable Intelligent Surface With Energy Harvesting Assisted Cooperative Ambient Backscatter Communications

The performance of cooperative ambient backscatter communications (CABC) can be enhanced by employing reconfigurable intelligent surface (RIS) to assist backscatter transmitters. Since the RIS power consumption is a non-negligible issue, we consider a RIS assisted CABC system where the RIS with energy harvesting circuit can not only reflect signal but also harvest wireless energy. We study a transmission design problem to minimize the RIS power consumption with the quality of service constraints for both active and backscatter transmissions. The optimization problem is a mixed-integer non-convex programming problem which is NP-hard. To tackle it, an algorithm is proposed by employing the block coordinate descent, semidefinite relaxation and alternating direction method of multipliers techniques. Simulation results demonstrate the effectiveness of the proposed algorithm.

preprint2022arXiv

Reward Delay Attacks on Deep Reinforcement Learning

Most reinforcement learning algorithms implicitly assume strong synchrony. We present novel attacks targeting Q-learning that exploit a vulnerability entailed by this assumption by delaying the reward signal for a limited time period. We consider two types of attack goals: targeted attacks, which aim to cause a target policy to be learned, and untargeted attacks, which simply aim to induce a policy with a low reward. We evaluate the efficacy of the proposed attacks through a series of experiments. Our first observation is that reward-delay attacks are extremely effective when the goal is simply to minimize reward. Indeed, we find that even naive baseline reward-delay attacks are also highly successful in minimizing the reward. Targeted attacks, on the other hand, are more challenging, although we nevertheless demonstrate that the proposed approaches remain highly effective at achieving the attacker&#39;s targets. In addition, we introduce a second threat model that captures a minimal mitigation that ensures that rewards cannot be used out of sequence. We find that this mitigation remains insufficient to ensure robustness to attacks that delay, but preserve the order, of rewards.

preprint2022arXiv

Smart Director: An Event-Driven Directing System for Live Broadcasting

Live video broadcasting normally requires a multitude of skills and expertise with domain knowledge to enable multi-camera productions. As the number of cameras keep increasing, directing a live sports broadcast has now become more complicated and challenging than ever before. The broadcast directors need to be much more concentrated, responsive, and knowledgeable, during the production. To relieve the directors from their intensive efforts, we develop an innovative automated sports broadcast directing system, called Smart Director, which aims at mimicking the typical human-in-the-loop broadcasting process to automatically create near-professional broadcasting programs in real-time by using a set of advanced multi-view video analysis algorithms. Inspired by the so-called &#34;three-event&#34; construction of sports broadcast, we build our system with an event-driven pipeline consisting of three consecutive novel components: 1) the Multi-view Event Localization to detect events by modeling multi-view correlations, 2) the Multi-view Highlight Detection to rank camera views by the visual importance for view selection, 3) the Auto-Broadcasting Scheduler to control the production of broadcasting videos. To our best knowledge, our system is the first end-to-end automated directing system for multi-camera sports broadcasting, completely driven by the semantic understanding of sports events. It is also the first system to solve the novel problem of multi-view joint event detection by cross-view relation modeling. We conduct both objective and subjective evaluations on a real-world multi-camera soccer dataset, which demonstrate the quality of our auto-generated videos is comparable to that of the human-directed. Thanks to its faster response, our system is able to capture more fast-passing and short-duration events which are usually missed by human directors.

preprint2022arXiv

SOiCI and iCISO: Combining iterative configuration interaction with spin-orbit coupling in two ways

The near-exact iCIPT2 approach for strongly correlated systems of electrons, which stems from the combination of iterative configuration interaction (iCI, an exact solver of full CI) with configuration selection for static correlation and second-order perturbation theory (PT2) for dynamic correlation, is extended to the relativistic domain. In the spirit of spin separation, relativistic effects are treated in two steps: scalar relativity is treated by the infinite-order, spin-free part of the exact two-component (X2C) relativistic Hamiltonian, whereas spin-orbit coupling (SOC) is treated by the first-order, Douglas-Kroll-Hess-like SOC operator derived from the same X2C Hamiltonian. Two possible combinations of iCIPT2 with SOC are considered, i.e., SOiCI and iCISO. The former treats SOC and electron correlation on an equal footing, whereas the latter treats SOC in the spirit of state interaction, by constructing and diagonalizing an effective spin-orbit Hamiltonian matrix in a small number of correlated scalar states. Both double group and time reversal symmetries are incorporated to simplify the computation. Pilot applications reveal that SOiCI is very accurate for the spin-orbit splitting (SOS) of heavy atoms, whereas the computationally very cheap iCISO can safely be applied to the SOS of light atoms and even of systems containing heavy atoms when SOC is largely quenched by ligand fields.

preprint2022arXiv

Stability of China&#39;s Stock Market: Measure and Forecast by Ricci Curvature on Network

The systemic stability of a stock market is one of the core issues in the financial field. The market can be regarded as a complex network whose nodes are stocks connected by edges that signify their correlation strength. Since the market is a strongly nonlinear system, it is difficult to measure the macroscopic stability and depict market fluctuations in time. In this paper, we use a geometric measure derived from discrete Ricci curvature to capture the higher-order nonlinear architecture of financial networks. In order to confirm the effectiveness of our method, we use it to analyze the CSI 300 constituents of China&#39;s stock market from 2005--2020 and the systemic stability of the market is quantified through the network&#39;s Ricci type curvatures. Furthermore, we use a hybrid model to analyze the curvature time series and predict the future trends of the market accurately. As far as we know, this is the first paper to apply Ricci curvature to forecast the systemic stability of domestic stock market, and our results show that Ricci curvature has good explanatory power for the market stability and can be a good indicator to judge the future risk and volatility of the domestic market.

preprint2022arXiv

Temperature uncertainty relation in non-equilibrium thermodynamics

Temperature uncertainty of a quantum system in canonical ensemble is inversely determined by its energy fluctuation, which is known as the temperature-energy uncertainty relation. No such uncertainty relation was discovered for a non-equilibrium open quantum system. In this article, we derive a universal temperature uncertainty relation for general non-equilibrium processes. We find that it is the fluctuation of heat, which is defined as the change in bath energy, determines the temperature uncertainty in non-equilibrium case. Specifically, the heat is divided into trajectory heat and backaction heat, which are associated with the system&#39;s trajectory of evolution and the backaction of partial measurement on system, respectively. Based on this decomposition, we reveal that both correlations between system and bath&#39;s process function and state function are the resources for enhancing temperature precision. Our findings are conductive to design ultrahigh sensitive quantum thermometer.

preprint2022arXiv

The Picard group of the loop space of the Riemann sphere

The loop space of the Riemann sphere consisting of all $C^k$ or Sobolev $W^{k,p}$ maps from the circle $S^1$ to the sphere is an infinite dimensional complex manifold. We compute the Picard group of holomorphic line bundles on this loop space as an infinite dimensional complex Lie group with Lie algebra the first Dolbeault group. The group of Mobius transformations $G$ and its loop group $LG$ act on this loop space. We prove that an element of the Picard group is $LG$-fixed if it is $G$-fixed; thus completely answer the question by Millson and Zombro about $G$-equivariant projective embedding of the loop space of the Riemann sphere.

preprint2022arXiv

Towards Tailored Models on Private AIoT Devices: Federated Direct Neural Architecture Search

Neural networks often encounter various stringent resource constraints while deploying on edge devices. To tackle these problems with less human efforts, automated machine learning becomes popular in finding various neural architectures that fit diverse Artificial Intelligence of Things (AIoT) scenarios. Recently, to prevent the leakage of private information while enable automated machine intelligence, there is an emerging trend to integrate federated learning and neural architecture search (NAS). Although promising as it may seem, the coupling of difficulties from both tenets makes the algorithm development quite challenging. In particular, how to efficiently search the optimal neural architecture directly from massive non-independent and identically distributed (non-IID) data among AIoT devices in a federated manner is a hard nut to crack. In this paper, to tackle this challenge, by leveraging the advances in ProxylessNAS, we propose a Federated Direct Neural Architecture Search (FDNAS) framework that allows for hardware-friendly NAS from non- IID data across devices. To further adapt to both various data distributions and different types of devices with heterogeneous embedded hardware platforms, inspired by meta-learning, a Cluster Federated Direct Neural Architecture Search (CFDNAS) framework is proposed to achieve device-aware NAS, in the sense that each device can learn a tailored deep learning model for its particular data distribution and hardware constraint. Extensive experiments on non-IID datasets have shown the state-of-the-art accuracy-efficiency trade-offs achieved by the proposed solution in the presence of both data and device heterogeneity.

preprint2022arXiv

Unsupervised Vision-and-Language Pre-training via Retrieval-based Multi-Granular Alignment

Vision-and-Language (V+L) pre-training models have achieved tremendous success in recent years on various multi-modal benchmarks. However, the majority of existing models require pre-training on a large set of parallel image-text data, which is costly to collect, compared to image-only or text-only data. In this paper, we explore unsupervised Vision-and-Language pre-training (UVLP) to learn the cross-modal representation from non-parallel image and text datasets. We found two key factors that lead to good unsupervised V+L pre-training without parallel data: (i) joint image-and-text input (ii) overall image-text alignment (even for non-parallel data). Accordingly, we propose a novel unsupervised V+L pre-training curriculum for non-parallel texts and images. We first construct a weakly aligned image-text corpus via a retrieval-based approach, then apply a set of multi-granular alignment pre-training tasks, including region-to-tag, region-to-phrase, and image-to-sentence alignment, to bridge the gap between the two modalities. A comprehensive ablation study shows each granularity is helpful to learn a stronger pre-trained model. We adapt our pre-trained model to a set of V+L downstream tasks, including VQA, NLVR2, Visual Entailment, and RefCOCO+. Our model achieves the state-of-art performance in all these tasks under the unsupervised setting.

preprint2021arXiv

A single beam Cs-Ne SERF magnetometer with differential laser power noise suppression method

We describe a single beam compact Spin Exchange Relaxation Free(SERF) magnetometer whose configuration is compatible with the silicon-glass bonding micro-machining method. A cylindrical vapor cell with 3mm diameter and 3mm in length is utilized in the magnetometer. In order to reduce the wall relaxation which could not be neglected in micro-machined SERF magnetometer, 3 Amagats(1Amagat=2.69$\times$ 10$^{19}$/cm$^3$) neon buffer gas is filled in the vapor cell and this is the first demonstration of a Cs-Ne SERF magnetometer. We also did a simulation to show that neon is a better buffer gas than nitrogen and helium which is typical utilized in vapor cells. In order to reduce the laser amplitude noise and the large background detection offset which is reported to be the main noise source of a single beam absorption SERF magnetometer, we developed a laser power differential method and a factor of 2 improvement of the power noise suppression has been demonstrated. Finally, we did an optimization of the magnetometer and sensitivity of 40$fT/Hz^{1/2}$@30Hz has been achieved.

preprint2021arXiv

Decentralized Spectrum Access System: Vision, Challenges, and a Blockchain Solution

Spectrum access system (SAS) is widely considered the de facto solution to coordinating dynamic spectrum sharing (DSS) and protecting incumbent users. The current SAS paradigm prescribed by the FCC for the CBRS band and standardized by the WInnForum follows a centralized service model in that a spectrum user subscribes to a SAS server for spectrum allocation service. This model, however, neither tolerates SAS server failures (crash or Byzantine) nor resists dishonest SAS administrators, leading to serious concerns on SAS system reliability and trustworthiness. This is especially concerning for the evolving DSS landscape where an increasing number of SAS service providers and heterogeneous user requirements are coming up. To address these challenges, we propose a novel blockchain-based decentralized SAS architecture called BD-SAS that provides SAS services securely and efficiently, without relying on the trust of each individual SAS server for the overall system trustworthiness. In BD-SAS, a global blockchain (G-Chain) is used for spectrum regulatory compliance while smart contract-enabled local blockchains (L-Chains) are instantiated in individual spectrum zones for automating spectrum access assignment per user request. We hope our vision of a decentralized SAS, the BD-SAS architecture, and discussion on future challenges can open up a new direction towards reliable spectrum management in a decentralized manner.

preprint2021arXiv

Field-effect chirality devices with Dirac semimetal

Charge-based field-effect transistors (FETs) greatly suffer from unavoidable carrier scattering and heat dissipation. In analogy to valley degree of freedom in semiconductors, chiral anomaly current in Weyl/Dirac semimetals is theoretically predicted to be nearly non-dissipative over long distances, but still lacks experimental ways to efficiently control its transport. Here we demonstrate field-effect chirality devices with Dirac semimetal PtSe2, in which its Fermi level is close to the Dirac point in conduction band owing to intrinsic defects. The chiral anomaly is further corroborated with nonlocal valley transport measurement, which can also be effectively modulated by external fields, showing robust nonlocal valley transport with micrometer diffusion length. Similar to charge-based FETs, the chiral conductivity in PtSe2 devices can be modulated by electrostatic gating with an ON/OFF ratio more than 103. We also demonstrate basic logic functions in the devices with electric and magnetic fields as input signals.

preprint2021arXiv

LoRa Backscatter Assisted State Estimator for Micro Aerial Vehicles with Online Initialization

The advances in agile micro aerial vehicles (MAVs) have shown great potential in replacing humans for labor-intensive or dangerous indoor investigation, such as warehouse management and fire rescue. However, the design of a state estimation system that enables autonomous flight poses fundamental challenges in such dim or smoky environments. Current dominated computer-vision based solutions only work in well-lighted texture-rich environments. This paper addresses the challenge by proposing Marvel, an RF backscatter-based state estimation system with online initialization and calibration. Marvel is nonintrusive to commercial MAVs by attaching backscatter tags to their landing gears without internal hardware modifications, and works in a plug-and-play fashion with an automatic initialization module. Marvel is enabled by three new designs, a backscatter-based pose sensing module, an online initialization and calibration module, and a backscatter-inertial super-accuracy state estimation algorithm. We demonstrate our design by programming a commercial MAV to autonomously fly in different trajectories. The results show that Marvel supports navigation within a range of 50 m or through three concrete walls, with an accuracy of 34 cm for localization and 4.99 degrees for orientation estimation. We further demonstrate our online initialization and calibration by comparing to the perfect initial parameter measurements from burdensome manual operations.

preprint2021arXiv

Newtonalized Orthogonal Matching Pursuit for Linear Frequency Modulated Pulse Frequency Agile Radar

The linear frequency modulated (LFM) frequency agile radar (FAR) can synthesize a wide signal bandwidth through coherent processing while keeping the bandwidth of each pulse narrow. In this way, high range resolution profiles (HRRP) can be obtained without increasing the hardware system cost. Furthermore, the agility provides improved both robustness to jamming and spectrum efficiency. Motivated by the Newtonalized orthogonal matching pursuit (NOMP) for line spectral estimation problem, the NOMP for the FAR radar termed as NOMP-FAR is designed to process each coarse range bin to extract the HRRP and velocities of multiple targets, including the guide for determining the oversampling factor and the stopping criterion. In addition, it is shown that the target will cause false alarm in the nearby coarse range bins, a postprocessing algorithm is then proposed to suppress the ghost targets. Numerical simulations are conducted to demonstrate the effectiveness of NOMP-FAR.

preprint2021arXiv

Performance Analysis for Cache-enabled Cellular Networks with Cooperative Transmission

The large amount of deployed smart devices put tremendous traffic pressure on networks. Caching at the edge has been widely studied as a promising technique to solve this problem. To further improve the successful transmission probability (STP) of cache-enabled cellular networks (CEN), we combine the cooperative transmission technique with CEN and propose a novel transmission scheme. Local channel state information (CSI) is introduced at each cooperative base station (BS) to enhance the strength of the signal received by the user. A tight approximation for the STP of this scheme is derived using tools from stochastic geometry. The optimal content placement strategy of this scheme is obtained using a numerical method to maximize the STP. Simulation results demonstrate the optimal strategy achieves significant gains in STP over several comparative baselines with the proposed scheme.

preprint2021arXiv

Range decreasing group homomorphisms and holomorphic maps between generalized loop spaces

Let $\mathcal{G}$ resp. $M$ be a positive dimensional Lie group resp. connected complex manifold without boundary and $V$ a finite dimensional $C^{\infty}$ compact connected manifold, possibly with boundary. Fix a smoothness class $\mathcal{F}=C^{\infty}$, Hölder $C^{k, α}$ or Sobolev $W^{k, p}$. The space $\mathcal{F}(V, \mathcal{G})$ resp. $\mathcal{F}(V, M)$ of all $\mathcal{F}$ maps $V \to \mathcal{G}$ resp. $V \to M$ is a Banach/Fréchet Lie group resp. complex manifold. Let $\mathcal{F}^0(V, \mathcal{G})$ resp. $\mathcal{F}^{0}(V, M)$ be the component of $\mathcal{F}(V, \mathcal{G})$ resp. $\mathcal{F}(V, M)$ containing the identity resp. constants. A map $f$ from a domain $Ω\subset \mathcal{F}_1(V, M)$ to $\mathcal{F}_2(W, M)$ is called range decreasing if $f(x)(W) \subset x(V)$, $x \in Ω$. We prove that if $\dim_{\mathbb{R}} \mathcal{G} \ge 2$, then any range decreasing group homomorphism $f: \mathcal{F}_1^0(V, \mathcal{G}) \to \mathcal{F}_2(W, \mathcal{G})$ is the pullback by a map $ϕ: W \to V$. We also provide several sufficient conditions for a range decreasing holomorphic map $Ω$ $\to$ $\mathcal{F}_2(W, M)$ to be a pullback operator. Then we apply these results to study certain decomposition of holomorphic maps $\mathcal{F}_1(V, N) \supset Ω\to \mathcal{F}_2(W, M)$. In particular, we identify some classes of holomorphic maps $\mathcal{F}_1^{0}(V, \mathbb{P}^n) \to \mathcal{F}_2(W, \mathbb{P}^m)$, including all automorphisms of $\mathcal{F}^{0}(V, \mathbb{P}^n)$.

preprint2021arXiv

Riemann-Hilbert problem associated with the fourth-order dispersive nonlinear Schrödinger equation in optics and magnetic mechanics

In this paper, we utilize Fokas method to investigate the initial-boundary value problems (IBVPs) of the fourth-order dispersive nonlinear Schrödinger (FODNLS) equation on the half-line, which can simulate the nonlinear transmission and interaction of ultrashort pulses in the high-speed optical fiber transmission system, and describe the nonlinear spin excitation phenomenon of one-dimensional Heisenberg ferromagnetic chain with eight poles and dipole interaction. By discussing the eigenfunctions of Lax pair of FODNLS equation and the analysis and symmetry of the scattering matrix, the IBVPs of FODNLS equation is expressed as a matrix Riemann-Hilbert (RH) problem form. Then one can get the potential function solution $u(x,t)$ of the FODNLS equation by solving this matrix RH problem. In addition, we also obtained that some spectral functions admits a key global relationship.

preprint2021arXiv

Topology Learning Aided False Data Injection Attack without Prior Topology Information

False Data Injection (FDI) attacks against powersystem state estimation are a growing concern for operators.Previously, most works on FDI attacks have been performedunder the assumption of the attacker having full knowledge ofthe underlying system without clear justification. In this paper, wedevelop a topology-learning-aided FDI attack that allows stealthycyber-attacks against AC power system state estimation withoutprior knowledge of system information. The attack combinestopology learning technique, based only on branch and bus powerflows, and attacker-side pseudo-residual assessment to performstealthy FDI attacks with high confidence. This paper, for thefirst time, demonstrates how quickly the attacker can developfull-knowledge of the grid topology and parameters and validatesthe full knowledge assumptions in the previous work.

preprint2020arXiv

3D Aggregated Faster R-CNN for General Lesion Detection

Lesions are damages and abnormalities in tissues of the human body. Many of them can later turn into fatal diseases such as cancers. Detecting lesions are of great importance for early diagnosis and timely treatment. To this end, Computed Tomography (CT) scans often serve as the screening tool, allowing us to leverage the modern object detection techniques to detect the lesions. However, lesions in CT scans are often small and sparse. The local area of lesions can be very confusing, leading the region based classifier branch of Faster R-CNN easily fail. Therefore, most of the existing state-of-the-art solutions train two types of heterogeneous networks (multi-phase) separately for the candidate generation and the False Positive Reduction (FPR) purposes. In this paper, we enforce an end-to-end 3D Aggregated Faster R-CNN solution by stacking an &#34;aggregated classifier branch&#34; on the backbone of RPN. This classifier branch is equipped with Feature Aggregation and Local Magnification Layers to enhance the classifier branch. We demonstrate our model can achieve the state of the art performance on both LUNA16 and DeepLesion dataset. Especially, we achieve the best single-model FROC performance on LUNA16 with the inference time being 4.2s per processed scan.

preprint2020arXiv

A Parallel Augmented Subspace Method for Eigenvalue Problems

A type of parallel augmented subspace scheme for eigenvalue problems is proposed by using coarse space in the multigrid method. With the help of coarse space in multigrid method, solving the eigenvalue problem in the finest space is decomposed into solving the standard linear boundary value problems and very low dimensional eigenvalue problems. The computational efficiency can be improved since there is no direct eigenvalue solving in the finest space and the multigrid method can act as the solver for the deduced linear boundary value problems. Furthermore, for different eigenvalues, the corresponding boundary value problem and low dimensional eigenvalue problem can be solved in the parallel way since they are independent of each other and there exists no data exchanging. This property means that we do not need to do the orthogonalization in the highest dimensional spaces. This is the main aim of this paper since avoiding orthogonalization can improve the scalability of the proposed numerical method. Some numerical examples are provided to validate the proposed parallel augmented subspace method.

preprint2020arXiv

A Spatially Constrained Deep Convolutional Neural Network for Nerve Fiber Segmentation in Corneal Confocal Microscopic Images using Inaccurate Annotations

Semantic image segmentation is one of the most important tasks in medical image analysis. Most state-of-the-art deep learning methods require a large number of accurately annotated examples for model training. However, accurate annotation is difficult to obtain especially in medical applications. In this paper, we propose a spatially constrained deep convolutional neural network (DCNN) to achieve smooth and robust image segmentation using inaccurately annotated labels for training. In our proposed method, image segmentation is formulated as a graph optimization problem that is solved by a DCNN model learning process. The cost function to be optimized consists of a unary term that is calculated by cross entropy measurement and a pairwise term that is based on enforcing a local label consistency. The proposed method has been evaluated based on corneal confocal microscopic (CCM) images for nerve fiber segmentation, where accurate annotations are extremely difficult to be obtained. Based on both the quantitative result of a synthetic dataset and qualitative assessment of a real dataset, the proposed method has achieved superior performance in producing high quality segmentation results even with inaccurate labels for training.

preprint2020arXiv

A Survey of Distributed Consensus Protocols for Blockchain Networks

Since the inception of Bitcoin, cryptocurrencies and the underlying blockchain technology have attracted an increasing interest from both academia and industry. Among various core components, consensus protocol is the defining technology behind the security and performance of blockchain. From incremental modifications of Nakamoto consensus protocol to innovative alternative consensus mechanisms, many consensus protocols have been proposed to improve the performance of the blockchain network itself or to accommodate other specific application needs. In this survey, we present a comprehensive review and analysis on the state-of-the-art blockchain consensus protocols. To facilitate the discussion of our analysis, we first introduce the key definitions and relevant results in the classic theory of fault tolerance which help to lay the foundation for further discussion. We identify five core components of a blockchain consensus protocol, namely, block proposal, block validation, information propagation, block finalization, and incentive mechanism. A wide spectrum of blockchain consensus protocols are then carefully reviewed accompanied by algorithmic abstractions and vulnerability analyses. The surveyed consensus protocols are analyzed using the five-component framework and compared with respect to different performance metrics. These analyses and comparisons provide us new insights in the fundamental differences of various proposals in terms of their suitable application scenarios, key assumptions, expected fault tolerance, scalability, drawbacks and trade-offs. We believe this survey will provide blockchain developers and researchers a comprehensive view on the state-of-the-art consensus protocols and facilitate the process of designing future protocols.

preprint2020arXiv

An Algebraic Multigrid Method for Eigenvalue Problems in Some Different Cases

The aim of this paper is to develop an algebraic multigrid method to solve eigenvalue problems based on the combination of the multilevel correction scheme and the algebraic multigrid method for linear equations. Our approach uses the algebraic multigrid method setup procedure to construct the hierarchy and the intergrid transfer operators. In this algebraic multigrid scheme, a large scale eigenvalue problem is solved by some algebraic multigrid smoothing steps in the hierarchy and very small-dimensional eigenvalue problems. To emphasize the efficiency and flexibility of the proposed method, here we consider a set of test eigenvalue problems, discretized on unstructured meshes, with different shape of domain, singularity, and discontinuous parameters. Moreover, global convergence independent of the number of desired eigenvalues is obtained.

preprint2020arXiv

Bounding Regression Errors in Data-driven Power Grid Steady-state Models

Data-driven models analyze power grids under incomplete physical information, and their accuracy has been mostly validated empirically using certain training and testing datasets. This paper explores error bounds for data-driven models under all possible training and testing scenarios, and proposes an evaluation implementation based on Rademacher complexity theory. We answer key questions for data-driven models: how much training data is required to guarantee a certain error bound, and how partial physical knowledge can be utilized to reduce the required amount of data. Our results are crucial for the evaluation and application of data-driven models in power grid analysis. We demonstrate the proposed method by finding generalization error bounds for two applications, i.e. branch flow linearization and external network equivalent under different degrees of physical knowledge. Results identify how the bounds decrease with additional power grid physical knowledge or more training data.

preprint2020arXiv

Computation Offloading in Beyond 5G Networks: A Distributed Learning Framework and Applications

Facing the trend of merging wireless communications and multi-access edge computing (MEC), this article studies computation offloading in the beyond fifth-generation networks. To address the technical challenges originating from the uncertainties and the sharing of limited resource in an MEC system, we formulate the computation offloading problem as a multi-agent Markov decision process, for which a distributed learning framework is proposed. We present a case study on resource orchestration in computation offloading to showcase the potentials of an online distributed reinforcement learning algorithm developed under the proposed framework. Experimental results demonstrate that our learning algorithm outperforms the benchmark resource orchestration algorithms. Furthermore, we outline the research directions worth in-depth investigation to minimize the time cost, which is one of the main practical issues that prevent the implementation of the proposed distributed learning framework.

preprint2020arXiv

Conditional variable screening via ordinary least squares projection

In this article, we propose a novel variable screening method for linear models named as conditional screening via ordinary least squares projection (COLP). COLP can take advantage of prior knowledge concerning certain active predictors by eliminating the adverse impact of their coefficients in the estimation of remaining ones and thus significantly enhance the screening accuracy. We prove its sure-screening property under reasonable assumptions and demonstrate its utility in an application to a leukemia dataset. Moreover, based on the conditional approach, we introduce an iterative algorithm named as forward screening via ordinary least squares projection (FOLP), which not only could exploit the prior information more effectively, but also has promising performance when no prior knowledge is available using a data-driven conditioning set. Extensive simulation studies are carried out to demonstrate the competence of both proposed methods.

preprint2020arXiv

COVID-19 causes record decline in global CO2 emissions

The considerable cessation of human activities during the COVID-19 pandemic has affected global energy use and CO2 emissions. Here we show the unprecedented decrease in global fossil CO2 emissions from January to April 2020 was of 7.8% (938 Mt CO2 with a +6.8% of 2-σ uncertainty) when compared with the period last year. In addition other emerging estimates of COVID impacts based on monthly energy supply or estimated parameters, this study contributes to another step that constructed the near-real-time daily CO2 emission inventories based on activity from power generation (for 29 countries), industry (for 73 countries), road transportation (for 406 cities), aviation and maritime transportation and commercial and residential sectors emissions (for 206 countries). The estimates distinguished the decline of CO2 due to COVID-19 from the daily, weekly and seasonal variations as well as the holiday events. The COVID-related decreases in CO2 emissions in road transportation (340.4 Mt CO2, -15.5%), power (292.5 Mt CO2, -6.4% compared to 2019), industry (136.2 Mt CO2, -4.4%), aviation (92.8 Mt CO2, -28.9%), residential (43.4 Mt CO2, -2.7%), and international shipping (35.9Mt CO2, -15%). Regionally, decreases in China were the largest and earliest (234.5 Mt CO2,-6.9%), followed by Europe (EU-27 & UK) (138.3 Mt CO2, -12.0%) and the U.S. (162.4 Mt CO2, -9.5%). The declines of CO2 are consistent with regional nitrogen oxides concentrations observed by satellites and ground-based networks, but the calculated signal of emissions decreases (about 1Gt CO2) will have little impacts (less than 0.13ppm by April 30, 2020) on the overserved global CO2 concertation. However, with observed fast CO2 recovery in China and partial re-opening globally, our findings suggest the longer-term effects on CO2 emissions are unknown and should be carefully monitored using multiple measures.

preprint2020arXiv

DeepSlicing: Deep Reinforcement Learning Assisted Resource Allocation for Network Slicing

Network slicing enables multiple virtual networks run on the same physical infrastructure to support various use cases in 5G and beyond. These use cases, however, have very diverse network resource demands, e.g., communication and computation, and various performance metrics such as latency and throughput. To effectively allocate network resources to slices, we propose DeepSlicing that integrates the alternating direction method of multipliers (ADMM) and deep reinforcement learning (DRL). DeepSlicing decomposes the network slicing problem into a master problem and several slave problems. The master problem is solved based on convex optimization and the slave problem is handled by DRL method which learns the optimal resource allocation policy. The performance of the proposed algorithm is validated through network simulations.

preprint2020arXiv

Embedding Lithium-ion Battery Scrapping Criterion and Degradation Model in Optimal Operation of Peak-shaving Energy Storage

Lithium-ion battery systems have been used in practical power systems for peak-shaving, demand response, and frequency regulation. However, a lithium-ion battery is degrading while cycling and would be scrapped when the capacity reduces to a certain threshold (e.g. 80%). Such scrapping criterion may not explore the maximum benefit from the battery storage. In this paper, we propose a novel scrapping criterion for peak-shaving energy storage based on battery efficiency, time-of-use price, and arbitrage benefit. A new battery life model with scrapping parameters is then derived using this criterion. Embedded with the life model, an optimal operation method for peak-shaving energy storage system is presented. The results of case study show that the operation method could maximize the benefits of peak-shaving energy storage while delaying battery degradation. Compared with the traditional 80% capacity-based scrapping criterion, our efficiency-based scrapping criterion can significantly improve the lifetime benefit of the battery.

preprint2020arXiv

Energy and Information Management of Electric Vehicular Network: A Survey

The connected vehicle paradigm empowers vehicles with the capability to communicate with neighboring vehicles and infrastructure, shifting the role of vehicles from a transportation tool to an intelligent service platform. Meanwhile, the transportation electrification pushes forward the electric vehicle (EV) commercialization to reduce the greenhouse gas emission by petroleum combustion. The unstoppable trends of connected vehicle and EVs transform the traditional vehicular system to an electric vehicular network (EVN), a clean, mobile, and safe system. However, due to the mobility and heterogeneity of the EVN, improper management of the network could result in charging overload and data congestion. Thus, energy and information management of the EVN should be carefully studied. In this paper, we provide a comprehensive survey on the deployment and management of EVN considering all three aspects of energy flow, data communication, and computation. We first introduce the management framework of EVN. Then, research works on the EV aggregator (AG) deployment are reviewed to provide energy and information infrastructure for the EVN. Based on the deployed AGs, we present the research work review on EV scheduling that includes both charging and vehicle-to-grid (V2G) scheduling. Moreover, related works on information communication and computing are surveyed under each scenario. Finally, we discuss open research issues in the EVN.

preprint2020arXiv

Guiding Cascading Failure Search with Interpretable Graph Convolutional Network

Power system cascading failures become more time variant and complex because of the increasing network interconnection and higher renewable energy penetration. High computational cost is the main obstacle for a more frequent online cascading failure search, which is essential to improve system security. In this work, we show that the complex mechanism of cascading failures can be well captured by training a graph convolutional network (GCN) offline. Subsequently, the search of cascading failures can be significantly accelerated with the aid of the trained GCN model. We link the power network topology with the structure of the GCN, yielding a smaller parameter space to learn the complex mechanism. We further enable the interpretability of the GCN model by a layer-wise relevance propagation (LRP) algorithm. The proposed method is tested on both the IEEE RTS-79 test system and China&#39;s Henan Province power system. The results show that the GCN guided method can not only accelerate the search of cascading failures, but also reveal the reasons for predicting the potential cascading failures.

preprint2020arXiv

Iterative Configuration Interaction with Selection

Even when starting with a very poor initial guess, the iterative configuration interaction (iCI) approach can converge from above to full CI very quickly by constructing and diagonalizing a small Hamiltonian matrix at each macro/micro-iteration. However, iCI scales exponentially with respect to the numbers of electrons and orbitals. The problem can be mitigated by observing that a vast number of configurations have little weights in the wave function and do not contribute to the correlation energy. The real questions are then (a) how to identify important configurations in the early stage of the calculation and (b) how to account for the residual contributions of those unimportant configurations. It is generally true that if a high-quality yet compact variational space can be determined for describing the static correlation, a low-order treatment of the residual dynamic correlation would be sufficient. While this is common to all selected CI schemes, the `iCI with selection&#39; scheme presented here has the following distinctive features: (1) Full spin symmetry is maintained. (2) Although the selection is performed on individual CSFs, it is orbital configurations (oCFG) that are used as the organizing units. (3) Given a coefficient pruning-threshold, the selection of important oCFGs/CSFs is performed iteratively until convergence. (4) At each iteration for the growth of wave function, the first-order interacting space is decomposed into disjoint subspaces to reduce memory requirement and facilitate parallelization. (5) Upper bounds for the interactions between oCFG pairs are used to screen each first-order interacting subspace before the first-order coefficients of individual CSFs are evaluated. (6) Upon termination of the selection, dynamic correlation is estimated by using the ENPT2 theory. The efficacy of the iCIPT2 scheme is demonstrated numerically by taking several examples.

preprint2020arXiv

Large-scale integrated reconfigurable orbital angular momentum mode multiplexer

Recent experiments in orbital angular momentum multiplexing have demonstrated its potential for improving the link capacity in optical interconnection networks. Meanwhile, compact photonic integrated orbital angular momentum (de-)multiplexing devices are needed to address requirements such as high scalability, fast configurability, low cost and low power consumption. Here we report on a large-scale integrated tunable orbital angular momentum mode multiplexer, which supports up to 20 multiplexed orbital angular momentum modes over 16 wavelength channels with 30 GHz channel spacing. A testbed of nine multiplexed OAM beams encoded with 28 Gbaud 16-quadrature amplitude modulation signal is demonstrated, achieving a 1.008 Tbit s-1 aggregated rate with low penalty and sub-microsecond reconfiguration rate of the orbital angular momentum mode. This device offers an effective solution for replacing bulky diffractive optical elements, paving the way for orbital angular momentum multiplexing in optical interconnection networks.

preprint2020arXiv

Mercury-related health benefits from retrofitting coal-fired power plants in China

China has implemented retrofitting measures in coal-fired power plants (CFPPs) to reduce air pollution through small unit shutdown (SUS), the installation of air pollution control devices (APCDs) and power generation efficiency (PGE) improvement. The reductions in highly toxic Hg emissions and their related health impacts by these measures have not been well studied. To refine mitigation options, we evaluated the health benefits of reduced Hg emissions via retrofitting measures during China&#39;s 12th Five-Year Plan by combining plant-level Hg emission inventories with the China Hg Risk Source-Tracking Model. We found that the measures reduced Hg emissions by 23.5 tons (approximately 1/5 of that from CFPPs in 2010), preventing 0.0021 points of per-foetus intelligence quotient (IQ) decrements and 114 deaths from fatal heart attacks. These benefits were dominated by CFPP shutdowns and APCD installations. Provincial health benefits were largely attributable to Hg reductions in other regions. We also demonstrated the necessity of considering human health impacts, rather than just Hg emission reductions, in selecting Hg control devices. This study also suggests that Hg control strategies should consider various factors, such as CFPP locations, population densities and trade-offs between reductions of total Hg (THg) and Hg2+.

preprint2020arXiv

Modeling the Impact of Network Connectivity on Consensus Security of Proof-of-Work Blockchain

Blockchain, the technology behind the popular Bitcoin, is considered a &#34;security by design&#34; system as it is meant to create security among a group of distrustful parties yet without a central trusted authority. The security of blockchain relies on the premise of honest-majority, namely, the blockchain system is assumed to be secure as long as the majority of consensus voting power is honest. And in the case of proof-of-work (PoW) blockchain, adversaries cannot control more than 50% of the network&#39;s gross computing power. However, this 50% threshold is based on the analysis of computing power only, with implicit and idealistic assumptions on the network and node behavior. Recent researches have alluded that factors such as network connectivity, presence of blockchain forks, and mining strategy could undermine the consensus security assured by the honest-majority, but neither concrete analysis nor quantitative evaluation is provided. In this paper we fill the gap by proposing an analytical model to assess the impact of network connectivity on the consensus security of PoW blockchain under different adversary models. We apply our analytical model to two adversarial scenarios: 1) honest-but-potentially-colluding, 2) selfish mining. For each scenario, we quantify the communication capability of nodes involved in a fork race and estimate the adversary&#39;s mining revenue and its impact on security properties of the consensus protocol. Simulation results validated our analysis. Our modeling and analysis provide a paradigm for assessing the security impact of various factors in a distributed consensus system.

preprint2020arXiv

Multiuser Scheduling for Minimizing Age of Information in Uplink MIMO Systems

This paper studies the user scheduling problem in a multiuser multiple-input multi-output (MIMO) status update system, in which multiple single-antenna devices aim to send their latest statuses to a multiple-antenna information-fusion access point (AP) via a shared wireless channel. The information freshness in the considered system is quantified by a recently proposed metric, termed age of information (AoI). Thanks to the extra spatial degrees-of-freedom brought about by the multiple antennas at the AP, multiple devices can be granted to transmit simultaneously in each time slot. We aim to seek the optimal scheduling policy that can minimize the network-wide AoI by optimally deciding which device or group of devices to be scheduled for transmission in each slot given the instantaneous AoI values of all devices at the beginning of the slot. To that end, we formulate the multiuser scheduling problem as a Markov decision process (MDP). We attain the optimal policy by resolving the formulated MDP problem and develop a low-complexity sub-optimal policy. Simulation results show that the proposed optimal and sub-optimal policies significantly outperform the state-of-the-art benchmark schemes.

preprint2020arXiv

On the Riemann-Hilbert problem for the Chen-Lee-Liu derivative nonlinear Schrödinger equation

In this work, we investigated a combined Chen-Lee-Liu derivative nonlinear Schrödinger equation(called CLL-NLS equation by Kundu) on the half-line by unified transformation approach. We gives spectral analysis of the Lax pair for CLL-NLS equation, and establish a matrix Riemann-Hilbert problem, so as to reconstruct the solution $r(z,t)$ of the CLL-NLS equation by solving. Furthermore, the spectral functions are not independent, but enjoy by a compatibility condition, which is the so-called global relation.

preprint2020arXiv

PrivacyGuard: Enforcing Private Data Usage Control with Blockchain and Attested Off-chain Contract Execution

The abundance and rich varieties of data are enabling many transformative applications of big data analytics that have profound societal impacts. However, there are also increasing concerns regarding the improper use of individual data owner&#39;s private data. In this paper, we propose PrivacyGuard, a system that leverages blockchain smart contract and trusted execution environment (TEE) to enable individual&#39;s control over the access and usage of their private data. Smart contracts are used to specify data usage policy, i.e., who can use what data under which conditions and what analytics to perform, while the distributed blockchain ledger is used to keep an irreversible and non-repudiable data usage record. To address the efficiency problem of on-chain contract execution and to prevent exposing private data on the publicly viewable blockchain, PrivacyGuard incorporates a novel TEE-based off-chain contract execution engine along with a protocol to securely commit the execution result onto blockchain. We have built and deployed a prototype of PrivacyGuard with Ethereum and Intel SGX. Our experiment result demonstrates that PrivacyGuard fulfills the promised privacy goal and supports analytics on data from a considerable number of data owners.

preprint2020arXiv

Robust Visual Object Tracking with Two-Stream Residual Convolutional Networks

The current deep learning based visual tracking approaches have been very successful by learning the target classification and/or estimation model from a large amount of supervised training data in offline mode. However, most of them can still fail in tracking objects due to some more challenging issues such as dense distractor objects, confusing background, motion blurs, and so on. Inspired by the human &#34;visual tracking&#34; capability which leverages motion cues to distinguish the target from the background, we propose a Two-Stream Residual Convolutional Network (TS-RCN) for visual tracking, which successfully exploits both appearance and motion features for model update. Our TS-RCN can be integrated with existing deep learning based visual trackers. To further improve the tracking performance, we adopt a &#34;wider&#34; residual network ResNeXt as its feature extraction backbone. To the best of our knowledge, TS-RCN is the first end-to-end trainable two-stream visual tracking system, which makes full use of both appearance and motion features of the target. We have extensively evaluated the TS-RCN on most widely used benchmark datasets including VOT2018, VOT2019, and GOT-10K. The experiment results have successfully demonstrated that our two-stream model can greatly outperform the appearance based tracker, and it also achieves state-of-the-art performance. The tracking system can run at up to 38.1 FPS.

preprint2020arXiv

Sparse Oblique Decision Tree for Power System Security Rules Extraction and Embedding

Increasing the penetration of variable generation has a substantial effect on the operational reliability of power systems. The higher level of uncertainty that stems from this variability makes it more difficult to determine whether a given operating condition will be secure or insecure. Data-driven techniques provide a promising way to identify security rules that can be embedded in economic dispatch model to keep power system operating states secure. This paper proposes using a sparse weighted oblique decision tree to learn accurate, understandable, and embeddable security rules that are linear and can be extracted as sparse matrices using a recursive algorithm. These matrices can then be easily embedded as security constraints in power system economic dispatch calculations using the Big-M method. Tests on several large datasets with high renewable energy penetration demonstrate the effectiveness of the proposed method. In particular, the sparse weighted oblique decision tree outperforms the state-of-art weighted oblique decision tree while keeping the security rules simple. When embedded in the economic dispatch, these rules significantly increase the percentage of secure states and reduce the average solution time.

preprint2019arXiv

A Linear LMP Model for Active and Reactive Power with Power Loss

Pricing the reactive power is more necessary than ever before because of the increasing challenge of renewable energy integration on reactive power balance and voltage control. However, reactive power price is hard to be efficiently calculated because of the non-linear nature of optimal AC power flow equation. This paper proposes a linear model to calculate active and reactive power LMP simultaneously considering power loss. Firstly, a linearized AC power flow equation is proposed based on an augmented Generation Shift Distribution Factors (GSDF) matrix. Secondly, a linearized LMP model is derived using GSDF and loss factors. The formulation of LMP is further decomposed into four components: energy, congestion, voltage limitation and power loss. Finally, an iterate algorithm is proposed for calculating LMP with the proposed model. The performance of the proposed model is validated by the IEEE-118 bus system.

preprint2019arXiv

A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition based Proximal ADMMs for Convex Composite Programming

This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alternating direction methods of multipliers (ADMMs) for convex composite optimization problems. The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algorithms. Specifically, the majorized augmented Lagrangian functions, the indefinite proximal terms, the inexact symmetric Gauss-Seidel decomposition theorem, the tolerance criteria of approximately solving the subproblems, and the large dual step-lengths, are all incorporated in one algorithmic framework, which we named as sGS-imiPADMM. From the popularity of convergent variants of multi-block ADMMs in recent years, especially for high-dimensional multi-block convex composite conic programming problems, the unification presented in this paper, as well as the corresponding convergence results, may have the great potential of facilitating the implementation of many multi-block ADMMs in various problem settings.

preprint2019arXiv

Multidimensional Variational Line Spectra Estimation

The fundamental multidimensional line spectral estimation problem is addressed utilizing the Bayesian methods. Motivated by the recently proposed variational line spectral estimation (VALSE) algorithm, multidimensional VALSE (MDVALSE) is developed. MDVALSE inherits the advantages of VALSE such as automatically estimating the model order, noise variance and providing uncertain degrees of frequency estimates. Compared to VALSE, the multidimensional frequencies of a single component is treated as a whole, and the probability density function is projected as independent univariate von Mises distribution to perform tractable inference. Besides, for the initialization, efficient fast Fourier transform (FFT) is adopted to significantly reduce the computation complexity of MDVALSE. Numerical results demonstrate the effectiveness of the MDVALSE, compared to state-of-art methods.