Research on Scheduling Strategy of Flexible Interconnection Distribution Network Considering Distributed Photovoltaic and Hydrogen Energy Storage

Distributed photovoltaic(PV)is one of the important power sources for building a new power system with new energy as the main body.The rapid development of distributed PV has brought new challenges to the operation of distribution networks.In order to improve the absorption ability of large-scale distributed PV access to the distribution network,the AC/DC hybrid distribution network is constructed based on flexible interconnection technology,and a coordinated scheduling strategy model of hydrogen energy storage(HS)and distributed PV is established.Firstly,the mathematical model of distributed PV and HS system is established,and a comprehensive energy storage system combining seasonal hydrogen energy storage(SHS)and battery(BT)is proposed.Then,a flexible interconnected distribution network scheduling optimization model is established to minimize the total active power loss,voltage deviation and system operating cost.Finally,simulation analysis is carried out on the improved IEEE33 node,the NSGA-II algorithm is used to solve specific examples,and the optimal scheduling results of the comprehensive economy and power quality of the distribution network are obtained.Compared with the method that does not consider HS and flexible interconnection technology,the network loss and voltage deviation of this method are lower,and the total system cost can be reduced by 3.55%,which verifies the effectiveness of the proposed method.

Calculation connectivity reliability of road networks based on recursive decomposition arithmetic

In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.

Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network

To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.

Development of Network Interconnection in China

This paper introduces the current situation of China power industry and interconnection, the necessity to develop interconnection, the principle of nationwide interconnection and the key technologies to be studiedinclude HVDC and FACTS. The paper also discusses thefeasibility of 750 kV to be used in the northwest.regionand to speed up research and development of nighervoltage level in other regions of China, as well as scl-ence and technical innovation for transmission and dis-tribution projects.

FOUR-PARAMETER AUTOMATIC TRANSMISSION TECHNOLOGY FOR CONSTRUCTION VEHICLE BASED ON ELMAN RECURSIVE NEURAL NETWORK

From the viewpoint of energy saving and improving transmission efficiency, the ZL50E wheel loader is taken as the study object. And the system model is analyzed based on the transmission system of the construction vehicle. A new four-parameter shift schedule is presented, which can keep the torque converter working in the high efficiency area. The control algorithm based on the Elman recursive neural network is applied, and four-parameter control system is developed which is based on industrial computer. The system is used to collect data accurately and control 4D180 power-shift gearbox of ZL50E wheel loader shift timely. An experiment is done on automatic transmission test-bed, and the result indicates that the control system could reliably and safely work and improve the efficiency of hydraulic torque converter. Four-parameter shift strategy that takes into account the power consuming of the working pump has important operating significance and reflects the actual working status of construction vehicle.

Research on reliability index of a large communication network with domain partition and interconnection

In order to indicate the performances of a large-scale communication network with domain partition and interconnection today, a kind of reliability index weighed by normalized capacity is defined. Based on the route rules of network with domain partition and interconnection, the interconnection indexes among the nodes within the domain and among the domains are given from several aspects. It is expatiated on that the index can thoroughly represent the effect on the reliability index of the objective factor and the subjective measures of the designer, which obeys the route rules of a network with domain partition and interconnection. It is discussed that the defined index is rational and compatible with the traditional index.

An Improved Interconnection Network Based on NIN

The Novel Interconnection Network (NIN) based on inverted-graph topology and crossbar switch is a kind of lower latency and higher throughput interconnection network. But it has a vital disadvantage, high hardware complexity. In order to reduce system hardware cost, an improved NIN (ININ) structure is proposed. As same as NIN, ININ has constant network diameter. Besides of keeping advantages of NIN, hardware cost of ININ is lower than NIN. Furthermore, we design a new deadlock-free routing algorithm for the improved NIN. Key words NIN - ININ - inverted-graph interconnection network - hardware complexity - network band-width - network throughput CLC number TP 302 Foundation item: Supported by the National Natural Science Foundation of China (69873016)Biography: Li Fei (1974-), male, Ph. D candidate, research direction: architecture of interconnection network.

Recursive recurrent neural network:A novel model for manipulator control with different levels of physical constraints

Manipulators actuate joints to let end effectors to perform precise path tracking tasks.Recurrent neural network which is described by dynamic models with parallel processing capability,is a powerful tool for kinematic control of manipulators.Due to physical limitations and actuation saturation of manipulator joints,the involvement of joint constraints for kinematic control of manipulators is essential and critical.However,current existing manipulator control methods based on recurrent neural networks mainly handle with limited levels of joint angular constraints,and to the best of our knowledge,methods for kinematic control of manipulators with higher order joint constraints based on recurrent neural networks are not yet reported.In this study,for the first time,a novel recursive recurrent network model is proposed to solve the kinematic control issue for manipulators with different levels of physical constraints,and the proposed recursive recurrent neural network can be formulated as a new manifold system to ensure control solution within all of the joint constraints in different orders.The theoretical analysis shows the stability and the purposed recursive recurrent neural network and its convergence to solution.Simulation results further demonstrate the effectiveness of the proposed method in end‐effector path tracking control under different levels of joint constraints based on the Kuka manipulator system.Comparisons with other methods such as the pseudoinverse‐based method and conventional recurrent neural network method substantiate the superiority of the proposed method.

