Oil-pressboard system is the main insulation form of oil-immersed transformers,which is prone to partial discharge(PD)and subsequent faults due to contamination or moisture ingress.To investigate the evolutionary char...Oil-pressboard system is the main insulation form of oil-immersed transformers,which is prone to partial discharge(PD)and subsequent faults due to contamination or moisture ingress.To investigate the evolutionary characteristics of PD streamers under varying voltages and insulation dimensions,streamer images were captured using a high-speed camera system.An image restoration algorithm was proposed,which integrates the Retinex theory with bilateral filtering and k-dimensional tree(KD-tree)-based methods.This algorithm allows for the enhancement of image contrast while ensuring that edge details are preserved and fragmented streamer channels are reconnected.By varying the applied voltage,needle-plate gap length and pressboard thickness,patterns in streamer area and the number of bifurcations were analysed.These variations were microscopically explained in terms of electric field distortion and the dielectric matching between oil and pressboard insulation.It was found that larger streamer areas are produced by higher voltages and longer needle-plate gaps.Additionally,under elevated voltages or prolonged energisation,multiple streamer patterns are generated due to the presence of photoionisation and bubble formation.Furthermore,an increased number of bifurcations is observed with longer gaps and more uniform dielectric matching between oil and pressboard.The results obtained here enrich the evolution mechanism of PD and provide theoretical guidance for the dielectric matching of transformer oil and pressboard.展开更多
The surface charge accumulation on insulators is one of the important factors that limit the development of high-voltage direct current(HVDC)gas insulated transmission line(GIL),and the accurate measurement of surface...The surface charge accumulation on insulators is one of the important factors that limit the development of high-voltage direct current(HVDC)gas insulated transmission line(GIL),and the accurate measurement of surface charge is the basis to explore its physical mechanism.In this paper,to solve the problem of measured potential attenuation during on-line measurement of an electrostatic capacitance probe,a surface potential restoration algorithm(SPR)is proposed,and the effectiveness of the pro-posed algorithm is verified by the equivalent circuit simulation and the experiment.The results show that:the continuous charge leakage on the induction electrode during on-line measurement will cause the probe output potential to attenuate with time,and the measurement error caused by this cannot be ignored.Meanwhile,it has been proved that the proposed SPR algorithm can effectively restore the surface potential.The maximum error between the restored value and the real value is about 3.4%,and the minimum error is only 0.6%.In addition,the surface potential restoration accuracy of the SPR algorithm is negatively correlated with the ratio between the sampling intervalΔt and the probe time constantτ,that is,the smaller the value ofΔt/τ,the higher the surface potential restoration accuracy.This study can provide a reference for the on-line measurement technology of DC GIL insulator surface charge density.展开更多
The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterpri...The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterprise data center requires a significant amount of time and human effort. Following a major disruption, the recovery process involves multiple stages, and during each stage, the partially recovered infrastructures can provide limited services to users at some degraded service level. However, how fast and efficiently an enterprise infrastructure can be recovered de- pends on how the recovery mechanism restores the disrupted components, considering the inter-dependencies between services, along with the limitations of expert human operators. The entire problem turns out to be NP- hard and rather complex, and we devise an efficient meta-heuristic to solve the problem. By considering some real-world examples, we show that the proposed meta-heuristic provides very accurate results, and still runs 600-2800 times faster than the optimal solution obtained from a general purpose mathematical solver [1].展开更多
We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is forme...We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is formed on the basis of any of the possible algorithms for determining the distances between DNA chains, as well as any specific object of study. At the same time, for example, the practical programming results show that on an average modern computer, it takes about a day to build such a 30 × 30 matrix for mnDNAs using the Needleman-Wunsch algorithm;therefore, for such a 300 × 300 matrix, about 3 months of continuous computer operation is expected. Thus, even for a relatively small number of species, calculating the distance matrix on conventional computers is hardly feasible and the supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains, then we publish algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. Previously, we used the method of branches and boundaries, but in this paper we propose to use another new algorithm for restoring the distance matrix for DNA chains. Our recent work has shown that even greater improvement in the quality of the algorithm can often be achieved without improving the auxiliary heuristics of the branches and boundaries method. Thus, we are improving the algorithms that formulate the greedy function of this method only. .展开更多
基金supported by the National Natural Science Foundation of China(Grant No.52577171)the Natural Science Foundation of Shandong Province(Grant No.ZR2024ME229).
摘要Oil-pressboard system is the main insulation form of oil-immersed transformers,which is prone to partial discharge(PD)and subsequent faults due to contamination or moisture ingress.To investigate the evolutionary characteristics of PD streamers under varying voltages and insulation dimensions,streamer images were captured using a high-speed camera system.An image restoration algorithm was proposed,which integrates the Retinex theory with bilateral filtering and k-dimensional tree(KD-tree)-based methods.This algorithm allows for the enhancement of image contrast while ensuring that edge details are preserved and fragmented streamer channels are reconnected.By varying the applied voltage,needle-plate gap length and pressboard thickness,patterns in streamer area and the number of bifurcations were analysed.These variations were microscopically explained in terms of electric field distortion and the dielectric matching between oil and pressboard insulation.It was found that larger streamer areas are produced by higher voltages and longer needle-plate gaps.Additionally,under elevated voltages or prolonged energisation,multiple streamer patterns are generated due to the presence of photoionisation and bubble formation.Furthermore,an increased number of bifurcations is observed with longer gaps and more uniform dielectric matching between oil and pressboard.The results obtained here enrich the evolution mechanism of PD and provide theoretical guidance for the dielectric matching of transformer oil and pressboard.
基金supported by National Natural Science Foundation of China(Grant 51677113)Science and Technology Commission of Shanghai(Grant 20020500800).
摘要The surface charge accumulation on insulators is one of the important factors that limit the development of high-voltage direct current(HVDC)gas insulated transmission line(GIL),and the accurate measurement of surface charge is the basis to explore its physical mechanism.In this paper,to solve the problem of measured potential attenuation during on-line measurement of an electrostatic capacitance probe,a surface potential restoration algorithm(SPR)is proposed,and the effectiveness of the pro-posed algorithm is verified by the equivalent circuit simulation and the experiment.The results show that:the continuous charge leakage on the induction electrode during on-line measurement will cause the probe output potential to attenuate with time,and the measurement error caused by this cannot be ignored.Meanwhile,it has been proved that the proposed SPR algorithm can effectively restore the surface potential.The maximum error between the restored value and the real value is about 3.4%,and the minimum error is only 0.6%.In addition,the surface potential restoration accuracy of the SPR algorithm is negatively correlated with the ratio between the sampling intervalΔt and the probe time constantτ,that is,the smaller the value ofΔt/τ,the higher the surface potential restoration accuracy.This study can provide a reference for the on-line measurement technology of DC GIL insulator surface charge density.
摘要The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterprise data center requires a significant amount of time and human effort. Following a major disruption, the recovery process involves multiple stages, and during each stage, the partially recovered infrastructures can provide limited services to users at some degraded service level. However, how fast and efficiently an enterprise infrastructure can be recovered de- pends on how the recovery mechanism restores the disrupted components, considering the inter-dependencies between services, along with the limitations of expert human operators. The entire problem turns out to be NP- hard and rather complex, and we devise an efficient meta-heuristic to solve the problem. By considering some real-world examples, we show that the proposed meta-heuristic provides very accurate results, and still runs 600-2800 times faster than the optimal solution obtained from a general purpose mathematical solver [1].
摘要We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is formed on the basis of any of the possible algorithms for determining the distances between DNA chains, as well as any specific object of study. At the same time, for example, the practical programming results show that on an average modern computer, it takes about a day to build such a 30 × 30 matrix for mnDNAs using the Needleman-Wunsch algorithm;therefore, for such a 300 × 300 matrix, about 3 months of continuous computer operation is expected. Thus, even for a relatively small number of species, calculating the distance matrix on conventional computers is hardly feasible and the supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains, then we publish algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. Previously, we used the method of branches and boundaries, but in this paper we propose to use another new algorithm for restoring the distance matrix for DNA chains. Our recent work has shown that even greater improvement in the quality of the algorithm can often be achieved without improving the auxiliary heuristics of the branches and boundaries method. Thus, we are improving the algorithms that formulate the greedy function of this method only. .