arXiv subjects

Hongbin Sun

Publications and source records attributed to Hongbin Sun.

At least 109 records · Page 6Linked to original sources

arXiv2020

Increasing the Flexibility of Combined Heat and Power Systems through Optimal Dispatch with Variable Mass Flow

In combined heat and power systems, varying mass flow can better make use of the heating system inertia to increase the flexibility of electric power systems. This is challenging, however, due to integer variables and bilinear constraints in existing optimal dispatch models. In this paper, we incorporate an improved heat pipeline model to eliminate complexity from integer variables without compromise on accuracy. Subsequently, the resulting optimal dispatch model with bilinear constraints is solved by the proposed modified Generalized Benders Decomposition method, which decomposes the optimal dispatch model into a convex sub-problem with the fixed mass flow and a simple upper-level problem searching for the optimal mass flow. Comparisons with existing benchmarks show that the proposed method can achieve lower operation costs with outstanding computational efficiency.

eess.SY↗

arXiv2020

Optimal Planning of Integrated Heat and Electricity Systems: a Tightening McCormick Approach

In this paper, we propose a convex planning model of integrated heat and electricity systems considering variable mass flow rates. The main challenge comes from the non-convexity of the bilinear terms in the district heating network, i.e., the product of mass flow rate and nodal temperature. To resolve this issue, we first reformulate the district heating network model through equivalent transformation and variable substitution. It shows that the reformulated model has only one set of nonconvex constraints with reduced bilinear terms and the others are linear constraints. Such a reformulation not only guarantees the optimality but fastens the solving process. To relax the remaining bilinear constraints, we apply McCormick envelopes and further propose a heuristic tightening method to constrict the bounds of the McCormick approach and get a nearby feasible solution. Case studies show that the tightening McCormick method quickly solves the heat-electricity planning problem with acceptable feasibility check and optimality.

math.OC↗

arXiv2020

Community Energy Storage Management for Welfare Optimization Using a Markov Decision Process

In this paper, we address an optimal management problem of community energy storage in the real-time electricity market under a stochastic renewable environment. In a real-time electricity market, complete market information may not be assessable for a strategic participant, hence we propose a paradigm that uses partial information including the forecast of real-time prices and slopes of the aggregate supply curve to model the price impact of storage use in the price-maker storage management problem. As a price maker, the community energy storage can not only earn profits through energy arbitrage but also smooth price trajectories and further influence social welfare. We formulate the problem as a finite-horizon Markov decision process that aims to maximize the energy arbitrage and social welfare of the prosumer-based community. The advance of the management scheme is that the optimal policy has a threshold structure. The structure has an analytic form that can guide the energy storage to charge/discharge by comparing its current marginal value and the expected future marginal value. Case studies indicate that welfare-maximizing storage earns more benefits than profit-maximizing storage. The proposed threshold-based algorithm can guarantee optimality and largely decrease the computational complexity of standard stochastic dynamic programming.

eess.SY↗

arXiv2020

A Linear Branch Flow Model for Radial Distribution Networks and its Application to Reactive Power Optimization and Network Reconfiguration

This paper presents a cold-start linear branch flow model named modified DistFlow. In modified DistFlow, the active and reactive power are replaced by their ratios to voltage magnitude as state variables, so that errors introduced by conventional branch flow linearization approaches due to their complete ignoring of the quadratic term are reduced. Based on the path-branch incidence matrix, branch power flows and nodal voltage magnitudes can be obtained in a non-iterative and explicit manner. Subsequently, the proposed modified DistFlow model is applied to the problem of reactive power optimization and network reconfiguration, transforming it into a mixed-integer quadratic programming (MIQP). Simulations show that the proposed modified DistFlow has a better accuracy than existing cold-start linear branch flow models for distribution networks, and the resulting MIQP model for reactive power optimization and network reconfiguration is much more computationally efficient than existing benchmarks.

eess.SY↗

arXiv2020

A Scenario-oriented Approach for Energy-Reserve Joint Procurement and Pricing

We propose a scenario-oriented approach for energy-reserve joint procurement and pricing for electricity market. In this model, without the empirical reserve requirements, reserve is procured according to all possible contingencies and load/renewable generation fluctuations with the minimum expected system total cost. The innovative locational marginal pricing approach for loads, generations and reserve and the associated settlement process are proposed. We show that payments from loads, payments to generators and congestion rent will reach their balance in the basecase as well as in all scenarios, so that revenue adequacy can be guaranteed for the system operator.

