Search

The decarbonization of power and energy systems faces a bottleneck: The enormous number of user-side resources cannot be properly managed and operated by centralized system operators, who used to send dispatch instructions only to a few large power plants. To break through, we need not only new devices and algorithms, but structural reforms of our energy systems. Taking the Internet as a paradigm, a practicable design of the Energy Internet is presented based on the principle of standardization. A combination of stylized data and energy delivery, referred to as a Block of Energy Exchange (BEE), is designed as the media to be communicated, which is parsed by the Energy Internet Card. Each Energy Internet Card is assigned a unique MAC address, defining a participant of the Energy Internet, whose standardized profile will be automatically updated according to BEE transfers without the intervention of any centralized operator. The structure of Energy Internet and protocols thereof to support the transfer of BEE are presented. System operators will become Energy Internet Service Providers, who operate the energy system by flow control and dispatching centralized resources, which is decoupled from users' behaviors in the Energy Internet. Example shows that the Energy Internet can not only reduce carbon emissions via interactions between peers, but also promotes energy democracy and dwindles the gap in energy equity.

Multi-View Diffusion Models (MVDMs) enable remarkable improvements in the field of 3D geometric reconstruction, but the issue regarding intellectual property has received increasing attention due to unauthorized imitation. Recently, some works have utilized adversarial attacks to protect copyright. However, all these works focus on single-image generation tasks which only need to consider the inner feature of images. Previous methods are inefficient in attacking MVDMs because they lack the consideration of disrupting the geometric and visual consistency among the generated multi-view images. This paper is the first to address the intellectual property infringement issue arising from MVDMs. Accordingly, we propose a novel latent feature and attention dual erasure attack to disrupt the distribution of latent feature and the consistency across the generated images from multi-view and multi-domain simultaneously. The experiments conducted on SOTA MVDMs indicate that our approach achieves superior performances in terms of attack effectiveness, transferability, and robustness against defense methods. Therefore, this paper provides an efficient solution to protect 3D assets from MVDMs-based 3D geometry reconstruction.

A residual deep reinforcement learning (RDRL) approach is proposed by integrating DRL with model-based optimization for inverter-based volt-var control in active distribution networks when the accurate power flow model is unknown. RDRL learns a residual action with a reduced residual action space, based on the action of the model-based approach with an approximate model. RDRL inherits the control capability of the approximate-model-based optimization and enhances the policy optimization capability by residual policy learning. Additionally, it improves the approximation accuracy of the critic and reduces the search difficulties of the actor by reducing residual action space. To address the issues of "too small" or "too large" residual action space of RDRL and further improve the optimization performance, we extend RDRL to a boosting RDRL approach. It selects a much smaller residual action space and learns a residual policy by using the policy of RDRL as a base policy. Simulations demonstrate that RDRL and boosting RDRL improve the optimization performance considerably throughout the learning stage and verify their rationales point-by-point, including 1) inheriting the capability of the approximate model-based optimization, 2) residual policy learning, and 3) learning in a reduced action space., Comment: arXiv admin note: text overlap with arXiv:2210.07360

In this paper, we propose a two-stage robust planning model for an Integrated Energy System (IES) that serves an industrial park. The term 'Park-level IES' is used to refers to IES of a smaller scale but have high demands for various forms of energy. The proposed planning model considers uncertainties like load demand fluctuations and equipment contingencies, and provides a reliable scheme of equipment selection and sizing for IES investors. Inspired by the unit commitment problem, we formulate an equipment contingency uncertainty set to accurately describe the potential equipment contingencies which happen and can be repaired within a day. Then, a novel and modified nested column-and-constraint generation algorithm is applied to solve this two-stage robust planning model with integer recourse efficiently. In the case study, the role of energy storage system for IES reliability enhancement is analyzed in detail. Computational results demonstrate the advantage of the proposed models over the deterministic planning model in terms of improving reliability.

The prevalence of convolution neural networks (CNNs) and vision transformers (ViTs) has markedly revolutionized the area of single-image super-resolution (SISR). To further boost the SR performances, several techniques, such as residual learning and attention mechanism, are introduced, which can be largely attributed to a wider range of activated area, that is, the input pixels that strongly influence the SR results. However, the possibility of further improving SR performance through another versatile vision backbone remains an unresolved challenge. To address this issue, in this paper, we unleash the representation potential of the modern state space model, i.e., Vision Mamba (Vim), in the context of SISR. Specifically, we present three recipes for better utilization of Vim-based models: 1) Integration into a MetaFormer-style block; 2) Pre-training on a larger and broader dataset; 3) Employing complementary attention mechanism, upon which we introduce the MMA. The resulting network MMA is capable of finding the most relevant and representative input pixels to reconstruct the corresponding high-resolution images. Comprehensive experimental analysis reveals that MMA not only achieves competitive or even superior performance compared to state-of-the-art SISR methods but also maintains relatively low memory and computational overheads (e.g., +0.5 dB PSNR elevation on Manga109 dataset with 19.8 M parameters at the scale of 2). Furthermore, MMA proves its versatility in lightweight SR applications. Through this work, we aim to illuminate the potential applications of state space models in the broader realm of image processing rather than SISR, encouraging further exploration in this innovative direction., Comment: 19 pages, 7 figures

