Searcharxiv⌕ Search

arXiv subjects

Wenbo Wang

Publications and source records attributed to Wenbo Wang.

At least 91 records · Page 5Linked to original sources

Low-dimensional Denoising Embedding Transformer for ECG Classification

The transformer based model (e.g., FusingTF) has been employed recently for Electrocardiogram (ECG) signal classification. However, the high-dimensional embedding obtained via 1-D convolution and positional encoding can lead to the loss of the signal's own temporal information and a large amount of training parameters. In this paper, we propose a new method for ECG classification, called low-dimensional denoising embedding transformer (LDTF), which contains two components, i.e., low-dimensional denoising embedding (LDE) and transformer learning. In the LDE component, a low-dimensional representation of the signal is obtained in the time-frequency domain while preserving its own temporal information. And with the low dimensional embedding, the transformer learning is then used to obtain a deeper and narrower structure with fewer training parameters than that of the FusingTF. Experiments conducted on the MIT-BIH dataset demonstrates the effectiveness and the superior performance of our proposed method, as compared with state-of-the-art methods.

eess.SP↗

Transmission-and-Distribution Frequency Dynamic Co-Simulation Framework for Distributed Energy Resources Frequency Response

The rapid deployment of distributed energy resources (DERs) in distribution networks has brought challenges to balance the system and stabilize frequency. DERs have the ability to provide frequency regulation; however, existing dynamic frequency simulation tools-which were developed mainly for the transmission system-lack the capability to simulate distribution network dynamics with high penetrations of DERs. Although electromagnetic transient (EMT) simulation tools can simulate distribution network dynamics, the computation efficiency limits their use for large-scale transmission-and-distribution (T&D) simulations. This paper presents an efficient T&D dynamic frequency co-simulation framework for DER frequency response based on the HELICS platform and existing off-the-shelf simulators. The challenge of synchronizing frequency between the transmission network and DERs hosted in the distribution network is approached by detailed modeling of DERs in frequency dynamic models while DER phasor models are also preserved in the distribution networks. Thereby, local voltage constraints can be respected when dispatching the DER power for frequency response. The DER frequency responses (primary and secondary)-are simulated in case studies to validate the proposed framework. Lastly, fault-induced delayed voltage recovery (FIDVR) event of a large system is presented to demonstrate the efficiency and effectiveness of the overall framework.

eess.SY↗

Graph Learning for Spatiotemporal Signals with Long- and Short-Term Characterization

Mining natural associations from high-dimensional spatiotemporal signals plays an important role in various fields including biology, climatology, and financial analysis. However, most existing works have mainly studied time-independent signals without considering the correlations of spatiotemporal signals that achieve high learning accuracy. This paper aims to learn graphs that better reflect underlying data relations by leveraging the long- and short-term characteristics of spatiotemporal signals. First, a spatiotemporal signal model is presented that considers both spatial and temporal relations. In particular, we integrate a low-rank representation and a Gaussian Markov process to describe the temporal correlations. Then, the graph learning problem is formulated as a joint low-rank component estimation and graph Laplacian inference. Accordingly, we propose a low rank and spatiotemporal smoothness-based graph learning method (GL-LRSS), which introduces a spatiotemporal smoothness prior into time-vertex signal analysis. By jointly exploiting the low rank of long-time observations and the smoothness of short-time observations, the overall learning performance can be effectively improved. Experiments on both synthetic and real-world datasets demonstrate substantial improvements in the learning accuracy of the proposed method over the state-of-the-art low-rank component estimation and graph learning methods.

cs.SI↗

Adaptive Offline and Online Similarity-Based Caching

With similarity-based content delivery, the request for a content can be satisfied by delivering a related content under a dissimilarity cost. This letter addresses the joint optimization of caching and similarity-based delivery decisions across a network so as to minimize the weighted sum of average delay and dissimilarity cost. A convergent alternate gradient descent ascent algorithm is first introduced for an offline scenario with prior knowledge of the request rates, and then extended to an online setting. Numerical results validate the advantages of the approach with respect to standard per-cache solutions.

