Searcharxiv⌕ Search

arXiv subjects

Zhaoyu Wang

Publications and source records attributed to Zhaoyu Wang.

At least 73 records · Page 4Linked to original sources

The defocusing NLS equation with nonzero background: Painlevé asymptotics in two transition regions

In this paper, we address the Painlevé aymptotics in the transition region $|ξ|:=\big|\frac{x}{2t}\big| \approx 1$ to the Cauchy problem of the defocusing Schr$\ddot{\text{o}}$dinger equation with a nonzero background.With the $\bar\partial$-generation of the nonlinear steepest descent approach and double scaling limit to compute the long-time asymptotics of the solution in two transition regions defined as $$ \mathcal{P}_{\pm 1}(x,t):=\{ (x,t) \in \mathbb{R}\times\mathbb{R}^+, \ \ 0<|ξ-(\pm 1)|t^{2/3}\leq C\}, $$ we find that the long-time asymptotics in both transition regions $ \mathcal{P}_{\pm 1}(x,t)$ can be expressed in terms of the Painlevé II equation. We are also able to express the leading term explicitly in terms of the Ariy function.

math-ph↗

Plateau regions for zero-bias peaks within 5% of the quantized conductance value $2e^2/h$

Probing an isolated Majorana zero mode is predicted to reveal a tunneling conductance quantized at $2e^2/h$ at zero temperature. Experimentally, a zero-bias peak (ZBP) is expected and its height should remain robust against relevant parameter tuning, forming a quantized plateau. Here, we report the observation of large ZBPs in a thin InAs-Al hybrid nanowire device. The ZBP height can stick close to $2e^2/h$, mostly within $5\%$ tolerance, by sweeping gate voltages and magnetic field. We further map out the phase diagram and identify two plateau regions in the phase space. Despite the presence of disorder and quantum dots, our result constitutes a step forward towards establishing Majorana zero modes.

cond-mat.mes-hall↗

Automatic Self-Adaptive Local Voltage Control Under Limited Reactive Power

The increasing proliferation of distributed energy resources has posed new challenges to Volt/VAr control problems in distribution networks. To this end, this paper proposes an automatic self-adaptive local voltage control (ASALVC) by locally controlling VAr outputs of distributed energy resources. In this ASALVC strategy, each bus agent can locally and dynamically adjust its voltage droop function in accordance with time-varying system changes. The voltage droop function is associated with the bus-specific time-varying slope and intercept, which can be locally updated, merely based on local voltage measurements, without requiring communication. Stability, convergence, and optimality properties of this local voltage control are analytically established. In addition, the online implementation of ASALVC is further proposed to address the real-time system changes by adjusting VAr outputs of DERs online. Numerical test cases are performed to validate and demonstrate the effectiveness and superiority of ASALVC.

eess.SY↗

Data-Driven Affinely Adjustable Robust Volt/VAr Control

This paper proposes a data-driven affinely adjustable robust Volt/VAr control (AARVVC) scheme, which modulates the smart inverter reactive power in an affine function of its active power, based on the voltage sensitivities with respect to real/reactive power injections. To achieve a fast and accurate estimation of voltage sensitivities, we propose a data-driven method based on deep neural network (DNN), together with a rule-based bus-selection process using the bidirectional search method. Our method only uses the operating statuses of selected buses as inputs to DNN, thus significantly improving the training efficiency and reducing information redundancy. Finally, a distributed consensus-based solution, based on the alternating direction method of multipliers (ADMM), for the AARVVC is applied to decide the inverter reactive power adjustment rule with respect to its active power. Only limited information exchange is required between each local agent and the central agent to obtain the slope of the reactive power adjustment rule, and there is no need for the central agent to solve any (sub)optimization problems. Numerical results on the modified IEEE-123 bus system validate the effectiveness and superiority of the proposed data-driven AARVVC method.

eess.SY↗

The complex mKdV equation with step-like initial data: Large time asymptotic analysis