In this paper, we explore how to design lightweight CNN architecture for embedded computing systems. We propose L-Mobilenet model for ZYNQ based hardware platform. L-Mobilenet can adapt well to the hardware computing and accelerating, and its network structure is inspired by the state-of-the-art work of Inception-ResnetV1 and MobilenetV2, which can effectively reduce parameters and delay while maintaining the accuracy of inference. We deploy our L-Mobilenet model to ZYNQ embedded platform for fully evaluating the performance of our design. By measuring in cifar10 and cifar100 datasets, L-Mobilenet model is able to gain 3x speed up and 3.7x fewer parameters than MobileNetV2 while maintaining a similar accuracy. It also can obtain 2x speed up and 1.5x fewer parameters than ShufflenetV2 while maintaining the same accuracy. Experiments show that our network model can obtain better performance because of the special considerations for hardware accelerating and software-hardware co-design strategies in our L-Mobilenet bottleneck architecture.

Transient stability-constrained preventive redispatch plays a crucial role in ensuring power system security and stability. Since redispatch strategies need to simultaneously satisfy complex transient constraints and the economic need, model-based formulation and optimization become extremely challenging. In addition, the increasing uncertainty and variability introduced by renewable sources start to drive the system stability consideration from deterministic to probabilistic, which further exaggerates the complexity. In this paper, a Graph neural network guided Distributional Deep Reinforcement Learning (GD2RL) method is proposed, for the first time, to solve the uncertainty-aware transient stability-constrained preventive redispatch problem. First, a graph neural network-based transient simulator is trained by supervised learning to efficiently generate post-contingency rotor angle curves with the steady-state and contingency as inputs, which serves as a feature extractor for operating states and a surrogate time-domain simulator during the environment interaction for reinforcement learning. Distributional deep reinforcement learning with explicit uncertainty distribution of system operational conditions is then applied to generate the redispatch strategy to balance the user-specified probabilistic stability performance and economy preferences. The full distribution of the post-redispatch transient stability index is directly provided as the output. Case studies on the modified New England 39-bus system validate the proposed method., Comment: 13 pages,11 figures,accepted by IEEE Transactions on Power Systems on 24-Jun-2024

Regulating the proper carbon-aware intervention policy is one of the keys to emission alleviation in the distribution network, whose basis lies in effectively attributing the emission responsibility using emission factors. This paper establishes the distribution locational marginal emission (DLME) to calculate the marginal change of emission from the marginal change of both active and reactive load demand for incentivizing carbon alleviation. It first formulates the day-head distribution network scheduling model based on the second-order cone program (SOCP). The emission propagation and responsibility are analyzed from demand to supply to system emission. Considering the complex and implicit mapping of the SOCP-based scheduling model, the implicit theorem is leveraged to exploit the optimal condition of SOCP. The corresponding SOCP-based implicit derivation approach is proposed to calculate the DLMEs effectively in a model-based way. Comprehensive numerical studies are conducted to verify the superiority of the proposed method by comparing its calculation efficacy to the conventional marginal estimation approach, assessing its effectiveness in carbon alleviation with comparison to the average emission factors, and evaluating its carbon alleviation ability of reactive DLME.

Due to the energy crisis and environmental pollution, the installed capacity of inverter-based resources (IBRs) in power grids is rapidly increasing, and grid-following control (GFL) is the most prevalent at present. Meanwhile, grid-forming control-based (GFM) devices have been installed in the grid to provide active support for frequency and voltage. In the future GFL devices combined with GFM will be promising, especially in power systems with high penetration or 100% IBRs. When a short-circuit fault occurs in the grid, the controlled current source characteristic of the GFL devices leads to insufficient dynamic voltage support (DVS), while the GFM devices usually reduce the internal voltage to limit the current. Thus, deep voltage sags and undesired disconnections of IBRs may occur. Moreover, due to the dispersed locations and the control strategies' diversity of IBRs, the voltage support of different devices may not be fully coordinated, which is not conducive to short-term voltage security (STVS). To address this issue, a control scheme based on the simulation of transient characteristics of synchronous machines (SMs) is proposed. Then, a new fault ride-through strategy (FRT) is proposed based on the characteristic differences between GFL and GFM devices, and an optimization model of multi-device control parameters is formulated to meet the short-term voltage security constraints (SVSCs) and device capacity constraints. Finally, a fast solution method based on analytical modeling is proposed for the model. Test results based on the doublegenerator-one-load system, the IEEE 14-bus system, and other systems of different sizes show that the proposed method can effectively enhance the active support capability of GFL and GFM to the grid voltage, and avoid the large-scale disconnection of IBRs, Comment: 10 pages, 13 figures

This paper proposes a multiagent based bi-level operation framework for the low-carbon demand management in distribution networks considering the carbon emission allowance on the demand side. In the upper level, the aggregate load agents optimize the control signals for various types of loads to maximize the profits; in the lower level, the distribution network operator makes optimal dispatching decisions to minimize the operational costs and calculates the distribution locational marginal price and carbon intensity. The distributed flexible load agent has only incomplete information of the distribution network and cooperates with other agents using networked communication. Finally, the problem is formulated into a networked multi-agent constrained Markov decision process, which is solved using a safe reinforcement learning algorithm called consensus multi-agent constrained policy optimization considering the carbon emission allowance for each agent. Case studies with the IEEE 33-bus and 123-bus distribution network systems demonstrate the effectiveness of the proposed approach, in terms of satisfying the carbon emission constraint on demand side, ensuring the safe operation of the distribution network and preserving privacy of both sides., Comment: Submitted to IEEE Transactions on Sustainable Energy