Coordinated planning for flexible interconnection and energy storage system in low-voltage distribution networks to improve the accommodation capacity of photovoltaic

The increasing proportion of distributed photovoltaics(DPVs)and electric vehicle charging stations in low-voltage distribution networks(LVDNs)has resulted in challenges such as distribution transformer overloads and voltage violations.To address these problems,we propose a coordinated planning method for flexible interconnections and energy storage systems(ESSs)to improve the accommodation capacity of DPVs.First,the power-transfer characteristics of flexible interconnection and ESSs are analyzed.The equipment costs of the voltage source converters(VSCs)and ESSs are also analyzed comprehensively,considering the differences in installation and maintenance costs for different installation locations.Second,a bilevel programming model is established to minimize the annual comprehensive cost and yearly total PV curtailment capacity.Within this framework,the upper-level model optimizes the installation locations and capacities of the VSCs and ESSs,whereas the lower-level model optimizes the operating power of the VSCs and ESSs.The proposed model is solved using a non-dominated sorting genetic algorithm with an elite strategy(NSGA-II).The effectiveness of the proposed planning method is validated through an actual LVDN scenario,which demonstrates its advantages in enhancing PV accommodation capacity.In addition,the economic benefits of various planning schemes with different flexible interconnection topologies and different PV grid-connected forms are quantitatively analyzed,demonstrating the adaptability of the proposed coordinated planning method.

An improved cut-based recursive decomposition algorithm for reliability analysis of networks

In this paper, an improved cut-based recursive decomposition algorithm is proposed for lifeline networks. First, a complementary structural function is established and three theorems are presented as a premise of the proposed algorithm. Taking the minimal cut of a network as decomposition policy, the proposed algorithm constructs a recursive decomposition process. During the decomposition, both the disjoint minimal cut set and the disjoint minimal path set are simultaneously enumerated. Therefore, in addition to obtaining an accurate value after decomposing all disjoint minimal cuts and disjoint minimal paths, the algorithm provides approximate results which satisfy a prescribed error bound using a probabilistic inequality. Two example networks, including a large urban gas system, are analyzed using the proposed algorithm. Meanwhile, a part of the results are compared with the results obtained by a path-based recursive decomposition algorithm. These results show that the proposed algorithm provides a useful probabilistic analysis method for the reliability evaluation of lifeline networks and may be more suitable for networks where the edges have low reliabilities.

An new representation for interconnection network structures

An important theoretic interest is to study the relations between different interconnection networks, and to compare the capability and performance of the network structures. The most popular way to do the investigation is network emulation. Based on the classical voltage graph theory, the authors develop a new representation scheme for interconnection network structures. The new approach is a combination of algebraic methods and combinatorial methods. The results demonstrate that the voltage graph theory is a powerful tool for representing well known interconnection networks and in implementing optimal network emulation algorithms, and in particular, show that all popular interconnection networks have very simple and intuitive representations under the new scheme. The new representation scheme also offers powerful tools for the study of network routings and emulations. For example, we present very simple constructions for optimal network emulations from the cube connected cycles networks to the butterfly networks, and from the butterfly networks to the hypercube networks. Compared with the most popular way of network emulation, this new scheme is intuitive and easy to realize, and easy to apply to other network structures.

Design and verification of a satellite-terrestrial integrated IP network model for the Global Energy Interconnection

In order to meet the pressing demand for wide-area communication required by the Global Energy Interconnection(GEI),accelerating the construction of satellite-terrestrial Integra怕d networks that can achieve network extension and seamless global coverage has become the focus of power communication tech no logy development.In this study,we propose a satellite-terrestrial integrated network model that can support interconnection and interoperation on the IP layer between the satellite system and the怕rrestrial segment of the existing power communication system.First,the composition and function of the satellite-terrestrial collaborative network are explained.Then,the IP-based protocol stack is described,and a typical applicati on experime nt is con ducted to illustrate the particular process of this protocol stack.Fin ally,a use case of IP interconn ection that depends on GEO satellite communication is detailed.The experime ntal study has showed that the satellite-terrestrial collaborative network can efficiently support various IP applications for the GEI.

An improved recursive decomposition algorithm for reliability evaluation of lifeline networks

The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical approach to evaluate the seismic reliability of large lifeline systems is presented. The proposed algorithm takes the shortest path from the source to the sink of a network as decomposition policy. Using the Boolean laws of set operation and the probabilistic operation principal, a recursive decomposition process is constructed in which the disjoint minimal path set and the disjoint minimal cut set are simultaneously enumerated. As the result, a probabilistic inequality can be used to provide results that satisfy a prescribed error bound. During the decomposition process, different from the original recursive decomposition algorithm which only removes edges to simplify the network, the proposed algorithm simplifies the network by merging nodes into sources and removing edges. As a result, the proposed algorithm can obtain simpler networks. Moreover, for a network owning s-independent components in its component set, two network reduction techniques are introduced to speed up the proposed algorithm. A series of case studies, including an actual water distribution network and a large urban gas system, are calculated using the proposed algorithm. The results indicate that the proposed algorithm provides a useful probabilistic analysis method for the seismic reliability evaluation of lifeline networks.

