Searcharxiv⌕ Search

arXiv subjects

Yao Sun

Publications and source records attributed to Yao Sun.

At least 73 records · Page 4Linked to original sources

Resource Consumption for Supporting Federated Learning in Wireless Networks

Federated learning (FL) has recently become one of the hottest focuses in wireless edge networks with the ever-increasing computing capability of user equipment (UE). In FL, UEs train local machine learning models and transmit them to an aggregator, where a global model is formed and then sent back to UEs. In wireless networks, local training and model transmission can be unsuccessful due to constrained computing resources, wireless channel impairments, bandwidth limitations, etc., which degrades FL performance in model accuracy and/or training time. Moreover, we need to quantify the benefits and cost of deploying edge intelligence, as model training and transmission consume certain amount of resources. Therefore, it is imperative to deeply understand the relationship between FL performance and multiple-dimensional resources. In this paper, we construct an analytical model to investigate the relationship between the FL model accuracy and consumed resources in FL empowered wireless edge networks. Based on the analytical model, we explicitly quantify the model accuracy, available computing resources and communication resources. Numerical results validate the effectiveness of our theoretical modeling and analysis, and demonstrate the trade-off between the communication and computing resources for achieving a certain model accuracy.

cs.NI↗

An Ultra-Reliable Low-Latency Non-Binary Polar Coded SCMA Scheme

The joint transmission scheme of polar codes and sparse code multiple access (SCMA) has been regarded as a promising technology for future wireless communication systems. However, most of the existing polar-coded SCMA (PC-SCMA) systems suffer from high latency caused by the feedback iteration and list decoding. In addition, the error performance of PC-SCMA systems is unsatisfactory for ultra-reliable transmission. Inspired by the compelling benefits of non-binary polar codes, in this paper, we design a non-binary polar-coded SCMA (NB-PC-SCMA) system with a free order matching strategy to address the issues of delay and reliability. Specifically, we first formulate a joint factor graph for NB-PC-SCMA and propose a non-binary successive cancellation list (NB-SCL) and damping based joint iterative detection and decoding (NSD-JIDD) multiuser receiver to improve the BER and latency performance. Then, a lazy-search based NB-SCL (L-NB-SCL) decoding is proposed to reduce the computational complexity by simplifying the path search pattern of the list decoder. After that, we modify the update of user nodes for SCMA detection to improve the convergence error and finally propose the improved NSD-JIDD (ISD-JIDD) algorithm, which can avoid redundant operations by exploiting L-NB-SCL decoding. Simulation results show that the proposed NB-PC-SCMA system achieves better bit error rate (BER) performance and considerable latency gain when compared to its counterparts. In particular, the proposed ISD-JIDD can achieve similar BER performance of NSD-JIDD with less complexity.

cs.IT↗

Metaverse Native Communication: A Blockchain and Spectrum Prospective

Metaverse depicts a vista of constructing a virtual environment parallel to the real world so people can communicate with others and objects through digital entities. In the real world, communication relies on identities and addresses that are recognized by authorities, no matter the link is established via post, email, mobile phone, or landline. Metaverse, however, is different from the real world, which requires a single identity belongs to the individual. This identity can be an encrypted virtual address in the metaverse but no one can trace or verify it. In order to achieve such addresses to hide individuals in the metaverse, re-mapping the virtual address to the individual's identity and a specific spectrum to support the address-based communication for the metaverse are needed. Therefore, metaverse native or meta-native communications based on blockchain could be a promising solution to directly connect entities with their native encrypted addresses that gets rid of the existing network services based on IP, cellular, HTTP, etc. This paper proposes a vision of blockchain, encrypted address and address-based access model for all users, devices, services, etc. to contribute to the metaverse. Furthermore, the allocation architecture of a designated spectrum for the metaverse is proposed to remove the barrier to access to the metaverse/blockchain in response to the initiatives of metaverse and decentralized Internet.

cs.DC↗

Wireless Resource Management in Intelligent Semantic Communication Networks

The prosperity of artificial intelligence (AI) has laid a promising paradigm of communication system, i.e., intelligent semantic communication (ISC), where semantic contents, instead of traditional bit sequences, are coded by AI models for efficient communication. Due to the unique demand of background knowledge for semantic recovery, wireless resource management faces new challenges in ISC. In this paper, we address the user association (UA) and bandwidth allocation (BA) problems in an ISC-enabled heterogeneous network (ISC-HetNet). We first introduce the auxiliary knowledge base (KB) into the system model, and develop a new performance metric for the ISC-HetNet, named system throughput in message (STM). Joint optimization of UA and BA is then formulated with the aim of STM maximization subject to KB matching and wireless bandwidth constraints. To this end, we propose a two-stage solution, including a stochastic programming method in the first stage to obtain a deterministic objective with semantic confidence, and a heuristic algorithm in the second stage to reach the optimality of UA and BA. Numerical results show great superiority and reliability of our proposed solution on the STM performance when compared with two baseline algorithms.