A novel decentralized peer-to-peer-to-grid (P2P2G) trading mechanism considering distribution network integrity is proposed. In order to direct prosumers' peer-to-peer (P2P) trading behavior to be grid-friendly, the proposed method incorporates Dynamic Operating Envelopes (DOEs) into the existing P2P2G trading. Moreover, DOEs are determined through negotiations between the distribution system operator (DSO) and prosumers alongside the process of P2P trading, avoiding compromising prosumers' privacy and network parameters leakage. To reduce communication costs during P2P trading, a variant of the alternating direction method of multipliers (ADMM), i.e., communication-censored ADMM (COCA) is used to solve the P2P2G trading problem. Finally, the DOE price is shown to be comprised of several economically interpretable components. Simulations validate the effectiveness of the proposed mechanism.

The contrastive vision-language pre-training, known as CLIP, demonstrates remarkable potential in perceiving open-world visual concepts, enabling effective zero-shot image recognition. Nevertheless, few-shot learning methods based on CLIP typically require offline fine-tuning of the parameters on few-shot samples, resulting in longer inference time and the risk of over-fitting in certain domains. To tackle these challenges, we propose the Meta-Adapter, a lightweight residual-style adapter, to refine the CLIP features guided by the few-shot samples in an online manner. With a few training samples, our method can enable effective few-shot learning capabilities and generalize to unseen data or tasks without additional fine-tuning, achieving competitive performance and high efficiency. Without bells and whistles, our approach outperforms the state-of-the-art online few-shot learning method by an average of 3.6\% on eight image classification datasets with higher inference speed. Furthermore, our model is simple and flexible, serving as a plug-and-play module directly applicable to downstream tasks. Without further fine-tuning, Meta-Adapter obtains notable performance improvements in open-vocabulary object detection and segmentation tasks., Comment: Accepted by NeurIPS 2023

A group is LERF (locally extended residually finite) if all its finitely generated subgroups are separable. We prove that the trialitarian arithmetic lattices in $\mathbf{PSO}_{7,1}(\mathbb{R})$ are not LERF. This result, together with previous work by the third author, implies that all arithmetic lattices in $\mathbf{PO}_{n,1}(\mathbb{R})$, $n>3$, are not LERF., Comment: 8 pages, 1 figure (minor changes like typos, etc)

