arXiv subjects

Chen Yuan

Publications and source records attributed to Chen Yuan.

83 records · Page 5Linked to original sources

arXiv2018

Exploration of Graph Computing in Power System State Estimation

With the increased complexity of power systems due to the integration of smart grid technologies and renewable energy resources, more frequent changes have been introduced to system status, and the traditional serial mode of state estimation algorithm cannot well meet the restrict time-constrained requirement for the future dynamic power grid, even with advanced computer hardware. To guarantee the grid reliability and minimize the impacts caused by system status fluctuations, a fast, even SCADA-rate, state estimator is urgently needed. In this paper, a graph based power system modeling is firstly explored and a graph computing based state estimation is proposed to speed up its performance. The power system is represented by a graph, which is a collection of vertices and edges, and the measurements are attributes of vertices and edges. Each vertex can independently implement local computation, like formulations of the node-based H matrix, gain matrix and righthand-side (RHS) vector, only with the information on its connected edges and neighboring vertices. Then, by taking advantages of graph database, these node-based data are conveniently collected and stored in the compressed sparse row (CSR) format avoiding the complexity and heaviness introduced by the sparse matrices. With communications and synchronization, centralized computation of solving the weighted least square (WLS) state estimation is completed with hierarchical parallel computing. The proposed strategy is implemented on a graph database platform. The testing results of IEEE 14-bus, IEEE 118-bus systems and a provincial system in China verify the accuracy and high-performance of the proposed methodology.

eess.SY↗

arXiv2018

Optimal locally repairable codes of distance $3$ and $4$ via cyclic codes

Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code {\it optimal} if it achieves the Singleton-type bound). In the breakthrough work of \cite{TB14}, several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in \cite{TB14} are upper bounded by the code alphabet size $q$. Recently, it was proved through extension of construction in \cite{TB14} that length of $q$-ary optimal locally repairable codes can be $q+1$ in \cite{JMX17}. Surprisingly, \cite{BHHMV16} presented a few examples of $q$-ary optimal locally repairable codes of small distance and locality with code length achieving roughly $q^2$. Very recently, it was further shown in \cite{LMX17} that there exist $q$-ary optimal locally repairable codes with length bigger than $q+1$ and distance propositional to $n$. Thus, it becomes an interesting and challenging problem to construct new families of $q$-ary optimal locally repairable codes of length bigger than $q+1$. In this paper, we construct a class of optimal locally repairable codes of distance $3$ and $4$ with unbounded length (i.e., length of the codes is independent of the code alphabet size). Our technique is through cyclic codes with particular generator and parity-check polynomials that are carefully chosen.

cs.IT↗

arXiv2017

Economic Power Capacity Design of Distributed Energy Resources for Reliable Community Microgrids

Community microgrids are developed within existing power systems by integrating local distributed energy resources (DERs). So power distribution systems can be seamlessly partitioned into community microgrids and end-users could be largely supported when an extreme event happens. However, because of DERs low inertia, their power capacity should be well designed to cover unexpected events and guarantee system reliability. This paper presents a quantitative and qualitative combined methodology for DERs selection, and an economic approach to meet the system reliability requirements. Discrete time Fourier transform (DTFT) and particle swarm optimization (PSO) are employed to obtain the optimal solution, with consideration of load demand and renewable generation uncertainties. In addition, a sensitivity analysis is conducted to show how DERs' capacity design is impacted by counted portion of the forecasted renewable generation.

math.OC↗

arXiv2017

Economic Sizing of Distributed Energy Resources for Reliable Community Microgrids

Community microgrids offer many advantages for power distribution systems. When there is an extreme event happening, distribution systems can be seamlessly partitioned into several community microgrids for uninterrupted supply to the end-users. In order to guarantee the system reliability, distributed energy resources (DERs) should be sized for ensuring generation adequacy to cover unexpected events. This paper presents a comprehensive methodology for DERs selection in community microgrids, and an economic approach to meet the system reliability requirements. Algorithms of discrete time Fourier transform (DTFT) and particle swarm optimization (PSO) are employed to find the optimal solution. Uncertainties of load demand and renewable generation are taken into consideration. As part of the case study, a sensitivity analysis is carried out to show the renewable generation impact on DERs' capacity planning.

