arXiv subjects

Zhen Yang

Publications and source records attributed to Zhen Yang.

At least 235 records · Page 13Linked to original sources

arXiv2020

Optimized Energy and Information Relaying in Self-Sustainable IRS-Empowered WPCN

This paper proposes a hybrid-relaying scheme empowered by a self-sustainable intelligent reflecting surface (IRS) in a wireless powered communication network (WPCN), to simultaneously improve the performance of downlink energy transfer (ET) from a hybrid access point (HAP) to multiple users and uplink information transmission (IT) from users to the HAP. We propose time-switching (TS) and power-splitting (PS) schemes for the IRS, where the IRS can harvest energy from the HAP's signals by switching between energy harvesting and signal reflection in the TS scheme or adjusting its reflection amplitude in the PS scheme. For both the TS and PS schemes, we formulate the sum-rate maximization problems by jointly optimizing the IRS's phase shifts for both ET and IT and network resource allocation. To address each problem's non-convexity, we propose a two-step algorithm to obtain the near-optimal solution with high accuracy. To show the structure of resource allocation, we also investigate the optimal solutions for the schemes with random phase shifts. Through numerical results, we show that our proposed schemes can achieve significant system sum-rate gain compared to the baseline scheme without IRS.

eess.SP↗

arXiv2020

Code-switching pre-training for neural machine translation

This paper proposes a new pre-training method, called Code-Switching Pre-training (CSP for short) for Neural Machine Translation (NMT). Unlike traditional pre-training method which randomly masks some fragments of the input sentence, the proposed CSP randomly replaces some words in the source sentence with their translation words in the target language. Specifically, we firstly perform lexicon induction with unsupervised word embedding mapping between the source and target languages, and then randomly replace some words in the input sentence with their translation words according to the extracted translation lexicons. CSP adopts the encoder-decoder framework: its encoder takes the code-mixed sentence as input, and its decoder predicts the replaced fragment of the input sentence. In this way, CSP is able to pre-train the NMT model by explicitly making the most of the cross-lingual alignment information extracted from the source and target monolingual corpus. Additionally, we relieve the pretrain-finetune discrepancy caused by the artificial symbols like [mask]. To verify the effectiveness of the proposed method, we conduct extensive experiments on unsupervised and supervised NMT. Experimental results show that CSP achieves significant improvements over baselines without pre-training or with other pre-training methods.

cs.CL↗

arXiv2020

Understanding Negative Sampling in Graph Representation Learning

Graph representation learning has been extensively studied in recent years. Despite its potential in generating continuous embeddings for various networks, both the effectiveness and efficiency to infer high-quality representations toward large corpus of nodes are still challenging. Sampling is a critical point to achieve the performance goals. Prior arts usually focus on sampling positive node pairs, while the strategy for negative sampling is left insufficiently explored. To bridge the gap, we systematically analyze the role of negative sampling from the perspectives of both objective and risk, theoretically demonstrating that negative sampling is as important as positive sampling in determining the optimization objective and the resulted variance. To the best of our knowledge, we are the first to derive the theory and quantify that the negative sampling distribution should be positively but sub-linearly correlated to their positive sampling distribution. With the guidance of the theory, we propose MCNS, approximating the positive distribution with self-contrast approximation and accelerating negative sampling by Metropolis-Hastings. We evaluate our method on 5 datasets that cover extensive downstream graph learning tasks, including link prediction, node classification and personalized recommendation, on a total of 19 experimental settings. These relatively comprehensive experimental results demonstrate its robustness and superiorities.

cs.LG↗

arXiv2020

An Iterative Graph Spectral Subtraction Method for Speech Enhancement

In this paper, we investigate the application of graph signal processing (GSP) theory in speech enhancement. We first propose a set of shift operators to construct graph speech signals, and then analyze their spectrum in the graph Fourier domain. By leveraging the differences between the spectrum of graph speech and graph noise signals, we further propose the graph spectral subtraction (GSS) method to suppress the noise interference in noisy speech. Moreover, based on GSS, we propose the iterative graph spectral subtraction (IGSS) method to further improve the speech enhancement performance. Our experimental results show that the proposed operators are suitable for graph speech signals, and the proposed methods outperform the traditional basic spectral subtraction (BSS) method and iterative basic spectral subtraction (IBSS) method in terms of both signal-to-noise ratios (SNR) and mean Perceptual Evaluation of Speech Quality (PESQ).

eess.AS↗

arXiv2020

Metric-Learning-Assisted Domain Adaptation