Software development plays a crucial role in driving innovation and efficiency across modern societies. To meet the demands of this dynamic field, there is a growing need for an effective software development assistant. However, existing large language models represented by ChatGPT suffer from limited accessibility, including training data and model weights. Although other large open-source models like LLaMA have shown promise, they still struggle with understanding human intent. In this paper, we present SoTaNa, an open-source software development assistant. SoTaNa utilizes ChatGPT to generate high-quality instruction-based data for the domain of software engineering and employs a parameter-efficient fine-tuning approach to enhance the open-source foundation model, LLaMA. We evaluate the effectiveness of \our{} in answering Stack Overflow questions and demonstrate its capabilities. Additionally, we discuss its capabilities in code summarization and generation, as well as the impact of varying the volume of generated data on model performance. Notably, SoTaNa can run on a single GPU, making it accessible to a broader range of researchers. Our code, model weights, and data are public at \url{https://github.com/DeepSoftwareAnalytics/SoTaNa}.

This paper studies an adaptive approach for probabilistic wind power forecasting (WPF) including offline and online learning procedures. In the offline learning stage, a base forecast model is trained via inner and outer loop updates of meta-learning, which endows the base forecast model with excellent adaptability to different forecast tasks, i.e., probabilistic WPF with different lead times or locations. In the online learning stage, the base forecast model is applied to online forecasting combined with incremental learning techniques. On this basis, the online forecast takes full advantage of recent information and the adaptability of the base forecast model. Two applications are developed based on our proposed approach concerning forecasting with different lead times (temporal adaptation) and forecasting for newly established wind farms (spatial adaptation), respectively. Numerical tests were conducted on real-world wind power data sets. Simulation results validate the advantages in adaptivity of the proposed methods compared with existing alternatives.

Increasing attention has been paid to resources on islands, thus microgrids on islands need to be invested. Different from onshore microgrids, offshore microgrids (OM) are usually abundant in ocean renewable energy (ORE), such as offshore wind, tidal power generation (TPG), etc. Moreover, some special loads such as seawater desalination unit (SDU) should be included. In this sense, this paper proposes a planning method for OM to minimize the investment cost while the ORE's fluctuation could be accommodated with robustness. First, a deterministic planning model (DPM) is formulated for the OM with TPG and SDU. A robust planning model (RPM) is then developed considering the uncertainties from both TPG and load demand. The Column-and-constraint generation (C&CG) algorithm is then employed to solve the RPM, producing planning results for the OM that is robust against the worst scenario. Results of the case studies show that the investment and operation decisions of the proposed model are robust, and TPG shows good complementarity with the other RESs.

In this paper, the intra-day multi-interval rolling-window joint dispatch and pricing of energy and reserve is studied under increasing volatile and uncertain renewable generations. A look-ahead energy-reserve co-optimization model is proposed for the rolling-window dispatch, where possible contingencies and load/renewable forecast errors over the look-ahead window are modeled as several scenario trajectories, while generation, especially its ramp, is jointly scheduled with reserve to minimize the expected system cost considering these scenarios. Based on the proposed model, marginal prices of energy and reserve are derived, which incorporate shadow prices of generators' individual ramping capability limits to eliminate their possible ramping-induced opportunity costs or arbitrages. We prove that under mild conditions, the proposed market design provides dispatch-following incentives to generators without the need for out-of-the-market uplifts, and truthful-bidding incentives of price-taking generators can be guaranteed as well. Some discussions are also made on how to fit the proposed framework into current market practice. These findings are validated in numerical simulations.

For high wind power-penetrated power systems, the multiple renewable energy station short-circuit ratio (MRSCR) is often insufficient due to weak grid structures. Additionally, transient voltage sag/overvoltage issues may cause trip faults of wind turbines (WTs). Due to the time delay in WTs' controllers, it is difficult for WTs alone to meet the reactive power demands in different stages of the transient process. Some synchronous machines (SMs) must be retained through unit commitment (UC) scheduling to improve MRSCR and prevent trip faults of WTs. The MRSCR and short-term voltage security constrained-UC model is a mixed integer nonlinear programming (MINLP) problem with differential algebraic equations (DAEs) and symbolic matrix inversion, which is intractable to solve. Based on the dynamic characteristics of different devices, the original model is simplified as a general MINLP model without DAEs. Then, generalized Benders decomposition is applied to improve the solution efficiency. The relaxed MRSCR constraints are formulated in the master problem to improve the convergence, and the precise MRSCR constraints are formulated in the subproblems to consider the impact of voltage profiles. Case studies based on several benchmark systems and a provincial power grid verify the validity and efficiency of the proposed method, Comment: 10 pages,11 figures

Decarbonizing the energy supply is essential and urgent to mitigate the increasingly visible climate change. Its basis is identifying emission responsibility during power allocation by the carbon emission flow (CEF) model. However, the main challenge of CEF application is the intractable nonlinear relationship between carbon emission and power allocation. So this paper leverages the high approximation capability and the mixed-integer linear programming (MILP) representability of the deep neural networks to tackle the complex CEF model in carbon-electricity coordinated optimization. The compact constraint learning approach is proposed to learn the mapping from power injection to bus emission with sparse neural networks (SNNs). Then the trained SNNs are transformed equivalently as MILP constraints in the downstream optimization. In light of the ``high emission with high price'' principle, the blocked carbon price mechanism is designed to price emissions from the demand side. Based on the constraint learning and mechanism design, this paper proposes the carbon-aware energy management model in the tractable MILP form to unlock the carbon reduction potential from the demand side. The case study verifies the approximation accuracy and sparsity of SNN with fewer parameters for accelerating optimization solution and reduction effectiveness of demand-side capability for mitigating emission.

Electricity price prediction plays a vital role in energy storage system (ESS) management. Current prediction models focus on reducing prediction errors but overlook their impact on downstream decision-making. So this paper proposes a decision-focused electricity price prediction approach for ESS arbitrage to bridge the gap from the downstream optimization model to the prediction model. The decision-focused approach aims at utilizing the downstream arbitrage model for training prediction models. It measures the difference between actual decisions under the predicted price and oracle decisions under the true price, i.e., decision error, by regret, transforms it into the tractable surrogate regret, and then derives the gradients to predicted price for training prediction models. Based on the prediction and decision errors, this paper proposes the hybrid loss and corresponding stochastic gradient descent learning method to learn prediction models for prediction and decision accuracy. The case study verifies that the proposed approach can efficiently bring more economic benefits and reduce decision errors by flattening the time distribution of prediction errors, compared to prediction models for only minimizing prediction errors.

The increasing penetration of distributed energy resources (DERs) will decrease the rotational inertia of the power system and further degrade the system frequency stability. To address the above issues, this paper leverages the advanced neural network (NN) to learn the frequency dynamics and incorporates NN to facilitate system reliable operation. This paper proposes the conservative sparse neural network (CSNN) embedded frequency-constrained unit commitment (FCUC) with converter-based DERs, including the learning and optimization stages. In the learning stage, it samples the inertia parameters, calculates the corresponding frequency, and characterizes the stability region of the sampled parameters using the convex hulls to ensure stability and avoid extrapolation. For conservativeness, the positive prediction error penalty is added to the loss function to prevent possible frequency requirement violation. For the sparsity, the NN topology pruning is employed to eliminate unnecessary connections for solving acceleration. In the optimization stage, the trained CSNN is transformed into mixed-integer linear constraints using the big-M method and then incorporated to establish the data-enhanced model. The case study verifies 1) the effectiveness of the proposed model in terms of high accuracy, fewer parameters, and significant solving acceleration; 2) the stable system operation against frequency violation under contingency.