eess.SY↗

arXiv2020

ADCPNet: Adaptive Disparity Candidates Prediction Network for Efficient Real-Time Stereo Matching

Efficient real-time disparity estimation is critical for the application of stereo vision systems in various areas. Recently, stereo network based on coarse-to-fine method has largely relieved the memory constraints and speed limitations of large-scale network models. Nevertheless, all of the previous coarse-to-fine designs employ constant offsets and three or more stages to progressively refine the coarse disparity map, still resulting in unsatisfactory computation accuracy and inference time when deployed on mobile devices. This paper claims that the coarse matching errors can be corrected efficiently with fewer stages as long as more accurate disparity candidates can be provided. Therefore, we propose a dynamic offset prediction module to meet different correction requirements of diverse objects and design an efficient two-stage framework. Besides, we propose a disparity-independent convolution to further improve the performance since it is more consistent with the local statistical characteristics of the compact cost volume. The evaluation results on multiple datasets and platforms clearly demonstrate that, the proposed network outperforms the state-of-the-art lightweight models especially for mobile devices in terms of accuracy and speed. Code will be made available.

cs.CV↗

arXiv2020

The panted cobordism group of cusped hyperbolic 3-manifolds

For any oriented cusped hyperbolic $3$-manifold $M$, we study its $(R,ε)$-panted cobordism group, which is the abelian group generated by $(R,ε)$-good curves in $M$ modulo the oriented boundaries of $(R,ε)$-good pants. In particular, we prove that for sufficiently small $ε>0$ and sufficiently large $R>0$, some modified version of the $(R,ε)$-panted cobordism group of $M$ is isomorphic to $H_1(\text{SO}(M);\mathbb{Z})$.

math.GT↗

arXiv2020

A Quadratic Convex Approximation of Optimal Power Flow in Distribution System with Application in Loss Allocation

In this paper, a novel quadratic convex optimal power flow model, namely, MDOPF, is proposed to determine the optimal dispatches of distributed generators. Based on the results of MDOPF, two price mechanisms, distribution locational marginal price (DLMP) and distribution locational price (DLP), are analyzed. For DLMP, an explicit method is developed to calculate the marginal loss that does not require a backward/forward sweep algorithm and thus reduces the computational complexity. However, the marginal loss component in DLMP will cause over-collection of losses (OCL). To address this issue, DLP is defined, which contains two components, the energy cost component and loss component, where the loss component is determined by the proposed loss allocation method (LAM). Numerical tests show that the proposed MDOPF has a better accuracy than existing OPF models based on linear power flow equations. In addition, the proposed marginal loss method and DLMP algorithm have satisfactory accuracy compared with benchmarks provided by ACOPF, and the proposed DLP can eliminate OCL.

eess.SY↗

arXiv2020

RobustScanner: Dynamically Enhancing Positional Clues for Robust Text Recognition

The attention-based encoder-decoder framework has recently achieved impressive results for scene text recognition, and many variants have emerged with improvements in recognition quality. However, it performs poorly on contextless texts (e.g., random character sequences) which is unacceptable in most of real application scenarios. In this paper, we first deeply investigate the decoding process of the decoder. We empirically find that a representative character-level sequence decoder utilizes not only context information but also positional information. Contextual information, which the existing approaches heavily rely on, causes the problem of attention drift. To suppress such side-effect, we propose a novel position enhancement branch, and dynamically fuse its outputs with those of the decoder attention module for scene text recognition. Specifically, it contains a position aware module to enable the encoder to output feature vectors encoding their own spatial positions, and an attention module to estimate glimpses using the positional clue (i.e., the current decoding time step) only. The dynamic fusion is conducted for more robust feature via an element-wise gate mechanism. Theoretically, our proposed method, dubbed \emph{RobustScanner}, decodes individual characters with dynamic ratio between context and positional clues, and utilizes more positional ones when the decoding sequences with scarce context, and thus is robust and practical. Empirically, it has achieved new state-of-the-art results on popular regular and irregular text recognition benchmarks while without much performance drop on contextless benchmarks, validating its robustness in both contextual and contextless application scenarios.