cs.NI↗

Parametric Sparse Bayesian Dictionary Learning for Multiple Sources Localization with Propagation Parameters Uncertainty and Nonuniform Noise

Received signal strength (RSS) based source localization method is popular due to its simplicity and low cost. However, this method is highly dependent on the propagation model which is not easy to be captured in practice. Moreover, most existing works only consider the single source and the identical measurement noise scenario, while in practice multiple co-channel sources may transmit simultaneously, and the measurement noise tends to be nonuniform. In this paper, we study the multiple co-channel sources localization (MSL) problem under unknown nonuniform noise, while jointly estimating the parametric propagation model. Specifically, we model the MSL problem as being parameterized by the unknown source locations and propagation parameters, and then reformulate it as a joint parametric sparsifying dictionary learning (PSDL) and sparse signal recovery (SSR) problem which is solved under the framework of sparse Bayesian learning with iterative parametric dictionary approximation. Furthermore, multiple snapshot measurements are utilized to improve the localization accuracy, and the Cramer-Rao lower bound (CRLB) is derived to analyze the theoretical estimation error bound. Comparing with the state-of-the-art sparsity-based MSL algorithms as well as CRLB, extensive simulations show the importance of jointly inferring the propagation parameters,and highlight the effectiveness and superiority of the proposed method.

eess.SP↗

Giant topological Hall effect in correlated oxide thin films

Strong electronic correlations can produce remarkable phenomena such as metal-insulator transitions and greatly enhance superconductivity, thermoelectricity, or optical non-linearity. In correlated systems, spatially varying charge textures also amplify magnetoelectric effects or electroresistance in mesostructures. However, how spatially varying spin textures may influence electron transport in the presence of correlations remains unclear. Here we demonstrate a very large topological Hall effect (THE) in thin films of a lightly electron-doped charge-transfer insulator, (Ca, Ce)MnO3. Magnetic force microscopy reveals the presence of magnetic bubbles, whose density vs. magnetic field peaks near the THE maximum, as is expected to occur in skyrmion systems. The THE critically depends on carrier concentration and diverges at low doping, near the metal-insulator transition. We discuss the strong amplification of the THE by correlation effects and give perspectives for its non-volatile control by electric fields.

cond-mat.mtrl-sci↗

Spin chirality fluctuation in two-dimensional ferromagnets with perpendicular anisotropy

Non-coplanar spin textures with scalar spin chirality can generate effective magnetic field that deflects the motion of charge carriers, resulting in topological Hall effect (THE), a powerful probe of the ground state and low-energy excitations of correlated systems. However, spin chirality fluctuation in two-dimensional ferromagnets with perpendicular anisotropy has not been considered in prior studies. Herein, we report direct evidence of universal spin chirality fluctuation by probing the THE above the transition temperatures in two different ferromagnetic ultra-thin films, SrRuO$_3$ and V doped Sb$_2$Te$_3$. The temperature, magnetic field, thickness, and carrier type dependences of the THE signal, along with our Monte-Carlo simulations, unambiguously demonstrate that the spin chirality fluctuation is a universal phenomenon in two-dimensional Ising ferromagnets. Our discovery opens a new paradigm of exploring the spin chirality with topological Hall transport in two-dimensional magnets and beyond

cond-mat.mtrl-sci↗

On Cyber Risk Management of Blockchain Networks: A Game Theoretic Approach