cs.NI↗

Smart and Secure CAV Networks Empowered by AI-Enabled Blockchain: The Next Frontier for Intelligent Safe Driving Assessment

Securing safe driving for connected and autonomous vehicles (CAVs) continues to be a widespread concern, despite various sophisticated functions delivered by artificial intelligence for in-vehicle devices. Diverse malicious network attacks are ubiquitous, along with the worldwide implementation of the Internet of Vehicles, which exposes a range of reliability and privacy threats for managing data in CAV networks. Combined with the fact that the capability of existing CAVs in handling intensive computation tasks is limited, this implies a need for designing an efficient assessment system to guarantee autonomous driving safety without compromising data security. In this article we propose a novel framework, namely Blockchain-enabled intElligent Safe-driving assessmenT (BEST), which offers a smart and reliable approach for conducting safe driving supervision while protecting vehicular information. Specifically, a promising solution that exploits a long short-term memory model is introduced to assess the safety level of the moving CAVs. Then we investigate how a distributed blockchain obtains adequate trustworthiness and robustness for CAV data by adopting a byzantine fault tolerance-based delegated proof-of-stake consensus mechanism. Simulation results demonstrate that our presented BEST gains better data credibility with a higher prediction accuracy for vehicular safety assessment when compared with existing schemes. Finally, we discuss several open challenges that need to be addressed in future CAV networks.

cs.NI↗

Large-scale Building Height Retrieval from Single SAR Imagery based on Bounding Box Regression Networks

Building height retrieval from synthetic aperture radar (SAR) imagery is of great importance for urban applications, yet highly challenging owing to the complexity of SAR data. This paper addresses the issue of building height retrieval in large-scale urban areas from a single TerraSAR-X spotlight or stripmap image. Based on the radar viewing geometry, we propose that this problem can be formulated as a bounding box regression problem and therefore allows for integrating height data from multiple data sources in generating ground truth on a larger scale. We introduce building footprints from geographic information system (GIS) data as complementary information and propose a bounding box regression network that exploits the location relationship between a building's footprint and its bounding box, allowing for fast computation. This is important for large-scale applications. The method is validated on four urban data sets using TerraSAR-X images in both high-resolution spotlight and stripmap modes. Experimental results show that the proposed network can reduce the computation cost significantly while keeping the height accuracy of individual buildings compared to a Faster R-CNN based method. Moreover, we investigate the impact of inaccurate GIS data on our proposed network, and this study shows that the bounding box regression network is robust against positioning errors in GIS data. The proposed method has great potential to be applied to regional or even global scales.

eess.IV↗

CG-Net: Conditional GIS-aware Network for Individual Building Segmentation in VHR SAR Images

Object retrieval and reconstruction from very high resolution (VHR) synthetic aperture radar (SAR) images are of great importance for urban SAR applications, yet highly challenging owing to the complexity of SAR data. This paper addresses the issue of individual building segmentation from a single VHR SAR image in large-scale urban areas. To achieve this, we introduce building footprints from GIS data as complementary information and propose a novel conditional GIS-aware network (CG-Net). The proposed model learns multi-level visual features and employs building footprints to normalize the features for predicting building masks in the SAR image. We validate our method using a high resolution spotlight TerraSAR-X image collected over Berlin. Experimental results show that the proposed CG-Net effectively brings improvements with variant backbones. We further compare two representations of building footprints, namely complete building footprints and sensor-visible footprint segments, for our task, and conclude that the use of the former leads to better segmentation results. Moreover, we investigate the impact of inaccurate GIS data on our CG-Net, and this study shows that CG-Net is robust against positioning errors in GIS data. In addition, we propose an approach of ground truth generation of buildings from an accurate digital elevation model (DEM), which can be used to generate large-scale SAR image datasets. The segmentation results can be applied to reconstruct 3D building models at level-of-detail (LoD) 1, which is demonstrated in our experiments.

eess.IV↗

Instance segmentation of buildings using keypoints