cs.CV↗

arXiv2020

Stochastic Unit Commitment in Electricity-Gas Coupled Integrated Energy Systems based on Modified Progressive Hedging

The increasing number of gas-fired units has significantly intensified the coupling between power and gas networks. Traditionally, the nonlinearity and nonconvexity in gas flow equations, together with renewable-induced stochasticity, result in a computationally expensive model for unit commitment in electricity-gas coupled integrated energy systems (IES). To accelerate stochastic day-ahead scheduling, we applied and modified Progressive Hedging (PH), a heuristic approach that can be computed in parallel to yield scenario-independent unit commitment. By applying a termination and enumeration technique, the modified PH algorithm saves considerable computational time, especially when the unit production prices are similar for all generators, and when the scale of IES is large. Moreover, an adapted second-order cone relaxation (SOCR) is utilized to tackle the nonconvex gas flow equation. Case studies are performed on the IEEE 24-bus system/Belgium 20-node gas system and the IEEE 118-bus system/Belgium 20-node gas system. The computational efficiency when employing PH is 188 times that of commercial software, even outperforming Benders Decomposition. Meanwhile, the gap between the PH algorithm and the benchmark is less than 0.01% in both IES systems, which proves that the solution produced by PH reaches acceptable optimality in this stochastic UC problem.

eess.SY↗

arXiv2020

Reconfiguration of District Heating Network for Operational Flexibility Enhancement in Power System Unit Commitment

Massive adoptions of combined heat and power (CHP) units necessitate the coordinated operation of power system and district heating system (DHS). Exploiting the reconfigurable property of district heating networks (DHNs) provides a cost-effective solution to enhance the flexibility of the power system by redistributing heat loads in DHS. In this paper, a unit commitment considering combined electricity and reconfigurable heating network (UC-CERHN) is proposed to coordinate the day-ahead scheduling of power system and DHS. The DHS is formulated as a nonlinear and mixed-integer model with considering the reconfigurable DHN. Also, an auxiliary energy flow variable is introduced in the formed DHS model to make the commitment problem tractable, where the computational burdens are significantly reduced. Extensive case studies are presented to validate the effectiveness of the approximated model and illustrate the potential benefits of the proposed method with respect to congestion management and wind power accommodation. (Corresponding author:Hongbin Sun)

eess.SY↗

arXiv2020

Subgroup distortion of 3-manifold groups

In this paper, we compute the subgroup distortion of all finitely generated subgroups of all finitely generated 3-manifold groups, and the subgroup distortion in this case can only be linear, quadratic, exponential and double exponential. It turns out that the subgroup distortion of a subgroup of a 3-manifold group is closely related to the separability of this subgroup.

math.GR↗

arXiv2019

Distributed Optimal Frequency Control for Integrated Energy Systems with Electricity and Heat

With more and more distributed energy resources (DERs) deployed in Integrated Energy Systems (IESs), frequency stability challenges the pursuit of reliability and efficiency. This paper proposes a fully-distributed frequency control method for load-side DERs, in which the optimality can be guaranteed in an IES where electricity and heat are coupled. Moreover, the global asymptotic stability of the closed-loop system is proved and the robustness with respect to inaccurate coefficients is shown. Case studies demonstrate the effectiveness of proposed method.

eess.SY↗

arXiv2019

Learnable Tree Filter for Structure-preserving Feature Transform

Learning discriminative global features plays a vital role in semantic segmentation. And most of the existing methods adopt stacks of local convolutions or non-local blocks to capture long-range context. However, due to the absence of spatial structure preservation, these operators ignore the object details when enlarging receptive fields. In this paper, we propose the learnable tree filter to form a generic tree filtering module that leverages the structural property of minimal spanning tree to model long-range dependencies while preserving the details. Furthermore, we propose a highly efficient linear-time algorithm to reduce resource consumption. Thus, the designed modules can be plugged into existing deep neural networks conveniently. To this end, tree filtering modules are embedded to formulate a unified framework for semantic segmentation. We conduct extensive ablation studies to elaborate on the effectiveness and efficiency of the proposed method. Specifically, it attains better performance with much less overhead compared with the classic PSP block and Non-local operation under the same backbone. Our approach is proved to achieve consistent improvements on several benchmarks without bells-and-whistles. Code and models are available at https://github.com/StevenGrove/TreeFilter-Torch.