Open-access blockchains based on proof-of-work protocols have gained tremendous popularity for their capabilities of providing decentralized tamper-proof ledgers and platforms for data-driven autonomous organization. Nevertheless, the proof-of-work based consensus protocols are vulnerable to cyber-attacks such as double-spending. In this paper, we propose a novel approach of cyber risk management for blockchain-based service. In particular, we adopt the cyber-insurance as an economic tool for neutralizing cyber risks due to attacks in blockchain networks. We consider a blockchain service market, which is composed of the infrastructure provider, the blockchain provider, the cyber-insurer, and the users. The blockchain provider purchases from the infrastructure provider, e.g., a cloud, the computing resources to maintain the blockchain consensus, and then offers blockchain services to the users. The blockchain provider strategizes its investment in the infrastructure and the service price charged to the users, in order to improve the security of the blockchain and thus optimize its profit. Meanwhile, the blockchain provider also purchases a cyber-insurance from the cyber-insurer to protect itself from the potential damage due to the attacks. In return, the cyber-insurer adjusts the insurance premium according to the perceived risk level of the blockchain service. Based on the assumption of rationality for the market entities, we model the interaction among the blockchain provider, the users, and the cyber-insurer as a two-level Stackelberg game. Namely, the blockchain provider and the cyber-insurer lead to set their pricing/investment strategies, and then the users follow to determine their demand of the blockchain service. Specifically, we consider the scenario of double-spending attacks and provide a series of analytical results about the Stackelberg equilibrium in the market game.

cs.CR↗

A Survey on Applications of Game Theory in Blockchain

In the past decades, the blockchain technology has attracted tremendous attention from both academia and industry. The popularity of blockchain networks was originated from a crypto-currency to serve as a decentralized and tamperproof transaction data ledger. Nowadays, blockchain as the key framework in the decentralized public data-ledger, has been applied to a wide range of scenarios far beyond crypto-currencies, such as Internet of Things (IoT), healthcare, and insurance. This survey aims to fill the gap between the large number of studies on blockchain network, where game theory emerges as an analytical tool, and the lack of a comprehensive survey on the game theoretical approaches applied in blockchain related issues. In this paper, we review game models proposed to address common issues in the blockchain network. The issues include security issues, e.g., selfish mining, majority attack and Denial of Service (DoS) attack, issues regard mining management, e.g., computational power allocation, reward allocation, and pool selection, as well as issues regarding blockchain economic and energy trading. Additionally, we discuss advantages and disadvantages of these selected game models and solutions. Finally, we highlight important challenges and future research directions of applying game theoretical approaches to incentive mechanism design, and the combination of blockchain with other technologies.

cs.GT↗

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves the OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve an improvement of more than tenfold in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

math.OC↗

A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks

The past decade has witnessed the rapid evolution in blockchain technologies, which has attracted tremendous interests from both the research communities and industries. The blockchain network was originated from the Internet financial sector as a decentralized, immutable ledger system for transactional data ordering. Nowadays, it is envisioned as a powerful backbone/framework for decentralized data processing and data-driven self-organization in flat, open-access networks. In particular, the plausible characteristics of decentralization, immutability and self-organization are primarily owing to the unique decentralized consensus mechanisms introduced by blockchain networks. This survey is motivated by the lack of a comprehensive literature review on the development of decentralized consensus mechanisms in blockchain networks. In this survey, we provide a systematic vision of the organization of blockchain networks. By emphasizing the unique characteristics of incentivized consensus in blockchain networks, our in-depth review of the state-of-the-art consensus protocols is focused on both the perspective of distributed consensus system design and the perspective of incentive mechanism design. From a game-theoretic point of view, we also provide a thorough review on the strategy adoption for self-organization by the individual nodes in the blockchain backbone networks. Consequently, we provide a comprehensive survey on the emerging applications of the blockchain networks in a wide range of areas. We highlight our special interest in how the consensus mechanisms impact these applications. Finally, we discuss several open issues in the protocol design for blockchain consensus and the related potential research directions.

cs.CR↗

Cloud/fog computing resource management and pricing for blockchain networks

