检索结果-内蒙古大学图书馆

Research on Distribution Network Fault Location Based on Electric Field Coupling Voltage Sensing and Multi-Source Information Fusion

引用

ENERGIES 2025年第4期18卷 913-913页

作者： Li, Bo Tang, Lijun Gu, Zhiming Liu, Li Wu, Zhensheng Elect Power Sci Res Inst Yunnan Power Grid Co Ltd Kunming 650217 Peoples R China Beijing Jiaotong Univ Sch Elect Engn Beijing 100044 Peoples R China

As the last link of power transmission, the safe operation of the distribution network directly affects the experience of power users, and short-time distribution network faults can cause huge economic losses. There are few fault recording devices in rural or suburban distribution networks, and it is difficult to upload information, which brings difficulties to accurate fault location. In order to improve the accuracy of fault location, this study proposes a fault location method for distribution networks based on electric field-coupled voltage sensing and multi-source information fusion. First, an optimized resource pool architecture is proposed, and a distribution network data fusion platform is established based on this architecture to effectively integrate voltage, current and other fault data. Second, in order to overcome the problem of expanding the fault location range that may be caused by the current-based matrix algorithm, this study proposes an improved directed graph-based matrix algorithm and combines it with the matrix algorithm of voltage quantities to form a joint location criterion, which improves the accuracy of fault location. Finally, for the single-ended ranging method, which is easily affected by the wave impedance discontinuity points in the system or the transition resistance in the line, this article introduces a fault ranging algorithm based on double-ended electrical quantities, which improves the accuracy and applicable range of fault ranging. Through simulation verification, we found that the matrix algorithm based on the electrical quantity can accurately locate the fault section in the case of a single fault with a single power supply. The proposed joint matrix algorithm can accurately locate the fault section in the case of a single fault with multiple power sources. The ranging algorithm based on double-ended electrical quantities has higher ranging accuracy in both interphase short circuits and grounded short circuits, and the rangi

关键词： fault location fault ranging matrix algorithm double-end ranging data fusion

来源：评论

学校读者我要写书评

暂无评论

matrix algorithms for dynamic gain-spectrum adjustment of backward-pumped distributed fiber Raman amplifier

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2006年第3期24卷 1581-1588页

作者： Zhang, W Xiao, L Peng, JD Tsing Hua Univ Dept Elect Engn Beijing 100084 Peoples R China

Two matrix algorithms aiming at a dynamic gain-spectrum adjustment in a backward-pumped distributed fiber Raman amplifier (B-DFRA) are developed based on the relation between changes in the pump power and the gain spectrum. Characteristic channels are chosen to reduce the dimension of matrices in the algorithm, which can be implemented by built-in microprocessors or DSP chips inside the B-DFRA module. Furthermore, as shown by the theoretical analysis and the numerical simulation, elements in the matrices can be directly and easily measured in deployed fiber plants without information on fiber parameters. These matrix algorithms are capable of adjusting the gain spectrum to fit the arbitrary profile desired in reality, while a wide dynamic range can be achieved by a multistage adjustment using matrices measured under several gain levels.

关键词： dynamic gain adjustment dynamic range fiber Raman amplifiers gain spectrum matrix algorithm optical amplifiers optical communication optical fiber amplifiers

来源：评论

学校读者我要写书评

暂无评论

A matrix-based fault section estimation algorithm for complex distribution systems

A matrix-based fault section estimation algorithm for comple...

引用

42nd International Universities Power Engineering Conference

作者： Mei, Nian Shi, Dongyuan Yang, Zengli Duan, Xianzhong Huazhong Univ Sci & Technol Coll Elect & Elect Engn Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9781905593361

This paper proposes an application of matrix algorithm to fault section estimation in complex distribution systems based on directed over-current information recorded by FTU (Feeder Terminal Unit). First, a concise unified criterion for fault location in multi-source distribution networks is put forward, which can locate both the multiple faults and the end faults. Considering the communication problems which result in incomplete or distorted FTU over-current information, solutions are given for both situations. When the FTU information is incomplete, the fault section estimation process can be carried on as normal with ignorance of the node whose information is unknown. When the fault information suffers from aberrance, fault section candidates are located first based on the unified criterion tinder no information aberrance. Then the final fault area is selected in terms of the fault information sequence revision cost defined in the paper. The case studies show that the approaches proposed are both correct and feasible, which can effectively resolve the fault location issues in the case of being lack of information or suffering from information aberrance, thus with great potential for application in real-time distribution network fault section estimation programs.