Recently, fine-tuning pre-trained code models such as CodeBERT on downstream tasks has achieved great success in many software testing and analysis tasks. While effective and prevalent, fine-tuning the pre-trained parameters incurs a large computational cost. In this paper, we conduct an extensive experimental study to explore what happens to layer-wise pre-trained representations and their encoded code knowledge during fine-tuning. We then propose efficient alternatives to fine-tune the large pre-trained code model based on the above findings. Our experimental study shows that (1) lexical, syntactic and structural properties of source code are encoded in the lower, intermediate, and higher layers, respectively, while the semantic property spans across the entire model. (2) The process of fine-tuning preserves most of the code properties. Specifically, the basic code properties captured by lower and intermediate layers are still preserved during fine-tuning. Furthermore, we find that only the representations of the top two layers change most during fine-tuning for various downstream tasks. (3) Based on the above findings, we propose Telly to efficiently fine-tune pre-trained code models via layer freezing. The extensive experimental results on five various downstream tasks demonstrate that training parameters and the corresponding time cost are greatly reduced, while performances are similar or better. Replication package including source code, datasets, and online Appendix is available at: \url{https://github.com/DeepSoftwareAnalytics/Telly}., Comment: Accepted by ISSTA 2023 (The 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis)

The set of degrees of maps $D(M,N)$, where $M,N$ are closed oriented $n$-manifolds, always contains $0$ and the set of degrees of self-maps $D(M)$ always contains $0$ and $1$. Also, if $a,b\in D(M)$, then $ab\in D(M)$; a set $A\subseteq\mathbb Z$ so that $ab\in A$ for each $a,b\in A$ is called multiplicative. On the one hand, not every infinite set of integers (containing $0$) is a mapping degree set [NWW] and, on the other hand, every finite set of integers (containing $0$) is the mapping degree set of some $3$-manifolds [CMV]. We show the following: (i) Not every multiplicative set $A$ containing $0,1$ is a self-mapping degree set. (ii) For each $n\in\mathbb N$ and $k\geq3$, every $D(M,N)$ for $n$-manifolds $M$ and $N$ is $D(P,Q)$ for some $(n+k)$-manifolds $P$ and $Q$. As a consequence of (ii) and [CMV], every finite set of integers (containing $0$) is the mapping degree set of some $n$-manifolds for all $n\neq 1,2,4,5$., Comment: 8 pages; v2: final version, to appear in Proceedings of the American Mathematical Society

In an attempt to improve the utilization efficiency of multi-energy coupling in park-level integrated energy system (PIES), promote wind power consumption and reduce carbon emissions, a low-carbon economic operation optimization model of PIES integrating flexible load and carbon trading mechanism is constructed. Firstly, according to the characteristics of load response, the demand response is divided into four types: which can be shifted, transferred, reduced and replaced. Secondly, the PIES basic architecture is given by considering the combined heat and power generation coupling equipment, new energy and flexible load in the park. Finally, introducing the ladder-type carbon trading mechanism into the system and minimize the total operating cost, the low-carbon economic operation optimization model of PIES is established. The YALMIP toolbox and CPLEX solver are used to solve the example, the simulation results show that the participation of electrical and thermal coupled scheduling and flexible electric or thermal loads can significantly reduce the system operating cost, reduce the load peak-to-valley difference and relieve peak power consumption pressure., Comment: accepted by Energy Reports

Transformers, the de-facto standard for language modeling, have been recently applied for vision tasks. This paper introduces sparse queries for vision transformers to exploit the intrinsic spatial redundancy of natural images and save computational costs. Specifically, we propose a Dynamic Grained Encoder for vision transformers, which can adaptively assign a suitable number of queries to each spatial region. Thus it achieves a fine-grained representation in discriminative regions while keeping high efficiency. Besides, the dynamic grained encoder is compatible with most vision transformer frameworks. Without bells and whistles, our encoder allows the state-of-the-art vision transformers to reduce computational complexity by 40%-60% while maintaining comparable performance on image classification. Extensive experiments on object detection and segmentation further demonstrate the generalizability of our approach. Code is available at https://github.com/StevenGrove/vtpack., Comment: Accepted by NeurIPS2021

Recent studies have demonstrated that object detection networks are usually vulnerable to adversarial examples. Generally, adversarial attacks for object detection can be categorized into targeted and untargeted attacks. Compared with untargeted attacks, targeted attacks present greater challenges and all existing targeted attack methods launch the attack by misleading detectors to mislabel the detected object as a specific wrong label. However, since these methods must depend on the presence of the detected objects within the victim image, they suffer from limitations in attack scenarios and attack success rates. In this paper, we propose a targeted feature space attack method that can mislead detectors to `fabricate' extra designated objects regardless of whether the victim image contains objects or not. Specifically, we introduce a guided image to extract coarse-grained features of the target objects and design an innovative dual attention mechanism to filter out the critical features of the target objects efficiently. The attack performance of the proposed method is evaluated on MS COCO and BDD100K datasets with FasterRCNN and YOLOv5. Evaluation results indicate that the proposed targeted feature space attack method shows significant improvements in terms of image-specific, universality, and generalization attack performance, compared with the previous targeted attack for object detection.

As an efficient way to integrate multiple distributed energy resources and the user side, a microgrid is mainly faced with the problems of small-scale volatility, uncertainty, intermittency and demand-side uncertainty of DERs. The traditional microgrid has a single form and cannot meet the flexible energy dispatch between the complex demand side and the microgrid. In response to this problem, the overall environment of wind power, thermostatically controlled loads, energy storage systems, price-responsive loads and the main grid is proposed. Secondly, the centralized control of the microgrid operation is convenient for the control of the reactive power and voltage of the distributed power supply and the adjustment of the grid frequency. However, there is a problem in that the flexible loads aggregate and generate peaks during the electricity price valley. The existing research takes into account the power constraints of the microgrid and fails to ensure a sufficient supply of electric energy for a single flexible load. This paper considers the response priority of each unit component of TCLs and ESSs on the basis of the overall environment operation of the microgrid so as to ensure the power supply of the flexible load of the microgrid and save the power input cost to the greatest extent. Finally, the simulation optimization of the environment can be expressed as a Markov decision process process. It combines two stages of offline and online operations in the training process. The addition of multiple threads with the lack of historical data learning leads to low learning efficiency. The asynchronous advantage actor-critic with the experience replay pool memory library is added to solve the data correlation and nonstatic distribution problems during training., Comment: Sensors

This paper proposes a nonparametric multivariate density forecast model based on deep learning. It not only offers the whole marginal distribution of each random variable in forecasting targets, but also reveals the future correlation between them. Differing from existing multivariate density forecast models, the proposed method requires no a priori hypotheses on the forecasted joint probability distribution of forecasting targets. In addition, based on the universal approximation capability of neural networks, the real joint cumulative distribution functions of forecasting targets are well-approximated by a special positive-weighted deep neural network in the proposed method. Numerical tests from different scenarios were implemented under a comprehensive verification framework for evaluation, including the very short-term forecast of the wind speed, wind power, and the day-ahead forecast of the aggregated electricity load. Testing results corroborate the superiority of the proposed method over current multivariate density forecast models considering the accordance with reality, prediction interval width, and correlations between different random variables.

Reference-model-assisted deep reinforcement learning (DRL) for inverter-based Volt-Var Control (IB-VVC) in active distribution networks is proposed. We investigate that a large action space increases the learning difficulties of DRL and degrades the optimization performance in the process of generating data and training neural networks. To reduce the action space of DRL, we design a reference-model-assisted DRL approach. We introduce definitions of the reference model, reference-model-based optimization, and reference actions. The reference-model-assisted DRL learns the residual actions between the reference actions and optimal actions, rather than learning the optimal actions directly. Since the residual actions are considerably smaller than the optimal actions for a reference model, we can design a smaller action space for the reference-model-assisted DRL. It reduces the learning difficulties of DRL and optimises the performance of the reference-model-assisted DRL approach. It is noteworthy that the reference-model-assisted DRL approach is compatible with any policy gradient DRL algorithms for continuous action problems. This work takes the soft actor-critic algorithm as an example and designs a reference-model-assisted soft actor-critic algorithm. Simulations show that 1) large action space degrades the performance of DRL in the whole training stage, and 2) reference-model-assisted DRL requires fewer iteration times and returns a better optimization performance., Comment: 10 pages, 9 figures

We prove that for any oriented cusped hyperbolic 3-manifold $M$ and any compact oriented 3-manifold $N$ with tori boundary, there exists a finite cover $M'$ of $M$ that admits a degree-8 map $f:M'\to N$, i.e. $M$ virtually 8-dominates $N$., Comment: 63 pages, 9 figures. Comments are welcome!

The problem of state estimations for electric distribution system is considered. A collaborative filtering approach is proposed in this paper to integrate the slow time-scale smart meter measurements in the distribution system state estimation, in which the deep Gaussian process is incorporated to infer the fast time-scale pseudo measurements and avoid anomalies. Numerical tests have demonstrated the higher estimation accuracy of the proposed method.

High-voltage direct current (HVDC) transmission applications and the growth of the dynamic load in large-scale receiving-end grids lead to a higher risk of short-term voltage instability. An effective way to address this problem is to improve the system's dynamic voltage support capability by changing the operation status of dynamic var devices, and the dynamic var reserve (DVR) is commonly used. Due to the time delay in synchronous machine excitation systems, the dynamic var reserved at steady state cannot be exploited immediately under large disturbances. In addition, some reactive power is produced immediately through electromagnetic induction. The voltage support effect of the two capabilities is analyzed based on the flux linkage and an approximate simulation of the fault impact. Then two novel indexes for evaluating the voltage inertia and voltage recovery capability are proposed, which are related to the voltage nadir and voltage recovery speed. The indexes' physical meanings are revealed by comparison with the frequency response, and the potential applications in planning and optimal reactive power dispatch (ORPD) are introduced. Numerical simulations based on the IEEE 39-bus system verify that the indexes can quantify the voltage support capabilities, and the minimum voltage support requirements are obtained to maintain systems' security., Comment: 10 pages, 10 figures

The problem of heat and electricity pricing in combined heat and power systems regarding the time scales of electricity and heat, as well as thermal energy quality, is studied. Based on the asynchronous coordinated dispatch of the combined heat and power system, an energy-grade double pricing mechanism is proposed. Under the pricing mechanism, the resulting merchandise surplus of the heat system operator at each heat dispatch interval can be decomposed into interpretable parts and its revenue adequacy can be guaranteed for all heat dispatch intervals. And the electric power system operator's resulting merchandise surplus is composed of non-negative components at each electricity dispatch interval, also ensuring its revenue adequacy. In addition, the effects of different time scales and cogeneration are analyzed in different kinds of combined heat and power units' pricing.

A multiple market trading mechanism for the VPP to participate in electricity, renewable energy certificate (REC) and carbon emission right (CER) markets is proposed. With the introduction of the inventory mechanism of REC and CER, the profit of the VPP increases and better trading decisions with multiple markets are made under the requirements of renewable portfolio standard (RPS) and carbon emission (CE) quota requirements. According to the Karush-Kuhn-Tucker (KKT) conditions of the proposed model, properties of the multiple market trading mechanism are discussed. Results from case studies verify the effectiveness of the proposed model.

Many point-based 3D detectors adopt point-feature sampling strategies to drop some points for efficient inference. These strategies are typically based on fixed and handcrafted rules, making it difficult to handle complicated scenes. Different from them, we propose a Dynamic Ball Query (DBQ) network to adaptively select a subset of input points according to the input features, and assign the feature transform with a suitable receptive field for each selected point. It can be embedded into some state-of-the-art 3D detectors and trained in an end-to-end manner, which significantly reduces the computational cost. Extensive experiments demonstrate that our method can increase the inference speed by 30%-100% on KITTI, Waymo, and ONCE datasets. Specifically, the inference speed of our detector can reach 162 FPS on KITTI scene, and 30 FPS on Waymo and ONCE scenes without performance degradation. Due to skipping the redundant points, some evaluation metrics show significant improvements. Codes will be released at https://github.com/yancie-yjr/DBQ-SSD., Comment: ICLR 2023. Code at https://github.com/yancie-yjr/DBQ-SSD

The optimal operation problem of electric vehicle aggregator (EVA) is considered. An EVA can participate in energy and regulation markets with its current and upcoming EVs, thus reducing its total cost of purchasing energy to fulfill EVs' charging requirements. A model predictive control (MPC) based optimization is developed to consider the future arrival of EVs as well as energy and regulation prices. The index of conditional value-at-risk (CVaR) is used to model the risk-averseness of an EVA. Simulations on a 2000-EV test system validate the effectiveness of our work in achieving a lucrative revenue while satisfying the charging requests from EV owners.

Integrated energy systems (IESs), in which various energy flows are interconnected and coordinated to release potential flexibility for more efficient and secure operation, have drawn increasing attention in recent years. In this article, an integrated energy management system (IEMS) that performs online analysis and optimization on coupling energy flows in an IES is comprehensively introduced. From the theory perspective, an energy circuit method (ECM) that models natural gas networks and heating networks in the frequency domain is discussed. This method extends the electric circuit modeling of power systems to IESs and enables the IEMS to manage large-scale IESs. From the implementation perspective, the architecture design and function development of the IEMS are presented. Tutorial examples with illustrative case studies are provided to demonstrate its functions of dynamic state estimation, energy flow analysis, security assessment and control, and optimal energy flow. From the application perspective, real-world engineering demonstrations that apply IEMSs in managing building-scale, park-scale, and city-scale IESs are reported. The economic and environmental benefits obtained in these demonstration projects indicate that the IEMS has broad application prospects for a low/zero-carbon future energy system.

With more energy networks being interconnected to form integrated energy systems (IESs), the optimal energy flow (OEF) problem has drawn increasing attention. Extant studies on OEF models mostly utilize the finite difference method (FDM) to address partial-differential-equation (PDE) constraints related to the dynamics in natural gas networks (NGNs) and district heating networks (DHNs). However, this time-domain approach suffers from a heavy computational burden with regard to achieving high finite-difference accuracy. In this paper, a novel OEF model that formulates NGN and DHN constraints in the frequency domain and corresponding model compaction techniques for efficient solving are contributed. First, an energy circuit method (ECM) that algebraizes the PDEs of NGNs and DHNs in the frequency domain is introduced. Then, an ECM-based OEF model is formulated, which contains fewer variables and constraints than an FDM-based OEF model and thereby yields better solving efficiency. Finally, variable space projection is employed to remove implicit variables, by which another constraint generation algorithm is enabled to remove redundant constraints. These two techniques further compact the OEF model and bring about a second improvement in solving efficiency. Numerical tests on actual systems indicate the final OEF model reduces variables and constraints by more than 95% and improves the solving efficiency by more than 10 times. In conclusion, the proposed OEF model and solving techniques well meet the optimization needs of large-scale IESs.

To safely and rationally participate in dense and heterogeneous traffic, autonomous vehicles require to sufficiently analyze the motion patterns of surrounding traffic-agents and accurately predict their future trajectories. This is challenging because the trajectories of traffic-agents are not only influenced by the traffic-agents themselves but also by spatial interaction with each other. Previous methods usually rely on the sequential step-by-step processing of Long Short-Term Memory networks (LSTMs) and merely extract the interactions between spatial neighbors for single type traffic-agents. We propose the Spatio-Temporal Transformer Networks (S2TNet), which models the spatio-temporal interactions by spatio-temporal Transformer and deals with the temporel sequences by temporal Transformer. We input additional category, shape and heading information into our networks to handle the heterogeneity of traffic-agents. The proposed methods outperforms state-of-the-art methods on ApolloScape Trajectory dataset by more than 7\% on both the weighted sum of Average and Final Displacement Error. Our code is available at https://github.com/chenghuang66/s2tnet., Comment: Accepted by ACML2021

Simultaneous Localization and Mapping (SLAM) is considered to be an essential capability for intelligent vehicles and mobile robots. However, most of the current lidar SLAM approaches are based on the assumption of a static environment. Hence the localization in a dynamic environment with multiple moving objects is actually unreliable. The paper proposes a dynamic SLAM framework RF-LIO, building on LIO-SAM, which adds adaptive multi-resolution range images and uses tightly-coupled lidar inertial odometry to first remove moving objects, and then match lidar scan to the submap. Thus, it can obtain accurate poses even in high dynamic environments. The proposed RF-LIO is evaluated on both self-collected datasets and open Urbanloco datasets. The experimental results in high dynamic environments demonstrate that, compared with LOAM and LIO-SAM, the absolute trajectory accuracy of the proposed RF-LIO can be improved by 90% and 70%, respectively. RF-LIO is one of the state-of-the-art SLAM systems in high dynamic environments.

The problem of heat system pricing is considered. A direct extension of locational marginal prices (LMP) in electricity markets to heat systems may lead to revenue inadequate issues. The underlying reason for such a problem is that, unlike electric power, heat has different grades and cannot be considered as homogenized commodity. Accordingly, an energy-grade double pricing rule is proposed in this paper. Heat energy and grade prices are explained as the shadow prices related to the nodal heat balance constraints and temperature requirements constraints at the optimal solution. The resulting merchandise surplus at each dispatch interval can be decomposed into several explainable parts, namely, congestion rent, impact from the last period, and impact from the upcoming period. And the total merchandise surplus over all dispatch intervals can be decomposed into several non-negative interpretable parts, including congestion rent and impact from the initial state, thus guaranteeing the revenue adequacy for the heat system operator. Simulations verify the effectiveness of the proposed mechanism.

Code search aims to retrieve semantically relevant code snippets for a given natural language query. Recently, many approaches employing contrastive learning have shown promising results on code representation learning and greatly improved the performance of code search. However, there is still a lot of room for improvement in using contrastive learning for code search. In this paper, we propose CoCoSoDa to effectively utilize contrastive learning for code search via two key factors in contrastive learning: data augmentation and negative samples. Specifically, soft data augmentation is to dynamically masking or replacing some tokens with their types for input sequences to generate positive samples. Momentum mechanism is used to generate large and consistent representations of negative samples in a mini-batch through maintaining a queue and a momentum encoder. In addition, multimodal contrastive learning is used to pull together representations of code-query pairs and push apart the unpaired code snippets and queries. We conduct extensive experiments to evaluate the effectiveness of our approach on a large-scale dataset with six programming languages. Experimental results show that: (1) CoCoSoDa outperforms 14 baselines and especially exceeds CodeBERT, GraphCodeBERT, and UniXcoder by 13.3%, 10.5%, and 5.9% on average MRR scores, respectively. (2) The ablation studies show the effectiveness of each component of our approach. (3) We adapt our techniques to several different pre-trained models such as RoBERTa, CodeBERT, and GraphCodeBERT and observe a significant boost in their performance in code search. (4) Our model performs robustly under different hyper-parameters. Furthermore, we perform qualitative and quantitative analyses to explore reasons behind the good performance of our model., Comment: Accepted by ICSE 2023 (The 45th International Conference on Software Engineering)

A one-step two-critic deep reinforcement learning (OSTC-DRL) approach for inverter-based volt-var control (IB-VVC) in active distribution networks is proposed in this paper. Firstly, considering IB-VVC can be formulated as a single-period optimization problem, we formulate the IB-VVC as a one-step Markov decision process rather than the standard Markov decision process, which simplifies the DRL learning task. Then we design the one-step actor-critic DRL scheme which is a simplified version of recent DRL algorithms, and it avoids the issue of Q value overestimation successfully. Furthermore, considering two objectives of VVC: minimizing power loss and eliminating voltage violation, we utilize two critics to approximate the rewards of two objectives separately. It simplifies the approximation tasks of each critic, and avoids the interaction effect between two objectives in the learning process of critic. The OSTC-DRL approach integrates the one-step actor-critic DRL scheme and the two-critic technology. Based on the OSTC-DRL, we design two centralized DRL algorithms. Further, we extend the OSTC-DRL to multi-agent OSTC-DRL for decentralized IB-VVC and design two multi-agent DRL algorithms. Simulations demonstrate that the proposed OSTC-DRL has a faster convergence rate and a better control performance, and the multi-agent OSTC-DRL works well for decentralized IB-VVC problems.

We consider the problem of how multiple areas should jointly cover congestion rents of internal and tie-lines in an interconnected power system. A key issue of our concern is the loop flow problem, which represents discrepancies between scheduled and actual power flow distributions because electric power does not always flow along the most direct paths of transactions. We employ generalized coordinated transaction scheduling (GCTS) for interchange scheduling, which can eliminate dispatch errors caused by loop flow effects and asymptotically converge to the joint economic dispatch (JED) under ideal assumptions. Subsequently, distributed algorithms are proposed for each area to recover multipliers of the global GCTS model, as well as quantifying and pricing its contribution to line congestions. Thereby, all areas and interface bids can jointly cover congestion rents of internal and tie-lines with their merchandise surpluses and profits. Simulations demonstrate the effectiveness of the proposed approach of LMP recovery and joint covering congestion rents.

The concept of low-carbon building is proposed to ameliorate the climate change caused by environmental problems and realize carbon neutrality at the building level in urban areas. In addition, renewable energy curtailment in the power distribution system, as well as low efficiency due to independent operation of traditional energy systems, has been addressed by the application of integrated energy system (IES) to some extent. In this paper, we propose a planning method for low-carbon building-level IES, in which electric vehicles (EV) and the mode of Vehicle to Grid (V2G) are considered and further increase the flexibility of low-carbon buildings. The proposed planning model optimize the investment, operation costs and CO2 emission for building-level IES, so as to achieve the maximum benefit of the construction of the low-carbon building and help the realization of carbon neutrality. Moreover, we consider the uncertainty of distributed renewable energy, multi-energy load fluctuation and the random behavior of EV users, then formulating a two-stage stochastic programming model with chance constraints, in which heuristic moment matching scenario generation (HMMSG) and sample average approximation (SAA) method are applied. In case study, a real IES commercial building in Shanghai, where photovoltaic (PV), energy storage system (ESS), fuel cell (FC), EV, etc. are included as planning options, is used as numerical example to verify the effectiveness of the proposed planning method, with functions of ESS and EV in IES are analyzed in detail in different operation scenarios.