This paper proposes a distribution network reconfiguration (DNR) continuous method to reduce loss, balancing load, eliminating overload and improving power quality. When certain coding rule reduces the dimension radius of variable confidence interval, first type non effective solution is avoided in probability through rules algorithm characteristics, second completely compared with expert base,...

When using the Born–Oppenheimer approximation for molecular systems, one encounters a quantum mechanical Hamiltonian for the electrons that depends on several parameters that describe the positions of the nuclei. As these parameters are varied, the spectrum of the electron Hamiltonian may vary. In particular, discrete eigenvalues may approach very close to one another at “avoided crossings” of ...

the crossing number of a graph  is the minimum number of edge crossings over all possible drawings of  in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.

A simple iterative scheme is proposed for locating the parameter values which a 2-parameter family of real symmetric matrices has double eigenvalue. The convergence proved to be quadratic. An extension complex Hermitian (with 3 parameters) and location triple eigenvalues (5 parameters matrices) also described. Algorithm illustrated in several examples: family, with an "avoided crossing" (no cov...

Landau-Zener physics is often exploited to generate quantum logic gates and perform state initialization readout. The quality of these operations can be degraded by noise fluctuations in the energy gap at avoided crossing. We leverage a recently discovered correspondence between qubit evolution space curves three dimensions design noise-robust sweeps through an In case where crossing purely noi...