The mining process in blockchain requires solving a proof-of-work puzzle, which is resource expensive to implement in mobile devices due to the high computing power and energy needed. In this paper, we, for the first time, consider edge computing as an enabler for mobile blockchain. In particular, we study edge computing resource management and pricing to support mobile blockchain applications in which the mining process of miners can be offloaded to an edge computing service provider. We formulate a two-stage Stackelberg game to jointly maximize the profit of the edge computing service provider and the individual utilities of the miners. In the first stage, the service provider sets the price of edge computing nodes. In the second stage, the miners decide on the service demand to purchase based on the observed prices. We apply the backward induction to analyze the sub-game perfect equilibrium in each stage for both uniform and discriminatory pricing schemes. For the uniform pricing where the same price is applied to all miners, the existence and uniqueness of Stackelberg equilibrium are validated by identifying the best response strategies of the miners. For the discriminatory pricing where the different prices are applied to different miners, the Stackelberg equilibrium is proved to exist and be unique by capitalizing on the Variational Inequality theory. Further, the real experimental results are employed to justify our proposed model.

cs.CR↗

Evolutionary Game for Consensus Provision in Permissionless Blockchain Networks with Shard

With the development of decentralized consensus protocols, permissionless blockchains have been envisioned as a promising enabler for the general-purpose transaction-driven, autonomous systems. However, most of the prevalent blockchain networks are built upon the consensus protocols under the crypto-puzzle framework known as proof-of-work. Such protocols face the inherent problem of transaction-processing bottleneck, as the networks achieve the decentralized consensus for transaction confirmation at the cost of very high latency. In this paper, we study the problem of consensus formation in a system of multiple throughput-scalable blockchains with sharded consensus. Specifically, the protocol design of sharded consensus not only enables parallelizing the process of transaction validation with sub-groups of processors, but also introduces the Byzantine consensus protocols for accelerating the consensus processes. By allowing different blockchains to impose different levels of processing fees and to have different transaction-generating rate, we aim to simulate the multi-service provision eco-systems based on blockchains in real world. We focus on the dynamics of blockchain-selection in the condition of a large population of consensus processors. Hence, we model the evolution of blockchain selection by the individual processors as an evolutionary game. Both the theoretical and the numerical analysis are provided regarding the evolutionary equilibria and the stability of the processors' strategies in a general case.

cs.GT↗

Learning Confidence Sets using Support Vector Machines

The goal of confidence-set learning in the binary classification setting is to construct two sets, each with a specific probability guarantee to cover a class. An observation outside the overlap of the two sets is deemed to be from one of the two classes, while the overlap is an ambiguity region which could belong to either class. Instead of plug-in approaches, we propose a support vector classifier to construct confidence sets in a flexible manner. Theoretically, we show that the proposed learner can control the non-coverage rates and minimize the ambiguity with high probability. Efficient algorithms are developed and numerical studies illustrate the effectiveness of the proposed method.

stat.ML↗

Competitive Data Trading in Wireless-Powered Internet of Things (IoT) Crowdsensing Systems with Blockchain

With the explosive growth of smart IoT devices at the edge of the Internet, embedding sensors on mobile devices for massive data collection and collective environment sensing has been envisioned as a cost-effective solution for IoT applications. However, existing IoT platforms and framework rely on dedicated middleware for (semi-) centralized task dispatching, data storage and incentive provision. Consequently, they are usually expensive to deploy, have limited adaptability to diverse requirements, and face a series of data security and privacy issues. In this paper, we employ permissionless blockchains to construct a purely decentralized platform for data storage and trading in a wireless-powered IoT crowdsensing system. In the system, IoT sensors use power wirelessly transferred from RF-energy beacons for data sensing and transmission to an access point. The data is then forwarded to the blockchain for distributed ledger services, i.e., data/transaction verification, recording, and maintenance. Due to coupled interference of wireless transmission and transaction fee incurred from blockchain's distributed ledger services, rational sensors have to decide on their transmission rates to maximize individual utility. Thus, we formulate a noncooperative game model to analyze this competitive situation among the sensors. We provide the analytical condition for the existence of the Nash equilibrium as well as a series of insightful numerical results about the equilibrium strategies in the game.

