arXiv subjects

Qing Yang

Publications and source records attributed to Qing Yang.

At least 145 records · Page 8Linked to original sources

arXiv2021

Ethna: Analyzing the Underlying Peer-to-Peer Network of the Ethereum Blockchain

The peer-to-peer (P2P) network of blockchain used to transport its transactions and blocks has a high impact on the efficiency and security of the system. The P2P network topologies of popular blockchains such as Bitcoin and Ethereum, therefore, deserve our highest attention. The current Ethereum blockchain explorers (e.g., Etherscan) focus on the tracking of block and transaction records but omit the characterization of the underlying P2P network. This work presents the Ethereum Network Analyzer (Ethna), a tool that probes and analyzes the P2P network of the Ethereum blockchain. Unlike Bitcoin that adopts an unstructured P2P network, Ethereum relies on the Kademlia DHT to manage its P2P network. Therefore, the existing analytical methods for Bitcoin-like P2P networks are not applicable to Ethereum. Ethna implements a novel method that accurately measures the degrees of Ethereum nodes. Furthermore, it incorporates an algorithm that derives the latency metrics of message propagation in the Ethereum P2P network. We ran Ethna on the Ethereum Mainnet and conducted extensive experiments to analyze the topological features of its P2P network. Our analysis shows that the Ethereum P2P network possesses a certain effect of small-world networks, and the degrees of nodes follow a power-law distribution that characterizes scale-free networks.

cs.NI↗

arXiv2021

Exploring Blockchain for The Coordination of Distributed Energy Resources

The fast growth of distributed energy resources (DERs), such as distributed renewables (e.g., rooftop PV panels), energy storage systems, electric vehicles, and controllable appliances, drives the power system toward a decentralized system with bidirectional power flow. The coordination of DERs through an aggregator, such as a utility, system operator, or a third-party coordinator, emerges as a promising paradigm. However, it is not well understood how to enable trust between the aggregator and DERs to integrate DERs efficiently. In this paper, we develop a trustable and distributed coordination system for DERs using blockchain technology. We model various DERs and formulate a cost minimization problem for DERs to optimize their energy trading, scheduling, and demand response. We use the alternating direction method of multipliers (ADMM) to solve the problem in a distributed fashion. To implement the distributed algorithm in a trustable way, we design a smart contract to update multipliers and communicate with DERs in a blockchain network. We validate our design by experiments using real-world data, and the simulation results demonstrate the effectiveness of our algorithm.

cs.DC↗

arXiv2021

Cooperative Energy Management of HVAC via Transactive Energy

Heating, Ventilation, and Air Conditioning (HVAC) energy consumption accounts for a significant part of the total energy consumption of buildings and households. The ubiquitous adoption of distributed renewable energy and smart meters helps to decarbonize the HVAC energy consumption and improve energy efficiency. However, how to scale up HVAC energy management for a group of users while persevering users' privacy remains a big challenge. In this work, we utilize the concept of transactive energy to build a cooperative energy management system for independent HVAC units in a distributed manner. Specifically, we develop a distributed energy trading algorithm that consists of two layers based on the alternating direction method of multipliers method. The distributed energy trading algorithm achieves optimal trading performance and also preserves users' privacy. Furthermore, we evaluate the performance of the distributed trading algorithm by extensive simulations with real-world data. Simulation results show that the energy trading algorithm converges fast and the cooperative energy platform reduces the user's individual cost by up to 50% and lowers the overall cost of all users by 23%.

eess.SY↗

arXiv2021

Privacy-Preserving Transactive Energy Management for IoT-aided Smart Homes via Blockchain

With the booming of smart grid, The ubiquitously deployed smart meters constitutes an energy internet of things. This paper develops a novel blockchain-based transactive energy management system for IoT-aided smart homes. We consider a holistic set of options for smart homes to participate in transactive energy. Smart homes can interact with the grid to perform vertical transactions, e.g., feeding in extra solar energy to the grid and providing demand response service to alleviate the grid load. Smart homes can also interact with peer users to perform horizontal transactions, e.g., peer-to-peer energy trading. However, conventional transactive energy management method suffers from the drawbacks of low efficiency, privacy leakage, and single-point failure. To address these challenges, we develop a privacy-preserving distributed algorithm that enables users to optimally manage their energy usages in parallel via the smart contract on the blockchain. Further, we design an efficient blockchain system tailored for IoT devices and develop the smart contract to support the holistic transactive energy management system. Finally, we evaluate the feasibility and performance of the blockchain-based transactive energy management system through extensive simulations and experiments. The results show that the blockchain-based transactive energy management system is feasible on practical IoT devices and reduces the overall cost by 25%.

