arXiv subjects

Miao Zhang

Publications and source records attributed to Miao Zhang.

At least 199 records · Page 11Linked to original sources

arXiv2021

A Unified Framework for IRS Enabled Wireless Powered Sensor Networks

This paper unveils the importance of intelligent reflecting surface (IRS) in a wireless powered sensor network (WPSN). Specifically, a multi-antenna power station (PS) employs energy beamforming to provide wireless charging for multiple Internet of Things (IoT) devices, which utilize the harvested energy to deliver their own messages to an access point (AP). Meanwhile, an IRS is deployed to enhance the performances of wireless energy transfer (WET) and wireless information transfer (WIT) by intelligently adjusting the phase shift of each reflecting element. To evaluate the performance of this IRS assisted WPSN, we are interested in maximizing its system sum throughput to jointly optimize the energy beamforming of the PS, the transmission time allocation, as well as the phase shifts of the WET and WIT phases. The formulated problem is not jointly convex due to the multiple coupled variables. To deal with its non-convexity, we first independently find the phase shifts of the WIT phase in closed-form. We further propose an alternating optimization (AO) algorithm to iteratively solve the sum throughput maximization problem. To be specific, a semidefinite programming (SDP) relaxation approach is adopted to design the energy beamforming and the time allocation for given phase shifts of WET phase, which is then optimized for given energy beamforming and time allocation. Moreover, we propose an AO low-complexity scheme to significantly reduce the computational complexity incurred by the SDP relaxation, where the optimal closed-form energy beamforming, time allocation, and phase shifts of the WET phase are derived. Finally, numerical results are demonstrated to validate the effectiveness of the proposed algorithm, and highlight the beneficial role of the IRS in comparison to the benchmark schemes.

eess.SP↗

arXiv2021

An Integration Test Order Strategy to Consider Control Coupling

Integration testing is a very important step in software testing. Existing methods evaluate the stubbing cost for class integration test orders by considering only the interclass direct relationships such as inheritance, aggregation, and association, but they omit the interclass indirect relationship caused by control coupling, which can also affect the test orders and the stubbing cost. In this paper, we introduce an integration test order strategy to consider control coupling. We advance the concept of transitive relationship to describe this kind of interclass dependency and propose a new measurement method to estimate the complexity of control coupling, which is the complexity of stubs created for a transitive relationship. We evaluate our integration test order strategy on 10 programs on various scales. The results show that considering the transitive relationship when generating class integration test orders can significantly reduce the stubbing cost for most programs and that our integration test order strategy obtains satisfactory results more quickly than other methods.

cs.SE↗

arXiv2021

A Multi-Modal Transformer-based Code Summarization Approach for Smart Contracts

Code comment has been an important part of computer programs, greatly facilitating the understanding and maintenance of source code. However, high-quality code comments are often unavailable in smart contracts, the increasingly popular programs that run on the blockchain. In this paper, we propose a Multi-Modal Transformer-based (MMTrans) code summarization approach for smart contracts. Specifically, the MMTrans learns the representation of source code from the two heterogeneous modalities of the Abstract Syntax Tree (AST), i.e., Structure-based Traversal (SBT) sequences and graphs. The SBT sequence provides the global semantic information of AST, while the graph convolution focuses on the local details. The MMTrans uses two encoders to extract both global and local semantic information from the two modalities respectively, and then uses a joint decoder to generate code comments. Both the encoders and the decoder employ the multi-head attention structure of the Transformer to enhance the ability to capture the long-range dependencies between code tokens. We build a dataset with over 300K pairs of smart contracts, and evaluate the MMTrans on it. The experimental results demonstrate that the MMTrans outperforms the state-of-the-art baselines in terms of four evaluation metrics by a substantial margin, and can generate higher quality comments.

cs.SE↗

arXiv2021

Exploiting Deep Learning for Secure Transmission in an Underlay Cognitive Radio Network