Domain alignment (DA) has been widely used in unsupervised domain adaptation. Many existing DA methods assume that a low source risk, together with the alignment of distributions of source and target, means a low target risk. In this paper, we show that this does not always hold. We thus propose a novel metric-learning-assisted domain adaptation (MLA-DA) method, which employs a novel triplet loss for helping better feature alignment. We explore the relationship between the second largest probability of a target sample's prediction and its distance to the decision boundary. Based on the relationship, we propose a novel mechanism to adaptively adjust the margin in the triplet loss according to target predictions. Experimental results show that the use of proposed triplet loss can achieve clearly better results. We also demonstrate the performance improvement of MLA-DA on all four standard benchmarks compared with the state-of-the-art unsupervised domain adaptation methods. Furthermore, MLA-DA shows stable performance in robust experiments.

cs.LG↗

arXiv2020

Engine and Aftertreatment Co-Optimization of Connected HEVs via Multi-Range Vehicle Speed Planning and Prediction

Connected vehicles (CVs) have situational awareness that can be exploited for control and optimization of the powertrain system. While extensive studies have been carried out for energy efficiency improvement of CVs via eco-driving and planning, the implication of such technologies on the thermal responses of CVs has not been fully investigated. One of the key challenges in leveraging connectivity for optimization-based thermal management of CVs is the relatively slow thermal dynamics, which necessitate the use of a long prediction horizon to achieve the best performance. Long-term prediction of the CV speed, unlike the V2V/V2I-based short-range prediction, is difficult and error-prone. The multiple timescales inherent to power and thermal systems call for a variable timescale optimization framework with access to short- and long-term vehicle speed preview. To this end, a model predictive controller (MPC) with a multi-range speed preview for integrated power and thermal management (iPTM) of connected hybrid electric vehicles (HEVs) is presented in this paper. The MPC is formulated to manage the power-split between the engine and the battery while enforcing the power and thermal (engine coolant and catalytic converter temperatures) constraints. The MPC exploits prediction and optimization over a shorter receding horizon and longer shrinking horizon. Over the longer shrinking horizon, the vehicle speed estimation is based on the data collected from the connected vehicles traveling on the same route as the ego-vehicle. Simulation results of applying the MPC over real-world urban driving cycles in Ann Arbor, MI are presented to demonstrate the effectiveness and fuel-saving potentials of the proposed iPTM strategy under the uncertainty associated with long-term predictions of the CV's speed.

eess.SY↗

arXiv2020

Entropy Minimization vs. Diversity Maximization for Domain Adaptation

Entropy minimization has been widely used in unsupervised domain adaptation (UDA). However, existing works reveal that entropy minimization only may result into collapsed trivial solutions. In this paper, we propose to avoid trivial solutions by further introducing diversity maximization. In order to achieve the possible minimum target risk for UDA, we show that diversity maximization should be elaborately balanced with entropy minimization, the degree of which can be finely controlled with the use of deep embedded validation in an unsupervised manner. The proposed minimal-entropy diversity maximization (MEDM) can be directly implemented by stochastic gradient descent without use of adversarial learning. Empirical evidence demonstrates that MEDM outperforms the state-of-the-art methods on four popular domain adaptation datasets.

cs.LG↗

arXiv2019

Realization of Superadiabatic Two-qubit Gates Using Parametric Modulation in Superconducting Circuits

Fast robust two-qubit gate operation with low susceptibility to crosstalk are the key to scalable quantum information processing. Parametrically driven gate is inherently insensitive to crosstalk while superadiabatic control can speed up the gate without losing accuracy. We propose and experimentally implement superadiabatic two-qubit gates using parametric modulation on superconducting quantum circuits. Our results demonstrate the preservation of adiabaticity at a gate speed close to the quantum limit, in addition to robustness against control instability. We demonstrate a CZ gate with error rate of 5.8$\%$, limited largely by qubit decoherence, promising future improvement and scalable implementation.

quant-ph↗

arXiv2019

All-optical frequency resolved optical gating for isolated attosecond pulse reconstruction

We demonstrate an all-optical approach for precise characterization of attosecond extreme ultraviolet pulses. Isolated attosecond pulse is produced from high order harmonics using intense driving pulse with proper gating technique. When a weak field is synchronized with the driver, it perturbs the harmonics generation process via altering the accumulated phase of the electron trajectories. The perturbed harmonic spectrum can be formulated as a convolution of the unperturbed dipole and a phase gate, implying the validity of complete reconstruction of isolated attosecond pulses using conventional frequency resolved optical gating method. This in situ measurement avoids the central momentum approximation assumed in the widely used attosecond streaking measurement, providing a simple and reliable metrology for isolated attosecond pulse.