math.OC↗

arXiv2017

Modified Viterbi Algorithm Based Distribution System Restoration Strategy for Grid Resiliency

This paper presents a novel modified Viterbi algorithm to identify the optimal distribution system restoration plan for improving the grid resiliency. In the proposed algorithm, the switching operations performed for system restoration are the states with the minimum bus voltage being seen as the cost metric for each state and the extent of load recovery as the observed event. When full load recovery is spotted, the dynamic programming algorithm stops, thereby giving the least number of switching pairs necessary for system restoration. Moreover, an improved flexible switching pair operation is employed to maintain the radial nature of distribution system. Several case studies are presented for verifying the performance of the proposed strategy. Multi-fault conditions are considered in testing the system restoration scheme on 33-bus and 69-bus distribution systems. Furthermore, the effects of integrating distributed energy resources and microgrid systems are analyzed.

math.OC↗

arXiv2017

Co-Optimization Scheme for Distributed Energy Resource Planning in Community Microgrids

Microgrids with distributed energy resources are being favored in various communities to lower the dependence on utility-supplied energy and cut the CO2 emissions from coal-based power plants. This paper presents a co-optimization strategy for distributed energy resource planning to minimize total annualized cost at the maximal fuel savings. Furthermore, the proposed scheme aids the community microgrids in satisfying the requirements of U.S. Department of Energy (DOE) and state renewable energy mandates. The method of Lagrange multipliers is employed to maximize fuel savings by satisfying Karush-Kuhn-Tucker conditions. With the Fourier transform and particle swarm optimization, the right mix of distributed energy resources is determined to decrease the annualized cost. A case study to test the proposed scheme for a community microgrid is presented. To validate its effectiveness, an economic justification of the solution and its comparison with HOMER Pro are also illustrated.

math.OC↗

arXiv2017

Subspace Designs based on Algebraic Function Fields

Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more precisely, the sum of dimensions of $W \cap H_i$ is at most some parameter $L$. The notion was put forth by Guruswami and Xing (STOC'13) with applications to list decoding variants of Reed-Solomon and algebraic-geometric codes, and later also used for explicit rank-metric codes with optimal list decoding radius. Guruswami and Kopparty (FOCS'13, Combinatorica'16) gave an explicit construction of subspace designs with near-optimal parameters. This construction was based on polynomials and has close connections to folded Reed-Solomon codes, and required large field size (specifically $q \ge m$). Forbes and Guruswami (RANDOM'15) used this construction to give explicit constant degree "dimension expanders" over large fields, and noted that subspace designs are a powerful tool in linear-algebraic pseudorandomness. Here, we construct subspace designs over any field, at the expense of a modest worsening of the bound $L$ on total intersection dimension. Our approach is based on a (non-trivial) extension of the polynomial-based construction to algebraic function fields, and instantiating the approach with cyclotomic function fields. Plugging in our new subspace designs in the construction of Forbes and Guruswami yields dimension expanders over $\F^n$ for any field $\F$, with logarithmic degree and expansion guarantee for subspaces of dimension $Ω(n/(\log \log n))$.

cs.CC↗

arXiv2015

Multipartite entangled states, symmetric matrices and error-correcting codes