In this paper, we study large-time asymptotics for the complex modified Korteveg-de Vries equation \begin{equation} u_t + \frac{1}{2}u_{xxx}+3|u|^2 u_x=0, \end{equation} with the step-like initial data \begin{equation} u(x,0)=u_0(x)= \begin{cases} 0, & {x \ge 0,}\\ A e^{iBx}, &{x < 0.} \end{cases} \end{equation} It is shown that the step-like initial problem can be described by a matrix Riemann-Hilbert problem. We apply the steepest descent method to obtain different large-time asymptotics in the the Zakharov-Manakov region, a plane wave region and a slow decay region.

math.AP↗

Learning Latent Interactions for Event classification via Graph Neural Networks and PMU Data

Phasor measurement units (PMUs) are being widely installed on power systems, providing a unique opportunity to enhance wide-area situational awareness. One essential application is the use of PMU data for real-time event identification. However, how to take full advantage of all PMU data in event identification is still an open problem. Thus, we propose a novel method that performs event identification by mining interaction graphs among different PMUs. The proposed interaction graph inference method follows an entirely data-driven manner without knowing the physical topology. Moreover, unlike previous works that treat interactive learning and event identification as two different stages, our method learns interactions jointly with the identification task, thereby improving the accuracy of graph learning and ensuring seamless integration between the two stages. Moreover, to capture multi-scale event patterns, a dilated inception-based method is investigated to perform feature extraction of PMU data. To test the proposed data-driven approach, a large real-world dataset from tens of PMU sources and the corresponding event logs have been utilized in this work. Numerical results validate that our method has higher classification accuracy compared to previous methods.

eess.SP↗

Tractable Data Enriched Distributionally Robust Chance-Constrained CVR

This paper proposes a tractable distributionally robust chance-constrained conservation voltage reduction (DRCC-CVR) method with enriched data-based ambiguity set in unbalanced three-phase distribution systems. The increasing penetration of distributed renewable energy not only brings clean power but also challenges the voltage regulation and energy-saving performance of CVR by introducing high uncertainties to distribution systems. In most cases, the conventional robust optimization methods for CVR only provide conservative solutions. To better consider the impacts of load and PV generation uncertainties on CVR implementation in distribution systems and provide less conservative solutions, this paper develops a data-based DRCC-CVR model with tractable reformulation and data enrichment method. Even though the uncertainties of load and photovoltaic (PV) can be captured by data, the availability of smart meters (SMs) and micro-phasor measurement units (PMUs) is restricted by cost budget. The limited data access may hinder the performance of the proposed DRCC-CVR. Thus, we further present a data enrichment method to statistically recover the high-resolution load and PV generation data from low-resolution data with Gaussian Process Regression (GPR) and Markov Chain (MC) models, which can be used to construct a data-based moment ambiguity set of uncertainty distributions for the proposed DRCC-CVR. Finally, the nonlinear power flow and voltage dependant load models and DRCC with moment-based ambiguity set are reformulated to be computationally tractable and tested on a real distribution feeder in Midwest U. S. to validate the effectiveness and robustness of the proposed method.

eess.SY↗

The defocusing NLS equation with nonzero background: Large-time asymptotics in the solitonless region

We consider the Cauchy problem for the defocusing Schr$\ddot{\text{o}}$dinger (NLS) equation with a nonzero background $$\begin{align} &iq_t+q_{xx}-2(|q|^2-1)q=0, \nonumber\\ &q(x,0)=q_0(x), \quad \lim_{x \to \pm \infty}q_0(x)=\pm 1. \end{align}$$ Recently, for the space-time region $|x/(2t)|<1$ which is a solitonic region without stationary phase points on the jump contour, Cuccagna and Jenkins presented the asymptotic stability of the $N$-soliton solutions for the NLS equation by using the $\bar{\partial}$ generalization of the Deift-Zhou nonlinear steepest descent method. Their large-time asymptotic expansion takes the form \begin{align} q(x,t)= T(\infty)^{-2} q^{sol,N}(x,t) + \mathcal{O}(t^{-1 }),\label{res1} \end{align} whose leading term is N-soliton and the second term $\mathcal{O}(t^{-1})$ is a residual error from a $\overline\partial$-equation. In this paper, we are interested in the large-time asymptotics in the space-time region $ |x/(2t)|>1$ which is outside the soliton region, but there will be two stationary points appearing on the jump contour $\mathbb{R}$. We found a asymptotic expansion that is different from (\ref{res1}) $$\begin{align} q(x,t)= e^{-iα(\infty)} \left(1 +t^{-1/2} h(x,t) \right)+\mathcal{O}\left(t^{-3/4}\right),\label{res2} \end{align}$$ whose leading term is a nonzero background, the second $t^{-1/2}$ order term is from continuous spectrum and the third term $\mathcal{O}(t^{-3/4})$ is a residual error from a $\overline\partial$-equation.The above two asymptotic results (\ref{res1}) and (\ref{res2}) imply that the region $ |x/(2t)|<1$ considered by Cuccagna and Jenkins is a fast decaying soliton solution region, while the region $ |x/(2t)|>1$ considered by us is a slow decaying nonzero background region.