cs.NI↗

A Hierarchical Game with Strategy Evolution for Mobile Sponsored Content and Service Markets

In sponsored content and service markets, the content and service providers are able to subsidize their target mobile users through directly paying the mobile network operator, to lower the price of the data/service access charged by the network operator to the mobile users. The sponsoring mechanism leads to a surge in mobile data and service demand, which in return compensates for the sponsoring cost and benefits the content/service providers. In this paper, we study the interactions among the three parties in the market, namely, the mobile users, the content/service providers and the network operator, as a two-level game with multiple Stackelberg (i.e., leader) players. Our study is featured by the consideration of global network effects owning to consumers' grouping. Since the mobile users may have bounded rationality, we model the service-selection process among them as an evolutionary-population follower sub-game. Meanwhile, we model the pricing-then-sponsoring process between the content/service providers and the network operator as a non-cooperative equilibrium searching problem. By investigating the structure of the proposed game, we reveal a few important properties regarding the equilibrium existence, and propose a distributed, projection-based algorithm for iterative equilibrium searching. Simulation results validate the convergence of the proposed algorithm, and demonstrate how sponsoring helps improve both the providers' profits and the users' experience.

cs.NI↗

Interferometric Imaging of Nonlocal Electromechanical Power Transduction in Ferroelectric Domains

The electrical generation and detection of elastic waves are the foundation for acousto-electronic and acousto-optic systems. For surface-acoustic-wave devices, micro-/nano-electromechanical systems, and phononic crystals, tailoring the spatial variation of material properties such as piezoelectric and elastic tensors may bring significant improvements to the system performance. Due to the much smaller speed of sound than speed of light in solids, it is desirable to study various electroacoustic behaviors at the mesoscopic length scale. In this work, we demonstrate the interferometric imaging of electromechanical power transduction in ferroelectric lithium niobate domain structures by microwave impedance microscopy. In sharp contrast to the traditional standing-wave patterns caused by the superposition of counter-propagating waves, the constructive and destructive fringes in microwave dissipation images exhibit an intriguing one-wavelength periodicity. We show that such unusual interference patterns, which are fundamentally different from the acoustic displacement fields, stem from the nonlocal interaction between electric fields and elastic waves. The results are corroborated by numerical simulations taking into account the sign reversal of piezoelectric tensor in oppositely polarized domains. Our work paves new ways to probe nanoscale electroacoustic phenomena in complex structures by near-field electromagnetic imaging.

cond-mat.mes-hall↗

Direct evidence of ferromagnetism in a quantum anomalous Hall system

Quantum anomalous Hall (QAH) systems are of great fundamental interest and potential application because of their dissipationless conduction without the need for external magnetic field. The QAH effect has been realized in magnetically doped topological insulator thin films. However, full quantization requires extremely low temperature ($T< 50\,$mK) in the initial works, though it has been significantly improved with modulation doping or co-doping of magnetic elements. Improved ferromagnetism has been shown in these thin films, yet direct evidence of long-range ferromagnetic order is lacking. Herein, we present direct visualization of long-range ferromagnetic order in thin films of Cr and V co-doped (Bi,Sb)$_2$Te$_3$ using low-temperature magnetic force microscopy with $\textit{in-situ}$ transport. The magnetization reversal process reveals typical ferromagnetic domain behavior, i.e., domain nucleation and possibly domain wall propagation, in contrast to much weaker magnetic signals observed in the end members, possibly due to superparamagnetic behavior. The observed long-range ferromagnetic order resolves one of the major challenges in QAH systems, and paves the way to high-temperature dissipationless conduction by exploring magnetic topological insulators.

cond-mat.mtrl-sci↗