A pure quantum state is called $k$-uniform if all its reductions to $k$-qudit are maximally mixed. We investigate the general constructions of $k$-uniform pure quantum states of $n$ subsystems with $d$ levels. We provide one construction via symmetric matrices and the second one through classical error-correcting codes. There are three main results arising from our constructions. Firstly, we show that for any given even $n\ge 2$, there always exists an $n/2$-uniform $n$-qudit quantum state of level $p$ for sufficiently large prime $p$. Secondly, both constructions show that their exist $k$-uniform $n$-qudit pure quantum states such that $k$ is proportional to $n$, i.e., $k=Ω(n)$ although the construction from symmetric matrices outperforms the one by error-correcting codes. Thirdly, our symmetric matrix construction provides a positive answer to the open question in \cite{DA} on whether there exists $3$-uniform $n$-qudit pure quantum state for all $n\ge 8$. In fact, we can further prove that, for every $k$, there exists a constant $M_k$ such that there exists a $k$-uniform $n$-qudit quantum state for all $n\ge M_k$. In addition, by using concatenation of algebraic geometry codes, we give an explicit construction of $k$-uniform quantum state when $k$ tends to infinity.

cs.IT↗

arXiv2015

A new class of rank-metric codes and their list decoding beyond the unique decoding radius

Compared with classical block codes, efficient list decoding of rank-metric codes seems more difficult. Although the list decodability of random rank-metric codes and limits to list decodability have been completely determined, little work on efficient list decoding rank-metric codes has been done. The only known efficient list decoding of rank-metric codes $\mC$ gives decoding radius up to the Singleton bound $1-R-\Ge$ with positive rate $R$ when $ρ(\mC)$ is extremely small, i.e., $Θ(\Ge^2)$ , where $ρ(\mC)$ denotes the ratio of the number of rows over the number of columns of $\mC$ \cite[STOC2013]{Guru2013}. It is commonly believed that list decoding of rank-metric codes $\mC$ with not small constant ratio $ρ(\mC)$ is hard. The main purpose of the present paper is to explicitly construct a class of rank-metric codes $\mC$ with not small constant ratio $ρ(\mC)$ and efficiently list decode these codes with decoding radius beyond $(1-R)/2$. Our key idea is to employ two-variable polynomials $f(x,y)$, where $f$ is linearized in variable $x$ and the variable $y$ is used to "fold" the code. In other words, rows are used to correct rank errors and columns are used to "fold" the code to enlarge decoding radius. Apart from the above algebraic technique, we have to prune down the list. The algebraic idea enables us to pin down the messages into a structured subspace of dimension linear in the number $n$ of columns. This "periodic" structure allows us to pre-encoding the messages to prune down the list. More precisely, we use subspace design introduced in \cite[STOC2013]{Guru2013} to get a deterministic algorithm with a larger constant list size and employ hierarchical subspace-evasive sets introduced in \cite[STOC2012]{Guru2012} to obtain a randomized algorithm with a smaller constant list size.

cs.IT↗

arXiv2013

Physical and Structural Design of Fast Extraction Kickers for CSNS/RCS

China Spallation Neutron Source (CSNS) is a high intensity beam facility being built now in China. Three kicker assemblies, eight pulsed magnets, will be used in the CSNS rapid circle synchrotron (RCS). The physical and structural designs of eight kicker magnets that are grouped in 5 different types are presented. The results of OPERA-3D simulation show that magnet center field integral meet the physics requirements of design by choosing a suitable magnet coil structure. Field uniformity for 60% width is +/-0.7%. The ferrite magnet structure and composition is introduced, and the high voltage feedthrough design, the installation of six magnets in long vacuum cavity design is discussed.

physics.acc-ph↗

arXiv2012

Computing on Binary Strings

Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of binary strings and several operations like conjunction and disjunction, which new binary strings can be generated? Although it is a fundamental problem, to the best of our knowledge, the problem hasn't been studied yet. In this paper, an O(m^2n) algorithm is presented to determine whether a string s is representable by a set W, where n is the number of strings in W and each string has the same length m. However, looking for the minimum subset from a set to represent a given string is shown to be NP-hard. Also, finding the smallest subset from a set to represent each string in the original set is NP-hard. We establishes inapproximability results and approximation algorithms for them. In addition, we prove that counting the number of strings representable is #P-complete. We then explore how the problems change when the operator negation is available. For example, if the operator negation can be used, the number is some power of 2. This difference maybe help us understand the problem more profoundly.

cs.DS↗