math.AP↗

An Extended Halo-based Group/Cluster finder: application to the DESI legacy imaging surveys DR8

We extend the halo-based group finder developed by \citet[][]{Yang2005a} to use data {\it simultaneously} with either photometric or spectroscopic redshifts. A mock galaxy redshift survey constructed from a high-resolution N-body simulation is used to evaluate the performance of this extended group finder. For galaxies with magnitude ${\rm z\le 21}$ and redshift $0<z\le 1.0$ in the DESI legacy imaging surveys (the Legacy Surveys), our group finder successfully identifies more than 60\% of the members in about $90\%$ of halos with mass $\ga 10^{12.5}\msunh$. Detected groups with mass $\ga 10^{12.0}\msunh$ have a purity (the fraction of true groups) greater than 90\%. The halo mass assigned to each group has an uncertainty of about 0.2 dex at the high mass end $\ga 10^{13.5}\msunh$ and 0.40 dex at the low mass end. Groups with more than 10 members have a redshift accuracy of $\sim 0.008$. We apply this group finder to the Legacy Surveys DR8 and find 5.2 Million groups with at least 3 members. About 387,000 of these groups have at least 10 members. The resulting catalog containing 3D coordinates, richness, halo masses, and total group luminosities, is made publicly available.

astro-ph.GA↗

A Two-layer Approach for Estimating Behind-the-Meter PV Generation Using Smart Meter Data

As the cost of the residential solar system decreases, rooftop photovoltaic (PV) has been widely integrated into distribution systems. Most rooftop PV systems are installed behind-the-meter (BTM), i.e., only the net demand is metered, while the native demand and PV generation are not separately recorded. Under this condition, the PV generation and native demand are invisible to utilities, which brings challenges for optimal distribution system operation and expansion. In this paper, we have come up with a novel two-layer approach to disaggregate the unknown PV generation and native demand from the known hourly net demand data recorded by smart meters: 1) At the aggregate level, the proposed approach separates the total PV generation and native demand time series from the total net demand time series for customers with PVs. 2) At the customer level, the separated aggregate-level PV generation is allocated to individual PVs. These two layers leverage the spatial correlations of native demand and PV generation, respectively. One primary advantage of our proposed approach is that it is more independent and practical compared to previous works because it does not require PV array parameters, meteorological data and previously recorded solar power exemplars. We have verified our proposed approach using real native demand and PV generation data.

eess.SP↗

Online Voltage Control for Unbalanced Distribution Networks Using Projected Newton Method

This paper proposes an online voltage control strategy of distributed energy resources (DERs), based on the projected Newton method (PNM), for unbalanced distribution networks. The optimal Volt/VAr control (VVC) problem is formulated as an optimization program, with the goal of maintaining the voltage profile across the network by coordinating the VAr outputs of DERs. To overcome the slow convergence rate of conventional gradient-based methods, a PNM-based solution algorithm is developed to solve this VVC problem. It utilizes a non-diagonal symmetric positive definite matrix, developed from the Hessian matrix of the objective, to scale the gradient, and thus a fast convergence performance can be expected in this Newton-like algorithm. Moreover, taking advantage of the instantaneous feedback of voltage measurements, the online implementation of the PNM-based VVC is further designed to deal with fast system variations. In this online PNM-based VVC scheme, each bus agent communicates the instantaneous voltage measurements to the central agent, and the central agent communicates the VAr output commands of DERs back to each bus agent. The fast convergence performance of PNM results in a stronger capability to track the system variations in real time. Finally, numerical case studies are performed to validate the effectiveness, superiority, and scalability of the proposed method.