eess.SY↗

arXiv2021

Long-lived electron spin coherence in Ga-doped crystals at room temperature

Electron spin dynamics are studied in Ga-doped ZnO single crystals by time-resolved Faraday and Kerr rotation spectroscopies. Long-lived spin coherence with two dephasing processes is discovered where the characteristic time is up to 5.2 ns at room temperature. Through the dependence measurements of laser wavelength and temperature, the room-temperature long-lived spin signal is attributed to localized electrons. The spin dephasing (relaxation) processes are independent of transverse (longitudinal) magnetic fields, indicating the spin dephasing not resulting from the g-factor inhomogeneity and electron-nuclear hyperfine interaction. It reveals that the two spin dephasing processes originate from two types of localized electrons, both of which are dominated by the anisotropic exchange Dzyaloshinskii-Moriya interaction between adjacent localized electrons.

physics.chem-ph↗

arXiv2020

Power Iteration for Tensor PCA

In this paper, we study the power iteration algorithm for the spiked tensor model, as introduced in [44]. We give necessary and sufficient conditions for the convergence of the power iteration algorithm. When the power iteration algorithm converges, for the rank one spiked tensor model, we show the estimators for the spike strength and linear functionals of the signal are asymptotically Gaussian; for the multi-rank spiked tensor model, we show the estimators are asymptotically mixtures of Gaussian. This new phenomenon is different from the spiked matrix model. Using these asymptotic results of our estimators, we construct valid and efficient confidence intervals for spike strengths and linear functionals of the signals.

math.ST↗

arXiv2020

Asset Allocation via Machine Learning and Applications to Equity Portfolio Management

In this paper, we document a novel machine learning based bottom-up approach for static and dynamic portfolio optimization on, potentially, a large number of assets. The methodology applies to general constrained optimization problems and overcomes many major difficulties arising in current optimization schemes. Taking mean-variance optimization as an example, we no longer need to compute the covariance matrix and its inverse, therefore the method is immune from the estimation error on this quantity. Moreover, no explicit calls of optimization routines are needed. Applications to equity portfolio management in U.S. and China equity markets are studied and we document significant excess returns to the selected benchmarks.

q-fin.MF↗

arXiv2020

Blockchain-Empowered Socially Optimal Transactive Energy System: Framework and Implementation

Transactive energy plays a key role in the operation and energy management of future power systems. However, the conventional operational mechanism, which follows a centralized design, is often less secure, vulnerable to malicious behaviors, and suffers from privacy leakage. In this work, we introduce blockchain technology in transactive energy to address these challenges. Specifically, we develop a novel blockchain-based transactive energy framework for prosumers and design a decentralized energy trading algorithm that matches the operation of the underlying blockchain system. We prove that the trading algorithm improves the individual benefit and guarantees the socially optimal performance, and thus incentivizes prosumers to join the transactive energy platform. Moreover, we evaluate the feasibility of the transactive energy platform throughout the implementation of a small-scale network of Internet of Things (IoT) devices and extensive simulations using real-world data. Our results show that this blockchain-based transactive energy platform is feasible in practice, and the decentralized trading algorithm reduces the user's individual cost by up to 77% and lowers the overall cost by 24%.

eess.SY↗

arXiv2020

MFPP: Morphological Fragmental Perturbation Pyramid for Black-Box Model Explanations

Deep neural networks (DNNs) have recently been applied and used in many advanced and diverse tasks, such as medical diagnosis, automatic driving, etc. Due to the lack of transparency of the deep models, DNNs are often criticized for their prediction that cannot be explainable by human. In this paper, we propose a novel Morphological Fragmental Perturbation Pyramid (MFPP) method to solve the Explainable AI problem. In particular, we focus on the black-box scheme, which can identify the input area that is responsible for the output of the DNN without having to understand the internal architecture of the DNN. In the MFPP method, we divide the input image into multi-scale fragments and randomly mask out fragments as perturbation to generate a saliency map, which indicates the significance of each pixel for the prediction result of the black box model. Compared with the existing input sampling perturbation method, the pyramid structure fragment has proved to be more effective. It can better explore the morphological information of the input image to match its semantic information, and does not need any value inside the DNN. We qualitatively and quantitatively prove that MFPP meets and exceeds the performance of state-of-the-art (SOTA) black-box interpretation method on multiple DNN models and datasets.