Some LCP Decompositions of Multistage Interconnection Networks

Some useful layered cross product decompositons are derived both for general bit permutation networks and for(2n-1)-stage multistage interconnection networks.Several issues in related works are clarified and the rearrangeability of some interesting networks are considered.In particular, the rearrangeability of one class of networks is formulated as a new type of combinatorial design problmes.

Multilayer Hex-Cells: A New Class of Hex-Cell Interconnection Networks for Massively Parallel Systems

Scalability is an important issue in the design of interconnection networks for massively parallel systems. In this paper a scalable class of interconnection network of Hex-Cell for massively parallel systems is introduced. It is called Multilayer Hex-Cell (MLH). A node addressing scheme and routing algorithm are also presented and discussed. An interesting feature of the proposed MLH is that it maintains a constant network degree regardless of the increase in the network size degree which facilitates modularity in building blocks of scalable systems. The new addressing node scheme makes the proposed routing algorithm simple and efficient in terms of that it needs a minimum number of calculations to reach the destination node. Moreover, the diameter of the proposed MLH is less than Hex-Cell network.

Image Deraining for UAV Using Split Attention Based Recursive Network

Images captured in rainy days suffer from noticeable degradation of scene visibility.Unmanned aerial vehicles(UAVs),as important outdoor image acquisition systems,demand a proper rain removal algorithm to improve visual perception quality of captured images as well as the performance of many subsequent computer vision applications.To deal with rain streaks of different sizes and directions,this paper proposes to employ convolutional kernels of different sizes in a multi-path structure.Split attention is leveraged to enable communication across multiscale paths at feature level,which allows adaptive receptive field to tackle complex situations.We incorporate the multi-path convolution and the split attention operation into the basic residual block without increasing the channels of feature maps.Moreover,every block in our network is unfolded four times to compress the network volume without sacrificing the deraining performance.The performance on various benchmark datasets demonstrates that our method outperforms state-of-the-art deraining algorithms in both numerical and qualitative comparisons.

Algorithm and Performance Analysis of Optical Multistage Interconnection Network

A sorting algorithm based on the Batcher' s algorithm is presented. An 8X8multistage interconnection network(MIN) is constructed. Applying wavelength division multiplexing(WDM) technology and integrating control mode, the designed network can realize non-blockingcommunication. The time delay of the MIN and the switches needed are also analyzed in theory, thededuced result conforms that the MIN designed previously is feasible. In the case of the samecommunication quality guaranteed, MIN uses the least switches and completes the communication moreefficiently.

MSONoC: a non-blocking optical interconnection network for inter cluster communication

Electric router is widely used for multi-core system to interconnect each other. However, with the increasing number of processor cores, the probability of communication conflict between processor cores increases, and the data delay increases dramatically. With the advent of optical router, the traditional electrical interconnection mode has changed to optical interconnection mode. In the packet switched optical interconnection network, the data communication mechanism consists of 3 processes: link establishment, data transmission and link termination, but the circuit-switched data transmission method greatly limits the utilization of resources. The number of micro-ring resonators in the on-chip large-scale optical interconnect network is an important parameter affecting the insertion loss. The proposed λ-route, GWOR, Crossbar structure has a large overall network insertion loss due to the use of many micro-ring resonators. How to use the least micro-ring resonator to realize non-blocking communication between multiple cores has been a research hotspot. In order to improve bandwidth and reduce access latency, an optical interconnection structure called multilevel switching optical network on chip(MSONoC) is proposed in this paper. The broadband micro-ring resonators(BMRs) are employed to reduce the number of micro-ring resonators(MRs) in the network, and the structure can provide the service of non-blocking point to point communication with the wavelength division multiplexing(WDM) technology. The results show that compared to λ-route, GWOR, Crossbar and the new topology structure, the number of micro-ring resonators of MSONoC are reduced by 95.5%, 95.5%, 87.5%, and 60% respectively. The insertion loss of the minimum link of new topology, mesh and MSONoC structure is 0.73 dB, 0.725 dB and 0.38 dB.

Research on the Method of Implementing Named Data Network Interconnection Based on IP Network

In order to extend the application scope of NDN and realize the transmission of different NDNs across IP networks,a method for interconnecting NDN networks distributed in different areas with IP networks is proposed.Firstly,the NDN data resource is located by means of the DNS mechanism,and the gateway IP address of the NDN network where the data resource is located is found.Then,the transmission between different NDNs across the IP network is implemented based on the tunnel technology.In addition,in order to achieve efficient and fast NDN data forwarding,we have added a small number of NDN service nodes in the IP network,and proposed an adaptive probabilistic forwarding strategy and a link cost function-based forwarding strategy to make NDN data obtaining the cache service provided by the NDN service node as much as possible.The results of analysis and simulation experiments show that,the interconnectionmethod of NDN across IP network proposed is generally effective and feasible,and the link cost function forwarding strategy is better than the adaptive probability forwarding strategy.