eess.SY↗

Data-Driven Outage Restoration Time Prediction via Transfer Learning with Cluster Ensembles

This paper develops a data-driven approach to accurately predict the restoration time of outages under different scales and factors. To achieve the goal, the proposed method consists of three stages. First, given the unprecedented amount of data collected by utilities, a sparse dictionary-based ensemble spectral clustering (SDESC) method is proposed to decompose historical outage datasets, which enjoys good computational efficiency and scalability. Specifically, each outage sample is represented by a linear combination of a small number of selected dictionary samples using a density-based method. Then, the dictionary-based representation is utilized to perform the spectral analysis to group the data samples with similar features into the same subsets. In the second stage, a knowledge-transfer-added restoration time prediction model is trained for each subset by combining weather information and outage-related features. The transfer learning technology is introduced with the aim of dealing with the underestimation problem caused by data imbalance in different subsets, thus improving the model performance. Furthermore, to connect unseen outages with the learned outage subsets, a t-distributed stochastic neighbor embedding-based strategy is applied. The proposed method fully builds on and is also tested on a large real-world outage dataset from a utility provider with a time span of six consecutive years. The numerical results validate that our method has high prediction accuracy while showing good stability against real-world data limitations.

eess.SP↗

Analyzing Photovoltaic's Impact on Conservation Voltage Reduction in Distribution Networks

Conservation voltage reduction (CVR) has been widely implemented in distribution networks and helped utilities effectively reduce energy and peak load. However, the increasing penetration level of solar photovoltaic (PV) has affected voltage profiles and the performance of CVR. It remains an outstanding question how CVR and solar PV interact with each other. Understanding this interaction is important for utilities in implementing CVR and assessing its performance. This paper studies the impact of solar PV on CVR in a real distribution system in the Midwest U.S. using comprehensive simulations. We have considered various PV allocations and penetration levels, as well as different inverter control modes according to IEEE Std 1547-2018. Three metrics are used to quantify the impact of solar PV on CVR: voltages at the substation, voltage distribution across the network, and energy consumption reduction due to CVR. The results show that the allocations of solar PV have the most significant effect on the CVR performance, where a dispersed allocation of solar PV will help flatten voltage profile and achieve deeper voltage reductions at the substation, less energy consumption and line losses.

eess.SY↗

Synthetic Active Distribution System Generation via Unbalanced Graph Generative Adversarial Network

Real active distribution networks with associated smart meter (SM) data are critical for power researchers. However, it is practically difficult for researchers to obtain such comprehensive datasets from utilities due to privacy concerns. To bridge this gap, an implicit generative model with Wasserstein GAN objectives, namely unbalanced graph generative adversarial network (UG-GAN), is designed to generate synthetic three-phase unbalanced active distribution system connectivity. The basic idea is to learn the distribution of random walks both over a real-world system and across each phase of line segments, capturing the underlying local properties of an individual real-world distribution network and generating specific synthetic networks accordingly. Then, to create a comprehensive synthetic test case, a network correction and extension process is proposed to obtain time-series nodal demands and standard distribution grid components with realistic parameters, including distributed energy resources (DERs) and capacity banks. A Midwest distribution system with 1-year SM data has been utilized to validate the performance of our method. Case studies with several power applications demonstrate that synthetic active networks generated by the proposed framework can mimic almost all features of real-world networks while avoiding the disclosure of confidential information.

eess.SY↗

An Online Feedback-Based Linearized Power Flow Model for Unbalanced Distribution Networks

The non-linearity and non-convexity of power flow models and the phase coupling challenge the analysis and optimization of unbalanced distribution networks. To tackle the challenges, this paper proposes an online feedback-based linearized power flow model for unbalanced distribution networks with both wye-connected and delta-connected loads. The online feedback-based linearized model is grounded on the first-order Taylor expansion of the branch flow model, and updates the model parameters via online feedback by leveraging the instantaneous measured voltages and load consumption at the previous time step. Its closed-loop nature can asymptotically mitigate the model mismatch, thus lending itself to a good performance. In addition, exploiting the connection structure of unbalanced radial distribution networks, we provide a unified matrix-vector compact form of the proposed linearized power flow model. Finally, the numerical tests on the IEEE 123-bus test system validate the effectiveness and superiority of the proposed model. A simple optimal power flow case is also provided to illustrate the application of the online feedback-based linearized model.