cs.CV↗

arXiv2020

CoFF: Cooperative Spatial Feature Fusion for 3D Object Detection on Autonomous Vehicles

To reduce the amount of transmitted data, feature map based fusion is recently proposed as a practical solution to cooperative 3D object detection by autonomous vehicles. The precision of object detection, however, may require significant improvement, especially for objects that are far away or occluded. To address this critical issue for the safety of autonomous vehicles and human beings, we propose a cooperative spatial feature fusion (CoFF) method for autonomous vehicles to effectively fuse feature maps for achieving a higher 3D object detection performance. Specially, CoFF differentiates weights among feature maps for a more guided fusion, based on how much new semantic information is provided by the received feature maps. It also enhances the inconspicuous features corresponding to far/occluded objects to improve their detection precision. Experimental results show that CoFF achieves a significant improvement in terms of both detection precision and effective detection range for autonomous vehicles, compared to previous feature fusion solutions.

cs.CV↗

arXiv2020

Channel Pruning via Optimal Thresholding

Structured pruning, especially channel pruning is widely used for the reduced computational cost and the compatibility with off-the-shelf hardware devices. Among existing works, weights are typically removed using a predefined global threshold, or a threshold computed from a predefined metric. The predefined global threshold based designs ignore the variation among different layers and weights distribution, therefore, they may often result in sub-optimal performance caused by over-pruning or under-pruning. In this paper, we present a simple yet effective method, termed Optimal Thresholding (OT), to prune channels with layer dependent thresholds that optimally separate important from negligible channels. By using OT, most negligible or unimportant channels are pruned to achieve high sparsity while minimizing performance degradation. Since most important weights are preserved, the pruned model can be further fine-tuned and quickly converge with very few iterations. Our method demonstrates superior performance, especially when compared to the state-of-the-art designs at high levels of sparsity. On CIFAR-100, a pruned and fine-tuned DenseNet-121 by using OT achieves 75.99% accuracy with only 1.46e8 FLOPs and 0.71M parameters.

cs.CV↗

arXiv2020

Assessing Impact of Unobserved Confounders with Sensitivity Index Probabilities through Pseudo-Experiments

Unobserved confounders are a long-standing issue in causal inference using propensity score methods. This study proposed nonparametric indices to quantify the impact of unobserved confounders through pseudo-experiments with an application to real-world data. The study finding suggests that the proposed indices can reflect the true impact of confounders. It is hoped that this study will lead to further discussion on this important issue and help move the science of causal inference forward.

stat.ME↗

arXiv2020

DCANet: Learning Connected Attentions for Convolutional Neural Networks

While self-attention mechanism has shown promising results for many vision tasks, it only considers the current features at a time. We show that such a manner cannot take full advantage of the attention mechanism. In this paper, we present Deep Connected Attention Network (DCANet), a novel design that boosts attention modules in a CNN model without any modification of the internal structure. To achieve this, we interconnect adjacent attention blocks, making information flow among attention blocks possible. With DCANet, all attention blocks in a CNN model are trained jointly, which improves the ability of attention learning. Our DCANet is generic. It is not limited to a specific attention module or base network architecture. Experimental results on ImageNet and MS COCO benchmarks show that DCANet consistently outperforms the state-of-the-art attention modules with a minimal additional computational overhead in all test cases. All code and models are made publicly available.

cs.CV↗

arXiv2020

PipeNet: Selective Modal Pipeline of Fusion Network for Multi-Modal Face Anti-Spoofing