关键词： distribution system matrix algorithm feeder terminal unit fault section estimation

来源：评论

学校读者我要写书评

暂无评论

Design and matrix analysis of optical switch with multicast function using general MZI

引用

OPTIK 2017年 138卷 166-174页

作者： Yang, Liu Luo, Fengguang Huazhong Univ Sci & Technol Sch Opt & Elect Informat Natl Engn Lab Next Generat Internet Access Syst Wuhan 430074 Peoples R China

Based on the analysis of the LiNbO3 Mach-Zehnder interferometer (MZI), a MZI with three optical switch functions (direct connection, cross connection and multicast connection) is demonstrated in this paper. With this MZI, a 4 x 4 optical switch is then proposed. The optical switch not only switches optical signal from one channel to another (1:1), but also from one channel to several channels (1: k) with non-blocking and duplex communication. Later, a matrix analysis on the optical switch proposed is given. In the end of this paper, an example of the transmission path and the controlling state of the optical switch is demonstrated. (C) 2017 Elsevier GmbH. All rights reserved.

关键词： Optical switch Mach-Zehnder interferometer Waveguide modulators matrix algorithm Multicast switch

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithms for the Problem of Integer Balancing of a Three-Dimensional matrix with Constraints of the Second Type

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2015年第7期49卷 473-483页

作者： Smirnov, A. V. Demidov Yaroslavl State Univ Ul Sovetskaya 14 Yaroslavl 150000 Russia

The problem of integer balancing of a three-dimensional matrix with constraints of the second type is studied. The elements of the inner part (all three indices are greater than zero) of the three-dimensional matrix are summed in each direction and each section of the matrix;the total sum is also found. These sums are placed into the elements where one or more indices are equal to zero (according to the summing directions). The problem is to find an integer matrix of the same structure, which can be produced from the initial one by replacing the elements of the inner part with the largest previous or the smallest following integer. At the same time, variations of the sums of elements from those in the initial matrix should be less than 2 and an element with three zero indices should be produced with standard rounding-off rules. Heuristic algorithms for this problem are suggested: layering algorithm obtained as a generalization of a similar algorithm for the problem with constraints of the first type and a new matrix algorithm. The latter consists of three parts: search for the basic matrix, search for the maximum matrix, and matrix correction. Each of them is a cyclic change of the integer matrix using from one to three elements from the inner part. A modification of the matrix algorithm is suggested. The algorithm is directed to more uniform filling of the inner part of the integer matrix. Also, the complexity of all three algorithms is estimated. The comparative analysis of matrix algorithms based on the results of computing experiments is adduced.

关键词： integer balancing three-dimensional matrices constraints of the second type multiple networks multiple flows generalized labeling algorithm layering algorithm matrix algorithm

来源：评论

学校读者我要写书评

暂无评论

Association mining algorithm based on matrix

引用

Jisuanji Gongcheng/Computer Engineering 2006年第2期32卷 45-47页

作者： Zeng, Wandan Zhou, Xubo Dai, Bo Chang, Guiran Li, Chunping School of Information Science and Engineering Northeastern Univ. Shenyang 110004 China School of Software Tsinghua Univ. Beijing 100084 China

Apriori algorithm can find out the associations of the data by finding the frequent itemsets by degrees. But it has the performance bottleneck when searching for the high level frequent itemsets. A new algorithm that can directly find the high level frequent itemsets is proposed in this paper. This algorithm can effectively resolve the bottleneck of Apriori. The result of the experiment shows that this algorithm can achieve better performance than Apriori and is more feasible especially when the degree of the frequent itemset is high.

关键词： Apriori algorithm Association mining Frequent itemset matrix algorithm

来源：评论

学校读者我要写书评

暂无评论

Microgrid protection based on principle of fault location

引用

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2016年第1期11卷 30-35页

作者： Mu, Longhua Han, Haijuan Jiang, Bin Guo, Wenming Tongji Univ Dept Elect Engn 4800 CaoAn Rd Shanghai 201804 Peoples R China