This paper investigates a machine learning-based power allocation design for secure transmission in a cognitive radio (CR) network. In particular, a neural network (NN)-based approach is proposed to maximize the secrecy rate of the secondary receiver under the constraints of total transmit power of secondary transmitter, and the interference leakage to the primary receiver, within which three different regularization schemes are developed. The key advantage of the proposed algorithm over conventional approaches is the capability to solve the power allocation problem with both perfect and imperfect channel state information. In a conventional setting, two completely different optimization frameworks have to be designed, namely the robust and non-robust designs. Furthermore, conventional algorithms are often based on iterative techniques, and hence, they require a considerable number of iterations, rendering them less suitable in future wireless networks where there are very stringent delay constraints. To meet the unprecedented requirements of future ultra-reliable low-latency networks, we propose an NN-based approach that can determine the power allocation in a CR network with significantly reduced computational time and complexity. As this trained NN only requires a small number of linear operations to yield the required power allocations, the approach can also be extended to different delay sensitive applications and services in future wireless networks. When evaluate the proposed method versus conventional approaches, using a suitable test set, the proposed approach can achieve more than 94% of the secrecy rate performance with less than 1% computation time and more than 93% satisfaction of interference leakage constraints. These results are obtained with significant reduction in computational time, which we believe that it is suitable for future real-time wireless applications.

cs.IT↗

arXiv2021

Anomalous interfacial dynamics of single proton charges in binary aqueous solutions

Understanding the dynamics of charge exchange between a solid surface and a liquid is fundamental to various situations, ranging from nanofiltration to catalysis and electrochemistry. Charge transfer is ultimately determined by physicochemical processes (surface group dissociation, ion adsorption, etc...) occurring in the few layers of molecules at the interface between the solid and the liquid. Unfortunately, these processes remain largely uncharted due to the experimental challenges in probing interfacial charge dynamics with sufficiently high spatial and temporal resolution. Here, we resolve at the single-charge scale, the dynamics of proton charges at the interface between an hBN crystal and binary mixtures of water and organic amphiphilic solvents (e.g. alcohol), evidencing a dramatic influence of solvation on interfacial dynamics. Our observations rely on the application of spectral Single Molecule Localization Microscopy (sSMLM) to two types of optically active defects at the hBN surface, which act as intrinsic optical markers for both surface protonation and interaction with apolar alkyl groups of the organic solvent. We use sSMLM to reveal interfacial proton charge transport as a succession of jumps between the titratable surface defects, mediated by the transport of the solvated proton charge along the solid/liquid interface. By changing the relative concentration of water in binary mixtures, we evidence a non-trivial effect on interfacial proton charge dynamics, leading at intermediate water concentration to an increased affinity of the proton charge to the solid surface, accompanied by an increased surface diffusivity. These measurements confirm the strong role of solvation on interfacial proton charge transport and establish the potential of single-molecule localization techniques to probe a wide range of dynamic processes at solid/liquid interfaces.

cond-mat.soft↗

arXiv2020

DUT-LFSaliency: Versatile Dataset and Light Field-to-RGB Saliency Detection

Light field data exhibit favorable characteristics conducive to saliency detection. The success of learning-based light field saliency detection is heavily dependent on how a comprehensive dataset can be constructed for higher generalizability of models, how high dimensional light field data can be effectively exploited, and how a flexible model can be designed to achieve versatility for desktop computers and mobile devices. To answer these questions, first we introduce a large-scale dataset to enable versatile applications for RGB, RGB-D and light field saliency detection, containing 102 classes and 4204 samples. Second, we present an asymmetrical two-stream model consisting of the Focal stream and RGB stream. The Focal stream is designed to achieve higher performance on desktop computers and transfer focusness knowledge to the RGB stream, relying on two tailor-made modules. The RGB stream guarantees the flexibility and memory/computation efficiency on mobile devices through three distillation schemes. Experiments demonstrate that our Focal stream achieves state-of-the-arts performance. The RGB stream achieves Top-2 F-measure on DUTLF-V2, which tremendously minimizes the model size by 83% and boosts FPS by 5 times, compared with the best performing method. Furthermore, our proposed distillation schemes are applicable to RGB saliency models, achieving impressive performance gains while ensuring flexibility.