physics.optics↗

arXiv2019

Wave-front controlled attosecond time domain interferometry

Interferometry, as the key technique in modern precision measurements, has been used for length diagnosis in the fields of engineering metrology and astronomy. Analogous interferometric technique for time domain precision measurement is a significant complement to the spatial domain applications and requires the manipulation of the interference on the extreme time and energy scale. Here we present an all-optical interferometry for high precision measurement with attosecond temporal and hundreds of meV energy resolution. The interferometer is based on laser driven high order harmonics which provide a robust sequence of attosecond temporal slits. As applications, we reconstruct the waveform of an arbitrarily polarized optical pulse using the time resolving capability, and capture the abnormal character of the transition dipole near a Cooper minimum in argon using the energy resolution provided. This novel attosecond interferometry opens the possibility for high precision measurement in time energy domain using an all-optical approach.

physics.optics↗

arXiv2019

LabelECG: A Web-based Tool for Distributed Electrocardiogram Annotation

Electrocardiography plays an essential role in diagnosing and screening cardiovascular diseases in daily healthcare. Deep neural networks have shown the potentials to improve the accuracies of arrhythmia detection based on electrocardiograms (ECGs). However, more ECG records with ground truth are needed to promote the development and progression of deep learning techniques in automatic ECG analysis. Here we propose a web-based tool for ECG viewing and annotating, LabelECG. With the facilitation of unified data management, LabelECG is able to distribute large cohorts of ECGs to dozens of technicians and physicians, who can simultaneously make annotations through web-browsers on PCs, tablets and cell phones. Along with the doctors from four hospitals in China, we applied LabelECG to support the annotations of about 15,000 12-lead resting ECG records in three months. These annotated ECGs have successfully supported the First China ECG intelligent Competition. La-belECG will be freely accessible on the Internet to support similar researches, and will also be upgraded through future works.

cs.DB↗

arXiv2019

Experimental Measurement of the Quantum Metric Tensor and Related Topological Phase Transition with a Superconducting Qubit

Berry curvature is an imaginary component of the quantum geometric tensor (QGT) and is well studied in many branches of modern physics; however, the quantum metric as a real component of the QGT is less explored. Here, by using tunable superconducting circuits, we experimentally demonstrate two methods to directly measure the quantum metric tensor for characterizing the geometry and topology of underlying quantum states in parameter space. The first method is to probe the transition probability after a sudden quench, and the second one is to detect the excitation rate under weak periodic driving. Furthermore, based on quantum-metric and Berry-curvature measurements, we explore a topological phase transition in a simulated time-reversal-symmetric system, which is characterized by the Euler characteristic number instead of the Chern number. The work opens up a unique approach to explore the topology of quantum states with the QGT.

quant-ph↗

arXiv2019

Deep Learning for Physical-Layer 5G Wireless Techniques: Opportunities, Challenges and Solutions

The new demands for high-reliability and ultra-high capacity wireless communication have led to extensive research into 5G communications. However, the current communication systems, which were designed on the basis of conventional communication theories, signficantly restrict further performance improvements and lead to severe limitations. Recently, the emerging deep learning techniques have been recognized as a promising tool for handling the complicated communication systems, and their potential for optimizing wireless communications has been demonstrated. In this article, we first review the development of deep learning solutions for 5G communication, and then propose efficient schemes for deep learning-based 5G scenarios. Specifically, the key ideas for several important deep learningbased communication methods are presented along with the research opportunities and challenges. In particular, novel communication frameworks of non-orthogonal multiple access (NOMA), massive multiple-input multiple-output (MIMO), and millimeter wave (mmWave) are investigated, and their superior performances are demonstrated. We vision that the appealing deep learning-based wireless physical layer frameworks will bring a new direction in communication theories and that this work will move us forward along this road.

eess.SP↗

arXiv2019

Incorporating energy storage and user experience in isolated microgrid dispatch using a multi-objective model