Building segmentation is of great importance in the task of remote sensing imagery interpretation. However, the existing semantic segmentation and instance segmentation methods often lead to segmentation masks with blurred boundaries. In this paper, we propose a novel instance segmentation network for building segmentation in high-resolution remote sensing images. More specifically, we consider segmenting an individual building as detecting several keypoints. The detected keypoints are subsequently reformulated as a closed polygon, which is the semantic boundary of the building. By doing so, the sharp boundary of the building could be preserved. Experiments are conducted on selected Aerial Imagery for Roof Segmentation (AIRS) dataset, and our method achieves better performance in both quantitative and qualitative results with comparison to the state-of-the-art methods. Our network is a bottom-up instance segmentation method that could well preserve geometric details.

cs.CV↗

Numerical schemes to reconstruct three dimensional time-dependent point sources of acoustic waves

This paper is concerned with the numerical simulation of three dimensional time-dependent inverse source problems of acoustic waves. The reconstructions of both multiple stationary point sources and a moving point source are considered. The modified method of fundamental solutions (MMFS), which expands the solution utilizing the time convolution of the Green's function and the signal function, is proposed to solve the problem. For the reconstruction of a moving point source, moreover, the MMFS is simplified as a simple sampling method at each time step. Numerical experiments are provided to show the effectiveness of the proposed methods.

math.NA↗

JULOC: A Local 3-D Refined Crust Model for the Geoneutrino Measurement at JUNO

Geothermal energy is the key to drive the plate tectonics and interior thermodynamics of the Earth. The surface heat flux, as measured in boreholes, provide limited insights into the relative contributions of primordial versus radiogenic sources of the heat budget of the mantle. Geoneutrinos, electron antineutrinos that produced from the radioactive decay of the heat producing elements, are unique probes that bring direct information about the amount and distribution of heat producing elements in the crust and mantle. Cosmochemical, geochemical, and geodynamic compositional models of the Bulk Silicate Earth (BSE) individually predicts different mantle neutrino fluxes, and therefore can be distinguished by the direct measurement of geoneutrinos. The 20 kton detector of the Jiangmen Underground Neutrino Observatory (JUNO), currently under construction in the Guangdong Province (China), is expected to provide an exciting opportunity to obtain a high statistics measurement, which will produce sufficient data to address several key questions of geological importance. To test different compositional models of the mantle, an accurate estimation of the crust geoneutrino flux based on a three-dimensional (3-D) crust model in advance is important. This paper presents a 3-D crust model over a surface area of 10-degrees-times-10-degrees grid surrounding the JUNO detector and a depth down to the Moho discontinuity, based on the geological, geophysical and geochemistry properties. The 3-D model provides a distinction of the volumes of the different geological layers together with the corresponding Th and U abundances. We also present our predicted local contribution to the total geoneutrino flux and the corresponding radiogenic heat.

physics.geo-ph↗

So2Sat LCZ42: A Benchmark Dataset for Global Local Climate Zones Classification

Access to labeled reference data is one of the grand challenges in supervised machine learning endeavors. This is especially true for an automated analysis of remote sensing images on a global scale, which enables us to address global challenges such as urbanization and climate change using state-of-the-art machine learning techniques. To meet these pressing needs, especially in urban research, we provide open access to a valuable benchmark dataset named "So2Sat LCZ42," which consists of local climate zone (LCZ) labels of about half a million Sentinel-1 and Sentinel-2 image patches in 42 urban agglomerations (plus 10 additional smaller areas) across the globe. This dataset was labeled by 15 domain experts following a carefully designed labeling work flow and evaluation process over a period of six months. As rarely done in other labeled remote sensing dataset, we conducted rigorous quality assessment by domain experts. The dataset achieved an overall confidence of 85%. We believe this LCZ dataset is a first step towards an unbiased globallydistributed dataset for urban growth monitoring using machine learning methods, because LCZ provide a rather objective measure other than many other semantic land use and land cover classifications. It provides measures of the morphology, compactness, and height of urban areas, which are less dependent on human and culture. This dataset can be accessed from http://doi.org/10.14459/2018mp1483140.

cs.CV↗

An Interleaving Hybrid Consensus Protocol

We introduce Unity Interleave, a new consensus algorithm for public blockchain settings. It is an eventual consistency protocol merging the Proof-of-Work (PoW) and Proof-of-Stake (PoS) into a coherent stochastic process. It builds upon research previously done for the Unity protocol, improving security while maintaining fairness and scalability.

cs.CR↗