Island-capable microgrids can potentially enhance the efficiency of distributed generations. In general, protection schemes in traditional distribution network cannot meet the requirements of microgrid internal protection. In order to solve the problem, this paper proposes the positive-sequence fault component of current as the starting criterion. And a graph model describing the overall structure of a microgrid is established. The information about fault currents, including amplitude and direction, is acquired to locate fault branch. Furthermore, a new matrix algorithm is used to locate the fault point, so that the fault can be isolated. Finally, a microgrid model is simulated in the PSCAD/EMTDC software environment to illustrate the validity of fault location principle in microgrid protection. (c) 2015 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

关键词： microgrid protection fault location matrix algorithm

来源：评论

学校读者我要写书评

暂无评论

Topology optimization of AC/DC hybrid distribution network with energy router based on power flow calculation

引用

ENERGY REPORTS 2022年 8卷 1622-1638页

作者： Zhu, Liuzhu Rong, Xiuting Zhao, Jie Zhang, Hui Zhang, Huaixun Jia, Chenyiyang Ma, Gaoyuan State Grid Anhui Elect Power Co LTD Econ Res Inst Hefei 230022 Peoples R China Wuhan Univ Sch Elect Engn & Automat Wuhan 430072 Peoples R China

The application of energy routers will play an important role in the future AC/DC allocation networks. Based on the characteristics of energy routers, this article analyzes the application scenarios of several distribution network topologies and establishes a equivalent steady-state model of the allocation network based on energy routers. Two important evaluation indicators are selected in the equivalent model and optimized according to the matrix algorithm and adaptive multiplier. After optimization, the model is used for power flow distribution calculation and network loss calculation. The numerical analysis outcomes show that the application of this device can greatly improve the value of voltage of the distribution network and reduce the loss of the power grid. (C) 2022 The Author(s). Published by Elsevier Ltd.

关键词： Energy router Power flow calculation Adaptive multiplier matrix algorithm

来源：评论

学校读者我要写书评

暂无评论

Stepwise assembling of polypeptide chain energy distributions

引用

COMPUTERS & CHEMISTRY 2001年第2期25卷 145-159页

作者： Jacchieri, SG Fdn Antonio Prudente BR-01509900 Sao Paulo Brazil

The principles and application of conformational analysis software that makes use of a new algorithm are described. It is known that the existence of a local energy minimum in the energy landscape is in general related to the clustering of polypeptide chain conformations near that energy value or, in other words, to a high density of states. A criterion based on this principle is part of an algorithm employed to select subsets of polypeptide chain conformations in broad energy ranges. Chain fragments belonging to these subsets are then combined to build larger polypeptide chains and the corresponding energy distributions. The functionality of the various operations employed in the process is described and the FORTRAN 77 sourer code that defines the algorithm is listed. The methodology is illustrated with a calculation involving three chain fragments belonging to the cellular prion protein (PrPC). (C) 2001 Elsevier Science Ltd. All rights reserved.

关键词： conformational analysis density of states potential energy landscape local energy minima matrix algorithm

来源：评论

学校读者我要写书评

暂无评论

SOLVING ELLIPTIC FINITE ELEMENT SYSTEMS IN NEAR-LINEAR TIME WITH SUPPORT PRECONDITIONERS

引用

SIAM JOURNAL ON NUMERICAL ANALYSIS 2008年第6期46卷 3264-3284页

作者： Boman, Erik G. Hendrickson, Bruce Vavasis, Stephen Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 2W2 Canada Sandia Natl Labs Scalable Algorithms Dept Albuquerque NM 87185 USA Sandia Natl Labs Dept Informat & Comp Sci Albuquerque NM 87185 USA

We consider linear systems arising from the use of the finite element method for solving scalar linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by symmetric diagonally dominant matrices. Our framework for de. ning matrix approximation is support theory. Significant graph theoretic work has already been developed in the support framework for preconditioners in the diagonally dominant case, and, in particular, it is known that such systems can be solved with iterative methods in nearly linear time. Thus, our approximation result implies that these graph theoretic techniques can also solve a class of finite element problems in nearly linear time. We show that the support number bounds, which control the number of iterations in the preconditioned iterative solver, depend on mesh quality measures but not on the problem size or shape of the domain.

关键词： finite elements preconditioning matrix algorithm support graph diagonal dominance

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：