cs.CV↗

arXiv2019

Geometry Normalization Networks for Accurate Scene Text Detection

Large geometry (e.g., orientation) variances are the key challenges in the scene text detection. In this work, we first conduct experiments to investigate the capacity of networks for learning geometry variances on detecting scene texts, and find that networks can handle only limited text geometry variances. Then, we put forward a novel Geometry Normalization Module (GNM) with multiple branches, each of which is composed of one Scale Normalization Unit and one Orientation Normalization Unit, to normalize each text instance to one desired canonical geometry range through at least one branch. The GNM is general and readily plugged into existing convolutional neural network based text detectors to construct end-to-end Geometry Normalization Networks (GNNets). Moreover, we propose a geometry-aware training scheme to effectively train the GNNets by sampling and augmenting text instances from a uniform geometry variance distribution. Finally, experiments on popular benchmarks of ICDAR 2015 and ICDAR 2017 MLT validate that our method outperforms all the state-of-the-art approaches remarkably by obtaining one-forward test F-scores of 88.52 and 74.54 respectively.

cs.CV↗

arXiv2019

SCAN: Self-and-Collaborative Attention Network for Video Person Re-identification

Video person re-identification attracts much attention in recent years. It aims to match image sequences of pedestrians from different camera views. Previous approaches usually improve this task from three aspects, including a) selecting more discriminative frames, b) generating more informative temporal representations, and c) developing more effective distance metrics. To address the above issues, we present a novel and practical deep architecture for video person re-identification termed Self-and-Collaborative Attention Network (SCAN). It has several appealing properties. First, SCAN adopts non-parametric attention mechanism to refine the intra-sequence and inter-sequence feature representation of videos, and outputs self-and-collaborative feature representation for each video, making the discriminative frames aligned between the probe and gallery sequences.Second, beyond existing models, a generalized pairwise similarity measurement is proposed to calculate the similarity feature representations of video pairs, enabling computing the matching scores by the binary classifier. Third, a dense clip segmentation strategy is also introduced to generate rich probe-gallery pairs to optimize the model. Extensive experiments demonstrate the effectiveness of SCAN, which outperforms the best-performing baselines on iLIDS-VID, PRID2011 and MARS dataset, respectively.

cs.CV↗

arXiv2019

An effective Lie--Kolchin theorem for quasi-unipotent matrices

We establish an effective version of the classical Lie--Kolchin Theorem. Namely, let $A,B\in\mathrm{GL}_m(\mathbb{C})$ be quasi--unipotent matrices such that the Jordan Canonical Form of $B$ consists of a single block, and suppose that for all $k\geq0$ the matrix $AB^k$ is also quasi--unipotent. Then $A$ and $B$ have a common eigenvector. In particular, $\langle A,B\rangle<\mathrm{GL}_m(\mathbb{C})$ is a solvable subgroup. We give applications of this result to the representation theory of mapping class groups of orientable surfaces.

math.GR↗

arXiv2019

TACNet: Transition-Aware Context Network for Spatio-Temporal Action Detection

Current state-of-the-art approaches for spatio-temporal action detection have achieved impressive results but remain unsatisfactory for temporal extent detection. The main reason comes from that, there are some ambiguous states similar to the real actions which may be treated as target actions even by a well-trained network. In this paper, we define these ambiguous samples as "transitional states", and propose a Transition-Aware Context Network (TACNet) to distinguish transitional states. The proposed TACNet includes two main components, i.e., temporal context detector and transition-aware classifier. The temporal context detector can extract long-term context information with constant time complexity by constructing a recurrent network. The transition-aware classifier can further distinguish transitional states by classifying action and transitional states simultaneously. Therefore, the proposed TACNet can substantially improve the performance of spatio-temporal action detection. We extensively evaluate the proposed TACNet on UCF101-24 and J-HMDB datasets. The experimental results demonstrate that TACNet obtains competitive performance on JHMDB and significantly outperforms the state-of-the-art methods on the untrimmed UCF101-24 in terms of both frame-mAP and video-mAP.

cs.CV↗