On the Efficiency of Solving Boolean Polynomial Systems with the Characteristic Set Method

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain pseudo-remainders. Three important techniques are applied in the algorithm. The first one is eliminating variables by new generated linear polynomials. The second one is optimizing the strategy of choosing polynomial for zero decomposition. The third one is to compute add-remainders to eliminate the leading variable of new generated monic polynomials. By analyzing the depth of the zero decomposition tree, we present some complexity bounds of this algorithm, which are lower than the complexity bounds of previous characteristic set algorithms. Extensive experimental results show that this new algorithm is more efficient than previous characteristic set algorithms for solving Boolean polynomial systems.

cs.SC↗

Power Factor Angle Droop Control-A General Decentralized Control of Cascaded inverters

This letter proposes a general decentralized control of cascaded inverters-power factor angle droop control. Compared to the existing control strategies, it has the following attractive benefits: 1) it is suitable for both grid-connected and islanded modes; 2) Seamless transition between different modes can be obtained; 3) stability condition in the grid-connected mode is independent of the transmission line impedance; 4) it is suited for any types of loads in islanded modes; 5) multi-equilibrium point problem is avoided; 6) it is suitable for four quadrant operation. The small signal stability of the control is proved. And the feasibility of the proposed method is verified by simulation.

eess.SY↗

A Unifying Hybrid Consensus Protocol

We introduce Unity, a new consensus algorithm for public blockchain settings. Unity is an eventual consistency protocol merging the Proof-of-Work (PoW) and Proof-of-Stake (PoS) into a coherent stochastic process. It encompasses hardware and economic security without sacrificing availability, unpredictability and decentralization. Empirical results indicate that the proposed protocol is fair and scalable to an arbitrary number of miners and stakers.

cs.CR↗

Efforts estimation of doctors annotating medical image

Accurate annotation of medical image is the crucial step for image AI clinical application. However, annotating medical image will incur a great deal of annotation effort and expense due to its high complexity and needing experienced doctors. To alleviate annotation cost, some active learning methods are proposed. But such methods just cut the number of annotation candidates and do not study how many efforts the doctor will exactly take, which is not enough since even annotating a small amount of medical data will take a lot of time for the doctor. In this paper, we propose a new criterion to evaluate efforts of doctors annotating medical image. First, by coming active learning and U-shape network, we employ a suggestive annotation strategy to choose the most effective annotation candidates. Then we exploit a fine annotation platform to alleviate annotating efforts on each candidate and first utilize a new criterion to quantitatively calculate the efforts taken by doctors. In our work, we take MR brain tissue segmentation as an example to evaluate the proposed method. Extensive experiments on the well-known IBSR18 dataset and MRBrainS18 Challenge dataset show that, using proposed strategy, state-of-the-art segmentation performance can be achieved by using only 60% annotation candidates and annotation efforts can be alleviated by at least 44%, 44%, 47% on CSF, GM, WM separately.

cs.LG↗

An Improved Decentralized Control of Grid-Connected Cascaded Inverters with Different Power Capacities

The existing decentralized control for cascaded inverters is based on the assumption that all modules have same capacities, and a local fixed-amplitude-varied-phase voltage control is adopted for each inverter module. However, available source power capacities of cascaded inverters may be different in some practical applications. To address this issue, this letter proposes an improved decentralized control scheme, in which the voltage amplitudes are varied according to their individual available powers. Moreover, a power factor consistency control is proposed to achieve autonomous voltage phase synchronization. The steady-state analysis and synchronization mechanism of cascaded inverters are illustrated. In addition, the proposed strategy has other advantages, such as adjustable grid power factor and immune to the grid voltage fault. The effectiveness of the proposed control is tested by experiments.

eess.SP↗

Variation of Contact Resonance Frequency during Domain Switching in PFM Measurements for Ferroelectric Materials

Piezoresponse Force Spectroscopy (PFS) is a powerful method widely used for measuring the nanoscale ferroelectric responses of the materials. However, it is found that certain non-ferroelectric materials can also generate similar responses from the PFS measurements due to many other factors, hence, it is believed that PFS alone is not sufficient to differentiate the ferroelectric and non-ferroelectric materials. On the other hands, this work shows that there are distinct differences in contact resonance frequency variation during the PFS measurements for ferroelectric and non-ferroelectric materials. Therefore, a new, simple and effective method is proposed to differentiate the responses from the ferroelectric and non-ferroelectric materials, this new analysis uses contact resonance frequency responses during the PFS measurements as a new parameter to differentiate the PFS measured responses from different materials.

cond-mat.mtrl-sci↗