Face anti-spoofing has become an increasingly important and critical security feature for authentication systems, due to rampant and easily launchable presentation attacks. Addressing the shortage of multi-modal face dataset, CASIA recently released the largest up-to-date CASIA-SURF Cross-ethnicity Face Anti-spoofing(CeFA) dataset, covering 3 ethnicities, 3 modalities, 1607 subjects, and 2D plus 3D attack types in four protocols, and focusing on the challenge of improving the generalization capability of face anti-spoofing in cross-ethnicity and multi-modal continuous data. In this paper, we propose a novel pipeline-based multi-stream CNN architecture called PipeNet for multi-modal face anti-spoofing. Unlike previous works, Selective Modal Pipeline (SMP) is designed to enable a customized pipeline for each data modality to take full advantage of multi-modal data. Limited Frame Vote (LFV) is designed to ensure stable and accurate prediction for video classification. The proposed method wins the third place in the final ranking of Chalearn Multi-modal Cross-ethnicity Face Anti-spoofing Recognition Challenge@CVPR2020. Our final submission achieves the Average Classification Error Rate (ACER) of 2.21 with Standard Deviation of 1.26 on the test set.

cs.CV↗

arXiv2019

Low-Latency High-Level Data Sharing for Connected and Autonomous Vehicular Networks

Autonomous vehicles can combine their own data with that of other vehicles to enhance their perceptive ability, and thus improve detection accuracy and driving safety. Data sharing among autonomous vehicles, however, is a challenging problem due to the sheer volume of data generated by various types of sensors on the vehicles. In this paper, we propose a low-latency, high-level (L3) data sharing protocol for connected and autonomous vehicular networks. Based on the L3 protocol, sensing results generated by individual vehicles will be broadcasted simultaneously within a limited sensing zone. The L3 protocol reduces the networking latency by taking advantage of the capture effect of the wireless transmissions occurred among vehicles. With the proposed design principles, we implement and test the L3 protocol in a simulated environment. Simulation results demonstrate that the L3 protocol is able to achieve reliable and fast data sharing among autonomous vehicles.

cs.NI↗

arXiv2019

A Probabilistic Graph Model for Trust Opinion Estimation in Online Social Networks

Trust assessment plays a key role in many online applications, such as online money lending, product reviewing and active friending. Trust models usually employ a group of parameters to represent the trust relation between a trustor-trustee pair. These parameters are originated from the trustor's bias and opinion on the trustee. Naturally, these parameters can be regarded as a vector. To address this problem, we propose a framework to accurately convert the single values to the parameters needed by 3VSL. The framework firstly employs a probabilistic graph model (PGM) to derive the trustor's opinion and bias to his rating on the trustee.

cs.SI↗

arXiv2019

Trust Assessment in Online Social Networks

Assessing trust in online social networks (OSNs) is critical for many applications such as online marketing and network security. It is a challenging problem, however, due to the difficulties of handling complex social network topologies and conducting accurate assessment in these topologies. To address these challenges, we model trust by proposing the three-valued subjective logic (3VSL) model. 3VSL properly models the uncertainties that exist in trust, thus is able to compute trust in arbitrary graphs. We theoretically prove the capability of 3VSL based on the Dirichlet-Categorical (DC) distribution and its correctness in arbitrary OSN topologies. Based on the 3VSL model, we further design the AssessTrust (AT) algorithm to accurately compute the trust between any two users connected in an OSN. We validate 3VSL against two real-world OSN datasets: Advogato and Pretty Good Privacy (PGP). Experimental results indicate that 3VSL can accurately model the trust between any pair of indirectly connected users in the Advogato and PGP.

cs.SI↗

arXiv2019

Joint Regularization on Activations and Weights for Efficient Neural Network Pruning

With the rapid scaling up of deep neural networks (DNNs), extensive research studies on network model compression such as weight pruning have been performed for improving deployment efficiency. This work aims to advance the compression beyond the weights to neuron activations. We propose the joint regularization technique which simultaneously regulates the distribution of weights and activations. By distinguishing and leveraging the significance difference among neuron responses and connections during learning, the jointly pruned network, namely \textit{JPnet}, optimizes the sparsity of activations and weights for improving execution efficiency. The derived deep sparsification of JPnet reveals more optimization space for the existing DNN accelerators dedicated for sparse matrix operations. We thoroughly evaluate the effectiveness of joint regularization through various network models with different activation functions and on different datasets. With $0.4\%$ degradation constraint on inference accuracy, a JPnet can save $72.3\% \sim 98.8\%$ of computation cost compared to the original dense models, with up to $5.2\times$ and $12.3\times$ reductions in activation and weight numbers, respectively.

cs.LG↗