简介:AnapproximationalgorithmispresentedforaugmentinganundirectedweightedgraphtoaK-edge-connectedgraph.Thealgorithmisusefulfordesigningareliablenetwork.
简介:InviewofK-faulttestability,thetopologicalconstructionofapracticalcircuitisfarfromideal.Inordertoimprovethetestabilityofacircuit,wemayincreasethenumberofaccessiblenodesorusethemulti-excitationmethod.Effectivenessofthesemethodsandthefeasibilityofchoosingaccessiblenodesarediscussedindetail.Theconditionsformulti-excitationtestabilityarepresented.
简介:Higher-orderalmostcyclostationarycomplexprocessesarecomplexrandomsignalswithalmostperiodicallytime-varyingstatistics,whichisimportanttotheresearchofnon-Gaussiansignalsininformationsystem.Intinspaper,smoothedpolyperiodogramsareproposedforrelatedtocyclicpolyspectralestimationandareshowntobeconsistentandasymptoticallycomplexnormal.Asymptoticcovarianceexpressionsarederivedalongwiththeircomputableforms.