cs.CV↗

arXiv2020

Measurement bias: a structural perspective

The causal structure for measurement bias (MB) remains controversial. Aided by the Directed Acyclic Graph (DAG), this paper proposes a new structure for measuring one singleton variable whose MB arises in the selection of an imperfect I/O device-like measurement system. For effect estimation, however, an extra source of MB arises from any redundant association between a measured exposure and a measured outcome. The misclassification will be bidirectionally differential for a common outcome, unidirectionally differential for a causal relation, and non-differential for a common cause between the measured exposure and the measured outcome or a null effect. The measured exposure can actually affect the measured outcome, or vice versa. Reverse causality is a concept defined at the level of measurement. Our new DAGs have clarified the structures and mechanisms of MB.

stat.ME↗

arXiv2020

The Detection of Thoracic Abnormalities ChestX-Det10 Challenge Results

The detection of thoracic abnormalities challenge is organized by the Deepwise AI Lab. The challenge is divided into two rounds. In this paper, we present the results of 6 teams which reach the second round. The challenge adopts the ChestX-Det10 dateset proposed by the Deepwise AI Lab. ChestX-Det10 is the first chest X-Ray dataset with instance-level annotations, including 10 categories of disease/abnormality of 3,543 images. The annotations are located at https://github.com/Deepwise-AILab/ChestX-Det10-Dataset. In the challenge, we randomly split all data into 3001 images for training and 542 images for testing.

eess.IV↗

arXiv2020

Federated Learning for Breast Density Classification: A Real-World Implementation

Building robust deep learning-based models requires large quantities of diverse training data. In this study, we investigate the use of federated learning (FL) to build medical imaging classification models in a real-world collaborative setting. Seven clinical institutions from across the world joined this FL effort to train a model for breast density classification based on Breast Imaging, Reporting & Data System (BI-RADS). We show that despite substantial differences among the datasets from all sites (mammography system, class distribution, and data set size) and without centralizing data, we can successfully train AI models in federation. The results show that models trained using FL perform 6.3% on average better than their counterparts trained on an institute's local data alone. Furthermore, we show a 45.8% relative improvement in the models' generalizability when evaluated on the other participating sites' testing data.

eess.IV↗

arXiv2020

Tracing the main elements and electron orbitals that induce superconducting phase transition

The experimental determination of the superconducting transition requires the observation of the emergence of zero-resistance and perfect diamagnetism state. Based on the close relationship between superconducting transition temperature (Tc) and electron density of states (DOS), we take two typical superconducting materials Hg and ZrTe3 as samples and calculate their DOS versus temperature under different pressures by using the first-principle molecular dynamics simulations. According to the analysis of the calculation results, the main contributors that induce superconducting transitions are deduced by tracing the variation of partial density of states near Tc. In particular, the microscopic mechanism of pressure increasing Tc is further analyzed.

cond-mat.supr-con↗

arXiv2020

Accurate RGB-D Salient Object Detection via Collaborative Learning

Benefiting from the spatial cues embedded in depth images, recent progress on RGB-D saliency detection shows impressive ability on some challenge scenarios. However, there are still two limitations. One hand is that the pooling and upsampling operations in FCNs might cause blur object boundaries. On the other hand, using an additional depth-network to extract depth features might lead to high computation and storage cost. The reliance on depth inputs during testing also limits the practical applications of current RGB-D models. In this paper, we propose a novel collaborative learning framework where edge, depth and saliency are leveraged in a more efficient way, which solves those problems tactfully. The explicitly extracted edge information goes together with saliency to give more emphasis to the salient regions and object boundaries. Depth and saliency learning is innovatively integrated into the high-level feature learning process in a mutual-benefit manner. This strategy enables the network to be free of using extra depth networks and depth inputs to make inference. To this end, it makes our model more lightweight, faster and more versatile. Experiment results on seven benchmark datasets show its superior performance.

cs.CV↗

arXiv2020

Super-resolved optical mapping of reactive sulfur-vacancy in 2D transition metal dichalcogenides