eess.SY↗

Switching Device-Cognizant Sequential Distribution System Restoration

This paper presents an optimization framework for sequential reconfiguration using an assortment of switching devices and repair process in distribution system restoration. Compared to existing studies, this paper considers types, capabilities and operational limits of different switching devices, making it applicable in practice. We develop a novel multi-phase method to find the optimal sequential operation of various switching devices and repair faulted areas. We consider circuit breakers, reclosers, sectionalizers, load breaker switches, and fuses. The switching operation problem is decomposed into two mixed-integer linear programming (MILP) subproblems. The first subproblem determines the optimal network topology and estimates the number of steps to reach that topology, while the second subproblem generates a sequence of switching operations to coordinate the switches. For repairing the faults, we design an MILP model that dispatches repair crews to clear faults and replace melted fuses. After clearing a fault, we update the topology of the network by generating a new sequence of switching operations, and the process continues until all faults are cleared. To improve the computational efficiency, a network reduction algorithm is developed to group line sections, such that only switchable sections are present in the reduced network. The proposed method is validated on the IEEE 123-bus and 8500-bus systems.

eess.SY↗

Large zero bias peaks and dips in a four-terminal thin InAs-Al nanowire device

We report electron transport studies of a thin InAs-Al hybrid semiconductor-superconductor nanowire device using a four-terminal design. Compared to previous works, thinner InAs nanowire (diameter less than 40 nm) is expected to reach fewer sub-band regime. The four-terminal device design excludes electrode contact resistance, an unknown value which has inevitably affected previously reported device conductance. Using tunneling spectroscopy, we find large zero-bias peaks (ZBPs) in differential conductance on the order of $2e^2/h$. Investigating the ZBP evolution by sweeping various gate voltages and magnetic field, we find a transition between a zero-bias peak and a zero-bias dip while the zero-bias conductance sticks close to $2e^2/h$. We discuss a topologically trivial interpretation involving disorder, smooth potential variation and quasi-Majorana zero modes.

cond-mat.mes-hall↗

The clustering of galaxies in the DESI imaging legacy surveys DR8: I. the luminosity and color dependent intrinsic clustering

In a recent study, we developed a method to model the impact of photometric redshift uncertainty on the two-point correlation function (2PCF). In this method, we can obtain both the intrinsic clustering strength and the photometric redshift errors simultaneously by fitting the projected 2PCF with two integration depths along the line-of-sight. Here we apply this method to the DESI Legacy Imaging Surveys Data Release 8 (LS DR8), the largest galaxy sample currently available. We separate galaxies into 20 samples in 8 redshift bins from $z=0.1$ to $z=1.0$, and a few $\rm z$-band absolute magnitude bins, with $M_{\rm z} \le -20$. These galaxies are further separated into red and blue sub-samples according to their $M^{0.5}_{\rm r}-M^{0.5}_{\rm z}$ colors. We measure the projected 2PCFs for all these galaxy (sub-)samples, and fit them using our photometric redshift 2PCF model. We find that the photometric redshift errors are smaller in red sub-samples than the overall population. On the other hand, there might be some systematic photometric redshift errors in the blue sub-samples, so that some of the sub-samples show significantly enhanced 2PCF at large scales. Therefore, focusing only on the red and all (sub-)samples, we find that the biases of galaxies in these (sub-)samples show clear color, redshift and luminosity dependencies, in that red brighter galaxies at higher redshift are more biased than their bluer and low redshift counterparts. Apart from the best fit set of parameters, $σ_{z}$ and $b$, from this state-of-the-art photometric redshift survey, we obtain high precision intrinsic clustering measurements for these 40 red and all galaxy (sub-)samples. These measurements on large and small scales hold important information regarding the cosmology and galaxy formation, which will be used in our subsequent probes in this series.

astro-ph.GA↗