In order to coordinate multiple different scheduling objectives from the perspectives of economy, environment and users, a practical multi-objective dynamic optimal dispatch model incorporating energy storage and user experience is proposed for isolated microgrids. In this model, besides Microturbine units, energy storage is employed to provide spinning reserve services for microgirds; and furthermore, from the perspective of demand side management, a consumer satisfaction indicator is developed to measure the quality of user experience. A two-step solution methodology incorporating multi-objective optimization (MOO) and decision analysis is put forward to address this model. First, a powerful heuristic optimization algorithm, called the θ-dominance based evolutionary algorithm, is used to find a well-distributed set of Pareto-optimal solutions of the problem. And thereby, the best compromise solutions (BCSs) are identified from the entire solutions with the use of decision analysis by integrating fuzzy C-means clustering and grey relation projection. The simulation results on the modified Oak Ridge National Laboratory Distributed Energy Control and Communication lab microgrid test system demonstrate the effectiveness of the proposed approach.

eess.SY↗

arXiv2018

Optimal scheduling of isolated microgrid with an electric vehicle battery swapping station in multi-stakeholder scenarios: a bi-level programming approach via real-time pricing

In order to coordinate the scheduling problem between an isolated microgrid (IMG) and electric vehicle battery swapping stations (BSSs) in multi-stakeholder scenarios, a new bi-level optimal scheduling model is proposed for promoting the participation of BSSs in regulating the IMG economic operation. In this model, the upper-level sub-problem is formulated to minimize the IMG net costs, while the lower-level aims to maximize the profits of the BSS under real-time pricing environments determined by demand responses in the upper-level decision. To solve the model, a hybrid algorithm, called JAYA-BBA, is put forward by combining a real/integer-coded JAYA algorithm and the branch and bound algorithm (BBA), in which the JAYA and BBA are respectively employed to address the upper- and lower- level sub-problems, and the bi-level model is eventually solved through alternate iterations between the two levels. The simulation results on a microgrid test system verify the effectiveness and superiority of the presented approach.

eess.SP↗

arXiv2018

Application of EOS-ELM with binary Jaya-based feature selection to real-time transient stability assessment using PMU data

Recent studies show that pattern-recognition-based transient stability assessment (PRTSA) is a promising approach for predicting the transient stability status of power systems. However, many of the current well-known PRTSA methods suffer from excessive training time and complex tuning of parameters, resulting in inefficiency for real-time implementation and lacking the online model updating ability. In this paper, a novel PRTSA approach based on an ensemble of OS-extreme learning machine (EOSELM) with binary Jaya (BinJaya)-based feature selection is proposed with the use of phasor measurement units (PMUs) data. After briefly describing the principles of OS-ELM, an EOS-ELM-based PRTSA model is built to predict the post-fault transient stability status of power systems in real time by integrating OS-ELM and an online boosting algorithm, respectively, as a weak classifier and an ensemble learning algorithm. Furthermore, a BinJaya-based feature selection approach is put forward for selecting an optimal feature subset from the entire feature space constituted by a group of system-level classification features extracted from PMU data. The application results on the IEEE 39-bus system and a real provincial system show that the proposal has superior computation speed and prediction accuracy than other state-of-the-art sequential learning algorithms. In addition, without sacrificing the classification performance, the dimension of the input space has been reduced to about one-third of its initial value.

eess.SP↗

arXiv2018

Optimal Scheduling of an Isolated Microgrid with Battery Storage Considering Load and Renewable Generation Uncertainties

By modeling the uncertainty of spinning reserves provided by energy storage with probabilistic constraints, a new optimal scheduling mode is proposed for minimizing the operating costs of an isolated microgrid (MG) by using chance-constrained programming. The model is transformed into a readily solvable mixed integer linear programming (MILP) formulation in GAMS via a proposed discretized step transformation (DST) approach and finally solved by applying the CPLEX solver. By properly setting the confidence levels of the spinning reserve probability constraints, the MG operation can be achieved a trade-off between reliability and economy. The test results on the modified ORNL DECC lab MG test system reveal that the proposal significantly exceeds the commonly used hybrid intelligent algorithm with much better and more stable optimization results and significantly reduced calculation times.

eess.SP↗

arXiv2018

Secure Transmission to the Strong User with Optimal Power Allocation in NOMA

With non-orthogonal multiple access(NOMA), we tackle the maximization of the secrecy rate for the strong user subject to a maximum allowable secrecy outage probability, while guaranteeing a constraint on the transmission rate to the weak user. For the first time, the dependence between the eavesdropper's ability to conduct successive interference cancellation and her channel quality is considered. We determine the optimal power allocation and the redundancy rate, based on which the cost of security in terms of the reduction in the strong user's secrecy rate is examined and the benefits of NOMA for secure transmissions are explicitly revealed.

cs.IT↗