Transition metal dichalcogenides (TMDs) represent an entire new class of semiconducting 2D materials with exciting properties. Defects in 2D TMDs can crucially affect their physical and chemical properties. However, characterization of the presence and spatial distribution of defects is limited either in throughput or in resolution. Here, we demonstrate large area mapping of reactive sulfur-deficient defects in 2D-TMDs coupling single-molecule localization microscopy with fluorescence labeling using thiol chemistry. Our method, reminiscent of PAINT strategies, relies on the specific binding by reversible physisorption of fluorescent probes to sulfur-vacancies via a thiol group and their intermittent emission to apply localization of the labeled defects with a precision down to 15 nm. Tuning the distance between the fluorophore and the docking thiol site allows us to control Föster Resonance Energy Transfer (FRET) process and reveal large structural defects such as grain boundaries and line defects, due to the local irregular lattice structure. Our methodology provides a simple and fast alternative for large-scale mapping of non-radiative defects in 2D materials and paves the way for in-situ and spatially resolved monitoring of the interaction between chemical agent and the defects in 2D materials that has general implications for defect engineering in aqueous condition.

physics.app-ph↗

arXiv2020

Feasibility and A Fast Algorithm for Euclidean Distance Matrix Optimization with Ordinal Constraints

Euclidean distance matrix optimization with ordinal constraints (EDMOC) has found important applications in sensor network localization and molecular conformation. It can also be viewed as a matrix formulation of multidimensional scaling, which is to embed n points in a $r$-dimensional space such that the resulting distances follow the ordinal constraints. The ordinal constraints, though proved to be quite useful, may result in only zero solution when too many are added, leaving the feasibility of EDMOC as a question. In this paper, we first study the feasibility of EDMOC systematically. We show that if $r\ge n-2$, EDMOC always admits a nontrivial solution. Otherwise, it may have only zero solution. The latter interprets the numerical observations of 'crowding phenomenon'. Next we overcome two obstacles in designing fast algorithms for EDMOC, i.e., the low-rankness and the potential huge number of ordinal constraints. We apply the technique developed to take the low rank constraint as the conditional positive semidefinite cone with rank cut. This leads to a majorization penalty approach. The ordinal constraints are left to the subproblem, which is exactly the weighted isotonic regression, and can be solved by the enhanced implementation of Pool Adjacent Violators Algorithm (PAVA). Extensive numerical results demonstrate {the} superior performance of the proposed approach over some state-of-the-art solvers.

math.OC↗

arXiv2020

Real-time Earthquake Early Warning with Deep Learning: Application to the 2016 Central Apennines, Italy Earthquake Sequence

Earthquake early warning systems are required to report earthquake locations and magnitudes as quickly as possible before the damaging S wave arrival to mitigate seismic hazards. Deep learning techniques provide potential for extracting earthquake source information from full seismic waveforms instead of seismic phase picks. We developed a novel deep learning earthquake early warning system that utilizes fully convolutional networks to simultaneously detect earthquakes and estimate their source parameters from continuous seismic waveform streams. The system determines earthquake location and magnitude as soon as one station receives earthquake signals and evolutionarily improves the solutions by receiving continuous data. We apply the system to the 2016 Mw 6.0 earthquake in Central Apennines, Italy and its subsequent sequence. Earthquake locations and magnitudes can be reliably determined as early as four seconds after the earliest P phase, with mean error ranges of 6.8-3.7 km and 0.31-0.23, respectively.

physics.geo-ph↗

arXiv2020

Multi-Domain Learning and Identity Mining for Vehicle Re-Identification

This paper introduces our solution for the Track2 in AI City Challenge 2020 (AICITY20). The Track2 is a vehicle re-identification (ReID) task with both the real-world data and synthetic data. Our solution is based on a strong baseline with bag of tricks (BoT-BS) proposed in person ReID. At first, we propose a multi-domain learning method to joint the real-world and synthetic data to train the model. Then, we propose the Identity Mining method to automatically generate pseudo labels for a part of the testing data, which is better than the k-means clustering. The tracklet-level re-ranking strategy with weighted features is also used to post-process the results. Finally, with multiple-model ensemble, our method achieves 0.7322 in the mAP score which yields third place in the competition. The codes are available at https://github.com/heshuting555/AICITY2020_DMT_VehicleReID.

cs.CV↗

arXiv2020

Resource Allocation Technique for Hybrid TDMA-NOMA System with Opportunistic Time Assignment

In this paper, we develop a resource allocation technique for a hybrid time division multiple access (TDMA) - non-orthogonal multiple access (NOMA) system with opportunistic time assignment. In particular, the available transmission time is divided into several time-slots, through which multiple users are served by exploiting power-domain NOMA. To fully exploit underlying benefits of this hybrid TDMA-NOMA system, we utilize the available resources efficiently by jointly allocating transmit power and time-slots to several groups of users in the system. Furthermore, these resources are allocated to maximize minimum rate of the users in the system. However, this max-min resource allocation problem is non-convex due to coupled design parameters of time and power allocations. Hence, we exploit a novel second-order cone formulation to overcome this non-convexity issue and develop an iterative algorithm to realize a solution to the original max-min problem. Simulation results show that this joint resource allocation technique has a considerable performance enhancement in terms of both minimum achieved rate and overall system throughput compared to that of the conventional resource allocation technique where equal time-slots are assigned to the groups of users.

cs.NI↗

arXiv2019

Energy Efficiency Optimization for Secure Transmission in MISO Cognitive Radio Network with Energy Harvesting

In this paper, we investigate different secrecy energy efficiency (SEE) optimization problems in a multiple-input single-output underlay cognitive radio (CR) network in the presence of an energy harvesting receiver. In particular, these energy efficient designs are developed with different assumptions of channels state information (CSI) at the transmitter, namely perfect CSI, statistical CSI and imperfect CSI with bounded channel uncertainties. In particular, the overarching objective here is to design a beamforming technique maximizing the SEE while satisfying all relevant constraints linked to interference and harvested energy between transmitters and receivers. We show that the original problems are non-convex and their solutions are intractable. By using a number of techniques, such as non-linear fractional programming and difference of concave (DC) functions, we reformulate the original problems so as to render them tractable. We then combine these techniques with the Dinkelbach's algorithm to derive iterative algorithms to determine relevant beamforming vectors which lead to the SEE maximization. In doing this, we investigate the robust design with ellipsoidal bounded channel uncertainties, by mapping the original problem into a sequence of semidefinite programs by employing the semidefinite relaxation, non-linear fractional programming and S-procedure. Furthermore, we show that the maximum SEE can be achieved through a search algorithm in the single dimensional space. Numerical results, when compared with those obtained with existing techniques in the literature, show the effectiveness of the proposed designs for SEE maximization.

cs.IT↗

arXiv2019

Efficient Novelty-Driven Neural Architecture Search

One-Shot Neural architecture search (NAS) attracts broad attention recently due to its capacity to reduce the computational hours through weight sharing. However, extensive experiments on several recent works show that there is no positive correlation between the validation accuracy with inherited weights from the supernet and the test accuracy after re-training for One-Shot NAS. Different from devising a controller to find the best performing architecture with inherited weights, this paper focuses on how to sample architectures to train the supernet to make it more predictive. A single-path supernet is adopted, where only a small part of weights are optimized in each step, to reduce the memory demand greatly. Furthermore, we abandon devising complicated reward based architecture sampling controller, and sample architectures to train supernet based on novelty search. An efficient novelty search method for NAS is devised in this paper, and extensive experiments demonstrate the effectiveness and efficiency of our novelty search based architecture sampling method. The best architecture obtained by our algorithm with the same search space achieves the state-of-the-art test error rate of 2.51\% on CIFAR-10 with only 7.5 hours search time in a single GPU, and a validation perplexity of 60.02 and a test perplexity of 57.36 on PTB. We also transfer these search cell structures to larger datasets ImageNet and WikiText-2, respectively.

cs.LG↗